http://git-wip-us.apache.org/repos/asf/hbase-site/blob/96e5e102/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 c376e15..070c994 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.html @@ -560,597 +560,596 @@ <span class="sourceLineNo">552</span> LOOP: do {<a name="line.552"></a> <span class="sourceLineNo">553</span> // Update and check the time limit based on the configured value of cellsPerTimeoutCheck<a name="line.553"></a> <span class="sourceLineNo">554</span> if ((kvsScanned % cellsPerHeartbeatCheck == 0)) {<a name="line.554"></a> -<span class="sourceLineNo">555</span> scannerContext.updateTimeProgress();<a name="line.555"></a> -<span class="sourceLineNo">556</span> if (scannerContext.checkTimeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.556"></a> -<span class="sourceLineNo">557</span> return scannerContext.setScannerState(NextState.TIME_LIMIT_REACHED).hasMoreValues();<a name="line.557"></a> -<span class="sourceLineNo">558</span> }<a name="line.558"></a> -<span class="sourceLineNo">559</span> }<a name="line.559"></a> -<span class="sourceLineNo">560</span> // Do object compare - we set prevKV from the same heap.<a name="line.560"></a> -<span class="sourceLineNo">561</span> if (prevCell != cell) {<a name="line.561"></a> -<span class="sourceLineNo">562</span> ++kvsScanned;<a name="line.562"></a> -<span class="sourceLineNo">563</span> }<a name="line.563"></a> -<span class="sourceLineNo">564</span> checkScanOrder(prevCell, cell, comparator);<a name="line.564"></a> -<span class="sourceLineNo">565</span> int cellSize = PrivateCellUtil.estimatedSerializedSizeOf(cell);<a name="line.565"></a> -<span class="sourceLineNo">566</span> bytesRead += cellSize;<a name="line.566"></a> -<span class="sourceLineNo">567</span> prevCell = cell;<a name="line.567"></a> -<span class="sourceLineNo">568</span> scannerContext.setLastPeekedCell(cell);<a name="line.568"></a> -<span class="sourceLineNo">569</span> topChanged = false;<a name="line.569"></a> -<span class="sourceLineNo">570</span> ScanQueryMatcher.MatchCode qcode = matcher.match(cell);<a name="line.570"></a> -<span class="sourceLineNo">571</span> switch (qcode) {<a name="line.571"></a> -<span class="sourceLineNo">572</span> case INCLUDE:<a name="line.572"></a> -<span class="sourceLineNo">573</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.573"></a> -<span class="sourceLineNo">574</span> case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.574"></a> -<span class="sourceLineNo">575</span><a name="line.575"></a> -<span class="sourceLineNo">576</span> Filter f = matcher.getFilter();<a name="line.576"></a> -<span class="sourceLineNo">577</span> if (f != null) {<a name="line.577"></a> -<span class="sourceLineNo">578</span> cell = f.transformCell(cell);<a name="line.578"></a> -<span class="sourceLineNo">579</span> }<a name="line.579"></a> -<span class="sourceLineNo">580</span><a name="line.580"></a> -<span class="sourceLineNo">581</span> this.countPerRow++;<a name="line.581"></a> -<span class="sourceLineNo">582</span> if (storeLimit > -1 && this.countPerRow > (storeLimit + storeOffset)) {<a name="line.582"></a> -<span class="sourceLineNo">583</span> // do what SEEK_NEXT_ROW does.<a name="line.583"></a> -<span class="sourceLineNo">584</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.584"></a> -<span class="sourceLineNo">585</span> close(false);// Do all cleanup except heap.close()<a name="line.585"></a> -<span class="sourceLineNo">586</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.586"></a> -<span class="sourceLineNo">587</span> }<a name="line.587"></a> -<span class="sourceLineNo">588</span> matcher.clearCurrentRow();<a name="line.588"></a> -<span class="sourceLineNo">589</span> seekToNextRow(cell);<a name="line.589"></a> -<span class="sourceLineNo">590</span> break LOOP;<a name="line.590"></a> -<span class="sourceLineNo">591</span> }<a name="line.591"></a> -<span class="sourceLineNo">592</span><a name="line.592"></a> -<span class="sourceLineNo">593</span> // add to results only if we have skipped #storeOffset kvs<a name="line.593"></a> -<span class="sourceLineNo">594</span> // also update metric accordingly<a name="line.594"></a> -<span class="sourceLineNo">595</span> if (this.countPerRow > storeOffset) {<a name="line.595"></a> -<span class="sourceLineNo">596</span> outResult.add(cell);<a name="line.596"></a> -<span class="sourceLineNo">597</span><a name="line.597"></a> -<span class="sourceLineNo">598</span> // Update local tracking information<a name="line.598"></a> -<span class="sourceLineNo">599</span> count++;<a name="line.599"></a> -<span class="sourceLineNo">600</span> totalBytesRead += cellSize;<a name="line.600"></a> -<span class="sourceLineNo">601</span><a name="line.601"></a> -<span class="sourceLineNo">602</span> // Update the progress of the scanner context<a name="line.602"></a> -<span class="sourceLineNo">603</span> scannerContext.incrementSizeProgress(cellSize,<a name="line.603"></a> -<span class="sourceLineNo">604</span> PrivateCellUtil.estimatedHeapSizeOf(cell));<a name="line.604"></a> -<span class="sourceLineNo">605</span> scannerContext.incrementBatchProgress(1);<a name="line.605"></a> -<span class="sourceLineNo">606</span><a name="line.606"></a> -<span class="sourceLineNo">607</span> if (matcher.isUserScan() && totalBytesRead > maxRowSize) {<a name="line.607"></a> -<span class="sourceLineNo">608</span> throw new RowTooBigException(<a name="line.608"></a> -<span class="sourceLineNo">609</span> "Max row size allowed: " + maxRowSize + ", but the row is bigger than that.");<a name="line.609"></a> -<span class="sourceLineNo">610</span> }<a name="line.610"></a> -<span class="sourceLineNo">611</span> }<a name="line.611"></a> -<span class="sourceLineNo">612</span><a name="line.612"></a> -<span class="sourceLineNo">613</span> if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_ROW) {<a name="line.613"></a> -<span class="sourceLineNo">614</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.614"></a> -<span class="sourceLineNo">615</span> close(false);// Do all cleanup except heap.close()<a name="line.615"></a> -<span class="sourceLineNo">616</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.616"></a> -<span class="sourceLineNo">617</span> }<a name="line.617"></a> -<span class="sourceLineNo">618</span> matcher.clearCurrentRow();<a name="line.618"></a> -<span class="sourceLineNo">619</span> seekOrSkipToNextRow(cell);<a name="line.619"></a> -<span class="sourceLineNo">620</span> } else if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_COL) {<a name="line.620"></a> -<span class="sourceLineNo">621</span> seekOrSkipToNextColumn(cell);<a name="line.621"></a> -<span class="sourceLineNo">622</span> } else {<a name="line.622"></a> -<span class="sourceLineNo">623</span> this.heap.next();<a name="line.623"></a> -<span class="sourceLineNo">624</span> }<a name="line.624"></a> -<span class="sourceLineNo">625</span><a name="line.625"></a> -<span class="sourceLineNo">626</span> if (scannerContext.checkBatchLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.626"></a> -<span class="sourceLineNo">627</span> break LOOP;<a name="line.627"></a> -<span class="sourceLineNo">628</span> }<a name="line.628"></a> -<span class="sourceLineNo">629</span> if (scannerContext.checkSizeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.629"></a> -<span class="sourceLineNo">630</span> break LOOP;<a name="line.630"></a> -<span class="sourceLineNo">631</span> }<a name="line.631"></a> -<span class="sourceLineNo">632</span> continue;<a name="line.632"></a> -<span class="sourceLineNo">633</span><a name="line.633"></a> -<span class="sourceLineNo">634</span> case DONE:<a name="line.634"></a> -<span class="sourceLineNo">635</span> // Optimization for Gets! If DONE, no more to get on this row, early exit!<a name="line.635"></a> -<span class="sourceLineNo">636</span> if (get) {<a name="line.636"></a> -<span class="sourceLineNo">637</span> // Then no more to this row... exit.<a name="line.637"></a> -<span class="sourceLineNo">638</span> close(false);// Do all cleanup except heap.close()<a name="line.638"></a> -<span class="sourceLineNo">639</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.639"></a> -<span class="sourceLineNo">640</span> }<a name="line.640"></a> -<span class="sourceLineNo">641</span> matcher.clearCurrentRow();<a name="line.641"></a> -<span class="sourceLineNo">642</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.642"></a> -<span class="sourceLineNo">643</span><a name="line.643"></a> -<span class="sourceLineNo">644</span> case DONE_SCAN:<a name="line.644"></a> -<span class="sourceLineNo">645</span> close(false);// Do all cleanup except heap.close()<a name="line.645"></a> -<span class="sourceLineNo">646</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.646"></a> -<span class="sourceLineNo">647</span><a name="line.647"></a> -<span class="sourceLineNo">648</span> case SEEK_NEXT_ROW:<a name="line.648"></a> -<span class="sourceLineNo">649</span> // This is just a relatively simple end of scan fix, to short-cut end<a name="line.649"></a> -<span class="sourceLineNo">650</span> // us if there is an endKey in the scan.<a name="line.650"></a> -<span class="sourceLineNo">651</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.651"></a> -<span class="sourceLineNo">652</span> close(false);// Do all cleanup except heap.close()<a name="line.652"></a> -<span class="sourceLineNo">653</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.653"></a> -<span class="sourceLineNo">654</span> }<a name="line.654"></a> -<span class="sourceLineNo">655</span> matcher.clearCurrentRow();<a name="line.655"></a> -<span class="sourceLineNo">656</span> seekOrSkipToNextRow(cell);<a name="line.656"></a> -<span class="sourceLineNo">657</span> NextState stateAfterSeekNextRow = needToReturn(outResult);<a name="line.657"></a> -<span class="sourceLineNo">658</span> if (stateAfterSeekNextRow != null) {<a name="line.658"></a> -<span class="sourceLineNo">659</span> return scannerContext.setScannerState(stateAfterSeekNextRow).hasMoreValues();<a name="line.659"></a> -<span class="sourceLineNo">660</span> }<a name="line.660"></a> -<span class="sourceLineNo">661</span> break;<a name="line.661"></a> -<span class="sourceLineNo">662</span><a name="line.662"></a> -<span class="sourceLineNo">663</span> case SEEK_NEXT_COL:<a name="line.663"></a> -<span class="sourceLineNo">664</span> seekOrSkipToNextColumn(cell);<a name="line.664"></a> -<span class="sourceLineNo">665</span> NextState stateAfterSeekNextColumn = needToReturn(outResult);<a name="line.665"></a> -<span class="sourceLineNo">666</span> if (stateAfterSeekNextColumn != null) {<a name="line.666"></a> -<span class="sourceLineNo">667</span> return scannerContext.setScannerState(stateAfterSeekNextColumn).hasMoreValues();<a name="line.667"></a> -<span class="sourceLineNo">668</span> }<a name="line.668"></a> -<span class="sourceLineNo">669</span> break;<a name="line.669"></a> -<span class="sourceLineNo">670</span><a name="line.670"></a> -<span class="sourceLineNo">671</span> case SKIP:<a name="line.671"></a> -<span class="sourceLineNo">672</span> this.heap.next();<a name="line.672"></a> -<span class="sourceLineNo">673</span> break;<a name="line.673"></a> -<span class="sourceLineNo">674</span><a name="line.674"></a> -<span class="sourceLineNo">675</span> case SEEK_NEXT_USING_HINT:<a name="line.675"></a> -<span class="sourceLineNo">676</span> Cell nextKV = matcher.getNextKeyHint(cell);<a name="line.676"></a> -<span class="sourceLineNo">677</span> if (nextKV != null) {<a name="line.677"></a> -<span class="sourceLineNo">678</span> seekAsDirection(nextKV);<a name="line.678"></a> -<span class="sourceLineNo">679</span> NextState stateAfterSeekByHint = needToReturn(outResult);<a name="line.679"></a> -<span class="sourceLineNo">680</span> if (stateAfterSeekByHint != null) {<a name="line.680"></a> -<span class="sourceLineNo">681</span> return scannerContext.setScannerState(stateAfterSeekByHint).hasMoreValues();<a name="line.681"></a> -<span class="sourceLineNo">682</span> }<a name="line.682"></a> -<span class="sourceLineNo">683</span> } else {<a name="line.683"></a> -<span class="sourceLineNo">684</span> heap.next();<a name="line.684"></a> -<span class="sourceLineNo">685</span> }<a name="line.685"></a> -<span class="sourceLineNo">686</span> break;<a name="line.686"></a> -<span class="sourceLineNo">687</span><a name="line.687"></a> -<span class="sourceLineNo">688</span> default:<a name="line.688"></a> -<span class="sourceLineNo">689</span> throw new RuntimeException("UNEXPECTED");<a name="line.689"></a> -<span class="sourceLineNo">690</span> }<a name="line.690"></a> -<span class="sourceLineNo">691</span> } while ((cell = this.heap.peek()) != null);<a name="line.691"></a> -<span class="sourceLineNo">692</span><a name="line.692"></a> -<span class="sourceLineNo">693</span> if (count > 0) {<a name="line.693"></a> -<span class="sourceLineNo">694</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.694"></a> -<span class="sourceLineNo">695</span> }<a name="line.695"></a> -<span class="sourceLineNo">696</span><a name="line.696"></a> -<span class="sourceLineNo">697</span> // No more keys<a name="line.697"></a> -<span class="sourceLineNo">698</span> close(false);// Do all cleanup except heap.close()<a name="line.698"></a> -<span class="sourceLineNo">699</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.699"></a> -<span class="sourceLineNo">700</span> }<a name="line.700"></a> -<span class="sourceLineNo">701</span><a name="line.701"></a> -<span class="sourceLineNo">702</span> /**<a name="line.702"></a> -<span class="sourceLineNo">703</span> * If the top cell won't be flushed into disk, the new top cell may be<a name="line.703"></a> -<span class="sourceLineNo">704</span> * changed after #reopenAfterFlush. Because the older top cell only exist<a name="line.704"></a> -<span class="sourceLineNo">705</span> * in the memstore scanner but the memstore scanner is replaced by hfile<a name="line.705"></a> -<span class="sourceLineNo">706</span> * scanner after #reopenAfterFlush. If the row of top cell is changed,<a name="line.706"></a> -<span class="sourceLineNo">707</span> * we should return the current cells. Otherwise, we may return<a name="line.707"></a> -<span class="sourceLineNo">708</span> * the cells across different rows.<a name="line.708"></a> -<span class="sourceLineNo">709</span> * @param outResult the cells which are visible for user scan<a name="line.709"></a> -<span class="sourceLineNo">710</span> * @return null is the top cell doesn't change. Otherwise, the NextState<a name="line.710"></a> -<span class="sourceLineNo">711</span> * to return<a name="line.711"></a> -<span class="sourceLineNo">712</span> */<a name="line.712"></a> -<span class="sourceLineNo">713</span> private NextState needToReturn(List<Cell> outResult) {<a name="line.713"></a> -<span class="sourceLineNo">714</span> if (!outResult.isEmpty() && topChanged) {<a name="line.714"></a> -<span class="sourceLineNo">715</span> return heap.peek() == null ? NextState.NO_MORE_VALUES : NextState.MORE_VALUES;<a name="line.715"></a> -<span class="sourceLineNo">716</span> }<a name="line.716"></a> -<span class="sourceLineNo">717</span> return null;<a name="line.717"></a> -<span class="sourceLineNo">718</span> }<a name="line.718"></a> -<span class="sourceLineNo">719</span><a name="line.719"></a> -<span class="sourceLineNo">720</span> private void seekOrSkipToNextRow(Cell cell) throws IOException {<a name="line.720"></a> -<span class="sourceLineNo">721</span> // If it is a Get Scan, then we know that we are done with this row; there are no more<a name="line.721"></a> -<span class="sourceLineNo">722</span> // rows beyond the current one: don't try to optimize.<a name="line.722"></a> -<span class="sourceLineNo">723</span> if (!get) {<a name="line.723"></a> -<span class="sourceLineNo">724</span> if (trySkipToNextRow(cell)) {<a name="line.724"></a> -<span class="sourceLineNo">725</span> return;<a name="line.725"></a> -<span class="sourceLineNo">726</span> }<a name="line.726"></a> -<span class="sourceLineNo">727</span> }<a name="line.727"></a> -<span class="sourceLineNo">728</span> seekToNextRow(cell);<a name="line.728"></a> -<span class="sourceLineNo">729</span> }<a name="line.729"></a> -<span class="sourceLineNo">730</span><a name="line.730"></a> -<span class="sourceLineNo">731</span> private void seekOrSkipToNextColumn(Cell cell) throws IOException {<a name="line.731"></a> -<span class="sourceLineNo">732</span> if (!trySkipToNextColumn(cell)) {<a name="line.732"></a> -<span class="sourceLineNo">733</span> seekAsDirection(matcher.getKeyForNextColumn(cell));<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><a name="line.736"></a> -<span class="sourceLineNo">737</span> /**<a name="line.737"></a> -<span class="sourceLineNo">738</span> * See if we should actually SEEK or rather just SKIP to the next Cell (see HBASE-13109).<a name="line.738"></a> -<span class="sourceLineNo">739</span> * ScanQueryMatcher may issue SEEK hints, such as seek to next column, next row,<a name="line.739"></a> -<span class="sourceLineNo">740</span> * or seek to an arbitrary seek key. This method decides whether a seek is the most efficient<a name="line.740"></a> -<span class="sourceLineNo">741</span> * _actual_ way to get us to the requested cell (SEEKs are more expensive than SKIP, SKIP,<a name="line.741"></a> -<span class="sourceLineNo">742</span> * SKIP inside the current, loaded block).<a name="line.742"></a> -<span class="sourceLineNo">743</span> * It does this by looking at the next indexed key of the current HFile. This key<a name="line.743"></a> -<span class="sourceLineNo">744</span> * is then compared with the _SEEK_ key, where a SEEK key is an artificial 'last possible key<a name="line.744"></a> -<span class="sourceLineNo">745</span> * on the row' (only in here, we avoid actually creating a SEEK key; in the compare we work with<a name="line.745"></a> -<span class="sourceLineNo">746</span> * the current Cell but compare as though it were a seek key; see down in<a name="line.746"></a> -<span class="sourceLineNo">747</span> * matcher.compareKeyForNextRow, etc). If the compare gets us onto the<a name="line.747"></a> -<span class="sourceLineNo">748</span> * next block we *_SEEK, otherwise we just SKIP to the next requested cell.<a name="line.748"></a> -<span class="sourceLineNo">749</span> *<a name="line.749"></a> -<span class="sourceLineNo">750</span> * <p>Other notes:<a name="line.750"></a> -<span class="sourceLineNo">751</span> * <ul><a name="line.751"></a> -<span class="sourceLineNo">752</span> * <li>Rows can straddle block boundaries</li><a name="line.752"></a> -<span class="sourceLineNo">753</span> * <li>Versions of columns can straddle block boundaries (i.e. column C1 at T1 might be in a<a name="line.753"></a> -<span class="sourceLineNo">754</span> * different block than column C1 at T2)</li><a name="line.754"></a> -<span class="sourceLineNo">755</span> * <li>We want to SKIP if the chance is high that we'll find the desired Cell after a<a name="line.755"></a> -<span class="sourceLineNo">756</span> * few SKIPs...</li><a name="line.756"></a> -<span class="sourceLineNo">757</span> * <li>We want to SEEK when the chance is high that we'll be able to seek<a name="line.757"></a> -<span class="sourceLineNo">758</span> * past many Cells, especially if we know we need to go to the next block.</li><a name="line.758"></a> -<span class="sourceLineNo">759</span> * </ul><a name="line.759"></a> -<span class="sourceLineNo">760</span> * <p>A good proxy (best effort) to determine whether SKIP is better than SEEK is whether<a name="line.760"></a> -<span class="sourceLineNo">761</span> * we'll likely end up seeking to the next block (or past the next block) to get our next column.<a name="line.761"></a> -<span class="sourceLineNo">762</span> * Example:<a name="line.762"></a> -<span class="sourceLineNo">763</span> * <pre><a name="line.763"></a> -<span class="sourceLineNo">764</span> * | BLOCK 1 | BLOCK 2 |<a name="line.764"></a> -<span class="sourceLineNo">765</span> * | r1/c1, r1/c2, r1/c3 | r1/c4, r1/c5, r2/c1 |<a name="line.765"></a> -<span class="sourceLineNo">766</span> * ^ ^<a name="line.766"></a> -<span class="sourceLineNo">767</span> * | |<a name="line.767"></a> -<span class="sourceLineNo">768</span> * Next Index Key SEEK_NEXT_ROW (before r2/c1)<a name="line.768"></a> +<span class="sourceLineNo">555</span> if (scannerContext.checkTimeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.555"></a> +<span class="sourceLineNo">556</span> return scannerContext.setScannerState(NextState.TIME_LIMIT_REACHED).hasMoreValues();<a name="line.556"></a> +<span class="sourceLineNo">557</span> }<a name="line.557"></a> +<span class="sourceLineNo">558</span> }<a name="line.558"></a> +<span class="sourceLineNo">559</span> // Do object compare - we set prevKV from the same heap.<a name="line.559"></a> +<span class="sourceLineNo">560</span> if (prevCell != cell) {<a name="line.560"></a> +<span class="sourceLineNo">561</span> ++kvsScanned;<a name="line.561"></a> +<span class="sourceLineNo">562</span> }<a name="line.562"></a> +<span class="sourceLineNo">563</span> checkScanOrder(prevCell, cell, comparator);<a name="line.563"></a> +<span class="sourceLineNo">564</span> int cellSize = PrivateCellUtil.estimatedSerializedSizeOf(cell);<a name="line.564"></a> +<span class="sourceLineNo">565</span> bytesRead += cellSize;<a name="line.565"></a> +<span class="sourceLineNo">566</span> prevCell = cell;<a name="line.566"></a> +<span class="sourceLineNo">567</span> scannerContext.setLastPeekedCell(cell);<a name="line.567"></a> +<span class="sourceLineNo">568</span> topChanged = false;<a name="line.568"></a> +<span class="sourceLineNo">569</span> ScanQueryMatcher.MatchCode qcode = matcher.match(cell);<a name="line.569"></a> +<span class="sourceLineNo">570</span> switch (qcode) {<a name="line.570"></a> +<span class="sourceLineNo">571</span> case INCLUDE:<a name="line.571"></a> +<span class="sourceLineNo">572</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.572"></a> +<span class="sourceLineNo">573</span> case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.573"></a> +<span class="sourceLineNo">574</span><a name="line.574"></a> +<span class="sourceLineNo">575</span> Filter f = matcher.getFilter();<a name="line.575"></a> +<span class="sourceLineNo">576</span> if (f != null) {<a name="line.576"></a> +<span class="sourceLineNo">577</span> cell = f.transformCell(cell);<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> this.countPerRow++;<a name="line.580"></a> +<span class="sourceLineNo">581</span> if (storeLimit > -1 && this.countPerRow > (storeLimit + storeOffset)) {<a name="line.581"></a> +<span class="sourceLineNo">582</span> // do what SEEK_NEXT_ROW does.<a name="line.582"></a> +<span class="sourceLineNo">583</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.583"></a> +<span class="sourceLineNo">584</span> close(false);// Do all cleanup except heap.close()<a name="line.584"></a> +<span class="sourceLineNo">585</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.585"></a> +<span class="sourceLineNo">586</span> }<a name="line.586"></a> +<span class="sourceLineNo">587</span> matcher.clearCurrentRow();<a name="line.587"></a> +<span class="sourceLineNo">588</span> seekToNextRow(cell);<a name="line.588"></a> +<span class="sourceLineNo">589</span> break LOOP;<a name="line.589"></a> +<span class="sourceLineNo">590</span> }<a name="line.590"></a> +<span class="sourceLineNo">591</span><a name="line.591"></a> +<span class="sourceLineNo">592</span> // add to results only if we have skipped #storeOffset kvs<a name="line.592"></a> +<span class="sourceLineNo">593</span> // also update metric accordingly<a name="line.593"></a> +<span class="sourceLineNo">594</span> if (this.countPerRow > storeOffset) {<a name="line.594"></a> +<span class="sourceLineNo">595</span> outResult.add(cell);<a name="line.595"></a> +<span class="sourceLineNo">596</span><a name="line.596"></a> +<span class="sourceLineNo">597</span> // Update local tracking information<a name="line.597"></a> +<span class="sourceLineNo">598</span> count++;<a name="line.598"></a> +<span class="sourceLineNo">599</span> totalBytesRead += cellSize;<a name="line.599"></a> +<span class="sourceLineNo">600</span><a name="line.600"></a> +<span class="sourceLineNo">601</span> // Update the progress of the scanner context<a name="line.601"></a> +<span class="sourceLineNo">602</span> scannerContext.incrementSizeProgress(cellSize,<a name="line.602"></a> +<span class="sourceLineNo">603</span> PrivateCellUtil.estimatedHeapSizeOf(cell));<a name="line.603"></a> +<span class="sourceLineNo">604</span> scannerContext.incrementBatchProgress(1);<a name="line.604"></a> +<span class="sourceLineNo">605</span><a name="line.605"></a> +<span class="sourceLineNo">606</span> if (matcher.isUserScan() && totalBytesRead > maxRowSize) {<a name="line.606"></a> +<span class="sourceLineNo">607</span> throw new RowTooBigException(<a name="line.607"></a> +<span class="sourceLineNo">608</span> "Max row size allowed: " + maxRowSize + ", but the row is bigger than that.");<a name="line.608"></a> +<span class="sourceLineNo">609</span> }<a name="line.609"></a> +<span class="sourceLineNo">610</span> }<a name="line.610"></a> +<span class="sourceLineNo">611</span><a name="line.611"></a> +<span class="sourceLineNo">612</span> if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_ROW) {<a name="line.612"></a> +<span class="sourceLineNo">613</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.613"></a> +<span class="sourceLineNo">614</span> close(false);// Do all cleanup except heap.close()<a name="line.614"></a> +<span class="sourceLineNo">615</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.615"></a> +<span class="sourceLineNo">616</span> }<a name="line.616"></a> +<span class="sourceLineNo">617</span> matcher.clearCurrentRow();<a name="line.617"></a> +<span class="sourceLineNo">618</span> seekOrSkipToNextRow(cell);<a name="line.618"></a> +<span class="sourceLineNo">619</span> } else if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_COL) {<a name="line.619"></a> +<span class="sourceLineNo">620</span> seekOrSkipToNextColumn(cell);<a name="line.620"></a> +<span class="sourceLineNo">621</span> } else {<a name="line.621"></a> +<span class="sourceLineNo">622</span> this.heap.next();<a name="line.622"></a> +<span class="sourceLineNo">623</span> }<a name="line.623"></a> +<span class="sourceLineNo">624</span><a name="line.624"></a> +<span class="sourceLineNo">625</span> if (scannerContext.checkBatchLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.625"></a> +<span class="sourceLineNo">626</span> break LOOP;<a name="line.626"></a> +<span class="sourceLineNo">627</span> }<a name="line.627"></a> +<span class="sourceLineNo">628</span> if (scannerContext.checkSizeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.628"></a> +<span class="sourceLineNo">629</span> break LOOP;<a name="line.629"></a> +<span class="sourceLineNo">630</span> }<a name="line.630"></a> +<span class="sourceLineNo">631</span> continue;<a name="line.631"></a> +<span class="sourceLineNo">632</span><a name="line.632"></a> +<span class="sourceLineNo">633</span> case DONE:<a name="line.633"></a> +<span class="sourceLineNo">634</span> // Optimization for Gets! If DONE, no more to get on this row, early exit!<a name="line.634"></a> +<span class="sourceLineNo">635</span> if (get) {<a name="line.635"></a> +<span class="sourceLineNo">636</span> // Then no more to this row... exit.<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> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.641"></a> +<span class="sourceLineNo">642</span><a name="line.642"></a> +<span class="sourceLineNo">643</span> case DONE_SCAN:<a name="line.643"></a> +<span class="sourceLineNo">644</span> close(false);// Do all cleanup except heap.close()<a name="line.644"></a> +<span class="sourceLineNo">645</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.645"></a> +<span class="sourceLineNo">646</span><a name="line.646"></a> +<span class="sourceLineNo">647</span> case SEEK_NEXT_ROW:<a name="line.647"></a> +<span class="sourceLineNo">648</span> // This is just a relatively simple end of scan fix, to short-cut end<a name="line.648"></a> +<span class="sourceLineNo">649</span> // us if there is an endKey in the scan.<a name="line.649"></a> +<span class="sourceLineNo">650</span> if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.650"></a> +<span class="sourceLineNo">651</span> close(false);// Do all cleanup except heap.close()<a name="line.651"></a> +<span class="sourceLineNo">652</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.652"></a> +<span class="sourceLineNo">653</span> }<a name="line.653"></a> +<span class="sourceLineNo">654</span> matcher.clearCurrentRow();<a name="line.654"></a> +<span class="sourceLineNo">655</span> seekOrSkipToNextRow(cell);<a name="line.655"></a> +<span class="sourceLineNo">656</span> NextState stateAfterSeekNextRow = needToReturn(outResult);<a name="line.656"></a> +<span class="sourceLineNo">657</span> if (stateAfterSeekNextRow != null) {<a name="line.657"></a> +<span class="sourceLineNo">658</span> return scannerContext.setScannerState(stateAfterSeekNextRow).hasMoreValues();<a name="line.658"></a> +<span class="sourceLineNo">659</span> }<a name="line.659"></a> +<span class="sourceLineNo">660</span> break;<a name="line.660"></a> +<span class="sourceLineNo">661</span><a name="line.661"></a> +<span class="sourceLineNo">662</span> case SEEK_NEXT_COL:<a name="line.662"></a> +<span class="sourceLineNo">663</span> seekOrSkipToNextColumn(cell);<a name="line.663"></a> +<span class="sourceLineNo">664</span> NextState stateAfterSeekNextColumn = needToReturn(outResult);<a name="line.664"></a> +<span class="sourceLineNo">665</span> if (stateAfterSeekNextColumn != null) {<a name="line.665"></a> +<span class="sourceLineNo">666</span> return scannerContext.setScannerState(stateAfterSeekNextColumn).hasMoreValues();<a name="line.666"></a> +<span class="sourceLineNo">667</span> }<a name="line.667"></a> +<span class="sourceLineNo">668</span> break;<a name="line.668"></a> +<span class="sourceLineNo">669</span><a name="line.669"></a> +<span class="sourceLineNo">670</span> case SKIP:<a name="line.670"></a> +<span class="sourceLineNo">671</span> this.heap.next();<a name="line.671"></a> +<span class="sourceLineNo">672</span> break;<a name="line.672"></a> +<span class="sourceLineNo">673</span><a name="line.673"></a> +<span class="sourceLineNo">674</span> case SEEK_NEXT_USING_HINT:<a name="line.674"></a> +<span class="sourceLineNo">675</span> Cell nextKV = matcher.getNextKeyHint(cell);<a name="line.675"></a> +<span class="sourceLineNo">676</span> if (nextKV != null) {<a name="line.676"></a> +<span class="sourceLineNo">677</span> seekAsDirection(nextKV);<a name="line.677"></a> +<span class="sourceLineNo">678</span> NextState stateAfterSeekByHint = needToReturn(outResult);<a name="line.678"></a> +<span class="sourceLineNo">679</span> if (stateAfterSeekByHint != null) {<a name="line.679"></a> +<span class="sourceLineNo">680</span> return scannerContext.setScannerState(stateAfterSeekByHint).hasMoreValues();<a name="line.680"></a> +<span class="sourceLineNo">681</span> }<a name="line.681"></a> +<span class="sourceLineNo">682</span> } else {<a name="line.682"></a> +<span class="sourceLineNo">683</span> heap.next();<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> default:<a name="line.687"></a> +<span class="sourceLineNo">688</span> throw new RuntimeException("UNEXPECTED");<a name="line.688"></a> +<span class="sourceLineNo">689</span> }<a name="line.689"></a> +<span class="sourceLineNo">690</span> } while ((cell = this.heap.peek()) != null);<a name="line.690"></a> +<span class="sourceLineNo">691</span><a name="line.691"></a> +<span class="sourceLineNo">692</span> if (count > 0) {<a name="line.692"></a> +<span class="sourceLineNo">693</span> return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.693"></a> +<span class="sourceLineNo">694</span> }<a name="line.694"></a> +<span class="sourceLineNo">695</span><a name="line.695"></a> +<span class="sourceLineNo">696</span> // No more keys<a name="line.696"></a> +<span class="sourceLineNo">697</span> close(false);// Do all cleanup except heap.close()<a name="line.697"></a> +<span class="sourceLineNo">698</span> return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.698"></a> +<span class="sourceLineNo">699</span> }<a name="line.699"></a> +<span class="sourceLineNo">700</span><a name="line.700"></a> +<span class="sourceLineNo">701</span> /**<a name="line.701"></a> +<span class="sourceLineNo">702</span> * If the top cell won't be flushed into disk, the new top cell may be<a name="line.702"></a> +<span class="sourceLineNo">703</span> * changed after #reopenAfterFlush. Because the older top cell only exist<a name="line.703"></a> +<span class="sourceLineNo">704</span> * in the memstore scanner but the memstore scanner is replaced by hfile<a name="line.704"></a> +<span class="sourceLineNo">705</span> * scanner after #reopenAfterFlush. If the row of top cell is changed,<a name="line.705"></a> +<span class="sourceLineNo">706</span> * we should return the current cells. Otherwise, we may return<a name="line.706"></a> +<span class="sourceLineNo">707</span> * the cells across different rows.<a name="line.707"></a> +<span class="sourceLineNo">708</span> * @param outResult the cells which are visible for user scan<a name="line.708"></a> +<span class="sourceLineNo">709</span> * @return null is the top cell doesn't change. Otherwise, the NextState<a name="line.709"></a> +<span class="sourceLineNo">710</span> * to return<a name="line.710"></a> +<span class="sourceLineNo">711</span> */<a name="line.711"></a> +<span class="sourceLineNo">712</span> private NextState needToReturn(List<Cell> outResult) {<a name="line.712"></a> +<span class="sourceLineNo">713</span> if (!outResult.isEmpty() && topChanged) {<a name="line.713"></a> +<span class="sourceLineNo">714</span> return heap.peek() == null ? NextState.NO_MORE_VALUES : NextState.MORE_VALUES;<a name="line.714"></a> +<span class="sourceLineNo">715</span> }<a name="line.715"></a> +<span class="sourceLineNo">716</span> return null;<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> private void seekOrSkipToNextRow(Cell cell) throws IOException {<a name="line.719"></a> +<span class="sourceLineNo">720</span> // If it is a Get Scan, then we know that we are done with this row; there are no more<a name="line.720"></a> +<span class="sourceLineNo">721</span> // rows beyond the current one: don't try to optimize.<a name="line.721"></a> +<span class="sourceLineNo">722</span> if (!get) {<a name="line.722"></a> +<span class="sourceLineNo">723</span> if (trySkipToNextRow(cell)) {<a name="line.723"></a> +<span class="sourceLineNo">724</span> return;<a name="line.724"></a> +<span class="sourceLineNo">725</span> }<a name="line.725"></a> +<span class="sourceLineNo">726</span> }<a name="line.726"></a> +<span class="sourceLineNo">727</span> seekToNextRow(cell);<a name="line.727"></a> +<span class="sourceLineNo">728</span> }<a name="line.728"></a> +<span class="sourceLineNo">729</span><a name="line.729"></a> +<span class="sourceLineNo">730</span> private void seekOrSkipToNextColumn(Cell cell) throws IOException {<a name="line.730"></a> +<span class="sourceLineNo">731</span> if (!trySkipToNextColumn(cell)) {<a name="line.731"></a> +<span class="sourceLineNo">732</span> seekAsDirection(matcher.getKeyForNextColumn(cell));<a name="line.732"></a> +<span class="sourceLineNo">733</span> }<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> /**<a name="line.736"></a> +<span class="sourceLineNo">737</span> * See if we should actually SEEK or rather just SKIP to the next Cell (see HBASE-13109).<a name="line.737"></a> +<span class="sourceLineNo">738</span> * ScanQueryMatcher may issue SEEK hints, such as seek to next column, next row,<a name="line.738"></a> +<span class="sourceLineNo">739</span> * or seek to an arbitrary seek key. This method decides whether a seek is the most efficient<a name="line.739"></a> +<span class="sourceLineNo">740</span> * _actual_ way to get us to the requested cell (SEEKs are more expensive than SKIP, SKIP,<a name="line.740"></a> +<span class="sourceLineNo">741</span> * SKIP inside the current, loaded block).<a name="line.741"></a> +<span class="sourceLineNo">742</span> * It does this by looking at the next indexed key of the current HFile. This key<a name="line.742"></a> +<span class="sourceLineNo">743</span> * is then compared with the _SEEK_ key, where a SEEK key is an artificial 'last possible key<a name="line.743"></a> +<span class="sourceLineNo">744</span> * on the row' (only in here, we avoid actually creating a SEEK key; in the compare we work with<a name="line.744"></a> +<span class="sourceLineNo">745</span> * the current Cell but compare as though it were a seek key; see down in<a name="line.745"></a> +<span class="sourceLineNo">746</span> * matcher.compareKeyForNextRow, etc). If the compare gets us onto the<a name="line.746"></a> +<span class="sourceLineNo">747</span> * next block we *_SEEK, otherwise we just SKIP to the next requested cell.<a name="line.747"></a> +<span class="sourceLineNo">748</span> *<a name="line.748"></a> +<span class="sourceLineNo">749</span> * <p>Other notes:<a name="line.749"></a> +<span class="sourceLineNo">750</span> * <ul><a name="line.750"></a> +<span class="sourceLineNo">751</span> * <li>Rows can straddle block boundaries</li><a name="line.751"></a> +<span class="sourceLineNo">752</span> * <li>Versions of columns can straddle block boundaries (i.e. column C1 at T1 might be in a<a name="line.752"></a> +<span class="sourceLineNo">753</span> * different block than column C1 at T2)</li><a name="line.753"></a> +<span class="sourceLineNo">754</span> * <li>We want to SKIP if the chance is high that we'll find the desired Cell after a<a name="line.754"></a> +<span class="sourceLineNo">755</span> * few SKIPs...</li><a name="line.755"></a> +<span class="sourceLineNo">756</span> * <li>We want to SEEK when the chance is high that we'll be able to seek<a name="line.756"></a> +<span class="sourceLineNo">757</span> * past many Cells, especially if we know we need to go to the next block.</li><a name="line.757"></a> +<span class="sourceLineNo">758</span> * </ul><a name="line.758"></a> +<span class="sourceLineNo">759</span> * <p>A good proxy (best effort) to determine whether SKIP is better than SEEK is whether<a name="line.759"></a> +<span class="sourceLineNo">760</span> * we'll likely end up seeking to the next block (or past the next block) to get our next column.<a name="line.760"></a> +<span class="sourceLineNo">761</span> * Example:<a name="line.761"></a> +<span class="sourceLineNo">762</span> * <pre><a name="line.762"></a> +<span class="sourceLineNo">763</span> * | BLOCK 1 | BLOCK 2 |<a name="line.763"></a> +<span class="sourceLineNo">764</span> * | r1/c1, r1/c2, r1/c3 | r1/c4, r1/c5, r2/c1 |<a name="line.764"></a> +<span class="sourceLineNo">765</span> * ^ ^<a name="line.765"></a> +<span class="sourceLineNo">766</span> * | |<a name="line.766"></a> +<span class="sourceLineNo">767</span> * Next Index Key SEEK_NEXT_ROW (before r2/c1)<a name="line.767"></a> +<span class="sourceLineNo">768</span> *<a name="line.768"></a> <span class="sourceLineNo">769</span> *<a name="line.769"></a> -<span class="sourceLineNo">770</span> *<a name="line.770"></a> -<span class="sourceLineNo">771</span> * | BLOCK 1 | BLOCK 2 |<a name="line.771"></a> -<span class="sourceLineNo">772</span> * | r1/c1/t5, r1/c1/t4, r1/c1/t3 | r1/c1/t2, r1/c1/T1, r1/c2/T3 |<a name="line.772"></a> -<span class="sourceLineNo">773</span> * ^ ^<a name="line.773"></a> -<span class="sourceLineNo">774</span> * | |<a name="line.774"></a> -<span class="sourceLineNo">775</span> * Next Index Key SEEK_NEXT_COL<a name="line.775"></a> -<span class="sourceLineNo">776</span> * </pre><a name="line.776"></a> -<span class="sourceLineNo">777</span> * Now imagine we want columns c1 and c3 (see first diagram above), the 'Next Index Key' of r1/c4<a name="line.777"></a> -<span class="sourceLineNo">778</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.778"></a> -<span class="sourceLineNo">779</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.779"></a> -<span class="sourceLineNo">780</span> * the 'Next Index Key', it would land us in the next block, so we should SEEK. In other scenarios<a name="line.780"></a> -<span class="sourceLineNo">781</span> * where the SEEK will not land us in the next block, it is very likely better to issues a series<a name="line.781"></a> -<span class="sourceLineNo">782</span> * of SKIPs.<a name="line.782"></a> -<span class="sourceLineNo">783</span> * @param cell current cell<a name="line.783"></a> -<span class="sourceLineNo">784</span> * @return true means skip to next row, false means not<a name="line.784"></a> -<span class="sourceLineNo">785</span> */<a name="line.785"></a> -<span class="sourceLineNo">786</span> @VisibleForTesting<a name="line.786"></a> -<span class="sourceLineNo">787</span> protected boolean trySkipToNextRow(Cell cell) throws IOException {<a name="line.787"></a> -<span class="sourceLineNo">788</span> Cell nextCell = null;<a name="line.788"></a> -<span class="sourceLineNo">789</span> do {<a name="line.789"></a> -<span class="sourceLineNo">790</span> Cell nextIndexedKey = getNextIndexedKey();<a name="line.790"></a> -<span class="sourceLineNo">791</span> if (nextIndexedKey != null && nextIndexedKey != KeyValueScanner.NO_NEXT_INDEXED_KEY<a name="line.791"></a> -<span class="sourceLineNo">792</span> && matcher.compareKeyForNextRow(nextIndexedKey, cell) >= 0) {<a name="line.792"></a> -<span class="sourceLineNo">793</span> this.heap.next();<a name="line.793"></a> -<span class="sourceLineNo">794</span> ++kvsScanned;<a name="line.794"></a> -<span class="sourceLineNo">795</span> } else {<a name="line.795"></a> -<span class="sourceLineNo">796</span> return false;<a name="line.796"></a> -<span class="sourceLineNo">797</span> }<a name="line.797"></a> -<span class="sourceLineNo">798</span> } while ((nextCell = this.heap.peek()) != null && CellUtil.matchingRows(cell, nextCell));<a name="line.798"></a> -<span class="sourceLineNo">799</span> return true;<a name="line.799"></a> -<span class="sourceLineNo">800</span> }<a name="line.800"></a> -<span class="sourceLineNo">801</span><a name="line.801"></a> -<span class="sourceLineNo">802</span> /**<a name="line.802"></a> -<span class="sourceLineNo">803</span> * See {@link org.apache.hadoop.hbase.regionserver.StoreScanner#trySkipToNextRow(Cell)}<a name="line.803"></a> -<span class="sourceLineNo">804</span> * @param cell current cell<a name="line.804"></a> -<span class="sourceLineNo">805</span> * @return true means skip to next column, false means not<a name="line.805"></a> -<span class="sourceLineNo">806</span> */<a name="line.806"></a> -<span class="sourceLineNo">807</span> @VisibleForTesting<a name="line.807"></a> -<span class="sourceLineNo">808</span> protected boolean trySkipToNextColumn(Cell cell) throws IOException {<a name="line.808"></a> -<span class="sourceLineNo">809</span> Cell nextCell = null;<a name="line.809"></a> -<span class="sourceLineNo">810</span> do {<a name="line.810"></a> -<span class="sourceLineNo">811</span> Cell nextIndexedKey = getNextIndexedKey();<a name="line.811"></a> -<span class="sourceLineNo">812</span> if (nextIndexedKey != null && nextIndexedKey != KeyValueScanner.NO_NEXT_INDEXED_KEY<a name="line.812"></a> -<span class="sourceLineNo">813</span> && matcher.compareKeyForNextColumn(nextIndexedKey, cell) >= 0) {<a name="line.813"></a> -<span class="sourceLineNo">814</span> this.heap.next();<a name="line.814"></a> -<span class="sourceLineNo">815</span> ++kvsScanned;<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.matchingRowColumn(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> @Override<a name="line.823"></a> -<span class="sourceLineNo">824</span> public long getReadPoint() {<a name="line.824"></a> -<span class="sourceLineNo">825</span> return this.readPt;<a name="line.825"></a> -<span class="sourceLineNo">826</span> }<a name="line.826"></a> -<span class="sourceLineNo">827</span><a name="line.827"></a> -<span class="sourceLineNo">828</span> private static void clearAndClose(List<KeyValueScanner> scanners) {<a name="line.828"></a> -<span class="sourceLineNo">829</span> for (KeyValueScanner s : scanners) {<a name="line.829"></a> -<span class="sourceLineNo">830</span> s.close();<a name="line.830"></a> -<span class="sourceLineNo">831</span> }<a name="line.831"></a> -<span class="sourceLineNo">832</span> scanners.clear();<a name="line.832"></a> -<span class="sourceLineNo">833</span> }<a name="line.833"></a> -<span class="sourceLineNo">834</span><a name="line.834"></a> -<span class="sourceLineNo">835</span> // Implementation of ChangedReadersObserver<a name="line.835"></a> -<span class="sourceLineNo">836</span> @Override<a name="line.836"></a> -<span class="sourceLineNo">837</span> public void updateReaders(List<HStoreFile> sfs, List<KeyValueScanner> memStoreScanners)<a name="line.837"></a> -<span class="sourceLineNo">838</span> throws IOException {<a name="line.838"></a> -<span class="sourceLineNo">839</span> if (CollectionUtils.isEmpty(sfs) && CollectionUtils.isEmpty(memStoreScanners)) {<a name="line.839"></a> -<span class="sourceLineNo">840</span> return;<a name="line.840"></a> -<span class="sourceLineNo">841</span> }<a name="line.841"></a> -<span class="sourceLineNo">842</span> flushLock.lock();<a name="line.842"></a> -<span class="sourceLineNo">843</span> try {<a name="line.843"></a> -<span class="sourceLineNo">844</span> flushed = true;<a name="line.844"></a> -<span class="sourceLineNo">845</span> final boolean isCompaction = false;<a name="line.845"></a> -<span class="sourceLineNo">846</span> boolean usePread = get || scanUsePread;<a name="line.846"></a> -<span class="sourceLineNo">847</span> // SEE HBASE-19468 where the flushed files are getting compacted even before a scanner<a name="line.847"></a> -<span class="sourceLineNo">848</span> // calls next(). So its better we create scanners here rather than next() call. Ensure<a name="line.848"></a> -<span class="sourceLineNo">849</span> // these scanners are properly closed() whether or not the scan is completed successfully<a name="line.849"></a> -<span class="sourceLineNo">850</span> // Eagerly creating scanners so that we have the ref counting ticking on the newly created<a name="line.850"></a> -<span class="sourceLineNo">851</span> // store files. In case of stream scanners this eager creation does not induce performance<a name="line.851"></a> -<span class="sourceLineNo">852</span> // penalty because in scans (that uses stream scanners) the next() call is bound to happen.<a name="line.852"></a> -<span class="sourceLineNo">853</span> List<KeyValueScanner> scanners = store.getScanners(sfs, cacheBlocks, get, usePread,<a name="line.853"></a> -<span class="sourceLineNo">854</span> isCompaction, matcher, scan.getStartRow(), scan.getStopRow(), this.readPt, false);<a name="line.854"></a> -<span class="sourceLineNo">855</span> flushedstoreFileScanners.addAll(scanners);<a name="line.855"></a> -<span class="sourceLineNo">856</span> if (!CollectionUtils.isEmpty(memStoreScanners)) {<a name="line.856"></a> -<span class="sourceLineNo">857</span> clearAndClose(memStoreScannersAfterFlush);<a name="line.857"></a> -<span class="sourceLineNo">858</span> memStoreScannersAfterFlush.addAll(memStoreScanners);<a name="line.858"></a> -<span class="sourceLineNo">859</span> }<a name="line.859"></a> -<span class="sourceLineNo">860</span> } finally {<a name="line.860"></a> -<span class="sourceLineNo">861</span> flushLock.unlock();<a name="line.861"></a> -<span class="sourceLineNo">862</span> }<a name="line.862"></a> -<span class="sourceLineNo">863</span> // Let the next() call handle re-creating and seeking<a name="line.863"></a> -<span class="sourceLineNo">864</span> }<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> * @return if top of heap has changed (and KeyValueHeap has to try the next KV)<a name="line.867"></a> -<span class="sourceLineNo">868</span> */<a name="line.868"></a> -<span class="sourceLineNo">869</span> protected final boolean reopenAfterFlush() throws IOException {<a name="line.869"></a> -<span class="sourceLineNo">870</span> // here we can make sure that we have a Store instance so no null check on store.<a name="line.870"></a> -<span class="sourceLineNo">871</span> Cell lastTop = heap.peek();<a name="line.871"></a> -<span class="sourceLineNo">872</span> // When we have the scan object, should we not pass it to getScanners() to get a limited set of<a name="line.872"></a> -<span class="sourceLineNo">873</span> // scanners? We did so in the constructor and we could have done it now by storing the scan<a name="line.873"></a> -<span class="sourceLineNo">874</span> // object from the constructor<a name="line.874"></a> -<span class="sourceLineNo">875</span> List<KeyValueScanner> scanners;<a name="line.875"></a> -<span class="sourceLineNo">876</span> flushLock.lock();<a name="line.876"></a> -<span class="sourceLineNo">877</span> try {<a name="line.877"></a> -<span class="sourceLineNo">878</span> List<KeyValueScanner> allScanners =<a name="line.878"></a> -<span class="sourceLineNo">879</span> new ArrayList<>(flushedstoreFileScanners.size() + memStoreScannersAfterFlush.size());<a name="line.879"></a> -<span class="sourceLineNo">880</span> allScanners.addAll(flushedstoreFileScanners);<a name="line.880"></a> -<span class="sourceLineNo">881</span> allScanners.addAll(memStoreScannersAfterFlush);<a name="line.881"></a> -<span class="sourceLineNo">882</span> scanners = selectScannersFrom(store, allScanners);<a name="line.882"></a> -<span class="sourceLineNo">883</span> // Clear the current set of flushed store files scanners so that they don't get added again<a name="line.883"></a> -<span class="sourceLineNo">884</span> flushedstoreFileScanners.clear();<a name="line.884"></a> -<span class="sourceLineNo">885</span> memStoreScannersAfterFlush.clear();<a name="line.885"></a> -<span class="sourceLineNo">886</span> } finally {<a name="line.886"></a> -<span class="sourceLineNo">887</span> flushLock.unlock();<a name="line.887"></a> -<span class="sourceLineNo">888</span> }<a name="line.888"></a> -<span class="sourceLineNo">889</span><a name="line.889"></a> -<span class="sourceLineNo">890</span> // Seek the new scanners to the last key<a name="line.890"></a> -<span class="sourceLineNo">891</span> seekScanners(scanners, lastTop, false, parallelSeekEnabled);<a name="line.891"></a> -<span class="sourceLineNo">892</span> // remove the older memstore scanner<a name="line.892"></a> -<span class="sourceLineNo">893</span> for (int i = currentScanners.size() - 1; i >=0; i--) {<a name="line.893"></a> -<span class="sourceLineNo">894</span> if (!currentScanners.get(i).isFileScanner()) {<a name="line.894"></a> -<span class="sourceLineNo">895</span> scannersForDelayedClose.add(currentScanners.remove(i));<a name="line.895"></a> -<span class="sourceLineNo">896</span> } else {<a name="line.896"></a> -<span class="sourceLineNo">897</span> // we add the memstore scanner to the end of currentScanners<a name="line.897"></a> -<span class="sourceLineNo">898</span> break;<a name="line.898"></a> -<span class="sourceLineNo">899</span> }<a name="line.899"></a> -<span class="sourceLineNo">900</span> }<a name="line.900"></a> -<span class="sourceLineNo">901</span> // add the newly created scanners on the flushed files and the current active memstore scanner<a name="line.901"></a> -<span class="sourceLineNo">902</span> addCurrentScanners(scanners);<a name="line.902"></a> -<span class="sourceLineNo">903</span> // Combine all seeked scanners with a heap<a name="line.903"></a> -<span class="sourceLineNo">904</span> resetKVHeap(this.currentScanners, store.getComparator());<a name="line.904"></a> -<span class="sourceLineNo">905</span> resetQueryMatcher(lastTop);<a name="line.905"></a> -<span class="sourceLineNo">906</span> if (heap.peek() == null || store.getComparator().compareRows(lastTop, this.heap.peek()) != 0) {<a name="line.906"></a> -<span class="sourceLineNo">907</span> LOG.info("Storescanner.peek() is changed where before = " + lastTop.toString() +<a name="line.907"></a> -<span class="sourceLineNo">908</span> ",and after = " + heap.peek());<a name="line.908"></a> -<span class="sourceLineNo">909</span> topChanged = true;<a name="line.909"></a> -<span class="sourceLineNo">910</span> } else {<a name="line.910"></a> -<span class="sourceLineNo">911</span> topChanged = false;<a name="line.911"></a> -<span class="sourceLineNo">912</span> }<a name="line.912"></a> -<span class="sourceLineNo">913</span> return topChanged;<a name="line.913"></a> -<span class="sourceLineNo">914</span> }<a name="line.914"></a> -<span class="sourceLineNo">915</span><a name="line.915"></a> -<span class="sourceLineNo">916</span> private void resetQueryMatcher(Cell lastTopKey) {<a name="line.916"></a> -<span class="sourceLineNo">917</span> // Reset the state of the Query Matcher and set to top row.<a name="line.917"></a> -<span class="sourceLineNo">918</span> // Only reset and call setRow if the row changes; avoids confusing the<a name="line.918"></a> -<span class="sourceLineNo">919</span> // query matcher if scanning intra-row.<a name="line.919"></a> -<span class="sourceLineNo">920</span> Cell cell = heap.peek();<a name="line.920"></a> -<span class="sourceLineNo">921</span> if (cell == null) {<a name="line.921"></a> -<span class="sourceLineNo">922</span> cell = lastTopKey;<a name="line.922"></a> -<span class="sourceLineNo">923</span> }<a name="line.923"></a> -<span class="sourceLineNo">924</span> if ((matcher.currentRow() == null) || !CellUtil.matchingRows(cell, matcher.currentRow())) {<a name="line.924"></a> -<span class="sourceLineNo">925</span> this.countPerRow = 0;<a name="line.925"></a> -<span class="sourceLineNo">926</span> // The setToNewRow will call reset internally<a name="line.926"></a> -<span class="sourceLineNo">927</span> matcher.setToNewRow(cell);<a name="line.927"></a> -<span class="sourceLineNo">928</span> }<a name="line.928"></a> -<span class="sourceLineNo">929</span> }<a name="line.929"></a> -<span class="sourceLineNo">930</span><a name="line.930"></a> -<span class="sourceLineNo">931</span> /**<a name="line.931"></a> -<span class="sourceLineNo">932</span> * Check whether scan as expected order<a name="line.932"></a> -<span class="sourceLineNo">933</span> * @param prevKV<a name="line.933"></a> -<span class="sourceLineNo">934</span> * @param kv<a name="line.934"></a> -<span class="sourceLineNo">935</span> * @param comparator<a name="line.935"></a> -<span class="sourceLineNo">936</span> * @throws IOException<a name="line.936"></a> -<span class="sourceLineNo">937</span> */<a name="line.937"></a> -<span class="sourceLineNo">938</span> protected void checkScanOrder(Cell prevKV, Cell kv,<a name="line.938"></a> -<span class="sourceLineNo">939</span> CellComparator comparator) throws IOException {<a name="line.939"></a> -<span class="sourceLineNo">940</span> // Check that the heap gives us KVs in an increasing order.<a name="line.940"></a> -<span class="sourceLineNo">941</span> assert prevKV == null || comparator == null<a name="line.941"></a> -<span class="sourceLineNo">942</span> || comparator.compare(prevKV, kv) <= 0 : "Key " + prevKV<a name="line.942"></a> -<span class="sourceLineNo">943</span> + " followed by a " + "smaller key " + kv + " in cf " + store;<a name="line.943"></a> -<span class="sourceLineNo">944</span> }<a name="line.944"></a> -<span class="sourceLineNo">945</span><a name="line.945"></a> -<span class="sourceLineNo">946</span> protected boolean seekToNextRow(Cell c) throws IOException {<a name="line.946"></a> -<span class="sourceLineNo">947</span> return reseek(PrivateCellUtil.createLastOnRow(c));<a name="line.947"></a> -<span class="sourceLineNo">948</span> }<a name="line.948"></a> -<span class="sourceLineNo">949</span><a name="line.949"></a> -<span class="sourceLineNo">950</span> /**<a name="line.950"></a> -<span class="sourceLineNo">951</span> * Do a reseek in a normal StoreScanner(scan forward)<a name="line.951"></a> -<span class="sourceLineNo">952</span> * @param kv<a name="line.952"></a> -<span class="sourceLineNo">953</span> * @return true if scanner has values left, false if end of scanner<a name="line.953"></a> -<span class="sourceLineNo">954</span> * @throws IOException<a name="line.954"></a> -<span class="sourceLineNo">955</span> */<a name="line.955"></a> -<span class="sourceLineNo">956</span> protected boolean seekAsDirection(Cell kv)<a name="line.956"></a> -<span class="sourceLineNo">957</span> throws IOException {<a name="line.957"></a> -<span class="sourceLineNo">958</span> return reseek(kv);<a name="line.958"></a> -<span class="sourceLineNo">959</span> }<a name="line.959"></a> -<span class="sourceLineNo">960</span><a name="line.960"></a> -<span class="sourceLineNo">961</span> @Override<a name="line.961"></a> -<span class="sourceLineNo">962</span> public boolean reseek(Cell kv) throws IOException {<a name="line.962"></a> -<span class="sourceLineNo">963</span> if (checkFlushed()) {<a name="line.963"></a> -<span class="sourceLineNo">964</span> reopenAfterFlush();<a name="line.964"></a> -<span class="sourceLineNo">965</span> }<a name="line.965"></a> -<span class="sourceLineNo">966</span> if (explicitColumnQuery && lazySeekEnabledGlobally) {<a name="line.966"></a> -<span class="sourceLineNo">967</span> return heap.requestSeek(kv, true, useRowColBloom);<a name="line.967"></a> -<span class="sourceLineNo">968</span> }<a name="line.968"></a> -<span class="sourceLineNo">969</span> return heap.reseek(kv);<a name="line.969"></a> -<span class="sourceLineNo">970</span> }<a name="line.970"></a> -<span class="sourceLineNo">971</span><a name="line.971"></a> -<span class="sourceLineNo">972</span> @VisibleForTesting<a name="line.972"></a> -<span class="sourceLineNo">973</span> void trySwitchToStreamRead() {<a name="line.973"></a> -<span class="sourceLineNo">974</span> if (readType != Scan.ReadType.DEFAULT || !scanUsePread || closing ||<a name="line.974"></a> -<span class="sourceLineNo">975</span> heap.peek() == null || bytesRead < preadMaxBytes) {<a name="line.975"></a> -<span class="sourceLineNo">976</span> return;<a name="line.976"></a> -<span class="sourceLineNo">977</span> }<a name="line.977"></a> -<span class="sourceLineNo">978</span> if (LOG.isDebugEnabled()) {<a name="line.978"></a> -<span class="sourceLineNo">979</span> LOG.debug("Switch to stream read because we have already read " + bytesRead +<a name="line.979"></a> -<span class="sourceLineNo">980</span> " bytes from this scanner");<a name="line.980"></a> -<span class="sourceLineNo">981</span> }<a name="line.981"></a> -<span class="sourceLineNo">982</span> scanUsePread = false;<a name="line.982"></a> -<span class="sourceLineNo">983</span> Cell lastTop = heap.peek();<a name="line.983"></a> -<span class="sourceLineNo">984</span> List<KeyValueScanner> memstoreScanners = new ArrayList<>();<a name="line.984"></a> -<span class="sourceLineNo">985</span> List<KeyValueScanner> scannersToClose = new ArrayList<>();<a name="line.985"></a> -<span class="sourceLineNo">986</span> for (KeyValueScanner kvs : currentScanners) {<a name="line.986"></a> -<span class="sourceLineNo">987</span> if (!kvs.isFileScanner()) {<a name="line.987"></a> -<span class="sourceLineNo">988</span> // collect memstorescanners here<a name="line.988"></a> -<span class="sourceLineNo">989</span> memstoreScanners.add(kvs);<a name="line.989"></a> -<span class="sourceLineNo">990</span> } else {<a name="line.990"></a> -<span class="sourceLineNo">991</span> scannersToClose.add(kvs);<a name="line.991"></a> -<span class="sourceLineNo">992</span> }<a name="line.992"></a> -<span class="sourceLineNo">993</span> }<a name="line.993"></a> -<span class="sourceLineNo">994</span> List<KeyValueScanner> fileScanners = null;<a name="line.994"></a> -<span class="sourceLineNo">995</span> List<KeyValueScanner> newCurrentScanners;<a name="line.995"></a> -<span class="sourceLineNo">996</span> KeyValueHeap newHeap;<a name="line.996"></a> -<span class="sourceLineNo">997</span> try {<a name="line.997"></a> -<span class="sourceLineNo">998</span> // We must have a store instance here so no null check<a name="line.998"></a> -<span class="sourceLineNo">999</span> // recreate the scanners on the current file scanners<a name="line.999"></a> -<span class="sourceLineNo">1000</span> fileScanners = store.recreateScanners(scannersToClose, cacheBlocks, false, false,<a name="line.1000"></a> -<span class="sourceLineNo">1001</span> matcher, scan.getStartRow(), scan.includeStartRow(), scan.getStopRow(),<a name="line.1001"></a> -<span class="sourceLineNo">1002</span> scan.includeStopRow(), readPt, false);<a name="line.1002"></a> -<span class="sourceLineNo">1003</span> if (fileScanners == null) {<a name="line.1003"></a> -<span class="sourceLineNo">1004</span> return;<a name="line.1004"></a> -<span class="sourceLineNo">1005</span> }<a name="line.1005"></a> -<span class="sourceLineNo">1006</span> seekScanners(fileScanners, lastTop, false, parallelSeekEnabled);<a name="line.1006"></a> -<span class="sourceLineNo">1007</span> newCurrentScanners = new ArrayList<>(fileScanners.size() + memstoreScanners.size());<a name="line.1007"></a> -<span class="sourceLineNo">1008</span> newCurrentScanners.addAll(fileScanners);<a name="line.1008"></a> -<span class="sourceLineNo">1009</span> newCurrentScanners.addAll(memstoreScanners);<a name="line.1009"></a> -<span class="sourceLineNo">1010</span> newHeap = new KeyValueHeap(newCurrentScanners, comparator);<a name="line.1010"></a> -<span class="sourceLineNo">1011</span> } catch (Exception e) {<a name="line.1011"></a> -<span class="sourceLineNo">1012</span> LOG.warn("failed to switch to stream read", e);<a name="line.1012"></a> -<span class="sourceLineNo">1013</span> if (fileScanners != null) {<a name="line.1013"></a> -<span class="sourceLineNo">1014</span> fileScanners.forEach(KeyValueScanner::close);<a name="line.1014"></a> -<span class="sourceLineNo">1015</span> }<a name="line.1015"></a> -<span class="sourceLineNo">1016</span> return;<a name="line.1016"></a> -<span class="sourceLineNo">1017</span> }<a name="line.1017"></a> -<span class="sourceLineNo">1018</span> currentScanners.clear();<a name="line.1018"></a> -<span class="sourceLineNo">1019</span> addCurrentScanners(newCurrentScanners);<a name="line.1019"></a> -<span class="sourceLineNo">1020</span> this.heap = newHeap;<a name="line.1020"></a> -<span class="sourceLineNo">1021</span> resetQueryMatcher(lastTop);<a name="line.1021"></a> -<span class="sourceLineNo">1022</span> scannersToClose.forEach(KeyValueScanner::close);<a name="line.1022"></a> -<span class="sourceLineNo">1023</span> }<a name="line.1023"></a> -<span class="sourceLineNo">1024</span><a name="line.1024"></a> -<span class="sourceLineNo">1025</span> protected final boolean checkFlushed() {<a name="line.1025"></a> -<span class="sourceLineNo">1026</span> // check the var without any lock. Suppose even if we see the old<a name="line.1026"></a> -<span class="sourceLineNo">1027</span> // value here still it is ok to continue because we will not be resetting<a name="line.1027"></a> -<span class="sourceLineNo">1028</span> // the heap but will continue with the referenced memstore's snapshot. For compactions<a name="line.1028"></a> -<span class="sourceLineNo">1029</span> // any way we don't need the updateReaders at all to happen as we still continue with<a name="line.1029"></a> -<span class="sourceLineNo">1030</span> // the older files<a name="line.1030"></a> -<span class="sourceLineNo">1031</span> if (flushed) {<a name="line.1031"></a> -<span class="sourceLineNo">1032</span> // If there is a flush and the current scan is notified on the flush ensure that the<a name="line.1032"></a> -<span class="sourceLineNo">1033</span> // scan's heap gets reset and we do a seek on the newly flushed file.<a name="line.1033"></a> -<span class="sourceLineNo">1034</span> if (this.closing) {<a name="line.1034"></a> -<span class="sourceLineNo">1035</span> return false;<a name="line.1035"></a> -<span class="sourceLineNo">1036</span> }<a name="line.1036"></a> -<span class="sourceLineNo">1037</span> // reset the flag<a name="line.1037"></a> -<span class="sourceLineNo">1038</span> flushed = false;<a name="line.1038"></a> -<span class="sourceLineNo">1039</span> return true;<a name="line.1039"></a> -<span class="sourceLineNo">1040</span> }<a name="line.1040"></a> -<span class="sourceLineNo">1041</span> return false;<a name="line.1041"></a> -<span class="sourceLineNo">1042</span> }<a name="line.1042"></a> -<span class="sourceLineNo">1043</span><a name="line.1043"></a> -<span class="sourceLineNo">1044</span> /**<a name="line.1044"></a> -<span class="sourceLineNo">1045</span> * @see KeyValueScanner#getScannerOrder()<a name="line.1045"></a> -<span class="sourceLineNo">1046</span> */<a name="line.1046"></a> -<span class="sourceLineNo">1047</span> @Override<a name="line.1047"></a> -<span class="sourceLineNo">1048</span> public long getScannerOrder() {<a name="line.1048"></a> -<span class="sourceLineNo">1049</span> return 0;<a name="line.1049"></a> -<span class="sourceLineNo">1050</span> }<a name="line.1050"></a> -<span class="sourceLineNo">1051</span><a name="line.1051"></a> -<span class="sourceLineNo">1052</span> /**<a name="line.1052"></a> -<span class="sourceLineNo">1053</span> * Seek storefiles in parallel to optimize IO latency as much as possible<a name="line.1053"></a> -<span class="sourceLineNo">1054</span> * @param scanners the list {@link KeyValueScanner}s to be read from<a name="line.1054"></a> -<span class="sourceLineNo">1055</span> * @param kv the KeyValue on which the operation is being requested<a name="line.1055"></a> -<span class="sourceLineNo">1056</span> * @throws IOException<a name="line.1056"></a> -<span class="sourceLineNo">1057</span> */<a name="line.1057"></a> -<span class="sourceLineNo">1058</span> private void parallelSeek(final List<? extends KeyValueScanner><a name="line.1058"></a> -<span class="sourceLineNo">1059</span> scanners, final Cell kv) throws IOException {<a name="line.1059"></a> -<span class="sourceLineNo">1060</span> if (scanners.isEmpty()) return;<a name="line.1060"></a> -<span class="sourceLineNo">1061</span> int storeFileScannerCount = scanners.size();<a name="line.1061"></a> -<span class="sourceLineNo">1062</span> CountDownLatch latch = new CountDownLatch(storeFileScannerCount);<a name="line.1062"></a> -<span class="sourceLineNo">1063</span> List<ParallelSeekHandler> handlers = new ArrayList<>(storeFileScannerCount);<a name="line.1063"></a> -<span class="sourceLineNo">1064</span> for (KeyValueScanner scanner : scanners) {<a name="line.1064"></a> -<span class="sourceLineNo">1065</span> if (scanner instanceof StoreFileScanner) {<a name="line.1065"></a> -<span class="sourceLineNo">1066</span> ParallelSeekHandler seekHandler = new ParallelSeekHandler(scanner, kv,<a name="line.1066"></a> -<span class="sourceLineNo">1067</span> this.readPt, latch);<a name="line.1067"></a> -<span class="sourceLineNo">1068</span> executor.submit(seekHandler);<a name="line.1068"></a> -<span class="sourceLineNo">1069</span> handlers.add(seekHandler);<a name="line.1069"></a> -<span class="sourceLineNo">1070</span> } else {<a name="line.1070"></a> -<span class="sourceLineNo">1071</span> scanner.seek(kv);<a name="line.1071"></a> -<span class="sourceLineNo">1072</span> latch.countDown();<a name="line.1072"></a> -<span class="sourceLineNo">1073</span> }<a name="line.1073"></a> -<span class="sourceLineNo">1074</span> }<a name="line.1074"></a> -<span class="sourceLineNo">1075</span><a name="line.1075"></a> -<span class="sourceLineNo">1076</span> try {<a name="line.1076"></a> -<span class="sourceLineNo">1077</span> latch.await();<a name="line.1077"></a> -<span class="sourceLineNo">1078</span> } catch (InterruptedException ie) {<a name="line.1078"></a> -<span class="sourceLineNo">1079</span> throw (InterruptedIOException)new InterruptedIOException().initCause(ie);<a name="line.1079"></a> -<span class="sourceLineNo">1080</span> }<a name="line.1080"></a> -<span class="sourceLineNo">1081</span><a name="line.1081"></a> -<span class="sourceLineNo">1082</span> for (ParallelSeekHandler handler : handlers) {<a name="line.1082"></a> -<span class="sourceLineNo">1083</span> if (handler.getErr() != null) {<a name="line.1083"></a> -<span class="sourceLineNo">1084</span> throw new IOException(handler.getErr());<a name="line.1084"></a> -<span class="sourceLineNo">1085</span> }<a name="line.1085"></a> -<span class="sourceLineNo">1086</span> }<a name="line.1086"></a> -<span class="sourceLineNo">1087</span> }<a name="line.1087"></a> -<span class="sourceLineNo">1088</span><a name="line.1088"></a> -<span class="sourceLineNo">1089</span> /**<a name="line.1089"></a> -<span class="sourceLineNo">1090</span> * Used in testing.<a name="line.1090"></a> -<span class="sourceLineNo">1091</span> * @return all scanners in no particular order<a name="line.1091"></a> -<span class="sourceLineNo">1092</span> */<a name="line.1092"></a> -<span class="sourceLineNo">1093</span> @VisibleForTesting<a name="line.1093"></a> -<span class="sourceLineNo">1094</span> List<KeyValueScanner> getAllScannersForTesting() {<a name="line.1094"></a> -<span class="sourceLineNo">1095</span> List<KeyValueScanner> allScanners = new ArrayList<>();<a name="line.1095"></a> -<span class="sourceLineNo">1096</span> KeyValueScanner current = heap.getCurrentForTesting();<a name="line.1096"></a> -<span class="sourceLineNo">1097</span> if (current != null)<a name="line.1097"></a> -<span class="sourceLineNo">1098</span> allScanners.add(current);<a name="line.1098"></a> -<span class="sourceLineNo">1099</span> for (KeyValueScanner scanner : heap.getHeap())<a name="line.1099"></a> -<span class="sourceLineNo">1100</span> allScanners.add(scanner);<a name="line.1100"></a> -<span class="sourceLineNo">1101</span> return allScanners;<a name="line.1101"></a> -<span class="sourceLineNo">1102</span> }<a name="line.1102"></a> -<span class="sourceLineNo">1103</span><a name="line.1103"></a> -<span class="sourceLineNo">1104</span> static void enableLazySeekGlobally(boolean enable) {<a name="line.1104"></a> -<span class="sourceLineNo">1105</span> lazySeekEnabledGlobally = enable;<a name="line.1105"></a> -<span class="sourceLineNo">1106</span> }<a name="line.1106"></a> -<span class="sourceLineNo">1107</span><a name="line.1107"></a> -<span class="sourceLineNo">1108</span> /**<a name="line.1108"></a> -<span class="sourceLineNo">1109</span> * @return The estimated number of KVs seen by this scanner (includes some skipped KVs).<a name="line.1109"></a> -<span class="sourceLineNo">1110</span> */<a name="line.1110"></a> -<span class="sourceLineNo">1111</span> public long getEstimatedNumberOfKvsScanned() {<a name="line.1111"></a> -<span class="sourceLineNo">1112</span> return this.kvsScanned;<a name="line.1112"></a> -<span class="sourceLineNo">1113</span> }<a name="line.1113"></a> -<span class="sourceLineNo">1114</span><a name="line.1114"></a> -<span class="sourceLineNo">1115</span> @Override<a name="line.1115"></a> -<span class="sourceLineNo">1116</span> public Cell getNextIndexedKey() {<a name="line.1116"></a> -<span class="sourceLineNo">1117</span> return this.heap.getNextIndexedKey();<a name="line.1117"></a> -<span class="sourceLineNo">1118</span> }<a name="line.1118"></a> -<span class="sourceLineNo">1119</span><a name="line.1119"></a> -<span class="sourceLineNo">1120</span> @Override<a name="line.1120"></a> -<span class="sourceLineNo">1121</span> public void shipped() throws IOException {<a name="line.1121"></a> -<span class="sourceLineNo">1122</span> if (prevCell != null) {<a name="line.1122"></a> -<span class="sourceLineNo">1123</span> // Do the copy here so that in case the prevCell ref is pointing to the previous<a name="line.1123"></a> -<span class="sourceLineNo">1124</span> // blocks we can safely release those blocks.<a name="line.1124"></a> -<span class="sourceLineNo">1125</span> // This applies to blocks that are got from Bucket cache, L1 cache and the blocks<a name="line.1125"></a> -<span class="sourceLineNo">1126</span> // fetched from HDFS. Copying this would ensure that we let go the references to these<a name="line.1126"></a> -<span class="sourceLineNo">1127</span> // blocks so that they can be GCed safely(in case of bucket cache)<a name="line.1127"></a> -<span class="sourceLineNo">1128</span> prevCell = KeyValueUtil.toNewKeyCell(this.prevCell);<a name="line.1128"></a> -<span class="sourceLineNo">1129</span> }<a name="line.1129"></a> -<span class="sourceLineNo">1130</span> matcher.beforeShipped();<a name="line.1130"></a> -<span class="sourceLineNo">1131</span> // There wont be further fetch of Cells from these scanners. Just close.<a name="line.1131"></a> -<span class="sourceLineNo">1132</span> clearAndClose(scannersForDelayedClose);<a name="line.1132"></a> -<span class="sourceLineNo">1133</span> if (this.heap != null) {<a name="line.1133"></a> -<span class="sourceLineNo">1134</span> this.heap.shipped();<a name="line.1134"></a> -<span class="sourceLineNo">1135</span> // When switching from pread to stream, we will open a new scanner for each store file, but<a name="line.1135"></a> -<span class="sourceLineNo">1136</span> // the old scanner may still track the HFileBlocks we have scanned but not sent back to client<a name="line.1136"></a> -<span class="sourceLineNo">1137</span> // yet. If we close the scanner immediately then the HFileBlocks may be messed up by others<a name="line.1137"></a> -<span class="sourceLineNo">1138</span> // before we serialize and send it back to client. The HFileBlocks will be released in shipped<a name="line.1138"></a> -<span class="sourceLineNo">1139</span> // method, so we here will also open new scanners and close old scanners in shipped method.<a name="line.1139"></a> -<span class="sourceLineNo">1140</span> // See HBASE-18055 for more details.<a name="line.1140"></a> -<span class="sourceLineNo">1141</span> trySwitchToStreamRead();<a name="line.1141"></a> -<span class="sourceLineNo">1142</span> }<a name="line.1142"></a> -<span class="sourceLineNo">1143</span> }<a name="line.1143"></a> -<span class="sourceLineNo">1144</span>}<a name="line.1144"></a> -<span class="sourceLineNo">1145</span><a name="line.1145"></a> +<span class="sourceLineNo">770</span> * | BLOCK 1 | BLOCK 2 |<a name="line.770"></a> +<span class="sourceLineNo">771</span> * | r1/c1/t5, r1/c1/t4, r1/c1/t3 | r1/c1/t2, r1/c1/T1, r1/c2/T3 |<a name="line.771"></a> +<span class="sourceLineNo">772</span> * ^ ^<a name="line.772"></a> +<span class="sourceLineNo">773</span> * | |<a name="line.773"></a> +<span class="sourceLineNo">774</span> * Next Index Key SEEK_NEXT_COL<a name="line.774"></a> +<span class="sourceLineNo">775</span> * </pre><a name="line.775"></a> +<span class="sourceLineNo">776</span> * Now imagine we want columns c1 and c3 (see first diagram above), the 'Next Index Key' of r1/c4<a name="line.776"></a> +<span class="sourceLineNo">777</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.777"></a> +<span class="sourceLineNo">778</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.778"></a> +<span class="sourceLineNo">779</span> * the 'Next Index Key', it would land us in the next block, so we should SEEK. In other scenarios<a name="line.779"></a> +<span class="sourceLineNo">780</span> * where the SEEK will not land us in the next block, it is very likely better to issues a series<a name="line.780"></a> +<span class="sourceLineNo">781</span> * of SKIPs.<a name="line.781"></a> +<span class="sourceLineNo">782</span> * @param cell current cell<a name="line.782"></a> +<span class="sourceLineNo">783</span> * @return true means skip to next row, false means not<a name="line.783"></a> +<span class="sourceLineNo">784</span> */<a name="line.784"></a> +<span class="sourceLineNo">785</span> @VisibleForTesting<a name="line.785"></a> +<span class="sourceLineNo">786</span> protected boolean trySkipToNextRow(Cell cell) throws IOException {<a name="line.786"></a> +<span class="sourceLineNo">787</span> Cell nextCell = null;<a name="line.787"></a> +<span class="sourceLineNo">788</span> do {<a name="line.788"></a> +<span class="sourceLineNo">789</span> Cell nextIndexedKey = getNextIndexedKey();<a name="line.789"></a> +<span class="sourceLineNo">790</span> if (nextIndexedKey != null && nextIndexedKey != KeyValueScanner.NO_NEXT_INDEXED_KEY<a name="line.790"></a> +<span class="sourceLineNo">791</span> && matcher.compareKeyForNextRow(nextIndexedKey, cell) >= 0) {<a name="line.791"></a> +<span class="sourceLineNo">792</span> this.heap.next();<a name="line.792"></a> +<span class="sourceLineNo">793</span> ++kvsScanned;<a name="line.793"></a> +<span class="sourceLineNo">794</span> } else {<a name="line.794"></a> +<span class="sourceLineNo">795</span> return false;<a name="line.795"></a> +<span class="sourceLineNo">796</span> }<a name="line.796"></a> +<span class="sourceLineNo">797</span> } while ((nextCell = this.heap.peek()) != null && CellUtil.matchingRows(cell, nextCell));<a name="line.797"></a> +<span class="sourceLineNo">798</span> return true;<a name="line.798"></a> +<span class="sourceLineNo">799</span> }<a name="line.799"></a> +<span class="sourceLineNo">800</span><a name="line.800"></a> +<span class="sourceLineNo">801</span> /**<a name="line.801"></a> +<span class="sourceLineNo">802</span> * See {@link org.apache.hadoop.hbase.regionserver.StoreScanner#trySkipToNextRow(Cell)}<a name="line.802"></a> +<span class="sourceLineNo">803</span> * @param cell current cell<a name="line.803"></a> +<span class="sourceLineNo">804</span> * @return true means skip to next column, false means not<a name="line.804"></a> +<span class="sourceLineNo">805</span> */<a name="line.805"></a> +<span class="sourceLineNo">806</span> @VisibleForTesting<a name="line.806"></a> +<span class="sourceLineNo">807</span> protected boolean trySkipToNextColumn(Cell cell) throws IOException {<a name="line.807"></a> +<span class="sourceLineNo">808</span> Cell nextCell = null;<a name="line.808"></a> +<span class="sourceLineNo">809</span> do {<a name="line.809"></a> +<span class="sourceLineNo">810</span> Cell nextIndexedKey = getNextIndexedKey();<a name="line.810"></a> +<span class="sourceLineNo">811</span> if (nextIndexedKey != null && nextIndexedKey != KeyValueScanner.NO_NEXT_INDEXED_KEY<a name="line.811"></a> +<span class="sourceLineNo">812</span> && matcher.compareKeyForNextColumn(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> } else {<a name="line.815"></a> +<span class="sourceLineNo">816</span> return false;<a name="line.816"></a> +<span class="sourceLineNo">817</span> }<a name="line.817"></a> +<span class="sourceLineNo">818</span> } while ((nextCell = this.heap.peek()) != null && CellUtil.matchingRowColumn(cell, nextCell));<a name="line.818"></a> +<span class="sourceLineNo">819</span> return true;<a name="line.819"></a> +<span class="sourceLineNo">820</span> }<a name="line.820"></a> +<span class="sourceLineNo">821</span><a name="line.821"></a> +<span class="sourceLineNo">822</span> @Override<a name="line.822"></a> +<span class="sourceLineNo">823</span> public long getReadPoint() {<a name="line.823"></a> +<span class="sourceLineNo">824</span> return this.readPt;<a name="line.824"></a> +<span class="sourceLineNo">825</span> }<a name="line.825"></a> +<span class="sourceLineNo">826</span><a name="line.826"></a> +<span class="sourceLineNo">827</span> private static void clearAndClose(List<KeyValueScanner> scanners) {<a name="line.827"></a> +<span class="sourceLineNo">828</span> for (KeyValueScanner s : scanners) {<a name="line.828"></a> +<span class="sourceLineNo">829</span> s.close();<a name="line.829"></a> +<span class="sourceLineNo">830</span> }<a name="line.830"></a> +<span class="sourceLineNo">831</span> scanners.clear();<a name="line.831"></a> +<span class="sourceLineNo">832</span> }<a name="line.832"></a> +<span class="sourceLineNo">833</span><a name="line.833"></a> +<span class="sourceLineNo">834</span> // Implementation of ChangedReadersObserver<a name="line.834"></a> +<span class="sourceLineNo">835</span> @Override<a name="line.835"></a> +<span class="sourceLineNo">836</span> public void updateReaders(List<HStoreFile> sfs, List<KeyValueScanner> memStoreScanners)<a name="line.836"></a> +<span class="sourceLineNo">837</span> throws IOException {<a name="line.83
<TRUNCATED>
