http://git-wip-us.apache.org/repos/asf/hbase-site/blob/7cafc412/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 242189f..05eaf18 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreFileScanner.html @@ -102,499 +102,500 @@ <span class="sourceLineNo">094</span> this.hasMVCCInfo = hasMVCC;<a name="line.94"></a> <span class="sourceLineNo">095</span> this.scannerOrder = scannerOrder;<a name="line.95"></a> <span class="sourceLineNo">096</span> this.canOptimizeForNonNullColumn = canOptimizeForNonNullColumn;<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> boolean isPrimaryReplica() {<a name="line.99"></a> -<span class="sourceLineNo">100</span> return reader.isPrimaryReplicaReader();<a name="line.100"></a> -<span class="sourceLineNo">101</span> }<a name="line.101"></a> -<span class="sourceLineNo">102</span><a name="line.102"></a> -<span class="sourceLineNo">103</span> /**<a name="line.103"></a> -<span class="sourceLineNo">104</span> * Return an array of scanners corresponding to the given set of store files.<a name="line.104"></a> -<span class="sourceLineNo">105</span> */<a name="line.105"></a> -<span class="sourceLineNo">106</span> public static List<StoreFileScanner> getScannersForStoreFiles(Collection<HStoreFile> files,<a name="line.106"></a> -<span class="sourceLineNo">107</span> boolean cacheBlocks, boolean usePread, long readPt) throws IOException {<a name="line.107"></a> -<span class="sourceLineNo">108</span> return getScannersForStoreFiles(files, cacheBlocks, usePread, false, false, readPt);<a name="line.108"></a> -<span class="sourceLineNo">109</span> }<a name="line.109"></a> -<span class="sourceLineNo">110</span><a name="line.110"></a> -<span class="sourceLineNo">111</span> /**<a name="line.111"></a> -<span class="sourceLineNo">112</span> * Return an array of scanners corresponding to the given set of store files.<a name="line.112"></a> -<span class="sourceLineNo">113</span> */<a name="line.113"></a> -<span class="sourceLineNo">114</span> public static List<StoreFileScanner> getScannersForStoreFiles(Collection<HStoreFile> files,<a name="line.114"></a> -<span class="sourceLineNo">115</span> boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean useDropBehind,<a name="line.115"></a> -<span class="sourceLineNo">116</span> long readPt) throws IOException {<a name="line.116"></a> -<span class="sourceLineNo">117</span> return getScannersForStoreFiles(files, cacheBlocks, usePread, isCompaction, useDropBehind, null,<a name="line.117"></a> -<span class="sourceLineNo">118</span> readPt);<a name="line.118"></a> -<span class="sourceLineNo">119</span> }<a name="line.119"></a> -<span class="sourceLineNo">120</span><a name="line.120"></a> -<span class="sourceLineNo">121</span> /**<a name="line.121"></a> -<span class="sourceLineNo">122</span> * Return an array of scanners corresponding to the given set of store files, And set the<a name="line.122"></a> -<span class="sourceLineNo">123</span> * ScanQueryMatcher for each store file scanner for further optimization<a name="line.123"></a> -<span class="sourceLineNo">124</span> */<a name="line.124"></a> -<span class="sourceLineNo">125</span> public static List<StoreFileScanner> getScannersForStoreFiles(Collection<HStoreFile> files,<a name="line.125"></a> -<span class="sourceLineNo">126</span> boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean canUseDrop,<a name="line.126"></a> -<span class="sourceLineNo">127</span> ScanQueryMatcher matcher, long readPt) throws IOException {<a name="line.127"></a> -<span class="sourceLineNo">128</span> if (files.isEmpty()) {<a name="line.128"></a> -<span class="sourceLineNo">129</span> return Collections.emptyList();<a name="line.129"></a> -<span class="sourceLineNo">130</span> }<a name="line.130"></a> -<span class="sourceLineNo">131</span> List<StoreFileScanner> scanners = new ArrayList<>(files.size());<a name="line.131"></a> -<span class="sourceLineNo">132</span> boolean canOptimizeForNonNullColumn = matcher != null ? !matcher.hasNullColumnInQuery() : false;<a name="line.132"></a> -<span class="sourceLineNo">133</span> PriorityQueue<HStoreFile> sortedFiles =<a name="line.133"></a> -<span class="sourceLineNo">134</span> new PriorityQueue<>(files.size(), StoreFileComparators.SEQ_ID);<a name="line.134"></a> -<span class="sourceLineNo">135</span> for (HStoreFile file : files) {<a name="line.135"></a> -<span class="sourceLineNo">136</span> // The sort function needs metadata so we need to open reader first before sorting the list.<a name="line.136"></a> -<span class="sourceLineNo">137</span> file.initReader();<a name="line.137"></a> -<span class="sourceLineNo">138</span> sortedFiles.add(file);<a name="line.138"></a> -<span class="sourceLineNo">139</span> }<a name="line.139"></a> -<span class="sourceLineNo">140</span> boolean succ = false;<a name="line.140"></a> -<span class="sourceLineNo">141</span> try {<a name="line.141"></a> -<span class="sourceLineNo">142</span> for (int i = 0, n = files.size(); i < n; i++) {<a name="line.142"></a> -<span class="sourceLineNo">143</span> HStoreFile sf = sortedFiles.remove();<a name="line.143"></a> -<span class="sourceLineNo">144</span> StoreFileScanner scanner;<a name="line.144"></a> -<span class="sourceLineNo">145</span> if (usePread) {<a name="line.145"></a> -<span class="sourceLineNo">146</span> scanner = sf.getPreadScanner(cacheBlocks, readPt, i, canOptimizeForNonNullColumn);<a name="line.146"></a> -<span class="sourceLineNo">147</span> } else {<a name="line.147"></a> -<span class="sourceLineNo">148</span> scanner = sf.getStreamScanner(canUseDrop, cacheBlocks, isCompaction, readPt, i,<a name="line.148"></a> -<span class="sourceLineNo">149</span> canOptimizeForNonNullColumn);<a name="line.149"></a> -<span class="sourceLineNo">150</span> }<a name="line.150"></a> -<span class="sourceLineNo">151</span> scanners.add(scanner);<a name="line.151"></a> -<span class="sourceLineNo">152</span> }<a name="line.152"></a> -<span class="sourceLineNo">153</span> succ = true;<a name="line.153"></a> -<span class="sourceLineNo">154</span> } finally {<a name="line.154"></a> -<span class="sourceLineNo">155</span> if (!succ) {<a name="line.155"></a> -<span class="sourceLineNo">156</span> for (StoreFileScanner scanner : scanners) {<a name="line.156"></a> -<span class="sourceLineNo">157</span> scanner.close();<a name="line.157"></a> -<span class="sourceLineNo">158</span> }<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> return scanners;<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> * Get scanners for compaction. We will create a separated reader for each store file to avoid<a name="line.165"></a> -<span class="sourceLineNo">166</span> * contention with normal read request.<a name="line.166"></a> -<span class="sourceLineNo">167</span> */<a name="line.167"></a> -<span class="sourceLineNo">168</span> public static List<StoreFileScanner> getScannersForCompaction(Collection<HStoreFile> files,<a name="line.168"></a> -<span class="sourceLineNo">169</span> boolean canUseDropBehind, long readPt) throws IOException {<a name="line.169"></a> -<span class="sourceLineNo">170</span> List<StoreFileScanner> scanners = new ArrayList<>(files.size());<a name="line.170"></a> -<span class="sourceLineNo">171</span> List<HStoreFile> sortedFiles = new ArrayList<>(files);<a name="line.171"></a> -<span class="sourceLineNo">172</span> Collections.sort(sortedFiles, StoreFileComparators.SEQ_ID);<a name="line.172"></a> -<span class="sourceLineNo">173</span> boolean succ = false;<a name="line.173"></a> -<span class="sourceLineNo">174</span> try {<a name="line.174"></a> -<span class="sourceLineNo">175</span> for (int i = 0, n = sortedFiles.size(); i < n; i++) {<a name="line.175"></a> -<span class="sourceLineNo">176</span> scanners.add(<a name="line.176"></a> -<span class="sourceLineNo">177</span> sortedFiles.get(i).getStreamScanner(canUseDropBehind, false, true, readPt, i, false));<a name="line.177"></a> -<span class="sourceLineNo">178</span> }<a name="line.178"></a> -<span class="sourceLineNo">179</span> succ = true;<a name="line.179"></a> -<span class="sourceLineNo">180</span> } finally {<a name="line.180"></a> -<span class="sourceLineNo">181</span> if (!succ) {<a name="line.181"></a> -<span class="sourceLineNo">182</span> for (StoreFileScanner scanner : scanners) {<a name="line.182"></a> -<span class="sourceLineNo">183</span> scanner.close();<a name="line.183"></a> -<span class="sourceLineNo">184</span> }<a name="line.184"></a> -<span class="sourceLineNo">185</span> }<a name="line.185"></a> -<span class="sourceLineNo">186</span> }<a name="line.186"></a> -<span class="sourceLineNo">187</span> return scanners;<a name="line.187"></a> -<span class="sourceLineNo">188</span> }<a name="line.188"></a> -<span class="sourceLineNo">189</span><a name="line.189"></a> -<span class="sourceLineNo">190</span> @Override<a name="line.190"></a> -<span class="sourceLineNo">191</span> public String toString() {<a name="line.191"></a> -<span class="sourceLineNo">192</span> return "StoreFileScanner[" + hfs.toString() + ", cur=" + cur + "]";<a name="line.192"></a> -<span class="sourceLineNo">193</span> }<a name="line.193"></a> -<span class="sourceLineNo">194</span><a name="line.194"></a> -<span class="sourceLineNo">195</span> @Override<a name="line.195"></a> -<span class="sourceLineNo">196</span> public Cell peek() {<a name="line.196"></a> -<span class="sourceLineNo">197</span> return cur;<a name="line.197"></a> -<span class="sourceLineNo">198</span> }<a name="line.198"></a> -<span class="sourceLineNo">199</span><a name="line.199"></a> -<span class="sourceLineNo">200</span> @Override<a name="line.200"></a> -<span class="sourceLineNo">201</span> public Cell next() throws IOException {<a name="line.201"></a> -<span class="sourceLineNo">202</span> Cell retKey = cur;<a name="line.202"></a> -<span class="sourceLineNo">203</span><a name="line.203"></a> -<span class="sourceLineNo">204</span> try {<a name="line.204"></a> -<span class="sourceLineNo">205</span> // only seek if we aren't at the end. cur == null implies 'end'.<a name="line.205"></a> -<span class="sourceLineNo">206</span> if (cur != null) {<a name="line.206"></a> -<span class="sourceLineNo">207</span> hfs.next();<a name="line.207"></a> -<span class="sourceLineNo">208</span> setCurrentCell(hfs.getCell());<a name="line.208"></a> -<span class="sourceLineNo">209</span> if (hasMVCCInfo || this.reader.isBulkLoaded()) {<a name="line.209"></a> -<span class="sourceLineNo">210</span> skipKVsNewerThanReadpoint();<a name="line.210"></a> -<span class="sourceLineNo">211</span> }<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 e) {<a name="line.215"></a> -<span class="sourceLineNo">216</span> throw new IOException("Could not iterate " + this, e);<a name="line.216"></a> -<span class="sourceLineNo">217</span> }<a name="line.217"></a> -<span class="sourceLineNo">218</span> return retKey;<a name="line.218"></a> -<span class="sourceLineNo">219</span> }<a name="line.219"></a> -<span class="sourceLineNo">220</span><a name="line.220"></a> -<span class="sourceLineNo">221</span> @Override<a name="line.221"></a> -<span class="sourceLineNo">222</span> public boolean seek(Cell key) throws IOException {<a name="line.222"></a> -<span class="sourceLineNo">223</span> if (seekCount != null) seekCount.increment();<a name="line.223"></a> -<span class="sourceLineNo">224</span><a name="line.224"></a> -<span class="sourceLineNo">225</span> try {<a name="line.225"></a> -<span class="sourceLineNo">226</span> try {<a name="line.226"></a> -<span class="sourceLineNo">227</span> if(!seekAtOrAfter(hfs, key)) {<a name="line.227"></a> -<span class="sourceLineNo">228</span> this.cur = null;<a name="line.228"></a> -<span class="sourceLineNo">229</span> return false;<a name="line.229"></a> -<span class="sourceLineNo">230</span> }<a name="line.230"></a> -<span class="sourceLineNo">231</span><a name="line.231"></a> -<span class="sourceLineNo">232</span> 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 && 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 seek " + this + " to key " + key, ioe);<a name="line.245"></a> -<span class="sourceLineNo">246</span> }<a name="line.246"></a> -<span class="sourceLineNo">247</span> }<a name="line.247"></a> -<span class="sourceLineNo">248</span><a name="line.248"></a> -<span class="sourceLineNo">249</span> @Override<a name="line.249"></a> -<span class="sourceLineNo">250</span> public boolean reseek(Cell key) throws IOException {<a name="line.250"></a> -<span class="sourceLineNo">251</span> if (seekCount != null) seekCount.increment();<a name="line.251"></a> -<span class="sourceLineNo">252</span><a name="line.252"></a> -<span class="sourceLineNo">253</span> try {<a name="line.253"></a> -<span class="sourceLineNo">254</span> try {<a name="line.254"></a> -<span class="sourceLineNo">255</span> if (!reseekAtOrAfter(hfs, key)) {<a name="line.255"></a> -<span class="sourceLineNo">256</span> this.cur = null;<a name="line.256"></a> -<span class="sourceLineNo">257</span> return false;<a name="line.257"></a> -<span class="sourceLineNo">258</span> }<a name="line.258"></a> -<span class="sourceLineNo">259</span> setCurrentCell(hfs.getCell());<a name="line.259"></a> -<span class="sourceLineNo">260</span><a name="line.260"></a> -<span class="sourceLineNo">261</span> if (!hasMVCCInfo && this.reader.isBulkLoaded()) {<a name="line.261"></a> -<span class="sourceLineNo">262</span> return skipKVsNewerThanReadpoint();<a name="line.262"></a> -<span class="sourceLineNo">263</span> } else {<a name="line.263"></a> -<span class="sourceLineNo">264</span> return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.264"></a> -<span class="sourceLineNo">265</span> }<a name="line.265"></a> -<span class="sourceLineNo">266</span> } finally {<a name="line.266"></a> -<span class="sourceLineNo">267</span> realSeekDone = true;<a name="line.267"></a> -<span class="sourceLineNo">268</span> }<a name="line.268"></a> -<span class="sourceLineNo">269</span> } catch (FileNotFoundException e) {<a name="line.269"></a> -<span class="sourceLineNo">270</span> throw e;<a name="line.270"></a> -<span class="sourceLineNo">271</span> } catch (IOException ioe) {<a name="line.271"></a> -<span class="sourceLineNo">272</span> throw new IOException("Could not reseek " + this + " to key " + key,<a name="line.272"></a> -<span class="sourceLineNo">273</span> ioe);<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><a name="line.276"></a> -<span class="sourceLineNo">277</span> protected void setCurrentCell(Cell newVal) throws IOException {<a name="line.277"></a> -<span class="sourceLineNo">278</span> this.cur = newVal;<a name="line.278"></a> -<span class="sourceLineNo">279</span> if (this.cur != null && this.reader.isBulkLoaded() && !this.reader.isSkipResetSeqId()) {<a name="line.279"></a> -<span class="sourceLineNo">280</span> PrivateCellUtil.setSequenceId(cur, this.reader.getSequenceID());<a name="line.280"></a> -<span class="sourceLineNo">281</span> }<a name="line.281"></a> -<span class="sourceLineNo">282</span> }<a name="line.282"></a> -<span class="sourceLineNo">283</span><a name="line.283"></a> -<span class="sourceLineNo">284</span> protected boolean skipKVsNewerThanReadpoint() throws IOException {<a name="line.284"></a> -<span class="sourceLineNo">285</span> // We want to ignore all key-values that are newer than our current<a name="line.285"></a> -<span class="sourceLineNo">286</span> // readPoint<a name="line.286"></a> -<span class="sourceLineNo">287</span> Cell startKV = cur;<a name="line.287"></a> -<span class="sourceLineNo">288</span> while(enforceMVCC<a name="line.288"></a> -<span class="sourceLineNo">289</span> && cur != null<a name="line.289"></a> -<span class="sourceLineNo">290</span> && (cur.getSequenceId() > readPt)) {<a name="line.290"></a> -<span class="sourceLineNo">291</span> boolean hasNext = hfs.next();<a name="line.291"></a> -<span class="sourceLineNo">292</span> setCurrentCell(hfs.getCell());<a name="line.292"></a> -<span class="sourceLineNo">293</span> if (hasNext && this.stopSkippingKVsIfNextRow<a name="line.293"></a> -<span class="sourceLineNo">294</span> && getComparator().compareRows(cur, startKV) > 0) {<a name="line.294"></a> -<span class="sourceLineNo">295</span> return false;<a name="line.295"></a> -<span class="sourceLineNo">296</span> }<a name="line.296"></a> -<span class="sourceLineNo">297</span> }<a name="line.297"></a> -<span class="sourceLineNo">298</span><a name="line.298"></a> -<span class="sourceLineNo">299</span> if (cur == null) {<a name="line.299"></a> -<span class="sourceLineNo">300</span> return false;<a name="line.300"></a> -<span class="sourceLineNo">301</span> }<a name="line.301"></a> -<span class="sourceLineNo">302</span><a name="line.302"></a> -<span class="sourceLineNo">303</span> return true;<a name="line.303"></a> -<span class="sourceLineNo">304</span> }<a name="line.304"></a> -<span class="sourceLineNo">305</span><a name="line.305"></a> -<span class="sourceLineNo">306</span> @Override<a name="line.306"></a> -<span class="sourceLineNo">307</span> public void close() {<a name="line.307"></a> -<span class="sourceLineNo">308</span> if (closed) return;<a name="line.308"></a> -<span class="sourceLineNo">309</span> cur = null;<a name="line.309"></a> -<span class="sourceLineNo">310</span> this.hfs.close();<a name="line.310"></a> -<span class="sourceLineNo">311</span> if (this.reader != null) {<a name="line.311"></a> -<span class="sourceLineNo">312</span> this.reader.readCompleted();<a name="line.312"></a> -<span class="sourceLineNo">313</span> }<a name="line.313"></a> -<span class="sourceLineNo">314</span> closed = true;<a name="line.314"></a> -<span class="sourceLineNo">315</span> }<a name="line.315"></a> -<span class="sourceLineNo">316</span><a name="line.316"></a> -<span class="sourceLineNo">317</span> /**<a name="line.317"></a> -<span class="sourceLineNo">318</span> *<a name="line.318"></a> -<span class="sourceLineNo">319</span> * @param s<a name="line.319"></a> -<span class="sourceLineNo">320</span> * @param k<a name="line.320"></a> -<span class="sourceLineNo">321</span> * @return false if not found or if k is after the end.<a name="line.321"></a> -<span class="sourceLineNo">322</span> * @throws IOException<a name="line.322"></a> -<span class="sourceLineNo">323</span> */<a name="line.323"></a> -<span class="sourceLineNo">324</span> public static boolean seekAtOrAfter(HFileScanner s, Cell k)<a name="line.324"></a> -<span class="sourceLineNo">325</span> throws IOException {<a name="line.325"></a> -<span class="sourceLineNo">326</span> int result = s.seekTo(k);<a name="line.326"></a> -<span class="sourceLineNo">327</span> if(result < 0) {<a name="line.327"></a> -<span class="sourceLineNo">328</span> if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.328"></a> -<span class="sourceLineNo">329</span> // using faked key<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 smaller than first KV in file, work from start of file<a name="line.332"></a> -<span class="sourceLineNo">333</span> return s.seekTo();<a name="line.333"></a> -<span class="sourceLineNo">334</span> } else if(result > 0) {<a name="line.334"></a> -<span class="sourceLineNo">335</span> // Passed KV is larger than current KV in file, if there is a next<a name="line.335"></a> -<span class="sourceLineNo">336</span> // it is the "after", if not then this scanner is done.<a name="line.336"></a> -<span class="sourceLineNo">337</span> return s.next();<a name="line.337"></a> -<span class="sourceLineNo">338</span> }<a name="line.338"></a> -<span class="sourceLineNo">339</span> // Seeked to the exact key<a name="line.339"></a> -<span class="sourceLineNo">340</span> return true;<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> static boolean reseekAtOrAfter(HFileScanner s, Cell k)<a name="line.343"></a> -<span class="sourceLineNo">344</span> throws IOException {<a name="line.344"></a> -<span class="sourceLineNo">345</span> //This function is similar to seekAtOrAfter function<a name="line.345"></a> -<span class="sourceLineNo">346</span> int result = s.reseekTo(k);<a name="line.346"></a> -<span class="sourceLineNo">347</span> if (result <= 0) {<a name="line.347"></a> -<span class="sourceLineNo">348</span> if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.348"></a> -<span class="sourceLineNo">349</span> // using faked key<a name="line.349"></a> -<span class="sourceLineNo">350</span> return true;<a name="line.350"></a> -<span class="sourceLineNo">351</span> }<a name="line.351"></a> -<span class="sourceLineNo">352</span> // If up to now scanner is not seeked yet, this means passed KV is smaller<a name="line.352"></a> -<span class="sourceLineNo">353</span> // than first KV in file, and it is the first time we seek on this file.<a name="line.353"></a> -<span class="sourceLineNo">354</span> // So we also need to work from the start of file.<a name="line.354"></a> -<span class="sourceLineNo">355</span> if (!s.isSeeked()) {<a name="line.355"></a> -<span class="sourceLineNo">356</span> return s.seekTo();<a name="line.356"></a> -<span class="sourceLineNo">357</span> }<a name="line.357"></a> -<span class="sourceLineNo">358</span> return true;<a name="line.358"></a> -<span class="sourceLineNo">359</span> }<a name="line.359"></a> -<span class="sourceLineNo">360</span> // passed KV is larger than current KV in file, if there is a next<a name="line.360"></a> -<span class="sourceLineNo">361</span> // it is after, if not then this scanner is done.<a name="line.361"></a> -<span class="sourceLineNo">362</span> return s.next();<a name="line.362"></a> -<span class="sourceLineNo">363</span> }<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> * @see KeyValueScanner#getScannerOrder()<a name="line.366"></a> -<span class="sourceLineNo">367</span> */<a name="line.367"></a> -<span class="sourceLineNo">368</span> @Override<a name="line.368"></a> -<span class="sourceLineNo">369</span> public long getScannerOrder() {<a name="line.369"></a> -<span class="sourceLineNo">370</span> return scannerOrder;<a name="line.370"></a> -<span class="sourceLineNo">371</span> }<a name="line.371"></a> -<span class="sourceLineNo">372</span><a name="line.372"></a> -<span class="sourceLineNo">373</span> /**<a name="line.373"></a> -<span class="sourceLineNo">374</span> * Pretend we have done a seek but don't do it yet, if possible. The hope is<a name="line.374"></a> -<span class="sourceLineNo">375</span> * that we find requested columns in more recent files and won't have to seek<a name="line.375"></a> -<span class="sourceLineNo">376</span> * in older files. Creates a fake key/value with the given row/column and the<a name="line.376"></a> -<span class="sourceLineNo">377</span> * highest (most recent) possible timestamp we might get from this file. When<a name="line.377"></a> -<span class="sourceLineNo">378</span> * users of such "lazy scanner" need to know the next KV precisely (e.g. when<a name="line.378"></a> -<span class="sourceLineNo">379</span> * this scanner is at the top of the heap), they run {@link #enforceSeek()}.<a name="line.379"></a> -<span class="sourceLineNo">380</span> * <p><a name="line.380"></a> -<span class="sourceLineNo">381</span> * Note that this function does guarantee that the current KV of this scanner<a name="line.381"></a> -<span class="sourceLineNo">382</span> * will be advanced to at least the given KV. Because of this, it does have<a name="line.382"></a> -<span class="sourceLineNo">383</span> * to do a real seek in cases when the seek timestamp is older than the<a name="line.383"></a> -<span class="sourceLineNo">384</span> * highest timestamp of the file, e.g. when we are trying to seek to the next<a name="line.384"></a> -<span class="sourceLineNo">385</span> * row/column and use OLDEST_TIMESTAMP in the seek key.<a name="line.385"></a> -<span class="sourceLineNo">386</span> */<a name="line.386"></a> -<span class="sourceLineNo">387</span> @Override<a name="line.387"></a> -<span class="sourceLineNo">388</span> public boolean requestSeek(Cell kv, boolean forward, boolean useBloom)<a name="line.388"></a> -<span class="sourceLineNo">389</span> throws IOException {<a name="line.389"></a> -<span class="sourceLineNo">390</span> if (kv.getFamilyLength() == 0) {<a name="line.390"></a> -<span class="sourceLineNo">391</span> useBloom = false;<a name="line.391"></a> -<span class="sourceLineNo">392</span> }<a name="line.392"></a> -<span class="sourceLineNo">393</span><a name="line.393"></a> -<span class="sourceLineNo">394</span> boolean haveToSeek = true;<a name="line.394"></a> -<span class="sourceLineNo">395</span> if (useBloom) {<a name="line.395"></a> -<span class="sourceLineNo">396</span> // check ROWCOL Bloom filter first.<a name="line.396"></a> -<span class="sourceLineNo">397</span> if (reader.getBloomFilterType() == BloomType.ROWCOL) {<a name="line.397"></a> -<span class="sourceLineNo">398</span> haveToSeek = reader.passesGeneralRowColBloomFilter(kv);<a name="line.398"></a> -<span class="sourceLineNo">399</span> } else if (canOptimizeForNonNullColumn<a name="line.399"></a> -<span class="sourceLineNo">400</span> && ((PrivateCellUtil.isDeleteFamily(kv)<a name="line.400"></a> -<span class="sourceLineNo">401</span> || PrivateCellUtil.isDeleteFamilyVersion(kv)))) {<a name="line.401"></a> -<span class="sourceLineNo">402</span> // if there is no such delete family kv in the store file,<a name="line.402"></a> -<span class="sourceLineNo">403</span> // then no need to seek.<a name="line.403"></a> -<span class="sourceLineNo">404</span> haveToSeek = reader.passesDeleteFamilyBloomFilter(kv.getRowArray(), kv.getRowOffset(),<a name="line.404"></a> -<span class="sourceLineNo">405</span> kv.getRowLength());<a name="line.405"></a> -<span class="sourceLineNo">406</span> }<a name="line.406"></a> -<span class="sourceLineNo">407</span> }<a name="line.407"></a> -<span class="sourceLineNo">408</span><a name="line.408"></a> -<span class="sourceLineNo">409</span> delayedReseek = forward;<a name="line.409"></a> -<span class="sourceLineNo">410</span> delayedSeekKV = kv;<a name="line.410"></a> -<span class="sourceLineNo">411</span><a name="line.411"></a> -<span class="sourceLineNo">412</span> if (haveToSeek) {<a name="line.412"></a> -<span class="sourceLineNo">413</span> // This row/column might be in this store file (or we did not use the<a name="line.413"></a> -<span class="sourceLineNo">414</span> // Bloom filter), so we still need to seek.<a name="line.414"></a> -<span class="sourceLineNo">415</span> realSeekDone = false;<a name="line.415"></a> -<span class="sourceLineNo">416</span> long maxTimestampInFile = reader.getMaxTimestamp();<a name="line.416"></a> -<span class="sourceLineNo">417</span> long seekTimestamp = kv.getTimestamp();<a name="line.417"></a> -<span class="sourceLineNo">418</span> if (seekTimestamp > maxTimestampInFile) {<a name="line.418"></a> -<span class="sourceLineNo">419</span> // Create a fake key that is not greater than the real next key.<a name="line.419"></a> -<span class="sourceLineNo">420</span> // (Lower timestamps correspond to higher KVs.)<a name="line.420"></a> -<span class="sourceLineNo">421</span> // To understand this better, consider that we are asked to seek to<a name="line.421"></a> -<span class="sourceLineNo">422</span> // a higher timestamp than the max timestamp in this file. We know that<a name="line.422"></a> -<span class="sourceLineNo">423</span> // the next point when we have to consider this file again is when we<a name="line.423"></a> -<span class="sourceLineNo">424</span> // pass the max timestamp of this file (with the same row/column).<a name="line.424"></a> -<span class="sourceLineNo">425</span> setCurrentCell(PrivateCellUtil.createFirstOnRowColTS(kv, maxTimestampInFile));<a name="line.425"></a> -<span class="sourceLineNo">426</span> } else {<a name="line.426"></a> -<span class="sourceLineNo">427</span> // This will be the case e.g. when we need to seek to the next<a name="line.427"></a> -<span class="sourceLineNo">428</span> // row/column, and we don't know exactly what they are, so we set the<a name="line.428"></a> -<span class="sourceLineNo">429</span> // seek key's timestamp to OLDEST_TIMESTAMP to skip the rest of this<a name="line.429"></a> -<span class="sourceLineNo">430</span> // row/column.<a name="line.430"></a> -<span class="sourceLineNo">431</span> enforceSeek();<a name="line.431"></a> -<span class="sourceLineNo">432</span> }<a name="line.432"></a> -<span class="sourceLineNo">433</span> return cur != null;<a name="line.433"></a> -<span class="sourceLineNo">434</span> }<a name="line.434"></a> -<span class="sourceLineNo">435</span><a name="line.435"></a> -<span class="sourceLineNo">436</span> // Multi-column Bloom filter optimization.<a name="line.436"></a> -<span class="sourceLineNo">437</span> // Create a fake key/value, so that this scanner only bubbles up to the top<a name="line.437"></a> -<span class="sourceLineNo">438</span> // of the KeyValueHeap in StoreScanner after we scanned this row/column in<a name="line.438"></a> -<span class="sourceLineNo">439</span> // all other store files. The query matcher will then just skip this fake<a name="line.439"></a> -<span class="sourceLineNo">440</span> // key/value and the store scanner will progress to the next column. This<a name="line.440"></a> -<span class="sourceLineNo">441</span> // is obviously not a "real real" seek, but unlike the fake KV earlier in<a name="line.441"></a> -<span class="sourceLineNo">442</span> // this method, we want this to be propagated to ScanQueryMatcher.<a name="line.442"></a> -<span class="sourceLineNo">443</span> setCurrentCell(PrivateCellUtil.createLastOnRowCol(kv));<a name="line.443"></a> -<span class="sourceLineNo">444</span><a name="line.444"></a> -<span class="sourceLineNo">445</span> realSeekDone = true;<a name="line.445"></a> -<span class="sourceLineNo">446</span> return true;<a name="line.446"></a> -<span class="sourceLineNo">447</span> }<a name="line.447"></a> -<span class="sourceLineNo">448</span><a name="line.448"></a> -<span class="sourceLineNo">449</span> StoreFileReader getReader() {<a name="line.449"></a> -<span class="sourceLineNo">450</span> return reader;<a name="line.450"></a> -<span class="sourceLineNo">451</span> }<a name="line.451"></a> -<span class="sourceLineNo">452</span><a name="line.452"></a> -<span class="sourceLineNo">453</span> CellComparator getComparator() {<a name="line.453"></a> -<span class="sourceLineNo">454</span> return reader.getComparator();<a name="line.454"></a> -<span class="sourceLineNo">455</span> }<a name="line.455"></a> -<span class="sourceLineNo">456</span><a name="line.456"></a> -<span class="sourceLineNo">457</span> @Override<a name="line.457"></a> -<span class="sourceLineNo">458</span> public boolean realSeekDone() {<a name="line.458"></a> -<span class="sourceLineNo">459</span> return realSeekDone;<a name="line.459"></a> -<span class="sourceLineNo">460</span> }<a name="line.460"></a> -<span class="sourceLineNo">461</span><a name="line.461"></a> -<span class="sourceLineNo">462</span> @Override<a name="line.462"></a> -<span class="sourceLineNo">463</span> public void enforceSeek() throws IOException {<a name="line.463"></a> -<span class="sourceLineNo">464</span> if (realSeekDone)<a name="line.464"></a> -<span class="sourceLineNo">465</span> return;<a name="line.465"></a> -<span class="sourceLineNo">466</span><a name="line.466"></a> -<span class="sourceLineNo">467</span> if (delayedReseek) {<a name="line.467"></a> -<span class="sourceLineNo">468</span> reseek(delayedSeekKV);<a name="line.468"></a> -<span class="sourceLineNo">469</span> } else {<a name="line.469"></a> -<span class="sourceLineNo">470</span> seek(delayedSeekKV);<a name="line.470"></a> -<span class="sourceLineNo">471</span> }<a name="line.471"></a> -<span class="sourceLineNo">472</span> }<a name="line.472"></a> -<span class="sourceLineNo">473</span><a name="line.473"></a> -<span class="sourceLineNo">474</span> @Override<a name="line.474"></a> -<span class="sourceLineNo">475</span> public boolean isFileScanner() {<a name="line.475"></a> -<span class="sourceLineNo">476</span> return true;<a name="line.476"></a> -<span class="sourceLineNo">477</span> }<a name="line.477"></a> -<span class="sourceLineNo">478</span><a name="line.478"></a> -<span class="sourceLineNo">479</span> @Override<a name="line.479"></a> -<span class="sourceLineNo">480</span> public Path getFilePath() {<a name="line.480"></a> -<span class="sourceLineNo">481</span> return reader.getHFileReader().getPath();<a name="line.481"></a> -<span class="sourceLineNo">482</span> }<a name="line.482"></a> -<span class="sourceLineNo">483</span><a name="line.483"></a> -<span class="sourceLineNo">484</span> // Test methods<a name="line.484"></a> -<span class="sourceLineNo">485</span> static final long getSeekCount() {<a name="line.485"></a> -<span class="sourceLineNo">486</span> return seekCount.sum();<a name="line.486"></a> -<span class="sourceLineNo">487</span> }<a name="line.487"></a> -<span class="sourceLineNo">488</span><a name="line.488"></a> -<span class="sourceLineNo">489</span> static final void instrument() {<a name="line.489"></a> -<span class="sourceLineNo">490</span> seekCount = new LongAdder();<a name="line.490"></a> -<span class="sourceLineNo">491</span> }<a name="line.491"></a> -<span class="sourceLineNo">492</span><a name="line.492"></a> -<span class="sourceLineNo">493</span> @Override<a name="line.493"></a> -<span class="sourceLineNo">494</span> public boolean shouldUseScanner(Scan scan, HStore store, long oldestUnexpiredTS) {<a name="line.494"></a> -<span class="sourceLineNo">495</span> // if the file has no entries, no need to validate or create a scanner.<a name="line.495"></a> -<span class="sourceLineNo">496</span> byte[] cf = store.getColumnFamilyDescriptor().getName();<a name="line.496"></a> -<span class="sourceLineNo">497</span> TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.497"></a> -<span class="sourceLineNo">498</span> if (timeRange == null) {<a name="line.498"></a> -<span class="sourceLineNo">499</span> timeRange = scan.getTimeRange();<a name="line.499"></a> -<span class="sourceLineNo">500</span> }<a name="line.500"></a> -<span class="sourceLineNo">501</span> return reader.passesTimerangeFilter(timeRange, oldestUnexpiredTS) && reader<a name="line.501"></a> -<span class="sourceLineNo">502</span> .passesKeyRangeFilter(scan) && reader.passesBloomFilter(scan, scan.getFamilyMap().get(cf));<a name="line.502"></a> -<span class="sourceLineNo">503</span> }<a name="line.503"></a> -<span class="sourceLineNo">504</span><a name="line.504"></a> -<span class="sourceLineNo">505</span> @Override<a name="line.505"></a> -<span class="sourceLineNo">506</span> public boolean seekToPreviousRow(Cell originalKey) throws IOException {<a name="line.506"></a> -<span class="sourceLineNo">507</span> try {<a name="line.507"></a> -<span class="sourceLineNo">508</span> try {<a name="line.508"></a> -<span class="sourceLineNo">509</span> boolean keepSeeking = false;<a name="line.509"></a> -<span class="sourceLineNo">510</span> Cell key = originalKey;<a name="line.510"></a> -<span class="sourceLineNo">511</span> do {<a name="line.511"></a> -<span class="sourceLineNo">512</span> Cell seekKey = PrivateCellUtil.createFirstOnRow(key);<a name="line.512"></a> -<span class="sourceLineNo">513</span> if (seekCount != null) seekCount.increment();<a name="line.513"></a> -<span class="sourceLineNo">514</span> if (!hfs.seekBefore(seekKey)) {<a name="line.514"></a> -<span class="sourceLineNo">515</span> this.cur = null;<a name="line.515"></a> -<span class="sourceLineNo">516</span> return false;<a name="line.516"></a> -<span class="sourceLineNo">517</span> }<a name="line.517"></a> -<span class="sourceLineNo">518</span> Cell curCell = hfs.getCell();<a name="line.518"></a> -<span class="sourceLineNo">519</span> Cell firstKeyOfPreviousRow = PrivateCellUtil.createFirstOnRow(curCell);<a name="line.519"></a> -<span class="sourceLineNo">520</span><a name="line.520"></a> -<span class="sourceLineNo">521</span> if (seekCount != null) seekCount.increment();<a name="line.521"></a> -<span class="sourceLineNo">522</span> if (!seekAtOrAfter(hfs, firstKeyOfPreviousRow)) {<a name="line.522"></a> -<span class="sourceLineNo">523</span> this.cur = null;<a name="line.523"></a> -<span class="sourceLineNo">524</span> return false;<a name="line.524"></a> -<span class="sourceLineNo">525</span> }<a name="line.525"></a> -<span class="sourceLineNo">526</span><a name="line.526"></a> -<span class="sourceLineNo">527</span> setCurrentCell(hfs.getCell());<a name="line.527"></a> -<span class="sourceLineNo">528</span> this.stopSkippingKVsIfNextRow = true;<a name="line.528"></a> -<span class="sourceLineNo">529</span> boolean resultOfSkipKVs;<a name="line.529"></a> -<span class="sourceLineNo">530</span> try {<a name="line.530"></a> -<span class="sourceLineNo">531</span> resultOfSkipKVs = skipKVsNewerThanReadpoint();<a name="line.531"></a> -<span class="sourceLineNo">532</span> } finally {<a name="line.532"></a> -<span class="sourceLineNo">533</span> this.stopSkippingKVsIfNextRow = false;<a name="line.533"></a> -<span class="sourceLineNo">534</span> }<a name="line.534"></a> -<span class="sourceLineNo">535</span> if (!resultOfSkipKVs<a name="line.535"></a> -<span class="sourceLineNo">536</span> || getComparator().compareRows(cur, firstKeyOfPreviousRow) > 0) {<a name="line.536"></a> -<span class="sourceLineNo">537</span> keepSeeking = true;<a name="line.537"></a> -<span class="sourceLineNo">538</span> key = firstKeyOfPreviousRow;<a name="line.538"></a> -<span class="sourceLineNo">539</span> continue;<a name="line.539"></a> -<span class="sourceLineNo">540</span> } else {<a name="line.540"></a> -<span class="sourceLineNo">541</span> keepSeeking = false;<a name="line.541"></a> -<span class="sourceLineNo">542</span> }<a name="line.542"></a> -<span class="sourceLineNo">543</span> } while (keepSeeking);<a name="line.543"></a> -<span class="sourceLineNo">544</span> return true;<a name="line.544"></a> -<span class="sourceLineNo">545</span> } finally {<a name="line.545"></a> -<span class="sourceLineNo">546</span> realSeekDone = true;<a name="line.546"></a> -<span class="sourceLineNo">547</span> }<a name="line.547"></a> -<span class="sourceLineNo">548</span> } catch (FileNotFoundException e) {<a name="line.548"></a> -<span class="sourceLineNo">549</span> throw e;<a name="line.549"></a> -<span class="sourceLineNo">550</span> } catch (IOException ioe) {<a name="line.550"></a> -<span class="sourceLineNo">551</span> throw new IOException("Could not seekToPreviousRow " + this + " to key "<a name="line.551"></a> -<span class="sourceLineNo">552</span> + originalKey, ioe);<a name="line.552"></a> -<span class="sourceLineNo">553</span> }<a name="line.553"></a> -<span class="sourceLineNo">554</span> }<a name="line.554"></a> -<span class="sourceLineNo">555</span><a name="line.555"></a> -<span class="sourceLineNo">556</span> @Override<a name="line.556"></a> -<span class="sourceLineNo">557</span> public boolean seekToLastRow() throws IOException {<a name="line.557"></a> -<span class="sourceLineNo">558</span> Optional<byte[]> lastRow = reader.getLastRowKey();<a name="line.558"></a> -<span class="sourceLineNo">559</span> if (!lastRow.isPresent()) {<a name="line.559"></a> -<span class="sourceLineNo">560</span> return false;<a name="line.560"></a> -<span class="sourceLineNo">561</span> }<a name="line.561"></a> -<span class="sourceLineNo">562</span> Cell seekKey = PrivateCellUtil.createFirstOnRow(lastRow.get());<a name="line.562"></a> -<span class="sourceLineNo">563</span> if (seek(seekKey)) {<a name="line.563"></a> -<span class="sourceLineNo">564</span> return true;<a name="line.564"></a> -<span class="sourceLineNo">565</span> } else {<a name="line.565"></a> -<span class="sourceLineNo">566</span> return seekToPreviousRow(seekKey);<a name="line.566"></a> -<span class="sourceLineNo">567</span> }<a name="line.567"></a> -<span class="sourceLineNo">568</span> }<a name="line.568"></a> -<span class="sourceLineNo">569</span><a name="line.569"></a> -<span class="sourceLineNo">570</span> @Override<a name="line.570"></a> -<span class="sourceLineNo">571</span> public boolean backwardSeek(Cell key) throws IOException {<a name="line.571"></a> -<span class="sourceLineNo">572</span> seek(key);<a name="line.572"></a> -<span class="sourceLineNo">573</span> if (cur == null<a name="line.573"></a> -<span class="sourceLineNo">574</span> || getComparator().compareRows(cur, key) > 0) {<a name="line.574"></a> -<span class="sourceLineNo">575</span> return seekToPreviousRow(key);<a name="line.575"></a> -<span class="sourceLineNo">576</span> }<a name="line.576"></a> -<span class="sourceLineNo">577</span> return true;<a name="line.577"></a> -<span class="sourceLineNo">578</span> }<a name="line.578"></a> -<span class="sourceLineNo">579</span><a name="line.579"></a> -<span class="sourceLineNo">580</span> @Override<a name="line.580"></a> -<span class="sourceLineNo">581</span> public Cell getNextIndexedKey() {<a name="line.581"></a> -<span class="sourceLineNo">582</span> return hfs.getNextIndexedKey();<a name="line.582"></a> -<span class="sourceLineNo">583</span> }<a name="line.583"></a> -<span class="sourceLineNo">584</span><a name="line.584"></a> -<span class="sourceLineNo">585</span> @Override<a name="line.585"></a> -<span class="sourceLineNo">586</span> public void shipped() throws IOException {<a name="line.586"></a> -<span class="sourceLineNo">587</span> this.hfs.shipped();<a name="line.587"></a> -<span class="sourceLineNo">588</span> }<a name="line.588"></a> -<span class="sourceLineNo">589</span>}<a name="line.589"></a> +<span class="sourceLineNo">097</span> this.reader.incrementRefCount();<a name="line.97"></a> +<span class="sourceLineNo">098</span> }<a name="line.98"></a> +<span class="sourceLineNo">099</span><a name="line.99"></a> +<span class="sourceLineNo">100</span> boolean isPrimaryReplica() {<a name="line.100"></a> +<span class="sourceLineNo">101</span> return reader.isPrimaryReplicaReader();<a name="line.101"></a> +<span class="sourceLineNo">102</span> }<a name="line.102"></a> +<span class="sourceLineNo">103</span><a name="line.103"></a> +<span class="sourceLineNo">104</span> /**<a name="line.104"></a> +<span class="sourceLineNo">105</span> * Return an array of scanners corresponding to the given set of store files.<a name="line.105"></a> +<span class="sourceLineNo">106</span> */<a name="line.106"></a> +<span class="sourceLineNo">107</span> public static List<StoreFileScanner> getScannersForStoreFiles(Collection<HStoreFile> files,<a name="line.107"></a> +<span class="sourceLineNo">108</span> boolean cacheBlocks, boolean usePread, long readPt) throws IOException {<a name="line.108"></a> +<span class="sourceLineNo">109</span> return getScannersForStoreFiles(files, cacheBlocks, usePread, false, false, readPt);<a name="line.109"></a> +<span class="sourceLineNo">110</span> }<a name="line.110"></a> +<span class="sourceLineNo">111</span><a name="line.111"></a> +<span class="sourceLineNo">112</span> /**<a name="line.112"></a> +<span class="sourceLineNo">113</span> * Return an array of scanners corresponding to the given set of store files.<a name="line.113"></a> +<span class="sourceLineNo">114</span> */<a name="line.114"></a> +<span class="sourceLineNo">115</span> public static List<StoreFileScanner> getScannersForStoreFiles(Collection<HStoreFile> files,<a name="line.115"></a> +<span class="sourceLineNo">116</span> boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean useDropBehind,<a name="line.116"></a> +<span class="sourceLineNo">117</span> long readPt) throws IOException {<a name="line.117"></a> +<span class="sourceLineNo">118</span> return getScannersForStoreFiles(files, cacheBlocks, usePread, isCompaction, useDropBehind, null,<a name="line.118"></a> +<span class="sourceLineNo">119</span> readPt);<a name="line.119"></a> +<span class="sourceLineNo">120</span> }<a name="line.120"></a> +<span class="sourceLineNo">121</span><a name="line.121"></a> +<span class="sourceLineNo">122</span> /**<a name="line.122"></a> +<span class="sourceLineNo">123</span> * Return an array of scanners corresponding to the given set of store files, And set the<a name="line.123"></a> +<span class="sourceLineNo">124</span> * ScanQueryMatcher for each store file scanner for further optimization<a name="line.124"></a> +<span class="sourceLineNo">125</span> */<a name="line.125"></a> +<span class="sourceLineNo">126</span> public static List<StoreFileScanner> getScannersForStoreFiles(Collection<HStoreFile> files,<a name="line.126"></a> +<span class="sourceLineNo">127</span> boolean cacheBlocks, boolean usePread, boolean isCompaction, boolean canUseDrop,<a name="line.127"></a> +<span class="sourceLineNo">128</span> ScanQueryMatcher matcher, long readPt) throws IOException {<a name="line.128"></a> +<span class="sourceLineNo">129</span> if (files.isEmpty()) {<a name="line.129"></a> +<span class="sourceLineNo">130</span> return Collections.emptyList();<a name="line.130"></a> +<span class="sourceLineNo">131</span> }<a name="line.131"></a> +<span class="sourceLineNo">132</span> List<StoreFileScanner> scanners = new ArrayList<>(files.size());<a name="line.132"></a> +<span class="sourceLineNo">133</span> boolean canOptimizeForNonNullColumn = matcher != null ? !matcher.hasNullColumnInQuery() : false;<a name="line.133"></a> +<span class="sourceLineNo">134</span> PriorityQueue<HStoreFile> sortedFiles =<a name="line.134"></a> +<span class="sourceLineNo">135</span> new PriorityQueue<>(files.size(), StoreFileComparators.SEQ_ID);<a name="line.135"></a> +<span class="sourceLineNo">136</span> for (HStoreFile file : files) {<a name="line.136"></a> +<span class="sourceLineNo">137</span> // The sort function needs metadata so we need to open reader first before sorting the list.<a name="line.137"></a> +<span class="sourceLineNo">138</span> file.initReader();<a name="line.138"></a> +<span class="sourceLineNo">139</span> sortedFiles.add(file);<a name="line.139"></a> +<span class="sourceLineNo">140</span> }<a name="line.140"></a> +<span class="sourceLineNo">141</span> boolean succ = false;<a name="line.141"></a> +<span class="sourceLineNo">142</span> try {<a name="line.142"></a> +<span class="sourceLineNo">143</span> for (int i = 0, n = files.size(); i < n; i++) {<a name="line.143"></a> +<span class="sourceLineNo">144</span> HStoreFile sf = sortedFiles.remove();<a name="line.144"></a> +<span class="sourceLineNo">145</span> StoreFileScanner scanner;<a name="line.145"></a> +<span class="sourceLineNo">146</span> if (usePread) {<a name="line.146"></a> +<span class="sourceLineNo">147</span> scanner = sf.getPreadScanner(cacheBlocks, readPt, i, canOptimizeForNonNullColumn);<a name="line.147"></a> +<span class="sourceLineNo">148</span> } else {<a name="line.148"></a> +<span class="sourceLineNo">149</span> scanner = sf.getStreamScanner(canUseDrop, cacheBlocks, isCompaction, readPt, i,<a name="line.149"></a> +<span class="sourceLineNo">150</span> canOptimizeForNonNullColumn);<a name="line.150"></a> +<span class="sourceLineNo">151</span> }<a name="line.151"></a> +<span class="sourceLineNo">152</span> scanners.add(scanner);<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> /**<a name="line.165"></a> +<span class="sourceLineNo">166</span> * Get scanners for compaction. We will create a separated reader for each store file to avoid<a name="line.166"></a> +<span class="sourceLineNo">167</span> * contention with normal read request.<a name="line.167"></a> +<span class="sourceLineNo">168</span> */<a name="line.168"></a> +<span class="sourceLineNo">169</span> public static List<StoreFileScanner> getScannersForCompaction(Collection<HStoreFile> files,<a name="line.169"></a> +<span class="sourceLineNo">170</span> boolean canUseDropBehind, long readPt) throws IOException {<a name="line.170"></a> +<span class="sourceLineNo">171</span> List<StoreFileScanner> scanners = new ArrayList<>(files.size());<a name="line.171"></a> +<span class="sourceLineNo">172</span> List<HStoreFile> sortedFiles = new ArrayList<>(files);<a name="line.172"></a> +<span class="sourceLineNo">173</span> Collections.sort(sortedFiles, StoreFileComparators.SEQ_ID);<a name="line.173"></a> +<span class="sourceLineNo">174</span> boolean succ = false;<a name="line.174"></a> +<span class="sourceLineNo">175</span> try {<a name="line.175"></a> +<span class="sourceLineNo">176</span> for (int i = 0, n = sortedFiles.size(); i < n; i++) {<a name="line.176"></a> +<span class="sourceLineNo">177</span> scanners.add(<a name="line.177"></a> +<span class="sourceLineNo">178</span> sortedFiles.get(i).getStreamScanner(canUseDropBehind, false, true, readPt, i, false));<a name="line.178"></a> +<span class="sourceLineNo">179</span> }<a name="line.179"></a> +<span class="sourceLineNo">180</span> succ = true;<a name="line.180"></a> +<span class="sourceLineNo">181</span> } finally {<a name="line.181"></a> +<span class="sourceLineNo">182</span> if (!succ) {<a name="line.182"></a> +<span class="sourceLineNo">183</span> for (StoreFileScanner scanner : scanners) {<a name="line.183"></a> +<span class="sourceLineNo">184</span> scanner.close();<a name="line.184"></a> +<span class="sourceLineNo">185</span> }<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> return scanners;<a name="line.188"></a> +<span class="sourceLineNo">189</span> }<a name="line.189"></a> +<span class="sourceLineNo">190</span><a name="line.190"></a> +<span class="sourceLineNo">191</span> @Override<a name="line.191"></a> +<span class="sourceLineNo">192</span> public String toString() {<a name="line.192"></a> +<span class="sourceLineNo">193</span> return "StoreFileScanner[" + hfs.toString() + ", cur=" + cur + "]";<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> @Override<a name="line.196"></a> +<span class="sourceLineNo">197</span> public Cell peek() {<a name="line.197"></a> +<span class="sourceLineNo">198</span> return cur;<a name="line.198"></a> +<span class="sourceLineNo">199</span> }<a name="line.199"></a> +<span class="sourceLineNo">200</span><a name="line.200"></a> +<span class="sourceLineNo">201</span> @Override<a name="line.201"></a> +<span class="sourceLineNo">202</span> public Cell next() throws IOException {<a name="line.202"></a> +<span class="sourceLineNo">203</span> Cell retKey = cur;<a name="line.203"></a> +<span class="sourceLineNo">204</span><a name="line.204"></a> +<span class="sourceLineNo">205</span> try {<a name="line.205"></a> +<span class="sourceLineNo">206</span> // only seek if we aren't at the end. cur == null implies 'end'.<a name="line.206"></a> +<span class="sourceLineNo">207</span> if (cur != null) {<a name="line.207"></a> +<span class="sourceLineNo">208</span> hfs.next();<a name="line.208"></a> +<span class="sourceLineNo">209</span> setCurrentCell(hfs.getCell());<a name="line.209"></a> +<span class="sourceLineNo">210</span> if (hasMVCCInfo || this.reader.isBulkLoaded()) {<a name="line.210"></a> +<span class="sourceLineNo">211</span> skipKVsNewerThanReadpoint();<a name="line.211"></a> +<span class="sourceLineNo">212</span> }<a name="line.212"></a> +<span class="sourceLineNo">213</span> }<a name="line.213"></a> +<span class="sourceLineNo">214</span> } catch (FileNotFoundException e) {<a name="line.214"></a> +<span class="sourceLineNo">215</span> throw e;<a name="line.215"></a> +<span class="sourceLineNo">216</span> } catch(IOException e) {<a name="line.216"></a> +<span class="sourceLineNo">217</span> throw new IOException("Could not iterate " + this, e);<a name="line.217"></a> +<span class="sourceLineNo">218</span> }<a name="line.218"></a> +<span class="sourceLineNo">219</span> return retKey;<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> @Override<a name="line.222"></a> +<span class="sourceLineNo">223</span> public boolean seek(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(!seekAtOrAfter(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><a name="line.232"></a> +<span class="sourceLineNo">233</span> setCurrentCell(hfs.getCell());<a name="line.233"></a> +<span class="sourceLineNo">234</span><a name="line.234"></a> +<span class="sourceLineNo">235</span> if (!hasMVCCInfo && this.reader.isBulkLoaded()) {<a name="line.235"></a> +<span class="sourceLineNo">236</span> return skipKVsNewerThanReadpoint();<a name="line.236"></a> +<span class="sourceLineNo">237</span> } else {<a name="line.237"></a> +<span class="sourceLineNo">238</span> return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.238"></a> +<span class="sourceLineNo">239</span> }<a name="line.239"></a> +<span class="sourceLineNo">240</span> } finally {<a name="line.240"></a> +<span class="sourceLineNo">241</span> realSeekDone = true;<a name="line.241"></a> +<span class="sourceLineNo">242</span> }<a name="line.242"></a> +<span class="sourceLineNo">243</span> } catch (FileNotFoundException e) {<a name="line.243"></a> +<span class="sourceLineNo">244</span> throw e;<a name="line.244"></a> +<span class="sourceLineNo">245</span> } catch (IOException ioe) {<a name="line.245"></a> +<span class="sourceLineNo">246</span> throw new IOException("Could not seek " + this + " to key " + key, 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> @Override<a name="line.250"></a> +<span class="sourceLineNo">251</span> public boolean reseek(Cell key) throws IOException {<a name="line.251"></a> +<span class="sourceLineNo">252</span> if (seekCount != null) seekCount.increment();<a name="line.252"></a> +<span class="sourceLineNo">253</span><a name="line.253"></a> +<span class="sourceLineNo">254</span> try {<a name="line.254"></a> +<span class="sourceLineNo">255</span> try {<a name="line.255"></a> +<span class="sourceLineNo">256</span> if (!reseekAtOrAfter(hfs, key)) {<a name="line.256"></a> +<span class="sourceLineNo">257</span> this.cur = null;<a name="line.257"></a> +<span class="sourceLineNo">258</span> return false;<a name="line.258"></a> +<span class="sourceLineNo">259</span> }<a name="line.259"></a> +<span class="sourceLineNo">260</span> setCurrentCell(hfs.getCell());<a name="line.260"></a> +<span class="sourceLineNo">261</span><a name="line.261"></a> +<span class="sourceLineNo">262</span> if (!hasMVCCInfo && this.reader.isBulkLoaded()) {<a name="line.262"></a> +<span class="sourceLineNo">263</span> return skipKVsNewerThanReadpoint();<a name="line.263"></a> +<span class="sourceLineNo">264</span> } else {<a name="line.264"></a> +<span class="sourceLineNo">265</span> return !hasMVCCInfo ? true : skipKVsNewerThanReadpoint();<a name="line.265"></a> +<span class="sourceLineNo">266</span> }<a name="line.266"></a> +<span class="sourceLineNo">267</span> } finally {<a name="line.267"></a> +<span class="sourceLineNo">268</span> realSeekDone = true;<a name="line.268"></a> +<span class="sourceLineNo">269</span> }<a name="line.269"></a> +<span class="sourceLineNo">270</span> } catch (FileNotFoundException e) {<a name="line.270"></a> +<span class="sourceLineNo">271</span> throw e;<a name="line.271"></a> +<span class="sourceLineNo">272</span> } catch (IOException ioe) {<a name="line.272"></a> +<span class="sourceLineNo">273</span> throw new IOException("Could not reseek " + this + " to key " + key,<a name="line.273"></a> +<span class="sourceLineNo">274</span> ioe);<a name="line.274"></a> +<span class="sourceLineNo">275</span> }<a name="line.275"></a> +<span class="sourceLineNo">276</span> }<a name="line.276"></a> +<span class="sourceLineNo">277</span><a name="line.277"></a> +<span class="sourceLineNo">278</span> protected void setCurrentCell(Cell newVal) throws IOException {<a name="line.278"></a> +<span class="sourceLineNo">279</span> this.cur = newVal;<a name="line.279"></a> +<span class="sourceLineNo">280</span> if (this.cur != null && this.reader.isBulkLoaded() && !this.reader.isSkipResetSeqId()) {<a name="line.280"></a> +<span class="sourceLineNo">281</span> PrivateCellUtil.setSequenceId(cur, this.reader.getSequenceID());<a name="line.281"></a> +<span class="sourceLineNo">282</span> }<a name="line.282"></a> +<span class="sourceLineNo">283</span> }<a name="line.283"></a> +<span class="sourceLineNo">284</span><a name="line.284"></a> +<span class="sourceLineNo">285</span> protected boolean skipKVsNewerThanReadpoint() throws IOException {<a name="line.285"></a> +<span class="sourceLineNo">286</span> // We want to ignore all key-values that are newer than our current<a name="line.286"></a> +<span class="sourceLineNo">287</span> // readPoint<a name="line.287"></a> +<span class="sourceLineNo">288</span> Cell startKV = cur;<a name="line.288"></a> +<span class="sourceLineNo">289</span> while(enforceMVCC<a name="line.289"></a> +<span class="sourceLineNo">290</span> && cur != null<a name="line.290"></a> +<span class="sourceLineNo">291</span> && (cur.getSequenceId() > readPt)) {<a name="line.291"></a> +<span class="sourceLineNo">292</span> boolean hasNext = hfs.next();<a name="line.292"></a> +<span class="sourceLineNo">293</span> setCurrentCell(hfs.getCell());<a name="line.293"></a> +<span class="sourceLineNo">294</span> if (hasNext && this.stopSkippingKVsIfNextRow<a name="line.294"></a> +<span class="sourceLineNo">295</span> && getComparator().compareRows(cur, startKV) > 0) {<a name="line.295"></a> +<span class="sourceLineNo">296</span> return false;<a name="line.296"></a> +<span class="sourceLineNo">297</span> }<a name="line.297"></a> +<span class="sourceLineNo">298</span> }<a name="line.298"></a> +<span class="sourceLineNo">299</span><a name="line.299"></a> +<span class="sourceLineNo">300</span> if (cur == null) {<a name="line.300"></a> +<span class="sourceLineNo">301</span> return false;<a name="line.301"></a> +<span class="sourceLineNo">302</span> }<a name="line.302"></a> +<span class="sourceLineNo">303</span><a name="line.303"></a> +<span class="sourceLineNo">304</span> return true;<a name="line.304"></a> +<span class="sourceLineNo">305</span> }<a name="line.305"></a> +<span class="sourceLineNo">306</span><a name="line.306"></a> +<span class="sourceLineNo">307</span> @Override<a name="line.307"></a> +<span class="sourceLineNo">308</span> public void close() {<a name="line.308"></a> +<span class="sourceLineNo">309</span> if (closed) return;<a name="line.309"></a> +<span class="sourceLineNo">310</span> cur = null;<a name="line.310"></a> +<span class="sourceLineNo">311</span> this.hfs.close();<a name="line.311"></a> +<span class="sourceLineNo">312</span> if (this.reader != null) {<a name="line.312"></a> +<span class="sourceLineNo">313</span> this.reader.readCompleted();<a name="line.313"></a> +<span class="sourceLineNo">314</span> }<a name="line.314"></a> +<span class="sourceLineNo">315</span> closed = true;<a name="line.315"></a> +<span class="sourceLineNo">316</span> }<a name="line.316"></a> +<span class="sourceLineNo">317</span><a name="line.317"></a> +<span class="sourceLineNo">318</span> /**<a name="line.318"></a> +<span class="sourceLineNo">319</span> *<a name="line.319"></a> +<span class="sourceLineNo">320</span> * @param s<a name="line.320"></a> +<span class="sourceLineNo">321</span> * @param k<a name="line.321"></a> +<span class="sourceLineNo">322</span> * @return false if not found or if k is after the end.<a name="line.322"></a> +<span class="sourceLineNo">323</span> * @throws IOException<a name="line.323"></a> +<span class="sourceLineNo">324</span> */<a name="line.324"></a> +<span class="sourceLineNo">325</span> public static boolean seekAtOrAfter(HFileScanner s, Cell k)<a name="line.325"></a> +<span class="sourceLineNo">326</span> throws IOException {<a name="line.326"></a> +<span class="sourceLineNo">327</span> int result = s.seekTo(k);<a name="line.327"></a> +<span class="sourceLineNo">328</span> if(result < 0) {<a name="line.328"></a> +<span class="sourceLineNo">329</span> if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.329"></a> +<span class="sourceLineNo">330</span> // using faked key<a name="line.330"></a> +<span class="sourceLineNo">331</span> return true;<a name="line.331"></a> +<span class="sourceLineNo">332</span> }<a name="line.332"></a> +<span class="sourceLineNo">333</span> // Passed KV is smaller than first KV in file, work from start of file<a name="line.333"></a> +<span class="sourceLineNo">334</span> return s.seekTo();<a name="line.334"></a> +<span class="sourceLineNo">335</span> } else if(result > 0) {<a name="line.335"></a> +<span class="sourceLineNo">336</span> // Passed KV is larger than current KV in file, if there is a next<a name="line.336"></a> +<span class="sourceLineNo">337</span> // it is the "after", if not then this scanner is done.<a name="line.337"></a> +<span class="sourceLineNo">338</span> return s.next();<a name="line.338"></a> +<span class="sourceLineNo">339</span> }<a name="line.339"></a> +<span class="sourceLineNo">340</span> // Seeked to the exact key<a name="line.340"></a> +<span class="sourceLineNo">341</span> return true;<a name="line.341"></a> +<span class="sourceLineNo">342</span> }<a name="line.342"></a> +<span class="sourceLineNo">343</span><a name="line.343"></a> +<span class="sourceLineNo">344</span> static boolean reseekAtOrAfter(HFileScanner s, Cell k)<a name="line.344"></a> +<span class="sourceLineNo">345</span> throws IOException {<a name="line.345"></a> +<span class="sourceLineNo">346</span> //This function is similar to seekAtOrAfter function<a name="line.346"></a> +<span class="sourceLineNo">347</span> int result = s.reseekTo(k);<a name="line.347"></a> +<span class="sourceLineNo">348</span> if (result <= 0) {<a name="line.348"></a> +<span class="sourceLineNo">349</span> if (result == HConstants.INDEX_KEY_MAGIC) {<a name="line.349"></a> +<span class="sourceLineNo">350</span> // using faked key<a name="line.350"></a> +<span class="sourceLineNo">351</span> return true;<a name="line.351"></a> +<span class="sourceLineNo">352</span> }<a name="line.352"></a> +<span class="sourceLineNo">353</span> // If up to now scanner is not seeked yet, this means passed KV is smaller<a name="line.353"></a> +<span class="sourceLineNo">354</span> // than first KV in file, and it is the first time we seek on this file.<a name="line.354"></a> +<span class="sourceLineNo">355</span> // So we also need to work from the start of file.<a name="line.355"></a> +<span class="sourceLineNo">356</span> if (!s.isSeeked()) {<a name="line.356"></a> +<span class="sourceLineNo">357</span> return s.seekTo();<a name="line.357"></a> +<span class="sourceLineNo">358</span> }<a name="line.358"></a> +<span class="sourceLineNo">359</span> return true;<a name="line.359"></a> +<span class="sourceLineNo">360</span> }<a name="line.360"></a> +<span class="sourceLineNo">361</span> // passed KV is larger than current KV in file, if there is a next<a name="line.361"></a> +<span class="sourceLineNo">362</span> // it is after, if not then this scanner is done.<a name="line.362"></a> +<span class="sourceLineNo">363</span> return s.next();<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> /**<a name="line.366"></a> +<span class="sourceLineNo">367</span> * @see KeyValueScanner#getScannerOrder()<a name="line.367"></a> +<span class="sourceLineNo">368</span> */<a name="line.368"></a> +<span class="sourceLineNo">369</span> @Override<a name="line.369"></a> +<span class="sourceLineNo">370</span> public long getScannerOrder() {<a name="line.370"></a> +<span class="sourceLineNo">371</span> return scannerOrder;<a name="line.371"></a> +<span class="sourceLineNo">372</span> }<a name="line.372"></a> +<span class="sourceLineNo">373</span><a name="line.373"></a> +<span class="sourceLineNo">374</span> /**<a name="line.374"></a> +<span class="sourceLineNo">375</span> * Pretend we have done a seek but don't do it yet, if possible. The hope is<a name="line.375"></a> +<span class="sourceLineNo">376</span> * that we find requested columns in more recent files and won't have to seek<a name="line.376"></a> +<span class="sourceLineNo">377</span> * in older files. Creates a fake key/value with the given row/column and the<a name="line.377"></a> +<span class="sourceLineNo">378</span> * highest (most recent) possible timestamp we might get from this file. When<a name="line.378"></a> +<span class="sourceLineNo">379</span> * users of such "lazy scanner" need to know the next KV precisely (e.g. when<a name="line.379"></a> +<span class="sourceLineNo">380</span> * this scanner is at the top of the heap), they run {@link #enforceSeek()}.<a name="line.380"></a> +<span class="sourceLineNo">381</span> * <p><a name="line.381"></a> +<span class="sourceLineNo">382</span> * Note that this function does guarantee that the current KV of this scanner<a name="line.382"></a> +<span class="sourceLineNo">383</span> * will be advanced to at least the given KV. Because of this, it does have<a name="line.383"></a> +<span class="sourceLineNo">384</span> * to do a real seek in cases when the seek timestamp is older than the<a name="line.384"></a> +<span class="sourceLineNo">385</span> * highest timestamp of the file, e.g. when we are trying to seek to the next<a name="line.385"></a> +<span class="sourceLineNo">386</span> * row/column and use OLDEST_TIMESTAMP in the seek key.<a name="line.386"></a> +<span class="sourceLineNo">387</span> */<a name="line.387"></a> +<span class="sourceLineNo">388</span> @Override<a name="line.388"></a> +<span class="sourceLineNo">389</span> public boolean requestSeek(Cell kv, boolean forward, boolean useBloom)<a name="line.389"></a> +<span class="sourceLineNo">390</span> throws IOException {<a name="line.390"></a> +<span class="sourceLineNo">391</span> if (kv.getFamilyLength() == 0) {<a name="line.391"></a> +<span class="sourceLineNo">392</span> useBloom = false;<a name="line.392"></a> +<span class="sourceLineNo">393</span> }<a name="line.393"></a> +<span class="sourceLineNo">394</span><a name="line.394"></a> +<span class="sourceLineNo">395</span> boolean haveToSeek = true;<a name="line.395"></a> +<span class="sourceLineNo">396</span> if (useBloom) {<a name="line.396"></a> +<span class="sourceLineNo">397</span> // check ROWCOL Bloom filter first.<a name="line.397"></a> +<span class="sourceLineNo">398</span> if (reader.getBloomFilterType() == BloomType.ROWCOL) {<a name="line.398"></a> +<span class="sourceLineNo">399</span> haveToSeek = reader.passesGeneralRowColBloomFilter(kv);<a name="line.399"></a> +<span class="sourceLineNo">400</span> } else if (canOptimizeForNonNullColumn<a name="line.400"></a> +<span class="sourceLineNo">401</span> && ((PrivateCellUtil.isDeleteFamily(kv)<a name="line.401"></a> +<span class="sourceLineNo">402</span> || PrivateCellUtil.isDeleteFamilyVersion(kv)))) {<a name="line.402"></a> +<span class="sourceLineNo">403</span> // if there is no such delete family kv in the store file,<a name="line.403"></a> +<span class="sourceLineNo">404</span> // then no need to seek.<a name="line.404"></a> +<span class="sourceLineNo">405</span> haveToSeek = reader.passesDeleteFamilyBloomFilter(kv.getRowArray(), kv.getRowOffset(),<a name="line.405"></a> +<span class="sourceLineNo">406</span> kv.getRowLength());<a name="line.406"></a> +<span class="sourceLineNo">407</span> }<a name="line.407"></a> +<span class="sourceLineNo">408</span> }<a name="line.408"></a> +<span class="sourceLineNo">409</span><a name="line.409"></a> +<span class="sourceLineNo">410</span> delayedReseek = forward;<a name="line.410"></a> +<span class="sourceLineNo">411</span> delayedSeekKV = kv;<a name="line.411"></a> +<span class="sourceLineNo">412</span><a name="line.412"></a> +<span class="sourceLineNo">413</span> if (haveToSeek) {<a name="line.413"></a> +<span class="sourceLineNo">414</span> // This row/column might be in this store file (or we did not use the<a name="line.414"></a> +<span class="sourceLineNo">415</span> // Bloom filter), so we still need to seek.<a name="line.415"></a> +<span class="sourceLineNo">416</span> realSeekDone = false;<a name="line.416"></a> +<span class="sourceLineNo">417</span> long maxTimestampInFile = reader.getMaxTimestamp();<a name="line.417"></a> +<span class="sourceLineNo">418</span> long seekTimestamp = kv.getTimestamp();<a name="line.418"></a> +<span class="sourceLineNo">419</span> if (seekTimestamp > maxTimestampInFile) {<a name="line.419"></a> +<span class="sourceLineNo">420</span> // Create a fake key that is not greater than the real next key.<a name="line.420"></a> +<span class="sourceLineNo">421</span> // (Lower timestamps correspond to higher KVs.)<a name="line.421"></a> +<span class="sourceLineNo">422</span> // To understand this better, consider that we are asked to seek to<a name="line.422"></a> +<span class="sourceLineNo">423</span> // a higher timestamp than the max timestamp in this file. We know that<a name="line.423"></a> +<span class="sourceLineNo">424</span> // the next point when we have to consider this file again is when we<a name="line.424"></a> +<span class="sourceLineNo">425</span> // pass the max timestamp of this file (with the same row/column).<a name="line.425"></a> +<span class="sourceLineNo">426</span> setCurrentCell(PrivateCellUtil.createFirstOnRowColTS(kv, maxTimestampInFile));<a name="line.426"></a> +<span class="sourceLineNo">427</span> } else {<a name="line.427"></a> +<span class="sourceLineNo">428</span> // This will be the case e.g. when we need to seek to the next<a name="line.428"></a> +<span class="sourceLineNo">429</span> // row/column, and we don't know exactly what they are, so we set the<a name="line.429"></a> +<span class="sourceLineNo">430</span> // seek key's timestamp to OLDEST_TIMESTAMP to skip the rest of this<a name="line.430"></a> +<span class="sourceLineNo">431</span> // row/column.<a name="line.431"></a> +<span class="sourceLineNo">432</span> enforceSeek();<a name="line.432"></a> +<span class="sourceLineNo">433</span> }<a name="line.433"></a> +<span class="sourceLineNo">434</span> return cur != null;<a name="line.434"></a> +<span class="sourceLineNo">435</span> }<a name="line.435"></a> +<span class="sourceLineNo">436</span><a name="line.436"></a> +<span class="sourceLineNo">437</span> // Multi-column Bloom filter optimization.<a name="line.437"></a> +<span class="sourceLineNo">438</span> // Create a fake key/value, so that this scanner only bubbles up to the top<a name="line.438"></a> +<span class="sourceLineNo">439</span> // of the KeyValueHeap in StoreScanner after we scanned this row/column in<a name="line.439"></a> +<span class="sourceLineNo">440</span> // all other store files. The query matcher will then just skip this fake<a name="line.440"></a> +<span class="sourceLineNo">441</span> // key/value and the store scanner will progress to the next column. This<a name="line.441"></a> +<span class="sourceLineNo">442</span> // is obviously not a "real real" seek, but unlike the fake KV earlier in<a name="line.442"></a> +<span class="sourceLineNo">443</span> // this method, we want this to be propagated to ScanQueryMatcher.<a name="line.443"></a> +<span class="sourceLineNo">444</span> setCurrentCell(PrivateCellUtil.createLastOnRowCol(kv));<a name="line.444"></a> +<span class="sourceLineNo">445</span><a name="line.445"></a> +<span class="sourceLineNo">446</span> realSeekDone = true;<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> StoreFileReader getReader() {<a name="line.450"></a> +<span class="sourceLineNo">451</span> return reader;<a name="line.451"></a> +<span class="sourceLineNo">452</span> }<a name="line.452"></a> +<span class="sourceLineNo">453</span><a name="line.453"></a> +<span class="sourceLineNo">454</span> CellComparator getComparator() {<a name="line.454"></a> +<span class="sourceLineNo">455</span> return reader.getComparator();<a name="line.455"></a> +<span class="sourceLineNo">456</span> }<a name="line.456"></a> +<span class="sourceLineNo">457</span><a name="line.457"></a> +<span class="sourceLineNo">458</span> @Override<a name="line.458"></a> +<span class="sourceLineNo">459</span> public boolean realSeekDone() {<a name="line.459"></a> +<span class="sourceLineNo">460</span> return realSeekDone;<a name="line.460"></a> +<span class="sourceLineNo">461</span> }<a name="line.461"></a> +<span class="sourceLineNo">462</span><a name="line.462"></a> +<span class="sourceLineNo">463</span> @Override<a name="line.463"></a> +<span class="sourceLineNo">464</span> public void enforceSeek() throws IOException {<a name="line.464"></a> +<span class="sourceLineNo">465</span> if (realSeekDone)<a name="line.465"></a> +<span class="sourceLineNo">466</span> return;<a name="line.466"></a> +<span class="sourceLineNo">467</span><a name="line.467"></a> +<span class="sourceLineNo">468</span> if (delayedReseek) {<a name="line.468"></a> +<span class="sourceLineNo">469</span> reseek(delayedSeekKV);<a name="line.469"></a> +<span class="sourceLineNo">470</span> } else {<a name="line.470"></a> +<span class="sourceLineNo">471</span> seek(delayedSeekKV);<a name="line.471"></a> +<span class="sourceLineNo">472</span> }<a name="line.472"></a> +<span class="sourceLineNo">473</span> }<a name="line.473"></a> +<span class="sourceLineNo">474</span><a name="line.474"></a> +<span class="sourceLineNo">475</span> @Override<a name="line.475"></a> +<span class="sourceLineNo">476</span> public boolean isFileScanner() {<a name="line.476"></a> +<span class="sourceLineNo">477</span> return true;<a name="line.477"></a> +<span class="sourceLineNo">478</span> }<a name="line.478"></a> +<span class="sourceLineNo">479</span><a name="line.479"></a> +<span class="sourceLineNo">480</span> @Override<a name="line.480"></a> +<span class="sourceLineNo">481</span> public Path getFilePath() {<a name="line.481"></a> +<span class="sourceLineNo">482</span> return reader.getHFileReader().getPath();<a name="line.482"></a> +<span class="sourceLineNo">483</span> }<a name="line.483"></a> +<span class="sourceLineNo">484</span><a name="line.484"></a> +<span class="sourceLineNo">485</span> // Test methods<a name="line.485"></a> +<span class="sourceLineNo">486</span> static final long getSeekCount() {<a name="line.486"></a> +<span class="sourceLineNo">487</span> return seekCount.sum();<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> static final void instrument() {<a name="line.490"></a> +<span class="sourceLineNo">491</span> seekCount = new LongAdder();<a name="line.491"></a> +<span class="sourceLineNo">492</span> }<a name="line.492"></a> +<span class="sourceLineNo">493</span><a name="line.493"></a> +<span class="sourceLineNo">494</span> @Override<a name="line.494"></a> +<span class="sourceLineNo">495</span> public boolean shouldUseScanner(Scan scan, HStore store, long oldestUnexpiredTS) {<a name="line.495"></a> +<span class="sourceLineNo">496</span> // if the file has no entries, no need to validate or create a scanner.<a name="line.496"></a> +<span class="sourceLineNo">497</span> byte[] cf = store.getColumnFamilyDescriptor().getName();<a name="line.497"></a> +<span class="sourceLineNo">498</span> TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.498"></a> +<span class="sourceLineNo">499</span> if (timeRange == null) {<a name="line.499"></a> +<span class="sourceLineNo">500</span> timeRange = scan.getTimeRange();<a name="line.500"></a> +<span class="sourceLineNo">501</span> }<a name="line.501"></a> +<span class="sourceLineNo">502</span> return reader.passesTimerangeFilter(timeRange, oldestUnexpiredTS) && reader<a name="line.502"></a> +<span class="sourceLineNo">503</span> .passesKeyRangeFilter(scan) && reader.passesBloomFilter(scan, scan.getFamilyMap().get(cf));<a name="line.503"></a> +<span class="sourceLineNo">504</span> }<a name="line.504"></a> +<span class="sourceLineNo">505</span><a name="line.505"></a> +<span class="sourceLineNo">506</span> @Override<a name="line.506"></a> +<span class="sourceLineNo">507</span> public boolean seekToPreviousRow(Cell originalKey) throws IOException {<a name="line.507"></a> +<span class="sourceLineNo">508</span> try {<a name="line.508"></a> +<span class="sourceLineNo">509</span> try {<a name="line.509"></a> +<span class="sourceLineNo">510</span> boolean keepSeeking = false;<a name="line.510"></a> +<span class="sourceLineNo">511</span> Cell key = originalKey;<a name="line.511"></a> +<span class="sourceLineNo">512</span> do {<a name="line.512"></a> +<span class="sourceLineNo">513</span> Cell seekKey = PrivateCellUtil.createFirstOnRow(key);<a name="line.513"></a> +<span class="sourceLineNo">514</span> if (seekCount != null) seekCount.increment();<a name="line.514"></a> +<span class="sourceLineNo">515</span> if (!hfs.seekBefore(seekKey)) {<a name="line.515"></a> +<span class="sourceLineNo">516</span> this.cur = null;<a name="line.516"></a> +<span class="sourceLineNo">517</span> return false;<a name="line.517"></a> +<span class="sourceLineNo">518</span> }<a name="line.518"></a> +<span class="sourceLineNo">519</span> Cell curCell = hfs.getCell();<a name="line.519"></a> +<span class="sourceLineNo">520</span> Cell firstKeyOfPreviousRow = PrivateCellUtil.createFirstOnRow(curCell);<a name="line.520"></a> +<span class="sourceLineNo">521</span><a name="line.521"></a> +<span class="sourceLineNo">522</span> if (seekCount != null) seekCount.increment();<a name="line.522"></a> +<span class="sourceLineNo">523</span> if (!seekAtOrAfter(hfs, firstKeyOfPreviousRow)) {<a name="line.523"></a> +<span class="sourceLineNo">524</span> this.cur = null;<a name="line.524"></a> +<span class="sourceLineNo">525</span> return false;<a name="line.525"></a> +<span class="sourceLineNo">526</span> }<a name="line.526"></a> +<span class="sourceLineNo">527</span><a name="line.527"></a> +<span class="sourceLineNo">528</span> setCurrentCell(hfs.getCell());<a name="line.528"></a> +<span class="sourceLineNo">529</span> this.stopSkippingKVsIfNextRow = true;<a name="line.529"></a> +<span class="sourceLineNo">530</span> boolean resultOfSkipKVs;<a name="line.530"></a> +<span class="sourceLineNo">531</span> try {<a name="line.531"></a> +<span class="sourceLineNo">532</span> resultOfSkipKVs = skipKVsNewerThanReadpoint();<a name="line.532"></a> +<span class="sourceLineNo">533</span> } finally {<a name="line.533"></a> +<span class="sourceLineNo">534</span> this.stopSkippingKVsIfNextRow = false;<a name="line.534"></a> +<span class="sourceLineNo">535</span> }<a name="line.535"></a> +<span class="sourceLineNo">536</span> if (!resultOfSkipKVs<a name="line.536"></a> +<span class="sourceLineNo">537</span> || getComparator().compareRows(cur, firstKeyOfPreviousRow) > 0) {<a name="line.537"></a> +<span class="sourceLineNo">538</span> keepSeeking = true;<a name="line.538"></a> +<span class="sourceLineNo">539</span> key = firstKeyOfPreviousRow;<a name="line.539"></a> +<span class="sourceLineNo">540</span> continue;<a name="line.540"></a> +<span class="sourceLineNo">541</span> } else {<a name="line.541"></a> +<span class="sourceLineNo">542</span> keepSeeking = false;<a name="line.542"></a> +<span class="sourceLineNo">543</span> }<a name="line.543"></a> +<span class="sourceLineNo">544</span> } while (keepSeeking);<a name="line.544"></a> +<span class="sourceLineNo">545</span> return true;<a name="line.545"></a> +<span class="sourceLineNo">546</span> } finally {<a name="line.546"></a> +<span class="sourceLineNo">547</span> realSeekDone = true;<a name="line.547"></a> +<span class="sourceLineNo">548</span> }<a name="line.548"></a> +<span class="sourceLineNo">549</span> } catch (FileNotFoundException e) {<a name="line.549"></a> +<span class="sourceLineNo">550</span> throw e;<a name="line.550"></a> +<span class="sourceLineNo">551</span> } catch (IOException ioe) {<a name="line.551"></a> +<span class="sourceLineNo">552</span> throw new IOException("Could not seekToPreviousRow " + this + " to key "<a name="line.552"></a> +<span class="sourceLineNo">553</span> + originalKey, ioe);<a name="line.553"></a> +<span class="sourceLineNo">554</span> }<a name="line.554"></a> +<span class="sourceLineNo">555</span> }<a name="line.555"></a> +<span class="sourceL
<TRUNCATED>
