You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by mi...@apache.org on 2016/02/09 18:28:06 UTC
[20/51] [partial] hbase-site git commit: Published site at
7bb68b9031591cf378954a0eb8f71a8b9be01f9c.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/358717f6/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html
index cd6f37a..902213f 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/DefaultMemStore.MemStoreScanner.html
@@ -465,535 +465,534 @@
<span class="sourceLineNo">457</span> * This is called under row lock, so Get operations will still see updates<a name="line.457"></a>
<span class="sourceLineNo">458</span> * atomically. Scans will only see each KeyValue update as atomic.<a name="line.458"></a>
<span class="sourceLineNo">459</span> *<a name="line.459"></a>
-<span class="sourceLineNo">460</span> * @param cells<a name="line.460"></a>
-<span class="sourceLineNo">461</span> * @param readpoint readpoint below which we can safely remove duplicate KVs<a name="line.461"></a>
-<span class="sourceLineNo">462</span> * @return change in memstore size<a name="line.462"></a>
-<span class="sourceLineNo">463</span> */<a name="line.463"></a>
-<span class="sourceLineNo">464</span> @Override<a name="line.464"></a>
-<span class="sourceLineNo">465</span> public long upsert(Iterable<Cell> cells, long readpoint) {<a name="line.465"></a>
-<span class="sourceLineNo">466</span> long size = 0;<a name="line.466"></a>
-<span class="sourceLineNo">467</span> for (Cell cell : cells) {<a name="line.467"></a>
-<span class="sourceLineNo">468</span> size += upsert(cell, readpoint);<a name="line.468"></a>
-<span class="sourceLineNo">469</span> }<a name="line.469"></a>
-<span class="sourceLineNo">470</span> return size;<a name="line.470"></a>
-<span class="sourceLineNo">471</span> }<a name="line.471"></a>
-<span class="sourceLineNo">472</span><a name="line.472"></a>
-<span class="sourceLineNo">473</span> /**<a name="line.473"></a>
-<span class="sourceLineNo">474</span> * Inserts the specified KeyValue into MemStore and deletes any existing<a name="line.474"></a>
-<span class="sourceLineNo">475</span> * versions of the same row/family/qualifier as the specified KeyValue.<a name="line.475"></a>
-<span class="sourceLineNo">476</span> * <p><a name="line.476"></a>
-<span class="sourceLineNo">477</span> * First, the specified KeyValue is inserted into the Memstore.<a name="line.477"></a>
-<span class="sourceLineNo">478</span> * <p><a name="line.478"></a>
-<span class="sourceLineNo">479</span> * If there are any existing KeyValues in this MemStore with the same row,<a name="line.479"></a>
-<span class="sourceLineNo">480</span> * family, and qualifier, they are removed.<a name="line.480"></a>
-<span class="sourceLineNo">481</span> * <p><a name="line.481"></a>
-<span class="sourceLineNo">482</span> * Callers must hold the read lock.<a name="line.482"></a>
-<span class="sourceLineNo">483</span> * @param readpoint Smallest outstanding readpoint; below which we can remove duplicate Cells.<a name="line.483"></a>
-<span class="sourceLineNo">484</span> * @return change in size of MemStore<a name="line.484"></a>
-<span class="sourceLineNo">485</span> */<a name="line.485"></a>
-<span class="sourceLineNo">486</span> private long upsert(Cell cell, long readpoint) {<a name="line.486"></a>
-<span class="sourceLineNo">487</span> // Add the Cell to the MemStore<a name="line.487"></a>
-<span class="sourceLineNo">488</span> // Use the internalAdd method here since we (a) already have a lock<a name="line.488"></a>
-<span class="sourceLineNo">489</span> // and (b) cannot safely use the MSLAB here without potentially<a name="line.489"></a>
-<span class="sourceLineNo">490</span> // hitting OOME - see TestMemStore.testUpsertMSLAB for a<a name="line.490"></a>
-<span class="sourceLineNo">491</span> // test that triggers the pathological case if we don't avoid MSLAB<a name="line.491"></a>
-<span class="sourceLineNo">492</span> // here.<a name="line.492"></a>
-<span class="sourceLineNo">493</span> long addedSize = internalAdd(cell);<a name="line.493"></a>
-<span class="sourceLineNo">494</span><a name="line.494"></a>
-<span class="sourceLineNo">495</span> // Get the Cells for the row/family/qualifier regardless of timestamp.<a name="line.495"></a>
-<span class="sourceLineNo">496</span> // For this case we want to clean up any other puts<a name="line.496"></a>
-<span class="sourceLineNo">497</span> Cell firstCell = KeyValueUtil.createFirstOnRow(<a name="line.497"></a>
-<span class="sourceLineNo">498</span> cell.getRowArray(), cell.getRowOffset(), cell.getRowLength(),<a name="line.498"></a>
-<span class="sourceLineNo">499</span> cell.getFamilyArray(), cell.getFamilyOffset(), cell.getFamilyLength(),<a name="line.499"></a>
-<span class="sourceLineNo">500</span> cell.getQualifierArray(), cell.getQualifierOffset(), cell.getQualifierLength());<a name="line.500"></a>
-<span class="sourceLineNo">501</span> SortedSet<Cell> ss = cellSet.tailSet(firstCell);<a name="line.501"></a>
-<span class="sourceLineNo">502</span> Iterator<Cell> it = ss.iterator();<a name="line.502"></a>
-<span class="sourceLineNo">503</span> // Versions visible to oldest scanner.<a name="line.503"></a>
-<span class="sourceLineNo">504</span> int versionsVisible = 0;<a name="line.504"></a>
-<span class="sourceLineNo">505</span> while ( it.hasNext() ) {<a name="line.505"></a>
-<span class="sourceLineNo">506</span> Cell cur = it.next();<a name="line.506"></a>
-<span class="sourceLineNo">507</span><a name="line.507"></a>
-<span class="sourceLineNo">508</span> if (cell == cur) {<a name="line.508"></a>
-<span class="sourceLineNo">509</span> // ignore the one just put in<a name="line.509"></a>
-<span class="sourceLineNo">510</span> continue;<a name="line.510"></a>
-<span class="sourceLineNo">511</span> }<a name="line.511"></a>
-<span class="sourceLineNo">512</span> // check that this is the row and column we are interested in, otherwise bail<a name="line.512"></a>
-<span class="sourceLineNo">513</span> if (CellUtil.matchingRow(cell, cur) && CellUtil.matchingQualifier(cell, cur)) {<a name="line.513"></a>
-<span class="sourceLineNo">514</span> // only remove Puts that concurrent scanners cannot possibly see<a name="line.514"></a>
-<span class="sourceLineNo">515</span> if (cur.getTypeByte() == KeyValue.Type.Put.getCode() &&<a name="line.515"></a>
-<span class="sourceLineNo">516</span> cur.getSequenceId() <= readpoint) {<a name="line.516"></a>
-<span class="sourceLineNo">517</span> if (versionsVisible >= 1) {<a name="line.517"></a>
-<span class="sourceLineNo">518</span> // if we get here we have seen at least one version visible to the oldest scanner,<a name="line.518"></a>
-<span class="sourceLineNo">519</span> // which means we can prove that no scanner will see this version<a name="line.519"></a>
-<span class="sourceLineNo">520</span><a name="line.520"></a>
-<span class="sourceLineNo">521</span> // false means there was a change, so give us the size.<a name="line.521"></a>
-<span class="sourceLineNo">522</span> long delta = heapSizeChange(cur, true);<a name="line.522"></a>
-<span class="sourceLineNo">523</span> addedSize -= delta;<a name="line.523"></a>
-<span class="sourceLineNo">524</span> this.size.addAndGet(-delta);<a name="line.524"></a>
-<span class="sourceLineNo">525</span> it.remove();<a name="line.525"></a>
-<span class="sourceLineNo">526</span> setOldestEditTimeToNow();<a name="line.526"></a>
-<span class="sourceLineNo">527</span> } else {<a name="line.527"></a>
-<span class="sourceLineNo">528</span> versionsVisible++;<a name="line.528"></a>
-<span class="sourceLineNo">529</span> }<a name="line.529"></a>
-<span class="sourceLineNo">530</span> }<a name="line.530"></a>
-<span class="sourceLineNo">531</span> } else {<a name="line.531"></a>
-<span class="sourceLineNo">532</span> // past the row or column, done<a name="line.532"></a>
-<span class="sourceLineNo">533</span> break;<a name="line.533"></a>
-<span class="sourceLineNo">534</span> }<a name="line.534"></a>
-<span class="sourceLineNo">535</span> }<a name="line.535"></a>
-<span class="sourceLineNo">536</span> return addedSize;<a name="line.536"></a>
-<span class="sourceLineNo">537</span> }<a name="line.537"></a>
-<span class="sourceLineNo">538</span><a name="line.538"></a>
-<span class="sourceLineNo">539</span> /**<a name="line.539"></a>
-<span class="sourceLineNo">540</span> * @return scanner on memstore and snapshot in this order.<a name="line.540"></a>
-<span class="sourceLineNo">541</span> */<a name="line.541"></a>
-<span class="sourceLineNo">542</span> @Override<a name="line.542"></a>
-<span class="sourceLineNo">543</span> public List<KeyValueScanner> getScanners(long readPt) {<a name="line.543"></a>
-<span class="sourceLineNo">544</span> return Collections.<KeyValueScanner> singletonList(new MemStoreScanner(readPt));<a name="line.544"></a>
-<span class="sourceLineNo">545</span> }<a name="line.545"></a>
-<span class="sourceLineNo">546</span><a name="line.546"></a>
-<span class="sourceLineNo">547</span> /**<a name="line.547"></a>
-<span class="sourceLineNo">548</span> * Check if this memstore may contain the required keys<a name="line.548"></a>
-<span class="sourceLineNo">549</span> * @param scan scan<a name="line.549"></a>
-<span class="sourceLineNo">550</span> * @param store holds reference to cf<a name="line.550"></a>
-<span class="sourceLineNo">551</span> * @param oldestUnexpiredTS<a name="line.551"></a>
-<span class="sourceLineNo">552</span> * @return False if the key definitely does not exist in this Memstore<a name="line.552"></a>
-<span class="sourceLineNo">553</span> */<a name="line.553"></a>
-<span class="sourceLineNo">554</span> public boolean shouldSeek(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.554"></a>
-<span class="sourceLineNo">555</span> byte[] cf = store.getFamily().getName();<a name="line.555"></a>
-<span class="sourceLineNo">556</span> TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.556"></a>
-<span class="sourceLineNo">557</span> if (timeRange == null) {<a name="line.557"></a>
-<span class="sourceLineNo">558</span> timeRange = scan.getTimeRange();<a name="line.558"></a>
-<span class="sourceLineNo">559</span> }<a name="line.559"></a>
-<span class="sourceLineNo">560</span> return (timeRangeTracker.includesTimeRange(timeRange) ||<a name="line.560"></a>
-<span class="sourceLineNo">561</span> snapshotTimeRangeTracker.includesTimeRange(timeRange))<a name="line.561"></a>
-<span class="sourceLineNo">562</span> && (Math.max(timeRangeTracker.getMaximumTimestamp(),<a name="line.562"></a>
-<span class="sourceLineNo">563</span> snapshotTimeRangeTracker.getMaximumTimestamp()) >=<a name="line.563"></a>
-<span class="sourceLineNo">564</span> oldestUnexpiredTS);<a name="line.564"></a>
-<span class="sourceLineNo">565</span> }<a name="line.565"></a>
-<span class="sourceLineNo">566</span><a name="line.566"></a>
-<span class="sourceLineNo">567</span> /*<a name="line.567"></a>
-<span class="sourceLineNo">568</span> * MemStoreScanner implements the KeyValueScanner.<a name="line.568"></a>
-<span class="sourceLineNo">569</span> * It lets the caller scan the contents of a memstore -- both current<a name="line.569"></a>
-<span class="sourceLineNo">570</span> * map and snapshot.<a name="line.570"></a>
-<span class="sourceLineNo">571</span> * This behaves as if it were a real scanner but does not maintain position.<a name="line.571"></a>
-<span class="sourceLineNo">572</span> */<a name="line.572"></a>
-<span class="sourceLineNo">573</span> protected class MemStoreScanner extends NonLazyKeyValueScanner {<a name="line.573"></a>
-<span class="sourceLineNo">574</span> // Next row information for either cellSet or snapshot<a name="line.574"></a>
-<span class="sourceLineNo">575</span> private Cell cellSetNextRow = null;<a name="line.575"></a>
-<span class="sourceLineNo">576</span> private Cell snapshotNextRow = null;<a name="line.576"></a>
-<span class="sourceLineNo">577</span><a name="line.577"></a>
-<span class="sourceLineNo">578</span> // last iterated Cells for cellSet and snapshot (to restore iterator state after reseek)<a name="line.578"></a>
-<span class="sourceLineNo">579</span> private Cell cellSetItRow = null;<a name="line.579"></a>
-<span class="sourceLineNo">580</span> private Cell snapshotItRow = null;<a name="line.580"></a>
-<span class="sourceLineNo">581</span> <a name="line.581"></a>
-<span class="sourceLineNo">582</span> // iterator based scanning.<a name="line.582"></a>
-<span class="sourceLineNo">583</span> private Iterator<Cell> cellSetIt;<a name="line.583"></a>
-<span class="sourceLineNo">584</span> private Iterator<Cell> snapshotIt;<a name="line.584"></a>
-<span class="sourceLineNo">585</span><a name="line.585"></a>
-<span class="sourceLineNo">586</span> // The cellSet and snapshot at the time of creating this scanner<a name="line.586"></a>
-<span class="sourceLineNo">587</span> private CellSkipListSet cellSetAtCreation;<a name="line.587"></a>
-<span class="sourceLineNo">588</span> private CellSkipListSet snapshotAtCreation;<a name="line.588"></a>
-<span class="sourceLineNo">589</span><a name="line.589"></a>
-<span class="sourceLineNo">590</span> // the pre-calculated Cell to be returned by peek() or next()<a name="line.590"></a>
-<span class="sourceLineNo">591</span> private Cell theNext;<a name="line.591"></a>
-<span class="sourceLineNo">592</span><a name="line.592"></a>
-<span class="sourceLineNo">593</span> // The allocator and snapshot allocator at the time of creating this scanner<a name="line.593"></a>
-<span class="sourceLineNo">594</span> volatile MemStoreLAB allocatorAtCreation;<a name="line.594"></a>
-<span class="sourceLineNo">595</span> volatile MemStoreLAB snapshotAllocatorAtCreation;<a name="line.595"></a>
-<span class="sourceLineNo">596</span> <a name="line.596"></a>
-<span class="sourceLineNo">597</span> // A flag represents whether could stop skipping Cells for MVCC<a name="line.597"></a>
-<span class="sourceLineNo">598</span> // if have encountered the next row. Only used for reversed scan<a name="line.598"></a>
-<span class="sourceLineNo">599</span> private boolean stopSkippingCellsIfNextRow = false;<a name="line.599"></a>
-<span class="sourceLineNo">600</span><a name="line.600"></a>
-<span class="sourceLineNo">601</span> private long readPoint;<a name="line.601"></a>
-<span class="sourceLineNo">602</span><a name="line.602"></a>
-<span class="sourceLineNo">603</span> /*<a name="line.603"></a>
-<span class="sourceLineNo">604</span> Some notes...<a name="line.604"></a>
-<span class="sourceLineNo">605</span><a name="line.605"></a>
-<span class="sourceLineNo">606</span> So memstorescanner is fixed at creation time. this includes pointers/iterators into<a name="line.606"></a>
-<span class="sourceLineNo">607</span> existing kvset/snapshot. during a snapshot creation, the kvset is null, and the<a name="line.607"></a>
-<span class="sourceLineNo">608</span> snapshot is moved. since kvset is null there is no point on reseeking on both,<a name="line.608"></a>
-<span class="sourceLineNo">609</span> we can save us the trouble. During the snapshot->hfile transition, the memstore<a name="line.609"></a>
-<span class="sourceLineNo">610</span> scanner is re-created by StoreScanner#updateReaders(). StoreScanner should<a name="line.610"></a>
-<span class="sourceLineNo">611</span> potentially do something smarter by adjusting the existing memstore scanner.<a name="line.611"></a>
-<span class="sourceLineNo">612</span><a name="line.612"></a>
-<span class="sourceLineNo">613</span> But there is a greater problem here, that being once a scanner has progressed<a name="line.613"></a>
-<span class="sourceLineNo">614</span> during a snapshot scenario, we currently iterate past the kvset then 'finish' up.<a name="line.614"></a>
-<span class="sourceLineNo">615</span> if a scan lasts a little while, there is a chance for new entries in kvset to<a name="line.615"></a>
-<span class="sourceLineNo">616</span> become available but we will never see them. This needs to be handled at the<a name="line.616"></a>
-<span class="sourceLineNo">617</span> StoreScanner level with coordination with MemStoreScanner.<a name="line.617"></a>
-<span class="sourceLineNo">618</span><a name="line.618"></a>
-<span class="sourceLineNo">619</span> Currently, this problem is only partly managed: during the small amount of time<a name="line.619"></a>
-<span class="sourceLineNo">620</span> when the StoreScanner has not yet created a new MemStoreScanner, we will miss<a name="line.620"></a>
-<span class="sourceLineNo">621</span> the adds to kvset in the MemStoreScanner.<a name="line.621"></a>
-<span class="sourceLineNo">622</span> */<a name="line.622"></a>
-<span class="sourceLineNo">623</span><a name="line.623"></a>
-<span class="sourceLineNo">624</span> MemStoreScanner(long readPoint) {<a name="line.624"></a>
-<span class="sourceLineNo">625</span> super();<a name="line.625"></a>
-<span class="sourceLineNo">626</span><a name="line.626"></a>
-<span class="sourceLineNo">627</span> this.readPoint = readPoint;<a name="line.627"></a>
-<span class="sourceLineNo">628</span> cellSetAtCreation = cellSet;<a name="line.628"></a>
-<span class="sourceLineNo">629</span> snapshotAtCreation = snapshot;<a name="line.629"></a>
-<span class="sourceLineNo">630</span> if (allocator != null) {<a name="line.630"></a>
-<span class="sourceLineNo">631</span> this.allocatorAtCreation = allocator;<a name="line.631"></a>
-<span class="sourceLineNo">632</span> this.allocatorAtCreation.incScannerCount();<a name="line.632"></a>
-<span class="sourceLineNo">633</span> }<a name="line.633"></a>
-<span class="sourceLineNo">634</span> if (snapshotAllocator != null) {<a name="line.634"></a>
-<span class="sourceLineNo">635</span> this.snapshotAllocatorAtCreation = snapshotAllocator;<a name="line.635"></a>
-<span class="sourceLineNo">636</span> this.snapshotAllocatorAtCreation.incScannerCount();<a name="line.636"></a>
-<span class="sourceLineNo">637</span> }<a name="line.637"></a>
-<span class="sourceLineNo">638</span> if (Trace.isTracing() && Trace.currentSpan() != null) {<a name="line.638"></a>
-<span class="sourceLineNo">639</span> Trace.currentSpan().addTimelineAnnotation("Creating MemStoreScanner");<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><a name="line.642"></a>
-<span class="sourceLineNo">643</span> /**<a name="line.643"></a>
-<span class="sourceLineNo">644</span> * Lock on 'this' must be held by caller.<a name="line.644"></a>
-<span class="sourceLineNo">645</span> * @param it<a name="line.645"></a>
-<span class="sourceLineNo">646</span> * @return Next Cell<a name="line.646"></a>
-<span class="sourceLineNo">647</span> */<a name="line.647"></a>
-<span class="sourceLineNo">648</span> private Cell getNext(Iterator<Cell> it) {<a name="line.648"></a>
-<span class="sourceLineNo">649</span> Cell startCell = theNext;<a name="line.649"></a>
-<span class="sourceLineNo">650</span> Cell v = null;<a name="line.650"></a>
-<span class="sourceLineNo">651</span> try {<a name="line.651"></a>
-<span class="sourceLineNo">652</span> while (it.hasNext()) {<a name="line.652"></a>
-<span class="sourceLineNo">653</span> v = it.next();<a name="line.653"></a>
-<span class="sourceLineNo">654</span> if (v.getSequenceId() <= this.readPoint) {<a name="line.654"></a>
-<span class="sourceLineNo">655</span> return v;<a name="line.655"></a>
-<span class="sourceLineNo">656</span> }<a name="line.656"></a>
-<span class="sourceLineNo">657</span> if (stopSkippingCellsIfNextRow && startCell != null<a name="line.657"></a>
-<span class="sourceLineNo">658</span> && comparator.compareRows(v, startCell) > 0) {<a name="line.658"></a>
-<span class="sourceLineNo">659</span> return null;<a name="line.659"></a>
-<span class="sourceLineNo">660</span> }<a name="line.660"></a>
-<span class="sourceLineNo">661</span> }<a name="line.661"></a>
-<span class="sourceLineNo">662</span><a name="line.662"></a>
-<span class="sourceLineNo">663</span> return null;<a name="line.663"></a>
-<span class="sourceLineNo">664</span> } finally {<a name="line.664"></a>
-<span class="sourceLineNo">665</span> if (v != null) {<a name="line.665"></a>
-<span class="sourceLineNo">666</span> // in all cases, remember the last Cell iterated to<a name="line.666"></a>
-<span class="sourceLineNo">667</span> if (it == snapshotIt) {<a name="line.667"></a>
-<span class="sourceLineNo">668</span> snapshotItRow = v;<a name="line.668"></a>
-<span class="sourceLineNo">669</span> } else {<a name="line.669"></a>
-<span class="sourceLineNo">670</span> cellSetItRow = v;<a name="line.670"></a>
-<span class="sourceLineNo">671</span> }<a name="line.671"></a>
-<span class="sourceLineNo">672</span> }<a name="line.672"></a>
-<span class="sourceLineNo">673</span> }<a name="line.673"></a>
-<span class="sourceLineNo">674</span> }<a name="line.674"></a>
-<span class="sourceLineNo">675</span><a name="line.675"></a>
-<span class="sourceLineNo">676</span> /**<a name="line.676"></a>
-<span class="sourceLineNo">677</span> * Set the scanner at the seek key.<a name="line.677"></a>
-<span class="sourceLineNo">678</span> * Must be called only once: there is no thread safety between the scanner<a name="line.678"></a>
-<span class="sourceLineNo">679</span> * and the memStore.<a name="line.679"></a>
-<span class="sourceLineNo">680</span> * @param key seek value<a name="line.680"></a>
-<span class="sourceLineNo">681</span> * @return false if the key is null or if there is no data<a name="line.681"></a>
-<span class="sourceLineNo">682</span> */<a name="line.682"></a>
-<span class="sourceLineNo">683</span> @Override<a name="line.683"></a>
-<span class="sourceLineNo">684</span> public synchronized boolean seek(Cell key) {<a name="line.684"></a>
-<span class="sourceLineNo">685</span> if (key == null) {<a name="line.685"></a>
-<span class="sourceLineNo">686</span> close();<a name="line.686"></a>
-<span class="sourceLineNo">687</span> return false;<a name="line.687"></a>
-<span class="sourceLineNo">688</span> }<a name="line.688"></a>
-<span class="sourceLineNo">689</span> // kvset and snapshot will never be null.<a name="line.689"></a>
-<span class="sourceLineNo">690</span> // if tailSet can't find anything, SortedSet is empty (not null).<a name="line.690"></a>
-<span class="sourceLineNo">691</span> cellSetIt = cellSetAtCreation.tailSet(key).iterator();<a name="line.691"></a>
-<span class="sourceLineNo">692</span> snapshotIt = snapshotAtCreation.tailSet(key).iterator();<a name="line.692"></a>
-<span class="sourceLineNo">693</span> cellSetItRow = null;<a name="line.693"></a>
-<span class="sourceLineNo">694</span> snapshotItRow = null;<a name="line.694"></a>
-<span class="sourceLineNo">695</span><a name="line.695"></a>
-<span class="sourceLineNo">696</span> return seekInSubLists(key);<a name="line.696"></a>
-<span class="sourceLineNo">697</span> }<a name="line.697"></a>
+<span class="sourceLineNo">460</span> * @param readpoint readpoint below which we can safely remove duplicate KVs<a name="line.460"></a>
+<span class="sourceLineNo">461</span> * @return change in memstore size<a name="line.461"></a>
+<span class="sourceLineNo">462</span> */<a name="line.462"></a>
+<span class="sourceLineNo">463</span> @Override<a name="line.463"></a>
+<span class="sourceLineNo">464</span> public long upsert(Iterable<Cell> cells, long readpoint) {<a name="line.464"></a>
+<span class="sourceLineNo">465</span> long size = 0;<a name="line.465"></a>
+<span class="sourceLineNo">466</span> for (Cell cell : cells) {<a name="line.466"></a>
+<span class="sourceLineNo">467</span> size += upsert(cell, readpoint);<a name="line.467"></a>
+<span class="sourceLineNo">468</span> }<a name="line.468"></a>
+<span class="sourceLineNo">469</span> return size;<a name="line.469"></a>
+<span class="sourceLineNo">470</span> }<a name="line.470"></a>
+<span class="sourceLineNo">471</span><a name="line.471"></a>
+<span class="sourceLineNo">472</span> /**<a name="line.472"></a>
+<span class="sourceLineNo">473</span> * Inserts the specified KeyValue into MemStore and deletes any existing<a name="line.473"></a>
+<span class="sourceLineNo">474</span> * versions of the same row/family/qualifier as the specified KeyValue.<a name="line.474"></a>
+<span class="sourceLineNo">475</span> * <p><a name="line.475"></a>
+<span class="sourceLineNo">476</span> * First, the specified KeyValue is inserted into the Memstore.<a name="line.476"></a>
+<span class="sourceLineNo">477</span> * <p><a name="line.477"></a>
+<span class="sourceLineNo">478</span> * If there are any existing KeyValues in this MemStore with the same row,<a name="line.478"></a>
+<span class="sourceLineNo">479</span> * family, and qualifier, they are removed.<a name="line.479"></a>
+<span class="sourceLineNo">480</span> * <p><a name="line.480"></a>
+<span class="sourceLineNo">481</span> * Callers must hold the read lock.<a name="line.481"></a>
+<span class="sourceLineNo">482</span> * @param readpoint Smallest outstanding readpoint; below which we can remove duplicate Cells.<a name="line.482"></a>
+<span class="sourceLineNo">483</span> * @return change in size of MemStore<a name="line.483"></a>
+<span class="sourceLineNo">484</span> */<a name="line.484"></a>
+<span class="sourceLineNo">485</span> private long upsert(Cell cell, long readpoint) {<a name="line.485"></a>
+<span class="sourceLineNo">486</span> // Add the Cell to the MemStore<a name="line.486"></a>
+<span class="sourceLineNo">487</span> // Use the internalAdd method here since we (a) already have a lock<a name="line.487"></a>
+<span class="sourceLineNo">488</span> // and (b) cannot safely use the MSLAB here without potentially<a name="line.488"></a>
+<span class="sourceLineNo">489</span> // hitting OOME - see TestMemStore.testUpsertMSLAB for a<a name="line.489"></a>
+<span class="sourceLineNo">490</span> // test that triggers the pathological case if we don't avoid MSLAB<a name="line.490"></a>
+<span class="sourceLineNo">491</span> // here.<a name="line.491"></a>
+<span class="sourceLineNo">492</span> long addedSize = internalAdd(cell);<a name="line.492"></a>
+<span class="sourceLineNo">493</span><a name="line.493"></a>
+<span class="sourceLineNo">494</span> // Get the Cells for the row/family/qualifier regardless of timestamp.<a name="line.494"></a>
+<span class="sourceLineNo">495</span> // For this case we want to clean up any other puts<a name="line.495"></a>
+<span class="sourceLineNo">496</span> Cell firstCell = KeyValueUtil.createFirstOnRow(<a name="line.496"></a>
+<span class="sourceLineNo">497</span> cell.getRowArray(), cell.getRowOffset(), cell.getRowLength(),<a name="line.497"></a>
+<span class="sourceLineNo">498</span> cell.getFamilyArray(), cell.getFamilyOffset(), cell.getFamilyLength(),<a name="line.498"></a>
+<span class="sourceLineNo">499</span> cell.getQualifierArray(), cell.getQualifierOffset(), cell.getQualifierLength());<a name="line.499"></a>
+<span class="sourceLineNo">500</span> SortedSet<Cell> ss = cellSet.tailSet(firstCell);<a name="line.500"></a>
+<span class="sourceLineNo">501</span> Iterator<Cell> it = ss.iterator();<a name="line.501"></a>
+<span class="sourceLineNo">502</span> // Versions visible to oldest scanner.<a name="line.502"></a>
+<span class="sourceLineNo">503</span> int versionsVisible = 0;<a name="line.503"></a>
+<span class="sourceLineNo">504</span> while ( it.hasNext() ) {<a name="line.504"></a>
+<span class="sourceLineNo">505</span> Cell cur = it.next();<a name="line.505"></a>
+<span class="sourceLineNo">506</span><a name="line.506"></a>
+<span class="sourceLineNo">507</span> if (cell == cur) {<a name="line.507"></a>
+<span class="sourceLineNo">508</span> // ignore the one just put in<a name="line.508"></a>
+<span class="sourceLineNo">509</span> continue;<a name="line.509"></a>
+<span class="sourceLineNo">510</span> }<a name="line.510"></a>
+<span class="sourceLineNo">511</span> // check that this is the row and column we are interested in, otherwise bail<a name="line.511"></a>
+<span class="sourceLineNo">512</span> if (CellUtil.matchingRow(cell, cur) && CellUtil.matchingQualifier(cell, cur)) {<a name="line.512"></a>
+<span class="sourceLineNo">513</span> // only remove Puts that concurrent scanners cannot possibly see<a name="line.513"></a>
+<span class="sourceLineNo">514</span> if (cur.getTypeByte() == KeyValue.Type.Put.getCode() &&<a name="line.514"></a>
+<span class="sourceLineNo">515</span> cur.getSequenceId() <= readpoint) {<a name="line.515"></a>
+<span class="sourceLineNo">516</span> if (versionsVisible >= 1) {<a name="line.516"></a>
+<span class="sourceLineNo">517</span> // if we get here we have seen at least one version visible to the oldest scanner,<a name="line.517"></a>
+<span class="sourceLineNo">518</span> // which means we can prove that no scanner will see this version<a name="line.518"></a>
+<span class="sourceLineNo">519</span><a name="line.519"></a>
+<span class="sourceLineNo">520</span> // false means there was a change, so give us the size.<a name="line.520"></a>
+<span class="sourceLineNo">521</span> long delta = heapSizeChange(cur, true);<a name="line.521"></a>
+<span class="sourceLineNo">522</span> addedSize -= delta;<a name="line.522"></a>
+<span class="sourceLineNo">523</span> this.size.addAndGet(-delta);<a name="line.523"></a>
+<span class="sourceLineNo">524</span> it.remove();<a name="line.524"></a>
+<span class="sourceLineNo">525</span> setOldestEditTimeToNow();<a name="line.525"></a>
+<span class="sourceLineNo">526</span> } else {<a name="line.526"></a>
+<span class="sourceLineNo">527</span> versionsVisible++;<a name="line.527"></a>
+<span class="sourceLineNo">528</span> }<a name="line.528"></a>
+<span class="sourceLineNo">529</span> }<a name="line.529"></a>
+<span class="sourceLineNo">530</span> } else {<a name="line.530"></a>
+<span class="sourceLineNo">531</span> // past the row or column, done<a name="line.531"></a>
+<span class="sourceLineNo">532</span> break;<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> return addedSize;<a name="line.535"></a>
+<span class="sourceLineNo">536</span> }<a name="line.536"></a>
+<span class="sourceLineNo">537</span><a name="line.537"></a>
+<span class="sourceLineNo">538</span> /**<a name="line.538"></a>
+<span class="sourceLineNo">539</span> * @return scanner on memstore and snapshot in this order.<a name="line.539"></a>
+<span class="sourceLineNo">540</span> */<a name="line.540"></a>
+<span class="sourceLineNo">541</span> @Override<a name="line.541"></a>
+<span class="sourceLineNo">542</span> public List<KeyValueScanner> getScanners(long readPt) {<a name="line.542"></a>
+<span class="sourceLineNo">543</span> return Collections.<KeyValueScanner> singletonList(new MemStoreScanner(readPt));<a name="line.543"></a>
+<span class="sourceLineNo">544</span> }<a name="line.544"></a>
+<span class="sourceLineNo">545</span><a name="line.545"></a>
+<span class="sourceLineNo">546</span> /**<a name="line.546"></a>
+<span class="sourceLineNo">547</span> * Check if this memstore may contain the required keys<a name="line.547"></a>
+<span class="sourceLineNo">548</span> * @param scan scan<a name="line.548"></a>
+<span class="sourceLineNo">549</span> * @param store holds reference to cf<a name="line.549"></a>
+<span class="sourceLineNo">550</span> * @param oldestUnexpiredTS<a name="line.550"></a>
+<span class="sourceLineNo">551</span> * @return False if the key definitely does not exist in this Memstore<a name="line.551"></a>
+<span class="sourceLineNo">552</span> */<a name="line.552"></a>
+<span class="sourceLineNo">553</span> public boolean shouldSeek(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.553"></a>
+<span class="sourceLineNo">554</span> byte[] cf = store.getFamily().getName();<a name="line.554"></a>
+<span class="sourceLineNo">555</span> TimeRange timeRange = scan.getColumnFamilyTimeRange().get(cf);<a name="line.555"></a>
+<span class="sourceLineNo">556</span> if (timeRange == null) {<a name="line.556"></a>
+<span class="sourceLineNo">557</span> timeRange = scan.getTimeRange();<a name="line.557"></a>
+<span class="sourceLineNo">558</span> }<a name="line.558"></a>
+<span class="sourceLineNo">559</span> return (timeRangeTracker.includesTimeRange(timeRange) ||<a name="line.559"></a>
+<span class="sourceLineNo">560</span> snapshotTimeRangeTracker.includesTimeRange(timeRange))<a name="line.560"></a>
+<span class="sourceLineNo">561</span> && (Math.max(timeRangeTracker.getMaximumTimestamp(),<a name="line.561"></a>
+<span class="sourceLineNo">562</span> snapshotTimeRangeTracker.getMaximumTimestamp()) >=<a name="line.562"></a>
+<span class="sourceLineNo">563</span> oldestUnexpiredTS);<a name="line.563"></a>
+<span class="sourceLineNo">564</span> }<a name="line.564"></a>
+<span class="sourceLineNo">565</span><a name="line.565"></a>
+<span class="sourceLineNo">566</span> /*<a name="line.566"></a>
+<span class="sourceLineNo">567</span> * MemStoreScanner implements the KeyValueScanner.<a name="line.567"></a>
+<span class="sourceLineNo">568</span> * It lets the caller scan the contents of a memstore -- both current<a name="line.568"></a>
+<span class="sourceLineNo">569</span> * map and snapshot.<a name="line.569"></a>
+<span class="sourceLineNo">570</span> * This behaves as if it were a real scanner but does not maintain position.<a name="line.570"></a>
+<span class="sourceLineNo">571</span> */<a name="line.571"></a>
+<span class="sourceLineNo">572</span> protected class MemStoreScanner extends NonLazyKeyValueScanner {<a name="line.572"></a>
+<span class="sourceLineNo">573</span> // Next row information for either cellSet or snapshot<a name="line.573"></a>
+<span class="sourceLineNo">574</span> private Cell cellSetNextRow = null;<a name="line.574"></a>
+<span class="sourceLineNo">575</span> private Cell snapshotNextRow = null;<a name="line.575"></a>
+<span class="sourceLineNo">576</span><a name="line.576"></a>
+<span class="sourceLineNo">577</span> // last iterated Cells for cellSet and snapshot (to restore iterator state after reseek)<a name="line.577"></a>
+<span class="sourceLineNo">578</span> private Cell cellSetItRow = null;<a name="line.578"></a>
+<span class="sourceLineNo">579</span> private Cell snapshotItRow = null;<a name="line.579"></a>
+<span class="sourceLineNo">580</span><a name="line.580"></a>
+<span class="sourceLineNo">581</span> // iterator based scanning.<a name="line.581"></a>
+<span class="sourceLineNo">582</span> private Iterator<Cell> cellSetIt;<a name="line.582"></a>
+<span class="sourceLineNo">583</span> private Iterator<Cell> snapshotIt;<a name="line.583"></a>
+<span class="sourceLineNo">584</span><a name="line.584"></a>
+<span class="sourceLineNo">585</span> // The cellSet and snapshot at the time of creating this scanner<a name="line.585"></a>
+<span class="sourceLineNo">586</span> private CellSkipListSet cellSetAtCreation;<a name="line.586"></a>
+<span class="sourceLineNo">587</span> private CellSkipListSet snapshotAtCreation;<a name="line.587"></a>
+<span class="sourceLineNo">588</span><a name="line.588"></a>
+<span class="sourceLineNo">589</span> // the pre-calculated Cell to be returned by peek() or next()<a name="line.589"></a>
+<span class="sourceLineNo">590</span> private Cell theNext;<a name="line.590"></a>
+<span class="sourceLineNo">591</span><a name="line.591"></a>
+<span class="sourceLineNo">592</span> // The allocator and snapshot allocator at the time of creating this scanner<a name="line.592"></a>
+<span class="sourceLineNo">593</span> volatile MemStoreLAB allocatorAtCreation;<a name="line.593"></a>
+<span class="sourceLineNo">594</span> volatile MemStoreLAB snapshotAllocatorAtCreation;<a name="line.594"></a>
+<span class="sourceLineNo">595</span><a name="line.595"></a>
+<span class="sourceLineNo">596</span> // A flag represents whether could stop skipping Cells for MVCC<a name="line.596"></a>
+<span class="sourceLineNo">597</span> // if have encountered the next row. Only used for reversed scan<a name="line.597"></a>
+<span class="sourceLineNo">598</span> private boolean stopSkippingCellsIfNextRow = false;<a name="line.598"></a>
+<span class="sourceLineNo">599</span><a name="line.599"></a>
+<span class="sourceLineNo">600</span> private long readPoint;<a name="line.600"></a>
+<span class="sourceLineNo">601</span><a name="line.601"></a>
+<span class="sourceLineNo">602</span> /*<a name="line.602"></a>
+<span class="sourceLineNo">603</span> Some notes...<a name="line.603"></a>
+<span class="sourceLineNo">604</span><a name="line.604"></a>
+<span class="sourceLineNo">605</span> So memstorescanner is fixed at creation time. this includes pointers/iterators into<a name="line.605"></a>
+<span class="sourceLineNo">606</span> existing kvset/snapshot. during a snapshot creation, the kvset is null, and the<a name="line.606"></a>
+<span class="sourceLineNo">607</span> snapshot is moved. since kvset is null there is no point on reseeking on both,<a name="line.607"></a>
+<span class="sourceLineNo">608</span> we can save us the trouble. During the snapshot->hfile transition, the memstore<a name="line.608"></a>
+<span class="sourceLineNo">609</span> scanner is re-created by StoreScanner#updateReaders(). StoreScanner should<a name="line.609"></a>
+<span class="sourceLineNo">610</span> potentially do something smarter by adjusting the existing memstore scanner.<a name="line.610"></a>
+<span class="sourceLineNo">611</span><a name="line.611"></a>
+<span class="sourceLineNo">612</span> But there is a greater problem here, that being once a scanner has progressed<a name="line.612"></a>
+<span class="sourceLineNo">613</span> during a snapshot scenario, we currently iterate past the kvset then 'finish' up.<a name="line.613"></a>
+<span class="sourceLineNo">614</span> if a scan lasts a little while, there is a chance for new entries in kvset to<a name="line.614"></a>
+<span class="sourceLineNo">615</span> become available but we will never see them. This needs to be handled at the<a name="line.615"></a>
+<span class="sourceLineNo">616</span> StoreScanner level with coordination with MemStoreScanner.<a name="line.616"></a>
+<span class="sourceLineNo">617</span><a name="line.617"></a>
+<span class="sourceLineNo">618</span> Currently, this problem is only partly managed: during the small amount of time<a name="line.618"></a>
+<span class="sourceLineNo">619</span> when the StoreScanner has not yet created a new MemStoreScanner, we will miss<a name="line.619"></a>
+<span class="sourceLineNo">620</span> the adds to kvset in the MemStoreScanner.<a name="line.620"></a>
+<span class="sourceLineNo">621</span> */<a name="line.621"></a>
+<span class="sourceLineNo">622</span><a name="line.622"></a>
+<span class="sourceLineNo">623</span> MemStoreScanner(long readPoint) {<a name="line.623"></a>
+<span class="sourceLineNo">624</span> super();<a name="line.624"></a>
+<span class="sourceLineNo">625</span><a name="line.625"></a>
+<span class="sourceLineNo">626</span> this.readPoint = readPoint;<a name="line.626"></a>
+<span class="sourceLineNo">627</span> cellSetAtCreation = cellSet;<a name="line.627"></a>
+<span class="sourceLineNo">628</span> snapshotAtCreation = snapshot;<a name="line.628"></a>
+<span class="sourceLineNo">629</span> if (allocator != null) {<a name="line.629"></a>
+<span class="sourceLineNo">630</span> this.allocatorAtCreation = allocator;<a name="line.630"></a>
+<span class="sourceLineNo">631</span> this.allocatorAtCreation.incScannerCount();<a name="line.631"></a>
+<span class="sourceLineNo">632</span> }<a name="line.632"></a>
+<span class="sourceLineNo">633</span> if (snapshotAllocator != null) {<a name="line.633"></a>
+<span class="sourceLineNo">634</span> this.snapshotAllocatorAtCreation = snapshotAllocator;<a name="line.634"></a>
+<span class="sourceLineNo">635</span> this.snapshotAllocatorAtCreation.incScannerCount();<a name="line.635"></a>
+<span class="sourceLineNo">636</span> }<a name="line.636"></a>
+<span class="sourceLineNo">637</span> if (Trace.isTracing() && Trace.currentSpan() != null) {<a name="line.637"></a>
+<span class="sourceLineNo">638</span> Trace.currentSpan().addTimelineAnnotation("Creating MemStoreScanner");<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><a name="line.641"></a>
+<span class="sourceLineNo">642</span> /**<a name="line.642"></a>
+<span class="sourceLineNo">643</span> * Lock on 'this' must be held by caller.<a name="line.643"></a>
+<span class="sourceLineNo">644</span> * @param it<a name="line.644"></a>
+<span class="sourceLineNo">645</span> * @return Next Cell<a name="line.645"></a>
+<span class="sourceLineNo">646</span> */<a name="line.646"></a>
+<span class="sourceLineNo">647</span> private Cell getNext(Iterator<Cell> it) {<a name="line.647"></a>
+<span class="sourceLineNo">648</span> Cell startCell = theNext;<a name="line.648"></a>
+<span class="sourceLineNo">649</span> Cell v = null;<a name="line.649"></a>
+<span class="sourceLineNo">650</span> try {<a name="line.650"></a>
+<span class="sourceLineNo">651</span> while (it.hasNext()) {<a name="line.651"></a>
+<span class="sourceLineNo">652</span> v = it.next();<a name="line.652"></a>
+<span class="sourceLineNo">653</span> if (v.getSequenceId() <= this.readPoint) {<a name="line.653"></a>
+<span class="sourceLineNo">654</span> return v;<a name="line.654"></a>
+<span class="sourceLineNo">655</span> }<a name="line.655"></a>
+<span class="sourceLineNo">656</span> if (stopSkippingCellsIfNextRow && startCell != null<a name="line.656"></a>
+<span class="sourceLineNo">657</span> && comparator.compareRows(v, startCell) > 0) {<a name="line.657"></a>
+<span class="sourceLineNo">658</span> return null;<a name="line.658"></a>
+<span class="sourceLineNo">659</span> }<a name="line.659"></a>
+<span class="sourceLineNo">660</span> }<a name="line.660"></a>
+<span class="sourceLineNo">661</span><a name="line.661"></a>
+<span class="sourceLineNo">662</span> return null;<a name="line.662"></a>
+<span class="sourceLineNo">663</span> } finally {<a name="line.663"></a>
+<span class="sourceLineNo">664</span> if (v != null) {<a name="line.664"></a>
+<span class="sourceLineNo">665</span> // in all cases, remember the last Cell iterated to<a name="line.665"></a>
+<span class="sourceLineNo">666</span> if (it == snapshotIt) {<a name="line.666"></a>
+<span class="sourceLineNo">667</span> snapshotItRow = v;<a name="line.667"></a>
+<span class="sourceLineNo">668</span> } else {<a name="line.668"></a>
+<span class="sourceLineNo">669</span> cellSetItRow = v;<a name="line.669"></a>
+<span class="sourceLineNo">670</span> }<a name="line.670"></a>
+<span class="sourceLineNo">671</span> }<a name="line.671"></a>
+<span class="sourceLineNo">672</span> }<a name="line.672"></a>
+<span class="sourceLineNo">673</span> }<a name="line.673"></a>
+<span class="sourceLineNo">674</span><a name="line.674"></a>
+<span class="sourceLineNo">675</span> /**<a name="line.675"></a>
+<span class="sourceLineNo">676</span> * Set the scanner at the seek key.<a name="line.676"></a>
+<span class="sourceLineNo">677</span> * Must be called only once: there is no thread safety between the scanner<a name="line.677"></a>
+<span class="sourceLineNo">678</span> * and the memStore.<a name="line.678"></a>
+<span class="sourceLineNo">679</span> * @param key seek value<a name="line.679"></a>
+<span class="sourceLineNo">680</span> * @return false if the key is null or if there is no data<a name="line.680"></a>
+<span class="sourceLineNo">681</span> */<a name="line.681"></a>
+<span class="sourceLineNo">682</span> @Override<a name="line.682"></a>
+<span class="sourceLineNo">683</span> public synchronized boolean seek(Cell key) {<a name="line.683"></a>
+<span class="sourceLineNo">684</span> if (key == null) {<a name="line.684"></a>
+<span class="sourceLineNo">685</span> close();<a name="line.685"></a>
+<span class="sourceLineNo">686</span> return false;<a name="line.686"></a>
+<span class="sourceLineNo">687</span> }<a name="line.687"></a>
+<span class="sourceLineNo">688</span> // kvset and snapshot will never be null.<a name="line.688"></a>
+<span class="sourceLineNo">689</span> // if tailSet can't find anything, SortedSet is empty (not null).<a name="line.689"></a>
+<span class="sourceLineNo">690</span> cellSetIt = cellSetAtCreation.tailSet(key).iterator();<a name="line.690"></a>
+<span class="sourceLineNo">691</span> snapshotIt = snapshotAtCreation.tailSet(key).iterator();<a name="line.691"></a>
+<span class="sourceLineNo">692</span> cellSetItRow = null;<a name="line.692"></a>
+<span class="sourceLineNo">693</span> snapshotItRow = null;<a name="line.693"></a>
+<span class="sourceLineNo">694</span><a name="line.694"></a>
+<span class="sourceLineNo">695</span> return seekInSubLists(key);<a name="line.695"></a>
+<span class="sourceLineNo">696</span> }<a name="line.696"></a>
+<span class="sourceLineNo">697</span><a name="line.697"></a>
<span class="sourceLineNo">698</span><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> * (Re)initialize the iterators after a seek or a reseek.<a name="line.701"></a>
-<span class="sourceLineNo">702</span> */<a name="line.702"></a>
-<span class="sourceLineNo">703</span> private synchronized boolean seekInSubLists(Cell key){<a name="line.703"></a>
-<span class="sourceLineNo">704</span> cellSetNextRow = getNext(cellSetIt);<a name="line.704"></a>
-<span class="sourceLineNo">705</span> snapshotNextRow = getNext(snapshotIt);<a name="line.705"></a>
-<span class="sourceLineNo">706</span><a name="line.706"></a>
-<span class="sourceLineNo">707</span> // Calculate the next value<a name="line.707"></a>
-<span class="sourceLineNo">708</span> theNext = getLowest(cellSetNextRow, snapshotNextRow);<a name="line.708"></a>
-<span class="sourceLineNo">709</span><a name="line.709"></a>
-<span class="sourceLineNo">710</span> // has data<a name="line.710"></a>
-<span class="sourceLineNo">711</span> return (theNext != null);<a name="line.711"></a>
-<span class="sourceLineNo">712</span> }<a name="line.712"></a>
+<span class="sourceLineNo">699</span> /**<a name="line.699"></a>
+<span class="sourceLineNo">700</span> * (Re)initialize the iterators after a seek or a reseek.<a name="line.700"></a>
+<span class="sourceLineNo">701</span> */<a name="line.701"></a>
+<span class="sourceLineNo">702</span> private synchronized boolean seekInSubLists(Cell key){<a name="line.702"></a>
+<span class="sourceLineNo">703</span> cellSetNextRow = getNext(cellSetIt);<a name="line.703"></a>
+<span class="sourceLineNo">704</span> snapshotNextRow = getNext(snapshotIt);<a name="line.704"></a>
+<span class="sourceLineNo">705</span><a name="line.705"></a>
+<span class="sourceLineNo">706</span> // Calculate the next value<a name="line.706"></a>
+<span class="sourceLineNo">707</span> theNext = getLowest(cellSetNextRow, snapshotNextRow);<a name="line.707"></a>
+<span class="sourceLineNo">708</span><a name="line.708"></a>
+<span class="sourceLineNo">709</span> // has data<a name="line.709"></a>
+<span class="sourceLineNo">710</span> return (theNext != null);<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><a name="line.713"></a>
-<span class="sourceLineNo">714</span><a name="line.714"></a>
-<span class="sourceLineNo">715</span> /**<a name="line.715"></a>
-<span class="sourceLineNo">716</span> * Move forward on the sub-lists set previously by seek.<a name="line.716"></a>
-<span class="sourceLineNo">717</span> * @param key seek value (should be non-null)<a name="line.717"></a>
-<span class="sourceLineNo">718</span> * @return true if there is at least one KV to read, false otherwise<a name="line.718"></a>
-<span class="sourceLineNo">719</span> */<a name="line.719"></a>
-<span class="sourceLineNo">720</span> @Override<a name="line.720"></a>
-<span class="sourceLineNo">721</span> public synchronized boolean reseek(Cell key) {<a name="line.721"></a>
-<span class="sourceLineNo">722</span> /*<a name="line.722"></a>
-<span class="sourceLineNo">723</span> See HBASE-4195 & HBASE-3855 & HBASE-6591 for the background on this implementation.<a name="line.723"></a>
-<span class="sourceLineNo">724</span> This code is executed concurrently with flush and puts, without locks.<a name="line.724"></a>
-<span class="sourceLineNo">725</span> Two points must be known when working on this code:<a name="line.725"></a>
-<span class="sourceLineNo">726</span> 1) It's not possible to use the 'kvTail' and 'snapshot'<a name="line.726"></a>
-<span class="sourceLineNo">727</span> variables, as they are modified during a flush.<a name="line.727"></a>
-<span class="sourceLineNo">728</span> 2) The ideal implementation for performance would use the sub skip list<a name="line.728"></a>
-<span class="sourceLineNo">729</span> implicitly pointed by the iterators 'kvsetIt' and<a name="line.729"></a>
-<span class="sourceLineNo">730</span> 'snapshotIt'. Unfortunately the Java API does not offer a method to<a name="line.730"></a>
-<span class="sourceLineNo">731</span> get it. So we remember the last keys we iterated to and restore<a name="line.731"></a>
-<span class="sourceLineNo">732</span> the reseeked set to at least that point.<a name="line.732"></a>
-<span class="sourceLineNo">733</span> */<a name="line.733"></a>
-<span class="sourceLineNo">734</span> cellSetIt = cellSetAtCreation.tailSet(getHighest(key, cellSetItRow)).iterator();<a name="line.734"></a>
-<span class="sourceLineNo">735</span> snapshotIt = snapshotAtCreation.tailSet(getHighest(key, snapshotItRow)).iterator();<a name="line.735"></a>
-<span class="sourceLineNo">736</span><a name="line.736"></a>
-<span class="sourceLineNo">737</span> return seekInSubLists(key);<a name="line.737"></a>
-<span class="sourceLineNo">738</span> }<a name="line.738"></a>
+<span class="sourceLineNo">714</span> /**<a name="line.714"></a>
+<span class="sourceLineNo">715</span> * Move forward on the sub-lists set previously by seek.<a name="line.715"></a>
+<span class="sourceLineNo">716</span> * @param key seek value (should be non-null)<a name="line.716"></a>
+<span class="sourceLineNo">717</span> * @return true if there is at least one KV to read, false otherwise<a name="line.717"></a>
+<span class="sourceLineNo">718</span> */<a name="line.718"></a>
+<span class="sourceLineNo">719</span> @Override<a name="line.719"></a>
+<span class="sourceLineNo">720</span> public synchronized boolean reseek(Cell key) {<a name="line.720"></a>
+<span class="sourceLineNo">721</span> /*<a name="line.721"></a>
+<span class="sourceLineNo">722</span> See HBASE-4195 & HBASE-3855 & HBASE-6591 for the background on this implementation.<a name="line.722"></a>
+<span class="sourceLineNo">723</span> This code is executed concurrently with flush and puts, without locks.<a name="line.723"></a>
+<span class="sourceLineNo">724</span> Two points must be known when working on this code:<a name="line.724"></a>
+<span class="sourceLineNo">725</span> 1) It's not possible to use the 'kvTail' and 'snapshot'<a name="line.725"></a>
+<span class="sourceLineNo">726</span> variables, as they are modified during a flush.<a name="line.726"></a>
+<span class="sourceLineNo">727</span> 2) The ideal implementation for performance would use the sub skip list<a name="line.727"></a>
+<span class="sourceLineNo">728</span> implicitly pointed by the iterators 'kvsetIt' and<a name="line.728"></a>
+<span class="sourceLineNo">729</span> 'snapshotIt'. Unfortunately the Java API does not offer a method to<a name="line.729"></a>
+<span class="sourceLineNo">730</span> get it. So we remember the last keys we iterated to and restore<a name="line.730"></a>
+<span class="sourceLineNo">731</span> the reseeked set to at least that point.<a name="line.731"></a>
+<span class="sourceLineNo">732</span> */<a name="line.732"></a>
+<span class="sourceLineNo">733</span> cellSetIt = cellSetAtCreation.tailSet(getHighest(key, cellSetItRow)).iterator();<a name="line.733"></a>
+<span class="sourceLineNo">734</span> snapshotIt = snapshotAtCreation.tailSet(getHighest(key, snapshotItRow)).iterator();<a name="line.734"></a>
+<span class="sourceLineNo">735</span><a name="line.735"></a>
+<span class="sourceLineNo">736</span> return seekInSubLists(key);<a name="line.736"></a>
+<span class="sourceLineNo">737</span> }<a name="line.737"></a>
+<span class="sourceLineNo">738</span><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> @Override<a name="line.741"></a>
-<span class="sourceLineNo">742</span> public synchronized Cell peek() {<a name="line.742"></a>
-<span class="sourceLineNo">743</span> //DebugPrint.println(" MS@" + hashCode() + " peek = " + getLowest());<a name="line.743"></a>
-<span class="sourceLineNo">744</span> return theNext;<a name="line.744"></a>
-<span class="sourceLineNo">745</span> }<a name="line.745"></a>
-<span class="sourceLineNo">746</span><a name="line.746"></a>
-<span class="sourceLineNo">747</span> @Override<a name="line.747"></a>
-<span class="sourceLineNo">748</span> public synchronized Cell next() {<a name="line.748"></a>
-<span class="sourceLineNo">749</span> if (theNext == null) {<a name="line.749"></a>
-<span class="sourceLineNo">750</span> return null;<a name="line.750"></a>
-<span class="sourceLineNo">751</span> }<a name="line.751"></a>
-<span class="sourceLineNo">752</span><a name="line.752"></a>
-<span class="sourceLineNo">753</span> final Cell ret = theNext;<a name="line.753"></a>
-<span class="sourceLineNo">754</span><a name="line.754"></a>
-<span class="sourceLineNo">755</span> // Advance one of the iterators<a name="line.755"></a>
-<span class="sourceLineNo">756</span> if (theNext == cellSetNextRow) {<a name="line.756"></a>
-<span class="sourceLineNo">757</span> cellSetNextRow = getNext(cellSetIt);<a name="line.757"></a>
-<span class="sourceLineNo">758</span> } else {<a name="line.758"></a>
-<span class="sourceLineNo">759</span> snapshotNextRow = getNext(snapshotIt);<a name="line.759"></a>
-<span class="sourceLineNo">760</span> }<a name="line.760"></a>
-<span class="sourceLineNo">761</span><a name="line.761"></a>
-<span class="sourceLineNo">762</span> // Calculate the next value<a name="line.762"></a>
-<span class="sourceLineNo">763</span> theNext = getLowest(cellSetNextRow, snapshotNextRow);<a name="line.763"></a>
-<span class="sourceLineNo">764</span><a name="line.764"></a>
-<span class="sourceLineNo">765</span> //long readpoint = ReadWriteConsistencyControl.getThreadReadPoint();<a name="line.765"></a>
-<span class="sourceLineNo">766</span> //DebugPrint.println(" MS@" + hashCode() + " next: " + theNext + " next_next: " +<a name="line.766"></a>
-<span class="sourceLineNo">767</span> // getLowest() + " threadpoint=" + readpoint);<a name="line.767"></a>
-<span class="sourceLineNo">768</span> return ret;<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> /*<a name="line.771"></a>
-<span class="sourceLineNo">772</span> * Returns the lower of the two key values, or null if they are both null.<a name="line.772"></a>
-<span class="sourceLineNo">773</span> * This uses comparator.compare() to compare the KeyValue using the memstore<a name="line.773"></a>
-<span class="sourceLineNo">774</span> * comparator.<a name="line.774"></a>
-<span class="sourceLineNo">775</span> */<a name="line.775"></a>
-<span class="sourceLineNo">776</span> private Cell getLowest(Cell first, Cell second) {<a name="line.776"></a>
-<span class="sourceLineNo">777</span> if (first == null && second == null) {<a name="line.777"></a>
-<span class="sourceLineNo">778</span> return null;<a name="line.778"></a>
-<span class="sourceLineNo">779</span> }<a name="line.779"></a>
-<span class="sourceLineNo">780</span> if (first != null && second != null) {<a name="line.780"></a>
-<span class="sourceLineNo">781</span> int compare = comparator.compare(first, second);<a name="line.781"></a>
-<span class="sourceLineNo">782</span> return (compare <= 0 ? first : second);<a name="line.782"></a>
-<span class="sourceLineNo">783</span> }<a name="line.783"></a>
-<span class="sourceLineNo">784</span> return (first != null ? first : second);<a name="line.784"></a>
-<span class="sourceLineNo">785</span> }<a name="line.785"></a>
-<span class="sourceLineNo">786</span><a name="line.786"></a>
-<span class="sourceLineNo">787</span> /*<a name="line.787"></a>
-<span class="sourceLineNo">788</span> * Returns the higher of the two cells, or null if they are both null.<a name="line.788"></a>
-<span class="sourceLineNo">789</span> * This uses comparator.compare() to compare the Cell using the memstore<a name="line.789"></a>
-<span class="sourceLineNo">790</span> * comparator.<a name="line.790"></a>
-<span class="sourceLineNo">791</span> */<a name="line.791"></a>
-<span class="sourceLineNo">792</span> private Cell getHighest(Cell first, Cell second) {<a name="line.792"></a>
-<span class="sourceLineNo">793</span> if (first == null && second == null) {<a name="line.793"></a>
-<span class="sourceLineNo">794</span> return null;<a name="line.794"></a>
-<span class="sourceLineNo">795</span> }<a name="line.795"></a>
-<span class="sourceLineNo">796</span> if (first != null && second != null) {<a name="line.796"></a>
-<span class="sourceLineNo">797</span> int compare = comparator.compare(first, second);<a name="line.797"></a>
-<span class="sourceLineNo">798</span> return (compare > 0 ? first : second);<a name="line.798"></a>
-<span class="sourceLineNo">799</span> }<a name="line.799"></a>
-<span class="sourceLineNo">800</span> return (first != null ? first : second);<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> public synchronized void close() {<a name="line.803"></a>
-<span class="sourceLineNo">804</span> this.cellSetNextRow = null;<a name="line.804"></a>
-<span class="sourceLineNo">805</span> this.snapshotNextRow = null;<a name="line.805"></a>
-<span class="sourceLineNo">806</span><a name="line.806"></a>
-<span class="sourceLineNo">807</span> this.cellSetIt = null;<a name="line.807"></a>
-<span class="sourceLineNo">808</span> this.snapshotIt = null;<a name="line.808"></a>
-<span class="sourceLineNo">809</span> <a name="line.809"></a>
-<span class="sourceLineNo">810</span> if (allocatorAtCreation != null) {<a name="line.810"></a>
-<span class="sourceLineNo">811</span> this.allocatorAtCreation.decScannerCount();<a name="line.811"></a>
-<span class="sourceLineNo">812</span> this.allocatorAtCreation = null;<a name="line.812"></a>
-<span class="sourceLineNo">813</span> }<a name="line.813"></a>
-<span class="sourceLineNo">814</span> if (snapshotAllocatorAtCreation != null) {<a name="line.814"></a>
-<span class="sourceLineNo">815</span> this.snapshotAllocatorAtCreation.decScannerCount();<a name="line.815"></a>
-<span class="sourceLineNo">816</span> this.snapshotAllocatorAtCreation = null;<a name="line.816"></a>
-<span class="sourceLineNo">817</span> }<a name="line.817"></a>
-<span class="sourceLineNo">818</span><a name="line.818"></a>
-<span class="sourceLineNo">819</span> this.cellSetItRow = null;<a name="line.819"></a>
-<span class="sourceLineNo">820</span> this.snapshotItRow = null;<a name="line.820"></a>
-<span class="sourceLineNo">821</span> }<a name="line.821"></a>
-<span class="sourceLineNo">822</span><a name="line.822"></a>
-<span class="sourceLineNo">823</span> /**<a name="line.823"></a>
-<span class="sourceLineNo">824</span> * MemStoreScanner returns max value as sequence id because it will<a name="line.824"></a>
-<span class="sourceLineNo">825</span> * always have the latest data among all files.<a name="line.825"></a>
-<span class="sourceLineNo">826</span> */<a name="line.826"></a>
-<span class="sourceLineNo">827</span> @Override<a name="line.827"></a>
-<span class="sourceLineNo">828</span> public long getSequenceID() {<a name="line.828"></a>
-<span class="sourceLineNo">829</span> return Long.MAX_VALUE;<a name="line.829"></a>
-<span class="sourceLineNo">830</span> }<a name="line.830"></a>
-<span class="sourceLineNo">831</span><a name="line.831"></a>
-<span class="sourceLineNo">832</span> @Override<a name="line.832"></a>
-<span class="sourceLineNo">833</span> public boolean shouldUseScanner(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.833"></a>
-<span class="sourceLineNo">834</span> return shouldSeek(scan, store, oldestUnexpiredTS);<a name="line.834"></a>
-<span class="sourceLineNo">835</span> }<a name="line.835"></a>
-<span class="sourceLineNo">836</span><a name="line.836"></a>
-<span class="sourceLineNo">837</span> /**<a name="line.837"></a>
-<span class="sourceLineNo">838</span> * Seek scanner to the given key first. If it returns false(means<a name="line.838"></a>
-<span class="sourceLineNo">839</span> * peek()==null) or scanner's peek row is bigger than row of given key, seek<a name="line.839"></a>
-<span class="sourceLineNo">840</span> * the scanner to the previous row of given key<a name="line.840"></a>
-<span class="sourceLineNo">841</span> */<a name="line.841"></a>
-<span class="sourceLineNo">842</span> @Override<a name="line.842"></a>
-<span class="sourceLineNo">843</span> public synchronized boolean backwardSeek(Cell key) {<a name="line.843"></a>
-<span class="sourceLineNo">844</span> seek(key);<a name="line.844"></a>
-<span class="sourceLineNo">845</span> if (peek() == null || comparator.compareRows(peek(), key) > 0) {<a name="line.845"></a>
-<span class="sourceLineNo">846</span> return seekToPreviousRow(key);<a name="line.846"></a>
-<span class="sourceLineNo">847</span> }<a name="line.847"></a>
-<span class="sourceLineNo">848</span> return true;<a name="line.848"></a>
-<span class="sourceLineNo">849</span> }<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> * Separately get the KeyValue before the specified key from kvset and<a name="line.852"></a>
-<span class="sourceLineNo">853</span> * snapshotset, and use the row of higher one as the previous row of<a name="line.853"></a>
-<span class="sourceLineNo">854</span> * specified key, then seek to the first KeyValue of previous row<a name="line.854"></a>
-<span class="sourceLineNo">855</span> */<a name="line.855"></a>
-<span class="sourceLineNo">856</span> @Override<a name="line.856"></a>
-<span class="sourceLineNo">857</span> public synchronized boolean seekToPreviousRow(Cell originalKey) {<a name="line.857"></a>
-<span class="sourceLineNo">858</span> boolean keepSeeking = false;<a name="line.858"></a>
-<span class="sourceLineNo">859</span> Cell key = originalKey;<a name="line.859"></a>
-<span class="sourceLineNo">860</span> do {<a name="line.860"></a>
-<span class="sourceLineNo">861</span> Cell firstKeyOnRow = CellUtil.createFirstOnRow(key);<a name="line.861"></a>
-<span class="sourceLineNo">862</span> SortedSet<Cell> cellHead = cellSetAtCreation.headSet(firstKeyOnRow);<a name="line.862"></a>
-<span class="sourceLineNo">863</span> Cell cellSetBeforeRow = cellHead.isEmpty() ? null : cellHead.last();<a name="line.863"></a>
-<span class="sourceLineNo">864</span> SortedSet<Cell> snapshotHead = snapshotAtCreation<a name="line.864"></a>
-<span class="sourceLineNo">865</span> .headSet(firstKeyOnRow);<a name="line.865"></a>
-<span class="sourceLineNo">866</span> Cell snapshotBeforeRow = snapshotHead.isEmpty() ? null : snapshotHead<a name="line.866"></a>
-<span class="sourceLineNo">867</span> .last();<a name="line.867"></a>
-<span class="sourceLineNo">868</span> Cell lastCellBeforeRow = getHighest(cellSetBeforeRow, snapshotBeforeRow);<a name="line.868"></a>
-<span class="sourceLineNo">869</span> if (lastCellBeforeRow == null) {<a name="line.869"></a>
-<span class="sourceLineNo">870</span> theNext = null;<a name="line.870"></a>
-<span class="sourceLineNo">871</span> return false;<a name="line.871"></a>
-<span class="sourceLineNo">872</span> }<a name="line.872"></a>
-<span class="sourceLineNo">873</span> Cell firstKeyOnPreviousRow = CellUtil.createFirstOnRow(lastCellBeforeRow);<a name="line.873"></a>
-<span class="sourceLineNo">874</span> this.stopSkippingCellsIfNextRow = true;<a name="line.874"></a>
-<span class="sourceLineNo">875</span> seek(firstKeyOnPreviousRow);<a name="line.875"></a>
-<span class="sourceLineNo">876</span> this.stopSkippingCellsIfNextRow = false;<a name="line.876"></a>
-<span class="sourceLineNo">877</span> if (peek() == null<a name="line.877"></a>
-<span class="sourceLineNo">878</span> || comparator.compareRows(peek(), firstKeyOnPreviousRow) > 0) {<a name="line.878"></a>
-<span class="sourceLineNo">879</span> keepSeeking = true;<a name="line.879"></a>
-<span class="sourceLineNo">880</span> key = firstKeyOnPreviousRow;<a name="line.880"></a>
-<span class="sourceLineNo">881</span> continue;<a name="line.881"></a>
-<span class="sourceLineNo">882</span> } else {<a name="line.882"></a>
-<span class="sourceLineNo">883</span> keepSeeking = false;<a name="line.883"></a>
-<span class="sourceLineNo">884</span> }<a name="line.884"></a>
-<span class="sourceLineNo">885</span> } while (keepSeeking);<a name="line.885"></a>
-<span class="sourceLineNo">886</span> return true;<a name="line.886"></a>
-<span class="sourceLineNo">887</span> }<a name="line.887"></a>
-<span class="sourceLineNo">888</span><a name="line.888"></a>
-<span class="sourceLineNo">889</span> @Override<a name="line.889"></a>
-<span class="sourceLineNo">890</span> public synchronized boolean seekToLastRow() {<a name="line.890"></a>
-<span class="sourceLineNo">891</span> Cell first = cellSetAtCreation.isEmpty() ? null : cellSetAtCreation<a name="line.891"></a>
-<span class="sourceLineNo">892</span> .last();<a name="line.892"></a>
-<span class="sourceLineNo">893</span> Cell second = snapshotAtCreation.isEmpty() ? null<a name="line.893"></a>
-<span class="sourceLineNo">894</span> : snapshotAtCreation.last();<a name="line.894"></a>
-<span class="sourceLineNo">895</span> Cell higherCell = getHighest(first, second);<a name="line.895"></a>
-<span class="sourceLineNo">896</span> if (higherCell == null) {<a name="line.896"></a>
-<span class="sourceLineNo">897</span> return false;<a name="line.897"></a>
-<span class="sourceLineNo">898</span> }<a name="line.898"></a>
-<span class="sourceLineNo">899</span> Cell firstCellOnLastRow = CellUtil.createFirstOnRow(higherCell);<a name="line.899"></a>
-<span class="sourceLineNo">900</span> if (seek(firstCellOnLastRow)) {<a name="line.900"></a>
-<span class="sourceLineNo">901</span> return true;<a name="line.901"></a>
-<span class="sourceLineNo">902</span> } else {<a name="line.902"></a>
-<span class="sourceLineNo">903</span> return seekToPreviousRow(higherCell);<a name="line.903"></a>
-<span class="sourceLineNo">904</span> }<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">909</span> public final static long FIXED_OVERHEAD = ClassSize.align(ClassSize.OBJECT<a name="line.909"></a>
-<span class="sourceLineNo">910</span> + (9 * ClassSize.REFERENCE) + (3 * Bytes.SIZEOF_LONG) + Bytes.SIZEOF_BOOLEAN);<a name="line.910"></a>
-<span class="sourceLineNo">911</span><a name="line.911"></a>
-<span class="sourceLineNo">912</span> public final static long DEEP_OVERHEAD = ClassSize.align(FIXED_OVERHEAD +<a name="line.912"></a>
-<span class="sourceLineNo">913</span> ClassSize.ATOMIC_LONG + (2 * ClassSize.TIMERANGE_TRACKER) +<a name="line.913"></a>
-<span class="sourceLineNo">914</span> (2 * ClassSize.CELL_SKIPLIST_SET) + (2 * ClassSize.CONCURRENT_SKIPLISTMAP));<a name="line.914"></a>
-<span class="sourceLineNo">915</span><a name="line.915"></a>
-<span class="sourceLineNo">916</span> /*<a name="line.916"></a>
-<span class="sourceLineNo">917</span> * Calculate how the MemStore size has changed. Includes overhead of the<a name="line.917"></a>
-<span class="sourceLineNo">918</span> * backing Map.<a name="line.918"></a>
-<span class="sourceLineNo">919</span> * @param cell<a name="line.919"></a>
-<span class="sourceLineNo">920</span> * @param notpresent True if the cell was NOT present in the set.<a name="line.920"></a>
-<span class="sourceLineNo">921</span> * @return Size<a name="line.921"></a>
-<span class="sourceLineNo">922</span> */<a name="line.922"></a>
-<span class="sourceLineNo">923</span> static long heapSizeChange(final Cell cell, final boolean notpresent) {<a name="line.923"></a>
-<span class="sourceLineNo">924</span> return notpresent ? ClassSize.align(ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY<a name="line.924"></a>
-<span class="sourceLineNo">925</span> + CellUtil.estimatedHeapSizeOf(cell)) : 0;<a name="line.925"></a>
-<span class="sourceLineNo">926</span> }<a name="line.926"></a>
-<span class="sourceLineNo">927</span><a name="line.927"></a>
-<span class="sourceLineNo">928</span> private long keySize() {<a name="line.928"></a>
-<span class="sourceLineNo">929</span> return heapSize() - DEEP_OVERHEAD;<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> /**<a name="line.932"></a>
-<span class="sourceLineNo">933</span> * Get the entire heap usage for this MemStore not including keys in the<a name="line.933"></a>
-<span class="sourceLineNo">934</span> * snapshot.<a name="line.934"></a>
-<span class="sourceLineNo">935</span> */<a name="line.935"></a>
-<span class="sourceLineNo">936</span> @Override<a name="line.936"></a>
-<span class="sourceLineNo">937</span> public long heapSize() {<a name="line.937"></a>
-<span class="sourceLineNo">938</span> return size.get();<a name="line.938"></a>
-<span class="sourceLineNo">939</span> }<a name="line.939"></a>
-<span class="sourceLineNo">940</span><a name="line.940"></a>
-<span class="sourceLineNo">941</span> @Override<a name="line.941"></a>
-<span class="sourceLineNo">942</span> public long size() {<a name="line.942"></a>
-<span class="sourceLineNo">943</span> return heapSize();<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> /**<a name="line.946"></a>
-<span class="sourceLineNo">947</span> * Code to help figure if our approximation of object heap sizes is close<a name="line.947"></a>
-<span class="sourceLineNo">948</span> * enough. See hbase-900. Fills memstores then waits so user can heap<a name="line.948"></a>
-<span class="sourceLineNo">949</span> * dump and bring up resultant hprof in something like jprofiler which<a name="line.949"></a>
-<span class="sourceLineNo">950</span> * allows you get 'deep size' on objects.<a name="line.950"></a>
-<span class="sourceLineNo">951</span> * @param args main args<a name="line.951"></a>
-<span class="sourceLineNo">952</span> */<a name="line.952"></a>
-<span class="sourceLineNo">953</span> public static void main(String [] args) {<a name="line.953"></a>
-<span class="sourceLineNo">954</span> RuntimeMXBean runtime = ManagementFactory.getRuntimeMXBean();<a name="line.954"></a>
-<span class="sourceLineNo">955</span> LOG.info("vmName=" + runtime.getVmName() + ", vmVendor=" +<a name="line.955"></a>
-<span class="sourceLineNo">956</span> runtime.getVmVendor() + ", vmVersion=" + runtime.getVmVersion());<a name="line.956"></a>
-<span class="sourceLineNo">957</span> LOG.info("vmInputArguments=" + runtime.getInputArguments());<a name="line.957"></a>
-<span class="sourceLineNo">958</span> DefaultMemStore memstore1 = new DefaultMemStore();<a name="line.958"></a>
-<span class="sourceLineNo">959</span> // TODO: x32 vs x64<a name="line.959"></a>
-<span class="sourceLineNo">960</span> long size = 0;<a name="line.960"></a>
-<span class="sourceLineNo">961</span> final int count = 10000;<a name="line.961"></a>
-<span class="sourceLineNo">962</span> byte [] fam = Bytes.toBytes("col");<a name="line.962"></a>
-<span class="sourceLineNo">963</span> byte [] qf = Bytes.toBytes("umn");<a name="line.963"></a>
-<span class="sourceLineNo">964</span> byte [] empty = new byte[0];<a name="line.964"></a>
-<span class="sourceLineNo">965</span> for (int i = 0; i < count; i++) {<a name="line.965"></a>
-<span class="sourceLineNo">966</span> // Give each its own ts<a name="line.966"></a>
-<span class="sourceLineNo">967</span> size += memstore1.add(new KeyValue(Bytes.toBytes(i), fam, qf, i, empty));<a name="line.967"></a>
-<span class="sourceLineNo">968</span> }<a name="line.968"></a>
-<span class="sourceLineNo">969</span> LOG.info("memstore1 estimated size=" + size);<a name="line.969"></a>
-<span class="sourceLineNo">970</span> for (int i = 0; i < count; i++) {<a name="line.970"></a>
-<span class="sourceLineNo">971</span> size += memstore1.add(new KeyValue(Bytes.toBytes(i), fam, qf, i, empty));<a name="line.971"></a>
-<span class="sourceLineNo">972</span> }<a name="line.972"></a>
-<span class="sourceLineNo">973</span> LOG.info("memstore1 estimated size (2nd loading of same data)=" + size);<a name="line.973"></a>
-<span class="sourceLineNo">974</span> // Make a variably sized memstore.<a name="line.974"></a>
-<span class="sourceLineNo">975</span> DefaultMemStore memstore2 = new DefaultMemStore();<a name="line.975"></a>
-<span class="sourceLineNo">976</span> for (int i = 0; i < count; i++) {<a name="line.976"></a>
-<span class="sourceLineNo">977</span> size += memstore2.add(new KeyValue(Bytes.toBytes(i), fam, qf, i, new byte[i]));<a name="line.977"></a>
-<span class="sourceLineNo">978</span> }<a name="line.978"></a>
-<span class="sourceLineNo">979</span> LOG.info("memstore2 estimated size=" + size);<a name="line.979"></a>
-<span class="sourceLineNo">980</span> final int seconds = 30;<a name="line.980"></a>
-<span class="sourceLineNo">981</span> LOG.info("Waiting " + seconds + " seconds while heap dump is taken");<a name="line.981"></a>
-<span class="sourceLineNo">982</span> for (int i = 0; i < seconds; i++) {<a name="line.982"></a>
-<span class="sourceLineNo">983</span> // Thread.sleep(1000);<a name="line.983"></a>
-<span class="sourceLineNo">984</span> }<a name="line.984"></a>
-<span class="sourceLineNo">985</span> LOG.info("Exiting.");<a name="line.985"></a>
-<span class="sourceLineNo">986</span> }<a name="line.986"></a>
-<span class="sourceLineNo">987</span><a name="line.987"></a>
-<span class="sourceLineNo">988</span>}<a name="line.988"></a>
+<span class="sourceLineNo">740</span> @Override<a name="line.740"></a>
+<span class="sourceLineNo">741</span> public synchronized Cell peek() {<a name="line.741"></a>
+<span class="sourceLineNo">742</span> //DebugPrint.println(" MS@" + hashCode() + " peek = " + getLowest());<a name="line.742"></a>
+<span class="sourceLineNo">743</span> return theNext;<a name="line.743"></a>
+<span class="sourceLineNo">744</span> }<a name="line.744"></a>
+<span class="sourceLineNo">745</span><a name="line.745"></a>
+<span class="sourceLineNo">746</span> @Override<a name="line.746"></a>
+<span class="sourceLineNo">747</span> public synchronized Cell next() {<a name="line.747"></a>
+<span class="sourceLineNo">748</span> if (theNext == null) {<a name="line.748"></a>
+<span class="sourceLineNo">749</span> return null;<a name="line.749"></a>
+<span class="sourceLineNo">750</span> }<a name="line.750"></a>
+<span class="sourceLineNo">751</span><a name="line.751"></a>
+<span class="sourceLineNo">752</span> final Cell ret = theNext;<a name="line.752"></a>
+<span class="sourceLineNo">753</span><a name="line.753"></a>
+<span class="sourceLineNo">754</span> // Advance one of the iterators<a name="line.754"></a>
+<span class="sourceLineNo">755</span> if (theNext == cellSetNextRow) {<a name="line.755"></a>
+<span class="sourceLineNo">756</span> cellSetNextRow = getNext(cellSetIt);<a name="line.756"></a>
+<span class="sourceLineNo">757</span> } else {<a name="line.757"></a>
+<span class="sourceLineNo">758</span> snapshotNextRow = getNext(snapshotIt);<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> // Calculate the next value<a name="line.761"></a>
+<span class="sourceLineNo">762</span> theNext = getLowest(cellSetNextRow, snapshotNextRow);<a name="line.762"></a>
+<span class="sourceLineNo">763</span><a name="line.763"></a>
+<span class="sourceLineNo">764</span> //long readpoint = ReadWriteConsistencyControl.getThreadReadPoint();<a name="line.764"></a>
+<span class="sourceLineNo">765</span> //DebugPrint.println(" MS@" + hashCode() + " next: " + theNext + " next_next: " +<a name="line.765"></a>
+<span class="sourceLineNo">766</span> // getLowest() + " threadpoint=" + readpoint);<a name="line.766"></a>
+<span class="sourceLineNo">767</span> return ret;<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> * Returns the lower of the two key values, or null if they are both null.<a name="line.771"></a>
+<span class="sourceLineNo">772</span> * This uses comparator.compare() to compare the KeyValue using the memstore<a name="line.772"></a>
+<span class="sourceLineNo">773</span> * comparator.<a name="line.773"></a>
+<span class="sourceLineNo">774</span> */<a name="line.774"></a>
+<span class="sourceLineNo">775</span> private Cell getLowest(Cell first, Cell second) {<a name="line.775"></a>
+<span class="sourceLineNo">776</span> if (first == null && second == null) {<a name="line.776"></a>
+<span class="sourceLineNo">777</span> return null;<a name="line.777"></a>
+<span class="sourceLineNo">778</span> }<a name="line.778"></a>
+<span class="sourceLineNo">779</span> if (first != null && second != null) {<a name="line.779"></a>
+<span class="sourceLineNo">780</span> int compare = comparator.compare(first, second);<a name="line.780"></a>
+<span class="sourceLineNo">781</span> return (compare <= 0 ? first : second);<a name="line.781"></a>
+<span class="sourceLineNo">782</span> }<a name="line.782"></a>
+<span class="sourceLineNo">783</span> return (first != null ? first : second);<a name="line.783"></a>
+<span class="sourceLineNo">784</span> }<a name="line.784"></a>
+<span class="sourceLineNo">785</span><a name="line.785"></a>
+<span class="sourceLineNo">786</span> /*<a name="line.786"></a>
+<span class="sourceLineNo">787</span> * Returns the higher of the two cells, or null if they are both null.<a name="line.787"></a>
+<span class="sourceLineNo">788</span> * This uses comparator.compare() to compare the Cell using the memstore<a name="line.788"></a>
+<span class="sourceLineNo">789</span> * comparator.<a name="line.789"></a>
+<span class="sourceLineNo">790</span> */<a name="line.790"></a>
+<span class="sourceLineNo">791</span> private Cell getHighest(Cell first, Cell second) {<a name="line.791"></a>
+<span class="sourceLineNo">792</span> if (first == null && second == null) {<a name="line.792"></a>
+<span class="sourceLineNo">793</span> return null;<a name="line.793"></a>
+<span class="sourceLineNo">794</span> }<a name="line.794"></a>
+<span class="sourceLineNo">795</span> if (first != null && second != null) {<a name="line.795"></a>
+<span class="sourceLineNo">796</span> int compare = comparator.compare(first, second);<a name="line.796"></a>
+<span class="sourceLineNo">797</span> return (compare > 0 ? first : second);<a name="line.797"></a>
+<span class="sourceLineNo">798</span> }<a name="line.798"></a>
+<span class="sourceLineNo">799</span> return (first != null ? first : second);<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> public synchronized void close() {<a name="line.802"></a>
+<span class="sourceLineNo">803</span> this.cellSetNextRow = null;<a name="line.803"></a>
+<span class="sourceLineNo">804</span> this.snapshotNextRow = null;<a name="line.804"></a>
+<span class="sourceLineNo">805</span><a name="line.805"></a>
+<span class="sourceLineNo">806</span> this.cellSetIt = null;<a name="line.806"></a>
+<span class="sourceLineNo">807</span> this.snapshotIt = null;<a name="line.807"></a>
+<span class="sourceLineNo">808</span><a name="line.808"></a>
+<span class="sourceLineNo">809</span> if (allocatorAtCreation != null) {<a name="line.809"></a>
+<span class="sourceLineNo">810</span> this.allocatorAtCreation.decScannerCount();<a name="line.810"></a>
+<span class="sourceLineNo">811</span> this.allocatorAtCreation = null;<a name="line.811"></a>
+<span class="sourceLineNo">812</span> }<a name="line.812"></a>
+<span class="sourceLineNo">813</span> if (snapshotAllocatorAtCreation != null) {<a name="line.813"></a>
+<span class="sourceLineNo">814</span> this.snapshotAllocatorAtCreation.decScannerCount();<a name="line.814"></a>
+<span class="sourceLineNo">815</span> this.snapshotAllocatorAtCreation = null;<a name="line.815"></a>
+<span class="sourceLineNo">816</span> }<a name="line.816"></a>
+<span class="sourceLineNo">817</span><a name="line.817"></a>
+<span class="sourceLineNo">818</span> this.cellSetItRow = null;<a name="line.818"></a>
+<span class="sourceLineNo">819</span> this.snapshotItRow = null;<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> /**<a name="line.822"></a>
+<span class="sourceLineNo">823</span> * MemStoreScanner returns max value as sequence id because it will<a name="line.823"></a>
+<span class="sourceLineNo">824</span> * always have the latest data among all files.<a name="line.824"></a>
+<span class="sourceLineNo">825</span> */<a name="line.825"></a>
+<span class="sourceLineNo">826</span> @Override<a name="line.826"></a>
+<span class="sourceLineNo">827</span> public long getSequenceID() {<a name="line.827"></a>
+<span class="sourceLineNo">828</span> return Long.MAX_VALUE;<a name="line.828"></a>
+<span class="sourceLineNo">829</span> }<a name="line.829"></a>
+<span class="sourceLineNo">830</span><a name="line.830"></a>
+<span class="sourceLineNo">831</span> @Override<a name="line.831"></a>
+<span class="sourceLineNo">832</span> public boolean shouldUseScanner(Scan scan, Store store, long oldestUnexpiredTS) {<a name="line.832"></a>
+<span class="sourceLineNo">833</span> return shouldSeek(scan, store, oldestUnexpiredTS);<a name="line.833"></a>
+<span class="sourceLineNo">834</span> }<a name="line.834"></a>
+<span class="sourceLineNo">835</span><a name="line.835"></a>
+<span class="sourceLineNo">836</span> /**<a name="line.836"></a>
+<span class="sourceLineNo">837</span> * Seek scanner to the given key first. If it returns false(means<a name="line.837"></a>
+<span class="sourceLineNo">838</span> * peek()==null) or scanner's peek row is bigger than row of given key, seek<a name="line.838"></a>
+<span class="sourceLineNo">839</span> * the scanner to the previous row of given key<a name="line.839"></a>
+<span class="sourceLineNo">840</span> */<a name="line.840"></a>
+<span class="sourceLineNo">841</span> @Override<a name="line.841"></a>
+<span class="sourceLineNo">842</span> public synchronized boolean backwardSeek(Cell key) {<a name="line.842"></a>
+<span class="sourceLineNo">843</span> seek(key);<a name="line.843"></a>
+<span class="sourceLineNo">844</span> if (peek() == null || comparator.compareRows(peek(), key) > 0) {<a name="line.844"></a>
+<span class="sourceLineNo">845</span> return seekToPreviousRow(key);<a name="line.845"></a>
+<span class="sourceLineNo">846</span> }<a name="line.846"></a>
+<span class="sourceLineNo">847</span> return true;<a name="line.847"></a>
+<span class="sourceLineNo">848</span> }<a name="line.848"></a>
+<span class="sourceLineNo">849</span><a name="line.849"></a>
+<span class="sourceLineNo">850</span>
<TRUNCATED>