http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html deleted file mode 100644 index 902213f..0000000 --- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html +++ /dev/null @@ -1,1059 +0,0 @@ -<!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> *<a name="line.2"></a> -<span class="sourceLineNo">003</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.3"></a> -<span class="sourceLineNo">004</span> * or more contributor license agreements. See the NOTICE file<a name="line.4"></a> -<span class="sourceLineNo">005</span> * distributed with this work for additional information<a name="line.5"></a> -<span class="sourceLineNo">006</span> * regarding copyright ownership. The ASF licenses this file<a name="line.6"></a> -<span class="sourceLineNo">007</span> * to you under the Apache License, Version 2.0 (the<a name="line.7"></a> -<span class="sourceLineNo">008</span> * "License"); you may not use this file except in compliance<a name="line.8"></a> -<span class="sourceLineNo">009</span> * with the License. You may obtain a copy of the License at<a name="line.9"></a> -<span class="sourceLineNo">010</span> *<a name="line.10"></a> -<span class="sourceLineNo">011</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.11"></a> -<span class="sourceLineNo">012</span> *<a name="line.12"></a> -<span class="sourceLineNo">013</span> * Unless required by applicable law or agreed to in writing, software<a name="line.13"></a> -<span class="sourceLineNo">014</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.14"></a> -<span class="sourceLineNo">015</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.15"></a> -<span class="sourceLineNo">016</span> * See the License for the specific language governing permissions and<a name="line.16"></a> -<span class="sourceLineNo">017</span> * limitations under the License.<a name="line.17"></a> -<span class="sourceLineNo">018</span> */<a name="line.18"></a> -<span class="sourceLineNo">019</span><a name="line.19"></a> -<span class="sourceLineNo">020</span>package org.apache.hadoop.hbase.regionserver;<a name="line.20"></a> -<span class="sourceLineNo">021</span><a name="line.21"></a> -<span class="sourceLineNo">022</span>import java.lang.management.ManagementFactory;<a name="line.22"></a> -<span class="sourceLineNo">023</span>import java.lang.management.RuntimeMXBean;<a name="line.23"></a> -<span class="sourceLineNo">024</span>import java.util.ArrayList;<a name="line.24"></a> -<span class="sourceLineNo">025</span>import java.util.Collections;<a name="line.25"></a> -<span class="sourceLineNo">026</span>import java.util.Iterator;<a name="line.26"></a> -<span class="sourceLineNo">027</span>import java.util.List;<a name="line.27"></a> -<span class="sourceLineNo">028</span>import java.util.NavigableSet;<a name="line.28"></a> -<span class="sourceLineNo">029</span>import java.util.SortedSet;<a name="line.29"></a> -<span class="sourceLineNo">030</span>import java.util.concurrent.atomic.AtomicLong;<a name="line.30"></a> -<span class="sourceLineNo">031</span><a name="line.31"></a> -<span class="sourceLineNo">032</span>import org.apache.commons.logging.Log;<a name="line.32"></a> -<span class="sourceLineNo">033</span>import org.apache.commons.logging.LogFactory;<a name="line.33"></a> -<span class="sourceLineNo">034</span>import org.apache.hadoop.conf.Configuration;<a name="line.34"></a> -<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.Cell;<a name="line.35"></a> -<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.36"></a> -<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.37"></a> -<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.HBaseConfiguration;<a name="line.38"></a> -<span class="sourceLineNo">039</span>import org.apache.hadoop.hbase.KeyValue;<a name="line.39"></a> -<span class="sourceLineNo">040</span>import org.apache.hadoop.hbase.KeyValueUtil;<a name="line.40"></a> -<span class="sourceLineNo">041</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.41"></a> -<span class="sourceLineNo">042</span>import org.apache.hadoop.hbase.client.Scan;<a name="line.42"></a> -<span class="sourceLineNo">043</span>import org.apache.hadoop.hbase.io.TimeRange;<a name="line.43"></a> -<span class="sourceLineNo">044</span>import org.apache.hadoop.hbase.util.ByteRange;<a name="line.44"></a> -<span class="sourceLineNo">045</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.45"></a> -<span class="sourceLineNo">046</span>import org.apache.hadoop.hbase.util.ClassSize;<a name="line.46"></a> -<span class="sourceLineNo">047</span>import org.apache.hadoop.hbase.util.CollectionBackedScanner;<a name="line.47"></a> -<span class="sourceLineNo">048</span>import org.apache.hadoop.hbase.util.EnvironmentEdgeManager;<a name="line.48"></a> -<span class="sourceLineNo">049</span>import org.apache.hadoop.hbase.util.ReflectionUtils;<a name="line.49"></a> -<span class="sourceLineNo">050</span>import org.apache.htrace.Trace;<a name="line.50"></a> -<span class="sourceLineNo">051</span><a name="line.51"></a> -<span class="sourceLineNo">052</span>/**<a name="line.52"></a> -<span class="sourceLineNo">053</span> * The MemStore holds in-memory modifications to the Store. Modifications<a name="line.53"></a> -<span class="sourceLineNo">054</span> * are {@link Cell}s. When asked to flush, current memstore is moved<a name="line.54"></a> -<span class="sourceLineNo">055</span> * to snapshot and is cleared. We continue to serve edits out of new memstore<a name="line.55"></a> -<span class="sourceLineNo">056</span> * and backing snapshot until flusher reports in that the flush succeeded. At<a name="line.56"></a> -<span class="sourceLineNo">057</span> * this point we let the snapshot go.<a name="line.57"></a> -<span class="sourceLineNo">058</span> * <p><a name="line.58"></a> -<span class="sourceLineNo">059</span> * The MemStore functions should not be called in parallel. Callers should hold<a name="line.59"></a> -<span class="sourceLineNo">060</span> * write and read locks. This is done in {@link HStore}.<a name="line.60"></a> -<span class="sourceLineNo">061</span> * </p><a name="line.61"></a> -<span class="sourceLineNo">062</span> *<a name="line.62"></a> -<span class="sourceLineNo">063</span> * TODO: Adjust size of the memstore when we remove items because they have<a name="line.63"></a> -<span class="sourceLineNo">064</span> * been deleted.<a name="line.64"></a> -<span class="sourceLineNo">065</span> * TODO: With new KVSLS, need to make sure we update HeapSize with difference<a name="line.65"></a> -<span class="sourceLineNo">066</span> * in KV size.<a name="line.66"></a> -<span class="sourceLineNo">067</span> */<a name="line.67"></a> -<span class="sourceLineNo">068</span>@InterfaceAudience.Private<a name="line.68"></a> -<span class="sourceLineNo">069</span>public class DefaultMemStore implements MemStore {<a name="line.69"></a> -<span class="sourceLineNo">070</span> private static final Log LOG = LogFactory.getLog(DefaultMemStore.class);<a name="line.70"></a> -<span class="sourceLineNo">071</span> static final String USEMSLAB_KEY = "hbase.hregion.memstore.mslab.enabled";<a name="line.71"></a> -<span class="sourceLineNo">072</span> private static final boolean USEMSLAB_DEFAULT = true;<a name="line.72"></a> -<span class="sourceLineNo">073</span> static final String MSLAB_CLASS_NAME = "hbase.regionserver.mslab.class";<a name="line.73"></a> -<span class="sourceLineNo">074</span><a name="line.74"></a> -<span class="sourceLineNo">075</span> private Configuration conf;<a name="line.75"></a> -<span class="sourceLineNo">076</span><a name="line.76"></a> -<span class="sourceLineNo">077</span> // MemStore. Use a CellSkipListSet rather than SkipListSet because of the<a name="line.77"></a> -<span class="sourceLineNo">078</span> // better semantics. The Map will overwrite if passed a key it already had<a name="line.78"></a> -<span class="sourceLineNo">079</span> // whereas the Set will not add new Cell if key is same though value might be<a name="line.79"></a> -<span class="sourceLineNo">080</span> // different. Value is not important -- just make sure always same<a name="line.80"></a> -<span class="sourceLineNo">081</span> // reference passed.<a name="line.81"></a> -<span class="sourceLineNo">082</span> volatile CellSkipListSet cellSet;<a name="line.82"></a> -<span class="sourceLineNo">083</span><a name="line.83"></a> -<span class="sourceLineNo">084</span> // Snapshot of memstore. Made for flusher.<a name="line.84"></a> -<span class="sourceLineNo">085</span> volatile CellSkipListSet snapshot;<a name="line.85"></a> -<span class="sourceLineNo">086</span><a name="line.86"></a> -<span class="sourceLineNo">087</span> final CellComparator comparator;<a name="line.87"></a> -<span class="sourceLineNo">088</span><a name="line.88"></a> -<span class="sourceLineNo">089</span> // Used to track own heapSize<a name="line.89"></a> -<span class="sourceLineNo">090</span> final AtomicLong size;<a name="line.90"></a> -<span class="sourceLineNo">091</span> private volatile long snapshotSize;<a name="line.91"></a> -<span class="sourceLineNo">092</span><a name="line.92"></a> -<span class="sourceLineNo">093</span> // Used to track when to flush<a name="line.93"></a> -<span class="sourceLineNo">094</span> volatile long timeOfOldestEdit = Long.MAX_VALUE;<a name="line.94"></a> -<span class="sourceLineNo">095</span><a name="line.95"></a> -<span class="sourceLineNo">096</span> TimeRangeTracker timeRangeTracker;<a name="line.96"></a> -<span class="sourceLineNo">097</span> TimeRangeTracker snapshotTimeRangeTracker;<a name="line.97"></a> -<span class="sourceLineNo">098</span><a name="line.98"></a> -<span class="sourceLineNo">099</span> volatile MemStoreLAB allocator;<a name="line.99"></a> -<span class="sourceLineNo">100</span> volatile MemStoreLAB snapshotAllocator;<a name="line.100"></a> -<span class="sourceLineNo">101</span> volatile long snapshotId;<a name="line.101"></a> -<span class="sourceLineNo">102</span> volatile boolean tagsPresent;<a name="line.102"></a> -<span class="sourceLineNo">103</span><a name="line.103"></a> -<span class="sourceLineNo">104</span> /**<a name="line.104"></a> -<span class="sourceLineNo">105</span> * Default constructor. Used for tests.<a name="line.105"></a> -<span class="sourceLineNo">106</span> */<a name="line.106"></a> -<span class="sourceLineNo">107</span> public DefaultMemStore() {<a name="line.107"></a> -<span class="sourceLineNo">108</span> this(HBaseConfiguration.create(), CellComparator.COMPARATOR);<a name="line.108"></a> -<span class="sourceLineNo">109</span> }<a name="line.109"></a> -<span class="sourceLineNo">110</span><a name="line.110"></a> -<span class="sourceLineNo">111</span> /**<a name="line.111"></a> -<span class="sourceLineNo">112</span> * Constructor.<a name="line.112"></a> -<span class="sourceLineNo">113</span> * @param c Comparator<a name="line.113"></a> -<span class="sourceLineNo">114</span> */<a name="line.114"></a> -<span class="sourceLineNo">115</span> public DefaultMemStore(final Configuration conf,<a name="line.115"></a> -<span class="sourceLineNo">116</span> final CellComparator c) {<a name="line.116"></a> -<span class="sourceLineNo">117</span> this.conf = conf;<a name="line.117"></a> -<span class="sourceLineNo">118</span> this.comparator = c;<a name="line.118"></a> -<span class="sourceLineNo">119</span> this.cellSet = new CellSkipListSet(c);<a name="line.119"></a> -<span class="sourceLineNo">120</span> this.snapshot = new CellSkipListSet(c);<a name="line.120"></a> -<span class="sourceLineNo">121</span> timeRangeTracker = new TimeRangeTracker();<a name="line.121"></a> -<span class="sourceLineNo">122</span> snapshotTimeRangeTracker = new TimeRangeTracker();<a name="line.122"></a> -<span class="sourceLineNo">123</span> this.size = new AtomicLong(DEEP_OVERHEAD);<a name="line.123"></a> -<span class="sourceLineNo">124</span> this.snapshotSize = 0;<a name="line.124"></a> -<span class="sourceLineNo">125</span> if (conf.getBoolean(USEMSLAB_KEY, USEMSLAB_DEFAULT)) {<a name="line.125"></a> -<span class="sourceLineNo">126</span> String className = conf.get(MSLAB_CLASS_NAME, HeapMemStoreLAB.class.getName());<a name="line.126"></a> -<span class="sourceLineNo">127</span> this.allocator = ReflectionUtils.instantiateWithCustomCtor(className,<a name="line.127"></a> -<span class="sourceLineNo">128</span> new Class[] { Configuration.class }, new Object[] { conf });<a name="line.128"></a> -<span class="sourceLineNo">129</span> } else {<a name="line.129"></a> -<span class="sourceLineNo">130</span> this.allocator = null;<a name="line.130"></a> -<span class="sourceLineNo">131</span> }<a name="line.131"></a> -<span class="sourceLineNo">132</span> }<a name="line.132"></a> -<span class="sourceLineNo">133</span><a name="line.133"></a> -<span class="sourceLineNo">134</span> void dump() {<a name="line.134"></a> -<span class="sourceLineNo">135</span> for (Cell cell: this.cellSet) {<a name="line.135"></a> -<span class="sourceLineNo">136</span> LOG.info(cell);<a name="line.136"></a> -<span class="sourceLineNo">137</span> }<a name="line.137"></a> -<span class="sourceLineNo">138</span> for (Cell cell: this.snapshot) {<a name="line.138"></a> -<span class="sourceLineNo">139</span> LOG.info(cell);<a name="line.139"></a> -<span class="sourceLineNo">140</span> }<a name="line.140"></a> -<span class="sourceLineNo">141</span> }<a name="line.141"></a> -<span class="sourceLineNo">142</span><a name="line.142"></a> -<span class="sourceLineNo">143</span> /**<a name="line.143"></a> -<span class="sourceLineNo">144</span> * Creates a snapshot of the current memstore.<a name="line.144"></a> -<span class="sourceLineNo">145</span> * Snapshot must be cleared by call to {@link #clearSnapshot(long)}<a name="line.145"></a> -<span class="sourceLineNo">146</span> */<a name="line.146"></a> -<span class="sourceLineNo">147</span> @Override<a name="line.147"></a> -<span class="sourceLineNo">148</span> public MemStoreSnapshot snapshot() {<a name="line.148"></a> -<span class="sourceLineNo">149</span> // If snapshot currently has entries, then flusher failed or didn't call<a name="line.149"></a> -<span class="sourceLineNo">150</span> // cleanup. Log a warning.<a name="line.150"></a> -<span class="sourceLineNo">151</span> if (!this.snapshot.isEmpty()) {<a name="line.151"></a> -<span class="sourceLineNo">152</span> LOG.warn("Snapshot called again without clearing previous. " +<a name="line.152"></a> -<span class="sourceLineNo">153</span> "Doing nothing. Another ongoing flush or did we fail last attempt?");<a name="line.153"></a> -<span class="sourceLineNo">154</span> } else {<a name="line.154"></a> -<span class="sourceLineNo">155</span> this.snapshotId = EnvironmentEdgeManager.currentTime();<a name="line.155"></a> -<span class="sourceLineNo">156</span> this.snapshotSize = keySize();<a name="line.156"></a> -<span class="sourceLineNo">157</span> if (!this.cellSet.isEmpty()) {<a name="line.157"></a> -<span class="sourceLineNo">158</span> this.snapshot = this.cellSet;<a name="line.158"></a> -<span class="sourceLineNo">159</span> this.cellSet = new CellSkipListSet(this.comparator);<a name="line.159"></a> -<span class="sourceLineNo">160</span> this.snapshotTimeRangeTracker = this.timeRangeTracker;<a name="line.160"></a> -<span class="sourceLineNo">161</span> this.timeRangeTracker = new TimeRangeTracker();<a name="line.161"></a> -<span class="sourceLineNo">162</span> // Reset heap to not include any keys<a name="line.162"></a> -<span class="sourceLineNo">163</span> this.size.set(DEEP_OVERHEAD);<a name="line.163"></a> -<span class="sourceLineNo">164</span> this.snapshotAllocator = this.allocator;<a name="line.164"></a> -<span class="sourceLineNo">165</span> // Reset allocator so we get a fresh buffer for the new memstore<a name="line.165"></a> -<span class="sourceLineNo">166</span> if (allocator != null) {<a name="line.166"></a> -<span class="sourceLineNo">167</span> String className = conf.get(MSLAB_CLASS_NAME, HeapMemStoreLAB.class.getName());<a name="line.167"></a> -<span class="sourceLineNo">168</span> this.allocator = ReflectionUtils.instantiateWithCustomCtor(className,<a name="line.168"></a> -<span class="sourceLineNo">169</span> new Class[] { Configuration.class }, new Object[] { conf });<a name="line.169"></a> -<span class="sourceLineNo">170</span> }<a name="line.170"></a> -<span class="sourceLineNo">171</span> timeOfOldestEdit = Long.MAX_VALUE;<a name="line.171"></a> -<span class="sourceLineNo">172</span> }<a name="line.172"></a> -<span class="sourceLineNo">173</span> }<a name="line.173"></a> -<span class="sourceLineNo">174</span> MemStoreSnapshot memStoreSnapshot = new MemStoreSnapshot(this.snapshotId, snapshot.size(), this.snapshotSize,<a name="line.174"></a> -<span class="sourceLineNo">175</span> this.snapshotTimeRangeTracker, new CollectionBackedScanner(snapshot, this.comparator),<a name="line.175"></a> -<span class="sourceLineNo">176</span> this.tagsPresent);<a name="line.176"></a> -<span class="sourceLineNo">177</span> this.tagsPresent = false;<a name="line.177"></a> -<span class="sourceLineNo">178</span> return memStoreSnapshot;<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> * The passed snapshot was successfully persisted; it can be let go.<a name="line.182"></a> -<span class="sourceLineNo">183</span> * @param id Id of the snapshot to clean out.<a name="line.183"></a> -<span class="sourceLineNo">184</span> * @throws UnexpectedStateException<a name="line.184"></a> -<span class="sourceLineNo">185</span> * @see #snapshot()<a name="line.185"></a> -<span class="sourceLineNo">186</span> */<a name="line.186"></a> -<span class="sourceLineNo">187</span> @Override<a name="line.187"></a> -<span class="sourceLineNo">188</span> public void clearSnapshot(long id) throws UnexpectedStateException {<a name="line.188"></a> -<span class="sourceLineNo">189</span> MemStoreLAB tmpAllocator = null;<a name="line.189"></a> -<span class="sourceLineNo">190</span> if (this.snapshotId != id) {<a name="line.190"></a> -<span class="sourceLineNo">191</span> throw new UnexpectedStateException("Current snapshot id is " + this.snapshotId + ",passed "<a name="line.191"></a> -<span class="sourceLineNo">192</span> + id);<a name="line.192"></a> -<span class="sourceLineNo">193</span> }<a name="line.193"></a> -<span class="sourceLineNo">194</span> // OK. Passed in snapshot is same as current snapshot. If not-empty,<a name="line.194"></a> -<span class="sourceLineNo">195</span> // create a new snapshot and let the old one go.<a name="line.195"></a> -<span class="sourceLineNo">196</span> if (!this.snapshot.isEmpty()) {<a name="line.196"></a> -<span class="sourceLineNo">197</span> this.snapshot = new CellSkipListSet(this.comparator);<a name="line.197"></a> -<span class="sourceLineNo">198</span> this.snapshotTimeRangeTracker = new TimeRangeTracker();<a name="line.198"></a> -<span class="sourceLineNo">199</span> }<a name="line.199"></a> -<span class="sourceLineNo">200</span> this.snapshotSize = 0;<a name="line.200"></a> -<span class="sourceLineNo">201</span> this.snapshotId = -1;<a name="line.201"></a> -<span class="sourceLineNo">202</span> if (this.snapshotAllocator != null) {<a name="line.202"></a> -<span class="sourceLineNo">203</span> tmpAllocator = this.snapshotAllocator;<a name="line.203"></a> -<span class="sourceLineNo">204</span> this.snapshotAllocator = null;<a name="line.204"></a> -<span class="sourceLineNo">205</span> }<a name="line.205"></a> -<span class="sourceLineNo">206</span> if (tmpAllocator != null) {<a name="line.206"></a> -<span class="sourceLineNo">207</span> tmpAllocator.close();<a name="line.207"></a> -<span class="sourceLineNo">208</span> }<a name="line.208"></a> -<span class="sourceLineNo">209</span> }<a name="line.209"></a> -<span class="sourceLineNo">210</span><a name="line.210"></a> -<span class="sourceLineNo">211</span> @Override<a name="line.211"></a> -<span class="sourceLineNo">212</span> public long getFlushableSize() {<a name="line.212"></a> -<span class="sourceLineNo">213</span> return this.snapshotSize > 0 ? this.snapshotSize : keySize();<a name="line.213"></a> -<span class="sourceLineNo">214</span> }<a name="line.214"></a> -<span class="sourceLineNo">215</span><a name="line.215"></a> -<span class="sourceLineNo">216</span> @Override<a name="line.216"></a> -<span class="sourceLineNo">217</span> public long getSnapshotSize() {<a name="line.217"></a> -<span class="sourceLineNo">218</span> return this.snapshotSize;<a name="line.218"></a> -<span class="sourceLineNo">219</span> }<a name="line.219"></a> -<span class="sourceLineNo">220</span><a name="line.220"></a> -<span class="sourceLineNo">221</span> /**<a name="line.221"></a> -<span class="sourceLineNo">222</span> * Write an update<a name="line.222"></a> -<span class="sourceLineNo">223</span> * @param cell<a name="line.223"></a> -<span class="sourceLineNo">224</span> * @return approximate size of the passed Cell.<a name="line.224"></a> -<span class="sourceLineNo">225</span> */<a name="line.225"></a> -<span class="sourceLineNo">226</span> @Override<a name="line.226"></a> -<span class="sourceLineNo">227</span> public long add(Cell cell) {<a name="line.227"></a> -<span class="sourceLineNo">228</span> Cell toAdd = maybeCloneWithAllocator(cell);<a name="line.228"></a> -<span class="sourceLineNo">229</span> return internalAdd(toAdd);<a name="line.229"></a> -<span class="sourceLineNo">230</span> }<a name="line.230"></a> -<span class="sourceLineNo">231</span><a name="line.231"></a> -<span class="sourceLineNo">232</span> @Override<a name="line.232"></a> -<span class="sourceLineNo">233</span> public long timeOfOldestEdit() {<a name="line.233"></a> -<span class="sourceLineNo">234</span> return timeOfOldestEdit;<a name="line.234"></a> -<span class="sourceLineNo">235</span> }<a name="line.235"></a> -<span class="sourceLineNo">236</span><a name="line.236"></a> -<span class="sourceLineNo">237</span> private boolean addToCellSet(Cell e) {<a name="line.237"></a> -<span class="sourceLineNo">238</span> boolean b = this.cellSet.add(e);<a name="line.238"></a> -<span class="sourceLineNo">239</span> // In no tags case this NoTagsKeyValue.getTagsLength() is a cheap call.<a name="line.239"></a> -<span class="sourceLineNo">240</span> // When we use ACL CP or Visibility CP which deals with Tags during<a name="line.240"></a> -<span class="sourceLineNo">241</span> // mutation, the TagRewriteCell.getTagsLength() is a cheaper call. We do not<a name="line.241"></a> -<span class="sourceLineNo">242</span> // parse the byte[] to identify the tags length.<a name="line.242"></a> -<span class="sourceLineNo">243</span> if(e.getTagsLength() > 0) {<a name="line.243"></a> -<span class="sourceLineNo">244</span> tagsPresent = true;<a name="line.244"></a> -<span class="sourceLineNo">245</span> }<a name="line.245"></a> -<span class="sourceLineNo">246</span> setOldestEditTimeToNow();<a name="line.246"></a> -<span class="sourceLineNo">247</span> return b;<a name="line.247"></a> -<span class="sourceLineNo">248</span> }<a name="line.248"></a> -<span class="sourceLineNo">249</span><a name="line.249"></a> -<span class="sourceLineNo">250</span> private boolean removeFromCellSet(Cell e) {<a name="line.250"></a> -<span class="sourceLineNo">251</span> boolean b = this.cellSet.remove(e);<a name="line.251"></a> -<span class="sourceLineNo">252</span> setOldestEditTimeToNow();<a name="line.252"></a> -<span class="sourceLineNo">253</span> return b;<a name="line.253"></a> -<span class="sourceLineNo">254</span> }<a name="line.254"></a> -<span class="sourceLineNo">255</span><a name="line.255"></a> -<span class="sourceLineNo">256</span> void setOldestEditTimeToNow() {<a name="line.256"></a> -<span class="sourceLineNo">257</span> if (timeOfOldestEdit == Long.MAX_VALUE) {<a name="line.257"></a> -<span class="sourceLineNo">258</span> timeOfOldestEdit = EnvironmentEdgeManager.currentTime();<a name="line.258"></a> -<span class="sourceLineNo">259</span> }<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> /**<a name="line.262"></a> -<span class="sourceLineNo">263</span> * Internal version of add() that doesn't clone Cells with the<a name="line.263"></a> -<span class="sourceLineNo">264</span> * allocator, and doesn't take the lock.<a name="line.264"></a> -<span class="sourceLineNo">265</span> *<a name="line.265"></a> -<span class="sourceLineNo">266</span> * Callers should ensure they already have the read lock taken<a name="line.266"></a> -<span class="sourceLineNo">267</span> */<a name="line.267"></a> -<span class="sourceLineNo">268</span> private long internalAdd(final Cell toAdd) {<a name="line.268"></a> -<span class="sourceLineNo">269</span> long s = heapSizeChange(toAdd, addToCellSet(toAdd));<a name="line.269"></a> -<span class="sourceLineNo">270</span> timeRangeTracker.includeTimestamp(toAdd);<a name="line.270"></a> -<span class="sourceLineNo">271</span> this.size.addAndGet(s);<a name="line.271"></a> -<span class="sourceLineNo">272</span> return s;<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> private Cell maybeCloneWithAllocator(Cell cell) {<a name="line.275"></a> -<span class="sourceLineNo">276</span> if (allocator == null) {<a name="line.276"></a> -<span class="sourceLineNo">277</span> return cell;<a name="line.277"></a> -<span class="sourceLineNo">278</span> }<a name="line.278"></a> -<span class="sourceLineNo">279</span><a name="line.279"></a> -<span class="sourceLineNo">280</span> int len = KeyValueUtil.length(cell);<a name="line.280"></a> -<span class="sourceLineNo">281</span> ByteRange alloc = allocator.allocateBytes(len);<a name="line.281"></a> -<span class="sourceLineNo">282</span> if (alloc == null) {<a name="line.282"></a> -<span class="sourceLineNo">283</span> // The allocation was too large, allocator decided<a name="line.283"></a> -<span class="sourceLineNo">284</span> // not to do anything with it.<a name="line.284"></a> -<span class="sourceLineNo">285</span> return cell;<a name="line.285"></a> -<span class="sourceLineNo">286</span> }<a name="line.286"></a> -<span class="sourceLineNo">287</span> assert alloc.getBytes() != null;<a name="line.287"></a> -<span class="sourceLineNo">288</span> KeyValueUtil.appendToByteArray(cell, alloc.getBytes(), alloc.getOffset());<a name="line.288"></a> -<span class="sourceLineNo">289</span> KeyValue newKv = new KeyValue(alloc.getBytes(), alloc.getOffset(), len);<a name="line.289"></a> -<span class="sourceLineNo">290</span> newKv.setSequenceId(cell.getSequenceId());<a name="line.290"></a> -<span class="sourceLineNo">291</span> return newKv;<a name="line.291"></a> -<span class="sourceLineNo">292</span> }<a name="line.292"></a> -<span class="sourceLineNo">293</span><a name="line.293"></a> -<span class="sourceLineNo">294</span> /**<a name="line.294"></a> -<span class="sourceLineNo">295</span> * Remove n key from the memstore. Only cells that have the same key and the<a name="line.295"></a> -<span class="sourceLineNo">296</span> * same memstoreTS are removed. It is ok to not update timeRangeTracker<a name="line.296"></a> -<span class="sourceLineNo">297</span> * in this call. It is possible that we can optimize this method by using<a name="line.297"></a> -<span class="sourceLineNo">298</span> * tailMap/iterator, but since this method is called rarely (only for<a name="line.298"></a> -<span class="sourceLineNo">299</span> * error recovery), we can leave those optimization for the future.<a name="line.299"></a> -<span class="sourceLineNo">300</span> * @param cell<a name="line.300"></a> -<span class="sourceLineNo">301</span> */<a name="line.301"></a> -<span class="sourceLineNo">302</span> @Override<a name="line.302"></a> -<span class="sourceLineNo">303</span> public void rollback(Cell cell) {<a name="line.303"></a> -<span class="sourceLineNo">304</span> // If the key is in the snapshot, delete it. We should not update<a name="line.304"></a> -<span class="sourceLineNo">305</span> // this.size, because that tracks the size of only the memstore and<a name="line.305"></a> -<span class="sourceLineNo">306</span> // not the snapshot. The flush of this snapshot to disk has not<a name="line.306"></a> -<span class="sourceLineNo">307</span> // yet started because Store.flush() waits for all rwcc transactions to<a name="line.307"></a> -<span class="sourceLineNo">308</span> // commit before starting the flush to disk.<a name="line.308"></a> -<span class="sourceLineNo">309</span> Cell found = this.snapshot.get(cell);<a name="line.309"></a> -<span class="sourceLineNo">310</span> if (found != null && found.getSequenceId() == cell.getSequenceId()) {<a name="line.310"></a> -<span class="sourceLineNo">311</span> this.snapshot.remove(cell);<a name="line.311"></a> -<span class="sourceLineNo">312</span> long sz = heapSizeChange(cell, true);<a name="line.312"></a> -<span class="sourceLineNo">313</span> this.snapshotSize -= sz;<a name="line.313"></a> -<span class="sourceLineNo">314</span> }<a name="line.314"></a> -<span class="sourceLineNo">315</span> // If the key is in the memstore, delete it. Update this.size.<a name="line.315"></a> -<span class="sourceLineNo">316</span> found = this.cellSet.get(cell);<a name="line.316"></a> -<span class="sourceLineNo">317</span> if (found != null && found.getSequenceId() == cell.getSequenceId()) {<a name="line.317"></a> -<span class="sourceLineNo">318</span> removeFromCellSet(cell);<a name="line.318"></a> -<span class="sourceLineNo">319</span> long s = heapSizeChange(cell, true);<a name="line.319"></a> -<span class="sourceLineNo">320</span> this.size.addAndGet(-s);<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><a name="line.323"></a> -<span class="sourceLineNo">324</span> /**<a name="line.324"></a> -<span class="sourceLineNo">325</span> * Write a delete<a name="line.325"></a> -<span class="sourceLineNo">326</span> * @param deleteCell<a name="line.326"></a> -<span class="sourceLineNo">327</span> * @return approximate size of the passed key and value.<a name="line.327"></a> -<span class="sourceLineNo">328</span> */<a name="line.328"></a> -<span class="sourceLineNo">329</span> @Override<a name="line.329"></a> -<span class="sourceLineNo">330</span> public long delete(Cell deleteCell) {<a name="line.330"></a> -<span class="sourceLineNo">331</span> long s = 0;<a name="line.331"></a> -<span class="sourceLineNo">332</span> Cell toAdd = maybeCloneWithAllocator(deleteCell);<a name="line.332"></a> -<span class="sourceLineNo">333</span> s += heapSizeChange(toAdd, addToCellSet(toAdd));<a name="line.333"></a> -<span class="sourceLineNo">334</span> timeRangeTracker.includeTimestamp(toAdd);<a name="line.334"></a> -<span class="sourceLineNo">335</span> this.size.addAndGet(s);<a name="line.335"></a> -<span class="sourceLineNo">336</span> return s;<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> * @param cell Find the row that comes after this one. If null, we return the<a name="line.340"></a> -<span class="sourceLineNo">341</span> * first.<a name="line.341"></a> -<span class="sourceLineNo">342</span> * @return Next row or null if none found.<a name="line.342"></a> -<span class="sourceLineNo">343</span> */<a name="line.343"></a> -<span class="sourceLineNo">344</span> Cell getNextRow(final Cell cell) {<a name="line.344"></a> -<span class="sourceLineNo">345</span> return getLowest(getNextRow(cell, this.cellSet), getNextRow(cell, this.snapshot));<a name="line.345"></a> -<span class="sourceLineNo">346</span> }<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> * @param a<a name="line.349"></a> -<span class="sourceLineNo">350</span> * @param b<a name="line.350"></a> -<span class="sourceLineNo">351</span> * @return Return lowest of a or b or null if both a and b are null<a name="line.351"></a> -<span class="sourceLineNo">352</span> */<a name="line.352"></a> -<span class="sourceLineNo">353</span> private Cell getLowest(final Cell a, final Cell b) {<a name="line.353"></a> -<span class="sourceLineNo">354</span> if (a == null) {<a name="line.354"></a> -<span class="sourceLineNo">355</span> return b;<a name="line.355"></a> -<span class="sourceLineNo">356</span> }<a name="line.356"></a> -<span class="sourceLineNo">357</span> if (b == null) {<a name="line.357"></a> -<span class="sourceLineNo">358</span> return a;<a name="line.358"></a> -<span class="sourceLineNo">359</span> }<a name="line.359"></a> -<span class="sourceLineNo">360</span> return comparator.compareRows(a, b) <= 0? a: b;<a name="line.360"></a> -<span class="sourceLineNo">361</span> }<a name="line.361"></a> -<span class="sourceLineNo">362</span><a name="line.362"></a> -<span class="sourceLineNo">363</span> /*<a name="line.363"></a> -<span class="sourceLineNo">364</span> * @param key Find row that follows this one. If null, return first.<a name="line.364"></a> -<span class="sourceLineNo">365</span> * @param map Set to look in for a row beyond <code>row</code>.<a name="line.365"></a> -<span class="sourceLineNo">366</span> * @return Next row or null if none found. If one found, will be a new<a name="line.366"></a> -<span class="sourceLineNo">367</span> * KeyValue -- can be destroyed by subsequent calls to this method.<a name="line.367"></a> -<span class="sourceLineNo">368</span> */<a name="line.368"></a> -<span class="sourceLineNo">369</span> private Cell getNextRow(final Cell key,<a name="line.369"></a> -<span class="sourceLineNo">370</span> final NavigableSet<Cell> set) {<a name="line.370"></a> -<span class="sourceLineNo">371</span> Cell result = null;<a name="line.371"></a> -<span class="sourceLineNo">372</span> SortedSet<Cell> tail = key == null? set: set.tailSet(key);<a name="line.372"></a> -<span class="sourceLineNo">373</span> // Iterate until we fall into the next row; i.e. move off current row<a name="line.373"></a> -<span class="sourceLineNo">374</span> for (Cell cell: tail) {<a name="line.374"></a> -<span class="sourceLineNo">375</span> if (comparator.compareRows(cell, key) <= 0)<a name="line.375"></a> -<span class="sourceLineNo">376</span> continue;<a name="line.376"></a> -<span class="sourceLineNo">377</span> // Note: Not suppressing deletes or expired cells. Needs to be handled<a name="line.377"></a> -<span class="sourceLineNo">378</span> // by higher up functions.<a name="line.378"></a> -<span class="sourceLineNo">379</span> result = cell;<a name="line.379"></a> -<span class="sourceLineNo">380</span> break;<a name="line.380"></a> -<span class="sourceLineNo">381</span> }<a name="line.381"></a> -<span class="sourceLineNo">382</span> return result;<a name="line.382"></a> -<span class="sourceLineNo">383</span> }<a name="line.383"></a> -<span class="sourceLineNo">384</span><a name="line.384"></a> -<span class="sourceLineNo">385</span> /**<a name="line.385"></a> -<span class="sourceLineNo">386</span> * Only used by tests. TODO: Remove<a name="line.386"></a> -<span class="sourceLineNo">387</span> *<a name="line.387"></a> -<span class="sourceLineNo">388</span> * Given the specs of a column, update it, first by inserting a new record,<a name="line.388"></a> -<span class="sourceLineNo">389</span> * then removing the old one. Since there is only 1 KeyValue involved, the memstoreTS<a name="line.389"></a> -<span class="sourceLineNo">390</span> * will be set to 0, thus ensuring that they instantly appear to anyone. The underlying<a name="line.390"></a> -<span class="sourceLineNo">391</span> * store will ensure that the insert/delete each are atomic. A scanner/reader will either<a name="line.391"></a> -<span class="sourceLineNo">392</span> * get the new value, or the old value and all readers will eventually only see the new<a name="line.392"></a> -<span class="sourceLineNo">393</span> * value after the old was removed.<a name="line.393"></a> -<span class="sourceLineNo">394</span> *<a name="line.394"></a> -<span class="sourceLineNo">395</span> * @param row<a name="line.395"></a> -<span class="sourceLineNo">396</span> * @param family<a name="line.396"></a> -<span class="sourceLineNo">397</span> * @param qualifier<a name="line.397"></a> -<span class="sourceLineNo">398</span> * @param newValue<a name="line.398"></a> -<span class="sourceLineNo">399</span> * @param now<a name="line.399"></a> -<span class="sourceLineNo">400</span> * @return Timestamp<a name="line.400"></a> -<span class="sourceLineNo">401</span> */<a name="line.401"></a> -<span class="sourceLineNo">402</span> @Override<a name="line.402"></a> -<span class="sourceLineNo">403</span> public long updateColumnValue(byte[] row,<a name="line.403"></a> -<span class="sourceLineNo">404</span> byte[] family,<a name="line.404"></a> -<span class="sourceLineNo">405</span> byte[] qualifier,<a name="line.405"></a> -<span class="sourceLineNo">406</span> long newValue,<a name="line.406"></a> -<span class="sourceLineNo">407</span> long now) {<a name="line.407"></a> -<span class="sourceLineNo">408</span> Cell firstCell = KeyValueUtil.createFirstOnRow(row, family, qualifier);<a name="line.408"></a> -<span class="sourceLineNo">409</span> // Is there a Cell in 'snapshot' with the same TS? If so, upgrade the timestamp a bit.<a name="line.409"></a> -<span class="sourceLineNo">410</span> SortedSet<Cell> snSs = snapshot.tailSet(firstCell);<a name="line.410"></a> -<span class="sourceLineNo">411</span> if (!snSs.isEmpty()) {<a name="line.411"></a> -<span class="sourceLineNo">412</span> Cell snc = snSs.first();<a name="line.412"></a> -<span class="sourceLineNo">413</span> // is there a matching Cell in the snapshot?<a name="line.413"></a> -<span class="sourceLineNo">414</span> if (CellUtil.matchingRow(snc, firstCell) && CellUtil.matchingQualifier(snc, firstCell)) {<a name="line.414"></a> -<span class="sourceLineNo">415</span> if (snc.getTimestamp() == now) {<a name="line.415"></a> -<span class="sourceLineNo">416</span> // poop,<a name="line.416"></a> -<span class="sourceLineNo">417</span> now += 1;<a name="line.417"></a> -<span class="sourceLineNo">418</span> }<a name="line.418"></a> -<span class="sourceLineNo">419</span> }<a name="line.419"></a> -<span class="sourceLineNo">420</span> }<a name="line.420"></a> -<span class="sourceLineNo">421</span><a name="line.421"></a> -<span class="sourceLineNo">422</span> // logic here: the new ts MUST be at least 'now'. But it could be larger if necessary.<a name="line.422"></a> -<span class="sourceLineNo">423</span> // But the timestamp should also be max(now, mostRecentTsInMemstore)<a name="line.423"></a> -<span class="sourceLineNo">424</span><a name="line.424"></a> -<span class="sourceLineNo">425</span> // so we cant add the new Cell w/o knowing what's there already, but we also<a name="line.425"></a> -<span class="sourceLineNo">426</span> // want to take this chance to delete some cells. So two loops (sad)<a name="line.426"></a> -<span class="sourceLineNo">427</span><a name="line.427"></a> -<span class="sourceLineNo">428</span> SortedSet<Cell> ss = cellSet.tailSet(firstCell);<a name="line.428"></a> -<span class="sourceLineNo">429</span> for (Cell cell : ss) {<a name="line.429"></a> -<span class="sourceLineNo">430</span> // if this isnt the row we are interested in, then bail:<a name="line.430"></a> -<span class="sourceLineNo">431</span> if (!CellUtil.matchingColumn(cell, family, qualifier)<a name="line.431"></a> -<span class="sourceLineNo">432</span> || !CellUtil.matchingRow(cell, firstCell)) {<a name="line.432"></a> -<span class="sourceLineNo">433</span> break; // rows dont match, bail.<a name="line.433"></a> -<span class="sourceLineNo">434</span> }<a name="line.434"></a> -<span class="sourceLineNo">435</span><a name="line.435"></a> -<span class="sourceLineNo">436</span> // if the qualifier matches and it's a put, just RM it out of the cellSet.<a name="line.436"></a> -<span class="sourceLineNo">437</span> if (cell.getTypeByte() == KeyValue.Type.Put.getCode() &&<a name="line.437"></a> -<span class="sourceLineNo">438</span> cell.getTimestamp() > now && CellUtil.matchingQualifier(firstCell, cell)) {<a name="line.438"></a> -<span class="sourceLineNo">439</span> now = cell.getTimestamp();<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> // create or update (upsert) a new Cell with<a name="line.443"></a> -<span class="sourceLineNo">444</span> // 'now' and a 0 memstoreTS == immediately visible<a name="line.444"></a> -<span class="sourceLineNo">445</span> List<Cell> cells = new ArrayList<Cell>(1);<a name="line.445"></a> -<span class="sourceLineNo">446</span> cells.add(new KeyValue(row, family, qualifier, now, Bytes.toBytes(newValue)));<a name="line.446"></a> -<span class="sourceLineNo">447</span> return upsert(cells, 1L);<a name="line.447"></a> -<span class="sourceLineNo">448</span> }<a name="line.448"></a> -<span class="sourceLineNo">449</span><a name="line.449"></a> -<span class="sourceLineNo">450</span> /**<a name="line.450"></a> -<span class="sourceLineNo">451</span> * Update or insert the specified KeyValues.<a name="line.451"></a> -<span class="sourceLineNo">452</span> * <p><a name="line.452"></a> -<span class="sourceLineNo">453</span> * For each KeyValue, insert into MemStore. This will atomically upsert the<a name="line.453"></a> -<span class="sourceLineNo">454</span> * value for that row/family/qualifier. If a KeyValue did already exist,<a name="line.454"></a> -<span class="sourceLineNo">455</span> * it will then be removed.<a name="line.455"></a> -<span class="sourceLineNo">456</span> * <p><a name="line.456"></a> -<span class="sourceLineNo">457</span> * This is called under row lock, so Get operations will still see updates<a name="line.457"></a> -<span class="sourceLineNo">458</span> * atomically. Scans will only see each KeyValue update as atomic.<a name="line.458"></a> -<span class="sourceLineNo">459</span> *<a name="line.459"></a> -<span class="sourceLineNo">460</span> * @param readpoint readpoint below which we can safely remove duplicate KVs<a name="line.460"></a> -<span class="sourceLineNo">461</span> * @return change in memstore size<a name="line.461"></a> -<span class="sourceLineNo">462</span> */<a name="line.462"></a> -<span class="sourceLineNo">463</span> @Override<a name="line.463"></a> -<span class="sourceLineNo">464</span> public long upsert(Iterable<Cell> cells, long readpoint) {<a name="line.464"></a> -<span class="sourceLineNo">465</span> long size = 0;<a name="line.465"></a> -<span class="sourceLineNo">466</span> for (Cell cell : cells) {<a name="line.466"></a> -<span class="sourceLineNo">467</span> size += upsert(cell, readpoint);<a name="line.467"></a> -<span class="sourceLineNo">468</span> }<a name="line.468"></a> -<span class="sourceLineNo">469</span> return size;<a name="line.469"></a> -<span class="sourceLineNo">470</span> }<a name="line.470"></a> -<span class="sourceLineNo">471</span><a name="line.471"></a> -<span class="sourceLineNo">472</span> /**<a name="line.472"></a> -<span class="sourceLineNo">473</span> * Inserts the specified KeyValue into MemStore and deletes any existing<a name="line.473"></a> -<span class="sourceLineNo">474</span> * versions of the same row/family/qualifier as the specified KeyValue.<a name="line.474"></a> -<span class="sourceLineNo">475</span> * <p><a name="line.475"></a> -<span class="sourceLineNo">476</span> * First, the specified KeyValue is inserted into the Memstore.<a name="line.476"></a> -<span class="sourceLineNo">477</span> * <p><a name="line.477"></a> -<span class="sourceLineNo">478</span> * If there are any existing KeyValues in this MemStore with the same row,<a name="line.478"></a> -<span class="sourceLineNo">479</span> * family, and qualifier, they are removed.<a name="line.479"></a> -<span class="sourceLineNo">480</span> * <p><a name="line.480"></a> -<span class="sourceLineNo">481</span> * Callers must hold the read lock.<a name="line.481"></a> -<span class="sourceLineNo">482</span> * @param readpoint Smallest outstanding readpoint; below which we can remove duplicate Cells.<a name="line.482"></a> -<span class="sourceLineNo">483</span> * @return change in size of MemStore<a name="line.483"></a> -<span class="sourceLineNo">484</span> */<a name="line.484"></a> -<span class="sourceLineNo">485</span> private long upsert(Cell cell, long readpoint) {<a name="line.485"></a> -<span class="sourceLineNo">486</span> // Add the Cell to the MemStore<a name="line.486"></a> -<span class="sourceLineNo">487</span> // Use the internalAdd method here since we (a) already have a lock<a name="line.487"></a> -<span class="sourceLineNo">488</span> // and (b) cannot safely use the MSLAB here without potentially<a name="line.488"></a> -<span class="sourceLineNo">489</span> // hitting OOME - see TestMemStore.testUpsertMSLAB for a<a name="line.489"></a> -<span class="sourceLineNo">490</span> // test that triggers the pathological case if we don't avoid MSLAB<a name="line.490"></a> -<span class="sourceLineNo">491</span> // here.<a name="line.491"></a> -<span class="sourceLineNo">492</span> long addedSize = internalAdd(cell);<a name="line.492"></a> -<span class="sourceLineNo">493</span><a name="line.493"></a> -<span class="sourceLineNo">494</span> // Get the Cells for the row/family/qualifier regardless of timestamp.<a name="line.494"></a> -<span class="sourceLineNo">495</span> // For this case we want to clean up any other puts<a name="line.495"></a> -<span class="sourceLineNo">496</span> Cell firstCell = KeyValueUtil.createFirstOnRow(<a name="line.496"></a> -<span class="sourceLineNo">497</span> cell.getRowArray(), cell.getRowOffset(), cell.getRowLength(),<a name="line.497"></a> -<span class="sourceLineNo">498</span> cell.getFamilyArray(), cell.getFamilyOffset(), cell.getFamilyLength(),<a name="line.498"></a> -<span class="sourceLineNo">499</span> cell.getQualifierArray(), cell.getQualifierOffset(), cell.getQualifierLength());<a name="line.499"></a> -<span class="sourceLineNo">500</span> SortedSet<Cell> ss = cellSet.tailSet(firstCell);<a name="line.500"></a> -<span class="sourceLineNo">501</span> Iterator<Cell> it = ss.iterator();<a name="line.501"></a> -<span class="sourceLineNo">502</span> // Versions visible to oldest scanner.<a name="line.502"></a> -<span class="sourceLineNo">503</span> int versionsVisible = 0;<a name="line.503"></a> -<span class="sourceLineNo">504</span> while ( it.hasNext() ) {<a name="line.504"></a> -<span class="sourceLineNo">505</span> Cell cur = it.next();<a name="line.505"></a> -<span class="sourceLineNo">506</span><a name="line.506"></a> -<span class="sourceLineNo">507</span> if (cell == cur) {<a name="line.507"></a> -<span class="sourceLineNo">508</span> // ignore the one just put in<a name="line.508"></a> -<span class="sourceLineNo">509</span> continue;<a name="line.509"></a> -<span class="sourceLineNo">510</span> }<a name="line.510"></a> -<span class="sourceLineNo">511</span> // check that this is the row and column we are interested in, otherwise bail<a name="line.511"></a> -<span class="sourceLineNo">512</span> if (CellUtil.matchingRow(cell, cur) && CellUtil.matchingQualifier(cell, cur)) {<a name="line.512"></a> -<span class="sourceLineNo">513</span> // only remove Puts that concurrent scanners cannot possibly see<a name="line.513"></a> -<span class="sourceLineNo">514</span> if (cur.getTypeByte() == KeyValue.Type.Put.getCode() &&<a name="line.514"></a> -<span class="sourceLineNo">515</span> cur.getSequenceId() <= readpoint) {<a name="line.515"></a> -<span class="sourceLineNo">516</span> if (versionsVisible >= 1) {<a name="line.516"></a> -<span class="sourceLineNo">517</span> // if we get here we have seen at least one version visible to the oldest scanner,<a name="line.517"></a> -<span class="sourceLineNo">518</span> // which means we can prove that no scanner will see this version<a name="line.518"></a> -<span class="sourceLineNo">519</span><a name="line.519"></a> -<span class="sourceLineNo">520</span> // false means there was a change, so give us the size.<a name="line.520"></a> -<span class="sourceLineNo">521</span> long delta = heapSizeChange(cur, true);<a name="line.521"></a> -<span class="sourceLineNo">522</span> addedSize -= delta;<a name="line.522"></a> -<span class="sourceLineNo">523</span> this.size.addAndGet(-delta);<a name="line.523"></a> -<span class="sourceLineNo">524</span> it.remove();<a name="line.524"></a> -<span class="sourceLineNo">525</span> setOldestEditTimeToNow();<a name="line.525"></a> -<span class="sourceLineNo">526</span> } else {<a name="line.526"></a> -<span class="sourceLineNo">527</span> versionsVisible++;<a name="line.527"></a> -<span class="sourceLineNo">528</span> }<a name="line.528"></a> -<span class="sourceLineNo">529</span> }<a name="line.529"></a> -<span class="sourceLineNo">530</span> } else {<a name="line.530"></a> -<span class="sourceLineNo">531</span> // past the row or column, done<a name="line.531"></a> -<span class="sourceLineNo">532</span> break;<a name="line.532"></a> -<span class="sourceLineNo">533</span> }<a name="line.533"></a> -<span class="sourceLineNo">534</span> }<a name="line.534"></a> -<span class="sourceLineNo">535</span> return addedSize;<a name="line.535"></a> -<span class="sourceLineNo">536</span> }<a name="line.536"></a> -<span class="sourceLineNo">537</span><a name="line.537"></a> -<span class="sourceLineNo">538</span> /**<a name="line.538"></a> -<span class="sourceLineNo">539</span> * @return scanner on memstore and snapshot in this order.<a name="line.539"></a> -<span class="sourceLineNo">540</span> */<a name="line.540"></a> -<span class="sourceLineNo">541</span> @Override<a name="line.541"></a> -<span class="sourceLineNo">542</span> public List<KeyValueScanner> getScanners(long readPt) {<a name="line.542"></a> -<span class="sourceLineNo">543</span> return Collections.<KeyValueScanner> singletonList(new MemStoreScanner(readPt));<a name="line.543"></a> -<span class="sourceLineNo">544</span> }<a name="line.544"></a> -<span class="sourceLineNo">545</span><a name="line.545"></a> -<span class="sourceLineNo">546</span> /**<a name="line.546"></a> -<span class="sourceLineNo">547</span> * Check if this memstore may contain the required keys<a name="line.547"></a> -<span class="sourceLineNo">548</span> * @param scan scan<a name="line.548"></a> -<span class="sourceLineNo">549</span> * @param store holds reference to cf<a name="line.549"></a> -<span class="sourceLineNo">550</span> * @param oldestUnexpiredTS<a name="line.550"></a> -<span class="sourceLineNo">551</span> * @return False if the key definitely does not exist in this Memstore<a name="line.551"></a> -<span class="sourceLineNo">552</span> */<a name="line.552"></a> -<span class="sourceLineNo">553</span> public boolean shouldSeek(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.553"></a> -<span class="sourceLineNo">554</span> byte[] cf = store.getFamily().getName();<a name="line.554"></a> -<span class="sourceLineNo">555</span> TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.555"></a> -<span class="sourceLineNo">556</span> if (timeRange == null) {<a name="line.556"></a> -<span class="sourceLineNo">557</span> timeRange = scan.getTimeRange();<a name="line.557"></a> -<span class="sourceLineNo">558</span> }<a name="line.558"></a> -<span class="sourceLineNo">559</span> return (timeRangeTracker.includesTimeRange(timeRange) ||<a name="line.559"></a> -<span class="sourceLineNo">560</span> snapshotTimeRangeTracker.includesTimeRange(timeRange))<a name="line.560"></a> -<span class="sourceLineNo">561</span> && (Math.max(timeRangeTracker.getMaximumTimestamp(),<a name="line.561"></a> -<span class="sourceLineNo">562</span> snapshotTimeRangeTracker.getMaximumTimestamp()) >=<a name="line.562"></a> -<span class="sourceLineNo">563</span> oldestUnexpiredTS);<a name="line.563"></a> -<span class="sourceLineNo">564</span> }<a name="line.564"></a> -<span class="sourceLineNo">565</span><a name="line.565"></a> -<span class="sourceLineNo">566</span> /*<a name="line.566"></a> -<span class="sourceLineNo">567</span> * MemStoreScanner implements the KeyValueScanner.<a name="line.567"></a> -<span class="sourceLineNo">568</span> * It lets the caller scan the contents of a memstore -- both current<a name="line.568"></a> -<span class="sourceLineNo">569</span> * map and snapshot.<a name="line.569"></a> -<span class="sourceLineNo">570</span> * This behaves as if it were a real scanner but does not maintain position.<a name="line.570"></a> -<span class="sourceLineNo">571</span> */<a name="line.571"></a> -<span class="sourceLineNo">572</span> protected class MemStoreScanner extends NonLazyKeyValueScanner {<a name="line.572"></a> -<span class="sourceLineNo">573</span> // Next row information for either cellSet or snapshot<a name="line.573"></a> -<span class="sourceLineNo">574</span> private Cell cellSetNextRow = null;<a name="line.574"></a> -<span class="sourceLineNo">575</span> private Cell snapshotNextRow = null;<a name="line.575"></a> -<span class="sourceLineNo">576</span><a name="line.576"></a> -<span class="sourceLineNo">577</span> // last iterated Cells for cellSet and snapshot (to restore iterator state after reseek)<a name="line.577"></a> -<span class="sourceLineNo">578</span> private Cell cellSetItRow = null;<a name="line.578"></a> -<span class="sourceLineNo">579</span> private Cell snapshotItRow = null;<a name="line.579"></a> -<span class="sourceLineNo">580</span><a name="line.580"></a> -<span class="sourceLineNo">581</span> // iterator based scanning.<a name="line.581"></a> -<span class="sourceLineNo">582</span> private Iterator<Cell> cellSetIt;<a name="line.582"></a> -<span class="sourceLineNo">583</span> private Iterator<Cell> snapshotIt;<a name="line.583"></a> -<span class="sourceLineNo">584</span><a name="line.584"></a> -<span class="sourceLineNo">585</span> // The cellSet and snapshot at the time of creating this scanner<a name="line.585"></a> -<span class="sourceLineNo">586</span> private CellSkipListSet cellSetAtCreation;<a name="line.586"></a> -<span class="sourceLineNo">587</span> private CellSkipListSet snapshotAtCreation;<a name="line.587"></a> -<span class="sourceLineNo">588</span><a name="line.588"></a> -<span class="sourceLineNo">589</span> // the pre-calculated Cell to be returned by peek() or next()<a name="line.589"></a> -<span class="sourceLineNo">590</span> private Cell theNext;<a name="line.590"></a> -<span class="sourceLineNo">591</span><a name="line.591"></a> -<span class="sourceLineNo">592</span> // The allocator and snapshot allocator at the time of creating this scanner<a name="line.592"></a> -<span class="sourceLineNo">593</span> volatile MemStoreLAB allocatorAtCreation;<a name="line.593"></a> -<span class="sourceLineNo">594</span> volatile MemStoreLAB snapshotAllocatorAtCreation;<a name="line.594"></a> -<span class="sourceLineNo">595</span><a name="line.595"></a> -<span class="sourceLineNo">596</span> // A flag represents whether could stop skipping Cells for MVCC<a name="line.596"></a> -<span class="sourceLineNo">597</span> // if have encountered the next row. Only used for reversed scan<a name="line.597"></a> -<span class="sourceLineNo">598</span> private boolean stopSkippingCellsIfNextRow = false;<a name="line.598"></a> -<span class="sourceLineNo">599</span><a name="line.599"></a> -<span class="sourceLineNo">600</span> private long readPoint;<a name="line.600"></a> -<span class="sourceLineNo">601</span><a name="line.601"></a> -<span class="sourceLineNo">602</span> /*<a name="line.602"></a> -<span class="sourceLineNo">603</span> Some notes...<a name="line.603"></a> -<span class="sourceLineNo">604</span><a name="line.604"></a> -<span class="sourceLineNo">605</span> So memstorescanner is fixed at creation time. this includes pointers/iterators into<a name="line.605"></a> -<span class="sourceLineNo">606</span> existing kvset/snapshot. during a snapshot creation, the kvset is null, and the<a name="line.606"></a> -<span class="sourceLineNo">607</span> snapshot is moved. since kvset is null there is no point on reseeking on both,<a name="line.607"></a> -<span class="sourceLineNo">608</span> we can save us the trouble. During the snapshot->hfile transition, the memstore<a name="line.608"></a> -<span class="sourceLineNo">609</span> scanner is re-created by StoreScanner#updateReaders(). StoreScanner should<a name="line.609"></a> -<span class="sourceLineNo">610</span> potentially do something smarter by adjusting the existing memstore scanner.<a name="line.610"></a> -<span class="sourceLineNo">611</span><a name="line.611"></a> -<span class="sourceLineNo">612</span> But there is a greater problem here, that being once a scanner has progressed<a name="line.612"></a> -<span class="sourceLineNo">613</span> during a snapshot scenario, we currently iterate past the kvset then 'finish' up.<a name="line.613"></a> -<span class="sourceLineNo">614</span> if a scan lasts a little while, there is a chance for new entries in kvset to<a name="line.614"></a> -<span class="sourceLineNo">615</span> become available but we will never see them. This needs to be handled at the<a name="line.615"></a> -<span class="sourceLineNo">616</span> StoreScanner level with coordination with MemStoreScanner.<a name="line.616"></a> -<span class="sourceLineNo">617</span><a name="line.617"></a> -<span class="sourceLineNo">618</span> Currently, this problem is only partly managed: during the small amount of time<a name="line.618"></a> -<span class="sourceLineNo">619</span> when the StoreScanner has not yet created a new MemStoreScanner, we will miss<a name="line.619"></a> -<span class="sourceLineNo">620</span> the adds to kvset in the MemStoreScanner.<a name="line.620"></a> -<span class="sourceLineNo">621</span> */<a name="line.621"></a> -<span class="sourceLineNo">622</span><a name="line.622"></a> -<span class="sourceLineNo">623</span> MemStoreScanner(long readPoint) {<a name="line.623"></a> -<span class="sourceLineNo">624</span> super();<a name="line.624"></a> -<span class="sourceLineNo">625</span><a name="line.625"></a> -<span class="sourceLineNo">626</span> this.readPoint = readPoint;<a name="line.626"></a> -<span class="sourceLineNo">627</span> cellSetAtCreation = cellSet;<a name="line.627"></a> -<span class="sourceLineNo">628</span> snapshotAtCreation = snapshot;<a name="line.628"></a> -<span class="sourceLineNo">629</span> if (allocator != null) {<a name="line.629"></a> -<span class="sourceLineNo">630</span> this.allocatorAtCreation = allocator;<a name="line.630"></a> -<span class="sourceLineNo">631</span> this.allocatorAtCreation.incScannerCount();<a name="line.631"></a> -<span class="sourceLineNo">632</span> }<a name="line.632"></a> -<span class="sourceLineNo">633</span> if (snapshotAllocator != null) {<a name="line.633"></a> -<span class="sourceLineNo">634</span> this.snapshotAllocatorAtCreation = snapshotAllocator;<a name="line.634"></a> -<span class="sourceLineNo">635</span> this.snapshotAllocatorAtCreation.incScannerCount();<a name="line.635"></a> -<span class="sourceLineNo">636</span> }<a name="line.636"></a> -<span class="sourceLineNo">637</span> if (Trace.isTracing() && Trace.currentSpan() != null) {<a name="line.637"></a> -<span class="sourceLineNo">638</span> Trace.currentSpan().addTimelineAnnotation("Creating MemStoreScanner");<a name="line.638"></a> -<span class="sourceLineNo">639</span> }<a name="line.639"></a> -<span class="sourceLineNo">640</span> }<a name="line.640"></a> -<span class="sourceLineNo">641</span><a name="line.641"></a> -<span class="sourceLineNo">642</span> /**<a name="line.642"></a> -<span class="sourceLineNo">643</span> * Lock on 'this' must be held by caller.<a name="line.643"></a> -<span class="sourceLineNo">644</span> * @param it<a name="line.644"></a> -<span class="sourceLineNo">645</span> * @return Next Cell<a name="line.645"></a> -<span class="sourceLineNo">646</span> */<a name="line.646"></a> -<span class="sourceLineNo">647</span> private Cell getNext(Iterator<Cell> it) {<a name="line.647"></a> -<span class="sourceLineNo">648</span> Cell startCell = theNext;<a name="line.648"></a> -<span class="sourceLineNo">649</span> Cell v = null;<a name="line.649"></a> -<span class="sourceLineNo">650</span> try {<a name="line.650"></a> -<span class="sourceLineNo">651</span> while (it.hasNext()) {<a name="line.651"></a> -<span class="sourceLineNo">652</span> v = it.next();<a name="line.652"></a> -<span class="sourceLineNo">653</span> if (v.getSequenceId() <= this.readPoint) {<a name="line.653"></a> -<span class="sourceLineNo">654</span> return v;<a name="line.654"></a> -<span class="sourceLineNo">655</span> }<a name="line.655"></a> -<span class="sourceLineNo">656</span> if (stopSkippingCellsIfNextRow && startCell != null<a name="line.656"></a> -<span class="sourceLineNo">657</span> && comparator.compareRows(v, startCell) > 0) {<a name="line.657"></a> -<span class="sourceLineNo">658</span> return null;<a name="line.658"></a> -<span class="sourceLineNo">659</span> }<a name="line.659"></a> -<span class="sourceLineNo">660</span> }<a name="line.660"></a> -<span class="sourceLineNo">661</span><a name="line.661"></a> -<span class="sourceLineNo">662</span> return null;<a name="line.662"></a> -<span class="sourceLineNo">663</span> } finally {<a name="line.663"></a> -<span class="sourceLineNo">664</span> if (v != null) {<a name="line.664"></a> -<span class="sourceLineNo">665</span> // in all cases, remember the last Cell iterated to<a name="line.665"></a> -<span class="sourceLineNo">666</span> if (it == snapshotIt) {<a name="line.666"></a> -<span class="sourceLineNo">667</span> snapshotItRow = v;<a name="line.667"></a> -<span class="sourceLineNo">668</span> } else {<a name="line.668"></a> -<span class="sourceLineNo">669</span> cellSetItRow = v;<a name="line.669"></a> -<span class="sourceLineNo">670</span> }<a name="line.670"></a> -<span class="sourceLineNo">671</span> }<a name="line.671"></a> -<span class="sourceLineNo">672</span> }<a name="line.672"></a> -<span class="sourceLineNo">673</span> }<a name="line.673"></a> -<span class="sourceLineNo">674</span><a name="line.674"></a> -<span class="sourceLineNo">675</span> /**<a name="line.675"></a> -<span class="sourceLineNo">676</span> * Set the scanner at the seek key.<a name="line.676"></a> -<span class="sourceLineNo">677</span> * Must be called only once: there is no thread safety between the scanner<a name="line.677"></a> -<span class="sourceLineNo">678</span> * and the memStore.<a name="line.678"></a> -<span class="sourceLineNo">679</span> * @param key seek value<a name="line.679"></a> -<span class="sourceLineNo">680</span> * @return false if the key is null or if there is no data<a name="line.680"></a> -<span class="sourceLineNo">681</span> */<a name="line.681"></a> -<span class="sourceLineNo">682</span> @Override<a name="line.682"></a> -<span class="sourceLineNo">683</span> public synchronized boolean seek(Cell key) {<a name="line.683"></a> -<span class="sourceLineNo">684</span> if (key == null) {<a name="line.684"></a> -<span class="sourceLineNo">685</span> close();<a name="line.685"></a> -<span class="sourceLineNo">686</span> return false;<a name="line.686"></a> -<span class="sourceLineNo">687</span> }<a name="line.687"></a> -<span class="sourceLineNo">688</span> // kvset and snapshot will never be null.<a name="line.688"></a> -<span class="sourceLineNo">689</span> // if tailSet can't find anything, SortedSet is empty (not null).<a name="line.689"></a> -<span class="sourceLineNo">690</span> cellSetIt = cellSetAtCreation.tailSet(key).iterator();<a name="line.690"></a> -<span class="sourceLineNo">691</span> snapshotIt = snapshotAtCreation.tailSet(key).iterator();<a name="line.691"></a> -<span class="sourceLineNo">692</span> cellSetItRow = null;<a name="line.692"></a> -<span class="sourceLineNo">693</span> snapshotItRow = null;<a name="line.693"></a> -<span class="sourceLineNo">694</span><a name="line.694"></a> -<span class="sourceLineNo">695</span> return seekInSubLists(key);<a name="line.695"></a> -<span class="sourceLineNo">696</span> }<a name="line.696"></a> -<span class="sourceLineNo">697</span><a name="line.697"></a> -<span class="sourceLineNo">698</span><a name="line.698"></a> -<span class="sourceLineNo">699</span> /**<a name="line.699"></a> -<span class="sourceLineNo">700</span> * (Re)initialize the iterators after a seek or a reseek.<a name="line.700"></a> -<span class="sourceLineNo">701</span> */<a name="line.701"></a> -<span class="sourceLineNo">702</span> private synchronized boolean seekInSubLists(Cell key){<a name="line.702"></a> -<span class="sourceLineNo">703</span> cellSetNextRow = getNext(cellSetIt);<a name="line.703"></a> -<span class="sourceLineNo">704</span> snapshotNextRow = getNext(snapshotIt);<a name="line.704"></a> -<span class="sourceLineNo">705</span><a name="line.705"></a> -<span class="sourceLineNo">706</span> // Calculate the next value<a name="line.706"></a> -<span class="sourceLineNo">707</span> theNext = getLowest(cellSetNextRow, snapshotNextRow);<a name="line.707"></a> -<span class="sourceLineNo">708</span><a name="line.708"></a> -<span class="sourceLineNo">709</span> // has data<a name="line.709"></a> -<span class="sourceLineNo">710</span> return (theNext != null);<a name="line.710"></a> -<span class="sourceLineNo">711</span> }<a name="line.711"></a> -<span class="sourceLineNo">712</span><a name="line.712"></a> -<span class="sourceLineNo">713</span><a name="line.713"></a> -<span class="sourceLineNo">714</span> /**<a name="line.714"></a> -<span class="sourceLineNo">715</span> * Move forward on the sub-lists set previously by seek.<a name="line.715"></a> -<span class="sourceLineNo">716</span> * @param key seek value (should be non-null)<a name="line.716"></a> -<span class="sourceLineNo">717</span> * @return true if there is at least one KV to read, false otherwise<a name="line.717"></a> -<span class="sourceLineNo">718</span> */<a name="line.718"></a> -<span class="sourceLineNo">719</span> @Override<a name="line.719"></a> -<span class="sourceLineNo">720</span> public synchronized boolean reseek(Cell key) {<a name="line.720"></a> -<span class="sourceLineNo">721</span> /*<a name="line.721"></a> -<span class="sourceLineNo">722</span> See HBASE-4195 & HBASE-3855 & HBASE-6591 for the background on this implementation.<a name="line.722"></a> -<span class="sourceLineNo">723</span> This code is executed concurrently with flush and puts, without locks.<a name="line.723"></a> -<span class="sourceLineNo">724</span> Two points must be known when working on this code:<a name="line.724"></a> -<span class="sourceLineNo">725</span> 1) It's not possible to use the 'kvTail' and 'snapshot'<a name="line.725"></a> -<span class="sourceLineNo">726</span> variables, as they are modified during a flush.<a name="line.726"></a> -<span class="sourceLineNo">727</span> 2) The ideal implementation for performance would use the sub skip list<a name="line.727"></a> -<span class="sourceLineNo">728</span> implicitly pointed by the iterators 'kvsetIt' and<a name="line.728"></a> -<span class="sourceLineNo">729</span> 'snapshotIt'. Unfortunately the Java API does not offer a method to<a name="line.729"></a> -<span class="sourceLineNo">730</span> get it. So we remember the last keys we iterated to and restore<a name="line.730"></a> -<span class="sourceLineNo">731</span> the reseeked set to at least that point.<a name="line.731"></a> -<span class="sourceLineNo">732</span> */<a name="line.732"></a> -<span class="sourceLineNo">733</span> cellSetIt = cellSetAtCreation.tailSet(getHighest(key, cellSetItRow)).iterator();<a name="line.733"></a> -<span class="sourceLineNo">734</span> snapshotIt = snapshotAtCreation.tailSet(getHighest(key, snapshotItRow)).iterator();<a name="line.734"></a> -<span class="sourceLineNo">735</span><a name="line.735"></a> -<span class="sourceLineNo">736</span> return seekInSubLists(key);<a name="line.736"></a> -<span class="sourceLineNo">737</span> }<a name="line.737"></a> -<span class="sourceLineNo">738</span><a name="line.738"></a> -<span class="sourceLineNo">739</span><a name="line.739"></a> -<span class="sourceLineNo">740</span> @Override<a name="line.740"></a> -<span class="sourceLineNo">741</span> public synchronized Cell peek() {<a name="line.741"></a> -<span class="sourceLineNo">742</span> //DebugPrint.println(" MS@" + hashCode() + " peek = " + getLowest());<a name="line.742"></a> -<span class="sourceLineNo">743</span> return theNext;<a name="line.743"></a> -<span class="sourceLineNo">744</span> }<a name="line.744"></a> -<span class="sourceLineNo">745</span><a name="line.745"></a> -<span class="sourceLineNo">746</span> @Override<a name="line.746"></a> -<span class="sourceLineNo">747</span> public synchronized Cell next() {<a name="line.747"></a> -<span class="sourceLineNo">748</span> if (theNext == null) {<a name="line.748"></a> -<span class="sourceLineNo">749</span> return null;<a name="line.749"></a> -<span class="sourceLineNo">750</span> }<a name="line.750"></a> -<span class="sourceLineNo">751</span><a name="line.751"></a> -<span class="sourceLineNo">752</span> final Cell ret = theNext;<a name="line.752"></a> -<span class="sourceLineNo">753</span><a name="line.753"></a> -<span class="sourceLineNo">754</span> // Advance one of the iterators<a name="line.754"></a> -<span class="sourceLineNo">755</span> if (theNext == cellSetNextRow) {<a name="line.755"></a> -<span class="sourceLineNo">756</span> cellSetNextRow = getNext(cellSetIt);<a name="line.756"></a> -<span class="sourceLineNo">757</span> } else {<a name="line.757"></a> -<span class="sourceLineNo">758</span> snapshotNextRow = getNext(snapshotIt);<a name="line.758"></a> -<span class="sourceLineNo">759</span> }<a name="line.759"></a> -<span class="sourceLineNo">760</span><a name="line.760"></a> -<span class="sourceLineNo">761</span> // Calculate the next value<a name="line.761"></a> -<span class="sourceLineNo">762</span> theNext = getLowest(cellSetNextRow, snapshotNextRow);<a name="line.762"></a> -<span class="sourceLineNo">763</span><a name="line.763"></a> -<span class="sourceLineNo">764</span> //long readpoint = ReadWriteConsistencyControl.getThreadReadPoint();<a name="line.764"></a> -<span class="sourceLineNo">765</span> //DebugPrint.println(" MS@" + hashCode() + " next: " + theNext + " next_next: " +<a name="line.765"></a> -<span class="sourceLineNo">766</span> // getLowest() + " threadpoint=" + readpoint);<a name="line.766"></a> -<span class="sourceLineNo">767</span> return ret;<a name="line.767"></a> -<span class="sourceLineNo">768</span> }<a name="line.768"></a> -<span class="sourceLineNo">769</span><a name="line.769"></a> -<span class="sourceLineNo">770</span> /*<a name="line.770"></a> -<span class="sourceLineNo">771</span> * Returns the lower of the two key values, or null if they are both null.<a name="line.771"></a> -<span class="sourceLineNo">772</span> * This uses comparator.compare() to compare the KeyValue using the memstore<a name="line.772"></a> -<span class="sourceLineNo">773</span> * comparator.<a name="line.773"></a> -<span class="sourceLineNo">774</span> */<a name="line.774"></a> -<span class="sourceLineNo">775</span> private Cell getLowest(Cell first, Cell second) {<a name="line.775"></a> -<span class="sourceLineNo">776</span> if (first == null && second == null) {<a name="line.776"></a> -<span class="sourceLineNo">777</span> return null;<a name="line.777"></a> -<span class="sourceLineNo">778</span> }<a name="line.778"></a> -<span class="sourceLineNo">779</span> if (first != null && second != null) {<a name="line.779"></a> -<span class="sourceLineNo">780</span> int compare = comparator.compare(first, second);<a name="line.780"></a> -<span class="sourceLineNo">781</span> return (compare <= 0 ? first : second);<a name="line.781"></a> -<span class="sourceLineNo">782</span> }<a name="line.782"></a> -<span class="sourceLineNo">783</span> return (first != null ? first : second);<a name="line.783"></a> -<span class="sourceLineNo">784</span> }<a name="line.784"></a> -<span class="sourceLineNo">785</span><a name="line.785"></a> -<span class="sourceLineNo">786</span> /*<a name="line.786"></a> -<span class="sourceLineNo">787</span> * Returns the higher of the two cells, or null if they are both null.<a name="line.787"></a> -<span class="sourceLineNo">788</span> * This uses comparator.compare() to compare the Cell using the memstore<a name="line.788"></a> -<span class="sourceLineNo">789</span> * comparator.<a name="line.789"></a> -<span class="sourceLineNo">790</span> */<a name="line.790"></a> -<span class="sourceLineNo">791</span> private Cell getHighest(Cell first, Cell second) {<a name="line.791"></a> -<span class="sourceLineNo">792</span> if (first == null && second == null) {<a name="line.792"></a> -<span class="sourceLineNo">793</span> return null;<a name="line.793"></a> -<span class="sourceLineNo">794</span> }<a name="line.794"></a> -<span class="sourceLineNo">795</span> if (first != null && second != null) {<a name="line.795"></a> -<span class="sourceLineNo">796</span> int compare = comparator.compare(first, second);<a name="line.796"></a> -<span class="sourceLineNo">797</span> return (compare > 0 ? first : second);<a name="line.797"></a> -<span class="sourceLineNo">798</span> }<a name="line.798"></a> -<span class="sourceLineNo">799</span> return (first != null ? first : second);<a name="line.799"></a> -<span class="sourceLineNo">800</span> }<a name="line.800"></a> -<span class="sourceLineNo">801</span><a name="line.801"></a> -<span class="sourceLineNo">802</span> public synchronized void close() {<a name="line.802"></a> -<span class="sourceLineNo">803</span> this.cellSetNextRow = null;<a name="line.803"></a> -<span class="sourceLineNo">804</span> this.snapshotNextRow = null;<a name="line.804"></a> -<span class="sourceLineNo">805</span><a name="line.805"></a> -<span class="sourceLineNo">806</span> this.cellSetIt = null;<a name="line.806"></a> -<span class="sourceLineNo">807</span> this.snapshotIt = null;<a name="line.807"></a> -<span class="sourceLineNo">808</span><a name="line.808"></a> -<span class="sourceLineNo">809</span> if (allocatorAtCreation != null) {<a name="line.809"></a> -<span class="sourceLineNo">810</span> this.allocatorAtCreation.decScannerCount();<a name="line.810"></a> -<span class="sourceLineNo">811</span> this.allocatorAtCreation = null;<a name="line.811"></a> -<span class="sourceLineNo">812</span> }<a name="line.812"></a> -<span class="sourceLineNo">813</span> if (snapshotAllocatorAtCreation != null) {<a name="line.813"></a> -<span class="sourceLineNo">814</span> this.snapshotAllocatorAtCreation.decScannerCount();<a name="line.814"></a> -<span class="sourceLineNo">815</span> this.snapshotAllocatorAtCreation = null;<a name="line.815"></a> -<span class="sourceLineNo">816</span> }<a name="line.816"></a> -<span class="sourceLineNo">817</span><a name="line.817"></a> -<span class="sourceLineNo">818</span> this.cellSetItRow = null;<a name="line.818"></a> -<span class="sourceLineNo">819</span> this.snapshotItRow = null;<a name="line.819"></a> -<span class="sourceLineNo">820</span> }<a name="line.820"></a> -<span class="sourceLineNo">821</span><a name="line.821"></a> -<span class="sourceLineNo">822</span> /**<a name="line.822"></a> -<span class="sourceLineNo">823</span> * MemStoreScanner returns max value as sequence id because it will<a name="line.823"></a> -<span class="sourceLineNo">824</span> * always have the latest data among all files.<a name="line.824"></a> -<span class="sourceLineNo">825</span> */<a name="line.825"></a> -<span class="sourceLineNo">826</span> @Override<a name="line.826"></a> -<span class="sourceLineNo">827</span> public long getSequenceID() {<a name="line.827"></a> -<span class="sourceLineNo">828</span> return Long.MAX_VALUE;<a name="line.828"></a> -<span class="sourceLineNo">829</span> }<a name="line.829"></a> -<span class="sourceLineNo">830</span><a name="line.830"></a> -<span class="sourceLineNo">831</span> @Override<a name="line.831"></a> -<span class="sourceLineNo">832</span> public boolean shouldUseScanner(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.832"></a> -<span class="sourceLineNo">833</span> return shouldSeek(scan, store, oldestUnexpiredTS);<a name="line.833"></a> -<span class="sourceLineNo">834</span> }<a name="line.834"></a> -<span class="sourceLineNo">835</span><a name="line.835"></a> -<span class="sourceLineNo">836</span> /**<a name="line.836"></a> -<span class="sourceLineNo">837</span> * Seek scanner to the given key first. If it returns false(means<a name="line.837"></a> -<span class="sourceLineNo">838</span> * peek()==null) or scanner's peek row is bigger than row of given key, seek<a name="line.838"></a> -<span class="sourceLineNo">839</span> * the scanner to the previous row of given key<a name="line.839"></a> -<span class="sourceLineNo">840</span> */<a name="line.840"></a> -<span class="sourceLineNo">841</span> @Override<a name="line.841"></a> -<span class="sourceLineNo">842</span> public synchronized boolean backwardSeek(Cell key) {<a name="line.842"></a> -<span class="sourceLineNo">843</span> seek(key);<a name="line.843"></a> -<span class="sourceLineNo">844</span> if (peek() == null || comparator.compareRows(peek(), key) > 0) {<a name="line.844"></a> -<span class="sourceLineNo">845</span> return seekToPreviousRow(key);<a name="line.845"></a> -<span class="sourceLineNo">846</span> }<a name="line.846"></a> -<span class="sourceLineNo">847</span> return true;<a name="line.847"></a> -<span class="sourceLineNo">848</span> }<a name="line.848"></a> -<span class="sourceLineNo">849</span><a name="line.849"></a> -<span class="sourceLineNo">850</span> /**<a name="line.850"></a> -<span class="sourceLineNo">851</span> * Separately get the KeyValue before the specified key from kvset and<a name="line.851"></a> -<span class="sourceLineNo">852</span> * snapshotset, and use the row of higher one as the previous row of<a name="line.852"></a> -<span class="sourceLineNo">853</span> * specified key, then seek to the first KeyValue of previous row<a name="line.853"></a> -<span class="sourceLineNo">854</span> */<a name="line.854"></a> -<span class="sourceLineNo">855</span> @Override<a name="line.855"></a> -<span class="sourceLineNo">856</span> public synchronized boolean seekToPreviousRow(Cell originalKey) {<a name="line.856"></a> -<span class="sourceLineNo">857</span> boolean keepSeeking = false;<a name="line.857"></a> -<span class="sourceLineNo">858</span> Cell key = originalKey;<a name="line.858"></a> -<span class="sourceLineNo">859</span> do {<a name="line.859"></a> -<span class="sourceLineNo">860</span> Cell firstKeyOnRow = CellUtil.createFirstOnRow(key);<a name="line.860"></a> -<span class="sourceLineNo">861</span> SortedSet<Cell> cellHead = cellSetAtCreation.headSet(firstKeyOnRow);<a name="line.861"></a> -<span class="sourceLineNo">862</span> Cell cellSetBeforeRow = cellHead.isEmpty() ? null : cellHead.last();<a name="line.862"></a> -<span class="sourceLineNo">863</span> SortedSet<Cell> snapshotHead = snapshotAtCreation<a name="line.863"></a> -<span class="sourceLineNo">864</span> .headSet(firstKeyOnRow);<a name="line.864"></a> -<span class="sourceLineNo">865</span> Cell snapshotBeforeRow = snapshotHead.isEmpty() ? null : snapshotHead<a name="line.865"></a> -<span class="sourceLineNo">866</span> .last();<a name="line.866"></a> -<span class="sourceLineNo">867</span> Cell lastCellBeforeRow = getHighest(cellSetBeforeRow, snapshotBeforeRow);<a name="line.867"></a> -<span class="sourceLineNo">868</span> if (lastCellBeforeRow == null) {<a name="line.868"></a> -<span class="sourceLineNo">869</span> theNext = null;<a name="line.869"></a> -<span class="sourceLineNo">870</span> return false;<a name="line.870"></a> -<span class="sourceLineNo">871</span> }<a name="line.871"></a> -<span class="sourceLineNo">872</span> Cell firstKeyOnPreviousRow = CellUtil.createFirstOnRow(lastCellBeforeRow);<a name="line.872"></a> -<span class="sourceLineNo">873</span> this.stopSkippingCellsIfNextRow = true;<a name="line.873"></a> -<span class="sourceLineNo">874</span> seek(firstKeyOnPreviousRow);<a name="line.874"></a> -<span class="sourceLineNo">875</span> this.stopSkippingCellsIfNextRow = false;<a name="line.875"></a> -<span class="sourceLineNo">876</span> if (peek() == null<a name="line.876"></a> -<span class="sourceLineNo">877</span> || comparator.compareRows(peek(), firstKeyOnPreviousRow) > 0) {<a name="line.877"></a> -<span class="sourceLineNo">878</span> keepSeeking = true;<a name="line.878"></a> -<span class="sourceLineNo">879</span> key = firstKeyOnPreviousRow;<a name="line.879"></a> -<span class="sourceLineNo">880</span> continue;<a name="line.880"></a> -<span class="sourceLineNo">881</span> } else {<a name="line.881"></a> -<span class="sourceLineNo">882</span> keepSeeking = false;<a name="line.882"></a> -<span class="sourceLineNo">883</span> }<a name="line.883"></a> -<span class="sourceLineNo">884</span> } while (keepSeeking);<a name="line.884"></a> -<span class="sourceLineNo">885</span> return true;<a name="line.885"></a> -<span class="sourceLineNo">886</span> }<a name="line.886"></a> -<span class="sourceLineNo">887</span><a name="line.887"></a> -<span class="sourceLineNo">888</span> @Override<a name="line.888"></a> -<span class="sourceLineNo">889</span> public synchronized boolean seekToLastRow() {<a name="line.889"></a> -<span class="sourceLineNo">890</span> Cell first = cellSetAtCreation.isEmpty() ? null : cellSetAtCreation<a name="line.890"></a> -<span class="sourceLineNo">891</span> .last();<a name="line.891"></a> -<span class="sourceLineNo">892</span> Cell second = snapshotAtCreation.isEmpty() ? null<a name="line.892"></a> -<span class="sourceLineNo">893</span> : snapshotAtCreation.last();<a name="line.893"></a> -<span class="sourceLineNo">894</span> Cell higherCell = getHighest(first, second);<a name="line.894"></a> -<span class="sourceLineNo">895</span> if (higherCell == null) {<a name="line.895"></a> -<span class="sourceLineNo">896</span> return false;<a name="line.896"></a> -<span class="sourceLineNo">897</span> }<a name="line.897"></a> -<span class="sourceLineNo">898</span> Cell firstCellOnLastRow = CellUtil.createFirstOnRow(higherCell);<a name="line.898"></a> -<span class="sourceLineNo">899</span> if (seek(firstCellOnLastRow)) {<a name="line.899"></a> -<span class="sourceLineNo">900</span> return true;<a name="line.900"></a> -<span class="sourceLineNo">901</span> } else {<a name="line.901"></a> -<span class="sourceLineNo">902</span> return seekToPreviousRow(higherCell);<a name="line.902"></a> -<span class="sourceLineNo">903</span> }<a name="line.903"></a> -<span class="sourceLineNo">904</span><a name="line.904"></a> -<span class="sourceLineNo">905</span> }<a name="line.905"></a> -<span class="sourceLineNo">906</span> }<a name="line.906"></a> -<span class="sourceLineNo">907</span><a name="line.907"></a> -<span class="sourceLineNo">908</span> public final static long FIXED_OVERHEAD = ClassSize.align(ClassSize.OBJECT<a name="line.908"></a> -<span class="sourceLineNo">909</span> + (9 * ClassSize.REFERENCE) + (3 * Bytes.SIZEOF_LONG) + Bytes.SIZEOF_BOOLEAN);<a name="line.909"></a> -<span class="sourceLineNo">910</span><a name="line.910"></a> -<span class="sourceLineNo">911</span> public final static long DEEP_OVERHEAD = ClassSize.align(FIXED_OVERHEAD +<a name="line.911"></a> -<span class="sourceLineNo">912</span> ClassSize.ATOMIC_LONG + (2 * ClassSize.TIMERANGE_TRACKER) +<a name="line.912"></a> -<span class="sourceLineNo">913</span> (2 * ClassSize.CELL_SKIPLIST_SET) + (2 * ClassSize.CONCURRENT_SKIPLISTMAP));<a name="line.913"></a> -<span class="sourceLineNo">914</span><a name="line.914"></a> -<span class="sourceLineNo">915</span> /*<a name="line.915"></a> -<span class="sourceLineNo">916</span> * Calculate how the MemStore size has changed. Includes overhead of the<a name="line.916"></a> -<span class="sourceLineNo">917</span> * backing Map.<a name="line.917"></a> -<span class="sourceLineNo">918</span> * @param
<TRUNCATED>
