You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@mesos.apache.org by gi...@apache.org on 2018/07/15 23:22:11 UTC
[02/10] mesos-site git commit: Updated the website built from mesos
SHA: b1eafc0.
http://git-wip-us.apache.org/repos/asf/mesos-site/blob/1ce9f4ab/content/api/latest/c++/mpsc__linked__queue_8hpp.html
----------------------------------------------------------------------
diff --git a/content/api/latest/c++/mpsc__linked__queue_8hpp.html b/content/api/latest/c++/mpsc__linked__queue_8hpp.html
new file mode 100644
index 0000000..0f75d29
--- /dev/null
+++ b/content/api/latest/c++/mpsc__linked__queue_8hpp.html
@@ -0,0 +1,82 @@
+<!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.11"/>
+<title>Apache Mesos: 3rdparty/libprocess/src/mpsc_linked_queue.hpp File Reference</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="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 id="projectalign" style="padding-left: 0.5em;">
+ <div id="projectname">Apache Mesos
+ </div>
+ </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.11 -->
+ <div id="navrow1" class="tabs">
+ <ul class="tablist">
+ <li><a href="index.html"><span>Main Page</span></a></li>
+ <li><a href="pages.html"><span>Related Pages</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><a href="examples.html"><span>Examples</span></a></li>
+ </ul>
+ </div>
+ <div id="navrow2" class="tabs2">
+ <ul class="tablist">
+ <li><a href="files.html"><span>File List</span></a></li>
+ <li><a href="globals.html"><span>File Members</span></a></li>
+ </ul>
+ </div>
+<div id="nav-path" class="navpath">
+ <ul>
+<li class="navelem"><a class="el" href="dir_8cab8f464681f7cc51cee77e79a434cd.html">3rdparty</a></li><li class="navelem"><a class="el" href="dir_043a76de98701f9bddf61b5e98f305ff.html">libprocess</a></li><li class="navelem"><a class="el" href="dir_01cbbd8dcbf9de3825992568658f467e.html">src</a></li> </ul>
+</div>
+</div><!-- top -->
+<div class="header">
+ <div class="summary">
+<a href="#nested-classes">Classes</a> |
+<a href="#namespaces">Namespaces</a> </div>
+ <div class="headertitle">
+<div class="title">mpsc_linked_queue.hpp File Reference</div> </div>
+</div><!--header-->
+<div class="contents">
+<div class="textblock"><code>#include <atomic></code><br />
+<code>#include <functional></code><br />
+<code>#include <glog/logging.h></code><br />
+</div>
+<p><a href="mpsc__linked__queue_8hpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
+Classes</h2></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classprocess_1_1MpscLinkedQueue.html">process::MpscLinkedQueue< T ></a></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
+</table><table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
+Namespaces</h2></td></tr>
+<tr class="memitem:namespaceprocess"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceprocess.html">process</a></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
+</table>
+</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.11
+</small></address>
+</body>
+</html>
http://git-wip-us.apache.org/repos/asf/mesos-site/blob/1ce9f4ab/content/api/latest/c++/mpsc__linked__queue_8hpp_source.html
----------------------------------------------------------------------
diff --git a/content/api/latest/c++/mpsc__linked__queue_8hpp_source.html b/content/api/latest/c++/mpsc__linked__queue_8hpp_source.html
new file mode 100644
index 0000000..dfb39e2
--- /dev/null
+++ b/content/api/latest/c++/mpsc__linked__queue_8hpp_source.html
@@ -0,0 +1,72 @@
+<!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.11"/>
+<title>Apache Mesos: 3rdparty/libprocess/src/mpsc_linked_queue.hpp 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="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 id="projectalign" style="padding-left: 0.5em;">
+ <div id="projectname">Apache Mesos
+ </div>
+ </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.11 -->
+ <div id="navrow1" class="tabs">
+ <ul class="tablist">
+ <li><a href="index.html"><span>Main Page</span></a></li>
+ <li><a href="pages.html"><span>Related Pages</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><a href="examples.html"><span>Examples</span></a></li>
+ </ul>
+ </div>
+ <div id="navrow2" class="tabs2">
+ <ul class="tablist">
+ <li><a href="files.html"><span>File List</span></a></li>
+ <li><a href="globals.html"><span>File Members</span></a></li>
+ </ul>
+ </div>
+<div id="nav-path" class="navpath">
+ <ul>
+<li class="navelem"><a class="el" href="dir_8cab8f464681f7cc51cee77e79a434cd.html">3rdparty</a></li><li class="navelem"><a class="el" href="dir_043a76de98701f9bddf61b5e98f305ff.html">libprocess</a></li><li class="navelem"><a class="el" href="dir_01cbbd8dcbf9de3825992568658f467e.html">src</a></li> </ul>
+</div>
+</div><!-- top -->
+<div class="header">
+ <div class="headertitle">
+<div class="title">mpsc_linked_queue.hpp</div> </div>
+</div><!--header-->
+<div class="contents">
+<a href="mpsc__linked__queue_8hpp.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">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="co
mment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// limitations under the License</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div><
div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#ifndef __MPSC_LINKED_QUEUE_HPP__</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#define __MPSC_LINKED_QUEUE_HPP__</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 <atomic></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <functional></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <glog/logging.h></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div clas
s="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">namespace </span><a class="code" href="namespaceprocess.html">process</a> {</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="comment">// This queue is a C++ port of the MpscLinkedQueue of JCTools, but limited to</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// the core methods:</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// https://github.com/JCTools/JCTools/blob/master/jctools-core/src/main/java/org/jctools/queues/MpscLinkedQueue.java</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">//</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#
160;<span class="comment">// which is a Java port of the MPSC algorithm as presented in following article:</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// http://www.1024cores.net/home/lock-free-algorithms/queues/non-intrusive-mpsc-node-based-queue</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> <span class="comment">// The queue has following properties:</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// Producers are wait-free (one atomic exchange per enqueue)</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// Consumer is</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"
>// - lock-free</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// - mostly wait-free, except when consumer reaches the end of the queue</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// and producer enqueued a new node, but did not update the next pointer</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// on the old node, yet</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html"> 38</a></span> <span class="keyword">class </span><a class="code" href="classprocess_1_1MpscLinkedQueue.html">MpscLinkedQueue</a></div><div class="
line"><a name="l00039"></a><span class="lineno"> 39</span> {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> E></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">struct </span>Node</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="keyword">public</span>:</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">explicit</span> Node(E* element = <span class="keyword">nullptr</span>) : element(element) {}</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>  E* element;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  std::atomic<Node<E>*> next = ATOMIC_VAR_INIT(<span class="keyword">nullptr</span>);</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> </div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html#a4955e95e3146ffd4865f47636f934a6f"> 52</a></span>  <a class="code" href="classprocess_1_1MpscLinkedQueue.html#a4955e95e3146ffd4865f47636f934a6f">MpscLinkedQueue</a>()</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div><div class="line"><a name="l00054"></a><span cl
ass="lineno"> 54</span>  tail = <span class="keyword">new</span> Node<T>();</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  head.store(tail);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html#ac6ff02deeadfed9066166093769b3b9a"> 58</a></span>  <a class="code" href="classprocess_1_1MpscLinkedQueue.html#ac6ff02deeadfed9066166093769b3b9a">~MpscLinkedQueue</a>()</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">while</span> (<span class="keyword">auto</span> element = <a class="code" href="classprocess_1_1MpscLinkedQueue.html#af9711afa3db
6d73c2c31bab3f30e5f61">dequeue</a>()) {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">delete</span> element;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</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>  <span class="keyword">delete</span> tail;</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="comment">// Multi producer safe.</span></div><div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html#a15b0656de08bb0b8810a4d1bec88ab45"> 68</a></span>  <span class="keywordtype">voi
d</span> <a class="code" href="classprocess_1_1MpscLinkedQueue.html#a15b0656de08bb0b8810a4d1bec88ab45">enqueue</a>(T* element)</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="comment">// A `nullptr` is used to denote an empty queue when doing a</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// `dequeue()` so producers can't use it as an element.</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  CHECK_NOTNULL(element);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">auto</span> newNode = <span class="keyword">new</span> Node<T>(element);</div><div class="line"><a name="l00075"></a><sp
an class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Exchange is guaranteed to only give the old value to one</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// producer, so this is safe and wait-free.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">auto</span> oldhead = head.exchange(newNode, std::memory_order_release);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// At this point if this thread context switches out we may block</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// the consumer from doing a dequeue (see below). Eventually we'
;ll</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// unblock the consumer once we run again and execute the next</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// line of code.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  oldhead->next.store(newNode, std::memory_order_release);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</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>  <span class="comment">// Single consumer only.</span></div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html#af9711afa3db6d73c2c31bab3f30e5f61"> 88</a></span>  T* <a class="code" href="classproc
ess_1_1MpscLinkedQueue.html#af9711afa3db6d73c2c31bab3f30e5f61">dequeue</a>()</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  {</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">auto</span> currentTail = tail;</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>  <span class="comment">// Check and see if there is an actual element linked from `tail`</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// since we use `tail` as a "stub" rather than the actual element.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">auto</span> nextTail = currentTail->next.exchange(</div><div class="line"><a name="l00095"></a><span class="lineno"> 95
</span>  <span class="keyword">nullptr</span>,</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::memory_order_relaxed);</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">// There are three possible cases here:</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">//</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// (1) The queue is empty.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// (2) The queue appears empty but a producer is still enqueuing</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// so let's wait fo
r it and then dequeue.</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// (3) We have something to dequeue.</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">//</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// Start by checking if the queue is or appears empty.</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (nextTail == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Now check if the queue is actually empty or just appears</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// empty. If it's actually empty then return `nullptr`
to denote</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// emptiness.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (head.load(std::memory_order_relaxed) == tail) {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// Another thread already inserted a new node, but did not</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// connect it to the tail, yet, so we spin
-wait. At this point</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// we are not wait-free anymore.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  nextTail = currentTail->next.exchange(</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">nullptr</span>,</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  std::memory_order_relaxed);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  } <span class="keywordflow">while</span> (nextTail == <span class="keyword">nullptr</span>);</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>  CHECK_NOTNULL(nextTail);</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>  <span class="keyword">auto</span> element = nextTail->element;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  nextTail->element = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  tail = nextTail;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">delete</span> currentTail;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"
></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> element;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// Single consumer only.</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">//</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// TODO(drexin): Provide C++ style iteration so someone can just use</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// the `std::for_each()`.</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">template</span> <<span class="keyword">t
ypename</span> F></div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html#a361ad3f84e782291c0ec6d714c7e140d"> 140</a></span>  <span class="keywordtype">void</span> <a class="code" href="classprocess_1_1MpscLinkedQueue.html#a361ad3f84e782291c0ec6d714c7e140d">for_each</a>(F&& <a class="code" href="namespaceprocess.html#a62d5333e8ec1817c249cf83e15d568b4">f</a>)</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">auto</span> end = head.load();</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">auto</span> node = tail;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywo
rdflow">for</span> (;;) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  node = node->next.load();</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// We are following the linked structure until we reach the end</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// node. There is a race with new nodes being added, so we limit</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// the traversal to the last node at the time we started.</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00152"></a><span clas
s="lineno"> 152</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <a class="code" href="namespaceprocess.html#a62d5333e8ec1817c249cf83e15d568b4">f</a>(node->element);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (node == end) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div><div clas
s="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// Single consumer only.</span></div><div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classprocess_1_1MpscLinkedQueue.html#a995ca5eb7bf5842b0796458f08549ee3"> 164</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classprocess_1_1MpscLinkedQueue.html#a995ca5eb7bf5842b0796458f08549ee3">empty</a>()</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="keywordflow">return</span> tail->next.load(std::memory_order_relaxed) == <span class="keyword">nullptr</span> &&</div><div class="line"><a name="l00167"></a><span class="lineno
"> 167</span>  head.load(std::memory_order_relaxed) == tail;</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> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  std::atomic<Node<T>*> head;</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>  <span class="comment">// TODO(drexin): Programatically get the cache line size.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">alignas</span>(128) Node<T>* tail;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> };</div><div class="l
ine"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> } <span class="comment">// namespace process {</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#endif // __MPSC_LINKED_QUEUE_HPP__</span></div><div class="ttc" id="classprocess_1_1MpscLinkedQueue_html"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html">process::MpscLinkedQueue</a></div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:38</div></div>
+<div class="ttc" id="classprocess_1_1MpscLinkedQueue_html_a361ad3f84e782291c0ec6d714c7e140d"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html#a361ad3f84e782291c0ec6d714c7e140d">process::MpscLinkedQueue::for_each</a></div><div class="ttdeci">void for_each(F &&f)</div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:140</div></div>
+<div class="ttc" id="namespaceprocess_html_a62d5333e8ec1817c249cf83e15d568b4"><div class="ttname"><a href="namespaceprocess.html#a62d5333e8ec1817c249cf83e15d568b4">process::f</a></div><div class="ttdeci">F && f</div><div class="ttdef"><b>Definition:</b> defer.hpp:270</div></div>
+<div class="ttc" id="classprocess_1_1MpscLinkedQueue_html_af9711afa3db6d73c2c31bab3f30e5f61"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html#af9711afa3db6d73c2c31bab3f30e5f61">process::MpscLinkedQueue::dequeue</a></div><div class="ttdeci">T * dequeue()</div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:88</div></div>
+<div class="ttc" id="classprocess_1_1MpscLinkedQueue_html_a4955e95e3146ffd4865f47636f934a6f"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html#a4955e95e3146ffd4865f47636f934a6f">process::MpscLinkedQueue::MpscLinkedQueue</a></div><div class="ttdeci">MpscLinkedQueue()</div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:52</div></div>
+<div class="ttc" id="namespaceprocess_html"><div class="ttname"><a href="namespaceprocess.html">process</a></div><div class="ttdef"><b>Definition:</b> executor.hpp:48</div></div>
+<div class="ttc" id="classprocess_1_1MpscLinkedQueue_html_a995ca5eb7bf5842b0796458f08549ee3"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html#a995ca5eb7bf5842b0796458f08549ee3">process::MpscLinkedQueue::empty</a></div><div class="ttdeci">bool empty()</div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:164</div></div>
+<div class="ttc" id="classprocess_1_1MpscLinkedQueue_html_a15b0656de08bb0b8810a4d1bec88ab45"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html#a15b0656de08bb0b8810a4d1bec88ab45">process::MpscLinkedQueue::enqueue</a></div><div class="ttdeci">void enqueue(T *element)</div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:68</div></div>
+<div class="ttc" id="classprocess_1_1MpscLinkedQueue_html_ac6ff02deeadfed9066166093769b3b9a"><div class="ttname"><a href="classprocess_1_1MpscLinkedQueue.html#ac6ff02deeadfed9066166093769b3b9a">process::MpscLinkedQueue::~MpscLinkedQueue</a></div><div class="ttdeci">~MpscLinkedQueue()</div><div class="ttdef"><b>Definition:</b> mpsc_linked_queue.hpp:58</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.11
+</small></address>
+</body>
+</html>
http://git-wip-us.apache.org/repos/asf/mesos-site/blob/1ce9f4ab/content/api/latest/c++/namespaceprocess.html
----------------------------------------------------------------------
diff --git a/content/api/latest/c++/namespaceprocess.html b/content/api/latest/c++/namespaceprocess.html
index 5370f46..fc9b2d2 100644
--- a/content/api/latest/c++/namespaceprocess.html
+++ b/content/api/latest/c++/namespaceprocess.html
@@ -160,6 +160,8 @@ Classes</h2></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classprocess_1_1MockFilter.html">MockFilter</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classprocess_1_1MpscLinkedQueue.html">MpscLinkedQueue</a></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classprocess_1_1Mutex.html">Mutex</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classprocess_1_1Once.html">Once</a></td></tr>