hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From mi...@apache.org
Subject [09/13] hbase-site git commit: Published site at ef92a6a067230cae96d3e3267da5a18ac5ad89c6.
Date Tue, 15 Dec 2015 16:54:59 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/4e8775f9/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.StoreScannerCompactionRace.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.StoreScannerCompactionRace.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.StoreScannerCompactionRace.html
index 0f3725c..8d9efca 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.StoreScannerCompactionRace.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/StoreScanner.StoreScannerCompactionRace.html
@@ -422,498 +422,497 @@
 <span class="sourceLineNo">414</span><a name="line.414"></a>
 <span class="sourceLineNo">415</span>  @Override<a name="line.415"></a>
 <span class="sourceLineNo">416</span>  public Cell peek() {<a name="line.416"></a>
-<span class="sourceLineNo">417</span>    checkFlushed();<a name="line.417"></a>
-<span class="sourceLineNo">418</span>    if (this.heap == null) {<a name="line.418"></a>
-<span class="sourceLineNo">419</span>      return this.lastTop;<a name="line.419"></a>
-<span class="sourceLineNo">420</span>    }<a name="line.420"></a>
-<span class="sourceLineNo">421</span>    return this.heap.peek();<a name="line.421"></a>
-<span class="sourceLineNo">422</span>  }<a name="line.422"></a>
-<span class="sourceLineNo">423</span><a name="line.423"></a>
-<span class="sourceLineNo">424</span>  @Override<a name="line.424"></a>
-<span class="sourceLineNo">425</span>  public KeyValue next() {<a name="line.425"></a>
-<span class="sourceLineNo">426</span>    // throw runtime exception perhaps?<a name="line.426"></a>
-<span class="sourceLineNo">427</span>    throw new RuntimeException("Never call StoreScanner.next()");<a name="line.427"></a>
-<span class="sourceLineNo">428</span>  }<a name="line.428"></a>
-<span class="sourceLineNo">429</span><a name="line.429"></a>
-<span class="sourceLineNo">430</span>  @Override<a name="line.430"></a>
-<span class="sourceLineNo">431</span>  public void close() {<a name="line.431"></a>
-<span class="sourceLineNo">432</span>    close(true);<a name="line.432"></a>
-<span class="sourceLineNo">433</span>  }<a name="line.433"></a>
-<span class="sourceLineNo">434</span><a name="line.434"></a>
-<span class="sourceLineNo">435</span>  private void close(boolean withHeapClose) {<a name="line.435"></a>
-<span class="sourceLineNo">436</span>    if (this.closing) {<a name="line.436"></a>
-<span class="sourceLineNo">437</span>      return;<a name="line.437"></a>
-<span class="sourceLineNo">438</span>    }<a name="line.438"></a>
-<span class="sourceLineNo">439</span>    if (withHeapClose) this.closing = true;<a name="line.439"></a>
-<span class="sourceLineNo">440</span>    // Under test, we dont have a this.store<a name="line.440"></a>
-<span class="sourceLineNo">441</span>    if (this.store != null) this.store.deleteChangedReaderObserver(this);<a name="line.441"></a>
-<span class="sourceLineNo">442</span>    if (withHeapClose) {<a name="line.442"></a>
-<span class="sourceLineNo">443</span>      for (KeyValueHeap h : this.heapsForDelayedClose) {<a name="line.443"></a>
-<span class="sourceLineNo">444</span>        h.close();<a name="line.444"></a>
-<span class="sourceLineNo">445</span>      }<a name="line.445"></a>
-<span class="sourceLineNo">446</span>      this.heapsForDelayedClose.clear();<a name="line.446"></a>
-<span class="sourceLineNo">447</span>      if (this.heap != null) {<a name="line.447"></a>
-<span class="sourceLineNo">448</span>        this.heap.close();<a name="line.448"></a>
-<span class="sourceLineNo">449</span>        this.currentScanners.clear();<a name="line.449"></a>
-<span class="sourceLineNo">450</span>        this.heap = null; // CLOSED!<a name="line.450"></a>
-<span class="sourceLineNo">451</span>      }<a name="line.451"></a>
-<span class="sourceLineNo">452</span>    } else {<a name="line.452"></a>
-<span class="sourceLineNo">453</span>      if (this.heap != null) {<a name="line.453"></a>
-<span class="sourceLineNo">454</span>        this.heapsForDelayedClose.add(this.heap);<a name="line.454"></a>
-<span class="sourceLineNo">455</span>        this.currentScanners.clear();<a name="line.455"></a>
-<span class="sourceLineNo">456</span>        this.heap = null;<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>    this.lastTop = null; // If both are null, we are closed.<a name="line.459"></a>
-<span class="sourceLineNo">460</span>  }<a name="line.460"></a>
-<span class="sourceLineNo">461</span><a name="line.461"></a>
-<span class="sourceLineNo">462</span>  @Override<a name="line.462"></a>
-<span class="sourceLineNo">463</span>  public boolean seek(Cell key) throws IOException {<a name="line.463"></a>
-<span class="sourceLineNo">464</span>    boolean flushed = checkFlushed();<a name="line.464"></a>
-<span class="sourceLineNo">465</span>    // reset matcher state, in case that underlying store changed<a name="line.465"></a>
-<span class="sourceLineNo">466</span>    checkReseek(flushed);<a name="line.466"></a>
-<span class="sourceLineNo">467</span>    return this.heap.seek(key);<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 boolean next(List&lt;Cell&gt; outResult) throws IOException {<a name="line.471"></a>
-<span class="sourceLineNo">472</span>    return next(outResult, NoLimitScannerContext.getInstance());<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>  /**<a name="line.475"></a>
-<span class="sourceLineNo">476</span>   * Get the next row of values from this Store.<a name="line.476"></a>
-<span class="sourceLineNo">477</span>   * @param outResult<a name="line.477"></a>
-<span class="sourceLineNo">478</span>   * @param scannerContext<a name="line.478"></a>
-<span class="sourceLineNo">479</span>   * @return true if there are more rows, false if scanner is done<a name="line.479"></a>
-<span class="sourceLineNo">480</span>   */<a name="line.480"></a>
-<span class="sourceLineNo">481</span>  @Override<a name="line.481"></a>
-<span class="sourceLineNo">482</span>  public boolean next(List&lt;Cell&gt; outResult, ScannerContext scannerContext) throws IOException {<a name="line.482"></a>
-<span class="sourceLineNo">483</span>    if (scannerContext == null) {<a name="line.483"></a>
-<span class="sourceLineNo">484</span>      throw new IllegalArgumentException("Scanner context cannot be null");<a name="line.484"></a>
-<span class="sourceLineNo">485</span>    }<a name="line.485"></a>
-<span class="sourceLineNo">486</span>    boolean flushed = checkFlushed();<a name="line.486"></a>
-<span class="sourceLineNo">487</span>    if (checkReseek(flushed)) {<a name="line.487"></a>
-<span class="sourceLineNo">488</span>      return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.488"></a>
-<span class="sourceLineNo">489</span>    }<a name="line.489"></a>
-<span class="sourceLineNo">490</span><a name="line.490"></a>
-<span class="sourceLineNo">491</span>    // if the heap was left null, then the scanners had previously run out anyways, close and<a name="line.491"></a>
-<span class="sourceLineNo">492</span>    // return.<a name="line.492"></a>
-<span class="sourceLineNo">493</span>    if (this.heap == null) {<a name="line.493"></a>
-<span class="sourceLineNo">494</span>      // By this time partial close should happened because already heap is null<a name="line.494"></a>
-<span class="sourceLineNo">495</span>      close(false);// Do all cleanup except heap.close()<a name="line.495"></a>
-<span class="sourceLineNo">496</span>      return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.496"></a>
-<span class="sourceLineNo">497</span>    }<a name="line.497"></a>
-<span class="sourceLineNo">498</span><a name="line.498"></a>
-<span class="sourceLineNo">499</span>    Cell cell = this.heap.peek();<a name="line.499"></a>
-<span class="sourceLineNo">500</span>    if (cell == null) {<a name="line.500"></a>
-<span class="sourceLineNo">501</span>      close(false);// Do all cleanup except heap.close()<a name="line.501"></a>
-<span class="sourceLineNo">502</span>      return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.502"></a>
-<span class="sourceLineNo">503</span>    }<a name="line.503"></a>
-<span class="sourceLineNo">504</span><a name="line.504"></a>
-<span class="sourceLineNo">505</span>    // only call setRow if the row changes; avoids confusing the query matcher<a name="line.505"></a>
-<span class="sourceLineNo">506</span>    // if scanning intra-row<a name="line.506"></a>
-<span class="sourceLineNo">507</span><a name="line.507"></a>
-<span class="sourceLineNo">508</span>    // If no limits exists in the scope LimitScope.Between_Cells then we are sure we are changing<a name="line.508"></a>
-<span class="sourceLineNo">509</span>    // rows. Else it is possible we are still traversing the same row so we must perform the row<a name="line.509"></a>
-<span class="sourceLineNo">510</span>    // comparison.<a name="line.510"></a>
-<span class="sourceLineNo">511</span>    if (!scannerContext.hasAnyLimit(LimitScope.BETWEEN_CELLS) || matcher.curCell == null<a name="line.511"></a>
-<span class="sourceLineNo">512</span>        || !CellUtil.matchingRow(cell, matcher.curCell)) {<a name="line.512"></a>
-<span class="sourceLineNo">513</span>      this.countPerRow = 0;<a name="line.513"></a>
-<span class="sourceLineNo">514</span>      matcher.setToNewRow(cell);<a name="line.514"></a>
-<span class="sourceLineNo">515</span>    }<a name="line.515"></a>
-<span class="sourceLineNo">516</span><a name="line.516"></a>
-<span class="sourceLineNo">517</span>    // Clear progress away unless invoker has indicated it should be kept.<a name="line.517"></a>
-<span class="sourceLineNo">518</span>    if (!scannerContext.getKeepProgress()) scannerContext.clearProgress();<a name="line.518"></a>
-<span class="sourceLineNo">519</span><a name="line.519"></a>
-<span class="sourceLineNo">520</span>    // Only do a sanity-check if store and comparator are available.<a name="line.520"></a>
-<span class="sourceLineNo">521</span>    CellComparator comparator = store != null ? store.getComparator() : null;<a name="line.521"></a>
-<span class="sourceLineNo">522</span><a name="line.522"></a>
-<span class="sourceLineNo">523</span>    int count = 0;<a name="line.523"></a>
-<span class="sourceLineNo">524</span>    long totalBytesRead = 0;<a name="line.524"></a>
-<span class="sourceLineNo">525</span><a name="line.525"></a>
-<span class="sourceLineNo">526</span>    LOOP: do {<a name="line.526"></a>
-<span class="sourceLineNo">527</span>      // Update and check the time limit based on the configured value of cellsPerTimeoutCheck<a name="line.527"></a>
-<span class="sourceLineNo">528</span>      if ((kvsScanned % cellsPerHeartbeatCheck == 0)) {<a name="line.528"></a>
-<span class="sourceLineNo">529</span>        scannerContext.updateTimeProgress();<a name="line.529"></a>
-<span class="sourceLineNo">530</span>        if (scannerContext.checkTimeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.530"></a>
-<span class="sourceLineNo">531</span>          return scannerContext.setScannerState(NextState.TIME_LIMIT_REACHED).hasMoreValues();<a name="line.531"></a>
-<span class="sourceLineNo">532</span>        }<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>      if (prevCell != cell) ++kvsScanned; // Do object compare - we set prevKV from the same heap.<a name="line.535"></a>
-<span class="sourceLineNo">536</span>      checkScanOrder(prevCell, cell, comparator);<a name="line.536"></a>
-<span class="sourceLineNo">537</span>      prevCell = cell;<a name="line.537"></a>
-<span class="sourceLineNo">538</span><a name="line.538"></a>
-<span class="sourceLineNo">539</span>      ScanQueryMatcher.MatchCode qcode = matcher.match(cell);<a name="line.539"></a>
-<span class="sourceLineNo">540</span>      qcode = optimize(qcode, cell);<a name="line.540"></a>
-<span class="sourceLineNo">541</span>      switch (qcode) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span>      case INCLUDE:<a name="line.542"></a>
-<span class="sourceLineNo">543</span>      case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.543"></a>
-<span class="sourceLineNo">544</span>      case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.544"></a>
-<span class="sourceLineNo">545</span><a name="line.545"></a>
-<span class="sourceLineNo">546</span>        Filter f = matcher.getFilter();<a name="line.546"></a>
-<span class="sourceLineNo">547</span>        if (f != null) {<a name="line.547"></a>
-<span class="sourceLineNo">548</span>          cell = f.transformCell(cell);<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>        this.countPerRow++;<a name="line.551"></a>
-<span class="sourceLineNo">552</span>        if (storeLimit &gt; -1 &amp;&amp; this.countPerRow &gt; (storeLimit + storeOffset)) {<a name="line.552"></a>
-<span class="sourceLineNo">553</span>          // do what SEEK_NEXT_ROW does.<a name="line.553"></a>
-<span class="sourceLineNo">554</span>          if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.554"></a>
-<span class="sourceLineNo">555</span>            return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.555"></a>
-<span class="sourceLineNo">556</span>          }<a name="line.556"></a>
-<span class="sourceLineNo">557</span>          seekToNextRow(cell);<a name="line.557"></a>
-<span class="sourceLineNo">558</span>          break LOOP;<a name="line.558"></a>
-<span class="sourceLineNo">559</span>        }<a name="line.559"></a>
-<span class="sourceLineNo">560</span><a name="line.560"></a>
-<span class="sourceLineNo">561</span>        // add to results only if we have skipped #storeOffset kvs<a name="line.561"></a>
-<span class="sourceLineNo">562</span>        // also update metric accordingly<a name="line.562"></a>
-<span class="sourceLineNo">563</span>        if (this.countPerRow &gt; storeOffset) {<a name="line.563"></a>
-<span class="sourceLineNo">564</span>          outResult.add(cell);<a name="line.564"></a>
-<span class="sourceLineNo">565</span><a name="line.565"></a>
-<span class="sourceLineNo">566</span>          // Update local tracking information<a name="line.566"></a>
-<span class="sourceLineNo">567</span>          count++;<a name="line.567"></a>
-<span class="sourceLineNo">568</span>          totalBytesRead += CellUtil.estimatedSerializedSizeOf(cell);<a name="line.568"></a>
-<span class="sourceLineNo">569</span><a name="line.569"></a>
-<span class="sourceLineNo">570</span>          // Update the progress of the scanner context<a name="line.570"></a>
-<span class="sourceLineNo">571</span>          scannerContext.incrementSizeProgress(CellUtil.estimatedHeapSizeOf(cell));<a name="line.571"></a>
-<span class="sourceLineNo">572</span>          scannerContext.incrementBatchProgress(1);<a name="line.572"></a>
-<span class="sourceLineNo">573</span><a name="line.573"></a>
-<span class="sourceLineNo">574</span>          if (totalBytesRead &gt; maxRowSize) {<a name="line.574"></a>
-<span class="sourceLineNo">575</span>            throw new RowTooBigException(<a name="line.575"></a>
-<span class="sourceLineNo">576</span>                "Max row size allowed: " + maxRowSize + ", but the row is bigger than that.");<a name="line.576"></a>
-<span class="sourceLineNo">577</span>          }<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>        if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_ROW) {<a name="line.580"></a>
-<span class="sourceLineNo">581</span>          if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.581"></a>
-<span class="sourceLineNo">582</span>            return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.582"></a>
-<span class="sourceLineNo">583</span>          }<a name="line.583"></a>
-<span class="sourceLineNo">584</span>          seekToNextRow(cell);<a name="line.584"></a>
-<span class="sourceLineNo">585</span>        } else if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_COL) {<a name="line.585"></a>
-<span class="sourceLineNo">586</span>          seekAsDirection(matcher.getKeyForNextColumn(cell));<a name="line.586"></a>
-<span class="sourceLineNo">587</span>        } else {<a name="line.587"></a>
-<span class="sourceLineNo">588</span>          this.heap.next();<a name="line.588"></a>
-<span class="sourceLineNo">589</span>        }<a name="line.589"></a>
-<span class="sourceLineNo">590</span><a name="line.590"></a>
-<span class="sourceLineNo">591</span>        if (scannerContext.checkBatchLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.591"></a>
-<span class="sourceLineNo">592</span>          break LOOP;<a name="line.592"></a>
-<span class="sourceLineNo">593</span>        }<a name="line.593"></a>
-<span class="sourceLineNo">594</span>        if (scannerContext.checkSizeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.594"></a>
-<span class="sourceLineNo">595</span>          break LOOP;<a name="line.595"></a>
-<span class="sourceLineNo">596</span>        }<a name="line.596"></a>
-<span class="sourceLineNo">597</span>        continue;<a name="line.597"></a>
-<span class="sourceLineNo">598</span><a name="line.598"></a>
-<span class="sourceLineNo">599</span>      case DONE:<a name="line.599"></a>
-<span class="sourceLineNo">600</span>        return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.600"></a>
-<span class="sourceLineNo">601</span><a name="line.601"></a>
-<span class="sourceLineNo">602</span>      case DONE_SCAN:<a name="line.602"></a>
-<span class="sourceLineNo">603</span>        close(false);// Do all cleanup except heap.close()<a name="line.603"></a>
-<span class="sourceLineNo">604</span>        return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.604"></a>
-<span class="sourceLineNo">605</span><a name="line.605"></a>
-<span class="sourceLineNo">606</span>      case SEEK_NEXT_ROW:<a name="line.606"></a>
-<span class="sourceLineNo">607</span>        // This is just a relatively simple end of scan fix, to short-cut end<a name="line.607"></a>
-<span class="sourceLineNo">608</span>        // us if there is an endKey in the scan.<a name="line.608"></a>
-<span class="sourceLineNo">609</span>        if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.609"></a>
-<span class="sourceLineNo">610</span>          return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<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>        seekToNextRow(cell);<a name="line.613"></a>
-<span class="sourceLineNo">614</span>        break;<a name="line.614"></a>
-<span class="sourceLineNo">615</span><a name="line.615"></a>
-<span class="sourceLineNo">616</span>      case SEEK_NEXT_COL:<a name="line.616"></a>
-<span class="sourceLineNo">617</span>        seekAsDirection(matcher.getKeyForNextColumn(cell));<a name="line.617"></a>
-<span class="sourceLineNo">618</span>        break;<a name="line.618"></a>
-<span class="sourceLineNo">619</span><a name="line.619"></a>
-<span class="sourceLineNo">620</span>      case SKIP:<a name="line.620"></a>
-<span class="sourceLineNo">621</span>        this.heap.next();<a name="line.621"></a>
-<span class="sourceLineNo">622</span>        break;<a name="line.622"></a>
-<span class="sourceLineNo">623</span><a name="line.623"></a>
-<span class="sourceLineNo">624</span>      case SEEK_NEXT_USING_HINT:<a name="line.624"></a>
-<span class="sourceLineNo">625</span>        Cell nextKV = matcher.getNextKeyHint(cell);<a name="line.625"></a>
-<span class="sourceLineNo">626</span>        if (nextKV != null) {<a name="line.626"></a>
-<span class="sourceLineNo">627</span>          seekAsDirection(nextKV);<a name="line.627"></a>
-<span class="sourceLineNo">628</span>        } else {<a name="line.628"></a>
-<span class="sourceLineNo">629</span>          heap.next();<a name="line.629"></a>
-<span class="sourceLineNo">630</span>        }<a name="line.630"></a>
-<span class="sourceLineNo">631</span>        break;<a name="line.631"></a>
-<span class="sourceLineNo">632</span><a name="line.632"></a>
-<span class="sourceLineNo">633</span>      default:<a name="line.633"></a>
-<span class="sourceLineNo">634</span>        throw new RuntimeException("UNEXPECTED");<a name="line.634"></a>
-<span class="sourceLineNo">635</span>      }<a name="line.635"></a>
-<span class="sourceLineNo">636</span>    } while ((cell = this.heap.peek()) != null);<a name="line.636"></a>
-<span class="sourceLineNo">637</span><a name="line.637"></a>
-<span class="sourceLineNo">638</span>    if (count &gt; 0) {<a name="line.638"></a>
-<span class="sourceLineNo">639</span>      return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<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>    // No more keys<a name="line.642"></a>
-<span class="sourceLineNo">643</span>    close(false);// Do all cleanup except heap.close()<a name="line.643"></a>
-<span class="sourceLineNo">644</span>    return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.644"></a>
-<span class="sourceLineNo">645</span>  }<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>   * See if we should actually SEEK or rather just SKIP to the next Cell.<a name="line.648"></a>
-<span class="sourceLineNo">649</span>   * (see HBASE-13109)<a name="line.649"></a>
-<span class="sourceLineNo">650</span>   */<a name="line.650"></a>
-<span class="sourceLineNo">651</span>  private ScanQueryMatcher.MatchCode optimize(ScanQueryMatcher.MatchCode qcode, Cell cell) {<a name="line.651"></a>
-<span class="sourceLineNo">652</span>    switch(qcode) {<a name="line.652"></a>
-<span class="sourceLineNo">653</span>    case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.653"></a>
-<span class="sourceLineNo">654</span>    case SEEK_NEXT_COL:<a name="line.654"></a>
-<span class="sourceLineNo">655</span>    {<a name="line.655"></a>
-<span class="sourceLineNo">656</span>      Cell nextIndexedKey = getNextIndexedKey();<a name="line.656"></a>
-<span class="sourceLineNo">657</span>      if (nextIndexedKey != null &amp;&amp; nextIndexedKey != HConstants.NO_NEXT_INDEXED_KEY<a name="line.657"></a>
-<span class="sourceLineNo">658</span>          &amp;&amp; matcher.compareKeyForNextColumn(nextIndexedKey, cell) &gt;= 0) {<a name="line.658"></a>
-<span class="sourceLineNo">659</span>        return qcode == MatchCode.SEEK_NEXT_COL ? MatchCode.SKIP : MatchCode.INCLUDE;<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 INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.663"></a>
-<span class="sourceLineNo">664</span>    case SEEK_NEXT_ROW:<a name="line.664"></a>
-<span class="sourceLineNo">665</span>    {<a name="line.665"></a>
-<span class="sourceLineNo">666</span>      Cell nextIndexedKey = getNextIndexedKey();<a name="line.666"></a>
-<span class="sourceLineNo">667</span>      if (nextIndexedKey != null &amp;&amp; nextIndexedKey != HConstants.NO_NEXT_INDEXED_KEY<a name="line.667"></a>
-<span class="sourceLineNo">668</span>          &amp;&amp; matcher.compareKeyForNextRow(nextIndexedKey, cell) &gt;= 0) {<a name="line.668"></a>
-<span class="sourceLineNo">669</span>        return qcode == MatchCode.SEEK_NEXT_ROW ? MatchCode.SKIP : MatchCode.INCLUDE;<a name="line.669"></a>
-<span class="sourceLineNo">670</span>      }<a name="line.670"></a>
-<span class="sourceLineNo">671</span>      break;<a name="line.671"></a>
-<span class="sourceLineNo">672</span>    }<a name="line.672"></a>
-<span class="sourceLineNo">673</span>    default:<a name="line.673"></a>
-<span class="sourceLineNo">674</span>      break;<a name="line.674"></a>
-<span class="sourceLineNo">675</span>    }<a name="line.675"></a>
-<span class="sourceLineNo">676</span>    return qcode;<a name="line.676"></a>
-<span class="sourceLineNo">677</span>  }<a name="line.677"></a>
-<span class="sourceLineNo">678</span><a name="line.678"></a>
-<span class="sourceLineNo">679</span>  // Implementation of ChangedReadersObserver<a name="line.679"></a>
-<span class="sourceLineNo">680</span>  @Override<a name="line.680"></a>
-<span class="sourceLineNo">681</span>  public void updateReaders(List&lt;StoreFile&gt; sfs) throws IOException {<a name="line.681"></a>
-<span class="sourceLineNo">682</span>    flushed = true;<a name="line.682"></a>
-<span class="sourceLineNo">683</span>    flushLock.lock();<a name="line.683"></a>
-<span class="sourceLineNo">684</span>    try {<a name="line.684"></a>
-<span class="sourceLineNo">685</span>      flushedStoreFiles.addAll(sfs);<a name="line.685"></a>
-<span class="sourceLineNo">686</span>    } finally {<a name="line.686"></a>
-<span class="sourceLineNo">687</span>      flushLock.unlock();<a name="line.687"></a>
-<span class="sourceLineNo">688</span>    }<a name="line.688"></a>
-<span class="sourceLineNo">689</span>    // Let the next() call handle re-creating and seeking<a name="line.689"></a>
-<span class="sourceLineNo">690</span>  }<a name="line.690"></a>
-<span class="sourceLineNo">691</span><a name="line.691"></a>
-<span class="sourceLineNo">692</span>  /**<a name="line.692"></a>
-<span class="sourceLineNo">693</span>   * @param flushed indicates if there was a flush<a name="line.693"></a>
-<span class="sourceLineNo">694</span>   * @return true if top of heap has changed (and KeyValueHeap has to try the<a name="line.694"></a>
-<span class="sourceLineNo">695</span>   *         next KV)<a name="line.695"></a>
-<span class="sourceLineNo">696</span>   * @throws IOException<a name="line.696"></a>
-<span class="sourceLineNo">697</span>   */<a name="line.697"></a>
-<span class="sourceLineNo">698</span>  protected boolean checkReseek(boolean flushed) throws IOException {<a name="line.698"></a>
-<span class="sourceLineNo">699</span>    if (flushed &amp;&amp; this.lastTop != null) {<a name="line.699"></a>
-<span class="sourceLineNo">700</span>      resetScannerStack(this.lastTop);<a name="line.700"></a>
-<span class="sourceLineNo">701</span>      if (this.heap.peek() == null<a name="line.701"></a>
-<span class="sourceLineNo">702</span>          || store.getComparator().compareRows(this.lastTop, this.heap.peek()) != 0) {<a name="line.702"></a>
-<span class="sourceLineNo">703</span>        LOG.debug("Storescanner.peek() is changed where before = "<a name="line.703"></a>
-<span class="sourceLineNo">704</span>            + this.lastTop.toString() + ",and after = " + this.heap.peek());<a name="line.704"></a>
-<span class="sourceLineNo">705</span>        this.lastTop = null;<a name="line.705"></a>
-<span class="sourceLineNo">706</span>        return true;<a name="line.706"></a>
-<span class="sourceLineNo">707</span>      }<a name="line.707"></a>
-<span class="sourceLineNo">708</span>      this.lastTop = null; // gone!<a name="line.708"></a>
-<span class="sourceLineNo">709</span>    }<a name="line.709"></a>
-<span class="sourceLineNo">710</span>    // else dont need to reseek<a name="line.710"></a>
-<span class="sourceLineNo">711</span>    return false;<a name="line.711"></a>
-<span class="sourceLineNo">712</span>  }<a name="line.712"></a>
-<span class="sourceLineNo">713</span><a name="line.713"></a>
-<span class="sourceLineNo">714</span>  protected void resetScannerStack(Cell lastTopKey) throws IOException {<a name="line.714"></a>
-<span class="sourceLineNo">715</span>    /* When we have the scan object, should we not pass it to getScanners()<a name="line.715"></a>
-<span class="sourceLineNo">716</span>     * to get a limited set of scanners? We did so in the constructor and we<a name="line.716"></a>
-<span class="sourceLineNo">717</span>     * could have done it now by storing the scan object from the constructor<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>    final boolean isCompaction = false;<a name="line.720"></a>
-<span class="sourceLineNo">721</span>    boolean usePread = get || scanUsePread;<a name="line.721"></a>
-<span class="sourceLineNo">722</span>    List&lt;KeyValueScanner&gt; scanners = null;<a name="line.722"></a>
-<span class="sourceLineNo">723</span>    try {<a name="line.723"></a>
-<span class="sourceLineNo">724</span>      flushLock.lock();<a name="line.724"></a>
-<span class="sourceLineNo">725</span>      scanners = selectScannersFrom(store.getScanners(flushedStoreFiles, cacheBlocks, get, usePread,<a name="line.725"></a>
-<span class="sourceLineNo">726</span>        isCompaction, matcher, scan.getStartRow(), scan.getStopRow(), this.readPt, true));<a name="line.726"></a>
-<span class="sourceLineNo">727</span>      // Clear the current set of flushed store files so that they don't get added again<a name="line.727"></a>
-<span class="sourceLineNo">728</span>      flushedStoreFiles.clear();<a name="line.728"></a>
-<span class="sourceLineNo">729</span>    } finally {<a name="line.729"></a>
-<span class="sourceLineNo">730</span>      flushLock.unlock();<a name="line.730"></a>
-<span class="sourceLineNo">731</span>    }<a name="line.731"></a>
-<span class="sourceLineNo">732</span><a name="line.732"></a>
-<span class="sourceLineNo">733</span>    // Seek the new scanners to the last key<a name="line.733"></a>
-<span class="sourceLineNo">734</span>    seekScanners(scanners, lastTopKey, false, parallelSeekEnabled);<a name="line.734"></a>
-<span class="sourceLineNo">735</span>    // remove the older memstore scanner<a name="line.735"></a>
-<span class="sourceLineNo">736</span>    for (int i = 0; i &lt; currentScanners.size(); i++) {<a name="line.736"></a>
-<span class="sourceLineNo">737</span>      if (!currentScanners.get(i).isFileScanner()) {<a name="line.737"></a>
-<span class="sourceLineNo">738</span>        currentScanners.remove(i);<a name="line.738"></a>
-<span class="sourceLineNo">739</span>        break;<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>    // add the newly created scanners on the flushed files and the current active memstore scanner<a name="line.742"></a>
-<span class="sourceLineNo">743</span>    addCurrentScanners(scanners);<a name="line.743"></a>
-<span class="sourceLineNo">744</span>    // Combine all seeked scanners with a heap<a name="line.744"></a>
-<span class="sourceLineNo">745</span>    resetKVHeap(this.currentScanners, store.getComparator());<a name="line.745"></a>
-<span class="sourceLineNo">746</span>    // Reset the state of the Query Matcher and set to top row.<a name="line.746"></a>
-<span class="sourceLineNo">747</span>    // Only reset and call setRow if the row changes; avoids confusing the<a name="line.747"></a>
-<span class="sourceLineNo">748</span>    // query matcher if scanning intra-row.<a name="line.748"></a>
-<span class="sourceLineNo">749</span>    Cell cell = heap.peek();<a name="line.749"></a>
-<span class="sourceLineNo">750</span>    if (cell == null) {<a name="line.750"></a>
-<span class="sourceLineNo">751</span>      cell = lastTopKey;<a name="line.751"></a>
-<span class="sourceLineNo">752</span>    }<a name="line.752"></a>
-<span class="sourceLineNo">753</span>    if ((matcher.curCell == null) || !CellUtil.matchingRows(cell, matcher.curCell)) {<a name="line.753"></a>
-<span class="sourceLineNo">754</span>      this.countPerRow = 0;<a name="line.754"></a>
-<span class="sourceLineNo">755</span>      matcher.reset();<a name="line.755"></a>
-<span class="sourceLineNo">756</span>      matcher.setToNewRow(cell);<a name="line.756"></a>
-<span class="sourceLineNo">757</span>    }<a name="line.757"></a>
-<span class="sourceLineNo">758</span>  }<a name="line.758"></a>
-<span class="sourceLineNo">759</span><a name="line.759"></a>
-<span class="sourceLineNo">760</span>  /**<a name="line.760"></a>
-<span class="sourceLineNo">761</span>   * Check whether scan as expected order<a name="line.761"></a>
-<span class="sourceLineNo">762</span>   * @param prevKV<a name="line.762"></a>
-<span class="sourceLineNo">763</span>   * @param kv<a name="line.763"></a>
-<span class="sourceLineNo">764</span>   * @param comparator<a name="line.764"></a>
-<span class="sourceLineNo">765</span>   * @throws IOException<a name="line.765"></a>
-<span class="sourceLineNo">766</span>   */<a name="line.766"></a>
-<span class="sourceLineNo">767</span>  protected void checkScanOrder(Cell prevKV, Cell kv,<a name="line.767"></a>
-<span class="sourceLineNo">768</span>      CellComparator comparator) throws IOException {<a name="line.768"></a>
-<span class="sourceLineNo">769</span>    // Check that the heap gives us KVs in an increasing order.<a name="line.769"></a>
-<span class="sourceLineNo">770</span>    assert prevKV == null || comparator == null<a name="line.770"></a>
-<span class="sourceLineNo">771</span>        || comparator.compare(prevKV, kv) &lt;= 0 : "Key " + prevKV<a name="line.771"></a>
-<span class="sourceLineNo">772</span>        + " followed by a " + "smaller key " + kv + " in cf " + store;<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>  protected boolean seekToNextRow(Cell c) throws IOException {<a name="line.775"></a>
-<span class="sourceLineNo">776</span>    return reseek(CellUtil.createLastOnRow(c));<a name="line.776"></a>
-<span class="sourceLineNo">777</span>  }<a name="line.777"></a>
-<span class="sourceLineNo">778</span><a name="line.778"></a>
-<span class="sourceLineNo">779</span>  /**<a name="line.779"></a>
-<span class="sourceLineNo">780</span>   * Do a reseek in a normal StoreScanner(scan forward)<a name="line.780"></a>
-<span class="sourceLineNo">781</span>   * @param kv<a name="line.781"></a>
-<span class="sourceLineNo">782</span>   * @return true if scanner has values left, false if end of scanner<a name="line.782"></a>
-<span class="sourceLineNo">783</span>   * @throws IOException<a name="line.783"></a>
-<span class="sourceLineNo">784</span>   */<a name="line.784"></a>
-<span class="sourceLineNo">785</span>  protected boolean seekAsDirection(Cell kv)<a name="line.785"></a>
-<span class="sourceLineNo">786</span>      throws IOException {<a name="line.786"></a>
-<span class="sourceLineNo">787</span>    return reseek(kv);<a name="line.787"></a>
-<span class="sourceLineNo">788</span>  }<a name="line.788"></a>
-<span class="sourceLineNo">789</span><a name="line.789"></a>
-<span class="sourceLineNo">790</span>  @Override<a name="line.790"></a>
-<span class="sourceLineNo">791</span>  public boolean reseek(Cell kv) throws IOException {<a name="line.791"></a>
-<span class="sourceLineNo">792</span>    boolean flushed = checkFlushed();<a name="line.792"></a>
-<span class="sourceLineNo">793</span>    // Heap will not be null, if this is called from next() which.<a name="line.793"></a>
-<span class="sourceLineNo">794</span>    // If called from RegionScanner.reseek(...) make sure the scanner<a name="line.794"></a>
-<span class="sourceLineNo">795</span>    // stack is reset if needed.<a name="line.795"></a>
-<span class="sourceLineNo">796</span>    checkReseek(flushed);<a name="line.796"></a>
-<span class="sourceLineNo">797</span>    if (explicitColumnQuery &amp;&amp; lazySeekEnabledGlobally) {<a name="line.797"></a>
-<span class="sourceLineNo">798</span>      return heap.requestSeek(kv, true, useRowColBloom);<a name="line.798"></a>
-<span class="sourceLineNo">799</span>    }<a name="line.799"></a>
-<span class="sourceLineNo">800</span>    return heap.reseek(kv);<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>  protected boolean checkFlushed() {<a name="line.803"></a>
-<span class="sourceLineNo">804</span>    // check the var without any lock. Suppose even if we see the old<a name="line.804"></a>
-<span class="sourceLineNo">805</span>    // value here still it is ok to continue because we will not be resetting<a name="line.805"></a>
-<span class="sourceLineNo">806</span>    // the heap but will continue with the referenced memstore's snapshot. For compactions<a name="line.806"></a>
-<span class="sourceLineNo">807</span>    // any way we don't need the updateReaders at all to happen as we still continue with <a name="line.807"></a>
-<span class="sourceLineNo">808</span>    // the older files<a name="line.808"></a>
-<span class="sourceLineNo">809</span>    if (flushed) {<a name="line.809"></a>
-<span class="sourceLineNo">810</span>      // If there is a flush and the current scan is notified on the flush ensure that the <a name="line.810"></a>
-<span class="sourceLineNo">811</span>      // scan's heap gets reset and we do a seek on the newly flushed file.<a name="line.811"></a>
-<span class="sourceLineNo">812</span>      if(!this.closing) {<a name="line.812"></a>
-<span class="sourceLineNo">813</span>        this.lastTop = this.heap.peek();<a name="line.813"></a>
-<span class="sourceLineNo">814</span>      } else {<a name="line.814"></a>
-<span class="sourceLineNo">815</span>        return false;<a name="line.815"></a>
-<span class="sourceLineNo">816</span>      }<a name="line.816"></a>
-<span class="sourceLineNo">817</span>      // reset the flag<a name="line.817"></a>
-<span class="sourceLineNo">818</span>      flushed = false;<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>    return false;<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>  @Override<a name="line.824"></a>
-<span class="sourceLineNo">825</span>  public long getSequenceID() {<a name="line.825"></a>
-<span class="sourceLineNo">826</span>    return 0;<a name="line.826"></a>
-<span class="sourceLineNo">827</span>  }<a name="line.827"></a>
-<span class="sourceLineNo">828</span><a name="line.828"></a>
-<span class="sourceLineNo">829</span>  /**<a name="line.829"></a>
-<span class="sourceLineNo">830</span>   * Seek storefiles in parallel to optimize IO latency as much as possible<a name="line.830"></a>
-<span class="sourceLineNo">831</span>   * @param scanners the list {@link KeyValueScanner}s to be read from<a name="line.831"></a>
-<span class="sourceLineNo">832</span>   * @param kv the KeyValue on which the operation is being requested<a name="line.832"></a>
-<span class="sourceLineNo">833</span>   * @throws IOException<a name="line.833"></a>
-<span class="sourceLineNo">834</span>   */<a name="line.834"></a>
-<span class="sourceLineNo">835</span>  private void parallelSeek(final List&lt;? extends KeyValueScanner&gt;<a name="line.835"></a>
-<span class="sourceLineNo">836</span>      scanners, final Cell kv) throws IOException {<a name="line.836"></a>
-<span class="sourceLineNo">837</span>    if (scanners.isEmpty()) return;<a name="line.837"></a>
-<span class="sourceLineNo">838</span>    int storeFileScannerCount = scanners.size();<a name="line.838"></a>
-<span class="sourceLineNo">839</span>    CountDownLatch latch = new CountDownLatch(storeFileScannerCount);<a name="line.839"></a>
-<span class="sourceLineNo">840</span>    List&lt;ParallelSeekHandler&gt; handlers = <a name="line.840"></a>
-<span class="sourceLineNo">841</span>        new ArrayList&lt;ParallelSeekHandler&gt;(storeFileScannerCount);<a name="line.841"></a>
-<span class="sourceLineNo">842</span>    for (KeyValueScanner scanner : scanners) {<a name="line.842"></a>
-<span class="sourceLineNo">843</span>      if (scanner instanceof StoreFileScanner) {<a name="line.843"></a>
-<span class="sourceLineNo">844</span>        ParallelSeekHandler seekHandler = new ParallelSeekHandler(scanner, kv,<a name="line.844"></a>
-<span class="sourceLineNo">845</span>          this.readPt, latch);<a name="line.845"></a>
-<span class="sourceLineNo">846</span>        executor.submit(seekHandler);<a name="line.846"></a>
-<span class="sourceLineNo">847</span>        handlers.add(seekHandler);<a name="line.847"></a>
-<span class="sourceLineNo">848</span>      } else {<a name="line.848"></a>
-<span class="sourceLineNo">849</span>        scanner.seek(kv);<a name="line.849"></a>
-<span class="sourceLineNo">850</span>        latch.countDown();<a name="line.850"></a>
-<span class="sourceLineNo">851</span>      }<a name="line.851"></a>
-<span class="sourceLineNo">852</span>    }<a name="line.852"></a>
-<span class="sourceLineNo">853</span><a name="line.853"></a>
-<span class="sourceLineNo">854</span>    try {<a name="line.854"></a>
-<span class="sourceLineNo">855</span>      latch.await();<a name="line.855"></a>
-<span class="sourceLineNo">856</span>    } catch (InterruptedException ie) {<a name="line.856"></a>
-<span class="sourceLineNo">857</span>      throw (InterruptedIOException)new InterruptedIOException().initCause(ie);<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>    for (ParallelSeekHandler handler : handlers) {<a name="line.860"></a>
-<span class="sourceLineNo">861</span>      if (handler.getErr() != null) {<a name="line.861"></a>
-<span class="sourceLineNo">862</span>        throw new IOException(handler.getErr());<a name="line.862"></a>
-<span class="sourceLineNo">863</span>      }<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>  /**<a name="line.867"></a>
-<span class="sourceLineNo">868</span>   * Used in testing.<a name="line.868"></a>
-<span class="sourceLineNo">869</span>   * @return all scanners in no particular order<a name="line.869"></a>
-<span class="sourceLineNo">870</span>   */<a name="line.870"></a>
-<span class="sourceLineNo">871</span>  List&lt;KeyValueScanner&gt; getAllScannersForTesting() {<a name="line.871"></a>
-<span class="sourceLineNo">872</span>    List&lt;KeyValueScanner&gt; allScanners = new ArrayList&lt;KeyValueScanner&gt;();<a name="line.872"></a>
-<span class="sourceLineNo">873</span>    KeyValueScanner current = heap.getCurrentForTesting();<a name="line.873"></a>
-<span class="sourceLineNo">874</span>    if (current != null)<a name="line.874"></a>
-<span class="sourceLineNo">875</span>      allScanners.add(current);<a name="line.875"></a>
-<span class="sourceLineNo">876</span>    for (KeyValueScanner scanner : heap.getHeap())<a name="line.876"></a>
-<span class="sourceLineNo">877</span>      allScanners.add(scanner);<a name="line.877"></a>
-<span class="sourceLineNo">878</span>    return allScanners;<a name="line.878"></a>
-<span class="sourceLineNo">879</span>  }<a name="line.879"></a>
-<span class="sourceLineNo">880</span><a name="line.880"></a>
-<span class="sourceLineNo">881</span>  static void enableLazySeekGlobally(boolean enable) {<a name="line.881"></a>
-<span class="sourceLineNo">882</span>    lazySeekEnabledGlobally = enable;<a name="line.882"></a>
-<span class="sourceLineNo">883</span>  }<a name="line.883"></a>
-<span class="sourceLineNo">884</span><a name="line.884"></a>
-<span class="sourceLineNo">885</span>  /**<a name="line.885"></a>
-<span class="sourceLineNo">886</span>   * @return The estimated number of KVs seen by this scanner (includes some skipped KVs).<a name="line.886"></a>
-<span class="sourceLineNo">887</span>   */<a name="line.887"></a>
-<span class="sourceLineNo">888</span>  public long getEstimatedNumberOfKvsScanned() {<a name="line.888"></a>
-<span class="sourceLineNo">889</span>    return this.kvsScanned;<a name="line.889"></a>
-<span class="sourceLineNo">890</span>  }<a name="line.890"></a>
-<span class="sourceLineNo">891</span><a name="line.891"></a>
-<span class="sourceLineNo">892</span>  @Override<a name="line.892"></a>
-<span class="sourceLineNo">893</span>  public Cell getNextIndexedKey() {<a name="line.893"></a>
-<span class="sourceLineNo">894</span>    return this.heap.getNextIndexedKey();<a name="line.894"></a>
-<span class="sourceLineNo">895</span>  }<a name="line.895"></a>
-<span class="sourceLineNo">896</span><a name="line.896"></a>
-<span class="sourceLineNo">897</span>  @Override<a name="line.897"></a>
-<span class="sourceLineNo">898</span>  public void shipped() throws IOException {<a name="line.898"></a>
-<span class="sourceLineNo">899</span>    for (KeyValueHeap h : this.heapsForDelayedClose) {<a name="line.899"></a>
-<span class="sourceLineNo">900</span>      h.close();// There wont be further fetch of Cells from these scanners. Just close.<a name="line.900"></a>
-<span class="sourceLineNo">901</span>    }<a name="line.901"></a>
-<span class="sourceLineNo">902</span>    this.heapsForDelayedClose.clear();<a name="line.902"></a>
-<span class="sourceLineNo">903</span>    if (this.heap != null) {<a name="line.903"></a>
-<span class="sourceLineNo">904</span>      this.heap.shipped();<a name="line.904"></a>
-<span class="sourceLineNo">905</span>    }<a name="line.905"></a>
-<span class="sourceLineNo">906</span>  }<a name="line.906"></a>
-<span class="sourceLineNo">907</span>}<a name="line.907"></a>
-<span class="sourceLineNo">908</span><a name="line.908"></a>
+<span class="sourceLineNo">417</span>    if (this.heap == null) {<a name="line.417"></a>
+<span class="sourceLineNo">418</span>      return this.lastTop;<a name="line.418"></a>
+<span class="sourceLineNo">419</span>    }<a name="line.419"></a>
+<span class="sourceLineNo">420</span>    return this.heap.peek();<a name="line.420"></a>
+<span class="sourceLineNo">421</span>  }<a name="line.421"></a>
+<span class="sourceLineNo">422</span><a name="line.422"></a>
+<span class="sourceLineNo">423</span>  @Override<a name="line.423"></a>
+<span class="sourceLineNo">424</span>  public KeyValue next() {<a name="line.424"></a>
+<span class="sourceLineNo">425</span>    // throw runtime exception perhaps?<a name="line.425"></a>
+<span class="sourceLineNo">426</span>    throw new RuntimeException("Never call StoreScanner.next()");<a name="line.426"></a>
+<span class="sourceLineNo">427</span>  }<a name="line.427"></a>
+<span class="sourceLineNo">428</span><a name="line.428"></a>
+<span class="sourceLineNo">429</span>  @Override<a name="line.429"></a>
+<span class="sourceLineNo">430</span>  public void close() {<a name="line.430"></a>
+<span class="sourceLineNo">431</span>    close(true);<a name="line.431"></a>
+<span class="sourceLineNo">432</span>  }<a name="line.432"></a>
+<span class="sourceLineNo">433</span><a name="line.433"></a>
+<span class="sourceLineNo">434</span>  private void close(boolean withHeapClose) {<a name="line.434"></a>
+<span class="sourceLineNo">435</span>    if (this.closing) {<a name="line.435"></a>
+<span class="sourceLineNo">436</span>      return;<a name="line.436"></a>
+<span class="sourceLineNo">437</span>    }<a name="line.437"></a>
+<span class="sourceLineNo">438</span>    if (withHeapClose) this.closing = true;<a name="line.438"></a>
+<span class="sourceLineNo">439</span>    // Under test, we dont have a this.store<a name="line.439"></a>
+<span class="sourceLineNo">440</span>    if (this.store != null) this.store.deleteChangedReaderObserver(this);<a name="line.440"></a>
+<span class="sourceLineNo">441</span>    if (withHeapClose) {<a name="line.441"></a>
+<span class="sourceLineNo">442</span>      for (KeyValueHeap h : this.heapsForDelayedClose) {<a name="line.442"></a>
+<span class="sourceLineNo">443</span>        h.close();<a name="line.443"></a>
+<span class="sourceLineNo">444</span>      }<a name="line.444"></a>
+<span class="sourceLineNo">445</span>      this.heapsForDelayedClose.clear();<a name="line.445"></a>
+<span class="sourceLineNo">446</span>      if (this.heap != null) {<a name="line.446"></a>
+<span class="sourceLineNo">447</span>        this.heap.close();<a name="line.447"></a>
+<span class="sourceLineNo">448</span>        this.currentScanners.clear();<a name="line.448"></a>
+<span class="sourceLineNo">449</span>        this.heap = null; // CLOSED!<a name="line.449"></a>
+<span class="sourceLineNo">450</span>      }<a name="line.450"></a>
+<span class="sourceLineNo">451</span>    } else {<a name="line.451"></a>
+<span class="sourceLineNo">452</span>      if (this.heap != null) {<a name="line.452"></a>
+<span class="sourceLineNo">453</span>        this.heapsForDelayedClose.add(this.heap);<a name="line.453"></a>
+<span class="sourceLineNo">454</span>        this.currentScanners.clear();<a name="line.454"></a>
+<span class="sourceLineNo">455</span>        this.heap = 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>    this.lastTop = null; // If both are null, we are closed.<a name="line.458"></a>
+<span class="sourceLineNo">459</span>  }<a name="line.459"></a>
+<span class="sourceLineNo">460</span><a name="line.460"></a>
+<span class="sourceLineNo">461</span>  @Override<a name="line.461"></a>
+<span class="sourceLineNo">462</span>  public boolean seek(Cell key) throws IOException {<a name="line.462"></a>
+<span class="sourceLineNo">463</span>    boolean flushed = checkFlushed();<a name="line.463"></a>
+<span class="sourceLineNo">464</span>    // reset matcher state, in case that underlying store changed<a name="line.464"></a>
+<span class="sourceLineNo">465</span>    checkReseek(flushed);<a name="line.465"></a>
+<span class="sourceLineNo">466</span>    return this.heap.seek(key);<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>  @Override<a name="line.469"></a>
+<span class="sourceLineNo">470</span>  public boolean next(List&lt;Cell&gt; outResult) throws IOException {<a name="line.470"></a>
+<span class="sourceLineNo">471</span>    return next(outResult, NoLimitScannerContext.getInstance());<a name="line.471"></a>
+<span class="sourceLineNo">472</span>  }<a name="line.472"></a>
+<span class="sourceLineNo">473</span><a name="line.473"></a>
+<span class="sourceLineNo">474</span>  /**<a name="line.474"></a>
+<span class="sourceLineNo">475</span>   * Get the next row of values from this Store.<a name="line.475"></a>
+<span class="sourceLineNo">476</span>   * @param outResult<a name="line.476"></a>
+<span class="sourceLineNo">477</span>   * @param scannerContext<a name="line.477"></a>
+<span class="sourceLineNo">478</span>   * @return true if there are more rows, false if scanner is done<a name="line.478"></a>
+<span class="sourceLineNo">479</span>   */<a name="line.479"></a>
+<span class="sourceLineNo">480</span>  @Override<a name="line.480"></a>
+<span class="sourceLineNo">481</span>  public boolean next(List&lt;Cell&gt; outResult, ScannerContext scannerContext) throws IOException {<a name="line.481"></a>
+<span class="sourceLineNo">482</span>    if (scannerContext == null) {<a name="line.482"></a>
+<span class="sourceLineNo">483</span>      throw new IllegalArgumentException("Scanner context cannot be null");<a name="line.483"></a>
+<span class="sourceLineNo">484</span>    }<a name="line.484"></a>
+<span class="sourceLineNo">485</span>    boolean flushed = checkFlushed();<a name="line.485"></a>
+<span class="sourceLineNo">486</span>    if (checkReseek(flushed)) {<a name="line.486"></a>
+<span class="sourceLineNo">487</span>      return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.487"></a>
+<span class="sourceLineNo">488</span>    }<a name="line.488"></a>
+<span class="sourceLineNo">489</span><a name="line.489"></a>
+<span class="sourceLineNo">490</span>    // if the heap was left null, then the scanners had previously run out anyways, close and<a name="line.490"></a>
+<span class="sourceLineNo">491</span>    // return.<a name="line.491"></a>
+<span class="sourceLineNo">492</span>    if (this.heap == null) {<a name="line.492"></a>
+<span class="sourceLineNo">493</span>      // By this time partial close should happened because already heap is null<a name="line.493"></a>
+<span class="sourceLineNo">494</span>      close(false);// Do all cleanup except heap.close()<a name="line.494"></a>
+<span class="sourceLineNo">495</span>      return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<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>    Cell cell = this.heap.peek();<a name="line.498"></a>
+<span class="sourceLineNo">499</span>    if (cell == null) {<a name="line.499"></a>
+<span class="sourceLineNo">500</span>      close(false);// Do all cleanup except heap.close()<a name="line.500"></a>
+<span class="sourceLineNo">501</span>      return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<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>    // only call setRow if the row changes; avoids confusing the query matcher<a name="line.504"></a>
+<span class="sourceLineNo">505</span>    // if scanning intra-row<a name="line.505"></a>
+<span class="sourceLineNo">506</span><a name="line.506"></a>
+<span class="sourceLineNo">507</span>    // If no limits exists in the scope LimitScope.Between_Cells then we are sure we are changing<a name="line.507"></a>
+<span class="sourceLineNo">508</span>    // rows. Else it is possible we are still traversing the same row so we must perform the row<a name="line.508"></a>
+<span class="sourceLineNo">509</span>    // comparison.<a name="line.509"></a>
+<span class="sourceLineNo">510</span>    if (!scannerContext.hasAnyLimit(LimitScope.BETWEEN_CELLS) || matcher.curCell == null<a name="line.510"></a>
+<span class="sourceLineNo">511</span>        || !CellUtil.matchingRow(cell, matcher.curCell)) {<a name="line.511"></a>
+<span class="sourceLineNo">512</span>      this.countPerRow = 0;<a name="line.512"></a>
+<span class="sourceLineNo">513</span>      matcher.setToNewRow(cell);<a name="line.513"></a>
+<span class="sourceLineNo">514</span>    }<a name="line.514"></a>
+<span class="sourceLineNo">515</span><a name="line.515"></a>
+<span class="sourceLineNo">516</span>    // Clear progress away unless invoker has indicated it should be kept.<a name="line.516"></a>
+<span class="sourceLineNo">517</span>    if (!scannerContext.getKeepProgress()) scannerContext.clearProgress();<a name="line.517"></a>
+<span class="sourceLineNo">518</span><a name="line.518"></a>
+<span class="sourceLineNo">519</span>    // Only do a sanity-check if store and comparator are available.<a name="line.519"></a>
+<span class="sourceLineNo">520</span>    CellComparator comparator = store != null ? store.getComparator() : null;<a name="line.520"></a>
+<span class="sourceLineNo">521</span><a name="line.521"></a>
+<span class="sourceLineNo">522</span>    int count = 0;<a name="line.522"></a>
+<span class="sourceLineNo">523</span>    long totalBytesRead = 0;<a name="line.523"></a>
+<span class="sourceLineNo">524</span><a name="line.524"></a>
+<span class="sourceLineNo">525</span>    LOOP: do {<a name="line.525"></a>
+<span class="sourceLineNo">526</span>      // Update and check the time limit based on the configured value of cellsPerTimeoutCheck<a name="line.526"></a>
+<span class="sourceLineNo">527</span>      if ((kvsScanned % cellsPerHeartbeatCheck == 0)) {<a name="line.527"></a>
+<span class="sourceLineNo">528</span>        scannerContext.updateTimeProgress();<a name="line.528"></a>
+<span class="sourceLineNo">529</span>        if (scannerContext.checkTimeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.529"></a>
+<span class="sourceLineNo">530</span>          return scannerContext.setScannerState(NextState.TIME_LIMIT_REACHED).hasMoreValues();<a name="line.530"></a>
+<span class="sourceLineNo">531</span>        }<a name="line.531"></a>
+<span class="sourceLineNo">532</span>      }<a name="line.532"></a>
+<span class="sourceLineNo">533</span><a name="line.533"></a>
+<span class="sourceLineNo">534</span>      if (prevCell != cell) ++kvsScanned; // Do object compare - we set prevKV from the same heap.<a name="line.534"></a>
+<span class="sourceLineNo">535</span>      checkScanOrder(prevCell, cell, comparator);<a name="line.535"></a>
+<span class="sourceLineNo">536</span>      prevCell = cell;<a name="line.536"></a>
+<span class="sourceLineNo">537</span><a name="line.537"></a>
+<span class="sourceLineNo">538</span>      ScanQueryMatcher.MatchCode qcode = matcher.match(cell);<a name="line.538"></a>
+<span class="sourceLineNo">539</span>      qcode = optimize(qcode, cell);<a name="line.539"></a>
+<span class="sourceLineNo">540</span>      switch (qcode) {<a name="line.540"></a>
+<span class="sourceLineNo">541</span>      case INCLUDE:<a name="line.541"></a>
+<span class="sourceLineNo">542</span>      case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.542"></a>
+<span class="sourceLineNo">543</span>      case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.543"></a>
+<span class="sourceLineNo">544</span><a name="line.544"></a>
+<span class="sourceLineNo">545</span>        Filter f = matcher.getFilter();<a name="line.545"></a>
+<span class="sourceLineNo">546</span>        if (f != null) {<a name="line.546"></a>
+<span class="sourceLineNo">547</span>          cell = f.transformCell(cell);<a name="line.547"></a>
+<span class="sourceLineNo">548</span>        }<a name="line.548"></a>
+<span class="sourceLineNo">549</span><a name="line.549"></a>
+<span class="sourceLineNo">550</span>        this.countPerRow++;<a name="line.550"></a>
+<span class="sourceLineNo">551</span>        if (storeLimit &gt; -1 &amp;&amp; this.countPerRow &gt; (storeLimit + storeOffset)) {<a name="line.551"></a>
+<span class="sourceLineNo">552</span>          // do what SEEK_NEXT_ROW does.<a name="line.552"></a>
+<span class="sourceLineNo">553</span>          if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.553"></a>
+<span class="sourceLineNo">554</span>            return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.554"></a>
+<span class="sourceLineNo">555</span>          }<a name="line.555"></a>
+<span class="sourceLineNo">556</span>          seekToNextRow(cell);<a name="line.556"></a>
+<span class="sourceLineNo">557</span>          break LOOP;<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>        // add to results only if we have skipped #storeOffset kvs<a name="line.560"></a>
+<span class="sourceLineNo">561</span>        // also update metric accordingly<a name="line.561"></a>
+<span class="sourceLineNo">562</span>        if (this.countPerRow &gt; storeOffset) {<a name="line.562"></a>
+<span class="sourceLineNo">563</span>          outResult.add(cell);<a name="line.563"></a>
+<span class="sourceLineNo">564</span><a name="line.564"></a>
+<span class="sourceLineNo">565</span>          // Update local tracking information<a name="line.565"></a>
+<span class="sourceLineNo">566</span>          count++;<a name="line.566"></a>
+<span class="sourceLineNo">567</span>          totalBytesRead += CellUtil.estimatedSerializedSizeOf(cell);<a name="line.567"></a>
+<span class="sourceLineNo">568</span><a name="line.568"></a>
+<span class="sourceLineNo">569</span>          // Update the progress of the scanner context<a name="line.569"></a>
+<span class="sourceLineNo">570</span>          scannerContext.incrementSizeProgress(CellUtil.estimatedHeapSizeOf(cell));<a name="line.570"></a>
+<span class="sourceLineNo">571</span>          scannerContext.incrementBatchProgress(1);<a name="line.571"></a>
+<span class="sourceLineNo">572</span><a name="line.572"></a>
+<span class="sourceLineNo">573</span>          if (totalBytesRead &gt; maxRowSize) {<a name="line.573"></a>
+<span class="sourceLineNo">574</span>            throw new RowTooBigException(<a name="line.574"></a>
+<span class="sourceLineNo">575</span>                "Max row size allowed: " + maxRowSize + ", but the row is bigger than that.");<a name="line.575"></a>
+<span class="sourceLineNo">576</span>          }<a name="line.576"></a>
+<span class="sourceLineNo">577</span>        }<a name="line.577"></a>
+<span class="sourceLineNo">578</span><a name="line.578"></a>
+<span class="sourceLineNo">579</span>        if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_ROW) {<a name="line.579"></a>
+<span class="sourceLineNo">580</span>          if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.580"></a>
+<span class="sourceLineNo">581</span>            return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.581"></a>
+<span class="sourceLineNo">582</span>          }<a name="line.582"></a>
+<span class="sourceLineNo">583</span>          seekToNextRow(cell);<a name="line.583"></a>
+<span class="sourceLineNo">584</span>        } else if (qcode == ScanQueryMatcher.MatchCode.INCLUDE_AND_SEEK_NEXT_COL) {<a name="line.584"></a>
+<span class="sourceLineNo">585</span>          seekAsDirection(matcher.getKeyForNextColumn(cell));<a name="line.585"></a>
+<span class="sourceLineNo">586</span>        } else {<a name="line.586"></a>
+<span class="sourceLineNo">587</span>          this.heap.next();<a name="line.587"></a>
+<span class="sourceLineNo">588</span>        }<a name="line.588"></a>
+<span class="sourceLineNo">589</span><a name="line.589"></a>
+<span class="sourceLineNo">590</span>        if (scannerContext.checkBatchLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.590"></a>
+<span class="sourceLineNo">591</span>          break LOOP;<a name="line.591"></a>
+<span class="sourceLineNo">592</span>        }<a name="line.592"></a>
+<span class="sourceLineNo">593</span>        if (scannerContext.checkSizeLimit(LimitScope.BETWEEN_CELLS)) {<a name="line.593"></a>
+<span class="sourceLineNo">594</span>          break LOOP;<a name="line.594"></a>
+<span class="sourceLineNo">595</span>        }<a name="line.595"></a>
+<span class="sourceLineNo">596</span>        continue;<a name="line.596"></a>
+<span class="sourceLineNo">597</span><a name="line.597"></a>
+<span class="sourceLineNo">598</span>      case DONE:<a name="line.598"></a>
+<span class="sourceLineNo">599</span>        return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.599"></a>
+<span class="sourceLineNo">600</span><a name="line.600"></a>
+<span class="sourceLineNo">601</span>      case DONE_SCAN:<a name="line.601"></a>
+<span class="sourceLineNo">602</span>        close(false);// Do all cleanup except heap.close()<a name="line.602"></a>
+<span class="sourceLineNo">603</span>        return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.603"></a>
+<span class="sourceLineNo">604</span><a name="line.604"></a>
+<span class="sourceLineNo">605</span>      case SEEK_NEXT_ROW:<a name="line.605"></a>
+<span class="sourceLineNo">606</span>        // This is just a relatively simple end of scan fix, to short-cut end<a name="line.606"></a>
+<span class="sourceLineNo">607</span>        // us if there is an endKey in the scan.<a name="line.607"></a>
+<span class="sourceLineNo">608</span>        if (!matcher.moreRowsMayExistAfter(cell)) {<a name="line.608"></a>
+<span class="sourceLineNo">609</span>          return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<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>        seekToNextRow(cell);<a name="line.612"></a>
+<span class="sourceLineNo">613</span>        break;<a name="line.613"></a>
+<span class="sourceLineNo">614</span><a name="line.614"></a>
+<span class="sourceLineNo">615</span>      case SEEK_NEXT_COL:<a name="line.615"></a>
+<span class="sourceLineNo">616</span>        seekAsDirection(matcher.getKeyForNextColumn(cell));<a name="line.616"></a>
+<span class="sourceLineNo">617</span>        break;<a name="line.617"></a>
+<span class="sourceLineNo">618</span><a name="line.618"></a>
+<span class="sourceLineNo">619</span>      case SKIP:<a name="line.619"></a>
+<span class="sourceLineNo">620</span>        this.heap.next();<a name="line.620"></a>
+<span class="sourceLineNo">621</span>        break;<a name="line.621"></a>
+<span class="sourceLineNo">622</span><a name="line.622"></a>
+<span class="sourceLineNo">623</span>      case SEEK_NEXT_USING_HINT:<a name="line.623"></a>
+<span class="sourceLineNo">624</span>        Cell nextKV = matcher.getNextKeyHint(cell);<a name="line.624"></a>
+<span class="sourceLineNo">625</span>        if (nextKV != null) {<a name="line.625"></a>
+<span class="sourceLineNo">626</span>          seekAsDirection(nextKV);<a name="line.626"></a>
+<span class="sourceLineNo">627</span>        } else {<a name="line.627"></a>
+<span class="sourceLineNo">628</span>          heap.next();<a name="line.628"></a>
+<span class="sourceLineNo">629</span>        }<a name="line.629"></a>
+<span class="sourceLineNo">630</span>        break;<a name="line.630"></a>
+<span class="sourceLineNo">631</span><a name="line.631"></a>
+<span class="sourceLineNo">632</span>      default:<a name="line.632"></a>
+<span class="sourceLineNo">633</span>        throw new RuntimeException("UNEXPECTED");<a name="line.633"></a>
+<span class="sourceLineNo">634</span>      }<a name="line.634"></a>
+<span class="sourceLineNo">635</span>    } while ((cell = this.heap.peek()) != null);<a name="line.635"></a>
+<span class="sourceLineNo">636</span><a name="line.636"></a>
+<span class="sourceLineNo">637</span>    if (count &gt; 0) {<a name="line.637"></a>
+<span class="sourceLineNo">638</span>      return scannerContext.setScannerState(NextState.MORE_VALUES).hasMoreValues();<a name="line.638"></a>
+<span class="sourceLineNo">639</span>    }<a name="line.639"></a>
+<span class="sourceLineNo">640</span><a name="line.640"></a>
+<span class="sourceLineNo">641</span>    // No more keys<a name="line.641"></a>
+<span class="sourceLineNo">642</span>    close(false);// Do all cleanup except heap.close()<a name="line.642"></a>
+<span class="sourceLineNo">643</span>    return scannerContext.setScannerState(NextState.NO_MORE_VALUES).hasMoreValues();<a name="line.643"></a>
+<span class="sourceLineNo">644</span>  }<a name="line.644"></a>
+<span class="sourceLineNo">645</span><a name="line.645"></a>
+<span class="sourceLineNo">646</span>  /*<a name="line.646"></a>
+<span class="sourceLineNo">647</span>   * See if we should actually SEEK or rather just SKIP to the next Cell.<a name="line.647"></a>
+<span class="sourceLineNo">648</span>   * (see HBASE-13109)<a name="line.648"></a>
+<span class="sourceLineNo">649</span>   */<a name="line.649"></a>
+<span class="sourceLineNo">650</span>  private ScanQueryMatcher.MatchCode optimize(ScanQueryMatcher.MatchCode qcode, Cell cell) {<a name="line.650"></a>
+<span class="sourceLineNo">651</span>    switch(qcode) {<a name="line.651"></a>
+<span class="sourceLineNo">652</span>    case INCLUDE_AND_SEEK_NEXT_COL:<a name="line.652"></a>
+<span class="sourceLineNo">653</span>    case SEEK_NEXT_COL:<a name="line.653"></a>
+<span class="sourceLineNo">654</span>    {<a name="line.654"></a>
+<span class="sourceLineNo">655</span>      Cell nextIndexedKey = getNextIndexedKey();<a name="line.655"></a>
+<span class="sourceLineNo">656</span>      if (nextIndexedKey != null &amp;&amp; nextIndexedKey != HConstants.NO_NEXT_INDEXED_KEY<a name="line.656"></a>
+<span class="sourceLineNo">657</span>          &amp;&amp; matcher.compareKeyForNextColumn(nextIndexedKey, cell) &gt;= 0) {<a name="line.657"></a>
+<span class="sourceLineNo">658</span>        return qcode == MatchCode.SEEK_NEXT_COL ? MatchCode.SKIP : MatchCode.INCLUDE;<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 INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.662"></a>
+<span class="sourceLineNo">663</span>    case SEEK_NEXT_ROW:<a name="line.663"></a>
+<span class="sourceLineNo">664</span>    {<a name="line.664"></a>
+<span class="sourceLineNo">665</span>      Cell nextIndexedKey = getNextIndexedKey();<a name="line.665"></a>
+<span class="sourceLineNo">666</span>      if (nextIndexedKey != null &amp;&amp; nextIndexedKey != HConstants.NO_NEXT_INDEXED_KEY<a name="line.666"></a>
+<span class="sourceLineNo">667</span>          &amp;&amp; matcher.compareKeyForNextRow(nextIndexedKey, cell) &gt;= 0) {<a name="line.667"></a>
+<span class="sourceLineNo">668</span>        return qcode == MatchCode.SEEK_NEXT_ROW ? MatchCode.SKIP : MatchCode.INCLUDE;<a name="line.668"></a>
+<span class="sourceLineNo">669</span>      }<a name="line.669"></a>
+<span class="sourceLineNo">670</span>      break;<a name="line.670"></a>
+<span class="sourceLineNo">671</span>    }<a name="line.671"></a>
+<span class="sourceLineNo">672</span>    default:<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>    return qcode;<a name="line.675"></a>
+<span class="sourceLineNo">676</span>  }<a name="line.676"></a>
+<span class="sourceLineNo">677</span><a name="line.677"></a>
+<span class="sourceLineNo">678</span>  // Implementation of ChangedReadersObserver<a name="line.678"></a>
+<span class="sourceLineNo">679</span>  @Override<a name="line.679"></a>
+<span class="sourceLineNo">680</span>  public void updateReaders(List&lt;StoreFile&gt; sfs) throws IOException {<a name="line.680"></a>
+<span class="sourceLineNo">681</span>    flushed = true;<a name="line.681"></a>
+<span class="sourceLineNo">682</span>    flushLock.lock();<a name="line.682"></a>
+<span class="sourceLineNo">683</span>    try {<a name="line.683"></a>
+<span class="sourceLineNo">684</span>      flushedStoreFiles.addAll(sfs);<a name="line.684"></a>
+<span class="sourceLineNo">685</span>    } finally {<a name="line.685"></a>
+<span class="sourceLineNo">686</span>      flushLock.unlock();<a name="line.686"></a>
+<span class="sourceLineNo">687</span>    }<a name="line.687"></a>
+<span class="sourceLineNo">688</span>    // Let the next() call handle re-creating and seeking<a name="line.688"></a>
+<span class="sourceLineNo">689</span>  }<a name="line.689"></a>
+<span class="sourceLineNo">690</span><a name="line.690"></a>
+<span class="sourceLineNo">691</span>  /**<a name="line.691"></a>
+<span class="sourceLineNo">692</span>   * @param flushed indicates if there was a flush<a name="line.692"></a>
+<span class="sourceLineNo">693</span>   * @return true if top of heap has changed (and KeyValueHeap has to try the<a name="line.693"></a>
+<span class="sourceLineNo">694</span>   *         next KV)<a name="line.694"></a>
+<span class="sourceLineNo">695</span>   * @throws IOException<a name="line.695"></a>
+<span class="sourceLineNo">696</span>   */<a name="line.696"></a>
+<span class="sourceLineNo">697</span>  protected boolean checkReseek(boolean flushed) throws IOException {<a name="line.697"></a>
+<span class="sourceLineNo">698</span>    if (flushed &amp;&amp; this.lastTop != null) {<a name="line.698"></a>
+<span class="sourceLineNo">699</span>      resetScannerStack(this.lastTop);<a name="line.699"></a>
+<span class="sourceLineNo">700</span>      if (this.heap.peek() == null<a name="line.700"></a>
+<span class="sourceLineNo">701</span>          || store.getComparator().compareRows(this.lastTop, this.heap.peek()) != 0) {<a name="line.701"></a>
+<span class="sourceLineNo">702</span>        LOG.debug("Storescanner.peek() is changed where before = "<a name="line.702"></a>
+<span class="sourceLineNo">703</span>            + this.lastTop.toString() + ",and after = " + this.heap.peek());<a name="line.703"></a>
+<span class="sourceLineNo">704</span>        this.lastTop = null;<a name="line.704"></a>
+<span class="sourceLineNo">705</span>        return true;<a name="line.705"></a>
+<span class="sourceLineNo">706</span>      }<a name="line.706"></a>
+<span class="sourceLineNo">707</span>      this.lastTop = null; // gone!<a name="line.707"></a>
+<span class="sourceLineNo">708</span>    }<a name="line.708"></a>
+<span class="sourceLineNo">709</span>    // else dont need to reseek<a name="line.709"></a>
+<span class="sourceLineNo">710</span>    return false;<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>  protected void resetScannerStack(Cell lastTopKey) throws IOException {<a name="line.713"></a>
+<span class="sourceLineNo">714</span>    /* When we have the scan object, should we not pass it to getScanners()<a name="line.714"></a>
+<span class="sourceLineNo">715</span>     * to get a limited set of scanners? We did so in the constructor and we<a name="line.715"></a>
+<span class="sourceLineNo">716</span>     * could have done it now by storing the scan object from the constructor<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>    final boolean isCompaction = false;<a name="line.719"></a>
+<span class="sourceLineNo">720</span>    boolean usePread = get || scanUsePread;<a name="line.720"></a>
+<span class="sourceLineNo">721</span>    List&lt;KeyValueScanner&gt; scanners = null;<a name="line.721"></a>
+<span class="sourceLineNo">722</span>    try {<a name="line.722"></a>
+<span class="sourceLineNo">723</span>      flushLock.lock();<a name="line.723"></a>
+<span class="sourceLineNo">724</span>      scanners = selectScannersFrom(store.getScanners(flushedStoreFiles, cacheBlocks, get, usePread,<a name="line.724"></a>
+<span class="sourceLineNo">725</span>        isCompaction, matcher, scan.getStartRow(), scan.getStopRow(), this.readPt, true));<a name="line.725"></a>
+<span class="sourceLineNo">726</span>      // Clear the current set of flushed store files so that they don't get added again<a name="line.726"></a>
+<span class="sourceLineNo">727</span>      flushedStoreFiles.clear();<a name="line.727"></a>
+<span class="sourceLineNo">728</span>    } finally {<a name="line.728"></a>
+<span class="sourceLineNo">729</span>      flushLock.unlock();<a name="line.729"></a>
+<span class="sourceLineNo">730</span>    }<a name="line.730"></a>
+<span class="sourceLineNo">731</span><a name="line.731"></a>
+<span class="sourceLineNo">732</span>    // Seek the new scanners to the last key<a name="line.732"></a>
+<span class="sourceLineNo">733</span>    seekScanners(scanners, lastTopKey, false, parallelSeekEnabled);<a name="line.733"></a>
+<span class="sourceLineNo">734</span>    // remove the older memstore scanner<a name="line.734"></a>
+<span class="sourceLineNo">735</span>    for (int i = 0; i &lt; currentScanners.size(); i++) {<a name="line.735"></a>
+<span class="sourceLineNo">736</span>      if (!currentScanners.get(i).isFileScanner()) {<a name="line.736"></a>
+<span class="sourceLineNo">737</span>        currentScanners.remove(i);<a name="line.737"></a>
+<span class="sourceLineNo">738</span>        break;<a name="line.738"></a>
+<span class="sourceLineNo">739</span>      }<a name="line.739"></a>
+<span class="sourceLineNo">740</span>    }<a name="line.740"></a>
+<span class="sourceLineNo">741</span>    // add the newly created scanners on the flushed files and the current active memstore scanner<a name="line.741"></a>
+<span class="sourceLineNo">742</span>    addCurrentScanners(scanners);<a name="line.742"></a>
+<span class="sourceLineNo">743</span>    // Combine all seeked scanners with a heap<a name="line.743"></a>
+<span class="sourceLineNo">744</span>    resetKVHeap(this.currentScanners, store.getComparator());<a name="line.744"></a>
+<span class="sourceLineNo">745</span>    // Reset the state of the Query Matcher and set to top row.<a name="line.745"></a>
+<span class="sourceLineNo">746</span>    // Only reset and call setRow if the row changes; avoids confusing the<a name="line.746"></a>
+<span class="sourceLineNo">747</span>    // query matcher if scanning intra-row.<a name="line.747"></a>
+<span class="sourceLineNo">748</span>    Cell cell = heap.peek();<a name="line.748"></a>
+<span class="sourceLineNo">749</span>    if (cell == null) {<a name="line.749"></a>
+<span class="sourceLineNo">750</span>      cell = lastTopKey;<a name="line.750"></a>
+<span class="sourceLineNo">751</span>    }<a name="line.751"></a>
+<span class="sourceLineNo">752</span>    if ((matcher.curCell == null) || !CellUtil.matchingRows(cell, matcher.curCell)) {<a name="line.752"></a>
+<span class="sourceLineNo">753</span>      this.countPerRow = 0;<a name="line.753"></a>
+<span class="sourceLineNo">754</span>      matcher.reset();<a name="line.754"></a>
+<span class="sourceLineNo">755</span>      matcher.setToNewRow(cell);<a name="line.755"></a>
+<span class="sourceLineNo">756</span>    }<a name="line.756"></a>
+<span class="sourceLineNo">757</span>  }<a name="line.757"></a>
+<span class="sourceLineNo">758</span><a name="line.758"></a>
+<span class="sourceLineNo">759</span>  /**<a name="line.759"></a>
+<span class="sourceLineNo">760</span>   * Check whether scan as expected order<a name="line.760"></a>
+<span class="sourceLineNo">761</span>   * @param prevKV<a name="line.761"></a>
+<span class="sourceLineNo">762</span>   * @param kv<a name="line.762"></a>
+<span class="sourceLineNo">763</span>   * @param comparator<a name="line.763"></a>
+<span class="sourceLineNo">764</span>   * @throws IOException<a name="line.764"></a>
+<span class="sourceLineNo">765</span>   */<a name="line.765"></a>
+<span class="sourceLineNo">766</span>  protected void checkScanOrder(Cell prevKV, Cell kv,<a name="line.766"></a>
+<span class="sourceLineNo">767</span>      CellComparator comparator) throws IOException {<a name="line.767"></a>
+<span class="sourceLineNo">768</span>    // Check that the heap gives us KVs in an increasing order.<a name="line.768"></a>
+<span class="sourceLineNo">769</span>    assert prevKV == null || comparator == null<a name="line.769"></a>
+<span class="sourceLineNo">770</span>        || comparator.compare(prevKV, kv) &lt;= 0 : "Key " + prevKV<a name="line.770"></a>
+<span class="sourceLineNo">771</span>        + " followed by a " + "smaller key " + kv + " in cf " + store;<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>  protected boolean seekToNextRow(Cell c) throws IOException {<a name="line.774"></a>
+<span class="sourceLineNo">775</span>    return reseek(CellUtil.createLastOnRow(c));<a name="line.775"></a>
+<span class="sourceLineNo">776</span>  }<a name="line.776"></a>
+<span class="sourceLineNo">777</span><a name="line.777"></a>
+<span class="sourceLineNo">778</span>  /**<a name="line.778"></a>
+<span class="sourceLineNo">779</span>   * Do a reseek in a normal StoreScanner(scan forward)<a name="line.779"></a>
+<span class="sourceLineNo">780</span>   * @param kv<a name="line.780"></a>
+<span class="sourceLineNo">781</span>   * @return true if scanner has values left, false if end of scanner<a name="line.781"></a>
+<span class="sourceLineNo">782</span>   * @throws IOException<a name="line.782"></a>
+<span class="sourceLineNo">783</span>   */<a name="line.783"></a>
+<span class="sourceLineNo">784</span>  protected boolean seekAsDirection(Cell kv)<a name="line.784"></a>
+<span class="sourceLineNo">785</span>      throws IOException {<a name="line.785"></a>
+<span class="sourceLineNo">786</span>    return reseek(kv);<a name="line.786"></a>
+<span class="sourceLineNo">787</span>  }<a name="line.787"></a>
+<span class="sourceLineNo">788</span><a name="line.788"></a>
+<span class="sourceLineNo">789</span>  @Override<a name="line.789"></a>
+<span class="sourceLineNo">790</span>  public boolean reseek(Cell kv) throws IOException {<a name="line.790"></a>
+<span class="sourceLineNo">791</span>    boolean flushed = checkFlushed();<a name="line.791"></a>
+<span class="sourceLineNo">792</span>    // Heap will not be null, if this is called from next() which.<a name="line.792"></a>
+<span class="sourceLineNo">793</span>    // If called from RegionScanner.reseek(...) make sure the scanner<a name="line.793"></a>
+<span class="sourceLineNo">794</span>    // stack is reset if needed.<a name="line.794"></a>
+<span class="sourceLineNo">795</span>    checkReseek(flushed);<a name="line.795"></a>
+<span class="sourceLineNo">796</span>    if (explicitColumnQuery &amp;&amp; lazySeekEnabledGlobally) {<a name="line.796"></a>
+<span class="sourceLineNo">797</span>      return heap.requestSeek(kv, true, useRowColBloom);<a name="line.797"></a>
+<span class="sourceLineNo">798</span>    }<a name="line.798"></a>
+<span class="sourceLineNo">799</span>    return heap.reseek(kv);<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>  protected boolean checkFlushed() {<a name="line.802"></a>
+<span class="sourceLineNo">803</span>    // check the var without any lock. Suppose even if we see the old<a name="line.803"></a>
+<span class="sourceLineNo">804</span>    // value here still it is ok to continue because we will not be resetting<a name="line.804"></a>
+<span class="sourceLineNo">805</span>    // the heap but will continue with the referenced memstore's snapshot. For compactions<a name="line.805"></a>
+<span class="sourceLineNo">806</span>    // any way we don't need the updateReaders at all to happen as we still continue with <a name="line.806"></a>
+<span class="sourceLineNo">807</span>    // the older files<a name="line.807"></a>
+<span class="sourceLineNo">808</span>    if (flushed) {<a name="line.808"></a>
+<span class="sourceLineNo">809</span>      // If there is a flush and the current scan is notified on the flush ensure that the <a name="line.809"></a>
+<span class="sourceLineNo">810</span>      // scan's heap gets reset and we do a seek on the newly flushed file.<a name="line.810"></a>
+<span class="sourceLineNo">811</span>      if(!this.closing) {<a name="line.811"></a>
+<span class="sourceLineNo">812</span>        this.lastTop = this.peek();<a name="line.812"></a>
+<span class="sourceLineNo">813</span>      } else {<a name="line.813"></a>
+<span class="sourceLineNo">814</span>        return false;<a name="line.814"></a>
+<span class="sourceLineNo">815</span>      }<a name="line.815"></a>
+<span class="sourceLineNo">816</span>      // reset the flag<a name="line.816"></a>
+<span class="sourceLineNo">817</span>      flushed = false;<a name="line.817"></a>
+<span class="sourceLineNo">818</span>      return true;<a name="line.818"></a>
+<span class="sourceLineNo">819</span>    }<a name="line.819"></a>
+<span class="sourceLineNo">820</span>    return false;<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 getSequenceID() {<a name="line.824"></a>
+<span class="sourceLineNo">825</span>    return 0;<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>  /**<a name="line.828"></a>
+<span class="sourceLineNo">829</span>   * Seek storefiles in parallel to optimize IO latency as much as possible<a name="line.829"></a>
+<span class="sourceLineNo">830</span>   * @param scanners the list {@link KeyValueScanner}s to be read from<a name="line.830"></a>
+<span class="sourceLineNo">831</span>   * @param kv the KeyValue on which the operation is being requested<a name="line.831"></a>
+<span class="sourceLineNo">832</span>   * @throws IOException<a name="line.832"></a>
+<span class="sourceLineNo">833</span>   */<a name="line.833"></a>
+<span class="sourceLineNo">834</span>  private void parallelSeek(final List&lt;? extends KeyValueScanner&gt;<a name="line.834"></a>
+<span class="sourceLineNo">835</span>      scanners, final Cell kv) throws IOException {<a name="line.835"></a>
+<span class="sourceLineNo">836</span>    if (scanners.isEmpty()) return;<a name="line.836"></a>
+<span class="sourceLineNo">837</span>    int storeFileScannerCount = scanners.size();<a name="line.837"></a>
+<span class="sourceLineNo">838</span>    CountDownLatch latch = new CountDownLatch(storeFileScannerCount);<a name="line.838"></a>
+<span class="sourceLineNo">839</span>    List&lt;ParallelSeekHandler&gt; handlers = <a name="line.839"></a>
+<span class="sourceLineNo">840</span>        new ArrayList&lt;ParallelSeekHandler&gt;(storeFileScannerCount);<a name="line.840"></a>
+<span class="sourceLineNo">841</span>    for (KeyValueScanner scanner : scanners) {<a name="line.841"></a>
+<span class="sourceLineNo">842</span>      if (scanner instanceof StoreFileScanner) {<a name="line.842"></a>
+<span class="sourceLineNo">843</span>        ParallelSeekHandler seekHandler = new ParallelSeekHandler(scanner, kv,<a name="line.843"></a>
+<span class="sourceLineNo">844</span>          this.readPt, latch);<a name="line.844"></a>
+<span class="sourceLineNo">845</span>        executor.submit(seekHandler);<a name="line.845"></a>
+<span class="sourceLineNo">846</span>        handlers.add(seekHandler);<a name="line.846"></a>
+<span class="sourceLineNo">847</span>      } else {<a name="line.847"></a>
+<span class="sourceLineNo">848</span>        scanner.seek(kv);<a name="line.848"></a>
+<span class="sourceLineNo">849</span>        latch.countDown();<a name="line.849"></a>
+<span class="sourceLineNo">850</span>      }<a name="line.850"></a>
+<span class="sourceLineNo">851</span>    }<a name="line.851"></a>
+<span class="sourceLineNo">852</span><a name="line.852"></a>
+<span class="sourceLineNo">853</span>    try {<a name="line.853"></a>
+<span class="sourceLineNo">854</span>      latch.await();<a name="line.854"></a>
+<span class="sourceLineNo">855</span>    } catch (InterruptedException ie) {<a name="line.855"></a>
+<span class="sourceLineNo">856</span>      throw (InterruptedIOException)new InterruptedIOException().initCause(ie);<a name="line.856"></a>
+<span class="sourceLineNo">857</span>    }<a name="line.857"></a>
+<span class="sourceLineNo">858</span><a name="line.858"></a>
+<span class="sourceLineNo">859</span>    for (ParallelSeekHandler handler : handlers) {<a name="line.859"></a>
+<span class="sourceLineNo">

<TRUNCATED>

Mime
View raw message