⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 _request_queue_8h-source.html

📁 用vc++写的一个简单的线程池的代码
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<a name="l00085"></a>00085                         <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#d49a3ed958c6597755027fab49bf0fc6">REQUESTQUEUE</a> reqQue;<a name="l00086"></a>00086                         reqQue.push(cmdPtr);<a name="l00087"></a>00087                         <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>[key] = reqQue;<a name="l00088"></a>00088 <a name="l00089"></a>00089                 }<a name="l00090"></a>00090 <a name="l00091"></a>00091                 <span class="comment">//Increment the total elements of the queue counter</span><a name="l00092"></a>00092                 ++<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">m_count</a>;<a name="l00093"></a>00093                 printf(<span class="stringliteral">"Total number of elements=%d\n"</span>,<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">m_count</a>);<a name="l00094"></a>00094         }<a name="l00095"></a>00095 <a name="l00096"></a>00096                 <span class="comment">//This method is called by a thread when it is free to procees</span><a name="l00097"></a>00097         <span class="comment">//a request. It deques the request -fifo</span><a name="l00098"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#95be84b6db2f6a2da33c5c1b3ce841cc">00098</a>         <a class="code" href="class_plugin_thread_pool_1_1_command.html">Command&lt;T&gt;</a>* <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#95be84b6db2f6a2da33c5c1b3ce841cc">GetRequest</a>()<a name="l00099"></a>00099         {<a name="l00100"></a>00100                 <a class="code" href="class_plugin_thread_pool_1_1_c_lock.html">CLock</a> lock(&amp;<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#8e7df6c99577dd95491de8ad43e0ae28">critsec</a>);<span class="comment">//Actually only one thread calls this at a time- so this does not seem really needed</span><a name="l00101"></a>00101 <a name="l00102"></a>00102                 <span class="keywordflow">try</span><a name="l00103"></a>00103                 {<a name="l00104"></a>00104                         <span class="comment">//check if the map is empty</span><a name="l00105"></a>00105                         <span class="keywordflow">if</span>( <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.begin() == <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.end() )<a name="l00106"></a>00106                         {<a name="l00107"></a>00107                                 printf(<span class="stringliteral">"No elements are there in the map\n"</span>);<a name="l00108"></a>00108                                 <span class="keywordflow">return</span> 0;<a name="l00109"></a>00109                         }<a name="l00110"></a>00110 <a name="l00111"></a>00111                         <span class="comment">//The map is not empty so check where the current iterator points</span><a name="l00112"></a>00112                         <span class="keywordflow">while</span>( <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">CurrentItr</a> != <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.end() )<a name="l00113"></a>00113                         {<a name="l00114"></a>00114                                 <span class="comment">//not in the end so check the queue associated with this map entry</span><a name="l00115"></a>00115 <a name="l00116"></a>00116                                 <span class="keywordflow">if</span>((*CurrentItr).second.size()==0)<a name="l00117"></a>00117                                 {<a name="l00118"></a>00118                                         <span class="comment">//printf("Queue Is Empty!\n");</span><a name="l00119"></a>00119                                         <span class="comment">//if the current queue associated with this iter is iterate to the </span><a name="l00120"></a>00120                                         <span class="comment">//next node and see </span><a name="l00121"></a>00121                                         ++<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">CurrentItr</a>;   <a name="l00122"></a>00122                                 }<a name="l00123"></a>00123                                 <span class="keywordflow">else</span><a name="l00124"></a>00124                                 {       <span class="comment">//ok the queue associated with this is not empty</span><a name="l00125"></a>00125                                         <span class="comment">//so break</span><a name="l00126"></a>00126                                         <span class="keywordflow">break</span>;<a name="l00127"></a>00127                                 }<a name="l00128"></a>00128                         }<a name="l00129"></a>00129 <a name="l00130"></a>00130                         <span class="comment">//The current iterator is at the end, set it at the begining and return</span><a name="l00131"></a>00131                         <span class="keywordflow">if</span>(<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">CurrentItr</a> == <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.end())<a name="l00132"></a>00132                         {<a name="l00133"></a>00133                                 <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">CurrentItr</a> =<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.begin();<a name="l00134"></a>00134                                 <span class="keywordflow">return</span> 0;<a name="l00135"></a>00135                         }<a name="l00136"></a>00136                         <a name="l00137"></a>00137                         <span class="comment">//we reach here if the Currentitr is valid and also there is a non empty</span><a name="l00138"></a>00138                         <span class="comment">//quue associated with this.</span><a name="l00139"></a>00139         <a name="l00140"></a>00140                         <span class="comment">//out the element       </span><a name="l00141"></a>00141                         <a class="code" href="class_plugin_thread_pool_1_1_command.html">Command&lt;T&gt;</a>* temp=0;<a name="l00142"></a>00142                         <a name="l00143"></a>00143                          <span class="comment">//Command&lt;T&gt;*   =      (*CurrentItr).second.front();</span><a name="l00144"></a>00144                         temp =  (*CurrentItr).second.top();<span class="comment">//Added for priority queue</span><a name="l00145"></a>00145 <a name="l00146"></a>00146                         (*CurrentItr).second.pop();<a name="l00147"></a>00147 <a name="l00148"></a>00148                         printf(<span class="stringliteral">"Size of Queue=%d\n"</span>,(*CurrentItr).second.size());<a name="l00149"></a>00149                         <a name="l00150"></a>00150                         ++<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">CurrentItr</a>;<a name="l00151"></a>00151                         <span class="comment">//decrement the counter</span><a name="l00152"></a>00152                         --<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">m_count</a>;<a name="l00153"></a>00153                         <span class="comment">//printf("**Total number of elements=%d\n",m_count);</span><a name="l00154"></a>00154                         <span class="keywordflow">return</span> temp;<a name="l00155"></a>00155 <a name="l00156"></a>00156                 }<a name="l00157"></a>00157                 <span class="keywordflow">catch</span>(...)<a name="l00158"></a>00158                 {<a name="l00159"></a>00159                         printf(<span class="stringliteral">"Exception Caught in GetRequest.....\n"</span>);<a name="l00160"></a>00160                         <span class="keywordflow">throw</span>;<a name="l00161"></a>00161                 }<a name="l00162"></a>00162         <a name="l00163"></a>00163         }<a name="l00164"></a>00164 <a name="l00165"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#a36041b689f2d1817774eaae5d1d9793">00165</a>         <span class="keywordtype">bool</span> <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#a36041b689f2d1817774eaae5d1d9793">empty</a>()<span class="comment">// todo</span><a name="l00166"></a>00166         {<a name="l00167"></a>00167                 <span class="comment">//printf("IsEmpty--Total number of elements=%d\n",m_count);</span><a name="l00168"></a>00168                 <a name="l00169"></a>00169                 <span class="keywordflow">if</span>(<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">m_count</a>)<a name="l00170"></a>00170                         <span class="keywordflow">return</span> <span class="keyword">false</span>;<a name="l00171"></a>00171                 <span class="keywordflow">else</span><a name="l00172"></a>00172                         <span class="keywordflow">return</span> <span class="keyword">true</span>;<a name="l00173"></a>00173 <a name="l00174"></a>00174         }<a name="l00175"></a>00175 <a name="l00176"></a>00176 };<a name="l00177"></a>00177 <a name="l00178"></a>00178 }<a name="l00179"></a>00179 <a name="l00180"></a>00180 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Sun Jan 20 13:16:01 2008 for ThreadPool by&nbsp;<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address></body></html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -