| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <meta http-equiv="X-UA-Compatible" content="IE=9"/> |
| <meta name="generator" content="Doxygen 1.8.6"/> |
| <title>Impala: be/src/exec/hash-table.inline.h Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="navtree.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="resize.js"></script> |
| <script type="text/javascript" src="navtree.js"></script> |
| <script type="text/javascript"> |
| $(document).ready(initResizable); |
| $(window).load(resizeHeight); |
| </script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/search.js"></script> |
| <script type="text/javascript"> |
| $(document).ready(function() { searchBox.OnSelectItem(0); }); |
| </script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </head> |
| <body> |
| <div id="top"><!-- do not remove this div, it is closed by doxygen! --> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td style="padding-left: 0.5em;"> |
| <div id="projectname">Impala |
| </div> |
| <div id="projectbrief">Impalaistheopensource,nativeanalyticdatabaseforApacheHadoop.</div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.8.6 --> |
| <script type="text/javascript"> |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| </script> |
| <div id="navrow1" class="tabs"> |
| <ul class="tablist"> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="namespaces.html"><span>Namespaces</span></a></li> |
| <li><a href="annotated.html"><span>Classes</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| <li> |
| <div id="MSearchBox" class="MSearchBoxInactive"> |
| <span class="left"> |
| <img id="MSearchSelect" src="search/mag_sel.png" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| alt=""/> |
| <input type="text" id="MSearchField" value="Search" accesskey="S" |
| onfocus="searchBox.OnSearchFieldFocus(true)" |
| onblur="searchBox.OnSearchFieldFocus(false)" |
| onkeyup="searchBox.OnSearchFieldChange(event)"/> |
| </span><span class="right"> |
| <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> |
| </span> |
| </div> |
| </li> |
| </ul> |
| </div> |
| <div id="navrow2" class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| <li><a href="globals.html"><span>File Members</span></a></li> |
| </ul> |
| </div> |
| </div><!-- top --> |
| <div id="side-nav" class="ui-resizable side-nav-resizable"> |
| <div id="nav-tree"> |
| <div id="nav-tree-contents"> |
| <div id="nav-sync" class="sync"></div> |
| </div> |
| </div> |
| <div id="splitbar" style="-moz-user-select:none;" |
| class="ui-resizable-handle"> |
| </div> |
| </div> |
| <script type="text/javascript"> |
| $(document).ready(function(){initNavTree('hash-table_8inline_8h_source.html','');}); |
| </script> |
| <div id="doc-content"> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Macros</a></div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">hash-table.inline.h</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="hash-table_8inline_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> <span class="comment">// Copyright 2012 Cloudera Inc.</span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">//</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// You may obtain a copy of the License at</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">//</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">//</span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// See the License for the specific language governing permissions and</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// limitations under the License.</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#ifndef IMPALA_EXEC_HASH_TABLE_INLINE_H</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor"></span><span class="preprocessor">#define IMPALA_EXEC_HASH_TABLE_INLINE_H</span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor"></span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="hash-table_8h.html">exec/hash-table.h</a>"</span></div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span>impala {</div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div> |
| <div class="line"><a name="l00023"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTableCtx.html#aa1c1b818cb5c0004d01f6ad7487a3394"> 23</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classimpala_1_1HashTableCtx.html#aa1c1b818cb5c0004d01f6ad7487a3394">HashTableCtx::EvalAndHashBuild</a>(<a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* row, uint32_t* <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordtype">bool</span> has_null = <a class="code" href="classimpala_1_1HashTableCtx.html#a4710c7202b6716547326b7f1d2a6730b">EvalBuildRow</a>(row);</div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keywordflow">if</span> (!<a class="code" href="classimpala_1_1HashTableCtx.html#a09e07488bac4c611f09303a6e6d2ba13">stores_nulls_</a> && has_null) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  *hash = <a class="code" href="classimpala_1_1HashTableCtx.html#a7f2a20c37756a44feeae7cd335f2746f">HashCurrentRow</a>();</div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> }</div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div> |
| <div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTableCtx.html#a5f92cb6aa106a9fb60fb42debfe14979"> 30</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classimpala_1_1HashTableCtx.html#a5f92cb6aa106a9fb60fb42debfe14979">HashTableCtx::EvalAndHashProbe</a>(<a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* row, uint32_t* <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordtype">bool</span> has_null = <a class="code" href="classimpala_1_1HashTableCtx.html#a35dd000b13acadd90b975609b8e39e55">EvalProbeRow</a>(row);</div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">if</span> ((!<a class="code" href="classimpala_1_1HashTableCtx.html#a09e07488bac4c611f09303a6e6d2ba13">stores_nulls_</a> || !<a class="code" href="classimpala_1_1HashTableCtx.html#a37a23fb4e24cc776ffdef905f8fd76a4">finds_nulls_</a>) && has_null) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  *hash = <a class="code" href="classimpala_1_1HashTableCtx.html#a7f2a20c37756a44feeae7cd335f2746f">HashCurrentRow</a>();</div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> }</div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div> |
| <div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a0c1d67cc8cebd5cd2fb855fa5d0a4a57"> 37</a></span> <span class="keyword">inline</span> int64_t <a class="code" href="classimpala_1_1HashTable.html#a0c1d67cc8cebd5cd2fb855fa5d0a4a57">HashTable::Probe</a>(<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* buckets, int64_t num_buckets,</div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ht_ctx, uint32_t <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>, <span class="keywordtype">bool</span>* found) {</div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  DCHECK_NOTNULL(buckets);</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  DCHECK_GT(num_buckets, 0);</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  *found = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  int64_t bucket_idx = hash & (num_buckets - 1);</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// In case of linear probing it counts the total number of steps for statistics and</span></div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// for knowing when to exit the loop (e.g. by capping the total travel length). In case</span></div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// of quadratic probing it is also used for calculating the length of the next jump.</span></div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  int64_t step = 0;</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &buckets[bucket_idx];</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">if</span> (!bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a759811568856b65f3f7995ec9586b4b4">filled</a>) <span class="keywordflow">return</span> bucket_idx;</div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> (hash == bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a651a400ca63963e409447f5214c554b6">hash</a>) {</div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (ht_ctx != NULL && ht_ctx-><a class="code" href="classimpala_1_1HashTableCtx.html#a889c176bf31f6a36c7ec5e54f18b7c14">Equals</a>(<a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">GetRow</a>(bucket, ht_ctx-><a class="code" href="classimpala_1_1HashTableCtx.html#aec787cbcc1d6aa4d8e90f2fc52d12c50">row_</a>))) {</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  *found = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">return</span> bucket_idx;</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Row equality failed, or not performed. This is a hash collision. Continue</span></div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// searching.</span></div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  ++<a class="code" href="classimpala_1_1HashTable.html#ae21db224cca645cb112fc27d323e9048">num_hash_collisions_</a>;</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  }</div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Move to the next bucket.</span></div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  ++step;</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  ++<a class="code" href="classimpala_1_1HashTable.html#a8cc7932cc1427f6279ced8e9b915f00e">travel_length_</a>;</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">if</span> (<a class="code" href="classimpala_1_1HashTable.html#a1ad3c64c070af80571ca8c79f2ed9f9a">quadratic_probing_</a>) {</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// The i-th probe location is idx = (hash + (step * (step + 1)) / 2) mod num_buckets.</span></div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// This gives num_buckets unique idxs (between 0 and N-1) when num_buckets is a power</span></div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// of 2.</span></div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  bucket_idx = (bucket_idx + step) & (num_buckets - 1);</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  bucket_idx = (bucket_idx + 1) & (num_buckets - 1);</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  } <span class="keywordflow">while</span> (<a class="code" href="compiler-util_8h.html#a262afcfe437f4addb13fb1b47a6a7086">LIKELY</a>(step < num_buckets));</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  DCHECK_EQ(<a class="code" href="classimpala_1_1HashTable.html#a4ce8e82c4e985189eed19deb26471cc2">num_filled_buckets_</a>, num_buckets) << <span class="stringliteral">"Probing of a non-full table "</span></div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  << <span class="stringliteral">"failed: "</span> << <a class="code" href="classimpala_1_1HashTable.html#a1ad3c64c070af80571ca8c79f2ed9f9a">quadratic_probing_</a> << <span class="stringliteral">" "</span> << <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>;</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">Iterator::BUCKET_NOT_FOUND</a>;</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span> }</div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div> |
| <div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a6695a051bc94f74a1d277254d6523f29"> 77</a></span> <span class="keyword">inline</span> <a class="code" href="unionimpala_1_1HashTable_1_1HtData.html">HashTable::HtData</a>* <a class="code" href="classimpala_1_1HashTable.html#a6695a051bc94f74a1d277254d6523f29">HashTable::InsertInternal</a>(<a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ht_ctx,</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  uint32_t <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  ++<a class="code" href="classimpala_1_1HashTable.html#ad5cafb9172df65844a941a43a0e80b3e">num_probes_</a>;</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordtype">bool</span> found = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  int64_t bucket_idx = <a class="code" href="classimpala_1_1HashTable.html#a0c1d67cc8cebd5cd2fb855fa5d0a4a57">Probe</a>(<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>, <a class="code" href="classimpala_1_1HashTable.html#acc898ddea6c8c1d54f21fea4af1bcf7b">num_buckets_</a>, ht_ctx, hash, &found);</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  DCHECK_NE(bucket_idx, <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">Iterator::BUCKET_NOT_FOUND</a>);</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (found) {</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// We need to insert a duplicate node, note that this may fail to allocate memory.</span></div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">DuplicateNode</a>* new_node = <a class="code" href="classimpala_1_1HashTable.html#a4664c5c1d82ab068f7005a2c830910e4">InsertDuplicateNode</a>(bucket_idx);</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(new_node == NULL)) <span class="keywordflow">return</span> NULL;</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> &new_node-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#ac7abbf3c029016c52411a3c4adc284bd">htdata</a>;</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="classimpala_1_1HashTable.html#a4222254505940c65b0b817c4836a1021">PrepareBucketForInsert</a>(bucket_idx, hash);</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> &<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[bucket_idx].<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a28c4ed7933d299131d303592d92a7d7e">htdata</a>;</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span> }</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div> |
| <div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a60e5c8ae0744eb588bfbb8ae98bbeaf0"> 94</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classimpala_1_1HashTable.html#a60e5c8ae0744eb588bfbb8ae98bbeaf0">HashTable::Insert</a>(<a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ht_ctx,</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <a class="code" href="structimpala_1_1BufferedTupleStream_1_1RowIdx.html">BufferedTupleStream::RowIdx</a>& <a class="code" href="namespacegen__ir__descriptions.html#a0d6572990c8dd576a55a21ff11d6deb7">idx</a>, <a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* row, uint32_t <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (<a class="code" href="classimpala_1_1HashTable.html#aea176ae316a2d2e6a6ec1210c0ba7373">stores_tuples_</a>) <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#a60e5c8ae0744eb588bfbb8ae98bbeaf0">Insert</a>(ht_ctx, row-><a class="code" href="classimpala_1_1TupleRow.html#aed3092e531291470b27fc48afa901600">GetTuple</a>(0), <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>);</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="unionimpala_1_1HashTable_1_1HtData.html">HtData</a>* htdata = <a class="code" href="classimpala_1_1HashTable.html#a6695a051bc94f74a1d277254d6523f29">InsertInternal</a>(ht_ctx, hash);</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// If successful insert, update the contents of the newly inserted entry with 'idx'.</span></div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a262afcfe437f4addb13fb1b47a6a7086">LIKELY</a>(htdata != NULL)) {</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  htdata->idx = <a class="code" href="namespacegen__ir__descriptions.html#a0d6572990c8dd576a55a21ff11d6deb7">idx</a>;</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span> }</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div> |
| <div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a055d0c676428583f876058dcfbfb15a4"> 106</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classimpala_1_1HashTable.html#a60e5c8ae0744eb588bfbb8ae98bbeaf0">HashTable::Insert</a>(<a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ht_ctx, <a class="code" href="classimpala_1_1Tuple.html">Tuple</a>* tuple, uint32_t <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  DCHECK(<a class="code" href="classimpala_1_1HashTable.html#aea176ae316a2d2e6a6ec1210c0ba7373">stores_tuples_</a>);</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="unionimpala_1_1HashTable_1_1HtData.html">HtData</a>* htdata = <a class="code" href="classimpala_1_1HashTable.html#a6695a051bc94f74a1d277254d6523f29">InsertInternal</a>(ht_ctx, hash);</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// If successful insert, update the contents of the newly inserted entry with 'tuple'.</span></div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a262afcfe437f4addb13fb1b47a6a7086">LIKELY</a>(htdata != NULL)) {</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  htdata-><a class="code" href="unionimpala_1_1HashTable_1_1HtData.html#a399c6ee6b802c2d55f4c18fef30d5a43">tuple</a> = tuple;</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span> }</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div> |
| <div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#ac128e2d41168cc9e08b40c34e1a29bc3"> 117</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html">HashTable::Iterator</a> <a class="code" href="classimpala_1_1HashTable.html#ac128e2d41168cc9e08b40c34e1a29bc3">HashTable::Find</a>(<a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ht_ctx, uint32_t <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  ++<a class="code" href="classimpala_1_1HashTable.html#ad5cafb9172df65844a941a43a0e80b3e">num_probes_</a>;</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">bool</span> found = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  int64_t bucket_idx = <a class="code" href="classimpala_1_1HashTable.html#a0c1d67cc8cebd5cd2fb855fa5d0a4a57">Probe</a>(<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>, <a class="code" href="classimpala_1_1HashTable.html#acc898ddea6c8c1d54f21fea4af1bcf7b">num_buckets_</a>, ht_ctx, hash, &found);</div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span> (found) {</div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#a9830fc407400559db7e7783cc10a9394">Iterator</a>(<span class="keyword">this</span>, ht_ctx-><a class="code" href="classimpala_1_1HashTableCtx.html#a1ad8788675d03050636efe015a75c426">row</a>(), bucket_idx,</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[bucket_idx].<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a454ac703d86426476a735f72ab036d09">duplicates</a>, <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>);</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#ac62ebb8f6c388dff042794e69de596a9">End</a>();</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span> }</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div> |
| <div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a98f48e7cfbdb196b9a9e9413f6c7fcff"> 128</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html">HashTable::Iterator</a> <a class="code" href="classimpala_1_1HashTable.html#a98f48e7cfbdb196b9a9e9413f6c7fcff">HashTable::Begin</a>(<a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ctx) {</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  int64_t bucket_idx = <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">Iterator::BUCKET_NOT_FOUND</a>;</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">DuplicateNode</a>* node = NULL;</div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="classimpala_1_1HashTable.html#a67951a6c7296d85edb7a08b5fe143352">NextFilledBucket</a>(&bucket_idx, &node);</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#a9830fc407400559db7e7783cc10a9394">Iterator</a>(<span class="keyword">this</span>, ctx-><a class="code" href="classimpala_1_1HashTableCtx.html#a1ad8788675d03050636efe015a75c426">row</a>(), bucket_idx, node, 0);</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span> }</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div> |
| <div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#ac03658dce51b9f2582daebec0646e80a"> 135</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html">HashTable::Iterator</a> <a class="code" href="classimpala_1_1HashTable.html#ac03658dce51b9f2582daebec0646e80a">HashTable::FirstUnmatched</a>(<a class="code" href="classimpala_1_1HashTableCtx.html">HashTableCtx</a>* ctx) {</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  int64_t bucket_idx = <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">Iterator::BUCKET_NOT_FOUND</a>;</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">DuplicateNode</a>* node = NULL;</div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="classimpala_1_1HashTable.html#a67951a6c7296d85edb7a08b5fe143352">NextFilledBucket</a>(&bucket_idx, &node);</div> |
| <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html">Iterator</a> it(<span class="keyword">this</span>, ctx-><a class="code" href="classimpala_1_1HashTableCtx.html#a1ad8788675d03050636efe015a75c426">row</a>(), bucket_idx, node, 0);</div> |
| <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Check whether the bucket, or its first duplicate node, is matched. If it is not</span></div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// matched, then return. Otherwise, move to the first unmatched entry (node or bucket).</span></div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[bucket_idx];</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> ((!bucket->hasDuplicates && bucket->matched) ||</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  (bucket->hasDuplicates && node->matched)) {</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  it.NextUnmatched();</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> it;</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span> }</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div> |
| <div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a67951a6c7296d85edb7a08b5fe143352"> 150</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable.html#a67951a6c7296d85edb7a08b5fe143352">HashTable::NextFilledBucket</a>(int64_t* bucket_idx, <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">DuplicateNode</a>** node) {</div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  ++*bucket_idx;</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (; *bucket_idx < <a class="code" href="classimpala_1_1HashTable.html#acc898ddea6c8c1d54f21fea4af1bcf7b">num_buckets_</a>; ++*bucket_idx) {</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[*bucket_idx].filled) {</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  *node = <a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[*bucket_idx].<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a454ac703d86426476a735f72ab036d09">duplicates</a>;</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// Reached the end of the hash table.</span></div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  *bucket_idx = <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">Iterator::BUCKET_NOT_FOUND</a>;</div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  *node = NULL;</div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span> }</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div> |
| <div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a4222254505940c65b0b817c4836a1021"> 163</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable.html#a4222254505940c65b0b817c4836a1021">HashTable::PrepareBucketForInsert</a>(int64_t bucket_idx, uint32_t <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>) {</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  DCHECK_GE(bucket_idx, 0);</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  DCHECK_LT(bucket_idx, <a class="code" href="classimpala_1_1HashTable.html#acc898ddea6c8c1d54f21fea4af1bcf7b">num_buckets_</a>);</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[bucket_idx];</div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  DCHECK(!bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a759811568856b65f3f7995ec9586b4b4">filled</a>);</div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  ++<a class="code" href="classimpala_1_1HashTable.html#a4ce8e82c4e985189eed19deb26471cc2">num_filled_buckets_</a>;</div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a759811568856b65f3f7995ec9586b4b4">filled</a> = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a> = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a> = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a651a400ca63963e409447f5214c554b6">hash</a> = <a class="code" href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">hash</a>;</div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span> }</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div> |
| <div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a9298e0fdd6056ad976cc5d8f38c24e81"> 175</a></span> <span class="keyword">inline</span> <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">HashTable::DuplicateNode</a>* <a class="code" href="classimpala_1_1HashTable.html#a9298e0fdd6056ad976cc5d8f38c24e81">HashTable::AppendNextNode</a>(<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket) {</div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  DCHECK_GT(<a class="code" href="classimpala_1_1HashTable.html#ae1cda955b2701205694fdf8407f90138">node_remaining_current_page_</a>, 0);</div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a454ac703d86426476a735f72ab036d09">duplicates</a> = <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>;</div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  ++<a class="code" href="classimpala_1_1HashTable.html#afad2ad0b627b41b7fe072598f762c0ae">num_duplicate_nodes_</a>;</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  --<a class="code" href="classimpala_1_1HashTable.html#ae1cda955b2701205694fdf8407f90138">node_remaining_current_page_</a>;</div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>++;</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span> }</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div> |
| <div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a4664c5c1d82ab068f7005a2c830910e4"> 183</a></span> <span class="keyword">inline</span> <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">HashTable::DuplicateNode</a>* <a class="code" href="classimpala_1_1HashTable.html#a4664c5c1d82ab068f7005a2c830910e4">HashTable::InsertDuplicateNode</a>(int64_t bucket_idx) {</div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  DCHECK_GE(bucket_idx, 0);</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  DCHECK_LT(bucket_idx, <a class="code" href="classimpala_1_1HashTable.html#acc898ddea6c8c1d54f21fea4af1bcf7b">num_buckets_</a>);</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &<a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[bucket_idx];</div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  DCHECK(bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a759811568856b65f3f7995ec9586b4b4">filled</a>);</div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Allocate one duplicate node for the new data and one for the preexisting data,</span></div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// if needed.</span></div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">while</span> (node_remaining_current_page_ < 1 + !bucket->hasDuplicates) {</div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(!<a class="code" href="classimpala_1_1HashTable.html#aa7f625824191cf1eb85af0d4c79cd255">GrowNodeArray</a>())) <span class="keywordflow">return</span> NULL;</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (!bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>) {</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// This is the first duplicate in this bucket. It means that we need to convert</span></div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// the current entry in the bucket to a node and link it from the bucket.</span></div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#ac7abbf3c029016c52411a3c4adc284bd">htdata</a>.<a class="code" href="unionimpala_1_1HashTable_1_1HtData.html#ae540a5f4e0b9f80e3f9057678328e0f7">idx</a> = bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a28c4ed7933d299131d303592d92a7d7e">htdata</a>.<a class="code" href="unionimpala_1_1HashTable_1_1HtData.html#ae540a5f4e0b9f80e3f9057678328e0f7">idx</a>;</div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  DCHECK(!bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a>);</div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#a61fe600bfa729712702e550a1d334133">matched</a> = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#a3d4f49a62285fc21dd3caec9aa7fe820">next</a> = NULL;</div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="classimpala_1_1HashTable.html#a9298e0fdd6056ad976cc5d8f38c24e81">AppendNextNode</a>(bucket);</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a> = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  ++<a class="code" href="classimpala_1_1HashTable.html#a92d8c35c802147adf40685e7c1bdcca7">num_buckets_with_duplicates_</a>;</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// Link a new node.</span></div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#a3d4f49a62285fc21dd3caec9aa7fe820">next</a> = bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a454ac703d86426476a735f72ab036d09">duplicates</a>;</div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">next_node_</a>-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#a61fe600bfa729712702e550a1d334133">matched</a> = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#a9298e0fdd6056ad976cc5d8f38c24e81">AppendNextNode</a>(bucket);</div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span> }</div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div> |
| <div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767"> 210</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* <a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">HashTable::GetRow</a>(<a class="code" href="unionimpala_1_1HashTable_1_1HtData.html">HtData</a>& htdata, <a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* row)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (<a class="code" href="classimpala_1_1HashTable.html#aea176ae316a2d2e6a6ec1210c0ba7373">stores_tuples_</a>) {</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> <span class="keyword">reinterpret_cast<</span><a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>*<span class="keyword">></span>(&htdata.<a class="code" href="unionimpala_1_1HashTable_1_1HtData.html#a399c6ee6b802c2d55f4c18fef30d5a43">tuple</a>);</div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="classimpala_1_1HashTable.html#a53e8f6764f9f739c3a2f478c5c5e7d4c">tuple_stream_</a>-><a class="code" href="classimpala_1_1BufferedTupleStream.html#a87909f60c4efe1aae47471ce668136ec">GetTupleRow</a>(htdata.<a class="code" href="unionimpala_1_1HashTable_1_1HtData.html#ae540a5f4e0b9f80e3f9057678328e0f7">idx</a>, row);</div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</span> row;</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span> }</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div> |
| <div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable.html#a65e7a1bd56c401b2f3a7d0a4509b9b7e"> 219</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* <a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">HashTable::GetRow</a>(<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket, <a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* row)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  DCHECK_NOTNULL(bucket);</div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>)) {</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html">DuplicateNode</a>* duplicate = bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a454ac703d86426476a735f72ab036d09">duplicates</a>;</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  DCHECK_NOTNULL(duplicate);</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">GetRow</a>(duplicate-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#ac7abbf3c029016c52411a3c4adc284bd">htdata</a>, row);</div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">GetRow</a>(bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a28c4ed7933d299131d303592d92a7d7e">htdata</a>, row);</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span> }</div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div> |
| <div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#a9ad9ccfb9528dc9ef7daa26125ec0bf4"> 230</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1TupleRow.html">TupleRow</a>* <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a9ad9ccfb9528dc9ef7daa26125ec0bf4">HashTable::Iterator::GetRow</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  DCHECK(!<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#aea6a675fd49a49907fe7734b94e15a61">AtEnd</a>());</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  DCHECK_NOTNULL(<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4247ec5fb9eed4bbeb44d616a5160073">table_</a>);</div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  DCHECK_NOTNULL(<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a7461da6e3c7cc7f04407e89a60a8aabd">row_</a>);</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4247ec5fb9eed4bbeb44d616a5160073">table_</a>-><a class="code" href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">buckets_</a>[<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a3fad4b0eb6d105cfafb07464570e8cd4">bucket_idx_</a>];</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>)) {</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  DCHECK_NOTNULL(<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a34e6e9efbd7f665c6a870a11938ff031">node_</a>);</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4247ec5fb9eed4bbeb44d616a5160073">table_</a>-><a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">GetRow</a>(<a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a34e6e9efbd7f665c6a870a11938ff031">node_</a>-><a class="code" href="structimpala_1_1HashTable_1_1DuplicateNode.html#ac7abbf3c029016c52411a3c4adc284bd">htdata</a>, <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a7461da6e3c7cc7f04407e89a60a8aabd">row_</a>);</div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">return</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4247ec5fb9eed4bbeb44d616a5160073">table_</a>-><a class="code" href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">GetRow</a>(bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a28c4ed7933d299131d303592d92a7d7e">htdata</a>, <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a7461da6e3c7cc7f04407e89a60a8aabd">row_</a>);</div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span> }</div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div> |
| <div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#a0116ff819c2e1f30e3c572f4295ac127"> 243</a></span> <span class="keyword">inline</span> <a class="code" href="classimpala_1_1Tuple.html">Tuple</a>* <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a0116ff819c2e1f30e3c572f4295ac127">HashTable::Iterator::GetTuple</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  DCHECK(!AtEnd());</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  DCHECK(table_->stores_tuples_);</div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &table_->buckets_[bucket_idx_];</div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// TODO: To avoid the hasDuplicates check, store the HtData* in the Iterator.</span></div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>)) {</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  DCHECK_NOTNULL(node_);</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">return</span> node_->htdata.tuple;</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">return</span> bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">bucketData</a>.<a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a28c4ed7933d299131d303592d92a7d7e">htdata</a>.<a class="code" href="unionimpala_1_1HashTable_1_1HtData.html#a399c6ee6b802c2d55f4c18fef30d5a43">tuple</a>;</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span> }</div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div> |
| <div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#a298163e8c4896999e93d089f7184ce48"> 256</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a298163e8c4896999e93d089f7184ce48">HashTable::Iterator::SetMatched</a>() {</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  DCHECK(!AtEnd());</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &table_->buckets_[bucket_idx_];</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>) {</div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  node_-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a> = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a> = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// Used for disabling spilling of hash tables in right and full-outer joins with</span></div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// matches. See IMPALA-1488.</span></div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  table_->has_matches_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span> }</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div> |
| <div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#a847ac66b73ae38d6b0df4902cdb4257c"> 269</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a847ac66b73ae38d6b0df4902cdb4257c">HashTable::Iterator::IsMatched</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  DCHECK(!AtEnd());</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &table_->buckets_[bucket_idx_];</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>) {</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">return</span> node_-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a>;</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span> bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a>;</div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span> }</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div> |
| <div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#adf4533910604ee31e8c1eb8fb9fc90c2"> 278</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#adf4533910604ee31e8c1eb8fb9fc90c2">HashTable::Iterator::SetAtEnd</a>() {</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  bucket_idx_ = BUCKET_NOT_FOUND;</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  node_ = NULL;</div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span> }</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div> |
| <div class="line"><a name="l00283"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#a09b460586ab67d86997ffb537f588cc9"> 283</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a09b460586ab67d86997ffb537f588cc9">HashTable::Iterator::Next</a>() {</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  DCHECK(!AtEnd());</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (table_->buckets_[bucket_idx_].hasDuplicates && node_->next != NULL) {</div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  node_ = node_->next;</div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  table_->NextFilledBucket(&bucket_idx_, &node_);</div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span> }</div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div> |
| <div class="line"><a name="l00292"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#a5b53afbdd6e0f077909b850ae1acb9d0"> 292</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a5b53afbdd6e0f077909b850ae1acb9d0">HashTable::Iterator::NextDuplicate</a>() {</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  DCHECK(!AtEnd());</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (table_->buckets_[bucket_idx_].hasDuplicates && node_->next != NULL) {</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  node_ = node_->next;</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  bucket_idx_ = BUCKET_NOT_FOUND;</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  node_ = NULL;</div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span> }</div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div> |
| <div class="line"><a name="l00302"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTable_1_1Iterator.html#aad37490de39af6da7eec0a8f89cbb3c4"> 302</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#aad37490de39af6da7eec0a8f89cbb3c4">HashTable::Iterator::NextUnmatched</a>() {</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  DCHECK(!AtEnd());</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <a class="code" href="structimpala_1_1HashTable_1_1Bucket.html">Bucket</a>* bucket = &table_->buckets_[bucket_idx_];</div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// Check if there is any remaining unmatched duplicate node in the current bucket.</span></div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>) {</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">while</span> (node_->next != NULL) {</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  node_ = node_->next;</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">if</span> (!node_->matched) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  }</div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  }</div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// Move to the next filled bucket and return if this bucket is not matched or</span></div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// iterate to the first not matched duplicate node.</span></div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  table_->NextFilledBucket(&bucket_idx_, &node_);</div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">while</span> (bucket_idx_ != <a class="code" href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">Iterator::BUCKET_NOT_FOUND</a>) {</div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  bucket = &table_->buckets_[bucket_idx_];</div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (!bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">hasDuplicates</a>) {</div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (!bucket-><a class="code" href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">matched</a>) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">while</span> (node_->matched && node_->next != NULL) {</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  node_ = node_->next;</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">if</span> (!node_->matched) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  table_->NextFilledBucket(&bucket_idx_, &node_);</div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div> |
| <div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="classimpala_1_1HashTableCtx.html#aadd04c3eb11049a06d356844ae479ee4"> 329</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classimpala_1_1HashTableCtx.html#aadd04c3eb11049a06d356844ae479ee4">HashTableCtx::set_level</a>(<span class="keywordtype">int</span> level) {</div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  DCHECK_GE(level, 0);</div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  DCHECK_LT(level, seeds_.size());</div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  level_ = level;</div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span> }</div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span> }</div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="preprocessor">#endif</span></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_aadd04c3eb11049a06d356844ae479ee4"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#aadd04c3eb11049a06d356844ae479ee4">impala::HashTableCtx::set_level</a></div><div class="ttdeci">void set_level(int level)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00329">hash-table.inline.h:329</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html">impala::HashTable::Iterator</a></div><div class="ttdoc">stl-like iterator interface. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00450">hash-table.h:450</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_aea6a675fd49a49907fe7734b94e15a61"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#aea6a675fd49a49907fe7734b94e15a61">impala::HashTable::Iterator::AtEnd</a></div><div class="ttdeci">bool AtEnd() const </div><div class="ttdoc">Returns true if this iterator is at the end, i.e. GetRow() cannot be called. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00492">hash-table.h:492</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ac62ebb8f6c388dff042794e69de596a9"><div class="ttname"><a href="classimpala_1_1HashTable.html#ac62ebb8f6c388dff042794e69de596a9">impala::HashTable::End</a></div><div class="ttdeci">Iterator End()</div><div class="ttdoc">Return end marker. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00434">hash-table.h:434</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a889c176bf31f6a36c7ec5e54f18b7c14"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a889c176bf31f6a36c7ec5e54f18b7c14">impala::HashTableCtx::Equals</a></div><div class="ttdeci">bool IR_NO_INLINE Equals(TupleRow *build_row)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8cc_source.html#l00171">hash-table.cc:171</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_aa7f625824191cf1eb85af0d4c79cd255"><div class="ttname"><a href="classimpala_1_1HashTable.html#aa7f625824191cf1eb85af0d4c79cd255">impala::HashTable::GrowNodeArray</a></div><div class="ttdeci">bool GrowNodeArray()</div><div class="ttdoc">Grow the node array. Returns false on OOM. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8cc_source.html#l00345">hash-table.cc:345</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a0116ff819c2e1f30e3c572f4295ac127"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a0116ff819c2e1f30e3c572f4295ac127">impala::HashTable::Iterator::GetTuple</a></div><div class="ttdeci">Tuple * GetTuple() const </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00243">hash-table.inline.h:243</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a8cc7932cc1427f6279ced8e9b915f00e"><div class="ttname"><a href="classimpala_1_1HashTable.html#a8cc7932cc1427f6279ced8e9b915f00e">impala::HashTable::travel_length_</a></div><div class="ttdeci">int64_t travel_length_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00657">hash-table.h:657</a></div></div> |
| <div class="ttc" id="hash-table_8h_html"><div class="ttname"><a href="hash-table_8h.html">hash-table.h</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_adf4533910604ee31e8c1eb8fb9fc90c2"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#adf4533910604ee31e8c1eb8fb9fc90c2">impala::HashTable::Iterator::SetAtEnd</a></div><div class="ttdeci">void SetAtEnd()</div><div class="ttdoc">Resets everything but the pointer to the hash table. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00278">hash-table.inline.h:278</a></div></div> |
| <div class="ttc" id="classimpala_1_1TupleRow_html_aed3092e531291470b27fc48afa901600"><div class="ttname"><a href="classimpala_1_1TupleRow.html#aed3092e531291470b27fc48afa901600">impala::TupleRow::GetTuple</a></div><div class="ttdeci">Tuple * GetTuple(int tuple_idx)</div><div class="ttdef"><b>Definition:</b> <a href="tuple-row_8h_source.html#l00030">tuple-row.h:30</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_aad37490de39af6da7eec0a8f89cbb3c4"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#aad37490de39af6da7eec0a8f89cbb3c4">impala::HashTable::Iterator::NextUnmatched</a></div><div class="ttdeci">void NextUnmatched()</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00302">hash-table.inline.h:302</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a7461da6e3c7cc7f04407e89a60a8aabd"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a7461da6e3c7cc7f04407e89a60a8aabd">impala::HashTable::Iterator::row_</a></div><div class="ttdeci">TupleRow * row_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00506">hash-table.h:506</a></div></div> |
| <div class="ttc" id="classimpala_1_1Tuple_html"><div class="ttname"><a href="classimpala_1_1Tuple.html">impala::Tuple</a></div><div class="ttdoc">A tuple with 0 materialised slots is represented as NULL. </div><div class="ttdef"><b>Definition:</b> <a href="tuple_8h_source.html#l00048">tuple.h:48</a></div></div> |
| <div class="ttc" id="namespaceimpala_html_a50b59c9628eedf49aa82643ce601967d"><div class="ttname"><a href="namespaceimpala.html#a50b59c9628eedf49aa82643ce601967d">impala::hash</a></div><div class="ttdeci">const StringSearch UrlParser::hash_search & hash</div><div class="ttdef"><b>Definition:</b> <a href="url-parser_8cc_source.html#l00041">url-parser.cc:41</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1DuplicateNode_html_a3d4f49a62285fc21dd3caec9aa7fe820"><div class="ttname"><a href="structimpala_1_1HashTable_1_1DuplicateNode.html#a3d4f49a62285fc21dd3caec9aa7fe820">impala::HashTable::DuplicateNode::next</a></div><div class="ttdeci">DuplicateNode * next</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00299">hash-table.h:299</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a9298e0fdd6056ad976cc5d8f38c24e81"><div class="ttname"><a href="classimpala_1_1HashTable.html#a9298e0fdd6056ad976cc5d8f38c24e81">impala::HashTable::AppendNextNode</a></div><div class="ttdeci">DuplicateNode *IR_ALWAYS_INLINE AppendNextNode(Bucket *bucket)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00175">hash-table.inline.h:175</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a6695a051bc94f74a1d277254d6523f29"><div class="ttname"><a href="classimpala_1_1HashTable.html#a6695a051bc94f74a1d277254d6523f29">impala::HashTable::InsertInternal</a></div><div class="ttdeci">HtData *IR_ALWAYS_INLINE InsertInternal(HashTableCtx *ht_ctx, uint32_t hash)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00077">hash-table.inline.h:77</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_a454ac703d86426476a735f72ab036d09"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#a454ac703d86426476a735f72ab036d09">impala::HashTable::Bucket::duplicates</a></div><div class="ttdeci">DuplicateNode * duplicates</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00324">hash-table.h:324</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a4ae05474c3eb4e4c308e20db50836071"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a4ae05474c3eb4e4c308e20db50836071">impala::HashTable::Iterator::BUCKET_NOT_FOUND</a></div><div class="ttdeci">static const int64_t BUCKET_NOT_FOUND</div><div class="ttdoc">Bucket index value when probe is not successful. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00453">hash-table.h:453</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a98f48e7cfbdb196b9a9e9413f6c7fcff"><div class="ttname"><a href="classimpala_1_1HashTable.html#a98f48e7cfbdb196b9a9e9413f6c7fcff">impala::HashTable::Begin</a></div><div class="ttdeci">Iterator Begin(HashTableCtx *ht_ctx)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00128">hash-table.inline.h:128</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_aef6be21fddf0a939b50561f53398fe09"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#aef6be21fddf0a939b50561f53398fe09">impala::HashTable::Bucket::bucketData</a></div><div class="ttdeci">union impala::HashTable::Bucket::@6 bucketData</div><div class="ttdoc">Either the data for this bucket or the linked list of duplicates. </div></div> |
| <div class="ttc" id="unionimpala_1_1HashTable_1_1HtData_html"><div class="ttname"><a href="unionimpala_1_1HashTable_1_1HtData.html">impala::HashTable::HtData</a></div><div class="ttdoc">Either the row in the tuple stream or a pointer to the single tuple of this row. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00285">hash-table.h:285</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html">impala::HashTable::Bucket</a></div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00303">hash-table.h:303</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a1ad3c64c070af80571ca8c79f2ed9f9a"><div class="ttname"><a href="classimpala_1_1HashTable.html#a1ad3c64c070af80571ca8c79f2ed9f9a">impala::HashTable::quadratic_probing_</a></div><div class="ttdeci">const bool quadratic_probing_</div><div class="ttdoc">Quadratic probing enabled (as opposed to linear). </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00605">hash-table.h:605</a></div></div> |
| <div class="ttc" id="unionimpala_1_1HashTable_1_1HtData_html_a399c6ee6b802c2d55f4c18fef30d5a43"><div class="ttname"><a href="unionimpala_1_1HashTable_1_1HtData.html#a399c6ee6b802c2d55f4c18fef30d5a43">impala::HashTable::HtData::tuple</a></div><div class="ttdeci">Tuple * tuple</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00287">hash-table.h:287</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a5b53afbdd6e0f077909b850ae1acb9d0"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a5b53afbdd6e0f077909b850ae1acb9d0">impala::HashTable::Iterator::NextDuplicate</a></div><div class="ttdeci">void IR_ALWAYS_INLINE NextDuplicate()</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00292">hash-table.inline.h:292</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_afad2ad0b627b41b7fe072598f762c0ae"><div class="ttname"><a href="classimpala_1_1HashTable.html#afad2ad0b627b41b7fe072598f762c0ae">impala::HashTable::num_duplicate_nodes_</a></div><div class="ttdeci">int64_t num_duplicate_nodes_</div><div class="ttdoc">Number of duplicate nodes. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00620">hash-table.h:620</a></div></div> |
| <div class="ttc" id="classimpala_1_1TupleRow_html"><div class="ttname"><a href="classimpala_1_1TupleRow.html">impala::TupleRow</a></div><div class="ttdef"><b>Definition:</b> <a href="tuple-row_8h_source.html#l00028">tuple-row.h:28</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_a5d5ccf6675881442370ca9485cc13a37"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#a5d5ccf6675881442370ca9485cc13a37">impala::HashTable::Bucket::matched</a></div><div class="ttdeci">bool matched</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00311">hash-table.h:311</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1DuplicateNode_html"><div class="ttname"><a href="structimpala_1_1HashTable_1_1DuplicateNode.html">impala::HashTable::DuplicateNode</a></div><div class="ttdoc">Linked list of entries used for duplicates. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00291">hash-table.h:291</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a4ce8e82c4e985189eed19deb26471cc2"><div class="ttname"><a href="classimpala_1_1HashTable.html#a4ce8e82c4e985189eed19deb26471cc2">impala::HashTable::num_filled_buckets_</a></div><div class="ttdeci">int64_t num_filled_buckets_</div><div class="ttdoc">Number of non-empty buckets. Used to determine when to resize. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00632">hash-table.h:632</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a847ac66b73ae38d6b0df4902cdb4257c"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a847ac66b73ae38d6b0df4902cdb4257c">impala::HashTable::Iterator::IsMatched</a></div><div class="ttdeci">bool IsMatched() const </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00269">hash-table.inline.h:269</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a3fad4b0eb6d105cfafb07464570e8cd4"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a3fad4b0eb6d105cfafb07464570e8cd4">impala::HashTable::Iterator::bucket_idx_</a></div><div class="ttdeci">int64_t bucket_idx_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00510">hash-table.h:510</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a09e07488bac4c611f09303a6e6d2ba13"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a09e07488bac4c611f09303a6e6d2ba13">impala::HashTableCtx::stores_nulls_</a></div><div class="ttdeci">const bool stores_nulls_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00234">hash-table.h:234</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_a759811568856b65f3f7995ec9586b4b4"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#a759811568856b65f3f7995ec9586b4b4">impala::HashTable::Bucket::filled</a></div><div class="ttdeci">bool filled</div><div class="ttdoc">Whether this bucket contains a vaild entry, or it is empty. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00305">hash-table.h:305</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a4247ec5fb9eed4bbeb44d616a5160073"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a4247ec5fb9eed4bbeb44d616a5160073">impala::HashTable::Iterator::table_</a></div><div class="ttdeci">HashTable * table_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00505">hash-table.h:505</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_aea176ae316a2d2e6a6ec1210c0ba7373"><div class="ttname"><a href="classimpala_1_1HashTable.html#aea176ae316a2d2e6a6ec1210c0ba7373">impala::HashTable::stores_tuples_</a></div><div class="ttdeci">const bool stores_tuples_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00602">hash-table.h:602</a></div></div> |
| <div class="ttc" id="unionimpala_1_1HashTable_1_1HtData_html_ae540a5f4e0b9f80e3f9057678328e0f7"><div class="ttname"><a href="unionimpala_1_1HashTable_1_1HtData.html#ae540a5f4e0b9f80e3f9057678328e0f7">impala::HashTable::HtData::idx</a></div><div class="ttdeci">BufferedTupleStream::RowIdx idx</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00286">hash-table.h:286</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_a28c4ed7933d299131d303592d92a7d7e"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#a28c4ed7933d299131d303592d92a7d7e">impala::HashTable::Bucket::htdata</a></div><div class="ttdeci">HtData htdata</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00323">hash-table.h:323</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a09b460586ab67d86997ffb537f588cc9"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a09b460586ab67d86997ffb537f588cc9">impala::HashTable::Iterator::Next</a></div><div class="ttdeci">void IR_ALWAYS_INLINE Next()</div><div class="ttdoc">Iterates to the next element. It should be called only if !AtEnd(). </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00283">hash-table.inline.h:283</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_af38386ab7a6b3c03823ee9163e14aa57"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#af38386ab7a6b3c03823ee9163e14aa57">impala::HashTable::Bucket::hasDuplicates</a></div><div class="ttdeci">bool hasDuplicates</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00315">hash-table.h:315</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_aba3b5b944609bf0d2debbfaffb8ed767"><div class="ttname"><a href="classimpala_1_1HashTable.html#aba3b5b944609bf0d2debbfaffb8ed767">impala::HashTable::GetRow</a></div><div class="ttdeci">TupleRow * GetRow(HtData &htdata, TupleRow *row) const </div><div class="ttdoc">Return the TupleRow pointed by 'htdata'. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00210">hash-table.inline.h:210</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ad5cafb9172df65844a941a43a0e80b3e"><div class="ttname"><a href="classimpala_1_1HashTable.html#ad5cafb9172df65844a941a43a0e80b3e">impala::HashTable::num_probes_</a></div><div class="ttdeci">int64_t num_probes_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00650">hash-table.h:650</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a92d8c35c802147adf40685e7c1bdcca7"><div class="ttname"><a href="classimpala_1_1HashTable.html#a92d8c35c802147adf40685e7c1bdcca7">impala::HashTable::num_buckets_with_duplicates_</a></div><div class="ttdeci">int64_t num_buckets_with_duplicates_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00636">hash-table.h:636</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a4664c5c1d82ab068f7005a2c830910e4"><div class="ttname"><a href="classimpala_1_1HashTable.html#a4664c5c1d82ab068f7005a2c830910e4">impala::HashTable::InsertDuplicateNode</a></div><div class="ttdeci">DuplicateNode *IR_ALWAYS_INLINE InsertDuplicateNode(int64_t bucket_idx)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00183">hash-table.inline.h:183</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ae21db224cca645cb112fc27d323e9048"><div class="ttname"><a href="classimpala_1_1HashTable.html#ae21db224cca645cb112fc27d323e9048">impala::HashTable::num_hash_collisions_</a></div><div class="ttdeci">int64_t num_hash_collisions_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00661">hash-table.h:661</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a4222254505940c65b0b817c4836a1021"><div class="ttname"><a href="classimpala_1_1HashTable.html#a4222254505940c65b0b817c4836a1021">impala::HashTable::PrepareBucketForInsert</a></div><div class="ttdeci">void IR_ALWAYS_INLINE PrepareBucketForInsert(int64_t bucket_idx, uint32_t hash)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00163">hash-table.inline.h:163</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_acc898ddea6c8c1d54f21fea4af1bcf7b"><div class="ttname"><a href="classimpala_1_1HashTable.html#acc898ddea6c8c1d54f21fea4af1bcf7b">impala::HashTable::num_buckets_</a></div><div class="ttdeci">int64_t num_buckets_</div><div class="ttdoc">Total number of buckets (filled and empty). </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00629">hash-table.h:629</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ae1cda955b2701205694fdf8407f90138"><div class="ttname"><a href="classimpala_1_1HashTable.html#ae1cda955b2701205694fdf8407f90138">impala::HashTable::node_remaining_current_page_</a></div><div class="ttdeci">int node_remaining_current_page_</div><div class="ttdoc">Number of nodes left in the current page. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00617">hash-table.h:617</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a7f2a20c37756a44feeae7cd335f2746f"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a7f2a20c37756a44feeae7cd335f2746f">impala::HashTableCtx::HashCurrentRow</a></div><div class="ttdeci">uint32_t IR_NO_INLINE HashCurrentRow()</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00177">hash-table.h:177</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ac03658dce51b9f2582daebec0646e80a"><div class="ttname"><a href="classimpala_1_1HashTable.html#ac03658dce51b9f2582daebec0646e80a">impala::HashTable::FirstUnmatched</a></div><div class="ttdeci">Iterator FirstUnmatched(HashTableCtx *ctx)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00135">hash-table.inline.h:135</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1Bucket_html_a651a400ca63963e409447f5214c554b6"><div class="ttname"><a href="structimpala_1_1HashTable_1_1Bucket.html#a651a400ca63963e409447f5214c554b6">impala::HashTable::Bucket::hash</a></div><div class="ttdeci">uint32_t hash</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00319">hash-table.h:319</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a9830fc407400559db7e7783cc10a9394"><div class="ttname"><a href="classimpala_1_1HashTable.html#a9830fc407400559db7e7783cc10a9394">impala::HashTable::Iterator</a></div><div class="ttdeci">friend class Iterator</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00517">hash-table.h:517</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_aec787cbcc1d6aa4d8e90f2fc52d12c50"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#aec787cbcc1d6aa4d8e90f2fc52d12c50">impala::HashTableCtx::row_</a></div><div class="ttdeci">TupleRow * row_</div><div class="ttdoc">Scratch buffer to generate rows on the fly. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00266">hash-table.h:266</a></div></div> |
| <div class="ttc" id="compiler-util_8h_html_a9acc330d508b9a3b775cfdf7ce405e7d"><div class="ttname"><a href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a></div><div class="ttdeci">#define UNLIKELY(expr)</div><div class="ttdef"><b>Definition:</b> <a href="compiler-util_8h_source.html#l00033">compiler-util.h:33</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ac7049a35b4d1716e54bb46d9c3ed890d"><div class="ttname"><a href="classimpala_1_1HashTable.html#ac7049a35b4d1716e54bb46d9c3ed890d">impala::HashTable::next_node_</a></div><div class="ttdeci">DuplicateNode * next_node_</div><div class="ttdoc">Next duplicate node to insert. Vaild when node_remaining_current_page_ > 0. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00614">hash-table.h:614</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a35dd000b13acadd90b975609b8e39e55"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a35dd000b13acadd90b975609b8e39e55">impala::HashTableCtx::EvalProbeRow</a></div><div class="ttdeci">bool IR_NO_INLINE EvalProbeRow(TupleRow *row)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00209">hash-table.h:209</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ac128e2d41168cc9e08b40c34e1a29bc3"><div class="ttname"><a href="classimpala_1_1HashTable.html#ac128e2d41168cc9e08b40c34e1a29bc3">impala::HashTable::Find</a></div><div class="ttdeci">Iterator IR_ALWAYS_INLINE Find(HashTableCtx *ht_ctx, uint32_t hash)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00117">hash-table.inline.h:117</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a37a23fb4e24cc776ffdef905f8fd76a4"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a37a23fb4e24cc776ffdef905f8fd76a4">impala::HashTableCtx::finds_nulls_</a></div><div class="ttdeci">const bool finds_nulls_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00235">hash-table.h:235</a></div></div> |
| <div class="ttc" id="compiler-util_8h_html_a262afcfe437f4addb13fb1b47a6a7086"><div class="ttname"><a href="compiler-util_8h.html#a262afcfe437f4addb13fb1b47a6a7086">LIKELY</a></div><div class="ttdeci">#define LIKELY(expr)</div><div class="ttdef"><b>Definition:</b> <a href="compiler-util_8h_source.html#l00032">compiler-util.h:32</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a67951a6c7296d85edb7a08b5fe143352"><div class="ttname"><a href="classimpala_1_1HashTable.html#a67951a6c7296d85edb7a08b5fe143352">impala::HashTable::NextFilledBucket</a></div><div class="ttdeci">void NextFilledBucket(int64_t *bucket_idx, DuplicateNode **node)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00150">hash-table.inline.h:150</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a0c1d67cc8cebd5cd2fb855fa5d0a4a57"><div class="ttname"><a href="classimpala_1_1HashTable.html#a0c1d67cc8cebd5cd2fb855fa5d0a4a57">impala::HashTable::Probe</a></div><div class="ttdeci">int64_t IR_ALWAYS_INLINE Probe(Bucket *buckets, int64_t num_buckets, HashTableCtx *ht_ctx, uint32_t hash, bool *found)</div><div class="ttdoc">There are wrappers of this function that perform the Find and Insert logic. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00037">hash-table.inline.h:37</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a53e8f6764f9f739c3a2f478c5c5e7d4c"><div class="ttname"><a href="classimpala_1_1HashTable.html#a53e8f6764f9f739c3a2f478c5c5e7d4c">impala::HashTable::tuple_stream_</a></div><div class="ttdeci">BufferedTupleStream * tuple_stream_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00593">hash-table.h:593</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1DuplicateNode_html_ac7abbf3c029016c52411a3c4adc284bd"><div class="ttname"><a href="structimpala_1_1HashTable_1_1DuplicateNode.html#ac7abbf3c029016c52411a3c4adc284bd">impala::HashTable::DuplicateNode::htdata</a></div><div class="ttdeci">HtData htdata</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00300">hash-table.h:300</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_aa1c1b818cb5c0004d01f6ad7487a3394"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#aa1c1b818cb5c0004d01f6ad7487a3394">impala::HashTableCtx::EvalAndHashBuild</a></div><div class="ttdeci">bool IR_ALWAYS_INLINE EvalAndHashBuild(TupleRow *row, uint32_t *hash)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00023">hash-table.inline.h:23</a></div></div> |
| <div class="ttc" id="namespacegen__ir__descriptions_html_a0d6572990c8dd576a55a21ff11d6deb7"><div class="ttname"><a href="namespacegen__ir__descriptions.html#a0d6572990c8dd576a55a21ff11d6deb7">gen_ir_descriptions.idx</a></div><div class="ttdeci">int idx</div><div class="ttdef"><b>Definition:</b> <a href="gen__ir__descriptions_8py_source.html#l00215">gen_ir_descriptions.py:215</a></div></div> |
| <div class="ttc" id="structimpala_1_1HashTable_1_1DuplicateNode_html_a61fe600bfa729712702e550a1d334133"><div class="ttname"><a href="structimpala_1_1HashTable_1_1DuplicateNode.html#a61fe600bfa729712702e550a1d334133">impala::HashTable::DuplicateNode::matched</a></div><div class="ttdeci">bool matched</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00297">hash-table.h:297</a></div></div> |
| <div class="ttc" id="structimpala_1_1BufferedTupleStream_1_1RowIdx_html"><div class="ttname"><a href="structimpala_1_1BufferedTupleStream_1_1RowIdx.html">impala::BufferedTupleStream::RowIdx</a></div><div class="ttdef"><b>Definition:</b> <a href="buffered-tuple-stream_8h_source.html#l00121">buffered-tuple-stream.h:121</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a298163e8c4896999e93d089f7184ce48"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a298163e8c4896999e93d089f7184ce48">impala::HashTable::Iterator::SetMatched</a></div><div class="ttdeci">void SetMatched()</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00256">hash-table.inline.h:256</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a34e6e9efbd7f665c6a870a11938ff031"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a34e6e9efbd7f665c6a870a11938ff031">impala::HashTable::Iterator::node_</a></div><div class="ttdeci">DuplicateNode * node_</div><div class="ttdoc">Pointer to the current duplicate node. </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00513">hash-table.h:513</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_1_1Iterator_html_a9ad9ccfb9528dc9ef7daa26125ec0bf4"><div class="ttname"><a href="classimpala_1_1HashTable_1_1Iterator.html#a9ad9ccfb9528dc9ef7daa26125ec0bf4">impala::HashTable::Iterator::GetRow</a></div><div class="ttdeci">TupleRow * GetRow() const </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00230">hash-table.inline.h:230</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a4710c7202b6716547326b7f1d2a6730b"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a4710c7202b6716547326b7f1d2a6730b">impala::HashTableCtx::EvalBuildRow</a></div><div class="ttdeci">bool IR_NO_INLINE EvalBuildRow(TupleRow *row)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00203">hash-table.h:203</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html">impala::HashTableCtx</a></div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00104">hash-table.h:104</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_a60e5c8ae0744eb588bfbb8ae98bbeaf0"><div class="ttname"><a href="classimpala_1_1HashTable.html#a60e5c8ae0744eb588bfbb8ae98bbeaf0">impala::HashTable::Insert</a></div><div class="ttdeci">bool IR_ALWAYS_INLINE Insert(HashTableCtx *ht_ctx, const BufferedTupleStream::RowIdx &idx, TupleRow *row, uint32_t hash)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00094">hash-table.inline.h:94</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a1ad8788675d03050636efe015a75c426"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a1ad8788675d03050636efe015a75c426">impala::HashTableCtx::row</a></div><div class="ttdeci">TupleRow * row() const </div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00127">hash-table.h:127</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTableCtx_html_a5f92cb6aa106a9fb60fb42debfe14979"><div class="ttname"><a href="classimpala_1_1HashTableCtx.html#a5f92cb6aa106a9fb60fb42debfe14979">impala::HashTableCtx::EvalAndHashProbe</a></div><div class="ttdeci">bool IR_ALWAYS_INLINE EvalAndHashProbe(TupleRow *row, uint32_t *hash)</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8inline_8h_source.html#l00030">hash-table.inline.h:30</a></div></div> |
| <div class="ttc" id="classimpala_1_1BufferedTupleStream_html_a87909f60c4efe1aae47471ce668136ec"><div class="ttname"><a href="classimpala_1_1BufferedTupleStream.html#a87909f60c4efe1aae47471ce668136ec">impala::BufferedTupleStream::GetTupleRow</a></div><div class="ttdeci">void GetTupleRow(const RowIdx &idx, TupleRow *row) const </div><div class="ttdef"><b>Definition:</b> <a href="buffered-tuple-stream_8inline_8h_source.html#l00049">buffered-tuple-stream.inline.h:49</a></div></div> |
| <div class="ttc" id="classimpala_1_1HashTable_html_ac461c88f6a7b8f9b0fdfc1cd42344837"><div class="ttname"><a href="classimpala_1_1HashTable.html#ac461c88f6a7b8f9b0fdfc1cd42344837">impala::HashTable::buckets_</a></div><div class="ttdeci">Bucket * buckets_</div><div class="ttdef"><b>Definition:</b> <a href="hash-table_8h_source.html#l00626">hash-table.h:626</a></div></div> |
| </div><!-- fragment --></div><!-- contents --> |
| </div><!-- doc-content --> |
| <!-- start footer part --> |
| <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_e5d120be6b5e8a44336cbfd013b25604.html">be</a></li><li class="navelem"><a class="el" href="dir_68cf7cafb51a962d5bc4848b83cab0de.html">src</a></li><li class="navelem"><a class="el" href="dir_479336c0a15f2c0737bcafcf969f884c.html">exec</a></li><li class="navelem"><a class="el" href="hash-table_8inline_8h.html">hash-table.inline.h</a></li> |
| <li class="footer">Generated on Thu May 7 2015 16:10:35 for Impala by |
| <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li> |
| </ul> |
| </div> |
| </body> |
| </html> |
