hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From git-site-r...@apache.org
Subject [13/51] [partial] hbase-site git commit: Published site at 82d554e3783372cc6b05489452c815b57c06f6cd.
Date Tue, 18 Apr 2017 14:58:51 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2fcc2ae0/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/MemStoreLABImpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/MemStoreLABImpl.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/MemStoreLABImpl.html
index 5215ab0..fa8f1d5 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/MemStoreLABImpl.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/MemStoreLABImpl.html
@@ -26,258 +26,229 @@
 <span class="sourceLineNo">018</span> */<a name="line.18"></a>
 <span class="sourceLineNo">019</span>package org.apache.hadoop.hbase.regionserver;<a name="line.19"></a>
 <span class="sourceLineNo">020</span><a name="line.20"></a>
-<span class="sourceLineNo">021</span>import java.nio.ByteBuffer;<a name="line.21"></a>
-<span class="sourceLineNo">022</span>import java.util.Set;<a name="line.22"></a>
-<span class="sourceLineNo">023</span>import java.util.concurrent.BlockingQueue;<a name="line.23"></a>
-<span class="sourceLineNo">024</span>import java.util.concurrent.ConcurrentSkipListSet;<a name="line.24"></a>
-<span class="sourceLineNo">025</span>import java.util.concurrent.LinkedBlockingQueue;<a name="line.25"></a>
-<span class="sourceLineNo">026</span>import java.util.concurrent.atomic.AtomicBoolean;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import java.util.concurrent.atomic.AtomicInteger;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import java.util.concurrent.atomic.AtomicReference;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import java.util.concurrent.locks.ReentrantLock;<a name="line.29"></a>
-<span class="sourceLineNo">030</span><a name="line.30"></a>
-<span class="sourceLineNo">031</span>import org.apache.commons.logging.Log;<a name="line.31"></a>
-<span class="sourceLineNo">032</span>import org.apache.commons.logging.LogFactory;<a name="line.32"></a>
-<span class="sourceLineNo">033</span>import org.apache.hadoop.conf.Configuration;<a name="line.33"></a>
-<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.Cell;<a name="line.34"></a>
-<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.ExtendedCell;<a name="line.35"></a>
-<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.KeyValueUtil;<a name="line.36"></a>
-<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.37"></a>
-<span class="sourceLineNo">038</span><a name="line.38"></a>
-<span class="sourceLineNo">039</span>import com.google.common.annotations.VisibleForTesting;<a name="line.39"></a>
-<span class="sourceLineNo">040</span>import com.google.common.base.Preconditions;<a name="line.40"></a>
-<span class="sourceLineNo">041</span>/**<a name="line.41"></a>
-<span class="sourceLineNo">042</span> * A memstore-local allocation buffer.<a name="line.42"></a>
-<span class="sourceLineNo">043</span> * &lt;p&gt;<a name="line.43"></a>
-<span class="sourceLineNo">044</span> * The MemStoreLAB is basically a bump-the-pointer allocator that allocates<a name="line.44"></a>
-<span class="sourceLineNo">045</span> * big (2MB) byte[] chunks from and then doles it out to threads that request<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * slices into the array.<a name="line.46"></a>
-<span class="sourceLineNo">047</span> * &lt;p&gt;<a name="line.47"></a>
-<span class="sourceLineNo">048</span> * The purpose of this class is to combat heap fragmentation in the<a name="line.48"></a>
-<span class="sourceLineNo">049</span> * regionserver. By ensuring that all Cells in a given memstore refer<a name="line.49"></a>
-<span class="sourceLineNo">050</span> * only to large chunks of contiguous memory, we ensure that large blocks<a name="line.50"></a>
-<span class="sourceLineNo">051</span> * get freed up when the memstore is flushed.<a name="line.51"></a>
-<span class="sourceLineNo">052</span> * &lt;p&gt;<a name="line.52"></a>
-<span class="sourceLineNo">053</span> * Without the MSLAB, the byte array allocated during insertion end up<a name="line.53"></a>
-<span class="sourceLineNo">054</span> * interleaved throughout the heap, and the old generation gets progressively<a name="line.54"></a>
-<span class="sourceLineNo">055</span> * more fragmented until a stop-the-world compacting collection occurs.<a name="line.55"></a>
-<span class="sourceLineNo">056</span> * &lt;p&gt;<a name="line.56"></a>
-<span class="sourceLineNo">057</span> * TODO: we should probably benchmark whether word-aligning the allocations<a name="line.57"></a>
-<span class="sourceLineNo">058</span> * would provide a performance improvement - probably would speed up the<a name="line.58"></a>
-<span class="sourceLineNo">059</span> * Bytes.toLong/Bytes.toInt calls in KeyValue, but some of those are cached<a name="line.59"></a>
-<span class="sourceLineNo">060</span> * anyway.<a name="line.60"></a>
-<span class="sourceLineNo">061</span> * The chunks created by this MemStoreLAB can get pooled at {@link ChunkCreator}.<a name="line.61"></a>
-<span class="sourceLineNo">062</span> * When the Chunk comes from pool, it can be either an on heap or an off heap backed chunk. The chunks,<a name="line.62"></a>
-<span class="sourceLineNo">063</span> * which this MemStoreLAB creates on its own (when no chunk available from pool), those will be<a name="line.63"></a>
-<span class="sourceLineNo">064</span> * always on heap backed.<a name="line.64"></a>
-<span class="sourceLineNo">065</span> */<a name="line.65"></a>
-<span class="sourceLineNo">066</span>@InterfaceAudience.Private<a name="line.66"></a>
-<span class="sourceLineNo">067</span>public class MemStoreLABImpl implements MemStoreLAB {<a name="line.67"></a>
-<span class="sourceLineNo">068</span><a name="line.68"></a>
-<span class="sourceLineNo">069</span>  static final Log LOG = LogFactory.getLog(MemStoreLABImpl.class);<a name="line.69"></a>
-<span class="sourceLineNo">070</span><a name="line.70"></a>
-<span class="sourceLineNo">071</span>  private AtomicReference&lt;Chunk&gt; curChunk = new AtomicReference&lt;&gt;();<a name="line.71"></a>
-<span class="sourceLineNo">072</span>  // Lock to manage multiple handlers requesting for a chunk<a name="line.72"></a>
-<span class="sourceLineNo">073</span>  private ReentrantLock lock = new ReentrantLock();<a name="line.73"></a>
-<span class="sourceLineNo">074</span><a name="line.74"></a>
-<span class="sourceLineNo">075</span>  // A set of chunks contained by this memstore LAB<a name="line.75"></a>
-<span class="sourceLineNo">076</span>  @VisibleForTesting<a name="line.76"></a>
-<span class="sourceLineNo">077</span>  Set&lt;Integer&gt; chunks = new ConcurrentSkipListSet&lt;Integer&gt;();<a name="line.77"></a>
-<span class="sourceLineNo">078</span>  private final int chunkSize;<a name="line.78"></a>
-<span class="sourceLineNo">079</span>  private final int maxAlloc;<a name="line.79"></a>
-<span class="sourceLineNo">080</span>  private final ChunkCreator chunkCreator;<a name="line.80"></a>
-<span class="sourceLineNo">081</span><a name="line.81"></a>
-<span class="sourceLineNo">082</span>  // This flag is for closing this instance, its set when clearing snapshot of<a name="line.82"></a>
-<span class="sourceLineNo">083</span>  // memstore<a name="line.83"></a>
-<span class="sourceLineNo">084</span>  private volatile boolean closed = false;<a name="line.84"></a>
-<span class="sourceLineNo">085</span>  // This flag is for reclaiming chunks. Its set when putting chunks back to<a name="line.85"></a>
-<span class="sourceLineNo">086</span>  // pool<a name="line.86"></a>
-<span class="sourceLineNo">087</span>  private AtomicBoolean reclaimed = new AtomicBoolean(false);<a name="line.87"></a>
-<span class="sourceLineNo">088</span>  // Current count of open scanners which reading data from this MemStoreLAB<a name="line.88"></a>
-<span class="sourceLineNo">089</span>  private final AtomicInteger openScannerCount = new AtomicInteger();<a name="line.89"></a>
-<span class="sourceLineNo">090</span><a name="line.90"></a>
-<span class="sourceLineNo">091</span>  // Used in testing<a name="line.91"></a>
-<span class="sourceLineNo">092</span>  public MemStoreLABImpl() {<a name="line.92"></a>
-<span class="sourceLineNo">093</span>    this(new Configuration());<a name="line.93"></a>
-<span class="sourceLineNo">094</span>  }<a name="line.94"></a>
-<span class="sourceLineNo">095</span><a name="line.95"></a>
-<span class="sourceLineNo">096</span>  public MemStoreLABImpl(Configuration conf) {<a name="line.96"></a>
-<span class="sourceLineNo">097</span>    chunkSize = conf.getInt(CHUNK_SIZE_KEY, CHUNK_SIZE_DEFAULT);<a name="line.97"></a>
-<span class="sourceLineNo">098</span>    maxAlloc = conf.getInt(MAX_ALLOC_KEY, MAX_ALLOC_DEFAULT);<a name="line.98"></a>
-<span class="sourceLineNo">099</span>    this.chunkCreator = ChunkCreator.getInstance();<a name="line.99"></a>
-<span class="sourceLineNo">100</span>    // if we don't exclude allocations &gt;CHUNK_SIZE, we'd infiniteloop on one!<a name="line.100"></a>
-<span class="sourceLineNo">101</span>    Preconditions.checkArgument(maxAlloc &lt;= chunkSize,<a name="line.101"></a>
-<span class="sourceLineNo">102</span>        MAX_ALLOC_KEY + " must be less than " + CHUNK_SIZE_KEY);<a name="line.102"></a>
-<span class="sourceLineNo">103</span>  }<a name="line.103"></a>
-<span class="sourceLineNo">104</span><a name="line.104"></a>
-<span class="sourceLineNo">105</span>  @Override<a name="line.105"></a>
-<span class="sourceLineNo">106</span>  public Cell copyCellInto(Cell cell) {<a name="line.106"></a>
-<span class="sourceLineNo">107</span>    int size = KeyValueUtil.length(cell);<a name="line.107"></a>
-<span class="sourceLineNo">108</span>    Preconditions.checkArgument(size &gt;= 0, "negative size");<a name="line.108"></a>
-<span class="sourceLineNo">109</span>    // Callers should satisfy large allocations directly from JVM since they<a name="line.109"></a>
-<span class="sourceLineNo">110</span>    // don't cause fragmentation as badly.<a name="line.110"></a>
-<span class="sourceLineNo">111</span>    if (size &gt; maxAlloc) {<a name="line.111"></a>
-<span class="sourceLineNo">112</span>      return null;<a name="line.112"></a>
-<span class="sourceLineNo">113</span>    }<a name="line.113"></a>
-<span class="sourceLineNo">114</span>    Chunk c = null;<a name="line.114"></a>
-<span class="sourceLineNo">115</span>    int allocOffset = 0;<a name="line.115"></a>
-<span class="sourceLineNo">116</span>    while (true) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span>      // Try to get the chunk<a name="line.117"></a>
-<span class="sourceLineNo">118</span>      c = getOrMakeChunk();<a name="line.118"></a>
-<span class="sourceLineNo">119</span>      // we may get null because the some other thread succeeded in getting the lock<a name="line.119"></a>
-<span class="sourceLineNo">120</span>      // and so the current thread has to try again to make its chunk or grab the chunk<a name="line.120"></a>
-<span class="sourceLineNo">121</span>      // that the other thread created<a name="line.121"></a>
+<span class="sourceLineNo">021</span>import java.util.concurrent.BlockingQueue;<a name="line.21"></a>
+<span class="sourceLineNo">022</span>import java.util.concurrent.LinkedBlockingQueue;<a name="line.22"></a>
+<span class="sourceLineNo">023</span>import java.util.concurrent.atomic.AtomicBoolean;<a name="line.23"></a>
+<span class="sourceLineNo">024</span>import java.util.concurrent.atomic.AtomicInteger;<a name="line.24"></a>
+<span class="sourceLineNo">025</span>import java.util.concurrent.atomic.AtomicReference;<a name="line.25"></a>
+<span class="sourceLineNo">026</span><a name="line.26"></a>
+<span class="sourceLineNo">027</span>import org.apache.commons.logging.Log;<a name="line.27"></a>
+<span class="sourceLineNo">028</span>import org.apache.commons.logging.LogFactory;<a name="line.28"></a>
+<span class="sourceLineNo">029</span>import org.apache.hadoop.conf.Configuration;<a name="line.29"></a>
+<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.Cell;<a name="line.30"></a>
+<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.31"></a>
+<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.KeyValueUtil;<a name="line.32"></a>
+<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.33"></a>
+<span class="sourceLineNo">034</span><a name="line.34"></a>
+<span class="sourceLineNo">035</span>import com.google.common.annotations.VisibleForTesting;<a name="line.35"></a>
+<span class="sourceLineNo">036</span>import com.google.common.base.Preconditions;<a name="line.36"></a>
+<span class="sourceLineNo">037</span><a name="line.37"></a>
+<span class="sourceLineNo">038</span>/**<a name="line.38"></a>
+<span class="sourceLineNo">039</span> * A memstore-local allocation buffer.<a name="line.39"></a>
+<span class="sourceLineNo">040</span> * &lt;p&gt;<a name="line.40"></a>
+<span class="sourceLineNo">041</span> * The MemStoreLAB is basically a bump-the-pointer allocator that allocates<a name="line.41"></a>
+<span class="sourceLineNo">042</span> * big (2MB) byte[] chunks from and then doles it out to threads that request<a name="line.42"></a>
+<span class="sourceLineNo">043</span> * slices into the array.<a name="line.43"></a>
+<span class="sourceLineNo">044</span> * &lt;p&gt;<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * The purpose of this class is to combat heap fragmentation in the<a name="line.45"></a>
+<span class="sourceLineNo">046</span> * regionserver. By ensuring that all Cells in a given memstore refer<a name="line.46"></a>
+<span class="sourceLineNo">047</span> * only to large chunks of contiguous memory, we ensure that large blocks<a name="line.47"></a>
+<span class="sourceLineNo">048</span> * get freed up when the memstore is flushed.<a name="line.48"></a>
+<span class="sourceLineNo">049</span> * &lt;p&gt;<a name="line.49"></a>
+<span class="sourceLineNo">050</span> * Without the MSLAB, the byte array allocated during insertion end up<a name="line.50"></a>
+<span class="sourceLineNo">051</span> * interleaved throughout the heap, and the old generation gets progressively<a name="line.51"></a>
+<span class="sourceLineNo">052</span> * more fragmented until a stop-the-world compacting collection occurs.<a name="line.52"></a>
+<span class="sourceLineNo">053</span> * &lt;p&gt;<a name="line.53"></a>
+<span class="sourceLineNo">054</span> * TODO: we should probably benchmark whether word-aligning the allocations<a name="line.54"></a>
+<span class="sourceLineNo">055</span> * would provide a performance improvement - probably would speed up the<a name="line.55"></a>
+<span class="sourceLineNo">056</span> * Bytes.toLong/Bytes.toInt calls in KeyValue, but some of those are cached<a name="line.56"></a>
+<span class="sourceLineNo">057</span> * anyway.<a name="line.57"></a>
+<span class="sourceLineNo">058</span> * The chunks created by this MemStoreLAB can get pooled at {@link MemStoreChunkPool}.<a name="line.58"></a>
+<span class="sourceLineNo">059</span> * When the Chunk comes pool, it can be either an on heap or an off heap backed chunk. The chunks,<a name="line.59"></a>
+<span class="sourceLineNo">060</span> * which this MemStoreLAB creates on its own (when no chunk available from pool), those will be<a name="line.60"></a>
+<span class="sourceLineNo">061</span> * always on heap backed.<a name="line.61"></a>
+<span class="sourceLineNo">062</span> */<a name="line.62"></a>
+<span class="sourceLineNo">063</span>@InterfaceAudience.Private<a name="line.63"></a>
+<span class="sourceLineNo">064</span>public class MemStoreLABImpl implements MemStoreLAB {<a name="line.64"></a>
+<span class="sourceLineNo">065</span><a name="line.65"></a>
+<span class="sourceLineNo">066</span>  static final Log LOG = LogFactory.getLog(MemStoreLABImpl.class);<a name="line.66"></a>
+<span class="sourceLineNo">067</span><a name="line.67"></a>
+<span class="sourceLineNo">068</span>  private AtomicReference&lt;Chunk&gt; curChunk = new AtomicReference&lt;&gt;();<a name="line.68"></a>
+<span class="sourceLineNo">069</span>  // A queue of chunks from pool contained by this memstore LAB<a name="line.69"></a>
+<span class="sourceLineNo">070</span>  // TODO: in the future, it would be better to have List implementation instead of Queue,<a name="line.70"></a>
+<span class="sourceLineNo">071</span>  // as FIFO order is not so important here<a name="line.71"></a>
+<span class="sourceLineNo">072</span>  @VisibleForTesting<a name="line.72"></a>
+<span class="sourceLineNo">073</span>  BlockingQueue&lt;Chunk&gt; pooledChunkQueue = null;<a name="line.73"></a>
+<span class="sourceLineNo">074</span>  private final int chunkSize;<a name="line.74"></a>
+<span class="sourceLineNo">075</span>  private final int maxAlloc;<a name="line.75"></a>
+<span class="sourceLineNo">076</span>  private final MemStoreChunkPool chunkPool;<a name="line.76"></a>
+<span class="sourceLineNo">077</span><a name="line.77"></a>
+<span class="sourceLineNo">078</span>  // This flag is for closing this instance, its set when clearing snapshot of<a name="line.78"></a>
+<span class="sourceLineNo">079</span>  // memstore<a name="line.79"></a>
+<span class="sourceLineNo">080</span>  private volatile boolean closed = false;<a name="line.80"></a>
+<span class="sourceLineNo">081</span>  // This flag is for reclaiming chunks. Its set when putting chunks back to<a name="line.81"></a>
+<span class="sourceLineNo">082</span>  // pool<a name="line.82"></a>
+<span class="sourceLineNo">083</span>  private AtomicBoolean reclaimed = new AtomicBoolean(false);<a name="line.83"></a>
+<span class="sourceLineNo">084</span>  // Current count of open scanners which reading data from this MemStoreLAB<a name="line.84"></a>
+<span class="sourceLineNo">085</span>  private final AtomicInteger openScannerCount = new AtomicInteger();<a name="line.85"></a>
+<span class="sourceLineNo">086</span><a name="line.86"></a>
+<span class="sourceLineNo">087</span>  // Used in testing<a name="line.87"></a>
+<span class="sourceLineNo">088</span>  public MemStoreLABImpl() {<a name="line.88"></a>
+<span class="sourceLineNo">089</span>    this(new Configuration());<a name="line.89"></a>
+<span class="sourceLineNo">090</span>  }<a name="line.90"></a>
+<span class="sourceLineNo">091</span><a name="line.91"></a>
+<span class="sourceLineNo">092</span>  public MemStoreLABImpl(Configuration conf) {<a name="line.92"></a>
+<span class="sourceLineNo">093</span>    chunkSize = conf.getInt(CHUNK_SIZE_KEY, CHUNK_SIZE_DEFAULT);<a name="line.93"></a>
+<span class="sourceLineNo">094</span>    maxAlloc = conf.getInt(MAX_ALLOC_KEY, MAX_ALLOC_DEFAULT);<a name="line.94"></a>
+<span class="sourceLineNo">095</span>    this.chunkPool = MemStoreChunkPool.getPool();<a name="line.95"></a>
+<span class="sourceLineNo">096</span>    // currently chunkQueue is only used for chunkPool<a name="line.96"></a>
+<span class="sourceLineNo">097</span>    if (this.chunkPool != null) {<a name="line.97"></a>
+<span class="sourceLineNo">098</span>      // set queue length to chunk pool max count to avoid keeping reference of<a name="line.98"></a>
+<span class="sourceLineNo">099</span>      // too many non-reclaimable chunks<a name="line.99"></a>
+<span class="sourceLineNo">100</span>      pooledChunkQueue = new LinkedBlockingQueue&lt;&gt;(chunkPool.getMaxCount());<a name="line.100"></a>
+<span class="sourceLineNo">101</span>    }<a name="line.101"></a>
+<span class="sourceLineNo">102</span><a name="line.102"></a>
+<span class="sourceLineNo">103</span>    // if we don't exclude allocations &gt;CHUNK_SIZE, we'd infiniteloop on one!<a name="line.103"></a>
+<span class="sourceLineNo">104</span>    Preconditions.checkArgument(maxAlloc &lt;= chunkSize,<a name="line.104"></a>
+<span class="sourceLineNo">105</span>        MAX_ALLOC_KEY + " must be less than " + CHUNK_SIZE_KEY);<a name="line.105"></a>
+<span class="sourceLineNo">106</span>  }<a name="line.106"></a>
+<span class="sourceLineNo">107</span><a name="line.107"></a>
+<span class="sourceLineNo">108</span><a name="line.108"></a>
+<span class="sourceLineNo">109</span>  @Override<a name="line.109"></a>
+<span class="sourceLineNo">110</span>  public Cell copyCellInto(Cell cell) {<a name="line.110"></a>
+<span class="sourceLineNo">111</span>    int size = KeyValueUtil.length(cell);<a name="line.111"></a>
+<span class="sourceLineNo">112</span>    Preconditions.checkArgument(size &gt;= 0, "negative size");<a name="line.112"></a>
+<span class="sourceLineNo">113</span>    // Callers should satisfy large allocations directly from JVM since they<a name="line.113"></a>
+<span class="sourceLineNo">114</span>    // don't cause fragmentation as badly.<a name="line.114"></a>
+<span class="sourceLineNo">115</span>    if (size &gt; maxAlloc) {<a name="line.115"></a>
+<span class="sourceLineNo">116</span>      return null;<a name="line.116"></a>
+<span class="sourceLineNo">117</span>    }<a name="line.117"></a>
+<span class="sourceLineNo">118</span>    Chunk c = null;<a name="line.118"></a>
+<span class="sourceLineNo">119</span>    int allocOffset = 0;<a name="line.119"></a>
+<span class="sourceLineNo">120</span>    while (true) {<a name="line.120"></a>
+<span class="sourceLineNo">121</span>      c = getOrMakeChunk();<a name="line.121"></a>
 <span class="sourceLineNo">122</span>      // Try to allocate from this chunk<a name="line.122"></a>
-<span class="sourceLineNo">123</span>      if (c != null) {<a name="line.123"></a>
-<span class="sourceLineNo">124</span>        allocOffset = c.alloc(size);<a name="line.124"></a>
-<span class="sourceLineNo">125</span>        if (allocOffset != -1) {<a name="line.125"></a>
-<span class="sourceLineNo">126</span>          // We succeeded - this is the common case - small alloc<a name="line.126"></a>
-<span class="sourceLineNo">127</span>          // from a big buffer<a name="line.127"></a>
-<span class="sourceLineNo">128</span>          break;<a name="line.128"></a>
-<span class="sourceLineNo">129</span>        }<a name="line.129"></a>
-<span class="sourceLineNo">130</span>        // not enough space!<a name="line.130"></a>
-<span class="sourceLineNo">131</span>        // try to retire this chunk<a name="line.131"></a>
-<span class="sourceLineNo">132</span>        tryRetireChunk(c);<a name="line.132"></a>
-<span class="sourceLineNo">133</span>      }<a name="line.133"></a>
-<span class="sourceLineNo">134</span>    }<a name="line.134"></a>
-<span class="sourceLineNo">135</span>    return copyToChunkCell(cell, c.getData(), allocOffset, size);<a name="line.135"></a>
-<span class="sourceLineNo">136</span>  }<a name="line.136"></a>
-<span class="sourceLineNo">137</span><a name="line.137"></a>
-<span class="sourceLineNo">138</span>  /**<a name="line.138"></a>
-<span class="sourceLineNo">139</span>   * Clone the passed cell by copying its data into the passed buf and create a cell with a chunkid<a name="line.139"></a>
-<span class="sourceLineNo">140</span>   * out of it<a name="line.140"></a>
-<span class="sourceLineNo">141</span>   */<a name="line.141"></a>
-<span class="sourceLineNo">142</span>  private Cell copyToChunkCell(Cell cell, ByteBuffer buf, int offset, int len) {<a name="line.142"></a>
-<span class="sourceLineNo">143</span>    int tagsLen = cell.getTagsLength();<a name="line.143"></a>
-<span class="sourceLineNo">144</span>    if (cell instanceof ExtendedCell) {<a name="line.144"></a>
-<span class="sourceLineNo">145</span>      ((ExtendedCell) cell).write(buf, offset);<a name="line.145"></a>
-<span class="sourceLineNo">146</span>    } else {<a name="line.146"></a>
-<span class="sourceLineNo">147</span>      // Normally all Cell impls within Server will be of type ExtendedCell. Just considering the<a name="line.147"></a>
-<span class="sourceLineNo">148</span>      // other case also. The data fragments within Cell is copied into buf as in KeyValue<a name="line.148"></a>
-<span class="sourceLineNo">149</span>      // serialization format only.<a name="line.149"></a>
-<span class="sourceLineNo">150</span>      KeyValueUtil.appendTo(cell, buf, offset, true);<a name="line.150"></a>
-<span class="sourceLineNo">151</span>    }<a name="line.151"></a>
-<span class="sourceLineNo">152</span>    // TODO : write the seqid here. For writing seqId we should create a new cell type so<a name="line.152"></a>
-<span class="sourceLineNo">153</span>    // that seqId is not used as the state<a name="line.153"></a>
-<span class="sourceLineNo">154</span>    if (tagsLen == 0) {<a name="line.154"></a>
-<span class="sourceLineNo">155</span>      // When tagsLen is 0, make a NoTagsByteBufferKeyValue version. This is an optimized class<a name="line.155"></a>
-<span class="sourceLineNo">156</span>      // which directly return tagsLen as 0. So we avoid parsing many length components in<a name="line.156"></a>
-<span class="sourceLineNo">157</span>      // reading the tagLength stored in the backing buffer. The Memstore addition of every Cell<a name="line.157"></a>
-<span class="sourceLineNo">158</span>      // call getTagsLength().<a name="line.158"></a>
-<span class="sourceLineNo">159</span>      return new NoTagByteBufferChunkCell(buf, offset, len, cell.getSequenceId());<a name="line.159"></a>
-<span class="sourceLineNo">160</span>    } else {<a name="line.160"></a>
-<span class="sourceLineNo">161</span>      return new ByteBufferChunkCell(buf, offset, len, cell.getSequenceId());<a name="line.161"></a>
-<span class="sourceLineNo">162</span>    }<a name="line.162"></a>
-<span class="sourceLineNo">163</span>  }<a name="line.163"></a>
-<span class="sourceLineNo">164</span><a name="line.164"></a>
-<span class="sourceLineNo">165</span>  /**<a name="line.165"></a>
-<span class="sourceLineNo">166</span>   * Close this instance since it won't be used any more, try to put the chunks<a name="line.166"></a>
-<span class="sourceLineNo">167</span>   * back to pool<a name="line.167"></a>
-<span class="sourceLineNo">168</span>   */<a name="line.168"></a>
-<span class="sourceLineNo">169</span>  @Override<a name="line.169"></a>
-<span class="sourceLineNo">170</span>  public void close() {<a name="line.170"></a>
-<span class="sourceLineNo">171</span>    this.closed = true;<a name="line.171"></a>
-<span class="sourceLineNo">172</span>    // We could put back the chunks to pool for reusing only when there is no<a name="line.172"></a>
-<span class="sourceLineNo">173</span>    // opening scanner which will read their data<a name="line.173"></a>
-<span class="sourceLineNo">174</span>    int count  = openScannerCount.get();<a name="line.174"></a>
-<span class="sourceLineNo">175</span>    if(count == 0) {<a name="line.175"></a>
-<span class="sourceLineNo">176</span>      recycleChunks();<a name="line.176"></a>
-<span class="sourceLineNo">177</span>    }<a name="line.177"></a>
-<span class="sourceLineNo">178</span>  }<a name="line.178"></a>
-<span class="sourceLineNo">179</span><a name="line.179"></a>
-<span class="sourceLineNo">180</span>  /**<a name="line.180"></a>
-<span class="sourceLineNo">181</span>   * Called when opening a scanner on the data of this MemStoreLAB<a name="line.181"></a>
-<span class="sourceLineNo">182</span>   */<a name="line.182"></a>
-<span class="sourceLineNo">183</span>  @Override<a name="line.183"></a>
-<span class="sourceLineNo">184</span>  public void incScannerCount() {<a name="line.184"></a>
-<span class="sourceLineNo">185</span>    this.openScannerCount.incrementAndGet();<a name="line.185"></a>
+<span class="sourceLineNo">123</span>      allocOffset = c.alloc(size);<a name="line.123"></a>
+<span class="sourceLineNo">124</span>      if (allocOffset != -1) {<a name="line.124"></a>
+<span class="sourceLineNo">125</span>        // We succeeded - this is the common case - small alloc<a name="line.125"></a>
+<span class="sourceLineNo">126</span>        // from a big buffer<a name="line.126"></a>
+<span class="sourceLineNo">127</span>        break;<a name="line.127"></a>
+<span class="sourceLineNo">128</span>      }<a name="line.128"></a>
+<span class="sourceLineNo">129</span>      // not enough space!<a name="line.129"></a>
+<span class="sourceLineNo">130</span>      // try to retire this chunk<a name="line.130"></a>
+<span class="sourceLineNo">131</span>      tryRetireChunk(c);<a name="line.131"></a>
+<span class="sourceLineNo">132</span>    }<a name="line.132"></a>
+<span class="sourceLineNo">133</span>    return CellUtil.copyCellTo(cell, c.getData(), allocOffset, size);<a name="line.133"></a>
+<span class="sourceLineNo">134</span>  }<a name="line.134"></a>
+<span class="sourceLineNo">135</span><a name="line.135"></a>
+<span class="sourceLineNo">136</span>  /**<a name="line.136"></a>
+<span class="sourceLineNo">137</span>   * Close this instance since it won't be used any more, try to put the chunks<a name="line.137"></a>
+<span class="sourceLineNo">138</span>   * back to pool<a name="line.138"></a>
+<span class="sourceLineNo">139</span>   */<a name="line.139"></a>
+<span class="sourceLineNo">140</span>  @Override<a name="line.140"></a>
+<span class="sourceLineNo">141</span>  public void close() {<a name="line.141"></a>
+<span class="sourceLineNo">142</span>    this.closed = true;<a name="line.142"></a>
+<span class="sourceLineNo">143</span>    // We could put back the chunks to pool for reusing only when there is no<a name="line.143"></a>
+<span class="sourceLineNo">144</span>    // opening scanner which will read their data<a name="line.144"></a>
+<span class="sourceLineNo">145</span>    if (chunkPool != null &amp;&amp; openScannerCount.get() == 0<a name="line.145"></a>
+<span class="sourceLineNo">146</span>        &amp;&amp; reclaimed.compareAndSet(false, true)) {<a name="line.146"></a>
+<span class="sourceLineNo">147</span>      chunkPool.putbackChunks(this.pooledChunkQueue);<a name="line.147"></a>
+<span class="sourceLineNo">148</span>    }<a name="line.148"></a>
+<span class="sourceLineNo">149</span>  }<a name="line.149"></a>
+<span class="sourceLineNo">150</span><a name="line.150"></a>
+<span class="sourceLineNo">151</span>  /**<a name="line.151"></a>
+<span class="sourceLineNo">152</span>   * Called when opening a scanner on the data of this MemStoreLAB<a name="line.152"></a>
+<span class="sourceLineNo">153</span>   */<a name="line.153"></a>
+<span class="sourceLineNo">154</span>  @Override<a name="line.154"></a>
+<span class="sourceLineNo">155</span>  public void incScannerCount() {<a name="line.155"></a>
+<span class="sourceLineNo">156</span>    this.openScannerCount.incrementAndGet();<a name="line.156"></a>
+<span class="sourceLineNo">157</span>  }<a name="line.157"></a>
+<span class="sourceLineNo">158</span><a name="line.158"></a>
+<span class="sourceLineNo">159</span>  /**<a name="line.159"></a>
+<span class="sourceLineNo">160</span>   * Called when closing a scanner on the data of this MemStoreLAB<a name="line.160"></a>
+<span class="sourceLineNo">161</span>   */<a name="line.161"></a>
+<span class="sourceLineNo">162</span>  @Override<a name="line.162"></a>
+<span class="sourceLineNo">163</span>  public void decScannerCount() {<a name="line.163"></a>
+<span class="sourceLineNo">164</span>    int count = this.openScannerCount.decrementAndGet();<a name="line.164"></a>
+<span class="sourceLineNo">165</span>    if (this.closed &amp;&amp; chunkPool != null &amp;&amp; count == 0<a name="line.165"></a>
+<span class="sourceLineNo">166</span>        &amp;&amp; reclaimed.compareAndSet(false, true)) {<a name="line.166"></a>
+<span class="sourceLineNo">167</span>      chunkPool.putbackChunks(this.pooledChunkQueue);<a name="line.167"></a>
+<span class="sourceLineNo">168</span>    }<a name="line.168"></a>
+<span class="sourceLineNo">169</span>  }<a name="line.169"></a>
+<span class="sourceLineNo">170</span><a name="line.170"></a>
+<span class="sourceLineNo">171</span>  /**<a name="line.171"></a>
+<span class="sourceLineNo">172</span>   * Try to retire the current chunk if it is still<a name="line.172"></a>
+<span class="sourceLineNo">173</span>   * &lt;code&gt;c&lt;/code&gt;. Postcondition is that curChunk.get()<a name="line.173"></a>
+<span class="sourceLineNo">174</span>   * != c<a name="line.174"></a>
+<span class="sourceLineNo">175</span>   * @param c the chunk to retire<a name="line.175"></a>
+<span class="sourceLineNo">176</span>   * @return true if we won the race to retire the chunk<a name="line.176"></a>
+<span class="sourceLineNo">177</span>   */<a name="line.177"></a>
+<span class="sourceLineNo">178</span>  private void tryRetireChunk(Chunk c) {<a name="line.178"></a>
+<span class="sourceLineNo">179</span>    curChunk.compareAndSet(c, null);<a name="line.179"></a>
+<span class="sourceLineNo">180</span>    // If the CAS succeeds, that means that we won the race<a name="line.180"></a>
+<span class="sourceLineNo">181</span>    // to retire the chunk. We could use this opportunity to<a name="line.181"></a>
+<span class="sourceLineNo">182</span>    // update metrics on external fragmentation.<a name="line.182"></a>
+<span class="sourceLineNo">183</span>    //<a name="line.183"></a>
+<span class="sourceLineNo">184</span>    // If the CAS fails, that means that someone else already<a name="line.184"></a>
+<span class="sourceLineNo">185</span>    // retired the chunk for us.<a name="line.185"></a>
 <span class="sourceLineNo">186</span>  }<a name="line.186"></a>
 <span class="sourceLineNo">187</span><a name="line.187"></a>
 <span class="sourceLineNo">188</span>  /**<a name="line.188"></a>
-<span class="sourceLineNo">189</span>   * Called when closing a scanner on the data of this MemStoreLAB<a name="line.189"></a>
-<span class="sourceLineNo">190</span>   */<a name="line.190"></a>
-<span class="sourceLineNo">191</span>  @Override<a name="line.191"></a>
-<span class="sourceLineNo">192</span>  public void decScannerCount() {<a name="line.192"></a>
-<span class="sourceLineNo">193</span>    int count = this.openScannerCount.decrementAndGet();<a name="line.193"></a>
-<span class="sourceLineNo">194</span>    if (this.closed &amp;&amp; count == 0) {<a name="line.194"></a>
-<span class="sourceLineNo">195</span>      recycleChunks();<a name="line.195"></a>
-<span class="sourceLineNo">196</span>    }<a name="line.196"></a>
-<span class="sourceLineNo">197</span>  }<a name="line.197"></a>
-<span class="sourceLineNo">198</span><a name="line.198"></a>
-<span class="sourceLineNo">199</span>  private void recycleChunks() {<a name="line.199"></a>
-<span class="sourceLineNo">200</span>    if (reclaimed.compareAndSet(false, true)) {<a name="line.200"></a>
-<span class="sourceLineNo">201</span>      chunkCreator.putbackChunks(chunks);<a name="line.201"></a>
-<span class="sourceLineNo">202</span>    }<a name="line.202"></a>
-<span class="sourceLineNo">203</span>  }<a name="line.203"></a>
-<span class="sourceLineNo">204</span><a name="line.204"></a>
-<span class="sourceLineNo">205</span>  /**<a name="line.205"></a>
-<span class="sourceLineNo">206</span>   * Try to retire the current chunk if it is still<a name="line.206"></a>
-<span class="sourceLineNo">207</span>   * &lt;code&gt;c&lt;/code&gt;. Postcondition is that curChunk.get()<a name="line.207"></a>
-<span class="sourceLineNo">208</span>   * != c<a name="line.208"></a>
-<span class="sourceLineNo">209</span>   * @param c the chunk to retire<a name="line.209"></a>
-<span class="sourceLineNo">210</span>   * @return true if we won the race to retire the chunk<a name="line.210"></a>
-<span class="sourceLineNo">211</span>   */<a name="line.211"></a>
-<span class="sourceLineNo">212</span>  private void tryRetireChunk(Chunk c) {<a name="line.212"></a>
-<span class="sourceLineNo">213</span>    curChunk.compareAndSet(c, null);<a name="line.213"></a>
-<span class="sourceLineNo">214</span>    // If the CAS succeeds, that means that we won the race<a name="line.214"></a>
-<span class="sourceLineNo">215</span>    // to retire the chunk. We could use this opportunity to<a name="line.215"></a>
-<span class="sourceLineNo">216</span>    // update metrics on external fragmentation.<a name="line.216"></a>
-<span class="sourceLineNo">217</span>    //<a name="line.217"></a>
-<span class="sourceLineNo">218</span>    // If the CAS fails, that means that someone else already<a name="line.218"></a>
-<span class="sourceLineNo">219</span>    // retired the chunk for us.<a name="line.219"></a>
-<span class="sourceLineNo">220</span>  }<a name="line.220"></a>
-<span class="sourceLineNo">221</span><a name="line.221"></a>
-<span class="sourceLineNo">222</span>  /**<a name="line.222"></a>
-<span class="sourceLineNo">223</span>   * Get the current chunk, or, if there is no current chunk,<a name="line.223"></a>
-<span class="sourceLineNo">224</span>   * allocate a new one from the JVM.<a name="line.224"></a>
-<span class="sourceLineNo">225</span>   */<a name="line.225"></a>
-<span class="sourceLineNo">226</span>  private Chunk getOrMakeChunk() {<a name="line.226"></a>
-<span class="sourceLineNo">227</span>    // Try to get the chunk<a name="line.227"></a>
-<span class="sourceLineNo">228</span>    Chunk c = curChunk.get();<a name="line.228"></a>
-<span class="sourceLineNo">229</span>    if (c != null) {<a name="line.229"></a>
-<span class="sourceLineNo">230</span>      return c;<a name="line.230"></a>
+<span class="sourceLineNo">189</span>   * Get the current chunk, or, if there is no current chunk,<a name="line.189"></a>
+<span class="sourceLineNo">190</span>   * allocate a new one from the JVM.<a name="line.190"></a>
+<span class="sourceLineNo">191</span>   */<a name="line.191"></a>
+<span class="sourceLineNo">192</span>  private Chunk getOrMakeChunk() {<a name="line.192"></a>
+<span class="sourceLineNo">193</span>    while (true) {<a name="line.193"></a>
+<span class="sourceLineNo">194</span>      // Try to get the chunk<a name="line.194"></a>
+<span class="sourceLineNo">195</span>      Chunk c = curChunk.get();<a name="line.195"></a>
+<span class="sourceLineNo">196</span>      if (c != null) {<a name="line.196"></a>
+<span class="sourceLineNo">197</span>        return c;<a name="line.197"></a>
+<span class="sourceLineNo">198</span>      }<a name="line.198"></a>
+<span class="sourceLineNo">199</span><a name="line.199"></a>
+<span class="sourceLineNo">200</span>      // No current chunk, so we want to allocate one. We race<a name="line.200"></a>
+<span class="sourceLineNo">201</span>      // against other allocators to CAS in an uninitialized chunk<a name="line.201"></a>
+<span class="sourceLineNo">202</span>      // (which is cheap to allocate)<a name="line.202"></a>
+<span class="sourceLineNo">203</span>      if (chunkPool != null) {<a name="line.203"></a>
+<span class="sourceLineNo">204</span>        c = chunkPool.getChunk();<a name="line.204"></a>
+<span class="sourceLineNo">205</span>      }<a name="line.205"></a>
+<span class="sourceLineNo">206</span>      boolean pooledChunk = false;<a name="line.206"></a>
+<span class="sourceLineNo">207</span>      if (c != null) {<a name="line.207"></a>
+<span class="sourceLineNo">208</span>        // This is chunk from pool<a name="line.208"></a>
+<span class="sourceLineNo">209</span>        pooledChunk = true;<a name="line.209"></a>
+<span class="sourceLineNo">210</span>      } else {<a name="line.210"></a>
+<span class="sourceLineNo">211</span>        c = new OnheapChunk(chunkSize);// When chunk is not from pool, always make it as on heap.<a name="line.211"></a>
+<span class="sourceLineNo">212</span>      }<a name="line.212"></a>
+<span class="sourceLineNo">213</span>      if (curChunk.compareAndSet(null, c)) {<a name="line.213"></a>
+<span class="sourceLineNo">214</span>        // we won race - now we need to actually do the expensive<a name="line.214"></a>
+<span class="sourceLineNo">215</span>        // allocation step<a name="line.215"></a>
+<span class="sourceLineNo">216</span>        c.init();<a name="line.216"></a>
+<span class="sourceLineNo">217</span>        if (pooledChunk) {<a name="line.217"></a>
+<span class="sourceLineNo">218</span>          if (!this.closed &amp;&amp; !this.pooledChunkQueue.offer(c)) {<a name="line.218"></a>
+<span class="sourceLineNo">219</span>            if (LOG.isTraceEnabled()) {<a name="line.219"></a>
+<span class="sourceLineNo">220</span>              LOG.trace("Chunk queue is full, won't reuse this new chunk. Current queue size: "<a name="line.220"></a>
+<span class="sourceLineNo">221</span>                  + pooledChunkQueue.size());<a name="line.221"></a>
+<span class="sourceLineNo">222</span>            }<a name="line.222"></a>
+<span class="sourceLineNo">223</span>          }<a name="line.223"></a>
+<span class="sourceLineNo">224</span>        }<a name="line.224"></a>
+<span class="sourceLineNo">225</span>        return c;<a name="line.225"></a>
+<span class="sourceLineNo">226</span>      } else if (pooledChunk) {<a name="line.226"></a>
+<span class="sourceLineNo">227</span>        chunkPool.putbackChunk(c);<a name="line.227"></a>
+<span class="sourceLineNo">228</span>      }<a name="line.228"></a>
+<span class="sourceLineNo">229</span>      // someone else won race - that's fine, we'll try to grab theirs<a name="line.229"></a>
+<span class="sourceLineNo">230</span>      // in the next iteration of the loop.<a name="line.230"></a>
 <span class="sourceLineNo">231</span>    }<a name="line.231"></a>
-<span class="sourceLineNo">232</span>    // No current chunk, so we want to allocate one. We race<a name="line.232"></a>
-<span class="sourceLineNo">233</span>    // against other allocators to CAS in an uninitialized chunk<a name="line.233"></a>
-<span class="sourceLineNo">234</span>    // (which is cheap to allocate)<a name="line.234"></a>
-<span class="sourceLineNo">235</span>    if (lock.tryLock()) {<a name="line.235"></a>
-<span class="sourceLineNo">236</span>      try {<a name="line.236"></a>
-<span class="sourceLineNo">237</span>        // once again check inside the lock<a name="line.237"></a>
-<span class="sourceLineNo">238</span>        c = curChunk.get();<a name="line.238"></a>
-<span class="sourceLineNo">239</span>        if (c != null) {<a name="line.239"></a>
-<span class="sourceLineNo">240</span>          return c;<a name="line.240"></a>
-<span class="sourceLineNo">241</span>        }<a name="line.241"></a>
-<span class="sourceLineNo">242</span>        c = this.chunkCreator.getChunk();<a name="line.242"></a>
-<span class="sourceLineNo">243</span>        if (c != null) {<a name="line.243"></a>
-<span class="sourceLineNo">244</span>          // set the curChunk. No need of CAS as only one thread will be here<a name="line.244"></a>
-<span class="sourceLineNo">245</span>          curChunk.set(c);<a name="line.245"></a>
-<span class="sourceLineNo">246</span>          chunks.add(c.getId());<a name="line.246"></a>
-<span class="sourceLineNo">247</span>          return c;<a name="line.247"></a>
-<span class="sourceLineNo">248</span>        }<a name="line.248"></a>
-<span class="sourceLineNo">249</span>      } finally {<a name="line.249"></a>
-<span class="sourceLineNo">250</span>        lock.unlock();<a name="line.250"></a>
-<span class="sourceLineNo">251</span>      }<a name="line.251"></a>
-<span class="sourceLineNo">252</span>    }<a name="line.252"></a>
-<span class="sourceLineNo">253</span>    return null;<a name="line.253"></a>
-<span class="sourceLineNo">254</span>  }<a name="line.254"></a>
-<span class="sourceLineNo">255</span><a name="line.255"></a>
-<span class="sourceLineNo">256</span>  @VisibleForTesting<a name="line.256"></a>
-<span class="sourceLineNo">257</span>  Chunk getCurrentChunk() {<a name="line.257"></a>
-<span class="sourceLineNo">258</span>    return this.curChunk.get();<a name="line.258"></a>
-<span class="sourceLineNo">259</span>  }<a name="line.259"></a>
-<span class="sourceLineNo">260</span><a name="line.260"></a>
-<span class="sourceLineNo">261</span>  @VisibleForTesting<a name="line.261"></a>
-<span class="sourceLineNo">262</span>  BlockingQueue&lt;Chunk&gt; getPooledChunks() {<a name="line.262"></a>
-<span class="sourceLineNo">263</span>    BlockingQueue&lt;Chunk&gt; pooledChunks = new LinkedBlockingQueue&lt;&gt;();<a name="line.263"></a>
-<span class="sourceLineNo">264</span>    for (Integer id : this.chunks) {<a name="line.264"></a>
-<span class="sourceLineNo">265</span>      Chunk chunk = chunkCreator.getChunk(id);<a name="line.265"></a>
-<span class="sourceLineNo">266</span>      if (chunk != null &amp;&amp; chunk.isFromPool()) {<a name="line.266"></a>
-<span class="sourceLineNo">267</span>        pooledChunks.add(chunk);<a name="line.267"></a>
-<span class="sourceLineNo">268</span>      }<a name="line.268"></a>
-<span class="sourceLineNo">269</span>    }<a name="line.269"></a>
-<span class="sourceLineNo">270</span>    return pooledChunks;<a name="line.270"></a>
-<span class="sourceLineNo">271</span>  }<a name="line.271"></a>
-<span class="sourceLineNo">272</span>}<a name="line.272"></a>
+<span class="sourceLineNo">232</span>  }<a name="line.232"></a>
+<span class="sourceLineNo">233</span><a name="line.233"></a>
+<span class="sourceLineNo">234</span>  @VisibleForTesting<a name="line.234"></a>
+<span class="sourceLineNo">235</span>  Chunk getCurrentChunk() {<a name="line.235"></a>
+<span class="sourceLineNo">236</span>    return this.curChunk.get();<a name="line.236"></a>
+<span class="sourceLineNo">237</span>  }<a name="line.237"></a>
+<span class="sourceLineNo">238</span><a name="line.238"></a>
+<span class="sourceLineNo">239</span><a name="line.239"></a>
+<span class="sourceLineNo">240</span>  BlockingQueue&lt;Chunk&gt; getPooledChunks() {<a name="line.240"></a>
+<span class="sourceLineNo">241</span>    return this.pooledChunkQueue;<a name="line.241"></a>
+<span class="sourceLineNo">242</span>  }<a name="line.242"></a>
+<span class="sourceLineNo">243</span>}<a name="line.243"></a>
 
 
 

http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2fcc2ae0/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/NoTagByteBufferChunkCell.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/NoTagByteBufferChunkCell.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/NoTagByteBufferChunkCell.html
deleted file mode 100644
index 33f863d..0000000
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/NoTagByteBufferChunkCell.html
+++ /dev/null
@@ -1,120 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
-<html lang="en">
-<head>
-<title>Source code</title>
-<link rel="stylesheet" type="text/css" href="../../../../../../stylesheet.css" title="Style">
-</head>
-<body>
-<div class="sourceContainer">
-<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a>
-<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
-<span class="sourceLineNo">003</span> * or more contributor license agreements.  See the NOTICE file<a name="line.3"></a>
-<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a>
-<span class="sourceLineNo">005</span> * regarding copyright ownership.  The ASF licenses this file<a name="line.5"></a>
-<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a>
-<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a>
-<span class="sourceLineNo">008</span> * with the License.  You may obtain a copy of the License at<a name="line.8"></a>
-<span class="sourceLineNo">009</span> *<a name="line.9"></a>
-<span class="sourceLineNo">010</span> *     http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
-<span class="sourceLineNo">011</span> *<a name="line.11"></a>
-<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a>
-<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a>
-<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a>
-<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a>
-<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a>
-<span class="sourceLineNo">017</span> */<a name="line.17"></a>
-<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.regionserver;<a name="line.18"></a>
-<span class="sourceLineNo">019</span><a name="line.19"></a>
-<span class="sourceLineNo">020</span>import java.nio.ByteBuffer;<a name="line.20"></a>
-<span class="sourceLineNo">021</span><a name="line.21"></a>
-<span class="sourceLineNo">022</span>import org.apache.hadoop.hbase.NoTagsByteBufferKeyValue;<a name="line.22"></a>
-<span class="sourceLineNo">023</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.23"></a>
-<span class="sourceLineNo">024</span>import org.apache.hadoop.hbase.util.ByteBufferUtils;<a name="line.24"></a>
-<span class="sourceLineNo">025</span><a name="line.25"></a>
-<span class="sourceLineNo">026</span><a name="line.26"></a>
-<span class="sourceLineNo">027</span>/**<a name="line.27"></a>
-<span class="sourceLineNo">028</span> * ByteBuffer based cell which has the chunkid at the 0th offset and with no tags<a name="line.28"></a>
-<span class="sourceLineNo">029</span> * @see MemStoreLAB<a name="line.29"></a>
-<span class="sourceLineNo">030</span> */<a name="line.30"></a>
-<span class="sourceLineNo">031</span>@InterfaceAudience.Private<a name="line.31"></a>
-<span class="sourceLineNo">032</span>public class NoTagByteBufferChunkCell extends NoTagsByteBufferKeyValue {<a name="line.32"></a>
-<span class="sourceLineNo">033</span><a name="line.33"></a>
-<span class="sourceLineNo">034</span>  public NoTagByteBufferChunkCell(ByteBuffer buf, int offset, int length) {<a name="line.34"></a>
-<span class="sourceLineNo">035</span>    super(buf, offset, length);<a name="line.35"></a>
-<span class="sourceLineNo">036</span>  }<a name="line.36"></a>
-<span class="sourceLineNo">037</span><a name="line.37"></a>
-<span class="sourceLineNo">038</span>  public NoTagByteBufferChunkCell(ByteBuffer buf, int offset, int length, long seqId) {<a name="line.38"></a>
-<span class="sourceLineNo">039</span>    super(buf, offset, length, seqId);<a name="line.39"></a>
-<span class="sourceLineNo">040</span>  }<a name="line.40"></a>
-<span class="sourceLineNo">041</span><a name="line.41"></a>
-<span class="sourceLineNo">042</span>  @Override<a name="line.42"></a>
-<span class="sourceLineNo">043</span>  public int getChunkId() {<a name="line.43"></a>
-<span class="sourceLineNo">044</span>    // The chunkId is embedded at the 0th offset of the bytebuffer<a name="line.44"></a>
-<span class="sourceLineNo">045</span>    return ByteBufferUtils.toInt(buf, 0);<a name="line.45"></a>
-<span class="sourceLineNo">046</span>  }<a name="line.46"></a>
-<span class="sourceLineNo">047</span><a name="line.47"></a>
-<span class="sourceLineNo">048</span>}<a name="line.48"></a>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-</pre>
-</div>
-</body>
-</html>

http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2fcc2ae0/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OffheapChunk.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OffheapChunk.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OffheapChunk.html
index 6dde28b..fb25f3b 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OffheapChunk.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OffheapChunk.html
@@ -29,30 +29,37 @@
 <span class="sourceLineNo">021</span><a name="line.21"></a>
 <span class="sourceLineNo">022</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.22"></a>
 <span class="sourceLineNo">023</span><a name="line.23"></a>
-<span class="sourceLineNo">024</span>/**<a name="line.24"></a>
-<span class="sourceLineNo">025</span> * An off heap chunk implementation.<a name="line.25"></a>
-<span class="sourceLineNo">026</span> */<a name="line.26"></a>
-<span class="sourceLineNo">027</span>@InterfaceAudience.Private<a name="line.27"></a>
-<span class="sourceLineNo">028</span>public class OffheapChunk extends Chunk {<a name="line.28"></a>
-<span class="sourceLineNo">029</span><a name="line.29"></a>
-<span class="sourceLineNo">030</span>  OffheapChunk(int size, int id) {<a name="line.30"></a>
-<span class="sourceLineNo">031</span>    // better if this is always created fromPool. This should not be called<a name="line.31"></a>
-<span class="sourceLineNo">032</span>    super(size, id);<a name="line.32"></a>
-<span class="sourceLineNo">033</span>  }<a name="line.33"></a>
-<span class="sourceLineNo">034</span><a name="line.34"></a>
-<span class="sourceLineNo">035</span>  OffheapChunk(int size, int id, boolean fromPool) {<a name="line.35"></a>
-<span class="sourceLineNo">036</span>    super(size, id, fromPool);<a name="line.36"></a>
-<span class="sourceLineNo">037</span>    assert fromPool == true;<a name="line.37"></a>
-<span class="sourceLineNo">038</span>  }<a name="line.38"></a>
-<span class="sourceLineNo">039</span><a name="line.39"></a>
-<span class="sourceLineNo">040</span>  @Override<a name="line.40"></a>
-<span class="sourceLineNo">041</span>  void allocateDataBuffer() {<a name="line.41"></a>
-<span class="sourceLineNo">042</span>    if (data == null) {<a name="line.42"></a>
-<span class="sourceLineNo">043</span>      data = ByteBuffer.allocateDirect(this.size);<a name="line.43"></a>
-<span class="sourceLineNo">044</span>      data.putLong(0, this.getId());<a name="line.44"></a>
-<span class="sourceLineNo">045</span>    }<a name="line.45"></a>
-<span class="sourceLineNo">046</span>  }<a name="line.46"></a>
-<span class="sourceLineNo">047</span>}<a name="line.47"></a>
+<span class="sourceLineNo">024</span>import com.google.common.base.Preconditions;<a name="line.24"></a>
+<span class="sourceLineNo">025</span><a name="line.25"></a>
+<span class="sourceLineNo">026</span>/**<a name="line.26"></a>
+<span class="sourceLineNo">027</span> * An off heap chunk implementation.<a name="line.27"></a>
+<span class="sourceLineNo">028</span> */<a name="line.28"></a>
+<span class="sourceLineNo">029</span>@InterfaceAudience.Private<a name="line.29"></a>
+<span class="sourceLineNo">030</span>public class OffheapChunk extends Chunk {<a name="line.30"></a>
+<span class="sourceLineNo">031</span><a name="line.31"></a>
+<span class="sourceLineNo">032</span>  OffheapChunk(int size) {<a name="line.32"></a>
+<span class="sourceLineNo">033</span>    super(size);<a name="line.33"></a>
+<span class="sourceLineNo">034</span>  }<a name="line.34"></a>
+<span class="sourceLineNo">035</span><a name="line.35"></a>
+<span class="sourceLineNo">036</span>  @Override<a name="line.36"></a>
+<span class="sourceLineNo">037</span>  public void init() {<a name="line.37"></a>
+<span class="sourceLineNo">038</span>    assert nextFreeOffset.get() == UNINITIALIZED;<a name="line.38"></a>
+<span class="sourceLineNo">039</span>    try {<a name="line.39"></a>
+<span class="sourceLineNo">040</span>      if (data == null) {<a name="line.40"></a>
+<span class="sourceLineNo">041</span>        data = ByteBuffer.allocateDirect(this.size);<a name="line.41"></a>
+<span class="sourceLineNo">042</span>      }<a name="line.42"></a>
+<span class="sourceLineNo">043</span>    } catch (OutOfMemoryError e) {<a name="line.43"></a>
+<span class="sourceLineNo">044</span>      boolean failInit = nextFreeOffset.compareAndSet(UNINITIALIZED, OOM);<a name="line.44"></a>
+<span class="sourceLineNo">045</span>      assert failInit; // should be true.<a name="line.45"></a>
+<span class="sourceLineNo">046</span>      throw e;<a name="line.46"></a>
+<span class="sourceLineNo">047</span>    }<a name="line.47"></a>
+<span class="sourceLineNo">048</span>    // Mark that it's ready for use<a name="line.48"></a>
+<span class="sourceLineNo">049</span>    boolean initted = nextFreeOffset.compareAndSet(UNINITIALIZED, 0);<a name="line.49"></a>
+<span class="sourceLineNo">050</span>    // We should always succeed the above CAS since only one thread<a name="line.50"></a>
+<span class="sourceLineNo">051</span>    // calls init()!<a name="line.51"></a>
+<span class="sourceLineNo">052</span>    Preconditions.checkState(initted, "Multiple threads tried to init same chunk");<a name="line.52"></a>
+<span class="sourceLineNo">053</span>  }<a name="line.53"></a>
+<span class="sourceLineNo">054</span>}<a name="line.54"></a>
 
 
 

http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2fcc2ae0/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OnheapChunk.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OnheapChunk.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OnheapChunk.html
index a641c7f..9074b89 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OnheapChunk.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/OnheapChunk.html
@@ -29,28 +29,36 @@
 <span class="sourceLineNo">021</span><a name="line.21"></a>
 <span class="sourceLineNo">022</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.22"></a>
 <span class="sourceLineNo">023</span><a name="line.23"></a>
-<span class="sourceLineNo">024</span>/**<a name="line.24"></a>
-<span class="sourceLineNo">025</span> * An on heap chunk implementation.<a name="line.25"></a>
-<span class="sourceLineNo">026</span> */<a name="line.26"></a>
-<span class="sourceLineNo">027</span>@InterfaceAudience.Private<a name="line.27"></a>
-<span class="sourceLineNo">028</span>public class OnheapChunk extends Chunk {<a name="line.28"></a>
-<span class="sourceLineNo">029</span><a name="line.29"></a>
-<span class="sourceLineNo">030</span>  OnheapChunk(int size, int id) {<a name="line.30"></a>
-<span class="sourceLineNo">031</span>    super(size, id);<a name="line.31"></a>
-<span class="sourceLineNo">032</span>  }<a name="line.32"></a>
-<span class="sourceLineNo">033</span><a name="line.33"></a>
-<span class="sourceLineNo">034</span>  OnheapChunk(int size, int id, boolean fromPool) {<a name="line.34"></a>
-<span class="sourceLineNo">035</span>    super(size, id, fromPool);<a name="line.35"></a>
-<span class="sourceLineNo">036</span>  }<a name="line.36"></a>
-<span class="sourceLineNo">037</span><a name="line.37"></a>
-<span class="sourceLineNo">038</span>  @Override<a name="line.38"></a>
-<span class="sourceLineNo">039</span>  void allocateDataBuffer() {<a name="line.39"></a>
-<span class="sourceLineNo">040</span>    if (data == null) {<a name="line.40"></a>
-<span class="sourceLineNo">041</span>      data = ByteBuffer.allocate(this.size);<a name="line.41"></a>
-<span class="sourceLineNo">042</span>      data.putLong(0, this.getId());<a name="line.42"></a>
-<span class="sourceLineNo">043</span>    }<a name="line.43"></a>
-<span class="sourceLineNo">044</span>  }<a name="line.44"></a>
-<span class="sourceLineNo">045</span>}<a name="line.45"></a>
+<span class="sourceLineNo">024</span>import com.google.common.base.Preconditions;<a name="line.24"></a>
+<span class="sourceLineNo">025</span><a name="line.25"></a>
+<span class="sourceLineNo">026</span>/**<a name="line.26"></a>
+<span class="sourceLineNo">027</span> * An on heap chunk implementation.<a name="line.27"></a>
+<span class="sourceLineNo">028</span> */<a name="line.28"></a>
+<span class="sourceLineNo">029</span>@InterfaceAudience.Private<a name="line.29"></a>
+<span class="sourceLineNo">030</span>public class OnheapChunk extends Chunk {<a name="line.30"></a>
+<span class="sourceLineNo">031</span><a name="line.31"></a>
+<span class="sourceLineNo">032</span>  OnheapChunk(int size) {<a name="line.32"></a>
+<span class="sourceLineNo">033</span>    super(size);<a name="line.33"></a>
+<span class="sourceLineNo">034</span>  }<a name="line.34"></a>
+<span class="sourceLineNo">035</span><a name="line.35"></a>
+<span class="sourceLineNo">036</span>  public void init() {<a name="line.36"></a>
+<span class="sourceLineNo">037</span>    assert nextFreeOffset.get() == UNINITIALIZED;<a name="line.37"></a>
+<span class="sourceLineNo">038</span>    try {<a name="line.38"></a>
+<span class="sourceLineNo">039</span>      if (data == null) {<a name="line.39"></a>
+<span class="sourceLineNo">040</span>        data = ByteBuffer.allocate(this.size);<a name="line.40"></a>
+<span class="sourceLineNo">041</span>      }<a name="line.41"></a>
+<span class="sourceLineNo">042</span>    } catch (OutOfMemoryError e) {<a name="line.42"></a>
+<span class="sourceLineNo">043</span>      boolean failInit = nextFreeOffset.compareAndSet(UNINITIALIZED, OOM);<a name="line.43"></a>
+<span class="sourceLineNo">044</span>      assert failInit; // should be true.<a name="line.44"></a>
+<span class="sourceLineNo">045</span>      throw e;<a name="line.45"></a>
+<span class="sourceLineNo">046</span>    }<a name="line.46"></a>
+<span class="sourceLineNo">047</span>    // Mark that it's ready for use<a name="line.47"></a>
+<span class="sourceLineNo">048</span>    boolean initted = nextFreeOffset.compareAndSet(UNINITIALIZED, 0);<a name="line.48"></a>
+<span class="sourceLineNo">049</span>    // We should always succeed the above CAS since only one thread<a name="line.49"></a>
+<span class="sourceLineNo">050</span>    // calls init()!<a name="line.50"></a>
+<span class="sourceLineNo">051</span>    Preconditions.checkState(initted, "Multiple threads tried to init same chunk");<a name="line.51"></a>
+<span class="sourceLineNo">052</span>  }<a name="line.52"></a>
+<span class="sourceLineNo">053</span>}<a name="line.53"></a>
 
 
 


Mime
View raw message