| <!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.io.hfile;<a name="line.18"></a> |
| <span class="sourceLineNo">019</span><a name="line.19"></a> |
| <span class="sourceLineNo">020</span>import static org.apache.hadoop.hbase.io.hfile.HFileBlockIndex.MID_KEY_METADATA_SIZE;<a name="line.20"></a> |
| <span class="sourceLineNo">021</span>import static org.apache.hadoop.hbase.io.hfile.HFileBlockIndex.SECONDARY_INDEX_ENTRY_OVERHEAD;<a name="line.21"></a> |
| <span class="sourceLineNo">022</span><a name="line.22"></a> |
| <span class="sourceLineNo">023</span>import java.io.DataInput;<a name="line.23"></a> |
| <span class="sourceLineNo">024</span>import java.io.DataInputStream;<a name="line.24"></a> |
| <span class="sourceLineNo">025</span>import java.io.DataOutput;<a name="line.25"></a> |
| <span class="sourceLineNo">026</span>import java.io.IOException;<a name="line.26"></a> |
| <span class="sourceLineNo">027</span>import java.util.concurrent.atomic.AtomicReference;<a name="line.27"></a> |
| <span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.Cell;<a name="line.28"></a> |
| <span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.29"></a> |
| <span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.30"></a> |
| <span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.KeyValue;<a name="line.31"></a> |
| <span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.io.encoding.DataBlockEncoding;<a name="line.32"></a> |
| <span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.io.encoding.IndexBlockEncoding;<a name="line.33"></a> |
| <span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.nio.ByteBuff;<a name="line.34"></a> |
| <span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.regionserver.KeyValueScanner;<a name="line.35"></a> |
| <span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.36"></a> |
| <span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.util.ClassSize;<a name="line.37"></a> |
| <span class="sourceLineNo">038</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.38"></a> |
| <span class="sourceLineNo">039</span><a name="line.39"></a> |
| <span class="sourceLineNo">040</span>/**<a name="line.40"></a> |
| <span class="sourceLineNo">041</span> * Does not perform any kind of encoding/decoding.<a name="line.41"></a> |
| <span class="sourceLineNo">042</span> */<a name="line.42"></a> |
| <span class="sourceLineNo">043</span>@InterfaceAudience.Private<a name="line.43"></a> |
| <span class="sourceLineNo">044</span>public class NoOpIndexBlockEncoder implements HFileIndexBlockEncoder {<a name="line.44"></a> |
| <span class="sourceLineNo">045</span><a name="line.45"></a> |
| <span class="sourceLineNo">046</span> public static final NoOpIndexBlockEncoder INSTANCE = new NoOpIndexBlockEncoder();<a name="line.46"></a> |
| <span class="sourceLineNo">047</span><a name="line.47"></a> |
| <span class="sourceLineNo">048</span> /** Cannot be instantiated. Use {@link #INSTANCE} instead. */<a name="line.48"></a> |
| <span class="sourceLineNo">049</span> private NoOpIndexBlockEncoder() {<a name="line.49"></a> |
| <span class="sourceLineNo">050</span> }<a name="line.50"></a> |
| <span class="sourceLineNo">051</span><a name="line.51"></a> |
| <span class="sourceLineNo">052</span> @Override<a name="line.52"></a> |
| <span class="sourceLineNo">053</span> public void saveMetadata(HFile.Writer writer) {<a name="line.53"></a> |
| <span class="sourceLineNo">054</span> }<a name="line.54"></a> |
| <span class="sourceLineNo">055</span><a name="line.55"></a> |
| <span class="sourceLineNo">056</span> @Override<a name="line.56"></a> |
| <span class="sourceLineNo">057</span> public void encode(BlockIndexChunk blockIndexChunk, boolean rootIndexBlock, DataOutput out)<a name="line.57"></a> |
| <span class="sourceLineNo">058</span> throws IOException {<a name="line.58"></a> |
| <span class="sourceLineNo">059</span> if (rootIndexBlock) {<a name="line.59"></a> |
| <span class="sourceLineNo">060</span> writeRoot(blockIndexChunk, out);<a name="line.60"></a> |
| <span class="sourceLineNo">061</span> } else {<a name="line.61"></a> |
| <span class="sourceLineNo">062</span> writeNonRoot(blockIndexChunk, out);<a name="line.62"></a> |
| <span class="sourceLineNo">063</span> }<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> /**<a name="line.66"></a> |
| <span class="sourceLineNo">067</span> * Writes the block index chunk in the non-root index block format. This format contains the<a name="line.67"></a> |
| <span class="sourceLineNo">068</span> * number of entries, an index of integer offsets for quick binary search on variable-length<a name="line.68"></a> |
| <span class="sourceLineNo">069</span> * records, and tuples of block offset, on-disk block size, and the first key for each entry.<a name="line.69"></a> |
| <span class="sourceLineNo">070</span> */<a name="line.70"></a> |
| <span class="sourceLineNo">071</span> private void writeNonRoot(BlockIndexChunk blockIndexChunk, DataOutput out) throws IOException {<a name="line.71"></a> |
| <span class="sourceLineNo">072</span> // The number of entries in the block.<a name="line.72"></a> |
| <span class="sourceLineNo">073</span> out.writeInt(blockIndexChunk.getNumEntries());<a name="line.73"></a> |
| <span class="sourceLineNo">074</span><a name="line.74"></a> |
| <span class="sourceLineNo">075</span> if (<a name="line.75"></a> |
| <span class="sourceLineNo">076</span> blockIndexChunk.getSecondaryIndexOffsetMarks().size() != blockIndexChunk.getBlockKeys().size()<a name="line.76"></a> |
| <span class="sourceLineNo">077</span> ) {<a name="line.77"></a> |
| <span class="sourceLineNo">078</span> throw new IOException("Corrupted block index chunk writer: "<a name="line.78"></a> |
| <span class="sourceLineNo">079</span> + blockIndexChunk.getBlockKeys().size() + " entries but "<a name="line.79"></a> |
| <span class="sourceLineNo">080</span> + blockIndexChunk.getSecondaryIndexOffsetMarks().size() + " secondary index items");<a name="line.80"></a> |
| <span class="sourceLineNo">081</span> }<a name="line.81"></a> |
| <span class="sourceLineNo">082</span><a name="line.82"></a> |
| <span class="sourceLineNo">083</span> // For each entry, write a "secondary index" of relative offsets to the<a name="line.83"></a> |
| <span class="sourceLineNo">084</span> // entries from the end of the secondary index. This works, because at<a name="line.84"></a> |
| <span class="sourceLineNo">085</span> // read time we read the number of entries and know where the secondary<a name="line.85"></a> |
| <span class="sourceLineNo">086</span> // index ends.<a name="line.86"></a> |
| <span class="sourceLineNo">087</span> for (int currentSecondaryIndex : blockIndexChunk.getSecondaryIndexOffsetMarks())<a name="line.87"></a> |
| <span class="sourceLineNo">088</span> out.writeInt(currentSecondaryIndex);<a name="line.88"></a> |
| <span class="sourceLineNo">089</span><a name="line.89"></a> |
| <span class="sourceLineNo">090</span> // We include one other element in the secondary index to calculate the<a name="line.90"></a> |
| <span class="sourceLineNo">091</span> // size of each entry more easily by subtracting secondary index elements.<a name="line.91"></a> |
| <span class="sourceLineNo">092</span> out.writeInt(blockIndexChunk.getCurTotalNonRootEntrySize());<a name="line.92"></a> |
| <span class="sourceLineNo">093</span><a name="line.93"></a> |
| <span class="sourceLineNo">094</span> for (int i = 0; i < blockIndexChunk.getNumEntries(); ++i) {<a name="line.94"></a> |
| <span class="sourceLineNo">095</span> out.writeLong(blockIndexChunk.getBlockOffset(i));<a name="line.95"></a> |
| <span class="sourceLineNo">096</span> out.writeInt(blockIndexChunk.getOnDiskDataSize(i));<a name="line.96"></a> |
| <span class="sourceLineNo">097</span> out.write(blockIndexChunk.getBlockKey(i));<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><a name="line.100"></a> |
| <span class="sourceLineNo">101</span> /**<a name="line.101"></a> |
| <span class="sourceLineNo">102</span> * Writes this chunk into the given output stream in the root block index format. This format is<a name="line.102"></a> |
| <span class="sourceLineNo">103</span> * similar to the {@link HFile} version 1 block index format, except that we store on-disk size of<a name="line.103"></a> |
| <span class="sourceLineNo">104</span> * the block instead of its uncompressed size.<a name="line.104"></a> |
| <span class="sourceLineNo">105</span> * @param out the data output stream to write the block index to. Typically a stream writing into<a name="line.105"></a> |
| <span class="sourceLineNo">106</span> * an {@link HFile} block.<a name="line.106"></a> |
| <span class="sourceLineNo">107</span> */<a name="line.107"></a> |
| <span class="sourceLineNo">108</span> private void writeRoot(BlockIndexChunk blockIndexChunk, DataOutput out) throws IOException {<a name="line.108"></a> |
| <span class="sourceLineNo">109</span> for (int i = 0; i < blockIndexChunk.getNumEntries(); ++i) {<a name="line.109"></a> |
| <span class="sourceLineNo">110</span> out.writeLong(blockIndexChunk.getBlockOffset(i));<a name="line.110"></a> |
| <span class="sourceLineNo">111</span> out.writeInt(blockIndexChunk.getOnDiskDataSize(i));<a name="line.111"></a> |
| <span class="sourceLineNo">112</span> Bytes.writeByteArray(out, blockIndexChunk.getBlockKey(i));<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><a name="line.115"></a> |
| <span class="sourceLineNo">116</span> @Override<a name="line.116"></a> |
| <span class="sourceLineNo">117</span> public IndexBlockEncoding getIndexBlockEncoding() {<a name="line.117"></a> |
| <span class="sourceLineNo">118</span> return IndexBlockEncoding.NONE;<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> @Override<a name="line.121"></a> |
| <span class="sourceLineNo">122</span> public EncodedSeeker createSeeker() {<a name="line.122"></a> |
| <span class="sourceLineNo">123</span> return new NoOpEncodedSeeker();<a name="line.123"></a> |
| <span class="sourceLineNo">124</span> }<a name="line.124"></a> |
| <span class="sourceLineNo">125</span><a name="line.125"></a> |
| <span class="sourceLineNo">126</span> @Override<a name="line.126"></a> |
| <span class="sourceLineNo">127</span> public String toString() {<a name="line.127"></a> |
| <span class="sourceLineNo">128</span> return getClass().getSimpleName();<a name="line.128"></a> |
| <span class="sourceLineNo">129</span> }<a name="line.129"></a> |
| <span class="sourceLineNo">130</span><a name="line.130"></a> |
| <span class="sourceLineNo">131</span> protected static class NoOpEncodedSeeker implements EncodedSeeker {<a name="line.131"></a> |
| <span class="sourceLineNo">132</span><a name="line.132"></a> |
| <span class="sourceLineNo">133</span> protected long[] blockOffsets;<a name="line.133"></a> |
| <span class="sourceLineNo">134</span> protected int[] blockDataSizes;<a name="line.134"></a> |
| <span class="sourceLineNo">135</span> protected int rootCount = 0;<a name="line.135"></a> |
| <span class="sourceLineNo">136</span><a name="line.136"></a> |
| <span class="sourceLineNo">137</span> // Mid-key metadata.<a name="line.137"></a> |
| <span class="sourceLineNo">138</span> protected long midLeafBlockOffset = -1;<a name="line.138"></a> |
| <span class="sourceLineNo">139</span> protected int midLeafBlockOnDiskSize = -1;<a name="line.139"></a> |
| <span class="sourceLineNo">140</span> protected int midKeyEntry = -1;<a name="line.140"></a> |
| <span class="sourceLineNo">141</span><a name="line.141"></a> |
| <span class="sourceLineNo">142</span> private Cell[] blockKeys;<a name="line.142"></a> |
| <span class="sourceLineNo">143</span> private CellComparator comparator;<a name="line.143"></a> |
| <span class="sourceLineNo">144</span> protected int searchTreeLevel;<a name="line.144"></a> |
| <span class="sourceLineNo">145</span><a name="line.145"></a> |
| <span class="sourceLineNo">146</span> /** Pre-computed mid-key */<a name="line.146"></a> |
| <span class="sourceLineNo">147</span> private AtomicReference<Cell> midKey = new AtomicReference<>();<a name="line.147"></a> |
| <span class="sourceLineNo">148</span><a name="line.148"></a> |
| <span class="sourceLineNo">149</span> @Override<a name="line.149"></a> |
| <span class="sourceLineNo">150</span> public long heapSize() {<a name="line.150"></a> |
| <span class="sourceLineNo">151</span> long heapSize = ClassSize.align(ClassSize.OBJECT);<a name="line.151"></a> |
| <span class="sourceLineNo">152</span><a name="line.152"></a> |
| <span class="sourceLineNo">153</span> // Mid-key metadata.<a name="line.153"></a> |
| <span class="sourceLineNo">154</span> heapSize += MID_KEY_METADATA_SIZE;<a name="line.154"></a> |
| <span class="sourceLineNo">155</span><a name="line.155"></a> |
| <span class="sourceLineNo">156</span> if (blockOffsets != null) {<a name="line.156"></a> |
| <span class="sourceLineNo">157</span> heapSize += ClassSize.align(ClassSize.ARRAY + blockOffsets.length * Bytes.SIZEOF_LONG);<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> if (blockDataSizes != null) {<a name="line.160"></a> |
| <span class="sourceLineNo">161</span> heapSize += ClassSize.align(ClassSize.ARRAY + blockDataSizes.length * Bytes.SIZEOF_INT);<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> if (blockKeys != null) {<a name="line.164"></a> |
| <span class="sourceLineNo">165</span> heapSize += ClassSize.REFERENCE;<a name="line.165"></a> |
| <span class="sourceLineNo">166</span> // Adding array + references overhead<a name="line.166"></a> |
| <span class="sourceLineNo">167</span> heapSize += ClassSize.align(ClassSize.ARRAY + blockKeys.length * ClassSize.REFERENCE);<a name="line.167"></a> |
| <span class="sourceLineNo">168</span><a name="line.168"></a> |
| <span class="sourceLineNo">169</span> // Adding blockKeys<a name="line.169"></a> |
| <span class="sourceLineNo">170</span> for (Cell key : blockKeys) {<a name="line.170"></a> |
| <span class="sourceLineNo">171</span> heapSize += ClassSize.align(key.heapSize());<a name="line.171"></a> |
| <span class="sourceLineNo">172</span> }<a name="line.172"></a> |
| <span class="sourceLineNo">173</span> }<a name="line.173"></a> |
| <span class="sourceLineNo">174</span> // Add comparator and the midkey atomicreference<a name="line.174"></a> |
| <span class="sourceLineNo">175</span> heapSize += 2 * ClassSize.REFERENCE;<a name="line.175"></a> |
| <span class="sourceLineNo">176</span> // Add rootCount and searchTreeLevel<a name="line.176"></a> |
| <span class="sourceLineNo">177</span> heapSize += 2 * Bytes.SIZEOF_INT;<a name="line.177"></a> |
| <span class="sourceLineNo">178</span><a name="line.178"></a> |
| <span class="sourceLineNo">179</span> return ClassSize.align(heapSize);<a name="line.179"></a> |
| <span class="sourceLineNo">180</span> }<a name="line.180"></a> |
| <span class="sourceLineNo">181</span><a name="line.181"></a> |
| <span class="sourceLineNo">182</span> @Override<a name="line.182"></a> |
| <span class="sourceLineNo">183</span> public boolean isEmpty() {<a name="line.183"></a> |
| <span class="sourceLineNo">184</span> return blockKeys.length == 0;<a name="line.184"></a> |
| <span class="sourceLineNo">185</span> }<a name="line.185"></a> |
| <span class="sourceLineNo">186</span><a name="line.186"></a> |
| <span class="sourceLineNo">187</span> @Override<a name="line.187"></a> |
| <span class="sourceLineNo">188</span> public Cell getRootBlockKey(int i) {<a name="line.188"></a> |
| <span class="sourceLineNo">189</span> return blockKeys[i];<a name="line.189"></a> |
| <span class="sourceLineNo">190</span> }<a name="line.190"></a> |
| <span class="sourceLineNo">191</span><a name="line.191"></a> |
| <span class="sourceLineNo">192</span> @Override<a name="line.192"></a> |
| <span class="sourceLineNo">193</span> public int getRootBlockCount() {<a name="line.193"></a> |
| <span class="sourceLineNo">194</span> return rootCount;<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> @Override<a name="line.197"></a> |
| <span class="sourceLineNo">198</span> public void initRootIndex(HFileBlock blk, int numEntries, CellComparator comparator,<a name="line.198"></a> |
| <span class="sourceLineNo">199</span> int treeLevel) throws IOException {<a name="line.199"></a> |
| <span class="sourceLineNo">200</span> this.comparator = comparator;<a name="line.200"></a> |
| <span class="sourceLineNo">201</span> this.searchTreeLevel = treeLevel;<a name="line.201"></a> |
| <span class="sourceLineNo">202</span> init(blk, numEntries);<a name="line.202"></a> |
| <span class="sourceLineNo">203</span> }<a name="line.203"></a> |
| <span class="sourceLineNo">204</span><a name="line.204"></a> |
| <span class="sourceLineNo">205</span> private void init(HFileBlock blk, int numEntries) throws IOException {<a name="line.205"></a> |
| <span class="sourceLineNo">206</span> DataInputStream in = readRootIndex(blk, numEntries);<a name="line.206"></a> |
| <span class="sourceLineNo">207</span> // after reading the root index the checksum bytes have to<a name="line.207"></a> |
| <span class="sourceLineNo">208</span> // be subtracted to know if the mid key exists.<a name="line.208"></a> |
| <span class="sourceLineNo">209</span> int checkSumBytes = blk.totalChecksumBytes();<a name="line.209"></a> |
| <span class="sourceLineNo">210</span> if ((in.available() - checkSumBytes) < MID_KEY_METADATA_SIZE) {<a name="line.210"></a> |
| <span class="sourceLineNo">211</span> // No mid-key metadata available.<a name="line.211"></a> |
| <span class="sourceLineNo">212</span> return;<a name="line.212"></a> |
| <span class="sourceLineNo">213</span> }<a name="line.213"></a> |
| <span class="sourceLineNo">214</span> midLeafBlockOffset = in.readLong();<a name="line.214"></a> |
| <span class="sourceLineNo">215</span> midLeafBlockOnDiskSize = in.readInt();<a name="line.215"></a> |
| <span class="sourceLineNo">216</span> midKeyEntry = in.readInt();<a name="line.216"></a> |
| <span class="sourceLineNo">217</span> }<a name="line.217"></a> |
| <span class="sourceLineNo">218</span><a name="line.218"></a> |
| <span class="sourceLineNo">219</span> private DataInputStream readRootIndex(HFileBlock blk, final int numEntries) throws IOException {<a name="line.219"></a> |
| <span class="sourceLineNo">220</span> DataInputStream in = blk.getByteStream();<a name="line.220"></a> |
| <span class="sourceLineNo">221</span> readRootIndex(in, numEntries);<a name="line.221"></a> |
| <span class="sourceLineNo">222</span> return in;<a name="line.222"></a> |
| <span class="sourceLineNo">223</span> }<a name="line.223"></a> |
| <span class="sourceLineNo">224</span><a name="line.224"></a> |
| <span class="sourceLineNo">225</span> private void readRootIndex(DataInput in, final int numEntries) throws IOException {<a name="line.225"></a> |
| <span class="sourceLineNo">226</span> blockOffsets = new long[numEntries];<a name="line.226"></a> |
| <span class="sourceLineNo">227</span> initialize(numEntries);<a name="line.227"></a> |
| <span class="sourceLineNo">228</span> blockDataSizes = new int[numEntries];<a name="line.228"></a> |
| <span class="sourceLineNo">229</span><a name="line.229"></a> |
| <span class="sourceLineNo">230</span> // If index size is zero, no index was written.<a name="line.230"></a> |
| <span class="sourceLineNo">231</span> if (numEntries > 0) {<a name="line.231"></a> |
| <span class="sourceLineNo">232</span> for (int i = 0; i < numEntries; ++i) {<a name="line.232"></a> |
| <span class="sourceLineNo">233</span> long offset = in.readLong();<a name="line.233"></a> |
| <span class="sourceLineNo">234</span> int dataSize = in.readInt();<a name="line.234"></a> |
| <span class="sourceLineNo">235</span> byte[] key = Bytes.readByteArray(in);<a name="line.235"></a> |
| <span class="sourceLineNo">236</span> add(key, offset, dataSize);<a name="line.236"></a> |
| <span class="sourceLineNo">237</span> }<a name="line.237"></a> |
| <span class="sourceLineNo">238</span> }<a name="line.238"></a> |
| <span class="sourceLineNo">239</span> }<a name="line.239"></a> |
| <span class="sourceLineNo">240</span><a name="line.240"></a> |
| <span class="sourceLineNo">241</span> private void initialize(int numEntries) {<a name="line.241"></a> |
| <span class="sourceLineNo">242</span> blockKeys = new Cell[numEntries];<a name="line.242"></a> |
| <span class="sourceLineNo">243</span> }<a name="line.243"></a> |
| <span class="sourceLineNo">244</span><a name="line.244"></a> |
| <span class="sourceLineNo">245</span> private void add(final byte[] key, final long offset, final int dataSize) {<a name="line.245"></a> |
| <span class="sourceLineNo">246</span> blockOffsets[rootCount] = offset;<a name="line.246"></a> |
| <span class="sourceLineNo">247</span> // Create the blockKeys as Cells once when the reader is opened<a name="line.247"></a> |
| <span class="sourceLineNo">248</span> blockKeys[rootCount] = new KeyValue.KeyOnlyKeyValue(key, 0, key.length);<a name="line.248"></a> |
| <span class="sourceLineNo">249</span> blockDataSizes[rootCount] = dataSize;<a name="line.249"></a> |
| <span class="sourceLineNo">250</span> rootCount++;<a name="line.250"></a> |
| <span class="sourceLineNo">251</span> }<a name="line.251"></a> |
| <span class="sourceLineNo">252</span><a name="line.252"></a> |
| <span class="sourceLineNo">253</span> @Override<a name="line.253"></a> |
| <span class="sourceLineNo">254</span> public Cell midkey(HFile.CachingBlockReader cachingBlockReader) throws IOException {<a name="line.254"></a> |
| <span class="sourceLineNo">255</span> if (rootCount == 0) throw new IOException("HFile empty");<a name="line.255"></a> |
| <span class="sourceLineNo">256</span><a name="line.256"></a> |
| <span class="sourceLineNo">257</span> Cell targetMidKey = this.midKey.get();<a name="line.257"></a> |
| <span class="sourceLineNo">258</span> if (targetMidKey != null) {<a name="line.258"></a> |
| <span class="sourceLineNo">259</span> return targetMidKey;<a name="line.259"></a> |
| <span class="sourceLineNo">260</span> }<a name="line.260"></a> |
| <span class="sourceLineNo">261</span><a name="line.261"></a> |
| <span class="sourceLineNo">262</span> if (midLeafBlockOffset >= 0) {<a name="line.262"></a> |
| <span class="sourceLineNo">263</span> if (cachingBlockReader == null) {<a name="line.263"></a> |
| <span class="sourceLineNo">264</span> throw new IOException(<a name="line.264"></a> |
| <span class="sourceLineNo">265</span> "Have to read the middle leaf block but " + "no block reader available");<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> // Caching, using pread, assuming this is not a compaction.<a name="line.268"></a> |
| <span class="sourceLineNo">269</span> HFileBlock midLeafBlock = cachingBlockReader.readBlock(midLeafBlockOffset,<a name="line.269"></a> |
| <span class="sourceLineNo">270</span> midLeafBlockOnDiskSize, true, true, false, true, BlockType.LEAF_INDEX, null);<a name="line.270"></a> |
| <span class="sourceLineNo">271</span> try {<a name="line.271"></a> |
| <span class="sourceLineNo">272</span> ByteBuff b = midLeafBlock.getBufferWithoutHeader();<a name="line.272"></a> |
| <span class="sourceLineNo">273</span> int numDataBlocks = b.getIntAfterPosition(0);<a name="line.273"></a> |
| <span class="sourceLineNo">274</span> int keyRelOffset = b.getIntAfterPosition(Bytes.SIZEOF_INT * (midKeyEntry + 1));<a name="line.274"></a> |
| <span class="sourceLineNo">275</span> int keyLen = b.getIntAfterPosition(Bytes.SIZEOF_INT * (midKeyEntry + 2)) - keyRelOffset<a name="line.275"></a> |
| <span class="sourceLineNo">276</span> - SECONDARY_INDEX_ENTRY_OVERHEAD;<a name="line.276"></a> |
| <span class="sourceLineNo">277</span> int keyOffset =<a name="line.277"></a> |
| <span class="sourceLineNo">278</span> Bytes.SIZEOF_INT * (numDataBlocks + 2) + keyRelOffset + SECONDARY_INDEX_ENTRY_OVERHEAD;<a name="line.278"></a> |
| <span class="sourceLineNo">279</span> byte[] bytes = b.toBytes(keyOffset, keyLen);<a name="line.279"></a> |
| <span class="sourceLineNo">280</span> targetMidKey = new KeyValue.KeyOnlyKeyValue(bytes, 0, bytes.length);<a name="line.280"></a> |
| <span class="sourceLineNo">281</span> } finally {<a name="line.281"></a> |
| <span class="sourceLineNo">282</span> midLeafBlock.release();<a name="line.282"></a> |
| <span class="sourceLineNo">283</span> }<a name="line.283"></a> |
| <span class="sourceLineNo">284</span> } else {<a name="line.284"></a> |
| <span class="sourceLineNo">285</span> // The middle of the root-level index.<a name="line.285"></a> |
| <span class="sourceLineNo">286</span> targetMidKey = blockKeys[rootCount / 2];<a name="line.286"></a> |
| <span class="sourceLineNo">287</span> }<a name="line.287"></a> |
| <span class="sourceLineNo">288</span><a name="line.288"></a> |
| <span class="sourceLineNo">289</span> this.midKey.set(targetMidKey);<a name="line.289"></a> |
| <span class="sourceLineNo">290</span> return targetMidKey;<a name="line.290"></a> |
| <span class="sourceLineNo">291</span> }<a name="line.291"></a> |
| <span class="sourceLineNo">292</span><a name="line.292"></a> |
| <span class="sourceLineNo">293</span> @Override<a name="line.293"></a> |
| <span class="sourceLineNo">294</span> public BlockWithScanInfo loadDataBlockWithScanInfo(Cell key, HFileBlock currentBlock,<a name="line.294"></a> |
| <span class="sourceLineNo">295</span> boolean cacheBlocks, boolean pread, boolean isCompaction,<a name="line.295"></a> |
| <span class="sourceLineNo">296</span> DataBlockEncoding expectedDataBlockEncoding, HFile.CachingBlockReader cachingBlockReader)<a name="line.296"></a> |
| <span class="sourceLineNo">297</span> throws IOException {<a name="line.297"></a> |
| <span class="sourceLineNo">298</span> int rootLevelIndex = rootBlockContainingKey(key);<a name="line.298"></a> |
| <span class="sourceLineNo">299</span> if (rootLevelIndex < 0 || rootLevelIndex >= blockOffsets.length) {<a name="line.299"></a> |
| <span class="sourceLineNo">300</span> return null;<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> // the next indexed key<a name="line.303"></a> |
| <span class="sourceLineNo">304</span> Cell nextIndexedKey = null;<a name="line.304"></a> |
| <span class="sourceLineNo">305</span><a name="line.305"></a> |
| <span class="sourceLineNo">306</span> // Read the next-level (intermediate or leaf) index block.<a name="line.306"></a> |
| <span class="sourceLineNo">307</span> long currentOffset = blockOffsets[rootLevelIndex];<a name="line.307"></a> |
| <span class="sourceLineNo">308</span> int currentOnDiskSize = blockDataSizes[rootLevelIndex];<a name="line.308"></a> |
| <span class="sourceLineNo">309</span><a name="line.309"></a> |
| <span class="sourceLineNo">310</span> if (rootLevelIndex < blockKeys.length - 1) {<a name="line.310"></a> |
| <span class="sourceLineNo">311</span> nextIndexedKey = blockKeys[rootLevelIndex + 1];<a name="line.311"></a> |
| <span class="sourceLineNo">312</span> } else {<a name="line.312"></a> |
| <span class="sourceLineNo">313</span> nextIndexedKey = KeyValueScanner.NO_NEXT_INDEXED_KEY;<a name="line.313"></a> |
| <span class="sourceLineNo">314</span> }<a name="line.314"></a> |
| <span class="sourceLineNo">315</span><a name="line.315"></a> |
| <span class="sourceLineNo">316</span> int lookupLevel = 1; // How many levels deep we are in our lookup.<a name="line.316"></a> |
| <span class="sourceLineNo">317</span> int index = -1;<a name="line.317"></a> |
| <span class="sourceLineNo">318</span><a name="line.318"></a> |
| <span class="sourceLineNo">319</span> HFileBlock block = null;<a name="line.319"></a> |
| <span class="sourceLineNo">320</span> KeyValue.KeyOnlyKeyValue tmpNextIndexKV = new KeyValue.KeyOnlyKeyValue();<a name="line.320"></a> |
| <span class="sourceLineNo">321</span> while (true) {<a name="line.321"></a> |
| <span class="sourceLineNo">322</span> try {<a name="line.322"></a> |
| <span class="sourceLineNo">323</span> // Must initialize it with null here, because if don't and once an exception happen in<a name="line.323"></a> |
| <span class="sourceLineNo">324</span> // readBlock, then we'll release the previous assigned block twice in the finally block.<a name="line.324"></a> |
| <span class="sourceLineNo">325</span> // (See HBASE-22422)<a name="line.325"></a> |
| <span class="sourceLineNo">326</span> block = null;<a name="line.326"></a> |
| <span class="sourceLineNo">327</span> if (currentBlock != null && currentBlock.getOffset() == currentOffset) {<a name="line.327"></a> |
| <span class="sourceLineNo">328</span> // Avoid reading the same block again, even with caching turned off.<a name="line.328"></a> |
| <span class="sourceLineNo">329</span> // This is crucial for compaction-type workload which might have<a name="line.329"></a> |
| <span class="sourceLineNo">330</span> // caching turned off. This is like a one-block cache inside the<a name="line.330"></a> |
| <span class="sourceLineNo">331</span> // scanner.<a name="line.331"></a> |
| <span class="sourceLineNo">332</span> block = currentBlock;<a name="line.332"></a> |
| <span class="sourceLineNo">333</span> } else {<a name="line.333"></a> |
| <span class="sourceLineNo">334</span> // Call HFile's caching block reader API. We always cache index<a name="line.334"></a> |
| <span class="sourceLineNo">335</span> // blocks, otherwise we might get terrible performance.<a name="line.335"></a> |
| <span class="sourceLineNo">336</span> boolean shouldCache = cacheBlocks || (lookupLevel < searchTreeLevel);<a name="line.336"></a> |
| <span class="sourceLineNo">337</span> BlockType expectedBlockType;<a name="line.337"></a> |
| <span class="sourceLineNo">338</span> if (lookupLevel < searchTreeLevel - 1) {<a name="line.338"></a> |
| <span class="sourceLineNo">339</span> expectedBlockType = BlockType.INTERMEDIATE_INDEX;<a name="line.339"></a> |
| <span class="sourceLineNo">340</span> } else if (lookupLevel == searchTreeLevel - 1) {<a name="line.340"></a> |
| <span class="sourceLineNo">341</span> expectedBlockType = BlockType.LEAF_INDEX;<a name="line.341"></a> |
| <span class="sourceLineNo">342</span> } else {<a name="line.342"></a> |
| <span class="sourceLineNo">343</span> // this also accounts for ENCODED_DATA<a name="line.343"></a> |
| <span class="sourceLineNo">344</span> expectedBlockType = BlockType.DATA;<a name="line.344"></a> |
| <span class="sourceLineNo">345</span> }<a name="line.345"></a> |
| <span class="sourceLineNo">346</span> block = cachingBlockReader.readBlock(currentOffset, currentOnDiskSize, shouldCache,<a name="line.346"></a> |
| <span class="sourceLineNo">347</span> pread, isCompaction, true, expectedBlockType, expectedDataBlockEncoding);<a name="line.347"></a> |
| <span class="sourceLineNo">348</span> }<a name="line.348"></a> |
| <span class="sourceLineNo">349</span><a name="line.349"></a> |
| <span class="sourceLineNo">350</span> if (block == null) {<a name="line.350"></a> |
| <span class="sourceLineNo">351</span> throw new IOException("Failed to read block at offset " + currentOffset<a name="line.351"></a> |
| <span class="sourceLineNo">352</span> + ", onDiskSize=" + currentOnDiskSize);<a name="line.352"></a> |
| <span class="sourceLineNo">353</span> }<a name="line.353"></a> |
| <span class="sourceLineNo">354</span><a name="line.354"></a> |
| <span class="sourceLineNo">355</span> // Found a data block, break the loop and check our level in the tree.<a name="line.355"></a> |
| <span class="sourceLineNo">356</span> if (block.getBlockType().isData()) {<a name="line.356"></a> |
| <span class="sourceLineNo">357</span> break;<a name="line.357"></a> |
| <span class="sourceLineNo">358</span> }<a name="line.358"></a> |
| <span class="sourceLineNo">359</span><a name="line.359"></a> |
| <span class="sourceLineNo">360</span> // Not a data block. This must be a leaf-level or intermediate-level<a name="line.360"></a> |
| <span class="sourceLineNo">361</span> // index block. We don't allow going deeper than searchTreeLevel.<a name="line.361"></a> |
| <span class="sourceLineNo">362</span> if (++lookupLevel > searchTreeLevel) {<a name="line.362"></a> |
| <span class="sourceLineNo">363</span> throw new IOException("Search Tree Level overflow: lookupLevel=" + lookupLevel<a name="line.363"></a> |
| <span class="sourceLineNo">364</span> + ", searchTreeLevel=" + searchTreeLevel);<a name="line.364"></a> |
| <span class="sourceLineNo">365</span> }<a name="line.365"></a> |
| <span class="sourceLineNo">366</span><a name="line.366"></a> |
| <span class="sourceLineNo">367</span> // Locate the entry corresponding to the given key in the non-root<a name="line.367"></a> |
| <span class="sourceLineNo">368</span> // (leaf or intermediate-level) index block.<a name="line.368"></a> |
| <span class="sourceLineNo">369</span> ByteBuff buffer = block.getBufferWithoutHeader();<a name="line.369"></a> |
| <span class="sourceLineNo">370</span> index = HFileBlockIndex.BlockIndexReader.locateNonRootIndexEntry(buffer, key, comparator);<a name="line.370"></a> |
| <span class="sourceLineNo">371</span> if (index == -1) {<a name="line.371"></a> |
| <span class="sourceLineNo">372</span> // This has to be changed<a name="line.372"></a> |
| <span class="sourceLineNo">373</span> // For now change this to key value<a name="line.373"></a> |
| <span class="sourceLineNo">374</span> throw new IOException("The key " + CellUtil.getCellKeyAsString(key) + " is before the"<a name="line.374"></a> |
| <span class="sourceLineNo">375</span> + " first key of the non-root index block " + block);<a name="line.375"></a> |
| <span class="sourceLineNo">376</span> }<a name="line.376"></a> |
| <span class="sourceLineNo">377</span><a name="line.377"></a> |
| <span class="sourceLineNo">378</span> currentOffset = buffer.getLong();<a name="line.378"></a> |
| <span class="sourceLineNo">379</span> currentOnDiskSize = buffer.getInt();<a name="line.379"></a> |
| <span class="sourceLineNo">380</span><a name="line.380"></a> |
| <span class="sourceLineNo">381</span> // Only update next indexed key if there is a next indexed key in the current level<a name="line.381"></a> |
| <span class="sourceLineNo">382</span> byte[] nonRootIndexedKey = getNonRootIndexedKey(buffer, index + 1);<a name="line.382"></a> |
| <span class="sourceLineNo">383</span> if (nonRootIndexedKey != null) {<a name="line.383"></a> |
| <span class="sourceLineNo">384</span> tmpNextIndexKV.setKey(nonRootIndexedKey, 0, nonRootIndexedKey.length);<a name="line.384"></a> |
| <span class="sourceLineNo">385</span> nextIndexedKey = tmpNextIndexKV;<a name="line.385"></a> |
| <span class="sourceLineNo">386</span> }<a name="line.386"></a> |
| <span class="sourceLineNo">387</span> } finally {<a name="line.387"></a> |
| <span class="sourceLineNo">388</span> if (block != null && !block.getBlockType().isData()) {<a name="line.388"></a> |
| <span class="sourceLineNo">389</span> // Release the block immediately if it is not the data block<a name="line.389"></a> |
| <span class="sourceLineNo">390</span> block.release();<a name="line.390"></a> |
| <span class="sourceLineNo">391</span> }<a name="line.391"></a> |
| <span class="sourceLineNo">392</span> }<a name="line.392"></a> |
| <span class="sourceLineNo">393</span> }<a name="line.393"></a> |
| <span class="sourceLineNo">394</span><a name="line.394"></a> |
| <span class="sourceLineNo">395</span> if (lookupLevel != searchTreeLevel) {<a name="line.395"></a> |
| <span class="sourceLineNo">396</span> assert block.getBlockType().isData();<a name="line.396"></a> |
| <span class="sourceLineNo">397</span> // Though we have retrieved a data block we have found an issue<a name="line.397"></a> |
| <span class="sourceLineNo">398</span> // in the retrieved data block. Hence returned the block so that<a name="line.398"></a> |
| <span class="sourceLineNo">399</span> // the ref count can be decremented<a name="line.399"></a> |
| <span class="sourceLineNo">400</span> if (block != null) {<a name="line.400"></a> |
| <span class="sourceLineNo">401</span> block.release();<a name="line.401"></a> |
| <span class="sourceLineNo">402</span> }<a name="line.402"></a> |
| <span class="sourceLineNo">403</span> throw new IOException("Reached a data block at level " + lookupLevel<a name="line.403"></a> |
| <span class="sourceLineNo">404</span> + " but the number of levels is " + searchTreeLevel);<a name="line.404"></a> |
| <span class="sourceLineNo">405</span> }<a name="line.405"></a> |
| <span class="sourceLineNo">406</span><a name="line.406"></a> |
| <span class="sourceLineNo">407</span> // set the next indexed key for the current block.<a name="line.407"></a> |
| <span class="sourceLineNo">408</span> return new BlockWithScanInfo(block, nextIndexedKey);<a name="line.408"></a> |
| <span class="sourceLineNo">409</span> }<a name="line.409"></a> |
| <span class="sourceLineNo">410</span><a name="line.410"></a> |
| <span class="sourceLineNo">411</span> @Override<a name="line.411"></a> |
| <span class="sourceLineNo">412</span> public int rootBlockContainingKey(Cell key) {<a name="line.412"></a> |
| <span class="sourceLineNo">413</span> // Here the comparator should not be null as this happens for the root-level block<a name="line.413"></a> |
| <span class="sourceLineNo">414</span> int pos = Bytes.binarySearch(blockKeys, key, comparator);<a name="line.414"></a> |
| <span class="sourceLineNo">415</span> // pos is between -(blockKeys.length + 1) to blockKeys.length - 1, see<a name="line.415"></a> |
| <span class="sourceLineNo">416</span> // binarySearch's javadoc.<a name="line.416"></a> |
| <span class="sourceLineNo">417</span><a name="line.417"></a> |
| <span class="sourceLineNo">418</span> if (pos >= 0) {<a name="line.418"></a> |
| <span class="sourceLineNo">419</span> // This means this is an exact match with an element of blockKeys.<a name="line.419"></a> |
| <span class="sourceLineNo">420</span> assert pos < blockKeys.length;<a name="line.420"></a> |
| <span class="sourceLineNo">421</span> return pos;<a name="line.421"></a> |
| <span class="sourceLineNo">422</span> }<a name="line.422"></a> |
| <span class="sourceLineNo">423</span><a name="line.423"></a> |
| <span class="sourceLineNo">424</span> // Otherwise, pos = -(i + 1), where blockKeys[i - 1] < key < blockKeys[i],<a name="line.424"></a> |
| <span class="sourceLineNo">425</span> // and i is in [0, blockKeys.length]. We are returning j = i - 1 such that<a name="line.425"></a> |
| <span class="sourceLineNo">426</span> // blockKeys[j] <= key < blockKeys[j + 1]. In particular, j = -1 if<a name="line.426"></a> |
| <span class="sourceLineNo">427</span> // key < blockKeys[0], meaning the file does not contain the given key.<a name="line.427"></a> |
| <span class="sourceLineNo">428</span><a name="line.428"></a> |
| <span class="sourceLineNo">429</span> int i = -pos - 1;<a name="line.429"></a> |
| <span class="sourceLineNo">430</span> assert 0 <= i && i <= blockKeys.length;<a name="line.430"></a> |
| <span class="sourceLineNo">431</span> return i - 1;<a name="line.431"></a> |
| <span class="sourceLineNo">432</span> }<a name="line.432"></a> |
| <span class="sourceLineNo">433</span><a name="line.433"></a> |
| <span class="sourceLineNo">434</span> @Override<a name="line.434"></a> |
| <span class="sourceLineNo">435</span> public String toString() {<a name="line.435"></a> |
| <span class="sourceLineNo">436</span> StringBuilder sb = new StringBuilder();<a name="line.436"></a> |
| <span class="sourceLineNo">437</span> sb.append("size=" + rootCount).append("\n");<a name="line.437"></a> |
| <span class="sourceLineNo">438</span> for (int i = 0; i < rootCount; i++) {<a name="line.438"></a> |
| <span class="sourceLineNo">439</span> sb.append("key=").append((blockKeys[i])).append("\n offset=").append(blockOffsets[i])<a name="line.439"></a> |
| <span class="sourceLineNo">440</span> .append(", dataSize=" + blockDataSizes[i]).append("\n");<a name="line.440"></a> |
| <span class="sourceLineNo">441</span> }<a name="line.441"></a> |
| <span class="sourceLineNo">442</span> return sb.toString();<a name="line.442"></a> |
| <span class="sourceLineNo">443</span> }<a name="line.443"></a> |
| <span class="sourceLineNo">444</span><a name="line.444"></a> |
| <span class="sourceLineNo">445</span> /**<a name="line.445"></a> |
| <span class="sourceLineNo">446</span> * The indexed key at the ith position in the nonRootIndex. The position starts at 0.<a name="line.446"></a> |
| <span class="sourceLineNo">447</span> * @param i the ith position<a name="line.447"></a> |
| <span class="sourceLineNo">448</span> * @return The indexed key at the ith position in the nonRootIndex.<a name="line.448"></a> |
| <span class="sourceLineNo">449</span> */<a name="line.449"></a> |
| <span class="sourceLineNo">450</span> protected byte[] getNonRootIndexedKey(ByteBuff nonRootIndex, int i) {<a name="line.450"></a> |
| <span class="sourceLineNo">451</span> int numEntries = nonRootIndex.getInt(0);<a name="line.451"></a> |
| <span class="sourceLineNo">452</span> if (i < 0 || i >= numEntries) {<a name="line.452"></a> |
| <span class="sourceLineNo">453</span> return null;<a name="line.453"></a> |
| <span class="sourceLineNo">454</span> }<a name="line.454"></a> |
| <span class="sourceLineNo">455</span><a name="line.455"></a> |
| <span class="sourceLineNo">456</span> // Entries start after the number of entries and the secondary index.<a name="line.456"></a> |
| <span class="sourceLineNo">457</span> // The secondary index takes numEntries + 1 ints.<a name="line.457"></a> |
| <span class="sourceLineNo">458</span> int entriesOffset = Bytes.SIZEOF_INT * (numEntries + 2);<a name="line.458"></a> |
| <span class="sourceLineNo">459</span> // Targetkey's offset relative to the end of secondary index<a name="line.459"></a> |
| <span class="sourceLineNo">460</span> int targetKeyRelOffset = nonRootIndex.getInt(Bytes.SIZEOF_INT * (i + 1));<a name="line.460"></a> |
| <span class="sourceLineNo">461</span><a name="line.461"></a> |
| <span class="sourceLineNo">462</span> // The offset of the target key in the blockIndex buffer<a name="line.462"></a> |
| <span class="sourceLineNo">463</span> int targetKeyOffset = entriesOffset // Skip secondary index<a name="line.463"></a> |
| <span class="sourceLineNo">464</span> + targetKeyRelOffset // Skip all entries until mid<a name="line.464"></a> |
| <span class="sourceLineNo">465</span> + SECONDARY_INDEX_ENTRY_OVERHEAD; // Skip offset and on-disk-size<a name="line.465"></a> |
| <span class="sourceLineNo">466</span><a name="line.466"></a> |
| <span class="sourceLineNo">467</span> // We subtract the two consecutive secondary index elements, which<a name="line.467"></a> |
| <span class="sourceLineNo">468</span> // gives us the size of the whole (offset, onDiskSize, key) tuple. We<a name="line.468"></a> |
| <span class="sourceLineNo">469</span> // then need to subtract the overhead of offset and onDiskSize.<a name="line.469"></a> |
| <span class="sourceLineNo">470</span> int targetKeyLength = nonRootIndex.getInt(Bytes.SIZEOF_INT * (i + 2)) - targetKeyRelOffset<a name="line.470"></a> |
| <span class="sourceLineNo">471</span> - SECONDARY_INDEX_ENTRY_OVERHEAD;<a name="line.471"></a> |
| <span class="sourceLineNo">472</span><a name="line.472"></a> |
| <span class="sourceLineNo">473</span> // TODO check whether we can make BB backed Cell here? So can avoid bytes copy.<a name="line.473"></a> |
| <span class="sourceLineNo">474</span> return nonRootIndex.toBytes(targetKeyOffset, targetKeyLength);<a name="line.474"></a> |
| <span class="sourceLineNo">475</span> }<a name="line.475"></a> |
| <span class="sourceLineNo">476</span> }<a name="line.476"></a> |
| <span class="sourceLineNo">477</span>}<a name="line.477"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </body> |
| </html> |
