http://git-wip-us.apache.org/repos/asf/hbase-site/blob/21766f4a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MajorCompactionScanQueryMatcher.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MajorCompactionScanQueryMatcher.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MajorCompactionScanQueryMatcher.html index 45cb66f..6b18754 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MajorCompactionScanQueryMatcher.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MajorCompactionScanQueryMatcher.html @@ -39,54 +39,55 @@ <span class="sourceLineNo">031</span>public class MajorCompactionScanQueryMatcher extends DropDeletesCompactionScanQueryMatcher {<a name="line.31"></a> <span class="sourceLineNo">032</span><a name="line.32"></a> <span class="sourceLineNo">033</span> public MajorCompactionScanQueryMatcher(ScanInfo scanInfo, DeleteTracker deletes,<a name="line.33"></a> -<span class="sourceLineNo">034</span> long readPointToUse, long earliestPutTs, long oldestUnexpiredTS, long now) {<a name="line.34"></a> -<span class="sourceLineNo">035</span> super(scanInfo, deletes, readPointToUse, earliestPutTs, oldestUnexpiredTS, now);<a name="line.35"></a> -<span class="sourceLineNo">036</span> }<a name="line.36"></a> -<span class="sourceLineNo">037</span><a name="line.37"></a> -<span class="sourceLineNo">038</span> @Override<a name="line.38"></a> -<span class="sourceLineNo">039</span> public MatchCode match(Cell cell) throws IOException {<a name="line.39"></a> -<span class="sourceLineNo">040</span> MatchCode returnCode = preCheck(cell);<a name="line.40"></a> -<span class="sourceLineNo">041</span> if (returnCode != null) {<a name="line.41"></a> -<span class="sourceLineNo">042</span> return returnCode;<a name="line.42"></a> -<span class="sourceLineNo">043</span> }<a name="line.43"></a> -<span class="sourceLineNo">044</span> long timestamp = cell.getTimestamp();<a name="line.44"></a> -<span class="sourceLineNo">045</span> long mvccVersion = cell.getSequenceId();<a name="line.45"></a> -<span class="sourceLineNo">046</span> byte typeByte = cell.getTypeByte();<a name="line.46"></a> -<span class="sourceLineNo">047</span><a name="line.47"></a> -<span class="sourceLineNo">048</span> // The delete logic is pretty complicated now.<a name="line.48"></a> -<span class="sourceLineNo">049</span> // This is corroborated by the following:<a name="line.49"></a> -<span class="sourceLineNo">050</span> // 1. The store might be instructed to keep deleted rows around.<a name="line.50"></a> -<span class="sourceLineNo">051</span> // 2. A scan can optionally see past a delete marker now.<a name="line.51"></a> -<span class="sourceLineNo">052</span> // 3. If deleted rows are kept, we have to find out when we can<a name="line.52"></a> -<span class="sourceLineNo">053</span> // remove the delete markers.<a name="line.53"></a> -<span class="sourceLineNo">054</span> // 4. Family delete markers are always first (regardless of their TS)<a name="line.54"></a> -<span class="sourceLineNo">055</span> // 5. Delete markers should not be counted as version<a name="line.55"></a> -<span class="sourceLineNo">056</span> // 6. Delete markers affect puts of the *same* TS<a name="line.56"></a> -<span class="sourceLineNo">057</span> // 7. Delete marker need to be version counted together with puts<a name="line.57"></a> -<span class="sourceLineNo">058</span> // they affect<a name="line.58"></a> -<span class="sourceLineNo">059</span> //<a name="line.59"></a> -<span class="sourceLineNo">060</span> if (CellUtil.isDelete(typeByte)) {<a name="line.60"></a> -<span class="sourceLineNo">061</span> if (mvccVersion > maxReadPointToTrackVersions) {<a name="line.61"></a> -<span class="sourceLineNo">062</span> // We can not drop this delete marker yet, and also we should not use this delete marker to<a name="line.62"></a> -<span class="sourceLineNo">063</span> // mask any cell yet.<a name="line.63"></a> -<span class="sourceLineNo">064</span> return MatchCode.INCLUDE;<a name="line.64"></a> -<span class="sourceLineNo">065</span> }<a name="line.65"></a> -<span class="sourceLineNo">066</span> trackDelete(cell);<a name="line.66"></a> -<span class="sourceLineNo">067</span> returnCode = tryDropDelete(cell);<a name="line.67"></a> -<span class="sourceLineNo">068</span> if (returnCode != null) {<a name="line.68"></a> -<span class="sourceLineNo">069</span> return returnCode;<a name="line.69"></a> -<span class="sourceLineNo">070</span> }<a name="line.70"></a> -<span class="sourceLineNo">071</span> } else {<a name="line.71"></a> -<span class="sourceLineNo">072</span> returnCode = checkDeleted(deletes, cell);<a name="line.72"></a> -<span class="sourceLineNo">073</span> if (returnCode != null) {<a name="line.73"></a> -<span class="sourceLineNo">074</span> return returnCode;<a name="line.74"></a> -<span class="sourceLineNo">075</span> }<a name="line.75"></a> -<span class="sourceLineNo">076</span> }<a name="line.76"></a> -<span class="sourceLineNo">077</span> // Skip checking column since we do not remove column during compaction.<a name="line.77"></a> -<span class="sourceLineNo">078</span> return columns.checkVersions(cell, timestamp, typeByte,<a name="line.78"></a> -<span class="sourceLineNo">079</span> mvccVersion > maxReadPointToTrackVersions);<a name="line.79"></a> -<span class="sourceLineNo">080</span> }<a name="line.80"></a> -<span class="sourceLineNo">081</span>}<a name="line.81"></a> +<span class="sourceLineNo">034</span> ColumnTracker columns, long readPointToUse, long earliestPutTs, long oldestUnexpiredTS,<a name="line.34"></a> +<span class="sourceLineNo">035</span> long now) {<a name="line.35"></a> +<span class="sourceLineNo">036</span> super(scanInfo, deletes, columns, readPointToUse, earliestPutTs, oldestUnexpiredTS, now);<a name="line.36"></a> +<span class="sourceLineNo">037</span> }<a name="line.37"></a> +<span class="sourceLineNo">038</span><a name="line.38"></a> +<span class="sourceLineNo">039</span> @Override<a name="line.39"></a> +<span class="sourceLineNo">040</span> public MatchCode match(Cell cell) throws IOException {<a name="line.40"></a> +<span class="sourceLineNo">041</span> MatchCode returnCode = preCheck(cell);<a name="line.41"></a> +<span class="sourceLineNo">042</span> if (returnCode != null) {<a name="line.42"></a> +<span class="sourceLineNo">043</span> return returnCode;<a name="line.43"></a> +<span class="sourceLineNo">044</span> }<a name="line.44"></a> +<span class="sourceLineNo">045</span> long timestamp = cell.getTimestamp();<a name="line.45"></a> +<span class="sourceLineNo">046</span> long mvccVersion = cell.getSequenceId();<a name="line.46"></a> +<span class="sourceLineNo">047</span> byte typeByte = cell.getTypeByte();<a name="line.47"></a> +<span class="sourceLineNo">048</span><a name="line.48"></a> +<span class="sourceLineNo">049</span> // The delete logic is pretty complicated now.<a name="line.49"></a> +<span class="sourceLineNo">050</span> // This is corroborated by the following:<a name="line.50"></a> +<span class="sourceLineNo">051</span> // 1. The store might be instructed to keep deleted rows around.<a name="line.51"></a> +<span class="sourceLineNo">052</span> // 2. A scan can optionally see past a delete marker now.<a name="line.52"></a> +<span class="sourceLineNo">053</span> // 3. If deleted rows are kept, we have to find out when we can<a name="line.53"></a> +<span class="sourceLineNo">054</span> // remove the delete markers.<a name="line.54"></a> +<span class="sourceLineNo">055</span> // 4. Family delete markers are always first (regardless of their TS)<a name="line.55"></a> +<span class="sourceLineNo">056</span> // 5. Delete markers should not be counted as version<a name="line.56"></a> +<span class="sourceLineNo">057</span> // 6. Delete markers affect puts of the *same* TS<a name="line.57"></a> +<span class="sourceLineNo">058</span> // 7. Delete marker need to be version counted together with puts<a name="line.58"></a> +<span class="sourceLineNo">059</span> // they affect<a name="line.59"></a> +<span class="sourceLineNo">060</span> //<a name="line.60"></a> +<span class="sourceLineNo">061</span> if (CellUtil.isDelete(typeByte)) {<a name="line.61"></a> +<span class="sourceLineNo">062</span> if (mvccVersion > maxReadPointToTrackVersions) {<a name="line.62"></a> +<span class="sourceLineNo">063</span> // We can not drop this delete marker yet, and also we should not use this delete marker to<a name="line.63"></a> +<span class="sourceLineNo">064</span> // mask any cell yet.<a name="line.64"></a> +<span class="sourceLineNo">065</span> return MatchCode.INCLUDE;<a name="line.65"></a> +<span class="sourceLineNo">066</span> }<a name="line.66"></a> +<span class="sourceLineNo">067</span> trackDelete(cell);<a name="line.67"></a> +<span class="sourceLineNo">068</span> returnCode = tryDropDelete(cell);<a name="line.68"></a> +<span class="sourceLineNo">069</span> if (returnCode != null) {<a name="line.69"></a> +<span class="sourceLineNo">070</span> return returnCode;<a name="line.70"></a> +<span class="sourceLineNo">071</span> }<a name="line.71"></a> +<span class="sourceLineNo">072</span> } else {<a name="line.72"></a> +<span class="sourceLineNo">073</span> returnCode = checkDeleted(deletes, cell);<a name="line.73"></a> +<span class="sourceLineNo">074</span> if (returnCode != null) {<a name="line.74"></a> +<span class="sourceLineNo">075</span> return returnCode;<a name="line.75"></a> +<span class="sourceLineNo">076</span> }<a name="line.76"></a> +<span class="sourceLineNo">077</span> }<a name="line.77"></a> +<span class="sourceLineNo">078</span> // Skip checking column since we do not remove column during compaction.<a name="line.78"></a> +<span class="sourceLineNo">079</span> return columns.checkVersions(cell, timestamp, typeByte,<a name="line.79"></a> +<span class="sourceLineNo">080</span> mvccVersion > maxReadPointToTrackVersions);<a name="line.80"></a> +<span class="sourceLineNo">081</span> }<a name="line.81"></a> +<span class="sourceLineNo">082</span>}<a name="line.82"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/21766f4a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MinorCompactionScanQueryMatcher.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MinorCompactionScanQueryMatcher.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MinorCompactionScanQueryMatcher.html index 94cfd6f..1cb7a5b 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MinorCompactionScanQueryMatcher.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/MinorCompactionScanQueryMatcher.html @@ -39,8 +39,8 @@ <span class="sourceLineNo">031</span>public class MinorCompactionScanQueryMatcher extends CompactionScanQueryMatcher {<a name="line.31"></a> <span class="sourceLineNo">032</span><a name="line.32"></a> <span class="sourceLineNo">033</span> public MinorCompactionScanQueryMatcher(ScanInfo scanInfo, DeleteTracker deletes,<a name="line.33"></a> -<span class="sourceLineNo">034</span> long readPointToUse, long oldestUnexpiredTS, long now) {<a name="line.34"></a> -<span class="sourceLineNo">035</span> super(scanInfo, deletes, readPointToUse, oldestUnexpiredTS, now);<a name="line.35"></a> +<span class="sourceLineNo">034</span> ColumnTracker columns, long readPointToUse, long oldestUnexpiredTS, long now) {<a name="line.34"></a> +<span class="sourceLineNo">035</span> super(scanInfo, deletes, columns, readPointToUse, oldestUnexpiredTS, now);<a name="line.35"></a> <span class="sourceLineNo">036</span> }<a name="line.36"></a> <span class="sourceLineNo">037</span><a name="line.37"></a> <span class="sourceLineNo">038</span> @Override<a name="line.38"></a> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/21766f4a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.DeleteVersionsNode.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.DeleteVersionsNode.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.DeleteVersionsNode.html new file mode 100644 index 0000000..d17d169 --- /dev/null +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.DeleteVersionsNode.html @@ -0,0 +1,448 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd";> +<html lang="en"> +<head> +<title>Source code</title> +<link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style"> +</head> +<body> +<div class="sourceContainer"> +<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a> +<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a> +<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a> +<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a> +<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a> +<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a> +<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a> +<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a> +<span class="sourceLineNo">009</span> * <p><a name="line.9"></a> +<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a> +<span class="sourceLineNo">011</span> * <p><a name="line.11"></a> +<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a> +<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a> +<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a> +<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a> +<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a> +<span class="sourceLineNo">017</span> */<a name="line.17"></a> +<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.regionserver.querymatcher;<a name="line.18"></a> +<span class="sourceLineNo">019</span><a name="line.19"></a> +<span class="sourceLineNo">020</span>import java.io.IOException;<a name="line.20"></a> +<span class="sourceLineNo">021</span>import java.util.HashMap;<a name="line.21"></a> +<span class="sourceLineNo">022</span>import java.util.Map;<a name="line.22"></a> +<span class="sourceLineNo">023</span>import java.util.NavigableMap;<a name="line.23"></a> +<span class="sourceLineNo">024</span>import java.util.NavigableSet;<a name="line.24"></a> +<span class="sourceLineNo">025</span>import java.util.SortedMap;<a name="line.25"></a> +<span class="sourceLineNo">026</span>import java.util.SortedSet;<a name="line.26"></a> +<span class="sourceLineNo">027</span>import java.util.TreeMap;<a name="line.27"></a> +<span class="sourceLineNo">028</span>import java.util.TreeSet;<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.CellUtil;<a name="line.31"></a> +<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.KeyValue.Type;<a name="line.32"></a> +<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.33"></a> +<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.regionserver.querymatcher.ScanQueryMatcher.MatchCode;<a name="line.34"></a> +<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.35"></a> +<span class="sourceLineNo">036</span><a name="line.36"></a> +<span class="sourceLineNo">037</span>/**<a name="line.37"></a> +<span class="sourceLineNo">038</span> * A tracker both implementing ColumnTracker and DeleteTracker, used for mvcc-sensitive scanning.<a name="line.38"></a> +<span class="sourceLineNo">039</span> * We should make sure in one QueryMatcher the ColumnTracker and DeleteTracker is the same instance.<a name="line.39"></a> +<span class="sourceLineNo">040</span> */<a name="line.40"></a> +<span class="sourceLineNo">041</span>@InterfaceAudience.Private<a name="line.41"></a> +<span class="sourceLineNo">042</span>public class NewVersionBehaviorTracker implements ColumnTracker, DeleteTracker {<a name="line.42"></a> +<span class="sourceLineNo">043</span><a name="line.43"></a> +<span class="sourceLineNo">044</span> private byte[] lastCqArray;<a name="line.44"></a> +<span class="sourceLineNo">045</span> private int lastCqLength;<a name="line.45"></a> +<span class="sourceLineNo">046</span> private int lastCqOffset;<a name="line.46"></a> +<span class="sourceLineNo">047</span> private long lastCqTs;<a name="line.47"></a> +<span class="sourceLineNo">048</span> private long lastCqMvcc;<a name="line.48"></a> +<span class="sourceLineNo">049</span> private byte lastCqType;<a name="line.49"></a> +<span class="sourceLineNo">050</span> private int columnIndex;<a name="line.50"></a> +<span class="sourceLineNo">051</span> private int countCurrentCol;<a name="line.51"></a> +<span class="sourceLineNo">052</span><a name="line.52"></a> +<span class="sourceLineNo">053</span> protected int maxVersions;<a name="line.53"></a> +<span class="sourceLineNo">054</span> private int resultMaxVersions;<a name="line.54"></a> +<span class="sourceLineNo">055</span> private byte[][] columns;<a name="line.55"></a> +<span class="sourceLineNo">056</span> private int minVersions;<a name="line.56"></a> +<span class="sourceLineNo">057</span> private long oldestStamp;<a name="line.57"></a> +<span class="sourceLineNo">058</span><a name="line.58"></a> +<span class="sourceLineNo">059</span> // These two maps have same structure.<a name="line.59"></a> +<span class="sourceLineNo">060</span> // Each node is a versions deletion (DeleteFamily or DeleteColumn). Key is the mvcc of the marker,<a name="line.60"></a> +<span class="sourceLineNo">061</span> // value is a data structure which contains infos we need that happens before this node's mvcc and<a name="line.61"></a> +<span class="sourceLineNo">062</span> // after the previous node's mvcc. The last node is a special node whose key is max_long that<a name="line.62"></a> +<span class="sourceLineNo">063</span> // saves infos after last deletion. See DeleteVersionsNode's comments for details.<a name="line.63"></a> +<span class="sourceLineNo">064</span> // The delColMap is constructed and used for each cq, and thedelFamMap is constructed when cq is<a name="line.64"></a> +<span class="sourceLineNo">065</span> // null and saving family-level delete markers. Each time the cq is changed, we should<a name="line.65"></a> +<span class="sourceLineNo">066</span> // reconstruct delColMap as a deep copy of delFamMap.<a name="line.66"></a> +<span class="sourceLineNo">067</span> protected NavigableMap<Long, DeleteVersionsNode> delColMap = new TreeMap<>();<a name="line.67"></a> +<span class="sourceLineNo">068</span> protected NavigableMap<Long, DeleteVersionsNode> delFamMap = new TreeMap<>();<a name="line.68"></a> +<span class="sourceLineNo">069</span><a name="line.69"></a> +<span class="sourceLineNo">070</span> /**<a name="line.70"></a> +<span class="sourceLineNo">071</span> * Note maxVersion and minVersion must set according to cf's conf, not user's scan parameter.<a name="line.71"></a> +<span class="sourceLineNo">072</span> *<a name="line.72"></a> +<span class="sourceLineNo">073</span> * @param columns columns specified user in query<a name="line.73"></a> +<span class="sourceLineNo">074</span> * @param minVersion The minimum number of versions to keep(used when TTL is set).<a name="line.74"></a> +<span class="sourceLineNo">075</span> * @param maxVersion The maximum number of versions in CF's conf<a name="line.75"></a> +<span class="sourceLineNo">076</span> * @param resultMaxVersions maximum versions to return per column, which may be different from<a name="line.76"></a> +<span class="sourceLineNo">077</span> * maxVersion<a name="line.77"></a> +<span class="sourceLineNo">078</span> * @param oldestUnexpiredTS the oldest timestamp we are interested in, based on TTL<a name="line.78"></a> +<span class="sourceLineNo">079</span> */<a name="line.79"></a> +<span class="sourceLineNo">080</span> public NewVersionBehaviorTracker(NavigableSet<byte[]> columns, int minVersion, int maxVersion,<a name="line.80"></a> +<span class="sourceLineNo">081</span> int resultMaxVersions, long oldestUnexpiredTS) {<a name="line.81"></a> +<span class="sourceLineNo">082</span> this.maxVersions = maxVersion;<a name="line.82"></a> +<span class="sourceLineNo">083</span> this.minVersions = minVersion;<a name="line.83"></a> +<span class="sourceLineNo">084</span> this.resultMaxVersions = resultMaxVersions;<a name="line.84"></a> +<span class="sourceLineNo">085</span> this.oldestStamp = oldestUnexpiredTS;<a name="line.85"></a> +<span class="sourceLineNo">086</span> if (columns != null && columns.size() > 0) {<a name="line.86"></a> +<span class="sourceLineNo">087</span> this.columns = new byte[columns.size()][];<a name="line.87"></a> +<span class="sourceLineNo">088</span> int i = 0;<a name="line.88"></a> +<span class="sourceLineNo">089</span> for (byte[] column : columns) {<a name="line.89"></a> +<span class="sourceLineNo">090</span> this.columns[i++] = column;<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> reset();<a name="line.93"></a> +<span class="sourceLineNo">094</span> }<a name="line.94"></a> +<span class="sourceLineNo">095</span><a name="line.95"></a> +<span class="sourceLineNo">096</span> @Override<a name="line.96"></a> +<span class="sourceLineNo">097</span> public void beforeShipped() throws IOException {<a name="line.97"></a> +<span class="sourceLineNo">098</span> // Do nothing<a name="line.98"></a> +<span class="sourceLineNo">099</span> }<a name="line.99"></a> +<span class="sourceLineNo">100</span><a name="line.100"></a> +<span class="sourceLineNo">101</span> /**<a name="line.101"></a> +<span class="sourceLineNo">102</span> * A data structure which contains infos we need that happens before this node's mvcc and<a name="line.102"></a> +<span class="sourceLineNo">103</span> * after the previous node's mvcc. A node means there is a version deletion at the mvcc and ts.<a name="line.103"></a> +<span class="sourceLineNo">104</span> */<a name="line.104"></a> +<span class="sourceLineNo">105</span> protected class DeleteVersionsNode {<a name="line.105"></a> +<span class="sourceLineNo">106</span> public long ts;<a name="line.106"></a> +<span class="sourceLineNo">107</span> public long mvcc;<a name="line.107"></a> +<span class="sourceLineNo">108</span><a name="line.108"></a> +<span class="sourceLineNo">109</span> // <timestamp, set<mvcc>><a name="line.109"></a> +<span class="sourceLineNo">110</span> // Key is ts of version deletes, value is its mvccs.<a name="line.110"></a> +<span class="sourceLineNo">111</span> // We may delete more than one time for a version.<a name="line.111"></a> +<span class="sourceLineNo">112</span> private Map<Long, SortedSet<Long>> deletesMap = new HashMap<>();<a name="line.112"></a> +<span class="sourceLineNo">113</span><a name="line.113"></a> +<span class="sourceLineNo">114</span> // <mvcc, set<mvcc>><a name="line.114"></a> +<span class="sourceLineNo">115</span> // Key is mvcc of version deletes, value is mvcc of visible puts before the delete effect.<a name="line.115"></a> +<span class="sourceLineNo">116</span> private NavigableMap<Long, SortedSet<Long>> mvccCountingMap = new TreeMap<>();<a name="line.116"></a> +<span class="sourceLineNo">117</span><a name="line.117"></a> +<span class="sourceLineNo">118</span> protected DeleteVersionsNode(long ts, long mvcc) {<a name="line.118"></a> +<span class="sourceLineNo">119</span> this.ts = ts;<a name="line.119"></a> +<span class="sourceLineNo">120</span> this.mvcc = mvcc;<a name="line.120"></a> +<span class="sourceLineNo">121</span> mvccCountingMap.put(Long.MAX_VALUE, new TreeSet<Long>());<a name="line.121"></a> +<span class="sourceLineNo">122</span> }<a name="line.122"></a> +<span class="sourceLineNo">123</span><a name="line.123"></a> +<span class="sourceLineNo">124</span> protected DeleteVersionsNode() {<a name="line.124"></a> +<span class="sourceLineNo">125</span> this(Long.MIN_VALUE, Long.MAX_VALUE);<a name="line.125"></a> +<span class="sourceLineNo">126</span> }<a name="line.126"></a> +<span class="sourceLineNo">127</span><a name="line.127"></a> +<span class="sourceLineNo">128</span> public void addVersionDelete(Cell cell) {<a name="line.128"></a> +<span class="sourceLineNo">129</span> SortedSet<Long> set = deletesMap.get(cell.getTimestamp());<a name="line.129"></a> +<span class="sourceLineNo">130</span> if (set == null) {<a name="line.130"></a> +<span class="sourceLineNo">131</span> set = new TreeSet<>();<a name="line.131"></a> +<span class="sourceLineNo">132</span> deletesMap.put(cell.getTimestamp(), set);<a name="line.132"></a> +<span class="sourceLineNo">133</span> }<a name="line.133"></a> +<span class="sourceLineNo">134</span> set.add(cell.getSequenceId());<a name="line.134"></a> +<span class="sourceLineNo">135</span> // The init set should be the puts whose mvcc is smaller than this Delete. Because<a name="line.135"></a> +<span class="sourceLineNo">136</span> // there may be some Puts masked by them. The Puts whose mvcc is larger than this Delete can<a name="line.136"></a> +<span class="sourceLineNo">137</span> // not be copied to this node because we may delete one version and the oldest put may not be<a name="line.137"></a> +<span class="sourceLineNo">138</span> // masked.<a name="line.138"></a> +<span class="sourceLineNo">139</span> SortedSet<Long> nextValue = mvccCountingMap.ceilingEntry(cell.getSequenceId()).getValue();<a name="line.139"></a> +<span class="sourceLineNo">140</span> SortedSet<Long> thisValue = new TreeSet<>(nextValue.headSet(cell.getSequenceId()));<a name="line.140"></a> +<span class="sourceLineNo">141</span> mvccCountingMap.put(cell.getSequenceId(), thisValue);<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> protected DeleteVersionsNode getDeepCopy() {<a name="line.144"></a> +<span class="sourceLineNo">145</span> DeleteVersionsNode node = new DeleteVersionsNode(ts, mvcc);<a name="line.145"></a> +<span class="sourceLineNo">146</span> for (Map.Entry<Long, SortedSet<Long>> e : deletesMap.entrySet()) {<a name="line.146"></a> +<span class="sourceLineNo">147</span> node.deletesMap.put(e.getKey(), new TreeSet<>(e.getValue()));<a name="line.147"></a> +<span class="sourceLineNo">148</span> }<a name="line.148"></a> +<span class="sourceLineNo">149</span> for (Map.Entry<Long, SortedSet<Long>> e : mvccCountingMap.entrySet()) {<a name="line.149"></a> +<span class="sourceLineNo">150</span> node.mvccCountingMap.put(e.getKey(), new TreeSet<>(e.getValue()));<a name="line.150"></a> +<span class="sourceLineNo">151</span> }<a name="line.151"></a> +<span class="sourceLineNo">152</span> return node;<a name="line.152"></a> +<span class="sourceLineNo">153</span> }<a name="line.153"></a> +<span class="sourceLineNo">154</span> }<a name="line.154"></a> +<span class="sourceLineNo">155</span><a name="line.155"></a> +<span class="sourceLineNo">156</span> /**<a name="line.156"></a> +<span class="sourceLineNo">157</span> * Reset the map if it is different with the last Cell.<a name="line.157"></a> +<span class="sourceLineNo">158</span> * Save the cq array/offset/length for next Cell.<a name="line.158"></a> +<span class="sourceLineNo">159</span> *<a name="line.159"></a> +<span class="sourceLineNo">160</span> * @return If this put has duplicate ts with last cell, return the mvcc of last cell.<a name="line.160"></a> +<span class="sourceLineNo">161</span> * Else return MAX_VALUE.<a name="line.161"></a> +<span class="sourceLineNo">162</span> */<a name="line.162"></a> +<span class="sourceLineNo">163</span> protected long prepare(Cell cell) {<a name="line.163"></a> +<span class="sourceLineNo">164</span> boolean matchCq = CellUtil.matchingQualifier(cell, lastCqArray, lastCqOffset, lastCqLength);<a name="line.164"></a> +<span class="sourceLineNo">165</span> if (!matchCq) {<a name="line.165"></a> +<span class="sourceLineNo">166</span> // The last cell is family-level delete and this is not, or the cq is changed,<a name="line.166"></a> +<span class="sourceLineNo">167</span> // we should construct delColMap as a deep copy of delFamMap.<a name="line.167"></a> +<span class="sourceLineNo">168</span> delColMap.clear();<a name="line.168"></a> +<span class="sourceLineNo">169</span> for (Map.Entry<Long, DeleteVersionsNode> e : delFamMap.entrySet()) {<a name="line.169"></a> +<span class="sourceLineNo">170</span> delColMap.put(e.getKey(), e.getValue().getDeepCopy());<a name="line.170"></a> +<span class="sourceLineNo">171</span> }<a name="line.171"></a> +<span class="sourceLineNo">172</span> countCurrentCol = 0;<a name="line.172"></a> +<span class="sourceLineNo">173</span> }<a name="line.173"></a> +<span class="sourceLineNo">174</span> if (matchCq && !CellUtil.isDelete(lastCqType) && lastCqType == cell.getTypeByte()<a name="line.174"></a> +<span class="sourceLineNo">175</span> && lastCqTs == cell.getTimestamp()) {<a name="line.175"></a> +<span class="sourceLineNo">176</span> // Put with duplicate timestamp, ignore.<a name="line.176"></a> +<span class="sourceLineNo">177</span> return lastCqMvcc;<a name="line.177"></a> +<span class="sourceLineNo">178</span> }<a name="line.178"></a> +<span class="sourceLineNo">179</span> lastCqArray = cell.getQualifierArray();<a name="line.179"></a> +<span class="sourceLineNo">180</span> lastCqOffset = cell.getQualifierOffset();<a name="line.180"></a> +<span class="sourceLineNo">181</span> lastCqLength = cell.getQualifierLength();<a name="line.181"></a> +<span class="sourceLineNo">182</span> lastCqTs = cell.getTimestamp();<a name="line.182"></a> +<span class="sourceLineNo">183</span> lastCqMvcc = cell.getSequenceId();<a name="line.183"></a> +<span class="sourceLineNo">184</span> lastCqType = cell.getTypeByte();<a name="line.184"></a> +<span class="sourceLineNo">185</span> return Long.MAX_VALUE;<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> // DeleteTracker<a name="line.188"></a> +<span class="sourceLineNo">189</span> @Override<a name="line.189"></a> +<span class="sourceLineNo">190</span> public void add(Cell cell) {<a name="line.190"></a> +<span class="sourceLineNo">191</span> prepare(cell);<a name="line.191"></a> +<span class="sourceLineNo">192</span> byte type = cell.getTypeByte();<a name="line.192"></a> +<span class="sourceLineNo">193</span> switch (Type.codeToType(type)) {<a name="line.193"></a> +<span class="sourceLineNo">194</span> // By the order of seen. We put null cq at first.<a name="line.194"></a> +<span class="sourceLineNo">195</span> case DeleteFamily: // Delete all versions of all columns of the specified family<a name="line.195"></a> +<span class="sourceLineNo">196</span> delFamMap.put(cell.getSequenceId(),<a name="line.196"></a> +<span class="sourceLineNo">197</span> new DeleteVersionsNode(cell.getTimestamp(), cell.getSequenceId()));<a name="line.197"></a> +<span class="sourceLineNo">198</span> break;<a name="line.198"></a> +<span class="sourceLineNo">199</span> case DeleteFamilyVersion: // Delete all columns of the specified family and specified version<a name="line.199"></a> +<span class="sourceLineNo">200</span> delFamMap.ceilingEntry(cell.getSequenceId()).getValue().addVersionDelete(cell);<a name="line.200"></a> +<span class="sourceLineNo">201</span> break;<a name="line.201"></a> +<span class="sourceLineNo">202</span><a name="line.202"></a> +<span class="sourceLineNo">203</span> // These two kinds of markers are mix with Puts.<a name="line.203"></a> +<span class="sourceLineNo">204</span> case DeleteColumn: // Delete all versions of the specified column<a name="line.204"></a> +<span class="sourceLineNo">205</span> delColMap.put(cell.getSequenceId(),<a name="line.205"></a> +<span class="sourceLineNo">206</span> new DeleteVersionsNode(cell.getTimestamp(), cell.getSequenceId()));<a name="line.206"></a> +<span class="sourceLineNo">207</span> break;<a name="line.207"></a> +<span class="sourceLineNo">208</span> case Delete: // Delete the specified version of the specified column.<a name="line.208"></a> +<span class="sourceLineNo">209</span> delColMap.ceilingEntry(cell.getSequenceId()).getValue().addVersionDelete(cell);<a name="line.209"></a> +<span class="sourceLineNo">210</span> break;<a name="line.210"></a> +<span class="sourceLineNo">211</span> default:<a name="line.211"></a> +<span class="sourceLineNo">212</span> throw new AssertionError("Unknown delete marker type for " + cell);<a name="line.212"></a> +<span class="sourceLineNo">213</span> }<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> /**<a name="line.216"></a> +<span class="sourceLineNo">217</span> * This method is not idempotent, we will save some info to judge VERSION_MASKED.<a name="line.217"></a> +<span class="sourceLineNo">218</span> * @param cell - current cell to check if deleted by a previously seen delete<a name="line.218"></a> +<span class="sourceLineNo">219</span> * @return We don't distinguish DeleteColumn and DeleteFamily. We only return code for column.<a name="line.219"></a> +<span class="sourceLineNo">220</span> */<a name="line.220"></a> +<span class="sourceLineNo">221</span> @Override<a name="line.221"></a> +<span class="sourceLineNo">222</span> public DeleteResult isDeleted(Cell cell) {<a name="line.222"></a> +<span class="sourceLineNo">223</span> long duplicateMvcc = prepare(cell);<a name="line.223"></a> +<span class="sourceLineNo">224</span><a name="line.224"></a> +<span class="sourceLineNo">225</span> for (Map.Entry<Long, DeleteVersionsNode> e : delColMap.tailMap(cell.getSequenceId())<a name="line.225"></a> +<span class="sourceLineNo">226</span> .entrySet()) {<a name="line.226"></a> +<span class="sourceLineNo">227</span> DeleteVersionsNode node = e.getValue();<a name="line.227"></a> +<span class="sourceLineNo">228</span> long deleteMvcc = Long.MAX_VALUE;<a name="line.228"></a> +<span class="sourceLineNo">229</span> SortedSet<Long> deleteVersionMvccs = node.deletesMap.get(cell.getTimestamp());<a name="line.229"></a> +<span class="sourceLineNo">230</span> if (deleteVersionMvccs != null) {<a name="line.230"></a> +<span class="sourceLineNo">231</span> SortedSet<Long> tail = deleteVersionMvccs.tailSet(cell.getSequenceId());<a name="line.231"></a> +<span class="sourceLineNo">232</span> if (!tail.isEmpty()) {<a name="line.232"></a> +<span class="sourceLineNo">233</span> deleteMvcc = tail.first();<a name="line.233"></a> +<span class="sourceLineNo">234</span> }<a name="line.234"></a> +<span class="sourceLineNo">235</span> }<a name="line.235"></a> +<span class="sourceLineNo">236</span> SortedMap<Long, SortedSet<Long>> subMap =<a name="line.236"></a> +<span class="sourceLineNo">237</span> node.mvccCountingMap<a name="line.237"></a> +<span class="sourceLineNo">238</span> .subMap(cell.getSequenceId(), true, Math.min(duplicateMvcc, deleteMvcc), true);<a name="line.238"></a> +<span class="sourceLineNo">239</span> for (Map.Entry<Long, SortedSet<Long>> seg : subMap.entrySet()) {<a name="line.239"></a> +<span class="sourceLineNo">240</span> if (seg.getValue().size() >= maxVersions) {<a name="line.240"></a> +<span class="sourceLineNo">241</span> return DeleteResult.VERSION_MASKED;<a name="line.241"></a> +<span class="sourceLineNo">242</span> }<a name="line.242"></a> +<span class="sourceLineNo">243</span> seg.getValue().add(cell.getSequenceId());<a name="line.243"></a> +<span class="sourceLineNo">244</span> }<a name="line.244"></a> +<span class="sourceLineNo">245</span> if (deleteMvcc < Long.MAX_VALUE) {<a name="line.245"></a> +<span class="sourceLineNo">246</span> return DeleteResult.VERSION_DELETED;<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> if (cell.getTimestamp() <= node.ts) {<a name="line.249"></a> +<span class="sourceLineNo">250</span> return DeleteResult.COLUMN_DELETED;<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> if (duplicateMvcc < Long.MAX_VALUE) {<a name="line.253"></a> +<span class="sourceLineNo">254</span> return DeleteResult.VERSION_MASKED;<a name="line.254"></a> +<span class="sourceLineNo">255</span> }<a name="line.255"></a> +<span class="sourceLineNo">256</span> return DeleteResult.NOT_DELETED;<a name="line.256"></a> +<span class="sourceLineNo">257</span> }<a name="line.257"></a> +<span class="sourceLineNo">258</span><a name="line.258"></a> +<span class="sourceLineNo">259</span> @Override<a name="line.259"></a> +<span class="sourceLineNo">260</span> public boolean isEmpty() {<a name="line.260"></a> +<span class="sourceLineNo">261</span> return delColMap.size() == 1 && delColMap.get(Long.MAX_VALUE).mvccCountingMap.size() == 1<a name="line.261"></a> +<span class="sourceLineNo">262</span> && delFamMap.size() == 1 && delFamMap.get(Long.MAX_VALUE).mvccCountingMap.size() == 1;<a name="line.262"></a> +<span class="sourceLineNo">263</span> }<a name="line.263"></a> +<span class="sourceLineNo">264</span><a name="line.264"></a> +<span class="sourceLineNo">265</span> @Override<a name="line.265"></a> +<span class="sourceLineNo">266</span> public void update() {<a name="line.266"></a> +<span class="sourceLineNo">267</span> // ignore<a name="line.267"></a> +<span class="sourceLineNo">268</span> }<a name="line.268"></a> +<span class="sourceLineNo">269</span><a name="line.269"></a> +<span class="sourceLineNo">270</span> //ColumnTracker<a name="line.270"></a> +<span class="sourceLineNo">271</span><a name="line.271"></a> +<span class="sourceLineNo">272</span> @Override<a name="line.272"></a> +<span class="sourceLineNo">273</span> public MatchCode checkColumn(Cell cell, byte type) throws IOException {<a name="line.273"></a> +<span class="sourceLineNo">274</span> if (done()) {<a name="line.274"></a> +<span class="sourceLineNo">275</span> // No more columns left, we are done with this query<a name="line.275"></a> +<span class="sourceLineNo">276</span> return ScanQueryMatcher.MatchCode.SEEK_NEXT_ROW; // done_row<a name="line.276"></a> +<span class="sourceLineNo">277</span> }<a name="line.277"></a> +<span class="sourceLineNo">278</span> if (columns != null) {<a name="line.278"></a> +<span class="sourceLineNo">279</span> while (columnIndex < columns.length) {<a name="line.279"></a> +<span class="sourceLineNo">280</span> int c = Bytes.compareTo(columns[columnIndex], 0, columns[columnIndex].length,<a name="line.280"></a> +<span class="sourceLineNo">281</span> cell.getQualifierArray(), cell.getQualifierOffset(), cell.getQualifierLength());<a name="line.281"></a> +<span class="sourceLineNo">282</span> if (c < 0) {<a name="line.282"></a> +<span class="sourceLineNo">283</span> columnIndex++;<a name="line.283"></a> +<span class="sourceLineNo">284</span> } else if (c == 0) {<a name="line.284"></a> +<span class="sourceLineNo">285</span> // We drop old version in #isDeleted, so here we must return INCLUDE.<a name="line.285"></a> +<span class="sourceLineNo">286</span> return MatchCode.INCLUDE;<a name="line.286"></a> +<span class="sourceLineNo">287</span> } else {<a name="line.287"></a> +<span class="sourceLineNo">288</span> return MatchCode.SEEK_NEXT_COL;<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> return MatchCode.SEEK_NEXT_ROW;<a name="line.291"></a> +<span class="sourceLineNo">292</span> }<a name="line.292"></a> +<span class="sourceLineNo">293</span> return MatchCode.INCLUDE;<a name="line.293"></a> +<span class="sourceLineNo">294</span> }<a name="line.294"></a> +<span class="sourceLineNo">295</span><a name="line.295"></a> +<span class="sourceLineNo">296</span> @Override<a name="line.296"></a> +<span class="sourceLineNo">297</span> public MatchCode checkVersions(Cell cell, long timestamp, byte type,<a name="line.297"></a> +<span class="sourceLineNo">298</span> boolean ignoreCount) throws IOException {<a name="line.298"></a> +<span class="sourceLineNo">299</span> assert !CellUtil.isDelete(type);<a name="line.299"></a> +<span class="sourceLineNo">300</span> // We drop old version in #isDeleted, so here we won't SKIP because of versioning. But we should<a name="line.300"></a> +<span class="sourceLineNo">301</span> // consider TTL.<a name="line.301"></a> +<span class="sourceLineNo">302</span> if (ignoreCount) {<a name="line.302"></a> +<span class="sourceLineNo">303</span> return MatchCode.INCLUDE;<a name="line.303"></a> +<span class="sourceLineNo">304</span> }<a name="line.304"></a> +<span class="sourceLineNo">305</span> countCurrentCol++;<a name="line.305"></a> +<span class="sourceLineNo">306</span> if (timestamp < this.oldestStamp) {<a name="line.306"></a> +<span class="sourceLineNo">307</span> if (countCurrentCol == minVersions) {<a name="line.307"></a> +<span class="sourceLineNo">308</span> return MatchCode.INCLUDE_AND_SEEK_NEXT_COL;<a name="line.308"></a> +<span class="sourceLineNo">309</span> }<a name="line.309"></a> +<span class="sourceLineNo">310</span> if (countCurrentCol > minVersions) {<a name="line.310"></a> +<span class="sourceLineNo">311</span> // This may not be reached, only for safety.<a name="line.311"></a> +<span class="sourceLineNo">312</span> return MatchCode.SEEK_NEXT_COL;<a name="line.312"></a> +<span class="sourceLineNo">313</span> }<a name="line.313"></a> +<span class="sourceLineNo">314</span> }<a name="line.314"></a> +<span class="sourceLineNo">315</span><a name="line.315"></a> +<span class="sourceLineNo">316</span> if (countCurrentCol == resultMaxVersions) {<a name="line.316"></a> +<span class="sourceLineNo">317</span> // We have enough number of versions for user's requirement.<a name="line.317"></a> +<span class="sourceLineNo">318</span> return MatchCode.INCLUDE_AND_SEEK_NEXT_COL;<a name="line.318"></a> +<span class="sourceLineNo">319</span> }<a name="line.319"></a> +<span class="sourceLineNo">320</span> if (countCurrentCol > resultMaxVersions) {<a name="line.320"></a> +<span class="sourceLineNo">321</span> // This may not be reached, only for safety<a name="line.321"></a> +<span class="sourceLineNo">322</span> return MatchCode.SEEK_NEXT_COL;<a name="line.322"></a> +<span class="sourceLineNo">323</span> }<a name="line.323"></a> +<span class="sourceLineNo">324</span> return MatchCode.INCLUDE;<a name="line.324"></a> +<span class="sourceLineNo">325</span> }<a name="line.325"></a> +<span class="sourceLineNo">326</span><a name="line.326"></a> +<span class="sourceLineNo">327</span> @Override<a name="line.327"></a> +<span class="sourceLineNo">328</span> public void reset() {<a name="line.328"></a> +<span class="sourceLineNo">329</span> delColMap.clear();<a name="line.329"></a> +<span class="sourceLineNo">330</span> delFamMap.clear();<a name="line.330"></a> +<span class="sourceLineNo">331</span> lastCqArray = null;<a name="line.331"></a> +<span class="sourceLineNo">332</span> lastCqLength = 0;<a name="line.332"></a> +<span class="sourceLineNo">333</span> lastCqOffset = 0;<a name="line.333"></a> +<span class="sourceLineNo">334</span> lastCqTs = Long.MIN_VALUE;<a name="line.334"></a> +<span class="sourceLineNo">335</span> lastCqMvcc = 0;<a name="line.335"></a> +<span class="sourceLineNo">336</span> lastCqType = 0;<a name="line.336"></a> +<span class="sourceLineNo">337</span> columnIndex = 0;<a name="line.337"></a> +<span class="sourceLineNo">338</span> countCurrentCol = 0;<a name="line.338"></a> +<span class="sourceLineNo">339</span> resetInternal();<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> protected void resetInternal(){<a name="line.342"></a> +<span class="sourceLineNo">343</span> delFamMap.put(Long.MAX_VALUE, new DeleteVersionsNode());<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> @Override<a name="line.346"></a> +<span class="sourceLineNo">347</span> public boolean done() {<a name="line.347"></a> +<span class="sourceLineNo">348</span> // lastCq* have been updated to this cell.<a name="line.348"></a> +<span class="sourceLineNo">349</span> return !(columns == null || lastCqArray == null) && Bytes<a name="line.349"></a> +<span class="sourceLineNo">350</span> .compareTo(lastCqArray, lastCqOffset, lastCqLength, columns[columnIndex], 0,<a name="line.350"></a> +<span class="sourceLineNo">351</span> columns[columnIndex].length) > 0;<a name="line.351"></a> +<span class="sourceLineNo">352</span> }<a name="line.352"></a> +<span class="sourceLineNo">353</span><a name="line.353"></a> +<span class="sourceLineNo">354</span> @Override<a name="line.354"></a> +<span class="sourceLineNo">355</span> public ColumnCount getColumnHint() {<a name="line.355"></a> +<span class="sourceLineNo">356</span> if (columns != null) {<a name="line.356"></a> +<span class="sourceLineNo">357</span> if (columnIndex < columns.length) {<a name="line.357"></a> +<span class="sourceLineNo">358</span> return new ColumnCount(columns[columnIndex]);<a name="line.358"></a> +<span class="sourceLineNo">359</span> }<a name="line.359"></a> +<span class="sourceLineNo">360</span> }<a name="line.360"></a> +<span class="sourceLineNo">361</span> return null;<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> @Override<a name="line.364"></a> +<span class="sourceLineNo">365</span> public MatchCode getNextRowOrNextColumn(Cell cell) {<a name="line.365"></a> +<span class="sourceLineNo">366</span> // TODO maybe we can optimize.<a name="line.366"></a> +<span class="sourceLineNo">367</span> return MatchCode.SEEK_NEXT_COL;<a name="line.367"></a> +<span class="sourceLineNo">368</span> }<a name="line.368"></a> +<span class="sourceLineNo">369</span><a name="line.369"></a> +<span class="sourceLineNo">370</span> @Override<a name="line.370"></a> +<span class="sourceLineNo">371</span> public boolean isDone(long timestamp) {<a name="line.371"></a> +<span class="sourceLineNo">372</span> // We can not skip Cells with small ts.<a name="line.372"></a> +<span class="sourceLineNo">373</span> return false;<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> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +</pre> +</div> +</body> +</html> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/21766f4a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.html new file mode 100644 index 0000000..d17d169 --- /dev/null +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/querymatcher/NewVersionBehaviorTracker.html @@ -0,0 +1,448 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd";> +<html lang="en"> +<head> +<title>Source code</title> +<link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style"> +</head> +<body> +<div class="sourceContainer"> +<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a> +<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a> +<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a> +<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a> +<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a> +<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a> +<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a> +<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a> +<span class="sourceLineNo">009</span> * <p><a name="line.9"></a> +<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a> +<span class="sourceLineNo">011</span> * <p><a name="line.11"></a> +<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a> +<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a> +<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a> +<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a> +<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a> +<span class="sourceLineNo">017</span> */<a name="line.17"></a> +<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.regionserver.querymatcher;<a name="line.18"></a> +<span class="sourceLineNo">019</span><a name="line.19"></a> +<span class="sourceLineNo">020</span>import java.io.IOException;<a name="line.20"></a> +<span class="sourceLineNo">021</span>import java.util.HashMap;<a name="line.21"></a> +<span class="sourceLineNo">022</span>import java.util.Map;<a name="line.22"></a> +<span class="sourceLineNo">023</span>import java.util.NavigableMap;<a name="line.23"></a> +<span class="sourceLineNo">024</span>import java.util.NavigableSet;<a name="line.24"></a> +<span class="sourceLineNo">025</span>import java.util.SortedMap;<a name="line.25"></a> +<span class="sourceLineNo">026</span>import java.util.SortedSet;<a name="line.26"></a> +<span class="sourceLineNo">027</span>import java.util.TreeMap;<a name="line.27"></a> +<span class="sourceLineNo">028</span>import java.util.TreeSet;<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.CellUtil;<a name="line.31"></a> +<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.KeyValue.Type;<a name="line.32"></a> +<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.33"></a> +<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.regionserver.querymatcher.ScanQueryMatcher.MatchCode;<a name="line.34"></a> +<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.35"></a> +<span class="sourceLineNo">036</span><a name="line.36"></a> +<span class="sourceLineNo">037</span>/**<a name="line.37"></a> +<span class="sourceLineNo">038</span> * A tracker both implementing ColumnTracker and DeleteTracker, used for mvcc-sensitive scanning.<a name="line.38"></a> +<span class="sourceLineNo">039</span> * We should make sure in one QueryMatcher the ColumnTracker and DeleteTracker is the same instance.<a name="line.39"></a> +<span class="sourceLineNo">040</span> */<a name="line.40"></a> +<span class="sourceLineNo">041</span>@InterfaceAudience.Private<a name="line.41"></a> +<span class="sourceLineNo">042</span>public class NewVersionBehaviorTracker implements ColumnTracker, DeleteTracker {<a name="line.42"></a> +<span class="sourceLineNo">043</span><a name="line.43"></a> +<span class="sourceLineNo">044</span> private byte[] lastCqArray;<a name="line.44"></a> +<span class="sourceLineNo">045</span> private int lastCqLength;<a name="line.45"></a> +<span class="sourceLineNo">046</span> private int lastCqOffset;<a name="line.46"></a> +<span class="sourceLineNo">047</span> private long lastCqTs;<a name="line.47"></a> +<span class="sourceLineNo">048</span> private long lastCqMvcc;<a name="line.48"></a> +<span class="sourceLineNo">049</span> private byte lastCqType;<a name="line.49"></a> +<span class="sourceLineNo">050</span> private int columnIndex;<a name="line.50"></a> +<span class="sourceLineNo">051</span> private int countCurrentCol;<a name="line.51"></a> +<span class="sourceLineNo">052</span><a name="line.52"></a> +<span class="sourceLineNo">053</span> protected int maxVersions;<a name="line.53"></a> +<span class="sourceLineNo">054</span> private int resultMaxVersions;<a name="line.54"></a> +<span class="sourceLineNo">055</span> private byte[][] columns;<a name="line.55"></a> +<span class="sourceLineNo">056</span> private int minVersions;<a name="line.56"></a> +<span class="sourceLineNo">057</span> private long oldestStamp;<a name="line.57"></a> +<span class="sourceLineNo">058</span><a name="line.58"></a> +<span class="sourceLineNo">059</span> // These two maps have same structure.<a name="line.59"></a> +<span class="sourceLineNo">060</span> // Each node is a versions deletion (DeleteFamily or DeleteColumn). Key is the mvcc of the marker,<a name="line.60"></a> +<span class="sourceLineNo">061</span> // value is a data structure which contains infos we need that happens before this node's mvcc and<a name="line.61"></a> +<span class="sourceLineNo">062</span> // after the previous node's mvcc. The last node is a special node whose key is max_long that<a name="line.62"></a> +<span class="sourceLineNo">063</span> // saves infos after last deletion. See DeleteVersionsNode's comments for details.<a name="line.63"></a> +<span class="sourceLineNo">064</span> // The delColMap is constructed and used for each cq, and thedelFamMap is constructed when cq is<a name="line.64"></a> +<span class="sourceLineNo">065</span> // null and saving family-level delete markers. Each time the cq is changed, we should<a name="line.65"></a> +<span class="sourceLineNo">066</span> // reconstruct delColMap as a deep copy of delFamMap.<a name="line.66"></a> +<span class="sourceLineNo">067</span> protected NavigableMap<Long, DeleteVersionsNode> delColMap = new TreeMap<>();<a name="line.67"></a> +<span class="sourceLineNo">068</span> protected NavigableMap<Long, DeleteVersionsNode> delFamMap = new TreeMap<>();<a name="line.68"></a> +<span class="sourceLineNo">069</span><a name="line.69"></a> +<span class="sourceLineNo">070</span> /**<a name="line.70"></a> +<span class="sourceLineNo">071</span> * Note maxVersion and minVersion must set according to cf's conf, not user's scan parameter.<a name="line.71"></a> +<span class="sourceLineNo">072</span> *<a name="line.72"></a> +<span class="sourceLineNo">073</span> * @param columns columns specified user in query<a name="line.73"></a> +<span class="sourceLineNo">074</span> * @param minVersion The minimum number of versions to keep(used when TTL is set).<a name="line.74"></a> +<span class="sourceLineNo">075</span> * @param maxVersion The maximum number of versions in CF's conf<a name="line.75"></a> +<span class="sourceLineNo">076</span> * @param resultMaxVersions maximum versions to return per column, which may be different from<a name="line.76"></a> +<span class="sourceLineNo">077</span> * maxVersion<a name="line.77"></a> +<span class="sourceLineNo">078</span> * @param oldestUnexpiredTS the oldest timestamp we are interested in, based on TTL<a name="line.78"></a> +<span class="sourceLineNo">079</span> */<a name="line.79"></a> +<span class="sourceLineNo">080</span> public NewVersionBehaviorTracker(NavigableSet<byte[]> columns, int minVersion, int maxVersion,<a name="line.80"></a> +<span class="sourceLineNo">081</span> int resultMaxVersions, long oldestUnexpiredTS) {<a name="line.81"></a> +<span class="sourceLineNo">082</span> this.maxVersions = maxVersion;<a name="line.82"></a> +<span class="sourceLineNo">083</span> this.minVersions = minVersion;<a name="line.83"></a> +<span class="sourceLineNo">084</span> this.resultMaxVersions = resultMaxVersions;<a name="line.84"></a> +<span class="sourceLineNo">085</span> this.oldestStamp = oldestUnexpiredTS;<a name="line.85"></a> +<span class="sourceLineNo">086</span> if (columns != null && columns.size() > 0) {<a name="line.86"></a> +<span class="sourceLineNo">087</span> this.columns = new byte[columns.size()][];<a name="line.87"></a> +<span class="sourceLineNo">088</span> int i = 0;<a name="line.88"></a> +<span class="sourceLineNo">089</span> for (byte[] column : columns) {<a name="line.89"></a> +<span class="sourceLineNo">090</span> this.columns[i++] = column;<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> reset();<a name="line.93"></a> +<span class="sourceLineNo">094</span> }<a name="line.94"></a> +<span class="sourceLineNo">095</span><a name="line.95"></a> +<span class="sourceLineNo">096</span> @Override<a name="line.96"></a> +<span class="sourceLineNo">097</span> public void beforeShipped() throws IOException {<a name="line.97"></a> +<span class="sourceLineNo">098</span> // Do nothing<a name="line.98"></a> +<span class="sourceLineNo">099</span> }<a name="line.99"></a> +<span class="sourceLineNo">100</span><a name="line.100"></a> +<span class="sourceLineNo">101</span> /**<a name="line.101"></a> +<span class="sourceLineNo">102</span> * A data structure which contains infos we need that happens before this node's mvcc and<a name="line.102"></a> +<span class="sourceLineNo">103</span> * after the previous node's mvcc. A node means there is a version deletion at the mvcc and ts.<a name="line.103"></a> +<span class="sourceLineNo">104</span> */<a name="line.104"></a> +<span class="sourceLineNo">105</span> protected class DeleteVersionsNode {<a name="line.105"></a> +<span class="sourceLineNo">106</span> public long ts;<a name="line.106"></a> +<span class="sourceLineNo">107</span> public long mvcc;<a name="line.107"></a> +<span class="sourceLineNo">108</span><a name="line.108"></a> +<span class="sourceLineNo">109</span> // <timestamp, set<mvcc>><a name="line.109"></a> +<span class="sourceLineNo">110</span> // Key is ts of version deletes, value is its mvccs.<a name="line.110"></a> +<span class="sourceLineNo">111</span> // We may delete more than one time for a version.<a name="line.111"></a> +<span class="sourceLineNo">112</span> private Map<Long, SortedSet<Long>> deletesMap = new HashMap<>();<a name="line.112"></a> +<span class="sourceLineNo">113</span><a name="line.113"></a> +<span class="sourceLineNo">114</span> // <mvcc, set<mvcc>><a name="line.114"></a> +<span class="sourceLineNo">115</span> // Key is mvcc of version deletes, value is mvcc of visible puts before the delete effect.<a name="line.115"></a> +<span class="sourceLineNo">116</span> private NavigableMap<Long, SortedSet<Long>> mvccCountingMap = new TreeMap<>();<a name="line.116"></a> +<span class="sourceLineNo">117</span><a name="line.117"></a> +<span class="sourceLineNo">118</span> protected DeleteVersionsNode(long ts, long mvcc) {<a name="line.118"></a> +<span class="sourceLineNo">119</span> this.ts = ts;<a name="line.119"></a> +<span class="sourceLineNo">120</span> this.mvcc = mvcc;<a name="line.120"></a> +<span class="sourceLineNo">121</span> mvccCountingMap.put(Long.MAX_VALUE, new TreeSet<Long>());<a name="line.121"></a> +<span class="sourceLineNo">122</span> }<a name="line.122"></a> +<span class="sourceLineNo">123</span><a name="line.123"></a> +<span class="sourceLineNo">124</span> protected DeleteVersionsNode() {<a name="line.124"></a> +<span class="sourceLineNo">125</span> this(Long.MIN_VALUE, Long.MAX_VALUE);<a name="line.125"></a> +<span class="sourceLineNo">126</span> }<a name="line.126"></a> +<span class="sourceLineNo">127</span><a name="line.127"></a> +<span class="sourceLineNo">128</span> public void addVersionDelete(Cell cell) {<a name="line.128"></a> +<span class="sourceLineNo">129</span> SortedSet<Long> set = deletesMap.get(cell.getTimestamp());<a name="line.129"></a> +<span class="sourceLineNo">130</span> if (set == null) {<a name="line.130"></a> +<span class="sourceLineNo">131</span> set = new TreeSet<>();<a name="line.131"></a> +<span class="sourceLineNo">132</span> deletesMap.put(cell.getTimestamp(), set);<a name="line.132"></a> +<span class="sourceLineNo">133</span> }<a name="line.133"></a> +<span class="sourceLineNo">134</span> set.add(cell.getSequenceId());<a name="line.134"></a> +<span class="sourceLineNo">135</span> // The init set should be the puts whose mvcc is smaller than this Delete. Because<a name="line.135"></a> +<span class="sourceLineNo">136</span> // there may be some Puts masked by them. The Puts whose mvcc is larger than this Delete can<a name="line.136"></a> +<span class="sourceLineNo">137</span> // not be copied to this node because we may delete one version and the oldest put may not be<a name="line.137"></a> +<span class="sourceLineNo">138</span> // masked.<a name="line.138"></a> +<span class="sourceLineNo">139</span> SortedSet<Long> nextValue = mvccCountingMap.ceilingEntry(cell.getSequenceId()).getValue();<a name="line.139"></a> +<span class="sourceLineNo">140</span> SortedSet<Long> thisValue = new TreeSet<>(nextValue.headSet(cell.getSequenceId()));<a name="line.140"></a> +<span class="sourceLineNo">141</span> mvccCountingMap.put(cell.getSequenceId(), thisValue);<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> protected DeleteVersionsNode getDeepCopy() {<a name="line.144"></a> +<span class="sourceLineNo">145</span> DeleteVersionsNode node = new DeleteVersionsNode(ts, mvcc);<a name="line.145"></a> +<span class="sourceLineNo">146</span> for (Map.Entry<Long, SortedSet<Long>> e : deletesMap.entrySet()) {<a name="line.146"></a> +<span class="sourceLineNo">147</span> node.deletesMap.put(e.getKey(), new TreeSet<>(e.getValue()));<a name="line.147"></a> +<span class="sourceLineNo">148</span> }<a name="line.148"></a> +<span class="sourceLineNo">149</span> for (Map.Entry<Long, SortedSet<Long>> e : mvccCountingMap.entrySet()) {<a name="line.149"></a> +<span class="sourceLineNo">150</span> node.mvccCountingMap.put(e.getKey(), new TreeSet<>(e.getValue()));<a name="line.150"></a> +<span class="sourceLineNo">151</span> }<a name="line.151"></a> +<span class="sourceLineNo">152</span> return node;<a name="line.152"></a> +<span class="sourceLineNo">153</span> }<a name="line.153"></a> +<span class="sourceLineNo">154</span> }<a name="line.154"></a> +<span class="sourceLineNo">155</span><a name="line.155"></a> +<span class="sourceLineNo">156</span> /**<a name="line.156"></a> +<span class="sourceLineNo">157</span> * Reset the map if it is different with the last Cell.<a name="line.157"></a> +<span class="sourceLineNo">158</span> * Save the cq array/offset/length for next Cell.<a name="line.158"></a> +<span class="sourceLineNo">159</span> *<a name="line.159"></a> +<span class="sourceLineNo">160</span> * @return If this put has duplicate ts with last cell, return the mvcc of last cell.<a name="line.160"></a> +<span class="sourceLineNo">161</span> * Else return MAX_VALUE.<a name="line.161"></a> +<span class="sourceLineNo">162</span> */<a name="line.162"></a> +<span class="sourceLineNo">163</span> protected long prepare(Cell cell) {<a name="line.163"></a> +<span class="sourceLineNo">164</span> boolean matchCq = CellUtil.matchingQualifier(cell, lastCqArray, lastCqOffset, lastCqLength);<a name="line.164"></a> +<span class="sourceLineNo">165</span> if (!matchCq) {<a name="line.165"></a> +<span class="sourceLineNo">166</span> // The last cell is family-level delete and this is not, or the cq is changed,<a name="line.166"></a> +<span class="sourceLineNo">167</span> // we should construct delColMap as a deep copy of delFamMap.<a name="line.167"></a> +<span class="sourceLineNo">168</span> delColMap.clear();<a name="line.168"></a> +<span class="sourceLineNo">169</span> for (Map.Entry<Long, DeleteVersionsNode> e : delFamMap.entrySet()) {<a name="line.169"></a> +<span class="sourceLineNo">170</span> delColMap.put(e.getKey(), e.getValue().getDeepCopy());<a name="line.170"></a> +<span class="sourceLineNo">171</span> }<a name="line.171"></a> +<span class="sourceLineNo">172</span> countCurrentCol = 0;<a name="line.172"></a> +<span class="sourceLineNo">173</span> }<a name="line.173"></a> +<span class="sourceLineNo">174</span> if (matchCq && !CellUtil.isDelete(lastCqType) && lastCqType == cell.getTypeByte()<a name="line.174"></a> +<span class="sourceLineNo">175</span> && lastCqTs == cell.getTimestamp()) {<a name="line.175"></a> +<span class="sourceLineNo">176</span> // Put with duplicate timestamp, ignore.<a name="line.176"></a> +<span class="sourceLineNo">177</span> return lastCqMvcc;<a name="line.177"></a> +<span class="sourceLineNo">178</span> }<a name="line.178"></a> +<span class="sourceLineNo">179</span> lastCqArray = cell.getQualifierArray();<a name="line.179"></a> +<span class="sourceLineNo">180</span> lastCqOffset = cell.getQualifierOffset();<a name="line.180"></a> +<span class="sourceLineNo">181</span> lastCqLength = cell.getQualifierLength();<a name="line.181"></a> +<span class="sourceLineNo">182</span> lastCqTs = cell.getTimestamp();<a name="line.182"></a> +<span class="sourceLineNo">183</span> lastCqMvcc = cell.getSequenceId();<a name="line.183"></a> +<span class="sourceLineNo">184</span> lastCqType = cell.getTypeByte();<a name="line.184"></a> +<span class="sourceLineNo">185</span> return Long.MAX_VALUE;<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> // DeleteTracker<a name="line.188"></a> +<span class="sourceLineNo">189</span> @Override<a name="line.189"></a> +<span class="sourceLineNo">190</span> public void add(Cell cell) {<a name="line.190"></a> +<span class="sourceLineNo">191</span> prepare(cell);<a name="line.191"></a> +<span class="sourceLineNo">192</span> byte type = cell.getTypeByte();<a name="line.192"></a> +<span class="sourceLineNo">193</span> switch (Type.codeToType(type)) {<a name="line.193"></a> +<span class="sourceLineNo">194</span> // By the order of seen. We put null cq at first.<a name="line.194"></a> +<span class="sourceLineNo">195</span> case DeleteFamily: // Delete all versions of all columns of the specified family<a name="line.195"></a> +<span class="sourceLineNo">196</span> delFamMap.put(cell.getSequenceId(),<a name="line.196"></a> +<span class="sourceLineNo">197</span> new DeleteVersionsNode(cell.getTimestamp(), cell.getSequenceId()));<a name="line.197"></a> +<span class="sourceLineNo">198</span> break;<a name="line.198"></a> +<span class="sourceLineNo">199</span> case DeleteFamilyVersion: // Delete all columns of the specified family and specified version<a name="line.199"></a> +<span class="sourceLineNo">200</span> delFamMap.ceilingEntry(cell.getSequenceId()).getValue().addVersionDelete(cell);<a name="line.200"></a> +<span class="sourceLineNo">201</span> break;<a name="line.201"></a> +<span class="sourceLineNo">202</span><a name="line.202"></a> +<span class="sourceLineNo">203</span> // These two kinds of markers are mix with Puts.<a name="line.203"></a> +<span class="sourceLineNo">204</span> case DeleteColumn: // Delete all versions of the specified column<a name="line.204"></a> +<span class="sourceLineNo">205</span> delColMap.put(cell.getSequenceId(),<a name="line.205"></a> +<span class="sourceLineNo">206</span> new DeleteVersionsNode(cell.getTimestamp(), cell.getSequenceId()));<a name="line.206"></a> +<span class="sourceLineNo">207</span> break;<a name="line.207"></a> +<span class="sourceLineNo">208</span> case Delete: // Delete the specified version of the specified column.<a name="line.208"></a> +<span class="sourceLineNo">209</span> delColMap.ceilingEntry(cell.getSequenceId()).getValue().addVersionDelete(cell);<a name="line.209"></a> +<span class="sourceLineNo">210</span> break;<a name="line.210"></a> +<span class="sourceLineNo">211</span> default:<a name="line.211"></a> +<span class="sourceLineNo">212</span> throw new AssertionError("Unknown delete marker type for " + cell);<a name="line.212"></a> +<span class="sourceLineNo">213</span> }<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> /**<a name="line.216"></a> +<span class="sourceLineNo">217</span> * This method is not idempotent, we will save some info to judge VERSION_MASKED.<a name="line.217"></a> +<span class="sourceLineNo">218</span> * @param cell - current cell to check if deleted by a previously seen delete<a name="line.218"></a> +<span class="sourceLineNo">219</span> * @return We don't distinguish DeleteColumn and DeleteFamily. We only return code for column.<a name="line.219"></a> +<span class="sourceLineNo">220</span> */<a name="line.220"></a> +<span class="sourceLineNo">221</span> @Override<a name="line.221"></a> +<span class="sourceLineNo">222</span> public DeleteResult isDeleted(Cell cell) {<a name="line.222"></a> +<span class="sourceLineNo">223</span> long duplicateMvcc = prepare(cell);<a name="line.223"></a> +<span class="sourceLineNo">224</span><a name="line.224"></a> +<span class="sourceLineNo">225</span> for (Map.Entry<Long, DeleteVersionsNode> e : delColMap.tailMap(cell.getSequenceId())<a name="line.225"></a> +<span class="sourceLineNo">226</span> .entrySet()) {<a name="line.226"></a> +<span class="sourceLineNo">227</span> DeleteVersionsNode node = e.getValue();<a name="line.227"></a> +<span class="sourceLineNo">228</span> long deleteMvcc = Long.MAX_VALUE;<a name="line.228"></a> +<span class="sourceLineNo">229</span> SortedSet<Long> deleteVersionMvccs = node.deletesMap.get(cell.getTimestamp());<a name="line.229"></a> +<span class="sourceLineNo">230</span> if (deleteVersionMvccs != null) {<a name="line.230"></a> +<span class="sourceLineNo">231</span> SortedSet<Long> tail = deleteVersionMvccs.tailSet(cell.getSequenceId());<a name="line.231"></a> +<span class="sourceLineNo">232</span> if (!tail.isEmpty()) {<a name="line.232"></a> +<span class="sourceLineNo">233</span> deleteMvcc = tail.first();<a name="line.233"></a> +<span class="sourceLineNo">234</span> }<a name="line.234"></a> +<span class="sourceLineNo">235</span> }<a name="line.235"></a> +<span class="sourceLineNo">236</span> SortedMap<Long, SortedSet<Long>> subMap =<a name="line.236"></a> +<span class="sourceLineNo">237</span> node.mvccCountingMap<a name="line.237"></a> +<span class="sourceLineNo">238</span> .subMap(cell.getSequenceId(), true, Math.min(duplicateMvcc, deleteMvcc), true);<a name="line.238"></a> +<span class="sourceLineNo">239</span> for (Map.Entry<Long, SortedSet<Long>> seg : subMap.entrySet()) {<a name="line.239"></a> +<span class="sourceLineNo">240</span> if (seg.getValue().size() >= maxVersions) {<a name="line.240"></a> +<span class="sourceLineNo">241</span> return DeleteResult.VERSION_MASKED;<a name="line.241"></a> +<span class="sourceLineNo">242</span> }<a name="line.242"></a> +<span class="sourceLineNo">243</span> seg.getValue().add(cell.getSequenceId());<a name="line.243"></a> +<span class="sourceLineNo">244</span> }<a name="line.244"></a> +<span class="sourceLineNo">245</span> if (deleteMvcc < Long.MAX_VALUE) {<a name="line.245"></a> +<span class="sourceLineNo">246</span> return DeleteResult.VERSION_DELETED;<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> if (cell.getTimestamp() <= node.ts) {<a name="line.249"></a> +<span class="sourceLineNo">250</span> return DeleteResult.COLUMN_DELETED;<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> if (duplicateMvcc < Long.MAX_VALUE) {<a name="line.253"></a> +<span class="sourceLineNo">254</span> return DeleteResult.VERSION_MASKED;<a name="line.254"></a> +<span class="sourceLineNo">255</span> }<a name="line.255"></a> +<span class="sourceLineNo">256</span> return DeleteResult.NOT_DELETED;<a name="line.256"></a> +<span class="sourceLineNo">257</span> }<a name="line.257"></a> +<span class="sourceLineNo">258</span><a name="line.258"></a> +<span class="sourceLineNo">259</span> @Override<a name="line.259"></a> +<span class="sourceLineNo">260</span> public boolean isEmpty() {<a name="line.260"></a> +<span class="sourceLineNo">261</span> return delColMap.size() == 1 && delColMap.get(Long.MAX_VALUE).mvccCountingMap.size() == 1<a name="line.261"></a> +<span class="sourceLineNo">262</span> && delFamMap.size() == 1 && delFamMap.get(Long.MAX_VALUE).mvccCountingMap.size() == 1;<a name="line.262"></a> +<span class="sourceLineNo">263</span> }<a name="line.263"></a> +<span class="sourceLineNo">264</span><a name="line.264"></a> +<span class="sourceLineNo">265</span> @Override<a name="line.265"></a> +<span class="sourceLineNo">266</span> public void update() {<a name="line.266"></a> +<span class="sourceLineNo">267</span> // ignore<a name="line.267"></a> +<span class="sourceLineNo">268</span> }<a name="line.268"></a> +<span class="sourceLineNo">269</span><a name="line.269"></a> +<span class="sourceLineNo">270</span> //ColumnTracker<a name="line.270"></a> +<span class="sourceLineNo">271</span><a name="line.271"></a> +<span class="sourceLineNo">272</span> @Override<a name="line.272"></a> +<span class="sourceLineNo">273</span> public MatchCode checkColumn(Cell cell, byte type) throws IOException {<a name="line.273"></a> +<span class="sourceLineNo">274</span> if (done()) {<a name="line.274"></a> +<span class="sourceLineNo">275</span> // No more columns left, we are done with this query<a name="line.275"></a> +<span class="sourceLineNo">276</span> return ScanQueryMatcher.MatchCode.SEEK_NEXT_ROW; // done_row<a name="line.276"></a> +<span class="sourceLineNo">277</span> }<a name="line.277"></a> +<span class="sourceLineNo">278</span> if (columns != null) {<a name="line.278"></a> +<span class="sourceLineNo">279</span> while (columnIndex < columns.length) {<a name="line.279"></a> +<span class="sourceLineNo">280</span> int c = Bytes.compareTo(columns[columnIndex], 0, columns[columnIndex].length,<a name="line.280"></a> +<span class="sourceLineNo">281</span> cell.getQualifierArray(), cell.getQualifierOffset(), cell.getQualifierLength());<a name="line.281"></a> +<span class="sourceLineNo">282</span> if (c < 0) {<a name="line.282"></a> +<span class="sourceLineNo">283</span> columnIndex++;<a name="line.283"></a> +<span class="sourceLineNo">284</span> } else if (c == 0) {<a name="line.284"></a> +<span class="sourceLineNo">285</span> // We drop old version in #isDeleted, so here we must return INCLUDE.<a name="line.285"></a> +<span class="sourceLineNo">286</span> return MatchCode.INCLUDE;<a name="line.286"></a> +<span class="sourceLineNo">287</span> } else {<a name="line.287"></a> +<span class="sourceLineNo">288</span> return MatchCode.SEEK_NEXT_COL;<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> return MatchCode.SEEK_NEXT_ROW;<a name="line.291"></a> +<span class="sourceLineNo">292</span> }<a name="line.292"></a> +<span class="sourceLineNo">293</span> return MatchCode.INCLUDE;<a name="line.293"></a> +<span class="sourceLineNo">294</span> }<a name="line.294"></a> +<span class="sourceLineNo">295</span><a name="line.295"></a> +<span class="sourceLineNo">296</span> @Override<a name="line.296"></a> +<span class="sourceLineNo">297</span> public MatchCode checkVersions(Cell cell, long timestamp, byte type,<a name="line.297"></a> +<span class="sourceLineNo">298</span> boolean ignoreCount) throws IOException {<a name="line.298"></a> +<span class="sourceLineNo">299</span> assert !CellUtil.isDelete(type);<a name="line.299"></a> +<span class="sourceLineNo">300</span> // We drop old version in #isDeleted, so here we won't SKIP because of versioning. But we should<a name="line.300"></a> +<span class="sourceLineNo">301</span> // consider TTL.<a name="line.301"></a> +<span class="sourceLineNo">302</span> if (ignoreCount) {<a name="line.302"></a> +<span class="sourceLineNo">303</span> return MatchCode.INCLUDE;<a name="line.303"></a> +<span class="sourceLineNo">304</span> }<a name="line.304"></a> +<span class="sourceLineNo">305</span> countCurrentCol++;<a name="line.305"></a> +<span class="sourceLineNo">306</span> if (timestamp < this.oldestStamp) {<a name="line.306"></a> +<span class="sourceLineNo">307</span> if (countCurrentCol == minVersions) {<a name="line.307"></a> +<span class="sourceLineNo">308</span> return MatchCode.INCLUDE_AND_SEEK_NEXT_COL;<a name="line.308"></a> +<span class="sourceLineNo">309</span> }<a name="line.309"></a> +<span class="sourceLineNo">310</span> if (countCurrentCol > minVersions) {<a name="line.310"></a> +<span class="sourceLineNo">311</span> // This may not be reached, only for safety.<a name="line.311"></a> +<span class="sourceLineNo">312</span> return MatchCode.SEEK_NEXT_COL;<a name="line.312"></a> +<span class="sourceLineNo">313</span> }<a name="line.313"></a> +<span class="sourceLineNo">314</span> }<a name="line.314"></a> +<span class="sourceLineNo">315</span><a name="line.315"></a> +<span class="sourceLineNo">316</span> if (countCurrentCol == resultMaxVersions) {<a name="line.316"></a> +<span class="sourceLineNo">317</span> // We have enough number of versions for user's requirement.<a name="line.317"></a> +<span class="sourceLineNo">318</span> return MatchCode.INCLUDE_AND_SEEK_NEXT_COL;<a name="line.318"></a> +<span class="sourceLineNo">319</span> }<a name="line.319"></a> +<span class="sourceLineNo">320</span> if (countCurrentCol > resultMaxVersions) {<a name="line.320"></a> +<span class="sourceLineNo">321</span> // This may not be reached, only for safety<a name="line.321"></a> +<span class="sourceLineNo">322</span> return MatchCode.SEEK_NEXT_COL;<a name="line.322"></a> +<span class="sourceLineNo">323</span> }<a name="line.323"></a> +<span class="sourceLineNo">324</span> return MatchCode.INCLUDE;<a name="line.324"></a> +<span class="sourceLineNo">325</span> }<a name="line.325"></a> +<span class="sourceLineNo">326</span><a name="line.326"></a> +<span class="sourceLineNo">327</span> @Override<a name="line.327"></a> +<span class="sourceLineNo">328</span> public void reset() {<a name="line.328"></a> +<span class="sourceLineNo">329</span> delColMap.clear();<a name="line.329"></a> +<span class="sourceLineNo">330</span> delFamMap.clear();<a name="line.330"></a> +<span class="sourceLineNo">331</span> lastCqArray = null;<a name="line.331"></a> +<span class="sourceLineNo">332</span> lastCqLength = 0;<a name="line.332"></a> +<span class="sourceLineNo">333</span> lastCqOffset = 0;<a name="line.333"></a> +<span class="sourceLineNo">334</span> lastCqTs = Long.MIN_VALUE;<a name="line.334"></a> +<span class="sourceLineNo">335</span> lastCqMvcc = 0;<a name="line.335"></a> +<span class="sourceLineNo">336</span> lastCqType = 0;<a name="line.336"></a> +<span class="sourceLineNo">337</span> columnIndex = 0;<a name="line.337"></a> +<span class="sourceLineNo">338</span> countCurrentCol = 0;<a name="line.338"></a> +<span class="sourceLineNo">339</span> resetInternal();<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> protected void resetInternal(){<a name="line.342"></a> +<span class="sourceLineNo">343</span> delFamMap.put(Long.MAX_VALUE, new DeleteVersionsNode());<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> @Override<a name="line.346"></a> +<span class="sourceLineNo">347</span> public boolean done() {<a name="line.347"></a> +<span class="sourceLineNo">348</span> // lastCq* have been updated to this cell.<a name="line.348"></a> +<span class="sourceLineNo">349</span> return !(columns == null || lastCqArray == null) && Bytes<a name="line.349"></a> +<span class="sourceLineNo">350</span> .compareTo(lastCqArray, lastCqOffset, lastCqLength, columns[columnIndex], 0,<a name="line.350"></a> +<span class="sourceLineNo">351</span> columns[columnIndex].length) > 0;<a name="line.351"></a> +<span class="sourceLineNo">352</span> }<a name="line.352"></a> +<span class="sourceLineNo">353</span><a name="line.353"></a> +<span class="sourceLineNo">354</span> @Override<a name="line.354"></a> +<span class="sourceLineNo">355</span> public ColumnCount getColumnHint() {<a name="line.355"></a> +<span class="sourceLineNo">356</span> if (columns != null) {<a name="line.356"></a> +<span class="sourceLineNo">357</span> if (columnIndex < columns.length) {<a name="line.357"></a> +<span class="sourceLineNo">358</span> return new ColumnCount(columns[columnIndex]);<a name="line.358"></a> +<span class="sourceLineNo">359</span> }<a name="line.359"></a> +<span class="sourceLineNo">360</span> }<a name="line.360"></a> +<span class="sourceLineNo">361</span> return null;<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> @Override<a name="line.364"></a> +<span class="sourceLineNo">365</span> public MatchCode getNextRowOrNextColumn(Cell cell) {<a name="line.365"></a> +<span class="sourceLineNo">366</span> // TODO maybe we can optimize.<a name="line.366"></a> +<span class="sourceLineNo">367</span> return MatchCode.SEEK_NEXT_COL;<a name="line.367"></a> +<span class="sourceLineNo">368</span> }<a name="line.368"></a> +<span class="sourceLineNo">369</span><a name="line.369"></a> +<span class="sourceLineNo">370</span> @Override<a name="line.370"></a> +<span class="sourceLineNo">371</span> public boolean isDone(long timestamp) {<a name="line.371"></a> +<span class="sourceLineNo">372</span> // We can not skip Cells with small ts.<a name="line.372"></a> +<span class="sourceLineNo">373</span> return false;<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> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +</pre> +</div> +</body> +</html>
