hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From git-site-r...@apache.org
Subject [21/51] [partial] hbase-site git commit: Published site at 82d554e3783372cc6b05489452c815b57c06f6cd.
Date Tue, 18 Apr 2017 14:58:59 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2fcc2ae0/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ByteBufferChunkCell.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ByteBufferChunkCell.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ByteBufferChunkCell.html
deleted file mode 100644
index 67aa657..0000000
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ByteBufferChunkCell.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.ByteBufferKeyValue;<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> * ByteBuffer based cell which has the chunkid at the 0th offset<a name="line.27"></a>
-<span class="sourceLineNo">028</span> * @see MemStoreLAB<a name="line.28"></a>
-<span class="sourceLineNo">029</span> */<a name="line.29"></a>
-<span class="sourceLineNo">030</span>//TODO : When moving this cell to CellChunkMap we will have the following things<a name="line.30"></a>
-<span class="sourceLineNo">031</span>// to be serialized<a name="line.31"></a>
-<span class="sourceLineNo">032</span>// chunkId (Integer) + offset (Integer) + length (Integer) + seqId (Long) = 20 bytes<a name="line.32"></a>
-<span class="sourceLineNo">033</span>@InterfaceAudience.Private<a name="line.33"></a>
-<span class="sourceLineNo">034</span>public class ByteBufferChunkCell extends ByteBufferKeyValue {<a name="line.34"></a>
-<span class="sourceLineNo">035</span>  public ByteBufferChunkCell(ByteBuffer buf, int offset, int length) {<a name="line.35"></a>
-<span class="sourceLineNo">036</span>    super(buf, offset, length);<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>  public ByteBufferChunkCell(ByteBuffer buf, int offset, int length, long seqId) {<a name="line.39"></a>
-<span class="sourceLineNo">040</span>    super(buf, offset, length, seqId);<a name="line.40"></a>
-<span class="sourceLineNo">041</span>  }<a name="line.41"></a>
-<span class="sourceLineNo">042</span><a name="line.42"></a>
-<span class="sourceLineNo">043</span>  @Override<a name="line.43"></a>
-<span class="sourceLineNo">044</span>  public int getChunkId() {<a name="line.44"></a>
-<span class="sourceLineNo">045</span>    // The chunkId is embedded at the 0th offset of the bytebuffer<a name="line.45"></a>
-<span class="sourceLineNo">046</span>    return ByteBufferUtils.toInt(buf, 0);<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/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 8ae42fe..ca76428 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/Chunk.html
@@ -29,158 +29,110 @@
 <span class="sourceLineNo">021</span>import java.util.concurrent.atomic.AtomicInteger;<a name="line.21"></a>
 <span class="sourceLineNo">022</span><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.Bytes;<a name="line.24"></a>
-<span class="sourceLineNo">025</span><a name="line.25"></a>
-<span class="sourceLineNo">026</span>import com.google.common.annotations.VisibleForTesting;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import com.google.common.base.Preconditions;<a name="line.27"></a>
-<span class="sourceLineNo">028</span><a name="line.28"></a>
-<span class="sourceLineNo">029</span>/**<a name="line.29"></a>
-<span class="sourceLineNo">030</span> * A chunk of memory out of which allocations are sliced.<a name="line.30"></a>
-<span class="sourceLineNo">031</span> */<a name="line.31"></a>
-<span class="sourceLineNo">032</span>@InterfaceAudience.Private<a name="line.32"></a>
-<span class="sourceLineNo">033</span>public abstract class Chunk {<a name="line.33"></a>
-<span class="sourceLineNo">034</span>  /** Actual underlying data */<a name="line.34"></a>
-<span class="sourceLineNo">035</span>  protected ByteBuffer data;<a name="line.35"></a>
-<span class="sourceLineNo">036</span><a name="line.36"></a>
-<span class="sourceLineNo">037</span>  protected static final int UNINITIALIZED = -1;<a name="line.37"></a>
-<span class="sourceLineNo">038</span>  protected static final int OOM = -2;<a name="line.38"></a>
-<span class="sourceLineNo">039</span>  /**<a name="line.39"></a>
-<span class="sourceLineNo">040</span>   * Offset for the next allocation, or the sentinel value -1 which implies that the chunk is still<a name="line.40"></a>
-<span class="sourceLineNo">041</span>   * uninitialized.<a name="line.41"></a>
-<span class="sourceLineNo">042</span>   */<a name="line.42"></a>
-<span class="sourceLineNo">043</span>  protected AtomicInteger nextFreeOffset = new AtomicInteger(UNINITIALIZED);<a name="line.43"></a>
-<span class="sourceLineNo">044</span><a name="line.44"></a>
-<span class="sourceLineNo">045</span>  /** Total number of allocations satisfied from this buffer */<a name="line.45"></a>
-<span class="sourceLineNo">046</span>  protected AtomicInteger allocCount = new AtomicInteger();<a name="line.46"></a>
-<span class="sourceLineNo">047</span><a name="line.47"></a>
-<span class="sourceLineNo">048</span>  /** Size of chunk in bytes */<a name="line.48"></a>
-<span class="sourceLineNo">049</span>  protected final int size;<a name="line.49"></a>
-<span class="sourceLineNo">050</span><a name="line.50"></a>
-<span class="sourceLineNo">051</span>  // The unique id associated with the chunk.<a name="line.51"></a>
-<span class="sourceLineNo">052</span>  private final int id;<a name="line.52"></a>
-<span class="sourceLineNo">053</span><a name="line.53"></a>
-<span class="sourceLineNo">054</span>  // indicates if the chunk is formed by ChunkCreator#MemstorePool<a name="line.54"></a>
-<span class="sourceLineNo">055</span>  private final boolean fromPool;<a name="line.55"></a>
-<span class="sourceLineNo">056</span><a name="line.56"></a>
-<span class="sourceLineNo">057</span>  /**<a name="line.57"></a>
-<span class="sourceLineNo">058</span>   * Create an uninitialized chunk. Note that memory is not allocated yet, so<a name="line.58"></a>
-<span class="sourceLineNo">059</span>   * this is cheap.<a name="line.59"></a>
-<span class="sourceLineNo">060</span>   * @param size in bytes<a name="line.60"></a>
-<span class="sourceLineNo">061</span>   * @param id the chunk id<a name="line.61"></a>
+<span class="sourceLineNo">024</span><a name="line.24"></a>
+<span class="sourceLineNo">025</span>import com.google.common.annotations.VisibleForTesting;<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> * A chunk of memory out of which allocations are sliced.<a name="line.28"></a>
+<span class="sourceLineNo">029</span> */<a name="line.29"></a>
+<span class="sourceLineNo">030</span>@InterfaceAudience.Private<a name="line.30"></a>
+<span class="sourceLineNo">031</span>public abstract class Chunk {<a name="line.31"></a>
+<span class="sourceLineNo">032</span>  /** Actual underlying data */<a name="line.32"></a>
+<span class="sourceLineNo">033</span>  protected ByteBuffer data;<a name="line.33"></a>
+<span class="sourceLineNo">034</span><a name="line.34"></a>
+<span class="sourceLineNo">035</span>  protected static final int UNINITIALIZED = -1;<a name="line.35"></a>
+<span class="sourceLineNo">036</span>  protected static final int OOM = -2;<a name="line.36"></a>
+<span class="sourceLineNo">037</span>  /**<a name="line.37"></a>
+<span class="sourceLineNo">038</span>   * Offset for the next allocation, or the sentinel value -1 which implies that the chunk is still<a name="line.38"></a>
+<span class="sourceLineNo">039</span>   * uninitialized.<a name="line.39"></a>
+<span class="sourceLineNo">040</span>   */<a name="line.40"></a>
+<span class="sourceLineNo">041</span>  protected AtomicInteger nextFreeOffset = new AtomicInteger(UNINITIALIZED);<a name="line.41"></a>
+<span class="sourceLineNo">042</span><a name="line.42"></a>
+<span class="sourceLineNo">043</span>  /** Total number of allocations satisfied from this buffer */<a name="line.43"></a>
+<span class="sourceLineNo">044</span>  protected AtomicInteger allocCount = new AtomicInteger();<a name="line.44"></a>
+<span class="sourceLineNo">045</span><a name="line.45"></a>
+<span class="sourceLineNo">046</span>  /** Size of chunk in bytes */<a name="line.46"></a>
+<span class="sourceLineNo">047</span>  protected final int size;<a name="line.47"></a>
+<span class="sourceLineNo">048</span><a name="line.48"></a>
+<span class="sourceLineNo">049</span>  /**<a name="line.49"></a>
+<span class="sourceLineNo">050</span>   * Create an uninitialized chunk. Note that memory is not allocated yet, so this is cheap.<a name="line.50"></a>
+<span class="sourceLineNo">051</span>   *<a name="line.51"></a>
+<span class="sourceLineNo">052</span>   * @param size in bytes<a name="line.52"></a>
+<span class="sourceLineNo">053</span>   */<a name="line.53"></a>
+<span class="sourceLineNo">054</span>  Chunk(int size) {<a name="line.54"></a>
+<span class="sourceLineNo">055</span>    this.size = size;<a name="line.55"></a>
+<span class="sourceLineNo">056</span>  }<a name="line.56"></a>
+<span class="sourceLineNo">057</span><a name="line.57"></a>
+<span class="sourceLineNo">058</span>  /**<a name="line.58"></a>
+<span class="sourceLineNo">059</span>   * Actually claim the memory for this chunk. This should only be called from the thread that<a name="line.59"></a>
+<span class="sourceLineNo">060</span>   * constructed the chunk. It is thread-safe against other threads calling alloc(), who will block<a name="line.60"></a>
+<span class="sourceLineNo">061</span>   * until the allocation is complete.<a name="line.61"></a>
 <span class="sourceLineNo">062</span>   */<a name="line.62"></a>
-<span class="sourceLineNo">063</span>  public Chunk(int size, int id) {<a name="line.63"></a>
-<span class="sourceLineNo">064</span>    this(size, id, false);<a name="line.64"></a>
-<span class="sourceLineNo">065</span>  }<a name="line.65"></a>
-<span class="sourceLineNo">066</span><a name="line.66"></a>
-<span class="sourceLineNo">067</span>  /**<a name="line.67"></a>
-<span class="sourceLineNo">068</span>   * Create an uninitialized chunk. Note that memory is not allocated yet, so<a name="line.68"></a>
-<span class="sourceLineNo">069</span>   * this is cheap.<a name="line.69"></a>
-<span class="sourceLineNo">070</span>   * @param size in bytes<a name="line.70"></a>
-<span class="sourceLineNo">071</span>   * @param id the chunk id<a name="line.71"></a>
-<span class="sourceLineNo">072</span>   * @param fromPool if the chunk is formed by pool<a name="line.72"></a>
-<span class="sourceLineNo">073</span>   */<a name="line.73"></a>
-<span class="sourceLineNo">074</span>  public Chunk(int size, int id, boolean fromPool) {<a name="line.74"></a>
-<span class="sourceLineNo">075</span>    this.size = size;<a name="line.75"></a>
-<span class="sourceLineNo">076</span>    this.id = id;<a name="line.76"></a>
-<span class="sourceLineNo">077</span>    this.fromPool = fromPool;<a name="line.77"></a>
-<span class="sourceLineNo">078</span>  }<a name="line.78"></a>
-<span class="sourceLineNo">079</span><a name="line.79"></a>
-<span class="sourceLineNo">080</span>  int getId() {<a name="line.80"></a>
-<span class="sourceLineNo">081</span>    return this.id;<a name="line.81"></a>
-<span class="sourceLineNo">082</span>  }<a name="line.82"></a>
-<span class="sourceLineNo">083</span><a name="line.83"></a>
-<span class="sourceLineNo">084</span>  boolean isFromPool() {<a name="line.84"></a>
-<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 8 bytes since the first 8 bytes are having the chunkid in it<a name="line.103"></a>
-<span class="sourceLineNo">104</span>    boolean initted = nextFreeOffset.compareAndSet(UNINITIALIZED, Bytes.SIZEOF_LONG);<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">063</span>  public abstract void init();<a name="line.63"></a>
+<span class="sourceLineNo">064</span><a name="line.64"></a>
+<span class="sourceLineNo">065</span>  /**<a name="line.65"></a>
+<span class="sourceLineNo">066</span>   * Reset the offset to UNINITIALIZED before before reusing an old chunk<a name="line.66"></a>
+<span class="sourceLineNo">067</span>   */<a name="line.67"></a>
+<span class="sourceLineNo">068</span>  void reset() {<a name="line.68"></a>
+<span class="sourceLineNo">069</span>    if (nextFreeOffset.get() != UNINITIALIZED) {<a name="line.69"></a>
+<span class="sourceLineNo">070</span>      nextFreeOffset.set(UNINITIALIZED);<a name="line.70"></a>
+<span class="sourceLineNo">071</span>      allocCount.set(0);<a name="line.71"></a>
+<span class="sourceLineNo">072</span>    }<a name="line.72"></a>
+<span class="sourceLineNo">073</span>  }<a name="line.73"></a>
+<span class="sourceLineNo">074</span><a name="line.74"></a>
+<span class="sourceLineNo">075</span>  /**<a name="line.75"></a>
+<span class="sourceLineNo">076</span>   * Try to allocate &lt;code&gt;size&lt;/code&gt; bytes from the chunk.<a name="line.76"></a>
+<span class="sourceLineNo">077</span>   *<a name="line.77"></a>
+<span class="sourceLineNo">078</span>   * @return the offset of the successful allocation, or -1 to indicate not-enough-space<a name="line.78"></a>
+<span class="sourceLineNo">079</span>   */<a name="line.79"></a>
+<span class="sourceLineNo">080</span>  public int alloc(int size) {<a name="line.80"></a>
+<span class="sourceLineNo">081</span>    while (true) {<a name="line.81"></a>
+<span class="sourceLineNo">082</span>      int oldOffset = nextFreeOffset.get();<a name="line.82"></a>
+<span class="sourceLineNo">083</span>      if (oldOffset == UNINITIALIZED) {<a name="line.83"></a>
+<span class="sourceLineNo">084</span>        // The chunk doesn't have its data allocated yet.<a name="line.84"></a>
+<span class="sourceLineNo">085</span>        // Since we found this in curChunk, we know that whoever<a name="line.85"></a>
+<span class="sourceLineNo">086</span>        // CAS-ed it there is allocating it right now. So spin-loop<a name="line.86"></a>
+<span class="sourceLineNo">087</span>        // shouldn't spin long!<a name="line.87"></a>
+<span class="sourceLineNo">088</span>        Thread.yield();<a name="line.88"></a>
+<span class="sourceLineNo">089</span>        continue;<a name="line.89"></a>
+<span class="sourceLineNo">090</span>      }<a name="line.90"></a>
+<span class="sourceLineNo">091</span>      if (oldOffset == OOM) {<a name="line.91"></a>
+<span class="sourceLineNo">092</span>        // doh we ran out of ram. return -1 to chuck this away.<a name="line.92"></a>
+<span class="sourceLineNo">093</span>        return -1;<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>      if (oldOffset + size &gt; data.capacity()) {<a name="line.96"></a>
+<span class="sourceLineNo">097</span>        return -1; // alloc doesn't fit<a name="line.97"></a>
+<span class="sourceLineNo">098</span>      }<a name="line.98"></a>
+<span class="sourceLineNo">099</span><a name="line.99"></a>
+<span class="sourceLineNo">100</span>      // Try to atomically claim this chunk<a name="line.100"></a>
+<span class="sourceLineNo">101</span>      if (nextFreeOffset.compareAndSet(oldOffset, oldOffset + size)) {<a name="line.101"></a>
+<span class="sourceLineNo">102</span>        // we got the alloc<a name="line.102"></a>
+<span class="sourceLineNo">103</span>        allocCount.incrementAndGet();<a name="line.103"></a>
+<span class="sourceLineNo">104</span>        return oldOffset;<a name="line.104"></a>
+<span class="sourceLineNo">105</span>      }<a name="line.105"></a>
+<span class="sourceLineNo">106</span>      // we raced and lost alloc, try again<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><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">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">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">110</span>  /**<a name="line.110"></a>
+<span class="sourceLineNo">111</span>   * @return This chunk's backing data.<a name="line.111"></a>
+<span class="sourceLineNo">112</span>   */<a name="line.112"></a>
+<span class="sourceLineNo">113</span>  ByteBuffer getData() {<a name="line.113"></a>
+<span class="sourceLineNo">114</span>    return this.data;<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>  @Override<a name="line.117"></a>
+<span class="sourceLineNo">118</span>  public String toString() {<a name="line.118"></a>
+<span class="sourceLineNo">119</span>    return "Chunk@" + System.identityHashCode(this) + " allocs=" + allocCount.get() + "waste="<a name="line.119"></a>
+<span class="sourceLineNo">120</span>        + (data.capacity() - nextFreeOffset.get());<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>  @VisibleForTesting<a name="line.123"></a>
+<span class="sourceLineNo">124</span>  int getNextFreeOffset() {<a name="line.124"></a>
+<span class="sourceLineNo">125</span>    return this.nextFreeOffset.get();<a name="line.125"></a>
+<span class="sourceLineNo">126</span>  }<a name="line.126"></a>
+<span class="sourceLineNo">127</span>}<a name="line.127"></a>
 
 
 

http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2fcc2ae0/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
deleted file mode 100644
index ffb6f14..0000000
--- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/ChunkCreator.MemStoreChunkPool.StatisticsThread.html
+++ /dev/null
@@ -1,476 +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>/**<a name="line.2"></a>
-<span class="sourceLineNo">003</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.3"></a>
-<span class="sourceLineNo">004</span> * or more contributor license agreements.  See the NOTICE file<a name="line.4"></a>
-<span class="sourceLineNo">005</span> * distributed with this work for additional information<a name="line.5"></a>
-<span class="sourceLineNo">006</span> * regarding copyright ownership.  The ASF licenses this file<a name="line.6"></a>
-<span class="sourceLineNo">007</span> * to you under the Apache License, Version 2.0 (the<a name="line.7"></a>
-<span class="sourceLineNo">008</span> * "License"); you may not use this file except in compliance<a name="line.8"></a>
-<span class="sourceLineNo">009</span> * with the License.  You may obtain a copy of the License at<a name="line.9"></a>
-<span class="sourceLineNo">010</span> *<a name="line.10"></a>
-<span class="sourceLineNo">011</span> *     http://www.apache.org/licenses/LICENSE-2.0<a name="line.11"></a>
-<span class="sourceLineNo">012</span> *<a name="line.12"></a>
-<span class="sourceLineNo">013</span> * Unless required by applicable law or agreed to in writing, software<a name="line.13"></a>
-<span class="sourceLineNo">014</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.14"></a>
-<span class="sourceLineNo">015</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.15"></a>
-<span class="sourceLineNo">016</span> * See the License for the specific language governing permissions and<a name="line.16"></a>
-<span class="sourceLineNo">017</span> * limitations under the License.<a name="line.17"></a>
-<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.lang.ref.SoftReference;<a name="line.21"></a>
-<span class="sourceLineNo">022</span>import java.util.Iterator;<a name="line.22"></a>
-<span class="sourceLineNo">023</span>import java.util.Map;<a name="line.23"></a>
-<span class="sourceLineNo">024</span>import java.util.Set;<a name="line.24"></a>
-<span class="sourceLineNo">025</span>import java.util.concurrent.BlockingQueue;<a name="line.25"></a>
-<span class="sourceLineNo">026</span>import java.util.concurrent.ConcurrentHashMap;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import java.util.concurrent.Executors;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import java.util.concurrent.LinkedBlockingQueue;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import java.util.concurrent.ScheduledExecutorService;<a name="line.29"></a>
-<span class="sourceLineNo">030</span>import java.util.concurrent.TimeUnit;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import java.util.concurrent.atomic.AtomicInteger;<a name="line.31"></a>
-<span class="sourceLineNo">032</span>import java.util.concurrent.atomic.AtomicLong;<a name="line.32"></a>
-<span class="sourceLineNo">033</span><a name="line.33"></a>
-<span class="sourceLineNo">034</span>import org.apache.commons.logging.Log;<a name="line.34"></a>
-<span class="sourceLineNo">035</span>import org.apache.commons.logging.LogFactory;<a name="line.35"></a>
-<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.36"></a>
-<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.regionserver.HeapMemoryManager.HeapMemoryTuneObserver;<a name="line.37"></a>
-<span class="sourceLineNo">038</span>import org.apache.hadoop.util.StringUtils;<a name="line.38"></a>
-<span class="sourceLineNo">039</span><a name="line.39"></a>
-<span class="sourceLineNo">040</span>import com.google.common.annotations.VisibleForTesting;<a name="line.40"></a>
-<span class="sourceLineNo">041</span>import com.google.common.util.concurrent.ThreadFactoryBuilder;<a name="line.41"></a>
-<span class="sourceLineNo">042</span><a name="line.42"></a>
-<span class="sourceLineNo">043</span>/**<a name="line.43"></a>
-<span class="sourceLineNo">044</span> * Does the management of memstoreLAB chunk creations. A monotonically incrementing id is associated<a name="line.44"></a>
-<span class="sourceLineNo">045</span> * with every chunk<a name="line.45"></a>
-<span class="sourceLineNo">046</span> */<a name="line.46"></a>
-<span class="sourceLineNo">047</span>@InterfaceAudience.Private<a name="line.47"></a>
-<span class="sourceLineNo">048</span>public class ChunkCreator {<a name="line.48"></a>
-<span class="sourceLineNo">049</span>  private final Log LOG = LogFactory.getLog(ChunkCreator.class);<a name="line.49"></a>
-<span class="sourceLineNo">050</span>  // monotonically increasing chunkid<a name="line.50"></a>
-<span class="sourceLineNo">051</span>  private AtomicInteger chunkID = new AtomicInteger(1);<a name="line.51"></a>
-<span class="sourceLineNo">052</span>  // maps the chunk against the monotonically increasing chunk id. We need to preserve the<a name="line.52"></a>
-<span class="sourceLineNo">053</span>  // natural ordering of the key<a name="line.53"></a>
-<span class="sourceLineNo">054</span>  // CellChunkMap creation should convert the soft ref to hard reference<a name="line.54"></a>
-<span class="sourceLineNo">055</span>  private Map&lt;Integer, SoftReference&lt;Chunk&gt;&gt; chunkIdMap =<a name="line.55"></a>
-<span class="sourceLineNo">056</span>      new ConcurrentHashMap&lt;Integer, SoftReference&lt;Chunk&gt;&gt;();<a name="line.56"></a>
-<span class="sourceLineNo">057</span>  private final int chunkSize;<a name="line.57"></a>
-<span class="sourceLineNo">058</span>  private final boolean offheap;<a name="line.58"></a>
-<span class="sourceLineNo">059</span>  @VisibleForTesting<a name="line.59"></a>
-<span class="sourceLineNo">060</span>  static ChunkCreator INSTANCE;<a name="line.60"></a>
-<span class="sourceLineNo">061</span>  @VisibleForTesting<a name="line.61"></a>
-<span class="sourceLineNo">062</span>  static boolean chunkPoolDisabled = false;<a name="line.62"></a>
-<span class="sourceLineNo">063</span>  private MemStoreChunkPool pool;<a name="line.63"></a>
-<span class="sourceLineNo">064</span><a name="line.64"></a>
-<span class="sourceLineNo">065</span>  @VisibleForTesting<a name="line.65"></a>
-<span class="sourceLineNo">066</span>  ChunkCreator(int chunkSize, boolean offheap, long globalMemStoreSize, float poolSizePercentage,<a name="line.66"></a>
-<span class="sourceLineNo">067</span>      float initialCountPercentage, HeapMemoryManager heapMemoryManager) {<a name="line.67"></a>
-<span class="sourceLineNo">068</span>    this.chunkSize = chunkSize;<a name="line.68"></a>
-<span class="sourceLineNo">069</span>    this.offheap = offheap;<a name="line.69"></a>
-<span class="sourceLineNo">070</span>    this.pool = initializePool(globalMemStoreSize, poolSizePercentage, initialCountPercentage);<a name="line.70"></a>
-<span class="sourceLineNo">071</span>    if (heapMemoryManager != null &amp;&amp; this.pool != null) {<a name="line.71"></a>
-<span class="sourceLineNo">072</span>      // Register with Heap Memory manager<a name="line.72"></a>
-<span class="sourceLineNo">073</span>      heapMemoryManager.registerTuneObserver(this.pool);<a name="line.73"></a>
-<span class="sourceLineNo">074</span>    }<a name="line.74"></a>
-<span class="sourceLineNo">075</span>  }<a name="line.75"></a>
-<span class="sourceLineNo">076</span><a name="line.76"></a>
-<span class="sourceLineNo">077</span>  /**<a name="line.77"></a>
-<span class="sourceLineNo">078</span>   * Initializes the instance of MSLABChunkCreator<a name="line.78"></a>
-<span class="sourceLineNo">079</span>   * @param chunkSize the chunkSize<a name="line.79"></a>
-<span class="sourceLineNo">080</span>   * @param offheap indicates if the chunk is to be created offheap or not<a name="line.80"></a>
-<span class="sourceLineNo">081</span>   * @param globalMemStoreSize  the global memstore size<a name="line.81"></a>
-<span class="sourceLineNo">082</span>   * @param poolSizePercentage pool size percentage<a name="line.82"></a>
-<span class="sourceLineNo">083</span>   * @param initialCountPercentage the initial count of the chunk pool if any<a name="line.83"></a>
-<span class="sourceLineNo">084</span>   * @param heapMemoryManager the heapmemory manager<a name="line.84"></a>
-<span class="sourceLineNo">085</span>   * @return singleton MSLABChunkCreator<a name="line.85"></a>
-<span class="sourceLineNo">086</span>   */<a name="line.86"></a>
-<span class="sourceLineNo">087</span>  @edu.umd.cs.findbugs.annotations.SuppressWarnings(value = "LI_LAZY_INIT_STATIC",<a name="line.87"></a>
-<span class="sourceLineNo">088</span>      justification = "Method is called by single thread at the starting of RS")<a name="line.88"></a>
-<span class="sourceLineNo">089</span>  @VisibleForTesting<a name="line.89"></a>
-<span class="sourceLineNo">090</span>  public static ChunkCreator initialize(int chunkSize, boolean offheap, long globalMemStoreSize,<a name="line.90"></a>
-<span class="sourceLineNo">091</span>      float poolSizePercentage, float initialCountPercentage, HeapMemoryManager heapMemoryManager) {<a name="line.91"></a>
-<span class="sourceLineNo">092</span>    if (INSTANCE != null) return INSTANCE;<a name="line.92"></a>
-<span class="sourceLineNo">093</span>    INSTANCE = new ChunkCreator(chunkSize, offheap, globalMemStoreSize, poolSizePercentage,<a name="line.93"></a>
-<span class="sourceLineNo">094</span>        initialCountPercentage, heapMemoryManager);<a name="line.94"></a>
-<span class="sourceLineNo">095</span>    return INSTANCE;<a name="line.95"></a>
-<span class="sourceLineNo">096</span>  }<a name="line.96"></a>
-<span class="sourceLineNo">097</span><a name="line.97"></a>
-<span class="sourceLineNo">098</span>  static ChunkCreator getInstance() {<a name="line.98"></a>
-<span class="sourceLineNo">099</span>    return INSTANCE;<a name="line.99"></a>
-<span class="sourceLineNo">100</span>  }<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>   * Creates and inits a chunk.<a name="line.103"></a>
-<span class="sourceLineNo">104</span>   * @return the chunk that was initialized<a name="line.104"></a>
-<span class="sourceLineNo">105</span>   */<a name="line.105"></a>
-<span class="sourceLineNo">106</span>  Chunk getChunk() {<a name="line.106"></a>
-<span class="sourceLineNo">107</span>    Chunk chunk = null;<a name="line.107"></a>
-<span class="sourceLineNo">108</span>    if (pool != null) {<a name="line.108"></a>
-<span class="sourceLineNo">109</span>      //  the pool creates the chunk internally. The chunk#init() call happens here<a name="line.109"></a>
-<span class="sourceLineNo">110</span>      chunk = this.pool.getChunk();<a name="line.110"></a>
-<span class="sourceLineNo">111</span>      // the pool has run out of maxCount<a name="line.111"></a>
-<span class="sourceLineNo">112</span>      if (chunk == null) {<a name="line.112"></a>
-<span class="sourceLineNo">113</span>        if (LOG.isTraceEnabled()) {<a name="line.113"></a>
-<span class="sourceLineNo">114</span>          LOG.trace("The chunk pool is full. Reached maxCount= " + this.pool.getMaxCount()<a name="line.114"></a>
-<span class="sourceLineNo">115</span>              + ". Creating chunk onheap.");<a name="line.115"></a>
-<span class="sourceLineNo">116</span>        }<a name="line.116"></a>
-<span class="sourceLineNo">117</span>      }<a name="line.117"></a>
-<span class="sourceLineNo">118</span>    }<a name="line.118"></a>
-<span class="sourceLineNo">119</span>    if (chunk == null) {<a name="line.119"></a>
-<span class="sourceLineNo">120</span>      chunk = createChunk();<a name="line.120"></a>
-<span class="sourceLineNo">121</span>    }<a name="line.121"></a>
-<span class="sourceLineNo">122</span>    // put this chunk into the chunkIdMap<a name="line.122"></a>
-<span class="sourceLineNo">123</span>    this.chunkIdMap.put(chunk.getId(), new SoftReference&lt;&gt;(chunk));<a name="line.123"></a>
-<span class="sourceLineNo">124</span>    // now we need to actually do the expensive memory allocation step in case of a new chunk,<a name="line.124"></a>
-<span class="sourceLineNo">125</span>    // else only the offset is set to the beginning of the chunk to accept allocations<a name="line.125"></a>
-<span class="sourceLineNo">126</span>    chunk.init();<a name="line.126"></a>
-<span class="sourceLineNo">127</span>    return chunk;<a name="line.127"></a>
-<span class="sourceLineNo">128</span>  }<a name="line.128"></a>
-<span class="sourceLineNo">129</span><a name="line.129"></a>
-<span class="sourceLineNo">130</span>  private Chunk createChunk() {<a name="line.130"></a>
-<span class="sourceLineNo">131</span>    return createChunk(false);<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>  /**<a name="line.134"></a>
-<span class="sourceLineNo">135</span>   * Creates the chunk either onheap or offheap<a name="line.135"></a>
-<span class="sourceLineNo">136</span>   * @param pool indicates if the chunks have to be created which will be used by the Pool<a name="line.136"></a>
-<span class="sourceLineNo">137</span>   * @return the chunk<a name="line.137"></a>
-<span class="sourceLineNo">138</span>   */<a name="line.138"></a>
-<span class="sourceLineNo">139</span>  private Chunk createChunk(boolean pool) {<a name="line.139"></a>
-<span class="sourceLineNo">140</span>    int id = chunkID.getAndIncrement();<a name="line.140"></a>
-<span class="sourceLineNo">141</span>    assert id &gt; 0;<a name="line.141"></a>
-<span class="sourceLineNo">142</span>    // do not create offheap chunk on demand<a name="line.142"></a>
-<span class="sourceLineNo">143</span>    if (pool &amp;&amp; this.offheap) {<a name="line.143"></a>
-<span class="sourceLineNo">144</span>      return new OffheapChunk(chunkSize, id, pool);<a name="line.144"></a>
-<span class="sourceLineNo">145</span>    } else {<a name="line.145"></a>
-<span class="sourceLineNo">146</span>      return new OnheapChunk(chunkSize, id, pool);<a name="line.146"></a>
-<span class="sourceLineNo">147</span>    }<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>  @VisibleForTesting<a name="line.150"></a>
-<span class="sourceLineNo">151</span>  // TODO : To be used by CellChunkMap<a name="line.151"></a>
-<span class="sourceLineNo">152</span>  Chunk getChunk(int id) {<a name="line.152"></a>
-<span class="sourceLineNo">153</span>    SoftReference&lt;Chunk&gt; ref = chunkIdMap.get(id);<a name="line.153"></a>
-<span class="sourceLineNo">154</span>    if (ref != null) {<a name="line.154"></a>
-<span class="sourceLineNo">155</span>      return ref.get();<a name="line.155"></a>
-<span class="sourceLineNo">156</span>    }<a name="line.156"></a>
-<span class="sourceLineNo">157</span>    return null;<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>  int getChunkSize() {<a name="line.160"></a>
-<span class="sourceLineNo">161</span>    return this.chunkSize;<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>  boolean isOffheap() {<a name="line.164"></a>
-<span class="sourceLineNo">165</span>    return this.offheap;<a name="line.165"></a>
-<span class="sourceLineNo">166</span>  }<a name="line.166"></a>
-<span class="sourceLineNo">167</span><a name="line.167"></a>
-<span class="sourceLineNo">168</span>  private void removeChunks(Set&lt;Integer&gt; chunkIDs) {<a name="line.168"></a>
-<span class="sourceLineNo">169</span>    this.chunkIdMap.keySet().removeAll(chunkIDs);<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>  Chunk removeChunk(int chunkId) {<a name="line.172"></a>
-<span class="sourceLineNo">173</span>    SoftReference&lt;Chunk&gt; ref = this.chunkIdMap.remove(chunkId);<a name="line.173"></a>
-<span class="sourceLineNo">174</span>    if (ref != null) {<a name="line.174"></a>
-<span class="sourceLineNo">175</span>      return ref.get();<a name="line.175"></a>
-<span class="sourceLineNo">176</span>    }<a name="line.176"></a>
-<span class="sourceLineNo">177</span>    return null;<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>  @VisibleForTesting<a name="line.180"></a>
-<span class="sourceLineNo">181</span>  int size() {<a name="line.181"></a>
-<span class="sourceLineNo">182</span>    return this.chunkIdMap.size();<a name="line.182"></a>
-<span class="sourceLineNo">183</span>  }<a name="line.183"></a>
-<span class="sourceLineNo">184</span><a name="line.184"></a>
-<span class="sourceLineNo">185</span>  @VisibleForTesting<a name="line.185"></a>
-<span class="sourceLineNo">186</span>  void clearChunkIds() {<a name="line.186"></a>
-<span class="sourceLineNo">187</span>    this.chunkIdMap.clear();<a name="line.187"></a>
-<span class="sourceLineNo">188</span>  }<a name="line.188"></a>
-<span class="sourceLineNo">189</span><a name="line.189"></a>
-<span class="sourceLineNo">190</span>  /**<a name="line.190"></a>
-<span class="sourceLineNo">191</span>   * A pool of {@link Chunk} instances.<a name="line.191"></a>
-<span class="sourceLineNo">192</span>   *<a name="line.192"></a>
-<span class="sourceLineNo">193</span>   * MemStoreChunkPool caches a number of retired chunks for reusing, it could<a name="line.193"></a>
-<span class="sourceLineNo">194</span>   * decrease allocating bytes when writing, thereby optimizing the garbage<a name="line.194"></a>
-<span class="sourceLineNo">195</span>   * collection on JVM.<a name="line.195"></a>
-<span class="sourceLineNo">196</span>   */<a name="line.196"></a>
-<span class="sourceLineNo">197</span>  private  class MemStoreChunkPool implements HeapMemoryTuneObserver {<a name="line.197"></a>
-<span class="sourceLineNo">198</span>    private int maxCount;<a name="line.198"></a>
-<span class="sourceLineNo">199</span><a name="line.199"></a>
-<span class="sourceLineNo">200</span>    // A queue of reclaimed chunks<a name="line.200"></a>
-<span class="sourceLineNo">201</span>    private final BlockingQueue&lt;Chunk&gt; reclaimedChunks;<a name="line.201"></a>
-<span class="sourceLineNo">202</span>    private final float poolSizePercentage;<a name="line.202"></a>
-<span class="sourceLineNo">203</span><a name="line.203"></a>
-<span class="sourceLineNo">204</span>    /** Statistics thread schedule pool */<a name="line.204"></a>
-<span class="sourceLineNo">205</span>    private final ScheduledExecutorService scheduleThreadPool;<a name="line.205"></a>
-<span class="sourceLineNo">206</span>    /** Statistics thread */<a name="line.206"></a>
-<span class="sourceLineNo">207</span>    private static final int statThreadPeriod = 60 * 5;<a name="line.207"></a>
-<span class="sourceLineNo">208</span>    private final AtomicLong chunkCount = new AtomicLong();<a name="line.208"></a>
-<span class="sourceLineNo">209</span>    private final AtomicLong reusedChunkCount = new AtomicLong();<a name="line.209"></a>
-<span class="sourceLineNo">210</span><a name="line.210"></a>
-<span class="sourceLineNo">211</span>    MemStoreChunkPool(int maxCount, int initialCount, float poolSizePercentage) {<a name="line.211"></a>
-<span class="sourceLineNo">212</span>      this.maxCount = maxCount;<a name="line.212"></a>
-<span class="sourceLineNo">213</span>      this.poolSizePercentage = poolSizePercentage;<a name="line.213"></a>
-<span class="sourceLineNo">214</span>      this.reclaimedChunks = new LinkedBlockingQueue&lt;&gt;();<a name="line.214"></a>
-<span class="sourceLineNo">215</span>      for (int i = 0; i &lt; initialCount; i++) {<a name="line.215"></a>
-<span class="sourceLineNo">216</span>        Chunk chunk = createChunk(true);<a name="line.216"></a>
-<span class="sourceLineNo">217</span>        chunk.init();<a name="line.217"></a>
-<span class="sourceLineNo">218</span>        reclaimedChunks.add(chunk);<a name="line.218"></a>
-<span class="sourceLineNo">219</span>      }<a name="line.219"></a>
-<span class="sourceLineNo">220</span>      chunkCount.set(initialCount);<a name="line.220"></a>
-<span class="sourceLineNo">221</span>      final String n = Thread.currentThread().getName();<a name="line.221"></a>
-<span class="sourceLineNo">222</span>      scheduleThreadPool = Executors.newScheduledThreadPool(1, new ThreadFactoryBuilder()<a name="line.222"></a>
-<span class="sourceLineNo">223</span>          .setNameFormat(n + "-MemStoreChunkPool Statistics").setDaemon(true).build());<a name="line.223"></a>
-<span class="sourceLineNo">224</span>      this.scheduleThreadPool.scheduleAtFixedRate(new StatisticsThread(), statThreadPeriod,<a name="line.224"></a>
-<span class="sourceLineNo">225</span>          statThreadPeriod, TimeUnit.SECONDS);<a name="line.225"></a>
-<span class="sourceLineNo">226</span>    }<a name="line.226"></a>
-<span class="sourceLineNo">227</span><a name="line.227"></a>
-<span class="sourceLineNo">228</span>    /**<a name="line.228"></a>
-<span class="sourceLineNo">229</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.229"></a>
-<span class="sourceLineNo">230</span>     * not yet created max allowed chunks count. When we have already created max allowed chunks and<a name="line.230"></a>
-<span class="sourceLineNo">231</span>     * no free chunks as of now, return null. It is the responsibility of the caller to make a chunk<a name="line.231"></a>
-<span class="sourceLineNo">232</span>     * then.<a name="line.232"></a>
-<span class="sourceLineNo">233</span>     * Note: Chunks returned by this pool must be put back to the pool after its use.<a name="line.233"></a>
-<span class="sourceLineNo">234</span>     * @return a chunk<a name="line.234"></a>
-<span class="sourceLineNo">235</span>     * @see #putbackChunks(Set)<a name="line.235"></a>
-<span class="sourceLineNo">236</span>     */<a name="line.236"></a>
-<span class="sourceLineNo">237</span>    Chunk getChunk() {<a name="line.237"></a>
-<span class="sourceLineNo">238</span>      Chunk chunk = reclaimedChunks.poll();<a name="line.238"></a>
-<span class="sourceLineNo">239</span>      if (chunk != null) {<a name="line.239"></a>
-<span class="sourceLineNo">240</span>        chunk.reset();<a name="line.240"></a>
-<span class="sourceLineNo">241</span>        reusedChunkCount.incrementAndGet();<a name="line.241"></a>
-<span class="sourceLineNo">242</span>      } else {<a name="line.242"></a>
-<span class="sourceLineNo">243</span>        // Make a chunk iff we have not yet created the maxCount chunks<a name="line.243"></a>
-<span class="sourceLineNo">244</span>        while (true) {<a name="line.244"></a>
-<span class="sourceLineNo">245</span>          long created = this.chunkCount.get();<a name="line.245"></a>
-<span class="sourceLineNo">246</span>          if (created &lt; this.maxCount) {<a name="line.246"></a>
-<span class="sourceLineNo">247</span>            if (this.chunkCount.compareAndSet(created, created + 1)) {<a name="line.247"></a>
-<span class="sourceLineNo">248</span>              chunk = createChunk(true);<a name="line.248"></a>
-<span class="sourceLineNo">249</span>              break;<a name="line.249"></a>
-<span class="sourceLineNo">250</span>            }<a name="line.250"></a>
-<span class="sourceLineNo">251</span>          } else {<a name="line.251"></a>
-<span class="sourceLineNo">252</span>            break;<a name="line.252"></a>
-<span class="sourceLineNo">253</span>          }<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>      return chunk;<a name="line.256"></a>
-<span class="sourceLineNo">257</span>    }<a name="line.257"></a>
-<span class="sourceLineNo">258</span><a name="line.258"></a>
-<span class="sourceLineNo">259</span>    /**<a name="line.259"></a>
-<span class="sourceLineNo">260</span>     * Add the chunks to the pool, when the pool achieves the max size, it will skip the remaining<a name="line.260"></a>
-<span class="sourceLineNo">261</span>     * chunks<a name="line.261"></a>
-<span class="sourceLineNo">262</span>     * @param chunks<a name="line.262"></a>
-<span class="sourceLineNo">263</span>     */<a name="line.263"></a>
-<span class="sourceLineNo">264</span>    private void putbackChunks(Set&lt;Integer&gt; chunks) {<a name="line.264"></a>
-<span class="sourceLineNo">265</span>      int toAdd = Math.min(chunks.size(), this.maxCount - reclaimedChunks.size());<a name="line.265"></a>
-<span class="sourceLineNo">266</span>      Iterator&lt;Integer&gt; iterator = chunks.iterator();<a name="line.266"></a>
-<span class="sourceLineNo">267</span>      while (iterator.hasNext()) {<a name="line.267"></a>
-<span class="sourceLineNo">268</span>        Integer chunkId = iterator.next();<a name="line.268"></a>
-<span class="sourceLineNo">269</span>        // remove the chunks every time though they are from the pool or not<a name="line.269"></a>
-<span class="sourceLineNo">270</span>        Chunk chunk = ChunkCreator.this.removeChunk(chunkId);<a name="line.270"></a>
-<span class="sourceLineNo">271</span>        if (chunk != null) {<a name="line.271"></a>
-<span class="sourceLineNo">272</span>          if (chunk.isFromPool() &amp;&amp; toAdd &gt; 0) {<a name="line.272"></a>
-<span class="sourceLineNo">273</span>            reclaimedChunks.add(chunk);<a name="line.273"></a>
-<span class="sourceLineNo">274</span>          }<a name="line.274"></a>
-<span class="sourceLineNo">275</span>          toAdd--;<a name="line.275"></a>
-<span class="sourceLineNo">276</span>        }<a name="line.276"></a>
-<span class="sourceLineNo">277</span>      }<a name="line.277"></a>
-<span class="sourceLineNo">278</span>    }<a name="line.278"></a>
-<span class="sourceLineNo">279</span><a name="line.279"></a>
-<span class="sourceLineNo">280</span>    private class StatisticsThread extends Thread {<a name="line.280"></a>
-<span class="sourceLineNo">281</span>      StatisticsThread() {<a name="line.281"></a>
-<span class="sourceLineNo">282</span>        super("MemStoreChunkPool.StatisticsThread");<a name="line.282"></a>
-<span class="sourceLineNo">283</span>        setDaemon(true);<a name="line.283"></a>
-<span class="sourceLineNo">284</span>      }<a name="line.284"></a>
-<span class="sourceLineNo">285</span><a name="line.285"></a>
-<span class="sourceLineNo">286</span>      @Override<a name="line.286"></a>
-<span class="sourceLineNo">287</span>      public void run() {<a name="line.287"></a>
-<span class="sourceLineNo">288</span>        logStats();<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>      private void logStats() {<a name="line.291"></a>
-<span class="sourceLineNo">292</span>        if (!LOG.isDebugEnabled()) return;<a name="line.292"></a>
-<span class="sourceLineNo">293</span>        long created = chunkCount.get();<a name="line.293"></a>
-<span class="sourceLineNo">294</span>        long reused = reusedChunkCount.get();<a name="line.294"></a>
-<span class="sourceLineNo">295</span>        long total = created + reused;<a name="line.295"></a>
-<span class="sourceLineNo">296</span>        LOG.debug("Stats: current pool size=" + reclaimedChunks.size()<a name="line.296"></a>
-<span class="sourceLineNo">297</span>            + ",created chunk count=" + created<a name="line.297"></a>
-<span class="sourceLineNo">298</span>            + ",reused chunk count=" + reused<a name="line.298"></a>
-<span class="sourceLineNo">299</span>            + ",reuseRatio=" + (total == 0 ? "0" : StringUtils.formatPercent(<a name="line.299"></a>
-<span class="sourceLineNo">300</span>                (float) reused / (float) total, 2)));<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><a name="line.303"></a>
-<span class="sourceLineNo">304</span>    private int getMaxCount() {<a name="line.304"></a>
-<span class="sourceLineNo">305</span>      return this.maxCount;<a name="line.305"></a>
-<span class="sourceLineNo">306</span>    }<a name="line.306"></a>
-<span class="sourceLineNo">307</span><a name="line.307"></a>
-<span class="sourceLineNo">308</span>    @Override<a name="line.308"></a>
-<span class="sourceLineNo">309</span>    public void onHeapMemoryTune(long newMemstoreSize, long newBlockCacheSize) {<a name="line.309"></a>
-<span class="sourceLineNo">310</span>      // don't do any tuning in case of offheap memstore<a name="line.310"></a>
-<span class="sourceLineNo">311</span>      if (isOffheap()) {<a name="line.311"></a>
-<span class="sourceLineNo">312</span>        LOG.warn("Not tuning the chunk pool as it is offheap");<a name="line.312"></a>
-<span class="sourceLineNo">313</span>        return;<a name="line.313"></a>
-<span class="sourceLineNo">314</span>      }<a name="line.314"></a>
-<span class="sourceLineNo">315</span>      int newMaxCount =<a name="line.315"></a>
-<span class="sourceLineNo">316</span>          (int) (newMemstoreSize * poolSizePercentage / getChunkSize());<a name="line.316"></a>
-<span class="sourceLineNo">317</span>      if (newMaxCount != this.maxCount) {<a name="line.317"></a>
-<span class="sourceLineNo">318</span>        // We need an adjustment in the chunks numbers<a name="line.318"></a>
-<span class="sourceLineNo">319</span>        if (newMaxCount &gt; this.maxCount) {<a name="line.319"></a>
-<span class="sourceLineNo">320</span>          // Max chunks getting increased. Just change the variable. Later calls to getChunk() would<a name="line.320"></a>
-<span class="sourceLineNo">321</span>          // create and add them to Q<a name="line.321"></a>
-<span class="sourceLineNo">322</span>          LOG.info("Max count for chunks increased from " + this.maxCount + " to " + newMaxCount);<a name="line.322"></a>
-<span class="sourceLineNo">323</span>          this.maxCount = newMaxCount;<a name="line.323"></a>
-<span class="sourceLineNo">324</span>        } else {<a name="line.324"></a>
-<span class="sourceLineNo">325</span>          // Max chunks getting decreased. We may need to clear off some of the pooled chunks now<a name="line.325"></a>
-<span class="sourceLineNo">326</span>          // itself. If the extra chunks are serving already, do not pool those when we get them back<a name="line.326"></a>
-<span class="sourceLineNo">327</span>          LOG.info("Max count for chunks decreased from " + this.maxCount + " to " + newMaxCount);<a name="line.327"></a>
-<span class="sourceLineNo">328</span>          this.maxCount = newMaxCount;<a name="line.328"></a>
-<span class="sourceLineNo">329</span>          if (this.reclaimedChunks.size() &gt; newMaxCount) {<a name="line.329"></a>
-<span class="sourceLineNo">330</span>            synchronized (this) {<a name="line.330"></a>
-<span class="sourceLineNo">331</span>              while (this.reclaimedChunks.size() &gt; newMaxCount) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span>                this.reclaimedChunks.poll();<a name="line.332"></a>
-<span class="sourceLineNo">333</span>              }<a name="line.333"></a>
-<span class="sourceLineNo">334</span>            }<a name="line.334"></a>
-<span class="sourceLineNo">335</span>          }<a name="line.335"></a>
-<span class="sourceLineNo">336</span>        }<a name="line.336"></a>
-<span class="sourceLineNo">337</span>      }<a name="line.337"></a>
-<span class="sourceLineNo">338</span>    }<a name="line.338"></a>
-<span class="sourceLineNo">339</span>  }<a name="line.339"></a>
-<span class="sourceLineNo">340</span><a name="line.340"></a>
-<span class="sourceLineNo">341</span>  @VisibleForTesting<a name="line.341"></a>
-<span class="sourceLineNo">342</span>  static void clearDisableFlag() {<a name="line.342"></a>
-<span class="sourceLineNo">343</span>    chunkPoolDisabled = false;<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 MemStoreChunkPool initializePool(long globalMemStoreSize, float poolSizePercentage,<a name="line.346"></a>
-<span class="sourceLineNo">347</span>      float initialCountPercentage) {<a name="line.347"></a>
-<span class="sourceLineNo">348</span>    if (poolSizePercentage &lt;= 0) {<a name="line.348"></a>
-<span class="sourceLineNo">349</span>      LOG.info("PoolSizePercentage is less than 0. So not using pool");<a name="line.349"></a>
-<span class="sourceLineNo">350</span>      return null;<a name="line.350"></a>
-<span class="sourceLineNo">351</span>    }<a name="line.351"></a>
-<span class="sourceLineNo">352</span>    if (chunkPoolDisabled) {<a name="line.352"></a>
-<span class="sourceLineNo">353</span>      return null;<a name="line.353"></a>
-<span class="sourceLineNo">354</span>    }<a name="line.354"></a>
-<span class="sourceLineNo">355</span>    if (poolSizePercentage &gt; 1.0) {<a name="line.355"></a>
-<span class="sourceLineNo">356</span>      throw new IllegalArgumentException(<a name="line.356"></a>
-<span class="sourceLineNo">357</span>          MemStoreLAB.CHUNK_POOL_MAXSIZE_KEY + " must be between 0.0 and 1.0");<a name="line.357"></a>
-<span class="sourceLineNo">358</span>    }<a name="line.358"></a>
-<span class="sourceLineNo">359</span>    int maxCount = (int) (globalMemStoreSize * poolSizePercentage / getChunkSize());<a name="line.359"></a>
-<span class="sourceLineNo">360</span>    if (initialCountPercentage &gt; 1.0 || initialCountPercentage &lt; 0) {<a name="line.360"></a>
-<span class="sourceLineNo">361</span>      throw new IllegalArgumentException(<a name="line.361"></a>
-<span class="sourceLineNo">362</span>          MemStoreLAB.CHUNK_POOL_INITIALSIZE_KEY + " must be between 0.0 and 1.0");<a name="line.362"></a>
-<span class="sourceLineNo">363</span>    }<a name="line.363"></a>
-<span class="sourceLineNo">364</span>    int initialCount = (int) (initialCountPercentage * maxCount);<a name="line.364"></a>
-<span class="sourceLineNo">365</span>    LOG.info("Allocating MemStoreChunkPool with chunk size "<a name="line.365"></a>
-<span class="sourceLineNo">366</span>        + StringUtils.byteDesc(getChunkSize()) + ", max count " + maxCount<a name="line.366"></a>
-<span class="sourceLineNo">367</span>        + ", initial count " + initialCount);<a name="line.367"></a>
-<span class="sourceLineNo">368</span>    return new MemStoreChunkPool(maxCount, initialCount, poolSizePercentage);<a name="line.368"></a>
-<span class="sourceLineNo">369</span>  }<a name="line.369"></a>
-<span class="sourceLineNo">370</span><a name="line.370"></a>
-<span class="sourceLineNo">371</span>  @VisibleForTesting<a name="line.371"></a>
-<span class="sourceLineNo">372</span>  int getMaxCount() {<a name="line.372"></a>
-<span class="sourceLineNo">373</span>    if (pool != null) {<a name="line.373"></a>
-<span class="sourceLineNo">374</span>      return pool.getMaxCount();<a name="line.374"></a>
-<span class="sourceLineNo">375</span>    }<a name="line.375"></a>
-<span class="sourceLineNo">376</span>    return 0;<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>  @VisibleForTesting<a name="line.379"></a>
-<span class="sourceLineNo">380</span>  int getPoolSize() {<a name="line.380"></a>
-<span class="sourceLineNo">381</span>    if (pool != null) {<a name="line.381"></a>
-<span class="sourceLineNo">382</span>      return pool.reclaimedChunks.size();<a name="line.382"></a>
-<span class="sourceLineNo">383</span>    }<a name="line.383"></a>
-<span class="sourceLineNo">384</span>    return 0;<a name="line.384"></a>
-<span class="sourceLineNo">385</span>  }<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>   * Only used in testing<a name="line.388"></a>
-<span class="sourceLineNo">389</span>   */<a name="line.389"></a>
-<span class="sourceLineNo">390</span>  @VisibleForTesting<a name="line.390"></a>
-<span class="sourceLineNo">391</span>  void clearChunksInPool() {<a name="line.391"></a>
-<span class="sourceLineNo">392</span>    if (pool != null) {<a name="line.392"></a>
-<span class="sourceLineNo">393</span>      pool.reclaimedChunks.clear();<a name="line.393"></a>
-<span class="sourceLineNo">394</span>    }<a name="line.394"></a>
-<span class="sourceLineNo">395</span>  }<a name="line.395"></a>
-<span class="sourceLineNo">396</span><a name="line.396"></a>
-<span class="sourceLineNo">397</span>  synchronized void putbackChunks(Set&lt;Integer&gt; chunks) {<a name="line.397"></a>
-<span class="sourceLineNo">398</span>    if (pool != null) {<a name="line.398"></a>
-<span class="sourceLineNo">399</span>      pool.putbackChunks(chunks);<a name="line.399"></a>
-<span class="sourceLineNo">400</span>    } else {<a name="line.400"></a>
-<span class="sourceLineNo">401</span>      this.removeChunks(chunks);<a name="line.401"></a>
-<span class="sourceLineNo">402</span>    }<a name="line.402"></a>
-<span class="sourceLineNo">403</span>  }<a name="line.403"></a>
-<span class="sourceLineNo">404</span>}<a name="line.404"></a>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-</pre>
-</div>
-</body>
-</html>


Mime
View raw message