[22/47] hbase-site git commit: Published site at 118b0746849c886fc64b0a53014f3186e2db4d9d.

git-site-role Sun, 07 Oct 2018 07:53:15 -0700
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/9b6ca5d1/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.Entry.html
----------------------------------------------------------------------
diff --git 
a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.Entry.html
 
b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.Entry.html
deleted file mode 100644
index 6253d3f..0000000
--- 
a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/wal/ProcedureWALFormatReader.Entry.html
+++ /dev/null
@@ -1,936 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
"http://www.w3.org/TR/html4/loose.dtd";>
-<html lang="en">
-<head>
-<title>Source code</title>
-<link rel="stylesheet" type="text/css" 
href="../../../../../../../../stylesheet.css" title="Style">
-</head>
-<body>
-<div class="sourceContainer">
-<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a>
-<span class="sourceLineNo">002</span> * Licensed to the Apache Software 
Foundation (ASF) under one<a name="line.2"></a>
-<span class="sourceLineNo">003</span> * or more contributor license 
agreements.  See the NOTICE file<a name="line.3"></a>
-<span class="sourceLineNo">004</span> * distributed with this work for 
additional information<a name="line.4"></a>
-<span class="sourceLineNo">005</span> * regarding copyright ownership.  The 
ASF licenses this file<a name="line.5"></a>
-<span class="sourceLineNo">006</span> * to you under the Apache License, 
Version 2.0 (the<a name="line.6"></a>
-<span class="sourceLineNo">007</span> * "License"); you may not use this file 
except in compliance<a name="line.7"></a>
-<span class="sourceLineNo">008</span> * with the License.  You may obtain a 
copy of the License at<a name="line.8"></a>
-<span class="sourceLineNo">009</span> *<a name="line.9"></a>
-<span class="sourceLineNo">010</span> *     
http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
-<span class="sourceLineNo">011</span> *<a name="line.11"></a>
-<span class="sourceLineNo">012</span> * Unless required by applicable law or 
agreed to in writing, software<a name="line.12"></a>
-<span class="sourceLineNo">013</span> * distributed under the License is 
distributed on an "AS IS" BASIS,<a name="line.13"></a>
-<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF 
ANY KIND, either express or implied.<a name="line.14"></a>
-<span class="sourceLineNo">015</span> * See the License for the specific 
language governing permissions and<a name="line.15"></a>
-<span class="sourceLineNo">016</span> * limitations under the License.<a 
name="line.16"></a>
-<span class="sourceLineNo">017</span> */<a name="line.17"></a>
-<span class="sourceLineNo">018</span><a name="line.18"></a>
-<span class="sourceLineNo">019</span>package 
org.apache.hadoop.hbase.procedure2.store.wal;<a name="line.19"></a>
-<span class="sourceLineNo">020</span><a name="line.20"></a>
-<span class="sourceLineNo">021</span>import 
org.apache.hbase.thirdparty.com.google.protobuf.InvalidProtocolBufferException;<a
 name="line.21"></a>
-<span class="sourceLineNo">022</span><a name="line.22"></a>
-<span class="sourceLineNo">023</span>import java.io.IOException;<a 
name="line.23"></a>
-<span class="sourceLineNo">024</span><a name="line.24"></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.yetus.audience.InterfaceAudience;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import 
org.apache.yetus.audience.InterfaceStability;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import org.slf4j.Logger;<a 
name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.slf4j.LoggerFactory;<a 
name="line.29"></a>
-<span class="sourceLineNo">030</span>import 
org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import 
org.apache.hadoop.hbase.procedure2.ProcedureUtil;<a name="line.31"></a>
-<span class="sourceLineNo">032</span>import 
org.apache.hadoop.hbase.procedure2.store.ProcedureStore.ProcedureIterator;<a 
name="line.32"></a>
-<span class="sourceLineNo">033</span>import 
org.apache.hadoop.hbase.procedure2.store.ProcedureStoreTracker;<a 
name="line.33"></a>
-<span class="sourceLineNo">034</span>import 
org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a 
name="line.34"></a>
-<span class="sourceLineNo">035</span>import 
org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos.ProcedureWALEntry;<a
 name="line.35"></a>
-<span class="sourceLineNo">036</span><a name="line.36"></a>
-<span class="sourceLineNo">037</span>/**<a name="line.37"></a>
-<span class="sourceLineNo">038</span> * Helper class that loads the procedures 
stored in a WAL<a name="line.38"></a>
-<span class="sourceLineNo">039</span> */<a name="line.39"></a>
-<span class="sourceLineNo">040</span>@InterfaceAudience.Private<a 
name="line.40"></a>
-<span class="sourceLineNo">041</span>@InterfaceStability.Evolving<a 
name="line.41"></a>
-<span class="sourceLineNo">042</span>public class ProcedureWALFormatReader {<a 
name="line.42"></a>
-<span class="sourceLineNo">043</span>  private static final Logger LOG = 
LoggerFactory.getLogger(ProcedureWALFormatReader.class);<a name="line.43"></a>
-<span class="sourceLineNo">044</span><a name="line.44"></a>
-<span class="sourceLineNo">045</span>  // 
==============================================================================================<a
 name="line.45"></a>
-<span class="sourceLineNo">046</span>  //  We read the WALs in reverse order 
from the newest to the oldest.<a name="line.46"></a>
-<span class="sourceLineNo">047</span>  //  We have different entry types:<a 
name="line.47"></a>
-<span class="sourceLineNo">048</span>  //   - INIT: Procedure submitted by the 
user (also known as 'root procedure')<a name="line.48"></a>
-<span class="sourceLineNo">049</span>  //   - INSERT: Children added to the 
procedure &lt;parentId&gt;:[&lt;childId&gt;, ...]<a name="line.49"></a>
-<span class="sourceLineNo">050</span>  //   - UPDATE: The specified procedure 
was updated<a name="line.50"></a>
-<span class="sourceLineNo">051</span>  //   - DELETE: The procedure was 
removed (finished/rolledback and result TTL expired)<a name="line.51"></a>
-<span class="sourceLineNo">052</span>  //<a name="line.52"></a>
-<span class="sourceLineNo">053</span>  // In the WAL we can find multiple 
times the same procedure as UPDATE or INSERT.<a name="line.53"></a>
-<span class="sourceLineNo">054</span>  // We read the WAL from top to bottom, 
so every time we find an entry of the<a name="line.54"></a>
-<span class="sourceLineNo">055</span>  // same procedure, that will be the 
"latest" update (Caveat: with multiple threads writing<a name="line.55"></a>
-<span class="sourceLineNo">056</span>  // the store, this assumption does not 
hold).<a name="line.56"></a>
-<span class="sourceLineNo">057</span>  //<a name="line.57"></a>
-<span class="sourceLineNo">058</span>  // We keep two in-memory maps:<a 
name="line.58"></a>
-<span class="sourceLineNo">059</span>  //  - localProcedureMap: is the map 
containing the entries in the WAL we are processing<a name="line.59"></a>
-<span class="sourceLineNo">060</span>  //  - procedureMap: is the map 
containing all the procedures we found up to the WAL in process.<a 
name="line.60"></a>
-<span class="sourceLineNo">061</span>  // localProcedureMap is merged with the 
procedureMap once we reach the WAL EOF.<a name="line.61"></a>
-<span class="sourceLineNo">062</span>  //<a name="line.62"></a>
-<span class="sourceLineNo">063</span>  // Since we are reading the WALs in 
reverse order (newest to oldest),<a name="line.63"></a>
-<span class="sourceLineNo">064</span>  // if we find an entry related to a 
procedure we already have in 'procedureMap' we can discard it.<a 
name="line.64"></a>
-<span class="sourceLineNo">065</span>  //<a name="line.65"></a>
-<span class="sourceLineNo">066</span>  // The WAL is append-only so the last 
procedure in the WAL is the one that<a name="line.66"></a>
-<span class="sourceLineNo">067</span>  // was in execution at the time we 
crashed/closed the server.<a name="line.67"></a>
-<span class="sourceLineNo">068</span>  // Given that, the procedure replay 
order can be inferred by the WAL order.<a name="line.68"></a>
-<span class="sourceLineNo">069</span>  //<a name="line.69"></a>
-<span class="sourceLineNo">070</span>  // Example:<a name="line.70"></a>
-<span class="sourceLineNo">071</span>  //    WAL-2: [A, B, A, C, D]<a 
name="line.71"></a>
-<span class="sourceLineNo">072</span>  //    WAL-1: [F, G, A, F, B]<a 
name="line.72"></a>
-<span class="sourceLineNo">073</span>  //    Replay-Order: [D, C, A, B, F, 
G]<a name="line.73"></a>
-<span class="sourceLineNo">074</span>  //<a name="line.74"></a>
-<span class="sourceLineNo">075</span>  // The "localProcedureMap" keeps a 
"replayOrder" list. Every time we add the<a name="line.75"></a>
-<span class="sourceLineNo">076</span>  // record to the map that record is 
moved to the head of the "replayOrder" list.<a name="line.76"></a>
-<span class="sourceLineNo">077</span>  // Using the example above:<a 
name="line.77"></a>
-<span class="sourceLineNo">078</span>  //    WAL-2 
localProcedureMap.replayOrder is [D, C, A, B]<a name="line.78"></a>
-<span class="sourceLineNo">079</span>  //    WAL-1 
localProcedureMap.replayOrder is [F, G]<a name="line.79"></a>
-<span class="sourceLineNo">080</span>  //<a name="line.80"></a>
-<span class="sourceLineNo">081</span>  // Each time we reach the WAL-EOF, the 
"replayOrder" list is merged/appended in 'procedureMap'<a name="line.81"></a>
-<span class="sourceLineNo">082</span>  // so using the example above we end up 
with: [D, C, A, B] + [F, G] as replay order.<a name="line.82"></a>
-<span class="sourceLineNo">083</span>  //<a name="line.83"></a>
-<span class="sourceLineNo">084</span>  //  Fast Start: INIT/INSERT record and 
StackIDs<a name="line.84"></a>
-<span class="sourceLineNo">085</span>  // 
---------------------------------------------<a name="line.85"></a>
-<span class="sourceLineNo">086</span>  // We have two special records, INIT 
and INSERT, that track the first time<a name="line.86"></a>
-<span class="sourceLineNo">087</span>  // the procedure was added to the WAL. 
We can use this information to be able<a name="line.87"></a>
-<span class="sourceLineNo">088</span>  // to start procedures before reaching 
the end of the WAL, or before reading all WALs.<a name="line.88"></a>
-<span class="sourceLineNo">089</span>  // But in some cases, the WAL with that 
record can be already gone.<a name="line.89"></a>
-<span class="sourceLineNo">090</span>  // As an alternative, we can use the 
stackIds on each procedure,<a name="line.90"></a>
-<span class="sourceLineNo">091</span>  // to identify when a procedure is 
ready to start.<a name="line.91"></a>
-<span class="sourceLineNo">092</span>  // If there are gaps in the sum of the 
stackIds we need to read more WALs.<a name="line.92"></a>
-<span class="sourceLineNo">093</span>  //<a name="line.93"></a>
-<span class="sourceLineNo">094</span>  // Example (all procs child of A):<a 
name="line.94"></a>
-<span class="sourceLineNo">095</span>  //   WAL-2: [A, B]                   A 
stackIds = [0, 4], B stackIds = [1, 5]<a name="line.95"></a>
-<span class="sourceLineNo">096</span>  //   WAL-1: [A, B, C, D]<a 
name="line.96"></a>
-<span class="sourceLineNo">097</span>  //<a name="line.97"></a>
-<span class="sourceLineNo">098</span>  // In the case above we need to read 
one more WAL to be able to consider<a name="line.98"></a>
-<span class="sourceLineNo">099</span>  // the root procedure A and all 
children as ready.<a name="line.99"></a>
-<span class="sourceLineNo">100</span>  // 
==============================================================================================<a
 name="line.100"></a>
-<span class="sourceLineNo">101</span>  private final WalProcedureMap 
localProcedureMap = new WalProcedureMap(1024);<a name="line.101"></a>
-<span class="sourceLineNo">102</span>  private final WalProcedureMap 
procedureMap = new WalProcedureMap(1024);<a name="line.102"></a>
-<span class="sourceLineNo">103</span><a name="line.103"></a>
-<span class="sourceLineNo">104</span>  private final ProcedureWALFormat.Loader 
loader;<a name="line.104"></a>
-<span class="sourceLineNo">105</span><a name="line.105"></a>
-<span class="sourceLineNo">106</span>  /**<a name="line.106"></a>
-<span class="sourceLineNo">107</span>   * Global tracker that will be used by 
the WALProcedureStore after load.<a name="line.107"></a>
-<span class="sourceLineNo">108</span>   * If the last WAL was closed cleanly 
we already have a full tracker ready to be used.<a name="line.108"></a>
-<span class="sourceLineNo">109</span>   * If the last WAL was truncated (e.g. 
master killed) the tracker will be empty<a name="line.109"></a>
-<span class="sourceLineNo">110</span>   * and the 'partial' flag will be set. 
In this case, on WAL replay we are going<a name="line.110"></a>
-<span class="sourceLineNo">111</span>   * to rebuild the tracker.<a 
name="line.111"></a>
-<span class="sourceLineNo">112</span>   */<a name="line.112"></a>
-<span class="sourceLineNo">113</span>  private final ProcedureStoreTracker 
tracker;<a name="line.113"></a>
-<span class="sourceLineNo">114</span>  // TODO: private final boolean 
hasFastStartSupport;<a name="line.114"></a>
-<span class="sourceLineNo">115</span><a name="line.115"></a>
-<span class="sourceLineNo">116</span>  /**<a name="line.116"></a>
-<span class="sourceLineNo">117</span>   * If tracker for a log file is partial 
(see {@link ProcedureStoreTracker#partial}), we<a name="line.117"></a>
-<span class="sourceLineNo">118</span>   * re-build the list of procedures 
updated in that WAL because we need it for log cleaning<a name="line.118"></a>
-<span class="sourceLineNo">119</span>   * purposes. If all procedures updated 
in a WAL are found to be obsolete, it can be safely deleted.<a 
name="line.119"></a>
-<span class="sourceLineNo">120</span>   * (see {@link 
WALProcedureStore#removeInactiveLogs()}).<a name="line.120"></a>
-<span class="sourceLineNo">121</span>   * However, we don't need deleted part 
of a WAL's tracker for this purpose, so we don't bother<a name="line.121"></a>
-<span class="sourceLineNo">122</span>   * re-building it.<a 
name="line.122"></a>
-<span class="sourceLineNo">123</span>   */<a name="line.123"></a>
-<span class="sourceLineNo">124</span>  private ProcedureStoreTracker 
localTracker;<a name="line.124"></a>
-<span class="sourceLineNo">125</span><a name="line.125"></a>
-<span class="sourceLineNo">126</span>  // private long compactionLogId;<a 
name="line.126"></a>
-<span class="sourceLineNo">127</span>  private long maxProcId = 0;<a 
name="line.127"></a>
-<span class="sourceLineNo">128</span><a name="line.128"></a>
-<span class="sourceLineNo">129</span>  public ProcedureWALFormatReader(final 
ProcedureStoreTracker tracker,<a name="line.129"></a>
-<span class="sourceLineNo">130</span>      ProcedureWALFormat.Loader loader) 
{<a name="line.130"></a>
-<span class="sourceLineNo">131</span>    this.tracker = tracker;<a 
name="line.131"></a>
-<span class="sourceLineNo">132</span>    this.loader = loader;<a 
name="line.132"></a>
-<span class="sourceLineNo">133</span>    // we support fast-start only if we 
have a clean shutdown.<a name="line.133"></a>
-<span class="sourceLineNo">134</span>    // this.hasFastStartSupport = 
!tracker.isEmpty();<a name="line.134"></a>
-<span class="sourceLineNo">135</span>  }<a name="line.135"></a>
-<span class="sourceLineNo">136</span><a name="line.136"></a>
-<span class="sourceLineNo">137</span>  public void read(final ProcedureWALFile 
log) throws IOException {<a name="line.137"></a>
-<span class="sourceLineNo">138</span>    localTracker = 
log.getTracker().isPartial() ? log.getTracker() : null;<a name="line.138"></a>
-<span class="sourceLineNo">139</span>    if (localTracker != null) {<a 
name="line.139"></a>
-<span class="sourceLineNo">140</span>      LOG.info("Rebuilding tracker for " 
+ log);<a name="line.140"></a>
-<span class="sourceLineNo">141</span>    }<a name="line.141"></a>
-<span class="sourceLineNo">142</span><a name="line.142"></a>
-<span class="sourceLineNo">143</span>    long count = 0;<a name="line.143"></a>
-<span class="sourceLineNo">144</span>    FSDataInputStream stream = 
log.getStream();<a name="line.144"></a>
-<span class="sourceLineNo">145</span>    try {<a name="line.145"></a>
-<span class="sourceLineNo">146</span>      boolean hasMore = true;<a 
name="line.146"></a>
-<span class="sourceLineNo">147</span>      while (hasMore) {<a 
name="line.147"></a>
-<span class="sourceLineNo">148</span>        ProcedureWALEntry entry = 
ProcedureWALFormat.readEntry(stream);<a name="line.148"></a>
-<span class="sourceLineNo">149</span>        if (entry == null) {<a 
name="line.149"></a>
-<span class="sourceLineNo">150</span>          LOG.warn("Nothing left to 
decode. Exiting with missing EOF, log=" + log);<a name="line.150"></a>
-<span class="sourceLineNo">151</span>          break;<a name="line.151"></a>
-<span class="sourceLineNo">152</span>        }<a name="line.152"></a>
-<span class="sourceLineNo">153</span>        count++;<a name="line.153"></a>
-<span class="sourceLineNo">154</span>        switch (entry.getType()) {<a 
name="line.154"></a>
-<span class="sourceLineNo">155</span>          case PROCEDURE_WAL_INIT:<a 
name="line.155"></a>
-<span class="sourceLineNo">156</span>            readInitEntry(entry);<a 
name="line.156"></a>
-<span class="sourceLineNo">157</span>            break;<a name="line.157"></a>
-<span class="sourceLineNo">158</span>          case PROCEDURE_WAL_INSERT:<a 
name="line.158"></a>
-<span class="sourceLineNo">159</span>            readInsertEntry(entry);<a 
name="line.159"></a>
-<span class="sourceLineNo">160</span>            break;<a name="line.160"></a>
-<span class="sourceLineNo">161</span>          case PROCEDURE_WAL_UPDATE:<a 
name="line.161"></a>
-<span class="sourceLineNo">162</span>          case PROCEDURE_WAL_COMPACT:<a 
name="line.162"></a>
-<span class="sourceLineNo">163</span>            readUpdateEntry(entry);<a 
name="line.163"></a>
-<span class="sourceLineNo">164</span>            break;<a name="line.164"></a>
-<span class="sourceLineNo">165</span>          case PROCEDURE_WAL_DELETE:<a 
name="line.165"></a>
-<span class="sourceLineNo">166</span>            readDeleteEntry(entry);<a 
name="line.166"></a>
-<span class="sourceLineNo">167</span>            break;<a name="line.167"></a>
-<span class="sourceLineNo">168</span>          case PROCEDURE_WAL_EOF:<a 
name="line.168"></a>
-<span class="sourceLineNo">169</span>            hasMore = false;<a 
name="line.169"></a>
-<span class="sourceLineNo">170</span>            break;<a name="line.170"></a>
-<span class="sourceLineNo">171</span>          default:<a name="line.171"></a>
-<span class="sourceLineNo">172</span>            throw new 
CorruptedWALProcedureStoreException("Invalid entry: " + entry);<a 
name="line.172"></a>
-<span class="sourceLineNo">173</span>        }<a name="line.173"></a>
-<span class="sourceLineNo">174</span>      }<a name="line.174"></a>
-<span class="sourceLineNo">175</span>      LOG.info("Read {} entries in {}", 
count, log);<a name="line.175"></a>
-<span class="sourceLineNo">176</span>    } catch 
(InvalidProtocolBufferException e) {<a name="line.176"></a>
-<span class="sourceLineNo">177</span>      LOG.error("While reading entry #{} 
in {}", count, log, e);<a name="line.177"></a>
-<span class="sourceLineNo">178</span>      loader.markCorruptedWAL(log, e);<a 
name="line.178"></a>
-<span class="sourceLineNo">179</span>    }<a name="line.179"></a>
-<span class="sourceLineNo">180</span><a name="line.180"></a>
-<span class="sourceLineNo">181</span>    if (localTracker != null) {<a 
name="line.181"></a>
-<span class="sourceLineNo">182</span>      
localTracker.setPartialFlag(false);<a name="line.182"></a>
-<span class="sourceLineNo">183</span>    }<a name="line.183"></a>
-<span class="sourceLineNo">184</span>    if (!localProcedureMap.isEmpty()) {<a 
name="line.184"></a>
-<span class="sourceLineNo">185</span>      
log.setProcIds(localProcedureMap.getMinProcId(), 
localProcedureMap.getMaxProcId());<a name="line.185"></a>
-<span class="sourceLineNo">186</span>      
procedureMap.mergeTail(localProcedureMap);<a name="line.186"></a>
-<span class="sourceLineNo">187</span><a name="line.187"></a>
-<span class="sourceLineNo">188</span>      //if (hasFastStartSupport) {<a 
name="line.188"></a>
-<span class="sourceLineNo">189</span>      // TODO: Some procedure may be 
already runnables (see readInitEntry())<a name="line.189"></a>
-<span class="sourceLineNo">190</span>      //       (we can also check the 
"update map" in the log trackers)<a name="line.190"></a>
-<span class="sourceLineNo">191</span>      // 
--------------------------------------------------<a name="line.191"></a>
-<span class="sourceLineNo">192</span>      //EntryIterator iter = 
procedureMap.fetchReady();<a name="line.192"></a>
-<span class="sourceLineNo">193</span>      //if (iter != null) 
loader.load(iter);<a name="line.193"></a>
-<span class="sourceLineNo">194</span>      // 
--------------------------------------------------<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>  }<a name="line.197"></a>
-<span class="sourceLineNo">198</span><a name="line.198"></a>
-<span class="sourceLineNo">199</span>  public void finish() throws IOException 
{<a name="line.199"></a>
-<span class="sourceLineNo">200</span>    // notify the loader about the max 
proc ID<a name="line.200"></a>
-<span class="sourceLineNo">201</span>    loader.setMaxProcId(maxProcId);<a 
name="line.201"></a>
-<span class="sourceLineNo">202</span><a name="line.202"></a>
-<span class="sourceLineNo">203</span>    // fetch the procedure ready to 
run.<a name="line.203"></a>
-<span class="sourceLineNo">204</span>    ProcedureIterator procIter = 
procedureMap.fetchReady();<a name="line.204"></a>
-<span class="sourceLineNo">205</span>    if (procIter != null) 
loader.load(procIter);<a name="line.205"></a>
-<span class="sourceLineNo">206</span><a name="line.206"></a>
-<span class="sourceLineNo">207</span>    // remaining procedures have missing 
link or dependencies<a name="line.207"></a>
-<span class="sourceLineNo">208</span>    // consider them as corrupted, manual 
fix is probably required.<a name="line.208"></a>
-<span class="sourceLineNo">209</span>    procIter = procedureMap.fetchAll();<a 
name="line.209"></a>
-<span class="sourceLineNo">210</span>    if (procIter != null) 
loader.handleCorrupted(procIter);<a name="line.210"></a>
-<span class="sourceLineNo">211</span>  }<a name="line.211"></a>
-<span class="sourceLineNo">212</span><a name="line.212"></a>
-<span class="sourceLineNo">213</span>  private void loadProcedure(final 
ProcedureWALEntry entry, final ProcedureProtos.Procedure proc) {<a 
name="line.213"></a>
-<span class="sourceLineNo">214</span>    maxProcId = Math.max(maxProcId, 
proc.getProcId());<a name="line.214"></a>
-<span class="sourceLineNo">215</span>    if (isRequired(proc.getProcId())) {<a 
name="line.215"></a>
-<span class="sourceLineNo">216</span>      if (LOG.isTraceEnabled()) {<a 
name="line.216"></a>
-<span class="sourceLineNo">217</span>        LOG.trace("Read " + 
entry.getType() + " entry " + proc.getProcId());<a name="line.217"></a>
-<span class="sourceLineNo">218</span>      }<a name="line.218"></a>
-<span class="sourceLineNo">219</span>      localProcedureMap.add(proc);<a 
name="line.219"></a>
-<span class="sourceLineNo">220</span>      if (tracker.isPartial()) {<a 
name="line.220"></a>
-<span class="sourceLineNo">221</span>        
tracker.insert(proc.getProcId());<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>    if (localTracker != null) {<a 
name="line.224"></a>
-<span class="sourceLineNo">225</span>      
localTracker.insert(proc.getProcId());<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>  private void readInitEntry(final 
ProcedureWALEntry entry)<a name="line.229"></a>
-<span class="sourceLineNo">230</span>  throws IOException {<a 
name="line.230"></a>
-<span class="sourceLineNo">231</span>    assert entry.getProcedureCount() == 1 
: "Expected only one procedure";<a name="line.231"></a>
-<span class="sourceLineNo">232</span>    loadProcedure(entry, 
entry.getProcedure(0));<a name="line.232"></a>
-<span class="sourceLineNo">233</span>  }<a name="line.233"></a>
-<span class="sourceLineNo">234</span><a name="line.234"></a>
-<span class="sourceLineNo">235</span>  private void readInsertEntry(final 
ProcedureWALEntry entry) throws IOException {<a name="line.235"></a>
-<span class="sourceLineNo">236</span>    assert entry.getProcedureCount() 
&gt;= 1 : "Expected one or more procedures";<a name="line.236"></a>
-<span class="sourceLineNo">237</span>    loadProcedure(entry, 
entry.getProcedure(0));<a name="line.237"></a>
-<span class="sourceLineNo">238</span>    for (int i = 1; i &lt; 
entry.getProcedureCount(); ++i) {<a name="line.238"></a>
-<span class="sourceLineNo">239</span>      loadProcedure(entry, 
entry.getProcedure(i));<a name="line.239"></a>
-<span class="sourceLineNo">240</span>    }<a name="line.240"></a>
-<span class="sourceLineNo">241</span>  }<a name="line.241"></a>
-<span class="sourceLineNo">242</span><a name="line.242"></a>
-<span class="sourceLineNo">243</span>  private void readUpdateEntry(final 
ProcedureWALEntry entry) throws IOException {<a name="line.243"></a>
-<span class="sourceLineNo">244</span>    assert entry.getProcedureCount() == 1 
: "Expected only one procedure";<a name="line.244"></a>
-<span class="sourceLineNo">245</span>    loadProcedure(entry, 
entry.getProcedure(0));<a name="line.245"></a>
-<span class="sourceLineNo">246</span>  }<a name="line.246"></a>
-<span class="sourceLineNo">247</span><a name="line.247"></a>
-<span class="sourceLineNo">248</span>  private void readDeleteEntry(final 
ProcedureWALEntry entry) throws IOException {<a name="line.248"></a>
-<span class="sourceLineNo">249</span>    assert entry.hasProcId() : "expected 
ProcID";<a name="line.249"></a>
-<span class="sourceLineNo">250</span><a name="line.250"></a>
-<span class="sourceLineNo">251</span>    if (entry.getChildIdCount() &gt; 0) 
{<a name="line.251"></a>
-<span class="sourceLineNo">252</span>      assert entry.getProcedureCount() == 
1 : "Expected only one procedure";<a name="line.252"></a>
-<span class="sourceLineNo">253</span><a name="line.253"></a>
-<span class="sourceLineNo">254</span>      // update the parent procedure<a 
name="line.254"></a>
-<span class="sourceLineNo">255</span>      loadProcedure(entry, 
entry.getProcedure(0));<a name="line.255"></a>
-<span class="sourceLineNo">256</span><a name="line.256"></a>
-<span class="sourceLineNo">257</span>      // remove the child procedures of 
entry.getProcId()<a name="line.257"></a>
-<span class="sourceLineNo">258</span>      for (int i = 0, count = 
entry.getChildIdCount(); i &lt; count; ++i) {<a name="line.258"></a>
-<span class="sourceLineNo">259</span>        
deleteEntry(entry.getChildId(i));<a name="line.259"></a>
-<span class="sourceLineNo">260</span>      }<a name="line.260"></a>
-<span class="sourceLineNo">261</span>    } else {<a name="line.261"></a>
-<span class="sourceLineNo">262</span>      assert entry.getProcedureCount() == 
0 : "Expected no procedures";<a name="line.262"></a>
-<span class="sourceLineNo">263</span><a name="line.263"></a>
-<span class="sourceLineNo">264</span>      // delete the procedure<a 
name="line.264"></a>
-<span class="sourceLineNo">265</span>      deleteEntry(entry.getProcId());<a 
name="line.265"></a>
-<span class="sourceLineNo">266</span>    }<a name="line.266"></a>
-<span class="sourceLineNo">267</span>  }<a name="line.267"></a>
-<span class="sourceLineNo">268</span><a name="line.268"></a>
-<span class="sourceLineNo">269</span>  private void deleteEntry(final long 
procId) {<a name="line.269"></a>
-<span class="sourceLineNo">270</span>    if (LOG.isTraceEnabled()) {<a 
name="line.270"></a>
-<span class="sourceLineNo">271</span>      LOG.trace("delete entry " + 
procId);<a name="line.271"></a>
-<span class="sourceLineNo">272</span>    }<a name="line.272"></a>
-<span class="sourceLineNo">273</span>    maxProcId = Math.max(maxProcId, 
procId);<a name="line.273"></a>
-<span class="sourceLineNo">274</span>    localProcedureMap.remove(procId);<a 
name="line.274"></a>
-<span class="sourceLineNo">275</span>    assert 
!procedureMap.contains(procId);<a name="line.275"></a>
-<span class="sourceLineNo">276</span>    if (tracker.isPartial()) {<a 
name="line.276"></a>
-<span class="sourceLineNo">277</span>      tracker.setDeleted(procId, true);<a 
name="line.277"></a>
-<span class="sourceLineNo">278</span>    }<a name="line.278"></a>
-<span class="sourceLineNo">279</span>    if (localTracker != null) {<a 
name="line.279"></a>
-<span class="sourceLineNo">280</span>      // In case there is only delete 
entry for this procedure in current log.<a name="line.280"></a>
-<span class="sourceLineNo">281</span>      localTracker.setDeleted(procId, 
true);<a name="line.281"></a>
-<span class="sourceLineNo">282</span>    }<a name="line.282"></a>
-<span class="sourceLineNo">283</span>  }<a name="line.283"></a>
-<span class="sourceLineNo">284</span><a name="line.284"></a>
-<span class="sourceLineNo">285</span>  private boolean isDeleted(final long 
procId) {<a name="line.285"></a>
-<span class="sourceLineNo">286</span>    return tracker.isDeleted(procId) == 
ProcedureStoreTracker.DeleteState.YES;<a name="line.286"></a>
-<span class="sourceLineNo">287</span>  }<a name="line.287"></a>
-<span class="sourceLineNo">288</span><a name="line.288"></a>
-<span class="sourceLineNo">289</span>  private boolean isRequired(final long 
procId) {<a name="line.289"></a>
-<span class="sourceLineNo">290</span>    return !isDeleted(procId) &amp;&amp; 
!procedureMap.contains(procId);<a name="line.290"></a>
-<span class="sourceLineNo">291</span>  }<a name="line.291"></a>
-<span class="sourceLineNo">292</span><a name="line.292"></a>
-<span class="sourceLineNo">293</span>  // 
==========================================================================<a 
name="line.293"></a>
-<span class="sourceLineNo">294</span>  //  We keep an in-memory map of the 
procedures sorted by replay order.<a name="line.294"></a>
-<span class="sourceLineNo">295</span>  //  (see the details in the beginning 
of the file)<a name="line.295"></a>
-<span class="sourceLineNo">296</span>  //                      
_______________________________________________<a name="line.296"></a>
-<span class="sourceLineNo">297</span>  //      procedureMap = | A |   | E |   
| C |   |   |   |   | G |   |   |<a name="line.297"></a>
-<span class="sourceLineNo">298</span>  //                       D              
 B<a name="line.298"></a>
-<span class="sourceLineNo">299</span>  //      replayOrderHead = C &lt;-&gt; B 
&lt;-&gt; E &lt;-&gt; D &lt;-&gt; A &lt;-&gt; G<a name="line.299"></a>
-<span class="sourceLineNo">300</span>  //<a name="line.300"></a>
-<span class="sourceLineNo">301</span>  //  We also have a lazy grouping by 
"root procedure", and a list of<a name="line.301"></a>
-<span class="sourceLineNo">302</span>  //  unlinked procedures. If after 
reading all the WALs we have unlinked<a name="line.302"></a>
-<span class="sourceLineNo">303</span>  //  procedures it means that we had a 
missing WAL or a corruption.<a name="line.303"></a>
-<span class="sourceLineNo">304</span>  //      rootHead = A &lt;-&gt; D 
&lt;-&gt; G<a name="line.304"></a>
-<span class="sourceLineNo">305</span>  //                 B     E<a 
name="line.305"></a>
-<span class="sourceLineNo">306</span>  //                 C<a 
name="line.306"></a>
-<span class="sourceLineNo">307</span>  //      unlinkFromLinkList = None<a 
name="line.307"></a>
-<span class="sourceLineNo">308</span>  // 
==========================================================================<a 
name="line.308"></a>
-<span class="sourceLineNo">309</span>  private static class Entry {<a 
name="line.309"></a>
-<span class="sourceLineNo">310</span>    // For bucketed linked lists in 
hash-table.<a name="line.310"></a>
-<span class="sourceLineNo">311</span>    protected Entry hashNext;<a 
name="line.311"></a>
-<span class="sourceLineNo">312</span>    // child head<a name="line.312"></a>
-<span class="sourceLineNo">313</span>    protected Entry childHead;<a 
name="line.313"></a>
-<span class="sourceLineNo">314</span>    // double-link for rootHead or 
childHead<a name="line.314"></a>
-<span class="sourceLineNo">315</span>    protected Entry linkNext;<a 
name="line.315"></a>
-<span class="sourceLineNo">316</span>    protected Entry linkPrev;<a 
name="line.316"></a>
-<span class="sourceLineNo">317</span>    // replay double-linked-list<a 
name="line.317"></a>
-<span class="sourceLineNo">318</span>    protected Entry replayNext;<a 
name="line.318"></a>
-<span class="sourceLineNo">319</span>    protected Entry replayPrev;<a 
name="line.319"></a>
-<span class="sourceLineNo">320</span>    // procedure-infos<a 
name="line.320"></a>
-<span class="sourceLineNo">321</span>    protected Procedure procedure;<a 
name="line.321"></a>
-<span class="sourceLineNo">322</span>    protected ProcedureProtos.Procedure 
proto;<a name="line.322"></a>
-<span class="sourceLineNo">323</span>    protected boolean ready = false;<a 
name="line.323"></a>
-<span class="sourceLineNo">324</span><a name="line.324"></a>
-<span class="sourceLineNo">325</span>    public Entry(Entry hashNext) {<a 
name="line.325"></a>
-<span class="sourceLineNo">326</span>      this.hashNext = hashNext;<a 
name="line.326"></a>
-<span class="sourceLineNo">327</span>    }<a name="line.327"></a>
-<span class="sourceLineNo">328</span><a name="line.328"></a>
-<span class="sourceLineNo">329</span>    public long getProcId() {<a 
name="line.329"></a>
-<span class="sourceLineNo">330</span>      return proto.getProcId();<a 
name="line.330"></a>
-<span class="sourceLineNo">331</span>    }<a name="line.331"></a>
-<span class="sourceLineNo">332</span><a name="line.332"></a>
-<span class="sourceLineNo">333</span>    public long getParentId() {<a 
name="line.333"></a>
-<span class="sourceLineNo">334</span>      return proto.getParentId();<a 
name="line.334"></a>
-<span class="sourceLineNo">335</span>    }<a name="line.335"></a>
-<span class="sourceLineNo">336</span><a name="line.336"></a>
-<span class="sourceLineNo">337</span>    public boolean hasParent() {<a 
name="line.337"></a>
-<span class="sourceLineNo">338</span>      return proto.hasParentId();<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>    public boolean isReady() {<a 
name="line.341"></a>
-<span class="sourceLineNo">342</span>      return ready;<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 boolean isFinished() {<a 
name="line.345"></a>
-<span class="sourceLineNo">346</span>      if (!hasParent()) {<a 
name="line.346"></a>
-<span class="sourceLineNo">347</span>        // we only consider 'root' 
procedures. because for the user 'finished'<a name="line.347"></a>
-<span class="sourceLineNo">348</span>        // means when everything up to 
the 'root' is finished.<a name="line.348"></a>
-<span class="sourceLineNo">349</span>        switch (proto.getState()) {<a 
name="line.349"></a>
-<span class="sourceLineNo">350</span>          case ROLLEDBACK:<a 
name="line.350"></a>
-<span class="sourceLineNo">351</span>          case SUCCESS:<a 
name="line.351"></a>
-<span class="sourceLineNo">352</span>            return true;<a 
name="line.352"></a>
-<span class="sourceLineNo">353</span>          default:<a name="line.353"></a>
-<span class="sourceLineNo">354</span>            break;<a name="line.354"></a>
-<span class="sourceLineNo">355</span>        }<a name="line.355"></a>
-<span class="sourceLineNo">356</span>      }<a name="line.356"></a>
-<span class="sourceLineNo">357</span>      return false;<a name="line.357"></a>
-<span class="sourceLineNo">358</span>    }<a name="line.358"></a>
-<span class="sourceLineNo">359</span><a name="line.359"></a>
-<span class="sourceLineNo">360</span>    public Procedure convert() throws 
IOException {<a name="line.360"></a>
-<span class="sourceLineNo">361</span>      if (procedure == null) {<a 
name="line.361"></a>
-<span class="sourceLineNo">362</span>        procedure = 
ProcedureUtil.convertToProcedure(proto);<a name="line.362"></a>
-<span class="sourceLineNo">363</span>      }<a name="line.363"></a>
-<span class="sourceLineNo">364</span>      return procedure;<a 
name="line.364"></a>
-<span class="sourceLineNo">365</span>    }<a name="line.365"></a>
-<span class="sourceLineNo">366</span><a name="line.366"></a>
-<span class="sourceLineNo">367</span>    @Override<a name="line.367"></a>
-<span class="sourceLineNo">368</span>    public String toString() {<a 
name="line.368"></a>
-<span class="sourceLineNo">369</span>      final StringBuilder sb = new 
StringBuilder();<a name="line.369"></a>
-<span class="sourceLineNo">370</span>      sb.append("Entry(");<a 
name="line.370"></a>
-<span class="sourceLineNo">371</span>      sb.append(getProcId());<a 
name="line.371"></a>
-<span class="sourceLineNo">372</span>      sb.append(", parentId=");<a 
name="line.372"></a>
-<span class="sourceLineNo">373</span>      sb.append(getParentId());<a 
name="line.373"></a>
-<span class="sourceLineNo">374</span>      sb.append(", class=");<a 
name="line.374"></a>
-<span class="sourceLineNo">375</span>      sb.append(proto.getClassName());<a 
name="line.375"></a>
-<span class="sourceLineNo">376</span>      sb.append(")");<a 
name="line.376"></a>
-<span class="sourceLineNo">377</span>      return sb.toString();<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><a name="line.380"></a>
-<span class="sourceLineNo">381</span>  private static class EntryIterator 
implements ProcedureIterator {<a name="line.381"></a>
-<span class="sourceLineNo">382</span>    private final Entry replayHead;<a 
name="line.382"></a>
-<span class="sourceLineNo">383</span>    private Entry current;<a 
name="line.383"></a>
-<span class="sourceLineNo">384</span><a name="line.384"></a>
-<span class="sourceLineNo">385</span>    public EntryIterator(Entry 
replayHead) {<a name="line.385"></a>
-<span class="sourceLineNo">386</span>      this.replayHead = replayHead;<a 
name="line.386"></a>
-<span class="sourceLineNo">387</span>      this.current = replayHead;<a 
name="line.387"></a>
-<span class="sourceLineNo">388</span>    }<a name="line.388"></a>
-<span class="sourceLineNo">389</span><a name="line.389"></a>
-<span class="sourceLineNo">390</span>    @Override<a name="line.390"></a>
-<span class="sourceLineNo">391</span>    public void reset() {<a 
name="line.391"></a>
-<span class="sourceLineNo">392</span>      this.current = replayHead;<a 
name="line.392"></a>
-<span class="sourceLineNo">393</span>    }<a name="line.393"></a>
-<span class="sourceLineNo">394</span><a name="line.394"></a>
-<span class="sourceLineNo">395</span>    @Override<a name="line.395"></a>
-<span class="sourceLineNo">396</span>    public boolean hasNext() {<a 
name="line.396"></a>
-<span class="sourceLineNo">397</span>      return current != null;<a 
name="line.397"></a>
-<span class="sourceLineNo">398</span>    }<a name="line.398"></a>
-<span class="sourceLineNo">399</span><a name="line.399"></a>
-<span class="sourceLineNo">400</span>    @Override<a name="line.400"></a>
-<span class="sourceLineNo">401</span>    public boolean isNextFinished() {<a 
name="line.401"></a>
-<span class="sourceLineNo">402</span>      return current != null &amp;&amp; 
current.isFinished();<a name="line.402"></a>
-<span class="sourceLineNo">403</span>    }<a name="line.403"></a>
-<span class="sourceLineNo">404</span><a name="line.404"></a>
-<span class="sourceLineNo">405</span>    @Override<a name="line.405"></a>
-<span class="sourceLineNo">406</span>    public void skipNext() {<a 
name="line.406"></a>
-<span class="sourceLineNo">407</span>      current = current.replayNext;<a 
name="line.407"></a>
-<span class="sourceLineNo">408</span>    }<a name="line.408"></a>
-<span class="sourceLineNo">409</span><a name="line.409"></a>
-<span class="sourceLineNo">410</span>    @Override<a name="line.410"></a>
-<span class="sourceLineNo">411</span>    public Procedure next() throws 
IOException {<a name="line.411"></a>
-<span class="sourceLineNo">412</span>      try {<a name="line.412"></a>
-<span class="sourceLineNo">413</span>        return current.convert();<a 
name="line.413"></a>
-<span class="sourceLineNo">414</span>      } finally {<a name="line.414"></a>
-<span class="sourceLineNo">415</span>        current = current.replayNext;<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>  }<a name="line.418"></a>
-<span class="sourceLineNo">419</span><a name="line.419"></a>
-<span class="sourceLineNo">420</span>  private static class WalProcedureMap 
{<a name="line.420"></a>
-<span class="sourceLineNo">421</span>    // procedure hash table<a 
name="line.421"></a>
-<span class="sourceLineNo">422</span>    private Entry[] procedureMap;<a 
name="line.422"></a>
-<span class="sourceLineNo">423</span><a name="line.423"></a>
-<span class="sourceLineNo">424</span>    // replay-order double-linked-list<a 
name="line.424"></a>
-<span class="sourceLineNo">425</span>    private Entry replayOrderHead;<a 
name="line.425"></a>
-<span class="sourceLineNo">426</span>    private Entry replayOrderTail;<a 
name="line.426"></a>
-<span class="sourceLineNo">427</span><a name="line.427"></a>
-<span class="sourceLineNo">428</span>    // root linked-list<a 
name="line.428"></a>
-<span class="sourceLineNo">429</span>    private Entry rootHead;<a 
name="line.429"></a>
-<span class="sourceLineNo">430</span><a name="line.430"></a>
-<span class="sourceLineNo">431</span>    // pending unlinked children (root 
not present yet)<a name="line.431"></a>
-<span class="sourceLineNo">432</span>    private Entry childUnlinkedHead;<a 
name="line.432"></a>
-<span class="sourceLineNo">433</span><a name="line.433"></a>
-<span class="sourceLineNo">434</span>    // Track ProcId range<a 
name="line.434"></a>
-<span class="sourceLineNo">435</span>    private long minProcId = 
Long.MAX_VALUE;<a name="line.435"></a>
-<span class="sourceLineNo">436</span>    private long maxProcId = 
Long.MIN_VALUE;<a name="line.436"></a>
-<span class="sourceLineNo">437</span><a name="line.437"></a>
-<span class="sourceLineNo">438</span>    public WalProcedureMap(int size) {<a 
name="line.438"></a>
-<span class="sourceLineNo">439</span>      procedureMap = new Entry[size];<a 
name="line.439"></a>
-<span class="sourceLineNo">440</span>      replayOrderHead = null;<a 
name="line.440"></a>
-<span class="sourceLineNo">441</span>      replayOrderTail = null;<a 
name="line.441"></a>
-<span class="sourceLineNo">442</span>      rootHead = null;<a 
name="line.442"></a>
-<span class="sourceLineNo">443</span>      childUnlinkedHead = null;<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>    public void 
add(ProcedureProtos.Procedure procProto) {<a name="line.446"></a>
-<span class="sourceLineNo">447</span>      
trackProcIds(procProto.getProcId());<a name="line.447"></a>
-<span class="sourceLineNo">448</span>      Entry entry = 
addToMap(procProto.getProcId(), procProto.hasParentId());<a name="line.448"></a>
-<span class="sourceLineNo">449</span>      boolean newEntry = entry.proto == 
null;<a name="line.449"></a>
-<span class="sourceLineNo">450</span>      // We have seen procedure WALs 
where the entries are out of order; see HBASE-18152.<a name="line.450"></a>
-<span class="sourceLineNo">451</span>      // To compensate, only replace the 
Entry procedure if for sure this new procedure<a name="line.451"></a>
-<span class="sourceLineNo">452</span>      // is indeed an entry that came 
later. TODO: Fix the writing of procedure info so<a name="line.452"></a>
-<span class="sourceLineNo">453</span>      // it does not violate basic 
expectation, that WALs contain procedure changes going<a name="line.453"></a>
-<span class="sourceLineNo">454</span>      // from start to finish in 
sequence.<a name="line.454"></a>
-<span class="sourceLineNo">455</span>      if (newEntry || 
isIncreasing(entry.proto, procProto)) {<a name="line.455"></a>
-<span class="sourceLineNo">456</span>        entry.proto = procProto;<a 
name="line.456"></a>
-<span class="sourceLineNo">457</span>      }<a name="line.457"></a>
-<span class="sourceLineNo">458</span>      addToReplayList(entry);<a 
name="line.458"></a>
-<span class="sourceLineNo">459</span>      if(newEntry) {<a 
name="line.459"></a>
-<span class="sourceLineNo">460</span>        if (procProto.hasParentId()) {<a 
name="line.460"></a>
-<span class="sourceLineNo">461</span>          childUnlinkedHead = 
addToLinkList(entry, childUnlinkedHead);<a name="line.461"></a>
-<span class="sourceLineNo">462</span>        } else {<a name="line.462"></a>
-<span class="sourceLineNo">463</span>          rootHead = addToLinkList(entry, 
rootHead);<a name="line.463"></a>
-<span class="sourceLineNo">464</span>        }<a name="line.464"></a>
-<span class="sourceLineNo">465</span>      }<a name="line.465"></a>
-<span class="sourceLineNo">466</span>    }<a name="line.466"></a>
-<span class="sourceLineNo">467</span><a name="line.467"></a>
-<span class="sourceLineNo">468</span>    /**<a name="line.468"></a>
-<span class="sourceLineNo">469</span>     * @return True if this new procedure 
is 'richer' than the current one else<a name="line.469"></a>
-<span class="sourceLineNo">470</span>     * false and we log this incidence 
where it appears that the WAL has older entries<a name="line.470"></a>
-<span class="sourceLineNo">471</span>     * appended after newer ones. See 
HBASE-18152.<a name="line.471"></a>
-<span class="sourceLineNo">472</span>     */<a name="line.472"></a>
-<span class="sourceLineNo">473</span>    private static boolean 
isIncreasing(ProcedureProtos.Procedure current,<a name="line.473"></a>
-<span class="sourceLineNo">474</span>        ProcedureProtos.Procedure 
candidate) {<a name="line.474"></a>
-<span class="sourceLineNo">475</span>      // Check that the procedures we see 
are 'increasing'. We used to compare<a name="line.475"></a>
-<span class="sourceLineNo">476</span>      // procedure id first and then 
update time but it can legitimately go backwards if the<a name="line.476"></a>
-<span class="sourceLineNo">477</span>      // procedure is failed or rolled 
back so that was unreliable. Was going to compare<a name="line.477"></a>
-<span class="sourceLineNo">478</span>      // state but lets see if comparing 
update time enough (unfortunately this issue only<a name="line.478"></a>
-<span class="sourceLineNo">479</span>      // seen under load...)<a 
name="line.479"></a>
-<span class="sourceLineNo">480</span>      boolean increasing = 
current.getLastUpdate() &lt;= candidate.getLastUpdate();<a name="line.480"></a>
-<span class="sourceLineNo">481</span>      if (!increasing) {<a 
name="line.481"></a>
-<span class="sourceLineNo">482</span>        LOG.warn("NOT INCREASING! 
current=" + current + ", candidate=" + candidate);<a name="line.482"></a>
-<span class="sourceLineNo">483</span>      }<a name="line.483"></a>
-<span class="sourceLineNo">484</span>      return increasing;<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 remove(long procId) 
{<a name="line.487"></a>
-<span class="sourceLineNo">488</span>      trackProcIds(procId);<a 
name="line.488"></a>
-<span class="sourceLineNo">489</span>      Entry entry = 
removeFromMap(procId);<a name="line.489"></a>
-<span class="sourceLineNo">490</span>      if (entry != null) {<a 
name="line.490"></a>
-<span class="sourceLineNo">491</span>        unlinkFromReplayList(entry);<a 
name="line.491"></a>
-<span class="sourceLineNo">492</span>        unlinkFromLinkList(entry);<a 
name="line.492"></a>
-<span class="sourceLineNo">493</span>        return true;<a 
name="line.493"></a>
-<span class="sourceLineNo">494</span>      }<a name="line.494"></a>
-<span class="sourceLineNo">495</span>      return false;<a name="line.495"></a>
-<span class="sourceLineNo">496</span>    }<a name="line.496"></a>
-<span class="sourceLineNo">497</span><a name="line.497"></a>
-<span class="sourceLineNo">498</span>    private void trackProcIds(long 
procId) {<a name="line.498"></a>
-<span class="sourceLineNo">499</span>      minProcId = Math.min(minProcId, 
procId);<a name="line.499"></a>
-<span class="sourceLineNo">500</span>      maxProcId = Math.max(maxProcId, 
procId);<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>    public long getMinProcId() {<a 
name="line.503"></a>
-<span class="sourceLineNo">504</span>      return minProcId;<a 
name="line.504"></a>
-<span class="sourceLineNo">505</span>    }<a name="line.505"></a>
-<span class="sourceLineNo">506</span><a name="line.506"></a>
-<span class="sourceLineNo">507</span>    public long getMaxProcId() {<a 
name="line.507"></a>
-<span class="sourceLineNo">508</span>      return maxProcId;<a 
name="line.508"></a>
-<span class="sourceLineNo">509</span>    }<a name="line.509"></a>
-<span class="sourceLineNo">510</span><a name="line.510"></a>
-<span class="sourceLineNo">511</span>    public boolean contains(long procId) 
{<a name="line.511"></a>
-<span class="sourceLineNo">512</span>      return getProcedure(procId) != 
null;<a name="line.512"></a>
-<span class="sourceLineNo">513</span>    }<a name="line.513"></a>
-<span class="sourceLineNo">514</span><a name="line.514"></a>
-<span class="sourceLineNo">515</span>    public boolean isEmpty() {<a 
name="line.515"></a>
-<span class="sourceLineNo">516</span>      return replayOrderHead == null;<a 
name="line.516"></a>
-<span class="sourceLineNo">517</span>    }<a name="line.517"></a>
-<span class="sourceLineNo">518</span><a name="line.518"></a>
-<span class="sourceLineNo">519</span>    public void clear() {<a 
name="line.519"></a>
-<span class="sourceLineNo">520</span>      for (int i = 0; i &lt; 
procedureMap.length; ++i) {<a name="line.520"></a>
-<span class="sourceLineNo">521</span>        procedureMap[i] = null;<a 
name="line.521"></a>
-<span class="sourceLineNo">522</span>      }<a name="line.522"></a>
-<span class="sourceLineNo">523</span>      replayOrderHead = null;<a 
name="line.523"></a>
-<span class="sourceLineNo">524</span>      replayOrderTail = null;<a 
name="line.524"></a>
-<span class="sourceLineNo">525</span>      rootHead = null;<a 
name="line.525"></a>
-<span class="sourceLineNo">526</span>      childUnlinkedHead = null;<a 
name="line.526"></a>
-<span class="sourceLineNo">527</span>      minProcId = Long.MAX_VALUE;<a 
name="line.527"></a>
-<span class="sourceLineNo">528</span>      maxProcId = Long.MIN_VALUE;<a 
name="line.528"></a>
-<span class="sourceLineNo">529</span>    }<a name="line.529"></a>
-<span class="sourceLineNo">530</span><a name="line.530"></a>
-<span class="sourceLineNo">531</span>    /*<a name="line.531"></a>
-<span class="sourceLineNo">532</span>     * Merges two WalProcedureMap,<a 
name="line.532"></a>
-<span class="sourceLineNo">533</span>     * the target is the "global" map, 
the source is the "local" map.<a name="line.533"></a>
-<span class="sourceLineNo">534</span>     *  - The entries in the hashtables 
are guaranteed to be unique.<a name="line.534"></a>
-<span class="sourceLineNo">535</span>     *    On replay we don't load 
procedures that already exist in the "global"<a name="line.535"></a>
-<span class="sourceLineNo">536</span>     *    map (the one we are merging the 
"local" in to).<a name="line.536"></a>
-<span class="sourceLineNo">537</span>     *  - The replayOrderList of the 
"local" nao will be appended to the "global"<a name="line.537"></a>
-<span class="sourceLineNo">538</span>     *    map replay list.<a 
name="line.538"></a>
-<span class="sourceLineNo">539</span>     *  - The "local" map will be cleared 
at the end of the operation.<a name="line.539"></a>
-<span class="sourceLineNo">540</span>     */<a name="line.540"></a>
-<span class="sourceLineNo">541</span>    public void mergeTail(WalProcedureMap 
other) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span>      for (Entry p = 
other.replayOrderHead; p != null; p = p.replayNext) {<a name="line.542"></a>
-<span class="sourceLineNo">543</span>        int slotIndex = 
getMapSlot(p.getProcId());<a name="line.543"></a>
-<span class="sourceLineNo">544</span>        p.hashNext = 
procedureMap[slotIndex];<a name="line.544"></a>
-<span class="sourceLineNo">545</span>        procedureMap[slotIndex] = p;<a 
name="line.545"></a>
-<span class="sourceLineNo">546</span>      }<a name="line.546"></a>
-<span class="sourceLineNo">547</span><a name="line.547"></a>
-<span class="sourceLineNo">548</span>      if (replayOrderHead == null) {<a 
name="line.548"></a>
-<span class="sourceLineNo">549</span>        replayOrderHead = 
other.replayOrderHead;<a name="line.549"></a>
-<span class="sourceLineNo">550</span>        replayOrderTail = 
other.replayOrderTail;<a name="line.550"></a>
-<span class="sourceLineNo">551</span>        rootHead = other.rootHead;<a 
name="line.551"></a>
-<span class="sourceLineNo">552</span>        childUnlinkedHead = 
other.childUnlinkedHead;<a name="line.552"></a>
-<span class="sourceLineNo">553</span>      } else {<a name="line.553"></a>
-<span class="sourceLineNo">554</span>        // append replay list<a 
name="line.554"></a>
-<span class="sourceLineNo">555</span>        assert replayOrderTail.replayNext 
== null;<a name="line.555"></a>
-<span class="sourceLineNo">556</span>        assert 
other.replayOrderHead.replayPrev == null;<a name="line.556"></a>
-<span class="sourceLineNo">557</span>        replayOrderTail.replayNext = 
other.replayOrderHead;<a name="line.557"></a>
-<span class="sourceLineNo">558</span>        other.replayOrderHead.replayPrev 
= replayOrderTail;<a name="line.558"></a>
-<span class="sourceLineNo">559</span>        replayOrderTail = 
other.replayOrderTail;<a name="line.559"></a>
-<span class="sourceLineNo">560</span><a name="line.560"></a>
-<span class="sourceLineNo">561</span>        // merge rootHead<a 
name="line.561"></a>
-<span class="sourceLineNo">562</span>        if (rootHead == null) {<a 
name="line.562"></a>
-<span class="sourceLineNo">563</span>          rootHead = other.rootHead;<a 
name="line.563"></a>
-<span class="sourceLineNo">564</span>        } else if (other.rootHead != 
null) {<a name="line.564"></a>
-<span class="sourceLineNo">565</span>          Entry otherTail = 
findLinkListTail(other.rootHead);<a name="line.565"></a>
-<span class="sourceLineNo">566</span>          otherTail.linkNext = 
rootHead;<a name="line.566"></a>
-<span class="sourceLineNo">567</span>          rootHead.linkPrev = 
otherTail;<a name="line.567"></a>
-<span class="sourceLineNo">568</span>          rootHead = other.rootHead;<a 
name="line.568"></a>
-<span class="sourceLineNo">569</span>        }<a name="line.569"></a>
-<span class="sourceLineNo">570</span><a name="line.570"></a>
-<span class="sourceLineNo">571</span>        // merge childUnlinkedHead<a 
name="line.571"></a>
-<span class="sourceLineNo">572</span>        if (childUnlinkedHead == null) 
{<a name="line.572"></a>
-<span class="sourceLineNo">573</span>          childUnlinkedHead = 
other.childUnlinkedHead;<a name="line.573"></a>
-<span class="sourceLineNo">574</span>        } else if 
(other.childUnlinkedHead != null) {<a name="line.574"></a>
-<span class="sourceLineNo">575</span>          Entry otherTail = 
findLinkListTail(other.childUnlinkedHead);<a name="line.575"></a>
-<span class="sourceLineNo">576</span>          otherTail.linkNext = 
childUnlinkedHead;<a name="line.576"></a>
-<span class="sourceLineNo">577</span>          childUnlinkedHead.linkPrev = 
otherTail;<a name="line.577"></a>
-<span class="sourceLineNo">578</span>          childUnlinkedHead = 
other.childUnlinkedHead;<a name="line.578"></a>
-<span class="sourceLineNo">579</span>        }<a name="line.579"></a>
-<span class="sourceLineNo">580</span>      }<a name="line.580"></a>
-<span class="sourceLineNo">581</span>      maxProcId = Math.max(maxProcId, 
other.maxProcId);<a name="line.581"></a>
-<span class="sourceLineNo">582</span>      minProcId = Math.max(minProcId, 
other.minProcId);<a name="line.582"></a>
-<span class="sourceLineNo">583</span><a name="line.583"></a>
-<span class="sourceLineNo">584</span>      other.clear();<a 
name="line.584"></a>
-<span class="sourceLineNo">585</span>    }<a name="line.585"></a>
-<span class="sourceLineNo">586</span><a name="line.586"></a>
-<span class="sourceLineNo">587</span>    /*<a name="line.587"></a>
-<span class="sourceLineNo">588</span>     * Returns an EntryIterator with the 
list of procedures ready<a name="line.588"></a>
-<span class="sourceLineNo">589</span>     * to be added to the executor.<a 
name="line.589"></a>
-<span class="sourceLineNo">590</span>     * A Procedure is ready if its 
children and parent are ready.<a name="line.590"></a>
-<span class="sourceLineNo">591</span>     */<a name="line.591"></a>
-<span class="sourceLineNo">592</span>    public EntryIterator fetchReady() {<a 
name="line.592"></a>
-<span class="sourceLineNo">593</span>      buildGraph();<a name="line.593"></a>
-<span class="sourceLineNo">594</span><a name="line.594"></a>
-<span class="sourceLineNo">595</span>      Entry readyHead = null;<a 
name="line.595"></a>
-<span class="sourceLineNo">596</span>      Entry readyTail = null;<a 
name="line.596"></a>
-<span class="sourceLineNo">597</span>      Entry p = replayOrderHead;<a 
name="line.597"></a>
-<span class="sourceLineNo">598</span>      while (p != null) {<a 
name="line.598"></a>
-<span class="sourceLineNo">599</span>        Entry next = p.replayNext;<a 
name="line.599"></a>
-<span class="sourceLineNo">600</span>        if (p.isReady()) {<a 
name="line.600"></a>
-<span class="sourceLineNo">601</span>          unlinkFromReplayList(p);<a 
name="line.601"></a>
-<span class="sourceLineNo">602</span>          if (readyTail != null) {<a 
name="line.602"></a>
-<span class="sourceLineNo">603</span>            readyTail.replayNext = p;<a 
name="line.603"></a>
-<span class="sourceLineNo">604</span>            p.replayPrev = readyTail;<a 
name="line.604"></a>
-<span class="sourceLineNo">605</span>          } else {<a name="line.605"></a>
-<span class="sourceLineNo">606</span>            p.replayPrev = null;<a 
name="line.606"></a>
-<span class="sourceLineNo">607</span>            readyHead = p;<a 
name="line.607"></a>
-<span class="sourceLineNo">608</span>          }<a name="line.608"></a>
-<span class="sourceLineNo">609</span>          readyTail = p;<a 
name="line.609"></a>
-<span class="sourceLineNo">610</span>          p.replayNext = null;<a 
name="line.610"></a>
-<span class="sourceLineNo">611</span>        }<a name="line.611"></a>
-<span class="sourceLineNo">612</span>        p = next;<a name="line.612"></a>
-<span class="sourceLineNo">613</span>      }<a name="line.613"></a>
-<span class="sourceLineNo">614</span>      // we need the hash-table lookups 
for parents, so this must be done<a name="line.614"></a>
-<span class="sourceLineNo">615</span>      // out of the loop where we check 
isReadyToRun()<a name="line.615"></a>
-<span class="sourceLineNo">616</span>      for (p = readyHead; p != null; p = 
p.replayNext) {<a name="line.616"></a>
-<span class="sourceLineNo">617</span>        removeFromMap(p.getProcId());<a 
name="line.617"></a>
-<span class="sourceLineNo">618</span>        unlinkFromLinkList(p);<a 
name="line.618"></a>
-<span class="sourceLineNo">619</span>      }<a name="line.619"></a>
-<span class="sourceLineNo">620</span>      return readyHead != null ? new 
EntryIterator(readyHead) : null;<a name="line.620"></a>
-<span class="sourceLineNo">621</span>    }<a name="line.621"></a>
-<span class="sourceLineNo">622</span><a name="line.622"></a>
-<span class="sourceLineNo">623</span>    /*<a name="line.623"></a>
-<span class="sourceLineNo">624</span>     * Drain this map and return all 
procedures in it.<a name="line.624"></a>
-<span class="sourceLineNo">625</span>     */<a name="line.625"></a>
-<span class="sourceLineNo">626</span>    public EntryIterator fetchAll() {<a 
name="line.626"></a>
-<span class="sourceLineNo">627</span>      Entry head = replayOrderHead;<a 
name="line.627"></a>
-<span class="sourceLineNo">628</span>      for (Entry p = head; p != null; p = 
p.replayNext) {<a name="line.628"></a>
-<span class="sourceLineNo">629</span>        removeFromMap(p.getProcId());<a 
name="line.629"></a>
-<span class="sourceLineNo">630</span>      }<a name="line.630"></a>
-<span class="sourceLineNo">631</span>      for (int i = 0; i &lt; 
procedureMap.length; ++i) {<a name="line.631"></a>
-<span class="sourceLineNo">632</span>        assert procedureMap[i] == null : 
"map not empty i=" + i;<a name="line.632"></a>
-<span class="sourceLineNo">633</span>      }<a name="line.633"></a>
-<span class="sourceLineNo">634</span>      replayOrderHead = null;<a 
name="line.634"></a>
-<span class="sourceLineNo">635</span>      replayOrderTail = null;<a 
name="line.635"></a>
-<span class="sourceLineNo">636</span>      childUnlinkedHead = null;<a 
name="line.636"></a>
-<span class="sourceLineNo">637</span>      rootHead = null;<a 
name="line.637"></a>
-<span class="sourceLineNo">638</span>      return head != null ? new 
EntryIterator(head) : null;<a name="line.638"></a>
-<span class="sourceLineNo">639</span>    }<a name="line.639"></a>
-<span class="sourceLineNo">640</span><a name="line.640"></a>
-<span class="sourceLineNo">641</span>    private void buildGraph() {<a 
name="line.641"></a>
-<span class="sourceLineNo">642</span>      Entry p = childUnlinkedHead;<a 
name="line.642"></a>
-<span class="sourceLineNo">643</span>      while (p != null) {<a 
name="line.643"></a>
-<span class="sourceLineNo">644</span>        Entry next = p.linkNext;<a 
name="line.644"></a>
-<span class="sourceLineNo">645</span>        Entry rootProc = 
getRootProcedure(p);<a name="line.645"></a>
-<span class="sourceLineNo">646</span>        if (rootProc != null) {<a 
name="line.646"></a>
-<span class="sourceLineNo">647</span>          rootProc.childHead = 
addToLinkList(p, rootProc.childHead);<a name="line.647"></a>
-<span class="sourceLineNo">648</span>        }<a name="line.648"></a>
-<span class="sourceLineNo">649</span>        p = next;<a name="line.649"></a>
-<span class="sourceLineNo">650</span>      }<a name="line.650"></a>
-<span class="sourceLineNo">651</span><a name="line.651"></a>
-<span class="sourceLineNo">652</span>      for (p = rootHead; p != null; p = 
p.linkNext) {<a name="line.652"></a>
-<span class="sourceLineNo">653</span>        checkReadyToRun(p);<a 
name="line.653"></a>
-<span class="sourceLineNo">654</span>      }<a name="line.654"></a>
-<span class="sourceLineNo">655</span>    }<a name="line.655"></a>
-<span class="sourceLineNo">656</span><a name="line.656"></a>
-<span class="sourceLineNo">657</span>    private Entry getRootProcedure(Entry 
entry) {<a name="line.657"></a>
-<span class="sourceLineNo">658</span>      while (entry != null &amp;&amp; 
entry.hasParent()) {<a name="line.658"></a>
-<span class="sourceLineNo">659</span>        entry = 
getProcedure(entry.getParentId());<a name="line.659"></a>
-<span class="sourceLineNo">660</span>      }<a name="line.660"></a>
-<span class="sourceLineNo">661</span>      return entry;<a name="line.661"></a>
-<span class="sourceLineNo">662</span>    }<a name="line.662"></a>
-<span class="sourceLineNo">663</span><a name="line.663"></a>
-<span class="sourceLineNo">664</span>    /*<a name="line.664"></a>
-<span class="sourceLineNo">665</span>     * (see the comprehensive explanation 
in the beginning of the file)<a name="line.665"></a>
-<span class="sourceLineNo">666</span>     * A Procedure is ready when parent 
and children are ready.<a name="line.666"></a>
-<span class="sourceLineNo">667</span>     * "ready" means that we all the 
information that we need in-memory.<a name="line.667"></a>
-<span class="sourceLineNo">668</span>     *<a name="line.668"></a>
-<span class="sourceLineNo">669</span>     * Example-1:<a name="line.669"></a>
-<span class="sourceLineNo">670</span>     * We have two WALs, we start reading 
from the newest (wal-2)<a name="line.670"></a>
-<span class="sourceLineNo">671</span>     *    wal-2 | C B |<a 
name="line.671"></a>
-<span class="sourceLineNo">672</span>     *    wal-1 | A B C |<a 
name="line.672"></a>
-<span class="sourceLineNo">673</span>     *<a name="line.673"></a>
-<span class="sourceLineNo">674</span>     * If C and B don't depend on A (A is 
not the parent), we can start them<a name="line.674"></a>
-<span class="sourceLineNo">675</span>     * before reading wal-1. If B is the 
only one with parent A we can start C.<a name="line.675"></a>
-<span class="sourceLineNo">676</span>     * We have to read one more WAL 
before being able to start B.<a name="line.676"></a>
-<span class="sourceLineNo">677</span>     *<a name="line.677"></a>
-<span class="sourceLineNo">678</span>     * How do we know with the only 
information in B that we are not ready.<a name="line.678"></a>
-<span class="sourceLineNo">679</span>     *  - easy case, the parent is 
missing from the global map<a name="line.679"></a>
-<span class="sourceLineNo">680</span>     *  - more complex case we look at 
the Stack IDs.<a name="line.680"></a>
-<span class="sourceLineNo">681</span>     *<a name="line.681"></a>
-<span class="sourceLineNo">682</span>     * The Stack-IDs are added to the 
procedure order as an incremental index<a name="line.682"></a>
-<span class="sourceLineNo">683</span>     * tracking how many times that 
procedure was executed, which is equivalent<a name="line.683"></a>
-<span class="sourceLineNo">684</span>     * to the number of times we wrote 
the procedure to the WAL.<a name="line.684"></a>
-<span class="sourceLineNo">685</span>     * In the example above:<a 
name="line.685"></a>
-<span class="sourceLineNo">686</span>     *   wal-2: B has stackId = [1, 2]<a 
name="line.686"></a>
-<span class="sourceLineNo">687</span>     *   wal-1: B has stackId = [1]<a 
name="line.687"></a>
-<span class="sourceLineNo">688</span>     *   wal-1: A has stackId = [0]<a 
name="line.688"></a>
-<span class="sourceLineNo">689</span>     *<a name="line.689"></a>
-<span class="sourceLineNo">690</span>     * Since we know that the Stack-IDs 
are incremental for a Procedure,<a name="line.690"></a>
-<span class="sourceLineNo">691</span>     * we notice that there is a gap in 
the stackIds of B, so something was<a name="line.691"></a>
-<span class="sourceLineNo">692</span>     * executed before.<a 
name="line.692"></a>
-<span class="sourceLineNo">693</span>     * To identify when a Procedure is 
ready we do the sum of the stackIds of<a name="line.693"></a>
-<span class="sourceLineNo">694</span>     * the procedure and the parent. if 
the stackIdSum is equal to the<a name="line.694"></a>
-<span class="sourceLineNo">695</span>     * sum of {1..maxStackId} then 
everything we need is available.<a name="line.695"></a>
-<span class="sourceLineNo">696</span>     *<a name="line.696"></a>
-<span class="sourceLineNo">697</span>     * Example-2<a name="line.697"></a>
-<span class="sourceLineNo">698</span>     *    wal-2 | A |              A 
stackIds = [0, 2]<a name="line.698"></a>
-<span class="sourceLineNo">699</span>     *    wal-1 | A B |            B 
stackIds = [1]<a name="line.699"></a>
-<span class="sourceLineNo">700</span>     *<a name="line.700"></a>
-<span class="sourceLineNo">701</span>     * There is a gap between A stackIds 
so something was executed in between.<a name="line.701"></a>
-<span class="sourceLineNo">702</span>     */<a name="line.702"></a>
-<span class="sourceLineNo">703</span>    private boolean checkReadyToRun(Entry 
rootEntry) {<a name="line.703"></a>
-<span class="sourceLineNo">704</span>      assert !rootEntry.hasParent() : 
"expected root procedure, got " + rootEntry;<a name="line.704"></a>
-<span class="sourceLineNo">705</span><a name="line.705"></a>
-<span class="sourceLineNo">706</span>      if (rootEntry.isFinished()) {<a 
name="line.706"></a>
-<span class="sourceLineNo">707</span>        // If the root procedure is 
finished, sub-procedures should be gone<a name="line.707"></a>
-<span class="sourceLineNo">708</span>        if (rootEntry.childHead != null) 
{<a name="line.708"></a>
-<span class="sourceLineNo">709</span>          LOG.error("unexpected active 
children for root-procedure: " + rootEntry);<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>            LOG.error("unexpected active 
children: " + p);<a name="line.711"></a>
-<span class="sourceLineNo">712</span>          }<a name="line.712"></a>
-<span class="sourceLineNo">713</span>        }<a name="line.713"></a>
-<span class="sourceLineNo">714</span><a name="line.714"></a>
-<span class="sourceLineNo">715</span>        assert rootEntry.childHead == 
null : "unexpected children on root completion. " + rootEntry;<a 
name="line.715"></a>
-<span class="sourceLineNo">716</span>        rootEntry.ready = true;<a 
name="line.716"></a>
-<span class="sourceLineNo">717</span>        return true;<a 
name="line.717"></a>
-<span class="sourceLineNo">718</span>      }<a name="line.718"></a>
-<span class="sourceLineNo">719</span><a name="line.719"></a>
-<span class="sourceLineNo">720</span>      int stackIdSum = 0;<a 
name="line.720"></a>
-<span class="sourceLineNo">721</span>      int maxStackId = 0;<a 
name="line.721"></a>
-<span class="sourceLineNo">722</span>      for (int i = 0; i &lt; 
rootEntry.proto.getStackIdCount(); ++i) {<a name="line.722"></a>
-<span class="sourceLineNo">723</span>        int stackId = 1 + 
rootEntry.proto.getStackId(i);<a name="line.723"></a>
-<span class="sourceLineNo">724</span>        maxStackId  = 
Math.max(maxStackId, stackId);<a name="line.724"></a>
-<span class="sourceLineNo">725</span>        stackIdSum += stackId;<a 
name="line.725"></a>
-<span class="sourceLineNo">726</span>        if (LOG.isTraceEnabled()) {<a 
name="line.726"></a>
-<span class="sourceLineNo">727</span>          LOG.trace("stackId=" + stackId 
+ " stackIdSum=" + stackIdSum +<a name="line.727"></a>
-<span class="sourceLineNo">728</span>          " maxStackid=" + maxStackId + " 
" + rootEntry);<a name="line.728"></a>
-<span class="sourceLineNo">729</span>        }<a name="line.729"></a>
-<span class="sourceLineNo">730</span>      }<a name="line.730"></a>
-<span class="sourceLineNo">731</span><a name="line.731"></a>
-<span class="sourceLineNo">732</span>      for (Entry p = rootEntry.childHead; 
p != null; p = p.linkNext) {<a name="line.732"></a>
-<span class="sourceLineNo">733</span>        for (int i = 0; i &lt; 
p.proto.getStackIdCount(); ++i) {<a name="line.733"></a>
-<span class="sourceLineNo">734</span>          int stackId = 1 + 
p.proto.getStackId(i);<a name="line.734"></a>
-<span class="sourceLineNo">735</span>          maxStackId  = 
Math.max(maxStackId, stackId);<a name="line.735"></a>
-<span class="sourceLineNo">736</span>          stackIdSum += stackId;<a 
name="line.736"></a>
-<span class="sourceLineNo">737</span>          if (LOG.isTraceEnabled()) {<a 
name="line.737"></a>
-<span class="sourceLineNo">738</span>            LOG.trace("stackId=" + 
stackId + " stackIdSum=" + stackIdSum +<a name="line.738"></a>
-<span class="sourceLineNo">739</span>              " maxStackid=" + maxStackId 
+ " " + p);<a name="line.739"></a>
-<span class="sourceLineNo">740</span>          }<a name="line.740"></a>
-<span class="sourceLineNo">741</span>        }<a name="line.741"></a>
-<span class="sourceLineNo">742</span>      }<a name="line.742"></a>
-<span class="sourceLineNo">743</span>      // The cmpStackIdSum is this 
formula for finding the sum of a series of numbers:<a name="line.743"></a>
-<span class="sourceLineNo">744</span>      // 
http://www.wikihow.com/Sum-the-Integers-from-1-to-N#/Image:Sum-the-Integers-from-1-to-N-Step-2-Version-3.jpg<a
 name="line.744"></a>
-<span class="sourceLineNo">745</span>      final int cmpStackIdSum = 
(maxStackId * (maxStackId + 1) / 2);<a name="line.745"></a>
-<span class="sourceLineNo">746</span>      if (cmpStackIdSum == stackIdSum) 
{<a name="line.746"></a>
-<span class="sourceLineNo">747</span>        rootEntry.ready = true;<a 
name="line.747"></a>
-<span class="sourceLineNo">748</span>        for (Entry p = 
rootEntry.childHead; p != null; p = p.linkNext) {<a name="line.748"></a>
-<span class="sourceLineNo">749</span>          p.ready = true;<a 
name="line.749"></a>
-<span class="sourceLineNo">750</span>        }<a name="line.750"></a>
-<span class="sourceLineNo">751</span>        return true;<a 
name="line.751"></a>
-<span class="sourceLineNo">752</span>      }<a name="line.752"></a>
-<span class="sourceLineNo">753</span>      return false;<a name="line.753"></a>
-<span class="sourceLineNo">754</span>    }<a name="line.754"></a>
-<span class="sourceLineNo">755</span><a name="line.755"></a>
-<span class="sourceLineNo">756</span>    private void 
unlinkFromReplayList(Entry entry) {<a name="line.756"></a>
-<span class="sourceLineNo">757</span>      if (replayOrderHead == entry) {<a 
name="line.757"></a>
-<span class="sourceLineNo">758</span>        replayOrderHead = 
entry.replayNext;<a name="line.758"></a>
-<span class="sourceLineNo">759</span>      }<a name="line.759"></a>
-<span class="sourceLineNo">760</span>      if (replayOrderTail == entry) {<a 
name="line.760"></a>
-<span class="sourceLineNo">761</span>        replayOrderTail = 
entry.replayPrev;<a name="line.761"></a>
-<span class="sourceLineNo">762</span>      }<a name="line.762"></a>
-<span class="sourceLineNo">763</span>      if (entry.replayPrev != null) {<a 
name="line.763"></a>
-<span class="sourceLineNo">764</span>        entry.replayPrev.replayNext = 
entry.replayNext;<a name="line.764"></a>
-<span class="sourceLineNo">765</span>      }<a name="line.765"></a>
-<span class="sourceLineNo">766</span>      if (entry.replayNext != null) {<a 
name="line.766"></a>
-<span class="sourceLineNo">767</span>        entry.replayNext.replayPrev = 
entry.replayPrev;<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><a name="line.770"></a>
-<span class="sourceLineNo">771</span>    private void addToReplayList(final 
Entry entry) {<a name="line.771"></a>
-<span class="sourceLineNo">772</span>      unlinkFromReplayList(entry);<a 
name="line.772"></a>
-<span class="sourceLineNo">773</span>      entry.replayNext = 
replayOrderHead;<a name="line.773"></a>
-<span class="sourceLineNo">774</span>      entry.replayPrev = null;<a 
name="line.774"></a>
-<span class="sourceLineNo">775</span>      if (replayOrderHead != null) {<a 
name="line.775"></a>
-<span class="sourceLineNo">776</span>        replayOrderHead.replayPrev = 
entry;<a name="line.776"></a>
-<span class="sourceLineNo">777</span>      } else {<a name="line.777"></a>
-<span class="sourceLineNo">778</span>        replayOrderTail = entry;<a 
name="line.778"></a>
-<span class="sourceLineNo">779</span>      }<a name="line.779"></a>
-<span class="sourceLineNo">780</span>      replayOrderHead = entry;<a 
name="line.780"></a>
-<span class="sourceLineNo">781</span>    }<a name="line.781"></a>
-<span class="sourceLineNo">782</span><a name="line.782"></a>
-<span class="sourceLineNo">783</span>    private void unlinkFromLinkList(Entry 
entry) {<a name="line.783"></a>
-<span class="sourceLineNo">784</span>      if (entry == rootHead) {<a 
name="line.784"></a>
-<span class="sourceLineNo">785</span>        rootHead = entry.linkNext;<a 
name="line.785"></a>
-<span class="sourceLineNo">786</span>      } else if (entry == 
childUnlinkedHead) {<a name="line.786"></a>
-<span class="sourceLineNo">787</span>        childUnlinkedHead = 
entry.linkNext;<a name="line.787"></a>
-<span class="sourceLineNo">788</span>      }<a name="line.788"></a>
-<span class="sourceLineNo">789</span>      if (entry.linkPrev != null) {<a 
name="line.789"></a>
-<span class="sourceLineNo">790</span>        entry.linkPrev.linkNext = 
entry.linkNext;<a name="line.790"></a>
-<span class="sourceLineNo">791</span>      }<a name="line.791"></a>
-<span class="sourceLineNo">792</span>      if (entry.linkNext != null) {<a 
name="line.792"></a>
-<span class="sourceLineNo">793</span>        entry.linkNext.linkPrev = 
entry.linkPrev;<a name="line.793"></a>
-<span class="sourceLineNo">794</span>      }<a name="line.794"></a>
-<span class="sourceLineNo">795</span>    }<a name="line.795"></a>
-<span class="sourceLineNo">796</span><a name="line.796"></a>
-<span class="sourceLineNo">797</span>    private Entry addToLinkList(Entry 
entry, Entry linkHead) {<a name="line.797"></a>
-<span class="sourceLineNo">798</span>      unlinkFromLinkList(entry);<a 
name="line.798"></a>
-<span class="sourceLineNo">799</span>      entry.linkNext = linkHead;<a 
name="line.799"></a>
-<span class="sourceLineNo">800</span>      entry.linkPrev = null;<a 
name="line.800"></a>
-<span class="sourceLineNo">801</span>      if (linkHead != null) {<a 
name="line.801"></a>
-<span class="sourceLineNo">802</span>        linkHead.linkPrev = entry;<a 
name="line.802"></a>
-<span class="sourceLineNo">803</span>      }<a name="line.803"></a>
-<span class="sourceLineNo">804</span>      return entry;<a name="line.804"></a>
-<span class="sourceLineNo">805</span>    }<a name="line.805"></a>
-<span class="sourceLineNo">806</span><a name="line.806"></a>
-<span class="sourceLineNo">807</span>    private Entry findLinkListTail(Entry 
linkHead) {<a name="line.807"></a>
-<span class="sourceLineNo">808</span>      Entry tail = linkHead;<a 
name="line.808"></a>
-<span class="sourceLineNo">809</span>      while (tail.linkNext != null) {<a 
name="line.809"></a>
-<span class="sourceLineNo">810</span>        tail = tail.linkNext;<a 
name="line.810"></a>
-<span class="sourceLineNo">811</span>      }<a name="line.811"></a>
-<span class="sourceLineNo">812</span>      return tail;<a name="line.812"></a>
-<span class="sourceLineNo">813</span>    }<a name="line.813"></a>
-<span class="sourceLineNo">814</span><a name="line.814"></a>
-<span class="sourceLineNo">815</span>    private Entry addToMap(final long 
procId, final boolean hasParent) {<a name="line.815"></a>
-<span class="sourceLineNo">816</span>      int slotIndex = 
getMapSlot(procId);<a name="line.816"></a>
-<span class="sourceLineNo">817</span>      Entry entry = 
getProcedure(slotIndex, procId);<a name="line.817"></a>
-<span class="sourceLineNo">818</span>      if (entry != null) return entry;<a 
name="line.818"></a>
-<span class="sourceLineNo">819</span><a name="line.819"></a>
-<span class="sourceLineNo">820</span>      entry = new 
Entry(procedureMap[slotIndex]);<a name="line.820"></a>
-<span class="sourceLineNo">821</span>      procedureMap[slotIndex] = entry;<a 
name="line.821"></a>
-<span class="sourceLineNo">822</span>      return entry;<a name="line.822"></a>
-<span class="sourceLineNo">823</span>    }<a name="line.823"></a>
-<span class="sourceLineNo">824</span><a name="line.824"></a>
-<span class="sourceLineNo">825</span>    private Entry removeFromMap(final 
long procId) {<a name="line.825"></a>
-<span class="sourceLineNo">826</span>      int slotIndex = 
getMapSlot(procId);<a name="line.826"></a>
-<span class="sourceLineNo">827</span>      Entry prev = null;<a 
name="line.827"></a>
-<span class="sourceLineNo">828</span>      Entry entry = 
procedureMap[slotIndex];<a name="line.828"></a>
-<span class="sourceLineNo">829</span>      while (entry != null) {<a 
name="line.829"></a>
-<span class="sourceLineNo">830</span>        if (procId == entry.getProcId()) 
{<a name="line.830"></a>
-<span class="sourceLineNo">831</span>          if (prev != null) {<a 
name="line.831"></a>
-<span class="sourceLineNo">832</span>            prev.hashNext = 
entry.hashNext;<a name="line.832"></a>
-<span class="sourceLineNo">833</span>          } else {<a name="line.833"></a>
-<span class="sourceLineNo">834</span>            procedureMap[slotIndex] = 
entry.hashNext;<a name="line.834"></a>
-<span class="sourceLineNo">835</span>          }<a name="line.835"></a>
-<span class="sourceLineNo">836</span>          entry.hashNext = null;<a 
name="line.836"></a>
-<span class="sourceLineNo">837</span>          return entry;<a 
name="line.837"></a>
-<span class="sourceLineNo">838</span>        }<a name="line.838"></a>
-<span class="sourceLineNo">839</span>        prev = entry;<a 
name="line.839"></a>
-<span class="sourceLineNo">840</span>        entry = entry.hashNext;<a 
name="line.840"></a>
-<span class="sourceLineNo">841</span>      }<a name="line.841"></a>
-<span class="sourceLineNo">842</span>      return null;<a name="line.842"></a>
-<span class="sourceLineNo">843</span>    }<a name="line.843"></a>
-<span class="sourceLineNo">844</span><a name="line.844"></a>
-<span class="sourceLineNo">845</span>    private Entry getProcedure(final long 
procId) {<a name="line.845"></a>
-<span class="sourceLineNo">846</span>      return 
getProcedure(getMapSlot(procId), procId);<a name="line.846"></a>
-<span class="sourceLineNo">847</span>    }<a name="line.847"></a>
-<span class="sourceLineNo">848</span><a name="line.848"></a>
-<span class="sourceLineNo">849</span>    private Entry getProcedure(final int 
slotIndex, final long procId) {<a name="line.849"></a>
-<span class="sourceLineNo">850</span>      Entry entry = 
procedureMap[slotIndex];<a name="line.850"></a>
-<span class="sourceLineNo">851</span>      while (entry != null) {<a 
name="line.851"></a>
-<span class="sourceLineNo">852</span>        if (procId == entry.getProcId()) 
{<a name="line.852"></a>
-<span class="sourceLineNo">853</span>          return entry;<a 
name="line.853"></a>
-<span class="sourceLineNo">854</span>        }<a name="line.854"></a>
-<span class="sourceLineNo">855</span>        entry = entry.hashNext;<a 
name="line.855"></a>
-<span class="sourceLineNo">856</span>      }<a name="line.856"></a>
-<span class="sourceLineNo">857</span>      return null;<a name="line.857"></a>
-<span class="sourceLineNo">858</span>    }<a name="line.858"></a>
-<span class="sourceLineNo">859</span><a name="line.859"></a>
-<span class="sourceLineNo">860</span>    private int getMapSlot(final long 
procId) {<a name="line.860"></a>
-<span class="sourceLineNo">861</span>      return 
(int)(Procedure.getProcIdHashCode(procId) % procedureMap.length);<a 
name="line.861"></a>
-<span class="sourceLineNo">862</span>    }<a name="line.862"></a>
-<span class="sourceLineNo">863</span>  }<a name="line.863"></a>
-<span class="sourceLineNo">864</span>}<a name="line.864"></a>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-</pre>
-</div>
-</body>
-</html>
[22/47] hbase-site git commit: Published site at 118b0746849c886fc64b0a53014f3186e2db4d9d.

Reply via email to
