http://git-wip-us.apache.org/repos/asf/hbase-site/blob/35decbe4/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html
----------------------------------------------------------------------
diff --git 
a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html 
b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html
index 073d380..9b39b6a 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html
@@ -93,94 +93,98 @@
 <span class="sourceLineNo">085</span>    return this.fromPool;<a 
name="line.85"></a>
 <span class="sourceLineNo">086</span>  }<a name="line.86"></a>
 <span class="sourceLineNo">087</span><a name="line.87"></a>
-<span class="sourceLineNo">088</span>  /**<a name="line.88"></a>
-<span class="sourceLineNo">089</span>   * Actually claim the memory for this 
chunk. This should only be called from the thread that<a name="line.89"></a>
-<span class="sourceLineNo">090</span>   * constructed the chunk. It is 
thread-safe against other threads calling alloc(), who will block<a 
name="line.90"></a>
-<span class="sourceLineNo">091</span>   * until the allocation is complete.<a 
name="line.91"></a>
-<span class="sourceLineNo">092</span>   */<a name="line.92"></a>
-<span class="sourceLineNo">093</span>  public void init() {<a 
name="line.93"></a>
-<span class="sourceLineNo">094</span>    assert nextFreeOffset.get() == 
UNINITIALIZED;<a name="line.94"></a>
-<span class="sourceLineNo">095</span>    try {<a name="line.95"></a>
-<span class="sourceLineNo">096</span>      allocateDataBuffer();<a 
name="line.96"></a>
-<span class="sourceLineNo">097</span>    } catch (OutOfMemoryError e) {<a 
name="line.97"></a>
-<span class="sourceLineNo">098</span>      boolean failInit = 
nextFreeOffset.compareAndSet(UNINITIALIZED, OOM);<a name="line.98"></a>
-<span class="sourceLineNo">099</span>      assert failInit; // should be 
true.<a name="line.99"></a>
-<span class="sourceLineNo">100</span>      throw e;<a name="line.100"></a>
-<span class="sourceLineNo">101</span>    }<a name="line.101"></a>
-<span class="sourceLineNo">102</span>    // Mark that it's ready for use<a 
name="line.102"></a>
-<span class="sourceLineNo">103</span>    // Move 4 bytes since the first 4 
bytes are having the chunkid in it<a name="line.103"></a>
-<span class="sourceLineNo">104</span>    boolean initted = 
nextFreeOffset.compareAndSet(UNINITIALIZED, Bytes.SIZEOF_INT);<a 
name="line.104"></a>
-<span class="sourceLineNo">105</span>    // We should always succeed the above 
CAS since only one thread<a name="line.105"></a>
-<span class="sourceLineNo">106</span>    // calls init()!<a 
name="line.106"></a>
-<span class="sourceLineNo">107</span>    Preconditions.checkState(initted, 
"Multiple threads tried to init same chunk");<a name="line.107"></a>
-<span class="sourceLineNo">108</span>  }<a name="line.108"></a>
-<span class="sourceLineNo">109</span><a name="line.109"></a>
-<span class="sourceLineNo">110</span>  abstract void allocateDataBuffer();<a 
name="line.110"></a>
-<span class="sourceLineNo">111</span><a name="line.111"></a>
-<span class="sourceLineNo">112</span>  /**<a name="line.112"></a>
-<span class="sourceLineNo">113</span>   * Reset the offset to UNINITIALIZED 
before before reusing an old chunk<a name="line.113"></a>
-<span class="sourceLineNo">114</span>   */<a name="line.114"></a>
-<span class="sourceLineNo">115</span>  void reset() {<a name="line.115"></a>
-<span class="sourceLineNo">116</span>    if (nextFreeOffset.get() != 
UNINITIALIZED) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span>      
nextFreeOffset.set(UNINITIALIZED);<a name="line.117"></a>
-<span class="sourceLineNo">118</span>      allocCount.set(0);<a 
name="line.118"></a>
-<span class="sourceLineNo">119</span>    }<a name="line.119"></a>
-<span class="sourceLineNo">120</span>  }<a name="line.120"></a>
-<span class="sourceLineNo">121</span><a name="line.121"></a>
-<span class="sourceLineNo">122</span>  /**<a name="line.122"></a>
-<span class="sourceLineNo">123</span>   * Try to allocate 
&lt;code&gt;size&lt;/code&gt; bytes from the chunk.<a name="line.123"></a>
-<span class="sourceLineNo">124</span>   * If a chunk is tried to get allocated 
before init() call, the thread doing the allocation<a name="line.124"></a>
-<span class="sourceLineNo">125</span>   * will be in busy-wait state as it 
will keep looping till the nextFreeOffset is set.<a name="line.125"></a>
-<span class="sourceLineNo">126</span>   * @return the offset of the successful 
allocation, or -1 to indicate not-enough-space<a name="line.126"></a>
-<span class="sourceLineNo">127</span>   */<a name="line.127"></a>
-<span class="sourceLineNo">128</span>  public int alloc(int size) {<a 
name="line.128"></a>
-<span class="sourceLineNo">129</span>    while (true) {<a name="line.129"></a>
-<span class="sourceLineNo">130</span>      int oldOffset = 
nextFreeOffset.get();<a name="line.130"></a>
-<span class="sourceLineNo">131</span>      if (oldOffset == UNINITIALIZED) {<a 
name="line.131"></a>
-<span class="sourceLineNo">132</span>        // The chunk doesn't have its 
data allocated yet.<a name="line.132"></a>
-<span class="sourceLineNo">133</span>        // Since we found this in 
curChunk, we know that whoever<a name="line.133"></a>
-<span class="sourceLineNo">134</span>        // CAS-ed it there is allocating 
it right now. So spin-loop<a name="line.134"></a>
-<span class="sourceLineNo">135</span>        // shouldn't spin long!<a 
name="line.135"></a>
-<span class="sourceLineNo">136</span>        Thread.yield();<a 
name="line.136"></a>
-<span class="sourceLineNo">137</span>        continue;<a name="line.137"></a>
-<span class="sourceLineNo">138</span>      }<a name="line.138"></a>
-<span class="sourceLineNo">139</span>      if (oldOffset == OOM) {<a 
name="line.139"></a>
-<span class="sourceLineNo">140</span>        // doh we ran out of ram. return 
-1 to chuck this away.<a name="line.140"></a>
-<span class="sourceLineNo">141</span>        return -1;<a name="line.141"></a>
+<span class="sourceLineNo">088</span>  boolean isJumbo() {<a 
name="line.88"></a>
+<span class="sourceLineNo">089</span>    return size &gt; 
ChunkCreator.getInstance().getChunkSize();<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>  /**<a name="line.92"></a>
+<span class="sourceLineNo">093</span>   * Actually claim the memory for this 
chunk. This should only be called from the thread that<a name="line.93"></a>
+<span class="sourceLineNo">094</span>   * constructed the chunk. It is 
thread-safe against other threads calling alloc(), who will block<a 
name="line.94"></a>
+<span class="sourceLineNo">095</span>   * until the allocation is complete.<a 
name="line.95"></a>
+<span class="sourceLineNo">096</span>   */<a name="line.96"></a>
+<span class="sourceLineNo">097</span>  public void init() {<a 
name="line.97"></a>
+<span class="sourceLineNo">098</span>    assert nextFreeOffset.get() == 
UNINITIALIZED;<a name="line.98"></a>
+<span class="sourceLineNo">099</span>    try {<a name="line.99"></a>
+<span class="sourceLineNo">100</span>      allocateDataBuffer();<a 
name="line.100"></a>
+<span class="sourceLineNo">101</span>    } catch (OutOfMemoryError e) {<a 
name="line.101"></a>
+<span class="sourceLineNo">102</span>      boolean failInit = 
nextFreeOffset.compareAndSet(UNINITIALIZED, OOM);<a name="line.102"></a>
+<span class="sourceLineNo">103</span>      assert failInit; // should be 
true.<a name="line.103"></a>
+<span class="sourceLineNo">104</span>      throw e;<a name="line.104"></a>
+<span class="sourceLineNo">105</span>    }<a name="line.105"></a>
+<span class="sourceLineNo">106</span>    // Mark that it's ready for use<a 
name="line.106"></a>
+<span class="sourceLineNo">107</span>    // Move 4 bytes since the first 4 
bytes are having the chunkid in it<a name="line.107"></a>
+<span class="sourceLineNo">108</span>    boolean initted = 
nextFreeOffset.compareAndSet(UNINITIALIZED, Bytes.SIZEOF_INT);<a 
name="line.108"></a>
+<span class="sourceLineNo">109</span>    // We should always succeed the above 
CAS since only one thread<a name="line.109"></a>
+<span class="sourceLineNo">110</span>    // calls init()!<a 
name="line.110"></a>
+<span class="sourceLineNo">111</span>    Preconditions.checkState(initted, 
"Multiple threads tried to init same chunk");<a name="line.111"></a>
+<span class="sourceLineNo">112</span>  }<a name="line.112"></a>
+<span class="sourceLineNo">113</span><a name="line.113"></a>
+<span class="sourceLineNo">114</span>  abstract void allocateDataBuffer();<a 
name="line.114"></a>
+<span class="sourceLineNo">115</span><a name="line.115"></a>
+<span class="sourceLineNo">116</span>  /**<a name="line.116"></a>
+<span class="sourceLineNo">117</span>   * Reset the offset to UNINITIALIZED 
before before reusing an old chunk<a name="line.117"></a>
+<span class="sourceLineNo">118</span>   */<a name="line.118"></a>
+<span class="sourceLineNo">119</span>  void reset() {<a name="line.119"></a>
+<span class="sourceLineNo">120</span>    if (nextFreeOffset.get() != 
UNINITIALIZED) {<a name="line.120"></a>
+<span class="sourceLineNo">121</span>      
nextFreeOffset.set(UNINITIALIZED);<a name="line.121"></a>
+<span class="sourceLineNo">122</span>      allocCount.set(0);<a 
name="line.122"></a>
+<span class="sourceLineNo">123</span>    }<a name="line.123"></a>
+<span class="sourceLineNo">124</span>  }<a name="line.124"></a>
+<span class="sourceLineNo">125</span><a name="line.125"></a>
+<span class="sourceLineNo">126</span>  /**<a name="line.126"></a>
+<span class="sourceLineNo">127</span>   * Try to allocate 
&lt;code&gt;size&lt;/code&gt; bytes from the chunk.<a name="line.127"></a>
+<span class="sourceLineNo">128</span>   * If a chunk is tried to get allocated 
before init() call, the thread doing the allocation<a name="line.128"></a>
+<span class="sourceLineNo">129</span>   * will be in busy-wait state as it 
will keep looping till the nextFreeOffset is set.<a name="line.129"></a>
+<span class="sourceLineNo">130</span>   * @return the offset of the successful 
allocation, or -1 to indicate not-enough-space<a name="line.130"></a>
+<span class="sourceLineNo">131</span>   */<a name="line.131"></a>
+<span class="sourceLineNo">132</span>  public int alloc(int size) {<a 
name="line.132"></a>
+<span class="sourceLineNo">133</span>    while (true) {<a name="line.133"></a>
+<span class="sourceLineNo">134</span>      int oldOffset = 
nextFreeOffset.get();<a name="line.134"></a>
+<span class="sourceLineNo">135</span>      if (oldOffset == UNINITIALIZED) {<a 
name="line.135"></a>
+<span class="sourceLineNo">136</span>        // The chunk doesn't have its 
data allocated yet.<a name="line.136"></a>
+<span class="sourceLineNo">137</span>        // Since we found this in 
curChunk, we know that whoever<a name="line.137"></a>
+<span class="sourceLineNo">138</span>        // CAS-ed it there is allocating 
it right now. So spin-loop<a name="line.138"></a>
+<span class="sourceLineNo">139</span>        // shouldn't spin long!<a 
name="line.139"></a>
+<span class="sourceLineNo">140</span>        Thread.yield();<a 
name="line.140"></a>
+<span class="sourceLineNo">141</span>        continue;<a name="line.141"></a>
 <span class="sourceLineNo">142</span>      }<a name="line.142"></a>
-<span class="sourceLineNo">143</span><a name="line.143"></a>
-<span class="sourceLineNo">144</span>      if (oldOffset + size &gt; 
data.capacity()) {<a name="line.144"></a>
-<span class="sourceLineNo">145</span>        return -1; // alloc doesn't fit<a 
name="line.145"></a>
+<span class="sourceLineNo">143</span>      if (oldOffset == OOM) {<a 
name="line.143"></a>
+<span class="sourceLineNo">144</span>        // doh we ran out of ram. return 
-1 to chuck this away.<a name="line.144"></a>
+<span class="sourceLineNo">145</span>        return -1;<a name="line.145"></a>
 <span class="sourceLineNo">146</span>      }<a name="line.146"></a>
-<span class="sourceLineNo">147</span>      // TODO : If seqID is to be written 
add 8 bytes here for nextFreeOFfset<a name="line.147"></a>
-<span class="sourceLineNo">148</span>      // Try to atomically claim this 
chunk<a name="line.148"></a>
-<span class="sourceLineNo">149</span>      if 
(nextFreeOffset.compareAndSet(oldOffset, oldOffset + size)) {<a 
name="line.149"></a>
-<span class="sourceLineNo">150</span>        // we got the alloc<a 
name="line.150"></a>
-<span class="sourceLineNo">151</span>        allocCount.incrementAndGet();<a 
name="line.151"></a>
-<span class="sourceLineNo">152</span>        return oldOffset;<a 
name="line.152"></a>
-<span class="sourceLineNo">153</span>      }<a name="line.153"></a>
-<span class="sourceLineNo">154</span>      // we raced and lost alloc, try 
again<a name="line.154"></a>
-<span class="sourceLineNo">155</span>    }<a name="line.155"></a>
-<span class="sourceLineNo">156</span>  }<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>   * @return This chunk's backing data.<a 
name="line.159"></a>
-<span class="sourceLineNo">160</span>   */<a name="line.160"></a>
-<span class="sourceLineNo">161</span>  ByteBuffer getData() {<a 
name="line.161"></a>
-<span class="sourceLineNo">162</span>    return this.data;<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>  @Override<a name="line.165"></a>
-<span class="sourceLineNo">166</span>  public String toString() {<a 
name="line.166"></a>
-<span class="sourceLineNo">167</span>    return "Chunk@" + 
System.identityHashCode(this) + " allocs=" + allocCount.get() + "waste="<a 
name="line.167"></a>
-<span class="sourceLineNo">168</span>        + (data.capacity() - 
nextFreeOffset.get());<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>  @VisibleForTesting<a 
name="line.171"></a>
-<span class="sourceLineNo">172</span>  int getNextFreeOffset() {<a 
name="line.172"></a>
-<span class="sourceLineNo">173</span>    return this.nextFreeOffset.get();<a 
name="line.173"></a>
-<span class="sourceLineNo">174</span>  }<a name="line.174"></a>
-<span class="sourceLineNo">175</span>}<a name="line.175"></a>
+<span class="sourceLineNo">147</span><a name="line.147"></a>
+<span class="sourceLineNo">148</span>      if (oldOffset + size &gt; 
data.capacity()) {<a name="line.148"></a>
+<span class="sourceLineNo">149</span>        return -1; // alloc doesn't fit<a 
name="line.149"></a>
+<span class="sourceLineNo">150</span>      }<a name="line.150"></a>
+<span class="sourceLineNo">151</span>      // TODO : If seqID is to be written 
add 8 bytes here for nextFreeOFfset<a name="line.151"></a>
+<span class="sourceLineNo">152</span>      // Try to atomically claim this 
chunk<a name="line.152"></a>
+<span class="sourceLineNo">153</span>      if 
(nextFreeOffset.compareAndSet(oldOffset, oldOffset + size)) {<a 
name="line.153"></a>
+<span class="sourceLineNo">154</span>        // we got the alloc<a 
name="line.154"></a>
+<span class="sourceLineNo">155</span>        allocCount.incrementAndGet();<a 
name="line.155"></a>
+<span class="sourceLineNo">156</span>        return oldOffset;<a 
name="line.156"></a>
+<span class="sourceLineNo">157</span>      }<a name="line.157"></a>
+<span class="sourceLineNo">158</span>      // we raced and lost alloc, try 
again<a name="line.158"></a>
+<span class="sourceLineNo">159</span>    }<a name="line.159"></a>
+<span class="sourceLineNo">160</span>  }<a name="line.160"></a>
+<span class="sourceLineNo">161</span><a name="line.161"></a>
+<span class="sourceLineNo">162</span>  /**<a name="line.162"></a>
+<span class="sourceLineNo">163</span>   * @return This chunk's backing data.<a 
name="line.163"></a>
+<span class="sourceLineNo">164</span>   */<a name="line.164"></a>
+<span class="sourceLineNo">165</span>  ByteBuffer getData() {<a 
name="line.165"></a>
+<span class="sourceLineNo">166</span>    return this.data;<a 
name="line.166"></a>
+<span class="sourceLineNo">167</span>  }<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 String toString() {<a 
name="line.170"></a>
+<span class="sourceLineNo">171</span>    return "Chunk@" + 
System.identityHashCode(this) + " allocs=" + allocCount.get() + "waste="<a 
name="line.171"></a>
+<span class="sourceLineNo">172</span>        + (data.capacity() - 
nextFreeOffset.get());<a name="line.172"></a>
+<span class="sourceLineNo">173</span>  }<a name="line.173"></a>
+<span class="sourceLineNo">174</span><a name="line.174"></a>
+<span class="sourceLineNo">175</span>  @VisibleForTesting<a 
name="line.175"></a>
+<span class="sourceLineNo">176</span>  int getNextFreeOffset() {<a 
name="line.176"></a>
+<span class="sourceLineNo">177</span>    return this.nextFreeOffset.get();<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>
 
 
 

http://git-wip-us.apache.org/repos/asf/hbase-site/blob/35decbe4/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ChunkCreator.MemStoreChunkPool.StatisticsThread.html
----------------------------------------------------------------------
diff --git 
a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ChunkCreator.MemStoreChunkPool.StatisticsThread.html
 
b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ChunkCreator.MemStoreChunkPool.StatisticsThread.html
index faa5693..157ecf3 100644
--- 
a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ChunkCreator.MemStoreChunkPool.StatisticsThread.html
+++ 
b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ChunkCreator.MemStoreChunkPool.StatisticsThread.html
@@ -118,338 +118,375 @@
 <span class="sourceLineNo">110</span>   * @return the chunk that was 
initialized<a name="line.110"></a>
 <span class="sourceLineNo">111</span>   */<a name="line.111"></a>
 <span class="sourceLineNo">112</span>  Chunk getChunk() {<a 
name="line.112"></a>
-<span class="sourceLineNo">113</span>    return 
getChunk(CompactingMemStore.IndexType.ARRAY_MAP);<a name="line.113"></a>
+<span class="sourceLineNo">113</span>    return 
getChunk(CompactingMemStore.IndexType.ARRAY_MAP, chunkSize);<a 
name="line.113"></a>
 <span class="sourceLineNo">114</span>  }<a name="line.114"></a>
 <span class="sourceLineNo">115</span><a name="line.115"></a>
 <span class="sourceLineNo">116</span>  /**<a name="line.116"></a>
-<span class="sourceLineNo">117</span>   * Creates and inits a chunk.<a 
name="line.117"></a>
+<span class="sourceLineNo">117</span>   * Creates and inits a chunk. The 
default implementation for specific index type.<a name="line.117"></a>
 <span class="sourceLineNo">118</span>   * @return the chunk that was 
initialized<a name="line.118"></a>
-<span class="sourceLineNo">119</span>   * @param chunkIndexType whether the 
requested chunk is going to be used with CellChunkMap index<a 
name="line.119"></a>
-<span class="sourceLineNo">120</span>   */<a name="line.120"></a>
-<span class="sourceLineNo">121</span>  Chunk 
getChunk(CompactingMemStore.IndexType chunkIndexType) {<a name="line.121"></a>
-<span class="sourceLineNo">122</span>    Chunk chunk = null;<a 
name="line.122"></a>
-<span class="sourceLineNo">123</span>    if (pool != null) {<a 
name="line.123"></a>
-<span class="sourceLineNo">124</span>      //  the pool creates the chunk 
internally. The chunk#init() call happens here<a name="line.124"></a>
-<span class="sourceLineNo">125</span>      chunk = this.pool.getChunk();<a 
name="line.125"></a>
-<span class="sourceLineNo">126</span>      // the pool has run out of 
maxCount<a name="line.126"></a>
-<span class="sourceLineNo">127</span>      if (chunk == null) {<a 
name="line.127"></a>
-<span class="sourceLineNo">128</span>        if (LOG.isTraceEnabled()) {<a 
name="line.128"></a>
-<span class="sourceLineNo">129</span>          LOG.trace("The chunk pool is 
full. Reached maxCount= " + this.pool.getMaxCount()<a name="line.129"></a>
-<span class="sourceLineNo">130</span>              + ". Creating chunk 
onheap.");<a name="line.130"></a>
-<span class="sourceLineNo">131</span>        }<a name="line.131"></a>
-<span class="sourceLineNo">132</span>      }<a name="line.132"></a>
-<span class="sourceLineNo">133</span>    }<a name="line.133"></a>
-<span class="sourceLineNo">134</span>    if (chunk == null) {<a 
name="line.134"></a>
-<span class="sourceLineNo">135</span>      // the second boolean parameter 
means:<a name="line.135"></a>
-<span class="sourceLineNo">136</span>      // if CellChunkMap index is 
requested, put allocated on demand chunk mapping into chunkIdMap<a 
name="line.136"></a>
-<span class="sourceLineNo">137</span>      chunk = createChunk(false, 
chunkIndexType);<a name="line.137"></a>
-<span class="sourceLineNo">138</span>    }<a name="line.138"></a>
-<span class="sourceLineNo">139</span><a name="line.139"></a>
-<span class="sourceLineNo">140</span>    // now we need to actually do the 
expensive memory allocation step in case of a new chunk,<a name="line.140"></a>
-<span class="sourceLineNo">141</span>    // else only the offset is set to the 
beginning of the chunk to accept allocations<a name="line.141"></a>
-<span class="sourceLineNo">142</span>    chunk.init();<a name="line.142"></a>
-<span class="sourceLineNo">143</span>    return chunk;<a name="line.143"></a>
-<span class="sourceLineNo">144</span>  }<a name="line.144"></a>
-<span class="sourceLineNo">145</span><a name="line.145"></a>
-<span class="sourceLineNo">146</span>  /**<a name="line.146"></a>
-<span class="sourceLineNo">147</span>   * Creates the chunk either onheap or 
offheap<a name="line.147"></a>
-<span class="sourceLineNo">148</span>   * @param pool indicates if the chunks 
have to be created which will be used by the Pool<a name="line.148"></a>
-<span class="sourceLineNo">149</span>   * @param chunkIndexType<a 
name="line.149"></a>
-<span class="sourceLineNo">150</span>   * @return the chunk<a 
name="line.150"></a>
-<span class="sourceLineNo">151</span>   */<a name="line.151"></a>
-<span class="sourceLineNo">152</span>  private Chunk createChunk(boolean pool, 
CompactingMemStore.IndexType chunkIndexType) {<a name="line.152"></a>
-<span class="sourceLineNo">153</span>    Chunk chunk = null;<a 
name="line.153"></a>
-<span class="sourceLineNo">154</span>    int id = chunkID.getAndIncrement();<a 
name="line.154"></a>
-<span class="sourceLineNo">155</span>    assert id &gt; 0;<a 
name="line.155"></a>
-<span class="sourceLineNo">156</span>    // do not create offheap chunk on 
demand<a name="line.156"></a>
-<span class="sourceLineNo">157</span>    if (pool &amp;&amp; this.offheap) {<a 
name="line.157"></a>
-<span class="sourceLineNo">158</span>      chunk = new OffheapChunk(chunkSize, 
id, pool);<a name="line.158"></a>
-<span class="sourceLineNo">159</span>    } else {<a name="line.159"></a>
-<span class="sourceLineNo">160</span>      chunk = new OnheapChunk(chunkSize, 
id, pool);<a name="line.160"></a>
-<span class="sourceLineNo">161</span>    }<a name="line.161"></a>
-<span class="sourceLineNo">162</span>    if (pool || (chunkIndexType == 
CompactingMemStore.IndexType.CHUNK_MAP)) {<a name="line.162"></a>
-<span class="sourceLineNo">163</span>      // put the pool chunk into the 
chunkIdMap so it is not GC-ed<a name="line.163"></a>
-<span class="sourceLineNo">164</span>      this.chunkIdMap.put(chunk.getId(), 
chunk);<a name="line.164"></a>
-<span class="sourceLineNo">165</span>    }<a name="line.165"></a>
-<span class="sourceLineNo">166</span>    return chunk;<a name="line.166"></a>
-<span class="sourceLineNo">167</span>  }<a name="line.167"></a>
-<span class="sourceLineNo">168</span><a name="line.168"></a>
-<span class="sourceLineNo">169</span>  @VisibleForTesting<a 
name="line.169"></a>
-<span class="sourceLineNo">170</span>  // Used to translate the ChunkID into a 
chunk ref<a name="line.170"></a>
-<span class="sourceLineNo">171</span>  Chunk getChunk(int id) {<a 
name="line.171"></a>
-<span class="sourceLineNo">172</span>    // can return null if chunk was never 
mapped<a name="line.172"></a>
-<span class="sourceLineNo">173</span>    return chunkIdMap.get(id);<a 
name="line.173"></a>
-<span class="sourceLineNo">174</span>  }<a name="line.174"></a>
-<span class="sourceLineNo">175</span><a name="line.175"></a>
-<span class="sourceLineNo">176</span>  int getChunkSize() {<a 
name="line.176"></a>
-<span class="sourceLineNo">177</span>    return this.chunkSize;<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>  boolean isOffheap() {<a 
name="line.180"></a>
-<span class="sourceLineNo">181</span>    return this.offheap;<a 
name="line.181"></a>
-<span class="sourceLineNo">182</span>  }<a name="line.182"></a>
-<span class="sourceLineNo">183</span><a name="line.183"></a>
-<span class="sourceLineNo">184</span>  private void 
removeChunks(Set&lt;Integer&gt; chunkIDs) {<a name="line.184"></a>
-<span class="sourceLineNo">185</span>    
this.chunkIdMap.keySet().removeAll(chunkIDs);<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>  Chunk removeChunk(int chunkId) {<a 
name="line.188"></a>
-<span class="sourceLineNo">189</span>    return 
this.chunkIdMap.remove(chunkId);<a name="line.189"></a>
-<span class="sourceLineNo">190</span>  }<a name="line.190"></a>
-<span class="sourceLineNo">191</span><a name="line.191"></a>
-<span class="sourceLineNo">192</span>  @VisibleForTesting<a 
name="line.192"></a>
-<span class="sourceLineNo">193</span>  // the chunks in the chunkIdMap may 
already be released so we shouldn't relay<a name="line.193"></a>
-<span class="sourceLineNo">194</span>  // on this counting for strong 
correctness. This method is used only in testing.<a name="line.194"></a>
-<span class="sourceLineNo">195</span>  int numberOfMappedChunks() {<a 
name="line.195"></a>
-<span class="sourceLineNo">196</span>    return this.chunkIdMap.size();<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>  @VisibleForTesting<a 
name="line.199"></a>
-<span class="sourceLineNo">200</span>  void clearChunkIds() {<a 
name="line.200"></a>
-<span class="sourceLineNo">201</span>    this.chunkIdMap.clear();<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 pool of {@link Chunk} instances.<a 
name="line.205"></a>
-<span class="sourceLineNo">206</span>   *<a name="line.206"></a>
-<span class="sourceLineNo">207</span>   * MemStoreChunkPool caches a number of 
retired chunks for reusing, it could<a name="line.207"></a>
-<span class="sourceLineNo">208</span>   * decrease allocating bytes when 
writing, thereby optimizing the garbage<a name="line.208"></a>
-<span class="sourceLineNo">209</span>   * collection on JVM.<a 
name="line.209"></a>
-<span class="sourceLineNo">210</span>   */<a name="line.210"></a>
-<span class="sourceLineNo">211</span>  private  class MemStoreChunkPool 
implements HeapMemoryTuneObserver {<a name="line.211"></a>
-<span class="sourceLineNo">212</span>    private int maxCount;<a 
name="line.212"></a>
-<span class="sourceLineNo">213</span><a name="line.213"></a>
-<span class="sourceLineNo">214</span>    // A queue of reclaimed chunks<a 
name="line.214"></a>
-<span class="sourceLineNo">215</span>    private final 
BlockingQueue&lt;Chunk&gt; reclaimedChunks;<a name="line.215"></a>
-<span class="sourceLineNo">216</span>    private final float 
poolSizePercentage;<a name="line.216"></a>
-<span class="sourceLineNo">217</span><a name="line.217"></a>
-<span class="sourceLineNo">218</span>    /** Statistics thread schedule pool 
*/<a name="line.218"></a>
-<span class="sourceLineNo">219</span>    private final 
ScheduledExecutorService scheduleThreadPool;<a name="line.219"></a>
-<span class="sourceLineNo">220</span>    /** Statistics thread */<a 
name="line.220"></a>
-<span class="sourceLineNo">221</span>    private static final int 
statThreadPeriod = 60 * 5;<a name="line.221"></a>
-<span class="sourceLineNo">222</span>    private final AtomicLong chunkCount = 
new AtomicLong();<a name="line.222"></a>
-<span class="sourceLineNo">223</span>    private final LongAdder 
reusedChunkCount = new LongAdder();<a name="line.223"></a>
+<span class="sourceLineNo">119</span>   */<a name="line.119"></a>
+<span class="sourceLineNo">120</span>  Chunk 
getChunk(CompactingMemStore.IndexType chunkIndexType) {<a name="line.120"></a>
+<span class="sourceLineNo">121</span>    return getChunk(chunkIndexType, 
chunkSize);<a name="line.121"></a>
+<span class="sourceLineNo">122</span>  }<a name="line.122"></a>
+<span class="sourceLineNo">123</span><a name="line.123"></a>
+<span class="sourceLineNo">124</span>  /**<a name="line.124"></a>
+<span class="sourceLineNo">125</span>   * Creates and inits a chunk.<a 
name="line.125"></a>
+<span class="sourceLineNo">126</span>   * @return the chunk that was 
initialized<a name="line.126"></a>
+<span class="sourceLineNo">127</span>   * @param chunkIndexType whether the 
requested chunk is going to be used with CellChunkMap index<a 
name="line.127"></a>
+<span class="sourceLineNo">128</span>   * @param size the size of the chunk to 
be allocated, in bytes<a name="line.128"></a>
+<span class="sourceLineNo">129</span>   */<a name="line.129"></a>
+<span class="sourceLineNo">130</span>  Chunk 
getChunk(CompactingMemStore.IndexType chunkIndexType, int size) {<a 
name="line.130"></a>
+<span class="sourceLineNo">131</span>    Chunk chunk = null;<a 
name="line.131"></a>
+<span class="sourceLineNo">132</span>    // if we have pool and this is not 
jumbo chunk (when size != chunkSize this is jumbo chunk)<a name="line.132"></a>
+<span class="sourceLineNo">133</span>    if ((pool != null) &amp;&amp; (size 
== chunkSize)) {<a name="line.133"></a>
+<span class="sourceLineNo">134</span>      //  the pool creates the chunk 
internally. The chunk#init() call happens here<a name="line.134"></a>
+<span class="sourceLineNo">135</span>      chunk = this.pool.getChunk();<a 
name="line.135"></a>
+<span class="sourceLineNo">136</span>      // the pool has run out of 
maxCount<a name="line.136"></a>
+<span class="sourceLineNo">137</span>      if (chunk == null) {<a 
name="line.137"></a>
+<span class="sourceLineNo">138</span>        if (LOG.isTraceEnabled()) {<a 
name="line.138"></a>
+<span class="sourceLineNo">139</span>          LOG.trace("The chunk pool is 
full. Reached maxCount= " + this.pool.getMaxCount()<a name="line.139"></a>
+<span class="sourceLineNo">140</span>              + ". Creating chunk 
onheap.");<a name="line.140"></a>
+<span class="sourceLineNo">141</span>        }<a name="line.141"></a>
+<span class="sourceLineNo">142</span>      }<a name="line.142"></a>
+<span class="sourceLineNo">143</span>    }<a name="line.143"></a>
+<span class="sourceLineNo">144</span>    if (chunk == null) {<a 
name="line.144"></a>
+<span class="sourceLineNo">145</span>      // the second parameter explains 
whether CellChunkMap index is requested,<a name="line.145"></a>
+<span class="sourceLineNo">146</span>      // in that case, put allocated on 
demand chunk mapping into chunkIdMap<a name="line.146"></a>
+<span class="sourceLineNo">147</span>      chunk = createChunk(false, 
chunkIndexType, size);<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>    // now we need to actually do the 
expensive memory allocation step in case of a new chunk,<a name="line.150"></a>
+<span class="sourceLineNo">151</span>    // else only the offset is set to the 
beginning of the chunk to accept allocations<a name="line.151"></a>
+<span class="sourceLineNo">152</span>    chunk.init();<a name="line.152"></a>
+<span class="sourceLineNo">153</span>    return chunk;<a name="line.153"></a>
+<span class="sourceLineNo">154</span>  }<a name="line.154"></a>
+<span class="sourceLineNo">155</span><a name="line.155"></a>
+<span class="sourceLineNo">156</span>  /**<a name="line.156"></a>
+<span class="sourceLineNo">157</span>   * Creates and inits a chunk of a 
special size, bigger than a regular chunk size.<a name="line.157"></a>
+<span class="sourceLineNo">158</span>   * Such a chunk will never come from 
pool and will always be on demand allocated.<a name="line.158"></a>
+<span class="sourceLineNo">159</span>   * @return the chunk that was 
initialized<a name="line.159"></a>
+<span class="sourceLineNo">160</span>   * @param chunkIndexType whether the 
requested chunk is going to be used with CellChunkMap index<a 
name="line.160"></a>
+<span class="sourceLineNo">161</span>   * @param jumboSize the special size to 
be used<a name="line.161"></a>
+<span class="sourceLineNo">162</span>   */<a name="line.162"></a>
+<span class="sourceLineNo">163</span>  Chunk 
getJumboChunk(CompactingMemStore.IndexType chunkIndexType, int jumboSize) {<a 
name="line.163"></a>
+<span class="sourceLineNo">164</span>    if (jumboSize &lt;= chunkSize) {<a 
name="line.164"></a>
+<span class="sourceLineNo">165</span>      LOG.warn("Jumbo chunk size " + 
jumboSize + " must be more than regular chunk size "<a name="line.165"></a>
+<span class="sourceLineNo">166</span>          + chunkSize + ". Converting to 
regular chunk.");<a name="line.166"></a>
+<span class="sourceLineNo">167</span>      
getChunk(chunkIndexType,chunkSize);<a name="line.167"></a>
+<span class="sourceLineNo">168</span>    }<a name="line.168"></a>
+<span class="sourceLineNo">169</span>    return getChunk(chunkIndexType, 
jumboSize);<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>  /**<a name="line.172"></a>
+<span class="sourceLineNo">173</span>   * Creates the chunk either onheap or 
offheap<a name="line.173"></a>
+<span class="sourceLineNo">174</span>   * @param pool indicates if the chunks 
have to be created which will be used by the Pool<a name="line.174"></a>
+<span class="sourceLineNo">175</span>   * @param chunkIndexType whether the 
requested chunk is going to be used with CellChunkMap index<a 
name="line.175"></a>
+<span class="sourceLineNo">176</span>   * @param size the size of the chunk to 
be allocated, in bytes<a name="line.176"></a>
+<span class="sourceLineNo">177</span>   * @return the chunk<a 
name="line.177"></a>
+<span class="sourceLineNo">178</span>   */<a name="line.178"></a>
+<span class="sourceLineNo">179</span>  private Chunk createChunk(boolean pool, 
CompactingMemStore.IndexType chunkIndexType, int size) {<a name="line.179"></a>
+<span class="sourceLineNo">180</span>    Chunk chunk = null;<a 
name="line.180"></a>
+<span class="sourceLineNo">181</span>    int id = chunkID.getAndIncrement();<a 
name="line.181"></a>
+<span class="sourceLineNo">182</span>    assert id &gt; 0;<a 
name="line.182"></a>
+<span class="sourceLineNo">183</span>    // do not create offheap chunk on 
demand<a name="line.183"></a>
+<span class="sourceLineNo">184</span>    if (pool &amp;&amp; this.offheap) {<a 
name="line.184"></a>
+<span class="sourceLineNo">185</span>      chunk = new OffheapChunk(size, id, 
pool);<a name="line.185"></a>
+<span class="sourceLineNo">186</span>    } else {<a name="line.186"></a>
+<span class="sourceLineNo">187</span>      chunk = new OnheapChunk(size, id, 
pool);<a name="line.187"></a>
+<span class="sourceLineNo">188</span>    }<a name="line.188"></a>
+<span class="sourceLineNo">189</span>    if (pool || (chunkIndexType == 
CompactingMemStore.IndexType.CHUNK_MAP)) {<a name="line.189"></a>
+<span class="sourceLineNo">190</span>      // put the pool chunk into the 
chunkIdMap so it is not GC-ed<a name="line.190"></a>
+<span class="sourceLineNo">191</span>      this.chunkIdMap.put(chunk.getId(), 
chunk);<a name="line.191"></a>
+<span class="sourceLineNo">192</span>    }<a name="line.192"></a>
+<span class="sourceLineNo">193</span>    return chunk;<a name="line.193"></a>
+<span class="sourceLineNo">194</span>  }<a name="line.194"></a>
+<span class="sourceLineNo">195</span><a name="line.195"></a>
+<span class="sourceLineNo">196</span>  // Chunks from pool are created covered 
with strong references anyway<a name="line.196"></a>
+<span class="sourceLineNo">197</span>  // TODO: change to CHUNK_MAP if it is 
generally defined<a name="line.197"></a>
+<span class="sourceLineNo">198</span>  private Chunk createChunkForPool() {<a 
name="line.198"></a>
+<span class="sourceLineNo">199</span>    return createChunk(true, 
CompactingMemStore.IndexType.ARRAY_MAP, chunkSize);<a name="line.199"></a>
+<span class="sourceLineNo">200</span>  }<a name="line.200"></a>
+<span class="sourceLineNo">201</span><a name="line.201"></a>
+<span class="sourceLineNo">202</span>  @VisibleForTesting<a 
name="line.202"></a>
+<span class="sourceLineNo">203</span>  // Used to translate the ChunkID into a 
chunk ref<a name="line.203"></a>
+<span class="sourceLineNo">204</span>  Chunk getChunk(int id) {<a 
name="line.204"></a>
+<span class="sourceLineNo">205</span>    // can return null if chunk was never 
mapped<a name="line.205"></a>
+<span class="sourceLineNo">206</span>    return chunkIdMap.get(id);<a 
name="line.206"></a>
+<span class="sourceLineNo">207</span>  }<a name="line.207"></a>
+<span class="sourceLineNo">208</span><a name="line.208"></a>
+<span class="sourceLineNo">209</span>  int getChunkSize() {<a 
name="line.209"></a>
+<span class="sourceLineNo">210</span>    return this.chunkSize;<a 
name="line.210"></a>
+<span class="sourceLineNo">211</span>  }<a name="line.211"></a>
+<span class="sourceLineNo">212</span><a name="line.212"></a>
+<span class="sourceLineNo">213</span>  boolean isOffheap() {<a 
name="line.213"></a>
+<span class="sourceLineNo">214</span>    return this.offheap;<a 
name="line.214"></a>
+<span class="sourceLineNo">215</span>  }<a name="line.215"></a>
+<span class="sourceLineNo">216</span><a name="line.216"></a>
+<span class="sourceLineNo">217</span>  private void 
removeChunks(Set&lt;Integer&gt; chunkIDs) {<a name="line.217"></a>
+<span class="sourceLineNo">218</span>    
this.chunkIdMap.keySet().removeAll(chunkIDs);<a name="line.218"></a>
+<span class="sourceLineNo">219</span>  }<a name="line.219"></a>
+<span class="sourceLineNo">220</span><a name="line.220"></a>
+<span class="sourceLineNo">221</span>  Chunk removeChunk(int chunkId) {<a 
name="line.221"></a>
+<span class="sourceLineNo">222</span>    return 
this.chunkIdMap.remove(chunkId);<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>    MemStoreChunkPool(int maxCount, int 
initialCount, float poolSizePercentage) {<a name="line.225"></a>
-<span class="sourceLineNo">226</span>      this.maxCount = maxCount;<a 
name="line.226"></a>
-<span class="sourceLineNo">227</span>      this.poolSizePercentage = 
poolSizePercentage;<a name="line.227"></a>
-<span class="sourceLineNo">228</span>      this.reclaimedChunks = new 
LinkedBlockingQueue&lt;&gt;();<a name="line.228"></a>
-<span class="sourceLineNo">229</span>      for (int i = 0; i &lt; 
initialCount; i++) {<a name="line.229"></a>
-<span class="sourceLineNo">230</span>        // Chunks from pool are covered 
with strong references anyway<a name="line.230"></a>
-<span class="sourceLineNo">231</span>        // TODO: change to CHUNK_MAP if 
it is generally defined<a name="line.231"></a>
-<span class="sourceLineNo">232</span>        Chunk chunk = createChunk(true, 
CompactingMemStore.IndexType.ARRAY_MAP);<a name="line.232"></a>
-<span class="sourceLineNo">233</span>        chunk.init();<a 
name="line.233"></a>
-<span class="sourceLineNo">234</span>        reclaimedChunks.add(chunk);<a 
name="line.234"></a>
-<span class="sourceLineNo">235</span>      }<a name="line.235"></a>
-<span class="sourceLineNo">236</span>      chunkCount.set(initialCount);<a 
name="line.236"></a>
-<span class="sourceLineNo">237</span>      final String n = 
Thread.currentThread().getName();<a name="line.237"></a>
-<span class="sourceLineNo">238</span>      scheduleThreadPool = 
Executors.newScheduledThreadPool(1, new ThreadFactoryBuilder()<a 
name="line.238"></a>
-<span class="sourceLineNo">239</span>          .setNameFormat(n + 
"-MemStoreChunkPool Statistics").setDaemon(true).build());<a 
name="line.239"></a>
-<span class="sourceLineNo">240</span>      
this.scheduleThreadPool.scheduleAtFixedRate(new StatisticsThread(), 
statThreadPeriod,<a name="line.240"></a>
-<span class="sourceLineNo">241</span>          statThreadPeriod, 
TimeUnit.SECONDS);<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>
-<span class="sourceLineNo">244</span>    /**<a name="line.244"></a>
-<span class="sourceLineNo">245</span>     * Poll a chunk from the pool, reset 
it if not null, else create a new chunk to return if we have<a 
name="line.245"></a>
-<span class="sourceLineNo">246</span>     * not yet created max allowed chunks 
count. When we have already created max allowed chunks and<a 
name="line.246"></a>
-<span class="sourceLineNo">247</span>     * no free chunks as of now, return 
null. It is the responsibility of the caller to make a chunk<a 
name="line.247"></a>
-<span class="sourceLineNo">248</span>     * then.<a name="line.248"></a>
-<span class="sourceLineNo">249</span>     * Note: Chunks returned by this pool 
must be put back to the pool after its use.<a name="line.249"></a>
-<span class="sourceLineNo">250</span>     * @return a chunk<a 
name="line.250"></a>
-<span class="sourceLineNo">251</span>     * @see #putbackChunks(Chunk)<a 
name="line.251"></a>
-<span class="sourceLineNo">252</span>     */<a name="line.252"></a>
-<span class="sourceLineNo">253</span>    Chunk getChunk() {<a 
name="line.253"></a>
-<span class="sourceLineNo">254</span>      Chunk chunk = 
reclaimedChunks.poll();<a name="line.254"></a>
-<span class="sourceLineNo">255</span>      if (chunk != null) {<a 
name="line.255"></a>
-<span class="sourceLineNo">256</span>        chunk.reset();<a 
name="line.256"></a>
-<span class="sourceLineNo">257</span>        reusedChunkCount.increment();<a 
name="line.257"></a>
-<span class="sourceLineNo">258</span>      } else {<a name="line.258"></a>
-<span class="sourceLineNo">259</span>        // Make a chunk iff we have not 
yet created the maxCount chunks<a name="line.259"></a>
-<span class="sourceLineNo">260</span>        while (true) {<a 
name="line.260"></a>
-<span class="sourceLineNo">261</span>          long created = 
this.chunkCount.get();<a name="line.261"></a>
-<span class="sourceLineNo">262</span>          if (created &lt; this.maxCount) 
{<a name="line.262"></a>
-<span class="sourceLineNo">263</span>            if 
(this.chunkCount.compareAndSet(created, created + 1)) {<a name="line.263"></a>
-<span class="sourceLineNo">264</span>              // TODO: change to 
CHUNK_MAP if it is generally defined<a name="line.264"></a>
-<span class="sourceLineNo">265</span>              chunk = createChunk(true, 
CompactingMemStore.IndexType.ARRAY_MAP);<a name="line.265"></a>
-<span class="sourceLineNo">266</span>              break;<a 
name="line.266"></a>
-<span class="sourceLineNo">267</span>            }<a name="line.267"></a>
-<span class="sourceLineNo">268</span>          } else {<a name="line.268"></a>
-<span class="sourceLineNo">269</span>            break;<a name="line.269"></a>
-<span class="sourceLineNo">270</span>          }<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">273</span>      return chunk;<a name="line.273"></a>
-<span class="sourceLineNo">274</span>    }<a name="line.274"></a>
-<span class="sourceLineNo">275</span><a name="line.275"></a>
-<span class="sourceLineNo">276</span>    /**<a name="line.276"></a>
-<span class="sourceLineNo">277</span>     * Add the chunks to the pool, when 
the pool achieves the max size, it will skip the remaining<a 
name="line.277"></a>
-<span class="sourceLineNo">278</span>     * chunks<a name="line.278"></a>
-<span class="sourceLineNo">279</span>     * @param c<a name="line.279"></a>
-<span class="sourceLineNo">280</span>     */<a name="line.280"></a>
-<span class="sourceLineNo">281</span>    private void putbackChunks(Chunk c) 
{<a name="line.281"></a>
-<span class="sourceLineNo">282</span>      int toAdd = this.maxCount - 
reclaimedChunks.size();<a name="line.282"></a>
-<span class="sourceLineNo">283</span>      if (c.isFromPool() &amp;&amp; toAdd 
&gt; 0) {<a name="line.283"></a>
-<span class="sourceLineNo">284</span>        reclaimedChunks.add(c);<a 
name="line.284"></a>
-<span class="sourceLineNo">285</span>      } else {<a name="line.285"></a>
-<span class="sourceLineNo">286</span>        // remove the chunk (that is not 
going to pool)<a name="line.286"></a>
-<span class="sourceLineNo">287</span>        // though it is initially from 
the pool or not<a name="line.287"></a>
-<span class="sourceLineNo">288</span>        
ChunkCreator.this.removeChunk(c.getId());<a name="line.288"></a>
-<span class="sourceLineNo">289</span>      }<a name="line.289"></a>
-<span class="sourceLineNo">290</span>    }<a name="line.290"></a>
-<span class="sourceLineNo">291</span><a name="line.291"></a>
-<span class="sourceLineNo">292</span>    private class StatisticsThread 
extends Thread {<a name="line.292"></a>
-<span class="sourceLineNo">293</span>      StatisticsThread() {<a 
name="line.293"></a>
-<span class="sourceLineNo">294</span>        
super("MemStoreChunkPool.StatisticsThread");<a name="line.294"></a>
-<span class="sourceLineNo">295</span>        setDaemon(true);<a 
name="line.295"></a>
-<span class="sourceLineNo">296</span>      }<a name="line.296"></a>
-<span class="sourceLineNo">297</span><a name="line.297"></a>
-<span class="sourceLineNo">298</span>      @Override<a name="line.298"></a>
-<span class="sourceLineNo">299</span>      public void run() {<a 
name="line.299"></a>
-<span class="sourceLineNo">300</span>        logStats();<a name="line.300"></a>
-<span class="sourceLineNo">301</span>      }<a name="line.301"></a>
-<span class="sourceLineNo">302</span><a name="line.302"></a>
-<span class="sourceLineNo">303</span>      private void logStats() {<a 
name="line.303"></a>
-<span class="sourceLineNo">304</span>        if (!LOG.isDebugEnabled()) 
return;<a name="line.304"></a>
-<span class="sourceLineNo">305</span>        long created = 
chunkCount.get();<a name="line.305"></a>
-<span class="sourceLineNo">306</span>        long reused = 
reusedChunkCount.sum();<a name="line.306"></a>
-<span class="sourceLineNo">307</span>        long total = created + reused;<a 
name="line.307"></a>
-<span class="sourceLineNo">308</span>        LOG.debug("Stats: current pool 
size=" + reclaimedChunks.size()<a name="line.308"></a>
-<span class="sourceLineNo">309</span>            + ",created chunk count=" + 
created<a name="line.309"></a>
-<span class="sourceLineNo">310</span>            + ",reused chunk count=" + 
reused<a name="line.310"></a>
-<span class="sourceLineNo">311</span>            + ",reuseRatio=" + (total == 
0 ? "0" : StringUtils.formatPercent(<a name="line.311"></a>
-<span class="sourceLineNo">312</span>                (float) reused / (float) 
total, 2)));<a name="line.312"></a>
-<span class="sourceLineNo">313</span>      }<a name="line.313"></a>
-<span class="sourceLineNo">314</span>    }<a name="line.314"></a>
-<span class="sourceLineNo">315</span><a name="line.315"></a>
-<span class="sourceLineNo">316</span>    private int getMaxCount() {<a 
name="line.316"></a>
-<span class="sourceLineNo">317</span>      return this.maxCount;<a 
name="line.317"></a>
-<span class="sourceLineNo">318</span>    }<a name="line.318"></a>
-<span class="sourceLineNo">319</span><a name="line.319"></a>
-<span class="sourceLineNo">320</span>    @Override<a name="line.320"></a>
-<span class="sourceLineNo">321</span>    public void onHeapMemoryTune(long 
newMemstoreSize, long newBlockCacheSize) {<a name="line.321"></a>
-<span class="sourceLineNo">322</span>      // don't do any tuning in case of 
offheap memstore<a name="line.322"></a>
-<span class="sourceLineNo">323</span>      if (isOffheap()) {<a 
name="line.323"></a>
-<span class="sourceLineNo">324</span>        LOG.warn("Not tuning the chunk 
pool as it is offheap");<a name="line.324"></a>
-<span class="sourceLineNo">325</span>        return;<a name="line.325"></a>
+<span class="sourceLineNo">225</span>  @VisibleForTesting<a 
name="line.225"></a>
+<span class="sourceLineNo">226</span>  // the chunks in the chunkIdMap may 
already be released so we shouldn't relay<a name="line.226"></a>
+<span class="sourceLineNo">227</span>  // on this counting for strong 
correctness. This method is used only in testing.<a name="line.227"></a>
+<span class="sourceLineNo">228</span>  int numberOfMappedChunks() {<a 
name="line.228"></a>
+<span class="sourceLineNo">229</span>    return this.chunkIdMap.size();<a 
name="line.229"></a>
+<span class="sourceLineNo">230</span>  }<a name="line.230"></a>
+<span class="sourceLineNo">231</span><a name="line.231"></a>
+<span class="sourceLineNo">232</span>  @VisibleForTesting<a 
name="line.232"></a>
+<span class="sourceLineNo">233</span>  void clearChunkIds() {<a 
name="line.233"></a>
+<span class="sourceLineNo">234</span>    this.chunkIdMap.clear();<a 
name="line.234"></a>
+<span class="sourceLineNo">235</span>  }<a name="line.235"></a>
+<span class="sourceLineNo">236</span><a name="line.236"></a>
+<span class="sourceLineNo">237</span>  /**<a name="line.237"></a>
+<span class="sourceLineNo">238</span>   * A pool of {@link Chunk} instances.<a 
name="line.238"></a>
+<span class="sourceLineNo">239</span>   *<a name="line.239"></a>
+<span class="sourceLineNo">240</span>   * MemStoreChunkPool caches a number of 
retired chunks for reusing, it could<a name="line.240"></a>
+<span class="sourceLineNo">241</span>   * decrease allocating bytes when 
writing, thereby optimizing the garbage<a name="line.241"></a>
+<span class="sourceLineNo">242</span>   * collection on JVM.<a 
name="line.242"></a>
+<span class="sourceLineNo">243</span>   */<a name="line.243"></a>
+<span class="sourceLineNo">244</span>  private  class MemStoreChunkPool 
implements HeapMemoryTuneObserver {<a name="line.244"></a>
+<span class="sourceLineNo">245</span>    private int maxCount;<a 
name="line.245"></a>
+<span class="sourceLineNo">246</span><a name="line.246"></a>
+<span class="sourceLineNo">247</span>    // A queue of reclaimed chunks<a 
name="line.247"></a>
+<span class="sourceLineNo">248</span>    private final 
BlockingQueue&lt;Chunk&gt; reclaimedChunks;<a name="line.248"></a>
+<span class="sourceLineNo">249</span>    private final float 
poolSizePercentage;<a name="line.249"></a>
+<span class="sourceLineNo">250</span><a name="line.250"></a>
+<span class="sourceLineNo">251</span>    /** Statistics thread schedule pool 
*/<a name="line.251"></a>
+<span class="sourceLineNo">252</span>    private final 
ScheduledExecutorService scheduleThreadPool;<a name="line.252"></a>
+<span class="sourceLineNo">253</span>    /** Statistics thread */<a 
name="line.253"></a>
+<span class="sourceLineNo">254</span>    private static final int 
statThreadPeriod = 60 * 5;<a name="line.254"></a>
+<span class="sourceLineNo">255</span>    private final AtomicLong chunkCount = 
new AtomicLong();<a name="line.255"></a>
+<span class="sourceLineNo">256</span>    private final LongAdder 
reusedChunkCount = new LongAdder();<a name="line.256"></a>
+<span class="sourceLineNo">257</span><a name="line.257"></a>
+<span class="sourceLineNo">258</span>    MemStoreChunkPool(int maxCount, int 
initialCount, float poolSizePercentage) {<a name="line.258"></a>
+<span class="sourceLineNo">259</span>      this.maxCount = maxCount;<a 
name="line.259"></a>
+<span class="sourceLineNo">260</span>      this.poolSizePercentage = 
poolSizePercentage;<a name="line.260"></a>
+<span class="sourceLineNo">261</span>      this.reclaimedChunks = new 
LinkedBlockingQueue&lt;&gt;();<a name="line.261"></a>
+<span class="sourceLineNo">262</span>      for (int i = 0; i &lt; 
initialCount; i++) {<a name="line.262"></a>
+<span class="sourceLineNo">263</span>        Chunk chunk = 
createChunkForPool();<a name="line.263"></a>
+<span class="sourceLineNo">264</span>        chunk.init();<a 
name="line.264"></a>
+<span class="sourceLineNo">265</span>        reclaimedChunks.add(chunk);<a 
name="line.265"></a>
+<span class="sourceLineNo">266</span>      }<a name="line.266"></a>
+<span class="sourceLineNo">267</span>      chunkCount.set(initialCount);<a 
name="line.267"></a>
+<span class="sourceLineNo">268</span>      final String n = 
Thread.currentThread().getName();<a name="line.268"></a>
+<span class="sourceLineNo">269</span>      scheduleThreadPool = 
Executors.newScheduledThreadPool(1, new ThreadFactoryBuilder()<a 
name="line.269"></a>
+<span class="sourceLineNo">270</span>          .setNameFormat(n + 
"-MemStoreChunkPool Statistics").setDaemon(true).build());<a 
name="line.270"></a>
+<span class="sourceLineNo">271</span>      
this.scheduleThreadPool.scheduleAtFixedRate(new StatisticsThread(), 
statThreadPeriod,<a name="line.271"></a>
+<span class="sourceLineNo">272</span>          statThreadPeriod, 
TimeUnit.SECONDS);<a name="line.272"></a>
+<span class="sourceLineNo">273</span>    }<a name="line.273"></a>
+<span class="sourceLineNo">274</span><a name="line.274"></a>
+<span class="sourceLineNo">275</span>    /**<a name="line.275"></a>
+<span class="sourceLineNo">276</span>     * Poll a chunk from the pool, reset 
it if not null, else create a new chunk to return if we have<a 
name="line.276"></a>
+<span class="sourceLineNo">277</span>     * not yet created max allowed chunks 
count. When we have already created max allowed chunks and<a 
name="line.277"></a>
+<span class="sourceLineNo">278</span>     * no free chunks as of now, return 
null. It is the responsibility of the caller to make a chunk<a 
name="line.278"></a>
+<span class="sourceLineNo">279</span>     * then.<a name="line.279"></a>
+<span class="sourceLineNo">280</span>     * Note: Chunks returned by this pool 
must be put back to the pool after its use.<a name="line.280"></a>
+<span class="sourceLineNo">281</span>     * @return a chunk<a 
name="line.281"></a>
+<span class="sourceLineNo">282</span>     * @see #putbackChunks(Chunk)<a 
name="line.282"></a>
+<span class="sourceLineNo">283</span>     */<a name="line.283"></a>
+<span class="sourceLineNo">284</span>    Chunk getChunk() {<a 
name="line.284"></a>
+<span class="sourceLineNo">285</span>      Chunk chunk = 
reclaimedChunks.poll();<a name="line.285"></a>
+<span class="sourceLineNo">286</span>      if (chunk != null) {<a 
name="line.286"></a>
+<span class="sourceLineNo">287</span>        chunk.reset();<a 
name="line.287"></a>
+<span class="sourceLineNo">288</span>        reusedChunkCount.increment();<a 
name="line.288"></a>
+<span class="sourceLineNo">289</span>      } else {<a name="line.289"></a>
+<span class="sourceLineNo">290</span>        // Make a chunk iff we have not 
yet created the maxCount chunks<a name="line.290"></a>
+<span class="sourceLineNo">291</span>        while (true) {<a 
name="line.291"></a>
+<span class="sourceLineNo">292</span>          long created = 
this.chunkCount.get();<a name="line.292"></a>
+<span class="sourceLineNo">293</span>          if (created &lt; this.maxCount) 
{<a name="line.293"></a>
+<span class="sourceLineNo">294</span>            if 
(this.chunkCount.compareAndSet(created, created + 1)) {<a name="line.294"></a>
+<span class="sourceLineNo">295</span>              chunk = 
createChunkForPool();<a name="line.295"></a>
+<span class="sourceLineNo">296</span>              break;<a 
name="line.296"></a>
+<span class="sourceLineNo">297</span>            }<a name="line.297"></a>
+<span class="sourceLineNo">298</span>          } else {<a name="line.298"></a>
+<span class="sourceLineNo">299</span>            break;<a name="line.299"></a>
+<span class="sourceLineNo">300</span>          }<a name="line.300"></a>
+<span class="sourceLineNo">301</span>        }<a name="line.301"></a>
+<span class="sourceLineNo">302</span>      }<a name="line.302"></a>
+<span class="sourceLineNo">303</span>      return chunk;<a name="line.303"></a>
+<span class="sourceLineNo">304</span>    }<a name="line.304"></a>
+<span class="sourceLineNo">305</span><a name="line.305"></a>
+<span class="sourceLineNo">306</span>    /**<a name="line.306"></a>
+<span class="sourceLineNo">307</span>     * Add the chunks to the pool, when 
the pool achieves the max size, it will skip the remaining<a 
name="line.307"></a>
+<span class="sourceLineNo">308</span>     * chunks<a name="line.308"></a>
+<span class="sourceLineNo">309</span>     * @param c<a name="line.309"></a>
+<span class="sourceLineNo">310</span>     */<a name="line.310"></a>
+<span class="sourceLineNo">311</span>    private void putbackChunks(Chunk c) 
{<a name="line.311"></a>
+<span class="sourceLineNo">312</span>      int toAdd = this.maxCount - 
reclaimedChunks.size();<a name="line.312"></a>
+<span class="sourceLineNo">313</span>      if (c.isFromPool() &amp;&amp; toAdd 
&gt; 0) {<a name="line.313"></a>
+<span class="sourceLineNo">314</span>        reclaimedChunks.add(c);<a 
name="line.314"></a>
+<span class="sourceLineNo">315</span>      } else {<a name="line.315"></a>
+<span class="sourceLineNo">316</span>        // remove the chunk (that is not 
going to pool)<a name="line.316"></a>
+<span class="sourceLineNo">317</span>        // though it is initially from 
the pool or not<a name="line.317"></a>
+<span class="sourceLineNo">318</span>        
ChunkCreator.this.removeChunk(c.getId());<a name="line.318"></a>
+<span class="sourceLineNo">319</span>      }<a name="line.319"></a>
+<span class="sourceLineNo">320</span>    }<a name="line.320"></a>
+<span class="sourceLineNo">321</span><a name="line.321"></a>
+<span class="sourceLineNo">322</span>    private class StatisticsThread 
extends Thread {<a name="line.322"></a>
+<span class="sourceLineNo">323</span>      StatisticsThread() {<a 
name="line.323"></a>
+<span class="sourceLineNo">324</span>        
super("MemStoreChunkPool.StatisticsThread");<a name="line.324"></a>
+<span class="sourceLineNo">325</span>        setDaemon(true);<a 
name="line.325"></a>
 <span class="sourceLineNo">326</span>      }<a name="line.326"></a>
-<span class="sourceLineNo">327</span>      int newMaxCount =<a 
name="line.327"></a>
-<span class="sourceLineNo">328</span>          (int) (newMemstoreSize * 
poolSizePercentage / getChunkSize());<a name="line.328"></a>
-<span class="sourceLineNo">329</span>      if (newMaxCount != this.maxCount) 
{<a name="line.329"></a>
-<span class="sourceLineNo">330</span>        // We need an adjustment in the 
chunks numbers<a name="line.330"></a>
-<span class="sourceLineNo">331</span>        if (newMaxCount &gt; 
this.maxCount) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span>          // Max chunks getting 
increased. Just change the variable. Later calls to getChunk() would<a 
name="line.332"></a>
-<span class="sourceLineNo">333</span>          // create and add them to Q<a 
name="line.333"></a>
-<span class="sourceLineNo">334</span>          LOG.info("Max count for chunks 
increased from " + this.maxCount + " to " + newMaxCount);<a name="line.334"></a>
-<span class="sourceLineNo">335</span>          this.maxCount = newMaxCount;<a 
name="line.335"></a>
-<span class="sourceLineNo">336</span>        } else {<a name="line.336"></a>
-<span class="sourceLineNo">337</span>          // Max chunks getting 
decreased. We may need to clear off some of the pooled chunks now<a 
name="line.337"></a>
-<span class="sourceLineNo">338</span>          // itself. If the extra chunks 
are serving already, do not pool those when we get them back<a 
name="line.338"></a>
-<span class="sourceLineNo">339</span>          LOG.info("Max count for chunks 
decreased from " + this.maxCount + " to " + newMaxCount);<a name="line.339"></a>
-<span class="sourceLineNo">340</span>          this.maxCount = newMaxCount;<a 
name="line.340"></a>
-<span class="sourceLineNo">341</span>          if (this.reclaimedChunks.size() 
&gt; newMaxCount) {<a name="line.341"></a>
-<span class="sourceLineNo">342</span>            synchronized (this) {<a 
name="line.342"></a>
-<span class="sourceLineNo">343</span>              while 
(this.reclaimedChunks.size() &gt; newMaxCount) {<a name="line.343"></a>
-<span class="sourceLineNo">344</span>                
this.reclaimedChunks.poll();<a name="line.344"></a>
-<span class="sourceLineNo">345</span>              }<a name="line.345"></a>
-<span class="sourceLineNo">346</span>            }<a name="line.346"></a>
-<span class="sourceLineNo">347</span>          }<a name="line.347"></a>
-<span class="sourceLineNo">348</span>        }<a name="line.348"></a>
-<span class="sourceLineNo">349</span>      }<a name="line.349"></a>
-<span class="sourceLineNo">350</span>    }<a name="line.350"></a>
-<span class="sourceLineNo">351</span>  }<a name="line.351"></a>
-<span class="sourceLineNo">352</span><a name="line.352"></a>
-<span class="sourceLineNo">353</span>  @VisibleForTesting<a 
name="line.353"></a>
-<span class="sourceLineNo">354</span>  static void clearDisableFlag() {<a 
name="line.354"></a>
-<span class="sourceLineNo">355</span>    chunkPoolDisabled = false;<a 
name="line.355"></a>
-<span class="sourceLineNo">356</span>  }<a name="line.356"></a>
-<span class="sourceLineNo">357</span><a name="line.357"></a>
-<span class="sourceLineNo">358</span>  private MemStoreChunkPool 
initializePool(long globalMemStoreSize, float poolSizePercentage,<a 
name="line.358"></a>
-<span class="sourceLineNo">359</span>      float initialCountPercentage) {<a 
name="line.359"></a>
-<span class="sourceLineNo">360</span>    if (poolSizePercentage &lt;= 0) {<a 
name="line.360"></a>
-<span class="sourceLineNo">361</span>      LOG.info("PoolSizePercentage is 
less than 0. So not using pool");<a name="line.361"></a>
-<span class="sourceLineNo">362</span>      return null;<a name="line.362"></a>
-<span class="sourceLineNo">363</span>    }<a name="line.363"></a>
-<span class="sourceLineNo">364</span>    if (chunkPoolDisabled) {<a 
name="line.364"></a>
-<span class="sourceLineNo">365</span>      return null;<a name="line.365"></a>
-<span class="sourceLineNo">366</span>    }<a name="line.366"></a>
-<span class="sourceLineNo">367</span>    if (poolSizePercentage &gt; 1.0) {<a 
name="line.367"></a>
-<span class="sourceLineNo">368</span>      throw new 
IllegalArgumentException(<a name="line.368"></a>
-<span class="sourceLineNo">369</span>          
MemStoreLAB.CHUNK_POOL_MAXSIZE_KEY + " must be between 0.0 and 1.0");<a 
name="line.369"></a>
-<span class="sourceLineNo">370</span>    }<a name="line.370"></a>
-<span class="sourceLineNo">371</span>    int maxCount = (int) 
(globalMemStoreSize * poolSizePercentage / getChunkSize());<a 
name="line.371"></a>
-<span class="sourceLineNo">372</span>    if (initialCountPercentage &gt; 1.0 
|| initialCountPercentage &lt; 0) {<a name="line.372"></a>
-<span class="sourceLineNo">373</span>      throw new 
IllegalArgumentException(<a name="line.373"></a>
-<span class="sourceLineNo">374</span>          
MemStoreLAB.CHUNK_POOL_INITIALSIZE_KEY + " must be between 0.0 and 1.0");<a 
name="line.374"></a>
-<span class="sourceLineNo">375</span>    }<a name="line.375"></a>
-<span class="sourceLineNo">376</span>    int initialCount = (int) 
(initialCountPercentage * maxCount);<a name="line.376"></a>
-<span class="sourceLineNo">377</span>    LOG.info("Allocating 
MemStoreChunkPool with chunk size "<a name="line.377"></a>
-<span class="sourceLineNo">378</span>        + 
StringUtils.byteDesc(getChunkSize()) + ", max count " + maxCount<a 
name="line.378"></a>
-<span class="sourceLineNo">379</span>        + ", initial count " + 
initialCount);<a name="line.379"></a>
-<span class="sourceLineNo">380</span>    return new 
MemStoreChunkPool(maxCount, initialCount, poolSizePercentage);<a 
name="line.380"></a>
+<span class="sourceLineNo">327</span><a name="line.327"></a>
+<span class="sourceLineNo">328</span>      @Override<a name="line.328"></a>
+<span class="sourceLineNo">329</span>      public void run() {<a 
name="line.329"></a>
+<span class="sourceLineNo">330</span>        logStats();<a name="line.330"></a>
+<span class="sourceLineNo">331</span>      }<a name="line.331"></a>
+<span class="sourceLineNo">332</span><a name="line.332"></a>
+<span class="sourceLineNo">333</span>      private void logStats() {<a 
name="line.333"></a>
+<span class="sourceLineNo">334</span>        if (!LOG.isDebugEnabled()) 
return;<a name="line.334"></a>
+<span class="sourceLineNo">335</span>        long created = 
chunkCount.get();<a name="line.335"></a>
+<span class="sourceLineNo">336</span>        long reused = 
reusedChunkCount.sum();<a name="line.336"></a>
+<span class="sourceLineNo">337</span>        long total = created + reused;<a 
name="line.337"></a>
+<span class="sourceLineNo">338</span>        LOG.debug("Stats: current pool 
size=" + reclaimedChunks.size()<a name="line.338"></a>
+<span class="sourceLineNo">339</span>            + ",created chunk count=" + 
created<a name="line.339"></a>
+<span class="sourceLineNo">340</span>            + ",reused chunk count=" + 
reused<a name="line.340"></a>
+<span class="sourceLineNo">341</span>            + ",reuseRatio=" + (total == 
0 ? "0" : StringUtils.formatPercent(<a name="line.341"></a>
+<span class="sourceLineNo">342</span>                (float) reused / (float) 
total, 2)));<a name="line.342"></a>
+<span class="sourceLineNo">343</span>      }<a name="line.343"></a>
+<span class="sourceLineNo">344</span>    }<a name="line.344"></a>
+<span class="sourceLineNo">345</span><a name="line.345"></a>
+<span class="sourceLineNo">346</span>    private int getMaxCount() {<a 
name="line.346"></a>
+<span class="sourceLineNo">347</span>      return this.maxCount;<a 
name="line.347"></a>
+<span class="sourceLineNo">348</span>    }<a name="line.348"></a>
+<span class="sourceLineNo">349</span><a name="line.349"></a>
+<span class="sourceLineNo">350</span>    @Override<a name="line.350"></a>
+<span class="sourceLineNo">351</span>    public void onHeapMemoryTune(long 
newMemstoreSize, long newBlockCacheSize) {<a name="line.351"></a>
+<span class="sourceLineNo">352</span>      // don't do any tuning in case of 
offheap memstore<a name="line.352"></a>
+<span class="sourceLineNo">353</span>      if (isOffheap()) {<a 
name="line.353"></a>
+<span class="sourceLineNo">354</span>        LOG.warn("Not tuning the chunk 
pool as it is offheap");<a name="line.354"></a>
+<span class="sourceLineNo">355</span>        return;<a name="line.355"></a>
+<span class="sourceLineNo">356</span>      }<a name="line.356"></a>
+<span class="sourceLineNo">357</span>      int newMaxCount =<a 
name="line.357"></a>
+<span class="sourceLineNo">358</span>          (int) (newMemstoreSize * 
poolSizePercentage / getChunkSize());<a name="line.358"></a>
+<span class="sourceLineNo">359</span>      if (newMaxCount != this.maxCount) 
{<a name="line.359"></a>
+<span class="sourceLineNo">360</span>        // We need an adjustment in the 
chunks numbers<a name="line.360"></a>
+<span class="sourceLineNo">361</span>        if (newMaxCount &gt; 
this.maxCount) {<a name="line.361"></a>
+<span class="sourceLineNo">362</span>          // Max chunks getting 
increased. Just change the variable. Later calls to getChunk() would<a 
name="line.362"></a>
+<span class="sourceLineNo">363</span>          // create and add them to Q<a 
name="line.363"></a>
+<span class="sourceLineNo">364</span>          LOG.info("Max count for chunks 
increased from " + this.maxCount + " to " + newMaxCount);<a name="line.364"></a>
+<span class="sourceLineNo">365</span>          this.maxCount = newMaxCount;<a 
name="line.365"></a>
+<span class="sourceLineNo">366</span>        } else {<a name="line.366"></a>
+<span class="sourceLineNo">367</span>          // Max chunks getting 
decreased. We may need to clear off some of the pooled chunks now<a 
name="line.367"></a>
+<span class="sourceLineNo">368</span>          // itself. If the extra chunks 
are serving already, do not pool those when we get them back<a 
name="line.368"></a>
+<span class="sourceLineNo">369</span>          LOG.info("Max count for chunks 
decreased from " + this.maxCount + " to " + newMaxCount);<a name="line.369"></a>
+<span class="sourceLineNo">370</span>          this.maxCount = newMaxCount;<a 
name="line.370"></a>
+<span class="sourceLineNo">371</span>          if (this.reclaimedChunks.size() 
&gt; newMaxCount) {<a name="line.371"></a>
+<span class="sourceLineNo">372</span>            synchronized (this) {<a 
name="line.372"></a>
+<span class="sourceLineNo">373</span>              while 
(this.reclaimedChunks.size() &gt; newMaxCount) {<a name="line.373"></a>
+<span class="sourceLineNo">374</span>                
this.reclaimedChunks.poll();<a name="line.374"></a>
+<span class="sourceLineNo">375</span>              }<a name="line.375"></a>
+<span class="sourceLineNo">376</span>            }<a name="line.376"></a>
+<span class="sourceLineNo">377</span>          }<a name="line.377"></a>
+<span class="sourceLineNo">378</span>        }<a name="line.378"></a>
+<span class="sourceLineNo">379</span>      }<a name="line.379"></a>
+<span class="sourceLineNo">380</span>    }<a name="line.380"></a>
 <span class="sourceLineNo">381</span>  }<a name="line.381"></a>
 <span class="sourceLineNo">382</span><a name="line.382"></a>
 <span class="sourceLineNo">383</span>  @VisibleForTesting<a 
name="line.383"></a>
-<span class="sourceLineNo">384</span>  int getMaxCount() {<a 
name="line.384"></a>
-<span class="sourceLineNo">385</span>    if (pool != null) {<a 
name="line.385"></a>
-<span class="sourceLineNo">386</span>      return pool.getMaxCount();<a 
name="line.386"></a>
-<span class="sourceLineNo">387</span>    }<a name="line.387"></a>
-<span class="sourceLineNo">388</span>    return 0;<a name="line.388"></a>
-<span class="sourceLineNo">389</span>  }<a name="line.389"></a>
-<span class="sourceLineNo">390</span><a name="line.390"></a>
-<span class="sourceLineNo">391</span>  @VisibleForTesting<a 
name="line.391"></a>
-<span class="sourceLineNo">392</span>  int getPoolSize() {<a 
name="line.392"></a>
-<span class="sourceLineNo">393</span>    if (pool != null) {<a 
name="line.393"></a>
-<span class="sourceLineNo">394</span>      return 
pool.reclaimedChunks.size();<a name="line.394"></a>
-<span class="sourceLineNo">395</span>    }<a name="line.395"></a>
-<span class="sourceLineNo">396</span>    return 0;<a name="line.396"></a>
-<span class="sourceLineNo">397</span>  }<a name="line.397"></a>
-<span class="sourceLineNo">398</span><a name="line.398"></a>
-<span class="sourceLineNo">399</span>  @VisibleForTesting<a 
name="line.399"></a>
-<span class="sourceLineNo">400</span>  boolean isChunkInPool(int chunkId) {<a 
name="line.400"></a>
-<span class="sourceLineNo">401</span>    if (pool != null) {<a 
name="line.401"></a>
-<span class="sourceLineNo">402</span>      // chunks that are from pool will 
return true chunk reference not null<a name="line.402"></a>
-<span class="sourceLineNo">403</span>      Chunk c = getChunk(chunkId);<a 
name="line.403"></a>
-<span class="sourceLineNo">404</span>      if (c==null) {<a 
name="line.404"></a>
-<span class="sourceLineNo">405</span>        return false;<a 
name="line.405"></a>
-<span class="sourceLineNo">406</span>      }<a name="line.406"></a>
-<span class="sourceLineNo">407</span>      return 
pool.reclaimedChunks.contains(c);<a name="line.407"></a>
-<span class="sourceLineNo">408</span>    }<a name="line.408"></a>
-<span class="sourceLineNo">409</span><a name="line.409"></a>
-<span class="sourceLineNo">410</span>    return false;<a name="line.410"></a>
+<span class="sourceLineNo">384</span>  static void clearDisableFlag() {<a 
name="line.384"></a>
+<span class="sourceLineNo">385</span>    chunkPoolDisabled = false;<a 
name="line.385"></a>
+<span class="sourceLineNo">386</span>  }<a name="line.386"></a>
+<span class="sourceLineNo">387</span><a name="line.387"></a>
+<span class="sourceLineNo">388</span>  private MemStoreChunkPool 
initializePool(long globalMemStoreSize, float poolSizePercentage,<a 
name="line.388"></a>
+<span class="sourceLineNo">389</span>      float initialCountPercentage) {<a 
name="line.389"></a>
+<span class="sourceLineNo">390</span>    if (poolSizePercentage &lt;= 0) {<a 
name="line.390"></a>
+<span class="sourceLineNo">391</span>      LOG.info("PoolSizePercentage is 
less than 0. So not using pool");<a name="line.391"></a>
+<span class="sourceLineNo">392</span>      return null;<a name="line.392"></a>
+<span class="sourceLineNo">393</span>    }<a name="line.393"></a>
+<span class="sourceLineNo">394</span>    if (chunkPoolDisabled) {<a 
name="line.394"></a>
+<span class="sourceLineNo">395</span>      return null;<a name="line.395"></a>
+<span class="sourceLineNo">396</span>    }<a name="line.396"></a>
+<span class="sourceLineNo">397</span>    if (poolSizePercentage &gt; 1.0) {<a 
name="line.397"></a>
+<span class="sourceLineNo">398</span>      throw new 
IllegalArgumentException(<a name="line.398"></a>
+<span class="sourceLineNo">399</span>          
MemStoreLAB.CHUNK_POOL_MAXSIZE_KEY + " must be between 0.0 and 1.0");<a 
name="line.399"></a>
+<span class="sourceLineNo">400</span>    }<a name="line.400"></a>
+<span class="sourceLineNo">401</span>    int maxCount = (int) 
(globalMemStoreSize * poolSizePercentage / getChunkSize());<a 
name="line.401"></a>
+<span class="sourceLineNo">402</span>    if (initialCountPercentage &gt; 1.0 
|| initialCountPercentage &lt; 0) {<a name="line.402"></a>
+<span class="sourceLineNo">403</span>      throw new 
IllegalArgumentException(<a name="line.403"></a>
+<span class="sourceLineNo">404</span>          
MemStoreLAB.CHUNK_POOL_INITIALSIZE_KEY + " must be between 0.0 and 1.0");<a 
name="line.404"></a>
+<span class="sourceLineNo">405</span>    }<a name="line.405"></a>
+<span class="sourceLineNo">406</span>    int initialCount = (int) 
(initialCountPercentage * maxCount);<a name="line.406"></a>
+<span class="sourceLineNo">407</span>    LOG.info("Allocating 
MemStoreChunkPool with chunk size "<a name="line.407"></a>
+<span class="sourceLineNo">408</span>        + 
StringUtils.byteDesc(getChunkSize()) + ", max count " + maxCount<a 
name="line.408"></a>
+<span class="sourceLineNo">409</span>        + ", initial count " + 
initialCount);<a name="line.409"></a>
+<span class="sourceLineNo">410</span>    return new 
MemStoreChunkPool(maxCount, initialCount, poolSizePercentage);<a 
name="line.410"></a>
 <span class="sourceLineNo">411</span>  }<a name="line.411"></a>
 <span class="sourceLineNo">412</span><a name="line.412"></a>
-<span class="sourceLineNo">413</span>  /*<a name="line.413"></a>
-<span class="sourceLineNo">414</span>   * Only used in testing<a 
name="line.414"></a>
-<span class="sourceLineNo">415</span>   */<a name="line.415"></a>
-<span class="sourceLineNo">416</span>  @VisibleForTesting<a 
name="line.416"></a>
-<span class="sourceLineNo">417</span>  void clearChunksInPool() {<a 
name="line.417"></a>
-<span class="sourceLineNo">418</span>    if (pool != null) {<a 
name="line.418"></a>
-<span class="sourceLineNo">419</span>      pool.reclaimedChunks.clear();<a 
name="line.419"></a>
-<span class="sourceLineNo">420</span>    }<a name="line.420"></a>
-<span class="sourceLineNo">421</span>  }<a name="line.421"></a>
-<span class="sourceLineNo">422</span><a name="line.422"></a>
-<span class="sourceLineNo">423</span>  synchronized void 
putbackChunks(Set&lt;Integer&gt; chunks) {<a name="line.423"></a>
-<span class="sourceLineNo">424</span>    // if there is no pool just try to 
clear the chunkIdMap in case there is something<a name="line.424"></a>
-<span class="sourceLineNo">425</span>    if ( pool == null ) {<a 
name="line.425"></a>
-<span class="sourceLineNo">426</span>      this.removeChunks(chunks);<a 
name="line.426"></a>
-<span class="sourceLineNo">427</span>      return;<a name="line.427"></a>
-<span class="sourceLineNo">428</span>    }<a name="line.428"></a>
-<span class="sourceLineNo">429</span><a name="line.429"></a>
-<span class="sourceLineNo">430</span>    // if there is pool, go over all 
chunk IDs that came back, the chunks may be from pool or not<a 
name="line.430"></a>
-<span class="sourceLineNo">431</span>    for (int chunkID : chunks) {<a 
name="line.431"></a>
-<span class="sourceLineNo">432</span>      // translate chunk ID to chunk, if 
chunk initially wasn't in pool<a name="line.432"></a>
-<span class="sourceLineNo">433</span>      // this translation will (most 
likely) return null<a name="line.433"></a>
-<span class="sourceLineNo">434</span>      Chunk chunk = 
ChunkCreator.this.getChunk(chunkID);<a name="line.434"></a>
-<span class="sourceLineNo">435</span>      if (chunk != null) {<a 
name="line.435"></a>
-<span class="sourceLineNo">436</span>        pool.putbackChunks(chunk);<a 
name="line.436"></a>
-<span class="sourceLineNo">437</span>      }<a name="line.437"></a>
-<span class="sourceLineNo">438</span>      // if chunk is null, it was never 
covered by the chunkIdMap (and so wasn't in pool also),<a name="line.438"></a>
-<span class="sourceLineNo">439</span>      // so we have nothing to do on its 
release<a name="line.439"></a>
-<span class="sourceLineNo">440</span>    }<a name="line.440"></a>
-<span class="sourceLineNo">441</span>    return;<a name="line.441"></a>
-<span class="sourceLineNo">442</span>  }<a name="line.442"></a>
-<span class="sourceLineNo">443</span><a name="line.443"></a>
-<span class="sourceLineNo">444</span>}<a name="line.444"></a>
+<span class="sourceLineNo">413</span>  @VisibleForTesting<a 
name="line.413"></a>
+<span class="sourceLineNo">414</span>  int getMaxCount() {<a 
name="line.414"></a>
+<span class="sourceLineNo">415</span>    if (pool != null) {<a 
name="line.415"></a>
+<span class="sourceLineNo">416</span>      return pool.getMaxCount();<a 
name="line.416"></a>
+<span class="sourceLineNo">417</span>    }<a name="line.417"></a>
+<span class="sourceLineNo">418</span>    return 0;<a name="line.418"></a>
+<span class="sourceLineNo">419</span>  }<a name="line.419"></a>
+<span class="sourceLineNo">420</span><a name="line.420"></a>
+<span class="sourceLineNo">421</span>  @VisibleForTesting<a 
name="line.421"></a>
+<span class="sourceLineNo">422</span>  int getPoolSize() {<a 
name="line.422"></a>
+<span class="sourceLineNo">423</span>    if (pool != null) {<a 
name="line.423"></a>
+<span class="sourceLineNo">424</span>      return 
pool.reclaimedChunks.size();<a name="line.424"></a>
+<span class="sourceLineNo">425</span>    }<a name="line.425"></a>
+<span class="sourceLineNo">426</span>    return 0;<a name="line.426"></a>
+<span class="sourceLineNo">427</span>  }<a name="line.427"></a>
+<span class="sourceLineNo">428</span><a name="line.428"></a>
+<span class="sourceLineNo">429</span>  @VisibleForTesting<a 
name="line.429"></a>
+<span class="sourceLineNo">430</span>  boolean isChunkInPool(int chunkId) {<a 
name="line.430"></a>
+<span class="sourceLineNo">431</span>    if (pool != null) {<a 
name="line.431"></a>
+<span class="sourceLineNo">432</span>      // chunks that are from pool will 
return true chunk reference not null<a name="line.432"></a>
+<span class="sourceLineNo">433</span>      Chunk c = getChunk(chunkId);<a 
name="line.433"></a>
+<span class="sourceLineNo">434</span>      if (c==null) {<a 
name="line.434"></a>
+<span class="sourceLineNo">435</span>        return false;<a 
name="line.435"></a>
+<span class="sourceLineNo">436</span>      }<a name="line.436"></a>
+<span class="sourceLineNo">437</span>      return 
pool.reclaimedChunks.contains(c);<a name="line.437"></a>
+<span class="sourceLineNo">438</span>    }<a name="line.438"></a>
+<span class="sourceLineNo">439</span><a name="line.439"></a>
+<span class="sourceLineNo">440</span>    return false;<a name="line.440"></a>
+<span class="sourceLineNo">441</span>  }<a name="line.441"></a>
+<span class="sourceLineNo">442</span><a name="line.442"></a>
+<span class="sourceLineNo">443</span>  /*<a name="line.443"></a>
+<span class="sourceLineNo">444</span>   * Only used in testing<a 
name="line.444"></a>
+<span class="sourceLineNo">445</span>   */<a name="line.445"></a>
+<span class="sourceLineNo">446</span>  @VisibleForTesting<a 
name="line.446"></a>
+<span class="sourceLineNo">447</span>  void clearChunksInPool() {<a 
name="line.447"></a>
+<span class="sourceLineNo">448</span>    if (pool != null) {<a 
name="line.448"></a>
+<span class="sourceLineNo">449</span>      pool.reclaimedChunks.clear();<a 
name="line.449"></a>
+<span class="sourceLineNo">450</span>    }<a name="line.450"></a>
+<span class="sourceLineNo">451</span>  }<a name="line.451"></a>
+<span class="sourceLineNo">452</span><a name="line.452"></a>
+<span class="sourceLineNo">453</span>  synchronized void 
putbackChunks(Set&lt;Integer&gt; chunks) {<a name="line.453"></a>
+<span class="sourceLineNo">454</span>    // if there is no pool just try to 
clear the chunkIdMap in case there is something<a name="line.454"></a>
+<span class="sourceLineNo">455</span>    if ( pool == null ) {<a 
name="line.455"></a>
+<span class="sourceLineNo">456</span>      this.removeChunks(chunks);<a 
name="line.456"></a>
+<span class="sourceLineNo">457</span>      return;<a name="line.457"></a>
+<span class="sourceLineNo">458</span>    }<a name="line.458"></a>
+<span class="sourceLineNo">459</span><a name="line.459"></a>
+<span class="sourceLineNo">460</span>    // if there is pool, go over all 
chunk IDs that came back, the chunks may be from pool or not<a 
name="line.460"></a>
+<span class="sourceLineNo">461</span>    for (int chunkID : chunks) {<a 
name="line.461"></a>
+<span class="sourceLineNo">462</span>      // translate chunk ID to chunk, if 
chunk initially wasn't in pool<a name="line.462"></a>
+<span class="sourceLineNo">463</span>      // this translation will (most 
likely) return null<a name="line.463"></a>
+<span class="sourceLineNo">464</span>      Chunk chunk = 
ChunkCreator.this.getChunk(chunkID);<a name="line.464"></a>
+<span class="sourceLineNo">465</span>      if (chunk != null) {<a 
name="line.465"></a>
+<span class="sourceLineNo">466</span>        // Jumbo chunks are covered with 
chunkIdMap, but are not from pool, so such a chunk should<a name="line.466"></a>
+<span class="sourceLineNo">467</span>        // be released here without going 
to pool.<a name="line.467"></a>
+<span class="sourceLineNo">468</span>        // Removing them from chunkIdMap 
will cause their removal by the GC.<a name="line.468"></a>
+<span class="sourceLineNo">469</span>        if (chunk.isJumbo()) {<a 
name="line.469"></a>
+<span class="sourceLineNo">470</span>          this.removeChunk(chunkID);<a 
name="line.470"></a>
+<span class="sourceLineNo">471</span>        } else {<a name="line.471"></a>
+<span class="sourceLineNo">472</span>          pool.putbackChunks(chunk);<a 
name="line.472"></a>
+<span class="sourceLineNo">473</span>        }<a name="line.473"></a>
+<span class="sourceLineNo">474</span>      }<a name="line.474"></a>
+<span class="sourceLineNo">475</span>      // if chunk is null, it was never 
covered by the chunkIdMap (and so wasn't in pool also),<a name="line.475"></a>
+<span class="sourceLineNo">476</span>      // so we have nothing to do on its 
release<a name="line.476"></a>
+<span class="sourceLineNo">477</span>    }<a name="line.477"></a>
+<span class="sourceLineNo">478</span>    return;<a name="line.478"></a>
+<span class="sourceLineNo">479</span>  }<a name="line.479"></a>
+<span class="sourceLineNo">480</span><a name="line.480"></a>
+<span class="sourceLineNo">481</span>}<a name="line.481"></a>
 
 
 

Reply via email to