334 lines
37 KiB
HTML
334 lines
37 KiB
HTML
<!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.5"/>
|
|
<title>Faiss: /data/users/matthijs/github_faiss/faiss/gpu/utils/MergeNetworkBlock.cuh 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="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">Faiss
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.5 -->
|
|
<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>
|
|
</ul>
|
|
</div>
|
|
<!-- 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>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Friends</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 id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_6b3ae6988449b0834e9596fad5d75199.html">gpu</a></li><li class="navelem"><a class="el" href="dir_498271007b03b2a0521055e88776887b.html">utils</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">MergeNetworkBlock.cuh</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/**</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 2015-present, Facebook, Inc.</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * All rights reserved.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * This source code is licensed under the BSD+Patents license found in the</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#pragma once</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor"></span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include "DeviceDefs.cuh"</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include "MergeNetworkUtils.cuh"</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include "PtxUtils.cuh"</span></div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "StaticUtils.h"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include "WarpShuffles.cuh"</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include "../../FaissAssert.h"</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cuda.h></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="keyword">namespace </span>faiss { <span class="keyword">namespace </span>gpu {</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="comment">// Merge pairs of lists smaller than blockDim.x (NumThreads)</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> NumThreads,</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keyword">typename</span> K,</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keyword">typename</span> V,</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keywordtype">int</span> L,</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keywordtype">bool</span> Dir,</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">typename</span> Comp,</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordtype">bool</span> FullMerge></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">inline</span> __device__ <span class="keywordtype">void</span> blockMergeSmall(K* listK, V* listV) {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  static_assert(utils::isPowerOf2(L), <span class="stringliteral">"L must be a power-of-2"</span>);</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  static_assert(utils::isPowerOf2(NumThreads),</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="stringliteral">"NumThreads must be a power-of-2"</span>);</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  static_assert(L <= NumThreads, <span class="stringliteral">"merge list size must be <= NumThreads"</span>);</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// Which pair of lists we are merging</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">int</span> mergeId = threadIdx.x / L;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// Which thread we are within the merge</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordtype">int</span> tid = threadIdx.x % L;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// listK points to a region of size N * 2 * L</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  listK += 2 * L * mergeId;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  listV += 2 * L * mergeId;</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// It's not a bitonic merge, both lists are in the same direction,</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// so handle the first swap assuming the second list is reversed</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordtype">int</span> pos = L - 1 - tid;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordtype">int</span> stride = 2 * tid + 1;</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  K& ka = listK[pos];</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  K& kb = listK[pos + stride];</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordtype">bool</span> s = Dir ? Comp::gt(ka, kb) : Comp::lt(ka, kb);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  swap(s, ka, kb);</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>  V& va = listV[pos];</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  V& vb = listV[pos + stride];</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  swap(s, va, vb);</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>  __syncthreads();</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#pragma unroll</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> stride = L / 2; stride > 0; stride /= 2) {</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">int</span> pos = 2 * tid - (tid & (stride - 1));</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  K& ka = listK[pos];</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  K& kb = listK[pos + stride];</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordtype">bool</span> s = Dir ? Comp::gt(ka, kb) : Comp::lt(ka, kb);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  swap(s, ka, kb);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  V& va = listV[pos];</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  V& vb = listV[pos + stride];</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  swap(s, va, vb);</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>  __syncthreads();</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> }</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// Merge pairs of sorted lists larger than blockDim.x (NumThreads)</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> NumThreads,</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">typename</span> K,</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">typename</span> V,</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">int</span> L,</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">bool</span> Dir,</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typename</span> Comp,</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">bool</span> FullMerge></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="keyword">inline</span> __device__ <span class="keywordtype">void</span> blockMergeLarge(K* listK, V* listV) {</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  static_assert(utils::isPowerOf2(L), <span class="stringliteral">"L must be a power-of-2"</span>);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  static_assert(L >= kWarpSize, <span class="stringliteral">"merge list size must be >= 32"</span>);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  static_assert(utils::isPowerOf2(NumThreads),</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="stringliteral">"NumThreads must be a power-of-2"</span>);</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  static_assert(L >= NumThreads, <span class="stringliteral">"merge list size must be >= NumThreads"</span>);</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// For L > NumThreads, each thread has to perform more work</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// per each stride.</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  constexpr <span class="keywordtype">int</span> kLoopPerThread = L / NumThreads;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// It's not a bitonic merge, both lists are in the same direction,</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// so handle the first swap assuming the second list is reversed</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor">#pragma unroll</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> loop = 0; loop < kLoopPerThread; ++loop) {</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordtype">int</span> tid = loop * NumThreads + threadIdx.x;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">int</span> pos = L - 1 - tid;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">int</span> stride = 2 * tid + 1;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  K& ka = listK[pos];</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  K& kb = listK[pos + stride];</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">bool</span> s = Dir ? Comp::gt(ka, kb) : Comp::lt(ka, kb);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  swap(s, ka, kb);</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  V& va = listV[pos];</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  V& vb = listV[pos + stride];</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  swap(s, va, vb);</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  __syncthreads();</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  constexpr <span class="keywordtype">int</span> kSecondLoopPerThread =</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  FullMerge ? kLoopPerThread : kLoopPerThread / 2;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#pragma unroll</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> stride = L / 2; stride > 0; stride /= 2) {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor">#pragma unroll</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> loop = 0; loop < kSecondLoopPerThread; ++loop) {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">int</span> tid = loop * NumThreads + threadIdx.x;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">int</span> pos = 2 * tid - (tid & (stride - 1));</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  K& ka = listK[pos];</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  K& kb = listK[pos + stride];</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordtype">bool</span> s = Dir ? Comp::gt(ka, kb) : Comp::lt(ka, kb);</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  swap(s, ka, kb);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  V& va = listV[pos];</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  V& vb = listV[pos + stride];</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  swap(s, va, vb);</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  __syncthreads();</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> }</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">/// Class template to prevent static_assert from firing for</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">/// mixing smaller/larger than block cases</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"></span><span class="keyword">template</span> <<span class="keywordtype">int</span> NumThreads,</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">typename</span> K,</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">typename</span> V,</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">int</span> N,</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">int</span> L,</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordtype">bool</span> Dir,</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">typename</span> Comp,</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordtype">bool</span> SmallerThanBlock,</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">bool</span> FullMerge></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="structfaiss_1_1gpu_1_1BlockMerge.html"> 156</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1gpu_1_1BlockMerge.html">BlockMerge</a> {</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"></span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">/// Merging lists smaller than a block</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"></span><span class="keyword">template</span> <<span class="keywordtype">int</span> NumThreads,</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">typename</span> K,</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">typename</span> V,</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordtype">int</span> N,</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">int</span> L,</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordtype">bool</span> Dir,</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">typename</span> Comp,</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordtype">bool</span> FullMerge></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="structfaiss_1_1gpu_1_1BlockMerge_3_01NumThreads_00_01K_00_01V_00_01N_00_01L_00_01Dir_00_01Comp_00_01true_00_01FullMerge_01_4.html"> 168</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1gpu_1_1BlockMerge.html">BlockMerge</a><NumThreads, K, V, N, L, Dir, Comp, true, FullMerge> {</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">static</span> <span class="keyword">inline</span> __device__ <span class="keywordtype">void</span> merge(K* listK, V* listV) {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  constexpr <span class="keywordtype">int</span> kNumParallelMerges = NumThreads / L;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  constexpr <span class="keywordtype">int</span> kNumIterations = N / kNumParallelMerges;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  static_assert(L <= NumThreads, <span class="stringliteral">"list must be <= NumThreads"</span>);</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  static_assert((N < kNumParallelMerges) ||</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  (kNumIterations * kNumParallelMerges == N),</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="stringliteral">"improper selection of N and L"</span>);</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">if</span> (N < kNumParallelMerges) {</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// We only need L threads per each list to perform the merge</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (threadIdx.x < N * L) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  blockMergeSmall<NumThreads, K, V, L, Dir, Comp, FullMerge>(</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  listK, listV);</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// All threads participate</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="preprocessor">#pragma unroll</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < kNumIterations; ++i) {</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">int</span> start = i * kNumParallelMerges * 2 * L;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  blockMergeSmall<NumThreads, K, V, L, Dir, Comp, FullMerge>(</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  listK + start, listV + start);</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>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span> };</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"></span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment">/// Merging lists larger than a block</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"></span><span class="keyword">template</span> <<span class="keywordtype">int</span> NumThreads,</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">typename</span> K,</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">typename</span> V,</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">int</span> N,</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordtype">int</span> L,</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">bool</span> Dir,</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">typename</span> Comp,</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordtype">bool</span> FullMerge></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="structfaiss_1_1gpu_1_1BlockMerge_3_01NumThreads_00_01K_00_01V_00_01N_00_01L_00_01Dir_00_01Comp_00_01false_00_01FullMerge_01_4.html"> 206</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1gpu_1_1BlockMerge.html">BlockMerge</a><NumThreads, K, V, N, L, Dir, Comp, false, FullMerge> {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">static</span> <span class="keyword">inline</span> __device__ <span class="keywordtype">void</span> merge(K* listK, V* listV) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// Each pair of lists is merged sequentially</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor">#pragma unroll</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordtype">int</span> start = i * 2 * L;</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  blockMergeLarge<NumThreads, K, V, L, Dir, Comp, FullMerge>(</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  listK + start, listV + start);</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</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"> 219</span> <span class="keyword">template</span> <<span class="keywordtype">int</span> NumThreads,</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keyword">typename</span> K,</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">typename</span> V,</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordtype">int</span> N,</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">int</span> L,</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">bool</span> Dir,</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">typename</span> Comp,</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordtype">bool</span> FullMerge = <span class="keyword">true</span>></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="keyword">inline</span> __device__ <span class="keywordtype">void</span> blockMerge(K* listK, V* listV) {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  constexpr <span class="keywordtype">bool</span> kSmallerThanBlock = (L <= NumThreads);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="structfaiss_1_1gpu_1_1BlockMerge.html">BlockMerge<NumThreads, K, V, N, L, Dir, Comp, kSmallerThanBlock, FullMerge>::</a></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <a class="code" href="structfaiss_1_1gpu_1_1BlockMerge.html"> merge</a>(listK, listV);</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> } } <span class="comment">// namespace</span></div>
|
|
<div class="ttc" id="structfaiss_1_1gpu_1_1BlockMerge_html"><div class="ttname"><a href="structfaiss_1_1gpu_1_1BlockMerge.html">faiss::gpu::BlockMerge</a></div><div class="ttdef"><b>Definition:</b> <a href="MergeNetworkBlock_8cuh_source.html#l00156">MergeNetworkBlock.cuh:156</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.5
|
|
</small></address>
|
|
</body>
|
|
</html>
|