http://git-wip-us.apache.org/repos/asf/hbase-site/blob/323b17d9/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.DeleteState.html
----------------------------------------------------------------------
diff --git
a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.DeleteState.html
b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.DeleteState.html
index 0c69df9..8515fa3 100644
---
a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.DeleteState.html
+++
b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.DeleteState.html
@@ -32,263 +32,263 @@
<span class="sourceLineNo">024</span>import java.util.Map;<a
name="line.24"></a>
<span class="sourceLineNo">025</span>import java.util.TreeMap;<a
name="line.25"></a>
<span class="sourceLineNo">026</span>import java.util.stream.LongStream;<a
name="line.26"></a>
-<span class="sourceLineNo">027</span>import
org.apache.yetus.audience.InterfaceAudience;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import
org.apache.yetus.audience.InterfaceStability;<a name="line.28"></a>
-<span class="sourceLineNo">029</span><a name="line.29"></a>
-<span class="sourceLineNo">030</span>import
org.apache.hadoop.hbase.shaded.protobuf.generated.ProcedureProtos;<a
name="line.30"></a>
-<span class="sourceLineNo">031</span><a name="line.31"></a>
-<span class="sourceLineNo">032</span>/**<a name="line.32"></a>
-<span class="sourceLineNo">033</span> * Keeps track of live procedures.<a
name="line.33"></a>
-<span class="sourceLineNo">034</span> *<a name="line.34"></a>
-<span class="sourceLineNo">035</span> * It can be used by the ProcedureStore
to identify which procedures are already<a name="line.35"></a>
-<span class="sourceLineNo">036</span> * deleted/completed to avoid the
deserialization step on restart<a name="line.36"></a>
-<span class="sourceLineNo">037</span> */<a name="line.37"></a>
-<span class="sourceLineNo">038</span>@InterfaceAudience.Private<a
name="line.38"></a>
-<span class="sourceLineNo">039</span>@InterfaceStability.Evolving<a
name="line.39"></a>
-<span class="sourceLineNo">040</span>public class ProcedureStoreTracker {<a
name="line.40"></a>
-<span class="sourceLineNo">041</span> // Key is procedure id corresponding to
first bit of the bitmap.<a name="line.41"></a>
-<span class="sourceLineNo">042</span> private final TreeMap<Long,
BitSetNode> map = new TreeMap<>();<a name="line.42"></a>
-<span class="sourceLineNo">043</span><a name="line.43"></a>
-<span class="sourceLineNo">044</span> /**<a name="line.44"></a>
-<span class="sourceLineNo">045</span> * If true, do not remove bits
corresponding to deleted procedures. Note that this can result<a
name="line.45"></a>
-<span class="sourceLineNo">046</span> * in huge bitmaps overtime.<a
name="line.46"></a>
-<span class="sourceLineNo">047</span> * Currently, it's set to true only
when building tracker state from logs during recovery. During<a
name="line.47"></a>
-<span class="sourceLineNo">048</span> * recovery, if we are sure that a
procedure has been deleted, reading its old update entries<a name="line.48"></a>
-<span class="sourceLineNo">049</span> * can be skipped.<a name="line.49"></a>
-<span class="sourceLineNo">050</span> */<a name="line.50"></a>
-<span class="sourceLineNo">051</span> private boolean keepDeletes = false;<a
name="line.51"></a>
-<span class="sourceLineNo">052</span> /**<a name="line.52"></a>
-<span class="sourceLineNo">053</span> * If true, it means tracker has
incomplete information about the active/deleted procedures.<a
name="line.53"></a>
-<span class="sourceLineNo">054</span> * It's set to true only when
recovering from old logs. See {@link #isDeleted(long)} docs to<a
name="line.54"></a>
-<span class="sourceLineNo">055</span> * understand it's real use.<a
name="line.55"></a>
-<span class="sourceLineNo">056</span> */<a name="line.56"></a>
-<span class="sourceLineNo">057</span> boolean partial = false;<a
name="line.57"></a>
-<span class="sourceLineNo">058</span><a name="line.58"></a>
-<span class="sourceLineNo">059</span> private long minModifiedProcId =
Long.MAX_VALUE;<a name="line.59"></a>
-<span class="sourceLineNo">060</span> private long maxModifiedProcId =
Long.MIN_VALUE;<a name="line.60"></a>
-<span class="sourceLineNo">061</span><a name="line.61"></a>
-<span class="sourceLineNo">062</span> public enum DeleteState { YES, NO,
MAYBE }<a name="line.62"></a>
-<span class="sourceLineNo">063</span><a name="line.63"></a>
-<span class="sourceLineNo">064</span> public void
resetToProto(ProcedureProtos.ProcedureStoreTracker trackerProtoBuf) {<a
name="line.64"></a>
-<span class="sourceLineNo">065</span> reset();<a name="line.65"></a>
-<span class="sourceLineNo">066</span> for
(ProcedureProtos.ProcedureStoreTracker.TrackerNode protoNode:
trackerProtoBuf.getNodeList()) {<a name="line.66"></a>
-<span class="sourceLineNo">067</span> final BitSetNode node = new
BitSetNode(protoNode);<a name="line.67"></a>
-<span class="sourceLineNo">068</span> map.put(node.getStart(), node);<a
name="line.68"></a>
-<span class="sourceLineNo">069</span> }<a name="line.69"></a>
-<span class="sourceLineNo">070</span> }<a name="line.70"></a>
-<span class="sourceLineNo">071</span><a name="line.71"></a>
-<span class="sourceLineNo">072</span> /**<a name="line.72"></a>
-<span class="sourceLineNo">073</span> * Resets internal state to same as
given {@code tracker}. Does deep copy of the bitmap.<a name="line.73"></a>
-<span class="sourceLineNo">074</span> */<a name="line.74"></a>
-<span class="sourceLineNo">075</span> public void
resetTo(ProcedureStoreTracker tracker) {<a name="line.75"></a>
-<span class="sourceLineNo">076</span> resetTo(tracker, false);<a
name="line.76"></a>
-<span class="sourceLineNo">077</span> }<a name="line.77"></a>
-<span class="sourceLineNo">078</span><a name="line.78"></a>
-<span class="sourceLineNo">079</span> /**<a name="line.79"></a>
-<span class="sourceLineNo">080</span> * Resets internal state to same as
given {@code tracker}, and change the deleted flag according<a
name="line.80"></a>
-<span class="sourceLineNo">081</span> * to the modified flag if {@code
resetDelete} is true. Does deep copy of the bitmap.<a name="line.81"></a>
-<span class="sourceLineNo">082</span> * <p/><a name="line.82"></a>
-<span class="sourceLineNo">083</span> * The {@code resetDelete} will be set
to true when building cleanup tracker, please see the<a name="line.83"></a>
-<span class="sourceLineNo">084</span> * comments in {@link
BitSetNode#BitSetNode(BitSetNode, boolean)} to learn how we change the<a
name="line.84"></a>
-<span class="sourceLineNo">085</span> * deleted flag if {@code resetDelete}
is true.<a name="line.85"></a>
-<span class="sourceLineNo">086</span> */<a name="line.86"></a>
-<span class="sourceLineNo">087</span> public void
resetTo(ProcedureStoreTracker tracker, boolean resetDelete) {<a
name="line.87"></a>
-<span class="sourceLineNo">088</span> reset();<a name="line.88"></a>
-<span class="sourceLineNo">089</span> this.partial = tracker.partial;<a
name="line.89"></a>
-<span class="sourceLineNo">090</span> this.minModifiedProcId =
tracker.minModifiedProcId;<a name="line.90"></a>
-<span class="sourceLineNo">091</span> this.maxModifiedProcId =
tracker.maxModifiedProcId;<a name="line.91"></a>
-<span class="sourceLineNo">092</span> this.keepDeletes =
tracker.keepDeletes;<a name="line.92"></a>
-<span class="sourceLineNo">093</span> for (Map.Entry<Long,
BitSetNode> entry : tracker.map.entrySet()) {<a name="line.93"></a>
-<span class="sourceLineNo">094</span> map.put(entry.getKey(), new
BitSetNode(entry.getValue(), resetDelete));<a name="line.94"></a>
-<span class="sourceLineNo">095</span> }<a name="line.95"></a>
-<span class="sourceLineNo">096</span> }<a name="line.96"></a>
-<span class="sourceLineNo">097</span><a name="line.97"></a>
-<span class="sourceLineNo">098</span> public void insert(long procId) {<a
name="line.98"></a>
-<span class="sourceLineNo">099</span> insert(null, procId);<a
name="line.99"></a>
-<span class="sourceLineNo">100</span> }<a name="line.100"></a>
-<span class="sourceLineNo">101</span><a name="line.101"></a>
-<span class="sourceLineNo">102</span> public void insert(long[] procIds) {<a
name="line.102"></a>
-<span class="sourceLineNo">103</span> for (int i = 0; i <
procIds.length; ++i) {<a name="line.103"></a>
-<span class="sourceLineNo">104</span> insert(procIds[i]);<a
name="line.104"></a>
-<span class="sourceLineNo">105</span> }<a name="line.105"></a>
-<span class="sourceLineNo">106</span> }<a name="line.106"></a>
-<span class="sourceLineNo">107</span><a name="line.107"></a>
-<span class="sourceLineNo">108</span> public void insert(long procId, long[]
subProcIds) {<a name="line.108"></a>
-<span class="sourceLineNo">109</span> BitSetNode node = update(null,
procId);<a name="line.109"></a>
-<span class="sourceLineNo">110</span> for (int i = 0; i <
subProcIds.length; ++i) {<a name="line.110"></a>
-<span class="sourceLineNo">111</span> node = insert(node,
subProcIds[i]);<a name="line.111"></a>
-<span class="sourceLineNo">112</span> }<a name="line.112"></a>
-<span class="sourceLineNo">113</span> }<a name="line.113"></a>
-<span class="sourceLineNo">114</span><a name="line.114"></a>
-<span class="sourceLineNo">115</span> private BitSetNode insert(BitSetNode
node, long procId) {<a name="line.115"></a>
-<span class="sourceLineNo">116</span> if (node == null ||
!node.contains(procId)) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span> node = getOrCreateNode(procId);<a
name="line.117"></a>
-<span class="sourceLineNo">118</span> }<a name="line.118"></a>
-<span class="sourceLineNo">119</span> node.insertOrUpdate(procId);<a
name="line.119"></a>
-<span class="sourceLineNo">120</span> trackProcIds(procId);<a
name="line.120"></a>
-<span class="sourceLineNo">121</span> return node;<a name="line.121"></a>
-<span class="sourceLineNo">122</span> }<a name="line.122"></a>
-<span class="sourceLineNo">123</span><a name="line.123"></a>
-<span class="sourceLineNo">124</span> public void update(long procId) {<a
name="line.124"></a>
-<span class="sourceLineNo">125</span> update(null, procId);<a
name="line.125"></a>
-<span class="sourceLineNo">126</span> }<a name="line.126"></a>
-<span class="sourceLineNo">127</span><a name="line.127"></a>
-<span class="sourceLineNo">128</span> private BitSetNode update(BitSetNode
node, long procId) {<a name="line.128"></a>
-<span class="sourceLineNo">129</span> node = lookupClosestNode(node,
procId);<a name="line.129"></a>
-<span class="sourceLineNo">130</span> assert node != null : "expected node
to update procId=" + procId;<a name="line.130"></a>
-<span class="sourceLineNo">131</span> assert node.contains(procId) :
"expected procId=" + procId + " in the node";<a name="line.131"></a>
-<span class="sourceLineNo">132</span> node.insertOrUpdate(procId);<a
name="line.132"></a>
-<span class="sourceLineNo">133</span> trackProcIds(procId);<a
name="line.133"></a>
-<span class="sourceLineNo">134</span> return node;<a name="line.134"></a>
-<span class="sourceLineNo">135</span> }<a name="line.135"></a>
-<span class="sourceLineNo">136</span><a name="line.136"></a>
-<span class="sourceLineNo">137</span> public void delete(long procId) {<a
name="line.137"></a>
-<span class="sourceLineNo">138</span> delete(null, procId);<a
name="line.138"></a>
-<span class="sourceLineNo">139</span> }<a name="line.139"></a>
-<span class="sourceLineNo">140</span><a name="line.140"></a>
-<span class="sourceLineNo">141</span> public void delete(final long[]
procIds) {<a name="line.141"></a>
-<span class="sourceLineNo">142</span> Arrays.sort(procIds);<a
name="line.142"></a>
-<span class="sourceLineNo">143</span> BitSetNode node = null;<a
name="line.143"></a>
-<span class="sourceLineNo">144</span> for (int i = 0; i <
procIds.length; ++i) {<a name="line.144"></a>
-<span class="sourceLineNo">145</span> node = delete(node, procIds[i]);<a
name="line.145"></a>
-<span class="sourceLineNo">146</span> }<a name="line.146"></a>
-<span class="sourceLineNo">147</span> }<a name="line.147"></a>
-<span class="sourceLineNo">148</span><a name="line.148"></a>
-<span class="sourceLineNo">149</span> private BitSetNode delete(BitSetNode
node, long procId) {<a name="line.149"></a>
-<span class="sourceLineNo">150</span> node = lookupClosestNode(node,
procId);<a name="line.150"></a>
-<span class="sourceLineNo">151</span> assert node != null : "expected node
to delete procId=" + procId;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> assert node.contains(procId) :
"expected procId=" + procId + " in the node";<a name="line.152"></a>
-<span class="sourceLineNo">153</span> node.delete(procId);<a
name="line.153"></a>
-<span class="sourceLineNo">154</span> if (!keepDeletes &&
node.isEmpty()) {<a name="line.154"></a>
-<span class="sourceLineNo">155</span> // TODO: RESET if (map.size() ==
1)<a name="line.155"></a>
-<span class="sourceLineNo">156</span> map.remove(node.getStart());<a
name="line.156"></a>
-<span class="sourceLineNo">157</span> }<a name="line.157"></a>
-<span class="sourceLineNo">158</span><a name="line.158"></a>
-<span class="sourceLineNo">159</span> trackProcIds(procId);<a
name="line.159"></a>
-<span class="sourceLineNo">160</span> return node;<a name="line.160"></a>
-<span class="sourceLineNo">161</span> }<a name="line.161"></a>
-<span class="sourceLineNo">162</span><a name="line.162"></a>
-<span class="sourceLineNo">163</span> /**<a name="line.163"></a>
-<span class="sourceLineNo">164</span> * Will be called when restarting where
we need to rebuild the ProcedureStoreTracker.<a name="line.164"></a>
-<span class="sourceLineNo">165</span> */<a name="line.165"></a>
-<span class="sourceLineNo">166</span> public void
setMinMaxModifiedProcIds(long min, long max) {<a name="line.166"></a>
-<span class="sourceLineNo">167</span> this.minModifiedProcId = min;<a
name="line.167"></a>
-<span class="sourceLineNo">168</span> this.maxModifiedProcId = max;<a
name="line.168"></a>
-<span class="sourceLineNo">169</span> }<a name="line.169"></a>
-<span class="sourceLineNo">170</span> /**<a name="line.170"></a>
-<span class="sourceLineNo">171</span> * This method is used when restarting
where we need to rebuild the ProcedureStoreTracker. The<a name="line.171"></a>
-<span class="sourceLineNo">172</span> * {@link #delete(long)} method above
assume that the {@link BitSetNode} exists, but when restart<a
name="line.172"></a>
-<span class="sourceLineNo">173</span> * this is not true, as we will read
the wal files in reverse order so a delete may come first.<a
name="line.173"></a>
-<span class="sourceLineNo">174</span> */<a name="line.174"></a>
-<span class="sourceLineNo">175</span> public void setDeleted(long procId,
boolean isDeleted) {<a name="line.175"></a>
-<span class="sourceLineNo">176</span> BitSetNode node =
getOrCreateNode(procId);<a name="line.176"></a>
-<span class="sourceLineNo">177</span> assert node.contains(procId) :
"expected procId=" + procId + " in the node=" + node;<a name="line.177"></a>
-<span class="sourceLineNo">178</span> node.updateState(procId,
isDeleted);<a name="line.178"></a>
-<span class="sourceLineNo">179</span> trackProcIds(procId);<a
name="line.179"></a>
-<span class="sourceLineNo">180</span> }<a name="line.180"></a>
-<span class="sourceLineNo">181</span><a name="line.181"></a>
-<span class="sourceLineNo">182</span> /**<a name="line.182"></a>
-<span class="sourceLineNo">183</span> * Set the given bit for the procId to
delete if it was modified before.<a name="line.183"></a>
-<span class="sourceLineNo">184</span> * <p/><a name="line.184"></a>
-<span class="sourceLineNo">185</span> * This method is used to test whether
a procedure wal file can be safely deleted, as if all the<a name="line.185"></a>
-<span class="sourceLineNo">186</span> * procedures in the given procedure
wal file has been modified in the new procedure wal files,<a
name="line.186"></a>
-<span class="sourceLineNo">187</span> * then we can delete it.<a
name="line.187"></a>
-<span class="sourceLineNo">188</span> */<a name="line.188"></a>
-<span class="sourceLineNo">189</span> public void
setDeletedIfModified(long... procId) {<a name="line.189"></a>
-<span class="sourceLineNo">190</span> BitSetNode node = null;<a
name="line.190"></a>
-<span class="sourceLineNo">191</span> for (int i = 0; i < procId.length;
++i) {<a name="line.191"></a>
-<span class="sourceLineNo">192</span> node = lookupClosestNode(node,
procId[i]);<a name="line.192"></a>
-<span class="sourceLineNo">193</span> if (node != null &&
node.isModified(procId[i])) {<a name="line.193"></a>
-<span class="sourceLineNo">194</span> node.delete(procId[i]);<a
name="line.194"></a>
-<span class="sourceLineNo">195</span> }<a name="line.195"></a>
-<span class="sourceLineNo">196</span> }<a name="line.196"></a>
-<span class="sourceLineNo">197</span> }<a name="line.197"></a>
-<span class="sourceLineNo">198</span><a name="line.198"></a>
-<span class="sourceLineNo">199</span> /**<a name="line.199"></a>
-<span class="sourceLineNo">200</span> * Similar with {@link
#setDeletedIfModified(long...)}, but here the {@code procId} are given by<a
name="line.200"></a>
-<span class="sourceLineNo">201</span> * the {@code tracker}. If a procedure
is modified by us, and also by the given {@code tracker},<a name="line.201"></a>
-<span class="sourceLineNo">202</span> * then we mark it as deleted.<a
name="line.202"></a>
-<span class="sourceLineNo">203</span> * @see
#setDeletedIfModified(long...)<a name="line.203"></a>
-<span class="sourceLineNo">204</span> */<a name="line.204"></a>
-<span class="sourceLineNo">205</span> public void
setDeletedIfModifiedInBoth(ProcedureStoreTracker tracker) {<a
name="line.205"></a>
-<span class="sourceLineNo">206</span> BitSetNode trackerNode = null;<a
name="line.206"></a>
-<span class="sourceLineNo">207</span> for (BitSetNode node : map.values())
{<a name="line.207"></a>
-<span class="sourceLineNo">208</span> final long minProcId =
node.getStart();<a name="line.208"></a>
-<span class="sourceLineNo">209</span> final long maxProcId =
node.getEnd();<a name="line.209"></a>
-<span class="sourceLineNo">210</span> for (long procId = minProcId;
procId <= maxProcId; ++procId) {<a name="line.210"></a>
-<span class="sourceLineNo">211</span> if (!node.isModified(procId)) {<a
name="line.211"></a>
-<span class="sourceLineNo">212</span> continue;<a name="line.212"></a>
-<span class="sourceLineNo">213</span> }<a name="line.213"></a>
-<span class="sourceLineNo">214</span><a name="line.214"></a>
-<span class="sourceLineNo">215</span> trackerNode =
tracker.lookupClosestNode(trackerNode, procId);<a name="line.215"></a>
-<span class="sourceLineNo">216</span> if (trackerNode == null ||
!trackerNode.contains(procId) ||<a name="line.216"></a>
-<span class="sourceLineNo">217</span> trackerNode.isModified(procId))
{<a name="line.217"></a>
-<span class="sourceLineNo">218</span> // the procedure was removed or
modified<a name="line.218"></a>
-<span class="sourceLineNo">219</span> node.delete(procId);<a
name="line.219"></a>
-<span class="sourceLineNo">220</span> }<a name="line.220"></a>
-<span class="sourceLineNo">221</span> }<a name="line.221"></a>
-<span class="sourceLineNo">222</span> }<a name="line.222"></a>
-<span class="sourceLineNo">223</span> }<a name="line.223"></a>
-<span class="sourceLineNo">224</span><a name="line.224"></a>
-<span class="sourceLineNo">225</span> /**<a name="line.225"></a>
-<span class="sourceLineNo">226</span> * lookup the node containing the
specified procId.<a name="line.226"></a>
-<span class="sourceLineNo">227</span> * @param node cached node to check
before doing a lookup<a name="line.227"></a>
-<span class="sourceLineNo">228</span> * @param procId the procId to lookup<a
name="line.228"></a>
-<span class="sourceLineNo">229</span> * @return the node that may contains
the procId or null<a name="line.229"></a>
-<span class="sourceLineNo">230</span> */<a name="line.230"></a>
-<span class="sourceLineNo">231</span> private BitSetNode
lookupClosestNode(final BitSetNode node, final long procId) {<a
name="line.231"></a>
-<span class="sourceLineNo">232</span> if (node != null &&
node.contains(procId)) return node;<a name="line.232"></a>
-<span class="sourceLineNo">233</span> final Map.Entry<Long,
BitSetNode> entry = map.floorEntry(procId);<a name="line.233"></a>
-<span class="sourceLineNo">234</span> return entry != null ?
entry.getValue() : null;<a name="line.234"></a>
-<span class="sourceLineNo">235</span> }<a name="line.235"></a>
-<span class="sourceLineNo">236</span><a name="line.236"></a>
-<span class="sourceLineNo">237</span> private void trackProcIds(long procId)
{<a name="line.237"></a>
-<span class="sourceLineNo">238</span> minModifiedProcId =
Math.min(minModifiedProcId, procId);<a name="line.238"></a>
-<span class="sourceLineNo">239</span> maxModifiedProcId =
Math.max(maxModifiedProcId, procId);<a name="line.239"></a>
-<span class="sourceLineNo">240</span> }<a name="line.240"></a>
-<span class="sourceLineNo">241</span><a name="line.241"></a>
-<span class="sourceLineNo">242</span> public long getModifiedMinProcId() {<a
name="line.242"></a>
-<span class="sourceLineNo">243</span> return minModifiedProcId;<a
name="line.243"></a>
-<span class="sourceLineNo">244</span> }<a name="line.244"></a>
-<span class="sourceLineNo">245</span><a name="line.245"></a>
-<span class="sourceLineNo">246</span> public long getModifiedMaxProcId() {<a
name="line.246"></a>
-<span class="sourceLineNo">247</span> return maxModifiedProcId;<a
name="line.247"></a>
-<span class="sourceLineNo">248</span> }<a name="line.248"></a>
-<span class="sourceLineNo">249</span><a name="line.249"></a>
-<span class="sourceLineNo">250</span> public void reset() {<a
name="line.250"></a>
-<span class="sourceLineNo">251</span> this.keepDeletes = false;<a
name="line.251"></a>
-<span class="sourceLineNo">252</span> this.partial = false;<a
name="line.252"></a>
-<span class="sourceLineNo">253</span> this.map.clear();<a
name="line.253"></a>
-<span class="sourceLineNo">254</span> resetModified();<a
name="line.254"></a>
-<span class="sourceLineNo">255</span> }<a name="line.255"></a>
-<span class="sourceLineNo">256</span><a name="line.256"></a>
-<span class="sourceLineNo">257</span> public boolean isModified(long procId)
{<a name="line.257"></a>
-<span class="sourceLineNo">258</span> final Map.Entry<Long,
BitSetNode> entry = map.floorEntry(procId);<a name="line.258"></a>
-<span class="sourceLineNo">259</span> return entry != null &&
entry.getValue().contains(procId) &&<a name="line.259"></a>
-<span class="sourceLineNo">260</span>
entry.getValue().isModified(procId);<a name="line.260"></a>
-<span class="sourceLineNo">261</span> }<a name="line.261"></a>
-<span class="sourceLineNo">262</span><a name="line.262"></a>
-<span class="sourceLineNo">263</span> /**<a name="line.263"></a>
-<span class="sourceLineNo">264</span> * If {@link #partial} is false,
returns state from the bitmap. If no state is found for<a name="line.264"></a>
-<span class="sourceLineNo">265</span> * {@code procId}, returns YES.<a
name="line.265"></a>
-<span class="sourceLineNo">266</span> * If partial is true, tracker doesn't
have complete view of system state, so it returns MAYBE<a name="line.266"></a>
-<span class="sourceLineNo">267</span> * if there is no update for the
procedure or if it doesn't have a state in bitmap. Otherwise,<a
name="line.267"></a>
-<span class="sourceLineNo">268</span> * returns state from the bitmap.<a
name="line.268"></a>
-<span class="sourceLineNo">269</span> */<a name="line.269"></a>
-<span class="sourceLineNo">270</span> public DeleteState isDeleted(long
procId) {<a name="line.270"></a>
-<span class="sourceLineNo">271</span> Map.Entry<Long, BitSetNode>
entry = map.floorEntry(procId);<a name="line.271"></a>
-<span class="sourceLineNo">272</span> if (entry != null &&
entry.getValue().contains(procId)) {<a name="line.272"></a>
-<span class="sourceLineNo">273</span> BitSetNode node =
entry.getValue();<a name="line.273"></a>
-<span class="sourceLineNo">274</span> DeleteState state =
node.isDeleted(procId);<a name="line.274"></a>
-<span class="sourceLineNo">275</span> return partial &&
!node.isModified(procId) ? DeleteState.MAYBE : state;<a name="line.275"></a>
-<span class="sourceLineNo">276</span> }<a name="line.276"></a>
-<span class="sourceLineNo">277</span> return partial ? DeleteState.MAYBE :
DeleteState.YES;<a name="line.277"></a>
-<span class="sourceLineNo">278</span> }<a name="line.278"></a>
-<span class="sourceLineNo">279</span><a name="line.279"></a>
-<span class="sourceLineNo">280</span> public long getActiveMinProcId() {<a
name="line.280"></a>
-<span class="sourceLineNo">281</span> // TODO: Cache?<a name="line.281"></a>
+<span class="sourceLineNo">027</span>import
org.apache.hadoop.hbase.procedure2.Procedure;<a name="line.27"></a>
+<span class="sourceLineNo">028</span>import
org.apache.yetus.audience.InterfaceAudience;<a name="line.28"></a>
+<span class="sourceLineNo">029</span>import
org.apache.yetus.audience.InterfaceStability;<a name="line.29"></a>
+<span class="sourceLineNo">030</span><a name="line.30"></a>
+<span class="sourceLineNo">031</span>import
org.apache.hadoop.hbase.shaded.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<Long,
BitSetNode> map = new TreeMap<>();<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> 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 minModifiedProcId =
Long.MAX_VALUE;<a name="line.60"></a>
+<span class="sourceLineNo">061</span> private long maxModifiedProcId =
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> public void
resetToProto(ProcedureProtos.ProcedureStoreTracker trackerProtoBuf) {<a
name="line.65"></a>
+<span class="sourceLineNo">066</span> reset();<a name="line.66"></a>
+<span class="sourceLineNo">067</span> for
(ProcedureProtos.ProcedureStoreTracker.TrackerNode protoNode:
trackerProtoBuf.getNodeList()) {<a name="line.67"></a>
+<span class="sourceLineNo">068</span> final BitSetNode node = new
BitSetNode(protoNode);<a name="line.68"></a>
+<span class="sourceLineNo">069</span> map.put(node.getStart(), node);<a
name="line.69"></a>
+<span class="sourceLineNo">070</span> }<a name="line.70"></a>
+<span class="sourceLineNo">071</span> }<a name="line.71"></a>
+<span class="sourceLineNo">072</span><a name="line.72"></a>
+<span class="sourceLineNo">073</span> /**<a name="line.73"></a>
+<span class="sourceLineNo">074</span> * Resets internal state to same as
given {@code tracker}. Does deep copy of the bitmap.<a name="line.74"></a>
+<span class="sourceLineNo">075</span> */<a name="line.75"></a>
+<span class="sourceLineNo">076</span> public void
resetTo(ProcedureStoreTracker tracker) {<a name="line.76"></a>
+<span class="sourceLineNo">077</span> resetTo(tracker, false);<a
name="line.77"></a>
+<span class="sourceLineNo">078</span> }<a name="line.78"></a>
+<span class="sourceLineNo">079</span><a name="line.79"></a>
+<span class="sourceLineNo">080</span> /**<a name="line.80"></a>
+<span class="sourceLineNo">081</span> * Resets internal state to same as
given {@code tracker}, and change the deleted flag according<a
name="line.81"></a>
+<span class="sourceLineNo">082</span> * to the modified flag if {@code
resetDelete} is true. Does deep copy of the bitmap.<a name="line.82"></a>
+<span class="sourceLineNo">083</span> * <p/><a name="line.83"></a>
+<span class="sourceLineNo">084</span> * The {@code resetDelete} will be set
to true when building cleanup tracker, please see the<a name="line.84"></a>
+<span class="sourceLineNo">085</span> * comments in {@link
BitSetNode#BitSetNode(BitSetNode, boolean)} to learn how we change the<a
name="line.85"></a>
+<span class="sourceLineNo">086</span> * deleted flag if {@code resetDelete}
is true.<a name="line.86"></a>
+<span class="sourceLineNo">087</span> */<a name="line.87"></a>
+<span class="sourceLineNo">088</span> public void
resetTo(ProcedureStoreTracker tracker, boolean resetDelete) {<a
name="line.88"></a>
+<span class="sourceLineNo">089</span> reset();<a name="line.89"></a>
+<span class="sourceLineNo">090</span> this.partial = tracker.partial;<a
name="line.90"></a>
+<span class="sourceLineNo">091</span> this.minModifiedProcId =
tracker.minModifiedProcId;<a name="line.91"></a>
+<span class="sourceLineNo">092</span> this.maxModifiedProcId =
tracker.maxModifiedProcId;<a name="line.92"></a>
+<span class="sourceLineNo">093</span> this.keepDeletes =
tracker.keepDeletes;<a name="line.93"></a>
+<span class="sourceLineNo">094</span> for (Map.Entry<Long,
BitSetNode> entry : tracker.map.entrySet()) {<a name="line.94"></a>
+<span class="sourceLineNo">095</span> map.put(entry.getKey(), new
BitSetNode(entry.getValue(), resetDelete));<a name="line.95"></a>
+<span class="sourceLineNo">096</span> }<a name="line.96"></a>
+<span class="sourceLineNo">097</span> }<a name="line.97"></a>
+<span class="sourceLineNo">098</span><a name="line.98"></a>
+<span class="sourceLineNo">099</span> public void insert(long procId) {<a
name="line.99"></a>
+<span class="sourceLineNo">100</span> insert(null, procId);<a
name="line.100"></a>
+<span class="sourceLineNo">101</span> }<a name="line.101"></a>
+<span class="sourceLineNo">102</span><a name="line.102"></a>
+<span class="sourceLineNo">103</span> public void insert(long[] procIds) {<a
name="line.103"></a>
+<span class="sourceLineNo">104</span> for (int i = 0; i <
procIds.length; ++i) {<a name="line.104"></a>
+<span class="sourceLineNo">105</span> insert(procIds[i]);<a
name="line.105"></a>
+<span class="sourceLineNo">106</span> }<a name="line.106"></a>
+<span class="sourceLineNo">107</span> }<a name="line.107"></a>
+<span class="sourceLineNo">108</span><a name="line.108"></a>
+<span class="sourceLineNo">109</span> public void insert(long procId, long[]
subProcIds) {<a name="line.109"></a>
+<span class="sourceLineNo">110</span> BitSetNode node = update(null,
procId);<a name="line.110"></a>
+<span class="sourceLineNo">111</span> for (int i = 0; i <
subProcIds.length; ++i) {<a name="line.111"></a>
+<span class="sourceLineNo">112</span> node = insert(node,
subProcIds[i]);<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><a name="line.115"></a>
+<span class="sourceLineNo">116</span> private BitSetNode insert(BitSetNode
node, long procId) {<a name="line.116"></a>
+<span class="sourceLineNo">117</span> if (node == null ||
!node.contains(procId)) {<a name="line.117"></a>
+<span class="sourceLineNo">118</span> node = getOrCreateNode(procId);<a
name="line.118"></a>
+<span class="sourceLineNo">119</span> }<a name="line.119"></a>
+<span class="sourceLineNo">120</span> node.insertOrUpdate(procId);<a
name="line.120"></a>
+<span class="sourceLineNo">121</span> trackProcIds(procId);<a
name="line.121"></a>
+<span class="sourceLineNo">122</span> return node;<a name="line.122"></a>
+<span class="sourceLineNo">123</span> }<a name="line.123"></a>
+<span class="sourceLineNo">124</span><a name="line.124"></a>
+<span class="sourceLineNo">125</span> public void update(long procId) {<a
name="line.125"></a>
+<span class="sourceLineNo">126</span> update(null, procId);<a
name="line.126"></a>
+<span class="sourceLineNo">127</span> }<a name="line.127"></a>
+<span class="sourceLineNo">128</span><a name="line.128"></a>
+<span class="sourceLineNo">129</span> private BitSetNode update(BitSetNode
node, long procId) {<a name="line.129"></a>
+<span class="sourceLineNo">130</span> node = lookupClosestNode(node,
procId);<a name="line.130"></a>
+<span class="sourceLineNo">131</span> assert node != null : "expected node
to update procId=" + procId;<a name="line.131"></a>
+<span class="sourceLineNo">132</span> assert node.contains(procId) :
"expected procId=" + procId + " in the node";<a name="line.132"></a>
+<span class="sourceLineNo">133</span> node.insertOrUpdate(procId);<a
name="line.133"></a>
+<span class="sourceLineNo">134</span> trackProcIds(procId);<a
name="line.134"></a>
+<span class="sourceLineNo">135</span> return node;<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 delete(long procId) {<a
name="line.138"></a>
+<span class="sourceLineNo">139</span> delete(null, procId);<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[]
procIds) {<a name="line.142"></a>
+<span class="sourceLineNo">143</span> Arrays.sort(procIds);<a
name="line.143"></a>
+<span class="sourceLineNo">144</span> BitSetNode node = null;<a
name="line.144"></a>
+<span class="sourceLineNo">145</span> for (int i = 0; i <
procIds.length; ++i) {<a name="line.145"></a>
+<span class="sourceLineNo">146</span> node = delete(node, procIds[i]);<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> private BitSetNode delete(BitSetNode
node, long procId) {<a name="line.150"></a>
+<span class="sourceLineNo">151</span> node = lookupClosestNode(node,
procId);<a name="line.151"></a>
+<span class="sourceLineNo">152</span> assert node != null : "expected node
to delete procId=" + procId;<a name="line.152"></a>
+<span class="sourceLineNo">153</span> assert node.contains(procId) :
"expected procId=" + procId + " in the node";<a name="line.153"></a>
+<span class="sourceLineNo">154</span> node.delete(procId);<a
name="line.154"></a>
+<span class="sourceLineNo">155</span> if (!keepDeletes &&
node.isEmpty()) {<a name="line.155"></a>
+<span class="sourceLineNo">156</span> // TODO: RESET if (map.size() ==
1)<a name="line.156"></a>
+<span class="sourceLineNo">157</span> map.remove(node.getStart());<a
name="line.157"></a>
+<span class="sourceLineNo">158</span> }<a name="line.158"></a>
+<span class="sourceLineNo">159</span><a name="line.159"></a>
+<span class="sourceLineNo">160</span> trackProcIds(procId);<a
name="line.160"></a>
+<span class="sourceLineNo">161</span> return node;<a name="line.161"></a>
+<span class="sourceLineNo">162</span> }<a name="line.162"></a>
+<span class="sourceLineNo">163</span><a name="line.163"></a>
+<span class="sourceLineNo">164</span> /**<a name="line.164"></a>
+<span class="sourceLineNo">165</span> * Will be called when restarting where
we need to rebuild the ProcedureStoreTracker.<a name="line.165"></a>
+<span class="sourceLineNo">166</span> */<a name="line.166"></a>
+<span class="sourceLineNo">167</span> public void
setMinMaxModifiedProcIds(long min, long max) {<a name="line.167"></a>
+<span class="sourceLineNo">168</span> this.minModifiedProcId = min;<a
name="line.168"></a>
+<span class="sourceLineNo">169</span> this.maxModifiedProcId = max;<a
name="line.169"></a>
+<span class="sourceLineNo">170</span> }<a name="line.170"></a>
+<span class="sourceLineNo">171</span> /**<a name="line.171"></a>
+<span class="sourceLineNo">172</span> * This method is used when restarting
where we need to rebuild the ProcedureStoreTracker. The<a name="line.172"></a>
+<span class="sourceLineNo">173</span> * {@link #delete(long)} method above
assume that the {@link BitSetNode} exists, but when restart<a
name="line.173"></a>
+<span class="sourceLineNo">174</span> * this is not true, as we will read
the wal files in reverse order so a delete may come first.<a
name="line.174"></a>
+<span class="sourceLineNo">175</span> */<a name="line.175"></a>
+<span class="sourceLineNo">176</span> public void setDeleted(long procId,
boolean isDeleted) {<a name="line.176"></a>
+<span class="sourceLineNo">177</span> BitSetNode node =
getOrCreateNode(procId);<a name="line.177"></a>
+<span class="sourceLineNo">178</span> assert node.contains(procId) :
"expected procId=" + procId + " in the node=" + node;<a name="line.178"></a>
+<span class="sourceLineNo">179</span> node.updateState(procId,
isDeleted);<a name="line.179"></a>
+<span class="sourceLineNo">180</span> trackProcIds(procId);<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> /**<a name="line.183"></a>
+<span class="sourceLineNo">184</span> * Set the given bit for the procId to
delete if it was modified before.<a name="line.184"></a>
+<span class="sourceLineNo">185</span> * <p/><a name="line.185"></a>
+<span class="sourceLineNo">186</span> * This method is used to test whether
a procedure wal file can be safely deleted, as if all the<a name="line.186"></a>
+<span class="sourceLineNo">187</span> * procedures in the given procedure
wal file has been modified in the new procedure wal files,<a
name="line.187"></a>
+<span class="sourceLineNo">188</span> * then we can delete it.<a
name="line.188"></a>
+<span class="sourceLineNo">189</span> */<a name="line.189"></a>
+<span class="sourceLineNo">190</span> public void
setDeletedIfModified(long... procId) {<a name="line.190"></a>
+<span class="sourceLineNo">191</span> BitSetNode node = null;<a
name="line.191"></a>
+<span class="sourceLineNo">192</span> for (int i = 0; i < procId.length;
++i) {<a name="line.192"></a>
+<span class="sourceLineNo">193</span> node = lookupClosestNode(node,
procId[i]);<a name="line.193"></a>
+<span class="sourceLineNo">194</span> if (node != null &&
node.isModified(procId[i])) {<a name="line.194"></a>
+<span class="sourceLineNo">195</span> node.delete(procId[i]);<a
name="line.195"></a>
+<span class="sourceLineNo">196</span> }<a name="line.196"></a>
+<span class="sourceLineNo">197</span> }<a name="line.197"></a>
+<span class="sourceLineNo">198</span> }<a name="line.198"></a>
+<span class="sourceLineNo">199</span><a name="line.199"></a>
+<span class="sourceLineNo">200</span> /**<a name="line.200"></a>
+<span class="sourceLineNo">201</span> * Similar with {@link
#setDeletedIfModified(long...)}, but here the {@code procId} are given by<a
name="line.201"></a>
+<span class="sourceLineNo">202</span> * the {@code tracker}. If a procedure
is modified by us, and also by the given {@code tracker},<a name="line.202"></a>
+<span class="sourceLineNo">203</span> * then we mark it as deleted.<a
name="line.203"></a>
+<span class="sourceLineNo">204</span> * @see
#setDeletedIfModified(long...)<a name="line.204"></a>
+<span class="sourceLineNo">205</span> */<a name="line.205"></a>
+<span class="sourceLineNo">206</span> public void
setDeletedIfModifiedInBoth(ProcedureStoreTracker tracker) {<a
name="line.206"></a>
+<span class="sourceLineNo">207</span> BitSetNode trackerNode = null;<a
name="line.207"></a>
+<span class="sourceLineNo">208</span> for (BitSetNode node : map.values())
{<a name="line.208"></a>
+<span class="sourceLineNo">209</span> final long minProcId =
node.getStart();<a name="line.209"></a>
+<span class="sourceLineNo">210</span> final long maxProcId =
node.getEnd();<a name="line.210"></a>
+<span class="sourceLineNo">211</span> for (long procId = minProcId;
procId <= maxProcId; ++procId) {<a name="line.211"></a>
+<span class="sourceLineNo">212</span> if (!node.isModified(procId)) {<a
name="line.212"></a>
+<span class="sourceLineNo">213</span> continue;<a name="line.213"></a>
+<span class="sourceLineNo">214</span> }<a name="line.214"></a>
+<span class="sourceLineNo">215</span><a name="line.215"></a>
+<span class="sourceLineNo">216</span> trackerNode =
tracker.lookupClosestNode(trackerNode, procId);<a name="line.216"></a>
+<span class="sourceLineNo">217</span> if (trackerNode == null ||
!trackerNode.contains(procId) ||<a name="line.217"></a>
+<span class="sourceLineNo">218</span> trackerNode.isModified(procId))
{<a name="line.218"></a>
+<span class="sourceLineNo">219</span> // the procedure was removed or
modified<a name="line.219"></a>
+<span class="sourceLineNo">220</span> node.delete(procId);<a
name="line.220"></a>
+<span class="sourceLineNo">221</span> }<a name="line.221"></a>
+<span class="sourceLineNo">222</span> }<a name="line.222"></a>
+<span class="sourceLineNo">223</span> }<a name="line.223"></a>
+<span class="sourceLineNo">224</span> }<a name="line.224"></a>
+<span class="sourceLineNo">225</span><a name="line.225"></a>
+<span class="sourceLineNo">226</span> /**<a name="line.226"></a>
+<span class="sourceLineNo">227</span> * lookup the node containing the
specified procId.<a name="line.227"></a>
+<span class="sourceLineNo">228</span> * @param node cached node to check
before doing a lookup<a name="line.228"></a>
+<span class="sourceLineNo">229</span> * @param procId the procId to lookup<a
name="line.229"></a>
+<span class="sourceLineNo">230</span> * @return the node that may contains
the procId or null<a name="line.230"></a>
+<span class="sourceLineNo">231</span> */<a name="line.231"></a>
+<span class="sourceLineNo">232</span> private BitSetNode
lookupClosestNode(final BitSetNode node, final long procId) {<a
name="line.232"></a>
+<span class="sourceLineNo">233</span> if (node != null &&
node.contains(procId)) return node;<a name="line.233"></a>
+<span class="sourceLineNo">234</span> final Map.Entry<Long,
BitSetNode> entry = map.floorEntry(procId);<a name="line.234"></a>
+<span class="sourceLineNo">235</span> return entry != null ?
entry.getValue() : null;<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> private void trackProcIds(long procId)
{<a name="line.238"></a>
+<span class="sourceLineNo">239</span> minModifiedProcId =
Math.min(minModifiedProcId, procId);<a name="line.239"></a>
+<span class="sourceLineNo">240</span> maxModifiedProcId =
Math.max(maxModifiedProcId, procId);<a name="line.240"></a>
+<span class="sourceLineNo">241</span> }<a name="line.241"></a>
+<span class="sourceLineNo">242</span><a name="line.242"></a>
+<span class="sourceLineNo">243</span> public long getModifiedMinProcId() {<a
name="line.243"></a>
+<span class="sourceLineNo">244</span> return minModifiedProcId;<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> public long getModifiedMaxProcId() {<a
name="line.247"></a>
+<span class="sourceLineNo">248</span> return maxModifiedProcId;<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> public void reset() {<a
name="line.251"></a>
+<span class="sourceLineNo">252</span> this.keepDeletes = false;<a
name="line.252"></a>
+<span class="sourceLineNo">253</span> this.partial = false;<a
name="line.253"></a>
+<span class="sourceLineNo">254</span> this.map.clear();<a
name="line.254"></a>
+<span class="sourceLineNo">255</span> resetModified();<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 isModified(long procId)
{<a name="line.258"></a>
+<span class="sourceLineNo">259</span> final Map.Entry<Long,
BitSetNode> entry = map.floorEntry(procId);<a name="line.259"></a>
+<span class="sourceLineNo">260</span> return entry != null &&
entry.getValue().contains(procId) &&<a name="line.260"></a>
+<span class="sourceLineNo">261</span>
entry.getValue().isModified(procId);<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> /**<a name="line.264"></a>
+<span class="sourceLineNo">265</span> * If {@link #partial} is false,
returns state from the bitmap. If no state is found for<a name="line.265"></a>
+<span class="sourceLineNo">266</span> * {@code procId}, returns YES.<a
name="line.266"></a>
+<span class="sourceLineNo">267</span> * If partial is true, tracker doesn't
have complete view of system state, so it returns MAYBE<a name="line.267"></a>
+<span class="sourceLineNo">268</span> * if there is no update for the
procedure or if it doesn't have a state in bitmap. Otherwise,<a
name="line.268"></a>
+<span class="sourceLineNo">269</span> * returns state from the bitmap.<a
name="line.269"></a>
+<span class="sourceLineNo">270</span> */<a name="line.270"></a>
+<span class="sourceLineNo">271</span> public DeleteState isDeleted(long
procId) {<a name="line.271"></a>
+<span class="sourceLineNo">272</span> Map.Entry<Long, BitSetNode>
entry = map.floorEntry(procId);<a name="line.272"></a>
+<span class="sourceLineNo">273</span> if (entry != null &&
entry.getValue().contains(procId)) {<a name="line.273"></a>
+<span class="sourceLineNo">274</span> BitSetNode node =
entry.getValue();<a name="line.274"></a>
+<span class="sourceLineNo">275</span> DeleteState state =
node.isDeleted(procId);<a name="line.275"></a>
+<span class="sourceLineNo">276</span> return partial &&
!node.isModified(procId) ? DeleteState.MAYBE : state;<a name="line.276"></a>
+<span class="sourceLineNo">277</span> }<a name="line.277"></a>
+<span class="sourceLineNo">278</span> return partial ? DeleteState.MAYBE :
DeleteState.YES;<a name="line.278"></a>
+<span class="sourceLineNo">279</span> }<a name="line.279"></a>
+<span class="sourceLineNo">280</span><a name="line.280"></a>
+<span class="sourceLineNo">281</span> public long getActiveMinProcId() {<a
name="line.281"></a>
<span class="sourceLineNo">282</span> Map.Entry<Long, BitSetNode>
entry = map.firstEntry();<a name="line.282"></a>
-<span class="sourceLineNo">283</span> return entry == null ? 0 :
entry.getValue().getActiveMinProcId();<a name="line.283"></a>
+<span class="sourceLineNo">283</span> return entry == null ?
Procedure.NO_PROC_ID : entry.getValue().getActiveMinProcId();<a
name="line.283"></a>
<span class="sourceLineNo">284</span> }<a name="line.284"></a>
<span class="sourceLineNo">285</span><a name="line.285"></a>
<span class="sourceLineNo">286</span> public void setKeepDeletes(boolean
keepDeletes) {<a name="line.286"></a>
