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

📄 network_8cpp-source.html

📁 著名的密码库Crypto++的文档 C++语言的杰作。程序员必备。
💻 HTML
📖 第 1 页 / 共 5 页
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: network.cpp 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.5.2 --><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 class="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>network.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// network.cpp - written and placed in the public domain by Wei Dai</span><a name="l00002"></a>00002 <a name="l00003"></a>00003 <span class="preprocessor">#include "pch.h"</span><a name="l00004"></a>00004 <span class="preprocessor">#include "network.h"</span><a name="l00005"></a>00005 <span class="preprocessor">#include "wait.h"</span><a name="l00006"></a>00006 <a name="l00007"></a>00007 <span class="preprocessor">#define CRYPTOPP_TRACE_NETWORK 0</span><a name="l00008"></a>00008 <span class="preprocessor"></span><a name="l00009"></a>00009 NAMESPACE_BEGIN(CryptoPP)<a name="l00010"></a>00010 <a name="l00011"></a>00011 <span class="preprocessor">#ifdef HIGHRES_TIMER_AVAILABLE</span><a name="l00012"></a>00012 <span class="preprocessor"></span><a name="l00013"></a><a class="code" href="class_limited_bandwidth.html#619226f8c399a4e03c6685bfa3e5b40f">00013</a> lword <a class="code" href="class_limited_bandwidth.html#619226f8c399a4e03c6685bfa3e5b40f">LimitedBandwidth::ComputeCurrentTransceiveLimit</a>()<a name="l00014"></a>00014 {<a name="l00015"></a>00015         <span class="keywordflow">if</span> (!m_maxBytesPerSecond)<a name="l00016"></a>00016                 <span class="keywordflow">return</span> ULONG_MAX;<a name="l00017"></a>00017 <a name="l00018"></a>00018         <span class="keywordtype">double</span> curTime = GetCurTimeAndCleanUp();<a name="l00019"></a>00019         lword total = 0;<a name="l00020"></a>00020         <span class="keywordflow">for</span> (OpQueue::size_type i=0; i!=m_ops.size(); ++i)<a name="l00021"></a>00021                 total += m_ops[i].second;<a name="l00022"></a>00022         <span class="keywordflow">return</span> SaturatingSubtract(m_maxBytesPerSecond, total);<a name="l00023"></a>00023 }<a name="l00024"></a>00024 <a name="l00025"></a><a class="code" href="class_limited_bandwidth.html#ef86232b3bce4c5385f2a1137d63788f">00025</a> <span class="keywordtype">double</span> <a class="code" href="class_limited_bandwidth.html#ef86232b3bce4c5385f2a1137d63788f">LimitedBandwidth::TimeToNextTransceive</a>()<a name="l00026"></a>00026 {<a name="l00027"></a>00027         <span class="keywordflow">if</span> (!m_maxBytesPerSecond)<a name="l00028"></a>00028                 <span class="keywordflow">return</span> 0;<a name="l00029"></a>00029 <a name="l00030"></a>00030         <span class="keywordflow">if</span> (!m_nextTransceiveTime)<a name="l00031"></a>00031                 ComputeNextTransceiveTime();<a name="l00032"></a>00032 <a name="l00033"></a>00033         <span class="keywordflow">return</span> SaturatingSubtract(m_nextTransceiveTime, m_timer.<a class="code" href="class_timer_base.html#3262a9d0815f1899701ee83c3ef8cf43">ElapsedTimeAsDouble</a>());<a name="l00034"></a>00034 }<a name="l00035"></a>00035 <a name="l00036"></a><a class="code" href="class_limited_bandwidth.html#f5922e286ecf2d6cc9f1c018f5ca6871">00036</a> <span class="keywordtype">void</span> <a class="code" href="class_limited_bandwidth.html#f5922e286ecf2d6cc9f1c018f5ca6871">LimitedBandwidth::NoteTransceive</a>(lword size)<a name="l00037"></a>00037 {<a name="l00038"></a>00038         <span class="keywordflow">if</span> (m_maxBytesPerSecond)<a name="l00039"></a>00039         {<a name="l00040"></a>00040                 <span class="keywordtype">double</span> curTime = GetCurTimeAndCleanUp();<a name="l00041"></a>00041                 m_ops.push_back(std::make_pair(curTime, size));<a name="l00042"></a>00042                 m_nextTransceiveTime = 0;<a name="l00043"></a>00043         }<a name="l00044"></a>00044 }<a name="l00045"></a>00045 <a name="l00046"></a>00046 <span class="keywordtype">void</span> LimitedBandwidth::ComputeNextTransceiveTime()<a name="l00047"></a>00047 {<a name="l00048"></a>00048         <span class="keywordtype">double</span> curTime = GetCurTimeAndCleanUp();<a name="l00049"></a>00049         lword total = 0;<a name="l00050"></a>00050         <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0; i!=m_ops.size(); ++i)<a name="l00051"></a>00051                 total += m_ops[i].second;<a name="l00052"></a>00052         m_nextTransceiveTime =<a name="l00053"></a>00053                 (total &lt; m_maxBytesPerSecond) ? curTime : m_ops.front().first + 1000;<a name="l00054"></a>00054 }<a name="l00055"></a>00055 <a name="l00056"></a>00056 <span class="keywordtype">double</span> LimitedBandwidth::GetCurTimeAndCleanUp()<a name="l00057"></a>00057 {<a name="l00058"></a>00058         <span class="keywordflow">if</span> (!m_maxBytesPerSecond)<a name="l00059"></a>00059                 <span class="keywordflow">return</span> 0;<a name="l00060"></a>00060 <a name="l00061"></a>00061         <span class="keywordtype">double</span> curTime = m_timer.<a class="code" href="class_timer_base.html#3262a9d0815f1899701ee83c3ef8cf43">ElapsedTimeAsDouble</a>();<a name="l00062"></a>00062         <span class="keywordflow">while</span> (m_ops.size() &amp;&amp; (m_ops.front().first + 1000 &lt; curTime))<a name="l00063"></a>00063                 m_ops.pop_front();<a name="l00064"></a>00064         <span class="keywordflow">return</span> curTime;<a name="l00065"></a>00065 }<a name="l00066"></a>00066 <a name="l00067"></a><a class="code" href="class_limited_bandwidth.html#be3aabb618510d9629c1a65382fbfdb3">00067</a> <span class="keywordtype">void</span> <a class="code" href="class_limited_bandwidth.html#be3aabb618510d9629c1a65382fbfdb3">LimitedBandwidth::GetWaitObjects</a>(<a class="code" href="class_wait_object_container.html" title="container of wait objects">WaitObjectContainer</a> &amp;container, <span class="keyword">const</span> <a class="code" href="class_call_stack.html">CallStack</a> &amp;callStack)<a name="l00068"></a>00068 {<a name="l00069"></a>00069         <span class="keywordtype">double</span> nextTransceiveTime = <a class="code" href="class_limited_bandwidth.html#ef86232b3bce4c5385f2a1137d63788f">TimeToNextTransceive</a>();<a name="l00070"></a>00070         <span class="keywordflow">if</span> (nextTransceiveTime)<a name="l00071"></a>00071                 container.<a class="code" href="class_wait_object_container.html#75352b929764bdd4ce819e713a9df707">ScheduleEvent</a>(nextTransceiveTime, <a class="code" href="class_call_stack.html">CallStack</a>(<span class="stringliteral">"LimitedBandwidth::GetWaitObjects()"</span>, &amp;callStack));<a name="l00072"></a>00072 }<a name="l00073"></a>00073 <a name="l00074"></a>00074 <span class="comment">// *************************************************************</span><a name="l00075"></a>00075 <a name="l00076"></a><a class="code" href="class_nonblocking_source.html#942956a5be86ee85268285ccbcc1eda5">00076</a> <span class="keywordtype">size_t</span> <a class="code" href="class_nonblocking_source.html#942956a5be86ee85268285ccbcc1eda5" title="pump up to maxSize bytes using at most maxTime milliseconds">NonblockingSource::GeneralPump2</a>(<a name="l00077"></a>00077         lword&amp; byteCount, <span class="keywordtype">bool</span> blockingOutput,<a name="l00078"></a>00078         <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> maxTime, <span class="keywordtype">bool</span> checkDelimiter, byte delimiter)<a name="l00079"></a>00079 {<a name="l00080"></a>00080         m_blockedBySpeedLimit = <span class="keyword">false</span>;<a name="l00081"></a>00081 <a name="l00082"></a>00082         <span class="keywordflow">if</span> (!<a class="code" href="class_limited_bandwidth.html#6bd1d7ab2fd038e150e058a30700b989">GetMaxBytesPerSecond</a>())<a name="l00083"></a>00083         {<a name="l00084"></a>00084                 <span class="keywordtype">size_t</span> ret = DoPump(byteCount, blockingOutput, maxTime, checkDelimiter, delimiter);<a name="l00085"></a>00085                 m_doPumpBlocked = (ret != 0);<a name="l00086"></a>00086                 <span class="keywordflow">return</span> ret;<a name="l00087"></a>00087         }<a name="l00088"></a>00088 <a name="l00089"></a>00089         <span class="keywordtype">bool</span> forever = (maxTime == <a class="code" href="cryptlib_8h.html#5dc7a255dd813433eeee3152544c2f1d" title="used to represent infinite time">INFINITE_TIME</a>);<a name="l00090"></a>00090         <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> timeToGo = maxTime;<a name="l00091"></a>00091         <a class="code" href="class_timer.html" title="high resolution timer">Timer</a> timer(<a class="code" href="class_timer_base.html#ce15d479a8bb76027f1f572010f62fb99a21aebaffc991a16f40f070792f89bf">Timer::MILLISECONDS</a>, forever);

⌨️ 快捷键说明

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