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

📄 _request_queue_8h-source.html

📁 用vc++写的一个简单的线程池的代码
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>ThreadPool: D:/Coding/MMLADC_workarea/MMLADCNewDesign/ThreadPool/RequestQueue.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.7 --><div class="tabs">  <ul>    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>    <li><a href="namespaces.html"><span>Namespaces</span></a></li>    <li><a href="classes.html"><span>Classes</span></a></li>    <li id="current"><a href="files.html"><span>Files</span></a></li>  </ul></div><div class="tabs">  <ul>    <li><a href="files.html"><span>File&nbsp;List</span></a></li>    <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>  </ul></div><h1>D:/Coding/MMLADC_workarea/MMLADCNewDesign/ThreadPool/RequestQueue.h</h1><a href="_request_queue_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <a name="l00002"></a>00002 <span class="comment">// RequestQueue.h: interface for the ThreadPoolclass.</span><a name="l00003"></a>00003 <span class="comment">// Author - Alex.C.P (alexcpn@gmail.com)</span><a name="l00004"></a>00004 <span class="comment">// This class models the container Queue for the threadpool</span><a name="l00006"></a>00006 <span class="comment"></span><a name="l00007"></a>00007 <span class="preprocessor">#if !defined(REQUESTQUEUE__INCLUDED)</span><a name="l00008"></a><a class="code" href="_request_queue_8h.html#925a7cb75e24d4c865efabe8f5213548">00008</a> <span class="preprocessor"></span><span class="preprocessor">#define REQUESTQUEUE__INCLUDED</span><a name="l00009"></a>00009 <span class="preprocessor"></span><a name="l00010"></a>00010 <a name="l00011"></a>00011 <a name="l00012"></a>00012 <span class="preprocessor">#include &lt;list&gt;</span><a name="l00013"></a>00013 <span class="preprocessor">#include &lt;map&gt;</span><a name="l00014"></a>00014 <span class="preprocessor">#include &lt;queue&gt;</span><a name="l00015"></a>00015 <span class="preprocessor">#include "<a class="code" href="utility_8h.html">utility.h</a>"</span><a name="l00016"></a>00016 <a name="l00017"></a>00017 <span class="keyword">using namespace </span>std;<a name="l00018"></a>00018 <a name="l00019"></a>00019 <span class="keyword">namespace </span>PluginThreadPool<a name="l00020"></a>00020 {<a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;<a name="l00023"></a>00023 <a name="l00024"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html">00024</a> <span class="keyword">class </span><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html">CRequestQueue</a><a name="l00025"></a>00025 {<a name="l00026"></a>00026 <a name="l00027"></a>00027 <span class="keyword">private</span>:<a name="l00028"></a>00028 <a name="l00029"></a>00029 <span class="keyword">typedef</span> priority_queue&lt;Command&lt;T&gt;*,<span class="comment">//value type</span><a name="l00030"></a>00030                                                         deque&lt;Command&lt;T&gt;*&gt;,<span class="comment">//container type</span><a name="l00031"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#d49a3ed958c6597755027fab49bf0fc6">00031</a>                                                         <a class="code" href="class_plugin_thread_pool_1_1_command.html">Command&lt;T&gt;::Compare</a> &gt;  <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#d49a3ed958c6597755027fab49bf0fc6">REQUESTQUEUE</a>; <span class="comment">//(will not compile in vc7)</span><a name="l00032"></a>00032                                                         <span class="comment">//typename Command&lt;T&gt;::Compare &gt;  REQUESTQUEUE; //comapritor (will compile in VC7)</span><a name="l00033"></a>00033                                                         <a name="l00034"></a>00034     <a name="l00035"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#70b9d9d20d9c04baa597763a7317a391">00035</a>         <span class="keyword">typedef</span> <span class="keyword">typename</span> map&lt;long,REQUESTQUEUE &gt;::iterator <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#70b9d9d20d9c04baa597763a7317a391">REQUESTQUEUEITR</a>;<a name="l00036"></a>00036 <a name="l00037"></a>00037         <span class="comment">//todo make this a priority queue - priority_queue</span><a name="l00038"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">00038</a>         std::map&lt;long,REQUESTQUEUE &gt;  <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>;<a name="l00039"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">00039</a>         <span class="keyword">typename</span> std::map&lt;long,REQUESTQUEUE &gt;::iterator <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#bcc510d708c52458f733b67f30a2ea9c">CurrentItr</a>;<a name="l00040"></a>00040 <a name="l00041"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#8e7df6c99577dd95491de8ad43e0ae28">00041</a>         CRITICAL_SECTION <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#8e7df6c99577dd95491de8ad43e0ae28">critsec</a>;<a name="l00042"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">00042</a>         <span class="keywordtype">int</span>  <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">m_count</a>;<a name="l00043"></a>00043 <a name="l00044"></a>00044 <span class="keyword">public</span>:<a name="l00045"></a>00045 <a name="l00046"></a>00046         <span class="comment">//ctor</span><a name="l00047"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79d0b9047f46e45e8dad6d32f977822e">00047</a>         <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79d0b9047f46e45e8dad6d32f977822e">CRequestQueue</a>():<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#79f67eb418a33126d9e419955c21221d">m_count</a>(0)<a name="l00048"></a>00048         {<a name="l00049"></a>00049                         InitializeCriticalSection(&amp;<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#8e7df6c99577dd95491de8ad43e0ae28">critsec</a>);<a name="l00050"></a>00050                         <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="l00051"></a>00051         }<a name="l00052"></a>00052 <a name="l00053"></a>00053         <span class="comment">//dtor</span><a name="l00054"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#e0f362a5aa3dc5a399d8dc8197e73881">00054</a>         <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#e0f362a5aa3dc5a399d8dc8197e73881">~CRequestQueue</a>()<a name="l00055"></a>00055         {<a name="l00056"></a>00056                 DeleteCriticalSection(&amp;<a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#8e7df6c99577dd95491de8ad43e0ae28">critsec</a>);<a name="l00057"></a>00057         }<a name="l00058"></a>00058         <span class="comment">// Method invoked by the client through the ThreadPool proxy</span><a name="l00059"></a>00059         <span class="comment">// for inserting the created Command object</span><a name="l00060"></a><a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#c2bc040959a2e55b91789d4d69b5ba37">00060</a>         <span class="keywordtype">void</span> <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#c2bc040959a2e55b91789d4d69b5ba37">QueueRequest</a>(<a class="code" href="class_plugin_thread_pool_1_1_command.html">Command&lt;T&gt;</a>* cmdPtr)<a name="l00061"></a>00061         {<a name="l00062"></a>00062                 <span class="keywordflow">if</span>(cmdPtr==0)<a name="l00063"></a>00063                         <span class="keywordflow">return</span>;<a name="l00064"></a>00064                 <a name="l00065"></a>00065                 <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>);<a name="l00066"></a>00066 <a name="l00067"></a>00067                 <span class="comment">//Get the key associcated with this command</span><a name="l00068"></a>00068                 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> key = cmdPtr-&gt;<a class="code" href="class_plugin_thread_pool_1_1_command.html#febd44d2f529c23fe396c5b2b7b6371f">GetKey</a>();<a name="l00069"></a>00069 <a name="l00070"></a>00070                 <span class="comment">//Check if there exist an entry in the map</span><a name="l00071"></a>00071                 <a name="l00072"></a>00072                 <span class="comment">//printf("Trying to insert entry with key=%u\n",key);</span><a name="l00073"></a>00073 <a name="l00074"></a>00074                 <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#70b9d9d20d9c04baa597763a7317a391">REQUESTQUEUEITR</a> itr = <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.find(key);<a name="l00075"></a>00075                 <span class="keywordflow">if</span>(itr != <a class="code" href="class_plugin_thread_pool_1_1_c_request_queue.html#84ced633cb351487c2b426d7edb72dfc">RequestQueue</a>.end())<a name="l00076"></a>00076                 {<a name="l00077"></a>00077                         <span class="comment">//if yes get the associated queue and insert</span><a name="l00078"></a>00078         <span class="comment">//              printf("Entry Exisit, pushing to end of queue\n");</span><a name="l00079"></a>00079                         (*itr).second.push(cmdPtr);<a name="l00080"></a>00080 <a name="l00081"></a>00081                 }<a name="l00082"></a>00082                 <span class="keywordflow">else</span><a name="l00083"></a>00083                 {       <span class="comment">//else creare a queue and associate</span><a name="l00084"></a>00084 <span class="comment">//                      printf("Entry Does not Exisit, Creating a map entry\n");</span>

⌨️ 快捷键说明

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