You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2018/10/12 14:53:13 UTC
[18/51] [partial] hbase-site git commit: Published site at
fa5fa6ecdd071b72b58971058ff3ab9d28c3e709.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/d1341859/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
index bd1b3f6..0c69df9 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
@@ -31,430 +31,441 @@
<span class="sourceLineNo">023</span>import java.util.Iterator;<a name="line.23"></a>
<span class="sourceLineNo">024</span>import java.util.Map;<a name="line.24"></a>
<span class="sourceLineNo">025</span>import java.util.TreeMap;<a name="line.25"></a>
-<span class="sourceLineNo">026</span><a name="line.26"></a>
+<span class="sourceLineNo">026</span>import java.util.stream.LongStream;<a name="line.26"></a>
<span class="sourceLineNo">027</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.27"></a>
<span class="sourceLineNo">028</span>import org.apache.yetus.audience.InterfaceStability;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a name="line.29"></a>
-<span class="sourceLineNo">030</span><a name="line.30"></a>
-<span class="sourceLineNo">031</span>/**<a name="line.31"></a>
-<span class="sourceLineNo">032</span> * Keeps track of live procedures.<a name="line.32"></a>
-<span class="sourceLineNo">033</span> *<a name="line.33"></a>
-<span class="sourceLineNo">034</span> * It can be used by the ProcedureStore to identify which procedures are already<a name="line.34"></a>
-<span class="sourceLineNo">035</span> * deleted/completed to avoid the deserialization step on restart<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 ProcedureStoreTracker {<a name="line.39"></a>
-<span class="sourceLineNo">040</span> // Key is procedure id corresponding to first bit of the bitmap.<a name="line.40"></a>
-<span class="sourceLineNo">041</span> private final TreeMap<Long, BitSetNode> map = new TreeMap<>();<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> * If true, do not remove bits corresponding to deleted procedures. Note that this can result<a name="line.44"></a>
-<span class="sourceLineNo">045</span> * in huge bitmaps overtime.<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * Currently, it's set to true only when building tracker state from logs during recovery. During<a name="line.46"></a>
-<span class="sourceLineNo">047</span> * recovery, if we are sure that a procedure has been deleted, reading its old update entries<a name="line.47"></a>
-<span class="sourceLineNo">048</span> * can be skipped.<a name="line.48"></a>
-<span class="sourceLineNo">049</span> */<a name="line.49"></a>
-<span class="sourceLineNo">050</span> private boolean keepDeletes = false;<a name="line.50"></a>
-<span class="sourceLineNo">051</span> /**<a name="line.51"></a>
-<span class="sourceLineNo">052</span> * If true, it means tracker has incomplete information about the active/deleted procedures.<a name="line.52"></a>
-<span class="sourceLineNo">053</span> * It's set to true only when recovering from old logs. See {@link #isDeleted(long)} docs to<a name="line.53"></a>
-<span class="sourceLineNo">054</span> * understand it's real use.<a name="line.54"></a>
-<span class="sourceLineNo">055</span> */<a name="line.55"></a>
-<span class="sourceLineNo">056</span> boolean partial = false;<a name="line.56"></a>
-<span class="sourceLineNo">057</span><a name="line.57"></a>
-<span class="sourceLineNo">058</span> private long minModifiedProcId = Long.MAX_VALUE;<a name="line.58"></a>
-<span class="sourceLineNo">059</span> private long maxModifiedProcId = Long.MIN_VALUE;<a name="line.59"></a>
-<span class="sourceLineNo">060</span><a name="line.60"></a>
-<span class="sourceLineNo">061</span> public enum DeleteState { YES, NO, MAYBE }<a name="line.61"></a>
-<span class="sourceLineNo">062</span><a name="line.62"></a>
-<span class="sourceLineNo">063</span> public void resetToProto(ProcedureProtos.ProcedureStoreTracker trackerProtoBuf) {<a name="line.63"></a>
-<span class="sourceLineNo">064</span> reset();<a name="line.64"></a>
-<span class="sourceLineNo">065</span> for (ProcedureProtos.ProcedureStoreTracker.TrackerNode protoNode: trackerProtoBuf.getNodeList()) {<a name="line.65"></a>
-<span class="sourceLineNo">066</span> final BitSetNode node = new BitSetNode(protoNode);<a name="line.66"></a>
-<span class="sourceLineNo">067</span> map.put(node.getStart(), node);<a name="line.67"></a>
-<span class="sourceLineNo">068</span> }<a name="line.68"></a>
-<span class="sourceLineNo">069</span> }<a name="line.69"></a>
-<span class="sourceLineNo">070</span><a name="line.70"></a>
-<span class="sourceLineNo">071</span> /**<a name="line.71"></a>
-<span class="sourceLineNo">072</span> * Resets internal state to same as given {@code tracker}. Does deep copy of the bitmap.<a name="line.72"></a>
-<span class="sourceLineNo">073</span> */<a name="line.73"></a>
-<span class="sourceLineNo">074</span> public void resetTo(ProcedureStoreTracker tracker) {<a name="line.74"></a>
-<span class="sourceLineNo">075</span> resetTo(tracker, false);<a name="line.75"></a>
-<span class="sourceLineNo">076</span> }<a name="line.76"></a>
-<span class="sourceLineNo">077</span><a name="line.77"></a>
-<span class="sourceLineNo">078</span> /**<a name="line.78"></a>
-<span class="sourceLineNo">079</span> * Resets internal state to same as given {@code tracker}, and change the deleted flag according<a name="line.79"></a>
-<span class="sourceLineNo">080</span> * to the modified flag if {@code resetDelete} is true. Does deep copy of the bitmap.<a name="line.80"></a>
-<span class="sourceLineNo">081</span> * <p/><a name="line.81"></a>
-<span class="sourceLineNo">082</span> * The {@code resetDelete} will be set to true when building cleanup tracker, please see the<a name="line.82"></a>
-<span class="sourceLineNo">083</span> * comments in {@link BitSetNode#BitSetNode(BitSetNode, boolean)} to learn how we change the<a name="line.83"></a>
-<span class="sourceLineNo">084</span> * deleted flag if {@code resetDelete} is true.<a name="line.84"></a>
-<span class="sourceLineNo">085</span> */<a name="line.85"></a>
-<span class="sourceLineNo">086</span> public void resetTo(ProcedureStoreTracker tracker, boolean resetDelete) {<a name="line.86"></a>
-<span class="sourceLineNo">087</span> reset();<a name="line.87"></a>
-<span class="sourceLineNo">088</span> this.partial = tracker.partial;<a name="line.88"></a>
-<span class="sourceLineNo">089</span> this.minModifiedProcId = tracker.minModifiedProcId;<a name="line.89"></a>
-<span class="sourceLineNo">090</span> this.maxModifiedProcId = tracker.maxModifiedProcId;<a name="line.90"></a>
-<span class="sourceLineNo">091</span> this.keepDeletes = tracker.keepDeletes;<a name="line.91"></a>
-<span class="sourceLineNo">092</span> for (Map.Entry<Long, BitSetNode> entry : tracker.map.entrySet()) {<a name="line.92"></a>
-<span class="sourceLineNo">093</span> map.put(entry.getKey(), new BitSetNode(entry.getValue(), resetDelete));<a name="line.93"></a>
-<span class="sourceLineNo">094</span> }<a name="line.94"></a>
-<span class="sourceLineNo">095</span> }<a name="line.95"></a>
-<span class="sourceLineNo">096</span><a name="line.96"></a>
-<span class="sourceLineNo">097</span> public void insert(long procId) {<a name="line.97"></a>
-<span class="sourceLineNo">098</span> insert(null, procId);<a name="line.98"></a>
-<span class="sourceLineNo">099</span> }<a name="line.99"></a>
-<span class="sourceLineNo">100</span><a name="line.100"></a>
-<span class="sourceLineNo">101</span> public void insert(long[] procIds) {<a name="line.101"></a>
-<span class="sourceLineNo">102</span> for (int i = 0; i < procIds.length; ++i) {<a name="line.102"></a>
-<span class="sourceLineNo">103</span> insert(procIds[i]);<a name="line.103"></a>
-<span class="sourceLineNo">104</span> }<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> public void insert(long procId, long[] subProcIds) {<a name="line.107"></a>
-<span class="sourceLineNo">108</span> BitSetNode node = update(null, procId);<a name="line.108"></a>
-<span class="sourceLineNo">109</span> for (int i = 0; i < subProcIds.length; ++i) {<a name="line.109"></a>
-<span class="sourceLineNo">110</span> node = insert(node, subProcIds[i]);<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><a name="line.113"></a>
-<span class="sourceLineNo">114</span> private BitSetNode insert(BitSetNode node, long procId) {<a name="line.114"></a>
-<span class="sourceLineNo">115</span> if (node == null || !node.contains(procId)) {<a name="line.115"></a>
-<span class="sourceLineNo">116</span> node = getOrCreateNode(procId);<a name="line.116"></a>
-<span class="sourceLineNo">117</span> }<a name="line.117"></a>
-<span class="sourceLineNo">118</span> node.insertOrUpdate(procId);<a name="line.118"></a>
-<span class="sourceLineNo">119</span> trackProcIds(procId);<a name="line.119"></a>
-<span class="sourceLineNo">120</span> return node;<a name="line.120"></a>
-<span class="sourceLineNo">121</span> }<a name="line.121"></a>
-<span class="sourceLineNo">122</span><a name="line.122"></a>
-<span class="sourceLineNo">123</span> public void update(long procId) {<a name="line.123"></a>
-<span class="sourceLineNo">124</span> update(null, procId);<a name="line.124"></a>
-<span class="sourceLineNo">125</span> }<a name="line.125"></a>
-<span class="sourceLineNo">126</span><a name="line.126"></a>
-<span class="sourceLineNo">127</span> private BitSetNode update(BitSetNode node, long procId) {<a name="line.127"></a>
-<span class="sourceLineNo">128</span> node = lookupClosestNode(node, procId);<a name="line.128"></a>
-<span class="sourceLineNo">129</span> assert node != null : "expected node to update procId=" + procId;<a name="line.129"></a>
-<span class="sourceLineNo">130</span> assert node.contains(procId) : "expected procId=" + procId + " in the node";<a name="line.130"></a>
-<span class="sourceLineNo">131</span> node.insertOrUpdate(procId);<a name="line.131"></a>
-<span class="sourceLineNo">132</span> trackProcIds(procId);<a name="line.132"></a>
-<span class="sourceLineNo">133</span> return node;<a name="line.133"></a>
-<span class="sourceLineNo">134</span> }<a name="line.134"></a>
-<span class="sourceLineNo">135</span><a name="line.135"></a>
-<span class="sourceLineNo">136</span> public void delete(long procId) {<a name="line.136"></a>
-<span class="sourceLineNo">137</span> delete(null, procId);<a name="line.137"></a>
-<span class="sourceLineNo">138</span> }<a name="line.138"></a>
-<span class="sourceLineNo">139</span><a name="line.139"></a>
-<span class="sourceLineNo">140</span> public void delete(final long[] procIds) {<a name="line.140"></a>
-<span class="sourceLineNo">141</span> Arrays.sort(procIds);<a name="line.141"></a>
-<span class="sourceLineNo">142</span> BitSetNode node = null;<a name="line.142"></a>
-<span class="sourceLineNo">143</span> for (int i = 0; i < procIds.length; ++i) {<a name="line.143"></a>
-<span class="sourceLineNo">144</span> node = delete(node, procIds[i]);<a name="line.144"></a>
-<span class="sourceLineNo">145</span> }<a name="line.145"></a>
-<span class="sourceLineNo">146</span> }<a name="line.146"></a>
-<span class="sourceLineNo">147</span><a name="line.147"></a>
-<span class="sourceLineNo">148</span> private BitSetNode delete(BitSetNode node, long procId) {<a name="line.148"></a>
-<span class="sourceLineNo">149</span> node = lookupClosestNode(node, procId);<a name="line.149"></a>
-<span class="sourceLineNo">150</span> assert node != null : "expected node to delete procId=" + procId;<a name="line.150"></a>
-<span class="sourceLineNo">151</span> assert node.contains(procId) : "expected procId=" + procId + " in the node";<a name="line.151"></a>
-<span class="sourceLineNo">152</span> node.delete(procId);<a name="line.152"></a>
-<span class="sourceLineNo">153</span> if (!keepDeletes && node.isEmpty()) {<a name="line.153"></a>
-<span class="sourceLineNo">154</span> // TODO: RESET if (map.size() == 1)<a name="line.154"></a>
-<span class="sourceLineNo">155</span> map.remove(node.getStart());<a name="line.155"></a>
-<span class="sourceLineNo">156</span> }<a name="line.156"></a>
-<span class="sourceLineNo">157</span><a name="line.157"></a>
-<span class="sourceLineNo">158</span> trackProcIds(procId);<a name="line.158"></a>
-<span class="sourceLineNo">159</span> return node;<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> * Will be called when restarting where we need to rebuild the ProcedureStoreTracker.<a name="line.163"></a>
-<span class="sourceLineNo">164</span> */<a name="line.164"></a>
-<span class="sourceLineNo">165</span> public void setMinMaxModifiedProcIds(long min, long max) {<a name="line.165"></a>
-<span class="sourceLineNo">166</span> this.minModifiedProcId = min;<a name="line.166"></a>
-<span class="sourceLineNo">167</span> this.maxModifiedProcId = max;<a name="line.167"></a>
-<span class="sourceLineNo">168</span> }<a name="line.168"></a>
-<span class="sourceLineNo">169</span> /**<a name="line.169"></a>
-<span class="sourceLineNo">170</span> * This method is used when restarting where we need to rebuild the ProcedureStoreTracker. The<a name="line.170"></a>
-<span class="sourceLineNo">171</span> * {@link #delete(long)} method above assume that the {@link BitSetNode} exists, but when restart<a name="line.171"></a>
-<span class="sourceLineNo">172</span> * this is not true, as we will read the wal files in reverse order so a delete may come first.<a name="line.172"></a>
-<span class="sourceLineNo">173</span> */<a name="line.173"></a>
-<span class="sourceLineNo">174</span> public void setDeleted(long procId, boolean isDeleted) {<a name="line.174"></a>
-<span class="sourceLineNo">175</span> BitSetNode node = getOrCreateNode(procId);<a name="line.175"></a>
-<span class="sourceLineNo">176</span> assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.176"></a>
-<span class="sourceLineNo">177</span> node.updateState(procId, isDeleted);<a name="line.177"></a>
-<span class="sourceLineNo">178</span> trackProcIds(procId);<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> /**<a name="line.181"></a>
-<span class="sourceLineNo">182</span> * Set the given bit for the procId to delete if it was modified before.<a name="line.182"></a>
-<span class="sourceLineNo">183</span> * <p/><a name="line.183"></a>
-<span class="sourceLineNo">184</span> * This method is used to test whether a procedure wal file can be safely deleted, as if all the<a name="line.184"></a>
-<span class="sourceLineNo">185</span> * procedures in the given procedure wal file has been modified in the new procedure wal files,<a name="line.185"></a>
-<span class="sourceLineNo">186</span> * then we can delete it.<a name="line.186"></a>
-<span class="sourceLineNo">187</span> */<a name="line.187"></a>
-<span class="sourceLineNo">188</span> public void setDeletedIfModified(long... procId) {<a name="line.188"></a>
-<span class="sourceLineNo">189</span> BitSetNode node = null;<a name="line.189"></a>
-<span class="sourceLineNo">190</span> for (int i = 0; i < procId.length; ++i) {<a name="line.190"></a>
-<span class="sourceLineNo">191</span> node = lookupClosestNode(node, procId[i]);<a name="line.191"></a>
-<span class="sourceLineNo">192</span> if (node != null && node.isModified(procId[i])) {<a name="line.192"></a>
-<span class="sourceLineNo">193</span> node.delete(procId[i]);<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> * Similar with {@link #setDeletedIfModified(long...)}, but here the {@code procId} are given by<a name="line.199"></a>
-<span class="sourceLineNo">200</span> * the {@code tracker}. If a procedure is modified by us, and also by the given {@code tracker},<a name="line.200"></a>
-<span class="sourceLineNo">201</span> * then we mark it as deleted.<a name="line.201"></a>
-<span class="sourceLineNo">202</span> * @see #setDeletedIfModified(long...)<a name="line.202"></a>
-<span class="sourceLineNo">203</span> */<a name="line.203"></a>
-<span class="sourceLineNo">204</span> public void setDeletedIfModifiedInBoth(ProcedureStoreTracker tracker) {<a name="line.204"></a>
-<span class="sourceLineNo">205</span> BitSetNode trackerNode = null;<a name="line.205"></a>
-<span class="sourceLineNo">206</span> for (BitSetNode node : map.values()) {<a name="line.206"></a>
-<span class="sourceLineNo">207</span> final long minProcId = node.getStart();<a name="line.207"></a>
-<span class="sourceLineNo">208</span> final long maxProcId = node.getEnd();<a name="line.208"></a>
-<span class="sourceLineNo">209</span> for (long procId = minProcId; procId <= maxProcId; ++procId) {<a name="line.209"></a>
-<span class="sourceLineNo">210</span> if (!node.isModified(procId)) {<a name="line.210"></a>
-<span class="sourceLineNo">211</span> continue;<a name="line.211"></a>
-<span class="sourceLineNo">212</span> }<a name="line.212"></a>
-<span class="sourceLineNo">213</span><a name="line.213"></a>
-<span class="sourceLineNo">214</span> trackerNode = tracker.lookupClosestNode(trackerNode, procId);<a name="line.214"></a>
-<span class="sourceLineNo">215</span> if (trackerNode == null || !trackerNode.contains(procId) ||<a name="line.215"></a>
-<span class="sourceLineNo">216</span> trackerNode.isModified(procId)) {<a name="line.216"></a>
-<span class="sourceLineNo">217</span> // the procedure was removed or modified<a name="line.217"></a>
-<span class="sourceLineNo">218</span> node.delete(procId);<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> }<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> /**<a name="line.224"></a>
-<span class="sourceLineNo">225</span> * lookup the node containing the specified procId.<a name="line.225"></a>
-<span class="sourceLineNo">226</span> * @param node cached node to check before doing a lookup<a name="line.226"></a>
-<span class="sourceLineNo">227</span> * @param procId the procId to lookup<a name="line.227"></a>
-<span class="sourceLineNo">228</span> * @return the node that may contains the procId or null<a name="line.228"></a>
-<span class="sourceLineNo">229</span> */<a name="line.229"></a>
-<span class="sourceLineNo">230</span> private BitSetNode lookupClosestNode(final BitSetNode node, final long procId) {<a name="line.230"></a>
-<span class="sourceLineNo">231</span> if (node != null && node.contains(procId)) return node;<a name="line.231"></a>
-<span class="sourceLineNo">232</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.232"></a>
-<span class="sourceLineNo">233</span> return entry != null ? entry.getValue() : null;<a name="line.233"></a>
-<span class="sourceLineNo">234</span> }<a name="line.234"></a>
-<span class="sourceLineNo">235</span><a name="line.235"></a>
-<span class="sourceLineNo">236</span> private void trackProcIds(long procId) {<a name="line.236"></a>
-<span class="sourceLineNo">237</span> minModifiedProcId = Math.min(minModifiedProcId, procId);<a name="line.237"></a>
-<span class="sourceLineNo">238</span> maxModifiedProcId = Math.max(maxModifiedProcId, procId);<a name="line.238"></a>
-<span class="sourceLineNo">239</span> }<a name="line.239"></a>
-<span class="sourceLineNo">240</span><a name="line.240"></a>
-<span class="sourceLineNo">241</span> public long getModifiedMinProcId() {<a name="line.241"></a>
-<span class="sourceLineNo">242</span> return minModifiedProcId;<a name="line.242"></a>
-<span class="sourceLineNo">243</span> }<a name="line.243"></a>
-<span class="sourceLineNo">244</span><a name="line.244"></a>
-<span class="sourceLineNo">245</span> public long getModifiedMaxProcId() {<a name="line.245"></a>
-<span class="sourceLineNo">246</span> return maxModifiedProcId;<a name="line.246"></a>
-<span class="sourceLineNo">247</span> }<a name="line.247"></a>
-<span class="sourceLineNo">248</span><a name="line.248"></a>
-<span class="sourceLineNo">249</span> public void reset() {<a name="line.249"></a>
-<span class="sourceLineNo">250</span> this.keepDeletes = false;<a name="line.250"></a>
-<span class="sourceLineNo">251</span> this.partial = false;<a name="line.251"></a>
-<span class="sourceLineNo">252</span> this.map.clear();<a name="line.252"></a>
-<span class="sourceLineNo">253</span> resetModified();<a name="line.253"></a>
-<span class="sourceLineNo">254</span> }<a name="line.254"></a>
-<span class="sourceLineNo">255</span><a name="line.255"></a>
-<span class="sourceLineNo">256</span> public boolean isModified(long procId) {<a name="line.256"></a>
-<span class="sourceLineNo">257</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.257"></a>
-<span class="sourceLineNo">258</span> return entry != null && entry.getValue().contains(procId) &&<a name="line.258"></a>
-<span class="sourceLineNo">259</span> entry.getValue().isModified(procId);<a name="line.259"></a>
-<span class="sourceLineNo">260</span> }<a name="line.260"></a>
-<span class="sourceLineNo">261</span><a name="line.261"></a>
-<span class="sourceLineNo">262</span> /**<a name="line.262"></a>
-<span class="sourceLineNo">263</span> * If {@link #partial} is false, returns state from the bitmap. If no state is found for<a name="line.263"></a>
-<span class="sourceLineNo">264</span> * {@code procId}, returns YES.<a name="line.264"></a>
-<span class="sourceLineNo">265</span> * If partial is true, tracker doesn't have complete view of system state, so it returns MAYBE<a name="line.265"></a>
-<span class="sourceLineNo">266</span> * if there is no update for the procedure or if it doesn't have a state in bitmap. Otherwise,<a name="line.266"></a>
-<span class="sourceLineNo">267</span> * returns state from the bitmap.<a name="line.267"></a>
-<span class="sourceLineNo">268</span> */<a name="line.268"></a>
-<span class="sourceLineNo">269</span> public DeleteState isDeleted(long procId) {<a name="line.269"></a>
-<span class="sourceLineNo">270</span> Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.270"></a>
-<span class="sourceLineNo">271</span> if (entry != null && entry.getValue().contains(procId)) {<a name="line.271"></a>
-<span class="sourceLineNo">272</span> BitSetNode node = entry.getValue();<a name="line.272"></a>
-<span class="sourceLineNo">273</span> DeleteState state = node.isDeleted(procId);<a name="line.273"></a>
-<span class="sourceLineNo">274</span> return partial && !node.isModified(procId) ? DeleteState.MAYBE : state;<a name="line.274"></a>
-<span class="sourceLineNo">275</span> }<a name="line.275"></a>
-<span class="sourceLineNo">276</span> return partial ? DeleteState.MAYBE : DeleteState.YES;<a name="line.276"></a>
-<span class="sourceLineNo">277</span> }<a name="line.277"></a>
-<span class="sourceLineNo">278</span><a name="line.278"></a>
-<span class="sourceLineNo">279</span> public long getActiveMinProcId() {<a name="line.279"></a>
-<span class="sourceLineNo">280</span> // TODO: Cache?<a name="line.280"></a>
-<span class="sourceLineNo">281</span> Map.Entry<Long, BitSetNode> entry = map.firstEntry();<a name="line.281"></a>
-<span class="sourceLineNo">282</span> return entry == null ? 0 : entry.getValue().getActiveMinProcId();<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> public void setKeepDeletes(boolean keepDeletes) {<a name="line.285"></a>
-<span class="sourceLineNo">286</span> this.keepDeletes = keepDeletes;<a name="line.286"></a>
-<span class="sourceLineNo">287</span> // If not to keep deletes, remove the BitSetNodes which are empty (i.e. contains ids of deleted<a name="line.287"></a>
-<span class="sourceLineNo">288</span> // procedures).<a name="line.288"></a>
-<span class="sourceLineNo">289</span> if (!keepDeletes) {<a name="line.289"></a>
-<span class="sourceLineNo">290</span> Iterator<Map.Entry<Long, BitSetNode>> it = map.entrySet().iterator();<a name="line.290"></a>
-<span class="sourceLineNo">291</span> while (it.hasNext()) {<a name="line.291"></a>
-<span class="sourceLineNo">292</span> Map.Entry<Long, BitSetNode> entry = it.next();<a name="line.292"></a>
-<span class="sourceLineNo">293</span> if (entry.getValue().isEmpty()) {<a name="line.293"></a>
-<span class="sourceLineNo">294</span> it.remove();<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> }<a name="line.298"></a>
-<span class="sourceLineNo">299</span><a name="line.299"></a>
-<span class="sourceLineNo">300</span> public boolean isPartial() {<a name="line.300"></a>
-<span class="sourceLineNo">301</span> return partial;<a name="line.301"></a>
-<span class="sourceLineNo">302</span> }<a name="line.302"></a>
-<span class="sourceLineNo">303</span><a name="line.303"></a>
-<span class="sourceLineNo">304</span> public void setPartialFlag(boolean isPartial) {<a name="line.304"></a>
-<span class="sourceLineNo">305</span> if (this.partial && !isPartial) {<a name="line.305"></a>
-<span class="sourceLineNo">306</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.306"></a>
-<span class="sourceLineNo">307</span> entry.getValue().unsetPartialFlag();<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> this.partial = isPartial;<a name="line.310"></a>
-<span class="sourceLineNo">311</span> }<a name="line.311"></a>
-<span class="sourceLineNo">312</span><a name="line.312"></a>
-<span class="sourceLineNo">313</span> /**<a name="line.313"></a>
-<span class="sourceLineNo">314</span> * @return true, if no procedure is active, else false.<a name="line.314"></a>
-<span class="sourceLineNo">315</span> */<a name="line.315"></a>
-<span class="sourceLineNo">316</span> public boolean isEmpty() {<a name="line.316"></a>
-<span class="sourceLineNo">317</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.317"></a>
-<span class="sourceLineNo">318</span> if (!entry.getValue().isEmpty()) {<a name="line.318"></a>
-<span class="sourceLineNo">319</span> return false;<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> return true;<a name="line.322"></a>
-<span class="sourceLineNo">323</span> }<a name="line.323"></a>
-<span class="sourceLineNo">324</span><a name="line.324"></a>
-<span class="sourceLineNo">325</span> /**<a name="line.325"></a>
-<span class="sourceLineNo">326</span> * @return true if all procedure was modified or deleted since last call to<a name="line.326"></a>
-<span class="sourceLineNo">327</span> * {@link #resetModified()}.<a name="line.327"></a>
-<span class="sourceLineNo">328</span> */<a name="line.328"></a>
-<span class="sourceLineNo">329</span> public boolean isAllModified() {<a name="line.329"></a>
-<span class="sourceLineNo">330</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.330"></a>
-<span class="sourceLineNo">331</span> if (!entry.getValue().isAllModified()) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span> return false;<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> return true;<a name="line.335"></a>
-<span class="sourceLineNo">336</span> }<a name="line.336"></a>
-<span class="sourceLineNo">337</span><a name="line.337"></a>
-<span class="sourceLineNo">338</span> /**<a name="line.338"></a>
-<span class="sourceLineNo">339</span> * Clears the list of updated procedure ids. This doesn't affect global list of active<a name="line.339"></a>
-<span class="sourceLineNo">340</span> * procedure ids.<a name="line.340"></a>
-<span class="sourceLineNo">341</span> */<a name="line.341"></a>
-<span class="sourceLineNo">342</span> public void resetModified() {<a name="line.342"></a>
-<span class="sourceLineNo">343</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.343"></a>
-<span class="sourceLineNo">344</span> entry.getValue().resetModified();<a name="line.344"></a>
-<span class="sourceLineNo">345</span> }<a name="line.345"></a>
-<span class="sourceLineNo">346</span> minModifiedProcId = Long.MAX_VALUE;<a name="line.346"></a>
-<span class="sourceLineNo">347</span> maxModifiedProcId = Long.MIN_VALUE;<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> private BitSetNode getOrCreateNode(long procId) {<a name="line.350"></a>
-<span class="sourceLineNo">351</span> // If procId can fit in left node (directly or by growing it)<a name="line.351"></a>
-<span class="sourceLineNo">352</span> BitSetNode leftNode = null;<a name="line.352"></a>
-<span class="sourceLineNo">353</span> boolean leftCanGrow = false;<a name="line.353"></a>
-<span class="sourceLineNo">354</span> Map.Entry<Long, BitSetNode> leftEntry = map.floorEntry(procId);<a name="line.354"></a>
-<span class="sourceLineNo">355</span> if (leftEntry != null) {<a name="line.355"></a>
-<span class="sourceLineNo">356</span> leftNode = leftEntry.getValue();<a name="line.356"></a>
-<span class="sourceLineNo">357</span> if (leftNode.contains(procId)) {<a name="line.357"></a>
-<span class="sourceLineNo">358</span> return leftNode;<a name="line.358"></a>
-<span class="sourceLineNo">359</span> }<a name="line.359"></a>
-<span class="sourceLineNo">360</span> leftCanGrow = leftNode.canGrow(procId);<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> // If procId can fit in right node (directly or by growing it)<a name="line.363"></a>
-<span class="sourceLineNo">364</span> BitSetNode rightNode = null;<a name="line.364"></a>
-<span class="sourceLineNo">365</span> boolean rightCanGrow = false;<a name="line.365"></a>
-<span class="sourceLineNo">366</span> Map.Entry<Long, BitSetNode> rightEntry = map.ceilingEntry(procId);<a name="line.366"></a>
-<span class="sourceLineNo">367</span> if (rightEntry != null) {<a name="line.367"></a>
-<span class="sourceLineNo">368</span> rightNode = rightEntry.getValue();<a name="line.368"></a>
-<span class="sourceLineNo">369</span> rightCanGrow = rightNode.canGrow(procId);<a name="line.369"></a>
-<span class="sourceLineNo">370</span> if (leftNode != null) {<a name="line.370"></a>
-<span class="sourceLineNo">371</span> if (leftNode.canMerge(rightNode)) {<a name="line.371"></a>
-<span class="sourceLineNo">372</span> // merge left and right node<a name="line.372"></a>
-<span class="sourceLineNo">373</span> return mergeNodes(leftNode, rightNode);<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> // If left and right nodes can not merge, decide which one to grow.<a name="line.376"></a>
-<span class="sourceLineNo">377</span> if (leftCanGrow && rightCanGrow) {<a name="line.377"></a>
-<span class="sourceLineNo">378</span> if ((procId - leftNode.getEnd()) <= (rightNode.getStart() - procId)) {<a name="line.378"></a>
-<span class="sourceLineNo">379</span> return growNode(leftNode, procId);<a name="line.379"></a>
-<span class="sourceLineNo">380</span> }<a name="line.380"></a>
-<span class="sourceLineNo">381</span> return growNode(rightNode, procId);<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> }<a name="line.384"></a>
-<span class="sourceLineNo">385</span><a name="line.385"></a>
-<span class="sourceLineNo">386</span> // grow the left node<a name="line.386"></a>
-<span class="sourceLineNo">387</span> if (leftCanGrow) {<a name="line.387"></a>
-<span class="sourceLineNo">388</span> return growNode(leftNode, procId);<a name="line.388"></a>
-<span class="sourceLineNo">389</span> }<a name="line.389"></a>
-<span class="sourceLineNo">390</span><a name="line.390"></a>
-<span class="sourceLineNo">391</span> // grow the right node<a name="line.391"></a>
-<span class="sourceLineNo">392</span> if (rightCanGrow) {<a name="line.392"></a>
-<span class="sourceLineNo">393</span> return growNode(rightNode, procId);<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> // add new node if there are no left/right nodes which can be used.<a name="line.396"></a>
-<span class="sourceLineNo">397</span> BitSetNode node = new BitSetNode(procId, partial);<a name="line.397"></a>
-<span class="sourceLineNo">398</span> map.put(node.getStart(), node);<a name="line.398"></a>
-<span class="sourceLineNo">399</span> return node;<a name="line.399"></a>
-<span class="sourceLineNo">400</span> }<a name="line.400"></a>
+<span class="sourceLineNo">029</span><a name="line.29"></a>
+<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a name="line.30"></a>
+<span class="sourceLineNo">031</span><a name="line.31"></a>
+<span class="sourceLineNo">032</span>/**<a name="line.32"></a>
+<span class="sourceLineNo">033</span> * Keeps track of live procedures.<a name="line.33"></a>
+<span class="sourceLineNo">034</span> *<a name="line.34"></a>
+<span class="sourceLineNo">035</span> * It can be used by the ProcedureStore to identify which procedures are already<a name="line.35"></a>
+<span class="sourceLineNo">036</span> * deleted/completed to avoid the deserialization step on restart<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 ProcedureStoreTracker {<a name="line.40"></a>
+<span class="sourceLineNo">041</span> // Key is procedure id corresponding to first bit of the bitmap.<a name="line.41"></a>
+<span class="sourceLineNo">042</span> private final TreeMap<Long, BitSetNode> map = new TreeMap<>();<a name="line.42"></a>
+<span class="sourceLineNo">043</span><a name="line.43"></a>
+<span class="sourceLineNo">044</span> /**<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * If true, do not remove bits corresponding to deleted procedures. Note that this can result<a name="line.45"></a>
+<span class="sourceLineNo">046</span> * in huge bitmaps overtime.<a name="line.46"></a>
+<span class="sourceLineNo">047</span> * Currently, it's set to true only when building tracker state from logs during recovery. During<a name="line.47"></a>
+<span class="sourceLineNo">048</span> * recovery, if we are sure that a procedure has been deleted, reading its old update entries<a name="line.48"></a>
+<span class="sourceLineNo">049</span> * can be skipped.<a name="line.49"></a>
+<span class="sourceLineNo">050</span> */<a name="line.50"></a>
+<span class="sourceLineNo">051</span> private boolean keepDeletes = false;<a name="line.51"></a>
+<span class="sourceLineNo">052</span> /**<a name="line.52"></a>
+<span class="sourceLineNo">053</span> * If true, it means tracker has incomplete information about the active/deleted procedures.<a name="line.53"></a>
+<span class="sourceLineNo">054</span> * It's set to true only when recovering from old logs. See {@link #isDeleted(long)} docs to<a name="line.54"></a>
+<span class="sourceLineNo">055</span> * understand it's real use.<a name="line.55"></a>
+<span class="sourceLineNo">056</span> */<a name="line.56"></a>
+<span class="sourceLineNo">057</span> boolean partial = false;<a name="line.57"></a>
+<span class="sourceLineNo">058</span><a name="line.58"></a>
+<span class="sourceLineNo">059</span> private long minModifiedProcId = Long.MAX_VALUE;<a name="line.59"></a>
+<span class="sourceLineNo">060</span> private long maxModifiedProcId = Long.MIN_VALUE;<a name="line.60"></a>
+<span class="sourceLineNo">061</span><a name="line.61"></a>
+<span class="sourceLineNo">062</span> public enum DeleteState { YES, NO, MAYBE }<a name="line.62"></a>
+<span class="sourceLineNo">063</span><a name="line.63"></a>
+<span class="sourceLineNo">064</span> public void resetToProto(ProcedureProtos.ProcedureStoreTracker trackerProtoBuf) {<a name="line.64"></a>
+<span class="sourceLineNo">065</span> reset();<a name="line.65"></a>
+<span class="sourceLineNo">066</span> for (ProcedureProtos.ProcedureStoreTracker.TrackerNode protoNode: trackerProtoBuf.getNodeList()) {<a name="line.66"></a>
+<span class="sourceLineNo">067</span> final BitSetNode node = new BitSetNode(protoNode);<a name="line.67"></a>
+<span class="sourceLineNo">068</span> map.put(node.getStart(), node);<a name="line.68"></a>
+<span class="sourceLineNo">069</span> }<a name="line.69"></a>
+<span class="sourceLineNo">070</span> }<a name="line.70"></a>
+<span class="sourceLineNo">071</span><a name="line.71"></a>
+<span class="sourceLineNo">072</span> /**<a name="line.72"></a>
+<span class="sourceLineNo">073</span> * Resets internal state to same as given {@code tracker}. Does deep copy of the bitmap.<a name="line.73"></a>
+<span class="sourceLineNo">074</span> */<a name="line.74"></a>
+<span class="sourceLineNo">075</span> public void resetTo(ProcedureStoreTracker tracker) {<a name="line.75"></a>
+<span class="sourceLineNo">076</span> resetTo(tracker, false);<a name="line.76"></a>
+<span class="sourceLineNo">077</span> }<a name="line.77"></a>
+<span class="sourceLineNo">078</span><a name="line.78"></a>
+<span class="sourceLineNo">079</span> /**<a name="line.79"></a>
+<span class="sourceLineNo">080</span> * Resets internal state to same as given {@code tracker}, and change the deleted flag according<a name="line.80"></a>
+<span class="sourceLineNo">081</span> * to the modified flag if {@code resetDelete} is true. Does deep copy of the bitmap.<a name="line.81"></a>
+<span class="sourceLineNo">082</span> * <p/><a name="line.82"></a>
+<span class="sourceLineNo">083</span> * The {@code resetDelete} will be set to true when building cleanup tracker, please see the<a name="line.83"></a>
+<span class="sourceLineNo">084</span> * comments in {@link BitSetNode#BitSetNode(BitSetNode, boolean)} to learn how we change the<a name="line.84"></a>
+<span class="sourceLineNo">085</span> * deleted flag if {@code resetDelete} is true.<a name="line.85"></a>
+<span class="sourceLineNo">086</span> */<a name="line.86"></a>
+<span class="sourceLineNo">087</span> public void resetTo(ProcedureStoreTracker tracker, boolean resetDelete) {<a name="line.87"></a>
+<span class="sourceLineNo">088</span> reset();<a name="line.88"></a>
+<span class="sourceLineNo">089</span> this.partial = tracker.partial;<a name="line.89"></a>
+<span class="sourceLineNo">090</span> this.minModifiedProcId = tracker.minModifiedProcId;<a name="line.90"></a>
+<span class="sourceLineNo">091</span> this.maxModifiedProcId = tracker.maxModifiedProcId;<a name="line.91"></a>
+<span class="sourceLineNo">092</span> this.keepDeletes = tracker.keepDeletes;<a name="line.92"></a>
+<span class="sourceLineNo">093</span> for (Map.Entry<Long, BitSetNode> entry : tracker.map.entrySet()) {<a name="line.93"></a>
+<span class="sourceLineNo">094</span> map.put(entry.getKey(), new BitSetNode(entry.getValue(), resetDelete));<a name="line.94"></a>
+<span class="sourceLineNo">095</span> }<a name="line.95"></a>
+<span class="sourceLineNo">096</span> }<a name="line.96"></a>
+<span class="sourceLineNo">097</span><a name="line.97"></a>
+<span class="sourceLineNo">098</span> public void insert(long procId) {<a name="line.98"></a>
+<span class="sourceLineNo">099</span> insert(null, procId);<a name="line.99"></a>
+<span class="sourceLineNo">100</span> }<a name="line.100"></a>
+<span class="sourceLineNo">101</span><a name="line.101"></a>
+<span class="sourceLineNo">102</span> public void insert(long[] procIds) {<a name="line.102"></a>
+<span class="sourceLineNo">103</span> for (int i = 0; i < procIds.length; ++i) {<a name="line.103"></a>
+<span class="sourceLineNo">104</span> insert(procIds[i]);<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><a name="line.107"></a>
+<span class="sourceLineNo">108</span> public void insert(long procId, long[] subProcIds) {<a name="line.108"></a>
+<span class="sourceLineNo">109</span> BitSetNode node = update(null, procId);<a name="line.109"></a>
+<span class="sourceLineNo">110</span> for (int i = 0; i < subProcIds.length; ++i) {<a name="line.110"></a>
+<span class="sourceLineNo">111</span> node = insert(node, subProcIds[i]);<a name="line.111"></a>
+<span class="sourceLineNo">112</span> }<a name="line.112"></a>
+<span class="sourceLineNo">113</span> }<a name="line.113"></a>
+<span class="sourceLineNo">114</span><a name="line.114"></a>
+<span class="sourceLineNo">115</span> private BitSetNode insert(BitSetNode node, long procId) {<a name="line.115"></a>
+<span class="sourceLineNo">116</span> if (node == null || !node.contains(procId)) {<a name="line.116"></a>
+<span class="sourceLineNo">117</span> node = getOrCreateNode(procId);<a name="line.117"></a>
+<span class="sourceLineNo">118</span> }<a name="line.118"></a>
+<span class="sourceLineNo">119</span> node.insertOrUpdate(procId);<a name="line.119"></a>
+<span class="sourceLineNo">120</span> trackProcIds(procId);<a name="line.120"></a>
+<span class="sourceLineNo">121</span> return node;<a name="line.121"></a>
+<span class="sourceLineNo">122</span> }<a name="line.122"></a>
+<span class="sourceLineNo">123</span><a name="line.123"></a>
+<span class="sourceLineNo">124</span> public void update(long procId) {<a name="line.124"></a>
+<span class="sourceLineNo">125</span> update(null, procId);<a name="line.125"></a>
+<span class="sourceLineNo">126</span> }<a name="line.126"></a>
+<span class="sourceLineNo">127</span><a name="line.127"></a>
+<span class="sourceLineNo">128</span> private BitSetNode update(BitSetNode node, long procId) {<a name="line.128"></a>
+<span class="sourceLineNo">129</span> node = lookupClosestNode(node, procId);<a name="line.129"></a>
+<span class="sourceLineNo">130</span> assert node != null : "expected node to update procId=" + procId;<a name="line.130"></a>
+<span class="sourceLineNo">131</span> assert node.contains(procId) : "expected procId=" + procId + " in the node";<a name="line.131"></a>
+<span class="sourceLineNo">132</span> node.insertOrUpdate(procId);<a name="line.132"></a>
+<span class="sourceLineNo">133</span> trackProcIds(procId);<a name="line.133"></a>
+<span class="sourceLineNo">134</span> return node;<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 delete(long procId) {<a name="line.137"></a>
+<span class="sourceLineNo">138</span> delete(null, procId);<a name="line.138"></a>
+<span class="sourceLineNo">139</span> }<a name="line.139"></a>
+<span class="sourceLineNo">140</span><a name="line.140"></a>
+<span class="sourceLineNo">141</span> public void delete(final long[] procIds) {<a name="line.141"></a>
+<span class="sourceLineNo">142</span> Arrays.sort(procIds);<a name="line.142"></a>
+<span class="sourceLineNo">143</span> BitSetNode node = null;<a name="line.143"></a>
+<span class="sourceLineNo">144</span> for (int i = 0; i < procIds.length; ++i) {<a name="line.144"></a>
+<span class="sourceLineNo">145</span> node = delete(node, procIds[i]);<a name="line.145"></a>
+<span class="sourceLineNo">146</span> }<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> private BitSetNode delete(BitSetNode node, long procId) {<a name="line.149"></a>
+<span class="sourceLineNo">150</span> node = lookupClosestNode(node, procId);<a name="line.150"></a>
+<span class="sourceLineNo">151</span> assert node != null : "expected node to delete procId=" + procId;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> assert node.contains(procId) : "expected procId=" + procId + " in the node";<a name="line.152"></a>
+<span class="sourceLineNo">153</span> node.delete(procId);<a name="line.153"></a>
+<span class="sourceLineNo">154</span> if (!keepDeletes && node.isEmpty()) {<a name="line.154"></a>
+<span class="sourceLineNo">155</span> // TODO: RESET if (map.size() == 1)<a name="line.155"></a>
+<span class="sourceLineNo">156</span> map.remove(node.getStart());<a name="line.156"></a>
+<span class="sourceLineNo">157</span> }<a name="line.157"></a>
+<span class="sourceLineNo">158</span><a name="line.158"></a>
+<span class="sourceLineNo">159</span> trackProcIds(procId);<a name="line.159"></a>
+<span class="sourceLineNo">160</span> return node;<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> * Will be called when restarting where we need to rebuild the ProcedureStoreTracker.<a name="line.164"></a>
+<span class="sourceLineNo">165</span> */<a name="line.165"></a>
+<span class="sourceLineNo">166</span> public void setMinMaxModifiedProcIds(long min, long max) {<a name="line.166"></a>
+<span class="sourceLineNo">167</span> this.minModifiedProcId = min;<a name="line.167"></a>
+<span class="sourceLineNo">168</span> this.maxModifiedProcId = max;<a name="line.168"></a>
+<span class="sourceLineNo">169</span> }<a name="line.169"></a>
+<span class="sourceLineNo">170</span> /**<a name="line.170"></a>
+<span class="sourceLineNo">171</span> * This method is used when restarting where we need to rebuild the ProcedureStoreTracker. The<a name="line.171"></a>
+<span class="sourceLineNo">172</span> * {@link #delete(long)} method above assume that the {@link BitSetNode} exists, but when restart<a name="line.172"></a>
+<span class="sourceLineNo">173</span> * this is not true, as we will read the wal files in reverse order so a delete may come first.<a name="line.173"></a>
+<span class="sourceLineNo">174</span> */<a name="line.174"></a>
+<span class="sourceLineNo">175</span> public void setDeleted(long procId, boolean isDeleted) {<a name="line.175"></a>
+<span class="sourceLineNo">176</span> BitSetNode node = getOrCreateNode(procId);<a name="line.176"></a>
+<span class="sourceLineNo">177</span> assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.177"></a>
+<span class="sourceLineNo">178</span> node.updateState(procId, isDeleted);<a name="line.178"></a>
+<span class="sourceLineNo">179</span> trackProcIds(procId);<a name="line.179"></a>
+<span class="sourceLineNo">180</span> }<a name="line.180"></a>
+<span class="sourceLineNo">181</span><a name="line.181"></a>
+<span class="sourceLineNo">182</span> /**<a name="line.182"></a>
+<span class="sourceLineNo">183</span> * Set the given bit for the procId to delete if it was modified before.<a name="line.183"></a>
+<span class="sourceLineNo">184</span> * <p/><a name="line.184"></a>
+<span class="sourceLineNo">185</span> * This method is used to test whether a procedure wal file can be safely deleted, as if all the<a name="line.185"></a>
+<span class="sourceLineNo">186</span> * procedures in the given procedure wal file has been modified in the new procedure wal files,<a name="line.186"></a>
+<span class="sourceLineNo">187</span> * then we can delete it.<a name="line.187"></a>
+<span class="sourceLineNo">188</span> */<a name="line.188"></a>
+<span class="sourceLineNo">189</span> public void setDeletedIfModified(long... procId) {<a name="line.189"></a>
+<span class="sourceLineNo">190</span> BitSetNode node = null;<a name="line.190"></a>
+<span class="sourceLineNo">191</span> for (int i = 0; i < procId.length; ++i) {<a name="line.191"></a>
+<span class="sourceLineNo">192</span> node = lookupClosestNode(node, procId[i]);<a name="line.192"></a>
+<span class="sourceLineNo">193</span> if (node != null && node.isModified(procId[i])) {<a name="line.193"></a>
+<span class="sourceLineNo">194</span> node.delete(procId[i]);<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> /**<a name="line.199"></a>
+<span class="sourceLineNo">200</span> * Similar with {@link #setDeletedIfModified(long...)}, but here the {@code procId} are given by<a name="line.200"></a>
+<span class="sourceLineNo">201</span> * the {@code tracker}. If a procedure is modified by us, and also by the given {@code tracker},<a name="line.201"></a>
+<span class="sourceLineNo">202</span> * then we mark it as deleted.<a name="line.202"></a>
+<span class="sourceLineNo">203</span> * @see #setDeletedIfModified(long...)<a name="line.203"></a>
+<span class="sourceLineNo">204</span> */<a name="line.204"></a>
+<span class="sourceLineNo">205</span> public void setDeletedIfModifiedInBoth(ProcedureStoreTracker tracker) {<a name="line.205"></a>
+<span class="sourceLineNo">206</span> BitSetNode trackerNode = null;<a name="line.206"></a>
+<span class="sourceLineNo">207</span> for (BitSetNode node : map.values()) {<a name="line.207"></a>
+<span class="sourceLineNo">208</span> final long minProcId = node.getStart();<a name="line.208"></a>
+<span class="sourceLineNo">209</span> final long maxProcId = node.getEnd();<a name="line.209"></a>
+<span class="sourceLineNo">210</span> for (long procId = minProcId; procId <= maxProcId; ++procId) {<a name="line.210"></a>
+<span class="sourceLineNo">211</span> if (!node.isModified(procId)) {<a name="line.211"></a>
+<span class="sourceLineNo">212</span> continue;<a name="line.212"></a>
+<span class="sourceLineNo">213</span> }<a name="line.213"></a>
+<span class="sourceLineNo">214</span><a name="line.214"></a>
+<span class="sourceLineNo">215</span> trackerNode = tracker.lookupClosestNode(trackerNode, procId);<a name="line.215"></a>
+<span class="sourceLineNo">216</span> if (trackerNode == null || !trackerNode.contains(procId) ||<a name="line.216"></a>
+<span class="sourceLineNo">217</span> trackerNode.isModified(procId)) {<a name="line.217"></a>
+<span class="sourceLineNo">218</span> // the procedure was removed or modified<a name="line.218"></a>
+<span class="sourceLineNo">219</span> node.delete(procId);<a name="line.219"></a>
+<span class="sourceLineNo">220</span> }<a name="line.220"></a>
+<span class="sourceLineNo">221</span> }<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><a name="line.224"></a>
+<span class="sourceLineNo">225</span> /**<a name="line.225"></a>
+<span class="sourceLineNo">226</span> * lookup the node containing the specified procId.<a name="line.226"></a>
+<span class="sourceLineNo">227</span> * @param node cached node to check before doing a lookup<a name="line.227"></a>
+<span class="sourceLineNo">228</span> * @param procId the procId to lookup<a name="line.228"></a>
+<span class="sourceLineNo">229</span> * @return the node that may contains the procId or null<a name="line.229"></a>
+<span class="sourceLineNo">230</span> */<a name="line.230"></a>
+<span class="sourceLineNo">231</span> private BitSetNode lookupClosestNode(final BitSetNode node, final long procId) {<a name="line.231"></a>
+<span class="sourceLineNo">232</span> if (node != null && node.contains(procId)) return node;<a name="line.232"></a>
+<span class="sourceLineNo">233</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.233"></a>
+<span class="sourceLineNo">234</span> return entry != null ? entry.getValue() : null;<a name="line.234"></a>
+<span class="sourceLineNo">235</span> }<a name="line.235"></a>
+<span class="sourceLineNo">236</span><a name="line.236"></a>
+<span class="sourceLineNo">237</span> private void trackProcIds(long procId) {<a name="line.237"></a>
+<span class="sourceLineNo">238</span> minModifiedProcId = Math.min(minModifiedProcId, procId);<a name="line.238"></a>
+<span class="sourceLineNo">239</span> maxModifiedProcId = Math.max(maxModifiedProcId, procId);<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> public long getModifiedMinProcId() {<a name="line.242"></a>
+<span class="sourceLineNo">243</span> return minModifiedProcId;<a name="line.243"></a>
+<span class="sourceLineNo">244</span> }<a name="line.244"></a>
+<span class="sourceLineNo">245</span><a name="line.245"></a>
+<span class="sourceLineNo">246</span> public long getModifiedMaxProcId() {<a name="line.246"></a>
+<span class="sourceLineNo">247</span> return maxModifiedProcId;<a name="line.247"></a>
+<span class="sourceLineNo">248</span> }<a name="line.248"></a>
+<span class="sourceLineNo">249</span><a name="line.249"></a>
+<span class="sourceLineNo">250</span> public void reset() {<a name="line.250"></a>
+<span class="sourceLineNo">251</span> this.keepDeletes = false;<a name="line.251"></a>
+<span class="sourceLineNo">252</span> this.partial = false;<a name="line.252"></a>
+<span class="sourceLineNo">253</span> this.map.clear();<a name="line.253"></a>
+<span class="sourceLineNo">254</span> resetModified();<a name="line.254"></a>
+<span class="sourceLineNo">255</span> }<a name="line.255"></a>
+<span class="sourceLineNo">256</span><a name="line.256"></a>
+<span class="sourceLineNo">257</span> public boolean isModified(long procId) {<a name="line.257"></a>
+<span class="sourceLineNo">258</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.258"></a>
+<span class="sourceLineNo">259</span> return entry != null && entry.getValue().contains(procId) &&<a name="line.259"></a>
+<span class="sourceLineNo">260</span> entry.getValue().isModified(procId);<a name="line.260"></a>
+<span class="sourceLineNo">261</span> }<a name="line.261"></a>
+<span class="sourceLineNo">262</span><a name="line.262"></a>
+<span class="sourceLineNo">263</span> /**<a name="line.263"></a>
+<span class="sourceLineNo">264</span> * If {@link #partial} is false, returns state from the bitmap. If no state is found for<a name="line.264"></a>
+<span class="sourceLineNo">265</span> * {@code procId}, returns YES.<a name="line.265"></a>
+<span class="sourceLineNo">266</span> * If partial is true, tracker doesn't have complete view of system state, so it returns MAYBE<a name="line.266"></a>
+<span class="sourceLineNo">267</span> * if there is no update for the procedure or if it doesn't have a state in bitmap. Otherwise,<a name="line.267"></a>
+<span class="sourceLineNo">268</span> * returns state from the bitmap.<a name="line.268"></a>
+<span class="sourceLineNo">269</span> */<a name="line.269"></a>
+<span class="sourceLineNo">270</span> public DeleteState isDeleted(long procId) {<a name="line.270"></a>
+<span class="sourceLineNo">271</span> Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.271"></a>
+<span class="sourceLineNo">272</span> if (entry != null && entry.getValue().contains(procId)) {<a name="line.272"></a>
+<span class="sourceLineNo">273</span> BitSetNode node = entry.getValue();<a name="line.273"></a>
+<span class="sourceLineNo">274</span> DeleteState state = node.isDeleted(procId);<a name="line.274"></a>
+<span class="sourceLineNo">275</span> return partial && !node.isModified(procId) ? DeleteState.MAYBE : state;<a name="line.275"></a>
+<span class="sourceLineNo">276</span> }<a name="line.276"></a>
+<span class="sourceLineNo">277</span> return partial ? DeleteState.MAYBE : DeleteState.YES;<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">280</span> public long getActiveMinProcId() {<a name="line.280"></a>
+<span class="sourceLineNo">281</span> // TODO: Cache?<a name="line.281"></a>
+<span class="sourceLineNo">282</span> Map.Entry<Long, BitSetNode> entry = map.firstEntry();<a name="line.282"></a>
+<span class="sourceLineNo">283</span> return entry == null ? 0 : entry.getValue().getActiveMinProcId();<a name="line.283"></a>
+<span class="sourceLineNo">284</span> }<a name="line.284"></a>
+<span class="sourceLineNo">285</span><a name="line.285"></a>
+<span class="sourceLineNo">286</span> public void setKeepDeletes(boolean keepDeletes) {<a name="line.286"></a>
+<span class="sourceLineNo">287</span> this.keepDeletes = keepDeletes;<a name="line.287"></a>
+<span class="sourceLineNo">288</span> // If not to keep deletes, remove the BitSetNodes which are empty (i.e. contains ids of deleted<a name="line.288"></a>
+<span class="sourceLineNo">289</span> // procedures).<a name="line.289"></a>
+<span class="sourceLineNo">290</span> if (!keepDeletes) {<a name="line.290"></a>
+<span class="sourceLineNo">291</span> Iterator<Map.Entry<Long, BitSetNode>> it = map.entrySet().iterator();<a name="line.291"></a>
+<span class="sourceLineNo">292</span> while (it.hasNext()) {<a name="line.292"></a>
+<span class="sourceLineNo">293</span> Map.Entry<Long, BitSetNode> entry = it.next();<a name="line.293"></a>
+<span class="sourceLineNo">294</span> if (entry.getValue().isEmpty()) {<a name="line.294"></a>
+<span class="sourceLineNo">295</span> it.remove();<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> }<a name="line.298"></a>
+<span class="sourceLineNo">299</span> }<a name="line.299"></a>
+<span class="sourceLineNo">300</span><a name="line.300"></a>
+<span class="sourceLineNo">301</span> public boolean isPartial() {<a name="line.301"></a>
+<span class="sourceLineNo">302</span> return partial;<a name="line.302"></a>
+<span class="sourceLineNo">303</span> }<a name="line.303"></a>
+<span class="sourceLineNo">304</span><a name="line.304"></a>
+<span class="sourceLineNo">305</span> public void setPartialFlag(boolean isPartial) {<a name="line.305"></a>
+<span class="sourceLineNo">306</span> if (this.partial && !isPartial) {<a name="line.306"></a>
+<span class="sourceLineNo">307</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.307"></a>
+<span class="sourceLineNo">308</span> entry.getValue().unsetPartialFlag();<a name="line.308"></a>
+<span class="sourceLineNo">309</span> }<a name="line.309"></a>
+<span class="sourceLineNo">310</span> }<a name="line.310"></a>
+<span class="sourceLineNo">311</span> this.partial = isPartial;<a name="line.311"></a>
+<span class="sourceLineNo">312</span> }<a name="line.312"></a>
+<span class="sourceLineNo">313</span><a name="line.313"></a>
+<span class="sourceLineNo">314</span> /**<a name="line.314"></a>
+<span class="sourceLineNo">315</span> * @return true, if no procedure is active, else false.<a name="line.315"></a>
+<span class="sourceLineNo">316</span> */<a name="line.316"></a>
+<span class="sourceLineNo">317</span> public boolean isEmpty() {<a name="line.317"></a>
+<span class="sourceLineNo">318</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.318"></a>
+<span class="sourceLineNo">319</span> if (!entry.getValue().isEmpty()) {<a name="line.319"></a>
+<span class="sourceLineNo">320</span> return false;<a name="line.320"></a>
+<span class="sourceLineNo">321</span> }<a name="line.321"></a>
+<span class="sourceLineNo">322</span> }<a name="line.322"></a>
+<span class="sourceLineNo">323</span> return true;<a name="line.323"></a>
+<span class="sourceLineNo">324</span> }<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> * @return true if all procedure was modified or deleted since last call to<a name="line.327"></a>
+<span class="sourceLineNo">328</span> * {@link #resetModified()}.<a name="line.328"></a>
+<span class="sourceLineNo">329</span> */<a name="line.329"></a>
+<span class="sourceLineNo">330</span> public boolean isAllModified() {<a name="line.330"></a>
+<span class="sourceLineNo">331</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.331"></a>
+<span class="sourceLineNo">332</span> if (!entry.getValue().isAllModified()) {<a name="line.332"></a>
+<span class="sourceLineNo">333</span> return false;<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> return true;<a name="line.336"></a>
+<span class="sourceLineNo">337</span> }<a name="line.337"></a>
+<span class="sourceLineNo">338</span><a name="line.338"></a>
+<span class="sourceLineNo">339</span> /**<a name="line.339"></a>
+<span class="sourceLineNo">340</span> * Will be used when there are too many proc wal files. We will rewrite the states of the active<a name="line.340"></a>
+<span class="sourceLineNo">341</span> * procedures in the oldest proc wal file so that we can delete it.<a name="line.341"></a>
+<span class="sourceLineNo">342</span> * @return all the active procedure ids in this tracker.<a name="line.342"></a>
+<span class="sourceLineNo">343</span> */<a name="line.343"></a>
+<span class="sourceLineNo">344</span> public long[] getAllActiveProcIds() {<a name="line.344"></a>
+<span class="sourceLineNo">345</span> return map.values().stream().map(BitSetNode::getActiveProcIds).filter(p -> p.length > 0)<a name="line.345"></a>
+<span class="sourceLineNo">346</span> .flatMapToLong(LongStream::of).toArray();<a name="line.346"></a>
+<span class="sourceLineNo">347</span> }<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> * Clears the list of updated procedure ids. This doesn't affect global list of active<a name="line.350"></a>
+<span class="sourceLineNo">351</span> * procedure ids.<a name="line.351"></a>
+<span class="sourceLineNo">352</span> */<a name="line.352"></a>
+<span class="sourceLineNo">353</span> public void resetModified() {<a name="line.353"></a>
+<span class="sourceLineNo">354</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.354"></a>
+<span class="sourceLineNo">355</span> entry.getValue().resetModified();<a name="line.355"></a>
+<span class="sourceLineNo">356</span> }<a name="line.356"></a>
+<span class="sourceLineNo">357</span> minModifiedProcId = Long.MAX_VALUE;<a name="line.357"></a>
+<span class="sourceLineNo">358</span> maxModifiedProcId = Long.MIN_VALUE;<a name="line.358"></a>
+<span class="sourceLineNo">359</span> }<a name="line.359"></a>
+<span class="sourceLineNo">360</span><a name="line.360"></a>
+<span class="sourceLineNo">361</span> private BitSetNode getOrCreateNode(long procId) {<a name="line.361"></a>
+<span class="sourceLineNo">362</span> // If procId can fit in left node (directly or by growing it)<a name="line.362"></a>
+<span class="sourceLineNo">363</span> BitSetNode leftNode = null;<a name="line.363"></a>
+<span class="sourceLineNo">364</span> boolean leftCanGrow = false;<a name="line.364"></a>
+<span class="sourceLineNo">365</span> Map.Entry<Long, BitSetNode> leftEntry = map.floorEntry(procId);<a name="line.365"></a>
+<span class="sourceLineNo">366</span> if (leftEntry != null) {<a name="line.366"></a>
+<span class="sourceLineNo">367</span> leftNode = leftEntry.getValue();<a name="line.367"></a>
+<span class="sourceLineNo">368</span> if (leftNode.contains(procId)) {<a name="line.368"></a>
+<span class="sourceLineNo">369</span> return leftNode;<a name="line.369"></a>
+<span class="sourceLineNo">370</span> }<a name="line.370"></a>
+<span class="sourceLineNo">371</span> leftCanGrow = leftNode.canGrow(procId);<a name="line.371"></a>
+<span class="sourceLineNo">372</span> }<a name="line.372"></a>
+<span class="sourceLineNo">373</span><a name="line.373"></a>
+<span class="sourceLineNo">374</span> // If procId can fit in right node (directly or by growing it)<a name="line.374"></a>
+<span class="sourceLineNo">375</span> BitSetNode rightNode = null;<a name="line.375"></a>
+<span class="sourceLineNo">376</span> boolean rightCanGrow = false;<a name="line.376"></a>
+<span class="sourceLineNo">377</span> Map.Entry<Long, BitSetNode> rightEntry = map.ceilingEntry(procId);<a name="line.377"></a>
+<span class="sourceLineNo">378</span> if (rightEntry != null) {<a name="line.378"></a>
+<span class="sourceLineNo">379</span> rightNode = rightEntry.getValue();<a name="line.379"></a>
+<span class="sourceLineNo">380</span> rightCanGrow = rightNode.canGrow(procId);<a name="line.380"></a>
+<span class="sourceLineNo">381</span> if (leftNode != null) {<a name="line.381"></a>
+<span class="sourceLineNo">382</span> if (leftNode.canMerge(rightNode)) {<a name="line.382"></a>
+<span class="sourceLineNo">383</span> // merge left and right node<a name="line.383"></a>
+<span class="sourceLineNo">384</span> return mergeNodes(leftNode, rightNode);<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> // If left and right nodes can not merge, decide which one to grow.<a name="line.387"></a>
+<span class="sourceLineNo">388</span> if (leftCanGrow && rightCanGrow) {<a name="line.388"></a>
+<span class="sourceLineNo">389</span> if ((procId - leftNode.getEnd()) <= (rightNode.getStart() - procId)) {<a name="line.389"></a>
+<span class="sourceLineNo">390</span> return growNode(leftNode, procId);<a name="line.390"></a>
+<span class="sourceLineNo">391</span> }<a name="line.391"></a>
+<span class="sourceLineNo">392</span> return growNode(rightNode, procId);<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> }<a name="line.395"></a>
+<span class="sourceLineNo">396</span><a name="line.396"></a>
+<span class="sourceLineNo">397</span> // grow the left node<a name="line.397"></a>
+<span class="sourceLineNo">398</span> if (leftCanGrow) {<a name="line.398"></a>
+<span class="sourceLineNo">399</span> return growNode(leftNode, procId);<a name="line.399"></a>
+<span class="sourceLineNo">400</span> }<a name="line.400"></a>
<span class="sourceLineNo">401</span><a name="line.401"></a>
-<span class="sourceLineNo">402</span> /**<a name="line.402"></a>
-<span class="sourceLineNo">403</span> * Grows {@code node} to contain {@code procId} and updates the map.<a name="line.403"></a>
-<span class="sourceLineNo">404</span> * @return {@link BitSetNode} instance which contains {@code procId}.<a name="line.404"></a>
-<span class="sourceLineNo">405</span> */<a name="line.405"></a>
-<span class="sourceLineNo">406</span> private BitSetNode growNode(BitSetNode node, long procId) {<a name="line.406"></a>
-<span class="sourceLineNo">407</span> map.remove(node.getStart());<a name="line.407"></a>
-<span class="sourceLineNo">408</span> node.grow(procId);<a name="line.408"></a>
+<span class="sourceLineNo">402</span> // grow the right node<a name="line.402"></a>
+<span class="sourceLineNo">403</span> if (rightCanGrow) {<a name="line.403"></a>
+<span class="sourceLineNo">404</span> return growNode(rightNode, procId);<a name="line.404"></a>
+<span class="sourceLineNo">405</span> }<a name="line.405"></a>
+<span class="sourceLineNo">406</span><a name="line.406"></a>
+<span class="sourceLineNo">407</span> // add new node if there are no left/right nodes which can be used.<a name="line.407"></a>
+<span class="sourceLineNo">408</span> BitSetNode node = new BitSetNode(procId, partial);<a name="line.408"></a>
<span class="sourceLineNo">409</span> map.put(node.getStart(), node);<a name="line.409"></a>
<span class="sourceLineNo">410</span> return node;<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> /**<a name="line.413"></a>
-<span class="sourceLineNo">414</span> * Merges {@code leftNode} & {@code rightNode} and updates the map.<a name="line.414"></a>
-<span class="sourceLineNo">415</span> */<a name="line.415"></a>
-<span class="sourceLineNo">416</span> private BitSetNode mergeNodes(BitSetNode leftNode, BitSetNode rightNode) {<a name="line.416"></a>
-<span class="sourceLineNo">417</span> assert leftNode.getStart() < rightNode.getStart();<a name="line.417"></a>
-<span class="sourceLineNo">418</span> leftNode.merge(rightNode);<a name="line.418"></a>
-<span class="sourceLineNo">419</span> map.remove(rightNode.getStart());<a name="line.419"></a>
-<span class="sourceLineNo">420</span> return leftNode;<a name="line.420"></a>
-<span class="sourceLineNo">421</span> }<a name="line.421"></a>
-<span class="sourceLineNo">422</span><a name="line.422"></a>
-<span class="sourceLineNo">423</span> public void dump() {<a name="line.423"></a>
-<span class="sourceLineNo">424</span> System.out.println("map " + map.size());<a name="line.424"></a>
-<span class="sourceLineNo">425</span> System.out.println("isAllModified " + isAllModified());<a name="line.425"></a>
-<span class="sourceLineNo">426</span> System.out.println("isEmpty " + isEmpty());<a name="line.426"></a>
-<span class="sourceLineNo">427</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.427"></a>
-<span class="sourceLineNo">428</span> entry.getValue().dump();<a name="line.428"></a>
-<span class="sourceLineNo">429</span> }<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> // Convert to/from Protocol Buffer.<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> /**<a name="line.436"></a>
-<span class="sourceLineNo">437</span> * Builds<a name="line.437"></a>
-<span class="sourceLineNo">438</span> * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker<a name="line.438"></a>
-<span class="sourceLineNo">439</span> * protocol buffer from current state.<a name="line.439"></a>
-<span class="sourceLineNo">440</span> */<a name="line.440"></a>
-<span class="sourceLineNo">441</span> public ProcedureProtos.ProcedureStoreTracker toProto() throws IOException {<a name="line.441"></a>
-<span class="sourceLineNo">442</span> ProcedureProtos.ProcedureStoreTracker.Builder builder =<a name="line.442"></a>
-<span class="sourceLineNo">443</span> ProcedureProtos.ProcedureStoreTracker.newBuilder();<a name="line.443"></a>
-<span class="sourceLineNo">444</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.444"></a>
-<span class="sourceLineNo">445</span> builder.addNode(entry.getValue().convert());<a name="line.445"></a>
-<span class="sourceLineNo">446</span> }<a name="line.446"></a>
-<span class="sourceLineNo">447</span> return builder.build();<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">414</span> * Grows {@code node} to contain {@code procId} and updates the map.<a name="line.414"></a>
+<span class="sourceLineNo">415</span> * @return {@link BitSetNode} instance which contains {@code procId}.<a name="line.415"></a>
+<span class="sourceLineNo">416</span> */<a name="line.416"></a>
+<span class="sourceLineNo">417</span> private BitSetNode growNode(BitSetNode node, long procId) {<a name="line.417"></a>
+<span class="sourceLineNo">418</span> map.remove(node.getStart());<a name="line.418"></a>
+<span class="sourceLineNo">419</span> node.grow(procId);<a name="line.419"></a>
+<span class="sourceLineNo">420</span> map.put(node.getStart(), node);<a name="line.420"></a>
+<span class="sourceLineNo">421</span> return node;<a name="line.421"></a>
+<span class="sourceLineNo">422</span> }<a name="line.422"></a>
+<span class="sourceLineNo">423</span><a name="line.423"></a>
+<span class="sourceLineNo">424</span> /**<a name="line.424"></a>
+<span class="sourceLineNo">425</span> * Merges {@code leftNode} & {@code rightNode} and updates the map.<a name="line.425"></a>
+<span class="sourceLineNo">426</span> */<a name="line.426"></a>
+<span class="sourceLineNo">427</span> private BitSetNode mergeNodes(BitSetNode leftNode, BitSetNode rightNode) {<a name="line.427"></a>
+<span class="sourceLineNo">428</span> assert leftNode.getStart() < rightNode.getStart();<a name="line.428"></a>
+<span class="sourceLineNo">429</span> leftNode.merge(rightNode);<a name="line.429"></a>
+<span class="sourceLineNo">430</span> map.remove(rightNode.getStart());<a name="line.430"></a>
+<span class="sourceLineNo">431</span> return leftNode;<a name="line.431"></a>
+<span class="sourceLineNo">432</span> }<a name="line.432"></a>
+<span class="sourceLineNo">433</span><a name="line.433"></a>
+<span class="sourceLineNo">434</span> public void dump() {<a name="line.434"></a>
+<span class="sourceLineNo">435</span> System.out.println("map " + map.size());<a name="line.435"></a>
+<span class="sourceLineNo">436</span> System.out.println("isAllModified " + isAllModified());<a name="line.436"></a>
+<span class="sourceLineNo">437</span> System.out.println("isEmpty " + isEmpty());<a name="line.437"></a>
+<span class="sourceLineNo">438</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.438"></a>
+<span class="sourceLineNo">439</span> entry.getValue().dump();<a name="line.439"></a>
+<span class="sourceLineNo">440</span> }<a name="line.440"></a>
+<span class="sourceLineNo">441</span> }<a name="line.441"></a>
+<span class="sourceLineNo">442</span><a name="line.442"></a>
+<span class="sourceLineNo">443</span> // ========================================================================<a name="line.443"></a>
+<span class="sourceLineNo">444</span> // Convert to/from Protocol Buffer.<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> /**<a name="line.447"></a>
+<span class="sourceLineNo">448</span> * Builds<a name="line.448"></a>
+<span class="sourceLineNo">449</span> * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker<a name="line.449"></a>
+<span class="sourceLineNo">450</span> * protocol buffer from current state.<a name="line.450"></a>
+<span class="sourceLineNo">451</span> */<a name="line.451"></a>
+<span class="sourceLineNo">452</span> public ProcedureProtos.ProcedureStoreTracker toProto() throws IOException {<a name="line.452"></a>
+<span class="sourceLineNo">453</span> ProcedureProtos.ProcedureStoreTracker.Builder builder =<a name="line.453"></a>
+<span class="sourceLineNo">454</span> ProcedureProtos.ProcedureStoreTracker.newBuilder();<a name="line.454"></a>
+<span class="sourceLineNo">455</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.455"></a>
+<span class="sourceLineNo">456</span> builder.addNode(entry.getValue().convert());<a name="line.456"></a>
+<span class="sourceLineNo">457</span> }<a name="line.457"></a>
+<span class="sourceLineNo">458</span> return builder.build();<a name="line.458"></a>
+<span class="sourceLineNo">459</span> }<a name="line.459"></a>
+<span class="sourceLineNo">460</span>}<a name="line.460"></a>