310 lines
38 KiB
HTML
310 lines
38 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: subsolver.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.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 id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('subsolver_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</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">subsolver.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="subsolver_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</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 "<a class="code" href="subsolver_8h.html">ortools/sat/subsolver.h</a>"</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 "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#if !defined(__PORTABLE_PLATFORM__)</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "absl/synchronization/mutex.h"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/time/clock.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#endif </span><span class="comment">// __PORTABLE_PLATFORM__</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> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>sat {</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> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// Returns the next SubSolver index from which to call GenerateTask(). Note that</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// only SubSolvers for which TaskIsAvailable() is true are considered. Return -1</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// if no SubSolver can generate a new task.</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// For now we use a really basic logic: call the least frequently called.</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keywordtype">int</span> NextSubsolverToSchedule(</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers,</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">const</span> std::vector<int64>& num_generated_tasks) {</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">int</span> best = -1;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < subsolvers.size(); ++i) {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> (subsolvers[i]->TaskIsAvailable()) {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (best == -1 || num_generated_tasks[i] < num_generated_tasks[best]) {</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  best = i;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  }</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (best != -1) <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Scheduling "</span> << subsolvers[best]->name();</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">return</span> best;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> }</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keywordtype">void</span> SynchronizeAll(<span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers) {</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& subsolver : subsolvers) subsolver->Synchronize();</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a"> 54</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a">SequentialLoop</a>(<span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers) {</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = 0;</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  std::vector<int64> num_generated_tasks(subsolvers.size(), 0);</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  SynchronizeAll(subsolvers);</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> best = NextSubsolverToSchedule(subsolvers, num_generated_tasks);</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (best == -1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  num_generated_tasks[best]++;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  subsolvers[best]->GenerateTask(task_id++)();</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> }</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> <span class="preprocessor">#if defined(__PORTABLE_PLATFORM__)</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// On portable platform, we don't support multi-threading for now.</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a7f96a084f2f3d7942b88c9f932cb7f00">NonDeterministicLoop</a>(</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers,</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">int</span> num_threads) {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a">SequentialLoop</a>(subsolvers);</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> <a class="code" href="namespaceoperations__research_1_1sat.html#a5174cbb2ba52f702d89b3a426b8b2780">DeterministicLoop</a>(</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers, <span class="keywordtype">int</span> num_threads,</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">int</span> batch_size) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a">SequentialLoop</a>(subsolvers);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> }</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor">#else </span><span class="comment">// __PORTABLE_PLATFORM__</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5174cbb2ba52f702d89b3a426b8b2780"> 84</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a5174cbb2ba52f702d89b3a426b8b2780">DeterministicLoop</a>(</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers, <span class="keywordtype">int</span> num_threads,</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">int</span> batch_size) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(num_threads, 0);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(batch_size, 0);</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (batch_size == 1) {</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a">SequentialLoop</a>(subsolvers);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = 0;</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  std::vector<int64> num_generated_tasks(subsolvers.size(), 0);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  SynchronizeAll(subsolvers);</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// TODO(user): We could reuse the same ThreadPool as long as we wait for all</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// the task in a batch to finish before scheduling new ones. Not sure how</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// to easily do that, so for now we just recreate the pool for each batch.</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="classoperations__research_1_1_thread_pool.html">ThreadPool</a> pool(<span class="stringliteral">"DeterministicLoop"</span>, num_threads);</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  pool.<a class="code" href="classoperations__research_1_1_thread_pool.html#a176534e56452aa8789f0d4200975dc70">StartWorkers</a>();</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  </div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">int</span> num_in_batch = 0;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < batch_size; ++t) {</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> best = NextSubsolverToSchedule(subsolvers, num_generated_tasks);</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (best == -1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  ++num_in_batch;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  num_generated_tasks[best]++;</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  pool.<a class="code" href="classoperations__research_1_1_thread_pool.html#aac78d8770b03a18532d00104cd2bce0e">Schedule</a>(subsolvers[best]->GenerateTask(task_id++));</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (num_in_batch == 0) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a7f96a084f2f3d7942b88c9f932cb7f00"> 116</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a7f96a084f2f3d7942b88c9f932cb7f00">NonDeterministicLoop</a>(</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">const</span> std::vector<std::unique_ptr<SubSolver>>& subsolvers,</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordtype">int</span> num_threads) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(num_threads, 0);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (num_threads == 1) {</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a">SequentialLoop</a>(subsolvers);</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// The mutex will protect these two fields. This is used to only keep</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// num_threads task in-flight and detect when the search is done.</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  absl::Mutex mutex;</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  absl::CondVar thread_available_condition;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">int</span> num_scheduled_and_not_done = 0;</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="classoperations__research_1_1_thread_pool.html">ThreadPool</a> pool(<span class="stringliteral">"NonDeterministicLoop"</span>, num_threads);</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  pool.<a class="code" href="classoperations__research_1_1_thread_pool.html#a176534e56452aa8789f0d4200975dc70">StartWorkers</a>();</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  </div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// The lambda below are using little space, but there is no reason</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// to create millions of them, so we use the blocking nature of</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// pool.Schedule() when the queue capacity is set.</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = 0;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  std::vector<int64> num_generated_tasks(subsolvers.size(), 0);</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordtype">bool</span> all_done = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  absl::MutexLock mutex_lock(&mutex);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  </div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// The stopping condition is that we do not have anything else to generate</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// once all the task are done and synchronized.</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (num_scheduled_and_not_done == 0) all_done = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  </div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Wait if num_scheduled_and_not_done == num_threads.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (num_scheduled_and_not_done == num_threads) {</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  thread_available_condition.Wait(&mutex);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  </div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  SynchronizeAll(subsolvers);</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> best = NextSubsolverToSchedule(subsolvers, num_generated_tasks);</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">if</span> (best == -1) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (all_done) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  </div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// It is hard to know when new info will allows for more task to be</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// scheduled, so for now we just sleep for a bit. Note that in practice We</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// will never reach here except at the end of the search because we can</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// always schedule LNS threads.</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  absl::SleepFor(absl::Milliseconds(1));</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Schedule next task.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  num_generated_tasks[best]++;</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>  absl::MutexLock mutex_lock(&mutex);</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  num_scheduled_and_not_done++;</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>  std::function<void()> task = subsolvers[best]->GenerateTask(task_id++);</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> std::string <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a> = subsolvers[best]->name();</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  pool.<a class="code" href="classoperations__research_1_1_thread_pool.html#aac78d8770b03a18532d00104cd2bce0e">Schedule</a>([task, num_threads, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, &mutex, &num_scheduled_and_not_done,</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  &thread_available_condition]() {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  task();</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  absl::MutexLock mutex_lock(&mutex);</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a> << <span class="stringliteral">" done."</span>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  num_scheduled_and_not_done--;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (num_scheduled_and_not_done == num_threads - 1) {</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  thread_available_condition.SignalAll();</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>  });</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</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>  </div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="preprocessor">#endif </span><span class="comment">// __PORTABLE_PLATFORM__</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_thread_pool_html"><div class="ttname"><a href="classoperations__research_1_1_thread_pool.html">operations_research::ThreadPool</a></div><div class="ttdef"><b>Definition:</b> <a href="threadpool_8h_source.html#l00026">threadpool.h:26</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_thread_pool_html_a176534e56452aa8789f0d4200975dc70"><div class="ttname"><a href="classoperations__research_1_1_thread_pool.html#a176534e56452aa8789f0d4200975dc70">operations_research::ThreadPool::StartWorkers</a></div><div class="ttdeci">void StartWorkers()</div><div class="ttdef"><b>Definition:</b> <a href="threadpool_8cc_source.html#l00049">threadpool.cc:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_thread_pool_html_aac78d8770b03a18532d00104cd2bce0e"><div class="ttname"><a href="classoperations__research_1_1_thread_pool.html#aac78d8770b03a18532d00104cd2bce0e">operations_research::ThreadPool::Schedule</a></div><div class="ttdeci">void Schedule(std::function< void()> closure)</div><div class="ttdef"><b>Definition:</b> <a href="threadpool_8cc_source.html#l00077">threadpool.cc:77</a></div></div>
|
|
<div class="ttc" id="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00808">default_search.cc:808</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5174cbb2ba52f702d89b3a426b8b2780"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5174cbb2ba52f702d89b3a426b8b2780">operations_research::sat::DeterministicLoop</a></div><div class="ttdeci">void DeterministicLoop(const std::vector< std::unique_ptr< SubSolver >> &subsolvers, int num_threads, int batch_size)</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8cc_source.html#l00084">subsolver.cc:84</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7f96a084f2f3d7942b88c9f932cb7f00"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7f96a084f2f3d7942b88c9f932cb7f00">operations_research::sat::NonDeterministicLoop</a></div><div class="ttdeci">void NonDeterministicLoop(const std::vector< std::unique_ptr< SubSolver >> &subsolvers, int num_threads)</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8cc_source.html#l00116">subsolver.cc:116</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a90f312bed415edc1fe4d0ede1fe58f4a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a90f312bed415edc1fe4d0ede1fe58f4a">operations_research::sat::SequentialLoop</a></div><div class="ttdeci">void SequentialLoop(const std::vector< std::unique_ptr< SubSolver >> &subsolvers)</div><div class="ttdef"><b>Definition:</b> <a href="subsolver_8cc_source.html#l00054">subsolver.cc:54</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="asubsolver_8h_html"><div class="ttname"><a href="subsolver_8h.html">subsolver.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="subsolver_8cc.html">subsolver.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|