You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2018/10/23 14:55:55 UTC
[29/37] hbase-site git commit: Published site at
3b68e5393edba011146962c7457faffc1e3c0ee7.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/3b2f2cea/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
index 8515fa3..1579eab 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/procedure2/store/ProcedureStoreTracker.html
@@ -211,7 +211,7 @@
<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">206</span> public void setDeletedIfModifiedInBoth(ProcedureStoreTracker tracker, boolean globalTracker) {<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>
@@ -222,250 +222,285 @@
<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">217</span> if (trackerNode == null || !trackerNode.contains(procId)) {<a name="line.217"></a>
+<span class="sourceLineNo">218</span> // the procId is not exist in the track, we can only delete the proc<a name="line.218"></a>
+<span class="sourceLineNo">219</span> // if globalTracker set to true.<a name="line.219"></a>
+<span class="sourceLineNo">220</span> // Only if the procedure is not in the global tracker we can delete the<a name="line.220"></a>
+<span class="sourceLineNo">221</span> // the procedure. In other cases, the procedure may not update in a single<a name="line.221"></a>
+<span class="sourceLineNo">222</span> // log, we cannot delete it just because the log's track doesn't have<a name="line.222"></a>
+<span class="sourceLineNo">223</span> // any info for the procedure.<a name="line.223"></a>
+<span class="sourceLineNo">224</span> if (globalTracker) {<a name="line.224"></a>
+<span class="sourceLineNo">225</span> node.delete(procId);<a name="line.225"></a>
+<span class="sourceLineNo">226</span> }<a name="line.226"></a>
+<span class="sourceLineNo">227</span> continue;<a name="line.227"></a>
+<span class="sourceLineNo">228</span> }<a name="line.228"></a>
+<span class="sourceLineNo">229</span> // Only check delete in the global tracker, only global tracker has the<a name="line.229"></a>
+<span class="sourceLineNo">230</span> // whole picture<a name="line.230"></a>
+<span class="sourceLineNo">231</span> if (globalTracker && trackerNode.isDeleted(procId) == DeleteState.YES) {<a name="line.231"></a>
+<span class="sourceLineNo">232</span> node.delete(procId);<a name="line.232"></a>
+<span class="sourceLineNo">233</span> continue;<a name="line.233"></a>
+<span class="sourceLineNo">234</span> }<a name="line.234"></a>
+<span class="sourceLineNo">235</span> if (trackerNode.isModified(procId)) {<a name="line.235"></a>
+<span class="sourceLineNo">236</span> // the procedure was modified<a name="line.236"></a>
+<span class="sourceLineNo">237</span> node.delete(procId);<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> }<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">243</span> /**<a name="line.243"></a>
+<span class="sourceLineNo">244</span> * lookup the node containing the specified procId.<a name="line.244"></a>
+<span class="sourceLineNo">245</span> * @param node cached node to check before doing a lookup<a name="line.245"></a>
+<span class="sourceLineNo">246</span> * @param procId the procId to lookup<a name="line.246"></a>
+<span class="sourceLineNo">247</span> * @return the node that may contains the procId or null<a name="line.247"></a>
+<span class="sourceLineNo">248</span> */<a name="line.248"></a>
+<span class="sourceLineNo">249</span> private BitSetNode lookupClosestNode(final BitSetNode node, final long procId) {<a name="line.249"></a>
+<span class="sourceLineNo">250</span> if (node != null && node.contains(procId)) return node;<a name="line.250"></a>
+<span class="sourceLineNo">251</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.251"></a>
+<span class="sourceLineNo">252</span> return entry != null ? entry.getValue() : null;<a name="line.252"></a>
+<span class="sourceLineNo">253</span> }<a name="line.253"></a>
+<span class="sourceLineNo">254</span><a name="line.254"></a>
+<span class="sourceLineNo">255</span> private void trackProcIds(long procId) {<a name="line.255"></a>
+<span class="sourceLineNo">256</span> minModifiedProcId = Math.min(minModifiedProcId, procId);<a name="line.256"></a>
+<span class="sourceLineNo">257</span> maxModifiedProcId = Math.max(maxModifiedProcId, procId);<a name="line.257"></a>
+<span class="sourceLineNo">258</span> }<a name="line.258"></a>
+<span class="sourceLineNo">259</span><a name="line.259"></a>
+<span class="sourceLineNo">260</span> public long getModifiedMinProcId() {<a name="line.260"></a>
+<span class="sourceLineNo">261</span> return minModifiedProcId;<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">264</span> public long getModifiedMaxProcId() {<a name="line.264"></a>
+<span class="sourceLineNo">265</span> return maxModifiedProcId;<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> public void reset() {<a name="line.268"></a>
+<span class="sourceLineNo">269</span> this.keepDeletes = false;<a name="line.269"></a>
+<span class="sourceLineNo">270</span> this.partial = false;<a name="line.270"></a>
+<span class="sourceLineNo">271</span> this.map.clear();<a name="line.271"></a>
+<span class="sourceLineNo">272</span> resetModified();<a name="line.272"></a>
+<span class="sourceLineNo">273</span> }<a name="line.273"></a>
+<span class="sourceLineNo">274</span><a name="line.274"></a>
+<span class="sourceLineNo">275</span> public boolean isModified(long procId) {<a name="line.275"></a>
+<span class="sourceLineNo">276</span> final Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.276"></a>
+<span class="sourceLineNo">277</span> return entry != null && entry.getValue().contains(procId) &&<a name="line.277"></a>
+<span class="sourceLineNo">278</span> entry.getValue().isModified(procId);<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 ? 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>
-<span class="sourceLineNo">287</span> this.keepDeletes = keepDeletes;<a name="line.287"></a>
-<span class="sourceLineNo">288</span> // If not to keep deletes, remove the BitSetNodes which are empty (i.e. contains ids of deleted<a name="line.288"></a>
-<span class="sourceLineNo">289</span> // procedures).<a name="line.289"></a>
-<span class="sourceLineNo">290</span> if (!keepDeletes) {<a name="line.290"></a>
-<span class="sourceLineNo">291</span> Iterator<Map.Entry<Long, BitSetNode>> it = map.entrySet().iterator();<a name="line.291"></a>
-<span class="sourceLineNo">292</span> while (it.hasNext()) {<a name="line.292"></a>
-<span class="sourceLineNo">293</span> Map.Entry<Long, BitSetNode> entry = it.next();<a name="line.293"></a>
-<span class="sourceLineNo">294</span> if (entry.getValue().isEmpty()) {<a name="line.294"></a>
-<span class="sourceLineNo">295</span> it.remove();<a name="line.295"></a>
-<span class="sourceLineNo">296</span> }<a name="line.296"></a>
-<span class="sourceLineNo">297</span> }<a name="line.297"></a>
-<span class="sourceLineNo">298</span> }<a name="line.298"></a>
-<span class="sourceLineNo">299</span> }<a name="line.299"></a>
-<span class="sourceLineNo">300</span><a name="line.300"></a>
-<span class="sourceLineNo">301</span> public boolean isPartial() {<a name="line.301"></a>
-<span class="sourceLineNo">302</span> return partial;<a name="line.302"></a>
-<span class="sourceLineNo">303</span> }<a name="line.303"></a>
-<span class="sourceLineNo">304</span><a name="line.304"></a>
-<span class="sourceLineNo">305</span> public void setPartialFlag(boolean isPartial) {<a name="line.305"></a>
-<span class="sourceLineNo">306</span> if (this.partial && !isPartial) {<a name="line.306"></a>
-<span class="sourceLineNo">307</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.307"></a>
-<span class="sourceLineNo">308</span> entry.getValue().unsetPartialFlag();<a name="line.308"></a>
-<span class="sourceLineNo">309</span> }<a name="line.309"></a>
-<span class="sourceLineNo">310</span> }<a name="line.310"></a>
-<span class="sourceLineNo">311</span> this.partial = isPartial;<a name="line.311"></a>
-<span class="sourceLineNo">312</span> }<a name="line.312"></a>
-<span class="sourceLineNo">313</span><a name="line.313"></a>
-<span class="sourceLineNo">314</span> /**<a name="line.314"></a>
-<span class="sourceLineNo">315</span> * @return true, if no procedure is active, else false.<a name="line.315"></a>
-<span class="sourceLineNo">316</span> */<a name="line.316"></a>
-<span class="sourceLineNo">317</span> public boolean isEmpty() {<a name="line.317"></a>
-<span class="sourceLineNo">318</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.318"></a>
-<span class="sourceLineNo">319</span> if (!entry.getValue().isEmpty()) {<a name="line.319"></a>
-<span class="sourceLineNo">320</span> return false;<a name="line.320"></a>
-<span class="sourceLineNo">321</span> }<a name="line.321"></a>
-<span class="sourceLineNo">322</span> }<a name="line.322"></a>
-<span class="sourceLineNo">323</span> return true;<a name="line.323"></a>
-<span class="sourceLineNo">324</span> }<a name="line.324"></a>
-<span class="sourceLineNo">325</span><a name="line.325"></a>
-<span class="sourceLineNo">326</span> /**<a name="line.326"></a>
-<span class="sourceLineNo">327</span> * @return true if all procedure was modified or deleted since last call to<a name="line.327"></a>
-<span class="sourceLineNo">328</span> * {@link #resetModified()}.<a name="line.328"></a>
-<span class="sourceLineNo">329</span> */<a name="line.329"></a>
-<span class="sourceLineNo">330</span> public boolean isAllModified() {<a name="line.330"></a>
-<span class="sourceLineNo">331</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span> if (!entry.getValue().isAllModified()) {<a name="line.332"></a>
-<span class="sourceLineNo">333</span> return false;<a name="line.333"></a>
-<span class="sourceLineNo">334</span> }<a name="line.334"></a>
-<span class="sourceLineNo">335</span> }<a name="line.335"></a>
-<span class="sourceLineNo">336</span> return true;<a name="line.336"></a>
-<span class="sourceLineNo">337</span> }<a name="line.337"></a>
-<span class="sourceLineNo">338</span><a name="line.338"></a>
-<span class="sourceLineNo">339</span> /**<a name="line.339"></a>
-<span class="sourceLineNo">340</span> * Will be used when there are too many proc wal files. We will rewrite the states of the active<a name="line.340"></a>
-<span class="sourceLineNo">341</span> * procedures in the oldest proc wal file so that we can delete it.<a name="line.341"></a>
-<span class="sourceLineNo">342</span> * @return all the active procedure ids in this tracker.<a name="line.342"></a>
-<span class="sourceLineNo">343</span> */<a name="line.343"></a>
-<span class="sourceLineNo">344</span> public long[] getAllActiveProcIds() {<a name="line.344"></a>
-<span class="sourceLineNo">345</span> return map.values().stream().map(BitSetNode::getActiveProcIds).filter(p -> p.length > 0)<a name="line.345"></a>
-<span class="sourceLineNo">346</span> .flatMapToLong(LongStream::of).toArray();<a name="line.346"></a>
-<span class="sourceLineNo">347</span> }<a name="line.347"></a>
-<span class="sourceLineNo">348</span><a name="line.348"></a>
-<span class="sourceLineNo">349</span> /**<a name="line.349"></a>
-<span class="sourceLineNo">350</span> * Clears the list of updated procedure ids. This doesn't affect global list of active<a name="line.350"></a>
-<span class="sourceLineNo">351</span> * procedure ids.<a name="line.351"></a>
-<span class="sourceLineNo">352</span> */<a name="line.352"></a>
-<span class="sourceLineNo">353</span> public void resetModified() {<a name="line.353"></a>
-<span class="sourceLineNo">354</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.354"></a>
-<span class="sourceLineNo">355</span> entry.getValue().resetModified();<a name="line.355"></a>
-<span class="sourceLineNo">356</span> }<a name="line.356"></a>
-<span class="sourceLineNo">357</span> minModifiedProcId = Long.MAX_VALUE;<a name="line.357"></a>
-<span class="sourceLineNo">358</span> maxModifiedProcId = Long.MIN_VALUE;<a name="line.358"></a>
-<span class="sourceLineNo">359</span> }<a name="line.359"></a>
-<span class="sourceLineNo">360</span><a name="line.360"></a>
-<span class="sourceLineNo">361</span> private BitSetNode getOrCreateNode(long procId) {<a name="line.361"></a>
-<span class="sourceLineNo">362</span> // If procId can fit in left node (directly or by growing it)<a name="line.362"></a>
-<span class="sourceLineNo">363</span> BitSetNode leftNode = null;<a name="line.363"></a>
-<span class="sourceLineNo">364</span> boolean leftCanGrow = false;<a name="line.364"></a>
-<span class="sourceLineNo">365</span> Map.Entry<Long, BitSetNode> leftEntry = map.floorEntry(procId);<a name="line.365"></a>
-<span class="sourceLineNo">366</span> if (leftEntry != null) {<a name="line.366"></a>
-<span class="sourceLineNo">367</span> leftNode = leftEntry.getValue();<a name="line.367"></a>
-<span class="sourceLineNo">368</span> if (leftNode.contains(procId)) {<a name="line.368"></a>
-<span class="sourceLineNo">369</span> return leftNode;<a name="line.369"></a>
-<span class="sourceLineNo">370</span> }<a name="line.370"></a>
-<span class="sourceLineNo">371</span> leftCanGrow = leftNode.canGrow(procId);<a name="line.371"></a>
-<span class="sourceLineNo">372</span> }<a name="line.372"></a>
-<span class="sourceLineNo">373</span><a name="line.373"></a>
-<span class="sourceLineNo">374</span> // If procId can fit in right node (directly or by growing it)<a name="line.374"></a>
-<span class="sourceLineNo">375</span> BitSetNode rightNode = null;<a name="line.375"></a>
-<span class="sourceLineNo">376</span> boolean rightCanGrow = false;<a name="line.376"></a>
-<span class="sourceLineNo">377</span> Map.Entry<Long, BitSetNode> rightEntry = map.ceilingEntry(procId);<a name="line.377"></a>
-<span class="sourceLineNo">378</span> if (rightEntry != null) {<a name="line.378"></a>
-<span class="sourceLineNo">379</span> rightNode = rightEntry.getValue();<a name="line.379"></a>
-<span class="sourceLineNo">380</span> rightCanGrow = rightNode.canGrow(procId);<a name="line.380"></a>
-<span class="sourceLineNo">381</span> if (leftNode != null) {<a name="line.381"></a>
-<span class="sourceLineNo">382</span> if (leftNode.canMerge(rightNode)) {<a name="line.382"></a>
-<span class="sourceLineNo">383</span> // merge left and right node<a name="line.383"></a>
-<span class="sourceLineNo">384</span> return mergeNodes(leftNode, rightNode);<a name="line.384"></a>
-<span class="sourceLineNo">385</span> }<a name="line.385"></a>
-<span class="sourceLineNo">386</span><a name="line.386"></a>
-<span class="sourceLineNo">387</span> // If left and right nodes can not merge, decide which one to grow.<a name="line.387"></a>
-<span class="sourceLineNo">388</span> if (leftCanGrow && rightCanGrow) {<a name="line.388"></a>
-<span class="sourceLineNo">389</span> if ((procId - leftNode.getEnd()) <= (rightNode.getStart() - procId)) {<a name="line.389"></a>
-<span class="sourceLineNo">390</span> return growNode(leftNode, procId);<a name="line.390"></a>
-<span class="sourceLineNo">391</span> }<a name="line.391"></a>
-<span class="sourceLineNo">392</span> return growNode(rightNode, procId);<a name="line.392"></a>
-<span class="sourceLineNo">393</span> }<a name="line.393"></a>
-<span class="sourceLineNo">394</span> }<a name="line.394"></a>
-<span class="sourceLineNo">395</span> }<a name="line.395"></a>
-<span class="sourceLineNo">396</span><a name="line.396"></a>
-<span class="sourceLineNo">397</span> // grow the left node<a name="line.397"></a>
-<span class="sourceLineNo">398</span> if (leftCanGrow) {<a name="line.398"></a>
-<span class="sourceLineNo">399</span> return growNode(leftNode, procId);<a name="line.399"></a>
-<span class="sourceLineNo">400</span> }<a name="line.400"></a>
-<span class="sourceLineNo">401</span><a name="line.401"></a>
-<span class="sourceLineNo">402</span> // grow the right node<a name="line.402"></a>
-<span class="sourceLineNo">403</span> if (rightCanGrow) {<a name="line.403"></a>
-<span class="sourceLineNo">404</span> return growNode(rightNode, procId);<a name="line.404"></a>
-<span class="sourceLineNo">405</span> }<a name="line.405"></a>
-<span class="sourceLineNo">406</span><a name="line.406"></a>
-<span class="sourceLineNo">407</span> // add new node if there are no left/right nodes which can be used.<a name="line.407"></a>
-<span class="sourceLineNo">408</span> BitSetNode node = new BitSetNode(procId, partial);<a name="line.408"></a>
-<span class="sourceLineNo">409</span> map.put(node.getStart(), node);<a name="line.409"></a>
-<span class="sourceLineNo">410</span> return node;<a name="line.410"></a>
-<span class="sourceLineNo">411</span> }<a name="line.411"></a>
-<span class="sourceLineNo">412</span><a name="line.412"></a>
-<span class="sourceLineNo">413</span> /**<a name="line.413"></a>
-<span class="sourceLineNo">414</span> * Grows {@code node} to contain {@code procId} and updates the map.<a name="line.414"></a>
-<span class="sourceLineNo">415</span> * @return {@link BitSetNode} instance which contains {@code procId}.<a name="line.415"></a>
-<span class="sourceLineNo">416</span> */<a name="line.416"></a>
-<span class="sourceLineNo">417</span> private BitSetNode growNode(BitSetNode node, long procId) {<a name="line.417"></a>
-<span class="sourceLineNo">418</span> map.remove(node.getStart());<a name="line.418"></a>
-<span class="sourceLineNo">419</span> node.grow(procId);<a name="line.419"></a>
-<span class="sourceLineNo">420</span> map.put(node.getStart(), node);<a name="line.420"></a>
-<span class="sourceLineNo">421</span> return node;<a name="line.421"></a>
-<span class="sourceLineNo">422</span> }<a name="line.422"></a>
-<span class="sourceLineNo">423</span><a name="line.423"></a>
-<span class="sourceLineNo">424</span> /**<a name="line.424"></a>
-<span class="sourceLineNo">425</span> * Merges {@code leftNode} & {@code rightNode} and updates the map.<a name="line.425"></a>
-<span class="sourceLineNo">426</span> */<a name="line.426"></a>
-<span class="sourceLineNo">427</span> private BitSetNode mergeNodes(BitSetNode leftNode, BitSetNode rightNode) {<a name="line.427"></a>
-<span class="sourceLineNo">428</span> assert leftNode.getStart() < rightNode.getStart();<a name="line.428"></a>
-<span class="sourceLineNo">429</span> leftNode.merge(rightNode);<a name="line.429"></a>
-<span class="sourceLineNo">430</span> map.remove(rightNode.getStart());<a name="line.430"></a>
-<span class="sourceLineNo">431</span> return leftNode;<a name="line.431"></a>
-<span class="sourceLineNo">432</span> }<a name="line.432"></a>
-<span class="sourceLineNo">433</span><a name="line.433"></a>
-<span class="sourceLineNo">434</span> public void dump() {<a name="line.434"></a>
-<span class="sourceLineNo">435</span> System.out.println("map " + map.size());<a name="line.435"></a>
-<span class="sourceLineNo">436</span> System.out.println("isAllModified " + isAllModified());<a name="line.436"></a>
-<span class="sourceLineNo">437</span> System.out.println("isEmpty " + isEmpty());<a name="line.437"></a>
-<span class="sourceLineNo">438</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.438"></a>
-<span class="sourceLineNo">439</span> entry.getValue().dump();<a name="line.439"></a>
+<span class="sourceLineNo">281</span> /**<a name="line.281"></a>
+<span class="sourceLineNo">282</span> * If {@link #partial} is false, returns state from the bitmap. If no state is found for<a name="line.282"></a>
+<span class="sourceLineNo">283</span> * {@code procId}, returns YES.<a name="line.283"></a>
+<span class="sourceLineNo">284</span> * If partial is true, tracker doesn't have complete view of system state, so it returns MAYBE<a name="line.284"></a>
+<span class="sourceLineNo">285</span> * if there is no update for the procedure or if it doesn't have a state in bitmap. Otherwise,<a name="line.285"></a>
+<span class="sourceLineNo">286</span> * returns state from the bitmap.<a name="line.286"></a>
+<span class="sourceLineNo">287</span> */<a name="line.287"></a>
+<span class="sourceLineNo">288</span> public DeleteState isDeleted(long procId) {<a name="line.288"></a>
+<span class="sourceLineNo">289</span> Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.289"></a>
+<span class="sourceLineNo">290</span> if (entry != null && entry.getValue().contains(procId)) {<a name="line.290"></a>
+<span class="sourceLineNo">291</span> BitSetNode node = entry.getValue();<a name="line.291"></a>
+<span class="sourceLineNo">292</span> DeleteState state = node.isDeleted(procId);<a name="line.292"></a>
+<span class="sourceLineNo">293</span> return partial && !node.isModified(procId) ? DeleteState.MAYBE : state;<a name="line.293"></a>
+<span class="sourceLineNo">294</span> }<a name="line.294"></a>
+<span class="sourceLineNo">295</span> return partial ? DeleteState.MAYBE : DeleteState.YES;<a name="line.295"></a>
+<span class="sourceLineNo">296</span> }<a name="line.296"></a>
+<span class="sourceLineNo">297</span><a name="line.297"></a>
+<span class="sourceLineNo">298</span> public long getActiveMinProcId() {<a name="line.298"></a>
+<span class="sourceLineNo">299</span> Map.Entry<Long, BitSetNode> entry = map.firstEntry();<a name="line.299"></a>
+<span class="sourceLineNo">300</span> return entry == null ? Procedure.NO_PROC_ID : entry.getValue().getActiveMinProcId();<a name="line.300"></a>
+<span class="sourceLineNo">301</span> }<a name="line.301"></a>
+<span class="sourceLineNo">302</span><a name="line.302"></a>
+<span class="sourceLineNo">303</span> public void setKeepDeletes(boolean keepDeletes) {<a name="line.303"></a>
+<span class="sourceLineNo">304</span> this.keepDeletes = keepDeletes;<a name="line.304"></a>
+<span class="sourceLineNo">305</span> // If not to keep deletes, remove the BitSetNodes which are empty (i.e. contains ids of deleted<a name="line.305"></a>
+<span class="sourceLineNo">306</span> // procedures).<a name="line.306"></a>
+<span class="sourceLineNo">307</span> if (!keepDeletes) {<a name="line.307"></a>
+<span class="sourceLineNo">308</span> Iterator<Map.Entry<Long, BitSetNode>> it = map.entrySet().iterator();<a name="line.308"></a>
+<span class="sourceLineNo">309</span> while (it.hasNext()) {<a name="line.309"></a>
+<span class="sourceLineNo">310</span> Map.Entry<Long, BitSetNode> entry = it.next();<a name="line.310"></a>
+<span class="sourceLineNo">311</span> if (entry.getValue().isEmpty()) {<a name="line.311"></a>
+<span class="sourceLineNo">312</span> it.remove();<a name="line.312"></a>
+<span class="sourceLineNo">313</span> }<a name="line.313"></a>
+<span class="sourceLineNo">314</span> }<a name="line.314"></a>
+<span class="sourceLineNo">315</span> }<a name="line.315"></a>
+<span class="sourceLineNo">316</span> }<a name="line.316"></a>
+<span class="sourceLineNo">317</span><a name="line.317"></a>
+<span class="sourceLineNo">318</span> public boolean isPartial() {<a name="line.318"></a>
+<span class="sourceLineNo">319</span> return partial;<a name="line.319"></a>
+<span class="sourceLineNo">320</span> }<a name="line.320"></a>
+<span class="sourceLineNo">321</span><a name="line.321"></a>
+<span class="sourceLineNo">322</span> public void setPartialFlag(boolean isPartial) {<a name="line.322"></a>
+<span class="sourceLineNo">323</span> if (this.partial && !isPartial) {<a name="line.323"></a>
+<span class="sourceLineNo">324</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.324"></a>
+<span class="sourceLineNo">325</span> entry.getValue().unsetPartialFlag();<a name="line.325"></a>
+<span class="sourceLineNo">326</span> }<a name="line.326"></a>
+<span class="sourceLineNo">327</span> }<a name="line.327"></a>
+<span class="sourceLineNo">328</span> this.partial = isPartial;<a name="line.328"></a>
+<span class="sourceLineNo">329</span> }<a name="line.329"></a>
+<span class="sourceLineNo">330</span><a name="line.330"></a>
+<span class="sourceLineNo">331</span> /**<a name="line.331"></a>
+<span class="sourceLineNo">332</span> * @return true, if no procedure is active, else false.<a name="line.332"></a>
+<span class="sourceLineNo">333</span> */<a name="line.333"></a>
+<span class="sourceLineNo">334</span> public boolean isEmpty() {<a name="line.334"></a>
+<span class="sourceLineNo">335</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.335"></a>
+<span class="sourceLineNo">336</span> if (!entry.getValue().isEmpty()) {<a name="line.336"></a>
+<span class="sourceLineNo">337</span> return false;<a name="line.337"></a>
+<span class="sourceLineNo">338</span> }<a name="line.338"></a>
+<span class="sourceLineNo">339</span> }<a name="line.339"></a>
+<span class="sourceLineNo">340</span> return true;<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> * @return true if all procedure was modified or deleted since last call to<a name="line.344"></a>
+<span class="sourceLineNo">345</span> * {@link #resetModified()}.<a name="line.345"></a>
+<span class="sourceLineNo">346</span> */<a name="line.346"></a>
+<span class="sourceLineNo">347</span> public boolean isAllModified() {<a name="line.347"></a>
+<span class="sourceLineNo">348</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.348"></a>
+<span class="sourceLineNo">349</span> if (!entry.getValue().isAllModified()) {<a name="line.349"></a>
+<span class="sourceLineNo">350</span> return false;<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> return true;<a name="line.353"></a>
+<span class="sourceLineNo">354</span> }<a name="line.354"></a>
+<span class="sourceLineNo">355</span><a name="line.355"></a>
+<span class="sourceLineNo">356</span> /**<a name="line.356"></a>
+<span class="sourceLineNo">357</span> * Will be used when there are too many proc wal files. We will rewrite the states of the active<a name="line.357"></a>
+<span class="sourceLineNo">358</span> * procedures in the oldest proc wal file so that we can delete it.<a name="line.358"></a>
+<span class="sourceLineNo">359</span> * @return all the active procedure ids in this tracker.<a name="line.359"></a>
+<span class="sourceLineNo">360</span> */<a name="line.360"></a>
+<span class="sourceLineNo">361</span> public long[] getAllActiveProcIds() {<a name="line.361"></a>
+<span class="sourceLineNo">362</span> return map.values().stream().map(BitSetNode::getActiveProcIds).filter(p -> p.length > 0)<a name="line.362"></a>
+<span class="sourceLineNo">363</span> .flatMapToLong(LongStream::of).toArray();<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> /**<a name="line.366"></a>
+<span class="sourceLineNo">367</span> * Clears the list of updated procedure ids. This doesn't affect global list of active<a name="line.367"></a>
+<span class="sourceLineNo">368</span> * procedure ids.<a name="line.368"></a>
+<span class="sourceLineNo">369</span> */<a name="line.369"></a>
+<span class="sourceLineNo">370</span> public void resetModified() {<a name="line.370"></a>
+<span class="sourceLineNo">371</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.371"></a>
+<span class="sourceLineNo">372</span> entry.getValue().resetModified();<a name="line.372"></a>
+<span class="sourceLineNo">373</span> }<a name="line.373"></a>
+<span class="sourceLineNo">374</span> minModifiedProcId = Long.MAX_VALUE;<a name="line.374"></a>
+<span class="sourceLineNo">375</span> maxModifiedProcId = Long.MIN_VALUE;<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> private BitSetNode getOrCreateNode(long procId) {<a name="line.378"></a>
+<span class="sourceLineNo">379</span> // See HBASE-20973, grow or merge can lead to ArrayIndexOutOfBoundsException<a name="line.379"></a>
+<span class="sourceLineNo">380</span> // The root cause is not revealed yet, disable grow or merge for now<a name="line.380"></a>
+<span class="sourceLineNo">381</span> return getOrCreateNodeNoGrowOrMerge(procId);<a name="line.381"></a>
+<span class="sourceLineNo">382</span> }<a name="line.382"></a>
+<span class="sourceLineNo">383</span><a name="line.383"></a>
+<span class="sourceLineNo">384</span> private BitSetNode getOrCreateNodeNoGrowOrMerge(long procId) {<a name="line.384"></a>
+<span class="sourceLineNo">385</span> Map.Entry<Long, BitSetNode> entry = map.floorEntry(procId);<a name="line.385"></a>
+<span class="sourceLineNo">386</span> if (entry != null && entry.getValue().contains(procId)) {<a name="line.386"></a>
+<span class="sourceLineNo">387</span> return entry.getValue();<a name="line.387"></a>
+<span class="sourceLineNo">388</span> } else {<a name="line.388"></a>
+<span class="sourceLineNo">389</span> BitSetNode node = new BitSetNode(procId, partial);<a name="line.389"></a>
+<span class="sourceLineNo">390</span> assert !map.containsKey(node.getStart());<a name="line.390"></a>
+<span class="sourceLineNo">391</span> map.put(node.getStart(), node);<a name="line.391"></a>
+<span class="sourceLineNo">392</span> return node;<a name="line.392"></a>
+<span class="sourceLineNo">393</span> }<a name="line.393"></a>
+<span class="sourceLineNo">394</span> }<a name="line.394"></a>
+<span class="sourceLineNo">395</span><a name="line.395"></a>
+<span class="sourceLineNo">396</span> private BitSetNode getOrCreateNodeWithGrowOrMerge(long procId) {<a name="line.396"></a>
+<span class="sourceLineNo">397</span> // If procId can fit in left node (directly or by growing it)<a name="line.397"></a>
+<span class="sourceLineNo">398</span> BitSetNode leftNode = null;<a name="line.398"></a>
+<span class="sourceLineNo">399</span> boolean leftCanGrow = false;<a name="line.399"></a>
+<span class="sourceLineNo">400</span> Map.Entry<Long, BitSetNode> leftEntry = map.floorEntry(procId);<a name="line.400"></a>
+<span class="sourceLineNo">401</span> if (leftEntry != null) {<a name="line.401"></a>
+<span class="sourceLineNo">402</span> leftNode = leftEntry.getValue();<a name="line.402"></a>
+<span class="sourceLineNo">403</span> if (leftNode.contains(procId)) {<a name="line.403"></a>
+<span class="sourceLineNo">404</span> return leftNode;<a name="line.404"></a>
+<span class="sourceLineNo">405</span> }<a name="line.405"></a>
+<span class="sourceLineNo">406</span> leftCanGrow = leftNode.canGrow(procId);<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> // If procId can fit in right node (directly or by growing it)<a name="line.409"></a>
+<span class="sourceLineNo">410</span> BitSetNode rightNode = null;<a name="line.410"></a>
+<span class="sourceLineNo">411</span> boolean rightCanGrow = false;<a name="line.411"></a>
+<span class="sourceLineNo">412</span> Map.Entry<Long, BitSetNode> rightEntry = map.ceilingEntry(procId);<a name="line.412"></a>
+<span class="sourceLineNo">413</span> if (rightEntry != null) {<a name="line.413"></a>
+<span class="sourceLineNo">414</span> rightNode = rightEntry.getValue();<a name="line.414"></a>
+<span class="sourceLineNo">415</span> rightCanGrow = rightNode.canGrow(procId);<a name="line.415"></a>
+<span class="sourceLineNo">416</span> if (leftNode != null) {<a name="line.416"></a>
+<span class="sourceLineNo">417</span> if (leftNode.canMerge(rightNode)) {<a name="line.417"></a>
+<span class="sourceLineNo">418</span> // merge left and right node<a name="line.418"></a>
+<span class="sourceLineNo">419</span> return mergeNodes(leftNode, rightNode);<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>
+<span class="sourceLineNo">422</span> // If left and right nodes can not merge, decide which one to grow.<a name="line.422"></a>
+<span class="sourceLineNo">423</span> if (leftCanGrow && rightCanGrow) {<a name="line.423"></a>
+<span class="sourceLineNo">424</span> if ((procId - leftNode.getEnd()) <= (rightNode.getStart() - procId)) {<a name="line.424"></a>
+<span class="sourceLineNo">425</span> return growNode(leftNode, procId);<a name="line.425"></a>
+<span class="sourceLineNo">426</span> }<a name="line.426"></a>
+<span class="sourceLineNo">427</span> return growNode(rightNode, procId);<a name="line.427"></a>
+<span class="sourceLineNo">428</span> }<a name="line.428"></a>
+<span class="sourceLineNo">429</span> }<a name="line.429"></a>
+<span class="sourceLineNo">430</span> }<a name="line.430"></a>
+<span class="sourceLineNo">431</span><a name="line.431"></a>
+<span class="sourceLineNo">432</span> // grow the left node<a name="line.432"></a>
+<span class="sourceLineNo">433</span> if (leftCanGrow) {<a name="line.433"></a>
+<span class="sourceLineNo">434</span> return growNode(leftNode, procId);<a name="line.434"></a>
+<span class="sourceLineNo">435</span> }<a name="line.435"></a>
+<span class="sourceLineNo">436</span><a name="line.436"></a>
+<span class="sourceLineNo">437</span> // grow the right node<a name="line.437"></a>
+<span class="sourceLineNo">438</span> if (rightCanGrow) {<a name="line.438"></a>
+<span class="sourceLineNo">439</span> return growNode(rightNode, procId);<a name="line.439"></a>
<span class="sourceLineNo">440</span> }<a name="line.440"></a>
-<span class="sourceLineNo">441</span> }<a name="line.441"></a>
-<span class="sourceLineNo">442</span><a name="line.442"></a>
-<span class="sourceLineNo">443</span> // ========================================================================<a name="line.443"></a>
-<span class="sourceLineNo">444</span> // Convert to/from Protocol Buffer.<a name="line.444"></a>
-<span class="sourceLineNo">445</span> // ========================================================================<a name="line.445"></a>
-<span class="sourceLineNo">446</span><a name="line.446"></a>
-<span class="sourceLineNo">447</span> /**<a name="line.447"></a>
-<span class="sourceLineNo">448</span> * Builds<a name="line.448"></a>
-<span class="sourceLineNo">449</span> * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker<a name="line.449"></a>
-<span class="sourceLineNo">450</span> * protocol buffer from current state.<a name="line.450"></a>
+<span class="sourceLineNo">441</span><a name="line.441"></a>
+<span class="sourceLineNo">442</span> // add new node if there are no left/right nodes which can be used.<a name="line.442"></a>
+<span class="sourceLineNo">443</span> BitSetNode node = new BitSetNode(procId, partial);<a name="line.443"></a>
+<span class="sourceLineNo">444</span> map.put(node.getStart(), node);<a name="line.444"></a>
+<span class="sourceLineNo">445</span> return node;<a name="line.445"></a>
+<span class="sourceLineNo">446</span> }<a name="line.446"></a>
+<span class="sourceLineNo">447</span><a name="line.447"></a>
+<span class="sourceLineNo">448</span> /**<a name="line.448"></a>
+<span class="sourceLineNo">449</span> * Grows {@code node} to contain {@code procId} and updates the map.<a name="line.449"></a>
+<span class="sourceLineNo">450</span> * @return {@link BitSetNode} instance which contains {@code procId}.<a name="line.450"></a>
<span class="sourceLineNo">451</span> */<a name="line.451"></a>
-<span class="sourceLineNo">452</span> public ProcedureProtos.ProcedureStoreTracker toProto() throws IOException {<a name="line.452"></a>
-<span class="sourceLineNo">453</span> ProcedureProtos.ProcedureStoreTracker.Builder builder =<a name="line.453"></a>
-<span class="sourceLineNo">454</span> ProcedureProtos.ProcedureStoreTracker.newBuilder();<a name="line.454"></a>
-<span class="sourceLineNo">455</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.455"></a>
-<span class="sourceLineNo">456</span> builder.addNode(entry.getValue().convert());<a name="line.456"></a>
-<span class="sourceLineNo">457</span> }<a name="line.457"></a>
-<span class="sourceLineNo">458</span> return builder.build();<a name="line.458"></a>
-<span class="sourceLineNo">459</span> }<a name="line.459"></a>
-<span class="sourceLineNo">460</span>}<a name="line.460"></a>
+<span class="sourceLineNo">452</span> private BitSetNode growNode(BitSetNode node, long procId) {<a name="line.452"></a>
+<span class="sourceLineNo">453</span> map.remove(node.getStart());<a name="line.453"></a>
+<span class="sourceLineNo">454</span> node.grow(procId);<a name="line.454"></a>
+<span class="sourceLineNo">455</span> map.put(node.getStart(), node);<a name="line.455"></a>
+<span class="sourceLineNo">456</span> return node;<a name="line.456"></a>
+<span class="sourceLineNo">457</span> }<a name="line.457"></a>
+<span class="sourceLineNo">458</span><a name="line.458"></a>
+<span class="sourceLineNo">459</span> /**<a name="line.459"></a>
+<span class="sourceLineNo">460</span> * Merges {@code leftNode} & {@code rightNode} and updates the map.<a name="line.460"></a>
+<span class="sourceLineNo">461</span> */<a name="line.461"></a>
+<span class="sourceLineNo">462</span> private BitSetNode mergeNodes(BitSetNode leftNode, BitSetNode rightNode) {<a name="line.462"></a>
+<span class="sourceLineNo">463</span> assert leftNode.getStart() < rightNode.getStart();<a name="line.463"></a>
+<span class="sourceLineNo">464</span> leftNode.merge(rightNode);<a name="line.464"></a>
+<span class="sourceLineNo">465</span> map.remove(rightNode.getStart());<a name="line.465"></a>
+<span class="sourceLineNo">466</span> return leftNode;<a name="line.466"></a>
+<span class="sourceLineNo">467</span> }<a name="line.467"></a>
+<span class="sourceLineNo">468</span><a name="line.468"></a>
+<span class="sourceLineNo">469</span> public void dump() {<a name="line.469"></a>
+<span class="sourceLineNo">470</span> System.out.println("map " + map.size());<a name="line.470"></a>
+<span class="sourceLineNo">471</span> System.out.println("isAllModified " + isAllModified());<a name="line.471"></a>
+<span class="sourceLineNo">472</span> System.out.println("isEmpty " + isEmpty());<a name="line.472"></a>
+<span class="sourceLineNo">473</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.473"></a>
+<span class="sourceLineNo">474</span> entry.getValue().dump();<a name="line.474"></a>
+<span class="sourceLineNo">475</span> }<a name="line.475"></a>
+<span class="sourceLineNo">476</span> }<a name="line.476"></a>
+<span class="sourceLineNo">477</span><a name="line.477"></a>
+<span class="sourceLineNo">478</span> // ========================================================================<a name="line.478"></a>
+<span class="sourceLineNo">479</span> // Convert to/from Protocol Buffer.<a name="line.479"></a>
+<span class="sourceLineNo">480</span> // ========================================================================<a name="line.480"></a>
+<span class="sourceLineNo">481</span><a name="line.481"></a>
+<span class="sourceLineNo">482</span> /**<a name="line.482"></a>
+<span class="sourceLineNo">483</span> * Builds<a name="line.483"></a>
+<span class="sourceLineNo">484</span> * org.apache.hadoop.hbase.protobuf.generated.ProcedureProtos.ProcedureStoreTracker<a name="line.484"></a>
+<span class="sourceLineNo">485</span> * protocol buffer from current state.<a name="line.485"></a>
+<span class="sourceLineNo">486</span> */<a name="line.486"></a>
+<span class="sourceLineNo">487</span> public ProcedureProtos.ProcedureStoreTracker toProto() throws IOException {<a name="line.487"></a>
+<span class="sourceLineNo">488</span> ProcedureProtos.ProcedureStoreTracker.Builder builder =<a name="line.488"></a>
+<span class="sourceLineNo">489</span> ProcedureProtos.ProcedureStoreTracker.newBuilder();<a name="line.489"></a>
+<span class="sourceLineNo">490</span> for (Map.Entry<Long, BitSetNode> entry : map.entrySet()) {<a name="line.490"></a>
+<span class="sourceLineNo">491</span> builder.addNode(entry.getValue().convert());<a name="line.491"></a>
+<span class="sourceLineNo">492</span> }<a name="line.492"></a>
+<span class="sourceLineNo">493</span> return builder.build();<a name="line.493"></a>
+<span class="sourceLineNo">494</span> }<a name="line.494"></a>
+<span class="sourceLineNo">495</span>}<a name="line.495"></a>