hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From bus...@apache.org
Subject [02/52] [partial] hbase-site git commit: Published site at a55af38689fbe273e716ebbf6191e9515986dbf3.
Date Thu, 14 Jul 2016 19:46:25 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/975096b1/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
index 78b70fb..fd76c1c 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.BitSetNode.html
@@ -29,660 +29,669 @@
 <span class="sourceLineNo">021</span>import java.io.IOException;<a name="line.21"></a>
 <span class="sourceLineNo">022</span>import java.io.InputStream;<a name="line.22"></a>
 <span class="sourceLineNo">023</span>import java.io.OutputStream;<a name="line.23"></a>
-<span class="sourceLineNo">024</span>import java.util.Iterator;<a name="line.24"></a>
-<span class="sourceLineNo">025</span>import java.util.Map;<a name="line.25"></a>
-<span class="sourceLineNo">026</span>import java.util.TreeMap;<a name="line.26"></a>
-<span class="sourceLineNo">027</span><a name="line.27"></a>
-<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.classification.InterfaceStability;<a name="line.29"></a>
-<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.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&lt;Long, BitSetNode&gt; map = new TreeMap&lt;Long, BitSetNode&gt;();<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>  private 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 minUpdatedProcId = Long.MAX_VALUE;<a name="line.59"></a>
-<span class="sourceLineNo">060</span>  private long maxUpdatedProcId = 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>  /**<a name="line.64"></a>
-<span class="sourceLineNo">065</span>   * A bitmap which can grow/merge with other {@link BitSetNode} (if certain conditions are met).<a name="line.65"></a>
-<span class="sourceLineNo">066</span>   * Boundaries of bitmap are aligned to multiples of {@link BitSetNode#BITS_PER_WORD}. So the<a name="line.66"></a>
-<span class="sourceLineNo">067</span>   * range of a {@link BitSetNode} is from [x * K, y * K) where x and y are integers, y &gt; x and K<a name="line.67"></a>
-<span class="sourceLineNo">068</span>   * is BITS_PER_WORD.<a name="line.68"></a>
-<span class="sourceLineNo">069</span>   */<a name="line.69"></a>
-<span class="sourceLineNo">070</span>  public static class BitSetNode {<a name="line.70"></a>
-<span class="sourceLineNo">071</span>    private final static long WORD_MASK = 0xffffffffffffffffL;<a name="line.71"></a>
-<span class="sourceLineNo">072</span>    private final static int ADDRESS_BITS_PER_WORD = 6;<a name="line.72"></a>
-<span class="sourceLineNo">073</span>    private final static int BITS_PER_WORD = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.73"></a>
-<span class="sourceLineNo">074</span>    private final static int MAX_NODE_SIZE = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.74"></a>
-<span class="sourceLineNo">075</span><a name="line.75"></a>
-<span class="sourceLineNo">076</span>    /**<a name="line.76"></a>
-<span class="sourceLineNo">077</span>     * Mimics {@link ProcedureStoreTracker#partial}.<a name="line.77"></a>
-<span class="sourceLineNo">078</span>     */<a name="line.78"></a>
-<span class="sourceLineNo">079</span>    private final boolean partial;<a name="line.79"></a>
-<span class="sourceLineNo">080</span>    /**<a name="line.80"></a>
-<span class="sourceLineNo">081</span>     * Set of procedures which have been updated since last {@link #resetUpdates()}.<a name="line.81"></a>
-<span class="sourceLineNo">082</span>     * Useful to track procedures which have been updated since last WAL write.<a name="line.82"></a>
-<span class="sourceLineNo">083</span>     */<a name="line.83"></a>
-<span class="sourceLineNo">084</span>    private long[] updated;<a name="line.84"></a>
-<span class="sourceLineNo">085</span>    /**<a name="line.85"></a>
-<span class="sourceLineNo">086</span>     * Keeps track of procedure ids which belong to this bitmap's range and have been deleted.<a name="line.86"></a>
-<span class="sourceLineNo">087</span>     */<a name="line.87"></a>
-<span class="sourceLineNo">088</span>    private long[] deleted;<a name="line.88"></a>
-<span class="sourceLineNo">089</span>    /**<a name="line.89"></a>
-<span class="sourceLineNo">090</span>     * Offset of bitmap i.e. procedure id corresponding to first bit.<a name="line.90"></a>
-<span class="sourceLineNo">091</span>     */<a name="line.91"></a>
-<span class="sourceLineNo">092</span>    private long start;<a name="line.92"></a>
-<span class="sourceLineNo">093</span><a name="line.93"></a>
-<span class="sourceLineNo">094</span>    public void dump() {<a name="line.94"></a>
-<span class="sourceLineNo">095</span>      System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(),<a name="line.95"></a>
-<span class="sourceLineNo">096</span>        getActiveMinProcId(), getActiveMaxProcId());<a name="line.96"></a>
-<span class="sourceLineNo">097</span>      System.out.println("Update:");<a name="line.97"></a>
-<span class="sourceLineNo">098</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.98"></a>
-<span class="sourceLineNo">099</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.99"></a>
-<span class="sourceLineNo">100</span>          System.out.print((updated[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.100"></a>
-<span class="sourceLineNo">101</span>        }<a name="line.101"></a>
-<span class="sourceLineNo">102</span>        System.out.println(" " + i);<a name="line.102"></a>
-<span class="sourceLineNo">103</span>      }<a name="line.103"></a>
-<span class="sourceLineNo">104</span>      System.out.println();<a name="line.104"></a>
-<span class="sourceLineNo">105</span>      System.out.println("Delete:");<a name="line.105"></a>
-<span class="sourceLineNo">106</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.106"></a>
-<span class="sourceLineNo">107</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.107"></a>
-<span class="sourceLineNo">108</span>          System.out.print((deleted[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.108"></a>
-<span class="sourceLineNo">109</span>        }<a name="line.109"></a>
-<span class="sourceLineNo">110</span>        System.out.println(" " + i);<a name="line.110"></a>
-<span class="sourceLineNo">111</span>      }<a name="line.111"></a>
-<span class="sourceLineNo">112</span>      System.out.println();<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>    public BitSetNode(final long procId, final boolean partial) {<a name="line.115"></a>
-<span class="sourceLineNo">116</span>      start = alignDown(procId);<a name="line.116"></a>
-<span class="sourceLineNo">117</span><a name="line.117"></a>
-<span class="sourceLineNo">118</span>      int count = 1;<a name="line.118"></a>
-<span class="sourceLineNo">119</span>      updated = new long[count];<a name="line.119"></a>
-<span class="sourceLineNo">120</span>      deleted = new long[count];<a name="line.120"></a>
-<span class="sourceLineNo">121</span>      for (int i = 0; i &lt; count; ++i) {<a name="line.121"></a>
-<span class="sourceLineNo">122</span>        updated[i] = 0;<a name="line.122"></a>
-<span class="sourceLineNo">123</span>        deleted[i] = partial ? 0 : WORD_MASK;<a name="line.123"></a>
-<span class="sourceLineNo">124</span>      }<a name="line.124"></a>
-<span class="sourceLineNo">125</span><a name="line.125"></a>
-<span class="sourceLineNo">126</span>      this.partial = partial;<a name="line.126"></a>
-<span class="sourceLineNo">127</span>      updateState(procId, false);<a name="line.127"></a>
-<span class="sourceLineNo">128</span>    }<a name="line.128"></a>
-<span class="sourceLineNo">129</span><a name="line.129"></a>
-<span class="sourceLineNo">130</span>    protected BitSetNode(final long start, final long[] updated, final long[] deleted) {<a name="line.130"></a>
-<span class="sourceLineNo">131</span>      this.start = start;<a name="line.131"></a>
-<span class="sourceLineNo">132</span>      this.updated = updated;<a name="line.132"></a>
-<span class="sourceLineNo">133</span>      this.deleted = deleted;<a name="line.133"></a>
-<span class="sourceLineNo">134</span>      this.partial = false;<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 update(final long procId) {<a name="line.137"></a>
-<span class="sourceLineNo">138</span>      updateState(procId, false);<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 procId) {<a name="line.141"></a>
-<span class="sourceLineNo">142</span>      updateState(procId, true);<a name="line.142"></a>
-<span class="sourceLineNo">143</span>    }<a name="line.143"></a>
-<span class="sourceLineNo">144</span><a name="line.144"></a>
-<span class="sourceLineNo">145</span>    public Long getStart() {<a name="line.145"></a>
-<span class="sourceLineNo">146</span>      return start;<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>    public Long getEnd() {<a name="line.149"></a>
-<span class="sourceLineNo">150</span>      return start + (updated.length &lt;&lt; ADDRESS_BITS_PER_WORD) - 1;<a name="line.150"></a>
-<span class="sourceLineNo">151</span>    }<a name="line.151"></a>
-<span class="sourceLineNo">152</span><a name="line.152"></a>
-<span class="sourceLineNo">153</span>    public boolean contains(final long procId) {<a name="line.153"></a>
-<span class="sourceLineNo">154</span>      return start &lt;= procId &amp;&amp; procId &lt;= getEnd();<a name="line.154"></a>
-<span class="sourceLineNo">155</span>    }<a name="line.155"></a>
-<span class="sourceLineNo">156</span><a name="line.156"></a>
-<span class="sourceLineNo">157</span>    public DeleteState isDeleted(final long procId) {<a name="line.157"></a>
-<span class="sourceLineNo">158</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.158"></a>
-<span class="sourceLineNo">159</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.159"></a>
-<span class="sourceLineNo">160</span>      if (wordIndex &gt;= deleted.length) {<a name="line.160"></a>
-<span class="sourceLineNo">161</span>        return DeleteState.MAYBE;<a name="line.161"></a>
-<span class="sourceLineNo">162</span>      }<a name="line.162"></a>
-<span class="sourceLineNo">163</span>      return (deleted[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.163"></a>
-<span class="sourceLineNo">164</span>    }<a name="line.164"></a>
-<span class="sourceLineNo">165</span><a name="line.165"></a>
-<span class="sourceLineNo">166</span>    private boolean isUpdated(final long procId) {<a name="line.166"></a>
-<span class="sourceLineNo">167</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.167"></a>
-<span class="sourceLineNo">168</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.168"></a>
-<span class="sourceLineNo">169</span>      if (wordIndex &gt;= updated.length) {<a name="line.169"></a>
-<span class="sourceLineNo">170</span>        return false;<a name="line.170"></a>
-<span class="sourceLineNo">171</span>      }<a name="line.171"></a>
-<span class="sourceLineNo">172</span>      return (updated[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0;<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>    public boolean isUpdated() {<a name="line.175"></a>
-<span class="sourceLineNo">176</span>      // TODO: cache the value<a name="line.176"></a>
-<span class="sourceLineNo">177</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.177"></a>
-<span class="sourceLineNo">178</span>        if ((updated[i] | deleted[i]) != WORD_MASK) {<a name="line.178"></a>
-<span class="sourceLineNo">179</span>          return false;<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>      return true;<a name="line.182"></a>
-<span class="sourceLineNo">183</span>    }<a name="line.183"></a>
-<span class="sourceLineNo">184</span><a name="line.184"></a>
-<span class="sourceLineNo">185</span>    /**<a name="line.185"></a>
-<span class="sourceLineNo">186</span>     * @return true, if there are no active procedures in this BitSetNode, else false.<a name="line.186"></a>
-<span class="sourceLineNo">187</span>     */<a name="line.187"></a>
-<span class="sourceLineNo">188</span>    public boolean isEmpty() {<a name="line.188"></a>
-<span class="sourceLineNo">189</span>      // TODO: cache the value<a name="line.189"></a>
-<span class="sourceLineNo">190</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.190"></a>
-<span class="sourceLineNo">191</span>        if (deleted[i] != WORD_MASK) {<a name="line.191"></a>
-<span class="sourceLineNo">192</span>          return false;<a name="line.192"></a>
-<span class="sourceLineNo">193</span>        }<a name="line.193"></a>
-<span class="sourceLineNo">194</span>      }<a name="line.194"></a>
-<span class="sourceLineNo">195</span>      return true;<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>    public void resetUpdates() {<a name="line.198"></a>
-<span class="sourceLineNo">199</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.199"></a>
-<span class="sourceLineNo">200</span>        updated[i] = 0;<a name="line.200"></a>
-<span class="sourceLineNo">201</span>      }<a name="line.201"></a>
-<span class="sourceLineNo">202</span>    }<a name="line.202"></a>
-<span class="sourceLineNo">203</span><a name="line.203"></a>
-<span class="sourceLineNo">204</span>    /**<a name="line.204"></a>
-<span class="sourceLineNo">205</span>     * Clears the {@link #deleted} bitmaps.<a name="line.205"></a>
-<span class="sourceLineNo">206</span>     */<a name="line.206"></a>
-<span class="sourceLineNo">207</span>    public void undeleteAll() {<a name="line.207"></a>
-<span class="sourceLineNo">208</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.208"></a>
-<span class="sourceLineNo">209</span>        deleted[i] = 0;<a name="line.209"></a>
-<span class="sourceLineNo">210</span>      }<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>    public void unsetPartialFlag() {<a name="line.213"></a>
-<span class="sourceLineNo">214</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.214"></a>
-<span class="sourceLineNo">215</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.215"></a>
-<span class="sourceLineNo">216</span>          if ((updated[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.216"></a>
-<span class="sourceLineNo">217</span>            deleted[i] |= (1L &lt;&lt; j);<a name="line.217"></a>
-<span class="sourceLineNo">218</span>          }<a name="line.218"></a>
-<span class="sourceLineNo">219</span>        }<a name="line.219"></a>
-<span class="sourceLineNo">220</span>      }<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>    //  Convert to/from Protocol Buffer.<a name="line.224"></a>
-<span class="sourceLineNo">225</span>    // ========================================================================<a name="line.225"></a>
-<span class="sourceLineNo">226</span><a name="line.226"></a>
-<span class="sourceLineNo">227</span>    public ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.227"></a>
-<span class="sourceLineNo">228</span>      ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.228"></a>
-<span class="sourceLineNo">229</span>        ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.229"></a>
-<span class="sourceLineNo">230</span>      builder.setStartId(start);<a name="line.230"></a>
-<span class="sourceLineNo">231</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.231"></a>
-<span class="sourceLineNo">232</span>        builder.addUpdated(updated[i]);<a name="line.232"></a>
-<span class="sourceLineNo">233</span>        builder.addDeleted(deleted[i]);<a name="line.233"></a>
-<span class="sourceLineNo">234</span>      }<a name="line.234"></a>
-<span class="sourceLineNo">235</span>      return builder.build();<a name="line.235"></a>
-<span class="sourceLineNo">236</span>    }<a name="line.236"></a>
-<span class="sourceLineNo">237</span><a name="line.237"></a>
-<span class="sourceLineNo">238</span>    public static BitSetNode convert(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.238"></a>
-<span class="sourceLineNo">239</span>      long start = data.getStartId();<a name="line.239"></a>
-<span class="sourceLineNo">240</span>      int size = data.getUpdatedCount();<a name="line.240"></a>
-<span class="sourceLineNo">241</span>      long[] updated = new long[size];<a name="line.241"></a>
-<span class="sourceLineNo">242</span>      long[] deleted = new long[size];<a name="line.242"></a>
-<span class="sourceLineNo">243</span>      for (int i = 0; i &lt; size; ++i) {<a name="line.243"></a>
-<span class="sourceLineNo">244</span>        updated[i] = data.getUpdated(i);<a name="line.244"></a>
-<span class="sourceLineNo">245</span>        deleted[i] = data.getDeleted(i);<a name="line.245"></a>
-<span class="sourceLineNo">246</span>      }<a name="line.246"></a>
-<span class="sourceLineNo">247</span>      return new BitSetNode(start, updated, deleted);<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>    // ========================================================================<a name="line.250"></a>
-<span class="sourceLineNo">251</span>    //  Grow/Merge Helpers<a name="line.251"></a>
-<span class="sourceLineNo">252</span>    // ========================================================================<a name="line.252"></a>
-<span class="sourceLineNo">253</span>    public boolean canGrow(final long procId) {<a name="line.253"></a>
-<span class="sourceLineNo">254</span>      return Math.abs(procId - start) &lt; MAX_NODE_SIZE;<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 canMerge(final BitSetNode rightNode) {<a name="line.257"></a>
-<span class="sourceLineNo">258</span>      // Can just compare 'starts' since boundaries are aligned to multiples of BITS_PER_WORD.<a name="line.258"></a>
-<span class="sourceLineNo">259</span>      assert start &lt; rightNode.start;<a name="line.259"></a>
-<span class="sourceLineNo">260</span>      return (rightNode.getEnd() - start) &lt; MAX_NODE_SIZE;<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>    public void grow(final long procId) {<a name="line.263"></a>
-<span class="sourceLineNo">264</span>      int delta, offset;<a name="line.264"></a>
-<span class="sourceLineNo">265</span><a name="line.265"></a>
-<span class="sourceLineNo">266</span>      if (procId &lt; start) {<a name="line.266"></a>
-<span class="sourceLineNo">267</span>        // add to head<a name="line.267"></a>
-<span class="sourceLineNo">268</span>        long newStart = alignDown(procId);<a name="line.268"></a>
-<span class="sourceLineNo">269</span>        delta = (int)(start - newStart) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.269"></a>
-<span class="sourceLineNo">270</span>        offset = delta;<a name="line.270"></a>
-<span class="sourceLineNo">271</span>        start = newStart;<a name="line.271"></a>
-<span class="sourceLineNo">272</span>      } else {<a name="line.272"></a>
-<span class="sourceLineNo">273</span>        // Add to tail<a name="line.273"></a>
-<span class="sourceLineNo">274</span>        long newEnd = alignUp(procId + 1);<a name="line.274"></a>
-<span class="sourceLineNo">275</span>        delta = (int)(newEnd - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.275"></a>
-<span class="sourceLineNo">276</span>        offset = 0;<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>      long[] newBitmap;<a name="line.279"></a>
-<span class="sourceLineNo">280</span>      int oldSize = updated.length;<a name="line.280"></a>
-<span class="sourceLineNo">281</span><a name="line.281"></a>
-<span class="sourceLineNo">282</span>      newBitmap = new long[oldSize + delta];<a name="line.282"></a>
-<span class="sourceLineNo">283</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.283"></a>
-<span class="sourceLineNo">284</span>        newBitmap[i] = 0;<a name="line.284"></a>
-<span class="sourceLineNo">285</span>      }<a name="line.285"></a>
-<span class="sourceLineNo">286</span>      System.arraycopy(updated, 0, newBitmap, offset, oldSize);<a name="line.286"></a>
-<span class="sourceLineNo">287</span>      updated = newBitmap;<a name="line.287"></a>
-<span class="sourceLineNo">288</span><a name="line.288"></a>
-<span class="sourceLineNo">289</span>      newBitmap = new long[deleted.length + delta];<a name="line.289"></a>
-<span class="sourceLineNo">290</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.290"></a>
-<span class="sourceLineNo">291</span>        newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.291"></a>
-<span class="sourceLineNo">292</span>      }<a name="line.292"></a>
-<span class="sourceLineNo">293</span>      System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.293"></a>
-<span class="sourceLineNo">294</span>      deleted = newBitmap;<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>    public void merge(final BitSetNode rightNode) {<a name="line.297"></a>
-<span class="sourceLineNo">298</span>      int delta = (int)(rightNode.getEnd() - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.298"></a>
-<span class="sourceLineNo">299</span><a name="line.299"></a>
-<span class="sourceLineNo">300</span>      long[] newBitmap;<a name="line.300"></a>
-<span class="sourceLineNo">301</span>      int oldSize = updated.length;<a name="line.301"></a>
-<span class="sourceLineNo">302</span>      int newSize = (delta - rightNode.updated.length);<a name="line.302"></a>
-<span class="sourceLineNo">303</span>      int offset = oldSize + newSize;<a name="line.303"></a>
-<span class="sourceLineNo">304</span><a name="line.304"></a>
-<span class="sourceLineNo">305</span>      newBitmap = new long[oldSize + delta];<a name="line.305"></a>
-<span class="sourceLineNo">306</span>      System.arraycopy(updated, 0, newBitmap, 0, oldSize);<a name="line.306"></a>
-<span class="sourceLineNo">307</span>      System.arraycopy(rightNode.updated, 0, newBitmap, offset, rightNode.updated.length);<a name="line.307"></a>
-<span class="sourceLineNo">308</span>      updated = newBitmap;<a name="line.308"></a>
-<span class="sourceLineNo">309</span><a name="line.309"></a>
-<span class="sourceLineNo">310</span>      newBitmap = new long[oldSize + delta];<a name="line.310"></a>
-<span class="sourceLineNo">311</span>      System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.311"></a>
-<span class="sourceLineNo">312</span>      System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.312"></a>
-<span class="sourceLineNo">313</span>      deleted = newBitmap;<a name="line.313"></a>
-<span class="sourceLineNo">314</span><a name="line.314"></a>
-<span class="sourceLineNo">315</span>      for (int i = 0; i &lt; newSize; ++i) {<a name="line.315"></a>
-<span class="sourceLineNo">316</span>        updated[offset + i] = 0;<a name="line.316"></a>
-<span class="sourceLineNo">317</span>        deleted[offset + i] = partial ? 0 : WORD_MASK;<a name="line.317"></a>
-<span class="sourceLineNo">318</span>      }<a name="line.318"></a>
-<span class="sourceLineNo">319</span>    }<a name="line.319"></a>
-<span class="sourceLineNo">320</span><a name="line.320"></a>
-<span class="sourceLineNo">321</span>    @Override<a name="line.321"></a>
-<span class="sourceLineNo">322</span>    public String toString() {<a name="line.322"></a>
-<span class="sourceLineNo">323</span>      return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<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>    //  Min/Max Helpers<a name="line.327"></a>
-<span class="sourceLineNo">328</span>    // ========================================================================<a name="line.328"></a>
-<span class="sourceLineNo">329</span>    public long getActiveMinProcId() {<a name="line.329"></a>
-<span class="sourceLineNo">330</span>      long minProcId = start;<a name="line.330"></a>
-<span class="sourceLineNo">331</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span>        if (deleted[i] == 0) {<a name="line.332"></a>
-<span class="sourceLineNo">333</span>          return(minProcId);<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>        if (deleted[i] != WORD_MASK) {<a name="line.336"></a>
-<span class="sourceLineNo">337</span>          for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.337"></a>
-<span class="sourceLineNo">338</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) != 0) {<a name="line.338"></a>
-<span class="sourceLineNo">339</span>              return minProcId + j;<a name="line.339"></a>
-<span class="sourceLineNo">340</span>            }<a name="line.340"></a>
-<span class="sourceLineNo">341</span>          }<a name="line.341"></a>
-<span class="sourceLineNo">342</span>        }<a name="line.342"></a>
-<span class="sourceLineNo">343</span><a name="line.343"></a>
-<span class="sourceLineNo">344</span>        minProcId += BITS_PER_WORD;<a name="line.344"></a>
-<span class="sourceLineNo">345</span>      }<a name="line.345"></a>
-<span class="sourceLineNo">346</span>      return minProcId;<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>    public long getActiveMaxProcId() {<a name="line.349"></a>
-<span class="sourceLineNo">350</span>      long maxProcId = getEnd();<a name="line.350"></a>
-<span class="sourceLineNo">351</span>      for (int i = deleted.length - 1; i &gt;= 0; --i) {<a name="line.351"></a>
-<span class="sourceLineNo">352</span>        if (deleted[i] == 0) {<a name="line.352"></a>
-<span class="sourceLineNo">353</span>          return maxProcId;<a name="line.353"></a>
-<span class="sourceLineNo">354</span>        }<a name="line.354"></a>
-<span class="sourceLineNo">355</span><a name="line.355"></a>
-<span class="sourceLineNo">356</span>        if (deleted[i] != WORD_MASK) {<a name="line.356"></a>
-<span class="sourceLineNo">357</span>          for (int j = BITS_PER_WORD - 1; j &gt;= 0; --j) {<a name="line.357"></a>
-<span class="sourceLineNo">358</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.358"></a>
-<span class="sourceLineNo">359</span>              return maxProcId - (BITS_PER_WORD - 1 - j);<a name="line.359"></a>
-<span class="sourceLineNo">360</span>            }<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>        maxProcId -= BITS_PER_WORD;<a name="line.363"></a>
-<span class="sourceLineNo">364</span>      }<a name="line.364"></a>
-<span class="sourceLineNo">365</span>      return maxProcId;<a name="line.365"></a>
-<span class="sourceLineNo">366</span>    }<a name="line.366"></a>
-<span class="sourceLineNo">367</span><a name="line.367"></a>
-<span class="sourceLineNo">368</span>    // ========================================================================<a name="line.368"></a>
-<span class="sourceLineNo">369</span>    //  Bitmap Helpers<a name="line.369"></a>
-<span class="sourceLineNo">370</span>    // ========================================================================<a name="line.370"></a>
-<span class="sourceLineNo">371</span>    private int getBitmapIndex(final long procId) {<a name="line.371"></a>
-<span class="sourceLineNo">372</span>      return (int)(procId - start);<a name="line.372"></a>
-<span class="sourceLineNo">373</span>    }<a name="line.373"></a>
-<span class="sourceLineNo">374</span><a name="line.374"></a>
-<span class="sourceLineNo">375</span>    private void updateState(final long procId, final boolean isDeleted) {<a name="line.375"></a>
-<span class="sourceLineNo">376</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.376"></a>
-<span class="sourceLineNo">377</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.377"></a>
-<span class="sourceLineNo">378</span>      long value = (1L &lt;&lt; bitmapIndex);<a name="line.378"></a>
-<span class="sourceLineNo">379</span><a name="line.379"></a>
-<span class="sourceLineNo">380</span>      if (isDeleted) {<a name="line.380"></a>
-<span class="sourceLineNo">381</span>        updated[wordIndex] |= value;<a name="line.381"></a>
-<span class="sourceLineNo">382</span>        deleted[wordIndex] |= value;<a name="line.382"></a>
-<span class="sourceLineNo">383</span>      } else {<a name="line.383"></a>
-<span class="sourceLineNo">384</span>        updated[wordIndex] |= value;<a name="line.384"></a>
-<span class="sourceLineNo">385</span>        deleted[wordIndex] &amp;= ~value;<a name="line.385"></a>
-<span class="sourceLineNo">386</span>      }<a name="line.386"></a>
-<span class="sourceLineNo">387</span>    }<a name="line.387"></a>
-<span class="sourceLineNo">388</span><a name="line.388"></a>
-<span class="sourceLineNo">389</span>    // ========================================================================<a name="line.389"></a>
-<span class="sourceLineNo">390</span>    //  Helpers<a name="line.390"></a>
-<span class="sourceLineNo">391</span>    // ========================================================================<a name="line.391"></a>
-<span class="sourceLineNo">392</span>    /**<a name="line.392"></a>
-<span class="sourceLineNo">393</span>     * @return upper boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.393"></a>
-<span class="sourceLineNo">394</span>     */<a name="line.394"></a>
-<span class="sourceLineNo">395</span>    private static long alignUp(final long x) {<a name="line.395"></a>
-<span class="sourceLineNo">396</span>      return (x + (BITS_PER_WORD - 1)) &amp; -BITS_PER_WORD;<a name="line.396"></a>
-<span class="sourceLineNo">397</span>    }<a name="line.397"></a>
-<span class="sourceLineNo">398</span><a name="line.398"></a>
-<span class="sourceLineNo">399</span>    /**<a name="line.399"></a>
-<span class="sourceLineNo">400</span>     * @return lower boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.400"></a>
-<span class="sourceLineNo">401</span>     */<a name="line.401"></a>
-<span class="sourceLineNo">402</span>    private static long alignDown(final long x) {<a name="line.402"></a>
-<span class="sourceLineNo">403</span>      return x &amp; -BITS_PER_WORD;<a name="line.403"></a>
-<span class="sourceLineNo">404</span>    }<a name="line.404"></a>
-<span class="sourceLineNo">405</span>  }<a name="line.405"></a>
-<span class="sourceLineNo">406</span><a name="line.406"></a>
-<span class="sourceLineNo">407</span>  public void insert(long procId) {<a name="line.407"></a>
-<span class="sourceLineNo">408</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.408"></a>
-<span class="sourceLineNo">409</span>    node.update(procId);<a name="line.409"></a>
-<span class="sourceLineNo">410</span>    trackProcIds(procId);<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>  public void insert(final long procId, final long[] subProcIds) {<a name="line.413"></a>
-<span class="sourceLineNo">414</span>    update(procId);<a name="line.414"></a>
-<span class="sourceLineNo">415</span>    for (int i = 0; i &lt; subProcIds.length; ++i) {<a name="line.415"></a>
-<span class="sourceLineNo">416</span>      insert(subProcIds[i]);<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>  public void update(long procId) {<a name="line.420"></a>
-<span class="sourceLineNo">421</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.421"></a>
-<span class="sourceLineNo">422</span>    assert entry != null : "expected node to update procId=" + procId;<a name="line.422"></a>
-<span class="sourceLineNo">423</span><a name="line.423"></a>
-<span class="sourceLineNo">424</span>    BitSetNode node = entry.getValue();<a name="line.424"></a>
-<span class="sourceLineNo">425</span>    assert node.contains(procId);<a name="line.425"></a>
-<span class="sourceLineNo">426</span>    node.update(procId);<a name="line.426"></a>
-<span class="sourceLineNo">427</span>    trackProcIds(procId);<a name="line.427"></a>
-<span class="sourceLineNo">428</span>  }<a name="line.428"></a>
-<span class="sourceLineNo">429</span><a name="line.429"></a>
-<span class="sourceLineNo">430</span>  public void delete(long procId) {<a name="line.430"></a>
-<span class="sourceLineNo">431</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.431"></a>
-<span class="sourceLineNo">432</span>    assert entry != null : "expected node to delete procId=" + procId;<a name="line.432"></a>
-<span class="sourceLineNo">433</span><a name="line.433"></a>
-<span class="sourceLineNo">434</span>    BitSetNode node = entry.getValue();<a name="line.434"></a>
-<span class="sourceLineNo">435</span>    assert node.contains(procId) : "expected procId in the node";<a name="line.435"></a>
-<span class="sourceLineNo">436</span>    node.delete(procId);<a name="line.436"></a>
-<span class="sourceLineNo">437</span><a name="line.437"></a>
-<span class="sourceLineNo">438</span>    if (!keepDeletes &amp;&amp; node.isEmpty()) {<a name="line.438"></a>
-<span class="sourceLineNo">439</span>      // TODO: RESET if (map.size() == 1)<a name="line.439"></a>
-<span class="sourceLineNo">440</span>      map.remove(entry.getKey());<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>    trackProcIds(procId);<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>  private void trackProcIds(long procId) {<a name="line.446"></a>
-<span class="sourceLineNo">447</span>    minUpdatedProcId = Math.min(minUpdatedProcId, procId);<a name="line.447"></a>
-<span class="sourceLineNo">448</span>    maxUpdatedProcId = Math.max(maxUpdatedProcId, procId);<a name="line.448"></a>
-<span class="sourceLineNo">449</span>  }<a name="line.449"></a>
-<span class="sourceLineNo">450</span><a name="line.450"></a>
-<span class="sourceLineNo">451</span>  public long getUpdatedMinProcId() {<a name="line.451"></a>
-<span class="sourceLineNo">452</span>    return minUpdatedProcId;<a name="line.452"></a>
+<span class="sourceLineNo">024</span>import java.util.Arrays;<a name="line.24"></a>
+<span class="sourceLineNo">025</span>import java.util.Iterator;<a name="line.25"></a>
+<span class="sourceLineNo">026</span>import java.util.Map;<a name="line.26"></a>
+<span class="sourceLineNo">027</span>import java.util.TreeMap;<a name="line.27"></a>
+<span class="sourceLineNo">028</span><a name="line.28"></a>
+<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.29"></a>
+<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.classification.InterfaceStability;<a name="line.30"></a>
+<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos;<a name="line.31"></a>
+<span class="sourceLineNo">032</span><a name="line.32"></a>
+<span class="sourceLineNo">033</span>/**<a name="line.33"></a>
+<span class="sourceLineNo">034</span> * Keeps track of live procedures.<a name="line.34"></a>
+<span class="sourceLineNo">035</span> *<a name="line.35"></a>
+<span class="sourceLineNo">036</span> * It can be used by the ProcedureStore to identify which procedures are already<a name="line.36"></a>
+<span class="sourceLineNo">037</span> * deleted/completed to avoid the deserialization step on restart<a name="line.37"></a>
+<span class="sourceLineNo">038</span> */<a name="line.38"></a>
+<span class="sourceLineNo">039</span>@InterfaceAudience.Private<a name="line.39"></a>
+<span class="sourceLineNo">040</span>@InterfaceStability.Evolving<a name="line.40"></a>
+<span class="sourceLineNo">041</span>public class ProcedureStoreTracker {<a name="line.41"></a>
+<span class="sourceLineNo">042</span>  // Key is procedure id corresponding to first bit of the bitmap.<a name="line.42"></a>
+<span class="sourceLineNo">043</span>  private final TreeMap&lt;Long, BitSetNode&gt; map = new TreeMap&lt;Long, BitSetNode&gt;();<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>   * If true, do not remove bits corresponding to deleted procedures. Note that this can result<a name="line.46"></a>
+<span class="sourceLineNo">047</span>   * in huge bitmaps overtime.<a name="line.47"></a>
+<span class="sourceLineNo">048</span>   * Currently, it's set to true only when building tracker state from logs during recovery. During<a name="line.48"></a>
+<span class="sourceLineNo">049</span>   * recovery, if we are sure that a procedure has been deleted, reading its old update entries<a name="line.49"></a>
+<span class="sourceLineNo">050</span>   * can be skipped.<a name="line.50"></a>
+<span class="sourceLineNo">051</span>   */<a name="line.51"></a>
+<span class="sourceLineNo">052</span>  private boolean keepDeletes = false;<a name="line.52"></a>
+<span class="sourceLineNo">053</span>  /**<a name="line.53"></a>
+<span class="sourceLineNo">054</span>   * If true, it means tracker has incomplete information about the active/deleted procedures.<a name="line.54"></a>
+<span class="sourceLineNo">055</span>   * It's set to true only when recovering from old logs. See {@link #isDeleted(long)} docs to<a name="line.55"></a>
+<span class="sourceLineNo">056</span>   * understand it's real use.<a name="line.56"></a>
+<span class="sourceLineNo">057</span>   */<a name="line.57"></a>
+<span class="sourceLineNo">058</span>  private boolean partial = false;<a name="line.58"></a>
+<span class="sourceLineNo">059</span><a name="line.59"></a>
+<span class="sourceLineNo">060</span>  private long minUpdatedProcId = Long.MAX_VALUE;<a name="line.60"></a>
+<span class="sourceLineNo">061</span>  private long maxUpdatedProcId = Long.MIN_VALUE;<a name="line.61"></a>
+<span class="sourceLineNo">062</span><a name="line.62"></a>
+<span class="sourceLineNo">063</span>  public enum DeleteState { YES, NO, MAYBE }<a name="line.63"></a>
+<span class="sourceLineNo">064</span><a name="line.64"></a>
+<span class="sourceLineNo">065</span>  /**<a name="line.65"></a>
+<span class="sourceLineNo">066</span>   * A bitmap which can grow/merge with other {@link BitSetNode} (if certain conditions are met).<a name="line.66"></a>
+<span class="sourceLineNo">067</span>   * Boundaries of bitmap are aligned to multiples of {@link BitSetNode#BITS_PER_WORD}. So the<a name="line.67"></a>
+<span class="sourceLineNo">068</span>   * range of a {@link BitSetNode} is from [x * K, y * K) where x and y are integers, y &gt; x and K<a name="line.68"></a>
+<span class="sourceLineNo">069</span>   * is BITS_PER_WORD.<a name="line.69"></a>
+<span class="sourceLineNo">070</span>   */<a name="line.70"></a>
+<span class="sourceLineNo">071</span>  public static class BitSetNode {<a name="line.71"></a>
+<span class="sourceLineNo">072</span>    private final static long WORD_MASK = 0xffffffffffffffffL;<a name="line.72"></a>
+<span class="sourceLineNo">073</span>    private final static int ADDRESS_BITS_PER_WORD = 6;<a name="line.73"></a>
+<span class="sourceLineNo">074</span>    private final static int BITS_PER_WORD = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.74"></a>
+<span class="sourceLineNo">075</span>    private final static int MAX_NODE_SIZE = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<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>     * Mimics {@link ProcedureStoreTracker#partial}.<a name="line.78"></a>
+<span class="sourceLineNo">079</span>     */<a name="line.79"></a>
+<span class="sourceLineNo">080</span>    private final boolean partial;<a name="line.80"></a>
+<span class="sourceLineNo">081</span>    /**<a name="line.81"></a>
+<span class="sourceLineNo">082</span>     * Set of procedures which have been updated since last {@link #resetUpdates()}.<a name="line.82"></a>
+<span class="sourceLineNo">083</span>     * Useful to track procedures which have been updated since last WAL write.<a name="line.83"></a>
+<span class="sourceLineNo">084</span>     */<a name="line.84"></a>
+<span class="sourceLineNo">085</span>    private long[] updated;<a name="line.85"></a>
+<span class="sourceLineNo">086</span>    /**<a name="line.86"></a>
+<span class="sourceLineNo">087</span>     * Keeps track of procedure ids which belong to this bitmap's range and have been deleted.<a name="line.87"></a>
+<span class="sourceLineNo">088</span>     */<a name="line.88"></a>
+<span class="sourceLineNo">089</span>    private long[] deleted;<a name="line.89"></a>
+<span class="sourceLineNo">090</span>    /**<a name="line.90"></a>
+<span class="sourceLineNo">091</span>     * Offset of bitmap i.e. procedure id corresponding to first bit.<a name="line.91"></a>
+<span class="sourceLineNo">092</span>     */<a name="line.92"></a>
+<span class="sourceLineNo">093</span>    private long start;<a name="line.93"></a>
+<span class="sourceLineNo">094</span><a name="line.94"></a>
+<span class="sourceLineNo">095</span>    public void dump() {<a name="line.95"></a>
+<span class="sourceLineNo">096</span>      System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(),<a name="line.96"></a>
+<span class="sourceLineNo">097</span>        getActiveMinProcId(), getActiveMaxProcId());<a name="line.97"></a>
+<span class="sourceLineNo">098</span>      System.out.println("Update:");<a name="line.98"></a>
+<span class="sourceLineNo">099</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.99"></a>
+<span class="sourceLineNo">100</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.100"></a>
+<span class="sourceLineNo">101</span>          System.out.print((updated[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.101"></a>
+<span class="sourceLineNo">102</span>        }<a name="line.102"></a>
+<span class="sourceLineNo">103</span>        System.out.println(" " + i);<a name="line.103"></a>
+<span class="sourceLineNo">104</span>      }<a name="line.104"></a>
+<span class="sourceLineNo">105</span>      System.out.println();<a name="line.105"></a>
+<span class="sourceLineNo">106</span>      System.out.println("Delete:");<a name="line.106"></a>
+<span class="sourceLineNo">107</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.107"></a>
+<span class="sourceLineNo">108</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.108"></a>
+<span class="sourceLineNo">109</span>          System.out.print((deleted[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.109"></a>
+<span class="sourceLineNo">110</span>        }<a name="line.110"></a>
+<span class="sourceLineNo">111</span>        System.out.println(" " + i);<a name="line.111"></a>
+<span class="sourceLineNo">112</span>      }<a name="line.112"></a>
+<span class="sourceLineNo">113</span>      System.out.println();<a name="line.113"></a>
+<span class="sourceLineNo">114</span>    }<a name="line.114"></a>
+<span class="sourceLineNo">115</span><a name="line.115"></a>
+<span class="sourceLineNo">116</span>    public BitSetNode(final long procId, final boolean partial) {<a name="line.116"></a>
+<span class="sourceLineNo">117</span>      start = alignDown(procId);<a name="line.117"></a>
+<span class="sourceLineNo">118</span><a name="line.118"></a>
+<span class="sourceLineNo">119</span>      int count = 1;<a name="line.119"></a>
+<span class="sourceLineNo">120</span>      updated = new long[count];<a name="line.120"></a>
+<span class="sourceLineNo">121</span>      deleted = new long[count];<a name="line.121"></a>
+<span class="sourceLineNo">122</span>      for (int i = 0; i &lt; count; ++i) {<a name="line.122"></a>
+<span class="sourceLineNo">123</span>        updated[i] = 0;<a name="line.123"></a>
+<span class="sourceLineNo">124</span>        deleted[i] = partial ? 0 : WORD_MASK;<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>      this.partial = partial;<a name="line.127"></a>
+<span class="sourceLineNo">128</span>      updateState(procId, false);<a name="line.128"></a>
+<span class="sourceLineNo">129</span>    }<a name="line.129"></a>
+<span class="sourceLineNo">130</span><a name="line.130"></a>
+<span class="sourceLineNo">131</span>    protected BitSetNode(final long start, final long[] updated, final long[] deleted) {<a name="line.131"></a>
+<span class="sourceLineNo">132</span>      this.start = start;<a name="line.132"></a>
+<span class="sourceLineNo">133</span>      this.updated = updated;<a name="line.133"></a>
+<span class="sourceLineNo">134</span>      this.deleted = deleted;<a name="line.134"></a>
+<span class="sourceLineNo">135</span>      this.partial = false;<a name="line.135"></a>
+<span class="sourceLineNo">136</span>    }<a name="line.136"></a>
+<span class="sourceLineNo">137</span><a name="line.137"></a>
+<span class="sourceLineNo">138</span>    public void update(final long procId) {<a name="line.138"></a>
+<span class="sourceLineNo">139</span>      updateState(procId, false);<a name="line.139"></a>
+<span class="sourceLineNo">140</span>    }<a name="line.140"></a>
+<span class="sourceLineNo">141</span><a name="line.141"></a>
+<span class="sourceLineNo">142</span>    public void delete(final long procId) {<a name="line.142"></a>
+<span class="sourceLineNo">143</span>      updateState(procId, true);<a name="line.143"></a>
+<span class="sourceLineNo">144</span>    }<a name="line.144"></a>
+<span class="sourceLineNo">145</span><a name="line.145"></a>
+<span class="sourceLineNo">146</span>    public Long getStart() {<a name="line.146"></a>
+<span class="sourceLineNo">147</span>      return start;<a name="line.147"></a>
+<span class="sourceLineNo">148</span>    }<a name="line.148"></a>
+<span class="sourceLineNo">149</span><a name="line.149"></a>
+<span class="sourceLineNo">150</span>    public Long getEnd() {<a name="line.150"></a>
+<span class="sourceLineNo">151</span>      return start + (updated.length &lt;&lt; ADDRESS_BITS_PER_WORD) - 1;<a name="line.151"></a>
+<span class="sourceLineNo">152</span>    }<a name="line.152"></a>
+<span class="sourceLineNo">153</span><a name="line.153"></a>
+<span class="sourceLineNo">154</span>    public boolean contains(final long procId) {<a name="line.154"></a>
+<span class="sourceLineNo">155</span>      return start &lt;= procId &amp;&amp; procId &lt;= getEnd();<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>    public DeleteState isDeleted(final long procId) {<a name="line.158"></a>
+<span class="sourceLineNo">159</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.159"></a>
+<span class="sourceLineNo">160</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.160"></a>
+<span class="sourceLineNo">161</span>      if (wordIndex &gt;= deleted.length) {<a name="line.161"></a>
+<span class="sourceLineNo">162</span>        return DeleteState.MAYBE;<a name="line.162"></a>
+<span class="sourceLineNo">163</span>      }<a name="line.163"></a>
+<span class="sourceLineNo">164</span>      return (deleted[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.164"></a>
+<span class="sourceLineNo">165</span>    }<a name="line.165"></a>
+<span class="sourceLineNo">166</span><a name="line.166"></a>
+<span class="sourceLineNo">167</span>    private boolean isUpdated(final long procId) {<a name="line.167"></a>
+<span class="sourceLineNo">168</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.168"></a>
+<span class="sourceLineNo">169</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.169"></a>
+<span class="sourceLineNo">170</span>      if (wordIndex &gt;= updated.length) {<a name="line.170"></a>
+<span class="sourceLineNo">171</span>        return false;<a name="line.171"></a>
+<span class="sourceLineNo">172</span>      }<a name="line.172"></a>
+<span class="sourceLineNo">173</span>      return (updated[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0;<a name="line.173"></a>
+<span class="sourceLineNo">174</span>    }<a name="line.174"></a>
+<span class="sourceLineNo">175</span><a name="line.175"></a>
+<span class="sourceLineNo">176</span>    public boolean isUpdated() {<a name="line.176"></a>
+<span class="sourceLineNo">177</span>      // TODO: cache the value<a name="line.177"></a>
+<span class="sourceLineNo">178</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.178"></a>
+<span class="sourceLineNo">179</span>        if ((updated[i] | deleted[i]) != WORD_MASK) {<a name="line.179"></a>
+<span class="sourceLineNo">180</span>          return false;<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>      return true;<a name="line.183"></a>
+<span class="sourceLineNo">184</span>    }<a name="line.184"></a>
+<span class="sourceLineNo">185</span><a name="line.185"></a>
+<span class="sourceLineNo">186</span>    /**<a name="line.186"></a>
+<span class="sourceLineNo">187</span>     * @return true, if there are no active procedures in this BitSetNode, else false.<a name="line.187"></a>
+<span class="sourceLineNo">188</span>     */<a name="line.188"></a>
+<span class="sourceLineNo">189</span>    public boolean isEmpty() {<a name="line.189"></a>
+<span class="sourceLineNo">190</span>      // TODO: cache the value<a name="line.190"></a>
+<span class="sourceLineNo">191</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.191"></a>
+<span class="sourceLineNo">192</span>        if (deleted[i] != WORD_MASK) {<a name="line.192"></a>
+<span class="sourceLineNo">193</span>          return false;<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>      return true;<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 resetUpdates() {<a name="line.199"></a>
+<span class="sourceLineNo">200</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.200"></a>
+<span class="sourceLineNo">201</span>        updated[i] = 0;<a name="line.201"></a>
+<span class="sourceLineNo">202</span>      }<a name="line.202"></a>
+<span class="sourceLineNo">203</span>    }<a name="line.203"></a>
+<span class="sourceLineNo">204</span><a name="line.204"></a>
+<span class="sourceLineNo">205</span>    /**<a name="line.205"></a>
+<span class="sourceLineNo">206</span>     * Clears the {@link #deleted} bitmaps.<a name="line.206"></a>
+<span class="sourceLineNo">207</span>     */<a name="line.207"></a>
+<span class="sourceLineNo">208</span>    public void undeleteAll() {<a name="line.208"></a>
+<span class="sourceLineNo">209</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.209"></a>
+<span class="sourceLineNo">210</span>        deleted[i] = 0;<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><a name="line.213"></a>
+<span class="sourceLineNo">214</span>    public void unsetPartialFlag() {<a name="line.214"></a>
+<span class="sourceLineNo">215</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.215"></a>
+<span class="sourceLineNo">216</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.216"></a>
+<span class="sourceLineNo">217</span>          if ((updated[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.217"></a>
+<span class="sourceLineNo">218</span>            deleted[i] |= (1L &lt;&lt; j);<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>    //  Convert to/from Protocol Buffer.<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>    public ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.228"></a>
+<span class="sourceLineNo">229</span>      ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.229"></a>
+<span class="sourceLineNo">230</span>        ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.230"></a>
+<span class="sourceLineNo">231</span>      builder.setStartId(start);<a name="line.231"></a>
+<span class="sourceLineNo">232</span>      for (int i = 0; i &lt; updated.length; ++i) {<a name="line.232"></a>
+<span class="sourceLineNo">233</span>        builder.addUpdated(updated[i]);<a name="line.233"></a>
+<span class="sourceLineNo">234</span>        builder.addDeleted(deleted[i]);<a name="line.234"></a>
+<span class="sourceLineNo">235</span>      }<a name="line.235"></a>
+<span class="sourceLineNo">236</span>      return builder.build();<a name="line.236"></a>
+<span class="sourceLineNo">237</span>    }<a name="line.237"></a>
+<span class="sourceLineNo">238</span><a name="line.238"></a>
+<span class="sourceLineNo">239</span>    public static BitSetNode convert(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.239"></a>
+<span class="sourceLineNo">240</span>      long start = data.getStartId();<a name="line.240"></a>
+<span class="sourceLineNo">241</span>      int size = data.getUpdatedCount();<a name="line.241"></a>
+<span class="sourceLineNo">242</span>      long[] updated = new long[size];<a name="line.242"></a>
+<span class="sourceLineNo">243</span>      long[] deleted = new long[size];<a name="line.243"></a>
+<span class="sourceLineNo">244</span>      for (int i = 0; i &lt; size; ++i) {<a name="line.244"></a>
+<span class="sourceLineNo">245</span>        updated[i] = data.getUpdated(i);<a name="line.245"></a>
+<span class="sourceLineNo">246</span>        deleted[i] = data.getDeleted(i);<a name="line.246"></a>
+<span class="sourceLineNo">247</span>      }<a name="line.247"></a>
+<span class="sourceLineNo">248</span>      return new BitSetNode(start, updated, deleted);<a name="line.248"></a>
+<span class="sourceLineNo">249</span>    }<a name="line.249"></a>
+<span class="sourceLineNo">250</span><a name="line.250"></a>
+<span class="sourceLineNo">251</span>    // ========================================================================<a name="line.251"></a>
+<span class="sourceLineNo">252</span>    //  Grow/Merge Helpers<a name="line.252"></a>
+<span class="sourceLineNo">253</span>    // ========================================================================<a name="line.253"></a>
+<span class="sourceLineNo">254</span>    public boolean canGrow(final long procId) {<a name="line.254"></a>
+<span class="sourceLineNo">255</span>      return Math.abs(procId - start) &lt; MAX_NODE_SIZE;<a name="line.255"></a>
+<span class="sourceLineNo">256</span>    }<a name="line.256"></a>
+<span class="sourceLineNo">257</span><a name="line.257"></a>
+<span class="sourceLineNo">258</span>    public boolean canMerge(final BitSetNode rightNode) {<a name="line.258"></a>
+<span class="sourceLineNo">259</span>      // Can just compare 'starts' since boundaries are aligned to multiples of BITS_PER_WORD.<a name="line.259"></a>
+<span class="sourceLineNo">260</span>      assert start &lt; rightNode.start;<a name="line.260"></a>
+<span class="sourceLineNo">261</span>      return (rightNode.getEnd() - start) &lt; MAX_NODE_SIZE;<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>    public void grow(final long procId) {<a name="line.264"></a>
+<span class="sourceLineNo">265</span>      int delta, offset;<a name="line.265"></a>
+<span class="sourceLineNo">266</span><a name="line.266"></a>
+<span class="sourceLineNo">267</span>      if (procId &lt; start) {<a name="line.267"></a>
+<span class="sourceLineNo">268</span>        // add to head<a name="line.268"></a>
+<span class="sourceLineNo">269</span>        long newStart = alignDown(procId);<a name="line.269"></a>
+<span class="sourceLineNo">270</span>        delta = (int)(start - newStart) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.270"></a>
+<span class="sourceLineNo">271</span>        offset = delta;<a name="line.271"></a>
+<span class="sourceLineNo">272</span>        start = newStart;<a name="line.272"></a>
+<span class="sourceLineNo">273</span>      } else {<a name="line.273"></a>
+<span class="sourceLineNo">274</span>        // Add to tail<a name="line.274"></a>
+<span class="sourceLineNo">275</span>        long newEnd = alignUp(procId + 1);<a name="line.275"></a>
+<span class="sourceLineNo">276</span>        delta = (int)(newEnd - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.276"></a>
+<span class="sourceLineNo">277</span>        offset = 0;<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>      long[] newBitmap;<a name="line.280"></a>
+<span class="sourceLineNo">281</span>      int oldSize = updated.length;<a name="line.281"></a>
+<span class="sourceLineNo">282</span><a name="line.282"></a>
+<span class="sourceLineNo">283</span>      newBitmap = new long[oldSize + delta];<a name="line.283"></a>
+<span class="sourceLineNo">284</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.284"></a>
+<span class="sourceLineNo">285</span>        newBitmap[i] = 0;<a name="line.285"></a>
+<span class="sourceLineNo">286</span>      }<a name="line.286"></a>
+<span class="sourceLineNo">287</span>      System.arraycopy(updated, 0, newBitmap, offset, oldSize);<a name="line.287"></a>
+<span class="sourceLineNo">288</span>      updated = newBitmap;<a name="line.288"></a>
+<span class="sourceLineNo">289</span><a name="line.289"></a>
+<span class="sourceLineNo">290</span>      newBitmap = new long[deleted.length + delta];<a name="line.290"></a>
+<span class="sourceLineNo">291</span>      for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.291"></a>
+<span class="sourceLineNo">292</span>        newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.292"></a>
+<span class="sourceLineNo">293</span>      }<a name="line.293"></a>
+<span class="sourceLineNo">294</span>      System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.294"></a>
+<span class="sourceLineNo">295</span>      deleted = newBitmap;<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>    public void merge(final BitSetNode rightNode) {<a name="line.298"></a>
+<span class="sourceLineNo">299</span>      int delta = (int)(rightNode.getEnd() - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.299"></a>
+<span class="sourceLineNo">300</span><a name="line.300"></a>
+<span class="sourceLineNo">301</span>      long[] newBitmap;<a name="line.301"></a>
+<span class="sourceLineNo">302</span>      int oldSize = updated.length;<a name="line.302"></a>
+<span class="sourceLineNo">303</span>      int newSize = (delta - rightNode.updated.length);<a name="line.303"></a>
+<span class="sourceLineNo">304</span>      int offset = oldSize + newSize;<a name="line.304"></a>
+<span class="sourceLineNo">305</span><a name="line.305"></a>
+<span class="sourceLineNo">306</span>      newBitmap = new long[oldSize + delta];<a name="line.306"></a>
+<span class="sourceLineNo">307</span>      System.arraycopy(updated, 0, newBitmap, 0, oldSize);<a name="line.307"></a>
+<span class="sourceLineNo">308</span>      System.arraycopy(rightNode.updated, 0, newBitmap, offset, rightNode.updated.length);<a name="line.308"></a>
+<span class="sourceLineNo">309</span>      updated = newBitmap;<a name="line.309"></a>
+<span class="sourceLineNo">310</span><a name="line.310"></a>
+<span class="sourceLineNo">311</span>      newBitmap = new long[oldSize + delta];<a name="line.311"></a>
+<span class="sourceLineNo">312</span>      System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.312"></a>
+<span class="sourceLineNo">313</span>      System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.313"></a>
+<span class="sourceLineNo">314</span>      deleted = newBitmap;<a name="line.314"></a>
+<span class="sourceLineNo">315</span><a name="line.315"></a>
+<span class="sourceLineNo">316</span>      for (int i = 0; i &lt; newSize; ++i) {<a name="line.316"></a>
+<span class="sourceLineNo">317</span>        updated[offset + i] = 0;<a name="line.317"></a>
+<span class="sourceLineNo">318</span>        deleted[offset + i] = partial ? 0 : WORD_MASK;<a name="line.318"></a>
+<span class="sourceLineNo">319</span>      }<a name="line.319"></a>
+<span class="sourceLineNo">320</span>    }<a name="line.320"></a>
+<span class="sourceLineNo">321</span><a name="line.321"></a>
+<span class="sourceLineNo">322</span>    @Override<a name="line.322"></a>
+<span class="sourceLineNo">323</span>    public String toString() {<a name="line.323"></a>
+<span class="sourceLineNo">324</span>      return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<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>    // ========================================================================<a name="line.327"></a>
+<span class="sourceLineNo">328</span>    //  Min/Max Helpers<a name="line.328"></a>
+<span class="sourceLineNo">329</span>    // ========================================================================<a name="line.329"></a>
+<span class="sourceLineNo">330</span>    public long getActiveMinProcId() {<a name="line.330"></a>
+<span class="sourceLineNo">331</span>      long minProcId = start;<a name="line.331"></a>
+<span class="sourceLineNo">332</span>      for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.332"></a>
+<span class="sourceLineNo">333</span>        if (deleted[i] == 0) {<a name="line.333"></a>
+<span class="sourceLineNo">334</span>          return(minProcId);<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>        if (deleted[i] != WORD_MASK) {<a name="line.337"></a>
+<span class="sourceLineNo">338</span>          for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.338"></a>
+<span class="sourceLineNo">339</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) != 0) {<a name="line.339"></a>
+<span class="sourceLineNo">340</span>              return minProcId + j;<a name="line.340"></a>
+<span class="sourceLineNo">341</span>            }<a name="line.341"></a>
+<span class="sourceLineNo">342</span>          }<a name="line.342"></a>
+<span class="sourceLineNo">343</span>        }<a name="line.343"></a>
+<span class="sourceLineNo">344</span><a name="line.344"></a>
+<span class="sourceLineNo">345</span>        minProcId += BITS_PER_WORD;<a name="line.345"></a>
+<span class="sourceLineNo">346</span>      }<a name="line.346"></a>
+<span class="sourceLineNo">347</span>      return minProcId;<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>    public long getActiveMaxProcId() {<a name="line.350"></a>
+<span class="sourceLineNo">351</span>      long maxProcId = getEnd();<a name="line.351"></a>
+<span class="sourceLineNo">352</span>      for (int i = deleted.length - 1; i &gt;= 0; --i) {<a name="line.352"></a>
+<span class="sourceLineNo">353</span>        if (deleted[i] == 0) {<a name="line.353"></a>
+<span class="sourceLineNo">354</span>          return maxProcId;<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>        if (deleted[i] != WORD_MASK) {<a name="line.357"></a>
+<span class="sourceLineNo">358</span>          for (int j = BITS_PER_WORD - 1; j &gt;= 0; --j) {<a name="line.358"></a>
+<span class="sourceLineNo">359</span>            if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.359"></a>
+<span class="sourceLineNo">360</span>              return maxProcId - (BITS_PER_WORD - 1 - j);<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>        }<a name="line.363"></a>
+<span class="sourceLineNo">364</span>        maxProcId -= BITS_PER_WORD;<a name="line.364"></a>
+<span class="sourceLineNo">365</span>      }<a name="line.365"></a>
+<span class="sourceLineNo">366</span>      return maxProcId;<a name="line.366"></a>
+<span class="sourceLineNo">367</span>    }<a name="line.367"></a>
+<span class="sourceLineNo">368</span><a name="line.368"></a>
+<span class="sourceLineNo">369</span>    // ========================================================================<a name="line.369"></a>
+<span class="sourceLineNo">370</span>    //  Bitmap Helpers<a name="line.370"></a>
+<span class="sourceLineNo">371</span>    // ========================================================================<a name="line.371"></a>
+<span class="sourceLineNo">372</span>    private int getBitmapIndex(final long procId) {<a name="line.372"></a>
+<span class="sourceLineNo">373</span>      return (int)(procId - start);<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>    private void updateState(final long procId, final boolean isDeleted) {<a name="line.376"></a>
+<span class="sourceLineNo">377</span>      int bitmapIndex = getBitmapIndex(procId);<a name="line.377"></a>
+<span class="sourceLineNo">378</span>      int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.378"></a>
+<span class="sourceLineNo">379</span>      long value = (1L &lt;&lt; bitmapIndex);<a name="line.379"></a>
+<span class="sourceLineNo">380</span><a name="line.380"></a>
+<span class="sourceLineNo">381</span>      if (isDeleted) {<a name="line.381"></a>
+<span class="sourceLineNo">382</span>        updated[wordIndex] |= value;<a name="line.382"></a>
+<span class="sourceLineNo">383</span>        deleted[wordIndex] |= value;<a name="line.383"></a>
+<span class="sourceLineNo">384</span>      } else {<a name="line.384"></a>
+<span class="sourceLineNo">385</span>        updated[wordIndex] |= value;<a name="line.385"></a>
+<span class="sourceLineNo">386</span>        deleted[wordIndex] &amp;= ~value;<a name="line.386"></a>
+<span class="sourceLineNo">387</span>      }<a name="line.387"></a>
+<span class="sourceLineNo">388</span>    }<a name="line.388"></a>
+<span class="sourceLineNo">389</span><a name="line.389"></a>
+<span class="sourceLineNo">390</span>    // ========================================================================<a name="line.390"></a>
+<span class="sourceLineNo">391</span>    //  Helpers<a name="line.391"></a>
+<span class="sourceLineNo">392</span>    // ========================================================================<a name="line.392"></a>
+<span class="sourceLineNo">393</span>    /**<a name="line.393"></a>
+<span class="sourceLineNo">394</span>     * @return upper boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.394"></a>
+<span class="sourceLineNo">395</span>     */<a name="line.395"></a>
+<span class="sourceLineNo">396</span>    private static long alignUp(final long x) {<a name="line.396"></a>
+<span class="sourceLineNo">397</span>      return (x + (BITS_PER_WORD - 1)) &amp; -BITS_PER_WORD;<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>    /**<a name="line.400"></a>
+<span class="sourceLineNo">401</span>     * @return lower boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.401"></a>
+<span class="sourceLineNo">402</span>     */<a name="line.402"></a>
+<span class="sourceLineNo">403</span>    private static long alignDown(final long x) {<a name="line.403"></a>
+<span class="sourceLineNo">404</span>      return x &amp; -BITS_PER_WORD;<a name="line.404"></a>
+<span class="sourceLineNo">405</span>    }<a name="line.405"></a>
+<span class="sourceLineNo">406</span>  }<a name="line.406"></a>
+<span class="sourceLineNo">407</span><a name="line.407"></a>
+<span class="sourceLineNo">408</span>  public void insert(long procId) {<a name="line.408"></a>
+<span class="sourceLineNo">409</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.409"></a>
+<span class="sourceLineNo">410</span>    node.update(procId);<a name="line.410"></a>
+<span class="sourceLineNo">411</span>    trackProcIds(procId);<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>  public void insert(final long procId, final long[] subProcIds) {<a name="line.414"></a>
+<span class="sourceLineNo">415</span>    update(procId);<a name="line.415"></a>
+<span class="sourceLineNo">416</span>    for (int i = 0; i &lt; subProcIds.length; ++i) {<a name="line.416"></a>
+<span class="sourceLineNo">417</span>      insert(subProcIds[i]);<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><a name="line.420"></a>
+<span class="sourceLineNo">421</span>  public void update(long procId) {<a name="line.421"></a>
+<span class="sourceLineNo">422</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.422"></a>
+<span class="sourceLineNo">423</span>    assert entry != null : "expected node to update procId=" + procId;<a name="line.423"></a>
+<span class="sourceLineNo">424</span><a name="line.424"></a>
+<span class="sourceLineNo">425</span>    BitSetNode node = entry.getValue();<a name="line.425"></a>
+<span class="sourceLineNo">426</span>    assert node.contains(procId);<a name="line.426"></a>
+<span class="sourceLineNo">427</span>    node.update(procId);<a name="line.427"></a>
+<span class="sourceLineNo">428</span>    trackProcIds(procId);<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>  public void delete(long procId) {<a name="line.431"></a>
+<span class="sourceLineNo">432</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.432"></a>
+<span class="sourceLineNo">433</span>    assert entry != null : "expected node to delete procId=" + procId;<a name="line.433"></a>
+<span class="sourceLineNo">434</span><a name="line.434"></a>
+<span class="sourceLineNo">435</span>    BitSetNode node = entry.getValue();<a name="line.435"></a>
+<span class="sourceLineNo">436</span>    assert node.contains(procId) : "expected procId in the node";<a name="line.436"></a>
+<span class="sourceLineNo">437</span>    node.delete(procId);<a name="line.437"></a>
+<span class="sourceLineNo">438</span><a name="line.438"></a>
+<span class="sourceLineNo">439</span>    if (!keepDeletes &amp;&amp; node.isEmpty()) {<a name="line.439"></a>
+<span class="sourceLineNo">440</span>      // TODO: RESET if (map.size() == 1)<a name="line.440"></a>
+<span class="sourceLineNo">441</span>      map.remove(entry.getKey());<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>    trackProcIds(procId);<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>  public void delete(long[] procIds) {<a name="line.447"></a>
+<span class="sourceLineNo">448</span>    // TODO: optimize<a name="line.448"></a>
+<span class="sourceLineNo">449</span>    Arrays.sort(procIds);<a name="line.449"></a>
+<span class="sourceLineNo">450</span>    for (int i = 0; i &lt; procIds.length; ++i) {<a name="line.450"></a>
+<span class="sourceLineNo">451</span>      delete(procIds[i]);<a name="line.451"></a>
+<span class="sourceLineNo">452</span>    }<a name="line.452"></a>
 <span class="sourceLineNo">453</span>  }<a name="line.453"></a>
 <span class="sourceLineNo">454</span><a name="line.454"></a>
-<span class="sourceLineNo">455</span>  public long getUpdatedMaxProcId() {<a name="line.455"></a>
-<span class="sourceLineNo">456</span>    return maxUpdatedProcId;<a name="line.456"></a>
-<span class="sourceLineNo">457</span>  }<a name="line.457"></a>
-<span class="sourceLineNo">458</span><a name="line.458"></a>
-<span class="sourceLineNo">459</span>  @InterfaceAudience.Private<a name="line.459"></a>
-<span class="sourceLineNo">460</span>  public void setDeleted(final long procId, final boolean isDeleted) {<a name="line.460"></a>
-<span class="sourceLineNo">461</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.461"></a>
-<span class="sourceLineNo">462</span>    assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.462"></a>
-<span class="sourceLineNo">463</span>    node.updateState(procId, isDeleted);<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>  public void reset() {<a name="line.466"></a>
-<span class="sourceLineNo">467</span>    this.keepDeletes = false;<a name="line.467"></a>
-<span class="sourceLineNo">468</span>    this.partial = false;<a name="line.468"></a>
-<span class="sourceLineNo">469</span>    this.map.clear();<a name="line.469"></a>
-<span class="sourceLineNo">470</span>    resetUpdates();<a name="line.470"></a>
-<span class="sourceLineNo">471</span>  }<a name="line.471"></a>
-<span class="sourceLineNo">472</span><a name="line.472"></a>
-<span class="sourceLineNo">473</span>  /**<a name="line.473"></a>
-<span class="sourceLineNo">474</span>   * If {@link #partial} is false, returns state from the bitmap. If no state is found for<a name="line.474"></a>
-<span class="sourceLineNo">475</span>   * {@code procId}, returns YES.<a name="line.475"></a>
-<span class="sourceLineNo">476</span>   * If partial is true, tracker doesn't have complete view of system state, so it returns MAYBE<a name="line.476"></a>
-<span class="sourceLineNo">477</span>   * if there is no update for the procedure or if it doesn't have a state in bitmap. Otherwise,<a name="line.477"></a>
-<span class="sourceLineNo">478</span>   * returns state from the bitmap.<a name="line.478"></a>
-<span class="sourceLineNo">479</span>   */<a name="line.479"></a>
-<span class="sourceLineNo">480</span>  public DeleteState isDeleted(long procId) {<a name="line.480"></a>
-<span class="sourceLineNo">481</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.floorEntry(procId);<a name="line.481"></a>
-<span class="sourceLineNo">482</span>    if (entry != null &amp;&amp; entry.getValue().contains(procId)) {<a name="line.482"></a>
-<span class="sourceLineNo">483</span>      BitSetNode node = entry.getValue();<a name="line.483"></a>
-<span class="sourceLineNo">484</span>      DeleteState state = node.isDeleted(procId);<a name="line.484"></a>
-<span class="sourceLineNo">485</span>      return partial &amp;&amp; !node.isUpdated(procId) ? DeleteState.MAYBE : state;<a name="line.485"></a>
-<span class="sourceLineNo">486</span>    }<a name="line.486"></a>
-<span class="sourceLineNo">487</span>    return partial ? DeleteState.MAYBE : DeleteState.YES;<a name="line.487"></a>
-<span class="sourceLineNo">488</span>  }<a name="line.488"></a>
-<span class="sourceLineNo">489</span><a name="line.489"></a>
-<span class="sourceLineNo">490</span>  public long getActiveMinProcId() {<a name="line.490"></a>
-<span class="sourceLineNo">491</span>    // TODO: Cache?<a name="line.491"></a>
-<span class="sourceLineNo">492</span>    Map.Entry&lt;Long, BitSetNode&gt; entry = map.firstEntry();<a name="line.492"></a>
-<span class="sourceLineNo">493</span>    return entry == null ? 0 : entry.getValue().getActiveMinProcId();<a name="line.493"></a>
-<span class="sourceLineNo">494</span>  }<a name="line.494"></a>
-<span class="sourceLineNo">495</span><a name="line.495"></a>
-<span class="sourceLineNo">496</span>  public void setKeepDeletes(boolean keepDeletes) {<a name="line.496"></a>
-<span class="sourceLineNo">497</span>    this.keepDeletes = keepDeletes;<a name="line.497"></a>
-<span class="sourceLineNo">498</span>    // If not to keep deletes, remove the BitSetNodes which are empty (i.e. contains ids of deleted<a name="line.498"></a>
-<span class="sourceLineNo">499</span>    // procedures).<a name="line.499"></a>
-<span class="sourceLineNo">500</span>    if (!keepDeletes) {<a name="line.500"></a>
-<span class="sourceLineNo">501</span>      Iterator&lt;Map.Entry&lt;Long, BitSetNode&gt;&gt; it = map.entrySet().iterator();<a name="line.501"></a>
-<span class="sourceLineNo">502</span>      while (it.hasNext()) {<a name="line.502"></a>
-<span class="sourceLineNo">503</span>        Map.Entry&lt;Long, BitSetNode&gt; entry = it.next();<a name="line.503"></a>
-<span class="sourceLineNo">504</span>        if (entry.getValue().isEmpty()) {<a name="line.504"></a>
-<span class="sourceLineNo">505</span>          it.remove();<a name="line.505"></a>
-<span class="sourceLineNo">506</span>        }<a name="line.506"></a>
-<span class="sourceLineNo">507</span>      }<a name="line.507"></a>
-<span class="sourceLineNo">508</span>    }<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 void setPartialFlag(boolean isPartial) {<a name="line.511"></a>
-<span class="sourceLineNo">512</span>    if (this.partial &amp;&amp; !isPartial) {<a name="line.512"></a>
-<span class="sourceLineNo">513</span>      for (Map.Entry&lt;Long, BitSetNode&gt; entry : map.entrySet()) {<a name="line.513"></a>
-<span class="sourceLineNo">514</span>        entry.getValue().unsetPartialFlag();<a name="line.514"></a>
-<span class="sourceLineNo">515</span>      }<a name="line.515"></a>
-<span class="sourceLineNo">516</span>    }<a name="line.516"></a>
-<span class="sourceLineNo">517</span>    this.partial = isPartial;<a name="line.517"></a>
+<span class="sourceLineNo">455</span>  private void trackProcIds(long procId) {<a name="line.455"></a>
+<span class="sourceLineNo">456</span>    minUpdatedProcId = Math.min(minUpdatedProcId, procId);<a name="line.456"></a>
+<span class="sourceLineNo">457</span>    maxUpdatedProcId = Math.max(maxUpdatedProcId, procId);<a name="line.457"></a>
+<span class="sourceLineNo">458</span>  }<a name="line.458"></a>
+<span class="sourceLineNo">459</span><a name="line.459"></a>
+<span class="sourceLineNo">460</span>  public long getUpdatedMinProcId() {<a name="line.460"></a>
+<span class="sourceLineNo">461</span>    return minUpdatedProcId;<a name="line.461"></a>
+<span class="sourceLineNo">462</span>  }<a name="line.462"></a>
+<span class="sourceLineNo">463</span><a name="line.463"></a>
+<span class="sourceLineNo">464</span>  public long getUpdatedMaxProcId() {<a name="line.464"></a>
+<span class="sourceLineNo">465</span>    return maxUpdatedProcId;<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>  @InterfaceAudience.Private<a name="line.468"></a>
+<span class="sourceLineNo">469</span>  public void setDeleted(final long procId, final boolean isDeleted) {<a name="line.469"></a>
+<span class="sourceLineNo">470</span>    BitSetNode node = getOrCreateNode(procId);<a name="line.470"></a>
+<span class="sourceLineNo">471</span>    assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node;<a name="line.471"></a>
+<span class="sourceLineNo">472</span>    node.updateState(procId, isDeleted);<a name="line.472"></a>
+<span class="sourceLineNo">473</span>  }<a name="line.473"></a>
+<span class="sourceLineNo">474</span><a name="line.474"></a>
+<span class="sourceLineNo">475</span>  public void reset() {<a name="line.475"></a>
+<span class="sourceLineNo">476</span>    this.keepDeletes = false;<a name="line.476"></a>
+<span class="sourceLineNo">477</span>    this.partial = false;<a name="line.477"></a>
+<span class="sourceLineNo">478</span>    this.map.clear();<a name="line.478"></a>
+<span class="sourceLineNo">479</span>    resetUpdates();<a name="line.479"></a>
+<span class="sourceLineNo">480</span>  }<a name="line.480"></a>
+<spa

<TRUNCATED>

Mime
View raw message