| <!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.replication.regionserver;<a name="line.18"></a> |
| <span class="sourceLineNo">019</span><a name="line.19"></a> |
| <span class="sourceLineNo">020</span>import java.io.IOException;<a name="line.20"></a> |
| <span class="sourceLineNo">021</span>import java.util.Arrays;<a name="line.21"></a> |
| <span class="sourceLineNo">022</span>import java.util.concurrent.TimeUnit;<a name="line.22"></a> |
| <span class="sourceLineNo">023</span>import org.apache.commons.lang3.mutable.MutableLong;<a name="line.23"></a> |
| <span class="sourceLineNo">024</span>import org.apache.hadoop.conf.Configuration;<a name="line.24"></a> |
| <span class="sourceLineNo">025</span>import org.apache.hadoop.hbase.Cell;<a name="line.25"></a> |
| <span class="sourceLineNo">026</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.26"></a> |
| <span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.HConstants;<a name="line.27"></a> |
| <span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.client.Connection;<a name="line.28"></a> |
| <span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.client.RegionInfo;<a name="line.29"></a> |
| <span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.master.RegionState;<a name="line.30"></a> |
| <span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.replication.ReplicationBarrierFamilyFormat;<a name="line.31"></a> |
| <span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.replication.ReplicationBarrierFamilyFormat.ReplicationBarrierResult;<a name="line.32"></a> |
| <span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.replication.ReplicationException;<a name="line.33"></a> |
| <span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.replication.ReplicationQueueStorage;<a name="line.34"></a> |
| <span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.35"></a> |
| <span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.wal.WAL.Entry;<a name="line.36"></a> |
| <span class="sourceLineNo">037</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.37"></a> |
| <span class="sourceLineNo">038</span>import org.slf4j.Logger;<a name="line.38"></a> |
| <span class="sourceLineNo">039</span>import org.slf4j.LoggerFactory;<a name="line.39"></a> |
| <span class="sourceLineNo">040</span><a name="line.40"></a> |
| <span class="sourceLineNo">041</span>import org.apache.hbase.thirdparty.com.google.common.cache.Cache;<a name="line.41"></a> |
| <span class="sourceLineNo">042</span>import org.apache.hbase.thirdparty.com.google.common.cache.CacheBuilder;<a name="line.42"></a> |
| <span class="sourceLineNo">043</span>import org.apache.hbase.thirdparty.com.google.common.cache.CacheLoader;<a name="line.43"></a> |
| <span class="sourceLineNo">044</span>import org.apache.hbase.thirdparty.com.google.common.cache.LoadingCache;<a name="line.44"></a> |
| <span class="sourceLineNo">045</span><a name="line.45"></a> |
| <span class="sourceLineNo">046</span>/**<a name="line.46"></a> |
| <span class="sourceLineNo">047</span> * <p><a name="line.47"></a> |
| <span class="sourceLineNo">048</span> * Helper class to determine whether we can push a given WAL entry without breaking the replication<a name="line.48"></a> |
| <span class="sourceLineNo">049</span> * order. The class is designed to per {@link ReplicationSourceWALReader}, so not thread safe.<a name="line.49"></a> |
| <span class="sourceLineNo">050</span> * </p><a name="line.50"></a> |
| <span class="sourceLineNo">051</span> * <p><a name="line.51"></a> |
| <span class="sourceLineNo">052</span> * We record all the open sequence number for a region in a special family in meta, which is called<a name="line.52"></a> |
| <span class="sourceLineNo">053</span> * 'rep_barrier', so there will be a sequence of open sequence number (b1, b2, b3, ...). We call<a name="line.53"></a> |
| <span class="sourceLineNo">054</span> * [bn, bn+1) a range, and it is obvious that a region will always be on the same RS within a<a name="line.54"></a> |
| <span class="sourceLineNo">055</span> * range.<a name="line.55"></a> |
| <span class="sourceLineNo">056</span> * <p><a name="line.56"></a> |
| <span class="sourceLineNo">057</span> * When split and merge, we will also record the parent for the generated region(s) in the special<a name="line.57"></a> |
| <span class="sourceLineNo">058</span> * family in meta. And also, we will write an extra 'open sequence number' for the parent<a name="line.58"></a> |
| <span class="sourceLineNo">059</span> * region(s), which is the max sequence id of the region plus one.<a name="line.59"></a> |
| <span class="sourceLineNo">060</span> * </p><a name="line.60"></a> |
| <span class="sourceLineNo">061</span> * </p><a name="line.61"></a> |
| <span class="sourceLineNo">062</span> * <p><a name="line.62"></a> |
| <span class="sourceLineNo">063</span> * For each peer, we record the last pushed sequence id for each region. It is managed by the<a name="line.63"></a> |
| <span class="sourceLineNo">064</span> * replication storage.<a name="line.64"></a> |
| <span class="sourceLineNo">065</span> * </p><a name="line.65"></a> |
| <span class="sourceLineNo">066</span> * <p><a name="line.66"></a> |
| <span class="sourceLineNo">067</span> * The algorithm works like this:<a name="line.67"></a> |
| <span class="sourceLineNo">068</span> * <ol><a name="line.68"></a> |
| <span class="sourceLineNo">069</span> * <li>Locate the sequence id we want to push in the barriers</li><a name="line.69"></a> |
| <span class="sourceLineNo">070</span> * <li>If it is before the first barrier, we are safe to push. This usually because we enable serial<a name="line.70"></a> |
| <span class="sourceLineNo">071</span> * replication for this table after we create the table and write data into the table.</li><a name="line.71"></a> |
| <span class="sourceLineNo">072</span> * <li>In general, if the previous range is finished, then we are safe to push. The way to determine<a name="line.72"></a> |
| <span class="sourceLineNo">073</span> * whether a range is finish is straight-forward: check whether the last pushed sequence id is equal<a name="line.73"></a> |
| <span class="sourceLineNo">074</span> * to the end barrier of the range minus 1. There are several exceptions:<a name="line.74"></a> |
| <span class="sourceLineNo">075</span> * <ul><a name="line.75"></a> |
| <span class="sourceLineNo">076</span> * <li>If it is in the first range, we need to check whether there are parent regions. If so, we<a name="line.76"></a> |
| <span class="sourceLineNo">077</span> * need to make sure that the data for parent regions have all been pushed.</li><a name="line.77"></a> |
| <span class="sourceLineNo">078</span> * <li>If it is in the last range, we need to check the region state. If state is OPENING, then we<a name="line.78"></a> |
| <span class="sourceLineNo">079</span> * are not safe to push. This is because that, before we call reportRIT to master which update the<a name="line.79"></a> |
| <span class="sourceLineNo">080</span> * open sequence number into meta table, we will write a open region event marker to WAL first, and<a name="line.80"></a> |
| <span class="sourceLineNo">081</span> * its sequence id is greater than the newest open sequence number(which has not been updated to<a name="line.81"></a> |
| <span class="sourceLineNo">082</span> * meta table yet so we do not know). For this scenario, the WAL entry for this open region event<a name="line.82"></a> |
| <span class="sourceLineNo">083</span> * marker actually belongs to the range after the 'last' range, so we are not safe to push it.<a name="line.83"></a> |
| <span class="sourceLineNo">084</span> * Otherwise the last pushed sequence id will be updated to this value and then we think the<a name="line.84"></a> |
| <span class="sourceLineNo">085</span> * previous range has already been finished, but this is not true.</li><a name="line.85"></a> |
| <span class="sourceLineNo">086</span> * <li>Notice that the above two exceptions are not conflicts, since the first range can also be the<a name="line.86"></a> |
| <span class="sourceLineNo">087</span> * last range if we only have one range.</li><a name="line.87"></a> |
| <span class="sourceLineNo">088</span> * </ul><a name="line.88"></a> |
| <span class="sourceLineNo">089</span> * </li><a name="line.89"></a> |
| <span class="sourceLineNo">090</span> * </ol><a name="line.90"></a> |
| <span class="sourceLineNo">091</span> * </p><a name="line.91"></a> |
| <span class="sourceLineNo">092</span> * <p><a name="line.92"></a> |
| <span class="sourceLineNo">093</span> * And for performance reason, we do not want to check meta for every WAL entry, so we introduce two<a name="line.93"></a> |
| <span class="sourceLineNo">094</span> * in memory maps. The idea is simple:<a name="line.94"></a> |
| <span class="sourceLineNo">095</span> * <ul><a name="line.95"></a> |
| <span class="sourceLineNo">096</span> * <li>If a range can be pushed, then put its end barrier into the {@code canPushUnder} map.</li><a name="line.96"></a> |
| <span class="sourceLineNo">097</span> * <li>Before accessing meta, first check the sequence id stored in the {@code canPushUnder} map. If<a name="line.97"></a> |
| <span class="sourceLineNo">098</span> * the sequence id of WAL entry is less the one stored in {@code canPushUnder} map, then we are safe<a name="line.98"></a> |
| <span class="sourceLineNo">099</span> * to push.</li><a name="line.99"></a> |
| <span class="sourceLineNo">100</span> * </ul><a name="line.100"></a> |
| <span class="sourceLineNo">101</span> * And for the last range, we do not have an end barrier, so we use the continuity of sequence id to<a name="line.101"></a> |
| <span class="sourceLineNo">102</span> * determine whether we can push. The rule is:<a name="line.102"></a> |
| <span class="sourceLineNo">103</span> * <ul><a name="line.103"></a> |
| <span class="sourceLineNo">104</span> * <li>When an entry is able to push, then put its sequence id into the {@code pushed} map.</li><a name="line.104"></a> |
| <span class="sourceLineNo">105</span> * <li>Check if the sequence id of WAL entry equals to the one stored in the {@code pushed} map plus<a name="line.105"></a> |
| <span class="sourceLineNo">106</span> * one. If so, we are safe to push, and also update the {@code pushed} map with the sequence id of<a name="line.106"></a> |
| <span class="sourceLineNo">107</span> * the WAL entry.</li><a name="line.107"></a> |
| <span class="sourceLineNo">108</span> * </ul><a name="line.108"></a> |
| <span class="sourceLineNo">109</span> * </p><a name="line.109"></a> |
| <span class="sourceLineNo">110</span> */<a name="line.110"></a> |
| <span class="sourceLineNo">111</span>@InterfaceAudience.Private<a name="line.111"></a> |
| <span class="sourceLineNo">112</span>class SerialReplicationChecker {<a name="line.112"></a> |
| <span class="sourceLineNo">113</span><a name="line.113"></a> |
| <span class="sourceLineNo">114</span> private static final Logger LOG = LoggerFactory.getLogger(SerialReplicationChecker.class);<a name="line.114"></a> |
| <span class="sourceLineNo">115</span><a name="line.115"></a> |
| <span class="sourceLineNo">116</span> public static final String REPLICATION_SERIALLY_WAITING_KEY =<a name="line.116"></a> |
| <span class="sourceLineNo">117</span> "hbase.serial.replication.waiting.ms";<a name="line.117"></a> |
| <span class="sourceLineNo">118</span> public static final long REPLICATION_SERIALLY_WAITING_DEFAULT = 10000;<a name="line.118"></a> |
| <span class="sourceLineNo">119</span><a name="line.119"></a> |
| <span class="sourceLineNo">120</span> private final String peerId;<a name="line.120"></a> |
| <span class="sourceLineNo">121</span><a name="line.121"></a> |
| <span class="sourceLineNo">122</span> private final ReplicationQueueStorage storage;<a name="line.122"></a> |
| <span class="sourceLineNo">123</span><a name="line.123"></a> |
| <span class="sourceLineNo">124</span> private final Connection conn;<a name="line.124"></a> |
| <span class="sourceLineNo">125</span><a name="line.125"></a> |
| <span class="sourceLineNo">126</span> private final long waitTimeMs;<a name="line.126"></a> |
| <span class="sourceLineNo">127</span><a name="line.127"></a> |
| <span class="sourceLineNo">128</span> private final LoadingCache<String, MutableLong> pushed = CacheBuilder.newBuilder()<a name="line.128"></a> |
| <span class="sourceLineNo">129</span> .expireAfterAccess(1, TimeUnit.DAYS).build(new CacheLoader<String, MutableLong>() {<a name="line.129"></a> |
| <span class="sourceLineNo">130</span><a name="line.130"></a> |
| <span class="sourceLineNo">131</span> @Override<a name="line.131"></a> |
| <span class="sourceLineNo">132</span> public MutableLong load(String key) throws Exception {<a name="line.132"></a> |
| <span class="sourceLineNo">133</span> return new MutableLong(HConstants.NO_SEQNUM);<a name="line.133"></a> |
| <span class="sourceLineNo">134</span> }<a name="line.134"></a> |
| <span class="sourceLineNo">135</span> });<a name="line.135"></a> |
| <span class="sourceLineNo">136</span><a name="line.136"></a> |
| <span class="sourceLineNo">137</span> // Use guava cache to set ttl for each key<a name="line.137"></a> |
| <span class="sourceLineNo">138</span> private final Cache<String, Long> canPushUnder =<a name="line.138"></a> |
| <span class="sourceLineNo">139</span> CacheBuilder.newBuilder().expireAfterAccess(1, TimeUnit.DAYS).build();<a name="line.139"></a> |
| <span class="sourceLineNo">140</span><a name="line.140"></a> |
| <span class="sourceLineNo">141</span> public SerialReplicationChecker(Configuration conf, ReplicationSource source) {<a name="line.141"></a> |
| <span class="sourceLineNo">142</span> this.peerId = source.getPeerId();<a name="line.142"></a> |
| <span class="sourceLineNo">143</span> this.storage = source.getQueueStorage();<a name="line.143"></a> |
| <span class="sourceLineNo">144</span> this.conn = source.getServer().getConnection();<a name="line.144"></a> |
| <span class="sourceLineNo">145</span> this.waitTimeMs =<a name="line.145"></a> |
| <span class="sourceLineNo">146</span> conf.getLong(REPLICATION_SERIALLY_WAITING_KEY, REPLICATION_SERIALLY_WAITING_DEFAULT);<a name="line.146"></a> |
| <span class="sourceLineNo">147</span> }<a name="line.147"></a> |
| <span class="sourceLineNo">148</span><a name="line.148"></a> |
| <span class="sourceLineNo">149</span> private boolean isRangeFinished(long endBarrier, String encodedRegionName) throws IOException {<a name="line.149"></a> |
| <span class="sourceLineNo">150</span> long pushedSeqId;<a name="line.150"></a> |
| <span class="sourceLineNo">151</span> try {<a name="line.151"></a> |
| <span class="sourceLineNo">152</span> pushedSeqId = storage.getLastSequenceId(encodedRegionName, peerId);<a name="line.152"></a> |
| <span class="sourceLineNo">153</span> } catch (ReplicationException e) {<a name="line.153"></a> |
| <span class="sourceLineNo">154</span> throw new IOException(<a name="line.154"></a> |
| <span class="sourceLineNo">155</span> "Failed to get pushed sequence id for " + encodedRegionName + ", peer " + peerId, e);<a name="line.155"></a> |
| <span class="sourceLineNo">156</span> }<a name="line.156"></a> |
| <span class="sourceLineNo">157</span> // endBarrier is the open sequence number. When opening a region, the open sequence number will<a name="line.157"></a> |
| <span class="sourceLineNo">158</span> // be set to the old max sequence id plus one, so here we need to minus one.<a name="line.158"></a> |
| <span class="sourceLineNo">159</span> return pushedSeqId >= endBarrier - 1;<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> private boolean isParentFinished(byte[] regionName) throws IOException {<a name="line.162"></a> |
| <span class="sourceLineNo">163</span> long[] barriers = ReplicationBarrierFamilyFormat.getReplicationBarriers(conn, regionName);<a name="line.163"></a> |
| <span class="sourceLineNo">164</span> if (barriers.length == 0) {<a name="line.164"></a> |
| <span class="sourceLineNo">165</span> return true;<a name="line.165"></a> |
| <span class="sourceLineNo">166</span> }<a name="line.166"></a> |
| <span class="sourceLineNo">167</span> return isRangeFinished(barriers[barriers.length - 1], RegionInfo.encodeRegionName(regionName));<a name="line.167"></a> |
| <span class="sourceLineNo">168</span> }<a name="line.168"></a> |
| <span class="sourceLineNo">169</span><a name="line.169"></a> |
| <span class="sourceLineNo">170</span> // We may write a open region marker to WAL before we write the open sequence number to meta, so<a name="line.170"></a> |
| <span class="sourceLineNo">171</span> // if a region is in OPENING state and we are in the last range, it is not safe to say we can push<a name="line.171"></a> |
| <span class="sourceLineNo">172</span> // even if the previous range is finished.<a name="line.172"></a> |
| <span class="sourceLineNo">173</span> private boolean isLastRangeAndOpening(ReplicationBarrierResult barrierResult, int index) {<a name="line.173"></a> |
| <span class="sourceLineNo">174</span> return index == barrierResult.getBarriers().length &&<a name="line.174"></a> |
| <span class="sourceLineNo">175</span> barrierResult.getState() == RegionState.State.OPENING;<a name="line.175"></a> |
| <span class="sourceLineNo">176</span> }<a name="line.176"></a> |
| <span class="sourceLineNo">177</span><a name="line.177"></a> |
| <span class="sourceLineNo">178</span> private void recordCanPush(String encodedNameAsString, long seqId, long[] barriers, int index) {<a name="line.178"></a> |
| <span class="sourceLineNo">179</span> if (barriers.length > index) {<a name="line.179"></a> |
| <span class="sourceLineNo">180</span> canPushUnder.put(encodedNameAsString, barriers[index]);<a name="line.180"></a> |
| <span class="sourceLineNo">181</span> }<a name="line.181"></a> |
| <span class="sourceLineNo">182</span> pushed.getUnchecked(encodedNameAsString).setValue(seqId);<a name="line.182"></a> |
| <span class="sourceLineNo">183</span> }<a name="line.183"></a> |
| <span class="sourceLineNo">184</span><a name="line.184"></a> |
| <span class="sourceLineNo">185</span> private boolean canPush(Entry entry, byte[] row) throws IOException {<a name="line.185"></a> |
| <span class="sourceLineNo">186</span> String encodedNameAsString = Bytes.toString(entry.getKey().getEncodedRegionName());<a name="line.186"></a> |
| <span class="sourceLineNo">187</span> long seqId = entry.getKey().getSequenceId();<a name="line.187"></a> |
| <span class="sourceLineNo">188</span> ReplicationBarrierResult barrierResult =<a name="line.188"></a> |
| <span class="sourceLineNo">189</span> ReplicationBarrierFamilyFormat.getReplicationBarrierResult(conn,<a name="line.189"></a> |
| <span class="sourceLineNo">190</span> entry.getKey().getTableName(), row, entry.getKey().getEncodedRegionName());<a name="line.190"></a> |
| <span class="sourceLineNo">191</span> LOG.debug("Replication barrier for {}: {}", entry, barrierResult);<a name="line.191"></a> |
| <span class="sourceLineNo">192</span> long[] barriers = barrierResult.getBarriers();<a name="line.192"></a> |
| <span class="sourceLineNo">193</span> int index = Arrays.binarySearch(barriers, seqId);<a name="line.193"></a> |
| <span class="sourceLineNo">194</span> if (index == -1) {<a name="line.194"></a> |
| <span class="sourceLineNo">195</span> LOG.debug("{} is before the first barrier, pass", entry);<a name="line.195"></a> |
| <span class="sourceLineNo">196</span> // This means we are in the range before the first record openSeqNum, this usually because the<a name="line.196"></a> |
| <span class="sourceLineNo">197</span> // wal is written before we enable serial replication for this table, just return true since<a name="line.197"></a> |
| <span class="sourceLineNo">198</span> // we can not guarantee the order.<a name="line.198"></a> |
| <span class="sourceLineNo">199</span> pushed.getUnchecked(encodedNameAsString).setValue(seqId);<a name="line.199"></a> |
| <span class="sourceLineNo">200</span> return true;<a name="line.200"></a> |
| <span class="sourceLineNo">201</span> }<a name="line.201"></a> |
| <span class="sourceLineNo">202</span> // The sequence id range is left closed and right open, so either we decrease the missed insert<a name="line.202"></a> |
| <span class="sourceLineNo">203</span> // point to make the index start from 0, or increase the hit insert point to make the index<a name="line.203"></a> |
| <span class="sourceLineNo">204</span> // start from 1. Here we choose the latter one.<a name="line.204"></a> |
| <span class="sourceLineNo">205</span> if (index < 0) {<a name="line.205"></a> |
| <span class="sourceLineNo">206</span> index = -index - 1;<a name="line.206"></a> |
| <span class="sourceLineNo">207</span> } else {<a name="line.207"></a> |
| <span class="sourceLineNo">208</span> index++;<a name="line.208"></a> |
| <span class="sourceLineNo">209</span> }<a name="line.209"></a> |
| <span class="sourceLineNo">210</span> if (index == 1) {<a name="line.210"></a> |
| <span class="sourceLineNo">211</span> // we are in the first range, check whether we have parents<a name="line.211"></a> |
| <span class="sourceLineNo">212</span> for (byte[] regionName : barrierResult.getParentRegionNames()) {<a name="line.212"></a> |
| <span class="sourceLineNo">213</span> if (!isParentFinished(regionName)) {<a name="line.213"></a> |
| <span class="sourceLineNo">214</span> LOG.debug("Parent {} has not been finished yet for entry {}, give up",<a name="line.214"></a> |
| <span class="sourceLineNo">215</span> Bytes.toStringBinary(regionName), entry);<a name="line.215"></a> |
| <span class="sourceLineNo">216</span> return false;<a name="line.216"></a> |
| <span class="sourceLineNo">217</span> }<a name="line.217"></a> |
| <span class="sourceLineNo">218</span> }<a name="line.218"></a> |
| <span class="sourceLineNo">219</span> if (isLastRangeAndOpening(barrierResult, index)) {<a name="line.219"></a> |
| <span class="sourceLineNo">220</span> LOG.debug("{} is in the last range and the region is opening, give up", entry);<a name="line.220"></a> |
| <span class="sourceLineNo">221</span> return false;<a name="line.221"></a> |
| <span class="sourceLineNo">222</span> }<a name="line.222"></a> |
| <span class="sourceLineNo">223</span> LOG.debug("{} is in the first range, pass", entry);<a name="line.223"></a> |
| <span class="sourceLineNo">224</span> recordCanPush(encodedNameAsString, seqId, barriers, 1);<a name="line.224"></a> |
| <span class="sourceLineNo">225</span> return true;<a name="line.225"></a> |
| <span class="sourceLineNo">226</span> }<a name="line.226"></a> |
| <span class="sourceLineNo">227</span> // check whether the previous range is finished<a name="line.227"></a> |
| <span class="sourceLineNo">228</span> if (!isRangeFinished(barriers[index - 1], encodedNameAsString)) {<a name="line.228"></a> |
| <span class="sourceLineNo">229</span> LOG.debug("Previous range for {} has not been finished yet, give up", entry);<a name="line.229"></a> |
| <span class="sourceLineNo">230</span> return false;<a name="line.230"></a> |
| <span class="sourceLineNo">231</span> }<a name="line.231"></a> |
| <span class="sourceLineNo">232</span> if (isLastRangeAndOpening(barrierResult, index)) {<a name="line.232"></a> |
| <span class="sourceLineNo">233</span> LOG.debug("{} is in the last range and the region is opening, give up", entry);<a name="line.233"></a> |
| <span class="sourceLineNo">234</span> return false;<a name="line.234"></a> |
| <span class="sourceLineNo">235</span> }<a name="line.235"></a> |
| <span class="sourceLineNo">236</span> LOG.debug("The previous range for {} has been finished, pass", entry);<a name="line.236"></a> |
| <span class="sourceLineNo">237</span> recordCanPush(encodedNameAsString, seqId, barriers, index);<a name="line.237"></a> |
| <span class="sourceLineNo">238</span> return true;<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> public boolean canPush(Entry entry, Cell firstCellInEdit) throws IOException {<a name="line.241"></a> |
| <span class="sourceLineNo">242</span> String encodedNameAsString = Bytes.toString(entry.getKey().getEncodedRegionName());<a name="line.242"></a> |
| <span class="sourceLineNo">243</span> long seqId = entry.getKey().getSequenceId();<a name="line.243"></a> |
| <span class="sourceLineNo">244</span> Long canReplicateUnderSeqId = canPushUnder.getIfPresent(encodedNameAsString);<a name="line.244"></a> |
| <span class="sourceLineNo">245</span> if (canReplicateUnderSeqId != null) {<a name="line.245"></a> |
| <span class="sourceLineNo">246</span> if (seqId < canReplicateUnderSeqId.longValue()) {<a name="line.246"></a> |
| <span class="sourceLineNo">247</span> LOG.trace("{} is before the end barrier {}, pass", entry, canReplicateUnderSeqId);<a name="line.247"></a> |
| <span class="sourceLineNo">248</span> return true;<a name="line.248"></a> |
| <span class="sourceLineNo">249</span> }<a name="line.249"></a> |
| <span class="sourceLineNo">250</span> LOG.debug("{} is beyond the previous end barrier {}, remove from cache", entry,<a name="line.250"></a> |
| <span class="sourceLineNo">251</span> canReplicateUnderSeqId);<a name="line.251"></a> |
| <span class="sourceLineNo">252</span> // we are already beyond the last safe point, remove<a name="line.252"></a> |
| <span class="sourceLineNo">253</span> canPushUnder.invalidate(encodedNameAsString);<a name="line.253"></a> |
| <span class="sourceLineNo">254</span> }<a name="line.254"></a> |
| <span class="sourceLineNo">255</span> // This is for the case where the region is currently opened on us, if the sequence id is<a name="line.255"></a> |
| <span class="sourceLineNo">256</span> // continuous then we are safe to replicate. If there is a breakpoint, then maybe the region<a name="line.256"></a> |
| <span class="sourceLineNo">257</span> // has been moved to another RS and then back, so we need to check the barrier.<a name="line.257"></a> |
| <span class="sourceLineNo">258</span> MutableLong previousPushedSeqId = pushed.getUnchecked(encodedNameAsString);<a name="line.258"></a> |
| <span class="sourceLineNo">259</span> if (seqId == previousPushedSeqId.longValue() + 1) {<a name="line.259"></a> |
| <span class="sourceLineNo">260</span> LOG.trace("The sequence id for {} is continuous, pass", entry);<a name="line.260"></a> |
| <span class="sourceLineNo">261</span> previousPushedSeqId.increment();<a name="line.261"></a> |
| <span class="sourceLineNo">262</span> return true;<a name="line.262"></a> |
| <span class="sourceLineNo">263</span> }<a name="line.263"></a> |
| <span class="sourceLineNo">264</span> return canPush(entry, CellUtil.cloneRow(firstCellInEdit));<a name="line.264"></a> |
| <span class="sourceLineNo">265</span> }<a name="line.265"></a> |
| <span class="sourceLineNo">266</span><a name="line.266"></a> |
| <span class="sourceLineNo">267</span> public void waitUntilCanPush(Entry entry, Cell firstCellInEdit)<a name="line.267"></a> |
| <span class="sourceLineNo">268</span> throws IOException, InterruptedException {<a name="line.268"></a> |
| <span class="sourceLineNo">269</span> byte[] row = CellUtil.cloneRow(firstCellInEdit);<a name="line.269"></a> |
| <span class="sourceLineNo">270</span> while (!canPush(entry, row)) {<a name="line.270"></a> |
| <span class="sourceLineNo">271</span> LOG.debug("Can not push {}, wait", entry);<a name="line.271"></a> |
| <span class="sourceLineNo">272</span> Thread.sleep(waitTimeMs);<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>}<a name="line.275"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </body> |
| </html> |
