784 lines
99 KiB
HTML
784 lines
99 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/hoss/faiss/OnDiskInvertedLists.cpp 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>
|
|
</div><!-- top -->
|
|
<!-- 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 class="header">
|
|
<div class="headertitle">
|
|
<div class="title">/data/users/hoss/faiss/OnDiskInvertedLists.cpp</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) Facebook, Inc. and its affiliates.</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> *</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * This source code is licensed under the MIT license found in the</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * LICENSE file in the root directory of this source tree.</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> </div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// -*- c++ -*-</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "OnDiskInvertedLists.h"</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <pthread.h></span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <unordered_set></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">#include <sys/mman.h></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <unistd.h></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <sys/types.h></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "FaissAssert.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "utils.h"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>faiss {</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">/**********************************************</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * LockLevels</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> **********************************************/</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="structfaiss_1_1LockLevels.html"> 32</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1LockLevels.html">LockLevels</a> {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">/* There n times lock1(n), one lock2 and one lock3</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * Invariants:</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * a single thread can hold one lock1(n) for some n</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * a single thread can hold lock2, if it holds lock1(n) for some n</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * a single thread can hold lock3, if it holds lock1(n) for some n</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * AND lock2 AND no other thread holds lock1(m) for m != n</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> */</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  pthread_mutex_t mutex1;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  pthread_cond_t level1_cv;</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  pthread_cond_t level2_cv;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  pthread_cond_t level3_cv;</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>  std::unordered_set<int> level1_holders; <span class="comment">// which level1 locks are held</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">int</span> n_level2; <span class="comment">// nb threads that wait on level2</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordtype">bool</span> level3_in_use; <span class="comment">// a threads waits on level3</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordtype">bool</span> level2_in_use;</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>  <a class="code" href="structfaiss_1_1LockLevels.html">LockLevels</a>() {</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  pthread_mutex_init(&mutex1, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  pthread_cond_init(&level1_cv, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  pthread_cond_init(&level2_cv, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  pthread_cond_init(&level3_cv, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  n_level2 = 0;</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  level2_in_use = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  level3_in_use = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</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>  ~<a class="code" href="structfaiss_1_1LockLevels.html">LockLevels</a>() {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  pthread_cond_destroy(&level1_cv);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  pthread_cond_destroy(&level2_cv);</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  pthread_cond_destroy(&level3_cv);</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  pthread_mutex_destroy(&mutex1);</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> </div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">void</span> lock_1(<span class="keywordtype">int</span> no) {</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  pthread_mutex_lock(&mutex1);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">while</span> (level3_in_use || level1_holders.count(no) > 0) {</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  pthread_cond_wait(&level1_cv, &mutex1);</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>  level1_holders.insert(no);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  pthread_mutex_unlock(&mutex1);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</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>  <span class="keywordtype">void</span> unlock_1(<span class="keywordtype">int</span> no) {</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  pthread_mutex_lock(&mutex1);</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  assert(level1_holders.count(no) == 1);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  level1_holders.erase(no);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (level3_in_use) { <span class="comment">// a writer is waiting</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  pthread_cond_signal(&level3_cv);</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  pthread_cond_broadcast(&level1_cv);</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  pthread_mutex_unlock(&mutex1);</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordtype">void</span> lock_2() {</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  pthread_mutex_lock(&mutex1);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  n_level2 ++;</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (level3_in_use) { <span class="comment">// tell waiting level3 that we are blocked</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  pthread_cond_signal(&level3_cv);</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">while</span> (level2_in_use) {</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  pthread_cond_wait(&level2_cv, &mutex1);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  level2_in_use = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  pthread_mutex_unlock(&mutex1);</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">void</span> unlock_2() {</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  pthread_mutex_lock(&mutex1);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  level2_in_use = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  n_level2 --;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  pthread_cond_signal(&level2_cv);</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  pthread_mutex_unlock(&mutex1);</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordtype">void</span> lock_3() {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  pthread_mutex_lock(&mutex1);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  level3_in_use = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// wait until there are no level1 holders anymore except the</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// ones that are waiting on level2 (we are holding lock2)</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">while</span> (level1_holders.size() > n_level2) {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  pthread_cond_wait(&level3_cv, &mutex1);</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>  <span class="comment">// don't release the lock!</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</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>  <span class="keywordtype">void</span> unlock_3() {</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  level3_in_use = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// wake up all level1_holders</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  pthread_cond_broadcast(&level1_cv);</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  pthread_mutex_unlock(&mutex1);</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</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>  <span class="keywordtype">void</span> print () {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  pthread_mutex_lock(&mutex1);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  printf(<span class="stringliteral">"State: level3_in_use=%d n_level2=%d level1_holders: ["</span>, level3_in_use, n_level2);</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k : level1_holders) {</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  printf(<span class="stringliteral">"%d "</span>, k);</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>  printf(<span class="stringliteral">"]\n"</span>);</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  pthread_mutex_unlock(&mutex1);</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> </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> };</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">/**********************************************</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> * OngoingPrefetch</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> **********************************************/</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html"> 143</a></span> <span class="keyword">struct </span><a class="code" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html">OnDiskInvertedLists::OngoingPrefetch</a> {</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch_1_1Thread.html"> 145</a></span>  <span class="keyword">struct </span><a class="code" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch_1_1Thread.html">Thread</a> {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  pthread_t pth;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <a class="code" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html">OngoingPrefetch</a> *pf;</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>  <span class="keywordtype">bool</span> one_list () {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  idx_t list_no = pf->get_next_list();</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span>(list_no == -1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html">OnDiskInvertedLists</a> *od = pf->od;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  od->locks->lock_1 (list_no);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordtype">size_t</span> n = od-><a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a19b264dfe5a541c1427d3b635ad887f5">list_size</a> (list_no);</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> *idx = od-><a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#ae54e7c6abc10c3d59ea3cd1113466957">get_ids</a> (list_no);</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> uint8_t *codes = od-><a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a1695e1d8d64a00e8e5f57ebf2210cb87">get_codes</a> (list_no);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordtype">int</span> cs = 0;</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n;i++) {</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  cs += idx[i];</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">const</span> idx_t *codes8 = (<span class="keyword">const</span> idx_t*)codes;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  idx_t n8 = n * od-><a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a> / 8;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < n8;i++) {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  cs += codes8[i];</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  od->locks->unlock_1(list_no);</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  global_cs += cs & 1;</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</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>  };</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  std::vector<Thread> threads;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  pthread_mutex_t list_ids_mutex;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  std::vector<idx_t> list_ids;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">int</span> cur_list;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// mutex for the list of tasks</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  pthread_mutex_t mutex;</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="comment">// pretext to avoid code below to be optimized out</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">static</span> <span class="keywordtype">int</span> global_cs;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html">OnDiskInvertedLists</a> *od;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">explicit</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html">OngoingPrefetch</a> (<span class="keyword">const</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html">OnDiskInvertedLists</a> *od): od (od)</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  pthread_mutex_init (&mutex, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  pthread_mutex_init (&list_ids_mutex, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  cur_list = 0;</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="keyword">static</span> <span class="keywordtype">void</span>* prefetch_list (<span class="keywordtype">void</span> * arg) {</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  Thread *th = <span class="keyword">static_cast<</span>Thread*<span class="keyword">></span>(arg);</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">while</span> (th->one_list()) ;</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</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>  idx_t get_next_list () {</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  idx_t list_no = -1;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  pthread_mutex_lock (&list_ids_mutex);</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">if</span> (cur_list >= 0 && cur_list < list_ids.size()) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  list_no = list_ids[cur_list++];</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  pthread_mutex_unlock (&list_ids_mutex);</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">return</span> list_no;</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> </div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">void</span> prefetch_lists (<span class="keyword">const</span> idx_t *list_nos, <span class="keywordtype">int</span> n) {</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  pthread_mutex_lock (&mutex);</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  pthread_mutex_lock (&list_ids_mutex);</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  list_ids.clear ();</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  pthread_mutex_unlock (&list_ids_mutex);</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &th: threads) {</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  pthread_join (th.pth, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  threads.resize (0);</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  cur_list = 0;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordtype">int</span> nt = std::min (n, od->prefetch_nthread);</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">if</span> (nt > 0) {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// prepare tasks</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  idx_t list_no = list_nos[i];</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span> (list_no >= 0 && od-><a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a19b264dfe5a541c1427d3b635ad887f5">list_size</a>(list_no) > 0) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  list_ids.push_back (list_no);</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>  }</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// prepare threads</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  threads.resize (nt);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">for</span> (Thread &th: threads) {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  th.pf = <span class="keyword">this</span>;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  pthread_create (&th.pth, <span class="keyword">nullptr</span>, prefetch_list, &th);</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>  pthread_mutex_unlock (&mutex);</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  ~OngoingPrefetch () {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  pthread_mutex_lock (&mutex);</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &th: threads) {</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  pthread_join (th.pth, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  pthread_mutex_unlock (&mutex);</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  pthread_mutex_destroy (&mutex);</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  pthread_mutex_destroy (&list_ids_mutex);</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"> 256</span> </div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="keywordtype">int</span> OnDiskInvertedLists::OngoingPrefetch::global_cs = 0;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists.html#a04ad61e3a23ced0aea032bf1e699436d"> 260</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a04ad61e3a23ced0aea032bf1e699436d">OnDiskInvertedLists::prefetch_lists</a> (<span class="keyword">const</span> idx_t *list_nos, <span class="keywordtype">int</span> n)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  pf->prefetch_lists (list_nos, n);</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> </div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> </div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment">/**********************************************</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> * OnDiskInvertedLists: mmapping</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> **********************************************/</span></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> </div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="keywordtype">void</span> OnDiskInvertedLists::do_mmap ()</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> {</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">const</span> <span class="keywordtype">char</span> *rw_flags = read_only ? <span class="stringliteral">"r"</span> : <span class="stringliteral">"r+"</span>;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordtype">int</span> prot = read_only ? PROT_READ : PROT_WRITE | PROT_READ;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  FILE *f = fopen (filename.c_str(), rw_flags);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  FAISS_THROW_IF_NOT_FMT (f, <span class="stringliteral">"could not open %s in mode %s: %s"</span>,</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  filename.c_str(), rw_flags, strerror(errno));</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  uint8_t * ptro = (uint8_t*)mmap (<span class="keyword">nullptr</span>, totsize,</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  prot, MAP_SHARED, fileno (f), 0);</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  FAISS_THROW_IF_NOT_FMT (ptro != MAP_FAILED,</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="stringliteral">"could not mmap %s: %s"</span>,</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  filename.c_str(),</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  strerror(errno));</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  ptr = ptro;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  fclose (f);</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"> 292</span> <span class="keywordtype">void</span> OnDiskInvertedLists::update_totsize (<span class="keywordtype">size_t</span> new_size)</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> {</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> </div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// unmap file</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordtype">int</span> err = munmap (ptr, totsize);</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  FAISS_THROW_IF_NOT_FMT (err == 0, <span class="stringliteral">"munmap error: %s"</span>,</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  strerror(errno));</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>  <span class="keywordflow">if</span> (totsize == 0) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// must create file before truncating it</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  FILE *f = fopen (filename.c_str(), <span class="stringliteral">"w"</span>);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  FAISS_THROW_IF_NOT_FMT (f, <span class="stringliteral">"could not open %s in mode W: %s"</span>,</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  filename.c_str(), strerror(errno));</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  fclose (f);</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">if</span> (new_size > totsize) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (!slots.empty() &&</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  slots.back().offset + slots.back().capacity == totsize) {</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  slots.back().capacity += new_size - totsize;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  slots.push_back (Slot(totsize, new_size - totsize));</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  assert(!<span class="stringliteral">"not implemented"</span>);</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> </div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  totsize = new_size;</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// create file</span></div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  printf (<span class="stringliteral">"resizing %s to %ld bytes\n"</span>, filename.c_str(), totsize);</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>  <span class="keywordtype">int</span> err = truncate (filename.c_str(), totsize);</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>  FAISS_THROW_IF_NOT_FMT (err == 0, <span class="stringliteral">"truncate %s to %ld: %s"</span>,</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  filename.c_str(), totsize,</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  strerror(errno));</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  do_mmap ();</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> </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> </div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment">/**********************************************</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment"> * OnDiskInvertedLists</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"> **********************************************/</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="preprocessor">#define INVALID_OFFSET (size_t)(-1)</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="preprocessor"></span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span> OnDiskInvertedLists::List::List ():</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  size (0), capacity (0), offset (INVALID_OFFSET)</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> {}</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> OnDiskInvertedLists::Slot::Slot (<span class="keywordtype">size_t</span> offset, <span class="keywordtype">size_t</span> capacity):</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  offset (offset), capacity (capacity)</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> {}</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> OnDiskInvertedLists::Slot::Slot ():</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  offset (0), capacity (0)</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> {}</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists.html#acce006c1c63aee12d45c7f7dbeb8bb23"> 358</a></span> OnDiskInvertedLists::OnDiskInvertedLists (</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordtype">size_t</span> nlist, <span class="keywordtype">size_t</span> code_size,</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">const</span> <span class="keywordtype">char</span> *filename):</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="structfaiss_1_1InvertedLists.html">InvertedLists</a> (nlist, code_size),</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  filename (filename),</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  totsize (0),</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  ptr (nullptr),</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  read_only (false),</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  locks (new <a class="code" href="structfaiss_1_1LockLevels.html">LockLevels</a> ()),</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  pf (new <a class="code" href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html">OngoingPrefetch</a> (this)),</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  prefetch_nthread (32)</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> {</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  lists.resize (nlist);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="comment">// slots starts empty</span></div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> OnDiskInvertedLists::OnDiskInvertedLists ():</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html">OnDiskInvertedLists</a> (0, 0, <span class="stringliteral">""</span>)</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> {</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> </div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> OnDiskInvertedLists::~OnDiskInvertedLists ()</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">delete</span> pf;</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// unmap all lists</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">int</span> err = munmap (ptr, totsize);</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (err != 0) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  fprintf(stderr, <span class="stringliteral">"mumap error: %s"</span>,</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  strerror(errno));</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keyword">delete</span> locks;</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span> }</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists.html#a19b264dfe5a541c1427d3b635ad887f5"> 398</a></span> <span class="keywordtype">size_t</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a19b264dfe5a541c1427d3b635ad887f5">OnDiskInvertedLists::list_size</a>(<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> lists[list_no].size;</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> }</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> </div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists.html#a1695e1d8d64a00e8e5f57ebf2210cb87"> 404</a></span> <span class="keyword">const</span> uint8_t * <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a1695e1d8d64a00e8e5f57ebf2210cb87">OnDiskInvertedLists::get_codes</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (lists[list_no].offset == INVALID_OFFSET) {</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">return</span> ptr + lists[list_no].offset;</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists.html#ae54e7c6abc10c3d59ea3cd1113466957"> 413</a></span> <span class="keyword">const</span> <a class="code" href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">Index::idx_t</a> * <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#ae54e7c6abc10c3d59ea3cd1113466957">OnDiskInvertedLists::get_ids</a> (<span class="keywordtype">size_t</span> list_no)<span class="keyword"> const</span></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="keyword"></span>{</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">if</span> (lists[list_no].offset == INVALID_OFFSET) {</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> (<span class="keyword">const</span> idx_t*)(ptr + lists[list_no].offset +</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a> * lists[list_no].capacity);</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> }</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keywordtype">void</span> OnDiskInvertedLists::update_entries (</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> offset, <span class="keywordtype">size_t</span> n_entry,</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">const</span> idx_t *ids_in, <span class="keyword">const</span> uint8_t *codes_in)</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> {</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  FAISS_THROW_IF_NOT (!read_only);</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">if</span> (n_entry == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keyword">const</span> List & l = lists[list_no];</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  assert (n_entry + offset <= l.size);</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  idx_t *ids = <span class="keyword">const_cast<</span>idx_t*<span class="keyword">></span>(<a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#ae54e7c6abc10c3d59ea3cd1113466957">get_ids</a> (list_no));</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  memcpy (ids + offset, ids_in, <span class="keyword">sizeof</span>(ids_in[0]) * n_entry);</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  uint8_t *codes = <span class="keyword">const_cast<</span>uint8_t*<span class="keyword">></span>(<a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a1695e1d8d64a00e8e5f57ebf2210cb87">get_codes</a> (list_no));</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  memcpy (codes + offset * <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>, codes_in, code_size * n_entry);</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> }</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="keywordtype">size_t</span> OnDiskInvertedLists::add_entries (</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> n_entry,</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">const</span> idx_t* ids, <span class="keyword">const</span> uint8_t *code)</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> {</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  FAISS_THROW_IF_NOT (!read_only);</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  locks->lock_1 (list_no);</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordtype">size_t</span> o = <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a19b264dfe5a541c1427d3b635ad887f5">list_size</a> (list_no);</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  resize_locked (list_no, n_entry + o);</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  update_entries (list_no, o, n_entry, ids, code);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  locks->unlock_1 (list_no);</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">return</span> o;</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> }</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="keywordtype">void</span> OnDiskInvertedLists::resize (<span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> new_size)</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> {</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  FAISS_THROW_IF_NOT (!read_only);</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  locks->lock_1 (list_no);</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  resize_locked (list_no, new_size);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  locks->unlock_1 (list_no);</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> </div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="keywordtype">void</span> OnDiskInvertedLists::resize_locked (<span class="keywordtype">size_t</span> list_no, <span class="keywordtype">size_t</span> new_size)</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span> {</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  List & l = lists[list_no];</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> </div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (new_size <= l.capacity &&</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  new_size > l.capacity / 2) {</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  l.size = new_size;</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  }</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// otherwise we release the current slot, and find a new one</span></div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  locks->lock_2 ();</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  free_slot (l.offset, l.capacity);</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  List new_l;</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">if</span> (new_size == 0) {</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  new_l = List();</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  new_l.size = new_size;</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  new_l.capacity = 1;</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">while</span> (new_l.capacity < new_size) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  new_l.capacity *= 2;</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  }</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  new_l.offset = allocate_slot (</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  new_l.capacity * (<span class="keyword">sizeof</span>(idx_t) + <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>));</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  }</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// copy common data</span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">if</span> (l.offset != new_l.offset) {</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordtype">size_t</span> n = std::min (new_size, l.size);</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">if</span> (n > 0) {</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  memcpy (ptr + new_l.offset, <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a1695e1d8d64a00e8e5f57ebf2210cb87">get_codes</a>(list_no), n * <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>);</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  memcpy (ptr + new_l.offset + new_l.capacity * <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>,</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#ae54e7c6abc10c3d59ea3cd1113466957">get_ids</a> (list_no), n * <span class="keyword">sizeof</span>(idx_t));</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  lists[list_no] = new_l;</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  locks->unlock_2 ();</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span> }</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="keywordtype">size_t</span> OnDiskInvertedLists::allocate_slot (<span class="keywordtype">size_t</span> capacity) {</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// should hold lock2</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">auto</span> it = slots.begin();</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">while</span> (it != slots.end() && it->capacity < capacity) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  it++;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (it == slots.end()) {</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="comment">// not enough capacity</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordtype">size_t</span> new_size = totsize == 0 ? 32 : totsize * 2;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">while</span> (new_size - totsize < capacity)</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  new_size *= 2;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  locks->lock_3 ();</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  update_totsize(new_size);</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  locks->unlock_3 ();</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  it = slots.begin();</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">while</span> (it != slots.end() && it->capacity < capacity) {</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  it++;</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  assert (it != slots.end());</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordtype">size_t</span> o = it->offset;</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">if</span> (it->capacity == capacity) {</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  slots.erase (it);</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// take from beginning of slot</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  it->capacity -= capacity;</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  it->offset += capacity;</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">return</span> o;</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> }</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> </div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="keywordtype">void</span> OnDiskInvertedLists::free_slot (<span class="keywordtype">size_t</span> offset, <span class="keywordtype">size_t</span> capacity) {</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> </div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// should hold lock2</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">if</span> (capacity == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span> </div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keyword">auto</span> it = slots.begin();</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">while</span> (it != slots.end() && it->offset <= offset) {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  it++;</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordtype">size_t</span> inf = 1UL << 60;</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordtype">size_t</span> end_prev = inf;</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">if</span> (it != slots.begin()) {</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">auto</span> prev = it;</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  prev--;</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  end_prev = prev->offset + prev->capacity;</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  }</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span> </div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordtype">size_t</span> begin_next = 1L << 60;</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (it != slots.end()) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  begin_next = it->offset;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> </div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  assert (end_prev == inf || offset >= end_prev);</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  assert (offset + capacity <= begin_next);</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> </div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (offset == end_prev) {</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">auto</span> prev = it;</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  prev--;</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">if</span> (offset + capacity == begin_next) {</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  prev->capacity += capacity + it->capacity;</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  slots.erase (it);</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  prev->capacity += capacity;</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">if</span> (offset + capacity == begin_next) {</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  it->offset -= capacity;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  it->capacity += capacity;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  slots.insert (it, Slot (offset, capacity));</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  }</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> </div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">// TODO shrink global storage if needed</span></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> }</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> </div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> </div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment">/*****************************************</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment"> * Compact form</span></div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment"> *****************************************/</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="keywordtype">size_t</span> OnDiskInvertedLists::merge_from (<span class="keyword">const</span> InvertedLists **ils, <span class="keywordtype">int</span> n_il,</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordtype">bool</span> verbose)</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span> {</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  FAISS_THROW_IF_NOT_MSG (totsize == 0, <span class="stringliteral">"works only on an empty InvertedLists"</span>);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  std::vector<size_t> sizes (<a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>);</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n_il; i++) {</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> InvertedLists *il = ils[i];</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  FAISS_THROW_IF_NOT (il->nlist == <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a> && il->code_size == <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>);</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; j++) {</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  sizes [j] += il->list_size(j);</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  }</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> </div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordtype">size_t</span> cums = 0;</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordtype">size_t</span> ntotal = 0;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; j++) {</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  ntotal += sizes[j];</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  lists[j].size = 0;</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  lists[j].capacity = sizes[j];</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  lists[j].offset = cums;</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  cums += lists[j].capacity * (<span class="keyword">sizeof</span>(idx_t) + <a class="code" href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">code_size</a>);</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  }</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  update_totsize (cums);</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> </div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordtype">size_t</span> nmerged = 0;</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordtype">double</span> t0 = <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>(), last_t = t0;</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="preprocessor">#pragma omp parallel for</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="preprocessor"></span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < <a class="code" href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">nlist</a>; j++) {</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  List & l = lists[j];</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n_il; i++) {</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keyword">const</span> InvertedLists *il = ils[i];</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordtype">size_t</span> n_entry = il->list_size(j);</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  l.size += n_entry;</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  update_entries (j, l.size - n_entry, n_entry,</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  ScopedIds(il, j).<span class="keyword">get</span>(),</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  ScopedCodes(il, j).<span class="keyword">get</span>());</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  }</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  assert (l.size == l.capacity);</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">if</span> (verbose) {</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="preprocessor">#pragma omp critical</span></div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="preprocessor"></span> {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  nmerged++;</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordtype">double</span> t1 = <a class="code" href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">getmillisecs</a>();</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">if</span> (t1 - last_t > 500) {</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  printf(<span class="stringliteral">"merged %ld lists in %.3f s\r"</span>,</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  nmerged, (t1 - t0) / 1000.0);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  fflush(stdout);</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  last_t = t1;</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  }</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  }</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  }</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">if</span>(verbose) {</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  printf(<span class="stringliteral">"\n"</span>);</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  }</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span> </div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> ntotal;</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> }</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span> </div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span> </div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"><a class="line" href="structfaiss_1_1OnDiskInvertedLists.html#a0dbb919e454c26aaa1b907bdf35d3b55"> 659</a></span> <span class="keywordtype">void</span> <a class="code" href="structfaiss_1_1OnDiskInvertedLists.html#a0dbb919e454c26aaa1b907bdf35d3b55">OnDiskInvertedLists::crop_invlists</a>(<span class="keywordtype">size_t</span> l0, <span class="keywordtype">size_t</span> l1)</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> {</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  FAISS_THROW_IF_NOT(0 <= l0 && l0 <= l1 && l1 <= nlist);</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> </div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  std::vector<List> new_lists (l1 - l0);</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  memcpy (new_lists.data(), &lists[l0], (l1 - l0) * <span class="keyword">sizeof</span>(<a class="code" href="structfaiss_1_1OnDiskInvertedLists_1_1List.html">List</a>));</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> </div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  lists.swap(new_lists);</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span> </div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  nlist = l1 - l0;</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span> }</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> </div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> </div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> } <span class="comment">// namespace faiss</span></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_html_a0dbb919e454c26aaa1b907bdf35d3b55"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists.html#a0dbb919e454c26aaa1b907bdf35d3b55">faiss::OnDiskInvertedLists::crop_invlists</a></div><div class="ttdeci">void crop_invlists(size_t l0, size_t l1)</div><div class="ttdoc">restrict the inverted lists to l0:l1 without touching the mmapped region </div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00659">OnDiskInvertedLists.cpp:659</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_html_ae54e7c6abc10c3d59ea3cd1113466957"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists.html#ae54e7c6abc10c3d59ea3cd1113466957">faiss::OnDiskInvertedLists::get_ids</a></div><div class="ttdeci">const idx_t * get_ids(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00413">OnDiskInvertedLists.cpp:413</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1LockLevels_html"><div class="ttname"><a href="structfaiss_1_1LockLevels.html">faiss::LockLevels</a></div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00032">OnDiskInvertedLists.cpp:32</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_html_a04ad61e3a23ced0aea032bf1e699436d"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists.html#a04ad61e3a23ced0aea032bf1e699436d">faiss::OnDiskInvertedLists::prefetch_lists</a></div><div class="ttdeci">void prefetch_lists(const idx_t *list_nos, int nlist) const override</div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00260">OnDiskInvertedLists.cpp:260</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html">faiss::InvertedLists</a></div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00031">InvertedLists.h:31</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch_html"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch.html">faiss::OnDiskInvertedLists::OngoingPrefetch</a></div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00143">OnDiskInvertedLists.cpp:143</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1Index_html_ad3f0d3071f987baabbdd3da4500c87ea"><div class="ttname"><a href="structfaiss_1_1Index.html#ad3f0d3071f987baabbdd3da4500c87ea">faiss::Index::idx_t</a></div><div class="ttdeci">long idx_t</div><div class="ttdoc">all indices are this type </div><div class="ttdef"><b>Definition:</b> <a href="Index_8h_source.html#l00062">Index.h:62</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_ae06049e4259edb47d443ef87bdedc744"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#ae06049e4259edb47d443ef87bdedc744">faiss::InvertedLists::code_size</a></div><div class="ttdeci">size_t code_size</div><div class="ttdoc">code size per vector in bytes </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00035">InvertedLists.h:35</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_html_a1695e1d8d64a00e8e5f57ebf2210cb87"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists.html#a1695e1d8d64a00e8e5f57ebf2210cb87">faiss::OnDiskInvertedLists::get_codes</a></div><div class="ttdeci">const uint8_t * get_codes(size_t list_no) const override</div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00404">OnDiskInvertedLists.cpp:404</a></div></div>
|
|
<div class="ttc" id="namespacefaiss_html_af2a71f7d5402ae02ce169a4cc83020eb"><div class="ttname"><a href="namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb">faiss::getmillisecs</a></div><div class="ttdeci">double getmillisecs()</div><div class="ttdoc">ms elapsed since some arbitrary epoch </div><div class="ttdef"><b>Definition:</b> <a href="utils_8cpp_source.html#l00069">utils.cpp:69</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_html_a19b264dfe5a541c1427d3b635ad887f5"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists.html#a19b264dfe5a541c1427d3b635ad887f5">faiss::OnDiskInvertedLists::list_size</a></div><div class="ttdeci">size_t list_size(size_t list_no) const override</div><div class="ttdoc">get the size of a list </div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00398">OnDiskInvertedLists.cpp:398</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1InvertedLists_html_afaf8b7aa3e846aa4553f6aae67827ec8"><div class="ttname"><a href="structfaiss_1_1InvertedLists.html#afaf8b7aa3e846aa4553f6aae67827ec8">faiss::InvertedLists::nlist</a></div><div class="ttdeci">size_t nlist</div><div class="ttdoc">number of possible key values </div><div class="ttdef"><b>Definition:</b> <a href="InvertedLists_8h_source.html#l00034">InvertedLists.h:34</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_html"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists.html">faiss::OnDiskInvertedLists</a></div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8h_source.html#l00051">OnDiskInvertedLists.h:51</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_1_1List_html"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists_1_1List.html">faiss::OnDiskInvertedLists::List</a></div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8h_source.html#l00053">OnDiskInvertedLists.h:53</a></div></div>
|
|
<div class="ttc" id="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch_1_1Thread_html"><div class="ttname"><a href="structfaiss_1_1OnDiskInvertedLists_1_1OngoingPrefetch_1_1Thread.html">faiss::OnDiskInvertedLists::OngoingPrefetch::Thread</a></div><div class="ttdef"><b>Definition:</b> <a href="OnDiskInvertedLists_8cpp_source.html#l00145">OnDiskInvertedLists.cpp:145</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>
|