doc/www/doxygen/html/dataqueue_8cc-source.html

   1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
   2 <html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
   3 <title>Barry: dataqueue.cc Source File</title>
   4 <link href="doxygen.css" rel="stylesheet" type="text/css">
   5 <link href="tabs.css" rel="stylesheet" type="text/css">
   6 </head><body>
   7 <!-- Generated by Doxygen 1.5.6 -->
   8 <div class="navigation" id="top">
   9   <div class="tabs">
  10     <ul>
  11       <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  12       <li><a href="modules.html"><span>Modules</span></a></li>
  13       <li><a href="namespaces.html"><span>Namespaces</span></a></li>
  14       <li><a href="classes.html"><span>Classes</span></a></li>
  15       <li class="current"><a href="files.html"><span>Files</span></a></li>
  16       <li><a href="dirs.html"><span>Directories</span></a></li>
  17     </ul>
  18   </div>
  19   <div class="navpath"><a class="el" href="dir_edc0f428e3eefcfdce9c25befd901c57.html">src</a>
  20   </div>
  21 </div>
  22 <div class="contents">
  23 <h1>dataqueue.cc</h1><a href="dataqueue_8cc.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">///</span>
  24 <a name="l00002"></a>00002 <span class="comment"></span><span class="comment">/// \file       dataqueue.cc</span>
  25 <a name="l00003"></a>00003 <span class="comment"></span><span class="comment">///             FIFO queue of Data objects</span>
  26 <a name="l00004"></a>00004 <span class="comment"></span><span class="comment">///</span>
  27 <a name="l00005"></a>00005 <span class="comment"></span>
  28 <a name="l00006"></a>00006 <span class="comment">/*</span>
  29 <a name="l00007"></a>00007 <span class="comment">    Copyright (C) 2008-2011, Net Direct Inc. (http://www.netdirect.ca/)</span>
  30 <a name="l00008"></a>00008 <span class="comment"></span>
  31 <a name="l00009"></a>00009 <span class="comment">    This program is free software; you can redistribute it and/or modify</span>
  32 <a name="l00010"></a>00010 <span class="comment">    it under the terms of the GNU General Public License as published by</span>
  33 <a name="l00011"></a>00011 <span class="comment">    the Free Software Foundation; either version 2 of the License, or</span>
  34 <a name="l00012"></a>00012 <span class="comment">    (at your option) any later version.</span>
  35 <a name="l00013"></a>00013 <span class="comment"></span>
  36 <a name="l00014"></a>00014 <span class="comment">    This program is distributed in the hope that it will be useful,</span>
  37 <a name="l00015"></a>00015 <span class="comment">    but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
  38 <a name="l00016"></a>00016 <span class="comment">    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.</span>
  39 <a name="l00017"></a>00017 <span class="comment"></span>
  40 <a name="l00018"></a>00018 <span class="comment">    See the GNU General Public License in the COPYING file at the</span>
  41 <a name="l00019"></a>00019 <span class="comment">    root directory of this project for more details.</span>
  42 <a name="l00020"></a>00020 <span class="comment">*/</span>
  43 <a name="l00021"></a>00021
  44 <a name="l00022"></a>00022 <span class="preprocessor">#include "<a class="code" href="dataqueue_8h.html" title="FIFO queue of Data objects.">dataqueue.h</a>"</span>
  45 <a name="l00023"></a>00023 <span class="preprocessor">#include "<a class="code" href="scoped__lock_8h.html" title="Simple scope class for dealing with pthread mutex locking.">scoped_lock.h</a>"</span>
  46 <a name="l00024"></a>00024 <span class="preprocessor">#include "<a class="code" href="data_8h.html" title="Class to deal with pre-saved data files.">data.h</a>"</span>
  47 <a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="time_8h.html" title="Time related conversion routines.">time.h</a>"</span>
  48 <a name="l00026"></a>00026
  49 <a name="l00027"></a>00027 <span class="keyword">namespace </span>Barry {
  50 <a name="l00028"></a>00028 <span class="comment"></span>
  51 <a name="l00029"></a>00029 <span class="comment">//////////////////////////////////////////////////////////////////////////////</span>
  52 <a name="l00030"></a>00030 <span class="comment"></span><span class="comment">// DataQueue class</span>
  53 <a name="l00031"></a>00031
  54 <a name="l00032"></a>00032 DataQueue::DataQueue()
  55 <a name="l00033"></a>00033 {
  56 <a name="l00034"></a>00034         pthread_mutex_init(&amp;m_waitMutex, NULL);
  57 <a name="l00035"></a>00035         pthread_cond_init(&amp;m_waitCond, NULL);
  58 <a name="l00036"></a>00036
  59 <a name="l00037"></a>00037         pthread_mutex_init(&amp;m_accessMutex, NULL);
  60 <a name="l00038"></a>00038 }
  61 <a name="l00039"></a>00039
  62 <a name="l00040"></a>00040 DataQueue::~DataQueue()
  63 <a name="l00041"></a>00041 {
  64 <a name="l00042"></a>00042         scoped_lock lock(m_accessMutex);        <span class="comment">// FIXME - is this sane?</span>
  65 <a name="l00043"></a>00043
  66 <a name="l00044"></a>00044         <span class="keywordflow">while</span>( m_queue.size() ) {
  67 <a name="l00045"></a>00045                 <span class="keyword">delete</span> m_queue.front();
  68 <a name="l00046"></a>00046                 m_queue.pop();
  69 <a name="l00047"></a>00047         }
  70 <a name="l00048"></a>00048 }
  71 <a name="l00049"></a>00049
  72 <a name="l00050"></a>00050 <span class="comment">//</span>
  73 <a name="l00051"></a>00051 <span class="comment">// push</span>
  74 <a name="l00052"></a>00052 <span class="comment">//</span><span class="comment"></span>
  75 <a name="l00053"></a>00053 <span class="comment">/// Pushes data into the end of the queue.</span>
  76 <a name="l00054"></a>00054 <span class="comment">///</span>
  77 <a name="l00055"></a>00055 <span class="comment">/// The queue owns this pointer as soon as the function is</span>
  78 <a name="l00056"></a>00056 <span class="comment">/// called.  In the case of an exception, it will be freed.</span>
  79 <a name="l00057"></a>00057 <span class="comment">/// Performs a thread broadcast once new data has been added.</span>
  80 <a name="l00058"></a>00058 <span class="comment">///</span>
  81 <a name="l00059"></a><a class="code" href="classBarry_1_1DataQueue.html#ea470a11cbda20dd9af1a92148ecb223">00059</a> <span class="comment"></span><span class="keywordtype">void</span> <a class="code" href="classBarry_1_1DataQueue.html#ea470a11cbda20dd9af1a92148ecb223" title="Pushes data into the end of the queue.">DataQueue::push</a>(Data *data)
  82 <a name="l00060"></a>00060 {
  83 <a name="l00061"></a>00061         <span class="keywordflow">try</span> {
  84 <a name="l00062"></a>00062
  85 <a name="l00063"></a>00063                 {
  86 <a name="l00064"></a>00064                         scoped_lock lock(m_accessMutex);
  87 <a name="l00065"></a>00065                         m_queue.push(data);
  88 <a name="l00066"></a>00066                 }
  89 <a name="l00067"></a>00067
  90 <a name="l00068"></a>00068                 scoped_lock wait(m_waitMutex);
  91 <a name="l00069"></a>00069                 pthread_cond_broadcast(&amp;m_waitCond);
  92 <a name="l00070"></a>00070
  93 <a name="l00071"></a>00071         }
  94 <a name="l00072"></a>00072         <span class="keywordflow">catch</span>(...) {
  95 <a name="l00073"></a>00073                 <span class="keyword">delete</span> data;
  96 <a name="l00074"></a>00074                 <span class="keywordflow">throw</span>;
  97 <a name="l00075"></a>00075         }
  98 <a name="l00076"></a>00076 }
  99 <a name="l00077"></a>00077
 100 <a name="l00078"></a>00078 <span class="comment">//</span>
 101 <a name="l00079"></a>00079 <span class="comment">// pop</span>
 102 <a name="l00080"></a>00080 <span class="comment">//</span><span class="comment"></span>
 103 <a name="l00081"></a>00081 <span class="comment">/// Pops the next element off the front of the queue.</span>
 104 <a name="l00082"></a>00082 <span class="comment">///</span>
 105 <a name="l00083"></a>00083 <span class="comment">/// Returns 0 if empty.</span>
 106 <a name="l00084"></a>00084 <span class="comment">/// The queue no longer owns this pointer upon return.</span>
 107 <a name="l00085"></a>00085 <span class="comment">///</span>
 108 <a name="l00086"></a><a class="code" href="classBarry_1_1DataQueue.html#d1f454f70a9b6ec667e0e22a7ddd6eca">00086</a> <span class="comment"></span>Data* <a class="code" href="classBarry_1_1DataQueue.html#d1f454f70a9b6ec667e0e22a7ddd6eca" title="Pops the next element off the front of the queue.">DataQueue::pop</a>()
 109 <a name="l00087"></a>00087 {
 110 <a name="l00088"></a>00088         scoped_lock lock(m_accessMutex);
 111 <a name="l00089"></a>00089
 112 <a name="l00090"></a>00090         <span class="keywordflow">if</span>( m_queue.size() == 0 )
 113 <a name="l00091"></a>00091                 <span class="keywordflow">return</span> 0;
 114 <a name="l00092"></a>00092
 115 <a name="l00093"></a>00093         Data *ret = m_queue.front();
 116 <a name="l00094"></a>00094         m_queue.pop();
 117 <a name="l00095"></a>00095         <span class="keywordflow">return</span> ret;
 118 <a name="l00096"></a>00096 }
 119 <a name="l00097"></a>00097
 120 <a name="l00098"></a>00098 <span class="comment">//</span>
 121 <a name="l00099"></a>00099 <span class="comment">// wait_pop</span>
 122 <a name="l00100"></a>00100 <span class="comment">//</span><span class="comment"></span>
 123 <a name="l00101"></a>00101 <span class="comment">/// Pops the next element off the front of the queue, and</span>
 124 <a name="l00102"></a>00102 <span class="comment">/// waits until one exists if empty.  If still no data</span>
 125 <a name="l00103"></a>00103 <span class="comment">/// on timeout, returns null.</span>
 126 <a name="l00104"></a>00104 <span class="comment">/// (unlock the access mutex while waiting!)</span>
 127 <a name="l00105"></a>00105 <span class="comment">///</span>
 128 <a name="l00106"></a>00106 <span class="comment">/// Timeout specified in milliseconds.  Default is wait forever.</span>
 129 <a name="l00107"></a>00107 <span class="comment">///</span>
 130 <a name="l00108"></a><a class="code" href="classBarry_1_1DataQueue.html#27d4830d37b0f7a1bee3a63b0f5a5b2b">00108</a> <span class="comment"></span>Data* <a class="code" href="classBarry_1_1DataQueue.html#27d4830d37b0f7a1bee3a63b0f5a5b2b" title="Pops the next element off the front of the queue, and waits until one exists if empty...">DataQueue::wait_pop</a>(<span class="keywordtype">int</span> timeout)
 131 <a name="l00109"></a>00109 {
 132 <a name="l00110"></a>00110         Data *ret = 0;
 133 <a name="l00111"></a>00111
 134 <a name="l00112"></a>00112         <span class="comment">// check if something's there already</span>
 135 <a name="l00113"></a>00113         {
 136 <a name="l00114"></a>00114                 scoped_lock access(m_accessMutex);
 137 <a name="l00115"></a>00115                 <span class="keywordflow">if</span>( m_queue.size() ) {
 138 <a name="l00116"></a>00116                         ret = m_queue.front();
 139 <a name="l00117"></a>00117                         m_queue.pop();
 140 <a name="l00118"></a>00118                         <span class="keywordflow">return</span> ret;
 141 <a name="l00119"></a>00119                 }
 142 <a name="l00120"></a>00120         }
 143 <a name="l00121"></a>00121
 144 <a name="l00122"></a>00122         <span class="comment">// nothing there, so wait...</span>
 145 <a name="l00123"></a>00123
 146 <a name="l00124"></a>00124         <span class="keywordflow">if</span>( timeout == -1 ) {
 147 <a name="l00125"></a>00125                 <span class="comment">// no timeout</span>
 148 <a name="l00126"></a>00126                 <span class="keywordtype">int</span> <a class="code" href="classBarry_1_1DataQueue.html#da0c2fd55a8f221aadbf0b7165043e06" title="Returns number of items in the queue.">size</a> = 0;
 149 <a name="l00127"></a>00127                 <span class="keywordflow">do</span> {
 150 <a name="l00128"></a>00128                         {
 151 <a name="l00129"></a>00129                                 scoped_lock wait(m_waitMutex);
 152 <a name="l00130"></a>00130                                 pthread_cond_wait(&amp;m_waitCond, &amp;m_waitMutex);
 153 <a name="l00131"></a>00131                         }
 154 <a name="l00132"></a>00132
 155 <a name="l00133"></a>00133                         <span class="comment">// anything there?</span>
 156 <a name="l00134"></a>00134                         scoped_lock access(m_accessMutex);
 157 <a name="l00135"></a>00135                         size = m_queue.size();
 158 <a name="l00136"></a>00136                         <span class="keywordflow">if</span>( size != 0 ) {
 159 <a name="l00137"></a>00137                                 <span class="comment">// already have the lock, return now</span>
 160 <a name="l00138"></a>00138                                 ret = m_queue.front();
 161 <a name="l00139"></a>00139                                 m_queue.pop();
 162 <a name="l00140"></a>00140                                 <span class="keywordflow">return</span> ret;
 163 <a name="l00141"></a>00141                         }
 164 <a name="l00142"></a>00142
 165 <a name="l00143"></a>00143                 } <span class="keywordflow">while</span>( size == 0 );
 166 <a name="l00144"></a>00144         }
 167 <a name="l00145"></a>00145         <span class="keywordflow">else</span> {
 168 <a name="l00146"></a>00146                 <span class="comment">// timeout in conditional wait</span>
 169 <a name="l00147"></a>00147                 <span class="keyword">struct </span>timespec to;
 170 <a name="l00148"></a>00148                 scoped_lock wait(m_waitMutex);
 171 <a name="l00149"></a>00149                 pthread_cond_timedwait(&amp;m_waitCond, &amp;m_waitMutex,
 172 <a name="l00150"></a>00150                         <a class="code" href="namespaceBarry.html#0e1dc80f82d25739631c39b545f812bb" title="Creates a pthread_cond_timedwait() compatible timespec struct, based on a given timeout...">ThreadTimeout</a>(timeout, &amp;to));
 173 <a name="l00151"></a>00151         }
 174 <a name="l00152"></a>00152
 175 <a name="l00153"></a>00153         scoped_lock access(m_accessMutex);
 176 <a name="l00154"></a>00154         <span class="keywordflow">if</span>( m_queue.size() == 0 )
 177 <a name="l00155"></a>00155                 <span class="keywordflow">return</span> 0;
 178 <a name="l00156"></a>00156
 179 <a name="l00157"></a>00157         ret = m_queue.front();
 180 <a name="l00158"></a>00158         m_queue.pop();
 181 <a name="l00159"></a>00159         <span class="keywordflow">return</span> ret;
 182 <a name="l00160"></a>00160 }
 183 <a name="l00161"></a>00161
 184 <a name="l00162"></a>00162 <span class="comment">//</span>
 185 <a name="l00163"></a>00163 <span class="comment">// append_from</span>
 186 <a name="l00164"></a>00164 <span class="comment">//</span><span class="comment"></span>
 187 <a name="l00165"></a>00165 <span class="comment">/// Pops all data from other and appends it to this.</span>
 188 <a name="l00166"></a>00166 <span class="comment">///</span>
 189 <a name="l00167"></a>00167 <span class="comment">/// After calling this function, other will be empty, and</span>
 190 <a name="l00168"></a>00168 <span class="comment">/// this will contain all its data.</span>
 191 <a name="l00169"></a>00169 <span class="comment">///</span>
 192 <a name="l00170"></a>00170 <span class="comment">/// In the case of an exception, any uncopied data will</span>
 193 <a name="l00171"></a>00171 <span class="comment">/// remain in other.</span>
 194 <a name="l00172"></a>00172 <span class="comment">///</span>
 195 <a name="l00173"></a>00173 <span class="comment">/// This is a locking optimization, so all copying can happen</span>
 196 <a name="l00174"></a>00174 <span class="comment">/// inside one lock, instead of locking for each copy.</span>
 197 <a name="l00175"></a>00175 <span class="comment">///</span>
 198 <a name="l00176"></a><a class="code" href="classBarry_1_1DataQueue.html#12a7a82124799a6803b28efd89e1dd05">00176</a> <span class="comment"></span><span class="keywordtype">void</span> <a class="code" href="classBarry_1_1DataQueue.html#12a7a82124799a6803b28efd89e1dd05" title="Pops all data from other and appends it to this.">DataQueue::append_from</a>(<a class="code" href="classBarry_1_1DataQueue.html" title="This class provides a thread aware fifo queue for Data objects, providing memory...">DataQueue</a> &amp;other)
 199 <a name="l00177"></a>00177 {
 200 <a name="l00178"></a>00178         scoped_lock us(m_accessMutex);
 201 <a name="l00179"></a>00179         scoped_lock them(other.<a class="code" href="classBarry_1_1DataQueue.html#b645b9960f4a569a8d5e4eb12f5b3d7a">m_accessMutex</a>);
 202 <a name="l00180"></a>00180
 203 <a name="l00181"></a>00181         <span class="keywordflow">while</span>( other.<a class="code" href="classBarry_1_1DataQueue.html#96dd6ed3c7c7944ee02e683177768464">m_queue</a>.size() ) {
 204 <a name="l00182"></a>00182                 m_queue.push( other.<a class="code" href="classBarry_1_1DataQueue.html#96dd6ed3c7c7944ee02e683177768464">m_queue</a>.front() );
 205 <a name="l00183"></a>00183
 206 <a name="l00184"></a>00184                 <span class="comment">// only pop after the copy, since in the</span>
 207 <a name="l00185"></a>00185                 <span class="comment">// case of an exception we want to leave other intact</span>
 208 <a name="l00186"></a>00186                 other.<a class="code" href="classBarry_1_1DataQueue.html#96dd6ed3c7c7944ee02e683177768464">m_queue</a>.pop();
 209 <a name="l00187"></a>00187         }
 210 <a name="l00188"></a>00188 }
 211 <a name="l00189"></a>00189
 212 <a name="l00190"></a>00190 <span class="comment">//</span>
 213 <a name="l00191"></a>00191 <span class="comment">// empty</span>
 214 <a name="l00192"></a>00192 <span class="comment">//</span><span class="comment"></span>
 215 <a name="l00193"></a>00193 <span class="comment">/// Returns true if the queue is empty.</span>
 216 <a name="l00194"></a>00194 <span class="comment">///</span>
 217 <a name="l00195"></a><a class="code" href="classBarry_1_1DataQueue.html#76cecba41e423f7d20df464cf7524e76">00195</a> <span class="comment"></span><span class="keywordtype">bool</span> <a class="code" href="classBarry_1_1DataQueue.html#76cecba41e423f7d20df464cf7524e76" title="Returns true if the queue is empty.">DataQueue::empty</a>()<span class="keyword"> const</span>
 218 <a name="l00196"></a>00196 <span class="keyword"></span>{
 219 <a name="l00197"></a>00197         scoped_lock access(m_accessMutex);
 220 <a name="l00198"></a>00198         <span class="keywordflow">return</span> m_queue.size() == 0;
 221 <a name="l00199"></a>00199 }
 222 <a name="l00200"></a>00200
 223 <a name="l00201"></a>00201 <span class="comment">//</span>
 224 <a name="l00202"></a>00202 <span class="comment">// size</span>
 225 <a name="l00203"></a>00203 <span class="comment">//</span><span class="comment"></span>
 226 <a name="l00204"></a>00204 <span class="comment">/// Returns number of items in the queue.</span>
 227 <a name="l00205"></a>00205 <span class="comment">///</span>
 228 <a name="l00206"></a><a class="code" href="classBarry_1_1DataQueue.html#da0c2fd55a8f221aadbf0b7165043e06">00206</a> <span class="comment"></span><span class="keywordtype">size_t</span> <a class="code" href="classBarry_1_1DataQueue.html#da0c2fd55a8f221aadbf0b7165043e06" title="Returns number of items in the queue.">DataQueue::size</a>()<span class="keyword"> const</span>
 229 <a name="l00207"></a>00207 <span class="keyword"></span>{
 230 <a name="l00208"></a>00208         scoped_lock access(m_accessMutex);
 231 <a name="l00209"></a>00209         <span class="keywordflow">return</span> m_queue.size();
 232 <a name="l00210"></a>00210 }
 233 <a name="l00211"></a>00211
 234 <a name="l00212"></a>00212 } <span class="comment">// namespace Barry</span>
 235 <a name="l00213"></a>00213
 236 <a name="l00214"></a>00214
 237 <a name="l00215"></a>00215 <span class="preprocessor">#ifdef __DQ_TEST_MODE__</span>
 238 <a name="l00216"></a>00216 <span class="preprocessor"></span>
 239 <a name="l00217"></a>00217 <span class="preprocessor">#include &lt;iostream&gt;</span>
 240 <a name="l00218"></a>00218
 241 <a name="l00219"></a>00219 <span class="keyword">using namespace </span>std;
 242 <a name="l00220"></a>00220 <span class="keyword">using namespace </span>Barry;
 243 <a name="l00221"></a>00221
 244 <a name="l00222"></a>00222 <span class="keywordtype">void</span> *WriteThread(<span class="keywordtype">void</span> *userdata)
 245 <a name="l00223"></a>00223 {
 246 <a name="l00224"></a>00224         DataQueue *dq = (DataQueue*) userdata;
 247 <a name="l00225"></a>00225
 248 <a name="l00226"></a>00226         dq-&gt;push( <span class="keyword">new</span> Data );
 249 <a name="l00227"></a>00227         dq-&gt;push( <span class="keyword">new</span> Data );
 250 <a name="l00228"></a>00228         sleep(5);
 251 <a name="l00229"></a>00229         dq-&gt;push( <span class="keyword">new</span> Data );
 252 <a name="l00230"></a>00230
 253 <a name="l00231"></a>00231         <span class="keywordflow">return</span> 0;
 254 <a name="l00232"></a>00232 }
 255 <a name="l00233"></a>00233
 256 <a name="l00234"></a>00234 <span class="keywordtype">void</span> *ReadThread(<span class="keywordtype">void</span> *userdata)
 257 <a name="l00235"></a>00235 {
 258 <a name="l00236"></a>00236         DataQueue *dq = (DataQueue*) userdata;
 259 <a name="l00237"></a>00237
 260 <a name="l00238"></a>00238         sleep(1);
 261 <a name="l00239"></a>00239         <span class="keywordflow">if</span>( Data *d = dq-&gt;pop() ) {
 262 <a name="l00240"></a>00240                 cout &lt;&lt; <span class="stringliteral">"Received via pop: "</span> &lt;&lt; d &lt;&lt; endl;
 263 <a name="l00241"></a>00241                 <span class="keyword">delete</span> d;
 264 <a name="l00242"></a>00242         }
 265 <a name="l00243"></a>00243         <span class="keywordflow">else</span> {
 266 <a name="l00244"></a>00244                 cout &lt;&lt; <span class="stringliteral">"No data in the queue yet."</span> &lt;&lt; endl;
 267 <a name="l00245"></a>00245         }
 268 <a name="l00246"></a>00246
 269 <a name="l00247"></a>00247         <span class="keywordflow">while</span>( Data *d = dq-&gt;wait_pop(5010) ) {
 270 <a name="l00248"></a>00248                 cout &lt;&lt; <span class="stringliteral">"Received: "</span> &lt;&lt; d &lt;&lt; endl;
 271 <a name="l00249"></a>00249                 <span class="keyword">delete</span> d;
 272 <a name="l00250"></a>00250         }
 273 <a name="l00251"></a>00251         <span class="keywordflow">return</span> 0;
 274 <a name="l00252"></a>00252 }
 275 <a name="l00253"></a>00253
 276 <a name="l00254"></a>00254 <span class="keywordtype">int</span> main()
 277 <a name="l00255"></a>00255 {
 278 <a name="l00256"></a>00256         DataQueue from;
 279 <a name="l00257"></a>00257         from.push( <span class="keyword">new</span> Data );
 280 <a name="l00258"></a>00258
 281 <a name="l00259"></a>00259         DataQueue dq;
 282 <a name="l00260"></a>00260         dq.append_from(from);
 283 <a name="l00261"></a>00261
 284 <a name="l00262"></a>00262         pthread_t t1, t2;
 285 <a name="l00263"></a>00263         pthread_create(&amp;t1, NULL, &amp;ReadThread, &amp;dq);
 286 <a name="l00264"></a>00264         pthread_create(&amp;t2, NULL, &amp;WriteThread, &amp;dq);
 287 <a name="l00265"></a>00265
 288 <a name="l00266"></a>00266         pthread_join(t2, NULL);
 289 <a name="l00267"></a>00267         pthread_join(t1, NULL);
 290 <a name="l00268"></a>00268 }
 291 <a name="l00269"></a>00269
 292 <a name="l00270"></a>00270 <span class="preprocessor">#endif</span>
 293 <a name="l00271"></a>00271 <span class="preprocessor"></span>
 294 </pre></div></div>
 295 <hr size="1"><address style="text-align: right;"><small>Generated on Thu Feb 10 16:13:58 2011 for Barry by&nbsp;
 296 <a href="http://www.doxygen.org/index.html">
 297 <img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
 298 </body>
 299 </html>