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