hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From git-site-r...@apache.org
Subject [19/51] [partial] hbase-site git commit: Published site at 82d554e3783372cc6b05489452c815b57c06f6cd.
Date Thu, 11 May 2017 14:59:35 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/1241ee85/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html
index 1c88305..f81ea94 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html
@@ -35,530 +35,538 @@
 <span class="sourceLineNo">027</span>import java.util.List;<a name="line.27"></a>
 <span class="sourceLineNo">028</span>import java.util.concurrent.atomic.LongAdder;<a name="line.28"></a>
 <span class="sourceLineNo">029</span><a name="line.29"></a>
-<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.Cell;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.31"></a>
-<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.32"></a>
-<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.HConstants;<a name="line.33"></a>
-<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.34"></a>
-<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.client.Scan;<a name="line.35"></a>
-<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.io.TimeRange;<a name="line.36"></a>
-<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.io.hfile.HFileScanner;<a name="line.37"></a>
-<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.regionserver.querymatcher.ScanQueryMatcher;<a name="line.38"></a>
-<span class="sourceLineNo">039</span><a name="line.39"></a>
-<span class="sourceLineNo">040</span>/**<a name="line.40"></a>
-<span class="sourceLineNo">041</span> * KeyValueScanner adaptor over the Reader.  It also provides hooks into<a name="line.41"></a>
-<span class="sourceLineNo">042</span> * bloom filter things.<a name="line.42"></a>
-<span class="sourceLineNo">043</span> */<a name="line.43"></a>
-<span class="sourceLineNo">044</span>@InterfaceAudience.LimitedPrivate("Coprocessor")<a name="line.44"></a>
-<span class="sourceLineNo">045</span>public class StoreFileScanner implements KeyValueScanner {<a name="line.45"></a>
-<span class="sourceLineNo">046</span>  // the reader it comes from:<a name="line.46"></a>
-<span class="sourceLineNo">047</span>  private final StoreFileReader reader;<a name="line.47"></a>
-<span class="sourceLineNo">048</span>  private final HFileScanner hfs;<a name="line.48"></a>
-<span class="sourceLineNo">049</span>  private Cell cur = null;<a name="line.49"></a>
-<span class="sourceLineNo">050</span>  private boolean closed = false;<a name="line.50"></a>
-<span class="sourceLineNo">051</span><a name="line.51"></a>
-<span class="sourceLineNo">052</span>  private boolean realSeekDone;<a name="line.52"></a>
-<span class="sourceLineNo">053</span>  private boolean delayedReseek;<a name="line.53"></a>
-<span class="sourceLineNo">054</span>  private Cell delayedSeekKV;<a name="line.54"></a>
-<span class="sourceLineNo">055</span><a name="line.55"></a>
-<span class="sourceLineNo">056</span>  private final boolean enforceMVCC;<a name="line.56"></a>
-<span class="sourceLineNo">057</span>  private final boolean hasMVCCInfo;<a name="line.57"></a>
-<span class="sourceLineNo">058</span>  // A flag represents whether could stop skipping KeyValues for MVCC<a name="line.58"></a>
-<span class="sourceLineNo">059</span>  // if have encountered the next row. Only used for reversed scan<a name="line.59"></a>
-<span class="sourceLineNo">060</span>  private boolean stopSkippingKVsIfNextRow = false;<a name="line.60"></a>
-<span class="sourceLineNo">061</span><a name="line.61"></a>
-<span class="sourceLineNo">062</span>  private static LongAdder seekCount;<a name="line.62"></a>
-<span class="sourceLineNo">063</span><a name="line.63"></a>
-<span class="sourceLineNo">064</span>  private final boolean canOptimizeForNonNullColumn;<a name="line.64"></a>
-<span class="sourceLineNo">065</span><a name="line.65"></a>
-<span class="sourceLineNo">066</span>  private final long readPt;<a name="line.66"></a>
-<span class="sourceLineNo">067</span><a name="line.67"></a>
-<span class="sourceLineNo">068</span>  // Order of this scanner relative to other scanners when duplicate key-value is found.<a name="line.68"></a>
-<span class="sourceLineNo">069</span>  // Higher values means scanner has newer data.<a name="line.69"></a>
-<span class="sourceLineNo">070</span>  private final long scannerOrder;<a name="line.70"></a>
-<span class="sourceLineNo">071</span><a name="line.71"></a>
-<span class="sourceLineNo">072</span>  /**<a name="line.72"></a>
-<span class="sourceLineNo">073</span>   * Implements a {@link KeyValueScanner} on top of the specified {@link HFileScanner}<a name="line.73"></a>
-<span class="sourceLineNo">074</span>   * @param useMVCC If true, scanner will filter out updates with MVCC larger than {@code readPt}.<a name="line.74"></a>
-<span class="sourceLineNo">075</span>   * @param readPt MVCC value to use to filter out the updates newer than this scanner.<a name="line.75"></a>
-<span class="sourceLineNo">076</span>   * @param hasMVCC Set to true if underlying store file reader has MVCC info.<a name="line.76"></a>
-<span class="sourceLineNo">077</span>   * @param scannerOrder Order of the scanner relative to other scanners. See<a name="line.77"></a>
-<span class="sourceLineNo">078</span>   *          {@link KeyValueScanner#getScannerOrder()}.<a name="line.78"></a>
-<span class="sourceLineNo">079</span>   * @param canOptimizeForNonNullColumn {@code true} if we can make sure there is no null column,<a name="line.79"></a>
-<span class="sourceLineNo">080</span>   *          otherwise {@code false}. This is a hint for optimization.<a name="line.80"></a>
-<span class="sourceLineNo">081</span>   */<a name="line.81"></a>
-<span class="sourceLineNo">082</span>  public StoreFileScanner(StoreFileReader reader, HFileScanner hfs, boolean useMVCC,<a name="line.82"></a>
-<span class="sourceLineNo">083</span>      boolean hasMVCC, long readPt, long scannerOrder, boolean canOptimizeForNonNullColumn) {<a name="line.83"></a>
-<span class="sourceLineNo">084</span>    this.readPt = readPt;<a name="line.84"></a>
-<span class="sourceLineNo">085</span>    this.reader = reader;<a name="line.85"></a>
-<span class="sourceLineNo">086</span>    this.hfs = hfs;<a name="line.86"></a>
-<span class="sourceLineNo">087</span>    this.enforceMVCC = useMVCC;<a name="line.87"></a>
-<span class="sourceLineNo">088</span>    this.hasMVCCInfo = hasMVCC;<a name="line.88"></a>
-<span class="sourceLineNo">089</span>    this.scannerOrder = scannerOrder;<a name="line.89"></a>
-<span class="sourceLineNo">090</span>    this.canOptimizeForNonNullColumn = canOptimizeForNonNullColumn;<a name="line.90"></a>
-<span class="sourceLineNo">091</span>  }<a name="line.91"></a>
-<span class="sourceLineNo">092</span><a name="line.92"></a>
-<span class="sourceLineNo">093</span>  boolean isPrimaryReplica() {<a name="line.93"></a>
-<span class="sourceLineNo">094</span>    return reader.isPrimaryReplicaReader();<a name="line.94"></a>
-<span class="sourceLineNo">095</span>  }<a name="line.95"></a>
-<span class="sourceLineNo">096</span><a name="line.96"></a>
-<span class="sourceLineNo">097</span>  /**<a name="line.97"></a>
-<span class="sourceLineNo">098</span>   * Return an array of scanners corresponding to the given<a name="line.98"></a>
-<span class="sourceLineNo">099</span>   * set of store files.<a name="line.99"></a>
+<span class="sourceLineNo">030</span>import org.apache.hadoop.fs.Path;<a name="line.30"></a>
+<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.Cell;<a name="line.31"></a>
+<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.32"></a>
+<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.33"></a>
+<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.HConstants;<a name="line.34"></a>
+<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.35"></a>
+<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.client.Scan;<a name="line.36"></a>
+<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.io.TimeRange;<a name="line.37"></a>
+<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.io.hfile.HFileScanner;<a name="line.38"></a>
+<span class="sourceLineNo">039</span>import org.apache.hadoop.hbase.regionserver.querymatcher.ScanQueryMatcher;<a name="line.39"></a>
+<span class="sourceLineNo">040</span><a name="line.40"></a>
+<span class="sourceLineNo">041</span>/**<a name="line.41"></a>
+<span class="sourceLineNo">042</span> * KeyValueScanner adaptor over the Reader.  It also provides hooks into<a name="line.42"></a>
+<span class="sourceLineNo">043</span> * bloom filter things.<a name="line.43"></a>
+<span class="sourceLineNo">044</span> */<a name="line.44"></a>
+<span class="sourceLineNo">045</span>@InterfaceAudience.LimitedPrivate("Coprocessor")<a name="line.45"></a>
+<span class="sourceLineNo">046</span>public class StoreFileScanner implements KeyValueScanner {<a name="line.46"></a>
+<span class="sourceLineNo">047</span>  // the reader it comes from:<a name="line.47"></a>
+<span class="sourceLineNo">048</span>  private final StoreFileReader reader;<a name="line.48"></a>
+<span class="sourceLineNo">049</span>  private final HFileScanner hfs;<a name="line.49"></a>
+<span class="sourceLineNo">050</span>  private Cell cur = null;<a name="line.50"></a>
+<span class="sourceLineNo">051</span>  private boolean closed = false;<a name="line.51"></a>
+<span class="sourceLineNo">052</span><a name="line.52"></a>
+<span class="sourceLineNo">053</span>  private boolean realSeekDone;<a name="line.53"></a>
+<span class="sourceLineNo">054</span>  private boolean delayedReseek;<a name="line.54"></a>
+<span class="sourceLineNo">055</span>  private Cell delayedSeekKV;<a name="line.55"></a>
+<span class="sourceLineNo">056</span><a name="line.56"></a>
+<span class="sourceLineNo">057</span>  private final boolean enforceMVCC;<a name="line.57"></a>
+<span class="sourceLineNo">058</span>  private final boolean hasMVCCInfo;<a name="line.58"></a>
+<span class="sourceLineNo">059</span>  // A flag represents whether could stop skipping KeyValues for MVCC<a name="line.59"></a>
+<span class="sourceLineNo">060</span>  // if have encountered the next row. Only used for reversed scan<a name="line.60"></a>
+<span class="sourceLineNo">061</span>  private boolean stopSkippingKVsIfNextRow = false;<a name="line.61"></a>
+<span class="sourceLineNo">062</span><a name="line.62"></a>
+<span class="sourceLineNo">063</span>  private static LongAdder seekCount;<a name="line.63"></a>
+<span class="sourceLineNo">064</span><a name="line.64"></a>
+<span class="sourceLineNo">065</span>  private final boolean canOptimizeForNonNullColumn;<a name="line.65"></a>
+<span class="sourceLineNo">066</span><a name="line.66"></a>
+<span class="sourceLineNo">067</span>  private final long readPt;<a name="line.67"></a>
+<span class="sourceLineNo">068</span><a name="line.68"></a>
+<span class="sourceLineNo">069</span>  // Order of this scanner relative to other scanners when duplicate key-value is found.<a name="line.69"></a>
+<span class="sourceLineNo">070</span>  // Higher values means scanner has newer data.<a name="line.70"></a>
+<span class="sourceLineNo">071</span>  private final long scannerOrder;<a name="line.71"></a>
+<span class="sourceLineNo">072</span><a name="line.72"></a>
+<span class="sourceLineNo">073</span>  /**<a name="line.73"></a>
+<span class="sourceLineNo">074</span>   * Implements a {@link KeyValueScanner} on top of the specified {@link HFileScanner}<a name="line.74"></a>
+<span class="sourceLineNo">075</span>   * @param useMVCC If true, scanner will filter out updates with MVCC larger than {@code readPt}.<a name="line.75"></a>
+<span class="sourceLineNo">076</span>   * @param readPt MVCC value to use to filter out the updates newer than this scanner.<a name="line.76"></a>
+<span class="sourceLineNo">077</span>   * @param hasMVCC Set to true if underlying store file reader has MVCC info.<a name="line.77"></a>
+<span class="sourceLineNo">078</span>   * @param scannerOrder Order of the scanner relative to other scanners. See<a name="line.78"></a>
+<span class="sourceLineNo">079</span>   *          {@link KeyValueScanner#getScannerOrder()}.<a name="line.79"></a>
+<span class="sourceLineNo">080</span>   * @param canOptimizeForNonNullColumn {@code true} if we can make sure there is no null column,<a name="line.80"></a>
+<span class="sourceLineNo">081</span>   *          otherwise {@code false}. This is a hint for optimization.<a name="line.81"></a>
+<span class="sourceLineNo">082</span>   */<a name="line.82"></a>
+<span class="sourceLineNo">083</span>  public StoreFileScanner(StoreFileReader reader, HFileScanner hfs, boolean useMVCC,<a name="line.83"></a>
+<span class="sourceLineNo">084</span>      boolean hasMVCC, long readPt, long scannerOrder, boolean canOptimizeForNonNullColumn) {<a name="line.84"></a>
+<span class="sourceLineNo">085</span>    this.readPt = readPt;<a name="line.85"></a>
+<span class="sourceLineNo">086</span>    this.reader = reader;<a name="line.86"></a>
+<span class="sourceLineNo">087</span>    this.hfs = hfs;<a name="line.87"></a>
+<span class="sourceLineNo">088</span>    this.enforceMVCC = useMVCC;<a name="line.88"></a>
+<span class="sourceLineNo">089</span>    this.hasMVCCInfo = hasMVCC;<a name="line.89"></a>
+<span class="sourceLineNo">090</span>    this.scannerOrder = scannerOrder;<a name="line.90"></a>
+<span class="sourceLineNo">091</span>    this.canOptimizeForNonNullColumn = canOptimizeForNonNullColumn;<a name="line.91"></a>
+<span class="sourceLineNo">092</span>  }<a name="line.92"></a>
+<span class="sourceLineNo">093</span><a name="line.93"></a>
+<span class="sourceLineNo">094</span>  boolean isPrimaryReplica() {<a name="line.94"></a>
+<span class="sourceLineNo">095</span>    return reader.isPrimaryReplicaReader();<a name="line.95"></a>
+<span class="sourceLineNo">096</span>  }<a name="line.96"></a>
+<span class="sourceLineNo">097</span><a name="line.97"></a>
+<span class="sourceLineNo">098</span>  /**<a name="line.98"></a>
+<span class="sourceLineNo">099</span>   * Return an array of scanners corresponding to the given set of store files.<a name="line.99"></a>
 <span class="sourceLineNo">100</span>   */<a name="line.100"></a>
-<span class="sourceLineNo">101</span>  public static List&lt;StoreFileScanner&gt; getScannersForStoreFiles(<a name="line.101"></a>
-<span class="sourceLineNo">102</span>      Collection&lt;StoreFile&gt; files,<a name="line.102"></a>
-<span class="sourceLineNo">103</span>      boolean cacheBlocks,<a name="line.103"></a>
-<span class="sourceLineNo">104</span>      boolean usePread, long readPt) throws IOException {<a name="line.104"></a>
-<span class="sourceLineNo">105</span>    return getScannersForStoreFiles(files, cacheBlocks,<a name="line.105"></a>
-<span class="sourceLineNo">106</span>                                   usePread, false, false, readPt);<a name="line.106"></a>
-<span class="sourceLineNo">107</span>  }<a name="line.107"></a>
-<span class="sourceLineNo">108</span><a name="line.108"></a>
-<span class="sourceLineNo">109</span>  /**<a name="line.109"></a>
-<span class="sourceLineNo">110</span>   * Return an array of scanners corresponding to the given set of store files.<a name="line.110"></a>
-<span class="sourceLineNo">111</span>   */<a name="line.111"></a>
-<span class="sourceLineNo">112</span>  public static List&lt;StoreFileScanner&gt; getScannersForStoreFiles(<a name="line.112"></a>
-<span class="sourceLineNo">113</span>      Collection&lt;StoreFile&gt; files, boolean cacheBlocks, boolean usePread,<a name="line.113"></a>
-<span class="sourceLineNo">114</span>      boolean isCompaction, boolean useDropBehind, long readPt) throws IOException {<a name="line.114"></a>
-<span class="sourceLineNo">115</span>    return getScannersForStoreFiles(files, cacheBlocks, usePread, isCompaction,<a name="line.115"></a>
-<span class="sourceLineNo">116</span>        useDropBehind, null, readPt);<a name="line.116"></a>
-<span class="sourceLineNo">117</span>  }<a name="line.117"></a>
-<span class="sourceLineNo">118</span><a name="line.118"></a>
-<span class="sourceLineNo">119</span>  /**<a name="line.119"></a>
-<span class="sourceLineNo">120</span>   * Return an array of scanners corresponding to the given set of store files, And set the<a name="line.120"></a>
-<span class="sourceLineNo">121</span>   * ScanQueryMatcher for each store file scanner for further optimization<a name="line.121"></a>
-<span class="sourceLineNo">122</span>   */<a name="line.122"></a>
-<span class="sourceLineNo">123</span>  public static List&lt;StoreFileScanner&gt; getScannersForStoreFiles(Collection&lt;StoreFile&gt; files,<a name="line.123"></a>
-<span class="sourceLineNo">124</span>      boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean canUseDrop,<a name="line.124"></a>
-<span class="sourceLineNo">125</span>      ScanQueryMatcher matcher, long readPt) throws IOException {<a name="line.125"></a>
-<span class="sourceLineNo">126</span>    List&lt;StoreFileScanner&gt; scanners = new ArrayList&lt;&gt;(files.size());<a name="line.126"></a>
-<span class="sourceLineNo">127</span>    List&lt;StoreFile&gt; sortedFiles = new ArrayList&lt;&gt;(files);<a name="line.127"></a>
-<span class="sourceLineNo">128</span>    Collections.sort(sortedFiles, StoreFile.Comparators.SEQ_ID);<a name="line.128"></a>
-<span class="sourceLineNo">129</span>    for (int i = 0, n = sortedFiles.size(); i &lt; n; i++) {<a name="line.129"></a>
-<span class="sourceLineNo">130</span>      StoreFile sf = sortedFiles.get(i);<a name="line.130"></a>
-<span class="sourceLineNo">131</span>      sf.initReader();<a name="line.131"></a>
-<span class="sourceLineNo">132</span>      StoreFileScanner scanner = sf.getReader().getStoreFileScanner(cacheBlocks, usePread,<a name="line.132"></a>
-<span class="sourceLineNo">133</span>        isCompaction, readPt, i, matcher != null ? !matcher.hasNullColumnInQuery() : false);<a name="line.133"></a>
-<span class="sourceLineNo">134</span>      scanners.add(scanner);<a name="line.134"></a>
-<span class="sourceLineNo">135</span>    }<a name="line.135"></a>
-<span class="sourceLineNo">136</span>    return scanners;<a name="line.136"></a>
-<span class="sourceLineNo">137</span>  }<a name="line.137"></a>
-<span class="sourceLineNo">138</span><a name="line.138"></a>
-<span class="sourceLineNo">139</span>  /**<a name="line.139"></a>
-<span class="sourceLineNo">140</span>   * Get scanners for compaction. We will create a separated reader for each store file to avoid<a name="line.140"></a>
-<span class="sourceLineNo">141</span>   * contention with normal read request.<a name="line.141"></a>
-<span class="sourceLineNo">142</span>   */<a name="line.142"></a>
-<span class="sourceLineNo">143</span>  public static List&lt;StoreFileScanner&gt; getScannersForCompaction(Collection&lt;StoreFile&gt; files,<a name="line.143"></a>
-<span class="sourceLineNo">144</span>      boolean canUseDropBehind, long readPt) throws IOException {<a name="line.144"></a>
-<span class="sourceLineNo">145</span>    List&lt;StoreFileScanner&gt; scanners = new ArrayList&lt;&gt;(files.size());<a name="line.145"></a>
-<span class="sourceLineNo">146</span>    List&lt;StoreFile&gt; sortedFiles = new ArrayList&lt;&gt;(files);<a name="line.146"></a>
-<span class="sourceLineNo">147</span>    Collections.sort(sortedFiles, StoreFile.Comparators.SEQ_ID);<a name="line.147"></a>
-<span class="sourceLineNo">148</span>    boolean succ = false;<a name="line.148"></a>
-<span class="sourceLineNo">149</span>    try {<a name="line.149"></a>
-<span class="sourceLineNo">150</span>      for (int i = 0, n = sortedFiles.size(); i &lt; n; i++) {<a name="line.150"></a>
-<span class="sourceLineNo">151</span>        scanners.add(sortedFiles.get(i).getStreamScanner(canUseDropBehind, false, false, true,<a name="line.151"></a>
-<span class="sourceLineNo">152</span>          readPt, i, false));<a name="line.152"></a>
-<span class="sourceLineNo">153</span>      }<a name="line.153"></a>
-<span class="sourceLineNo">154</span>      succ = true;<a name="line.154"></a>
-<span class="sourceLineNo">155</span>    } finally {<a name="line.155"></a>
-<span class="sourceLineNo">156</span>      if (!succ) {<a name="line.156"></a>
-<span class="sourceLineNo">157</span>        for (StoreFileScanner scanner : scanners) {<a name="line.157"></a>
-<span class="sourceLineNo">158</span>          scanner.close();<a name="line.158"></a>
-<span class="sourceLineNo">159</span>        }<a name="line.159"></a>
-<span class="sourceLineNo">160</span>      }<a name="line.160"></a>
-<span class="sourceLineNo">161</span>    }<a name="line.161"></a>
-<span class="sourceLineNo">162</span>    return scanners;<a name="line.162"></a>
-<span class="sourceLineNo">163</span>  }<a name="line.163"></a>
-<span class="sourceLineNo">164</span><a name="line.164"></a>
-<span class="sourceLineNo">165</span>  public String toString() {<a name="line.165"></a>
-<span class="sourceLineNo">166</span>    return "StoreFileScanner[" + hfs.toString() + ", cur=" + cur + "]";<a name="line.166"></a>
-<span class="sourceLineNo">167</span>  }<a name="line.167"></a>
-<span class="sourceLineNo">168</span><a name="line.168"></a>
-<span class="sourceLineNo">169</span>  public Cell peek() {<a name="line.169"></a>
-<span class="sourceLineNo">170</span>    return cur;<a name="line.170"></a>
-<span class="sourceLineNo">171</span>  }<a name="line.171"></a>
-<span class="sourceLineNo">172</span><a name="line.172"></a>
-<span class="sourceLineNo">173</span>  public Cell next() throws IOException {<a name="line.173"></a>
-<span class="sourceLineNo">174</span>    Cell retKey = cur;<a name="line.174"></a>
+<span class="sourceLineNo">101</span>  public static List&lt;StoreFileScanner&gt; getScannersForStoreFiles(Collection&lt;StoreFile&gt; files,<a name="line.101"></a>
+<span class="sourceLineNo">102</span>      boolean cacheBlocks, boolean usePread, long readPt) throws IOException {<a name="line.102"></a>
+<span class="sourceLineNo">103</span>    return getScannersForStoreFiles(files, cacheBlocks, usePread, false, false, readPt);<a name="line.103"></a>
+<span class="sourceLineNo">104</span>  }<a name="line.104"></a>
+<span class="sourceLineNo">105</span><a name="line.105"></a>
+<span class="sourceLineNo">106</span>  /**<a name="line.106"></a>
+<span class="sourceLineNo">107</span>   * Return an array of scanners corresponding to the given set of store files.<a name="line.107"></a>
+<span class="sourceLineNo">108</span>   */<a name="line.108"></a>
+<span class="sourceLineNo">109</span>  public static List&lt;StoreFileScanner&gt; getScannersForStoreFiles(Collection&lt;StoreFile&gt; files,<a name="line.109"></a>
+<span class="sourceLineNo">110</span>      boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean useDropBehind,<a name="line.110"></a>
+<span class="sourceLineNo">111</span>      long readPt) throws IOException {<a name="line.111"></a>
+<span class="sourceLineNo">112</span>    return getScannersForStoreFiles(files, cacheBlocks, usePread, isCompaction, useDropBehind, null,<a name="line.112"></a>
+<span class="sourceLineNo">113</span>      readPt);<a name="line.113"></a>
+<span class="sourceLineNo">114</span>  }<a name="line.114"></a>
+<span class="sourceLineNo">115</span><a name="line.115"></a>
+<span class="sourceLineNo">116</span>  /**<a name="line.116"></a>
+<span class="sourceLineNo">117</span>   * Return an array of scanners corresponding to the given set of store files, And set the<a name="line.117"></a>
+<span class="sourceLineNo">118</span>   * ScanQueryMatcher for each store file scanner for further optimization<a name="line.118"></a>
+<span class="sourceLineNo">119</span>   */<a name="line.119"></a>
+<span class="sourceLineNo">120</span>  public static List&lt;StoreFileScanner&gt; getScannersForStoreFiles(Collection&lt;StoreFile&gt; files,<a name="line.120"></a>
+<span class="sourceLineNo">121</span>      boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean canUseDrop,<a name="line.121"></a>
+<span class="sourceLineNo">122</span>      ScanQueryMatcher matcher, long readPt) throws IOException {<a name="line.122"></a>
+<span class="sourceLineNo">123</span>    List&lt;StoreFileScanner&gt; scanners = new ArrayList&lt;&gt;(files.size());<a name="line.123"></a>
+<span class="sourceLineNo">124</span>    List&lt;StoreFile&gt; sortedFiles = new ArrayList&lt;&gt;(files);<a name="line.124"></a>
+<span class="sourceLineNo">125</span>    Collections.sort(sortedFiles, StoreFile.Comparators.SEQ_ID);<a name="line.125"></a>
+<span class="sourceLineNo">126</span>    boolean canOptimizeForNonNullColumn = matcher != null ? !matcher.hasNullColumnInQuery() : false;<a name="line.126"></a>
+<span class="sourceLineNo">127</span>    for (int i = 0, n = sortedFiles.size(); i &lt; n; i++) {<a name="line.127"></a>
+<span class="sourceLineNo">128</span>      StoreFile sf = sortedFiles.get(i);<a name="line.128"></a>
+<span class="sourceLineNo">129</span>      sf.initReader();<a name="line.129"></a>
+<span class="sourceLineNo">130</span>      StoreFileScanner scanner;<a name="line.130"></a>
+<span class="sourceLineNo">131</span>      if (usePread) {<a name="line.131"></a>
+<span class="sourceLineNo">132</span>        scanner = sf.getPreadScanner(cacheBlocks, readPt, i, canOptimizeForNonNullColumn);<a name="line.132"></a>
+<span class="sourceLineNo">133</span>      } else {<a name="line.133"></a>
+<span class="sourceLineNo">134</span>        scanner = sf.getStreamScanner(canUseDrop, cacheBlocks, isCompaction, readPt, i,<a name="line.134"></a>
+<span class="sourceLineNo">135</span>          canOptimizeForNonNullColumn);<a name="line.135"></a>
+<span class="sourceLineNo">136</span>      }<a name="line.136"></a>
+<span class="sourceLineNo">137</span>      scanners.add(scanner);<a name="line.137"></a>
+<span class="sourceLineNo">138</span>    }<a name="line.138"></a>
+<span class="sourceLineNo">139</span>    return scanners;<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>   * Get scanners for compaction. We will create a separated reader for each store file to avoid<a name="line.143"></a>
+<span class="sourceLineNo">144</span>   * contention with normal read request.<a name="line.144"></a>
+<span class="sourceLineNo">145</span>   */<a name="line.145"></a>
+<span class="sourceLineNo">146</span>  public static List&lt;StoreFileScanner&gt; getScannersForCompaction(Collection&lt;StoreFile&gt; files,<a name="line.146"></a>
+<span class="sourceLineNo">147</span>      boolean canUseDropBehind, long readPt) throws IOException {<a name="line.147"></a>
+<span class="sourceLineNo">148</span>    List&lt;StoreFileScanner&gt; scanners = new ArrayList&lt;&gt;(files.size());<a name="line.148"></a>
+<span class="sourceLineNo">149</span>    List&lt;StoreFile&gt; sortedFiles = new ArrayList&lt;&gt;(files);<a name="line.149"></a>
+<span class="sourceLineNo">150</span>    Collections.sort(sortedFiles, StoreFile.Comparators.SEQ_ID);<a name="line.150"></a>
+<span class="sourceLineNo">151</span>    boolean succ = false;<a name="line.151"></a>
+<span class="sourceLineNo">152</span>    try {<a name="line.152"></a>
+<span class="sourceLineNo">153</span>      for (int i = 0, n = sortedFiles.size(); i &lt; n; i++) {<a name="line.153"></a>
+<span class="sourceLineNo">154</span>        scanners.add(<a name="line.154"></a>
+<span class="sourceLineNo">155</span>          sortedFiles.get(i).getStreamScanner(canUseDropBehind, false, true, readPt, i, false));<a name="line.155"></a>
+<span class="sourceLineNo">156</span>      }<a name="line.156"></a>
+<span class="sourceLineNo">157</span>      succ = true;<a name="line.157"></a>
+<span class="sourceLineNo">158</span>    } finally {<a name="line.158"></a>
+<span class="sourceLineNo">159</span>      if (!succ) {<a name="line.159"></a>
+<span class="sourceLineNo">160</span>        for (StoreFileScanner scanner : scanners) {<a name="line.160"></a>
+<span class="sourceLineNo">161</span>          scanner.close();<a name="line.161"></a>
+<span class="sourceLineNo">162</span>        }<a name="line.162"></a>
+<span class="sourceLineNo">163</span>      }<a name="line.163"></a>
+<span class="sourceLineNo">164</span>    }<a name="line.164"></a>
+<span class="sourceLineNo">165</span>    return scanners;<a name="line.165"></a>
+<span class="sourceLineNo">166</span>  }<a name="line.166"></a>
+<span class="sourceLineNo">167</span><a name="line.167"></a>
+<span class="sourceLineNo">168</span>  public String toString() {<a name="line.168"></a>
+<span class="sourceLineNo">169</span>    return "StoreFileScanner[" + hfs.toString() + ", cur=" + cur + "]";<a name="line.169"></a>
+<span class="sourceLineNo">170</span>  }<a name="line.170"></a>
+<span class="sourceLineNo">171</span><a name="line.171"></a>
+<span class="sourceLineNo">172</span>  public Cell peek() {<a name="line.172"></a>
+<span class="sourceLineNo">173</span>    return cur;<a name="line.173"></a>
+<span class="sourceLineNo">174</span>  }<a name="line.174"></a>
 <span class="sourceLineNo">175</span><a name="line.175"></a>
-<span class="sourceLineNo">176</span>    try {<a name="line.176"></a>
-<span class="sourceLineNo">177</span>      // only seek if we aren't at the end. cur == null implies 'end'.<a name="line.177"></a>
-<span class="sourceLineNo">178</span>      if (cur != null) {<a name="line.178"></a>
-<span class="sourceLineNo">179</span>        hfs.next();<a name="line.179"></a>
-<span class="sourceLineNo">180</span>        setCurrentCell(hfs.getCell());<a name="line.180"></a>
-<span class="sourceLineNo">181</span>        if (hasMVCCInfo || this.reader.isBulkLoaded()) {<a name="line.181"></a>
-<span class="sourceLineNo">182</span>          skipKVsNewerThanReadpoint();<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>    } catch (FileNotFoundException e) {<a name="line.185"></a>
-<span class="sourceLineNo">186</span>      throw e;<a name="line.186"></a>
-<span class="sourceLineNo">187</span>    } catch(IOException e) {<a name="line.187"></a>
-<span class="sourceLineNo">188</span>      throw new IOException("Could not iterate " + this, e);<a name="line.188"></a>
-<span class="sourceLineNo">189</span>    }<a name="line.189"></a>
-<span class="sourceLineNo">190</span>    return retKey;<a name="line.190"></a>
-<span class="sourceLineNo">191</span>  }<a name="line.191"></a>
-<span class="sourceLineNo">192</span><a name="line.192"></a>
-<span class="sourceLineNo">193</span>  public boolean seek(Cell key) throws IOException {<a name="line.193"></a>
-<span class="sourceLineNo">194</span>    if (seekCount != null) seekCount.increment();<a name="line.194"></a>
+<span class="sourceLineNo">176</span>  public Cell next() throws IOException {<a name="line.176"></a>
+<span class="sourceLineNo">177</span>    Cell retKey = cur;<a name="line.177"></a>
+<span class="sourceLineNo">178</span><a name="line.178"></a>
+<span class="sourceLineNo">179</span>    try {<a name="line.179"></a>
+<span class="sourceLineNo">180</span>      // only seek if we aren't at the end. cur == null implies 'end'.<a name="line.180"></a>
+<span class="sourceLineNo">181</span>      if (cur != null) {<a name="line.181"></a>
+<span class="sourceLineNo">182</span>        hfs.next();<a name="line.182"></a>
+<span class="sourceLineNo">183</span>        setCurrentCell(hfs.getCell());<a name="line.183"></a>
+<span class="sourceLineNo">184</span>        if (hasMVCCInfo || this.reader.isBulkLoaded()) {<a name="line.184"></a>
+<span class="sourceLineNo">185</span>          skipKVsNewerThanReadpoint();<a name="line.185"></a>
+<span class="sourceLineNo">186</span>        }<a name="line.186"></a>
+<span class="sourceLineNo">187</span>      }<a name="line.187"></a>
+<span class="sourceLineNo">188</span>    } catch (FileNotFoundException e) {<a name="line.188"></a>
+<span class="sourceLineNo">189</span>      throw e;<a name="line.189"></a>
+<span class="sourceLineNo">190</span>    } catch(IOException e) {<a name="line.190"></a>
+<span class="sourceLineNo">191</span>      throw new IOException("Could not iterate " + this, e);<a name="line.191"></a>
+<span class="sourceLineNo">192</span>    }<a name="line.192"></a>
+<span class="sourceLineNo">193</span>    return retKey;<a name="line.193"></a>
+<span class="sourceLineNo">194</span>  }<a name="line.194"></a>
 <span class="sourceLineNo">195</span><a name="line.195"></a>
-<span class="sourceLineNo">196</span>    try {<a name="line.196"></a>
-<span class="sourceLineNo">197</span>      try {<a name="line.197"></a>
-<span class="sourceLineNo">198</span>        if(!seekAtOrAfter(hfs, key)) {<a name="line.198"></a>
-<span class="sourceLineNo">199</span>          this.cur = null;<a name="line.199"></a>
-<span class="sourceLineNo">200</span>          return false;<a name="line.200"></a>
-<span class="sourceLineNo">201</span>        }<a name="line.201"></a>
-<span class="sourceLineNo">202</span><a name="line.202"></a>
-<span class="sourceLineNo">203</span>        setCurrentCell(hfs.getCell());<a name="line.203"></a>
-<span class="sourceLineNo">204</span><a name="line.204"></a>
-<span class="sourceLineNo">205</span>        if (!hasMVCCInfo &amp;&amp; this.reader.isBulkLoaded()) {<a name="line.205"></a>
-<span class="sourceLineNo">206</span>          return skipKVsNewerThanReadpoint();<a name="line.206"></a>
-<span class="sourceLineNo">207</span>        } else {<a name="line.207"></a>
-<span class="sourceLineNo">208</span>          return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.208"></a>
-<span class="sourceLineNo">209</span>        }<a name="line.209"></a>
-<span class="sourceLineNo">210</span>      } finally {<a name="line.210"></a>
-<span class="sourceLineNo">211</span>        realSeekDone = true;<a name="line.211"></a>
-<span class="sourceLineNo">212</span>      }<a name="line.212"></a>
-<span class="sourceLineNo">213</span>    } catch (FileNotFoundException e) {<a name="line.213"></a>
-<span class="sourceLineNo">214</span>      throw e;<a name="line.214"></a>
-<span class="sourceLineNo">215</span>    } catch (IOException ioe) {<a name="line.215"></a>
-<span class="sourceLineNo">216</span>      throw new IOException("Could not seek " + this + " to key " + key, ioe);<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><a name="line.219"></a>
-<span class="sourceLineNo">220</span>  public boolean reseek(Cell key) throws IOException {<a name="line.220"></a>
-<span class="sourceLineNo">221</span>    if (seekCount != null) seekCount.increment();<a name="line.221"></a>
+<span class="sourceLineNo">196</span>  public boolean seek(Cell key) throws IOException {<a name="line.196"></a>
+<span class="sourceLineNo">197</span>    if (seekCount != null) seekCount.increment();<a name="line.197"></a>
+<span class="sourceLineNo">198</span><a name="line.198"></a>
+<span class="sourceLineNo">199</span>    try {<a name="line.199"></a>
+<span class="sourceLineNo">200</span>      try {<a name="line.200"></a>
+<span class="sourceLineNo">201</span>        if(!seekAtOrAfter(hfs, key)) {<a name="line.201"></a>
+<span class="sourceLineNo">202</span>          this.cur = null;<a name="line.202"></a>
+<span class="sourceLineNo">203</span>          return false;<a name="line.203"></a>
+<span class="sourceLineNo">204</span>        }<a name="line.204"></a>
+<span class="sourceLineNo">205</span><a name="line.205"></a>
+<span class="sourceLineNo">206</span>        setCurrentCell(hfs.getCell());<a name="line.206"></a>
+<span class="sourceLineNo">207</span><a name="line.207"></a>
+<span class="sourceLineNo">208</span>        if (!hasMVCCInfo &amp;&amp; this.reader.isBulkLoaded()) {<a name="line.208"></a>
+<span class="sourceLineNo">209</span>          return skipKVsNewerThanReadpoint();<a name="line.209"></a>
+<span class="sourceLineNo">210</span>        } else {<a name="line.210"></a>
+<span class="sourceLineNo">211</span>          return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.211"></a>
+<span class="sourceLineNo">212</span>        }<a name="line.212"></a>
+<span class="sourceLineNo">213</span>      } finally {<a name="line.213"></a>
+<span class="sourceLineNo">214</span>        realSeekDone = true;<a name="line.214"></a>
+<span class="sourceLineNo">215</span>      }<a name="line.215"></a>
+<span class="sourceLineNo">216</span>    } catch (FileNotFoundException e) {<a name="line.216"></a>
+<span class="sourceLineNo">217</span>      throw e;<a name="line.217"></a>
+<span class="sourceLineNo">218</span>    } catch (IOException ioe) {<a name="line.218"></a>
+<span class="sourceLineNo">219</span>      throw new IOException("Could not seek " + this + " to key " + key, ioe);<a name="line.219"></a>
+<span class="sourceLineNo">220</span>    }<a name="line.220"></a>
+<span class="sourceLineNo">221</span>  }<a name="line.221"></a>
 <span class="sourceLineNo">222</span><a name="line.222"></a>
-<span class="sourceLineNo">223</span>    try {<a name="line.223"></a>
-<span class="sourceLineNo">224</span>      try {<a name="line.224"></a>
-<span class="sourceLineNo">225</span>        if (!reseekAtOrAfter(hfs, key)) {<a name="line.225"></a>
-<span class="sourceLineNo">226</span>          this.cur = null;<a name="line.226"></a>
-<span class="sourceLineNo">227</span>          return false;<a name="line.227"></a>
-<span class="sourceLineNo">228</span>        }<a name="line.228"></a>
-<span class="sourceLineNo">229</span>        setCurrentCell(hfs.getCell());<a name="line.229"></a>
-<span class="sourceLineNo">230</span><a name="line.230"></a>
-<span class="sourceLineNo">231</span>        if (!hasMVCCInfo &amp;&amp; this.reader.isBulkLoaded()) {<a name="line.231"></a>
-<span class="sourceLineNo">232</span>          return skipKVsNewerThanReadpoint();<a name="line.232"></a>
-<span class="sourceLineNo">233</span>        } else {<a name="line.233"></a>
-<span class="sourceLineNo">234</span>          return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.234"></a>
-<span class="sourceLineNo">235</span>        }<a name="line.235"></a>
-<span class="sourceLineNo">236</span>      } finally {<a name="line.236"></a>
-<span class="sourceLineNo">237</span>        realSeekDone = true;<a name="line.237"></a>
-<span class="sourceLineNo">238</span>      }<a name="line.238"></a>
-<span class="sourceLineNo">239</span>    } catch (FileNotFoundException e) {<a name="line.239"></a>
-<span class="sourceLineNo">240</span>      throw e;<a name="line.240"></a>
-<span class="sourceLineNo">241</span>    } catch (IOException ioe) {<a name="line.241"></a>
-<span class="sourceLineNo">242</span>      throw new IOException("Could not reseek " + this + " to key " + key,<a name="line.242"></a>
-<span class="sourceLineNo">243</span>          ioe);<a name="line.243"></a>
-<span class="sourceLineNo">244</span>    }<a name="line.244"></a>
-<span class="sourceLineNo">245</span>  }<a name="line.245"></a>
-<span class="sourceLineNo">246</span><a name="line.246"></a>
-<span class="sourceLineNo">247</span>  protected void setCurrentCell(Cell newVal) throws IOException {<a name="line.247"></a>
-<span class="sourceLineNo">248</span>    this.cur = newVal;<a name="line.248"></a>
-<span class="sourceLineNo">249</span>    if (this.cur != null &amp;&amp; this.reader.isBulkLoaded() &amp;&amp; !this.reader.isSkipResetSeqId()) {<a name="line.249"></a>
-<span class="sourceLineNo">250</span>      CellUtil.setSequenceId(cur, this.reader.getSequenceID());<a name="line.250"></a>
-<span class="sourceLineNo">251</span>    }<a name="line.251"></a>
-<span class="sourceLineNo">252</span>  }<a name="line.252"></a>
-<span class="sourceLineNo">253</span><a name="line.253"></a>
-<span class="sourceLineNo">254</span>  protected boolean skipKVsNewerThanReadpoint() throws IOException {<a name="line.254"></a>
-<span class="sourceLineNo">255</span>    // We want to ignore all key-values that are newer than our current<a name="line.255"></a>
-<span class="sourceLineNo">256</span>    // readPoint<a name="line.256"></a>
-<span class="sourceLineNo">257</span>    Cell startKV = cur;<a name="line.257"></a>
-<span class="sourceLineNo">258</span>    while(enforceMVCC<a name="line.258"></a>
-<span class="sourceLineNo">259</span>        &amp;&amp; cur != null<a name="line.259"></a>
-<span class="sourceLineNo">260</span>        &amp;&amp; (cur.getSequenceId() &gt; readPt)) {<a name="line.260"></a>
-<span class="sourceLineNo">261</span>      boolean hasNext = hfs.next();<a name="line.261"></a>
-<span class="sourceLineNo">262</span>      setCurrentCell(hfs.getCell());<a name="line.262"></a>
-<span class="sourceLineNo">263</span>      if (hasNext &amp;&amp; this.stopSkippingKVsIfNextRow<a name="line.263"></a>
-<span class="sourceLineNo">264</span>          &amp;&amp; getComparator().compareRows(cur, startKV) &gt; 0) {<a name="line.264"></a>
-<span class="sourceLineNo">265</span>        return false;<a name="line.265"></a>
-<span class="sourceLineNo">266</span>      }<a name="line.266"></a>
-<span class="sourceLineNo">267</span>    }<a name="line.267"></a>
-<span class="sourceLineNo">268</span><a name="line.268"></a>
-<span class="sourceLineNo">269</span>    if (cur == null) {<a name="line.269"></a>
-<span class="sourceLineNo">270</span>      return false;<a name="line.270"></a>
-<span class="sourceLineNo">271</span>    }<a name="line.271"></a>
-<span class="sourceLineNo">272</span><a name="line.272"></a>
-<span class="sourceLineNo">273</span>    return true;<a name="line.273"></a>
-<span class="sourceLineNo">274</span>  }<a name="line.274"></a>
+<span class="sourceLineNo">223</span>  public boolean reseek(Cell key) throws IOException {<a name="line.223"></a>
+<span class="sourceLineNo">224</span>    if (seekCount != null) seekCount.increment();<a name="line.224"></a>
+<span class="sourceLineNo">225</span><a name="line.225"></a>
+<span class="sourceLineNo">226</span>    try {<a name="line.226"></a>
+<span class="sourceLineNo">227</span>      try {<a name="line.227"></a>
+<span class="sourceLineNo">228</span>        if (!reseekAtOrAfter(hfs, key)) {<a name="line.228"></a>
+<span class="sourceLineNo">229</span>          this.cur = null;<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>        setCurrentCell(hfs.getCell());<a name="line.232"></a>
+<span class="sourceLineNo">233</span><a name="line.233"></a>
+<span class="sourceLineNo">234</span>        if (!hasMVCCInfo &amp;&amp; this.reader.isBulkLoaded()) {<a name="line.234"></a>
+<span class="sourceLineNo">235</span>          return skipKVsNewerThanReadpoint();<a name="line.235"></a>
+<span class="sourceLineNo">236</span>        } else {<a name="line.236"></a>
+<span class="sourceLineNo">237</span>          return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.237"></a>
+<span class="sourceLineNo">238</span>        }<a name="line.238"></a>
+<span class="sourceLineNo">239</span>      } finally {<a name="line.239"></a>
+<span class="sourceLineNo">240</span>        realSeekDone = true;<a name="line.240"></a>
+<span class="sourceLineNo">241</span>      }<a name="line.241"></a>
+<span class="sourceLineNo">242</span>    } catch (FileNotFoundException e) {<a name="line.242"></a>
+<span class="sourceLineNo">243</span>      throw e;<a name="line.243"></a>
+<span class="sourceLineNo">244</span>    } catch (IOException ioe) {<a name="line.244"></a>
+<span class="sourceLineNo">245</span>      throw new IOException("Could not reseek " + this + " to key " + key,<a name="line.245"></a>
+<span class="sourceLineNo">246</span>          ioe);<a name="line.246"></a>
+<span class="sourceLineNo">247</span>    }<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>  protected void setCurrentCell(Cell newVal) throws IOException {<a name="line.250"></a>
+<span class="sourceLineNo">251</span>    this.cur = newVal;<a name="line.251"></a>
+<span class="sourceLineNo">252</span>    if (this.cur != null &amp;&amp; this.reader.isBulkLoaded() &amp;&amp; !this.reader.isSkipResetSeqId()) {<a name="line.252"></a>
+<span class="sourceLineNo">253</span>      CellUtil.setSequenceId(cur, this.reader.getSequenceID());<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><a name="line.256"></a>
+<span class="sourceLineNo">257</span>  protected boolean skipKVsNewerThanReadpoint() throws IOException {<a name="line.257"></a>
+<span class="sourceLineNo">258</span>    // We want to ignore all key-values that are newer than our current<a name="line.258"></a>
+<span class="sourceLineNo">259</span>    // readPoint<a name="line.259"></a>
+<span class="sourceLineNo">260</span>    Cell startKV = cur;<a name="line.260"></a>
+<span class="sourceLineNo">261</span>    while(enforceMVCC<a name="line.261"></a>
+<span class="sourceLineNo">262</span>        &amp;&amp; cur != null<a name="line.262"></a>
+<span class="sourceLineNo">263</span>        &amp;&amp; (cur.getSequenceId() &gt; readPt)) {<a name="line.263"></a>
+<span class="sourceLineNo">264</span>      boolean hasNext = hfs.next();<a name="line.264"></a>
+<span class="sourceLineNo">265</span>      setCurrentCell(hfs.getCell());<a name="line.265"></a>
+<span class="sourceLineNo">266</span>      if (hasNext &amp;&amp; this.stopSkippingKVsIfNextRow<a name="line.266"></a>
+<span class="sourceLineNo">267</span>          &amp;&amp; getComparator().compareRows(cur, startKV) &gt; 0) {<a name="line.267"></a>
+<span class="sourceLineNo">268</span>        return false;<a name="line.268"></a>
+<span class="sourceLineNo">269</span>      }<a name="line.269"></a>
+<span class="sourceLineNo">270</span>    }<a name="line.270"></a>
+<span class="sourceLineNo">271</span><a name="line.271"></a>
+<span class="sourceLineNo">272</span>    if (cur == null) {<a name="line.272"></a>
+<span class="sourceLineNo">273</span>      return false;<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>
-<span class="sourceLineNo">276</span>  public void close() {<a name="line.276"></a>
-<span class="sourceLineNo">277</span>    if (closed) return;<a name="line.277"></a>
-<span class="sourceLineNo">278</span>    cur = null;<a name="line.278"></a>
-<span class="sourceLineNo">279</span>    this.hfs.close();<a name="line.279"></a>
-<span class="sourceLineNo">280</span>    if (this.reader != null) {<a name="line.280"></a>
-<span class="sourceLineNo">281</span>      this.reader.readCompleted();<a name="line.281"></a>
-<span class="sourceLineNo">282</span>    }<a name="line.282"></a>
-<span class="sourceLineNo">283</span>    closed = true;<a name="line.283"></a>
-<span class="sourceLineNo">284</span>  }<a name="line.284"></a>
-<span class="sourceLineNo">285</span><a name="line.285"></a>
-<span class="sourceLineNo">286</span>  /**<a name="line.286"></a>
-<span class="sourceLineNo">287</span>   *<a name="line.287"></a>
-<span class="sourceLineNo">288</span>   * @param s<a name="line.288"></a>
-<span class="sourceLineNo">289</span>   * @param k<a name="line.289"></a>
-<span class="sourceLineNo">290</span>   * @return false if not found or if k is after the end.<a name="line.290"></a>
-<span class="sourceLineNo">291</span>   * @throws IOException<a name="line.291"></a>
-<span class="sourceLineNo">292</span>   */<a name="line.292"></a>
-<span class="sourceLineNo">293</span>  public static boolean seekAtOrAfter(HFileScanner s, Cell k)<a name="line.293"></a>
-<span class="sourceLineNo">294</span>  throws IOException {<a name="line.294"></a>
-<span class="sourceLineNo">295</span>    int result = s.seekTo(k);<a name="line.295"></a>
-<span class="sourceLineNo">296</span>    if(result &lt; 0) {<a name="line.296"></a>
-<span class="sourceLineNo">297</span>      if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.297"></a>
-<span class="sourceLineNo">298</span>        // using faked key<a name="line.298"></a>
-<span class="sourceLineNo">299</span>        return true;<a name="line.299"></a>
-<span class="sourceLineNo">300</span>      }<a name="line.300"></a>
-<span class="sourceLineNo">301</span>      // Passed KV is smaller than first KV in file, work from start of file<a name="line.301"></a>
-<span class="sourceLineNo">302</span>      return s.seekTo();<a name="line.302"></a>
-<span class="sourceLineNo">303</span>    } else if(result &gt; 0) {<a name="line.303"></a>
-<span class="sourceLineNo">304</span>      // Passed KV is larger than current KV in file, if there is a next<a name="line.304"></a>
-<span class="sourceLineNo">305</span>      // it is the "after", if not then this scanner is done.<a name="line.305"></a>
-<span class="sourceLineNo">306</span>      return s.next();<a name="line.306"></a>
-<span class="sourceLineNo">307</span>    }<a name="line.307"></a>
-<span class="sourceLineNo">308</span>    // Seeked to the exact key<a name="line.308"></a>
-<span class="sourceLineNo">309</span>    return true;<a name="line.309"></a>
-<span class="sourceLineNo">310</span>  }<a name="line.310"></a>
-<span class="sourceLineNo">311</span><a name="line.311"></a>
-<span class="sourceLineNo">312</span>  static boolean reseekAtOrAfter(HFileScanner s, Cell k)<a name="line.312"></a>
-<span class="sourceLineNo">313</span>  throws IOException {<a name="line.313"></a>
-<span class="sourceLineNo">314</span>    //This function is similar to seekAtOrAfter function<a name="line.314"></a>
-<span class="sourceLineNo">315</span>    int result = s.reseekTo(k);<a name="line.315"></a>
-<span class="sourceLineNo">316</span>    if (result &lt;= 0) {<a name="line.316"></a>
-<span class="sourceLineNo">317</span>      if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.317"></a>
-<span class="sourceLineNo">318</span>        // using faked key<a name="line.318"></a>
-<span class="sourceLineNo">319</span>        return true;<a name="line.319"></a>
-<span class="sourceLineNo">320</span>      }<a name="line.320"></a>
-<span class="sourceLineNo">321</span>      // If up to now scanner is not seeked yet, this means passed KV is smaller<a name="line.321"></a>
-<span class="sourceLineNo">322</span>      // than first KV in file, and it is the first time we seek on this file.<a name="line.322"></a>
-<span class="sourceLineNo">323</span>      // So we also need to work from the start of file.<a name="line.323"></a>
-<span class="sourceLineNo">324</span>      if (!s.isSeeked()) {<a name="line.324"></a>
-<span class="sourceLineNo">325</span>        return  s.seekTo();<a name="line.325"></a>
-<span class="sourceLineNo">326</span>      }<a name="line.326"></a>
-<span class="sourceLineNo">327</span>      return true;<a name="line.327"></a>
-<span class="sourceLineNo">328</span>    }<a name="line.328"></a>
-<span class="sourceLineNo">329</span>    // passed KV is larger than current KV in file, if there is a next<a name="line.329"></a>
-<span class="sourceLineNo">330</span>    // it is after, if not then this scanner is done.<a name="line.330"></a>
-<span class="sourceLineNo">331</span>    return s.next();<a name="line.331"></a>
-<span class="sourceLineNo">332</span>  }<a name="line.332"></a>
-<span class="sourceLineNo">333</span><a name="line.333"></a>
-<span class="sourceLineNo">334</span>  /**<a name="line.334"></a>
-<span class="sourceLineNo">335</span>   * @see KeyValueScanner#getScannerOrder()<a name="line.335"></a>
-<span class="sourceLineNo">336</span>   */<a name="line.336"></a>
-<span class="sourceLineNo">337</span>  @Override<a name="line.337"></a>
-<span class="sourceLineNo">338</span>  public long getScannerOrder() {<a name="line.338"></a>
-<span class="sourceLineNo">339</span>    return scannerOrder;<a name="line.339"></a>
-<span class="sourceLineNo">340</span>  }<a name="line.340"></a>
-<span class="sourceLineNo">341</span><a name="line.341"></a>
-<span class="sourceLineNo">342</span>  /**<a name="line.342"></a>
-<span class="sourceLineNo">343</span>   * Pretend we have done a seek but don't do it yet, if possible. The hope is<a name="line.343"></a>
-<span class="sourceLineNo">344</span>   * that we find requested columns in more recent files and won't have to seek<a name="line.344"></a>
-<span class="sourceLineNo">345</span>   * in older files. Creates a fake key/value with the given row/column and the<a name="line.345"></a>
-<span class="sourceLineNo">346</span>   * highest (most recent) possible timestamp we might get from this file. When<a name="line.346"></a>
-<span class="sourceLineNo">347</span>   * users of such "lazy scanner" need to know the next KV precisely (e.g. when<a name="line.347"></a>
-<span class="sourceLineNo">348</span>   * this scanner is at the top of the heap), they run {@link #enforceSeek()}.<a name="line.348"></a>
-<span class="sourceLineNo">349</span>   * &lt;p&gt;<a name="line.349"></a>
-<span class="sourceLineNo">350</span>   * Note that this function does guarantee that the current KV of this scanner<a name="line.350"></a>
-<span class="sourceLineNo">351</span>   * will be advanced to at least the given KV. Because of this, it does have<a name="line.351"></a>
-<span class="sourceLineNo">352</span>   * to do a real seek in cases when the seek timestamp is older than the<a name="line.352"></a>
-<span class="sourceLineNo">353</span>   * highest timestamp of the file, e.g. when we are trying to seek to the next<a name="line.353"></a>
-<span class="sourceLineNo">354</span>   * row/column and use OLDEST_TIMESTAMP in the seek key.<a name="line.354"></a>
-<span class="sourceLineNo">355</span>   */<a name="line.355"></a>
-<span class="sourceLineNo">356</span>  @Override<a name="line.356"></a>
-<span class="sourceLineNo">357</span>  public boolean requestSeek(Cell kv, boolean forward, boolean useBloom)<a name="line.357"></a>
-<span class="sourceLineNo">358</span>      throws IOException {<a name="line.358"></a>
-<span class="sourceLineNo">359</span>    if (kv.getFamilyLength() == 0) {<a name="line.359"></a>
-<span class="sourceLineNo">360</span>      useBloom = false;<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>    boolean haveToSeek = true;<a name="line.363"></a>
-<span class="sourceLineNo">364</span>    if (useBloom) {<a name="line.364"></a>
-<span class="sourceLineNo">365</span>      // check ROWCOL Bloom filter first.<a name="line.365"></a>
-<span class="sourceLineNo">366</span>      if (reader.getBloomFilterType() == BloomType.ROWCOL) {<a name="line.366"></a>
-<span class="sourceLineNo">367</span>        haveToSeek = reader.passesGeneralRowColBloomFilter(kv);<a name="line.367"></a>
-<span class="sourceLineNo">368</span>      } else if (canOptimizeForNonNullColumn<a name="line.368"></a>
-<span class="sourceLineNo">369</span>          &amp;&amp; ((CellUtil.isDeleteFamily(kv) || CellUtil.isDeleteFamilyVersion(kv)))) {<a name="line.369"></a>
-<span class="sourceLineNo">370</span>        // if there is no such delete family kv in the store file,<a name="line.370"></a>
-<span class="sourceLineNo">371</span>        // then no need to seek.<a name="line.371"></a>
-<span class="sourceLineNo">372</span>        haveToSeek = reader.passesDeleteFamilyBloomFilter(kv.getRowArray(), kv.getRowOffset(),<a name="line.372"></a>
-<span class="sourceLineNo">373</span>          kv.getRowLength());<a name="line.373"></a>
-<span class="sourceLineNo">374</span>      }<a name="line.374"></a>
-<span class="sourceLineNo">375</span>    }<a name="line.375"></a>
-<span class="sourceLineNo">376</span><a name="line.376"></a>
-<span class="sourceLineNo">377</span>    delayedReseek = forward;<a name="line.377"></a>
-<span class="sourceLineNo">378</span>    delayedSeekKV = kv;<a name="line.378"></a>
+<span class="sourceLineNo">276</span>    return true;<a name="line.276"></a>
+<span class="sourceLineNo">277</span>  }<a name="line.277"></a>
+<span class="sourceLineNo">278</span><a name="line.278"></a>
+<span class="sourceLineNo">279</span>  public void close() {<a name="line.279"></a>
+<span class="sourceLineNo">280</span>    if (closed) return;<a name="line.280"></a>
+<span class="sourceLineNo">281</span>    cur = null;<a name="line.281"></a>
+<span class="sourceLineNo">282</span>    this.hfs.close();<a name="line.282"></a>
+<span class="sourceLineNo">283</span>    if (this.reader != null) {<a name="line.283"></a>
+<span class="sourceLineNo">284</span>      this.reader.readCompleted();<a name="line.284"></a>
+<span class="sourceLineNo">285</span>    }<a name="line.285"></a>
+<span class="sourceLineNo">286</span>    closed = true;<a name="line.286"></a>
+<span class="sourceLineNo">287</span>  }<a name="line.287"></a>
+<span class="sourceLineNo">288</span><a name="line.288"></a>
+<span class="sourceLineNo">289</span>  /**<a name="line.289"></a>
+<span class="sourceLineNo">290</span>   *<a name="line.290"></a>
+<span class="sourceLineNo">291</span>   * @param s<a name="line.291"></a>
+<span class="sourceLineNo">292</span>   * @param k<a name="line.292"></a>
+<span class="sourceLineNo">293</span>   * @return false if not found or if k is after the end.<a name="line.293"></a>
+<span class="sourceLineNo">294</span>   * @throws IOException<a name="line.294"></a>
+<span class="sourceLineNo">295</span>   */<a name="line.295"></a>
+<span class="sourceLineNo">296</span>  public static boolean seekAtOrAfter(HFileScanner s, Cell k)<a name="line.296"></a>
+<span class="sourceLineNo">297</span>  throws IOException {<a name="line.297"></a>
+<span class="sourceLineNo">298</span>    int result = s.seekTo(k);<a name="line.298"></a>
+<span class="sourceLineNo">299</span>    if(result &lt; 0) {<a name="line.299"></a>
+<span class="sourceLineNo">300</span>      if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.300"></a>
+<span class="sourceLineNo">301</span>        // using faked key<a name="line.301"></a>
+<span class="sourceLineNo">302</span>        return true;<a name="line.302"></a>
+<span class="sourceLineNo">303</span>      }<a name="line.303"></a>
+<span class="sourceLineNo">304</span>      // Passed KV is smaller than first KV in file, work from start of file<a name="line.304"></a>
+<span class="sourceLineNo">305</span>      return s.seekTo();<a name="line.305"></a>
+<span class="sourceLineNo">306</span>    } else if(result &gt; 0) {<a name="line.306"></a>
+<span class="sourceLineNo">307</span>      // Passed KV is larger than current KV in file, if there is a next<a name="line.307"></a>
+<span class="sourceLineNo">308</span>      // it is the "after", if not then this scanner is done.<a name="line.308"></a>
+<span class="sourceLineNo">309</span>      return s.next();<a name="line.309"></a>
+<span class="sourceLineNo">310</span>    }<a name="line.310"></a>
+<span class="sourceLineNo">311</span>    // Seeked to the exact key<a name="line.311"></a>
+<span class="sourceLineNo">312</span>    return true;<a name="line.312"></a>
+<span class="sourceLineNo">313</span>  }<a name="line.313"></a>
+<span class="sourceLineNo">314</span><a name="line.314"></a>
+<span class="sourceLineNo">315</span>  static boolean reseekAtOrAfter(HFileScanner s, Cell k)<a name="line.315"></a>
+<span class="sourceLineNo">316</span>  throws IOException {<a name="line.316"></a>
+<span class="sourceLineNo">317</span>    //This function is similar to seekAtOrAfter function<a name="line.317"></a>
+<span class="sourceLineNo">318</span>    int result = s.reseekTo(k);<a name="line.318"></a>
+<span class="sourceLineNo">319</span>    if (result &lt;= 0) {<a name="line.319"></a>
+<span class="sourceLineNo">320</span>      if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.320"></a>
+<span class="sourceLineNo">321</span>        // using faked key<a name="line.321"></a>
+<span class="sourceLineNo">322</span>        return true;<a name="line.322"></a>
+<span class="sourceLineNo">323</span>      }<a name="line.323"></a>
+<span class="sourceLineNo">324</span>      // If up to now scanner is not seeked yet, this means passed KV is smaller<a name="line.324"></a>
+<span class="sourceLineNo">325</span>      // than first KV in file, and it is the first time we seek on this file.<a name="line.325"></a>
+<span class="sourceLineNo">326</span>      // So we also need to work from the start of file.<a name="line.326"></a>
+<span class="sourceLineNo">327</span>      if (!s.isSeeked()) {<a name="line.327"></a>
+<span class="sourceLineNo">328</span>        return  s.seekTo();<a name="line.328"></a>
+<span class="sourceLineNo">329</span>      }<a name="line.329"></a>
+<span class="sourceLineNo">330</span>      return true;<a name="line.330"></a>
+<span class="sourceLineNo">331</span>    }<a name="line.331"></a>
+<span class="sourceLineNo">332</span>    // passed KV is larger than current KV in file, if there is a next<a name="line.332"></a>
+<span class="sourceLineNo">333</span>    // it is after, if not then this scanner is done.<a name="line.333"></a>
+<span class="sourceLineNo">334</span>    return s.next();<a name="line.334"></a>
+<span class="sourceLineNo">335</span>  }<a name="line.335"></a>
+<span class="sourceLineNo">336</span><a name="line.336"></a>
+<span class="sourceLineNo">337</span>  /**<a name="line.337"></a>
+<span class="sourceLineNo">338</span>   * @see KeyValueScanner#getScannerOrder()<a name="line.338"></a>
+<span class="sourceLineNo">339</span>   */<a name="line.339"></a>
+<span class="sourceLineNo">340</span>  @Override<a name="line.340"></a>
+<span class="sourceLineNo">341</span>  public long getScannerOrder() {<a name="line.341"></a>
+<span class="sourceLineNo">342</span>    return scannerOrder;<a name="line.342"></a>
+<span class="sourceLineNo">343</span>  }<a name="line.343"></a>
+<span class="sourceLineNo">344</span><a name="line.344"></a>
+<span class="sourceLineNo">345</span>  /**<a name="line.345"></a>
+<span class="sourceLineNo">346</span>   * Pretend we have done a seek but don't do it yet, if possible. The hope is<a name="line.346"></a>
+<span class="sourceLineNo">347</span>   * that we find requested columns in more recent files and won't have to seek<a name="line.347"></a>
+<span class="sourceLineNo">348</span>   * in older files. Creates a fake key/value with the given row/column and the<a name="line.348"></a>
+<span class="sourceLineNo">349</span>   * highest (most recent) possible timestamp we might get from this file. When<a name="line.349"></a>
+<span class="sourceLineNo">350</span>   * users of such "lazy scanner" need to know the next KV precisely (e.g. when<a name="line.350"></a>
+<span class="sourceLineNo">351</span>   * this scanner is at the top of the heap), they run {@link #enforceSeek()}.<a name="line.351"></a>
+<span class="sourceLineNo">352</span>   * &lt;p&gt;<a name="line.352"></a>
+<span class="sourceLineNo">353</span>   * Note that this function does guarantee that the current KV of this scanner<a name="line.353"></a>
+<span class="sourceLineNo">354</span>   * will be advanced to at least the given KV. Because of this, it does have<a name="line.354"></a>
+<span class="sourceLineNo">355</span>   * to do a real seek in cases when the seek timestamp is older than the<a name="line.355"></a>
+<span class="sourceLineNo">356</span>   * highest timestamp of the file, e.g. when we are trying to seek to the next<a name="line.356"></a>
+<span class="sourceLineNo">357</span>   * row/column and use OLDEST_TIMESTAMP in the seek key.<a name="line.357"></a>
+<span class="sourceLineNo">358</span>   */<a name="line.358"></a>
+<span class="sourceLineNo">359</span>  @Override<a name="line.359"></a>
+<span class="sourceLineNo">360</span>  public boolean requestSeek(Cell kv, boolean forward, boolean useBloom)<a name="line.360"></a>
+<span class="sourceLineNo">361</span>      throws IOException {<a name="line.361"></a>
+<span class="sourceLineNo">362</span>    if (kv.getFamilyLength() == 0) {<a name="line.362"></a>
+<span class="sourceLineNo">363</span>      useBloom = false;<a name="line.363"></a>
+<span class="sourceLineNo">364</span>    }<a name="line.364"></a>
+<span class="sourceLineNo">365</span><a name="line.365"></a>
+<span class="sourceLineNo">366</span>    boolean haveToSeek = true;<a name="line.366"></a>
+<span class="sourceLineNo">367</span>    if (useBloom) {<a name="line.367"></a>
+<span class="sourceLineNo">368</span>      // check ROWCOL Bloom filter first.<a name="line.368"></a>
+<span class="sourceLineNo">369</span>      if (reader.getBloomFilterType() == BloomType.ROWCOL) {<a name="line.369"></a>
+<span class="sourceLineNo">370</span>        haveToSeek = reader.passesGeneralRowColBloomFilter(kv);<a name="line.370"></a>
+<span class="sourceLineNo">371</span>      } else if (canOptimizeForNonNullColumn<a name="line.371"></a>
+<span class="sourceLineNo">372</span>          &amp;&amp; ((CellUtil.isDeleteFamily(kv) || CellUtil.isDeleteFamilyVersion(kv)))) {<a name="line.372"></a>
+<span class="sourceLineNo">373</span>        // if there is no such delete family kv in the store file,<a name="line.373"></a>
+<span class="sourceLineNo">374</span>        // then no need to seek.<a name="line.374"></a>
+<span class="sourceLineNo">375</span>        haveToSeek = reader.passesDeleteFamilyBloomFilter(kv.getRowArray(), kv.getRowOffset(),<a name="line.375"></a>
+<span class="sourceLineNo">376</span>          kv.getRowLength());<a name="line.376"></a>
+<span class="sourceLineNo">377</span>      }<a name="line.377"></a>
+<span class="sourceLineNo">378</span>    }<a name="line.378"></a>
 <span class="sourceLineNo">379</span><a name="line.379"></a>
-<span class="sourceLineNo">380</span>    if (haveToSeek) {<a name="line.380"></a>
-<span class="sourceLineNo">381</span>      // This row/column might be in this store file (or we did not use the<a name="line.381"></a>
-<span class="sourceLineNo">382</span>      // Bloom filter), so we still need to seek.<a name="line.382"></a>
-<span class="sourceLineNo">383</span>      realSeekDone = false;<a name="line.383"></a>
-<span class="sourceLineNo">384</span>      long maxTimestampInFile = reader.getMaxTimestamp();<a name="line.384"></a>
-<span class="sourceLineNo">385</span>      long seekTimestamp = kv.getTimestamp();<a name="line.385"></a>
-<span class="sourceLineNo">386</span>      if (seekTimestamp &gt; maxTimestampInFile) {<a name="line.386"></a>
-<span class="sourceLineNo">387</span>        // Create a fake key that is not greater than the real next key.<a name="line.387"></a>
-<span class="sourceLineNo">388</span>        // (Lower timestamps correspond to higher KVs.)<a name="line.388"></a>
-<span class="sourceLineNo">389</span>        // To understand this better, consider that we are asked to seek to<a name="line.389"></a>
-<span class="sourceLineNo">390</span>        // a higher timestamp than the max timestamp in this file. We know that<a name="line.390"></a>
-<span class="sourceLineNo">391</span>        // the next point when we have to consider this file again is when we<a name="line.391"></a>
-<span class="sourceLineNo">392</span>        // pass the max timestamp of this file (with the same row/column).<a name="line.392"></a>
-<span class="sourceLineNo">393</span>        setCurrentCell(CellUtil.createFirstOnRowColTS(kv, maxTimestampInFile));<a name="line.393"></a>
-<span class="sourceLineNo">394</span>      } else {<a name="line.394"></a>
-<span class="sourceLineNo">395</span>        // This will be the case e.g. when we need to seek to the next<a name="line.395"></a>
-<span class="sourceLineNo">396</span>        // row/column, and we don't know exactly what they are, so we set the<a name="line.396"></a>
-<span class="sourceLineNo">397</span>        // seek key's timestamp to OLDEST_TIMESTAMP to skip the rest of this<a name="line.397"></a>
-<span class="sourceLineNo">398</span>        // row/column.<a name="line.398"></a>
-<span class="sourceLineNo">399</span>        enforceSeek();<a name="line.399"></a>
-<span class="sourceLineNo">400</span>      }<a name="line.400"></a>
-<span class="sourceLineNo">401</span>      return cur != null;<a name="line.401"></a>
-<span class="sourceLineNo">402</span>    }<a name="line.402"></a>
-<span class="sourceLineNo">403</span><a name="line.403"></a>
-<span class="sourceLineNo">404</span>    // Multi-column Bloom filter optimization.<a name="line.404"></a>
-<span class="sourceLineNo">405</span>    // Create a fake key/value, so that this scanner only bubbles up to the top<a name="line.405"></a>
-<span class="sourceLineNo">406</span>    // of the KeyValueHeap in StoreScanner after we scanned this row/column in<a name="line.406"></a>
-<span class="sourceLineNo">407</span>    // all other store files. The query matcher will then just skip this fake<a name="line.407"></a>
-<span class="sourceLineNo">408</span>    // key/value and the store scanner will progress to the next column. This<a name="line.408"></a>
-<span class="sourceLineNo">409</span>    // is obviously not a "real real" seek, but unlike the fake KV earlier in<a name="line.409"></a>
-<span class="sourceLineNo">410</span>    // this method, we want this to be propagated to ScanQueryMatcher.<a name="line.410"></a>
-<span class="sourceLineNo">411</span>    setCurrentCell(CellUtil.createLastOnRowCol(kv));<a name="line.411"></a>
-<span class="sourceLineNo">412</span><a name="line.412"></a>
-<span class="sourceLineNo">413</span>    realSeekDone = true;<a name="line.413"></a>
-<span class="sourceLineNo">414</span>    return true;<a name="line.414"></a>
-<span class="sourceLineNo">415</span>  }<a name="line.415"></a>
-<span class="sourceLineNo">416</span><a name="line.416"></a>
-<span class="sourceLineNo">417</span>  StoreFileReader getReader() {<a name="line.417"></a>
-<span class="sourceLineNo">418</span>    return reader;<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>  CellComparator getComparator() {<a name="line.421"></a>
-<span class="sourceLineNo">422</span>    return reader.getComparator();<a name="line.422"></a>
-<span class="sourceLineNo">423</span>  }<a name="line.423"></a>
-<span class="sourceLineNo">424</span><a name="line.424"></a>
-<span class="sourceLineNo">425</span>  @Override<a name="line.425"></a>
-<span class="sourceLineNo">426</span>  public boolean realSeekDone() {<a name="line.426"></a>
-<span class="sourceLineNo">427</span>    return realSeekDone;<a name="line.427"></a>
-<span class="sourceLineNo">428</span>  }<a name="line.428"></a>
-<span class="sourceLineNo">429</span><a name="line.429"></a>
-<span class="sourceLineNo">430</span>  @Override<a name="line.430"></a>
-<span class="sourceLineNo">431</span>  public void enforceSeek() throws IOException {<a name="line.431"></a>
-<span class="sourceLineNo">432</span>    if (realSeekDone)<a name="line.432"></a>
-<span class="sourceLineNo">433</span>      return;<a name="line.433"></a>
-<span class="sourceLineNo">434</span><a name="line.434"></a>
-<span class="sourceLineNo">435</span>    if (delayedReseek) {<a name="line.435"></a>
-<span class="sourceLineNo">436</span>      reseek(delayedSeekKV);<a name="line.436"></a>
-<span class="sourceLineNo">437</span>    } else {<a name="line.437"></a>
-<span class="sourceLineNo">438</span>      seek(delayedSeekKV);<a name="line.438"></a>
-<span class="sourceLineNo">439</span>    }<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>  @Override<a name="line.442"></a>
-<span class="sourceLineNo">443</span>  public boolean isFileScanner() {<a name="line.443"></a>
-<span class="sourceLineNo">444</span>    return true;<a name="line.444"></a>
-<span class="sourceLineNo">445</span>  }<a name="line.445"></a>
-<span class="sourceLineNo">446</span><a name="line.446"></a>
-<span class="sourceLineNo">447</span>  // Test methods<a name="line.447"></a>
-<span class="sourceLineNo">448</span>  static final long getSeekCount() {<a name="line.448"></a>
-<span class="sourceLineNo">449</span>    return seekCount.sum();<a name="line.449"></a>
-<span class="sourceLineNo">450</span>  }<a name="line.450"></a>
-<span class="sourceLineNo">451</span><a name="line.451"></a>
-<span class="sourceLineNo">452</span>  static final void instrument() {<a name="line.452"></a>
-<span class="sourceLineNo">453</span>    seekCount = new LongAdder();<a name="line.453"></a>
-<span class="sourceLineNo">454</span>  }<a name="line.454"></a>
-<span class="sourceLineNo">455</span><a name="line.455"></a>
-<span class="sourceLineNo">456</span>  @Override<a name="line.456"></a>
-<span class="sourceLineNo">457</span>  public boolean shouldUseScanner(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.457"></a>
-<span class="sourceLineNo">458</span>    // if the file has no entries, no need to validate or create a scanner.<a name="line.458"></a>
-<span class="sourceLineNo">459</span>    byte[] cf = store.getFamily().getName();<a name="line.459"></a>
-<span class="sourceLineNo">460</span>    TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.460"></a>
-<span class="sourceLineNo">461</span>    if (timeRange == null) {<a name="line.461"></a>
-<span class="sourceLineNo">462</span>      timeRange = scan.getTimeRange();<a name="line.462"></a>
-<span class="sourceLineNo">463</span>    }<a name="line.463"></a>
-<span class="sourceLineNo">464</span>    return reader.passesTimerangeFilter(timeRange, oldestUnexpiredTS) &amp;&amp; reader<a name="line.464"></a>
-<span class="sourceLineNo">465</span>        .passesKeyRangeFilter(scan) &amp;&amp; reader.passesBloomFilter(scan, scan.getFamilyMap().get(cf));<a name="line.465"></a>
-<span class="sourceLineNo">466</span>  }<a name="line.466"></a>
-<span class="sourceLineNo">467</span><a name="line.467"></a>
-<span class="sourceLineNo">468</span>  @Override<a name="line.468"></a>
-<span class="sourceLineNo">469</span>  public boolean seekToPreviousRow(Cell originalKey) throws IOException {<a name="line.469"></a>
-<span class="sourceLineNo">470</span>    try {<a name="line.470"></a>
-<span class="sourceLineNo">471</span>      try {<a name="line.471"></a>
-<span class="sourceLineNo">472</span>        boolean keepSeeking = false;<a name="line.472"></a>
-<span class="sourceLineNo">473</span>        Cell key = originalKey;<a name="line.473"></a>
-<span class="sourceLineNo">474</span>        do {<a name="line.474"></a>
-<span class="sourceLineNo">475</span>          Cell seekKey = CellUtil.createFirstOnRow(key);<a name="line.475"></a>
-<span class="sourceLineNo">476</span>          if (seekCount != null) seekCount.increment();<a name="line.476"></a>
-<span class="sourceLineNo">477</span>          if (!hfs.seekBefore(seekKey)) {<a name="line.477"></a>
-<span class="sourceLineNo">478</span>            this.cur = null;<a name="line.478"></a>
-<span class="sourceLineNo">479</span>            return false;<a name="line.479"></a>
-<span class="sourceLineNo">480</span>          }<a name="line.480"></a>
-<span class="sourceLineNo">481</span>          Cell curCell = hfs.getCell();<a name="line.481"></a>
-<span class="sourceLineNo">482</span>          Cell firstKeyOfPreviousRow = CellUtil.createFirstOnRow(curCell);<a name="line.482"></a>
-<span class="sourceLineNo">483</span><a name="line.483"></a>
+<span class="sourceLineNo">380</span>    delayedReseek = forward;<a name="line.380"></a>
+<span class="sourceLineNo">381</span>    delayedSeekKV = kv;<a name="line.381"></a>
+<span class="sourceLineNo">382</span><a name="line.382"></a>
+<span class="sourceLineNo">383</span>    if (haveToSeek) {<a name="line.383"></a>
+<span class="sourceLineNo">384</span>      // This row/column might be in this store file (or we did not use the<a name="line.384"></a>
+<span class="sourceLineNo">385</span>      // Bloom filter), so we still need to seek.<a name="line.385"></a>
+<span class="sourceLineNo">386</span>      realSeekDone = false;<a name="line.386"></a>
+<span class="sourceLineNo">387</span>      long maxTimestampInFile = reader.getMaxTimestamp();<a name="line.387"></a>
+<span class="sourceLineNo">388</span>      long seekTimestamp = kv.getTimestamp();<a name="line.388"></a>
+<span class="sourceLineNo">389</span>      if (seekTimestamp &gt; maxTimestampInFile) {<a name="line.389"></a>
+<span class="sourceLineNo">390</span>        // Create a fake key that is not greater than the real next key.<a name="line.390"></a>
+<span class="sourceLineNo">391</span>        // (Lower timestamps correspond to higher KVs.)<a name="line.391"></a>
+<span class="sourceLineNo">392</span>        // To understand this better, consider that we are asked to seek to<a name="line.392"></a>
+<span class="sourceLineNo">393</span>        // a higher timestamp than the max timestamp in this file. We know that<a name="line.393"></a>
+<span class="sourceLineNo">394</span>        // the next point when we have to consider this file again is when we<a name="line.394"></a>
+<span class="sourceLineNo">395</span>        // pass the max timestamp of this file (with the same row/column).<a name="line.395"></a>
+<span class="sourceLineNo">396</span>        setCurrentCell(CellUtil.createFirstOnRowColTS(kv, maxTimestampInFile));<a name="line.396"></a>
+<span class="sourceLineNo">397</span>      } else {<a name="line.397"></a>
+<span class="sourceLineNo">398</span>        // This will be the case e.g. when we need to seek to the next<a name="line.398"></a>
+<span class="sourceLineNo">399</span>        // row/column, and we don't know exactly what they are, so we set the<a name="line.399"></a>
+<span class="sourceLineNo">400</span>        // seek key's timestamp to OLDEST_TIMESTAMP to skip the rest of this<a name="line.400"></a>
+<span class="sourceLineNo">401</span>        // row/column.<a name="line.401"></a>
+<span class="sourceLineNo">402</span>        enforceSeek();<a name="line.402"></a>
+<span class="sourceLineNo">403</span>      }<a name="line.403"></a>
+<span class="sourceLineNo">404</span>      return cur != null;<a name="line.404"></a>
+<span class="sourceLineNo">405</span>    }<a name="line.405"></a>
+<span class="sourceLineNo">406</span><a name="line.406"></a>
+<span class="sourceLineNo">407</span>    // Multi-column Bloom filter optimization.<a name="line.407"></a>
+<span class="sourceLineNo">408</span>    // Create a fake key/value, so that this scanner only bubbles up to the top<a name="line.408"></a>
+<span class="sourceLineNo">409</span>    // of the KeyValueHeap in StoreScanner after we scanned this row/column in<a name="line.409"></a>
+<span class="sourceLineNo">410</span>    // all other store files. The query matcher will then just skip this fake<a name="line.410"></a>
+<span class="sourceLineNo">411</span>    // key/value and the store scanner will progress to the next column. This<a name="line.411"></a>
+<span class="sourceLineNo">412</span>    // is obviously not a "real real" seek, but unlike the fake KV earlier in<a name="line.412"></a>
+<span class="sourceLineNo">413</span>    // this method, we want this to be propagated to ScanQueryMatcher.<a name="line.413"></a>
+<span class="sourceLineNo">414</span>    setCurrentCell(CellUtil.createLastOnRowCol(kv));<a name="line.414"></a>
+<span class="sourceLineNo">415</span><a name="line.415"></a>
+<span class="sourceLineNo">416</span>    realSeekDone = true;<a name="line.416"></a>
+<span class="sourceLineNo">417</span>    return true;<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>  StoreFileReader getReader() {<a name="line.420"></a>
+<span class="sourceLineNo">421</span>    return reader;<a name="line.421"></a>
+<span class="sourceLineNo">422</span>  }<a name="line.422"></a>
+<span class="sourceLineNo">423</span><a name="line.423"></a>
+<span class="sourceLineNo">424</span>  CellComparator getComparator() {<a name="line.424"></a>
+<span class="sourceLineNo">425</span>    return reader.getComparator();<a name="line.425"></a>
+<span class="sourceLineNo">426</span>  }<a name="line.426"></a>
+<span class="sourceLineNo">427</span><a name="line.427"></a>
+<span class="sourceLineNo">428</span>  @Override<a name="line.428"></a>
+<span class="sourceLineNo">429</span>  public boolean realSeekDone() {<a name="line.429"></a>
+<span class="sourceLineNo">430</span>    return realSeekDone;<a name="line.430"></a>
+<span class="sourceLineNo">431</span>  }<a name="line.431"></a>
+<span class="sourceLineNo">432</span><a name="line.432"></a>
+<span class="sourceLineNo">433</span>  @Override<a name="line.433"></a>
+<span class="sourceLineNo">434</span>  public void enforceSeek() throws IOException {<a name="line.434"></a>
+<span class="sourceLineNo">435</span>    if (realSeekDone)<a name="line.435"></a>
+<span class="sourceLineNo">436</span>      return;<a name="line.436"></a>
+<span class="sourceLineNo">437</span><a name="line.437"></a>
+<span class="sourceLineNo">438</span>    if (delayedReseek) {<a name="line.438"></a>
+<span class="sourceLineNo">439</span>      reseek(delayedSeekKV);<a name="line.439"></a>
+<span class="sourceLineNo">440</span>    } else {<a name="line.440"></a>
+<span class="sourceLineNo">441</span>      seek(delayedSeekKV);<a name="line.441"></a>
+<span class="sourceLineNo">442</span>    }<a name="line.442"></a>
+<span class="sourceLineNo">443</span>  }<a name="line.443"></a>
+<span class="sourceLineNo">444</span><a name="line.444"></a>
+<span class="sourceLineNo">445</span>  @Override<a name="line.445"></a>
+<span class="sourceLineNo">446</span>  public boolean isFileScanner() {<a name="line.446"></a>
+<span class="sourceLineNo">447</span>    return true;<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>  @Override<a name="line.450"></a>
+<span class="sourceLineNo">451</span>  public Path getFilePath() {<a name="line.451"></a>
+<span class="sourceLineNo">452</span>    return reader.getHFileReader().getPath();<a name="line.452"></a>
+<span class="sourceLineNo">453</span>  }<a name="line.453"></a>
+<span class="sourceLineNo">454</span><a name="line.454"></a>
+<span class="sourceLineNo">455</span>  // Test methods<a name="line.455"></a>
+<span class="sourceLineNo">456</span>  static final long getSeekCount() {<a name="line.456"></a>
+<span class="sourceLineNo">457</span>    return seekCount.sum();<a name="line.457"></a>
+<span class="sourceLineNo">458</span>  }<a name="line.458"></a>
+<span class="sourceLineNo">459</span><a name="line.459"></a>
+<span class="sourceLineNo">460</span>  static final void instrument() {<a name="line.460"></a>
+<span class="sourceLineNo">461</span>    seekCount = new LongAdder();<a name="line.461"></a>
+<span class="sourceLineNo">462</span>  }<a name="line.462"></a>
+<span class="sourceLineNo">463</span><a name="line.463"></a>
+<span class="sourceLineNo">464</span>  @Override<a name="line.464"></a>
+<span class="sourceLineNo">465</span>  public boolean shouldUseScanner(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.465"></a>
+<span class="sourceLineNo">466</span>    // if the file has no entries, no need to validate or create a scanner.<a name="line.466"></a>
+<span class="sourceLineNo">467</span>    byte[] cf = store.getFamily().getName();<a name="line.467"></a>
+<span class="sourceLineNo">468</span>    TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.468"></a>
+<span class="sourceLineNo">469</span>    if (timeRange == null) {<a name="line.469"></a>
+<span class="sourceLineNo">470</span>      timeRange = scan.getTimeRange();<a name="line.470"></a>
+<span class="sourceLineNo">471</span>    }<a name="line.471"></a>
+<span class="sourceLineNo">472</span>    return reader.passesTimerangeFilter(timeRange, oldestUnexpiredTS) &amp;&amp; reader<a name="line.472"></a>
+<span class="sourceLineNo">473</span>        .passesKeyRangeFilter(scan) &amp;&amp; reader.passesBloomFilter(scan, scan.getFamilyMap().get(cf));<a name="line.473"></a>
+<span class="sourceLineNo">474</span>  }<a name="line.474"></a>
+<span class="sourceLineNo">475</span><a name="line.475"></a>
+<span class="sourceLineNo">476</span>  @Override<a name="line.476"></a>
+<span class="sourceLineNo">477</span>  public boolean seekToPreviousRow(Cell originalKey) throws IOException {<a name="line.477"></a>
+<span class="sourceLineNo">478</span>    try {<a name="line.478"></a>
+<span class="sourceLineNo">479</span>      try {<a name="line.479"></a>
+<span class="sourceLineNo">480</span>        boolean keepSeeking = false;<a name="line.480"></a>
+<span class="sourceLineNo">481</span>        Cell key = originalKey;<a name="line.481"></a>
+<span class="sourceLineNo">482</span>        do {<a name="line.482"></a>
+<span class="sourceLineNo">483</span>          Cell seekKey = CellUtil.createFirstOnRow(key);<a name="line.483"></a>
 <span class="sourceLineNo">484</span>          if (seekCount != null) seekCount.increment();<a name="line.484"></a>
-<span class="sourceLineNo">485</span>          if (!seekAtOrAfter(hfs, firstKeyOfPreviousRow)) {<a name="line.485"></a>
+<span class="sourceLineNo">485</span>          if (!hfs.seekBefore(seekKey)) {<a name="line.485"></a>
 <span class="sourceLineNo">486</span>            this.cur = null;<a name="line.486"></a>
 <span class="sourceLineNo">487</span>            return false;<a name="line.487"></a>
 <span class="sourceLineNo">488</span>          }<a name="line.488"></a>
-<span class="sourceLineNo">489</span><a name="line.489"></a>
-<span class="sourceLineNo">490</span>          setCurrentCell(hfs.getCell());<a name="line.490"></a>
-<span class="sourceLineNo">491</span>          this.stopSkippingKVsIfNextRow = true;<a name="line.491"></a>
-<span class="sourceLineNo">492</span>          boolean resultOfSkipKVs;<a name="line.492"></a>
-<span class="sourceLineNo">493</span>          try {<a name="line.493"></a>
-<span class="sourceLineNo">494</span>            resultOfSkipKVs = skipKVsNewerThanReadpoint();<a name="line.494"></a>
-<span class="sourceLineNo">495</span>          } finally {<a name="line.495"></a>
-<span class="sourceLineNo">496</span>            this.stopSkippingKVsIfNextRow = false;<a name="line.496"></a>
-<span class="sourceLineNo">497</span>          }<a name="line.497"></a>
-<span class="sourceLineNo">498</span>          if (!resultOfSkipKVs<a name="line.498"></a>
-<span class="sourceLineNo">499</span>              || getComparator().compareRows(cur, firstKeyOfPreviousRow) &gt; 0) {<a name="line.499"></a>
-<span class="sourceLineNo">500</span>            keepSeeking = true;<a name="line.500"></a>
-<span class="sourceLineNo">501</span>            key = firstKeyOfPreviousRow;<a name="line.501"></a>
-<span class="sourceLineNo">502</span>            continue;<a name="line.502"></a>
-<span class="sourceLineNo">503</span>          } else {<a name="line.503"></a>
-<span class="sourceLineNo">504</span>            keepSeeking = false;<a name="line.504"></a>
+<span class="sourceLineNo">489</span>          Cell curCell = hfs.getCell();<a name="line.489"></a>
+<span class="sourceLineNo">490</span>          Cell firstKeyOfPreviousRow = CellUtil.createFirstOnRow(curCell);<a name="line.490"></a>
+<span class="sourceLineNo">491</span><a name="line.491"></a>
+<span class="sourceLineNo">492</span>          if (seekCount != null) seekCount.increment();<a name="line.492"></a>
+<span class="sourceLineNo">493</span>          if (!seekAtOrAfter(hfs, firstKeyOfPreviousRow)) {<a name="line.493"></a>
+<span class="sourceLineNo">494</span>            this.cur = null;<a name="line.494"></a>
+<span 

<TRUNCATED>

Mime
View raw message