arrow-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From u..@apache.org
Subject [44/51] [partial] arrow-site git commit: API doc update
Date Sat, 04 Nov 2017 10:38:02 GMT
http://git-wip-us.apache.org/repos/asf/arrow-site/blob/35e0e750/docs/cpp/bit-util_8h_source.html
----------------------------------------------------------------------
diff --git a/docs/cpp/bit-util_8h_source.html b/docs/cpp/bit-util_8h_source.html
index d829f59..bf7b2a2 100644
--- a/docs/cpp/bit-util_8h_source.html
+++ b/docs/cpp/bit-util_8h_source.html
@@ -67,18 +67,19 @@ $(function() {
 <div class="title">bit-util.h</div>  </div>
 </div><!--header-->
 <div class="contents">
-<a href="bit-util_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// Licensed to the Apache Software Foundation (ASF) under one</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">// or more contributor license agreements.  See the NOTICE file</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// distributed with this work for additional information</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// regarding copyright ownership.  The ASF licenses this file</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// to you under the Apache License, Version 2.0 (the</span></div><div class="line"><a name="l00006"></a><span clas
 s="lineno">    6</span>&#160;<span class="comment">// &quot;License&quot;); you may not use this file except in compliance</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">// with the License.  You may obtain a copy of the License at</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">//   http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// Unless required by applicable law or agreed to in writing,</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">// software distributed 
 under the License is distributed on an</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// &quot;AS IS&quot; BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// KIND, either express or implied.  See the License for the</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// specific language governing permissions and limitations</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// under the License.</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#ifndef ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00019"></a><span class="linen
 o">   19</span>&#160;<span class="preprocessor">#define ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#if defined(__APPLE__)</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include &lt;machine/endian.h&gt;</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#elif defined(_WIN32)</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#define __LITTLE_ENDIAN 1</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor">#include &lt;endian.h&
 gt;</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#if defined(_MSC_VER)</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP64 _byteswap_uint64</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP32 _byteswap_ulong</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a582fbf29e9f0fbf6dd39031af11a8894">   33</a></span>&#160;<span class="preprocessor">#define A
 RROW_BYTE_SWAP64 __builtin_bswap64</span></div><div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee">   34</a></span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP32 __builtin_bswap32</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="preprocessor">#include &lt;limits&gt;</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="preprocessor">#include &lt;memory&gt;</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<
 span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="macros_8h.html">arrow/util/macros.h</a>&quot;</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="visibility_8h.html">arrow/util/visibility.h</a>&quot;</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="preprocessor">#ifdef ARROW_USE_SSE</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="cpu-info_8h.html">arrow/util/cpu-info.h</a>&quot;</span></div><div class="line"
 ><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="sse-util_8h.html">arrow/util/sse-util.h</a>&quot;</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacearrow.html">arrow</a> {</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="preprocessor">#ifndef ARROW_NO_DEPRECATED_API</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment">// \depr
 ecated Since &gt; 0.7.0</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a760bf109287895672418b5a7855d4464">   56</a></span>&#160;<span class="preprocessor">#define INIT_BITSET(valid_bits_vector, valid_bits_index)            \</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="preprocessor">  int64_t byte_offset_##valid_bits_vector = (valid_bits_index) / 8; \</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="preprocessor">  int64_t bit_offset_##valid_bits_vector = (valid_bits_index) % 8;  \</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="preprocessor">  uint8_t bitset_##valid_bits_vector = valid_bits_vector[byte_offset_##valid_bits_vector];</span></div><div class="line"><a name="l00
 060"></a><span class="lineno">   60</span>&#160;</div><div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="bit-util_8h.html#abd53b6fe5d0ee60b928d2813f89422cf">   61</a></span>&#160;<span class="preprocessor">#define READ_NEXT_BITSET(valid_bits_vector)                                          \</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="preprocessor">  bit_offset_##valid_bits_vector++;                                                  \</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="preprocessor">  if (bit_offset_##valid_bits_vector == 8) {                                         \</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="preprocessor">    bit_offset_##valid_bits_vector = 0;                                              \</span></div><div class="line"><a name="l00065"></a><span clas
 s="lineno">   65</span>&#160;<span class="preprocessor">    byte_offset_##valid_bits_vector++;                                               \</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="preprocessor">    bitset_##valid_bits_vector = valid_bits_vector[byte_offset_##valid_bits_vector]; \</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="preprocessor">  }</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;<span class="comment">// TODO(wesm): The source from Impala was depending on boost::make_unsigned</span></div><div class="line"><a name="l00072"></
 a><span class="lineno">   72</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="comment">// We add a partial stub implementation here</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="keyword">namespace </span>detail {</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keyword">struct </span>make_unsigned {};</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&
 #160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int8_t&gt; {</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;  <span class="keyword">typedef</span> uint8_t type;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;};</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int16_t&gt; {</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;  <span class="keyword">typedef</span> uint16_t type;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</s
 pan>&#160;};</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int32_t&gt; {</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;  <span class="keyword">typedef</span> uint32_t type;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;};</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int64_t&gt; {</div><div class="line"><a name="l
 00097"></a><span class="lineno">   97</span>&#160;  <span class="keyword">typedef</span> uint64_t type;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;};</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;}  <span class="comment">// namespace detail</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="keyword">class </span>Buffer;</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="keyword">class </span>MemoryPool;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="keyword">class </span>MutableBuffer;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="keyword">class </sp
 an>Status;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="keyword">namespace </span>BitUtil {</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keyword">static</span> constexpr uint8_t kBitmask[] = {1, 2, 4, 8, 16, 32, 64, 128};</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="comment">// the ~i byte version of kBitmaks</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keyword">static</span> constexpr uint8_t kFlippedBitmask[] = {254, 253, 251, 247, 239, 223, 191, 127};</div><div class="line"><a name="l00113"></a><span class="lineno">  113</spa
 n>&#160;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t CeilByte(int64_t size) { <span class="keywordflow">return</span> (size + 7) &amp; ~7; }</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t BytesForBits(int64_t size) { <span class="keywordflow">return</span> CeilByte(size) / 8; }</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t Ceil2Bytes(int64_t size) { <span class="keywordflow">return</span> (size + 15) &amp; ~15; }</div><div class="line"><a name="l00119"></a><span class="lin
 eno">  119</span>&#160;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> GetBit(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;  <span class="keywordflow">return</span> (bits[i / 8] &amp; kBitmask[i % 8]) != 0;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;}</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> BitNotSet(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;  <span class="keywordflo
 w">return</span> (bits[i / 8] &amp; kBitmask[i % 8]) == 0;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;}</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> ClearBit(uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;  bits[i / 8] &amp;= kFlippedBitmask[i % 8];</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;}</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetBit(uint8_t* bits, int64_t i) { bits[i / 8] |=
  kBitmask[i % 8]; }</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetArrayBit(uint8_t* bits, <span class="keywordtype">int</span> i, <span class="keywordtype">bool</span> is_set) {</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;  <span class="keywordflow">if</span> (is_set) {</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    SetBit(bits, i);</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;  }</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;}</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<span clas
 s="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetBitTo(uint8_t* bits, int64_t i, <span class="keywordtype">bool</span> bit_is_set) {</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;  <span class="comment">// TODO: speed up. See https://graphics.stanford.edu/~seander/bithacks.html</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;  <span class="comment">// &quot;Conditionally set or clear bits without branching&quot;</span></div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;  <span class="keywordflow">if</span> (bit_is_set) {</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;    SetBit(bits, i);</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00147"></a><span class="lineno">  147</sp
 an>&#160;    ClearBit(bits, i);</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;  }</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;}</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="comment">// Returns the minimum number of bits needed to represent the value of &#39;x&#39;</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> NumRequiredBits(uint64_t x) {</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 63; i &gt;= 0; --i) {</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    <span class="keywor
 dflow">if</span> (x &amp; (UINT64_C(1) &lt;&lt; i)) <span class="keywordflow">return</span> i + 1;</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;  }</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;}</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t NextPower2(int64_t n) {</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;  n--;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;  n |= n &gt;&gt; 1;</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;  n |= n &gt;&gt; 2;</div><div class="line"><a nam
 e="l00167"></a><span class="lineno">  167</span>&#160;  n |= n &gt;&gt; 4;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;  n |= n &gt;&gt; 8;</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;  n |= n &gt;&gt; 16;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;  n |= n &gt;&gt; 32;</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;  n++;</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;  <span class="keywordflow">return</span> n;</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;}</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsMultipleOf64(int64_t n) { 
 <span class="keywordflow">return</span> (n &amp; 63) == 0; }</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsMultipleOf8(int64_t n) { <span class="keywordflow">return</span> (n &amp; 7) == 0; }</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t Ceil(int64_t value, int64_t divisor) {</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;  <span class="keywordflow">return</span> value / divisor + (value % divisor != 0);</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;}</div><div class="line"><a name="l0
 0183"></a><span class="lineno">  183</span>&#160;</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="keyword">inline</span> int64_t RoundUp(int64_t value, int64_t factor) {</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;  <span class="keywordflow">return</span> (value + (factor - 1)) / factor * factor;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;}</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t RoundDown(int64_t value, int64_t factor) {</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;  <span class="keywordflow">return</span> (value / factor) * factor;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;}<
 /div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> RoundUpToPowerOf2(<span class="keywordtype">int</span> value, <span class="keywordtype">int</span> factor) {</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;  <span class="comment">// DCHECK((factor &gt; 0) &amp;&amp; ((factor &amp; (factor - 1)) == 0));</span></div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;  <span class="keywordflow">return</span> (value + (factor - 1)) &amp; ~(factor - 1);</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;}</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;<sp
 an class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> RoundDownToPowerOf2(<span class="keywordtype">int</span> value, <span class="keywordtype">int</span> factor) {</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;  <span class="comment">// DCHECK((factor &gt; 0) &amp;&amp; ((factor &amp; (factor - 1)) == 0));</span></div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;  <span class="keywordflow">return</span> value &amp; ~(factor - 1);</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;}</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundUpNumBytes(uint32_t bits) { <span class="keywordflow">return</span> (bits + 7) &gt;&gt; 3; }</div><div
  class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundDownNumBytes(uint32_t bits) { <span class="keywordflow">return</span> bits &gt;&gt; 3; }</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundUpNumi32(uint32_t bits) { <span class="keywordflow">return</span> (bits + 31) &gt;&gt; 5; }</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundDownNumi32(uint32_t bits) { <span class="keywordflow">return</span
 > bits &gt;&gt; 5; }</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundUpNumi64(uint32_t bits) { <span class="keywordflow">return</span> (bits + 63) &gt;&gt; 6; }</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundDownNumi64(uint32_t bits) { <span class="keywordflow">return</span> bits &gt;&gt; 6; }</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;<span class="keyword">template</span> &lt;<span class="keywordtype">int</span>64_t ROUND_TO&gt;</div><div class="line"><a na
 me="l00227"></a><span class="lineno">  227</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t RoundToPowerOfTwo(int64_t num) {</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;  <span class="comment">// TODO(wesm): is this definitely needed?</span></div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;  <span class="comment">// DCHECK_GE(num, 0);</span></div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;  constexpr int64_t force_carry_addend = ROUND_TO - 1;</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;  constexpr int64_t truncate_bitmask = ~(ROUND_TO - 1);</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;  constexpr int64_t max_roundable_num = std::numeric_limits&lt;int64_t&gt;::max() - ROUND_TO;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;
   <span class="keywordflow">if</span> (num &lt;= max_roundable_num) {</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;    <span class="keywordflow">return</span> (num + force_carry_addend) &amp; truncate_bitmask;</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;  }</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;  <span class="comment">// handle overflow case.  This should result in a malloc error upstream</span></div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;  <span class="keywordflow">return</span> num;</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;}</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t RoundUpToMulti
 pleOf64(int64_t num) {</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;  <span class="keywordflow">return</span> RoundToPowerOfTwo&lt;64&gt;(num);</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;}</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t RoundUpToMultipleOf8(int64_t num) {</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;  <span class="keywordflow">return</span> RoundToPowerOfTwo&lt;8&gt;(num);</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;}</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="keyword">static</span> <
 span class="keyword">inline</span> <span class="keywordtype">int</span> PopcountNoHw(uint64_t x) {</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;  <span class="keywordtype">int</span> count = 0;</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;  <span class="keywordflow">for</span> (; x != 0; ++count) x &amp;= x - 1;</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;  <span class="keywordflow">return</span> count;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;}</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> Popcount(uint64_t x) {</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span cl
 ass="preprocessor">#ifdef ARROW_USE_SSE</span></div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a1f418a9edc46d53e62732e7ccd06f329">ARROW_PREDICT_TRUE</a>(<a class="code" href="classarrow_1_1_cpu_info.html#ad111f08ae6a89fcc8c47b4fac7a32a3f">CpuInfo::IsSupported</a>(<a class="code" href="classarrow_1_1_cpu_info.html#ae342a62dfe1a66ddf9dfd8c2b5374a39">CpuInfo::POPCNT</a>))) {</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;    <span class="keywordflow">return</span> POPCNT_popcnt_u64(x);</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    <span class="keywordflow">return</span> PopcountNoHw(x);</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;  }</div
 ><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;  <span class="keywordflow">return</span> PopcountNoHw(x);</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;}</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;<span class="comment">// Compute correct population count for various-width signed integers</span></div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;<span cla
 ss="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> PopcountSigned(T v) {</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;  <span class="comment">// Converting to same-width unsigned then extending preserves the bit pattern.</span></div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;  <span class="keywordflow">return</span> BitUtil::Popcount(<span class="keyword">static_cast&lt;</span>typename detail::make_unsigned&lt;T&gt;::type<span class="keyword">&gt;</span>(v));</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;}</div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint64_t TrailingBits(uint64_t v, <span class="keywordtype">int</span> num_bits) {</div
 ><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a6f2ee7ad52872edb915cf48e163ac99c">ARROW_PREDICT_FALSE</a>(num_bits == 0)) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a6f2ee7ad52872edb915cf48e163ac99c">ARROW_PREDICT_FALSE</a>(num_bits &gt;= 64)) <span class="keywordflow">return</span> v;</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;  <span class="keywordtype">int</span> n = 64 - num_bits;</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;  <span class="keywordflow">return</span> (v &lt;&lt; n) &gt;&gt; n;</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;}</div><div class="line"><a name="l00284"></a><span class="lineno">
   284</span>&#160;</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> Log2(uint64_t x) {</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;  <span class="comment">// DCHECK_GT(x, 0);</span></div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;  <span class="keywordflow">if</span> (x == 1) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;  <span class="comment">// Compute result = ceil(log2(x))</span></div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;  <span class="comment">//                = floor(log2(x - 1)) + 1, for x &gt; 1</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;  <span class="comment">// by finding the position of the 
 most significant bit (1-indexed) of x - 1</span></div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;  <span class="comment">// (floor(log2(n)) = MSB(n) (0-indexed))</span></div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;  --x;</div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;  <span class="keywordtype">int</span> result = 1;</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;  <span class="keywordflow">while</span> (x &gt;&gt;= 1) ++result;</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;}</div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;<span class="keyword">static</span
 > <span class="keyword">inline</span> int64_t ByteSwap(int64_t value) { <span class="keywordflow">return</span> <a class="code" href="bit-util_8h.html#a582fbf29e9f0fbf6dd39031af11a8894">ARROW_BYTE_SWAP64</a>(value); }</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint64_t ByteSwap(uint64_t value) {</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(<a class="code" href="bit-util_8h.html#a582fbf29e9f0fbf6dd39031af11a8894">ARROW_BYTE_SWAP64</a>(value));</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;}</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int32_t ByteSwap(int32_t value) 
 { <span class="keywordflow">return</span> <a class="code" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee">ARROW_BYTE_SWAP32</a>(value); }</div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t ByteSwap(uint32_t value) {</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(<a class="code" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee">ARROW_BYTE_SWAP32</a>(value));</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;}</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int16_t ByteSwap(int16_t value) {</div><div class="line"><a name="l00311"></a><span class="lineno">  3
 11</span>&#160;  constexpr int16_t m = <span class="keyword">static_cast&lt;</span>int16_t<span class="keyword">&gt;</span>(0xff);</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>int16_t<span class="keyword">&gt;</span>(((value &gt;&gt; 8) &amp; m) | ((value &amp; m) &lt;&lt; 8));</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;}</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint16_t ByteSwap(uint16_t value) {</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint16_t<span class="keyword">&gt;</span>(ByteSwap(static_cast&lt;int16_t&gt;(value)));</div><div class="line"><a name="l00316"></a><span class="line
 no">  316</span>&#160;}</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> ByteSwap(<span class="keywordtype">void</span>* dst, <span class="keyword">const</span> <span class="keywordtype">void</span>* src, <span class="keywordtype">int</span> len) {</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;  <span class="keywordflow">switch</span> (len) {</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;    <span class="keywordflow">case</span> 1:</div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;      *<span class="keyword">reinterpret_cast&lt;</span>int8_t*<span class="keyword">&gt;</span>(dst) = *reinterpret_cast&lt;const int8_t*&gt;(src);</div><div class="line"><a n
 ame="l00323"></a><span class="lineno">  323</span>&#160;      <span class="keywordflow">return</span>;</div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="keywordflow">case</span> 2:</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;      *<span class="keyword">reinterpret_cast&lt;</span>int16_t*<span class="keyword">&gt;</span>(dst) = ByteSwap(*reinterpret_cast&lt;const int16_t*&gt;(src));</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;      <span class="keywordflow">return</span>;</div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;    <span class="keywordflow">case</span> 4:</div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;      *<span class="keyword">reinterpret_cast&lt;</span>int32_t*<span class="keyword">&gt;</span>(dst) = ByteSwap(*reinterpret_cast&lt;const int32_t*&gt;(src));</div><div class="lin
 e"><a name="l00329"></a><span class="lineno">  329</span>&#160;      <span class="keywordflow">return</span>;</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;    <span class="keywordflow">case</span> 8:</div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;      *<span class="keyword">reinterpret_cast&lt;</span>int64_t*<span class="keyword">&gt;</span>(dst) = ByteSwap(*reinterpret_cast&lt;const int64_t*&gt;(src));</div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;      <span class="keywordflow">return</span>;</div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;    <span class="keywordflow">default</span>:</div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;      <span class="keywordflow">break</span>;</div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;  }</div><div class="line"><a name="l00336">
 </a><span class="lineno">  336</span>&#160;</div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;  uint8_t* d = <span class="keyword">reinterpret_cast&lt;</span>uint8_t*<span class="keyword">&gt;</span>(dst);</div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;  <span class="keyword">const</span> uint8_t* s = <span class="keyword">reinterpret_cast&lt;</span><span class="keyword">const </span>uint8_t*<span class="keyword">&gt;</span>(src);</div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len; ++i) {</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;    d[i] = s[len - i - 1];</div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;  }</div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;}</div><div class="line"><a
  name="l00343"></a><span class="lineno">  343</span>&#160;</div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;<span class="preprocessor">#if __BYTE_ORDER == __LITTLE_ENDIAN</span></div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t ToBigEndian(int64_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint64_t ToBigEndian(uint64_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int32_t ToBigEndian(int32_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name
 ="l00350"></a><span class="lineno">  350</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t ToBigEndian(uint32_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int16_t ToBigEndian(int16_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint16_t ToBigEndian(uint16_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;<span class="keyword">static</span> <span class="keyword">inline
 </span> int64_t ToBigEndian(int64_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint64_t ToBigEndian(uint64_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int32_t ToBigEndian(int32_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t ToBigEndian(uint32_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int16_t ToBigEndian(int16_t val) { <s
 pan class="keywordflow">return</span> val; }</div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint16_t ToBigEndian(uint16_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;</div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;<span class="preprocessor">#if __BYTE_ORDER == __LITTLE_ENDIAN</span></div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t FromBigEndian(int64_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;<span class="key
 word">static</span> <span class="keyword">inline</span> uint64_t FromBigEndian(uint64_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int32_t FromBigEndian(int32_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t FromBigEndian(uint32_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int16_t FromBigEndian(int16_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#1
 60;<span class="keyword">static</span> <span class="keyword">inline</span> uint16_t FromBigEndian(uint16_t value) { <span class="keywordflow">return</span> ByteSwap(value); }</div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t FromBigEndian(int64_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint64_t FromBigEndian(uint64_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int32_t FromBigEndian(int32_t val) { <span class="keywordflow">r
 eturn</span> val; }</div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint32_t FromBigEndian(uint32_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int16_t FromBigEndian(int16_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> uint16_t FromBigEndian(uint16_t val) { <span class="keywordflow">return</span> val; }</div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;</div><div class="line"><a name="l00379"></a><spa
 n class="lineno">  379</span>&#160;<span class="comment">// Logical right shift for signed integer types</span></div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;<span class="comment">// This is needed because the C &gt;&gt; operator does arithmetic right shift</span></div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;<span class="comment">// Negative shift amounts lead to undefined behavior</span></div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;<span class="keyword">static</span> T ShiftRightLogical(T v, <span class="keywordtype">int</span> shift) {</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;  <span class="comment">// Conversion to unsigned ensures most significant bits always f
 illed with 0&#39;s</span></div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>typename detail::make_unsigned&lt;T&gt;::type<span class="keyword">&gt;</span>(v) &gt;&gt; shift;</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;}</div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;<span class="keywordtype">void</span> FillBitsFromBytes(<span class="keyword">const</span> std::vector&lt;uint8_t&gt;&amp; bytes, uint8_t* bits);</div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;ARROW_EXPORT</div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;Status BytesToBits(<span class="keyword">co
 nst</span> std::vector&lt;uint8_t&gt;&amp;, MemoryPool*, std::shared_ptr&lt;Buffer&gt;*);</div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;}  <span class="comment">// namespace BitUtil</span></div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;</div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;<span class="keyword">namespace </span>internal {</div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;</div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;<span class="keyword">class </span>BitmapReader {</div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;  BitmapReader(<span class="keyword">const</span>
  uint8_t* bitmap, int64_t start_offset, int64_t length)</div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;      : bitmap_(bitmap), position_(0), length_(length) {</div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;    current_byte_ = 0;</div><div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;    byte_offset_ = start_offset / 8;</div><div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;    bit_offset_ = start_offset % 8;</div><div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;    <span class="keywordflow">if</span> (length &gt; 0) {</div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;      current_byte_ = bitmap[byte_offset_];</div><div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;    }</div><div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;  }</div><div cl
 ass="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;</div><div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;<span class="preprocessor">#if defined(_MSC_VER)</span></div><div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;  <span class="comment">// MSVC is finicky about this cast</span></div><div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;  <span class="keywordtype">bool</span> IsSet()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (current_byte_ &amp; (1 &lt;&lt; bit_offset_)) != 0; }</div><div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;  <span class="keywordtype">bool</span> IsSet()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> current_byte_ &amp; (1 &lt;&lt; bit_offset_
 ); }</div><div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;</div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;  <span class="keywordtype">bool</span> IsNotSet()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (current_byte_ &amp; (1 &lt;&lt; bit_offset_)) == 0; }</div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;</div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;  <span class="keywordtype">void</span> Next() {</div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;    ++bit_offset_;</div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;    ++position_;</div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;    <span class="
 keywordflow">if</span> (bit_offset_ == 8) {</div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;      bit_offset_ = 0;</div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;      ++byte_offset_;</div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;      <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a1f418a9edc46d53e62732e7ccd06f329">ARROW_PREDICT_TRUE</a>(position_ &lt; length_)) {</div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;        current_byte_ = bitmap_[byte_offset_];</div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;      }</div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;    }</div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;  }</div><div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;</div><div cla
 ss="line"><a name="l00431"></a><span class="lineno">  431</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;  <span class="keyword">const</span> uint8_t* bitmap_;</div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;  int64_t position_;</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;  int64_t length_;</div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;</div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;  uint8_t current_byte_;</div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;  int64_t byte_offset_;</div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;  int64_t bit_offset_;</div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;};</div><div class="line"><a name="l00440"></a><span cla
 ss="lineno">  440</span>&#160;</div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;<span class="keyword">class </span>BitmapWriter {</div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160; <span class="keyword">public</span>:</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;  BitmapWriter(uint8_t* bitmap, int64_t start_offset, int64_t length)</div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;      : bitmap_(bitmap), position_(0), length_(length) {</div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;    current_byte_ = 0;</div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;    byte_offset_ = start_offset / 8;</div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;    bit_offset_ = start_offset % 8;</div><div class="line"><a name="l00448"></a><span class="lineno">  448</sp
 an>&#160;    <span class="keywordflow">if</span> (length &gt; 0) {</div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;      current_byte_ = bitmap[byte_offset_];</div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;    }</div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;  }</div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;</div><div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;  <span class="keywordtype">void</span> Set() { current_byte_ |= BitUtil::kBitmask[bit_offset_]; }</div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;</div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;  <span class="keywordtype">void</span> Clear() { current_byte_ &amp;= BitUtil::kFlippedBitmask[bit_offset_]; }</div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160
 ;</div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;  <span class="keywordtype">void</span> Next() {</div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;    ++bit_offset_;</div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;    ++position_;</div><div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;    bitmap_[byte_offset_] = current_byte_;</div><div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;    <span class="keywordflow">if</span> (bit_offset_ == 8) {</div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;      bit_offset_ = 0;</div><div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;      ++byte_offset_;</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;      <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a1f418a9edc46d53e
 62732e7ccd06f329">ARROW_PREDICT_TRUE</a>(position_ &lt; length_)) {</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        current_byte_ = bitmap_[byte_offset_];</div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;      }</div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;    }</div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;  }</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;</div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;  <span class="keywordtype">void</span> Finish() {</div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;    <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a1f418a9edc46d53e62732e7ccd06f329">ARROW_PREDICT_TRUE</a>(position_ &lt; length_)) {</div><div class="line"><a name="l00472"></a><span class="lineno">  4
 72</span>&#160;      <span class="keywordflow">if</span> (bit_offset_ != 0) {</div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;        bitmap_[byte_offset_] = current_byte_;</div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;      }</div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;    }</div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;  }</div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;</div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;  int64_t position()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> position_; }</div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;</div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160; <span class="keyword">private</span>:</div><div class="line"><a name="l00481
 "></a><span class="lineno">  481</span>&#160;  uint8_t* bitmap_;</div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;  int64_t position_;</div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;  int64_t length_;</div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;</div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;  uint8_t current_byte_;</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;  int64_t byte_offset_;</div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;  int64_t bit_offset_;</div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;};</div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;</div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;}  <span class="comment">// namespace internal</span></div><div clas
 s="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;<span class="comment">// ----------------------------------------------------------------------</span></div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;<span class="comment">// Bitmap utilities</span></div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;ARROW_EXPORT</div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;Status <a class="code" href="namespacearrow.html#a8aab5a752c3a15eda9fe6e63e7d4cefc">GetEmptyBitmap</a>(MemoryPool* pool, int64_t length, std::shared_ptr&lt;Buffer&gt;* result);</div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;</div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;AR
 ROW_EXPORT</div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;Status <a class="code" href="namespacearrow.html#a1c03d877f99bfaa805ee74094e4bcd32">CopyBitmap</a>(MemoryPool* pool, <span class="keyword">const</span> uint8_t* bitmap, int64_t offset, int64_t length,</div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;                  std::shared_ptr&lt;Buffer&gt;* out);</div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;</div><div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;ARROW_EXPORT</div><div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;int64_t <a class="code" href="namespacearrow.html#a55c87c046a937101489a68dd331470ff">CountSetBits</a>(<span class="keyword">const</span> uint8_t* data, int64_t bit_offset, int64_t length);</div><div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;</div><div class="line"><a na
 me="l00521"></a><span class="lineno">  521</span>&#160;ARROW_EXPORT</div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;<span class="keywordtype">bool</span> <a class="code" href="namespacearrow.html#ae3f12b6dd91eb0b7235e50236c7ed85a">BitmapEquals</a>(<span class="keyword">const</span> uint8_t* left, int64_t left_offset, <span class="keyword">const</span> uint8_t* right,</div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;                  int64_t right_offset, int64_t bit_length);</div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;</div><div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;<span class="preprocessor">#ifndef ARROW_NO_DEPRECATED_API</span></div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;ARROW_EXPORT</div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;Status <a class="code" href="namespa
 cearrow.html#a8aab5a752c3a15eda9fe6e63e7d4cefc">GetEmptyBitmap</a>(MemoryPool* pool, int64_t length,</div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;                      std::shared_ptr&lt;MutableBuffer&gt;* result);</div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;}  <span class="comment">// namespace arrow</span></div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;</div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;<span class="preprocessor">#endif  // ARROW_UTIL_BIT_UTIL_H</span></div><div class="ttc" id="namespacearrow_html_a8aab5a752c3a15eda9fe6e63e7d4cefc"><div class="ttname"><a href="namespacearrow.html#a8aab5a752c3a15eda9fe6e63e7d4cefc">arr
 ow::GetEmptyBitmap</a></div><div class="ttdeci">Status GetEmptyBitmap(MemoryPool *pool, int64_t length, std::shared_ptr&lt; Buffer &gt; *result)</div></div>
+<a href="bit-util_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// Licensed to the Apache Software Foundation (ASF) under one</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">// or more contributor license agreements.  See the NOTICE file</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// distributed with this work for additional information</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// regarding copyright ownership.  The ASF licenses this file</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// to you under the Apache License, Version 2.0 (the</span></div><div class="line"><a name="l00006"></a><span clas
 s="lineno">    6</span>&#160;<span class="comment">// &quot;License&quot;); you may not use this file except in compliance</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">// with the License.  You may obtain a copy of the License at</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">//   http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// Unless required by applicable law or agreed to in writing,</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">// software distributed 
 under the License is distributed on an</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// &quot;AS IS&quot; BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// KIND, either express or implied.  See the License for the</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// specific language governing permissions and limitations</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// under the License.</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#ifndef ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00019"></a><span class="linen
 o">   19</span>&#160;<span class="preprocessor">#define ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#ifdef _WIN32</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#define ARROW_LITTLE_ENDIAN 1</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#ifdef __APPLE__</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#include &lt;machine/endian.h&gt;</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor">#else</span></div><div class="li
 ne"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="preprocessor">#include &lt;endian.h&gt;</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="preprocessor">#</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#ifndef __BYTE_ORDER__</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#error &quot;__BYTE_ORDER__ not defined&quot;</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<
 span class="preprocessor">#ifndef __ORDER_LITTLE_ENDIAN__</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#error &quot;__ORDER_LITTLE_ENDIAN__ not defined&quot;</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="preprocessor">#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__</span></div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a71d55e8a4b05576ac5c3ad1bd97e77b7">   39</a></span>&#160;<span class="preprocessor">#define ARROW_LITTLE_ENDIAN 1</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="preprocessor">#else</span></div><
 div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="preprocessor">#define ARROW_LITTLE_ENDIAN 0</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="preprocessor">#if defined(_MSC_VER)</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP64 _byteswap_uint64</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP32 _byteswap_ulong</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 
   48</span>&#160;<span class="preprocessor">#else</span></div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a582fbf29e9f0fbf6dd39031af11a8894">   49</a></span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP64 __builtin_bswap64</span></div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee">   50</a></span>&#160;<span class="preprocessor">#define ARROW_BYTE_SWAP32 __builtin_bswap32</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="preprocessor">#i
 nclude &lt;limits&gt;</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="preprocessor">#include &lt;memory&gt;</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="macros_8h.html">arrow/util/macros.h</a>&quot;</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="util_2type__traits_8h.html">arrow/util/type_traits.h</a>&quot;</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="visibility_8h.html">arrow/util/visibil
 ity.h</a>&quot;</span></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="preprocessor">#ifdef ARROW_USE_SSE</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="cpu-info_8h.html">arrow/util/cpu-info.h</a>&quot;</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="sse-util_8h.html">arrow/util/sse-util.h</a>&quot;</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="keyword">namespace </span><a class="code
 " href="namespacearrow.html">arrow</a> {</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="comment">// TODO(wesm): The source from Impala was depending on boost::make_unsigned</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;<span class="comment">// We add a partial stub implementation here</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="keyword">namespace </span>detail {</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="keyword">template
 </span> &lt;<span class="keyword">typename</span> T&gt;</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="keyword">struct </span>make_unsigned {};</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int8_t&gt; {</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;  <span class="keyword">typedef</span> uint8_t type;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;};</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keyword">template</span> &lt;&gt;</div>
 <div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int16_t&gt; {</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;  <span class="keyword">typedef</span> uint16_t type;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;};</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int32_t&gt; {</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;  <span class="keyword">typedef</span> uint32_t type;</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;};</div><div class="line"><a name="l00092"></
 a><span class="lineno">   92</span>&#160;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="keyword">template</span> &lt;&gt;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="keyword">struct </span>make_unsigned&lt;int64_t&gt; {</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;  <span class="keyword">typedef</span> uint64_t type;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;};</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;}  <span class="comment">// namespace detail</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="keyword">class </span>Buffer;</div><div class="line">
 <a name="l00101"></a><span class="lineno">  101</span>&#160;<span class="keyword">class </span>MemoryPool;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="keyword">class </span>MutableBuffer;</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="keyword">class </span>Status;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="keyword">namespace </span>BitUtil {</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="keyword">static</span> constexpr uint8_t kBitmask[] = {1, 2, 4, 8, 16, 32, 64, 128};</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00109"></a><span class="lineno"> 
  109</span>&#160;<span class="comment">// the ~i byte version of kBitmaks</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<span class="keyword">static</span> constexpr uint8_t kFlippedBitmask[] = {254, 253, 251, 247, 239, 223, 191, 127};</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t CeilByte(int64_t size) { <span class="keywordflow">return</span> (size + 7) &amp; ~7; }</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t BytesForBits(int64_t size) { <span class="keywordflow">return</span> CeilByte(size) / 8; }</div><div class="line"><a name="l00115"></a>
 <span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> int64_t Ceil2Bytes(int64_t size) { <span class="keywordflow">return</span> (size + 15) &amp; ~15; }</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> GetBit(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;  <span class="keywordflow">return</span> (bits[i / 8] &amp; kBitmask[i % 8]) != 0;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;}</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;</div><div class="li
 ne"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="keyword">static</span> <span class="k

<TRUNCATED>

Mime
View raw message