﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-shootingstars</title><link>http://www.cppblog.com/shootingstars/</link><description /><language>zh-cn</language><lastBuildDate>Sat, 11 Apr 2026 17:07:36 GMT</lastBuildDate><pubDate>Sat, 11 Apr 2026 17:07:36 GMT</pubDate><ttl>60</ttl><item><title>[导入]C++中关于类中常数静态成员初始化的问题</title><link>http://www.cppblog.com/shootingstars/archive/2007/07/31/29071.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 31 Jul 2007 05:17:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/07/31/29071.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/29071.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/07/31/29071.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/29071.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/29071.html</trackback:ping><description><![CDATA[class mytestclass <br>{ <br>public: <br>&nbsp;&nbsp;&nbsp; const static int i = 5; <br>}; <br>int main() <br>{ <br>&nbsp;&nbsp;&nbsp; std::cout&lt;&lt;mytestclass::i&lt;&lt;std::endl; <br>&nbsp;&nbsp;&nbsp; return 0; <br>} <br>结果没有问题，输出为5（编译器为vc7.1）
<p>但是在下面这个例子中： <br>int regi() <br>{ <br>&nbsp;&nbsp;&nbsp; return 5; <br>} <br>class mytestclass <br>{ <br>public: <br>&nbsp;&nbsp;&nbsp; const static int i = regi(); <br>}; <br>int main() <br>{ <br>&nbsp;&nbsp;&nbsp; std::cout&lt;&lt;mytestclass::i&lt;&lt;std::endl; <br>&nbsp;&nbsp;&nbsp; return 0; <br>} <br>输出却不正确，输出为0（编译链接都没有问题）。。。 <br>似乎代码并没有执行regi函数？ <br><br>在C++标准中将初始化变量分为"动态初始化"和"静态初始化","动态初始化"为利用函数进行初始化,"静态初始化"为常量表达式进行初始化. <br>C++标准对于类中的常量表达式的"动态初始化"似乎并未做说明,所以是否支持类中常数静态变量的动态初始化也就取决与编译器的设计了. <br>但是无论如何vc7.1的编译结果都是不对的,它并没有给出错误,但是结果与逻辑不向符合,这应该是vc7.1的一个bug.(在vs2005中的C++编译器已经修正了这个bug,给出了一个编译Error) <br><br>详细讨论请见: <br><a href="http://community.csdn.net/Expert/topic/4432/4432789.xml?temp=.3202783">http://community.csdn.net/Expert/topic/4432/4432789.xml?temp=.3202783</a> <br><br>特别感谢qfeng_zhao 、 lxpws 、 iGray 等几位. </p>
<img src="http://www.cnblogs.com/shootingstars/aggbug/321956.html" height="1" width="1"><br><br>
<div align="right"><a style="text-decoration: none;" href="http://shootingstars.cnblogs.com/" target="_blank">shootingstars</a> 2006-01-23 11:46 <a href="http://www.cnblogs.com/shootingstars/archive/2006/01/23/321956.html#Feedback" target="_blank" style="text-decoration: none;">发表评论</a></div>
<br>文章来源:<a href="http://www.cnblogs.com/shootingstars/archive/2006/01/23/321956.html">http://www.cnblogs.com/shootingstars/archive/2006/01/23/321956.html</a> <img src ="http://www.cppblog.com/shootingstars/aggbug/29071.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-07-31 13:17 <a href="http://www.cppblog.com/shootingstars/archive/2007/07/31/29071.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>boost::regex学习</title><link>http://www.cppblog.com/shootingstars/archive/2007/07/30/29029.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Mon, 30 Jul 2007 09:30:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/07/30/29029.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/29029.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/07/30/29029.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/29029.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/29029.html</trackback:ping><description><![CDATA[一：编译<br>boost的正则表达式需要编译（如果不需要全部Boost的功能的话，请不要build all boost，那会花掉好几个小时。我推荐仅仅build需要的库就好。）<br>原有的boost 1.33似乎使用vc8编译的时候有问题。下载boost 1.34.1，使用&#8220;Visual Studio 2005 Command Prompt&#8221;，进入到boost_1_34_1\libs\regex\build：<br>nmake vc8.mak<br>OK，生成的文件在vc80下。<br><br>二：学习正则表达式<br><a title="http://www.cppblog.com/Files/shootingstars/deelx_zh.rar" href="http://www.cppblog.com/Files/shootingstars/deelx_zh.rar">http://www.cppblog.com/Files/shootingstars/deelx_zh.rar</a><br>不错的正则表达式的学习资料，顺便推荐一下：<br>http://www.regexlab.com/<br>这个站长还与我有个一信之缘（我写的<a title="P2P之UDP穿透NAT的原理与实现（附源代码）" href="http://www.cppblog.com/shootingstars/archive/2007/06/12/26140.html">P2P之UDP穿透NAT的原理与实现（附源代码）</a>）。站长的这个正则库在CodeProject获得了不错的评价。<br><br>三：简单的例子<br>&nbsp;&nbsp;&nbsp; std::string regstr = "a+";<br>&nbsp;&nbsp;&nbsp; boost::regex expression(regstr);<br>&nbsp;&nbsp;&nbsp; std::string testString = "aaa";<br><br>&nbsp;&nbsp;&nbsp; // 匹配至少一个a<br>&nbsp;&nbsp;&nbsp; if( boost::regex_match(testString, expression) )<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; std::cout&lt;&lt; "Match" &lt;&lt; std::endl;<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; else<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; std::cout&lt;&lt; "Not Match" &lt;&lt; std::endl;<br>&nbsp;&nbsp;&nbsp; }<br><span style="font-family: monospace;"></span>    <img src ="http://www.cppblog.com/shootingstars/aggbug/29029.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-07-30 17:30 <a href="http://www.cppblog.com/shootingstars/archive/2007/07/30/29029.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>boost::algorithm学习</title><link>http://www.cppblog.com/shootingstars/archive/2007/07/26/28813.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Thu, 26 Jul 2007 06:12:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/07/26/28813.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/28813.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/07/26/28813.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/28813.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/28813.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: boost::algorithm提供了很多字符串算法，包括：<br>大小写转换；<br>去除无效字符；<br>谓词；<br>查找；<br>删除/替换；<br>切割；<br>连接；<br>我们用写例子的方式来了解boost::algorithm能够为我们做些什么。&nbsp;&nbsp;<a href='http://www.cppblog.com/shootingstars/archive/2007/07/26/28813.html'>阅读全文</a><img src ="http://www.cppblog.com/shootingstars/aggbug/28813.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-07-26 14:12 <a href="http://www.cppblog.com/shootingstars/archive/2007/07/26/28813.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>是我rp不好，还是Microsoft的rp不好。。。</title><link>http://www.cppblog.com/shootingstars/archive/2007/06/19/26639.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 19 Jun 2007 09:26:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/06/19/26639.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/26639.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/06/19/26639.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/26639.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/26639.html</trackback:ping><description><![CDATA[程序原来一直跑的挺好的。。。<br>But从昨天下午开始，没有修改任何代码，编译程序，然后运行。。。报错，说什么buffer overrun错误。哦，以前遇到过类似情况，可能是动态库和lib文件不一致导致的。没关系，ReBuild整个项目（得稍微花点时间，呵呵，乘着这个机会，上网溜达会）。花了15分钟，Build完了。满怀信心的执行。。。啊，又报错了。。。还是同样的问题。嗯，想想，难道是Vss上面有人修改东西了，我无意间获取了最新版本？有这个可能。于是上Vss看Show History。似乎这几天代码都没有变化。。。那是什么问题？我就不信邪了，再次ReBuild，又是一个15分钟。运行，出错。啊。。。<br>于是上google搜索出错信息，嗯，有那边几页，不过看完了，要么是没有回复，要么跟我的情况牛头不对马嘴。嗯，看来这种情况还挺特殊，看来还得自力更生了。<br>于是删除所有代码，从Vss在下载最新的，再次ReBuild。嗯，编译没有错，运行。。。嗯，也不算有错，只不过一个第三方的库运行时报了个异常。这个。。。再次检查代码，没有发现问题。汗，于是出来了。。。<br><br>今天早上上班继续倒腾，这个Vss版本有问题，下个以前的Label的，应该不会有问题了吧。于是再次ReBuild，运行，这回不再是buffer overrun，也不是异常了，而是报heap corruption。我晕倒中。。。<br><br>在重新ReBuild了n回后，花了n个15分钟后。我彻底没辙了。于是我向上帝祈祷，神啊，救救我吧。<br><br>于是，神听到了，发出了它的神力，在我百般无赖，手足无措的时候，我再次下载的最新的Vss代码版本，ReBuild，于是运行通过。<br><br>嗯，唉，是我rp不好，还是Microsoft的rp不好（我用的VC8）。。。我无语，希望高人指点问题原因。<br><img src ="http://www.cppblog.com/shootingstars/aggbug/26639.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-19 17:26 <a href="http://www.cppblog.com/shootingstars/archive/2007/06/19/26639.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>五种迭代器</title><link>http://www.cppblog.com/shootingstars/archive/2007/06/13/26264.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Wed, 13 Jun 2007 10:35:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/06/13/26264.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/26264.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/06/13/26264.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/26264.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/26264.html</trackback:ping><description><![CDATA[1 InputIterator 可以被用来读取容器中的元素但是不保证支持向容器的写入操作<br>InputIterator 必须提供下列最小支持提供其他支持的iterator 也可被用作InputIterator 只要<br>它们满足这个最小要求集两个iterator 的相等和不相等测试通过operator ++ 的前置和<br>后置实例向前递增iterator 指向下一个元素通过解引用操作符operator * 读取一个元素<br>求在这个层次上提供支持的泛型算法包括find() accumulate()和equal() 任何一个算法如果<br>要求InputIterator 那么我们也可以向其传递第3 4 5 项列出的iterator 类别中的任一个<br><span style="font-weight: bold;">即：只要某个类实现上面的操作既可以被认为是InputIterator。</span><br>2 OutputIterator 可以被认为是与InputIterator 功能相反的iterator 即它可以被用来向容<br>器写入元素但是不保证支持读取容器的内容OutputIterator 一般被用作算法的第三个实参<br>标记出起始写入的位置例如copy()取OutputIterator 作为第三个实参任何一个算法如果<br>要求OutputIterator 那么我们也可以向其传递第3 4 5 项列出的iterator 类别中的任一个<br><span style="font-weight: bold;">注意：这个迭代器似乎仅仅实现了赋值操作即可
</span><br>3 ForwardIterator 可以被用来以某一个遍历方向是的下一个类别支持双向遍历向<br>容器读或写有些泛型算法至少要求ForwardIterator 包括adjacent_find() swap_range()和<br>replace() 当然任何要求ForwardIterator 支持的算法都可以向其传递第4 和5 项定义的iterator<br>类别<br><span style="font-weight: bold;">注意：这个迭代器既符合InputIterator又符合OutputIterator，同样下面两个也是这样。支持</span><span style="font-weight: bold;">operator++操作</span><br>4 BidirectionalIterator 从两个方向读或写一个容器有些泛型算法至少要求<br>BidirectionalIterator 包括inplace_merge() next_permutation()和reverse()<br><span style="font-weight: bold;">注意：继承1，2，3的特性，并且支持</span><span style="font-weight: bold;">operator--操作</span><br>5 RandomAccessIterator 除了支持BidirectionalIterator 所有的功能之外还提供了在<br>常数时间内访问容器的任意位置的支持要求RandomAccessIterator 支持的泛型算法包括<br>binary_search() sort_heap()和nth_element()
<br><span style="font-weight: bold;">注意：</span><span style="font-weight: bold;">继承1，2，3的特性，并且</span><span style="font-weight: bold;">符合随机访问策略，即支持operator[]操作</span><br>  <img src ="http://www.cppblog.com/shootingstars/aggbug/26264.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-13 18:35 <a href="http://www.cppblog.com/shootingstars/archive/2007/06/13/26264.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++泛型算法笔记（1）</title><link>http://www.cppblog.com/shootingstars/archive/2007/06/13/26263.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Wed, 13 Jun 2007 10:14:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/06/13/26263.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/26263.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/06/13/26263.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/26263.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/26263.html</trackback:ping><description><![CDATA[<span style="font-weight: bold;">find</span><br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">template&nbsp;</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">class</span><span style="color: #000000;">&nbsp;ForwardIterator,&nbsp;</span><span style="color: #0000ff;">class</span><span style="color: #000000;">&nbsp;Type&nbsp;</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br>ForwardIterator<br>find(&nbsp;ForwardIterator&nbsp;first,&nbsp;ForwardIterator&nbsp;last,&nbsp;Type&nbsp;value&nbsp;)</span><span style="color: #000000;"><br></span></div>
find返回一个迭代器，表明是否找到元素，如果找不到返回参数的last。<br>参数<br>first：开始搜索的第一个元素<br>last：搜索到此元素之前，不包括此元素<br>value：需要搜索的值<br><br><span style="font-weight: bold;">back_inserter</span><br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">template</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">class</span><span style="color: #000000;">&nbsp;_Container</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br>back_insert_iterator</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">_Container</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br>back_inserter(_Container</span><span style="color: #000000;">&amp;</span><span style="color: #000000;">&nbsp;_Cont)</span></div>
这个函数返回一个迭代器<span style="color: #000000;">back_insert_iterator</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">_Container</span><span style="color: #000000;">&gt;，这个迭代器是从OutputIterator继承过来的，表明这个迭代器可以被写入。这个迭代器重写了赋值操作，在赋值操作中使用push_back将元素插入容器中。<br>参数<br>_Cont：希望被插入值的容器<br><br><span style="font-weight: bold;">copy</span><br></span>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">template&nbsp;</span><span style="color: #000000;">&lt;</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">class</span><span style="color: #000000;">&nbsp;InputIterator,&nbsp;</span><span style="color: #0000ff;">class</span><span style="color: #000000;">&nbsp;OutputIterator&nbsp;</span><span style="color: #000000;">&gt;</span><span style="color: #000000;"><br>OutputIterator<br>copy(&nbsp;InputIterator&nbsp;first1,&nbsp;InputIterator&nbsp;last,<br>OutputIterator&nbsp;first2&nbsp;);</span></div>
这个函数返回一个OutputIterator迭代器<br>参数<br>first：开始拷贝的第一个元素<br>last：拷贝到此元素之前，不包括此元素<br>first2：拷贝到此迭代器。我们可以使用上面的back_inserter函数返回的OutputIterator
<br>  <img src ="http://www.cppblog.com/shootingstars/aggbug/26263.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-13 18:14 <a href="http://www.cppblog.com/shootingstars/archive/2007/06/13/26263.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>如何删除C++容器中的值</title><link>http://www.cppblog.com/shootingstars/archive/2007/06/12/26144.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 12 Jun 2007 09:37:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/06/12/26144.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/26144.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/06/12/26144.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/26144.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/26144.html</trackback:ping><description><![CDATA[C++的容器中一般都提供erase函数，此函数接收的参数一般有一个是一个迭代器：<br>如果删除某一个值的话，我们可能一般都用过：<br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">&nbsp;c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;todo&nbsp;insert&nbsp;items<img style="width: 30px; height: 20px;" src="http://www.cppblog.com/Images/dot.gif"></span><span style="color: #008000;"><br></span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">::iterator&nbsp;i&nbsp;</span><span style="color: #000000;">=</span><span style="color: #000000;">&nbsp;c.begin();&nbsp;i</span><span style="color: #000000;">!=</span><span style="color: #000000;">&nbsp;c.end();&nbsp;</span><span style="color: #000000;">++</span><span style="color: #000000;">i)<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>&nbsp;&nbsp;&nbsp;&nbsp;{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;如果有一个值大于10，删除之</span><span style="color: #008000;"><br></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c.erase(i);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">break</span><span style="color: #000000;">;<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>}<br></span></div>
上述代码在删除一个元素的时候并没有问题。。。但是我们想删除所有大于10的值，于是：<br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">&nbsp;c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;todo&nbsp;insert&nbsp;items</span><span style="color: #008000;"><br></span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">::iterator&nbsp;i&nbsp;</span><span style="color: #000000;">=</span><span style="color: #000000;">&nbsp;c.begin();&nbsp;i</span><span style="color: #000000;">!=</span><span style="color: #000000;">&nbsp;c.end();&nbsp;</span><span style="color: #000000;">++</span><span style="color: #000000;">i)<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>&nbsp;&nbsp;&nbsp;&nbsp;{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;删除所有大于10的值</span><span style="color: #008000;"><br></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c.erase(i);<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>}</span></div>
满怀希望的编译，运行。。。于是异常发生。。。<br>啊。。。哦。。。<br>原来是删除迭代器i后，i所指的元素已经失效了，然后给i++，它已经不在存在了。。。于是绞尽脑汁，出笼了下面的代码：<br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">&nbsp;c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;todo&nbsp;insert&nbsp;items</span><span style="color: #008000;"><br></span><span style="color: #000000;">list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">::iterator&nbsp;nextitr&nbsp;</span><span style="color: #000000;">=</span><span style="color: #000000;">&nbsp;c.begin();<br></span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">::iterator&nbsp;i&nbsp;</span><span style="color: #000000;">=</span><span style="color: #000000;">&nbsp;c.begin();;)<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">(nextitr&nbsp;</span><span style="color: #000000;">==</span><span style="color: #000000;">&nbsp;c.end())<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">break</span><span style="color: #000000;">;<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #000000;">++</span><span style="color: #000000;">nextitr;<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>&nbsp;&nbsp;&nbsp;&nbsp;{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;如果有一个值大于10，删除之</span><span style="color: #008000;"><br></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c.erase(i);<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>&nbsp;&nbsp;&nbsp;&nbsp;i&nbsp;</span><span style="color: #000000;">=</span><span style="color: #000000;">&nbsp;nextitr;<br>}<br></span></div>
上面的代码很容易理解，即在删除一个迭代器之前，把它的之后的迭代器先存储，然后在下次循环的时候利用之前存储的迭代器。<br>OK，我们看到上面这段代码可以工作了，行为似乎也还正确，只是。。。代码似乎多了点。我想代码能够少点就好了，逻辑也不要那么麻烦。那么我们看下面的代码（转载自Effective STL）。<br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">&nbsp;c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;todo&nbsp;insert&nbsp;items</span><span style="color: #008000;"></span><span style="color: #000000;"></span><span style="color: #000000;"><br></span><span style="color: #0000ff;">for</span><span style="color: #000000;">&nbsp;(list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">::iterator&nbsp;i&nbsp;</span><span style="color: #000000;">=</span><span style="color: #000000;">&nbsp;c.begin();&nbsp;i</span><span style="color: #000000;">!=</span><span style="color: #000000;">&nbsp;c.end();)<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">&nbsp;((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>&nbsp;&nbsp;&nbsp;&nbsp;{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;如果有一个值大于10，删除之</span><span style="color: #008000;"><br></span><span style="color: #000000;">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c.erase(i</span><span style="color: #000000;">++</span><span style="color: #000000;">);<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">else</span><span style="color: #000000;"><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;i</span><span style="color: #000000;">++</span><span style="color: #000000;">;<br>}<br></span></div>
嗯。。。高手就是高手（我以前根本没有在意过++i和i++在使用的过程中能有这么大的区别）<br>好了，最后再提供一个版本，利用list的remove_if函数。<br>
<div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #0000ff;">bool</span><span style="color: #000000;">&nbsp;fun(</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&nbsp;i)<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">if</span><span style="color: #000000;">(i</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">return</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">true</span><span style="color: #000000;">;<br>&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">else</span><span style="color: #000000;"><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000ff;">return</span><span style="color: #000000;">&nbsp;</span><span style="color: #0000ff;">false</span><span style="color: #000000;">;<br>}<br><br>list</span><span style="color: #000000;">&lt;</span><span style="color: #0000ff;">int</span><span style="color: #000000;">&gt;</span><span style="color: #000000;">&nbsp;c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;">&nbsp;todo&nbsp;insert&nbsp;items</span><span style="color: #008000;"><br></span><span style="color: #000000;">c.remove_if(fun);</span></div>
嗯，其实删除一个容器中的值的方式还是挺多的。<br>   <img src ="http://www.cppblog.com/shootingstars/aggbug/26144.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-12 17:37 <a href="http://www.cppblog.com/shootingstars/archive/2007/06/12/26144.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>P2P之UDP穿透NAT的原理与实现（附源代码）</title><link>http://www.cppblog.com/shootingstars/archive/2007/06/12/26140.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 12 Jun 2007 05:23:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2007/06/12/26140.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/26140.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2007/06/12/26140.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/26140.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/26140.html</trackback:ping><description><![CDATA[P2P之UDP穿透NAT的原理与实现（附源代码）<br>作者：shootingstars | 日期：2004-05-25 | 字体：大 中 小<br><br>P2P 之 UDP穿透NAT的原理与实现（附源代码）<br>原创：shootingstars<br>参考：http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt<br><br>论坛上经常有对P2P原理的讨论，但是讨论归讨论，很少有实质的东西产生（源代码）。呵呵，在这里我就用自己实现的一个源代码来说明UDP穿越NAT的原理。<br><br>首先先介绍一些基本概念：<br>&nbsp;&nbsp;&nbsp; NAT(Network Address Translators)，网络地址转换：网络地址转换是在IP地址日益缺乏的情况下产生的，它的主要目的就是为了能够地址重用。NAT分为两大类，基本的NAT和NAPT(Network Address/Port Translator)。<br>&nbsp;&nbsp;&nbsp; 最开始NAT是运行在路由器上的一个功能模块。<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; 最先提出的是基本的NAT，它的产生基于如下事实：一个私有网络（域）中的节点中只有很少的节点需要与外网连接（呵呵，这是在上世纪90年代中期提出的）。那么这个子网中其实只有少数的节点需要全球唯一的IP地址，其他的节点的IP地址应该是可以重用的。<br>&nbsp;&nbsp;&nbsp; 因此，基本的NAT实现的功能很简单，在子网内使用一个保留的IP子网段，这些IP对外是不可见的。子网内只有少数一些IP地址可以对应到真正全球唯一的 IP地址。如果这些节点需要访问外部网络，那么基本NAT就负责将这个节点的子网内IP转化为一个全球唯一的IP然后发送出去。(基本的NAT会改变IP 包中的原IP地址，但是不会改变IP包中的端口)<br>&nbsp;&nbsp;&nbsp; 关于基本的NAT可以参看RFC 1631<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; 另外一种NAT叫做NAPT，从名称上我们也可以看得出，NAPT不但会改变经过这个NAT设备的IP数据报的IP地址，还会改变IP数据报的 TCP/UDP端口。基本NAT的设备可能我们见的不多（呵呵，我没有见到过），NAPT才是我们真正讨论的主角。看下图：<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Server S1&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 18.181.0.31:1235&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ^&nbsp; Session 1 (A-S1)&nbsp; ^&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | <br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp; 18.181.0.31:1235&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; v 155.99.25.11:62000 v&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NAT<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 155.99.25.11<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ^&nbsp; Session 1 (A-S1)&nbsp; ^&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | <br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp; 18.181.0.31:1235&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | <br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; v&nbsp;&nbsp; 10.0.0.1:1234&nbsp;&nbsp;&nbsp; v&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | <br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Client A<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 10.0.0.1:1234<br>&nbsp;&nbsp;&nbsp; 有一个私有网络10.*.*.*，Client A是其中的一台计算机，这个网络的网关（一个NAT设备）的外网IP是155.99.25.11(应该还有一个内网的IP地址，比如 10.0.0.10)。如果Client A中的某个进程（这个进程创建了一个UDP Socket,这个Socket绑定1234端口）想访问外网主机18.181.0.31的1235端口，那么当数据包通过NAT时会发生什么事情呢？<br>&nbsp;&nbsp;&nbsp; 首先NAT会改变这个数据包的原IP地址，改为155.99.25.11。接着NAT会为这个传输创建一个Session（Session是一个抽象的概念，如果是TCP，也许Session是由一个SYN包开始，以一个FIN包结束。而UDP呢，以这个IP的这个端口的第一个UDP开始，结束呢，呵呵，也许是几分钟，也许是几小时，这要看具体的实现了）并且给这个Session分配一个端口，比如62000，然后改变这个数据包的源端口为62000。所以本来是（10.0.0.1:1234-&gt;18.181.0.31:1235）的数据包到了互联网上变为了（155.99.25.11:62000 -&gt;18.181.0.31:1235）。<br>&nbsp;&nbsp;&nbsp; 一旦NAT创建了一个Session后，NAT会记住62000端口对应的是10.0.0.1的1234端口，以后从18.181.0.31发送到 62000端口的数据会被NAT自动的转发到10.0.0.1上。（注意：这里是说18.181.0.31发送到62000端口的数据会被转发，其他的 IP发送到这个端口的数据将被NAT抛弃）这样Client A就与Server S1建立以了一个连接。<br><br>&nbsp;&nbsp;&nbsp; 呵呵，上面的基础知识可能很多人都知道了，那么下面是关键的部分了。<br>&nbsp;&nbsp;&nbsp; 看看下面的情况：<br>&nbsp;&nbsp;&nbsp; Server S1&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Server S2<br>&nbsp;18.181.0.31:1235&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 138.76.29.7:1235<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; +----------------------+----------------------+<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp; ^&nbsp; Session 1 (A-S1)&nbsp; ^&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ^&nbsp; Session 2 (A-S2)&nbsp; ^<br>&nbsp;&nbsp; |&nbsp; 18.181.0.31:1235&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp; 138.76.29.7:1235&nbsp; |<br>&nbsp;&nbsp; v 155.99.25.11:62000 v&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; v 155.99.25.11:62000 v<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Cone NAT<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 155.99.25.11<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp; ^&nbsp; Session 1 (A-S1)&nbsp; ^&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ^&nbsp; Session 2 (A-S2)&nbsp; ^<br>&nbsp;&nbsp; |&nbsp; 18.181.0.31:1235&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp; 138.76.29.7:1235&nbsp; |<br>&nbsp;&nbsp; v&nbsp;&nbsp; 10.0.0.1:1234&nbsp;&nbsp;&nbsp; v&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; v&nbsp;&nbsp; 10.0.0.1:1234&nbsp;&nbsp;&nbsp; v<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Client A<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 10.0.0.1:1234<br>&nbsp;&nbsp;&nbsp; 接上面的例子，如果Client A的原来那个Socket(绑定了1234端口的那个UDP Socket)又接着向另外一个Server S2发送了一个UDP包，那么这个UDP包在通过NAT时会怎么样呢？<br>&nbsp;&nbsp;&nbsp; 这时可能会有两种情况发生，一种是NAT再次创建一个Session，并且再次为这个Session分配一个端口号（比如：62001）。另外一种是 NAT再次创建一个Session，但是不会新分配一个端口号，而是用原来分配的端口号62000。前一种NAT叫做Symmetric NAT，后一种叫做Cone NAT。我们期望我们的NAT是第二种，呵呵，如果你的NAT刚好是第一种，那么很可能会有很多P2P软件失灵。（可以庆幸的是，现在绝大多数的NAT属于后者，即Cone NAT）<br>&nbsp; <br>&nbsp;&nbsp;&nbsp; 好了，我们看到，通过NAT,子网内的计算机向外连结是很容易的（NAT相当于透明的，子网内的和外网的计算机不用知道NAT的情况）。<br>&nbsp;&nbsp;&nbsp; 但是如果外部的计算机想访问子网内的计算机就比较困难了（而这正是P2P所需要的）。<br>&nbsp;&nbsp;&nbsp; 那么我们如果想从外部发送一个数据报给内网的计算机有什么办法呢？首先，我们必须在内网的NAT上打上一个&#8220;洞&#8221;（也就是前面我们说的在NAT上建立一个 Session），这个洞不能由外部来打，只能由内网内的主机来打。而且这个洞是有方向的，比如从内部某台主机（比如：192.168.0.10）向外部的某个IP(比如：219.237.60.1)发送一个UDP包，那么就在这个内网的NAT设备上打了一个方向为219.237.60.1的&#8220;洞&#8221;，（这就是称为UDP Hole Punching的技术）以后219.237.60.1就可以通过这个洞与内网的192.168.0.10联系了。（但是其他的IP不能利用这个洞）。<br><br>呵呵，现在该轮到我们的正题P2P了。有了上面的理论，实现两个内网的主机通讯就差最后一步了：那就是鸡生蛋还是蛋生鸡的问题了，两边都无法主动发出连接请求，谁也不知道谁的公网地址，那我们如何来打这个洞呢？我们需要一个中间人来联系这两个内网主机。<br>&nbsp;&nbsp;&nbsp; 现在我们来看看一个P2P软件的流程，以下图为例：<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Server S （219.237.60.1）<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;&nbsp; +----------------------+----------------------+<br>&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>&nbsp;NAT A (外网IP:202.187.45.3)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; NAT B (外网IP:187.34.1.56)<br>&nbsp;&nbsp; |&nbsp;&nbsp; (内网IP:192.168.0.1)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | (内网IP:192.168.0.1)<br>&nbsp;&nbsp; |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>Client A&nbsp; (192.168.0.20:4000)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Client B (192.168.0.10:40000)<br><br>&nbsp;&nbsp;&nbsp; 首先，Client A登录服务器，NAT A为这次的Session分配了一个端口60000，那么Server S收到的Client A的地址是202.187.45.3:60000，这就是Client A的外网地址了。同样，Client B登录Server S，NAT B给此次Session分配的端口是40000，那么Server S收到的B的地址是187.34.1.56:40000。<br>&nbsp;&nbsp;&nbsp; 此时，Client A与Client B都可以与Server S通信了。如果Client A此时想直接发送信息给Client B，那么他可以从Server S那儿获得B的公网地址187.34.1.56:40000，是不是Client A向这个地址发送信息Client B就能收到了呢？答案是不行，因为如果这样发送信息，NAT B会将这个信息丢弃（因为这样的信息是不请自来的，为了安全，大多数NAT都会执行丢弃动作）。现在我们需要的是在NAT B上打一个方向为202.187.45.3（即Client A的外网地址）的洞，那么Client A发送到187.34.1.56:40000的信息,Client B就能收到了。这个打洞命令由谁来发呢，呵呵，当然是Server S。<br>&nbsp;&nbsp;&nbsp; 总结一下这个过程：如果Client A想向Client B发送信息，那么Client A发送命令给Server S，请求Server S命令Client B向Client A方向打洞。呵呵，是不是很绕口，不过没关系，想一想就很清楚了，何况还有源代码呢（侯老师说过：在源代码面前没有秘密 8）），然后Client A就可以通过Client B的外网地址与Client B通信了。<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; 注意：以上过程只适合于Cone NAT的情况，如果是Symmetric NAT，那么当Client B向Client A打洞的端口已经重新分配了，Client B将无法知道这个端口（如果Symmetric NAT的端口是顺序分配的，那么我们或许可以猜测这个端口号，可是由于可能导致失败的因素太多，我们不推荐这种猜测端口的方法）。<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; 下面是一个模拟P2P聊天的过程的源代码，过程很简单，P2PServer运行在一个拥有公网IP的计算机上，P2PClient运行在两个不同的NAT 后（注意，如果两个客户端运行在一个NAT后，本程序很可能不能运行正常，这取决于你的NAT是否支持loopback translation，详见http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt，当然，此问题可以通过双方先尝试连接对方的内网IP来解决，但是这个代码只是为了验证原理，并没有处理这些问题），后登录的计算机可以获得先登录计算机的用户名，后登录的计算机通过send username message的格式来发送消息。如果发送成功，说明你已取得了直接与对方连接的成功。<br>&nbsp;&nbsp;&nbsp; 程序现在支持三个命令：send , getu , exit<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; send格式：send username message<br>&nbsp;&nbsp;&nbsp; 功能：发送信息给username<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; getu格式：getu<br>&nbsp;&nbsp;&nbsp; 功能：获得当前服务器用户列表<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; exit格式：exit<br>&nbsp;&nbsp;&nbsp; 功能：注销与服务器的连接（服务器不会自动监测客户是否吊线）<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; 代码很短，相信很容易懂，如果有什么问题，可以给我发邮件zhouhuis22@sina.com&nbsp; 或者在CSDN上发送短消息。同时，欢迎转发此文，但希望保留作者版权8-）。<br>&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; 最后感谢CSDN网友 PiggyXP 和 Seilfer的测试帮助<br><br>P2PServer.c<br><br>/* P2P 程序服务端<br>&nbsp;*<br>&nbsp;* 文件名：P2PServer.c<br>&nbsp;*<br>&nbsp;* 日期：2004-5-21<br>&nbsp;*<br>&nbsp;* 作者：shootingstars(zhouhuis22@sina.com)<br>&nbsp;*<br>&nbsp;*/<br>#pragma comment(lib, "ws2_32.lib")<br><br>#include "windows.h"<br>#include "..\proto.h"<br>#include "..\Exception.h"<br><br>UserList ClientList;<br><br>void InitWinSock()<br>{<br>&nbsp;WSADATA wsaData;<br><br>&nbsp;if (WSAStartup(MAKEWORD(2, 2), &amp;wsaData) != 0)<br>&nbsp;{<br>&nbsp; printf("Windows sockets 2.2 startup");<br>&nbsp; throw Exception("");<br>&nbsp;}<br>&nbsp;else{<br>&nbsp; printf("Using %s (Status: %s)\n",<br>&nbsp;&nbsp; wsaData.szDescription, wsaData.szSystemStatus);<br>&nbsp; printf("with API versions %d.%d to %d.%d\n\n",<br>&nbsp;&nbsp; LOBYTE(wsaData.wVersion), HIBYTE(wsaData.wVersion),<br>&nbsp;&nbsp; LOBYTE(wsaData.wHighVersion), HIBYTE(wsaData.wHighVersion));<br>&nbsp; <br>&nbsp;}<br>}<br><br>SOCKET mksock(int type)<br>{<br>&nbsp;SOCKET sock = socket(AF_INET, type, 0);<br>&nbsp;if (sock &lt; 0)<br>&nbsp;{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("create socket error");<br>&nbsp; throw Exception("");<br>&nbsp;}<br>&nbsp;return sock;<br>}<br><br>stUserListNode GetUser(char *username)<br>{<br>&nbsp;for(UserList::iterator UserIterator=ClientList.begin();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserIterator!=ClientList.end();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ++UserIterator)<br>&nbsp;{<br>&nbsp; if( strcmp( ((*UserIterator)-&gt;userName), username) == 0 )<br>&nbsp;&nbsp; return *(*UserIterator);<br>&nbsp;}<br>&nbsp;throw Exception("not find this user");<br>}<br><br>int main(int argc, char* argv[])<br>{<br>&nbsp;try{<br>&nbsp; InitWinSock();<br>&nbsp; <br>&nbsp; SOCKET PrimaryUDP;<br>&nbsp; PrimaryUDP = mksock(SOCK_DGRAM);<br><br>&nbsp; sockaddr_in local;<br>&nbsp; local.sin_family=AF_INET;<br>&nbsp; local.sin_port= htons(SERVER_PORT);<br>&nbsp; local.sin_addr.s_addr = htonl(INADDR_ANY);<br>&nbsp; int nResult=bind(PrimaryUDP,(sockaddr*)&amp;local,sizeof(sockaddr));<br>&nbsp; if(nResult==SOCKET_ERROR)<br>&nbsp;&nbsp; throw Exception("bind error");<br><br>&nbsp; sockaddr_in sender;<br>&nbsp; stMessage recvbuf;<br>&nbsp; memset(&amp;recvbuf,0,sizeof(stMessage));<br><br>&nbsp; // 开始主循环.<br>&nbsp; // 主循环负责下面几件事情:<br>&nbsp; // 一:读取客户端登陆和登出消息,记录客户列表<br>&nbsp; // 二:转发客户p2p请求<br>&nbsp; for(;;)<br>&nbsp; {<br>&nbsp;&nbsp; int dwSender = sizeof(sender);<br>&nbsp;&nbsp; int ret = recvfrom(PrimaryUDP, (char *)&amp;recvbuf, sizeof(stMessage), 0, (sockaddr *)&amp;sender, &amp;dwSender);<br>&nbsp;&nbsp; if(ret &lt;= 0)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; printf("recv error");<br>&nbsp;&nbsp;&nbsp; continue;<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; else<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; int messageType = recvbuf.iMessageType;<br>&nbsp;&nbsp;&nbsp; switch(messageType){<br>&nbsp;&nbsp;&nbsp; case LOGIN:<br>&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; //&nbsp; 将这个用户的信息记录到用户列表中<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("has a user login : %s\n", recvbuf.message.loginmember.userName);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; stUserListNode *currentuser = new stUserListNode();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; strcpy(currentuser-&gt;userName, recvbuf.message.loginmember.userName);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; currentuser-&gt;ip = ntohl(sender.sin_addr.S_un.S_addr);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; currentuser-&gt;port = ntohs(sender.sin_port);<br>&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ClientList.push_back(currentuser);<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 发送已经登陆的客户信息<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; int nodecount = (int)ClientList.size();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char*)&amp;nodecount, sizeof(int), 0, (const sockaddr*)&amp;sender, sizeof(sender));<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for(UserList::iterator UserIterator=ClientList.begin();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserIterator!=ClientList.end();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ++UserIterator)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char*)(*UserIterator), sizeof(stUserListNode), 0, (const sockaddr*)&amp;sender, sizeof(sender));<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; case LOGOUT:<br>&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 将此客户信息删除<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("has a user logout : %s\n", recvbuf.message.logoutmember.userName);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserList::iterator removeiterator = NULL;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for(UserList::iterator UserIterator=ClientList.begin();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserIterator!=ClientList.end();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ++UserIterator)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if( strcmp( ((*UserIterator)-&gt;userName), recvbuf.message.logoutmember.userName) == 0 )<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; removeiterator = UserIterator;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if(removeiterator != NULL)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ClientList.remove(*removeiterator);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; case P2PTRANS:<br>&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 某个客户希望服务端向另外一个客户发送一个打洞消息<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("%s wants to p2p %s\n",inet_ntoa(sender.sin_addr),recvbuf.message.translatemessage.userName);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; stUserListNode node = GetUser(recvbuf.message.translatemessage.userName);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sockaddr_in remote;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; remote.sin_family=AF_INET;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; remote.sin_port= htons(node.port);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; remote.sin_addr.s_addr = htonl(node.ip);<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; in_addr tmp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; tmp.S_un.S_addr = htonl(node.ip);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("the address is %s,and port is %d\n",inet_ntoa(tmp), node.port);<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; stP2PMessage transMessage;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; transMessage.iMessageType = P2PSOMEONEWANTTOCALLYOU;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; transMessage.iStringLen = ntohl(sender.sin_addr.S_un.S_addr);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; transMessage.Port = ntohs(sender.sin_port);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP,(const char*)&amp;transMessage, sizeof(transMessage), 0, (const sockaddr *)&amp;remote, sizeof(remote));<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; case GETALLUSER:<br>&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; int command = GETALLUSER;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char*)&amp;command, sizeof(int), 0, (const sockaddr*)&amp;sender, sizeof(sender));<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; int nodecount = (int)ClientList.size();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char*)&amp;nodecount, sizeof(int), 0, (const sockaddr*)&amp;sender, sizeof(sender));<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for(UserList::iterator UserIterator=ClientList.begin();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserIterator!=ClientList.end();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ++UserIterator)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char*)(*UserIterator), sizeof(stUserListNode), 0, (const sockaddr*)&amp;sender, sizeof(sender));<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp; }<br>&nbsp; }<br><br>&nbsp;}<br>&nbsp;catch(Exception &amp;e)<br>&nbsp;{<br>&nbsp; printf(e.GetMessage());<br>&nbsp; return 1;<br>&nbsp;}<br><br>&nbsp;return 0;<br>}<br><br>/* P2P 程序客户端<br>&nbsp;*<br>&nbsp;* 文件名：P2PClient.c<br>&nbsp;*<br>&nbsp;* 日期：2004-5-21<br>&nbsp;*<br>&nbsp;* 作者：shootingstars(zhouhuis22@sina.com)<br>&nbsp;*<br>&nbsp;*/<br><br>#pragma comment(lib,"ws2_32.lib")<br><br>#include "windows.h"<br>#include "..\proto.h"<br>#include "..\Exception.h"<br>#include &lt;iostream&gt;<br>using namespace std;<br><br>UserList ClientList;<br><br>&nbsp;<br><br>#define COMMANDMAXC 256<br>#define MAXRETRY&nbsp;&nbsp;&nbsp; 5<br><br>SOCKET PrimaryUDP;<br>char UserName[10];<br>char ServerIP[20];<br><br>bool RecvedACK;<br><br>void InitWinSock()<br>{<br>&nbsp;WSADATA wsaData;<br><br>&nbsp;if (WSAStartup(MAKEWORD(2, 2), &amp;wsaData) != 0)<br>&nbsp;{<br>&nbsp; printf("Windows sockets 2.2 startup");<br>&nbsp; throw Exception("");<br>&nbsp;}<br>&nbsp;else{<br>&nbsp; printf("Using %s (Status: %s)\n",<br>&nbsp;&nbsp; wsaData.szDescription, wsaData.szSystemStatus);<br>&nbsp; printf("with API versions %d.%d to %d.%d\n\n",<br>&nbsp;&nbsp; LOBYTE(wsaData.wVersion), HIBYTE(wsaData.wVersion),<br>&nbsp;&nbsp; LOBYTE(wsaData.wHighVersion), HIBYTE(wsaData.wHighVersion));<br>&nbsp;}<br>}<br><br>SOCKET mksock(int type)<br>{<br>&nbsp;SOCKET sock = socket(AF_INET, type, 0);<br>&nbsp;if (sock &lt; 0)<br>&nbsp;{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; printf("create socket error");<br>&nbsp; throw Exception("");<br>&nbsp;}<br>&nbsp;return sock;<br>}<br><br>stUserListNode GetUser(char *username)<br>{<br>&nbsp;for(UserList::iterator UserIterator=ClientList.begin();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserIterator!=ClientList.end();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ++UserIterator)<br>&nbsp;{<br>&nbsp; if( strcmp( ((*UserIterator)-&gt;userName), username) == 0 )<br>&nbsp;&nbsp; return *(*UserIterator);<br>&nbsp;}<br>&nbsp;throw Exception("not find this user");<br>}<br><br>void BindSock(SOCKET sock)<br>{<br>&nbsp;sockaddr_in sin;<br>&nbsp;sin.sin_addr.S_un.S_addr = INADDR_ANY;<br>&nbsp;sin.sin_family = AF_INET;<br>&nbsp;sin.sin_port = 0;<br>&nbsp;<br>&nbsp;if (bind(sock, (struct sockaddr*)&amp;sin, sizeof(sin)) &lt; 0)<br>&nbsp; throw Exception("bind error");<br>}<br><br>void ConnectToServer(SOCKET sock,char *username, char *serverip)<br>{<br>&nbsp;sockaddr_in remote;<br>&nbsp;remote.sin_addr.S_un.S_addr = inet_addr(serverip);<br>&nbsp;remote.sin_family = AF_INET;<br>&nbsp;remote.sin_port = htons(SERVER_PORT);<br>&nbsp;<br>&nbsp;stMessage sendbuf;<br>&nbsp;sendbuf.iMessageType = LOGIN;<br>&nbsp;strncpy(sendbuf.message.loginmember.userName, username, 10);<br><br>&nbsp;sendto(sock, (const char*)&amp;sendbuf, sizeof(sendbuf), 0, (const sockaddr*)&amp;remote,sizeof(remote));<br><br>&nbsp;int usercount;<br>&nbsp;int fromlen = sizeof(remote);<br>&nbsp;int iread = recvfrom(sock, (char *)&amp;usercount, sizeof(int), 0, (sockaddr *)&amp;remote, &amp;fromlen);<br>&nbsp;if(iread&lt;=0)<br>&nbsp;{<br>&nbsp; throw Exception("Login error\n");<br>&nbsp;}<br><br>&nbsp;// 登录到服务端后，接收服务端发来的已经登录的用户的信息<br>&nbsp;cout&lt;&lt;"Have "&lt;&lt;usercount&lt;&lt;" users logined server:"&lt;&lt;endl;<br>&nbsp;for(int i = 0;i&lt;usercount;i++)<br>&nbsp;{<br>&nbsp; stUserListNode *node = new stUserListNode;<br>&nbsp; recvfrom(sock, (char*)node, sizeof(stUserListNode), 0, (sockaddr *)&amp;remote, &amp;fromlen);<br>&nbsp; ClientList.push_back(node);<br>&nbsp; cout&lt;&lt;"Username:"&lt;&lt;node-&gt;userName&lt;&lt;endl;<br>&nbsp; in_addr tmp;<br>&nbsp; tmp.S_un.S_addr = htonl(node-&gt;ip);<br>&nbsp; cout&lt;&lt;"UserIP:"&lt;&lt;inet_ntoa(tmp)&lt;&lt;endl;<br>&nbsp; cout&lt;&lt;"UserPort:"&lt;&lt;node-&gt;port&lt;&lt;endl;<br>&nbsp; cout&lt;&lt;""&lt;&lt;endl;<br>&nbsp;}<br>}<br><br>void OutputUsage()<br>{<br>&nbsp;cout&lt;&lt;"You can input you command:\n"<br>&nbsp; &lt;&lt;"Command Type:\"send\",\"exit\",\"getu\"\n"<br>&nbsp; &lt;&lt;"Example : send Username Message\n"<br>&nbsp; &lt;&lt;"&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; exit\n"<br>&nbsp; &lt;&lt;"&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; getu\n"<br>&nbsp; &lt;&lt;endl;<br>}<br><br>/* 这是主要的函数：发送一个消息给某个用户(C)<br>&nbsp;*流程：直接向某个用户的外网IP发送消息，如果此前没有联系过<br>&nbsp;*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 那么此消息将无法发送，发送端等待超时。<br>&nbsp;*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 超时后，发送端将发送一个请求信息到服务端，<br>&nbsp;*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 要求服务端发送给客户C一个请求，请求C给本机发送打洞消息<br>&nbsp;*&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 以上流程将重复MAXRETRY次<br>&nbsp;*/<br>bool SendMessageTo(char *UserName, char *Message)<br>{<br>&nbsp;char realmessage[256];<br>&nbsp;unsigned int UserIP;<br>&nbsp;unsigned short UserPort;<br>&nbsp;bool FindUser = false;<br>&nbsp;for(UserList::iterator UserIterator=ClientList.begin();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; UserIterator!=ClientList.end();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ++UserIterator)<br>&nbsp;{<br>&nbsp; if( strcmp( ((*UserIterator)-&gt;userName), UserName) == 0 )<br>&nbsp; {<br>&nbsp;&nbsp; UserIP = (*UserIterator)-&gt;ip;<br>&nbsp;&nbsp; UserPort = (*UserIterator)-&gt;port;<br>&nbsp;&nbsp; FindUser = true;<br>&nbsp; }<br>&nbsp;}<br><br>&nbsp;if(!FindUser)<br>&nbsp; return false;<br><br>&nbsp;strcpy(realmessage, Message);<br>&nbsp;for(int i=0;i&lt;MAXRETRY;i++)<br>&nbsp;{<br>&nbsp; RecvedACK = false;<br><br>&nbsp; sockaddr_in remote;<br>&nbsp; remote.sin_addr.S_un.S_addr = htonl(UserIP);<br>&nbsp; remote.sin_family = AF_INET;<br>&nbsp; remote.sin_port = htons(UserPort);<br>&nbsp; stP2PMessage MessageHead;<br>&nbsp; MessageHead.iMessageType = P2PMESSAGE;<br>&nbsp; MessageHead.iStringLen = (int)strlen(realmessage)+1;<br>&nbsp; int isend = sendto(PrimaryUDP, (const char *)&amp;MessageHead, sizeof(MessageHead), 0, (const sockaddr*)&amp;remote, sizeof(remote));<br>&nbsp; isend = sendto(PrimaryUDP, (const char *)&amp;realmessage, MessageHead.iStringLen, 0, (const sockaddr*)&amp;remote, sizeof(remote));<br>&nbsp; <br>&nbsp; // 等待接收线程将此标记修改<br>&nbsp; for(int j=0;j&lt;10;j++)<br>&nbsp; {<br>&nbsp;&nbsp; if(RecvedACK)<br>&nbsp;&nbsp;&nbsp; return true;<br>&nbsp;&nbsp; else<br>&nbsp;&nbsp;&nbsp; Sleep(300);<br>&nbsp; }<br><br>&nbsp; // 没有接收到目标主机的回应，认为目标主机的端口映射没有<br>&nbsp; // 打开，那么发送请求信息给服务器，要服务器告诉目标主机<br>&nbsp; // 打开映射端口（UDP打洞）<br>&nbsp; sockaddr_in server;<br>&nbsp; server.sin_addr.S_un.S_addr = inet_addr(ServerIP);<br>&nbsp; server.sin_family = AF_INET;<br>&nbsp; server.sin_port = htons(SERVER_PORT);<br>&nbsp;<br>&nbsp; stMessage transMessage;<br>&nbsp; transMessage.iMessageType = P2PTRANS;<br>&nbsp; strcpy(transMessage.message.translatemessage.userName, UserName);<br><br>&nbsp; sendto(PrimaryUDP, (const char*)&amp;transMessage, sizeof(transMessage), 0, (const sockaddr*)&amp;server, sizeof(server));<br>&nbsp; Sleep(100);// 等待对方先发送信息。<br>&nbsp;}<br>&nbsp;return false;<br>}<br><br>// 解析命令，暂时只有exit和send命令<br>// 新增getu命令，获取当前服务器的所有用户<br>void ParseCommand(char * CommandLine)<br>{<br>&nbsp;if(strlen(CommandLine)&lt;4)<br>&nbsp; return;<br>&nbsp;char Command[10];<br>&nbsp;strncpy(Command, CommandLine, 4);<br>&nbsp;Command[4]='\0';<br><br>&nbsp;if(strcmp(Command,"exit")==0)<br>&nbsp;{<br>&nbsp; stMessage sendbuf;<br>&nbsp; sendbuf.iMessageType = LOGOUT;<br>&nbsp; strncpy(sendbuf.message.logoutmember.userName, UserName, 10);<br>&nbsp; sockaddr_in server;<br>&nbsp; server.sin_addr.S_un.S_addr = inet_addr(ServerIP);<br>&nbsp; server.sin_family = AF_INET;<br>&nbsp; server.sin_port = htons(SERVER_PORT);<br><br>&nbsp; sendto(PrimaryUDP,(const char*)&amp;sendbuf, sizeof(sendbuf), 0, (const sockaddr *)&amp;server, sizeof(server));<br>&nbsp; shutdown(PrimaryUDP, 2);<br>&nbsp; closesocket(PrimaryUDP);<br>&nbsp; exit(0);<br>&nbsp;}<br>&nbsp;else if(strcmp(Command,"send")==0)<br>&nbsp;{<br>&nbsp; char sendname[20];<br>&nbsp; char message[COMMANDMAXC];<br>&nbsp; int i;<br>&nbsp; for(i=5;;i++)<br>&nbsp; {<br>&nbsp;&nbsp; if(CommandLine[i]!=' ')<br>&nbsp;&nbsp;&nbsp; sendname[i-5]=CommandLine[i];<br>&nbsp;&nbsp; else<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; sendname[i-5]='\0';<br>&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp; }<br>&nbsp; }<br>&nbsp; strcpy(message, &amp;(CommandLine[i+1]));<br>&nbsp; if(SendMessageTo(sendname, message))<br>&nbsp;&nbsp; printf("Send OK!\n");<br>&nbsp; else<br>&nbsp;&nbsp; printf("Send Failure!\n");<br>&nbsp;}<br>&nbsp;else if(strcmp(Command,"getu")==0)<br>&nbsp;{<br>&nbsp; int command = GETALLUSER;<br>&nbsp; sockaddr_in server;<br>&nbsp; server.sin_addr.S_un.S_addr = inet_addr(ServerIP);<br>&nbsp; server.sin_family = AF_INET;<br>&nbsp; server.sin_port = htons(SERVER_PORT);<br><br>&nbsp; sendto(PrimaryUDP,(const char*)&amp;command, sizeof(command), 0, (const sockaddr *)&amp;server, sizeof(server));<br>&nbsp;}<br>}<br><br>// 接受消息线程<br>DWORD WINAPI RecvThreadProc(LPVOID lpParameter)<br>{<br>&nbsp;sockaddr_in remote;<br>&nbsp;int sinlen = sizeof(remote);<br>&nbsp;stP2PMessage recvbuf;<br>&nbsp;for(;;)<br>&nbsp;{<br>&nbsp; int iread = recvfrom(PrimaryUDP, (char *)&amp;recvbuf, sizeof(recvbuf), 0, (sockaddr *)&amp;remote, &amp;sinlen);<br>&nbsp; if(iread&lt;=0)<br>&nbsp; {<br>&nbsp;&nbsp; printf("recv error\n");<br>&nbsp;&nbsp; continue;<br>&nbsp; }<br>&nbsp; switch(recvbuf.iMessageType)<br>&nbsp; {<br>&nbsp; case P2PMESSAGE:<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; // 接收到P2P的消息<br>&nbsp;&nbsp;&nbsp; char *comemessage= new char[recvbuf.iStringLen];<br>&nbsp;&nbsp;&nbsp; int iread1 = recvfrom(PrimaryUDP, comemessage, 256, 0, (sockaddr *)&amp;remote, &amp;sinlen);<br>&nbsp;&nbsp;&nbsp; comemessage[iread1-1] = '\0';<br>&nbsp;&nbsp;&nbsp; if(iread1&lt;=0)<br>&nbsp;&nbsp;&nbsp;&nbsp; throw Exception("Recv Message Error\n");<br>&nbsp;&nbsp;&nbsp; else<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; printf("Recv a Message:%s\n",comemessage);<br>&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp; stP2PMessage sendbuf;<br>&nbsp;&nbsp;&nbsp;&nbsp; sendbuf.iMessageType = P2PMESSAGEACK;<br>&nbsp;&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char*)&amp;sendbuf, sizeof(sendbuf), 0, (const sockaddr*)&amp;remote, sizeof(remote));<br>&nbsp;&nbsp;&nbsp; }<br><br>&nbsp;&nbsp;&nbsp; delete []comemessage;<br>&nbsp;&nbsp;&nbsp; break;<br><br>&nbsp;&nbsp; }<br>&nbsp; case P2PSOMEONEWANTTOCALLYOU:<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; // 接收到打洞命令，向指定的IP地址打洞<br>&nbsp;&nbsp;&nbsp; printf("Recv p2someonewanttocallyou data\n");<br>&nbsp;&nbsp;&nbsp; sockaddr_in remote;<br>&nbsp;&nbsp;&nbsp; remote.sin_addr.S_un.S_addr = htonl(recvbuf.iStringLen);<br>&nbsp;&nbsp;&nbsp; remote.sin_family = AF_INET;<br>&nbsp;&nbsp;&nbsp; remote.sin_port = htons(recvbuf.Port);<br><br>&nbsp;&nbsp;&nbsp; // UDP hole punching<br>&nbsp;&nbsp;&nbsp; stP2PMessage message;<br>&nbsp;&nbsp;&nbsp; message.iMessageType = P2PTRASH;<br>&nbsp;&nbsp;&nbsp; sendto(PrimaryUDP, (const char *)&amp;message, sizeof(message), 0, (const sockaddr*)&amp;remote, sizeof(remote));<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp; }<br>&nbsp; case P2PMESSAGEACK:<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; // 发送消息的应答<br>&nbsp;&nbsp;&nbsp; RecvedACK = true;<br>&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp; }<br>&nbsp; case P2PTRASH:<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; // 对方发送的打洞消息，忽略掉。<br>&nbsp;&nbsp;&nbsp; //do nothing ...<br>&nbsp;&nbsp;&nbsp; printf("Recv p2ptrash data\n");<br>&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp; }<br>&nbsp; case GETALLUSER:<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; int usercount;<br>&nbsp;&nbsp;&nbsp; int fromlen = sizeof(remote);<br>&nbsp;&nbsp;&nbsp; int iread = recvfrom(PrimaryUDP, (char *)&amp;usercount, sizeof(int), 0, (sockaddr *)&amp;remote, &amp;fromlen);<br>&nbsp;&nbsp;&nbsp; if(iread&lt;=0)<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; throw Exception("Login error\n");<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp; &nbsp;<br>&nbsp;&nbsp;&nbsp; ClientList.clear();<br><br>&nbsp;&nbsp;&nbsp; cout&lt;&lt;"Have "&lt;&lt;usercount&lt;&lt;" users logined server:"&lt;&lt;endl;<br>&nbsp;&nbsp;&nbsp; for(int i = 0;i&lt;usercount;i++)<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; stUserListNode *node = new stUserListNode;<br>&nbsp;&nbsp;&nbsp;&nbsp; recvfrom(PrimaryUDP, (char*)node, sizeof(stUserListNode), 0, (sockaddr *)&amp;remote, &amp;fromlen);<br>&nbsp;&nbsp;&nbsp;&nbsp; ClientList.push_back(node);<br>&nbsp;&nbsp;&nbsp;&nbsp; cout&lt;&lt;"Username:"&lt;&lt;node-&gt;userName&lt;&lt;endl;<br>&nbsp;&nbsp;&nbsp;&nbsp; in_addr tmp;<br>&nbsp;&nbsp;&nbsp;&nbsp; tmp.S_un.S_addr = htonl(node-&gt;ip);<br>&nbsp;&nbsp;&nbsp;&nbsp; cout&lt;&lt;"UserIP:"&lt;&lt;inet_ntoa(tmp)&lt;&lt;endl;<br>&nbsp;&nbsp;&nbsp;&nbsp; cout&lt;&lt;"UserPort:"&lt;&lt;node-&gt;port&lt;&lt;endl;<br>&nbsp;&nbsp;&nbsp;&nbsp; cout&lt;&lt;""&lt;&lt;endl;<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; break;<br>&nbsp;&nbsp; }<br>&nbsp; }<br>&nbsp;}<br>}<br><br><br>int main(int argc, char* argv[])<br>{<br>&nbsp;try<br>&nbsp;{<br>&nbsp; InitWinSock();<br>&nbsp; <br>&nbsp; PrimaryUDP = mksock(SOCK_DGRAM);<br>&nbsp; BindSock(PrimaryUDP);<br><br>&nbsp; cout&lt;&lt;"Please input server ip:";<br>&nbsp; cin&gt;&gt;ServerIP;<br><br>&nbsp; cout&lt;&lt;"Please input your name:";<br>&nbsp; cin&gt;&gt;UserName;<br><br>&nbsp; ConnectToServer(PrimaryUDP, UserName, ServerIP);<br><br>&nbsp; HANDLE threadhandle = CreateThread(NULL, 0, RecvThreadProc, NULL, NULL, NULL);<br>&nbsp; CloseHandle(threadhandle);<br>&nbsp; OutputUsage();<br><br>&nbsp; for(;;)<br>&nbsp; {<br>&nbsp;&nbsp; char Command[COMMANDMAXC];<br>&nbsp;&nbsp; gets(Command);<br>&nbsp;&nbsp; ParseCommand(Command);<br>&nbsp; }<br>&nbsp;}<br>&nbsp;catch(Exception &amp;e)<br>&nbsp;{<br>&nbsp; printf(e.GetMessage());<br>&nbsp; return 1;<br>&nbsp;}<br>&nbsp;return 0;<br>}<br><br>/* 异常类<br>&nbsp;*<br>&nbsp;* 文件名：Exception.h<br>&nbsp;*<br>&nbsp;* 日期：2004.5.5<br>&nbsp;*<br>&nbsp;* 作者：shootingstars(zhouhuis22@sina.com)<br>&nbsp;*/<br><br>#ifndef __HZH_Exception__<br>#define __HZH_Exception__<br><br>#define EXCEPTION_MESSAGE_MAXLEN 256<br>#include "string.h"<br><br>class Exception<br>{<br>private:<br>&nbsp;char m_ExceptionMessage[EXCEPTION_MESSAGE_MAXLEN];<br>public:<br>&nbsp;Exception(char *msg)<br>&nbsp;{<br>&nbsp; strncpy(m_ExceptionMessage, msg, EXCEPTION_MESSAGE_MAXLEN);<br>&nbsp;}<br><br>&nbsp;char *GetMessage()<br>&nbsp;{<br>&nbsp; return m_ExceptionMessage;<br>&nbsp;}<br>};<br><br>#endif<br><br>/* P2P 程序传输协议<br>&nbsp;*<br>&nbsp;* 日期：2004-5-21<br>&nbsp;*<br>&nbsp;* 作者：shootingstars(zhouhuis22@sina.com)<br>&nbsp;*<br>&nbsp;*/<br><br>#pragma once<br>#include &lt;list&gt;<br><br>// 定义iMessageType的值<br>#define LOGIN 1<br>#define LOGOUT 2<br>#define P2PTRANS 3<br>#define GETALLUSER&nbsp; 4<br><br>// 服务器端口<br>#define SERVER_PORT 2280<br><br>// Client登录时向服务器发送的消息<br>struct stLoginMessage<br>{<br>&nbsp;char userName[10];<br>&nbsp;char password[10];<br>};<br><br>// Client注销时发送的消息<br>struct stLogoutMessage<br>{<br>&nbsp;char userName[10];<br>};<br><br>// Client向服务器请求另外一个Client(userName)向自己方向发送UDP打洞消息<br>struct stP2PTranslate<br>{<br>&nbsp;char userName[10];<br>};<br><br>// Client向服务器发送的消息格式<br>struct stMessage<br>{<br>&nbsp;int iMessageType;<br>&nbsp;union _message<br>&nbsp;{<br>&nbsp; stLoginMessage loginmember;<br>&nbsp; stLogoutMessage logoutmember;<br>&nbsp; stP2PTranslate translatemessage;<br>&nbsp;}message;<br>};<br><br>// 客户节点信息<br>struct stUserListNode<br>{<br>&nbsp;char userName[10];<br>&nbsp;unsigned int ip;<br>&nbsp;unsigned short port;<br>};<br><br>// Server向Client发送的消息<br>struct stServerToClient<br>{<br>&nbsp;int iMessageType;<br>&nbsp;union _message<br>&nbsp;{<br>&nbsp; stUserListNode user;<br>&nbsp;}message;<br><br>};<br><br>//======================================<br>// 下面的协议用于客户端之间的通信<br>//======================================<br>#define P2PMESSAGE 100&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 发送消息<br>#define P2PMESSAGEACK 101&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 收到消息的应答<br>#define P2PSOMEONEWANTTOCALLYOU 102&nbsp; // 服务器向客户端发送的消息<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 希望此客户端发送一个UDP打洞包<br>#define P2PTRASH&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 103&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // 客户端发送的打洞包，接收端应该忽略此消息<br><br>// 客户端之间发送消息格式<br>struct stP2PMessage<br>{<br>&nbsp;int iMessageType;<br>&nbsp;int iStringLen;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; // or IP address<br>&nbsp;unsigned short Port;<br>};<br><br>using namespace std;<br>typedef list&lt;stUserListNode *&gt; UserList;<br><br>工程下载地址:<a title="下载代码" href="http://www.ppcn.net/upload/2004_05/04052509317298.rar">http://www.ppcn.net/upload/2004_05/04052509317298.rar</a><img src ="http://www.cppblog.com/shootingstars/aggbug/26140.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-12 13:23 <a href="http://www.cppblog.com/shootingstars/archive/2007/06/12/26140.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>在Windows下编译OpenSSL（VS2005） </title><link>http://www.cppblog.com/shootingstars/archive/2006/02/17/3302.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Fri, 17 Feb 2006 01:46:00 GMT</pubDate><guid>http://www.cppblog.com/shootingstars/archive/2006/02/17/3302.html</guid><wfw:comment>http://www.cppblog.com/shootingstars/comments/3302.html</wfw:comment><comments>http://www.cppblog.com/shootingstars/archive/2006/02/17/3302.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/shootingstars/comments/commentRss/3302.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shootingstars/services/trackbacks/3302.html</trackback:ping><description><![CDATA[最近学习PKI，在使用vs2005编译openssl-0.9.8a时遇到了一些问题：<BR>详情请看：<A href="http://shootingstars.cnblogs.com/archive/2006/02/17/332276.html">http://shootingstars.cnblogs.com/archive/2006/02/17/332276.html</A><img src ="http://www.cppblog.com/shootingstars/aggbug/3302.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shootingstars/" target="_blank">shootingstars</a> 2006-02-17 09:46 <a href="http://www.cppblog.com/shootingstars/archive/2006/02/17/3302.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>