You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2018/12/25 14:50:55 UTC
[23/29] hbase-site git commit: Published site at
44dec60054d1c45880d591c74a023f7a534e6d73.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/70f4ddbc/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html
index 13b467d..3a6b771 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html
@@ -411,769 +411,775 @@
<span class="sourceLineNo">403</span> }<a name="line.403"></a>
<span class="sourceLineNo">404</span> }<a name="line.404"></a>
<span class="sourceLineNo">405</span><a name="line.405"></a>
-<span class="sourceLineNo">406</span> protected void resetKVHeap(List<? extends KeyValueScanner> scanners,<a name="line.406"></a>
-<span class="sourceLineNo">407</span> CellComparator comparator) throws IOException {<a name="line.407"></a>
-<span class="sourceLineNo">408</span> // Combine all seeked scanners with a heap<a name="line.408"></a>
-<span class="sourceLineNo">409</span> heap = new KeyValueHeap(scanners, comparator);<a name="line.409"></a>
-<span class="sourceLineNo">410</span> }<a name="line.410"></a>
-<span class="sourceLineNo">411</span><a name="line.411"></a>
-<span class="sourceLineNo">412</span> /**<a name="line.412"></a>
-<span class="sourceLineNo">413</span> * Filters the given list of scanners using Bloom filter, time range, and TTL.<a name="line.413"></a>
-<span class="sourceLineNo">414</span> * <p><a name="line.414"></a>
-<span class="sourceLineNo">415</span> * Will be overridden by testcase so declared as protected.<a name="line.415"></a>
-<span class="sourceLineNo">416</span> */<a name="line.416"></a>
-<span class="sourceLineNo">417</span> @VisibleForTesting<a name="line.417"></a>
-<span class="sourceLineNo">418</span> protected List<KeyValueScanner> selectScannersFrom(HStore store,<a name="line.418"></a>
-<span class="sourceLineNo">419</span> List<? extends KeyValueScanner> allScanners) {<a name="line.419"></a>
-<span class="sourceLineNo">420</span> boolean memOnly;<a name="line.420"></a>
-<span class="sourceLineNo">421</span> boolean filesOnly;<a name="line.421"></a>
-<span class="sourceLineNo">422</span> if (scan instanceof InternalScan) {<a name="line.422"></a>
-<span class="sourceLineNo">423</span> InternalScan iscan = (InternalScan) scan;<a name="line.423"></a>
-<span class="sourceLineNo">424</span> memOnly = iscan.isCheckOnlyMemStore();<a name="line.424"></a>
-<span class="sourceLineNo">425</span> filesOnly = iscan.isCheckOnlyStoreFiles();<a name="line.425"></a>
-<span class="sourceLineNo">426</span> } else {<a name="line.426"></a>
-<span class="sourceLineNo">427</span> memOnly = false;<a name="line.427"></a>
-<span class="sourceLineNo">428</span> filesOnly = false;<a name="line.428"></a>
-<span class="sourceLineNo">429</span> }<a name="line.429"></a>
-<span class="sourceLineNo">430</span><a name="line.430"></a>
-<span class="sourceLineNo">431</span> List<KeyValueScanner> scanners = new ArrayList<>(allScanners.size());<a name="line.431"></a>
-<span class="sourceLineNo">432</span><a name="line.432"></a>
-<span class="sourceLineNo">433</span> // We can only exclude store files based on TTL if minVersions is set to 0.<a name="line.433"></a>
-<span class="sourceLineNo">434</span> // Otherwise, we might have to return KVs that have technically expired.<a name="line.434"></a>
-<span class="sourceLineNo">435</span> long expiredTimestampCutoff = minVersions == 0 ? oldestUnexpiredTS : Long.MIN_VALUE;<a name="line.435"></a>
+<span class="sourceLineNo">406</span> @VisibleForTesting<a name="line.406"></a>
+<span class="sourceLineNo">407</span> protected void resetKVHeap(List<? extends KeyValueScanner> scanners,<a name="line.407"></a>
+<span class="sourceLineNo">408</span> CellComparator comparator) throws IOException {<a name="line.408"></a>
+<span class="sourceLineNo">409</span> // Combine all seeked scanners with a heap<a name="line.409"></a>
+<span class="sourceLineNo">410</span> heap = newKVHeap(scanners, comparator);<a name="line.410"></a>
+<span class="sourceLineNo">411</span> }<a name="line.411"></a>
+<span class="sourceLineNo">412</span><a name="line.412"></a>
+<span class="sourceLineNo">413</span> protected KeyValueHeap newKVHeap(List<? extends KeyValueScanner> scanners,<a name="line.413"></a>
+<span class="sourceLineNo">414</span> CellComparator comparator) throws IOException {<a name="line.414"></a>
+<span class="sourceLineNo">415</span> return new KeyValueHeap(scanners, comparator);<a name="line.415"></a>
+<span class="sourceLineNo">416</span> }<a name="line.416"></a>
+<span class="sourceLineNo">417</span><a name="line.417"></a>
+<span class="sourceLineNo">418</span> /**<a name="line.418"></a>
+<span class="sourceLineNo">419</span> * Filters the given list of scanners using Bloom filter, time range, and TTL.<a name="line.419"></a>
+<span class="sourceLineNo">420</span> * <p><a name="line.420"></a>
+<span class="sourceLineNo">421</span> * Will be overridden by testcase so declared as protected.<a name="line.421"></a>
+<span class="sourceLineNo">422</span> */<a name="line.422"></a>
+<span class="sourceLineNo">423</span> @VisibleForTesting<a name="line.423"></a>
+<span class="sourceLineNo">424</span> protected List<KeyValueScanner> selectScannersFrom(HStore store,<a name="line.424"></a>
+<span class="sourceLineNo">425</span> List<? extends KeyValueScanner> allScanners) {<a name="line.425"></a>
+<span class="sourceLineNo">426</span> boolean memOnly;<a name="line.426"></a>
+<span class="sourceLineNo">427</span> boolean filesOnly;<a name="line.427"></a>
+<span class="sourceLineNo">428</span> if (scan instanceof InternalScan) {<a name="line.428"></a>
+<span class="sourceLineNo">429</span> InternalScan iscan = (InternalScan) scan;<a name="line.429"></a>
+<span class="sourceLineNo">430</span> memOnly = iscan.isCheckOnlyMemStore();<a name="line.430"></a>
+<span class="sourceLineNo">431</span> filesOnly = iscan.isCheckOnlyStoreFiles();<a name="line.431"></a>
+<span class="sourceLineNo">432</span> } else {<a name="line.432"></a>
+<span class="sourceLineNo">433</span> memOnly = false;<a name="line.433"></a>
+<span class="sourceLineNo">434</span> filesOnly = false;<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> // include only those scan files which pass all filters<a name="line.437"></a>
-<span class="sourceLineNo">438</span> for (KeyValueScanner kvs : allScanners) {<a name="line.438"></a>
-<span class="sourceLineNo">439</span> boolean isFile = kvs.isFileScanner();<a name="line.439"></a>
-<span class="sourceLineNo">440</span> if ((!isFile && filesOnly) || (isFile && memOnly)) {<a name="line.440"></a>
-<span class="sourceLineNo">441</span> continue;<a name="line.441"></a>
-<span class="sourceLineNo">442</span> }<a name="line.442"></a>
-<span class="sourceLineNo">443</span><a name="line.443"></a>
-<span class="sourceLineNo">444</span> if (kvs.shouldUseScanner(scan, store, expiredTimestampCutoff)) {<a name="line.444"></a>
-<span class="sourceLineNo">445</span> scanners.add(kvs);<a name="line.445"></a>
-<span class="sourceLineNo">446</span> } else {<a name="line.446"></a>
-<span class="sourceLineNo">447</span> kvs.close();<a name="line.447"></a>
+<span class="sourceLineNo">437</span> List<KeyValueScanner> scanners = new ArrayList<>(allScanners.size());<a name="line.437"></a>
+<span class="sourceLineNo">438</span><a name="line.438"></a>
+<span class="sourceLineNo">439</span> // We can only exclude store files based on TTL if minVersions is set to 0.<a name="line.439"></a>
+<span class="sourceLineNo">440</span> // Otherwise, we might have to return KVs that have technically expired.<a name="line.440"></a>
+<span class="sourceLineNo">441</span> long expiredTimestampCutoff = minVersions == 0 ? oldestUnexpiredTS : Long.MIN_VALUE;<a name="line.441"></a>
+<span class="sourceLineNo">442</span><a name="line.442"></a>
+<span class="sourceLineNo">443</span> // include only those scan files which pass all filters<a name="line.443"></a>
+<span class="sourceLineNo">444</span> for (KeyValueScanner kvs : allScanners) {<a name="line.444"></a>
+<span class="sourceLineNo">445</span> boolean isFile = kvs.isFileScanner();<a name="line.445"></a>
+<span class="sourceLineNo">446</span> if ((!isFile && filesOnly) || (isFile && memOnly)) {<a name="line.446"></a>
+<span class="sourceLineNo">447</span> continue;<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> return scanners;<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> @Override<a name="line.453"></a>
-<span class="sourceLineNo">454</span> public Cell peek() {<a name="line.454"></a>
-<span class="sourceLineNo">455</span> return heap != null ? heap.peek() : null;<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 KeyValue next() {<a name="line.459"></a>
-<span class="sourceLineNo">460</span> // throw runtime exception perhaps?<a name="line.460"></a>
-<span class="sourceLineNo">461</span> throw new RuntimeException("Never call StoreScanner.next()");<a name="line.461"></a>
+<span class="sourceLineNo">449</span><a name="line.449"></a>
+<span class="sourceLineNo">450</span> if (kvs.shouldUseScanner(scan, store, expiredTimestampCutoff)) {<a name="line.450"></a>
+<span class="sourceLineNo">451</span> scanners.add(kvs);<a name="line.451"></a>
+<span class="sourceLineNo">452</span> } else {<a name="line.452"></a>
+<span class="sourceLineNo">453</span> kvs.close();<a name="line.453"></a>
+<span class="sourceLineNo">454</span> }<a name="line.454"></a>
+<span class="sourceLineNo">455</span> }<a name="line.455"></a>
+<span class="sourceLineNo">456</span> return scanners;<a name="line.456"></a>
+<span class="sourceLineNo">457</span> }<a name="line.457"></a>
+<span class="sourceLineNo">458</span><a name="line.458"></a>
+<span class="sourceLineNo">459</span> @Override<a name="line.459"></a>
+<span class="sourceLineNo">460</span> public Cell peek() {<a name="line.460"></a>
+<span class="sourceLineNo">461</span> return heap != null ? heap.peek() : null;<a name="line.461"></a>
<span class="sourceLineNo">462</span> }<a name="line.462"></a>
<span class="sourceLineNo">463</span><a name="line.463"></a>
<span class="sourceLineNo">464</span> @Override<a name="line.464"></a>
-<span class="sourceLineNo">465</span> public void close() {<a name="line.465"></a>
-<span class="sourceLineNo">466</span> close(true);<a name="line.466"></a>
-<span class="sourceLineNo">467</span> }<a name="line.467"></a>
-<span class="sourceLineNo">468</span><a name="line.468"></a>
-<span class="sourceLineNo">469</span> private void close(boolean withDelayedScannersClose) {<a name="line.469"></a>
-<span class="sourceLineNo">470</span> if (this.closing) {<a name="line.470"></a>
-<span class="sourceLineNo">471</span> return;<a name="line.471"></a>
-<span class="sourceLineNo">472</span> }<a name="line.472"></a>
-<span class="sourceLineNo">473</span> if (withDelayedScannersClose) {<a name="line.473"></a>
-<span class="sourceLineNo">474</span> this.closing = true;<a name="line.474"></a>
-<span class="sourceLineNo">475</span> }<a name="line.475"></a>
-<span class="sourceLineNo">476</span> // For mob compaction, we do not have a store.<a name="line.476"></a>
-<span class="sourceLineNo">477</span> if (this.store != null) {<a name="line.477"></a>
-<span class="sourceLineNo">478</span> this.store.deleteChangedReaderObserver(this);<a name="line.478"></a>
-<span class="sourceLineNo">479</span> }<a name="line.479"></a>
-<span class="sourceLineNo">480</span> if (withDelayedScannersClose) {<a name="line.480"></a>
-<span class="sourceLineNo">481</span> clearAndClose(scannersForDelayedClose);<a name="line.481"></a>
-<span class="sourceLineNo">482</span> clearAndClose(memStoreScannersAfterFlush);<a name="line.482"></a>
-<span class="sourceLineNo">483</span> clearAndClose(flushedstoreFileScanners);<a name="line.483"></a>
-<span class="sourceLineNo">484</span> if (this.heap != null) {<a name="line.484"></a>
-<span class="sourceLineNo">485</span> this.heap.close();<a name="line.485"></a>
-<span class="sourceLineNo">486</span> this.currentScanners.clear();<a name="line.486"></a>
-<span class="sourceLineNo">487</span> this.heap = null; // CLOSED!<a name="line.487"></a>
-<span class="sourceLineNo">488</span> }<a name="line.488"></a>
-<span class="sourceLineNo">489</span> } else {<a name="line.489"></a>
+<span class="sourceLineNo">465</span> public KeyValue next() {<a name="line.465"></a>
+<span class="sourceLineNo">466</span> // throw runtime exception perhaps?<a name="line.466"></a>
+<span class="sourceLineNo">467</span> throw new RuntimeException("Never call StoreScanner.next()");<a name="line.467"></a>
+<span class="sourceLineNo">468</span> }<a name="line.468"></a>
+<span class="sourceLineNo">469</span><a name="line.469"></a>
+<span class="sourceLineNo">470</span> @Override<a name="line.470"></a>
+<span class="sourceLineNo">471</span> public void close() {<a name="line.471"></a>
+<span class="sourceLineNo">472</span> close(true);<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> private void close(boolean withDelayedScannersClose) {<a name="line.475"></a>
+<span class="sourceLineNo">476</span> if (this.closing) {<a name="line.476"></a>
+<span class="sourceLineNo">477</span> return;<a name="line.477"></a>
+<span class="sourceLineNo">478</span> }<a name="line.478"></a>
+<span class="sourceLineNo">479</span> if (withDelayedScannersClose) {<a name="line.479"></a>
+<span class="sourceLineNo">480</span> this.closing = true;<a name="line.480"></a>
+<span class="sourceLineNo">481</span> }<a name="line.481"></a>
+<span class="sourceLineNo">482</span> // For mob compaction, we do not have a store.<a name="line.482"></a>
+<span class="sourceLineNo">483</span> if (this.store != null) {<a name="line.483"></a>
+<span class="sourceLineNo">484</span> this.store.deleteChangedReaderObserver(this);<a name="line.484"></a>
+<span class="sourceLineNo">485</span> }<a name="line.485"></a>
+<span class="sourceLineNo">486</span> if (withDelayedScannersClose) {<a name="line.486"></a>
+<span class="sourceLineNo">487</span> clearAndClose(scannersForDelayedClose);<a name="line.487"></a>
+<span class="sourceLineNo">488</span> clearAndClose(memStoreScannersAfterFlush);<a name="line.488"></a>
+<span class="sourceLineNo">489</span> clearAndClose(flushedstoreFileScanners);<a name="line.489"></a>
<span class="sourceLineNo">490</span> if (this.heap != null) {<a name="line.490"></a>
-<span class="sourceLineNo">491</span> this.scannersForDelayedClose.add(this.heap);<a name="line.491"></a>
+<span class="sourceLineNo">491</span> this.heap.close();<a name="line.491"></a>
<span class="sourceLineNo">492</span> this.currentScanners.clear();<a name="line.492"></a>
-<span class="sourceLineNo">493</span> this.heap = null;<a name="line.493"></a>
+<span class="sourceLineNo">493</span> this.heap = null; // CLOSED!<a name="line.493"></a>
<span class="sourceLineNo">494</span> }<a name="line.494"></a>
-<span class="sourceLineNo">495</span> }<a name="line.495"></a>
-<span class="sourceLineNo">496</span> }<a name="line.496"></a>
-<span class="sourceLineNo">497</span><a name="line.497"></a>
-<span class="sourceLineNo">498</span> @Override<a name="line.498"></a>
-<span class="sourceLineNo">499</span> public boolean seek(Cell key) throws IOException {<a name="line.499"></a>
-<span class="sourceLineNo">500</span> if (checkFlushed()) {<a name="line.500"></a>
-<span class="sourceLineNo">501</span> reopenAfterFlush();<a name="line.501"></a>
-<span class="sourceLineNo">502</span> }<a name="line.502"></a>
-<span class="sourceLineNo">503</span> return this.heap.seek(key);<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> /**<a name="line.506"></a>
-<span class="sourceLineNo">507</span> * Get the next row of values from this Store.<a name="line.507"></a>
-<span class="sourceLineNo">508</span> * @param outResult<a name="line.508"></a>
-<span class="sourceLineNo">509</span> * @param scannerContext<a name="line.509"></a>
-<span class="sourceLineNo">510</span> * @return true if there are more rows, false if scanner is done<a name="line.510"></a>
-<span class="sourceLineNo">511</span> */<a name="line.511"></a>
-<span class="sourceLineNo">512</span> @Override<a name="line.512"></a>
-<span class="sourceLineNo">513</span> public boolean next(List<Cell> outResult, ScannerContext scannerContext) throws IOException {<a name="line.513"></a>
-<span class="sourceLineNo">514</span> if (scannerContext == null) {<a name="line.514"></a>
-<span class="sourceLineNo">515</span> throw new IllegalArgumentException("Scanner context cannot be null");<a name="line.515"></a>
-<span class="sourceLineNo">516</span> }<a name="line.516"></a>
-<span class="sourceLineNo">517</span> if (checkFlushed() && reopenAfterFlush()) {<a name="line.517"></a>
-<span class="sourceLineNo">518</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.518"></a>
-<span class="sourceLineNo">519</span> }<a name="line.519"></a>
-<span class="sourceLineNo">520</span><a name="line.520"></a>
-<span class="sourceLineNo">521</span> // if the heap was left null, then the scanners had previously run out anyways, close and<a name="line.521"></a>
-<span class="sourceLineNo">522</span> // return.<a name="line.522"></a>
-<span class="sourceLineNo">523</span> if (this.heap == null) {<a name="line.523"></a>
-<span class="sourceLineNo">524</span> // By this time partial close should happened because already heap is null<a name="line.524"></a>
-<span class="sourceLineNo">525</span> close(false);// Do all cleanup except heap.close()<a name="line.525"></a>
-<span class="sourceLineNo">526</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.526"></a>
-<span class="sourceLineNo">527</span> }<a name="line.527"></a>
-<span class="sourceLineNo">528</span><a name="line.528"></a>
-<span class="sourceLineNo">529</span> Cell cell = this.heap.peek();<a name="line.529"></a>
-<span class="sourceLineNo">530</span> if (cell == null) {<a name="line.530"></a>
+<span class="sourceLineNo">495</span> } else {<a name="line.495"></a>
+<span class="sourceLineNo">496</span> if (this.heap != null) {<a name="line.496"></a>
+<span class="sourceLineNo">497</span> this.scannersForDelayedClose.add(this.heap);<a name="line.497"></a>
+<span class="sourceLineNo">498</span> this.currentScanners.clear();<a name="line.498"></a>
+<span class="sourceLineNo">499</span> this.heap = null;<a name="line.499"></a>
+<span class="sourceLineNo">500</span> }<a name="line.500"></a>
+<span class="sourceLineNo">501</span> }<a name="line.501"></a>
+<span class="sourceLineNo">502</span> }<a name="line.502"></a>
+<span class="sourceLineNo">503</span><a name="line.503"></a>
+<span class="sourceLineNo">504</span> @Override<a name="line.504"></a>
+<span class="sourceLineNo">505</span> public boolean seek(Cell key) throws IOException {<a name="line.505"></a>
+<span class="sourceLineNo">506</span> if (checkFlushed()) {<a name="line.506"></a>
+<span class="sourceLineNo">507</span> reopenAfterFlush();<a name="line.507"></a>
+<span class="sourceLineNo">508</span> }<a name="line.508"></a>
+<span class="sourceLineNo">509</span> return this.heap.seek(key);<a name="line.509"></a>
+<span class="sourceLineNo">510</span> }<a name="line.510"></a>
+<span class="sourceLineNo">511</span><a name="line.511"></a>
+<span class="sourceLineNo">512</span> /**<a name="line.512"></a>
+<span class="sourceLineNo">513</span> * Get the next row of values from this Store.<a name="line.513"></a>
+<span class="sourceLineNo">514</span> * @param outResult<a name="line.514"></a>
+<span class="sourceLineNo">515</span> * @param scannerContext<a name="line.515"></a>
+<span class="sourceLineNo">516</span> * @return true if there are more rows, false if scanner is done<a name="line.516"></a>
+<span class="sourceLineNo">517</span> */<a name="line.517"></a>
+<span class="sourceLineNo">518</span> @Override<a name="line.518"></a>
+<span class="sourceLineNo">519</span> public boolean next(List<Cell> outResult, ScannerContext scannerContext) throws IOException {<a name="line.519"></a>
+<span class="sourceLineNo">520</span> if (scannerContext == null) {<a name="line.520"></a>
+<span class="sourceLineNo">521</span> throw new IllegalArgumentException("Scanner context cannot be null");<a name="line.521"></a>
+<span class="sourceLineNo">522</span> }<a name="line.522"></a>
+<span class="sourceLineNo">523</span> if (checkFlushed() && reopenAfterFlush()) {<a name="line.523"></a>
+<span class="sourceLineNo">524</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<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> // if the heap was left null, then the scanners had previously run out anyways, close and<a name="line.527"></a>
+<span class="sourceLineNo">528</span> // return.<a name="line.528"></a>
+<span class="sourceLineNo">529</span> if (this.heap == null) {<a name="line.529"></a>
+<span class="sourceLineNo">530</span> // By this time partial close should happened because already heap is null<a name="line.530"></a>
<span class="sourceLineNo">531</span> close(false);// Do all cleanup except heap.close()<a name="line.531"></a>
<span class="sourceLineNo">532</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.532"></a>
<span class="sourceLineNo">533</span> }<a name="line.533"></a>
<span class="sourceLineNo">534</span><a name="line.534"></a>
-<span class="sourceLineNo">535</span> // only call setRow if the row changes; avoids confusing the query matcher<a name="line.535"></a>
-<span class="sourceLineNo">536</span> // if scanning intra-row<a name="line.536"></a>
-<span class="sourceLineNo">537</span><a name="line.537"></a>
-<span class="sourceLineNo">538</span> // If no limits exists in the scope LimitScope.Between_Cells then we are sure we are changing<a name="line.538"></a>
-<span class="sourceLineNo">539</span> // rows. Else it is possible we are still traversing the same row so we must perform the row<a name="line.539"></a>
-<span class="sourceLineNo">540</span> // comparison.<a name="line.540"></a>
-<span class="sourceLineNo">541</span> if (!scannerContext.hasAnyLimit(LimitScope.BETWEEN_CELLS) || matcher.currentRow() == null) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span> this.countPerRow = 0;<a name="line.542"></a>
-<span class="sourceLineNo">543</span> matcher.setToNewRow(cell);<a name="line.543"></a>
-<span class="sourceLineNo">544</span> }<a name="line.544"></a>
-<span class="sourceLineNo">545</span><a name="line.545"></a>
-<span class="sourceLineNo">546</span> // Clear progress away unless invoker has indicated it should be kept.<a name="line.546"></a>
-<span class="sourceLineNo">547</span> if (!scannerContext.getKeepProgress()) {<a name="line.547"></a>
-<span class="sourceLineNo">548</span> scannerContext.clearProgress();<a name="line.548"></a>
-<span class="sourceLineNo">549</span> }<a name="line.549"></a>
-<span class="sourceLineNo">550</span><a name="line.550"></a>
-<span class="sourceLineNo">551</span> int count = 0;<a name="line.551"></a>
-<span class="sourceLineNo">552</span> long totalBytesRead = 0;<a name="line.552"></a>
-<span class="sourceLineNo">553</span><a name="line.553"></a>
-<span class="sourceLineNo">554</span> LOOP: do {<a name="line.554"></a>
-<span class="sourceLineNo">555</span> // Update and check the time limit based on the configured value of cellsPerTimeoutCheck<a name="line.555"></a>
-<span class="sourceLineNo">556</span> // Or if the preadMaxBytes is reached and we may want to return so we can switch to stream in<a name="line.556"></a>
-<span class="sourceLineNo">557</span> // the shipped method below.<a name="line.557"></a>
-<span class="sourceLineNo">558</span> if (kvsScanned % cellsPerHeartbeatCheck == 0 || (scanUsePread &&<a name="line.558"></a>
-<span class="sourceLineNo">559</span> readType == Scan.ReadType.DEFAULT && bytesRead > preadMaxBytes)) {<a name="line.559"></a>
-<span class="sourceLineNo">560</span> if (scannerContext.checkTimeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.560"></a>
-<span class="sourceLineNo">561</span> return scannerContext.setScannerState(NextState.TIME_LIMIT_REACHED).hasMoreValues();<a name="line.561"></a>
-<span class="sourceLineNo">562</span> }<a name="line.562"></a>
-<span class="sourceLineNo">563</span> }<a name="line.563"></a>
-<span class="sourceLineNo">564</span> // Do object compare - we set prevKV from the same heap.<a name="line.564"></a>
-<span class="sourceLineNo">565</span> if (prevCell != cell) {<a name="line.565"></a>
-<span class="sourceLineNo">566</span> ++kvsScanned;<a name="line.566"></a>
-<span class="sourceLineNo">567</span> }<a name="line.567"></a>
-<span class="sourceLineNo">568</span> checkScanOrder(prevCell, cell, comparator);<a name="line.568"></a>
-<span class="sourceLineNo">569</span> int cellSize = PrivateCellUtil.estimatedSerializedSizeOf(cell);<a name="line.569"></a>
-<span class="sourceLineNo">570</span> bytesRead += cellSize;<a name="line.570"></a>
-<span class="sourceLineNo">571</span> if (scanUsePread && readType == Scan.ReadType.DEFAULT &&<a name="line.571"></a>
-<span class="sourceLineNo">572</span> bytesRead > preadMaxBytes) {<a name="line.572"></a>
-<span class="sourceLineNo">573</span> // return immediately if we want to switch from pread to stream. We need this because we can<a name="line.573"></a>
-<span class="sourceLineNo">574</span> // only switch in the shipped method, if user use a filter to filter out everything and rpc<a name="line.574"></a>
-<span class="sourceLineNo">575</span> // timeout is very large then the shipped method will never be called until the whole scan<a name="line.575"></a>
-<span class="sourceLineNo">576</span> // is finished, but at that time we have already scan all the data...<a name="line.576"></a>
-<span class="sourceLineNo">577</span> // See HBASE-20457 for more details.<a name="line.577"></a>
-<span class="sourceLineNo">578</span> // And there is still a scenario that can not be handled. If we have a very large row, which<a name="line.578"></a>
-<span class="sourceLineNo">579</span> // have millions of qualifiers, and filter.filterRow is used, then even if we set the flag<a name="line.579"></a>
-<span class="sourceLineNo">580</span> // here, we still need to scan all the qualifiers before returning...<a name="line.580"></a>
-<span class="sourceLineNo">581</span> scannerContext.returnImmediately();<a name="line.581"></a>
-<span class="sourceLineNo">582</span> }<a name="line.582"></a>
-<span class="sourceLineNo">583</span> prevCell = cell;<a name="line.583"></a>
-<span class="sourceLineNo">584</span> scannerContext.setLastPeekedCell(cell);<a name="line.584"></a>
-<span class="sourceLineNo">585</span> topChanged = false;<a name="line.585"></a>
-<span class="sourceLineNo">586</span> ScanQueryMatcher.MatchCode qcode = matcher.match(cell);<a name="line.586"></a>
-<span class="sourceLineNo">587</span> switch (qcode) {<a name="line.587"></a>
-<span class="sourceLineNo">588</span> case INCLUDE:<a name="line.588"></a>
-<span class="sourceLineNo">589</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.589"></a>
-<span class="sourceLineNo">590</span> case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.590"></a>
-<span class="sourceLineNo">591</span><a name="line.591"></a>
-<span class="sourceLineNo">592</span> Filter f = matcher.getFilter();<a name="line.592"></a>
-<span class="sourceLineNo">593</span> if (f != null) {<a name="line.593"></a>
-<span class="sourceLineNo">594</span> cell = f.transformCell(cell);<a name="line.594"></a>
-<span class="sourceLineNo">595</span> }<a name="line.595"></a>
-<span class="sourceLineNo">596</span><a name="line.596"></a>
-<span class="sourceLineNo">597</span> this.countPerRow++;<a name="line.597"></a>
-<span class="sourceLineNo">598</span> if (storeLimit > -1 && this.countPerRow > (storeLimit + storeOffset)) {<a name="line.598"></a>
-<span class="sourceLineNo">599</span> // do what SEEK_NEXT_ROW does.<a name="line.599"></a>
-<span class="sourceLineNo">600</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.600"></a>
-<span class="sourceLineNo">601</span> close(false);// Do all cleanup except heap.close()<a name="line.601"></a>
-<span class="sourceLineNo">602</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.602"></a>
-<span class="sourceLineNo">603</span> }<a name="line.603"></a>
-<span class="sourceLineNo">604</span> matcher.clearCurrentRow();<a name="line.604"></a>
-<span class="sourceLineNo">605</span> seekToNextRow(cell);<a name="line.605"></a>
-<span class="sourceLineNo">606</span> break LOOP;<a name="line.606"></a>
-<span class="sourceLineNo">607</span> }<a name="line.607"></a>
-<span class="sourceLineNo">608</span><a name="line.608"></a>
-<span class="sourceLineNo">609</span> // add to results only if we have skipped #storeOffset kvs<a name="line.609"></a>
-<span class="sourceLineNo">610</span> // also update metric accordingly<a name="line.610"></a>
-<span class="sourceLineNo">611</span> if (this.countPerRow > storeOffset) {<a name="line.611"></a>
-<span class="sourceLineNo">612</span> outResult.add(cell);<a name="line.612"></a>
-<span class="sourceLineNo">613</span><a name="line.613"></a>
-<span class="sourceLineNo">614</span> // Update local tracking information<a name="line.614"></a>
-<span class="sourceLineNo">615</span> count++;<a name="line.615"></a>
-<span class="sourceLineNo">616</span> totalBytesRead += cellSize;<a name="line.616"></a>
-<span class="sourceLineNo">617</span><a name="line.617"></a>
-<span class="sourceLineNo">618</span> // Update the progress of the scanner context<a name="line.618"></a>
-<span class="sourceLineNo">619</span> scannerContext.incrementSizeProgress(cellSize,<a name="line.619"></a>
-<span class="sourceLineNo">620</span> PrivateCellUtil.estimatedSizeOfCell(cell));<a name="line.620"></a>
-<span class="sourceLineNo">621</span> scannerContext.incrementBatchProgress(1);<a name="line.621"></a>
-<span class="sourceLineNo">622</span><a name="line.622"></a>
-<span class="sourceLineNo">623</span> if (matcher.isUserScan() && totalBytesRead > maxRowSize) {<a name="line.623"></a>
-<span class="sourceLineNo">624</span> throw new RowTooBigException(<a name="line.624"></a>
-<span class="sourceLineNo">625</span> "Max row size allowed: " + maxRowSize + ", but the row is bigger than that.");<a name="line.625"></a>
-<span class="sourceLineNo">626</span> }<a name="line.626"></a>
-<span class="sourceLineNo">627</span> }<a name="line.627"></a>
+<span class="sourceLineNo">535</span> Cell cell = this.heap.peek();<a name="line.535"></a>
+<span class="sourceLineNo">536</span> if (cell == null) {<a name="line.536"></a>
+<span class="sourceLineNo">537</span> close(false);// Do all cleanup except heap.close()<a name="line.537"></a>
+<span class="sourceLineNo">538</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.538"></a>
+<span class="sourceLineNo">539</span> }<a name="line.539"></a>
+<span class="sourceLineNo">540</span><a name="line.540"></a>
+<span class="sourceLineNo">541</span> // only call setRow if the row changes; avoids confusing the query matcher<a name="line.541"></a>
+<span class="sourceLineNo">542</span> // if scanning intra-row<a name="line.542"></a>
+<span class="sourceLineNo">543</span><a name="line.543"></a>
+<span class="sourceLineNo">544</span> // If no limits exists in the scope LimitScope.Between_Cells then we are sure we are changing<a name="line.544"></a>
+<span class="sourceLineNo">545</span> // rows. Else it is possible we are still traversing the same row so we must perform the row<a name="line.545"></a>
+<span class="sourceLineNo">546</span> // comparison.<a name="line.546"></a>
+<span class="sourceLineNo">547</span> if (!scannerContext.hasAnyLimit(LimitScope.BETWEEN_CELLS) || matcher.currentRow() == null) {<a name="line.547"></a>
+<span class="sourceLineNo">548</span> this.countPerRow = 0;<a name="line.548"></a>
+<span class="sourceLineNo">549</span> matcher.setToNewRow(cell);<a name="line.549"></a>
+<span class="sourceLineNo">550</span> }<a name="line.550"></a>
+<span class="sourceLineNo">551</span><a name="line.551"></a>
+<span class="sourceLineNo">552</span> // Clear progress away unless invoker has indicated it should be kept.<a name="line.552"></a>
+<span class="sourceLineNo">553</span> if (!scannerContext.getKeepProgress()) {<a name="line.553"></a>
+<span class="sourceLineNo">554</span> scannerContext.clearProgress();<a name="line.554"></a>
+<span class="sourceLineNo">555</span> }<a name="line.555"></a>
+<span class="sourceLineNo">556</span><a name="line.556"></a>
+<span class="sourceLineNo">557</span> int count = 0;<a name="line.557"></a>
+<span class="sourceLineNo">558</span> long totalBytesRead = 0;<a name="line.558"></a>
+<span class="sourceLineNo">559</span><a name="line.559"></a>
+<span class="sourceLineNo">560</span> LOOP: do {<a name="line.560"></a>
+<span class="sourceLineNo">561</span> // Update and check the time limit based on the configured value of cellsPerTimeoutCheck<a name="line.561"></a>
+<span class="sourceLineNo">562</span> // Or if the preadMaxBytes is reached and we may want to return so we can switch to stream in<a name="line.562"></a>
+<span class="sourceLineNo">563</span> // the shipped method below.<a name="line.563"></a>
+<span class="sourceLineNo">564</span> if (kvsScanned % cellsPerHeartbeatCheck == 0 || (scanUsePread &&<a name="line.564"></a>
+<span class="sourceLineNo">565</span> readType == Scan.ReadType.DEFAULT && bytesRead > preadMaxBytes)) {<a name="line.565"></a>
+<span class="sourceLineNo">566</span> if (scannerContext.checkTimeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.566"></a>
+<span class="sourceLineNo">567</span> return scannerContext.setScannerState(NextState.TIME_LIMIT_REACHED).hasMoreValues();<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> // Do object compare - we set prevKV from the same heap.<a name="line.570"></a>
+<span class="sourceLineNo">571</span> if (prevCell != cell) {<a name="line.571"></a>
+<span class="sourceLineNo">572</span> ++kvsScanned;<a name="line.572"></a>
+<span class="sourceLineNo">573</span> }<a name="line.573"></a>
+<span class="sourceLineNo">574</span> checkScanOrder(prevCell, cell, comparator);<a name="line.574"></a>
+<span class="sourceLineNo">575</span> int cellSize = PrivateCellUtil.estimatedSerializedSizeOf(cell);<a name="line.575"></a>
+<span class="sourceLineNo">576</span> bytesRead += cellSize;<a name="line.576"></a>
+<span class="sourceLineNo">577</span> if (scanUsePread && readType == Scan.ReadType.DEFAULT &&<a name="line.577"></a>
+<span class="sourceLineNo">578</span> bytesRead > preadMaxBytes) {<a name="line.578"></a>
+<span class="sourceLineNo">579</span> // return immediately if we want to switch from pread to stream. We need this because we can<a name="line.579"></a>
+<span class="sourceLineNo">580</span> // only switch in the shipped method, if user use a filter to filter out everything and rpc<a name="line.580"></a>
+<span class="sourceLineNo">581</span> // timeout is very large then the shipped method will never be called until the whole scan<a name="line.581"></a>
+<span class="sourceLineNo">582</span> // is finished, but at that time we have already scan all the data...<a name="line.582"></a>
+<span class="sourceLineNo">583</span> // See HBASE-20457 for more details.<a name="line.583"></a>
+<span class="sourceLineNo">584</span> // And there is still a scenario that can not be handled. If we have a very large row, which<a name="line.584"></a>
+<span class="sourceLineNo">585</span> // have millions of qualifiers, and filter.filterRow is used, then even if we set the flag<a name="line.585"></a>
+<span class="sourceLineNo">586</span> // here, we still need to scan all the qualifiers before returning...<a name="line.586"></a>
+<span class="sourceLineNo">587</span> scannerContext.returnImmediately();<a name="line.587"></a>
+<span class="sourceLineNo">588</span> }<a name="line.588"></a>
+<span class="sourceLineNo">589</span> prevCell = cell;<a name="line.589"></a>
+<span class="sourceLineNo">590</span> scannerContext.setLastPeekedCell(cell);<a name="line.590"></a>
+<span class="sourceLineNo">591</span> topChanged = false;<a name="line.591"></a>
+<span class="sourceLineNo">592</span> ScanQueryMatcher.MatchCode qcode = matcher.match(cell);<a name="line.592"></a>
+<span class="sourceLineNo">593</span> switch (qcode) {<a name="line.593"></a>
+<span class="sourceLineNo">594</span> case INCLUDE:<a name="line.594"></a>
+<span class="sourceLineNo">595</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.595"></a>
+<span class="sourceLineNo">596</span> case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.596"></a>
+<span class="sourceLineNo">597</span><a name="line.597"></a>
+<span class="sourceLineNo">598</span> Filter f = matcher.getFilter();<a name="line.598"></a>
+<span class="sourceLineNo">599</span> if (f != null) {<a name="line.599"></a>
+<span class="sourceLineNo">600</span> cell = f.transformCell(cell);<a name="line.600"></a>
+<span class="sourceLineNo">601</span> }<a name="line.601"></a>
+<span class="sourceLineNo">602</span><a name="line.602"></a>
+<span class="sourceLineNo">603</span> this.countPerRow++;<a name="line.603"></a>
+<span class="sourceLineNo">604</span> if (storeLimit > -1 && this.countPerRow > (storeLimit + storeOffset)) {<a name="line.604"></a>
+<span class="sourceLineNo">605</span> // do what SEEK_NEXT_ROW does.<a name="line.605"></a>
+<span class="sourceLineNo">606</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.606"></a>
+<span class="sourceLineNo">607</span> close(false);// Do all cleanup except heap.close()<a name="line.607"></a>
+<span class="sourceLineNo">608</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.608"></a>
+<span class="sourceLineNo">609</span> }<a name="line.609"></a>
+<span class="sourceLineNo">610</span> matcher.clearCurrentRow();<a name="line.610"></a>
+<span class="sourceLineNo">611</span> seekToNextRow(cell);<a name="line.611"></a>
+<span class="sourceLineNo">612</span> break LOOP;<a name="line.612"></a>
+<span class="sourceLineNo">613</span> }<a name="line.613"></a>
+<span class="sourceLineNo">614</span><a name="line.614"></a>
+<span class="sourceLineNo">615</span> // add to results only if we have skipped #storeOffset kvs<a name="line.615"></a>
+<span class="sourceLineNo">616</span> // also update metric accordingly<a name="line.616"></a>
+<span class="sourceLineNo">617</span> if (this.countPerRow > storeOffset) {<a name="line.617"></a>
+<span class="sourceLineNo">618</span> outResult.add(cell);<a name="line.618"></a>
+<span class="sourceLineNo">619</span><a name="line.619"></a>
+<span class="sourceLineNo">620</span> // Update local tracking information<a name="line.620"></a>
+<span class="sourceLineNo">621</span> count++;<a name="line.621"></a>
+<span class="sourceLineNo">622</span> totalBytesRead += cellSize;<a name="line.622"></a>
+<span class="sourceLineNo">623</span><a name="line.623"></a>
+<span class="sourceLineNo">624</span> // Update the progress of the scanner context<a name="line.624"></a>
+<span class="sourceLineNo">625</span> scannerContext.incrementSizeProgress(cellSize,<a name="line.625"></a>
+<span class="sourceLineNo">626</span> PrivateCellUtil.estimatedSizeOfCell(cell));<a name="line.626"></a>
+<span class="sourceLineNo">627</span> scannerContext.incrementBatchProgress(1);<a name="line.627"></a>
<span class="sourceLineNo">628</span><a name="line.628"></a>
-<span class="sourceLineNo">629</span> if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_ROW) {<a name="line.629"></a>
-<span class="sourceLineNo">630</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.630"></a>
-<span class="sourceLineNo">631</span> close(false);// Do all cleanup except heap.close()<a name="line.631"></a>
-<span class="sourceLineNo">632</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.632"></a>
-<span class="sourceLineNo">633</span> }<a name="line.633"></a>
-<span class="sourceLineNo">634</span> matcher.clearCurrentRow();<a name="line.634"></a>
-<span class="sourceLineNo">635</span> seekOrSkipToNextRow(cell);<a name="line.635"></a>
-<span class="sourceLineNo">636</span> } else if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_COL) {<a name="line.636"></a>
-<span class="sourceLineNo">637</span> seekOrSkipToNextColumn(cell);<a name="line.637"></a>
-<span class="sourceLineNo">638</span> } else {<a name="line.638"></a>
-<span class="sourceLineNo">639</span> this.heap.next();<a name="line.639"></a>
-<span class="sourceLineNo">640</span> }<a name="line.640"></a>
-<span class="sourceLineNo">641</span><a name="line.641"></a>
-<span class="sourceLineNo">642</span> if (scannerContext.checkBatchLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.642"></a>
-<span class="sourceLineNo">643</span> break LOOP;<a name="line.643"></a>
-<span class="sourceLineNo">644</span> }<a name="line.644"></a>
-<span class="sourceLineNo">645</span> if (scannerContext.checkSizeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.645"></a>
-<span class="sourceLineNo">646</span> break LOOP;<a name="line.646"></a>
-<span class="sourceLineNo">647</span> }<a name="line.647"></a>
-<span class="sourceLineNo">648</span> continue;<a name="line.648"></a>
-<span class="sourceLineNo">649</span><a name="line.649"></a>
-<span class="sourceLineNo">650</span> case DONE:<a name="line.650"></a>
-<span class="sourceLineNo">651</span> // Optimization for Gets! If DONE, no more to get on this row, early exit!<a name="line.651"></a>
-<span class="sourceLineNo">652</span> if (get) {<a name="line.652"></a>
-<span class="sourceLineNo">653</span> // Then no more to this row... exit.<a name="line.653"></a>
-<span class="sourceLineNo">654</span> close(false);// Do all cleanup except heap.close()<a name="line.654"></a>
-<span class="sourceLineNo">655</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.655"></a>
-<span class="sourceLineNo">656</span> }<a name="line.656"></a>
-<span class="sourceLineNo">657</span> matcher.clearCurrentRow();<a name="line.657"></a>
-<span class="sourceLineNo">658</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.658"></a>
-<span class="sourceLineNo">659</span><a name="line.659"></a>
-<span class="sourceLineNo">660</span> case DONE_SCAN:<a name="line.660"></a>
-<span class="sourceLineNo">661</span> close(false);// Do all cleanup except heap.close()<a name="line.661"></a>
-<span class="sourceLineNo">662</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.662"></a>
-<span class="sourceLineNo">663</span><a name="line.663"></a>
-<span class="sourceLineNo">664</span> case SEEK_NEXT_ROW:<a name="line.664"></a>
-<span class="sourceLineNo">665</span> // This is just a relatively simple end of scan fix, to short-cut end<a name="line.665"></a>
-<span class="sourceLineNo">666</span> // us if there is an endKey in the scan.<a name="line.666"></a>
-<span class="sourceLineNo">667</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.667"></a>
-<span class="sourceLineNo">668</span> close(false);// Do all cleanup except heap.close()<a name="line.668"></a>
-<span class="sourceLineNo">669</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.669"></a>
-<span class="sourceLineNo">670</span> }<a name="line.670"></a>
-<span class="sourceLineNo">671</span> matcher.clearCurrentRow();<a name="line.671"></a>
-<span class="sourceLineNo">672</span> seekOrSkipToNextRow(cell);<a name="line.672"></a>
-<span class="sourceLineNo">673</span> NextState stateAfterSeekNextRow = needToReturn(outResult);<a name="line.673"></a>
-<span class="sourceLineNo">674</span> if (stateAfterSeekNextRow != null) {<a name="line.674"></a>
-<span class="sourceLineNo">675</span> return scannerContext.setScannerState(stateAfterSeekNextRow).hasMoreValues();<a name="line.675"></a>
+<span class="sourceLineNo">629</span> if (matcher.isUserScan() && totalBytesRead > maxRowSize) {<a name="line.629"></a>
+<span class="sourceLineNo">630</span> throw new RowTooBigException(<a name="line.630"></a>
+<span class="sourceLineNo">631</span> "Max row size allowed: " + maxRowSize + ", but the row is bigger than that.");<a name="line.631"></a>
+<span class="sourceLineNo">632</span> }<a name="line.632"></a>
+<span class="sourceLineNo">633</span> }<a name="line.633"></a>
+<span class="sourceLineNo">634</span><a name="line.634"></a>
+<span class="sourceLineNo">635</span> if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_ROW) {<a name="line.635"></a>
+<span class="sourceLineNo">636</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.636"></a>
+<span class="sourceLineNo">637</span> close(false);// Do all cleanup except heap.close()<a name="line.637"></a>
+<span class="sourceLineNo">638</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.638"></a>
+<span class="sourceLineNo">639</span> }<a name="line.639"></a>
+<span class="sourceLineNo">640</span> matcher.clearCurrentRow();<a name="line.640"></a>
+<span class="sourceLineNo">641</span> seekOrSkipToNextRow(cell);<a name="line.641"></a>
+<span class="sourceLineNo">642</span> } else if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_COL) {<a name="line.642"></a>
+<span class="sourceLineNo">643</span> seekOrSkipToNextColumn(cell);<a name="line.643"></a>
+<span class="sourceLineNo">644</span> } else {<a name="line.644"></a>
+<span class="sourceLineNo">645</span> this.heap.next();<a name="line.645"></a>
+<span class="sourceLineNo">646</span> }<a name="line.646"></a>
+<span class="sourceLineNo">647</span><a name="line.647"></a>
+<span class="sourceLineNo">648</span> if (scannerContext.checkBatchLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.648"></a>
+<span class="sourceLineNo">649</span> break LOOP;<a name="line.649"></a>
+<span class="sourceLineNo">650</span> }<a name="line.650"></a>
+<span class="sourceLineNo">651</span> if (scannerContext.checkSizeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.651"></a>
+<span class="sourceLineNo">652</span> break LOOP;<a name="line.652"></a>
+<span class="sourceLineNo">653</span> }<a name="line.653"></a>
+<span class="sourceLineNo">654</span> continue;<a name="line.654"></a>
+<span class="sourceLineNo">655</span><a name="line.655"></a>
+<span class="sourceLineNo">656</span> case DONE:<a name="line.656"></a>
+<span class="sourceLineNo">657</span> // Optimization for Gets! If DONE, no more to get on this row, early exit!<a name="line.657"></a>
+<span class="sourceLineNo">658</span> if (get) {<a name="line.658"></a>
+<span class="sourceLineNo">659</span> // Then no more to this row... exit.<a name="line.659"></a>
+<span class="sourceLineNo">660</span> close(false);// Do all cleanup except heap.close()<a name="line.660"></a>
+<span class="sourceLineNo">661</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.661"></a>
+<span class="sourceLineNo">662</span> }<a name="line.662"></a>
+<span class="sourceLineNo">663</span> matcher.clearCurrentRow();<a name="line.663"></a>
+<span class="sourceLineNo">664</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.664"></a>
+<span class="sourceLineNo">665</span><a name="line.665"></a>
+<span class="sourceLineNo">666</span> case DONE_SCAN:<a name="line.666"></a>
+<span class="sourceLineNo">667</span> close(false);// Do all cleanup except heap.close()<a name="line.667"></a>
+<span class="sourceLineNo">668</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.668"></a>
+<span class="sourceLineNo">669</span><a name="line.669"></a>
+<span class="sourceLineNo">670</span> case SEEK_NEXT_ROW:<a name="line.670"></a>
+<span class="sourceLineNo">671</span> // This is just a relatively simple end of scan fix, to short-cut end<a name="line.671"></a>
+<span class="sourceLineNo">672</span> // us if there is an endKey in the scan.<a name="line.672"></a>
+<span class="sourceLineNo">673</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.673"></a>
+<span class="sourceLineNo">674</span> close(false);// Do all cleanup except heap.close()<a name="line.674"></a>
+<span class="sourceLineNo">675</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.675"></a>
<span class="sourceLineNo">676</span> }<a name="line.676"></a>
-<span class="sourceLineNo">677</span> break;<a name="line.677"></a>
-<span class="sourceLineNo">678</span><a name="line.678"></a>
-<span class="sourceLineNo">679</span> case SEEK_NEXT_COL:<a name="line.679"></a>
-<span class="sourceLineNo">680</span> seekOrSkipToNextColumn(cell);<a name="line.680"></a>
-<span class="sourceLineNo">681</span> NextState stateAfterSeekNextColumn = needToReturn(outResult);<a name="line.681"></a>
-<span class="sourceLineNo">682</span> if (stateAfterSeekNextColumn != null) {<a name="line.682"></a>
-<span class="sourceLineNo">683</span> return scannerContext.setScannerState(stateAfterSeekNextColumn).hasMoreValues();<a name="line.683"></a>
-<span class="sourceLineNo">684</span> }<a name="line.684"></a>
-<span class="sourceLineNo">685</span> break;<a name="line.685"></a>
-<span class="sourceLineNo">686</span><a name="line.686"></a>
-<span class="sourceLineNo">687</span> case SKIP:<a name="line.687"></a>
-<span class="sourceLineNo">688</span> this.heap.next();<a name="line.688"></a>
-<span class="sourceLineNo">689</span> break;<a name="line.689"></a>
-<span class="sourceLineNo">690</span><a name="line.690"></a>
-<span class="sourceLineNo">691</span> case SEEK_NEXT_USING_HINT:<a name="line.691"></a>
-<span class="sourceLineNo">692</span> Cell nextKV = matcher.getNextKeyHint(cell);<a name="line.692"></a>
-<span class="sourceLineNo">693</span> if (nextKV != null && comparator.compare(nextKV, cell) > 0) {<a name="line.693"></a>
-<span class="sourceLineNo">694</span> seekAsDirection(nextKV);<a name="line.694"></a>
-<span class="sourceLineNo">695</span> NextState stateAfterSeekByHint = needToReturn(outResult);<a name="line.695"></a>
-<span class="sourceLineNo">696</span> if (stateAfterSeekByHint != null) {<a name="line.696"></a>
-<span class="sourceLineNo">697</span> return scannerContext.setScannerState(stateAfterSeekByHint).hasMoreValues();<a name="line.697"></a>
-<span class="sourceLineNo">698</span> }<a name="line.698"></a>
-<span class="sourceLineNo">699</span> } else {<a name="line.699"></a>
-<span class="sourceLineNo">700</span> heap.next();<a name="line.700"></a>
-<span class="sourceLineNo">701</span> }<a name="line.701"></a>
-<span class="sourceLineNo">702</span> break;<a name="line.702"></a>
-<span class="sourceLineNo">703</span><a name="line.703"></a>
-<span class="sourceLineNo">704</span> default:<a name="line.704"></a>
-<span class="sourceLineNo">705</span> throw new RuntimeException("UNEXPECTED");<a name="line.705"></a>
-<span class="sourceLineNo">706</span> }<a name="line.706"></a>
-<span class="sourceLineNo">707</span> } while ((cell = this.heap.peek()) != null);<a name="line.707"></a>
-<span class="sourceLineNo">708</span><a name="line.708"></a>
-<span class="sourceLineNo">709</span> if (count > 0) {<a name="line.709"></a>
-<span class="sourceLineNo">710</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.710"></a>
-<span class="sourceLineNo">711</span> }<a name="line.711"></a>
-<span class="sourceLineNo">712</span><a name="line.712"></a>
-<span class="sourceLineNo">713</span> // No more keys<a name="line.713"></a>
-<span class="sourceLineNo">714</span> close(false);// Do all cleanup except heap.close()<a name="line.714"></a>
-<span class="sourceLineNo">715</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.715"></a>
-<span class="sourceLineNo">716</span> }<a name="line.716"></a>
-<span class="sourceLineNo">717</span><a name="line.717"></a>
-<span class="sourceLineNo">718</span> /**<a name="line.718"></a>
-<span class="sourceLineNo">719</span> * If the top cell won't be flushed into disk, the new top cell may be<a name="line.719"></a>
-<span class="sourceLineNo">720</span> * changed after #reopenAfterFlush. Because the older top cell only exist<a name="line.720"></a>
-<span class="sourceLineNo">721</span> * in the memstore scanner but the memstore scanner is replaced by hfile<a name="line.721"></a>
-<span class="sourceLineNo">722</span> * scanner after #reopenAfterFlush. If the row of top cell is changed,<a name="line.722"></a>
-<span class="sourceLineNo">723</span> * we should return the current cells. Otherwise, we may return<a name="line.723"></a>
-<span class="sourceLineNo">724</span> * the cells across different rows.<a name="line.724"></a>
-<span class="sourceLineNo">725</span> * @param outResult the cells which are visible for user scan<a name="line.725"></a>
-<span class="sourceLineNo">726</span> * @return null is the top cell doesn't change. Otherwise, the NextState<a name="line.726"></a>
-<span class="sourceLineNo">727</span> * to return<a name="line.727"></a>
-<span class="sourceLineNo">728</span> */<a name="line.728"></a>
-<span class="sourceLineNo">729</span> private NextState needToReturn(List<Cell> outResult) {<a name="line.729"></a>
-<span class="sourceLineNo">730</span> if (!outResult.isEmpty() && topChanged) {<a name="line.730"></a>
-<span class="sourceLineNo">731</span> return heap.peek() == null ? NextState.NO_MORE_VALUES : NextState.MORE_VALUES;<a name="line.731"></a>
-<span class="sourceLineNo">732</span> }<a name="line.732"></a>
-<span class="sourceLineNo">733</span> return null;<a name="line.733"></a>
-<span class="sourceLineNo">734</span> }<a name="line.734"></a>
-<span class="sourceLineNo">735</span><a name="line.735"></a>
-<span class="sourceLineNo">736</span> private void seekOrSkipToNextRow(Cell cell) throws IOException {<a name="line.736"></a>
-<span class="sourceLineNo">737</span> // If it is a Get Scan, then we know that we are done with this row; there are no more<a name="line.737"></a>
-<span class="sourceLineNo">738</span> // rows beyond the current one: don't try to optimize.<a name="line.738"></a>
-<span class="sourceLineNo">739</span> if (!get) {<a name="line.739"></a>
-<span class="sourceLineNo">740</span> if (trySkipToNextRow(cell)) {<a name="line.740"></a>
-<span class="sourceLineNo">741</span> return;<a name="line.741"></a>
-<span class="sourceLineNo">742</span> }<a name="line.742"></a>
-<span class="sourceLineNo">743</span> }<a name="line.743"></a>
-<span class="sourceLineNo">744</span> seekToNextRow(cell);<a name="line.744"></a>
-<span class="sourceLineNo">745</span> }<a name="line.745"></a>
-<span class="sourceLineNo">746</span><a name="line.746"></a>
-<span class="sourceLineNo">747</span> private void seekOrSkipToNextColumn(Cell cell) throws IOException {<a name="line.747"></a>
-<span class="sourceLineNo">748</span> if (!trySkipToNextColumn(cell)) {<a name="line.748"></a>
-<span class="sourceLineNo">749</span> seekAsDirection(matcher.getKeyForNextColumn(cell));<a name="line.749"></a>
-<span class="sourceLineNo">750</span> }<a name="line.750"></a>
+<span class="sourceLineNo">677</span> matcher.clearCurrentRow();<a name="line.677"></a>
+<span class="sourceLineNo">678</span> seekOrSkipToNextRow(cell);<a name="line.678"></a>
+<span class="sourceLineNo">679</span> NextState stateAfterSeekNextRow = needToReturn(outResult);<a name="line.679"></a>
+<span class="sourceLineNo">680</span> if (stateAfterSeekNextRow != null) {<a name="line.680"></a>
+<span class="sourceLineNo">681</span> return scannerContext.setScannerState(stateAfterSeekNextRow).hasMoreValues();<a name="line.681"></a>
+<span class="sourceLineNo">682</span> }<a name="line.682"></a>
+<span class="sourceLineNo">683</span> break;<a name="line.683"></a>
+<span class="sourceLineNo">684</span><a name="line.684"></a>
+<span class="sourceLineNo">685</span> case SEEK_NEXT_COL:<a name="line.685"></a>
+<span class="sourceLineNo">686</span> seekOrSkipToNextColumn(cell);<a name="line.686"></a>
+<span class="sourceLineNo">687</span> NextState stateAfterSeekNextColumn = needToReturn(outResult);<a name="line.687"></a>
+<span class="sourceLineNo">688</span> if (stateAfterSeekNextColumn != null) {<a name="line.688"></a>
+<span class="sourceLineNo">689</span> return scannerContext.setScannerState(stateAfterSeekNextColumn).hasMoreValues();<a name="line.689"></a>
+<span class="sourceLineNo">690</span> }<a name="line.690"></a>
+<span class="sourceLineNo">691</span> break;<a name="line.691"></a>
+<span class="sourceLineNo">692</span><a name="line.692"></a>
+<span class="sourceLineNo">693</span> case SKIP:<a name="line.693"></a>
+<span class="sourceLineNo">694</span> this.heap.next();<a name="line.694"></a>
+<span class="sourceLineNo">695</span> break;<a name="line.695"></a>
+<span class="sourceLineNo">696</span><a name="line.696"></a>
+<span class="sourceLineNo">697</span> case SEEK_NEXT_USING_HINT:<a name="line.697"></a>
+<span class="sourceLineNo">698</span> Cell nextKV = matcher.getNextKeyHint(cell);<a name="line.698"></a>
+<span class="sourceLineNo">699</span> if (nextKV != null && comparator.compare(nextKV, cell) > 0) {<a name="line.699"></a>
+<span class="sourceLineNo">700</span> seekAsDirection(nextKV);<a name="line.700"></a>
+<span class="sourceLineNo">701</span> NextState stateAfterSeekByHint = needToReturn(outResult);<a name="line.701"></a>
+<span class="sourceLineNo">702</span> if (stateAfterSeekByHint != null) {<a name="line.702"></a>
+<span class="sourceLineNo">703</span> return scannerContext.setScannerState(stateAfterSeekByHint).hasMoreValues();<a name="line.703"></a>
+<span class="sourceLineNo">704</span> }<a name="line.704"></a>
+<span class="sourceLineNo">705</span> } else {<a name="line.705"></a>
+<span class="sourceLineNo">706</span> heap.next();<a name="line.706"></a>
+<span class="sourceLineNo">707</span> }<a name="line.707"></a>
+<span class="sourceLineNo">708</span> break;<a name="line.708"></a>
+<span class="sourceLineNo">709</span><a name="line.709"></a>
+<span class="sourceLineNo">710</span> default:<a name="line.710"></a>
+<span class="sourceLineNo">711</span> throw new RuntimeException("UNEXPECTED");<a name="line.711"></a>
+<span class="sourceLineNo">712</span> }<a name="line.712"></a>
+<span class="sourceLineNo">713</span> } while ((cell = this.heap.peek()) != null);<a name="line.713"></a>
+<span class="sourceLineNo">714</span><a name="line.714"></a>
+<span class="sourceLineNo">715</span> if (count > 0) {<a name="line.715"></a>
+<span class="sourceLineNo">716</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.716"></a>
+<span class="sourceLineNo">717</span> }<a name="line.717"></a>
+<span class="sourceLineNo">718</span><a name="line.718"></a>
+<span class="sourceLineNo">719</span> // No more keys<a name="line.719"></a>
+<span class="sourceLineNo">720</span> close(false);// Do all cleanup except heap.close()<a name="line.720"></a>
+<span class="sourceLineNo">721</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.721"></a>
+<span class="sourceLineNo">722</span> }<a name="line.722"></a>
+<span class="sourceLineNo">723</span><a name="line.723"></a>
+<span class="sourceLineNo">724</span> /**<a name="line.724"></a>
+<span class="sourceLineNo">725</span> * If the top cell won't be flushed into disk, the new top cell may be<a name="line.725"></a>
+<span class="sourceLineNo">726</span> * changed after #reopenAfterFlush. Because the older top cell only exist<a name="line.726"></a>
+<span class="sourceLineNo">727</span> * in the memstore scanner but the memstore scanner is replaced by hfile<a name="line.727"></a>
+<span class="sourceLineNo">728</span> * scanner after #reopenAfterFlush. If the row of top cell is changed,<a name="line.728"></a>
+<span class="sourceLineNo">729</span> * we should return the current cells. Otherwise, we may return<a name="line.729"></a>
+<span class="sourceLineNo">730</span> * the cells across different rows.<a name="line.730"></a>
+<span class="sourceLineNo">731</span> * @param outResult the cells which are visible for user scan<a name="line.731"></a>
+<span class="sourceLineNo">732</span> * @return null is the top cell doesn't change. Otherwise, the NextState<a name="line.732"></a>
+<span class="sourceLineNo">733</span> * to return<a name="line.733"></a>
+<span class="sourceLineNo">734</span> */<a name="line.734"></a>
+<span class="sourceLineNo">735</span> private NextState needToReturn(List<Cell> outResult) {<a name="line.735"></a>
+<span class="sourceLineNo">736</span> if (!outResult.isEmpty() && topChanged) {<a name="line.736"></a>
+<span class="sourceLineNo">737</span> return heap.peek() == null ? NextState.NO_MORE_VALUES : NextState.MORE_VALUES;<a name="line.737"></a>
+<span class="sourceLineNo">738</span> }<a name="line.738"></a>
+<span class="sourceLineNo">739</span> return null;<a name="line.739"></a>
+<span class="sourceLineNo">740</span> }<a name="line.740"></a>
+<span class="sourceLineNo">741</span><a name="line.741"></a>
+<span class="sourceLineNo">742</span> private void seekOrSkipToNextRow(Cell cell) throws IOException {<a name="line.742"></a>
+<span class="sourceLineNo">743</span> // If it is a Get Scan, then we know that we are done with this row; there are no more<a name="line.743"></a>
+<span class="sourceLineNo">744</span> // rows beyond the current one: don't try to optimize.<a name="line.744"></a>
+<span class="sourceLineNo">745</span> if (!get) {<a name="line.745"></a>
+<span class="sourceLineNo">746</span> if (trySkipToNextRow(cell)) {<a name="line.746"></a>
+<span class="sourceLineNo">747</span> return;<a name="line.747"></a>
+<span class="sourceLineNo">748</span> }<a name="line.748"></a>
+<span class="sourceLineNo">749</span> }<a name="line.749"></a>
+<span class="sourceLineNo">750</span> seekToNextRow(cell);<a name="line.750"></a>
<span class="sourceLineNo">751</span> }<a name="line.751"></a>
<span class="sourceLineNo">752</span><a name="line.752"></a>
-<span class="sourceLineNo">753</span> /**<a name="line.753"></a>
-<span class="sourceLineNo">754</span> * See if we should actually SEEK or rather just SKIP to the next Cell (see HBASE-13109).<a name="line.754"></a>
-<span class="sourceLineNo">755</span> * ScanQueryMatcher may issue SEEK hints, such as seek to next column, next row,<a name="line.755"></a>
-<span class="sourceLineNo">756</span> * or seek to an arbitrary seek key. This method decides whether a seek is the most efficient<a name="line.756"></a>
-<span class="sourceLineNo">757</span> * _actual_ way to get us to the requested cell (SEEKs are more expensive than SKIP, SKIP,<a name="line.757"></a>
-<span class="sourceLineNo">758</span> * SKIP inside the current, loaded block).<a name="line.758"></a>
-<span class="sourceLineNo">759</span> * It does this by looking at the next indexed key of the current HFile. This key<a name="line.759"></a>
-<span class="sourceLineNo">760</span> * is then compared with the _SEEK_ key, where a SEEK key is an artificial 'last possible key<a name="line.760"></a>
-<span class="sourceLineNo">761</span> * on the row' (only in here, we avoid actually creating a SEEK key; in the compare we work with<a name="line.761"></a>
-<span class="sourceLineNo">762</span> * the current Cell but compare as though it were a seek key; see down in<a name="line.762"></a>
-<span class="sourceLineNo">763</span> * matcher.compareKeyForNextRow, etc). If the compare gets us onto the<a name="line.763"></a>
-<span class="sourceLineNo">764</span> * next block we *_SEEK, otherwise we just SKIP to the next requested cell.<a name="line.764"></a>
-<span class="sourceLineNo">765</span> *<a name="line.765"></a>
-<span class="sourceLineNo">766</span> * <p>Other notes:<a name="line.766"></a>
-<span class="sourceLineNo">767</span> * <ul><a name="line.767"></a>
-<span class="sourceLineNo">768</span> * <li>Rows can straddle block boundaries</li><a name="line.768"></a>
-<span class="sourceLineNo">769</span> * <li>Versions of columns can straddle block boundaries (i.e. column C1 at T1 might be in a<a name="line.769"></a>
-<span class="sourceLineNo">770</span> * different block than column C1 at T2)</li><a name="line.770"></a>
-<span class="sourceLineNo">771</span> * <li>We want to SKIP if the chance is high that we'll find the desired Cell after a<a name="line.771"></a>
-<span class="sourceLineNo">772</span> * few SKIPs...</li><a name="line.772"></a>
-<span class="sourceLineNo">773</span> * <li>We want to SEEK when the chance is high that we'll be able to seek<a name="line.773"></a>
-<span class="sourceLineNo">774</span> * past many Cells, especially if we know we need to go to the next block.</li><a name="line.774"></a>
-<span class="sourceLineNo">775</span> * </ul><a name="line.775"></a>
-<span class="sourceLineNo">776</span> * <p>A good proxy (best effort) to determine whether SKIP is better than SEEK is whether<a name="line.776"></a>
-<span class="sourceLineNo">777</span> * we'll likely end up seeking to the next block (or past the next block) to get our next column.<a name="line.777"></a>
-<span class="sourceLineNo">778</span> * Example:<a name="line.778"></a>
-<span class="sourceLineNo">779</span> * <pre><a name="line.779"></a>
-<span class="sourceLineNo">780</span> * | BLOCK 1 | BLOCK 2 |<a name="line.780"></a>
-<span class="sourceLineNo">781</span> * | r1/c1, r1/c2, r1/c3 | r1/c4, r1/c5, r2/c1 |<a name="line.781"></a>
-<span class="sourceLineNo">782</span> * ^ ^<a name="line.782"></a>
-<span class="sourceLineNo">783</span> * | |<a name="line.783"></a>
-<span class="sourceLineNo">784</span> * Next Index Key SEEK_NEXT_ROW (before r2/c1)<a name="line.784"></a>
-<span class="sourceLineNo">785</span> *<a name="line.785"></a>
-<span class="sourceLineNo">786</span> *<a name="line.786"></a>
-<span class="sourceLineNo">787</span> * | BLOCK 1 | BLOCK 2 |<a name="line.787"></a>
-<span class="sourceLineNo">788</span> * | r1/c1/t5, r1/c1/t4, r1/c1/t3 | r1/c1/t2, r1/c1/T1, r1/c2/T3 |<a name="line.788"></a>
-<span class="sourceLineNo">789</span> * ^ ^<a name="line.789"></a>
-<span class="sourceLineNo">790</span> * | |<a name="line.790"></a>
-<span class="sourceLineNo">791</span> * Next Index Key SEEK_NEXT_COL<a name="line.791"></a>
-<span class="sourceLineNo">792</span> * </pre><a name="line.792"></a>
-<span class="sourceLineNo">793</span> * Now imagine we want columns c1 and c3 (see first diagram above), the 'Next Index Key' of r1/c4<a name="line.793"></a>
-<span class="sourceLineNo">794</span> * is > r1/c3 so we should seek to get to the c1 on the next row, r2. In second case, say we only<a name="line.794"></a>
-<span class="sourceLineNo">795</span> * want one version of c1, after we have it, a SEEK_COL will be issued to get to c2. Looking at<a name="line.795"></a>
-<span class="sourceLineNo">796</span> * the 'Next Index Key', it would land us in the next block, so we should SEEK. In other scenarios<a name="line.796"></a>
-<span class="sourceLineNo">797</span> * where the SEEK will not land us in the next block, it is very likely better to issues a series<a name="line.797"></a>
-<span class="sourceLineNo">798</span> * of SKIPs.<a name="line.798"></a>
-<span class="sourceLineNo">799</span> * @param cell current cell<a name="line.799"></a>
-<span class="sourceLineNo">800</span> * @return true means skip to next row, false means not<a name="line.800"></a>
-<span class="sourceLineNo">801</span> */<a name="line.801"></a>
-<span class="sourceLineNo">802</span> @VisibleForTesting<a name="line.802"></a>
-<span class="sourceLineNo">803</span> protected boolean trySkipToNextRow(Cell cell) throws IOException {<a name="line.803"></a>
-<span class="sourceLineNo">804</span> Cell nextCell = null;<a name="line.804"></a>
-<span class="sourceLineNo">805</span> // used to guard against a changed next indexed key by doing a identity comparison<a name="line.805"></a>
-<span class="sourceLineNo">806</span> // when the identity changes we need to compare the bytes again<a name="line.806"></a>
-<span class="sourceLineNo">807</span> Cell previousIndexedKey = null;<a name="line.807"></a>
-<span class="sourceLineNo">808</span> do {<a name="line.808"></a>
-<span class="sourceLineNo">809</span> Cell nextIndexedKey = getNextIndexedKey();<a name="line.809"></a>
-<span class="sourceLineNo">810</span> if (nextIndexedKey != null && nextIndexedKey != KeyValueScanner.NO_NEXT_INDEXED_KEY &&<a name="line.810"></a>
-<span class="sourceLineNo">811</span> (nextIndexedKey == previousIndexedKey ||<a name="line.811"></a>
-<span class="sourceLineNo">812</span> matcher.compareKeyForNextRow(nextIndexedKey, cell) >= 0)) {<a name="line.812"></a>
-<span class="sourceLineNo">813</span> this.heap.next();<a name="line.813"></a>
-<span class="sourceLineNo">814</span> ++kvsScanned;<a name="line.814"></a>
-<span class="sourceLineNo">815</span> previousIndexedKey = nextIndexedKey;<a name="line.815"></a>
-<span class="sourceLineNo">816</span> } else {<a name="line.816"></a>
-<span class="sourceLineNo">817</span> return false;<a name="line.817"></a>
-<span class="sourceLineNo">818</span> }<a name="line.818"></a>
-<span class="sourceLineNo">819</span> } while ((nextCell = this.heap.peek()) != null && CellUtil.matchingRows(cell, nextCell));<a name="line.819"></a>
-<span class="sourceLineNo">820</span> return true;<a name="line.820"></a>
-<span class="sourceLineNo">821</span> }<a name="line.821"></a>
-<span class="sourceLineNo">822</span><a name="line.822"></a>
-<span class="sourceLineNo">823</span> /**<a name="line.823"></a>
-<span class="sourceLineNo">824</span> * See {@link org.apache.hadoop.hbase.regionserver.StoreScanner#trySkipToNextRow(Cell)}<a name="line.824"></a>
-<span class="sourceLineNo">825</span> * @param cell current cell<a name="line.825"></a>
-<span class="sourceLineNo">826</span> * @return true means skip to next column, false means not<a name="line.826"></a>
-<span class="sourceLineNo">827</span> */<a name="line.827"></a>
-<span class="sourceLineNo">828</span> @VisibleForTesting<a name="line.828"></a>
-<span class="sourceLineNo">829</span> protected boolean trySkipToNextColumn(Cell cell) throws IOException {<a name="line.829"></a>
-<span class="sourceLineNo">830</span> Cell nextCell = null;<a name="line.830"></a>
-<span class="sourceLineNo">831</span> // used to guard against a changed next indexed key by doing a identity comparison<a name="line.831"></a>
-<span class="sourceLineNo">832</span> // when the identity changes we need to compare the bytes again<a name="line.832"></a>
-<span class="sourceLineNo">833</span> Cell previousIndexedKey = null;<a name="line.833"></a>
-<span class="sourceLineNo">834</span> do {<a name="line.834"></a>
-<span class="sourceLineNo">835</span> Cell nextIndexedKey = getNextIndexedKey();<a name="line.835"></a>
-<span class="sourceLineNo">836</span> if (nextIndexedKey != null && nextIndexedKey != KeyValueScanner.NO_NEXT_INDEXED_KEY &&<a name="line.836"></a>
-<span class="sourceLineNo">837</span> (nextIndexedKey == previousIndexedKey ||<a name="line.837"></a>
-<span class="sourceLineNo">838</span> matcher.compareKeyForNextColumn(nextIndexedKey, cell) >= 0)) {<a name="line.838"></a>
-<span class="sourceLineNo">839</span> this.heap.next();<a name="line.839"></a>
-<span class="sourceLineNo">840</span> ++kvsScanned;<a name="line.840"></a>
-<span class="sourceLineNo">841</span> previousIndexedKey = nextIndexedKey;<a name="line.841"></a>
-<span class="sourceLineNo">842</span> } else {<a name="line.842"></a>
-<span class="sourceLineNo">843</span> return false;<a name="line.843"></a>
-<span class="sourceLineNo">844</span> }<a name="line.844"></a>
-<span class="sourceLineNo">845</span> } while ((nextCell = this.heap.peek()) != null && CellUtil.matchingRowColumn(cell, nextCell));<a name="line.845"></a>
-<span class="sourceLineNo">846</span> // We need this check because it may happen that the new scanner that we get<a name="line.846"></a>
-<span class="sourceLineNo">847</span> // during heap.next() is requiring reseek due of fake KV previously generated for<a name="line.847"></a>
-<span class="sourceLineNo">848</span> // ROWCOL bloom filter optimization. See HBASE-19863 for more details<a name="line.848"></a>
-<span class="sourceLineNo">849</span> if (nextCell != null && matcher.compareKeyForNextColumn(nextCell, cell) < 0) {<a name="line.849"></a>
-<span class="sourceLineNo">850</span> return false;<a name="line.850"></a>
-<span class="sourceLineNo">851</span> }<a name="line.851"></a>
-<span class="sourceLineNo">852</span> return true;<a name="line.852"></a>
-<span class="sourceLineNo">853</span> }<a name="line.853"></a>
-<span class="sourceLineNo">854</span><a name="line.854"></a>
-<span class="sourceLineNo">855</span> @Override<a name="line.855"></a>
-<span class="sourceLineNo">856</span> public long getReadPoint() {<a name="line.856"></a>
-<span class="sourceLineNo">857</span> return this.readPt;<a name="line.857"></a>
-<span class="sourceLineNo">858</span> }<a name="line.858"></a>
-<span class="sourceLineNo">859</span><a name="line.859"></a>
-<span class="sourceLineNo">860</span> private static void clearAndClose(List<KeyValueScanner> scanners) {<a name="line.860"></a>
-<span class="sourceLineNo">861</span> for (KeyValueScanner s : scanners) {<a name="line.861"></a>
-<span class="sourceLineNo">862</span> s.close();<a name="line.862"></a>
-<span class="sourceLineNo">863</span> }<a name="line.863"></a>
-<span class="sourceLineNo">864</span> scanners.clear();<a name="line.864"></a>
-<span class="sourceLineNo">865</span> }<a name="line.865"></a>
-<span class="sourceLineNo">866</span><a name="line.866"></a>
-<span class="sourceLineNo">867</span> // Implementation of ChangedReadersObserver<a name="line.867"></a>
-<span class="sourceLineNo">868</span> @Override<a name="line.868"></a>
-<span class="sourceLineNo">869</span> public void updateReaders(List<HStoreFile> sfs, List<KeyValueScanner> memStoreScanners)<a name="line.869"></a>
-<span class="sourceLineNo">870</span> throws IOException {<a name="line.870"></a>
-<span class="sourceLineNo">871</span> if (CollectionUtils.isEmpty(sfs) && CollectionUtils.isEmpty(memStoreScanners)) {<a name="line.871"></a>
-<span class="sourceLineNo">872</span> return;<a name="line.872"></a>
-<span class="sourceLineNo">873</span> }<a name="line.873"></a>
-<span class="sourceLineNo">874</span> flushLock.lock();<a name="line.874"></a>
-<span class="sourceLineNo">875</span> try {<a name="line.875"></a>
-<span class="sourceLineNo">876</span> flushed = true;<a name="line.876"></a>
-<span class="sourceLineNo">877</span> final boolean isCompaction = false;<a name="line.877"></a>
-<span class="sourceLineNo">878</span> boolean usePread = get || scanUsePread;<a name="line.878"></a>
-<span class="sourceLineNo">879</span> // SEE HBASE-19468 where the flushed files are getting compacted even before a scanner<a name="line.879"></a>
-<span class="sourceLineNo">880</span> // calls next(). So its better we create scanners here rather than next() call. Ensure<a name="line.880"></a>
-<span class="sourceLineNo">881</span> // these scanners are properly closed() whether or not the scan is completed successfully<a name="line.881"></a>
-<span class="sourceLineNo">882</span> // Eagerly creating scanners so that we have the ref counting ticking on the newly created<a name="line.882"></a>
-<span class="sourceLineNo">883</span> // store files. In case of stream scanners this eager creation does not induce performance<a name="line.883"></a>
-<span class="sourceLineNo">884</span> // penalty because in scans (that uses stream scanners) the next() call is bound to happen.<a name="line.884"></a>
-<span class="sourceLineNo">885</span> List<KeyValueScanner> scanners = store.getScanners(sfs, cacheBlocks, get, usePread,<a name="line.885"></a>
-<span class="sourceLineNo">886</span> isCompaction, matcher, scan.getStartRow(), scan.getStopRow(), this.readPt, false);<a name="line.886"></a>
-<span class="sourceLineNo">887</span> flushedstoreFileScanners.addAll(scanners);<a name="line.887"></a>
-<span class="sourceLineNo">888</span> if (!CollectionUtils.isEmpty(memStoreScanners)) {<a name="line.888"></a>
-<span class="sourceLineNo">889</span> clearAndClose(memStoreScannersAfterFlush);<a name="line.889"></a>
-<span class="sourceLineNo">890</span> memStoreScannersAfterFlush.addAll(memStoreScanners);<a name="line.890"></a>
-<span class="sourceLineNo">891</span> }<a name="line.891"></a>
-<span class="sourceLineNo">892</span> } finally {<a name="line.892"></a>
-<span class="sourceLineNo">893</span> flushLock.unlock();<a name="line.893"></a>
-<span class="sourceLineNo">894</span> }<a name="line.894"></a>
-<span class="sourceLineNo">895</span> // Let the next() call handle re-creating and seeking<a name="line.895"></a>
-<span class="sourceLineNo">896</span> }<a name="line.896"></a>
-<span class="sourceLineNo">897</span><a name="line.897"></a>
-<span class="sourceLineNo">898</span> /**<a name="line.898"></a>
-<span class="sourceLineNo">899</span> * @return if top of heap has changed (and KeyValueHeap has to try the next KV)<a name="line.899"></a>
-<span class="sourceLineNo">900</span> */<a name="line.900"></a>
-<span class="sourceLineNo">901</span> protected final boolean reopenAfterFlush() throws IOException {<a name="line.901"></a>
-<span class="sourceLineNo">902</span> // here we can make sure that we have a Store instance so no null check on store.<a name="line.902"></a>
-<span class="sourceLineNo">903</span> Cell lastTop = heap.peek();<a name="line.903"></a>
-<span class="sourceLineNo">904</span> // When we have the scan object, should we not pass it to getScanners() to get a limited set of<a name="line.904"></a>
-<span class="sourceLineNo">905</span> // scanners? We did so in the constructor and we could have done it now by storing the scan<a name="line.905"></a>
-<span class="sourceLineNo">906</span> // object from the constructor<a name="line.906"></a>
-<span class="sourceLineNo">907</span> List<KeyValueScanner> scanners;<a name="line.907"></a>
-<span class="sourceLineNo">908</span> flushLock.lock();<a name="line.908"></a>
-<span class="sourceLineNo">909</span> try {<a name="line.909"></a>
-<span class="sourceLineNo">910</span> List<KeyValueScanner> allScanners =<a name="line.910"></a>
-<span class="sourceLineNo">911</span> new ArrayList<>(flushedstoreFileScanners.size() + memStoreScannersAfterFlush.size());<a name="line.911"></a>
-<span class="sourceLineNo">912</span> allScanners.addAll(flushedstoreFileScanners);<a name="line.912"></a>
-<span class="sourceLineNo">913</span> allScanners.addAll(memStoreScannersAfterFlush);<a name="line.913"></a>
-<span class="sourceLineNo">914</span> scanners = selectScannersFrom(store, allScanners);<a name="line.914"></a>
-<span class="sourceLineNo">915</span> // Clear the current set of flushed store files scanners so that they don't get added again<a name="line.915"></a>
-<span class="sourceLineNo">916</span> flushedstoreFileScanners.clear();<a name="line.916"></a>
-<span class="sourceLineNo">917</span> memStoreScannersAfterFlush.clear();<a name="line.917"></a>
-<span class="sourceLineNo">918</span> } finally {<a name="line.918"></a>
-<span class="sourceLineNo">919</span> flushLock.unlock();<a name="line.919"></a>
-<span class="sourceLineNo">920</span> }<a name="line.920"></a>
-<span class="sourceLineNo">921</span><a name="line.921"></a>
-<span class="sourceLineNo">922</span> // Seek the new scanners to the last key<a name="line.922"></a>
-<span class="sourceLineNo">923</span> seekScanners(scanners, lastTop, false, parallelSeekEnabled);<a name="line.923"></a>
-<span class="sourceLineNo">924</span> // remove the older memstore scanner<a name="line.924"></a>
-<span class="sourceLineNo">925</span> for (int i = currentScanners.size() - 1; i >=0; i--) {<a name="line.925"></a>
-<span class="sourceLineNo">926</span> if (!currentScanners.get(i).isFileScanner()) {<a name="line.926"></a>
-<span class="sourceLineNo">927</span> scannersForDelayedClose.add(currentScanners.remove(i));<a name="line.927"></a>
-<span class="sourceLineNo">928</span> } else {<a name="line.928"></a>
-<span class="sourceLineNo">929</span> // we add the memstore scanner to the end of currentScanners<a name="line.929"></a>
-<span class="sourceLineNo">930</span> break;<a name="line.930"></a>
-<span class="sourceLineNo">931</span> }<a name="line.931"></a>
-<span class="sourceLineNo">932</span> }<a name="line.932"></a>
-<span class="sourceLineNo">933</span> // add the newly created scanners on the flushed files and the current active memstore scanner<a name="line.933"></a>
-<span class="sourceLineNo">934</span> addCurrentScanners(scanners);<a name="line.934"></a>
-<span class="sourceLineNo">935</span> // Combine all seeked scanners with a heap<a name="line.935"></a>
-<span class="sourceLineNo">936</span> resetKVHeap(this.currentScanners, store.getComparator());<a name="line.936"></a>
-<span class="sourceLineNo">937</span> resetQueryMatcher(lastTop);<a name="line.937"></a>
-<span class="sourceLineNo">938</span> if (heap.peek() == null || store.getComparator().compareRows(lastTop, this.heap.peek()) != 0) {<a name="line.938"></a>
-<span class="sourceLineNo">939</span> LOG.info("Storescanner.peek() is changed where before = " + lastTop.toString() +<a name="line.939"></a>
-<span class="sourceLineNo">940</span> ",and after = " + heap.peek());<a name="line.940"></a>
-<span class="sourceLineNo">941</span> topChanged = true;<a name="line.941"></a>
-<span class="sourceLineNo">942</span> } else {<a name="line.942"></a>
-<span class="sourceLineNo">943</span> topChanged = false;<a name="line.943"></a>
-<span class="sourceLineNo">944</span> }<a name="line.944"></a>
-<span class="sourceLineNo">945</span> return topChanged;<a name="line.945"></a>
-<span class="sourceLineNo">946</span> }<a name="line.946"></a>
-<span class="sourceLineNo">947</span><a name="line.947"></a>
-<span class="sourceLineNo">948</span> private void resetQueryMatcher(Cell lastTopKey) {<a name="line.948"></a>
-<span class="sourceLineNo">949</span> // Reset the state of the Query Matcher and set to top row.<a name="line.949"></a>
-<span class="sourceLineNo">950</span> // Only reset and call setRow if the row changes; avoids confusing the<a name="line.950"></a>
-<span class="sourceLineNo">951</span> // query matcher if scanning intra-row.<a name="line.951"></a>
-<span class="sourceLineNo">952</span> Cell cell = heap.peek();<a name="line.952"></a>
-<span class="sourceLineNo">953</span> if (cel
<TRUNCATED>