| <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> |
| <html lang="en"> |
| <head> |
| <title>Source code</title> |
| <link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style"> |
| </head> |
| <body> |
| <div class="sourceContainer"> |
| <pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a> |
| <span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a> |
| <span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a> |
| <span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a> |
| <span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a> |
| <span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a> |
| <span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a> |
| <span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a> |
| <span class="sourceLineNo">009</span> *<a name="line.9"></a> |
| <span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a> |
| <span class="sourceLineNo">011</span> *<a name="line.11"></a> |
| <span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a> |
| <span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a> |
| <span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a> |
| <span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a> |
| <span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a> |
| <span class="sourceLineNo">017</span> */<a name="line.17"></a> |
| <span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.regionserver.wal;<a name="line.18"></a> |
| <span class="sourceLineNo">019</span><a name="line.19"></a> |
| <span class="sourceLineNo">020</span>import static org.apache.hadoop.hbase.util.ConcurrentMapUtils.computeIfAbsent;<a name="line.20"></a> |
| <span class="sourceLineNo">021</span><a name="line.21"></a> |
| <span class="sourceLineNo">022</span>import java.util.ArrayList;<a name="line.22"></a> |
| <span class="sourceLineNo">023</span>import java.util.Collection;<a name="line.23"></a> |
| <span class="sourceLineNo">024</span>import java.util.Collections;<a name="line.24"></a> |
| <span class="sourceLineNo">025</span>import java.util.HashMap;<a name="line.25"></a> |
| <span class="sourceLineNo">026</span>import java.util.List;<a name="line.26"></a> |
| <span class="sourceLineNo">027</span>import java.util.Map;<a name="line.27"></a> |
| <span class="sourceLineNo">028</span>import java.util.Set;<a name="line.28"></a> |
| <span class="sourceLineNo">029</span>import java.util.TreeMap;<a name="line.29"></a> |
| <span class="sourceLineNo">030</span>import java.util.concurrent.ConcurrentHashMap;<a name="line.30"></a> |
| <span class="sourceLineNo">031</span>import java.util.concurrent.ConcurrentMap;<a name="line.31"></a> |
| <span class="sourceLineNo">032</span>import java.util.stream.Collectors;<a name="line.32"></a> |
| <span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.HConstants;<a name="line.33"></a> |
| <span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.34"></a> |
| <span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.util.ImmutableByteArray;<a name="line.35"></a> |
| <span class="sourceLineNo">036</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.36"></a> |
| <span class="sourceLineNo">037</span>import org.slf4j.Logger;<a name="line.37"></a> |
| <span class="sourceLineNo">038</span>import org.slf4j.LoggerFactory;<a name="line.38"></a> |
| <span class="sourceLineNo">039</span><a name="line.39"></a> |
| <span class="sourceLineNo">040</span>/**<a name="line.40"></a> |
| <span class="sourceLineNo">041</span> * Accounting of sequence ids per region and then by column family. So we can keep our accounting<a name="line.41"></a> |
| <span class="sourceLineNo">042</span> * current, call startCacheFlush and then finishedCacheFlush or abortCacheFlush so this instance can<a name="line.42"></a> |
| <span class="sourceLineNo">043</span> * keep abreast of the state of sequence id persistence. Also call update per append.<a name="line.43"></a> |
| <span class="sourceLineNo">044</span> * <p><a name="line.44"></a> |
| <span class="sourceLineNo">045</span> * For the implementation, we assume that all the {@code encodedRegionName} passed in are gotten by<a name="line.45"></a> |
| <span class="sourceLineNo">046</span> * {@link org.apache.hadoop.hbase.client.RegionInfo#getEncodedNameAsBytes()}. So it is safe to use<a name="line.46"></a> |
| <span class="sourceLineNo">047</span> * it as a hash key. And for family name, we use {@link ImmutableByteArray} as key. This is because<a name="line.47"></a> |
| <span class="sourceLineNo">048</span> * hash based map is much faster than RBTree or CSLM and here we are on the critical write path. See<a name="line.48"></a> |
| <span class="sourceLineNo">049</span> * HBASE-16278 for more details.<a name="line.49"></a> |
| <span class="sourceLineNo">050</span> * </p><a name="line.50"></a> |
| <span class="sourceLineNo">051</span> */<a name="line.51"></a> |
| <span class="sourceLineNo">052</span>@InterfaceAudience.Private<a name="line.52"></a> |
| <span class="sourceLineNo">053</span>class SequenceIdAccounting {<a name="line.53"></a> |
| <span class="sourceLineNo">054</span> private static final Logger LOG = LoggerFactory.getLogger(SequenceIdAccounting.class);<a name="line.54"></a> |
| <span class="sourceLineNo">055</span><a name="line.55"></a> |
| <span class="sourceLineNo">056</span> /**<a name="line.56"></a> |
| <span class="sourceLineNo">057</span> * This lock ties all operations on {@link SequenceIdAccounting#flushingSequenceIds} and<a name="line.57"></a> |
| <span class="sourceLineNo">058</span> * {@link #lowestUnflushedSequenceIds} Maps. {@link #lowestUnflushedSequenceIds} has the<a name="line.58"></a> |
| <span class="sourceLineNo">059</span> * lowest outstanding sequence ids EXCEPT when flushing. When we flush, the current<a name="line.59"></a> |
| <span class="sourceLineNo">060</span> * lowest set for the region/column family are moved (atomically because of this lock) to<a name="line.60"></a> |
| <span class="sourceLineNo">061</span> * {@link #flushingSequenceIds}.<a name="line.61"></a> |
| <span class="sourceLineNo">062</span> * <a name="line.62"></a> |
| <span class="sourceLineNo">063</span> * <p>The two Maps are tied by this locking object EXCEPT when we go to update the lowest<a name="line.63"></a> |
| <span class="sourceLineNo">064</span> * entry; see {@link #lowestUnflushedSequenceIds}. In here is a putIfAbsent call on<a name="line.64"></a> |
| <span class="sourceLineNo">065</span> * {@link #lowestUnflushedSequenceIds}. In this latter case, we will add this lowest<a name="line.65"></a> |
| <span class="sourceLineNo">066</span> * sequence id if we find that there is no entry for the current column family. There will be no<a name="line.66"></a> |
| <span class="sourceLineNo">067</span> * entry only if we just came up OR we have moved aside current set of lowest sequence ids<a name="line.67"></a> |
| <span class="sourceLineNo">068</span> * because the current set are being flushed (by putting them into {@link #flushingSequenceIds}).<a name="line.68"></a> |
| <span class="sourceLineNo">069</span> * This is how we pick up the next 'lowest' sequence id per region per column family to be used<a name="line.69"></a> |
| <span class="sourceLineNo">070</span> * figuring what is in the next flush.<a name="line.70"></a> |
| <span class="sourceLineNo">071</span> */<a name="line.71"></a> |
| <span class="sourceLineNo">072</span> private final Object tieLock = new Object();<a name="line.72"></a> |
| <span class="sourceLineNo">073</span><a name="line.73"></a> |
| <span class="sourceLineNo">074</span> /**<a name="line.74"></a> |
| <span class="sourceLineNo">075</span> * Map of encoded region names and family names to their OLDEST -- i.e. their first,<a name="line.75"></a> |
| <span class="sourceLineNo">076</span> * the longest-lived, their 'earliest', the 'lowest' -- sequence id.<a name="line.76"></a> |
| <span class="sourceLineNo">077</span> *<a name="line.77"></a> |
| <span class="sourceLineNo">078</span> * <p>When we flush, the current lowest sequence ids get cleared and added to<a name="line.78"></a> |
| <span class="sourceLineNo">079</span> * {@link #flushingSequenceIds}. The next append that comes in, is then added<a name="line.79"></a> |
| <span class="sourceLineNo">080</span> * here to {@link #lowestUnflushedSequenceIds} as the next lowest sequenceid.<a name="line.80"></a> |
| <span class="sourceLineNo">081</span> *<a name="line.81"></a> |
| <span class="sourceLineNo">082</span> * <p>If flush fails, currently server is aborted so no need to restore previous sequence ids.<a name="line.82"></a> |
| <span class="sourceLineNo">083</span> * <p>Needs to be concurrent Maps because we use putIfAbsent updating oldest.<a name="line.83"></a> |
| <span class="sourceLineNo">084</span> */<a name="line.84"></a> |
| <span class="sourceLineNo">085</span> private final ConcurrentMap<byte[], ConcurrentMap<ImmutableByteArray, Long>><a name="line.85"></a> |
| <span class="sourceLineNo">086</span> lowestUnflushedSequenceIds = new ConcurrentHashMap<>();<a name="line.86"></a> |
| <span class="sourceLineNo">087</span><a name="line.87"></a> |
| <span class="sourceLineNo">088</span> /**<a name="line.88"></a> |
| <span class="sourceLineNo">089</span> * Map of encoded region names and family names to their lowest or OLDEST sequence/edit id<a name="line.89"></a> |
| <span class="sourceLineNo">090</span> * currently being flushed out to hfiles. Entries are moved here from<a name="line.90"></a> |
| <span class="sourceLineNo">091</span> * {@link #lowestUnflushedSequenceIds} while the lock {@link #tieLock} is held<a name="line.91"></a> |
| <span class="sourceLineNo">092</span> * (so movement between the Maps is atomic).<a name="line.92"></a> |
| <span class="sourceLineNo">093</span> */<a name="line.93"></a> |
| <span class="sourceLineNo">094</span> private final Map<byte[], Map<ImmutableByteArray, Long>> flushingSequenceIds = new HashMap<>();<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> * <p><a name="line.97"></a> |
| <span class="sourceLineNo">098</span> * Map of region encoded names to the latest/highest region sequence id. Updated on each call to<a name="line.98"></a> |
| <span class="sourceLineNo">099</span> * append.<a name="line.99"></a> |
| <span class="sourceLineNo">100</span> * </p><a name="line.100"></a> |
| <span class="sourceLineNo">101</span> * <p><a name="line.101"></a> |
| <span class="sourceLineNo">102</span> * This map uses byte[] as the key, and uses reference equality. It works in our use case as we<a name="line.102"></a> |
| <span class="sourceLineNo">103</span> * use {@link org.apache.hadoop.hbase.client.RegionInfo#getEncodedNameAsBytes()} as keys. For a<a name="line.103"></a> |
| <span class="sourceLineNo">104</span> * given region, it always returns the same array.<a name="line.104"></a> |
| <span class="sourceLineNo">105</span> * </p><a name="line.105"></a> |
| <span class="sourceLineNo">106</span> */<a name="line.106"></a> |
| <span class="sourceLineNo">107</span> private Map<byte[], Long> highestSequenceIds = new HashMap<>();<a name="line.107"></a> |
| <span class="sourceLineNo">108</span><a name="line.108"></a> |
| <span class="sourceLineNo">109</span> /**<a name="line.109"></a> |
| <span class="sourceLineNo">110</span> * Returns the lowest unflushed sequence id for the region.<a name="line.110"></a> |
| <span class="sourceLineNo">111</span> * @return Lowest outstanding unflushed sequenceid for <code>encodedRegionName</code>. Will<a name="line.111"></a> |
| <span class="sourceLineNo">112</span> * return {@link HConstants#NO_SEQNUM} when none.<a name="line.112"></a> |
| <span class="sourceLineNo">113</span> */<a name="line.113"></a> |
| <span class="sourceLineNo">114</span> long getLowestSequenceId(final byte[] encodedRegionName) {<a name="line.114"></a> |
| <span class="sourceLineNo">115</span> synchronized (this.tieLock) {<a name="line.115"></a> |
| <span class="sourceLineNo">116</span> Map<?, Long> m = this.flushingSequenceIds.get(encodedRegionName);<a name="line.116"></a> |
| <span class="sourceLineNo">117</span> long flushingLowest = m != null ? getLowestSequenceId(m) : Long.MAX_VALUE;<a name="line.117"></a> |
| <span class="sourceLineNo">118</span> m = this.lowestUnflushedSequenceIds.get(encodedRegionName);<a name="line.118"></a> |
| <span class="sourceLineNo">119</span> long unflushedLowest = m != null ? getLowestSequenceId(m) : HConstants.NO_SEQNUM;<a name="line.119"></a> |
| <span class="sourceLineNo">120</span> return Math.min(flushingLowest, unflushedLowest);<a name="line.120"></a> |
| <span class="sourceLineNo">121</span> }<a name="line.121"></a> |
| <span class="sourceLineNo">122</span> }<a name="line.122"></a> |
| <span class="sourceLineNo">123</span><a name="line.123"></a> |
| <span class="sourceLineNo">124</span> /**<a name="line.124"></a> |
| <span class="sourceLineNo">125</span> * @return Lowest outstanding unflushed sequenceid for <code>encodedRegionname</code> and<a name="line.125"></a> |
| <span class="sourceLineNo">126</span> * <code>familyName</code>. Returned sequenceid may be for an edit currently being<a name="line.126"></a> |
| <span class="sourceLineNo">127</span> * flushed.<a name="line.127"></a> |
| <span class="sourceLineNo">128</span> */<a name="line.128"></a> |
| <span class="sourceLineNo">129</span> long getLowestSequenceId(final byte[] encodedRegionName, final byte[] familyName) {<a name="line.129"></a> |
| <span class="sourceLineNo">130</span> ImmutableByteArray familyNameWrapper = ImmutableByteArray.wrap(familyName);<a name="line.130"></a> |
| <span class="sourceLineNo">131</span> synchronized (this.tieLock) {<a name="line.131"></a> |
| <span class="sourceLineNo">132</span> Map<ImmutableByteArray, Long> m = this.flushingSequenceIds.get(encodedRegionName);<a name="line.132"></a> |
| <span class="sourceLineNo">133</span> if (m != null) {<a name="line.133"></a> |
| <span class="sourceLineNo">134</span> Long lowest = m.get(familyNameWrapper);<a name="line.134"></a> |
| <span class="sourceLineNo">135</span> if (lowest != null) {<a name="line.135"></a> |
| <span class="sourceLineNo">136</span> return lowest;<a name="line.136"></a> |
| <span class="sourceLineNo">137</span> }<a name="line.137"></a> |
| <span class="sourceLineNo">138</span> }<a name="line.138"></a> |
| <span class="sourceLineNo">139</span> m = this.lowestUnflushedSequenceIds.get(encodedRegionName);<a name="line.139"></a> |
| <span class="sourceLineNo">140</span> if (m != null) {<a name="line.140"></a> |
| <span class="sourceLineNo">141</span> Long lowest = m.get(familyNameWrapper);<a name="line.141"></a> |
| <span class="sourceLineNo">142</span> if (lowest != null) {<a name="line.142"></a> |
| <span class="sourceLineNo">143</span> return lowest;<a name="line.143"></a> |
| <span class="sourceLineNo">144</span> }<a name="line.144"></a> |
| <span class="sourceLineNo">145</span> }<a name="line.145"></a> |
| <span class="sourceLineNo">146</span> }<a name="line.146"></a> |
| <span class="sourceLineNo">147</span> return HConstants.NO_SEQNUM;<a name="line.147"></a> |
| <span class="sourceLineNo">148</span> }<a name="line.148"></a> |
| <span class="sourceLineNo">149</span><a name="line.149"></a> |
| <span class="sourceLineNo">150</span> /**<a name="line.150"></a> |
| <span class="sourceLineNo">151</span> * Reset the accounting of highest sequenceid by regionname.<a name="line.151"></a> |
| <span class="sourceLineNo">152</span> * @return Return the previous accounting Map of regions to the last sequence id written into<a name="line.152"></a> |
| <span class="sourceLineNo">153</span> * each.<a name="line.153"></a> |
| <span class="sourceLineNo">154</span> */<a name="line.154"></a> |
| <span class="sourceLineNo">155</span> Map<byte[], Long> resetHighest() {<a name="line.155"></a> |
| <span class="sourceLineNo">156</span> Map<byte[], Long> old = this.highestSequenceIds;<a name="line.156"></a> |
| <span class="sourceLineNo">157</span> this.highestSequenceIds = new HashMap<>();<a name="line.157"></a> |
| <span class="sourceLineNo">158</span> return old;<a name="line.158"></a> |
| <span class="sourceLineNo">159</span> }<a name="line.159"></a> |
| <span class="sourceLineNo">160</span><a name="line.160"></a> |
| <span class="sourceLineNo">161</span> /**<a name="line.161"></a> |
| <span class="sourceLineNo">162</span> * We've been passed a new sequenceid for the region. Set it as highest seen for this region and<a name="line.162"></a> |
| <span class="sourceLineNo">163</span> * if we are to record oldest, or lowest sequenceids, save it as oldest seen if nothing<a name="line.163"></a> |
| <span class="sourceLineNo">164</span> * currently older.<a name="line.164"></a> |
| <span class="sourceLineNo">165</span> * @param encodedRegionName<a name="line.165"></a> |
| <span class="sourceLineNo">166</span> * @param families<a name="line.166"></a> |
| <span class="sourceLineNo">167</span> * @param sequenceid<a name="line.167"></a> |
| <span class="sourceLineNo">168</span> * @param lowest Whether to keep running account of oldest sequence id.<a name="line.168"></a> |
| <span class="sourceLineNo">169</span> */<a name="line.169"></a> |
| <span class="sourceLineNo">170</span> void update(byte[] encodedRegionName, Set<byte[]> families, long sequenceid,<a name="line.170"></a> |
| <span class="sourceLineNo">171</span> final boolean lowest) {<a name="line.171"></a> |
| <span class="sourceLineNo">172</span> Long l = Long.valueOf(sequenceid);<a name="line.172"></a> |
| <span class="sourceLineNo">173</span> this.highestSequenceIds.put(encodedRegionName, l);<a name="line.173"></a> |
| <span class="sourceLineNo">174</span> if (lowest) {<a name="line.174"></a> |
| <span class="sourceLineNo">175</span> ConcurrentMap<ImmutableByteArray, Long> m = getOrCreateLowestSequenceIds(encodedRegionName);<a name="line.175"></a> |
| <span class="sourceLineNo">176</span> for (byte[] familyName : families) {<a name="line.176"></a> |
| <span class="sourceLineNo">177</span> m.putIfAbsent(ImmutableByteArray.wrap(familyName), l);<a name="line.177"></a> |
| <span class="sourceLineNo">178</span> }<a name="line.178"></a> |
| <span class="sourceLineNo">179</span> }<a name="line.179"></a> |
| <span class="sourceLineNo">180</span> }<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> * Clear all the records of the given region as it is going to be closed.<a name="line.183"></a> |
| <span class="sourceLineNo">184</span> * <p/><a name="line.184"></a> |
| <span class="sourceLineNo">185</span> * We will call this once we get the region close marker. We need this because that, if we use<a name="line.185"></a> |
| <span class="sourceLineNo">186</span> * Durability.ASYNC_WAL, after calling startCacheFlush, we may still get some ongoing wal entries<a name="line.186"></a> |
| <span class="sourceLineNo">187</span> * that has not been processed yet, this will lead to orphan records in the<a name="line.187"></a> |
| <span class="sourceLineNo">188</span> * lowestUnflushedSequenceIds and then cause too many WAL files.<a name="line.188"></a> |
| <span class="sourceLineNo">189</span> * <p/><a name="line.189"></a> |
| <span class="sourceLineNo">190</span> * See HBASE-23157 for more details.<a name="line.190"></a> |
| <span class="sourceLineNo">191</span> */<a name="line.191"></a> |
| <span class="sourceLineNo">192</span> void onRegionClose(byte[] encodedRegionName) {<a name="line.192"></a> |
| <span class="sourceLineNo">193</span> synchronized (tieLock) {<a name="line.193"></a> |
| <span class="sourceLineNo">194</span> this.lowestUnflushedSequenceIds.remove(encodedRegionName);<a name="line.194"></a> |
| <span class="sourceLineNo">195</span> Map<ImmutableByteArray, Long> flushing = this.flushingSequenceIds.remove(encodedRegionName);<a name="line.195"></a> |
| <span class="sourceLineNo">196</span> if (flushing != null) {<a name="line.196"></a> |
| <span class="sourceLineNo">197</span> LOG.warn("Still have flushing records when closing {}, {}",<a name="line.197"></a> |
| <span class="sourceLineNo">198</span> Bytes.toString(encodedRegionName),<a name="line.198"></a> |
| <span class="sourceLineNo">199</span> flushing.entrySet().stream().map(e -> e.getKey().toString() + "->" + e.getValue())<a name="line.199"></a> |
| <span class="sourceLineNo">200</span> .collect(Collectors.joining(",", "{", "}")));<a name="line.200"></a> |
| <span class="sourceLineNo">201</span> }<a name="line.201"></a> |
| <span class="sourceLineNo">202</span> }<a name="line.202"></a> |
| <span class="sourceLineNo">203</span> this.highestSequenceIds.remove(encodedRegionName);<a name="line.203"></a> |
| <span class="sourceLineNo">204</span> }<a name="line.204"></a> |
| <span class="sourceLineNo">205</span><a name="line.205"></a> |
| <span class="sourceLineNo">206</span> /**<a name="line.206"></a> |
| <span class="sourceLineNo">207</span> * Update the store sequence id, e.g., upon executing in-memory compaction<a name="line.207"></a> |
| <span class="sourceLineNo">208</span> */<a name="line.208"></a> |
| <span class="sourceLineNo">209</span> void updateStore(byte[] encodedRegionName, byte[] familyName, Long sequenceId,<a name="line.209"></a> |
| <span class="sourceLineNo">210</span> boolean onlyIfGreater) {<a name="line.210"></a> |
| <span class="sourceLineNo">211</span> if (sequenceId == null) {<a name="line.211"></a> |
| <span class="sourceLineNo">212</span> return;<a name="line.212"></a> |
| <span class="sourceLineNo">213</span> }<a name="line.213"></a> |
| <span class="sourceLineNo">214</span> Long highest = this.highestSequenceIds.get(encodedRegionName);<a name="line.214"></a> |
| <span class="sourceLineNo">215</span> if (highest == null || sequenceId > highest) {<a name="line.215"></a> |
| <span class="sourceLineNo">216</span> this.highestSequenceIds.put(encodedRegionName, sequenceId);<a name="line.216"></a> |
| <span class="sourceLineNo">217</span> }<a name="line.217"></a> |
| <span class="sourceLineNo">218</span> ImmutableByteArray familyNameWrapper = ImmutableByteArray.wrap(familyName);<a name="line.218"></a> |
| <span class="sourceLineNo">219</span> synchronized (this.tieLock) {<a name="line.219"></a> |
| <span class="sourceLineNo">220</span> ConcurrentMap<ImmutableByteArray, Long> m = getOrCreateLowestSequenceIds(encodedRegionName);<a name="line.220"></a> |
| <span class="sourceLineNo">221</span> boolean replaced = false;<a name="line.221"></a> |
| <span class="sourceLineNo">222</span> while (!replaced) {<a name="line.222"></a> |
| <span class="sourceLineNo">223</span> Long oldSeqId = m.get(familyNameWrapper);<a name="line.223"></a> |
| <span class="sourceLineNo">224</span> if (oldSeqId == null) {<a name="line.224"></a> |
| <span class="sourceLineNo">225</span> m.put(familyNameWrapper, sequenceId);<a name="line.225"></a> |
| <span class="sourceLineNo">226</span> replaced = true;<a name="line.226"></a> |
| <span class="sourceLineNo">227</span> } else if (onlyIfGreater) {<a name="line.227"></a> |
| <span class="sourceLineNo">228</span> if (sequenceId > oldSeqId) {<a name="line.228"></a> |
| <span class="sourceLineNo">229</span> replaced = m.replace(familyNameWrapper, oldSeqId, sequenceId);<a name="line.229"></a> |
| <span class="sourceLineNo">230</span> } else {<a name="line.230"></a> |
| <span class="sourceLineNo">231</span> return;<a name="line.231"></a> |
| <span class="sourceLineNo">232</span> }<a name="line.232"></a> |
| <span class="sourceLineNo">233</span> } else { // replace even if sequence id is not greater than oldSeqId<a name="line.233"></a> |
| <span class="sourceLineNo">234</span> m.put(familyNameWrapper, sequenceId);<a name="line.234"></a> |
| <span class="sourceLineNo">235</span> return;<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> }<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> ConcurrentMap<ImmutableByteArray, Long> getOrCreateLowestSequenceIds(byte[] encodedRegionName) {<a name="line.241"></a> |
| <span class="sourceLineNo">242</span> // Intentionally, this access is done outside of this.regionSequenceIdLock. Done per append.<a name="line.242"></a> |
| <span class="sourceLineNo">243</span> return computeIfAbsent(this.lowestUnflushedSequenceIds, encodedRegionName,<a name="line.243"></a> |
| <span class="sourceLineNo">244</span> ConcurrentHashMap::new);<a name="line.244"></a> |
| <span class="sourceLineNo">245</span> }<a name="line.245"></a> |
| <span class="sourceLineNo">246</span><a name="line.246"></a> |
| <span class="sourceLineNo">247</span> /**<a name="line.247"></a> |
| <span class="sourceLineNo">248</span> * @param sequenceids Map to search for lowest value.<a name="line.248"></a> |
| <span class="sourceLineNo">249</span> * @return Lowest value found in <code>sequenceids</code>.<a name="line.249"></a> |
| <span class="sourceLineNo">250</span> */<a name="line.250"></a> |
| <span class="sourceLineNo">251</span> private static long getLowestSequenceId(Map<?, Long> sequenceids) {<a name="line.251"></a> |
| <span class="sourceLineNo">252</span> long lowest = HConstants.NO_SEQNUM;<a name="line.252"></a> |
| <span class="sourceLineNo">253</span> for (Map.Entry<? , Long> entry : sequenceids.entrySet()){<a name="line.253"></a> |
| <span class="sourceLineNo">254</span> if (entry.getKey().toString().equals("METAFAMILY")){<a name="line.254"></a> |
| <span class="sourceLineNo">255</span> continue;<a name="line.255"></a> |
| <span class="sourceLineNo">256</span> }<a name="line.256"></a> |
| <span class="sourceLineNo">257</span> Long sid = entry.getValue();<a name="line.257"></a> |
| <span class="sourceLineNo">258</span> if (lowest == HConstants.NO_SEQNUM || sid.longValue() < lowest) {<a name="line.258"></a> |
| <span class="sourceLineNo">259</span> lowest = sid.longValue();<a name="line.259"></a> |
| <span class="sourceLineNo">260</span> }<a name="line.260"></a> |
| <span class="sourceLineNo">261</span> }<a name="line.261"></a> |
| <span class="sourceLineNo">262</span> return lowest;<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> /**<a name="line.265"></a> |
| <span class="sourceLineNo">266</span> * @param src<a name="line.266"></a> |
| <span class="sourceLineNo">267</span> * @return New Map that has same keys as <code>src</code> but instead of a Map for a value, it<a name="line.267"></a> |
| <span class="sourceLineNo">268</span> * instead has found the smallest sequence id and it returns that as the value instead.<a name="line.268"></a> |
| <span class="sourceLineNo">269</span> */<a name="line.269"></a> |
| <span class="sourceLineNo">270</span> private <T extends Map<?, Long>> Map<byte[], Long> flattenToLowestSequenceId(Map<byte[], T> src) {<a name="line.270"></a> |
| <span class="sourceLineNo">271</span> if (src == null || src.isEmpty()) {<a name="line.271"></a> |
| <span class="sourceLineNo">272</span> return null;<a name="line.272"></a> |
| <span class="sourceLineNo">273</span> }<a name="line.273"></a> |
| <span class="sourceLineNo">274</span> Map<byte[], Long> tgt = new HashMap<>();<a name="line.274"></a> |
| <span class="sourceLineNo">275</span> for (Map.Entry<byte[], T> entry : src.entrySet()) {<a name="line.275"></a> |
| <span class="sourceLineNo">276</span> long lowestSeqId = getLowestSequenceId(entry.getValue());<a name="line.276"></a> |
| <span class="sourceLineNo">277</span> if (lowestSeqId != HConstants.NO_SEQNUM) {<a name="line.277"></a> |
| <span class="sourceLineNo">278</span> tgt.put(entry.getKey(), lowestSeqId);<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> return tgt;<a name="line.281"></a> |
| <span class="sourceLineNo">282</span> }<a name="line.282"></a> |
| <span class="sourceLineNo">283</span><a name="line.283"></a> |
| <span class="sourceLineNo">284</span> /**<a name="line.284"></a> |
| <span class="sourceLineNo">285</span> * @param encodedRegionName Region to flush.<a name="line.285"></a> |
| <span class="sourceLineNo">286</span> * @param families Families to flush. May be a subset of all families in the region.<a name="line.286"></a> |
| <span class="sourceLineNo">287</span> * @return Returns {@link HConstants#NO_SEQNUM} if we are flushing the whole region OR if<a name="line.287"></a> |
| <span class="sourceLineNo">288</span> * we are flushing a subset of all families but there are no edits in those families not<a name="line.288"></a> |
| <span class="sourceLineNo">289</span> * being flushed; in other words, this is effectively same as a flush of all of the region<a name="line.289"></a> |
| <span class="sourceLineNo">290</span> * though we were passed a subset of regions. Otherwise, it returns the sequence id of the<a name="line.290"></a> |
| <span class="sourceLineNo">291</span> * oldest/lowest outstanding edit.<a name="line.291"></a> |
| <span class="sourceLineNo">292</span> */<a name="line.292"></a> |
| <span class="sourceLineNo">293</span> Long startCacheFlush(final byte[] encodedRegionName, final Set<byte[]> families) {<a name="line.293"></a> |
| <span class="sourceLineNo">294</span> Map<byte[],Long> familytoSeq = new HashMap<>();<a name="line.294"></a> |
| <span class="sourceLineNo">295</span> for (byte[] familyName : families){<a name="line.295"></a> |
| <span class="sourceLineNo">296</span> familytoSeq.put(familyName,HConstants.NO_SEQNUM);<a name="line.296"></a> |
| <span class="sourceLineNo">297</span> }<a name="line.297"></a> |
| <span class="sourceLineNo">298</span> return startCacheFlush(encodedRegionName,familytoSeq);<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> Long startCacheFlush(final byte[] encodedRegionName, final Map<byte[], Long> familyToSeq) {<a name="line.301"></a> |
| <span class="sourceLineNo">302</span> Map<ImmutableByteArray, Long> oldSequenceIds = null;<a name="line.302"></a> |
| <span class="sourceLineNo">303</span> Long lowestUnflushedInRegion = HConstants.NO_SEQNUM;<a name="line.303"></a> |
| <span class="sourceLineNo">304</span> synchronized (tieLock) {<a name="line.304"></a> |
| <span class="sourceLineNo">305</span> Map<ImmutableByteArray, Long> m = this.lowestUnflushedSequenceIds.get(encodedRegionName);<a name="line.305"></a> |
| <span class="sourceLineNo">306</span> if (m != null) {<a name="line.306"></a> |
| <span class="sourceLineNo">307</span> // NOTE: Removal from this.lowestUnflushedSequenceIds must be done in controlled<a name="line.307"></a> |
| <span class="sourceLineNo">308</span> // circumstance because another concurrent thread now may add sequenceids for this family<a name="line.308"></a> |
| <span class="sourceLineNo">309</span> // (see above in getOrCreateLowestSequenceId). Make sure you are ok with this. Usually it<a name="line.309"></a> |
| <span class="sourceLineNo">310</span> // is fine because updates are blocked when this method is called. Make sure!!!<a name="line.310"></a> |
| <span class="sourceLineNo">311</span> for (Map.Entry<byte[], Long> entry : familyToSeq.entrySet()) {<a name="line.311"></a> |
| <span class="sourceLineNo">312</span> ImmutableByteArray familyNameWrapper = ImmutableByteArray.wrap((byte[]) entry.getKey());<a name="line.312"></a> |
| <span class="sourceLineNo">313</span> Long seqId = null;<a name="line.313"></a> |
| <span class="sourceLineNo">314</span> if(entry.getValue() == HConstants.NO_SEQNUM) {<a name="line.314"></a> |
| <span class="sourceLineNo">315</span> seqId = m.remove(familyNameWrapper);<a name="line.315"></a> |
| <span class="sourceLineNo">316</span> } else {<a name="line.316"></a> |
| <span class="sourceLineNo">317</span> seqId = m.replace(familyNameWrapper, entry.getValue());<a name="line.317"></a> |
| <span class="sourceLineNo">318</span> }<a name="line.318"></a> |
| <span class="sourceLineNo">319</span> if (seqId != null) {<a name="line.319"></a> |
| <span class="sourceLineNo">320</span> if (oldSequenceIds == null) {<a name="line.320"></a> |
| <span class="sourceLineNo">321</span> oldSequenceIds = new HashMap<>();<a name="line.321"></a> |
| <span class="sourceLineNo">322</span> }<a name="line.322"></a> |
| <span class="sourceLineNo">323</span> oldSequenceIds.put(familyNameWrapper, seqId);<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> if (oldSequenceIds != null && !oldSequenceIds.isEmpty()) {<a name="line.326"></a> |
| <span class="sourceLineNo">327</span> if (this.flushingSequenceIds.put(encodedRegionName, oldSequenceIds) != null) {<a name="line.327"></a> |
| <span class="sourceLineNo">328</span> LOG.warn("Flushing Map not cleaned up for " + Bytes.toString(encodedRegionName) +<a name="line.328"></a> |
| <span class="sourceLineNo">329</span> ", sequenceid=" + oldSequenceIds);<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> if (m.isEmpty()) {<a name="line.332"></a> |
| <span class="sourceLineNo">333</span> // Remove it otherwise it will be in oldestUnflushedStoreSequenceIds for ever<a name="line.333"></a> |
| <span class="sourceLineNo">334</span> // even if the region is already moved to other server.<a name="line.334"></a> |
| <span class="sourceLineNo">335</span> // Do not worry about data racing, we held write lock of region when calling<a name="line.335"></a> |
| <span class="sourceLineNo">336</span> // startCacheFlush, so no one can add value to the map we removed.<a name="line.336"></a> |
| <span class="sourceLineNo">337</span> this.lowestUnflushedSequenceIds.remove(encodedRegionName);<a name="line.337"></a> |
| <span class="sourceLineNo">338</span> } else {<a name="line.338"></a> |
| <span class="sourceLineNo">339</span> // Flushing a subset of the region families. Return the sequence id of the oldest entry.<a name="line.339"></a> |
| <span class="sourceLineNo">340</span> lowestUnflushedInRegion = Collections.min(m.values());<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> // Do this check outside lock.<a name="line.344"></a> |
| <span class="sourceLineNo">345</span> if (oldSequenceIds != null && oldSequenceIds.isEmpty()) {<a name="line.345"></a> |
| <span class="sourceLineNo">346</span> // TODO: if we have no oldStoreSeqNum, and WAL is not disabled, presumably either<a name="line.346"></a> |
| <span class="sourceLineNo">347</span> // the region is already flushing (which would make this call invalid), or there<a name="line.347"></a> |
| <span class="sourceLineNo">348</span> // were no appends after last flush, so why are we starting flush? Maybe we should<a name="line.348"></a> |
| <span class="sourceLineNo">349</span> // assert not empty. Less rigorous, but safer, alternative is telling the caller to stop.<a name="line.349"></a> |
| <span class="sourceLineNo">350</span> // For now preserve old logic.<a name="line.350"></a> |
| <span class="sourceLineNo">351</span> LOG.warn("Couldn't find oldest sequenceid for " + Bytes.toString(encodedRegionName));<a name="line.351"></a> |
| <span class="sourceLineNo">352</span> }<a name="line.352"></a> |
| <span class="sourceLineNo">353</span> return lowestUnflushedInRegion;<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> void completeCacheFlush(byte[] encodedRegionName, long maxFlushedSeqId) {<a name="line.356"></a> |
| <span class="sourceLineNo">357</span> // This is a simple hack to avoid maxFlushedSeqId go backwards.<a name="line.357"></a> |
| <span class="sourceLineNo">358</span> // The system works fine normally, but if we make use of Durability.ASYNC_WAL and we are going<a name="line.358"></a> |
| <span class="sourceLineNo">359</span> // to flush all the stores, the maxFlushedSeqId will be next seq id of the region, but we may<a name="line.359"></a> |
| <span class="sourceLineNo">360</span> // still have some unsynced WAL entries in the ringbuffer after we call startCacheFlush, and<a name="line.360"></a> |
| <span class="sourceLineNo">361</span> // then it will be recorded as the lowestUnflushedSeqId by the above update method, which is<a name="line.361"></a> |
| <span class="sourceLineNo">362</span> // less than the current maxFlushedSeqId. And if next time we only flush the family with this<a name="line.362"></a> |
| <span class="sourceLineNo">363</span> // unusual lowestUnflushedSeqId, the maxFlushedSeqId will go backwards.<a name="line.363"></a> |
| <span class="sourceLineNo">364</span> // This is an unexpected behavior so we should fix it, otherwise it may cause unexpected<a name="line.364"></a> |
| <span class="sourceLineNo">365</span> // behavior in other area.<a name="line.365"></a> |
| <span class="sourceLineNo">366</span> // The solution here is a bit hack but fine. Just replace the lowestUnflushedSeqId with<a name="line.366"></a> |
| <span class="sourceLineNo">367</span> // maxFlushedSeqId + 1 if it is lesser. The meaning of maxFlushedSeqId is that, all edits less<a name="line.367"></a> |
| <span class="sourceLineNo">368</span> // than or equal to it have been flushed, i.e, persistent to HFile, so set<a name="line.368"></a> |
| <span class="sourceLineNo">369</span> // lowestUnflushedSequenceId to maxFlushedSeqId + 1 will not cause data loss.<a name="line.369"></a> |
| <span class="sourceLineNo">370</span> // And technically, using +1 is fine here. If the maxFlushesSeqId is just the flushOpSeqId, it<a name="line.370"></a> |
| <span class="sourceLineNo">371</span> // means we have flushed all the stores so the seq id for actual data should be at least plus 1.<a name="line.371"></a> |
| <span class="sourceLineNo">372</span> // And if we do not flush all the stores, then the maxFlushedSeqId is calculated by<a name="line.372"></a> |
| <span class="sourceLineNo">373</span> // lowestUnflushedSeqId - 1, so here let's plus the 1 back.<a name="line.373"></a> |
| <span class="sourceLineNo">374</span> Long wrappedSeqId = Long.valueOf(maxFlushedSeqId + 1);<a name="line.374"></a> |
| <span class="sourceLineNo">375</span> synchronized (tieLock) {<a name="line.375"></a> |
| <span class="sourceLineNo">376</span> this.flushingSequenceIds.remove(encodedRegionName);<a name="line.376"></a> |
| <span class="sourceLineNo">377</span> Map<ImmutableByteArray, Long> unflushed = lowestUnflushedSequenceIds.get(encodedRegionName);<a name="line.377"></a> |
| <span class="sourceLineNo">378</span> if (unflushed == null) {<a name="line.378"></a> |
| <span class="sourceLineNo">379</span> return;<a name="line.379"></a> |
| <span class="sourceLineNo">380</span> }<a name="line.380"></a> |
| <span class="sourceLineNo">381</span> for (Map.Entry<ImmutableByteArray, Long> e : unflushed.entrySet()) {<a name="line.381"></a> |
| <span class="sourceLineNo">382</span> if (e.getValue().longValue() <= maxFlushedSeqId) {<a name="line.382"></a> |
| <span class="sourceLineNo">383</span> e.setValue(wrappedSeqId);<a name="line.383"></a> |
| <span class="sourceLineNo">384</span> }<a name="line.384"></a> |
| <span class="sourceLineNo">385</span> }<a name="line.385"></a> |
| <span class="sourceLineNo">386</span> }<a name="line.386"></a> |
| <span class="sourceLineNo">387</span> }<a name="line.387"></a> |
| <span class="sourceLineNo">388</span><a name="line.388"></a> |
| <span class="sourceLineNo">389</span> void abortCacheFlush(final byte[] encodedRegionName) {<a name="line.389"></a> |
| <span class="sourceLineNo">390</span> // Method is called when we are crashing down because failed write flush AND it is called<a name="line.390"></a> |
| <span class="sourceLineNo">391</span> // if we fail prepare. The below is for the fail prepare case; we restore the old sequence ids.<a name="line.391"></a> |
| <span class="sourceLineNo">392</span> Map<ImmutableByteArray, Long> flushing = null;<a name="line.392"></a> |
| <span class="sourceLineNo">393</span> Map<ImmutableByteArray, Long> tmpMap = new HashMap<>();<a name="line.393"></a> |
| <span class="sourceLineNo">394</span> // Here we are moving sequenceids from flushing back to unflushed; doing opposite of what<a name="line.394"></a> |
| <span class="sourceLineNo">395</span> // happened in startCacheFlush. During prepare phase, we have update lock on the region so<a name="line.395"></a> |
| <span class="sourceLineNo">396</span> // no edits should be coming in via append.<a name="line.396"></a> |
| <span class="sourceLineNo">397</span> synchronized (tieLock) {<a name="line.397"></a> |
| <span class="sourceLineNo">398</span> flushing = this.flushingSequenceIds.remove(encodedRegionName);<a name="line.398"></a> |
| <span class="sourceLineNo">399</span> if (flushing != null) {<a name="line.399"></a> |
| <span class="sourceLineNo">400</span> Map<ImmutableByteArray, Long> unflushed = getOrCreateLowestSequenceIds(encodedRegionName);<a name="line.400"></a> |
| <span class="sourceLineNo">401</span> for (Map.Entry<ImmutableByteArray, Long> e: flushing.entrySet()) {<a name="line.401"></a> |
| <span class="sourceLineNo">402</span> // Set into unflushed the 'old' oldest sequenceid and if any value in flushed with this<a name="line.402"></a> |
| <span class="sourceLineNo">403</span> // value, it will now be in tmpMap.<a name="line.403"></a> |
| <span class="sourceLineNo">404</span> tmpMap.put(e.getKey(), unflushed.put(e.getKey(), e.getValue()));<a name="line.404"></a> |
| <span class="sourceLineNo">405</span> }<a name="line.405"></a> |
| <span class="sourceLineNo">406</span> }<a name="line.406"></a> |
| <span class="sourceLineNo">407</span> }<a name="line.407"></a> |
| <span class="sourceLineNo">408</span><a name="line.408"></a> |
| <span class="sourceLineNo">409</span> // Here we are doing some 'test' to see if edits are going in out of order. What is it for?<a name="line.409"></a> |
| <span class="sourceLineNo">410</span> // Carried over from old code.<a name="line.410"></a> |
| <span class="sourceLineNo">411</span> if (flushing != null) {<a name="line.411"></a> |
| <span class="sourceLineNo">412</span> for (Map.Entry<ImmutableByteArray, Long> e : flushing.entrySet()) {<a name="line.412"></a> |
| <span class="sourceLineNo">413</span> Long currentId = tmpMap.get(e.getKey());<a name="line.413"></a> |
| <span class="sourceLineNo">414</span> if (currentId != null && currentId.longValue() < e.getValue().longValue()) {<a name="line.414"></a> |
| <span class="sourceLineNo">415</span> String errorStr = Bytes.toString(encodedRegionName) + " family "<a name="line.415"></a> |
| <span class="sourceLineNo">416</span> + e.getKey().toString() + " acquired edits out of order current memstore seq="<a name="line.416"></a> |
| <span class="sourceLineNo">417</span> + currentId + ", previous oldest unflushed id=" + e.getValue();<a name="line.417"></a> |
| <span class="sourceLineNo">418</span> LOG.error(errorStr);<a name="line.418"></a> |
| <span class="sourceLineNo">419</span> Runtime.getRuntime().halt(1);<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> }<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> /**<a name="line.425"></a> |
| <span class="sourceLineNo">426</span> * See if passed <code>sequenceids</code> are lower -- i.e. earlier -- than any outstanding<a name="line.426"></a> |
| <span class="sourceLineNo">427</span> * sequenceids, sequenceids we are holding on to in this accounting instance.<a name="line.427"></a> |
| <span class="sourceLineNo">428</span> * @param sequenceids Keyed by encoded region name. Cannot be null (doesn't make sense for it to<a name="line.428"></a> |
| <span class="sourceLineNo">429</span> * be null).<a name="line.429"></a> |
| <span class="sourceLineNo">430</span> * @param keysBlocking An optional collection that is used to return the specific keys that are<a name="line.430"></a> |
| <span class="sourceLineNo">431</span> * causing this method to return false.<a name="line.431"></a> |
| <span class="sourceLineNo">432</span> * @return true if all sequenceids are lower, older than, the old sequenceids in this instance.<a name="line.432"></a> |
| <span class="sourceLineNo">433</span> */<a name="line.433"></a> |
| <span class="sourceLineNo">434</span> boolean areAllLower(Map<byte[], Long> sequenceids, Collection<byte[]> keysBlocking) {<a name="line.434"></a> |
| <span class="sourceLineNo">435</span> Map<byte[], Long> flushing = null;<a name="line.435"></a> |
| <span class="sourceLineNo">436</span> Map<byte[], Long> unflushed = null;<a name="line.436"></a> |
| <span class="sourceLineNo">437</span> synchronized (this.tieLock) {<a name="line.437"></a> |
| <span class="sourceLineNo">438</span> // Get a flattened -- only the oldest sequenceid -- copy of current flushing and unflushed<a name="line.438"></a> |
| <span class="sourceLineNo">439</span> // data structures to use in tests below.<a name="line.439"></a> |
| <span class="sourceLineNo">440</span> flushing = flattenToLowestSequenceId(this.flushingSequenceIds);<a name="line.440"></a> |
| <span class="sourceLineNo">441</span> unflushed = flattenToLowestSequenceId(this.lowestUnflushedSequenceIds);<a name="line.441"></a> |
| <span class="sourceLineNo">442</span> }<a name="line.442"></a> |
| <span class="sourceLineNo">443</span> boolean result = true;<a name="line.443"></a> |
| <span class="sourceLineNo">444</span> for (Map.Entry<byte[], Long> e : sequenceids.entrySet()) {<a name="line.444"></a> |
| <span class="sourceLineNo">445</span> long oldestFlushing = Long.MAX_VALUE;<a name="line.445"></a> |
| <span class="sourceLineNo">446</span> long oldestUnflushed = Long.MAX_VALUE;<a name="line.446"></a> |
| <span class="sourceLineNo">447</span> if (flushing != null && flushing.containsKey(e.getKey())) {<a name="line.447"></a> |
| <span class="sourceLineNo">448</span> oldestFlushing = flushing.get(e.getKey());<a name="line.448"></a> |
| <span class="sourceLineNo">449</span> }<a name="line.449"></a> |
| <span class="sourceLineNo">450</span> if (unflushed != null && unflushed.containsKey(e.getKey())) {<a name="line.450"></a> |
| <span class="sourceLineNo">451</span> oldestUnflushed = unflushed.get(e.getKey());<a name="line.451"></a> |
| <span class="sourceLineNo">452</span> }<a name="line.452"></a> |
| <span class="sourceLineNo">453</span> long min = Math.min(oldestFlushing, oldestUnflushed);<a name="line.453"></a> |
| <span class="sourceLineNo">454</span> if (min <= e.getValue()) {<a name="line.454"></a> |
| <span class="sourceLineNo">455</span> if (keysBlocking == null) {<a name="line.455"></a> |
| <span class="sourceLineNo">456</span> return false;<a name="line.456"></a> |
| <span class="sourceLineNo">457</span> }<a name="line.457"></a> |
| <span class="sourceLineNo">458</span> result = false;<a name="line.458"></a> |
| <span class="sourceLineNo">459</span> keysBlocking.add(e.getKey());<a name="line.459"></a> |
| <span class="sourceLineNo">460</span> // Continue examining the map so we could log all regions blocking this WAL.<a name="line.460"></a> |
| <span class="sourceLineNo">461</span> }<a name="line.461"></a> |
| <span class="sourceLineNo">462</span> }<a name="line.462"></a> |
| <span class="sourceLineNo">463</span> return result;<a name="line.463"></a> |
| <span class="sourceLineNo">464</span> }<a name="line.464"></a> |
| <span class="sourceLineNo">465</span><a name="line.465"></a> |
| <span class="sourceLineNo">466</span> /**<a name="line.466"></a> |
| <span class="sourceLineNo">467</span> * Iterates over the given Map and compares sequence ids with corresponding entries in<a name="line.467"></a> |
| <span class="sourceLineNo">468</span> * {@link #lowestUnflushedSequenceIds}. If a region in<a name="line.468"></a> |
| <span class="sourceLineNo">469</span> * {@link #lowestUnflushedSequenceIds} has a sequence id less than that passed in<a name="line.469"></a> |
| <span class="sourceLineNo">470</span> * <code>sequenceids</code> then return it.<a name="line.470"></a> |
| <span class="sourceLineNo">471</span> * @param sequenceids Sequenceids keyed by encoded region name.<a name="line.471"></a> |
| <span class="sourceLineNo">472</span> * @return stores of regions found in this instance with sequence ids less than those passed in.<a name="line.472"></a> |
| <span class="sourceLineNo">473</span> */<a name="line.473"></a> |
| <span class="sourceLineNo">474</span> Map<byte[], List<byte[]>> findLower(Map<byte[], Long> sequenceids) {<a name="line.474"></a> |
| <span class="sourceLineNo">475</span> Map<byte[], List<byte[]>> toFlush = null;<a name="line.475"></a> |
| <span class="sourceLineNo">476</span> // Keeping the old behavior of iterating unflushedSeqNums under oldestSeqNumsLock.<a name="line.476"></a> |
| <span class="sourceLineNo">477</span> synchronized (tieLock) {<a name="line.477"></a> |
| <span class="sourceLineNo">478</span> for (Map.Entry<byte[], Long> e : sequenceids.entrySet()) {<a name="line.478"></a> |
| <span class="sourceLineNo">479</span> Map<ImmutableByteArray, Long> m = this.lowestUnflushedSequenceIds.get(e.getKey());<a name="line.479"></a> |
| <span class="sourceLineNo">480</span> if (m == null) {<a name="line.480"></a> |
| <span class="sourceLineNo">481</span> continue;<a name="line.481"></a> |
| <span class="sourceLineNo">482</span> }<a name="line.482"></a> |
| <span class="sourceLineNo">483</span> for (Map.Entry<ImmutableByteArray, Long> me : m.entrySet()) {<a name="line.483"></a> |
| <span class="sourceLineNo">484</span> if (me.getValue() <= e.getValue()) {<a name="line.484"></a> |
| <span class="sourceLineNo">485</span> if (toFlush == null) {<a name="line.485"></a> |
| <span class="sourceLineNo">486</span> toFlush = new TreeMap(Bytes.BYTES_COMPARATOR);<a name="line.486"></a> |
| <span class="sourceLineNo">487</span> }<a name="line.487"></a> |
| <span class="sourceLineNo">488</span> toFlush.computeIfAbsent(e.getKey(), k -> new ArrayList<>())<a name="line.488"></a> |
| <span class="sourceLineNo">489</span> .add(Bytes.toBytes(me.getKey().toString()));<a name="line.489"></a> |
| <span class="sourceLineNo">490</span> }<a name="line.490"></a> |
| <span class="sourceLineNo">491</span> }<a name="line.491"></a> |
| <span class="sourceLineNo">492</span> }<a name="line.492"></a> |
| <span class="sourceLineNo">493</span> }<a name="line.493"></a> |
| <span class="sourceLineNo">494</span> return toFlush;<a name="line.494"></a> |
| <span class="sourceLineNo">495</span> }<a name="line.495"></a> |
| <span class="sourceLineNo">496</span>}<a name="line.496"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </body> |
| </html> |
