<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /**<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
<FONT color="green">003</FONT>     * or more contributor license agreements.  See the NOTICE file<a name="line.3"></a>
<FONT color="green">004</FONT>     * distributed with this work for additional information<a name="line.4"></a>
<FONT color="green">005</FONT>     * regarding copyright ownership.  The ASF licenses this file<a name="line.5"></a>
<FONT color="green">006</FONT>     * to you under the Apache License, Version 2.0 (the<a name="line.6"></a>
<FONT color="green">007</FONT>     * "License"); you may not use this file except in compliance<a name="line.7"></a>
<FONT color="green">008</FONT>     * with the License.  You may obtain a copy of the License at<a name="line.8"></a>
<FONT color="green">009</FONT>     *<a name="line.9"></a>
<FONT color="green">010</FONT>     *     http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
<FONT color="green">011</FONT>     *<a name="line.11"></a>
<FONT color="green">012</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a>
<FONT color="green">013</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a>
<FONT color="green">014</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a>
<FONT color="green">015</FONT>     * See the License for the specific language governing permissions and<a name="line.15"></a>
<FONT color="green">016</FONT>     * limitations under the License.<a name="line.16"></a>
<FONT color="green">017</FONT>     */<a name="line.17"></a>
<FONT color="green">018</FONT>    <a name="line.18"></a>
<FONT color="green">019</FONT>    package org.apache.hadoop.mapreduce.lib.input;<a name="line.19"></a>
<FONT color="green">020</FONT>    <a name="line.20"></a>
<FONT color="green">021</FONT>    import java.io.IOException;<a name="line.21"></a>
<FONT color="green">022</FONT>    import java.util.ArrayList;<a name="line.22"></a>
<FONT color="green">023</FONT>    import java.util.Collection;<a name="line.23"></a>
<FONT color="green">024</FONT>    import java.util.LinkedList;<a name="line.24"></a>
<FONT color="green">025</FONT>    import java.util.HashSet;<a name="line.25"></a>
<FONT color="green">026</FONT>    import java.util.List;<a name="line.26"></a>
<FONT color="green">027</FONT>    import java.util.HashMap;<a name="line.27"></a>
<FONT color="green">028</FONT>    import java.util.Set;<a name="line.28"></a>
<FONT color="green">029</FONT>    import java.util.Iterator;<a name="line.29"></a>
<FONT color="green">030</FONT>    import java.util.Map;<a name="line.30"></a>
<FONT color="green">031</FONT>    <a name="line.31"></a>
<FONT color="green">032</FONT>    import org.apache.hadoop.classification.InterfaceAudience;<a name="line.32"></a>
<FONT color="green">033</FONT>    import org.apache.hadoop.classification.InterfaceStability;<a name="line.33"></a>
<FONT color="green">034</FONT>    import org.apache.hadoop.conf.Configuration;<a name="line.34"></a>
<FONT color="green">035</FONT>    import org.apache.hadoop.fs.FileSystem;<a name="line.35"></a>
<FONT color="green">036</FONT>    import org.apache.hadoop.fs.FileUtil;<a name="line.36"></a>
<FONT color="green">037</FONT>    import org.apache.hadoop.fs.Path;<a name="line.37"></a>
<FONT color="green">038</FONT>    import org.apache.hadoop.fs.BlockLocation;<a name="line.38"></a>
<FONT color="green">039</FONT>    import org.apache.hadoop.fs.FileStatus;<a name="line.39"></a>
<FONT color="green">040</FONT>    import org.apache.hadoop.fs.PathFilter;<a name="line.40"></a>
<FONT color="green">041</FONT>    import org.apache.hadoop.io.compress.CompressionCodec;<a name="line.41"></a>
<FONT color="green">042</FONT>    import org.apache.hadoop.io.compress.CompressionCodecFactory;<a name="line.42"></a>
<FONT color="green">043</FONT>    import org.apache.hadoop.io.compress.SplittableCompressionCodec;<a name="line.43"></a>
<FONT color="green">044</FONT>    import org.apache.hadoop.mapreduce.InputFormat;<a name="line.44"></a>
<FONT color="green">045</FONT>    import org.apache.hadoop.mapreduce.InputSplit;<a name="line.45"></a>
<FONT color="green">046</FONT>    import org.apache.hadoop.mapreduce.JobContext;<a name="line.46"></a>
<FONT color="green">047</FONT>    import org.apache.hadoop.mapreduce.RecordReader;<a name="line.47"></a>
<FONT color="green">048</FONT>    import org.apache.hadoop.mapreduce.TaskAttemptContext;<a name="line.48"></a>
<FONT color="green">049</FONT>    import org.apache.hadoop.net.NodeBase;<a name="line.49"></a>
<FONT color="green">050</FONT>    import org.apache.hadoop.net.NetworkTopology;<a name="line.50"></a>
<FONT color="green">051</FONT>    <a name="line.51"></a>
<FONT color="green">052</FONT>    /**<a name="line.52"></a>
<FONT color="green">053</FONT>     * An abstract {@link InputFormat} that returns {@link CombineFileSplit}'s in <a name="line.53"></a>
<FONT color="green">054</FONT>     * {@link InputFormat#getSplits(JobContext)} method. <a name="line.54"></a>
<FONT color="green">055</FONT>     * <a name="line.55"></a>
<FONT color="green">056</FONT>     * Splits are constructed from the files under the input paths. <a name="line.56"></a>
<FONT color="green">057</FONT>     * A split cannot have files from different pools.<a name="line.57"></a>
<FONT color="green">058</FONT>     * Each split returned may contain blocks from different files.<a name="line.58"></a>
<FONT color="green">059</FONT>     * If a maxSplitSize is specified, then blocks on the same node are<a name="line.59"></a>
<FONT color="green">060</FONT>     * combined to form a single split. Blocks that are left over are<a name="line.60"></a>
<FONT color="green">061</FONT>     * then combined with other blocks in the same rack. <a name="line.61"></a>
<FONT color="green">062</FONT>     * If maxSplitSize is not specified, then blocks from the same rack<a name="line.62"></a>
<FONT color="green">063</FONT>     * are combined in a single split; no attempt is made to create<a name="line.63"></a>
<FONT color="green">064</FONT>     * node-local splits.<a name="line.64"></a>
<FONT color="green">065</FONT>     * If the maxSplitSize is equal to the block size, then this class<a name="line.65"></a>
<FONT color="green">066</FONT>     * is similar to the default splitting behavior in Hadoop: each<a name="line.66"></a>
<FONT color="green">067</FONT>     * block is a locally processed split.<a name="line.67"></a>
<FONT color="green">068</FONT>     * Subclasses implement <a name="line.68"></a>
<FONT color="green">069</FONT>     * {@link InputFormat#createRecordReader(InputSplit, TaskAttemptContext)}<a name="line.69"></a>
<FONT color="green">070</FONT>     * to construct &lt;code&gt;RecordReader&lt;/code&gt;'s for <a name="line.70"></a>
<FONT color="green">071</FONT>     * &lt;code&gt;CombineFileSplit&lt;/code&gt;'s.<a name="line.71"></a>
<FONT color="green">072</FONT>     * <a name="line.72"></a>
<FONT color="green">073</FONT>     * @see CombineFileSplit<a name="line.73"></a>
<FONT color="green">074</FONT>     */<a name="line.74"></a>
<FONT color="green">075</FONT>    @InterfaceAudience.Public<a name="line.75"></a>
<FONT color="green">076</FONT>    @InterfaceStability.Stable<a name="line.76"></a>
<FONT color="green">077</FONT>    public abstract class CombineFileInputFormat&lt;K, V&gt;<a name="line.77"></a>
<FONT color="green">078</FONT>      extends FileInputFormat&lt;K, V&gt; {<a name="line.78"></a>
<FONT color="green">079</FONT>    <a name="line.79"></a>
<FONT color="green">080</FONT>      public static final String SPLIT_MINSIZE_PERNODE = <a name="line.80"></a>
<FONT color="green">081</FONT>        "mapreduce.input.fileinputformat.split.minsize.per.node";<a name="line.81"></a>
<FONT color="green">082</FONT>      public static final String SPLIT_MINSIZE_PERRACK = <a name="line.82"></a>
<FONT color="green">083</FONT>        "mapreduce.input.fileinputformat.split.minsize.per.rack";<a name="line.83"></a>
<FONT color="green">084</FONT>      // ability to limit the size of a single split<a name="line.84"></a>
<FONT color="green">085</FONT>      private long maxSplitSize = 0;<a name="line.85"></a>
<FONT color="green">086</FONT>      private long minSplitSizeNode = 0;<a name="line.86"></a>
<FONT color="green">087</FONT>      private long minSplitSizeRack = 0;<a name="line.87"></a>
<FONT color="green">088</FONT>    <a name="line.88"></a>
<FONT color="green">089</FONT>      // A pool of input paths filters. A split cannot have blocks from files<a name="line.89"></a>
<FONT color="green">090</FONT>      // across multiple pools.<a name="line.90"></a>
<FONT color="green">091</FONT>      private ArrayList&lt;MultiPathFilter&gt; pools = new  ArrayList&lt;MultiPathFilter&gt;();<a name="line.91"></a>
<FONT color="green">092</FONT>    <a name="line.92"></a>
<FONT color="green">093</FONT>      // mapping from a rack name to the set of Nodes in the rack <a name="line.93"></a>
<FONT color="green">094</FONT>      private HashMap&lt;String, Set&lt;String&gt;&gt; rackToNodes = <a name="line.94"></a>
<FONT color="green">095</FONT>                                new HashMap&lt;String, Set&lt;String&gt;&gt;();<a name="line.95"></a>
<FONT color="green">096</FONT>      /**<a name="line.96"></a>
<FONT color="green">097</FONT>       * Specify the maximum size (in bytes) of each split. Each split is<a name="line.97"></a>
<FONT color="green">098</FONT>       * approximately equal to the specified size.<a name="line.98"></a>
<FONT color="green">099</FONT>       */<a name="line.99"></a>
<FONT color="green">100</FONT>      protected void setMaxSplitSize(long maxSplitSize) {<a name="line.100"></a>
<FONT color="green">101</FONT>        this.maxSplitSize = maxSplitSize;<a name="line.101"></a>
<FONT color="green">102</FONT>      }<a name="line.102"></a>
<FONT color="green">103</FONT>    <a name="line.103"></a>
<FONT color="green">104</FONT>      /**<a name="line.104"></a>
<FONT color="green">105</FONT>       * Specify the minimum size (in bytes) of each split per node.<a name="line.105"></a>
<FONT color="green">106</FONT>       * This applies to data that is left over after combining data on a single<a name="line.106"></a>
<FONT color="green">107</FONT>       * node into splits that are of maximum size specified by maxSplitSize.<a name="line.107"></a>
<FONT color="green">108</FONT>       * This leftover data will be combined into its own split if its size<a name="line.108"></a>
<FONT color="green">109</FONT>       * exceeds minSplitSizeNode.<a name="line.109"></a>
<FONT color="green">110</FONT>       */<a name="line.110"></a>
<FONT color="green">111</FONT>      protected void setMinSplitSizeNode(long minSplitSizeNode) {<a name="line.111"></a>
<FONT color="green">112</FONT>        this.minSplitSizeNode = minSplitSizeNode;<a name="line.112"></a>
<FONT color="green">113</FONT>      }<a name="line.113"></a>
<FONT color="green">114</FONT>    <a name="line.114"></a>
<FONT color="green">115</FONT>      /**<a name="line.115"></a>
<FONT color="green">116</FONT>       * Specify the minimum size (in bytes) of each split per rack.<a name="line.116"></a>
<FONT color="green">117</FONT>       * This applies to data that is left over after combining data on a single<a name="line.117"></a>
<FONT color="green">118</FONT>       * rack into splits that are of maximum size specified by maxSplitSize.<a name="line.118"></a>
<FONT color="green">119</FONT>       * This leftover data will be combined into its own split if its size<a name="line.119"></a>
<FONT color="green">120</FONT>       * exceeds minSplitSizeRack.<a name="line.120"></a>
<FONT color="green">121</FONT>       */<a name="line.121"></a>
<FONT color="green">122</FONT>      protected void setMinSplitSizeRack(long minSplitSizeRack) {<a name="line.122"></a>
<FONT color="green">123</FONT>        this.minSplitSizeRack = minSplitSizeRack;<a name="line.123"></a>
<FONT color="green">124</FONT>      }<a name="line.124"></a>
<FONT color="green">125</FONT>    <a name="line.125"></a>
<FONT color="green">126</FONT>      /**<a name="line.126"></a>
<FONT color="green">127</FONT>       * Create a new pool and add the filters to it.<a name="line.127"></a>
<FONT color="green">128</FONT>       * A split cannot have files from different pools.<a name="line.128"></a>
<FONT color="green">129</FONT>       */<a name="line.129"></a>
<FONT color="green">130</FONT>      protected void createPool(List&lt;PathFilter&gt; filters) {<a name="line.130"></a>
<FONT color="green">131</FONT>        pools.add(new MultiPathFilter(filters));<a name="line.131"></a>
<FONT color="green">132</FONT>      }<a name="line.132"></a>
<FONT color="green">133</FONT>    <a name="line.133"></a>
<FONT color="green">134</FONT>      /**<a name="line.134"></a>
<FONT color="green">135</FONT>       * Create a new pool and add the filters to it. <a name="line.135"></a>
<FONT color="green">136</FONT>       * A pathname can satisfy any one of the specified filters.<a name="line.136"></a>
<FONT color="green">137</FONT>       * A split cannot have files from different pools.<a name="line.137"></a>
<FONT color="green">138</FONT>       */<a name="line.138"></a>
<FONT color="green">139</FONT>      protected void createPool(PathFilter... filters) {<a name="line.139"></a>
<FONT color="green">140</FONT>        MultiPathFilter multi = new MultiPathFilter();<a name="line.140"></a>
<FONT color="green">141</FONT>        for (PathFilter f: filters) {<a name="line.141"></a>
<FONT color="green">142</FONT>          multi.add(f);<a name="line.142"></a>
<FONT color="green">143</FONT>        }<a name="line.143"></a>
<FONT color="green">144</FONT>        pools.add(multi);<a name="line.144"></a>
<FONT color="green">145</FONT>      }<a name="line.145"></a>
<FONT color="green">146</FONT>      <a name="line.146"></a>
<FONT color="green">147</FONT>      @Override<a name="line.147"></a>
<FONT color="green">148</FONT>      protected boolean isSplitable(JobContext context, Path file) {<a name="line.148"></a>
<FONT color="green">149</FONT>        final CompressionCodec codec =<a name="line.149"></a>
<FONT color="green">150</FONT>          new CompressionCodecFactory(context.getConfiguration()).getCodec(file);<a name="line.150"></a>
<FONT color="green">151</FONT>        if (null == codec) {<a name="line.151"></a>
<FONT color="green">152</FONT>          return true;<a name="line.152"></a>
<FONT color="green">153</FONT>        }<a name="line.153"></a>
<FONT color="green">154</FONT>        return codec instanceof SplittableCompressionCodec;<a name="line.154"></a>
<FONT color="green">155</FONT>      }<a name="line.155"></a>
<FONT color="green">156</FONT>    <a name="line.156"></a>
<FONT color="green">157</FONT>      /**<a name="line.157"></a>
<FONT color="green">158</FONT>       * default constructor<a name="line.158"></a>
<FONT color="green">159</FONT>       */<a name="line.159"></a>
<FONT color="green">160</FONT>      public CombineFileInputFormat() {<a name="line.160"></a>
<FONT color="green">161</FONT>      }<a name="line.161"></a>
<FONT color="green">162</FONT>    <a name="line.162"></a>
<FONT color="green">163</FONT>      @Override<a name="line.163"></a>
<FONT color="green">164</FONT>      public List&lt;InputSplit&gt; getSplits(JobContext job) <a name="line.164"></a>
<FONT color="green">165</FONT>        throws IOException {<a name="line.165"></a>
<FONT color="green">166</FONT>    <a name="line.166"></a>
<FONT color="green">167</FONT>        long minSizeNode = 0;<a name="line.167"></a>
<FONT color="green">168</FONT>        long minSizeRack = 0;<a name="line.168"></a>
<FONT color="green">169</FONT>        long maxSize = 0;<a name="line.169"></a>
<FONT color="green">170</FONT>        Configuration conf = job.getConfiguration();<a name="line.170"></a>
<FONT color="green">171</FONT>    <a name="line.171"></a>
<FONT color="green">172</FONT>        // the values specified by setxxxSplitSize() takes precedence over the<a name="line.172"></a>
<FONT color="green">173</FONT>        // values that might have been specified in the config<a name="line.173"></a>
<FONT color="green">174</FONT>        if (minSplitSizeNode != 0) {<a name="line.174"></a>
<FONT color="green">175</FONT>          minSizeNode = minSplitSizeNode;<a name="line.175"></a>
<FONT color="green">176</FONT>        } else {<a name="line.176"></a>
<FONT color="green">177</FONT>          minSizeNode = conf.getLong(SPLIT_MINSIZE_PERNODE, 0);<a name="line.177"></a>
<FONT color="green">178</FONT>        }<a name="line.178"></a>
<FONT color="green">179</FONT>        if (minSplitSizeRack != 0) {<a name="line.179"></a>
<FONT color="green">180</FONT>          minSizeRack = minSplitSizeRack;<a name="line.180"></a>
<FONT color="green">181</FONT>        } else {<a name="line.181"></a>
<FONT color="green">182</FONT>          minSizeRack = conf.getLong(SPLIT_MINSIZE_PERRACK, 0);<a name="line.182"></a>
<FONT color="green">183</FONT>        }<a name="line.183"></a>
<FONT color="green">184</FONT>        if (maxSplitSize != 0) {<a name="line.184"></a>
<FONT color="green">185</FONT>          maxSize = maxSplitSize;<a name="line.185"></a>
<FONT color="green">186</FONT>        } else {<a name="line.186"></a>
<FONT color="green">187</FONT>          maxSize = conf.getLong("mapreduce.input.fileinputformat.split.maxsize", 0);<a name="line.187"></a>
<FONT color="green">188</FONT>        }<a name="line.188"></a>
<FONT color="green">189</FONT>        if (minSizeNode != 0 &amp;&amp; maxSize != 0 &amp;&amp; minSizeNode &gt; maxSize) {<a name="line.189"></a>
<FONT color="green">190</FONT>          throw new IOException("Minimum split size pernode " + minSizeNode +<a name="line.190"></a>
<FONT color="green">191</FONT>                                " cannot be larger than maximum split size " +<a name="line.191"></a>
<FONT color="green">192</FONT>                                maxSize);<a name="line.192"></a>
<FONT color="green">193</FONT>        }<a name="line.193"></a>
<FONT color="green">194</FONT>        if (minSizeRack != 0 &amp;&amp; maxSize != 0 &amp;&amp; minSizeRack &gt; maxSize) {<a name="line.194"></a>
<FONT color="green">195</FONT>          throw new IOException("Minimum split size per rack" + minSizeRack +<a name="line.195"></a>
<FONT color="green">196</FONT>                                " cannot be larger than maximum split size " +<a name="line.196"></a>
<FONT color="green">197</FONT>                                maxSize);<a name="line.197"></a>
<FONT color="green">198</FONT>        }<a name="line.198"></a>
<FONT color="green">199</FONT>        if (minSizeRack != 0 &amp;&amp; minSizeNode &gt; minSizeRack) {<a name="line.199"></a>
<FONT color="green">200</FONT>          throw new IOException("Minimum split size per node" + minSizeNode +<a name="line.200"></a>
<FONT color="green">201</FONT>                                " cannot be smaller than minimum split " +<a name="line.201"></a>
<FONT color="green">202</FONT>                                "size per rack " + minSizeRack);<a name="line.202"></a>
<FONT color="green">203</FONT>        }<a name="line.203"></a>
<FONT color="green">204</FONT>    <a name="line.204"></a>
<FONT color="green">205</FONT>        // all the files in input set<a name="line.205"></a>
<FONT color="green">206</FONT>        Path[] paths = FileUtil.stat2Paths(<a name="line.206"></a>
<FONT color="green">207</FONT>                         listStatus(job).toArray(new FileStatus[0]));<a name="line.207"></a>
<FONT color="green">208</FONT>        List&lt;InputSplit&gt; splits = new ArrayList&lt;InputSplit&gt;();<a name="line.208"></a>
<FONT color="green">209</FONT>        if (paths.length == 0) {<a name="line.209"></a>
<FONT color="green">210</FONT>          return splits;    <a name="line.210"></a>
<FONT color="green">211</FONT>        }<a name="line.211"></a>
<FONT color="green">212</FONT>    <a name="line.212"></a>
<FONT color="green">213</FONT>        // Convert them to Paths first. This is a costly operation and <a name="line.213"></a>
<FONT color="green">214</FONT>        // we should do it first, otherwise we will incur doing it multiple<a name="line.214"></a>
<FONT color="green">215</FONT>        // times, one time each for each pool in the next loop.<a name="line.215"></a>
<FONT color="green">216</FONT>        List&lt;Path&gt; newpaths = new LinkedList&lt;Path&gt;();<a name="line.216"></a>
<FONT color="green">217</FONT>        for (int i = 0; i &lt; paths.length; i++) {<a name="line.217"></a>
<FONT color="green">218</FONT>          Path p = new Path(paths[i].toUri().getPath());<a name="line.218"></a>
<FONT color="green">219</FONT>          newpaths.add(p);<a name="line.219"></a>
<FONT color="green">220</FONT>        }<a name="line.220"></a>
<FONT color="green">221</FONT>        paths = null;<a name="line.221"></a>
<FONT color="green">222</FONT>    <a name="line.222"></a>
<FONT color="green">223</FONT>        // In one single iteration, process all the paths in a single pool.<a name="line.223"></a>
<FONT color="green">224</FONT>        // Processing one pool at a time ensures that a split contains paths<a name="line.224"></a>
<FONT color="green">225</FONT>        // from a single pool only.<a name="line.225"></a>
<FONT color="green">226</FONT>        for (MultiPathFilter onepool : pools) {<a name="line.226"></a>
<FONT color="green">227</FONT>          ArrayList&lt;Path&gt; myPaths = new ArrayList&lt;Path&gt;();<a name="line.227"></a>
<FONT color="green">228</FONT>          <a name="line.228"></a>
<FONT color="green">229</FONT>          // pick one input path. If it matches all the filters in a pool,<a name="line.229"></a>
<FONT color="green">230</FONT>          // add it to the output set<a name="line.230"></a>
<FONT color="green">231</FONT>          for (Iterator&lt;Path&gt; iter = newpaths.iterator(); iter.hasNext();) {<a name="line.231"></a>
<FONT color="green">232</FONT>            Path p = iter.next();<a name="line.232"></a>
<FONT color="green">233</FONT>            if (onepool.accept(p)) {<a name="line.233"></a>
<FONT color="green">234</FONT>              myPaths.add(p); // add it to my output set<a name="line.234"></a>
<FONT color="green">235</FONT>              iter.remove();<a name="line.235"></a>
<FONT color="green">236</FONT>            }<a name="line.236"></a>
<FONT color="green">237</FONT>          }<a name="line.237"></a>
<FONT color="green">238</FONT>          // create splits for all files in this pool.<a name="line.238"></a>
<FONT color="green">239</FONT>          getMoreSplits(job, myPaths.toArray(new Path[myPaths.size()]), <a name="line.239"></a>
<FONT color="green">240</FONT>                        maxSize, minSizeNode, minSizeRack, splits);<a name="line.240"></a>
<FONT color="green">241</FONT>        }<a name="line.241"></a>
<FONT color="green">242</FONT>    <a name="line.242"></a>
<FONT color="green">243</FONT>        // create splits for all files that are not in any pool.<a name="line.243"></a>
<FONT color="green">244</FONT>        getMoreSplits(job, newpaths.toArray(new Path[newpaths.size()]), <a name="line.244"></a>
<FONT color="green">245</FONT>                      maxSize, minSizeNode, minSizeRack, splits);<a name="line.245"></a>
<FONT color="green">246</FONT>    <a name="line.246"></a>
<FONT color="green">247</FONT>        // free up rackToNodes map<a name="line.247"></a>
<FONT color="green">248</FONT>        rackToNodes.clear();<a name="line.248"></a>
<FONT color="green">249</FONT>        return splits;    <a name="line.249"></a>
<FONT color="green">250</FONT>      }<a name="line.250"></a>
<FONT color="green">251</FONT>    <a name="line.251"></a>
<FONT color="green">252</FONT>      /**<a name="line.252"></a>
<FONT color="green">253</FONT>       * Return all the splits in the specified set of paths<a name="line.253"></a>
<FONT color="green">254</FONT>       */<a name="line.254"></a>
<FONT color="green">255</FONT>      private void getMoreSplits(JobContext job, Path[] paths, <a name="line.255"></a>
<FONT color="green">256</FONT>                                 long maxSize, long minSizeNode, long minSizeRack,<a name="line.256"></a>
<FONT color="green">257</FONT>                                 List&lt;InputSplit&gt; splits)<a name="line.257"></a>
<FONT color="green">258</FONT>        throws IOException {<a name="line.258"></a>
<FONT color="green">259</FONT>        Configuration conf = job.getConfiguration();<a name="line.259"></a>
<FONT color="green">260</FONT>    <a name="line.260"></a>
<FONT color="green">261</FONT>        // all blocks for all the files in input set<a name="line.261"></a>
<FONT color="green">262</FONT>        OneFileInfo[] files;<a name="line.262"></a>
<FONT color="green">263</FONT>      <a name="line.263"></a>
<FONT color="green">264</FONT>        // mapping from a rack name to the list of blocks it has<a name="line.264"></a>
<FONT color="green">265</FONT>        HashMap&lt;String, List&lt;OneBlockInfo&gt;&gt; rackToBlocks = <a name="line.265"></a>
<FONT color="green">266</FONT>                                  new HashMap&lt;String, List&lt;OneBlockInfo&gt;&gt;();<a name="line.266"></a>
<FONT color="green">267</FONT>    <a name="line.267"></a>
<FONT color="green">268</FONT>        // mapping from a block to the nodes on which it has replicas<a name="line.268"></a>
<FONT color="green">269</FONT>        HashMap&lt;OneBlockInfo, String[]&gt; blockToNodes = <a name="line.269"></a>
<FONT color="green">270</FONT>                                  new HashMap&lt;OneBlockInfo, String[]&gt;();<a name="line.270"></a>
<FONT color="green">271</FONT>    <a name="line.271"></a>
<FONT color="green">272</FONT>        // mapping from a node to the list of blocks that it contains<a name="line.272"></a>
<FONT color="green">273</FONT>        HashMap&lt;String, List&lt;OneBlockInfo&gt;&gt; nodeToBlocks = <a name="line.273"></a>
<FONT color="green">274</FONT>                                  new HashMap&lt;String, List&lt;OneBlockInfo&gt;&gt;();<a name="line.274"></a>
<FONT color="green">275</FONT>        <a name="line.275"></a>
<FONT color="green">276</FONT>        files = new OneFileInfo[paths.length];<a name="line.276"></a>
<FONT color="green">277</FONT>        if (paths.length == 0) {<a name="line.277"></a>
<FONT color="green">278</FONT>          return; <a name="line.278"></a>
<FONT color="green">279</FONT>        }<a name="line.279"></a>
<FONT color="green">280</FONT>    <a name="line.280"></a>
<FONT color="green">281</FONT>        // populate all the blocks for all files<a name="line.281"></a>
<FONT color="green">282</FONT>        long totLength = 0;<a name="line.282"></a>
<FONT color="green">283</FONT>        for (int i = 0; i &lt; paths.length; i++) {<a name="line.283"></a>
<FONT color="green">284</FONT>          files[i] = new OneFileInfo(paths[i], conf, isSplitable(job, paths[i]),<a name="line.284"></a>
<FONT color="green">285</FONT>                                     rackToBlocks, blockToNodes, nodeToBlocks,<a name="line.285"></a>
<FONT color="green">286</FONT>                                     rackToNodes, maxSize);<a name="line.286"></a>
<FONT color="green">287</FONT>          totLength += files[i].getLength();<a name="line.287"></a>
<FONT color="green">288</FONT>        }<a name="line.288"></a>
<FONT color="green">289</FONT>    <a name="line.289"></a>
<FONT color="green">290</FONT>        ArrayList&lt;OneBlockInfo&gt; validBlocks = new ArrayList&lt;OneBlockInfo&gt;();<a name="line.290"></a>
<FONT color="green">291</FONT>        Set&lt;String&gt; nodes = new HashSet&lt;String&gt;();<a name="line.291"></a>
<FONT color="green">292</FONT>        long curSplitSize = 0;<a name="line.292"></a>
<FONT color="green">293</FONT>    <a name="line.293"></a>
<FONT color="green">294</FONT>        // process all nodes and create splits that are local<a name="line.294"></a>
<FONT color="green">295</FONT>        // to a node. <a name="line.295"></a>
<FONT color="green">296</FONT>        for (Iterator&lt;Map.Entry&lt;String, <a name="line.296"></a>
<FONT color="green">297</FONT>             List&lt;OneBlockInfo&gt;&gt;&gt; iter = nodeToBlocks.entrySet().iterator(); <a name="line.297"></a>
<FONT color="green">298</FONT>             iter.hasNext();) {<a name="line.298"></a>
<FONT color="green">299</FONT>    <a name="line.299"></a>
<FONT color="green">300</FONT>          Map.Entry&lt;String, List&lt;OneBlockInfo&gt;&gt; one = iter.next();<a name="line.300"></a>
<FONT color="green">301</FONT>          nodes.add(one.getKey());<a name="line.301"></a>
<FONT color="green">302</FONT>          List&lt;OneBlockInfo&gt; blocksInNode = one.getValue();<a name="line.302"></a>
<FONT color="green">303</FONT>    <a name="line.303"></a>
<FONT color="green">304</FONT>          // for each block, copy it into validBlocks. Delete it from <a name="line.304"></a>
<FONT color="green">305</FONT>          // blockToNodes so that the same block does not appear in <a name="line.305"></a>
<FONT color="green">306</FONT>          // two different splits.<a name="line.306"></a>
<FONT color="green">307</FONT>          for (OneBlockInfo oneblock : blocksInNode) {<a name="line.307"></a>
<FONT color="green">308</FONT>            if (blockToNodes.containsKey(oneblock)) {<a name="line.308"></a>
<FONT color="green">309</FONT>              validBlocks.add(oneblock);<a name="line.309"></a>
<FONT color="green">310</FONT>              blockToNodes.remove(oneblock);<a name="line.310"></a>
<FONT color="green">311</FONT>              curSplitSize += oneblock.length;<a name="line.311"></a>
<FONT color="green">312</FONT>    <a name="line.312"></a>
<FONT color="green">313</FONT>              // if the accumulated split size exceeds the maximum, then <a name="line.313"></a>
<FONT color="green">314</FONT>              // create this split.<a name="line.314"></a>
<FONT color="green">315</FONT>              if (maxSize != 0 &amp;&amp; curSplitSize &gt;= maxSize) {<a name="line.315"></a>
<FONT color="green">316</FONT>                // create an input split and add it to the splits array<a name="line.316"></a>
<FONT color="green">317</FONT>                addCreatedSplit(splits, nodes, validBlocks);<a name="line.317"></a>
<FONT color="green">318</FONT>                curSplitSize = 0;<a name="line.318"></a>
<FONT color="green">319</FONT>                validBlocks.clear();<a name="line.319"></a>
<FONT color="green">320</FONT>              }<a name="line.320"></a>
<FONT color="green">321</FONT>            }<a name="line.321"></a>
<FONT color="green">322</FONT>          }<a name="line.322"></a>
<FONT color="green">323</FONT>          // if there were any blocks left over and their combined size is<a name="line.323"></a>
<FONT color="green">324</FONT>          // larger than minSplitNode, then combine them into one split.<a name="line.324"></a>
<FONT color="green">325</FONT>          // Otherwise add them back to the unprocessed pool. It is likely <a name="line.325"></a>
<FONT color="green">326</FONT>          // that they will be combined with other blocks from the <a name="line.326"></a>
<FONT color="green">327</FONT>          // same rack later on.<a name="line.327"></a>
<FONT color="green">328</FONT>          if (minSizeNode != 0 &amp;&amp; curSplitSize &gt;= minSizeNode) {<a name="line.328"></a>
<FONT color="green">329</FONT>            // create an input split and add it to the splits array<a name="line.329"></a>
<FONT color="green">330</FONT>            addCreatedSplit(splits, nodes, validBlocks);<a name="line.330"></a>
<FONT color="green">331</FONT>          } else {<a name="line.331"></a>
<FONT color="green">332</FONT>            for (OneBlockInfo oneblock : validBlocks) {<a name="line.332"></a>
<FONT color="green">333</FONT>              blockToNodes.put(oneblock, oneblock.hosts);<a name="line.333"></a>
<FONT color="green">334</FONT>            }<a name="line.334"></a>
<FONT color="green">335</FONT>          }<a name="line.335"></a>
<FONT color="green">336</FONT>          validBlocks.clear();<a name="line.336"></a>
<FONT color="green">337</FONT>          nodes.clear();<a name="line.337"></a>
<FONT color="green">338</FONT>          curSplitSize = 0;<a name="line.338"></a>
<FONT color="green">339</FONT>        }<a name="line.339"></a>
<FONT color="green">340</FONT>    <a name="line.340"></a>
<FONT color="green">341</FONT>        // if blocks in a rack are below the specified minimum size, then keep them<a name="line.341"></a>
<FONT color="green">342</FONT>        // in 'overflow'. After the processing of all racks is complete, these <a name="line.342"></a>
<FONT color="green">343</FONT>        // overflow blocks will be combined into splits.<a name="line.343"></a>
<FONT color="green">344</FONT>        ArrayList&lt;OneBlockInfo&gt; overflowBlocks = new ArrayList&lt;OneBlockInfo&gt;();<a name="line.344"></a>
<FONT color="green">345</FONT>        Set&lt;String&gt; racks = new HashSet&lt;String&gt;();<a name="line.345"></a>
<FONT color="green">346</FONT>    <a name="line.346"></a>
<FONT color="green">347</FONT>        // Process all racks over and over again until there is no more work to do.<a name="line.347"></a>
<FONT color="green">348</FONT>        while (blockToNodes.size() &gt; 0) {<a name="line.348"></a>
<FONT color="green">349</FONT>    <a name="line.349"></a>
<FONT color="green">350</FONT>          // Create one split for this rack before moving over to the next rack. <a name="line.350"></a>
<FONT color="green">351</FONT>          // Come back to this rack after creating a single split for each of the <a name="line.351"></a>
<FONT color="green">352</FONT>          // remaining racks.<a name="line.352"></a>
<FONT color="green">353</FONT>          // Process one rack location at a time, Combine all possible blocks that<a name="line.353"></a>
<FONT color="green">354</FONT>          // reside on this rack as one split. (constrained by minimum and maximum<a name="line.354"></a>
<FONT color="green">355</FONT>          // split size).<a name="line.355"></a>
<FONT color="green">356</FONT>    <a name="line.356"></a>
<FONT color="green">357</FONT>          // iterate over all racks <a name="line.357"></a>
<FONT color="green">358</FONT>          for (Iterator&lt;Map.Entry&lt;String, List&lt;OneBlockInfo&gt;&gt;&gt; iter = <a name="line.358"></a>
<FONT color="green">359</FONT>               rackToBlocks.entrySet().iterator(); iter.hasNext();) {<a name="line.359"></a>
<FONT color="green">360</FONT>    <a name="line.360"></a>
<FONT color="green">361</FONT>            Map.Entry&lt;String, List&lt;OneBlockInfo&gt;&gt; one = iter.next();<a name="line.361"></a>
<FONT color="green">362</FONT>            racks.add(one.getKey());<a name="line.362"></a>
<FONT color="green">363</FONT>            List&lt;OneBlockInfo&gt; blocks = one.getValue();<a name="line.363"></a>
<FONT color="green">364</FONT>    <a name="line.364"></a>
<FONT color="green">365</FONT>            // for each block, copy it into validBlocks. Delete it from <a name="line.365"></a>
<FONT color="green">366</FONT>            // blockToNodes so that the same block does not appear in <a name="line.366"></a>
<FONT color="green">367</FONT>            // two different splits.<a name="line.367"></a>
<FONT color="green">368</FONT>            boolean createdSplit = false;<a name="line.368"></a>
<FONT color="green">369</FONT>            for (OneBlockInfo oneblock : blocks) {<a name="line.369"></a>
<FONT color="green">370</FONT>              if (blockToNodes.containsKey(oneblock)) {<a name="line.370"></a>
<FONT color="green">371</FONT>                validBlocks.add(oneblock);<a name="line.371"></a>
<FONT color="green">372</FONT>                blockToNodes.remove(oneblock);<a name="line.372"></a>
<FONT color="green">373</FONT>                curSplitSize += oneblock.length;<a name="line.373"></a>
<FONT color="green">374</FONT>          <a name="line.374"></a>
<FONT color="green">375</FONT>                // if the accumulated split size exceeds the maximum, then <a name="line.375"></a>
<FONT color="green">376</FONT>                // create this split.<a name="line.376"></a>
<FONT color="green">377</FONT>                if (maxSize != 0 &amp;&amp; curSplitSize &gt;= maxSize) {<a name="line.377"></a>
<FONT color="green">378</FONT>                  // create an input split and add it to the splits array<a name="line.378"></a>
<FONT color="green">379</FONT>                  addCreatedSplit(splits, getHosts(racks), validBlocks);<a name="line.379"></a>
<FONT color="green">380</FONT>                  createdSplit = true;<a name="line.380"></a>
<FONT color="green">381</FONT>                  break;<a name="line.381"></a>
<FONT color="green">382</FONT>                }<a name="line.382"></a>
<FONT color="green">383</FONT>              }<a name="line.383"></a>
<FONT color="green">384</FONT>            }<a name="line.384"></a>
<FONT color="green">385</FONT>    <a name="line.385"></a>
<FONT color="green">386</FONT>            // if we created a split, then just go to the next rack<a name="line.386"></a>
<FONT color="green">387</FONT>            if (createdSplit) {<a name="line.387"></a>
<FONT color="green">388</FONT>              curSplitSize = 0;<a name="line.388"></a>
<FONT color="green">389</FONT>              validBlocks.clear();<a name="line.389"></a>
<FONT color="green">390</FONT>              racks.clear();<a name="line.390"></a>
<FONT color="green">391</FONT>              continue;<a name="line.391"></a>
<FONT color="green">392</FONT>            }<a name="line.392"></a>
<FONT color="green">393</FONT>    <a name="line.393"></a>
<FONT color="green">394</FONT>            if (!validBlocks.isEmpty()) {<a name="line.394"></a>
<FONT color="green">395</FONT>              if (minSizeRack != 0 &amp;&amp; curSplitSize &gt;= minSizeRack) {<a name="line.395"></a>
<FONT color="green">396</FONT>                // if there is a minimum size specified, then create a single split<a name="line.396"></a>
<FONT color="green">397</FONT>                // otherwise, store these blocks into overflow data structure<a name="line.397"></a>
<FONT color="green">398</FONT>                addCreatedSplit(splits, getHosts(racks), validBlocks);<a name="line.398"></a>
<FONT color="green">399</FONT>              } else {<a name="line.399"></a>
<FONT color="green">400</FONT>                // There were a few blocks in this rack that <a name="line.400"></a>
<FONT color="green">401</FONT>                    // remained to be processed. Keep them in 'overflow' block list. <a name="line.401"></a>
<FONT color="green">402</FONT>                    // These will be combined later.<a name="line.402"></a>
<FONT color="green">403</FONT>                overflowBlocks.addAll(validBlocks);<a name="line.403"></a>
<FONT color="green">404</FONT>              }<a name="line.404"></a>
<FONT color="green">405</FONT>            }<a name="line.405"></a>
<FONT color="green">406</FONT>            curSplitSize = 0;<a name="line.406"></a>
<FONT color="green">407</FONT>            validBlocks.clear();<a name="line.407"></a>
<FONT color="green">408</FONT>            racks.clear();<a name="line.408"></a>
<FONT color="green">409</FONT>          }<a name="line.409"></a>
<FONT color="green">410</FONT>        }<a name="line.410"></a>
<FONT color="green">411</FONT>    <a name="line.411"></a>
<FONT color="green">412</FONT>        assert blockToNodes.isEmpty();<a name="line.412"></a>
<FONT color="green">413</FONT>        assert curSplitSize == 0;<a name="line.413"></a>
<FONT color="green">414</FONT>        assert validBlocks.isEmpty();<a name="line.414"></a>
<FONT color="green">415</FONT>        assert racks.isEmpty();<a name="line.415"></a>
<FONT color="green">416</FONT>    <a name="line.416"></a>
<FONT color="green">417</FONT>        // Process all overflow blocks<a name="line.417"></a>
<FONT color="green">418</FONT>        for (OneBlockInfo oneblock : overflowBlocks) {<a name="line.418"></a>
<FONT color="green">419</FONT>          validBlocks.add(oneblock);<a name="line.419"></a>
<FONT color="green">420</FONT>          curSplitSize += oneblock.length;<a name="line.420"></a>
<FONT color="green">421</FONT>    <a name="line.421"></a>
<FONT color="green">422</FONT>          // This might cause an exiting rack location to be re-added,<a name="line.422"></a>
<FONT color="green">423</FONT>          // but it should be ok.<a name="line.423"></a>
<FONT color="green">424</FONT>          for (int i = 0; i &lt; oneblock.racks.length; i++) {<a name="line.424"></a>
<FONT color="green">425</FONT>            racks.add(oneblock.racks[i]);<a name="line.425"></a>
<FONT color="green">426</FONT>          }<a name="line.426"></a>
<FONT color="green">427</FONT>    <a name="line.427"></a>
<FONT color="green">428</FONT>          // if the accumulated split size exceeds the maximum, then <a name="line.428"></a>
<FONT color="green">429</FONT>          // create this split.<a name="line.429"></a>
<FONT color="green">430</FONT>          if (maxSize != 0 &amp;&amp; curSplitSize &gt;= maxSize) {<a name="line.430"></a>
<FONT color="green">431</FONT>            // create an input split and add it to the splits array<a name="line.431"></a>
<FONT color="green">432</FONT>            addCreatedSplit(splits, getHosts(racks), validBlocks);<a name="line.432"></a>
<FONT color="green">433</FONT>            curSplitSize = 0;<a name="line.433"></a>
<FONT color="green">434</FONT>            validBlocks.clear();<a name="line.434"></a>
<FONT color="green">435</FONT>            racks.clear();<a name="line.435"></a>
<FONT color="green">436</FONT>          }<a name="line.436"></a>
<FONT color="green">437</FONT>        }<a name="line.437"></a>
<FONT color="green">438</FONT>    <a name="line.438"></a>
<FONT color="green">439</FONT>        // Process any remaining blocks, if any.<a name="line.439"></a>
<FONT color="green">440</FONT>        if (!validBlocks.isEmpty()) {<a name="line.440"></a>
<FONT color="green">441</FONT>          addCreatedSplit(splits, getHosts(racks), validBlocks);<a name="line.441"></a>
<FONT color="green">442</FONT>        }<a name="line.442"></a>
<FONT color="green">443</FONT>      }<a name="line.443"></a>
<FONT color="green">444</FONT>    <a name="line.444"></a>
<FONT color="green">445</FONT>      /**<a name="line.445"></a>
<FONT color="green">446</FONT>       * Create a single split from the list of blocks specified in validBlocks<a name="line.446"></a>
<FONT color="green">447</FONT>       * Add this new split into splitList.<a name="line.447"></a>
<FONT color="green">448</FONT>       */<a name="line.448"></a>
<FONT color="green">449</FONT>      private void addCreatedSplit(List&lt;InputSplit&gt; splitList, <a name="line.449"></a>
<FONT color="green">450</FONT>                                   Collection&lt;String&gt; locations, <a name="line.450"></a>
<FONT color="green">451</FONT>                                   ArrayList&lt;OneBlockInfo&gt; validBlocks) {<a name="line.451"></a>
<FONT color="green">452</FONT>        // create an input split<a name="line.452"></a>
<FONT color="green">453</FONT>        Path[] fl = new Path[validBlocks.size()];<a name="line.453"></a>
<FONT color="green">454</FONT>        long[] offset = new long[validBlocks.size()];<a name="line.454"></a>
<FONT color="green">455</FONT>        long[] length = new long[validBlocks.size()];<a name="line.455"></a>
<FONT color="green">456</FONT>        for (int i = 0; i &lt; validBlocks.size(); i++) {<a name="line.456"></a>
<FONT color="green">457</FONT>          fl[i] = validBlocks.get(i).onepath; <a name="line.457"></a>
<FONT color="green">458</FONT>          offset[i] = validBlocks.get(i).offset;<a name="line.458"></a>
<FONT color="green">459</FONT>          length[i] = validBlocks.get(i).length;<a name="line.459"></a>
<FONT color="green">460</FONT>        }<a name="line.460"></a>
<FONT color="green">461</FONT>    <a name="line.461"></a>
<FONT color="green">462</FONT>         // add this split to the list that is returned<a name="line.462"></a>
<FONT color="green">463</FONT>        CombineFileSplit thissplit = new CombineFileSplit(fl, offset, <a name="line.463"></a>
<FONT color="green">464</FONT>                                       length, locations.toArray(new String[0]));<a name="line.464"></a>
<FONT color="green">465</FONT>        splitList.add(thissplit); <a name="line.465"></a>
<FONT color="green">466</FONT>      }<a name="line.466"></a>
<FONT color="green">467</FONT>    <a name="line.467"></a>
<FONT color="green">468</FONT>      /**<a name="line.468"></a>
<FONT color="green">469</FONT>       * This is not implemented yet. <a name="line.469"></a>
<FONT color="green">470</FONT>       */<a name="line.470"></a>
<FONT color="green">471</FONT>      public abstract RecordReader&lt;K, V&gt; createRecordReader(InputSplit split,<a name="line.471"></a>
<FONT color="green">472</FONT>          TaskAttemptContext context) throws IOException;<a name="line.472"></a>
<FONT color="green">473</FONT>    <a name="line.473"></a>
<FONT color="green">474</FONT>      /**<a name="line.474"></a>
<FONT color="green">475</FONT>       * information about one file from the File System<a name="line.475"></a>
<FONT color="green">476</FONT>       */<a name="line.476"></a>
<FONT color="green">477</FONT>      private static class OneFileInfo {<a name="line.477"></a>
<FONT color="green">478</FONT>        private long fileSize;               // size of the file<a name="line.478"></a>
<FONT color="green">479</FONT>        private OneBlockInfo[] blocks;       // all blocks in this file<a name="line.479"></a>
<FONT color="green">480</FONT>    <a name="line.480"></a>
<FONT color="green">481</FONT>        OneFileInfo(Path path, Configuration conf,<a name="line.481"></a>
<FONT color="green">482</FONT>                    boolean isSplitable,<a name="line.482"></a>
<FONT color="green">483</FONT>                    HashMap&lt;String, List&lt;OneBlockInfo&gt;&gt; rackToBlocks,<a name="line.483"></a>
<FONT color="green">484</FONT>                    HashMap&lt;OneBlockInfo, String[]&gt; blockToNodes,<a name="line.484"></a>
<FONT color="green">485</FONT>                    HashMap&lt;String, List&lt;OneBlockInfo&gt;&gt; nodeToBlocks,<a name="line.485"></a>
<FONT color="green">486</FONT>                    HashMap&lt;String, Set&lt;String&gt;&gt; rackToNodes,<a name="line.486"></a>
<FONT color="green">487</FONT>                    long maxSize)<a name="line.487"></a>
<FONT color="green">488</FONT>                    throws IOException {<a name="line.488"></a>
<FONT color="green">489</FONT>          this.fileSize = 0;<a name="line.489"></a>
<FONT color="green">490</FONT>    <a name="line.490"></a>
<FONT color="green">491</FONT>          // get block locations from file system<a name="line.491"></a>
<FONT color="green">492</FONT>          FileSystem fs = path.getFileSystem(conf);<a name="line.492"></a>
<FONT color="green">493</FONT>          FileStatus stat = fs.getFileStatus(path);<a name="line.493"></a>
<FONT color="green">494</FONT>          BlockLocation[] locations = fs.getFileBlockLocations(stat, 0, <a name="line.494"></a>
<FONT color="green">495</FONT>                                                               stat.getLen());<a name="line.495"></a>
<FONT color="green">496</FONT>          // create a list of all block and their locations<a name="line.496"></a>
<FONT color="green">497</FONT>          if (locations == null) {<a name="line.497"></a>
<FONT color="green">498</FONT>            blocks = new OneBlockInfo[0];<a name="line.498"></a>
<FONT color="green">499</FONT>          } else {<a name="line.499"></a>
<FONT color="green">500</FONT>            if (!isSplitable) {<a name="line.500"></a>
<FONT color="green">501</FONT>              // if the file is not splitable, just create the one block with<a name="line.501"></a>
<FONT color="green">502</FONT>              // full file length<a name="line.502"></a>
<FONT color="green">503</FONT>              blocks = new OneBlockInfo[1];<a name="line.503"></a>
<FONT color="green">504</FONT>              fileSize = stat.getLen();<a name="line.504"></a>
<FONT color="green">505</FONT>              blocks[0] = new OneBlockInfo(path, 0, fileSize, locations[0]<a name="line.505"></a>
<FONT color="green">506</FONT>                  .getHosts(), locations[0].getTopologyPaths());<a name="line.506"></a>
<FONT color="green">507</FONT>            } else {<a name="line.507"></a>
<FONT color="green">508</FONT>              ArrayList&lt;OneBlockInfo&gt; blocksList = new ArrayList&lt;OneBlockInfo&gt;(<a name="line.508"></a>
<FONT color="green">509</FONT>                  locations.length);<a name="line.509"></a>
<FONT color="green">510</FONT>              for (int i = 0; i &lt; locations.length; i++) {<a name="line.510"></a>
<FONT color="green">511</FONT>                fileSize += locations[i].getLength();<a name="line.511"></a>
<FONT color="green">512</FONT>    <a name="line.512"></a>
<FONT color="green">513</FONT>                // each split can be a maximum of maxSize<a name="line.513"></a>
<FONT color="green">514</FONT>                long left = locations[i].getLength();<a name="line.514"></a>
<FONT color="green">515</FONT>                long myOffset = locations[i].getOffset();<a name="line.515"></a>
<FONT color="green">516</FONT>                long myLength = 0;<a name="line.516"></a>
<FONT color="green">517</FONT>                while (left &gt; 0) {<a name="line.517"></a>
<FONT color="green">518</FONT>                  if (maxSize == 0) {<a name="line.518"></a>
<FONT color="green">519</FONT>                    myLength = left;<a name="line.519"></a>
<FONT color="green">520</FONT>                  } else {<a name="line.520"></a>
<FONT color="green">521</FONT>                    if (left &gt; maxSize &amp;&amp; left &lt; 2 * maxSize) {<a name="line.521"></a>
<FONT color="green">522</FONT>                      // if remainder is between max and 2*max - then<a name="line.522"></a>
<FONT color="green">523</FONT>                      // instead of creating splits of size max, left-max we<a name="line.523"></a>
<FONT color="green">524</FONT>                      // create splits of size left/2 and left/2. This is<a name="line.524"></a>
<FONT color="green">525</FONT>                      // a heuristic to avoid creating really really small<a name="line.525"></a>
<FONT color="green">526</FONT>                      // splits.<a name="line.526"></a>
<FONT color="green">527</FONT>                      myLength = left / 2;<a name="line.527"></a>
<FONT color="green">528</FONT>                    } else {<a name="line.528"></a>
<FONT color="green">529</FONT>                      myLength = Math.min(maxSize, left);<a name="line.529"></a>
<FONT color="green">530</FONT>                    }<a name="line.530"></a>
<FONT color="green">531</FONT>                  }<a name="line.531"></a>
<FONT color="green">532</FONT>                  OneBlockInfo oneblock = new OneBlockInfo(path, myOffset,<a name="line.532"></a>
<FONT color="green">533</FONT>                      myLength, locations[i].getHosts(), locations[i]<a name="line.533"></a>
<FONT color="green">534</FONT>                          .getTopologyPaths());<a name="line.534"></a>
<FONT color="green">535</FONT>                  left -= myLength;<a name="line.535"></a>
<FONT color="green">536</FONT>                  myOffset += myLength;<a name="line.536"></a>
<FONT color="green">537</FONT>    <a name="line.537"></a>
<FONT color="green">538</FONT>                  blocksList.add(oneblock);<a name="line.538"></a>
<FONT color="green">539</FONT>                }<a name="line.539"></a>
<FONT color="green">540</FONT>              }<a name="line.540"></a>
<FONT color="green">541</FONT>              blocks = blocksList.toArray(new OneBlockInfo[blocksList.size()]);<a name="line.541"></a>
<FONT color="green">542</FONT>            }<a name="line.542"></a>
<FONT color="green">543</FONT>    <a name="line.543"></a>
<FONT color="green">544</FONT>            for (OneBlockInfo oneblock : blocks) {<a name="line.544"></a>
<FONT color="green">545</FONT>              // add this block to the block --&gt; node locations map<a name="line.545"></a>
<FONT color="green">546</FONT>              blockToNodes.put(oneblock, oneblock.hosts);<a name="line.546"></a>
<FONT color="green">547</FONT>    <a name="line.547"></a>
<FONT color="green">548</FONT>              // For blocks that do not have host/rack information,<a name="line.548"></a>
<FONT color="green">549</FONT>              // assign to default  rack.<a name="line.549"></a>
<FONT color="green">550</FONT>              String[] racks = null;<a name="line.550"></a>
<FONT color="green">551</FONT>              if (oneblock.hosts.length == 0) {<a name="line.551"></a>
<FONT color="green">552</FONT>                racks = new String[]{NetworkTopology.DEFAULT_RACK};<a name="line.552"></a>
<FONT color="green">553</FONT>              } else {<a name="line.553"></a>
<FONT color="green">554</FONT>                racks = oneblock.racks;<a name="line.554"></a>
<FONT color="green">555</FONT>              }<a name="line.555"></a>
<FONT color="green">556</FONT>    <a name="line.556"></a>
<FONT color="green">557</FONT>              // add this block to the rack --&gt; block map<a name="line.557"></a>
<FONT color="green">558</FONT>              for (int j = 0; j &lt; racks.length; j++) {<a name="line.558"></a>
<FONT color="green">559</FONT>                String rack = racks[j];<a name="line.559"></a>
<FONT color="green">560</FONT>                List&lt;OneBlockInfo&gt; blklist = rackToBlocks.get(rack);<a name="line.560"></a>
<FONT color="green">561</FONT>                if (blklist == null) {<a name="line.561"></a>
<FONT color="green">562</FONT>                  blklist = new ArrayList&lt;OneBlockInfo&gt;();<a name="line.562"></a>
<FONT color="green">563</FONT>                  rackToBlocks.put(rack, blklist);<a name="line.563"></a>
<FONT color="green">564</FONT>                }<a name="line.564"></a>
<FONT color="green">565</FONT>                blklist.add(oneblock);<a name="line.565"></a>
<FONT color="green">566</FONT>                if (!racks[j].equals(NetworkTopology.DEFAULT_RACK)) {<a name="line.566"></a>
<FONT color="green">567</FONT>                  // Add this host to rackToNodes map<a name="line.567"></a>
<FONT color="green">568</FONT>                  addHostToRack(rackToNodes, racks[j], oneblock.hosts[j]);<a name="line.568"></a>
<FONT color="green">569</FONT>                }<a name="line.569"></a>
<FONT color="green">570</FONT>              }<a name="line.570"></a>
<FONT color="green">571</FONT>    <a name="line.571"></a>
<FONT color="green">572</FONT>              // add this block to the node --&gt; block map<a name="line.572"></a>
<FONT color="green">573</FONT>              for (int j = 0; j &lt; oneblock.hosts.length; j++) {<a name="line.573"></a>
<FONT color="green">574</FONT>                String node = oneblock.hosts[j];<a name="line.574"></a>
<FONT color="green">575</FONT>                List&lt;OneBlockInfo&gt; blklist = nodeToBlocks.get(node);<a name="line.575"></a>
<FONT color="green">576</FONT>                if (blklist == null) {<a name="line.576"></a>
<FONT color="green">577</FONT>                  blklist = new ArrayList&lt;OneBlockInfo&gt;();<a name="line.577"></a>
<FONT color="green">578</FONT>                  nodeToBlocks.put(node, blklist);<a name="line.578"></a>
<FONT color="green">579</FONT>                }<a name="line.579"></a>
<FONT color="green">580</FONT>                blklist.add(oneblock);<a name="line.580"></a>
<FONT color="green">581</FONT>              }<a name="line.581"></a>
<FONT color="green">582</FONT>            }<a name="line.582"></a>
<FONT color="green">583</FONT>          }<a name="line.583"></a>
<FONT color="green">584</FONT>        }<a name="line.584"></a>
<FONT color="green">585</FONT>    <a name="line.585"></a>
<FONT color="green">586</FONT>        long getLength() {<a name="line.586"></a>
<FONT color="green">587</FONT>          return fileSize;<a name="line.587"></a>
<FONT color="green">588</FONT>        }<a name="line.588"></a>
<FONT color="green">589</FONT>    <a name="line.589"></a>
<FONT color="green">590</FONT>        OneBlockInfo[] getBlocks() {<a name="line.590"></a>
<FONT color="green">591</FONT>          return blocks;<a name="line.591"></a>
<FONT color="green">592</FONT>        }<a name="line.592"></a>
<FONT color="green">593</FONT>      }<a name="line.593"></a>
<FONT color="green">594</FONT>    <a name="line.594"></a>
<FONT color="green">595</FONT>      /**<a name="line.595"></a>
<FONT color="green">596</FONT>       * information about one block from the File System<a name="line.596"></a>
<FONT color="green">597</FONT>       */<a name="line.597"></a>
<FONT color="green">598</FONT>      private static class OneBlockInfo {<a name="line.598"></a>
<FONT color="green">599</FONT>        Path onepath;                // name of this file<a name="line.599"></a>
<FONT color="green">600</FONT>        long offset;                 // offset in file<a name="line.600"></a>
<FONT color="green">601</FONT>        long length;                 // length of this block<a name="line.601"></a>
<FONT color="green">602</FONT>        String[] hosts;              // nodes on which this block resides<a name="line.602"></a>
<FONT color="green">603</FONT>        String[] racks;              // network topology of hosts<a name="line.603"></a>
<FONT color="green">604</FONT>    <a name="line.604"></a>
<FONT color="green">605</FONT>        OneBlockInfo(Path path, long offset, long len, <a name="line.605"></a>
<FONT color="green">606</FONT>                     String[] hosts, String[] topologyPaths) {<a name="line.606"></a>
<FONT color="green">607</FONT>          this.onepath = path;<a name="line.607"></a>
<FONT color="green">608</FONT>          this.offset = offset;<a name="line.608"></a>
<FONT color="green">609</FONT>          this.hosts = hosts;<a name="line.609"></a>
<FONT color="green">610</FONT>          this.length = len;<a name="line.610"></a>
<FONT color="green">611</FONT>          assert (hosts.length == topologyPaths.length ||<a name="line.611"></a>
<FONT color="green">612</FONT>                  topologyPaths.length == 0);<a name="line.612"></a>
<FONT color="green">613</FONT>    <a name="line.613"></a>
<FONT color="green">614</FONT>          // if the file system does not have any rack information, then<a name="line.614"></a>
<FONT color="green">615</FONT>          // use dummy rack location.<a name="line.615"></a>
<FONT color="green">616</FONT>          if (topologyPaths.length == 0) {<a name="line.616"></a>
<FONT color="green">617</FONT>            topologyPaths = new String[hosts.length];<a name="line.617"></a>
<FONT color="green">618</FONT>            for (int i = 0; i &lt; topologyPaths.length; i++) {<a name="line.618"></a>
<FONT color="green">619</FONT>              topologyPaths[i] = (new NodeBase(hosts[i], <a name="line.619"></a>
<FONT color="green">620</FONT>                                  NetworkTopology.DEFAULT_RACK)).toString();<a name="line.620"></a>
<FONT color="green">621</FONT>            }<a name="line.621"></a>
<FONT color="green">622</FONT>          }<a name="line.622"></a>
<FONT color="green">623</FONT>    <a name="line.623"></a>
<FONT color="green">624</FONT>          // The topology paths have the host name included as the last <a name="line.624"></a>
<FONT color="green">625</FONT>          // component. Strip it.<a name="line.625"></a>
<FONT color="green">626</FONT>          this.racks = new String[topologyPaths.length];<a name="line.626"></a>
<FONT color="green">627</FONT>          for (int i = 0; i &lt; topologyPaths.length; i++) {<a name="line.627"></a>
<FONT color="green">628</FONT>            this.racks[i] = (new NodeBase(topologyPaths[i])).getNetworkLocation();<a name="line.628"></a>
<FONT color="green">629</FONT>          }<a name="line.629"></a>
<FONT color="green">630</FONT>        }<a name="line.630"></a>
<FONT color="green">631</FONT>      }<a name="line.631"></a>
<FONT color="green">632</FONT>    <a name="line.632"></a>
<FONT color="green">633</FONT>      protected BlockLocation[] getFileBlockLocations(<a name="line.633"></a>
<FONT color="green">634</FONT>        FileSystem fs, FileStatus stat) throws IOException {<a name="line.634"></a>
<FONT color="green">635</FONT>        return fs.getFileBlockLocations(stat, 0, stat.getLen());<a name="line.635"></a>
<FONT color="green">636</FONT>      }<a name="line.636"></a>
<FONT color="green">637</FONT>    <a name="line.637"></a>
<FONT color="green">638</FONT>      private static void addHostToRack(HashMap&lt;String, Set&lt;String&gt;&gt; rackToNodes,<a name="line.638"></a>
<FONT color="green">639</FONT>                                        String rack, String host) {<a name="line.639"></a>
<FONT color="green">640</FONT>        Set&lt;String&gt; hosts = rackToNodes.get(rack);<a name="line.640"></a>
<FONT color="green">641</FONT>        if (hosts == null) {<a name="line.641"></a>
<FONT color="green">642</FONT>          hosts = new HashSet&lt;String&gt;();<a name="line.642"></a>
<FONT color="green">643</FONT>          rackToNodes.put(rack, hosts);<a name="line.643"></a>
<FONT color="green">644</FONT>        }<a name="line.644"></a>
<FONT color="green">645</FONT>        hosts.add(host);<a name="line.645"></a>
<FONT color="green">646</FONT>      }<a name="line.646"></a>
<FONT color="green">647</FONT>      <a name="line.647"></a>
<FONT color="green">648</FONT>      private Set&lt;String&gt; getHosts(Set&lt;String&gt; racks) {<a name="line.648"></a>
<FONT color="green">649</FONT>        Set&lt;String&gt; hosts = new HashSet&lt;String&gt;();<a name="line.649"></a>
<FONT color="green">650</FONT>        for (String rack : racks) {<a name="line.650"></a>
<FONT color="green">651</FONT>          if (rackToNodes.containsKey(rack)) {<a name="line.651"></a>
<FONT color="green">652</FONT>            hosts.addAll(rackToNodes.get(rack));<a name="line.652"></a>
<FONT color="green">653</FONT>          }<a name="line.653"></a>
<FONT color="green">654</FONT>        }<a name="line.654"></a>
<FONT color="green">655</FONT>        return hosts;<a name="line.655"></a>
<FONT color="green">656</FONT>      }<a name="line.656"></a>
<FONT color="green">657</FONT>      <a name="line.657"></a>
<FONT color="green">658</FONT>      /**<a name="line.658"></a>
<FONT color="green">659</FONT>       * Accept a path only if any one of filters given in the<a name="line.659"></a>
<FONT color="green">660</FONT>       * constructor do. <a name="line.660"></a>
<FONT color="green">661</FONT>       */<a name="line.661"></a>
<FONT color="green">662</FONT>      private static class MultiPathFilter implements PathFilter {<a name="line.662"></a>
<FONT color="green">663</FONT>        private List&lt;PathFilter&gt; filters;<a name="line.663"></a>
<FONT color="green">664</FONT>    <a name="line.664"></a>
<FONT color="green">665</FONT>        public MultiPathFilter() {<a name="line.665"></a>
<FONT color="green">666</FONT>          this.filters = new ArrayList&lt;PathFilter&gt;();<a name="line.666"></a>
<FONT color="green">667</FONT>        }<a name="line.667"></a>
<FONT color="green">668</FONT>    <a name="line.668"></a>
<FONT color="green">669</FONT>        public MultiPathFilter(List&lt;PathFilter&gt; filters) {<a name="line.669"></a>
<FONT color="green">670</FONT>          this.filters = filters;<a name="line.670"></a>
<FONT color="green">671</FONT>        }<a name="line.671"></a>
<FONT color="green">672</FONT>    <a name="line.672"></a>
<FONT color="green">673</FONT>        public void add(PathFilter one) {<a name="line.673"></a>
<FONT color="green">674</FONT>          filters.add(one);<a name="line.674"></a>
<FONT color="green">675</FONT>        }<a name="line.675"></a>
<FONT color="green">676</FONT>    <a name="line.676"></a>
<FONT color="green">677</FONT>        public boolean accept(Path path) {<a name="line.677"></a>
<FONT color="green">678</FONT>          for (PathFilter filter : filters) {<a name="line.678"></a>
<FONT color="green">679</FONT>            if (filter.accept(path)) {<a name="line.679"></a>
<FONT color="green">680</FONT>              return true;<a name="line.680"></a>
<FONT color="green">681</FONT>            }<a name="line.681"></a>
<FONT color="green">682</FONT>          }<a name="line.682"></a>
<FONT color="green">683</FONT>          return false;<a name="line.683"></a>
<FONT color="green">684</FONT>        }<a name="line.684"></a>
<FONT color="green">685</FONT>    <a name="line.685"></a>
<FONT color="green">686</FONT>        public String toString() {<a name="line.686"></a>
<FONT color="green">687</FONT>          StringBuffer buf = new StringBuffer();<a name="line.687"></a>
<FONT color="green">688</FONT>          buf.append("[");<a name="line.688"></a>
<FONT color="green">689</FONT>          for (PathFilter f: filters) {<a name="line.689"></a>
<FONT color="green">690</FONT>            buf.append(f);<a name="line.690"></a>
<FONT color="green">691</FONT>            buf.append(",");<a name="line.691"></a>
<FONT color="green">692</FONT>          }<a name="line.692"></a>
<FONT color="green">693</FONT>          buf.append("]");<a name="line.693"></a>
<FONT color="green">694</FONT>          return buf.toString();<a name="line.694"></a>
<FONT color="green">695</FONT>        }<a name="line.695"></a>
<FONT color="green">696</FONT>      }<a name="line.696"></a>
<FONT color="green">697</FONT>    }<a name="line.697"></a>




























































</PRE>
</BODY>
</HTML>
