hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From git-site-r...@apache.org
Subject [32/51] [partial] hbase-site git commit: Published site at 821e4d7de2d576189f4288d1c2acf9e9a9471f5c.
Date Tue, 16 Oct 2018 14:54:53 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/323b17d9/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/BitSetNode.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/BitSetNode.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/BitSetNode.html
index ecd1970..be5c3fc 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/BitSetNode.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/BitSetNode.html
@@ -28,404 +28,405 @@
 <span class="sourceLineNo">020</span>import java.util.ArrayList;<a name="line.20"></a>
 <span class="sourceLineNo">021</span>import java.util.Arrays;<a name="line.21"></a>
 <span class="sourceLineNo">022</span>import java.util.List;<a name="line.22"></a>
-<span class="sourceLineNo">023</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStoreTracker.DeleteState;<a name="line.23"></a>
-<span class="sourceLineNo">024</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.24"></a>
-<span class="sourceLineNo">025</span><a name="line.25"></a>
-<span class="sourceLineNo">026</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a name="line.26"></a>
-<span class="sourceLineNo">027</span><a name="line.27"></a>
-<span class="sourceLineNo">028</span>/**<a name="line.28"></a>
-<span class="sourceLineNo">029</span> * A bitmap which can grow/merge with other {@link BitSetNode} (if certain conditions are met).<a name="line.29"></a>
-<span class="sourceLineNo">030</span> * Boundaries of bitmap are aligned to multiples of {@link BitSetNode#BITS_PER_WORD}. So the range<a name="line.30"></a>
-<span class="sourceLineNo">031</span> * of a {@link BitSetNode} is from [x * K, y * K) where x and y are integers, y &gt; x and K is<a name="line.31"></a>
-<span class="sourceLineNo">032</span> * BITS_PER_WORD.<a name="line.32"></a>
-<span class="sourceLineNo">033</span> * &lt;p/&gt;<a name="line.33"></a>
-<span class="sourceLineNo">034</span> * We have two main bit sets to describe the state of procedures, the meanings are:<a name="line.34"></a>
-<span class="sourceLineNo">035</span> *<a name="line.35"></a>
-<span class="sourceLineNo">036</span> * &lt;pre&gt;<a name="line.36"></a>
-<span class="sourceLineNo">037</span> *  ----------------------<a name="line.37"></a>
-<span class="sourceLineNo">038</span> * | modified | deleted |  meaning<a name="line.38"></a>
-<span class="sourceLineNo">039</span> * |     0    |   0     |  proc exists, but hasn't been updated since last resetUpdates().<a name="line.39"></a>
-<span class="sourceLineNo">040</span> * |     1    |   0     |  proc was updated (but not deleted).<a name="line.40"></a>
-<span class="sourceLineNo">041</span> * |     1    |   1     |  proc was deleted.<a name="line.41"></a>
-<span class="sourceLineNo">042</span> * |     0    |   1     |  proc doesn't exist (maybe never created, maybe deleted in past).<a name="line.42"></a>
-<span class="sourceLineNo">043</span> * ----------------------<a name="line.43"></a>
-<span class="sourceLineNo">044</span> * &lt;/pre&gt;<a name="line.44"></a>
-<span class="sourceLineNo">045</span> *<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * The meaning of modified is that, we have modified the state of the procedure, no matter insert,<a name="line.46"></a>
-<span class="sourceLineNo">047</span> * update, or delete. And if it is an insert or update, we will set the deleted to 0, if not we will<a name="line.47"></a>
-<span class="sourceLineNo">048</span> * set the delete to 1.<a name="line.48"></a>
-<span class="sourceLineNo">049</span> * &lt;p/&gt;<a name="line.49"></a>
-<span class="sourceLineNo">050</span> * For a non-partial BitSetNode, the initial modified value is 0 and deleted value is 1. For the<a name="line.50"></a>
-<span class="sourceLineNo">051</span> * partial one, the initial modified value is 0 and the initial deleted value is also 0. In<a name="line.51"></a>
-<span class="sourceLineNo">052</span> * {@link #unsetPartialFlag()} we will reset the deleted to 1 if it is not modified.<a name="line.52"></a>
-<span class="sourceLineNo">053</span> */<a name="line.53"></a>
-<span class="sourceLineNo">054</span>@InterfaceAudience.Private<a name="line.54"></a>
-<span class="sourceLineNo">055</span>class BitSetNode {<a name="line.55"></a>
-<span class="sourceLineNo">056</span>  private static final long WORD_MASK = 0xffffffffffffffffL;<a name="line.56"></a>
-<span class="sourceLineNo">057</span>  private static final int ADDRESS_BITS_PER_WORD = 6;<a name="line.57"></a>
-<span class="sourceLineNo">058</span>  private static final int BITS_PER_WORD = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.58"></a>
-<span class="sourceLineNo">059</span>  private static final int MAX_NODE_SIZE = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.59"></a>
-<span class="sourceLineNo">060</span><a name="line.60"></a>
-<span class="sourceLineNo">061</span>  /**<a name="line.61"></a>
-<span class="sourceLineNo">062</span>   * Mimics {@link ProcedureStoreTracker#partial}. It will effect how we fill the new deleted bits<a name="line.62"></a>
-<span class="sourceLineNo">063</span>   * when growing.<a name="line.63"></a>
-<span class="sourceLineNo">064</span>   */<a name="line.64"></a>
-<span class="sourceLineNo">065</span>  private boolean partial;<a name="line.65"></a>
-<span class="sourceLineNo">066</span><a name="line.66"></a>
-<span class="sourceLineNo">067</span>  /**<a name="line.67"></a>
-<span class="sourceLineNo">068</span>   * Set of procedures which have been modified since last {@link #resetModified()}. Useful to track<a name="line.68"></a>
-<span class="sourceLineNo">069</span>   * procedures which have been modified since last WAL write.<a name="line.69"></a>
-<span class="sourceLineNo">070</span>   */<a name="line.70"></a>
-<span class="sourceLineNo">071</span>  private long[] modified;<a name="line.71"></a>
-<span class="sourceLineNo">072</span><a name="line.72"></a>
-<span class="sourceLineNo">073</span>  /**<a name="line.73"></a>
-<span class="sourceLineNo">074</span>   * Keeps track of procedure ids which belong to this bitmap's range and have been deleted. This<a name="line.74"></a>
-<span class="sourceLineNo">075</span>   * represents global state since it's not reset on WAL rolls.<a name="line.75"></a>
-<span class="sourceLineNo">076</span>   */<a name="line.76"></a>
-<span class="sourceLineNo">077</span>  private long[] deleted;<a name="line.77"></a>
-<span class="sourceLineNo">078</span>  /**<a name="line.78"></a>
-<span class="sourceLineNo">079</span>   * Offset of bitmap i.e. procedure id corresponding to first bit.<a name="line.79"></a>
-<span class="sourceLineNo">080</span>   */<a name="line.80"></a>
-<span class="sourceLineNo">081</span>  private long start;<a name="line.81"></a>
-<span class="sourceLineNo">082</span><a name="line.82"></a>
-<span class="sourceLineNo">083</span>  public void dump() {<a name="line.83"></a>
-<span class="sourceLineNo">084</span>    System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(), getActiveMinProcId(),<a name="line.84"></a>
-<span class="sourceLineNo">085</span>      getActiveMaxProcId());<a name="line.85"></a>
-<span class="sourceLineNo">086</span>    System.out.println("Modified:");<a name="line.86"></a>
-<span class="sourceLineNo">087</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.87"></a>
-<span class="sourceLineNo">088</span>      for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.88"></a>
-<span class="sourceLineNo">089</span>        System.out.print((modified[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.89"></a>
-<span class="sourceLineNo">090</span>      }<a name="line.90"></a>
-<span class="sourceLineNo">091</span>      System.out.println(" " + i);<a name="line.91"></a>
-<span class="sourceLineNo">092</span>    }<a name="line.92"></a>
-<span class="sourceLineNo">093</span>    System.out.println();<a name="line.93"></a>
-<span class="sourceLineNo">094</span>    System.out.println("Delete:");<a name="line.94"></a>
-<span class="sourceLineNo">095</span>    for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.95"></a>
-<span class="sourceLineNo">096</span>      for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.96"></a>
-<span class="sourceLineNo">097</span>        System.out.print((deleted[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.97"></a>
-<span class="sourceLineNo">098</span>      }<a name="line.98"></a>
-<span class="sourceLineNo">099</span>      System.out.println(" " + i);<a name="line.99"></a>
-<span class="sourceLineNo">100</span>    }<a name="line.100"></a>
-<span class="sourceLineNo">101</span>    System.out.println();<a name="line.101"></a>
-<span class="sourceLineNo">102</span>  }<a name="line.102"></a>
-<span class="sourceLineNo">103</span><a name="line.103"></a>
-<span class="sourceLineNo">104</span>  public BitSetNode(long procId, boolean partial) {<a name="line.104"></a>
-<span class="sourceLineNo">105</span>    start = alignDown(procId);<a name="line.105"></a>
-<span class="sourceLineNo">106</span><a name="line.106"></a>
-<span class="sourceLineNo">107</span>    int count = 1;<a name="line.107"></a>
-<span class="sourceLineNo">108</span>    modified = new long[count];<a name="line.108"></a>
-<span class="sourceLineNo">109</span>    deleted = new long[count];<a name="line.109"></a>
-<span class="sourceLineNo">110</span>    if (!partial) {<a name="line.110"></a>
-<span class="sourceLineNo">111</span>      Arrays.fill(deleted, WORD_MASK);<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>    this.partial = partial;<a name="line.114"></a>
-<span class="sourceLineNo">115</span>    updateState(procId, false);<a name="line.115"></a>
-<span class="sourceLineNo">116</span>  }<a name="line.116"></a>
-<span class="sourceLineNo">117</span><a name="line.117"></a>
-<span class="sourceLineNo">118</span>  public BitSetNode(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.118"></a>
-<span class="sourceLineNo">119</span>    start = data.getStartId();<a name="line.119"></a>
-<span class="sourceLineNo">120</span>    int size = data.getUpdatedCount();<a name="line.120"></a>
-<span class="sourceLineNo">121</span>    assert size == data.getDeletedCount();<a name="line.121"></a>
-<span class="sourceLineNo">122</span>    modified = new long[size];<a name="line.122"></a>
-<span class="sourceLineNo">123</span>    deleted = new long[size];<a name="line.123"></a>
-<span class="sourceLineNo">124</span>    for (int i = 0; i &lt; size; ++i) {<a name="line.124"></a>
-<span class="sourceLineNo">125</span>      modified[i] = data.getUpdated(i);<a name="line.125"></a>
-<span class="sourceLineNo">126</span>      deleted[i] = data.getDeleted(i);<a name="line.126"></a>
-<span class="sourceLineNo">127</span>    }<a name="line.127"></a>
-<span class="sourceLineNo">128</span>    partial = 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>  public BitSetNode(BitSetNode other, boolean resetDelete) {<a name="line.131"></a>
-<span class="sourceLineNo">132</span>    this.start = other.start;<a name="line.132"></a>
-<span class="sourceLineNo">133</span>    this.partial = other.partial;<a name="line.133"></a>
-<span class="sourceLineNo">134</span>    this.modified = other.modified.clone();<a name="line.134"></a>
-<span class="sourceLineNo">135</span>    // The resetDelete will be set to true when building cleanup tracker.<a name="line.135"></a>
-<span class="sourceLineNo">136</span>    // The intention here is that, if a procedure is not modified in this tracker, then we do not<a name="line.136"></a>
-<span class="sourceLineNo">137</span>    // need to take care of it, so we will set deleted to true for these bits, i.e, if modified is<a name="line.137"></a>
-<span class="sourceLineNo">138</span>    // 0, then we set deleted to 1, otherwise keep it as is. So here, the equation is<a name="line.138"></a>
-<span class="sourceLineNo">139</span>    // deleted |= ~modified, i.e,<a name="line.139"></a>
-<span class="sourceLineNo">140</span>    if (resetDelete) {<a name="line.140"></a>
-<span class="sourceLineNo">141</span>      this.deleted = new long[other.deleted.length];<a name="line.141"></a>
-<span class="sourceLineNo">142</span>      for (int i = 0; i &lt; this.deleted.length; ++i) {<a name="line.142"></a>
-<span class="sourceLineNo">143</span>        this.deleted[i] |= ~(other.modified[i]);<a name="line.143"></a>
-<span class="sourceLineNo">144</span>      }<a name="line.144"></a>
-<span class="sourceLineNo">145</span>    } else {<a name="line.145"></a>
-<span class="sourceLineNo">146</span>      this.deleted = other.deleted.clone();<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><a name="line.149"></a>
-<span class="sourceLineNo">150</span>  public void insertOrUpdate(final long procId) {<a name="line.150"></a>
-<span class="sourceLineNo">151</span>    updateState(procId, false);<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 void delete(final long procId) {<a name="line.154"></a>
-<span class="sourceLineNo">155</span>    updateState(procId, true);<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 long getStart() {<a name="line.158"></a>
-<span class="sourceLineNo">159</span>    return start;<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>  public long getEnd() {<a name="line.162"></a>
-<span class="sourceLineNo">163</span>    return start + (modified.length &lt;&lt; ADDRESS_BITS_PER_WORD) - 1;<a name="line.163"></a>
-<span class="sourceLineNo">164</span>  }<a name="line.164"></a>
-<span class="sourceLineNo">165</span><a name="line.165"></a>
-<span class="sourceLineNo">166</span>  public boolean contains(final long procId) {<a name="line.166"></a>
-<span class="sourceLineNo">167</span>    return start &lt;= procId &amp;&amp; procId &lt;= getEnd();<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>  public DeleteState isDeleted(final long procId) {<a name="line.170"></a>
-<span class="sourceLineNo">171</span>    int bitmapIndex = getBitmapIndex(procId);<a name="line.171"></a>
-<span class="sourceLineNo">172</span>    int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.172"></a>
-<span class="sourceLineNo">173</span>    if (wordIndex &gt;= deleted.length) {<a name="line.173"></a>
-<span class="sourceLineNo">174</span>      return DeleteState.MAYBE;<a name="line.174"></a>
-<span class="sourceLineNo">175</span>    }<a name="line.175"></a>
-<span class="sourceLineNo">176</span>    return (deleted[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.176"></a>
-<span class="sourceLineNo">177</span>  }<a name="line.177"></a>
-<span class="sourceLineNo">178</span><a name="line.178"></a>
-<span class="sourceLineNo">179</span>  public boolean isModified(long procId) {<a name="line.179"></a>
-<span class="sourceLineNo">180</span>    int bitmapIndex = getBitmapIndex(procId);<a name="line.180"></a>
-<span class="sourceLineNo">181</span>    int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.181"></a>
-<span class="sourceLineNo">182</span>    if (wordIndex &gt;= modified.length) {<a name="line.182"></a>
-<span class="sourceLineNo">183</span>      return false;<a name="line.183"></a>
-<span class="sourceLineNo">184</span>    }<a name="line.184"></a>
-<span class="sourceLineNo">185</span>    return (modified[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0;<a name="line.185"></a>
-<span class="sourceLineNo">186</span>  }<a name="line.186"></a>
-<span class="sourceLineNo">187</span><a name="line.187"></a>
-<span class="sourceLineNo">188</span>  /**<a name="line.188"></a>
-<span class="sourceLineNo">189</span>   * @return true, if all the procedures has been modified.<a name="line.189"></a>
-<span class="sourceLineNo">190</span>   */<a name="line.190"></a>
-<span class="sourceLineNo">191</span>  public boolean isAllModified() {<a name="line.191"></a>
-<span class="sourceLineNo">192</span>    // TODO: cache the value<a name="line.192"></a>
-<span class="sourceLineNo">193</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.193"></a>
-<span class="sourceLineNo">194</span>      if ((modified[i] | deleted[i]) != WORD_MASK) {<a name="line.194"></a>
-<span class="sourceLineNo">195</span>        return false;<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>    return true;<a name="line.198"></a>
-<span class="sourceLineNo">199</span>  }<a name="line.199"></a>
-<span class="sourceLineNo">200</span><a name="line.200"></a>
-<span class="sourceLineNo">201</span>  /**<a name="line.201"></a>
-<span class="sourceLineNo">202</span>   * @return all the active procedure ids in this bit set.<a name="line.202"></a>
-<span class="sourceLineNo">203</span>   */<a name="line.203"></a>
-<span class="sourceLineNo">204</span>  public long[] getActiveProcIds() {<a name="line.204"></a>
-<span class="sourceLineNo">205</span>    List&lt;Long&gt; procIds = new ArrayList&lt;&gt;();<a name="line.205"></a>
-<span class="sourceLineNo">206</span>    for (int wordIndex = 0; wordIndex &lt; modified.length; wordIndex++) {<a name="line.206"></a>
-<span class="sourceLineNo">207</span>      if (deleted[wordIndex] == WORD_MASK || modified[wordIndex] == 0) {<a name="line.207"></a>
-<span class="sourceLineNo">208</span>        // This should be the common case, where most procedures has been deleted.<a name="line.208"></a>
-<span class="sourceLineNo">209</span>        continue;<a name="line.209"></a>
-<span class="sourceLineNo">210</span>      }<a name="line.210"></a>
-<span class="sourceLineNo">211</span>      long baseProcId = getStart() + (wordIndex &lt;&lt; ADDRESS_BITS_PER_WORD);<a name="line.211"></a>
-<span class="sourceLineNo">212</span>      for (int i = 0; i &lt; (1 &lt;&lt; ADDRESS_BITS_PER_WORD); i++) {<a name="line.212"></a>
-<span class="sourceLineNo">213</span>        long mask = 1L &lt;&lt; i;<a name="line.213"></a>
-<span class="sourceLineNo">214</span>        if ((deleted[wordIndex] &amp; mask) == 0 &amp;&amp; (modified[wordIndex] &amp; mask) != 0) {<a name="line.214"></a>
-<span class="sourceLineNo">215</span>          procIds.add(baseProcId + i);<a name="line.215"></a>
-<span class="sourceLineNo">216</span>        }<a name="line.216"></a>
-<span class="sourceLineNo">217</span>      }<a name="line.217"></a>
-<span class="sourceLineNo">218</span>    }<a name="line.218"></a>
-<span class="sourceLineNo">219</span>    return procIds.stream().mapToLong(Long::longValue).toArray();<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>   * @return true, if there are no active procedures in this BitSetNode, else false.<a name="line.223"></a>
-<span class="sourceLineNo">224</span>   */<a name="line.224"></a>
-<span class="sourceLineNo">225</span>  public boolean isEmpty() {<a name="line.225"></a>
-<span class="sourceLineNo">226</span>    // TODO: cache the value<a name="line.226"></a>
-<span class="sourceLineNo">227</span>    for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.227"></a>
-<span class="sourceLineNo">228</span>      if (deleted[i] != WORD_MASK) {<a name="line.228"></a>
-<span class="sourceLineNo">229</span>        return false;<a name="line.229"></a>
-<span class="sourceLineNo">230</span>      }<a name="line.230"></a>
-<span class="sourceLineNo">231</span>    }<a name="line.231"></a>
-<span class="sourceLineNo">232</span>    return true;<a name="line.232"></a>
-<span class="sourceLineNo">233</span>  }<a name="line.233"></a>
-<span class="sourceLineNo">234</span><a name="line.234"></a>
-<span class="sourceLineNo">235</span>  public void resetModified() {<a name="line.235"></a>
-<span class="sourceLineNo">236</span>    Arrays.fill(modified, 0);<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 void unsetPartialFlag() {<a name="line.239"></a>
-<span class="sourceLineNo">240</span>    partial = false;<a name="line.240"></a>
-<span class="sourceLineNo">241</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.241"></a>
-<span class="sourceLineNo">242</span>      for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.242"></a>
-<span class="sourceLineNo">243</span>        if ((modified[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.243"></a>
-<span class="sourceLineNo">244</span>          deleted[i] |= (1L &lt;&lt; j);<a name="line.244"></a>
-<span class="sourceLineNo">245</span>        }<a name="line.245"></a>
-<span class="sourceLineNo">246</span>      }<a name="line.246"></a>
-<span class="sourceLineNo">247</span>    }<a name="line.247"></a>
-<span class="sourceLineNo">248</span>  }<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>   * Convert to<a name="line.251"></a>
-<span class="sourceLineNo">252</span>   * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker.TrackerNode<a name="line.252"></a>
-<span class="sourceLineNo">253</span>   * protobuf.<a name="line.253"></a>
-<span class="sourceLineNo">254</span>   */<a name="line.254"></a>
-<span class="sourceLineNo">255</span>  public ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.255"></a>
-<span class="sourceLineNo">256</span>    ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.256"></a>
-<span class="sourceLineNo">257</span>      ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.257"></a>
-<span class="sourceLineNo">258</span>    builder.setStartId(start);<a name="line.258"></a>
-<span class="sourceLineNo">259</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.259"></a>
-<span class="sourceLineNo">260</span>      builder.addUpdated(modified[i]);<a name="line.260"></a>
-<span class="sourceLineNo">261</span>      builder.addDeleted(deleted[i]);<a name="line.261"></a>
-<span class="sourceLineNo">262</span>    }<a name="line.262"></a>
-<span class="sourceLineNo">263</span>    return builder.build();<a name="line.263"></a>
-<span class="sourceLineNo">264</span>  }<a name="line.264"></a>
-<span class="sourceLineNo">265</span><a name="line.265"></a>
-<span class="sourceLineNo">266</span>  // ========================================================================<a name="line.266"></a>
-<span class="sourceLineNo">267</span>  // Grow/Merge Helpers<a name="line.267"></a>
-<span class="sourceLineNo">268</span>  // ========================================================================<a name="line.268"></a>
-<span class="sourceLineNo">269</span>  public boolean canGrow(final long procId) {<a name="line.269"></a>
-<span class="sourceLineNo">270</span>    return Math.abs(procId - start) &lt; MAX_NODE_SIZE;<a name="line.270"></a>
-<span class="sourceLineNo">271</span>  }<a name="line.271"></a>
-<span class="sourceLineNo">272</span><a name="line.272"></a>
-<span class="sourceLineNo">273</span>  public boolean canMerge(final BitSetNode rightNode) {<a name="line.273"></a>
-<span class="sourceLineNo">274</span>    // Can just compare 'starts' since boundaries are aligned to multiples of BITS_PER_WORD.<a name="line.274"></a>
-<span class="sourceLineNo">275</span>    assert start &lt; rightNode.start;<a name="line.275"></a>
-<span class="sourceLineNo">276</span>    return (rightNode.getEnd() - start) &lt; MAX_NODE_SIZE;<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 void grow(final long procId) {<a name="line.279"></a>
-<span class="sourceLineNo">280</span>    int delta, offset;<a name="line.280"></a>
-<span class="sourceLineNo">281</span><a name="line.281"></a>
-<span class="sourceLineNo">282</span>    if (procId &lt; start) {<a name="line.282"></a>
-<span class="sourceLineNo">283</span>      // add to head<a name="line.283"></a>
-<span class="sourceLineNo">284</span>      long newStart = alignDown(procId);<a name="line.284"></a>
-<span class="sourceLineNo">285</span>      delta = (int) (start - newStart) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.285"></a>
-<span class="sourceLineNo">286</span>      offset = delta;<a name="line.286"></a>
-<span class="sourceLineNo">287</span>      start = newStart;<a name="line.287"></a>
-<span class="sourceLineNo">288</span>    } else {<a name="line.288"></a>
-<span class="sourceLineNo">289</span>      // Add to tail<a name="line.289"></a>
-<span class="sourceLineNo">290</span>      long newEnd = alignUp(procId + 1);<a name="line.290"></a>
-<span class="sourceLineNo">291</span>      delta = (int) (newEnd - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.291"></a>
-<span class="sourceLineNo">292</span>      offset = 0;<a name="line.292"></a>
-<span class="sourceLineNo">293</span>    }<a name="line.293"></a>
-<span class="sourceLineNo">294</span><a name="line.294"></a>
-<span class="sourceLineNo">295</span>    long[] newBitmap;<a name="line.295"></a>
-<span class="sourceLineNo">296</span>    int oldSize = modified.length;<a name="line.296"></a>
-<span class="sourceLineNo">297</span><a name="line.297"></a>
-<span class="sourceLineNo">298</span>    newBitmap = new long[oldSize + delta];<a name="line.298"></a>
-<span class="sourceLineNo">299</span>    for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.299"></a>
-<span class="sourceLineNo">300</span>      newBitmap[i] = 0;<a name="line.300"></a>
-<span class="sourceLineNo">301</span>    }<a name="line.301"></a>
-<span class="sourceLineNo">302</span>    System.arraycopy(modified, 0, newBitmap, offset, oldSize);<a name="line.302"></a>
-<span class="sourceLineNo">303</span>    modified = newBitmap;<a name="line.303"></a>
-<span class="sourceLineNo">304</span><a name="line.304"></a>
-<span class="sourceLineNo">305</span>    newBitmap = new long[deleted.length + delta];<a name="line.305"></a>
-<span class="sourceLineNo">306</span>    for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.306"></a>
-<span class="sourceLineNo">307</span>      newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.307"></a>
-<span class="sourceLineNo">308</span>    }<a name="line.308"></a>
-<span class="sourceLineNo">309</span>    System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.309"></a>
-<span class="sourceLineNo">310</span>    deleted = newBitmap;<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>  public void merge(final BitSetNode rightNode) {<a name="line.313"></a>
-<span class="sourceLineNo">314</span>    int delta = (int) (rightNode.getEnd() - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.314"></a>
-<span class="sourceLineNo">315</span><a name="line.315"></a>
-<span class="sourceLineNo">316</span>    long[] newBitmap;<a name="line.316"></a>
-<span class="sourceLineNo">317</span>    int oldSize = modified.length;<a name="line.317"></a>
-<span class="sourceLineNo">318</span>    int newSize = (delta - rightNode.modified.length);<a name="line.318"></a>
-<span class="sourceLineNo">319</span>    int offset = oldSize + newSize;<a name="line.319"></a>
-<span class="sourceLineNo">320</span><a name="line.320"></a>
-<span class="sourceLineNo">321</span>    newBitmap = new long[oldSize + delta];<a name="line.321"></a>
-<span class="sourceLineNo">322</span>    System.arraycopy(modified, 0, newBitmap, 0, oldSize);<a name="line.322"></a>
-<span class="sourceLineNo">323</span>    System.arraycopy(rightNode.modified, 0, newBitmap, offset, rightNode.modified.length);<a name="line.323"></a>
-<span class="sourceLineNo">324</span>    modified = newBitmap;<a name="line.324"></a>
-<span class="sourceLineNo">325</span><a name="line.325"></a>
-<span class="sourceLineNo">326</span>    newBitmap = new long[oldSize + delta];<a name="line.326"></a>
-<span class="sourceLineNo">327</span>    System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.327"></a>
-<span class="sourceLineNo">328</span>    System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.328"></a>
-<span class="sourceLineNo">329</span>    deleted = newBitmap;<a name="line.329"></a>
-<span class="sourceLineNo">330</span><a name="line.330"></a>
-<span class="sourceLineNo">331</span>    for (int i = 0; i &lt; newSize; ++i) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span>      modified[offset + i] = 0;<a name="line.332"></a>
-<span class="sourceLineNo">333</span>      deleted[offset + i] = partial ? 0 : WORD_MASK;<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><a name="line.336"></a>
-<span class="sourceLineNo">337</span>  @Override<a name="line.337"></a>
-<span class="sourceLineNo">338</span>  public String toString() {<a name="line.338"></a>
-<span class="sourceLineNo">339</span>    return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<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>  // Min/Max Helpers<a name="line.343"></a>
-<span class="sourceLineNo">344</span>  // ========================================================================<a name="line.344"></a>
-<span class="sourceLineNo">345</span>  public long getActiveMinProcId() {<a name="line.345"></a>
-<span class="sourceLineNo">346</span>    long minProcId = start;<a name="line.346"></a>
-<span class="sourceLineNo">347</span>    for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.347"></a>
-<span class="sourceLineNo">348</span>      if (deleted[i] == 0) {<a name="line.348"></a>
-<span class="sourceLineNo">349</span>        return (minProcId);<a name="line.349"></a>
-<span class="sourceLineNo">350</span>      }<a name="line.350"></a>
-<span class="sourceLineNo">351</span><a name="line.351"></a>
-<span class="sourceLineNo">352</span>      if (deleted[i] != WORD_MASK) {<a name="line.352"></a>
-<span class="sourceLineNo">353</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.353"></a>
-<span class="sourceLineNo">354</span>          if ((deleted[i] &amp; (1L &lt;&lt; j)) != 0) {<a name="line.354"></a>
-<span class="sourceLineNo">355</span>            return minProcId + j;<a name="line.355"></a>
-<span class="sourceLineNo">356</span>          }<a name="line.356"></a>
-<span class="sourceLineNo">357</span>        }<a name="line.357"></a>
-<span class="sourceLineNo">358</span>      }<a name="line.358"></a>
-<span class="sourceLineNo">359</span><a name="line.359"></a>
-<span class="sourceLineNo">360</span>      minProcId += BITS_PER_WORD;<a name="line.360"></a>
-<span class="sourceLineNo">361</span>    }<a name="line.361"></a>
-<span class="sourceLineNo">362</span>    return minProcId;<a name="line.362"></a>
-<span class="sourceLineNo">363</span>  }<a name="line.363"></a>
-<span class="sourceLineNo">364</span><a name="line.364"></a>
-<span class="sourceLineNo">365</span>  public long getActiveMaxProcId() {<a name="line.365"></a>
-<span class="sourceLineNo">366</span>    long maxProcId = getEnd();<a name="line.366"></a>
-<span class="sourceLineNo">367</span>    for (int i = deleted.length - 1; i &gt;= 0; --i) {<a name="line.367"></a>
-<span class="sourceLineNo">368</span>      if (deleted[i] == 0) {<a name="line.368"></a>
-<span class="sourceLineNo">369</span>        return maxProcId;<a name="line.369"></a>
-<span class="sourceLineNo">370</span>      }<a name="line.370"></a>
-<span class="sourceLineNo">371</span><a name="line.371"></a>
-<span class="sourceLineNo">372</span>      if (deleted[i] != WORD_MASK) {<a name="line.372"></a>
-<span class="sourceLineNo">373</span>        for (int j = BITS_PER_WORD - 1; j &gt;= 0; --j) {<a name="line.373"></a>
-<span class="sourceLineNo">374</span>          if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.374"></a>
-<span class="sourceLineNo">375</span>            return maxProcId - (BITS_PER_WORD - 1 - j);<a name="line.375"></a>
-<span class="sourceLineNo">376</span>          }<a name="line.376"></a>
-<span class="sourceLineNo">377</span>        }<a name="line.377"></a>
-<span class="sourceLineNo">378</span>      }<a name="line.378"></a>
-<span class="sourceLineNo">379</span>      maxProcId -= BITS_PER_WORD;<a name="line.379"></a>
-<span class="sourceLineNo">380</span>    }<a name="line.380"></a>
-<span class="sourceLineNo">381</span>    return maxProcId;<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>  // Bitmap Helpers<a name="line.385"></a>
-<span class="sourceLineNo">386</span>  // ========================================================================<a name="line.386"></a>
-<span class="sourceLineNo">387</span>  private int getBitmapIndex(final long procId) {<a name="line.387"></a>
-<span class="sourceLineNo">388</span>    return (int) (procId - start);<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>  void updateState(long procId, boolean isDeleted) {<a name="line.391"></a>
-<span class="sourceLineNo">392</span>    int bitmapIndex = getBitmapIndex(procId);<a name="line.392"></a>
-<span class="sourceLineNo">393</span>    int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.393"></a>
-<span class="sourceLineNo">394</span>    long value = (1L &lt;&lt; bitmapIndex);<a name="line.394"></a>
-<span class="sourceLineNo">395</span><a name="line.395"></a>
-<span class="sourceLineNo">396</span>    modified[wordIndex] |= value;<a name="line.396"></a>
-<span class="sourceLineNo">397</span>    if (isDeleted) {<a name="line.397"></a>
-<span class="sourceLineNo">398</span>      deleted[wordIndex] |= value;<a name="line.398"></a>
-<span class="sourceLineNo">399</span>    } else {<a name="line.399"></a>
-<span class="sourceLineNo">400</span>      deleted[wordIndex] &amp;= ~value;<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><a name="line.403"></a>
-<span class="sourceLineNo">404</span>  // ========================================================================<a name="line.404"></a>
-<span class="sourceLineNo">405</span>  // Helpers<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>   * @return upper boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.408"></a>
-<span class="sourceLineNo">409</span>   */<a name="line.409"></a>
-<span class="sourceLineNo">410</span>  private static long alignUp(final long x) {<a name="line.410"></a>
-<span class="sourceLineNo">411</span>    return (x + (BITS_PER_WORD - 1)) &amp; -BITS_PER_WORD;<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>  /**<a name="line.414"></a>
-<span class="sourceLineNo">415</span>   * @return lower boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.415"></a>
-<span class="sourceLineNo">416</span>   */<a name="line.416"></a>
-<span class="sourceLineNo">417</span>  private static long alignDown(final long x) {<a name="line.417"></a>
-<span class="sourceLineNo">418</span>    return x &amp; -BITS_PER_WORD;<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">023</span>import org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.23"></a>
+<span class="sourceLineNo">024</span>import org.apache.hadoop.hbase.procedure2.store.ProcedureStoreTracker.DeleteState;<a name="line.24"></a>
+<span class="sourceLineNo">025</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.25"></a>
+<span class="sourceLineNo">026</span><a name="line.26"></a>
+<span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a name="line.27"></a>
+<span class="sourceLineNo">028</span><a name="line.28"></a>
+<span class="sourceLineNo">029</span>/**<a name="line.29"></a>
+<span class="sourceLineNo">030</span> * A bitmap which can grow/merge with other {@link BitSetNode} (if certain conditions are met).<a name="line.30"></a>
+<span class="sourceLineNo">031</span> * Boundaries of bitmap are aligned to multiples of {@link BitSetNode#BITS_PER_WORD}. So the range<a name="line.31"></a>
+<span class="sourceLineNo">032</span> * of a {@link BitSetNode} is from [x * K, y * K) where x and y are integers, y &gt; x and K is<a name="line.32"></a>
+<span class="sourceLineNo">033</span> * BITS_PER_WORD.<a name="line.33"></a>
+<span class="sourceLineNo">034</span> * &lt;p/&gt;<a name="line.34"></a>
+<span class="sourceLineNo">035</span> * We have two main bit sets to describe the state of procedures, the meanings are:<a name="line.35"></a>
+<span class="sourceLineNo">036</span> *<a name="line.36"></a>
+<span class="sourceLineNo">037</span> * &lt;pre&gt;<a name="line.37"></a>
+<span class="sourceLineNo">038</span> *  ----------------------<a name="line.38"></a>
+<span class="sourceLineNo">039</span> * | modified | deleted |  meaning<a name="line.39"></a>
+<span class="sourceLineNo">040</span> * |     0    |   0     |  proc exists, but hasn't been updated since last resetUpdates().<a name="line.40"></a>
+<span class="sourceLineNo">041</span> * |     1    |   0     |  proc was updated (but not deleted).<a name="line.41"></a>
+<span class="sourceLineNo">042</span> * |     1    |   1     |  proc was deleted.<a name="line.42"></a>
+<span class="sourceLineNo">043</span> * |     0    |   1     |  proc doesn't exist (maybe never created, maybe deleted in past).<a name="line.43"></a>
+<span class="sourceLineNo">044</span> * ----------------------<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * &lt;/pre&gt;<a name="line.45"></a>
+<span class="sourceLineNo">046</span> *<a name="line.46"></a>
+<span class="sourceLineNo">047</span> * The meaning of modified is that, we have modified the state of the procedure, no matter insert,<a name="line.47"></a>
+<span class="sourceLineNo">048</span> * update, or delete. And if it is an insert or update, we will set the deleted to 0, if not we will<a name="line.48"></a>
+<span class="sourceLineNo">049</span> * set the delete to 1.<a name="line.49"></a>
+<span class="sourceLineNo">050</span> * &lt;p/&gt;<a name="line.50"></a>
+<span class="sourceLineNo">051</span> * For a non-partial BitSetNode, the initial modified value is 0 and deleted value is 1. For the<a name="line.51"></a>
+<span class="sourceLineNo">052</span> * partial one, the initial modified value is 0 and the initial deleted value is also 0. In<a name="line.52"></a>
+<span class="sourceLineNo">053</span> * {@link #unsetPartialFlag()} we will reset the deleted to 1 if it is not modified.<a name="line.53"></a>
+<span class="sourceLineNo">054</span> */<a name="line.54"></a>
+<span class="sourceLineNo">055</span>@InterfaceAudience.Private<a name="line.55"></a>
+<span class="sourceLineNo">056</span>class BitSetNode {<a name="line.56"></a>
+<span class="sourceLineNo">057</span>  private static final long WORD_MASK = 0xffffffffffffffffL;<a name="line.57"></a>
+<span class="sourceLineNo">058</span>  private static final int ADDRESS_BITS_PER_WORD = 6;<a name="line.58"></a>
+<span class="sourceLineNo">059</span>  private static final int BITS_PER_WORD = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.59"></a>
+<span class="sourceLineNo">060</span>  private static final int MAX_NODE_SIZE = 1 &lt;&lt; ADDRESS_BITS_PER_WORD;<a name="line.60"></a>
+<span class="sourceLineNo">061</span><a name="line.61"></a>
+<span class="sourceLineNo">062</span>  /**<a name="line.62"></a>
+<span class="sourceLineNo">063</span>   * Mimics {@link ProcedureStoreTracker#partial}. It will effect how we fill the new deleted bits<a name="line.63"></a>
+<span class="sourceLineNo">064</span>   * when growing.<a name="line.64"></a>
+<span class="sourceLineNo">065</span>   */<a name="line.65"></a>
+<span class="sourceLineNo">066</span>  private boolean partial;<a name="line.66"></a>
+<span class="sourceLineNo">067</span><a name="line.67"></a>
+<span class="sourceLineNo">068</span>  /**<a name="line.68"></a>
+<span class="sourceLineNo">069</span>   * Set of procedures which have been modified since last {@link #resetModified()}. Useful to track<a name="line.69"></a>
+<span class="sourceLineNo">070</span>   * procedures which have been modified since last WAL write.<a name="line.70"></a>
+<span class="sourceLineNo">071</span>   */<a name="line.71"></a>
+<span class="sourceLineNo">072</span>  private long[] modified;<a name="line.72"></a>
+<span class="sourceLineNo">073</span><a name="line.73"></a>
+<span class="sourceLineNo">074</span>  /**<a name="line.74"></a>
+<span class="sourceLineNo">075</span>   * Keeps track of procedure ids which belong to this bitmap's range and have been deleted. This<a name="line.75"></a>
+<span class="sourceLineNo">076</span>   * represents global state since it's not reset on WAL rolls.<a name="line.76"></a>
+<span class="sourceLineNo">077</span>   */<a name="line.77"></a>
+<span class="sourceLineNo">078</span>  private long[] deleted;<a name="line.78"></a>
+<span class="sourceLineNo">079</span>  /**<a name="line.79"></a>
+<span class="sourceLineNo">080</span>   * Offset of bitmap i.e. procedure id corresponding to first bit.<a name="line.80"></a>
+<span class="sourceLineNo">081</span>   */<a name="line.81"></a>
+<span class="sourceLineNo">082</span>  private long start;<a name="line.82"></a>
+<span class="sourceLineNo">083</span><a name="line.83"></a>
+<span class="sourceLineNo">084</span>  public void dump() {<a name="line.84"></a>
+<span class="sourceLineNo">085</span>    System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(), getActiveMinProcId(),<a name="line.85"></a>
+<span class="sourceLineNo">086</span>      getActiveMaxProcId());<a name="line.86"></a>
+<span class="sourceLineNo">087</span>    System.out.println("Modified:");<a name="line.87"></a>
+<span class="sourceLineNo">088</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.88"></a>
+<span class="sourceLineNo">089</span>      for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.89"></a>
+<span class="sourceLineNo">090</span>        System.out.print((modified[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.90"></a>
+<span class="sourceLineNo">091</span>      }<a name="line.91"></a>
+<span class="sourceLineNo">092</span>      System.out.println(" " + i);<a name="line.92"></a>
+<span class="sourceLineNo">093</span>    }<a name="line.93"></a>
+<span class="sourceLineNo">094</span>    System.out.println();<a name="line.94"></a>
+<span class="sourceLineNo">095</span>    System.out.println("Delete:");<a name="line.95"></a>
+<span class="sourceLineNo">096</span>    for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.96"></a>
+<span class="sourceLineNo">097</span>      for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.97"></a>
+<span class="sourceLineNo">098</span>        System.out.print((deleted[i] &amp; (1L &lt;&lt; j)) != 0 ? "1" : "0");<a name="line.98"></a>
+<span class="sourceLineNo">099</span>      }<a name="line.99"></a>
+<span class="sourceLineNo">100</span>      System.out.println(" " + i);<a name="line.100"></a>
+<span class="sourceLineNo">101</span>    }<a name="line.101"></a>
+<span class="sourceLineNo">102</span>    System.out.println();<a name="line.102"></a>
+<span class="sourceLineNo">103</span>  }<a name="line.103"></a>
+<span class="sourceLineNo">104</span><a name="line.104"></a>
+<span class="sourceLineNo">105</span>  public BitSetNode(long procId, boolean partial) {<a name="line.105"></a>
+<span class="sourceLineNo">106</span>    start = alignDown(procId);<a name="line.106"></a>
+<span class="sourceLineNo">107</span><a name="line.107"></a>
+<span class="sourceLineNo">108</span>    int count = 1;<a name="line.108"></a>
+<span class="sourceLineNo">109</span>    modified = new long[count];<a name="line.109"></a>
+<span class="sourceLineNo">110</span>    deleted = new long[count];<a name="line.110"></a>
+<span class="sourceLineNo">111</span>    if (!partial) {<a name="line.111"></a>
+<span class="sourceLineNo">112</span>      Arrays.fill(deleted, WORD_MASK);<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>    this.partial = partial;<a name="line.115"></a>
+<span class="sourceLineNo">116</span>    updateState(procId, false);<a name="line.116"></a>
+<span class="sourceLineNo">117</span>  }<a name="line.117"></a>
+<span class="sourceLineNo">118</span><a name="line.118"></a>
+<span class="sourceLineNo">119</span>  public BitSetNode(ProcedureProtos.ProcedureStoreTracker.TrackerNode data) {<a name="line.119"></a>
+<span class="sourceLineNo">120</span>    start = data.getStartId();<a name="line.120"></a>
+<span class="sourceLineNo">121</span>    int size = data.getUpdatedCount();<a name="line.121"></a>
+<span class="sourceLineNo">122</span>    assert size == data.getDeletedCount();<a name="line.122"></a>
+<span class="sourceLineNo">123</span>    modified = new long[size];<a name="line.123"></a>
+<span class="sourceLineNo">124</span>    deleted = new long[size];<a name="line.124"></a>
+<span class="sourceLineNo">125</span>    for (int i = 0; i &lt; size; ++i) {<a name="line.125"></a>
+<span class="sourceLineNo">126</span>      modified[i] = data.getUpdated(i);<a name="line.126"></a>
+<span class="sourceLineNo">127</span>      deleted[i] = data.getDeleted(i);<a name="line.127"></a>
+<span class="sourceLineNo">128</span>    }<a name="line.128"></a>
+<span class="sourceLineNo">129</span>    partial = false;<a name="line.129"></a>
+<span class="sourceLineNo">130</span>  }<a name="line.130"></a>
+<span class="sourceLineNo">131</span><a name="line.131"></a>
+<span class="sourceLineNo">132</span>  public BitSetNode(BitSetNode other, boolean resetDelete) {<a name="line.132"></a>
+<span class="sourceLineNo">133</span>    this.start = other.start;<a name="line.133"></a>
+<span class="sourceLineNo">134</span>    this.partial = other.partial;<a name="line.134"></a>
+<span class="sourceLineNo">135</span>    this.modified = other.modified.clone();<a name="line.135"></a>
+<span class="sourceLineNo">136</span>    // The resetDelete will be set to true when building cleanup tracker.<a name="line.136"></a>
+<span class="sourceLineNo">137</span>    // The intention here is that, if a procedure is not modified in this tracker, then we do not<a name="line.137"></a>
+<span class="sourceLineNo">138</span>    // need to take care of it, so we will set deleted to true for these bits, i.e, if modified is<a name="line.138"></a>
+<span class="sourceLineNo">139</span>    // 0, then we set deleted to 1, otherwise keep it as is. So here, the equation is<a name="line.139"></a>
+<span class="sourceLineNo">140</span>    // deleted |= ~modified, i.e,<a name="line.140"></a>
+<span class="sourceLineNo">141</span>    if (resetDelete) {<a name="line.141"></a>
+<span class="sourceLineNo">142</span>      this.deleted = new long[other.deleted.length];<a name="line.142"></a>
+<span class="sourceLineNo">143</span>      for (int i = 0; i &lt; this.deleted.length; ++i) {<a name="line.143"></a>
+<span class="sourceLineNo">144</span>        this.deleted[i] |= ~(other.modified[i]);<a name="line.144"></a>
+<span class="sourceLineNo">145</span>      }<a name="line.145"></a>
+<span class="sourceLineNo">146</span>    } else {<a name="line.146"></a>
+<span class="sourceLineNo">147</span>      this.deleted = other.deleted.clone();<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><a name="line.150"></a>
+<span class="sourceLineNo">151</span>  public void insertOrUpdate(final long procId) {<a name="line.151"></a>
+<span class="sourceLineNo">152</span>    updateState(procId, false);<a name="line.152"></a>
+<span class="sourceLineNo">153</span>  }<a name="line.153"></a>
+<span class="sourceLineNo">154</span><a name="line.154"></a>
+<span class="sourceLineNo">155</span>  public void delete(final long procId) {<a name="line.155"></a>
+<span class="sourceLineNo">156</span>    updateState(procId, true);<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>  public long getStart() {<a name="line.159"></a>
+<span class="sourceLineNo">160</span>    return start;<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>  public long getEnd() {<a name="line.163"></a>
+<span class="sourceLineNo">164</span>    return start + (modified.length &lt;&lt; ADDRESS_BITS_PER_WORD) - 1;<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>  public boolean contains(final long procId) {<a name="line.167"></a>
+<span class="sourceLineNo">168</span>    return start &lt;= procId &amp;&amp; procId &lt;= getEnd();<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>  public DeleteState isDeleted(final long procId) {<a name="line.171"></a>
+<span class="sourceLineNo">172</span>    int bitmapIndex = getBitmapIndex(procId);<a name="line.172"></a>
+<span class="sourceLineNo">173</span>    int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.173"></a>
+<span class="sourceLineNo">174</span>    if (wordIndex &gt;= deleted.length) {<a name="line.174"></a>
+<span class="sourceLineNo">175</span>      return DeleteState.MAYBE;<a name="line.175"></a>
+<span class="sourceLineNo">176</span>    }<a name="line.176"></a>
+<span class="sourceLineNo">177</span>    return (deleted[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0 ? DeleteState.YES : DeleteState.NO;<a name="line.177"></a>
+<span class="sourceLineNo">178</span>  }<a name="line.178"></a>
+<span class="sourceLineNo">179</span><a name="line.179"></a>
+<span class="sourceLineNo">180</span>  public boolean isModified(long procId) {<a name="line.180"></a>
+<span class="sourceLineNo">181</span>    int bitmapIndex = getBitmapIndex(procId);<a name="line.181"></a>
+<span class="sourceLineNo">182</span>    int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.182"></a>
+<span class="sourceLineNo">183</span>    if (wordIndex &gt;= modified.length) {<a name="line.183"></a>
+<span class="sourceLineNo">184</span>      return false;<a name="line.184"></a>
+<span class="sourceLineNo">185</span>    }<a name="line.185"></a>
+<span class="sourceLineNo">186</span>    return (modified[wordIndex] &amp; (1L &lt;&lt; bitmapIndex)) != 0;<a name="line.186"></a>
+<span class="sourceLineNo">187</span>  }<a name="line.187"></a>
+<span class="sourceLineNo">188</span><a name="line.188"></a>
+<span class="sourceLineNo">189</span>  /**<a name="line.189"></a>
+<span class="sourceLineNo">190</span>   * @return true, if all the procedures has been modified.<a name="line.190"></a>
+<span class="sourceLineNo">191</span>   */<a name="line.191"></a>
+<span class="sourceLineNo">192</span>  public boolean isAllModified() {<a name="line.192"></a>
+<span class="sourceLineNo">193</span>    // TODO: cache the value<a name="line.193"></a>
+<span class="sourceLineNo">194</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.194"></a>
+<span class="sourceLineNo">195</span>      if ((modified[i] | deleted[i]) != WORD_MASK) {<a name="line.195"></a>
+<span class="sourceLineNo">196</span>        return false;<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>    return true;<a name="line.199"></a>
+<span class="sourceLineNo">200</span>  }<a name="line.200"></a>
+<span class="sourceLineNo">201</span><a name="line.201"></a>
+<span class="sourceLineNo">202</span>  /**<a name="line.202"></a>
+<span class="sourceLineNo">203</span>   * @return all the active procedure ids in this bit set.<a name="line.203"></a>
+<span class="sourceLineNo">204</span>   */<a name="line.204"></a>
+<span class="sourceLineNo">205</span>  public long[] getActiveProcIds() {<a name="line.205"></a>
+<span class="sourceLineNo">206</span>    List&lt;Long&gt; procIds = new ArrayList&lt;&gt;();<a name="line.206"></a>
+<span class="sourceLineNo">207</span>    for (int wordIndex = 0; wordIndex &lt; modified.length; wordIndex++) {<a name="line.207"></a>
+<span class="sourceLineNo">208</span>      if (deleted[wordIndex] == WORD_MASK || modified[wordIndex] == 0) {<a name="line.208"></a>
+<span class="sourceLineNo">209</span>        // This should be the common case, where most procedures has been deleted.<a name="line.209"></a>
+<span class="sourceLineNo">210</span>        continue;<a name="line.210"></a>
+<span class="sourceLineNo">211</span>      }<a name="line.211"></a>
+<span class="sourceLineNo">212</span>      long baseProcId = getStart() + (wordIndex &lt;&lt; ADDRESS_BITS_PER_WORD);<a name="line.212"></a>
+<span class="sourceLineNo">213</span>      for (int i = 0; i &lt; (1 &lt;&lt; ADDRESS_BITS_PER_WORD); i++) {<a name="line.213"></a>
+<span class="sourceLineNo">214</span>        long mask = 1L &lt;&lt; i;<a name="line.214"></a>
+<span class="sourceLineNo">215</span>        if ((deleted[wordIndex] &amp; mask) == 0 &amp;&amp; (modified[wordIndex] &amp; mask) != 0) {<a name="line.215"></a>
+<span class="sourceLineNo">216</span>          procIds.add(baseProcId + i);<a name="line.216"></a>
+<span class="sourceLineNo">217</span>        }<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>    return procIds.stream().mapToLong(Long::longValue).toArray();<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>   * @return true, if there are no active procedures in this BitSetNode, else false.<a name="line.224"></a>
+<span class="sourceLineNo">225</span>   */<a name="line.225"></a>
+<span class="sourceLineNo">226</span>  public boolean isEmpty() {<a name="line.226"></a>
+<span class="sourceLineNo">227</span>    // TODO: cache the value<a name="line.227"></a>
+<span class="sourceLineNo">228</span>    for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.228"></a>
+<span class="sourceLineNo">229</span>      if (deleted[i] != WORD_MASK) {<a name="line.229"></a>
+<span class="sourceLineNo">230</span>        return false;<a name="line.230"></a>
+<span class="sourceLineNo">231</span>      }<a name="line.231"></a>
+<span class="sourceLineNo">232</span>    }<a name="line.232"></a>
+<span class="sourceLineNo">233</span>    return true;<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>  public void resetModified() {<a name="line.236"></a>
+<span class="sourceLineNo">237</span>    Arrays.fill(modified, 0);<a name="line.237"></a>
+<span class="sourceLineNo">238</span>  }<a name="line.238"></a>
+<span class="sourceLineNo">239</span><a name="line.239"></a>
+<span class="sourceLineNo">240</span>  public void unsetPartialFlag() {<a name="line.240"></a>
+<span class="sourceLineNo">241</span>    partial = false;<a name="line.241"></a>
+<span class="sourceLineNo">242</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.242"></a>
+<span class="sourceLineNo">243</span>      for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.243"></a>
+<span class="sourceLineNo">244</span>        if ((modified[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.244"></a>
+<span class="sourceLineNo">245</span>          deleted[i] |= (1L &lt;&lt; j);<a name="line.245"></a>
+<span class="sourceLineNo">246</span>        }<a name="line.246"></a>
+<span class="sourceLineNo">247</span>      }<a name="line.247"></a>
+<span class="sourceLineNo">248</span>    }<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>   * Convert to<a name="line.252"></a>
+<span class="sourceLineNo">253</span>   * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker.TrackerNode<a name="line.253"></a>
+<span class="sourceLineNo">254</span>   * protobuf.<a name="line.254"></a>
+<span class="sourceLineNo">255</span>   */<a name="line.255"></a>
+<span class="sourceLineNo">256</span>  public ProcedureProtos.ProcedureStoreTracker.TrackerNode convert() {<a name="line.256"></a>
+<span class="sourceLineNo">257</span>    ProcedureProtos.ProcedureStoreTracker.TrackerNode.Builder builder =<a name="line.257"></a>
+<span class="sourceLineNo">258</span>      ProcedureProtos.ProcedureStoreTracker.TrackerNode.newBuilder();<a name="line.258"></a>
+<span class="sourceLineNo">259</span>    builder.setStartId(start);<a name="line.259"></a>
+<span class="sourceLineNo">260</span>    for (int i = 0; i &lt; modified.length; ++i) {<a name="line.260"></a>
+<span class="sourceLineNo">261</span>      builder.addUpdated(modified[i]);<a name="line.261"></a>
+<span class="sourceLineNo">262</span>      builder.addDeleted(deleted[i]);<a name="line.262"></a>
+<span class="sourceLineNo">263</span>    }<a name="line.263"></a>
+<span class="sourceLineNo">264</span>    return builder.build();<a name="line.264"></a>
+<span class="sourceLineNo">265</span>  }<a name="line.265"></a>
+<span class="sourceLineNo">266</span><a name="line.266"></a>
+<span class="sourceLineNo">267</span>  // ========================================================================<a name="line.267"></a>
+<span class="sourceLineNo">268</span>  // Grow/Merge Helpers<a name="line.268"></a>
+<span class="sourceLineNo">269</span>  // ========================================================================<a name="line.269"></a>
+<span class="sourceLineNo">270</span>  public boolean canGrow(final long procId) {<a name="line.270"></a>
+<span class="sourceLineNo">271</span>    return Math.abs(procId - start) &lt; MAX_NODE_SIZE;<a name="line.271"></a>
+<span class="sourceLineNo">272</span>  }<a name="line.272"></a>
+<span class="sourceLineNo">273</span><a name="line.273"></a>
+<span class="sourceLineNo">274</span>  public boolean canMerge(final BitSetNode rightNode) {<a name="line.274"></a>
+<span class="sourceLineNo">275</span>    // Can just compare 'starts' since boundaries are aligned to multiples of BITS_PER_WORD.<a name="line.275"></a>
+<span class="sourceLineNo">276</span>    assert start &lt; rightNode.start;<a name="line.276"></a>
+<span class="sourceLineNo">277</span>    return (rightNode.getEnd() - start) &lt; MAX_NODE_SIZE;<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 void grow(final long procId) {<a name="line.280"></a>
+<span class="sourceLineNo">281</span>    int delta, offset;<a name="line.281"></a>
+<span class="sourceLineNo">282</span><a name="line.282"></a>
+<span class="sourceLineNo">283</span>    if (procId &lt; start) {<a name="line.283"></a>
+<span class="sourceLineNo">284</span>      // add to head<a name="line.284"></a>
+<span class="sourceLineNo">285</span>      long newStart = alignDown(procId);<a name="line.285"></a>
+<span class="sourceLineNo">286</span>      delta = (int) (start - newStart) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.286"></a>
+<span class="sourceLineNo">287</span>      offset = delta;<a name="line.287"></a>
+<span class="sourceLineNo">288</span>      start = newStart;<a name="line.288"></a>
+<span class="sourceLineNo">289</span>    } else {<a name="line.289"></a>
+<span class="sourceLineNo">290</span>      // Add to tail<a name="line.290"></a>
+<span class="sourceLineNo">291</span>      long newEnd = alignUp(procId + 1);<a name="line.291"></a>
+<span class="sourceLineNo">292</span>      delta = (int) (newEnd - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.292"></a>
+<span class="sourceLineNo">293</span>      offset = 0;<a name="line.293"></a>
+<span class="sourceLineNo">294</span>    }<a name="line.294"></a>
+<span class="sourceLineNo">295</span><a name="line.295"></a>
+<span class="sourceLineNo">296</span>    long[] newBitmap;<a name="line.296"></a>
+<span class="sourceLineNo">297</span>    int oldSize = modified.length;<a name="line.297"></a>
+<span class="sourceLineNo">298</span><a name="line.298"></a>
+<span class="sourceLineNo">299</span>    newBitmap = new long[oldSize + delta];<a name="line.299"></a>
+<span class="sourceLineNo">300</span>    for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.300"></a>
+<span class="sourceLineNo">301</span>      newBitmap[i] = 0;<a name="line.301"></a>
+<span class="sourceLineNo">302</span>    }<a name="line.302"></a>
+<span class="sourceLineNo">303</span>    System.arraycopy(modified, 0, newBitmap, offset, oldSize);<a name="line.303"></a>
+<span class="sourceLineNo">304</span>    modified = newBitmap;<a name="line.304"></a>
+<span class="sourceLineNo">305</span><a name="line.305"></a>
+<span class="sourceLineNo">306</span>    newBitmap = new long[deleted.length + delta];<a name="line.306"></a>
+<span class="sourceLineNo">307</span>    for (int i = 0; i &lt; newBitmap.length; ++i) {<a name="line.307"></a>
+<span class="sourceLineNo">308</span>      newBitmap[i] = partial ? 0 : WORD_MASK;<a name="line.308"></a>
+<span class="sourceLineNo">309</span>    }<a name="line.309"></a>
+<span class="sourceLineNo">310</span>    System.arraycopy(deleted, 0, newBitmap, offset, oldSize);<a name="line.310"></a>
+<span class="sourceLineNo">311</span>    deleted = newBitmap;<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>  public void merge(final BitSetNode rightNode) {<a name="line.314"></a>
+<span class="sourceLineNo">315</span>    int delta = (int) (rightNode.getEnd() - getEnd()) &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.315"></a>
+<span class="sourceLineNo">316</span><a name="line.316"></a>
+<span class="sourceLineNo">317</span>    long[] newBitmap;<a name="line.317"></a>
+<span class="sourceLineNo">318</span>    int oldSize = modified.length;<a name="line.318"></a>
+<span class="sourceLineNo">319</span>    int newSize = (delta - rightNode.modified.length);<a name="line.319"></a>
+<span class="sourceLineNo">320</span>    int offset = oldSize + newSize;<a name="line.320"></a>
+<span class="sourceLineNo">321</span><a name="line.321"></a>
+<span class="sourceLineNo">322</span>    newBitmap = new long[oldSize + delta];<a name="line.322"></a>
+<span class="sourceLineNo">323</span>    System.arraycopy(modified, 0, newBitmap, 0, oldSize);<a name="line.323"></a>
+<span class="sourceLineNo">324</span>    System.arraycopy(rightNode.modified, 0, newBitmap, offset, rightNode.modified.length);<a name="line.324"></a>
+<span class="sourceLineNo">325</span>    modified = newBitmap;<a name="line.325"></a>
+<span class="sourceLineNo">326</span><a name="line.326"></a>
+<span class="sourceLineNo">327</span>    newBitmap = new long[oldSize + delta];<a name="line.327"></a>
+<span class="sourceLineNo">328</span>    System.arraycopy(deleted, 0, newBitmap, 0, oldSize);<a name="line.328"></a>
+<span class="sourceLineNo">329</span>    System.arraycopy(rightNode.deleted, 0, newBitmap, offset, rightNode.deleted.length);<a name="line.329"></a>
+<span class="sourceLineNo">330</span>    deleted = newBitmap;<a name="line.330"></a>
+<span class="sourceLineNo">331</span><a name="line.331"></a>
+<span class="sourceLineNo">332</span>    for (int i = 0; i &lt; newSize; ++i) {<a name="line.332"></a>
+<span class="sourceLineNo">333</span>      modified[offset + i] = 0;<a name="line.333"></a>
+<span class="sourceLineNo">334</span>      deleted[offset + i] = partial ? 0 : WORD_MASK;<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><a name="line.337"></a>
+<span class="sourceLineNo">338</span>  @Override<a name="line.338"></a>
+<span class="sourceLineNo">339</span>  public String toString() {<a name="line.339"></a>
+<span class="sourceLineNo">340</span>    return "BitSetNode(" + getStart() + "-" + getEnd() + ")";<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>  // Min/Max Helpers<a name="line.344"></a>
+<span class="sourceLineNo">345</span>  // ========================================================================<a name="line.345"></a>
+<span class="sourceLineNo">346</span>  public long getActiveMinProcId() {<a name="line.346"></a>
+<span class="sourceLineNo">347</span>    long minProcId = start;<a name="line.347"></a>
+<span class="sourceLineNo">348</span>    for (int i = 0; i &lt; deleted.length; ++i) {<a name="line.348"></a>
+<span class="sourceLineNo">349</span>      if (deleted[i] == 0) {<a name="line.349"></a>
+<span class="sourceLineNo">350</span>        return minProcId;<a name="line.350"></a>
+<span class="sourceLineNo">351</span>      }<a name="line.351"></a>
+<span class="sourceLineNo">352</span><a name="line.352"></a>
+<span class="sourceLineNo">353</span>      if (deleted[i] != WORD_MASK) {<a name="line.353"></a>
+<span class="sourceLineNo">354</span>        for (int j = 0; j &lt; BITS_PER_WORD; ++j) {<a name="line.354"></a>
+<span class="sourceLineNo">355</span>          if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.355"></a>
+<span class="sourceLineNo">356</span>            return minProcId + j;<a name="line.356"></a>
+<span class="sourceLineNo">357</span>          }<a name="line.357"></a>
+<span class="sourceLineNo">358</span>        }<a name="line.358"></a>
+<span class="sourceLineNo">359</span>      }<a name="line.359"></a>
+<span class="sourceLineNo">360</span><a name="line.360"></a>
+<span class="sourceLineNo">361</span>      minProcId += BITS_PER_WORD;<a name="line.361"></a>
+<span class="sourceLineNo">362</span>    }<a name="line.362"></a>
+<span class="sourceLineNo">363</span>    return Procedure.NO_PROC_ID;<a name="line.363"></a>
+<span class="sourceLineNo">364</span>  }<a name="line.364"></a>
+<span class="sourceLineNo">365</span><a name="line.365"></a>
+<span class="sourceLineNo">366</span>  public long getActiveMaxProcId() {<a name="line.366"></a>
+<span class="sourceLineNo">367</span>    long maxProcId = getEnd();<a name="line.367"></a>
+<span class="sourceLineNo">368</span>    for (int i = deleted.length - 1; i &gt;= 0; --i) {<a name="line.368"></a>
+<span class="sourceLineNo">369</span>      if (deleted[i] == 0) {<a name="line.369"></a>
+<span class="sourceLineNo">370</span>        return maxProcId;<a name="line.370"></a>
+<span class="sourceLineNo">371</span>      }<a name="line.371"></a>
+<span class="sourceLineNo">372</span><a name="line.372"></a>
+<span class="sourceLineNo">373</span>      if (deleted[i] != WORD_MASK) {<a name="line.373"></a>
+<span class="sourceLineNo">374</span>        for (int j = BITS_PER_WORD - 1; j &gt;= 0; --j) {<a name="line.374"></a>
+<span class="sourceLineNo">375</span>          if ((deleted[i] &amp; (1L &lt;&lt; j)) == 0) {<a name="line.375"></a>
+<span class="sourceLineNo">376</span>            return maxProcId - (BITS_PER_WORD - 1 - j);<a name="line.376"></a>
+<span class="sourceLineNo">377</span>          }<a name="line.377"></a>
+<span class="sourceLineNo">378</span>        }<a name="line.378"></a>
+<span class="sourceLineNo">379</span>      }<a name="line.379"></a>
+<span class="sourceLineNo">380</span>      maxProcId -= BITS_PER_WORD;<a name="line.380"></a>
+<span class="sourceLineNo">381</span>    }<a name="line.381"></a>
+<span class="sourceLineNo">382</span>    return Procedure.NO_PROC_ID;<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>  // Bitmap Helpers<a name="line.386"></a>
+<span class="sourceLineNo">387</span>  // ========================================================================<a name="line.387"></a>
+<span class="sourceLineNo">388</span>  private int getBitmapIndex(final long procId) {<a name="line.388"></a>
+<span class="sourceLineNo">389</span>    return (int) (procId - start);<a name="line.389"></a>
+<span class="sourceLineNo">390</span>  }<a name="line.390"></a>
+<span class="sourceLineNo">391</span><a name="line.391"></a>
+<span class="sourceLineNo">392</span>  void updateState(long procId, boolean isDeleted) {<a name="line.392"></a>
+<span class="sourceLineNo">393</span>    int bitmapIndex = getBitmapIndex(procId);<a name="line.393"></a>
+<span class="sourceLineNo">394</span>    int wordIndex = bitmapIndex &gt;&gt; ADDRESS_BITS_PER_WORD;<a name="line.394"></a>
+<span class="sourceLineNo">395</span>    long value = (1L &lt;&lt; bitmapIndex);<a name="line.395"></a>
+<span class="sourceLineNo">396</span><a name="line.396"></a>
+<span class="sourceLineNo">397</span>    modified[wordIndex] |= value;<a name="line.397"></a>
+<span class="sourceLineNo">398</span>    if (isDeleted) {<a name="line.398"></a>
+<span class="sourceLineNo">399</span>      deleted[wordIndex] |= value;<a name="line.399"></a>
+<span class="sourceLineNo">400</span>    } else {<a name="line.400"></a>
+<span class="sourceLineNo">401</span>      deleted[wordIndex] &amp;= ~value;<a name="line.401"></a>
+<span class="sourceLineNo">402</span>    }<a name="line.402"></a>
+<span class="sourceLineNo">403</span>  }<a name="line.403"></a>
+<span class="sourceLineNo">404</span><a name="line.404"></a>
+<span class="sourceLineNo">405</span>  // ========================================================================<a name="line.405"></a>
+<span class="sourceLineNo">406</span>  // Helpers<a name="line.406"></a>
+<span class="sourceLineNo">407</span>  // ========================================================================<a name="line.407"></a>
+<span class="sourceLineNo">408</span>  /**<a name="line.408"></a>
+<span class="sourceLineNo">409</span>   * @return upper boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.409"></a>
+<span class="sourceLineNo">410</span>   */<a name="line.410"></a>
+<span class="sourceLineNo">411</span>  private static long alignUp(final long x) {<a name="line.411"></a>
+<span class="sourceLineNo">412</span>    return (x + (BITS_PER_WORD - 1)) &amp; -BITS_PER_WORD;<a name="line.412"></a>
+<span class="sourceLineNo">413</span>  }<a name="line.413"></a>
+<span class="sourceLineNo">414</span><a name="line.414"></a>
+<span class="sourceLineNo">415</span>  /**<a name="line.415"></a>
+<span class="sourceLineNo">416</span>   * @return lower boundary (aligned to multiple of BITS_PER_WORD) of bitmap range x belongs to.<a name="line.416"></a>
+<span class="sourceLineNo">417</span>   */<a name="line.417"></a>
+<span class="sourceLineNo">418</span>  private static long alignDown(final long x) {<a name="line.418"></a>
+<span class="sourceLineNo">419</span>    return x &amp; -BITS_PER_WORD;<a name="line.419"></a>
+<span class="sourceLineNo">420</span>  }<a name="line.420"></a>
+<span class="sourceLineNo">421</span>}<a name="line.421"></a>
 
 
 


Mime
View raw message