| <!DOCTYPE HTML> |
| <html lang="en"> |
| <head> |
| <!-- Generated by javadoc (17) --> |
| <title>Source code</title> |
| <meta name="viewport" content="width=device-width, initial-scale=1"> |
| <meta name="description" content="source: package: org.apache.hadoop.hbase.regionserver, class: CellChunkImmutableSegment"> |
| <meta name="generator" content="javadoc/SourceToHTMLConverter"> |
| <link rel="stylesheet" type="text/css" href="../../../../../../stylesheet.css" title="Style"> |
| </head> |
| <body class="source-page"> |
| <main role="main"> |
| <div class="source-container"> |
| <pre><span class="source-line-no">001</span><span id="line-1">/*</span> |
| <span class="source-line-no">002</span><span id="line-2"> * Licensed to the Apache Software Foundation (ASF) under one</span> |
| <span class="source-line-no">003</span><span id="line-3"> * or more contributor license agreements. See the NOTICE file</span> |
| <span class="source-line-no">004</span><span id="line-4"> * distributed with this work for additional information</span> |
| <span class="source-line-no">005</span><span id="line-5"> * regarding copyright ownership. The ASF licenses this file</span> |
| <span class="source-line-no">006</span><span id="line-6"> * to you under the Apache License, Version 2.0 (the</span> |
| <span class="source-line-no">007</span><span id="line-7"> * "License"); you may not use this file except in compliance</span> |
| <span class="source-line-no">008</span><span id="line-8"> * with the License. You may obtain a copy of the License at</span> |
| <span class="source-line-no">009</span><span id="line-9"> *</span> |
| <span class="source-line-no">010</span><span id="line-10"> * http://www.apache.org/licenses/LICENSE-2.0</span> |
| <span class="source-line-no">011</span><span id="line-11"> *</span> |
| <span class="source-line-no">012</span><span id="line-12"> * Unless required by applicable law or agreed to in writing, software</span> |
| <span class="source-line-no">013</span><span id="line-13"> * distributed under the License is distributed on an "AS IS" BASIS,</span> |
| <span class="source-line-no">014</span><span id="line-14"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span> |
| <span class="source-line-no">015</span><span id="line-15"> * See the License for the specific language governing permissions and</span> |
| <span class="source-line-no">016</span><span id="line-16"> * limitations under the License.</span> |
| <span class="source-line-no">017</span><span id="line-17"> */</span> |
| <span class="source-line-no">018</span><span id="line-18">package org.apache.hadoop.hbase.regionserver;</span> |
| <span class="source-line-no">019</span><span id="line-19"></span> |
| <span class="source-line-no">020</span><span id="line-20">import java.io.IOException;</span> |
| <span class="source-line-no">021</span><span id="line-21">import java.nio.ByteBuffer;</span> |
| <span class="source-line-no">022</span><span id="line-22">import org.apache.hadoop.hbase.ByteBufferKeyValue;</span> |
| <span class="source-line-no">023</span><span id="line-23">import org.apache.hadoop.hbase.CellComparator;</span> |
| <span class="source-line-no">024</span><span id="line-24">import org.apache.hadoop.hbase.CellUtil;</span> |
| <span class="source-line-no">025</span><span id="line-25">import org.apache.hadoop.hbase.ExtendedCell;</span> |
| <span class="source-line-no">026</span><span id="line-26">import org.apache.hadoop.hbase.KeyValue;</span> |
| <span class="source-line-no">027</span><span id="line-27">import org.apache.hadoop.hbase.util.ByteBufferUtils;</span> |
| <span class="source-line-no">028</span><span id="line-28">import org.apache.hadoop.hbase.util.ClassSize;</span> |
| <span class="source-line-no">029</span><span id="line-29">import org.apache.yetus.audience.InterfaceAudience;</span> |
| <span class="source-line-no">030</span><span id="line-30"></span> |
| <span class="source-line-no">031</span><span id="line-31">/**</span> |
| <span class="source-line-no">032</span><span id="line-32"> * CellChunkImmutableSegment extends the API supported by a {@link Segment}, and</span> |
| <span class="source-line-no">033</span><span id="line-33"> * {@link ImmutableSegment}. This immutable segment is working with CellSet with CellChunkMap</span> |
| <span class="source-line-no">034</span><span id="line-34"> * delegatee.</span> |
| <span class="source-line-no">035</span><span id="line-35"> */</span> |
| <span class="source-line-no">036</span><span id="line-36">@InterfaceAudience.Private</span> |
| <span class="source-line-no">037</span><span id="line-37">public class CellChunkImmutableSegment extends ImmutableSegment {</span> |
| <span class="source-line-no">038</span><span id="line-38"></span> |
| <span class="source-line-no">039</span><span id="line-39"> public static final long DEEP_OVERHEAD_CCM =</span> |
| <span class="source-line-no">040</span><span id="line-40"> ImmutableSegment.DEEP_OVERHEAD + ClassSize.CELL_CHUNK_MAP;</span> |
| <span class="source-line-no">041</span><span id="line-41"> public static final float INDEX_CHUNK_UNUSED_SPACE_PRECENTAGE = 0.1f;</span> |
| <span class="source-line-no">042</span><span id="line-42"></span> |
| <span class="source-line-no">043</span><span id="line-43"> ///////////////////// CONSTRUCTORS /////////////////////</span> |
| <span class="source-line-no">044</span><span id="line-44"> /**</span> |
| <span class="source-line-no">045</span><span id="line-45"> * ------------------------------------------------------------------------ C-tor to be used when</span> |
| <span class="source-line-no">046</span><span id="line-46"> * new CellChunkImmutableSegment is built as a result of compaction/merge of a list of older</span> |
| <span class="source-line-no">047</span><span id="line-47"> * ImmutableSegments. The given iterator returns the Cells that "survived" the compaction.</span> |
| <span class="source-line-no">048</span><span id="line-48"> */</span> |
| <span class="source-line-no">049</span><span id="line-49"> protected CellChunkImmutableSegment(CellComparator comparator, MemStoreSegmentsIterator iterator,</span> |
| <span class="source-line-no">050</span><span id="line-50"> MemStoreLAB memStoreLAB, int numOfCells, MemStoreCompactionStrategy.Action action) {</span> |
| <span class="source-line-no">051</span><span id="line-51"> super(null, comparator, memStoreLAB); // initialize the CellSet with NULL</span> |
| <span class="source-line-no">052</span><span id="line-52"> long indexOverhead = DEEP_OVERHEAD_CCM;</span> |
| <span class="source-line-no">053</span><span id="line-53"> // memStoreLAB cannot be null in this class</span> |
| <span class="source-line-no">054</span><span id="line-54"> boolean onHeap = getMemStoreLAB().isOnHeap();</span> |
| <span class="source-line-no">055</span><span id="line-55"> // initiate the heapSize with the size of the segment metadata</span> |
| <span class="source-line-no">056</span><span id="line-56"> if (onHeap) {</span> |
| <span class="source-line-no">057</span><span id="line-57"> incMemStoreSize(0, indexOverhead, 0, 0);</span> |
| <span class="source-line-no">058</span><span id="line-58"> } else {</span> |
| <span class="source-line-no">059</span><span id="line-59"> incMemStoreSize(0, 0, indexOverhead, 0);</span> |
| <span class="source-line-no">060</span><span id="line-60"> }</span> |
| <span class="source-line-no">061</span><span id="line-61"> // build the new CellSet based on CellArrayMap and update the CellSet of the new Segment</span> |
| <span class="source-line-no">062</span><span id="line-62"> initializeCellSet(numOfCells, iterator, action);</span> |
| <span class="source-line-no">063</span><span id="line-63"> }</span> |
| <span class="source-line-no">064</span><span id="line-64"></span> |
| <span class="source-line-no">065</span><span id="line-65"> /**</span> |
| <span class="source-line-no">066</span><span id="line-66"> * ------------------------------------------------------------------------ C-tor to be used when</span> |
| <span class="source-line-no">067</span><span id="line-67"> * new CellChunkImmutableSegment is built as a result of flattening of CSLMImmutableSegment The</span> |
| <span class="source-line-no">068</span><span id="line-68"> * given iterator returns the Cells that "survived" the compaction.</span> |
| <span class="source-line-no">069</span><span id="line-69"> */</span> |
| <span class="source-line-no">070</span><span id="line-70"> protected CellChunkImmutableSegment(CSLMImmutableSegment segment, MemStoreSizing memstoreSizing,</span> |
| <span class="source-line-no">071</span><span id="line-71"> MemStoreCompactionStrategy.Action action) {</span> |
| <span class="source-line-no">072</span><span id="line-72"> super(segment); // initiailize the upper class</span> |
| <span class="source-line-no">073</span><span id="line-73"> long indexOverhead = -CSLMImmutableSegment.DEEP_OVERHEAD_CSLM + DEEP_OVERHEAD_CCM;</span> |
| <span class="source-line-no">074</span><span id="line-74"> // memStoreLAB cannot be null in this class</span> |
| <span class="source-line-no">075</span><span id="line-75"> boolean onHeap = getMemStoreLAB().isOnHeap();</span> |
| <span class="source-line-no">076</span><span id="line-76"> // initiate the heapSize with the size of the segment metadata</span> |
| <span class="source-line-no">077</span><span id="line-77"> if (onHeap) {</span> |
| <span class="source-line-no">078</span><span id="line-78"> incMemStoreSize(0, indexOverhead, 0, 0);</span> |
| <span class="source-line-no">079</span><span id="line-79"> memstoreSizing.incMemStoreSize(0, indexOverhead, 0, 0);</span> |
| <span class="source-line-no">080</span><span id="line-80"> } else {</span> |
| <span class="source-line-no">081</span><span id="line-81"> incMemStoreSize(0, -CSLMImmutableSegment.DEEP_OVERHEAD_CSLM, DEEP_OVERHEAD_CCM, 0);</span> |
| <span class="source-line-no">082</span><span id="line-82"> memstoreSizing.incMemStoreSize(0, -CSLMImmutableSegment.DEEP_OVERHEAD_CSLM, DEEP_OVERHEAD_CCM,</span> |
| <span class="source-line-no">083</span><span id="line-83"> 0);</span> |
| <span class="source-line-no">084</span><span id="line-84"> }</span> |
| <span class="source-line-no">085</span><span id="line-85"> int numOfCells = segment.getCellsCount();</span> |
| <span class="source-line-no">086</span><span id="line-86"> // build the new CellSet based on CellChunkMap</span> |
| <span class="source-line-no">087</span><span id="line-87"> reinitializeCellSet(numOfCells, segment.getScanner(Long.MAX_VALUE), segment.getCellSet(),</span> |
| <span class="source-line-no">088</span><span id="line-88"> memstoreSizing, action);</span> |
| <span class="source-line-no">089</span><span id="line-89"> // arrange the meta-data size, decrease all meta-data sizes related to SkipList;</span> |
| <span class="source-line-no">090</span><span id="line-90"> // add sizes of CellChunkMap entry, decrease also Cell object sizes</span> |
| <span class="source-line-no">091</span><span id="line-91"> // (reinitializeCellSet doesn't take the care for the sizes)</span> |
| <span class="source-line-no">092</span><span id="line-92"> long newSegmentSizeDelta =</span> |
| <span class="source-line-no">093</span><span id="line-93"> numOfCells * (indexEntrySize() - ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY);</span> |
| <span class="source-line-no">094</span><span id="line-94"> if (onHeap) {</span> |
| <span class="source-line-no">095</span><span id="line-95"> incMemStoreSize(0, newSegmentSizeDelta, 0, 0);</span> |
| <span class="source-line-no">096</span><span id="line-96"> memstoreSizing.incMemStoreSize(0, newSegmentSizeDelta, 0, 0);</span> |
| <span class="source-line-no">097</span><span id="line-97"> } else {</span> |
| <span class="source-line-no">098</span><span id="line-98"> incMemStoreSize(0, 0, newSegmentSizeDelta, 0);</span> |
| <span class="source-line-no">099</span><span id="line-99"> memstoreSizing.incMemStoreSize(0, 0, newSegmentSizeDelta, 0);</span> |
| <span class="source-line-no">100</span><span id="line-100"></span> |
| <span class="source-line-no">101</span><span id="line-101"> }</span> |
| <span class="source-line-no">102</span><span id="line-102"> }</span> |
| <span class="source-line-no">103</span><span id="line-103"></span> |
| <span class="source-line-no">104</span><span id="line-104"> @Override</span> |
| <span class="source-line-no">105</span><span id="line-105"> protected long indexEntryOnHeapSize(boolean onHeap) {</span> |
| <span class="source-line-no">106</span><span id="line-106"> if (onHeap) {</span> |
| <span class="source-line-no">107</span><span id="line-107"> return indexEntrySize();</span> |
| <span class="source-line-no">108</span><span id="line-108"> }</span> |
| <span class="source-line-no">109</span><span id="line-109"> // else the index is allocated off-heap</span> |
| <span class="source-line-no">110</span><span id="line-110"> return 0;</span> |
| <span class="source-line-no">111</span><span id="line-111"> }</span> |
| <span class="source-line-no">112</span><span id="line-112"></span> |
| <span class="source-line-no">113</span><span id="line-113"> @Override</span> |
| <span class="source-line-no">114</span><span id="line-114"> protected long indexEntryOffHeapSize(boolean offHeap) {</span> |
| <span class="source-line-no">115</span><span id="line-115"> if (offHeap) {</span> |
| <span class="source-line-no">116</span><span id="line-116"> return indexEntrySize();</span> |
| <span class="source-line-no">117</span><span id="line-117"> }</span> |
| <span class="source-line-no">118</span><span id="line-118"> // else the index is allocated on-heap</span> |
| <span class="source-line-no">119</span><span id="line-119"> return 0;</span> |
| <span class="source-line-no">120</span><span id="line-120"> }</span> |
| <span class="source-line-no">121</span><span id="line-121"></span> |
| <span class="source-line-no">122</span><span id="line-122"> @Override</span> |
| <span class="source-line-no">123</span><span id="line-123"> protected long indexEntrySize() {</span> |
| <span class="source-line-no">124</span><span id="line-124"> return ((long) ClassSize.CELL_CHUNK_MAP_ENTRY - KeyValue.FIXED_OVERHEAD);</span> |
| <span class="source-line-no">125</span><span id="line-125"> }</span> |
| <span class="source-line-no">126</span><span id="line-126"></span> |
| <span class="source-line-no">127</span><span id="line-127"> @Override</span> |
| <span class="source-line-no">128</span><span id="line-128"> protected boolean canBeFlattened() {</span> |
| <span class="source-line-no">129</span><span id="line-129"> return false;</span> |
| <span class="source-line-no">130</span><span id="line-130"> }</span> |
| <span class="source-line-no">131</span><span id="line-131"></span> |
| <span class="source-line-no">132</span><span id="line-132"> ///////////////////// PRIVATE METHODS /////////////////////</span> |
| <span class="source-line-no">133</span><span id="line-133"> /*------------------------------------------------------------------------*/</span> |
| <span class="source-line-no">134</span><span id="line-134"> // Create CellSet based on CellChunkMap from compacting iterator</span> |
| <span class="source-line-no">135</span><span id="line-135"> private void initializeCellSet(int numOfCells, MemStoreSegmentsIterator iterator,</span> |
| <span class="source-line-no">136</span><span id="line-136"> MemStoreCompactionStrategy.Action action) {</span> |
| <span class="source-line-no">137</span><span id="line-137"> int numOfCellsAfterCompaction = 0;</span> |
| <span class="source-line-no">138</span><span id="line-138"> int currentChunkIdx = 0;</span> |
| <span class="source-line-no">139</span><span id="line-139"> int offsetInCurentChunk = ChunkCreator.SIZEOF_CHUNK_HEADER;</span> |
| <span class="source-line-no">140</span><span id="line-140"> int numUniqueKeys = 0;</span> |
| <span class="source-line-no">141</span><span id="line-141"> ExtendedCell prev = null;</span> |
| <span class="source-line-no">142</span><span id="line-142"> Chunk[] chunks = allocIndexChunks(numOfCells);</span> |
| <span class="source-line-no">143</span><span id="line-143"> while (iterator.hasNext()) { // the iterator hides the elimination logic for compaction</span> |
| <span class="source-line-no">144</span><span id="line-144"> boolean alreadyCopied = false;</span> |
| <span class="source-line-no">145</span><span id="line-145"> ExtendedCell c = iterator.next();</span> |
| <span class="source-line-no">146</span><span id="line-146"> numOfCellsAfterCompaction++;</span> |
| <span class="source-line-no">147</span><span id="line-147"> if (c.getChunkId() == ExtendedCell.CELL_NOT_BASED_ON_CHUNK) {</span> |
| <span class="source-line-no">148</span><span id="line-148"> // CellChunkMap assumes all cells are allocated on MSLAB.</span> |
| <span class="source-line-no">149</span><span id="line-149"> // Therefore, cells which are not allocated on MSLAB initially,</span> |
| <span class="source-line-no">150</span><span id="line-150"> // are copied into MSLAB here.</span> |
| <span class="source-line-no">151</span><span id="line-151"> c = copyCellIntoMSLAB(c, null); // no memstore sizing object to update</span> |
| <span class="source-line-no">152</span><span id="line-152"> alreadyCopied = true;</span> |
| <span class="source-line-no">153</span><span id="line-153"> }</span> |
| <span class="source-line-no">154</span><span id="line-154"> if (offsetInCurentChunk + ClassSize.CELL_CHUNK_MAP_ENTRY > chunks[currentChunkIdx].size) {</span> |
| <span class="source-line-no">155</span><span id="line-155"> currentChunkIdx++; // continue to the next index chunk</span> |
| <span class="source-line-no">156</span><span id="line-156"> offsetInCurentChunk = ChunkCreator.SIZEOF_CHUNK_HEADER;</span> |
| <span class="source-line-no">157</span><span id="line-157"> }</span> |
| <span class="source-line-no">158</span><span id="line-158"> if (action == MemStoreCompactionStrategy.Action.COMPACT && !alreadyCopied) {</span> |
| <span class="source-line-no">159</span><span id="line-159"></span> |
| <span class="source-line-no">160</span><span id="line-160"> // For compaction copy cell to the new segment (MSLAB copy),here we set forceCloneOfBigCell</span> |
| <span class="source-line-no">161</span><span id="line-161"> // to true, because the chunk which the cell is allocated may be freed after the compaction</span> |
| <span class="source-line-no">162</span><span id="line-162"> // is completed, see HBASE-27464.</span> |
| <span class="source-line-no">163</span><span id="line-163"> c = maybeCloneWithAllocator(c, true);</span> |
| <span class="source-line-no">164</span><span id="line-164"> }</span> |
| <span class="source-line-no">165</span><span id="line-165"> offsetInCurentChunk = // add the Cell reference to the index chunk</span> |
| <span class="source-line-no">166</span><span id="line-166"> createCellReference((ByteBufferKeyValue) c, chunks[currentChunkIdx].getData(),</span> |
| <span class="source-line-no">167</span><span id="line-167"> offsetInCurentChunk);</span> |
| <span class="source-line-no">168</span><span id="line-168"> // the sizes still need to be updated in the new segment</span> |
| <span class="source-line-no">169</span><span id="line-169"> // second parameter true, because in compaction/merge the addition of the cell to new segment</span> |
| <span class="source-line-no">170</span><span id="line-170"> // is always successful</span> |
| <span class="source-line-no">171</span><span id="line-171"> updateMetaInfo(c, true, null); // updates the size per cell</span> |
| <span class="source-line-no">172</span><span id="line-172"> if (action == MemStoreCompactionStrategy.Action.MERGE_COUNT_UNIQUE_KEYS) {</span> |
| <span class="source-line-no">173</span><span id="line-173"> // counting number of unique keys</span> |
| <span class="source-line-no">174</span><span id="line-174"> if (prev != null) {</span> |
| <span class="source-line-no">175</span><span id="line-175"> if (!CellUtil.matchingRowColumnBytes(prev, c)) {</span> |
| <span class="source-line-no">176</span><span id="line-176"> numUniqueKeys++;</span> |
| <span class="source-line-no">177</span><span id="line-177"> }</span> |
| <span class="source-line-no">178</span><span id="line-178"> } else {</span> |
| <span class="source-line-no">179</span><span id="line-179"> numUniqueKeys++;</span> |
| <span class="source-line-no">180</span><span id="line-180"> }</span> |
| <span class="source-line-no">181</span><span id="line-181"> }</span> |
| <span class="source-line-no">182</span><span id="line-182"> prev = c;</span> |
| <span class="source-line-no">183</span><span id="line-183"> }</span> |
| <span class="source-line-no">184</span><span id="line-184"> if (action == MemStoreCompactionStrategy.Action.COMPACT) {</span> |
| <span class="source-line-no">185</span><span id="line-185"> numUniqueKeys = numOfCells;</span> |
| <span class="source-line-no">186</span><span id="line-186"> } else if (action != MemStoreCompactionStrategy.Action.MERGE_COUNT_UNIQUE_KEYS) {</span> |
| <span class="source-line-no">187</span><span id="line-187"> numUniqueKeys = CellSet.UNKNOWN_NUM_UNIQUES;</span> |
| <span class="source-line-no">188</span><span id="line-188"> }</span> |
| <span class="source-line-no">189</span><span id="line-189"> // build the immutable CellSet</span> |
| <span class="source-line-no">190</span><span id="line-190"> CellChunkMap<ExtendedCell> ccm =</span> |
| <span class="source-line-no">191</span><span id="line-191"> new CellChunkMap<>(getComparator(), chunks, 0, numOfCellsAfterCompaction, false);</span> |
| <span class="source-line-no">192</span><span id="line-192"> this.setCellSet(null, new CellSet<>(ccm, numUniqueKeys)); // update the CellSet of this Segment</span> |
| <span class="source-line-no">193</span><span id="line-193"> }</span> |
| <span class="source-line-no">194</span><span id="line-194"></span> |
| <span class="source-line-no">195</span><span id="line-195"> /*------------------------------------------------------------------------*/</span> |
| <span class="source-line-no">196</span><span id="line-196"> // Create CellSet based on CellChunkMap from current ConcurrentSkipListMap based CellSet</span> |
| <span class="source-line-no">197</span><span id="line-197"> // (without compacting iterator)</span> |
| <span class="source-line-no">198</span><span id="line-198"> // This is a service for not-flat immutable segments</span> |
| <span class="source-line-no">199</span><span id="line-199"> private void reinitializeCellSet(int numOfCells, KeyValueScanner segmentScanner,</span> |
| <span class="source-line-no">200</span><span id="line-200"> CellSet<ExtendedCell> oldCellSet, MemStoreSizing memstoreSizing,</span> |
| <span class="source-line-no">201</span><span id="line-201"> MemStoreCompactionStrategy.Action action) {</span> |
| <span class="source-line-no">202</span><span id="line-202"> ExtendedCell curCell;</span> |
| <span class="source-line-no">203</span><span id="line-203"> Chunk[] chunks = allocIndexChunks(numOfCells);</span> |
| <span class="source-line-no">204</span><span id="line-204"></span> |
| <span class="source-line-no">205</span><span id="line-205"> int currentChunkIdx = 0;</span> |
| <span class="source-line-no">206</span><span id="line-206"> int offsetInCurentChunk = ChunkCreator.SIZEOF_CHUNK_HEADER;</span> |
| <span class="source-line-no">207</span><span id="line-207"></span> |
| <span class="source-line-no">208</span><span id="line-208"> int numUniqueKeys = 0;</span> |
| <span class="source-line-no">209</span><span id="line-209"> ExtendedCell prev = null;</span> |
| <span class="source-line-no">210</span><span id="line-210"> try {</span> |
| <span class="source-line-no">211</span><span id="line-211"> while ((curCell = segmentScanner.next()) != null) {</span> |
| <span class="source-line-no">212</span><span id="line-212"> if (curCell.getChunkId() == ExtendedCell.CELL_NOT_BASED_ON_CHUNK) {</span> |
| <span class="source-line-no">213</span><span id="line-213"> // CellChunkMap assumes all cells are allocated on MSLAB.</span> |
| <span class="source-line-no">214</span><span id="line-214"> // Therefore, cells which are not allocated on MSLAB initially,</span> |
| <span class="source-line-no">215</span><span id="line-215"> // are copied into MSLAB here.</span> |
| <span class="source-line-no">216</span><span id="line-216"> curCell = copyCellIntoMSLAB(curCell, memstoreSizing);</span> |
| <span class="source-line-no">217</span><span id="line-217"> }</span> |
| <span class="source-line-no">218</span><span id="line-218"> if (offsetInCurentChunk + ClassSize.CELL_CHUNK_MAP_ENTRY > chunks[currentChunkIdx].size) {</span> |
| <span class="source-line-no">219</span><span id="line-219"> // continue to the next metadata chunk</span> |
| <span class="source-line-no">220</span><span id="line-220"> currentChunkIdx++;</span> |
| <span class="source-line-no">221</span><span id="line-221"> offsetInCurentChunk = ChunkCreator.SIZEOF_CHUNK_HEADER;</span> |
| <span class="source-line-no">222</span><span id="line-222"> }</span> |
| <span class="source-line-no">223</span><span id="line-223"> offsetInCurentChunk = createCellReference((ByteBufferKeyValue) curCell,</span> |
| <span class="source-line-no">224</span><span id="line-224"> chunks[currentChunkIdx].getData(), offsetInCurentChunk);</span> |
| <span class="source-line-no">225</span><span id="line-225"> if (action == MemStoreCompactionStrategy.Action.FLATTEN_COUNT_UNIQUE_KEYS) {</span> |
| <span class="source-line-no">226</span><span id="line-226"> // counting number of unique keys</span> |
| <span class="source-line-no">227</span><span id="line-227"> if (prev != null) {</span> |
| <span class="source-line-no">228</span><span id="line-228"> if (!CellUtil.matchingRowColumn(prev, curCell)) {</span> |
| <span class="source-line-no">229</span><span id="line-229"> numUniqueKeys++;</span> |
| <span class="source-line-no">230</span><span id="line-230"> }</span> |
| <span class="source-line-no">231</span><span id="line-231"> } else {</span> |
| <span class="source-line-no">232</span><span id="line-232"> numUniqueKeys++;</span> |
| <span class="source-line-no">233</span><span id="line-233"> }</span> |
| <span class="source-line-no">234</span><span id="line-234"> }</span> |
| <span class="source-line-no">235</span><span id="line-235"> prev = curCell;</span> |
| <span class="source-line-no">236</span><span id="line-236"> }</span> |
| <span class="source-line-no">237</span><span id="line-237"> if (action != MemStoreCompactionStrategy.Action.FLATTEN_COUNT_UNIQUE_KEYS) {</span> |
| <span class="source-line-no">238</span><span id="line-238"> numUniqueKeys = CellSet.UNKNOWN_NUM_UNIQUES;</span> |
| <span class="source-line-no">239</span><span id="line-239"> }</span> |
| <span class="source-line-no">240</span><span id="line-240"> } catch (IOException ie) {</span> |
| <span class="source-line-no">241</span><span id="line-241"> throw new IllegalStateException(ie);</span> |
| <span class="source-line-no">242</span><span id="line-242"> } finally {</span> |
| <span class="source-line-no">243</span><span id="line-243"> segmentScanner.close();</span> |
| <span class="source-line-no">244</span><span id="line-244"> }</span> |
| <span class="source-line-no">245</span><span id="line-245"></span> |
| <span class="source-line-no">246</span><span id="line-246"> CellChunkMap<ExtendedCell> ccm =</span> |
| <span class="source-line-no">247</span><span id="line-247"> new CellChunkMap<>(getComparator(), chunks, 0, numOfCells, false);</span> |
| <span class="source-line-no">248</span><span id="line-248"> // update the CellSet of this Segment</span> |
| <span class="source-line-no">249</span><span id="line-249"> this.setCellSet(oldCellSet, new CellSet<>(ccm, numUniqueKeys));</span> |
| <span class="source-line-no">250</span><span id="line-250"> }</span> |
| <span class="source-line-no">251</span><span id="line-251"></span> |
| <span class="source-line-no">252</span><span id="line-252"> /*------------------------------------------------------------------------*/</span> |
| <span class="source-line-no">253</span><span id="line-253"> // for a given cell, write the cell representation on the index chunk</span> |
| <span class="source-line-no">254</span><span id="line-254"> private int createCellReference(ByteBufferKeyValue cell, ByteBuffer idxBuffer, int idxOffset) {</span> |
| <span class="source-line-no">255</span><span id="line-255"> int offset = idxOffset;</span> |
| <span class="source-line-no">256</span><span id="line-256"> int dataChunkID = cell.getChunkId();</span> |
| <span class="source-line-no">257</span><span id="line-257"></span> |
| <span class="source-line-no">258</span><span id="line-258"> offset = ByteBufferUtils.putInt(idxBuffer, offset, dataChunkID); // write data chunk id</span> |
| <span class="source-line-no">259</span><span id="line-259"> offset = ByteBufferUtils.putInt(idxBuffer, offset, cell.getOffset()); // offset</span> |
| <span class="source-line-no">260</span><span id="line-260"> offset = ByteBufferUtils.putInt(idxBuffer, offset, cell.getSerializedSize()); // length</span> |
| <span class="source-line-no">261</span><span id="line-261"> offset = ByteBufferUtils.putLong(idxBuffer, offset, cell.getSequenceId()); // seqId</span> |
| <span class="source-line-no">262</span><span id="line-262"></span> |
| <span class="source-line-no">263</span><span id="line-263"> return offset;</span> |
| <span class="source-line-no">264</span><span id="line-264"> }</span> |
| <span class="source-line-no">265</span><span id="line-265"></span> |
| <span class="source-line-no">266</span><span id="line-266"> private int calculateNumberOfChunks(int numOfCells, int chunkSize) {</span> |
| <span class="source-line-no">267</span><span id="line-267"> int numOfCellsInChunk = calcNumOfCellsInChunk(chunkSize);</span> |
| <span class="source-line-no">268</span><span id="line-268"> int numberOfChunks = numOfCells / numOfCellsInChunk;</span> |
| <span class="source-line-no">269</span><span id="line-269"> if (numOfCells % numOfCellsInChunk != 0) { // if cells cannot be divided evenly between chunks</span> |
| <span class="source-line-no">270</span><span id="line-270"> numberOfChunks++; // add one additional chunk</span> |
| <span class="source-line-no">271</span><span id="line-271"> }</span> |
| <span class="source-line-no">272</span><span id="line-272"> return numberOfChunks;</span> |
| <span class="source-line-no">273</span><span id="line-273"> }</span> |
| <span class="source-line-no">274</span><span id="line-274"></span> |
| <span class="source-line-no">275</span><span id="line-275"> // Assuming we are going to use regular data chunks as index chunks,</span> |
| <span class="source-line-no">276</span><span id="line-276"> // we check here how much free space will remain in the last allocated chunk</span> |
| <span class="source-line-no">277</span><span id="line-277"> // (the least occupied one).</span> |
| <span class="source-line-no">278</span><span id="line-278"> // If the percentage of its remaining free space is above the INDEX_CHUNK_UNUSED_SPACE</span> |
| <span class="source-line-no">279</span><span id="line-279"> // threshold, then we will use index chunks (which are smaller) instead.</span> |
| <span class="source-line-no">280</span><span id="line-280"> private ChunkCreator.ChunkType useIndexChunks(int numOfCells) {</span> |
| <span class="source-line-no">281</span><span id="line-281"> int dataChunkSize = ChunkCreator.getInstance().getChunkSize();</span> |
| <span class="source-line-no">282</span><span id="line-282"> int numOfCellsInChunk = calcNumOfCellsInChunk(dataChunkSize);</span> |
| <span class="source-line-no">283</span><span id="line-283"> int cellsInLastChunk = numOfCells % numOfCellsInChunk;</span> |
| <span class="source-line-no">284</span><span id="line-284"> if (cellsInLastChunk == 0) { // There is no free space in the last chunk and thus,</span> |
| <span class="source-line-no">285</span><span id="line-285"> return ChunkCreator.ChunkType.DATA_CHUNK; // no need to use index chunks.</span> |
| <span class="source-line-no">286</span><span id="line-286"> } else {</span> |
| <span class="source-line-no">287</span><span id="line-287"> int chunkSpace = dataChunkSize - ChunkCreator.SIZEOF_CHUNK_HEADER;</span> |
| <span class="source-line-no">288</span><span id="line-288"> int freeSpaceInLastChunk = chunkSpace - cellsInLastChunk * ClassSize.CELL_CHUNK_MAP_ENTRY;</span> |
| <span class="source-line-no">289</span><span id="line-289"> if (freeSpaceInLastChunk > INDEX_CHUNK_UNUSED_SPACE_PRECENTAGE * chunkSpace) {</span> |
| <span class="source-line-no">290</span><span id="line-290"> return ChunkCreator.ChunkType.INDEX_CHUNK;</span> |
| <span class="source-line-no">291</span><span id="line-291"> }</span> |
| <span class="source-line-no">292</span><span id="line-292"> return ChunkCreator.ChunkType.DATA_CHUNK;</span> |
| <span class="source-line-no">293</span><span id="line-293"> }</span> |
| <span class="source-line-no">294</span><span id="line-294"> }</span> |
| <span class="source-line-no">295</span><span id="line-295"></span> |
| <span class="source-line-no">296</span><span id="line-296"> private int calcNumOfCellsInChunk(int chunkSize) {</span> |
| <span class="source-line-no">297</span><span id="line-297"> int chunkSpace = chunkSize - ChunkCreator.SIZEOF_CHUNK_HEADER;</span> |
| <span class="source-line-no">298</span><span id="line-298"> int numOfCellsInChunk = chunkSpace / ClassSize.CELL_CHUNK_MAP_ENTRY;</span> |
| <span class="source-line-no">299</span><span id="line-299"> return numOfCellsInChunk;</span> |
| <span class="source-line-no">300</span><span id="line-300"> }</span> |
| <span class="source-line-no">301</span><span id="line-301"></span> |
| <span class="source-line-no">302</span><span id="line-302"> private Chunk[] allocIndexChunks(int numOfCells) {</span> |
| <span class="source-line-no">303</span><span id="line-303"> // Decide whether to use regular or small chunks and then</span> |
| <span class="source-line-no">304</span><span id="line-304"> // calculate how many chunks we will need for index</span> |
| <span class="source-line-no">305</span><span id="line-305"></span> |
| <span class="source-line-no">306</span><span id="line-306"> ChunkCreator.ChunkType chunkType = useIndexChunks(numOfCells);</span> |
| <span class="source-line-no">307</span><span id="line-307"> int chunkSize = ChunkCreator.getInstance().getChunkSize(chunkType);</span> |
| <span class="source-line-no">308</span><span id="line-308"> int numberOfChunks = calculateNumberOfChunks(numOfCells, chunkSize);</span> |
| <span class="source-line-no">309</span><span id="line-309"> // all index Chunks are allocated from ChunkCreator</span> |
| <span class="source-line-no">310</span><span id="line-310"> Chunk[] chunks = new Chunk[numberOfChunks];</span> |
| <span class="source-line-no">311</span><span id="line-311"> // all index Chunks are allocated from ChunkCreator</span> |
| <span class="source-line-no">312</span><span id="line-312"> for (int i = 0; i < numberOfChunks; i++) {</span> |
| <span class="source-line-no">313</span><span id="line-313"> chunks[i] = this.getMemStoreLAB().getNewExternalChunk(chunkType);</span> |
| <span class="source-line-no">314</span><span id="line-314"> }</span> |
| <span class="source-line-no">315</span><span id="line-315"> return chunks;</span> |
| <span class="source-line-no">316</span><span id="line-316"> }</span> |
| <span class="source-line-no">317</span><span id="line-317"></span> |
| <span class="source-line-no">318</span><span id="line-318"> private ExtendedCell copyCellIntoMSLAB(ExtendedCell cell, MemStoreSizing memstoreSizing) {</span> |
| <span class="source-line-no">319</span><span id="line-319"> // Take care for a special case when a cell is copied from on-heap to (probably off-heap) MSLAB.</span> |
| <span class="source-line-no">320</span><span id="line-320"> // The cell allocated as an on-heap JVM object (byte array) occupies slightly different</span> |
| <span class="source-line-no">321</span><span id="line-321"> // amount of memory, than when the cell serialized and allocated on the MSLAB.</span> |
| <span class="source-line-no">322</span><span id="line-322"> // Here, we update the heap size of the new segment only for the difference between object and</span> |
| <span class="source-line-no">323</span><span id="line-323"> // serialized size. This is a decrease of the size as serialized cell is a bit smaller.</span> |
| <span class="source-line-no">324</span><span id="line-324"> // The actual size of the cell is not added yet, and will be added (only in compaction)</span> |
| <span class="source-line-no">325</span><span id="line-325"> // in initializeCellSet#updateMetaInfo().</span> |
| <span class="source-line-no">326</span><span id="line-326"> long oldHeapSize = heapSizeChange(cell, true);</span> |
| <span class="source-line-no">327</span><span id="line-327"> long oldOffHeapSize = offHeapSizeChange(cell, true);</span> |
| <span class="source-line-no">328</span><span id="line-328"> long oldCellSize = getCellLength(cell);</span> |
| <span class="source-line-no">329</span><span id="line-329"> cell = maybeCloneWithAllocator(cell, true);</span> |
| <span class="source-line-no">330</span><span id="line-330"> long newHeapSize = heapSizeChange(cell, true);</span> |
| <span class="source-line-no">331</span><span id="line-331"> long newOffHeapSize = offHeapSizeChange(cell, true);</span> |
| <span class="source-line-no">332</span><span id="line-332"> long newCellSize = getCellLength(cell);</span> |
| <span class="source-line-no">333</span><span id="line-333"> long heapOverhead = newHeapSize - oldHeapSize;</span> |
| <span class="source-line-no">334</span><span id="line-334"> long offHeapOverhead = newOffHeapSize - oldOffHeapSize;</span> |
| <span class="source-line-no">335</span><span id="line-335"> incMemStoreSize(newCellSize - oldCellSize, heapOverhead, offHeapOverhead, 0);</span> |
| <span class="source-line-no">336</span><span id="line-336"> if (memstoreSizing != null) {</span> |
| <span class="source-line-no">337</span><span id="line-337"> memstoreSizing.incMemStoreSize(newCellSize - oldCellSize, heapOverhead, offHeapOverhead, 0);</span> |
| <span class="source-line-no">338</span><span id="line-338"> }</span> |
| <span class="source-line-no">339</span><span id="line-339"> return cell;</span> |
| <span class="source-line-no">340</span><span id="line-340"> }</span> |
| <span class="source-line-no">341</span><span id="line-341">}</span> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </main> |
| </body> |
| </html> |
