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

📄 a00172.html

📁 uip-1.0,give everyone who want.
💻 HTML
📖 第 1 页 / 共 4 页
字号:
<a name="l00104"></a>00104   <a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr;<a name="l00105"></a>00105 };<a name="l00106"></a>00106 <a name="l00107"></a>00107 <span class="keyword">struct </span>namemap {<a name="l00108"></a><a class="code" href="a00102.html#ee60b8757bacab269b0ccd7c240bf01d">00108</a> <span class="preprocessor">#define STATE_UNUSED 0</span><a name="l00109"></a><a class="code" href="a00102.html#bf4401501f1389872141a78b63f325a3">00109</a> <span class="preprocessor"></span><span class="preprocessor">#define STATE_NEW    1</span><a name="l00110"></a><a class="code" href="a00102.html#55735650f879293d9b7b5fda6753d147">00110</a> <span class="preprocessor"></span><span class="preprocessor">#define STATE_ASKING 2</span><a name="l00111"></a><a class="code" href="a00102.html#876c82c946543cd70c141e41417138e0">00111</a> <span class="preprocessor"></span><span class="preprocessor">#define STATE_DONE   3</span><a name="l00112"></a><a class="code" href="a00102.html#7bf0c086c7c41c12cc63324327932d91">00112</a> <span class="preprocessor"></span><span class="preprocessor">#define STATE_ERROR  4</span><a name="l00113"></a>00113 <span class="preprocessor"></span>  <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> state;<a name="l00114"></a>00114   <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> tmr;<a name="l00115"></a>00115   <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> retries;<a name="l00116"></a>00116   <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> seqno;<a name="l00117"></a>00117   <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> err;<a name="l00118"></a>00118   <span class="keywordtype">char</span> name[32];<a name="l00119"></a>00119   <a class="code" href="a00150.html#g1ef35301f43a5bbb9f89f07b5a36b9a0">uip_ipaddr_t</a> ipaddr;<a name="l00120"></a>00120 };<a name="l00121"></a>00121 <a name="l00122"></a>00122 <span class="preprocessor">#ifndef UIP_CONF_RESOLV_ENTRIES</span><a name="l00123"></a><a class="code" href="a00160.html#g221d37ccde7e3fd0dd2c2eb0a6b15493">00123</a> <span class="preprocessor"></span><span class="preprocessor">#define RESOLV_ENTRIES 4</span><a name="l00124"></a>00124 <span class="preprocessor"></span><span class="preprocessor">#else </span><span class="comment">/* UIP_CONF_RESOLV_ENTRIES */</span><a name="l00125"></a>00125 <span class="preprocessor">#define RESOLV_ENTRIES UIP_CONF_RESOLV_ENTRIES</span><a name="l00126"></a>00126 <span class="preprocessor"></span><span class="preprocessor">#endif </span><span class="comment">/* UIP_CONF_RESOLV_ENTRIES */</span><a name="l00127"></a>00127 <a name="l00128"></a>00128 <a name="l00129"></a>00129 <span class="keyword">static</span> <span class="keyword">struct </span>namemap names[<a class="code" href="a00160.html#g221d37ccde7e3fd0dd2c2eb0a6b15493">RESOLV_ENTRIES</a>];<a name="l00130"></a>00130 <a name="l00131"></a>00131 <span class="keyword">static</span> <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> seqno;<a name="l00132"></a>00132 <a name="l00133"></a>00133 <span class="keyword">static</span> <span class="keyword">struct </span><a class="code" href="a00095.html">uip_udp_conn</a> *resolv_conn = <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>;<a name="l00134"></a>00134 <a name="l00135"></a>00135 <a name="l00136"></a>00136 <span class="comment">/*---------------------------------------------------------------------------*/</span><span class="comment"></span><a name="l00137"></a>00137 <span class="comment">/** \internal</span><a name="l00138"></a>00138 <span class="comment"> * Walk through a compact encoded DNS name and return the end of it.</span><a name="l00139"></a>00139 <span class="comment"> *</span><a name="l00140"></a>00140 <span class="comment"> * \return The end of the name.</span><a name="l00141"></a>00141 <span class="comment"> */</span><a name="l00142"></a>00142 <span class="comment">/*---------------------------------------------------------------------------*/</span><a name="l00143"></a>00143 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *<a name="l00144"></a>00144 parse_name(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *query)<a name="l00145"></a>00145 {<a name="l00146"></a>00146   <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> n;<a name="l00147"></a>00147 <a name="l00148"></a>00148   <span class="keywordflow">do</span> {<a name="l00149"></a>00149     n = *query++;<a name="l00150"></a>00150     <a name="l00151"></a>00151     <span class="keywordflow">while</span>(n &gt; 0) {<a name="l00152"></a>00152       <span class="comment">/*      printf("%c", *query);*/</span><a name="l00153"></a>00153       ++query;<a name="l00154"></a>00154       --n;<a name="l00155"></a>00155     };<a name="l00156"></a>00156     <span class="comment">/*    printf(".");*/</span><a name="l00157"></a>00157   } <span class="keywordflow">while</span>(*query != 0);<a name="l00158"></a>00158   <span class="comment">/*  printf("\n");*/</span><a name="l00159"></a>00159   <span class="keywordflow">return</span> query + 1;<a name="l00160"></a>00160 }<a name="l00161"></a>00161 <span class="comment">/*---------------------------------------------------------------------------*/</span><span class="comment"></span><a name="l00162"></a>00162 <span class="comment">/** \internal</span><a name="l00163"></a>00163 <span class="comment"> * Runs through the list of names to see if there are any that have</span><a name="l00164"></a>00164 <span class="comment"> * not yet been queried and, if so, sends out a query.</span><a name="l00165"></a>00165 <span class="comment"> */</span><a name="l00166"></a>00166 <span class="comment">/*---------------------------------------------------------------------------*/</span><a name="l00167"></a>00167 <span class="keyword">static</span> <span class="keywordtype">void</span><a name="l00168"></a>00168 check_entries(<span class="keywordtype">void</span>)<a name="l00169"></a>00169 {<a name="l00170"></a>00170   <span class="keyword">register</span> <span class="keyword">struct </span>dns_hdr *hdr;<a name="l00171"></a>00171   <span class="keywordtype">char</span> *query, *nptr, *nameptr;<a name="l00172"></a>00172   <span class="keyword">static</span> <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> i;<a name="l00173"></a>00173   <span class="keyword">static</span> <a class="code" href="a00153.html#g4caecabca98b43919dd11be1c0d4cd8e">u8_t</a> n;<a name="l00174"></a>00174   <span class="keyword">register</span> <span class="keyword">struct </span>namemap *namemapptr;<a name="l00175"></a>00175   <a name="l00176"></a>00176   <span class="keywordflow">for</span>(i = 0; i &lt; <a class="code" href="a00160.html#g221d37ccde7e3fd0dd2c2eb0a6b15493">RESOLV_ENTRIES</a>; ++i) {<a name="l00177"></a>00177     namemapptr = &amp;names[i];<a name="l00178"></a>00178     <span class="keywordflow">if</span>(namemapptr-&gt;state == <a class="code" href="a00102.html#bf4401501f1389872141a78b63f325a3">STATE_NEW</a> ||<a name="l00179"></a>00179        namemapptr-&gt;state == <a class="code" href="a00102.html#55735650f879293d9b7b5fda6753d147">STATE_ASKING</a>) {<a name="l00180"></a>00180       <span class="keywordflow">if</span>(namemapptr-&gt;state == <a class="code" href="a00102.html#55735650f879293d9b7b5fda6753d147">STATE_ASKING</a>) {<a name="l00181"></a>00181         <span class="keywordflow">if</span>(--namemapptr-&gt;tmr == 0) {<a name="l00182"></a>00182           <span class="keywordflow">if</span>(++namemapptr-&gt;retries == <a class="code" href="a00160.html#gecf13b8dc783db2202ca5c34fe117fc3">MAX_RETRIES</a>) {<a name="l00183"></a>00183             namemapptr-&gt;state = <a class="code" href="a00102.html#7bf0c086c7c41c12cc63324327932d91">STATE_ERROR</a>;<a name="l00184"></a>00184             <a class="code" href="a00160.html#g6d9751d534453425c7a5a215d1d4414c">resolv_found</a>(namemapptr-&gt;name, <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>);<a name="l00185"></a>00185             <span class="keywordflow">continue</span>;<a name="l00186"></a>00186           }<a name="l00187"></a>00187           namemapptr-&gt;tmr = namemapptr-&gt;retries;<a name="l00188"></a>00188         } <span class="keywordflow">else</span> {<a name="l00189"></a>00189           <span class="comment">/*      printf("Timer %d\n", namemapptr-&gt;tmr);*/</span><a name="l00190"></a>00190           <span class="comment">/* Its timer has not run out, so we move on to next</span><a name="l00191"></a>00191 <span class="comment">             entry. */</span><a name="l00192"></a>00192           <span class="keywordflow">continue</span>;<a name="l00193"></a>00193         }<a name="l00194"></a>00194       } <span class="keywordflow">else</span> {<a name="l00195"></a>00195         namemapptr-&gt;state = <a class="code" href="a00102.html#55735650f879293d9b7b5fda6753d147">STATE_ASKING</a>;<a name="l00196"></a>00196         namemapptr-&gt;tmr = 1;<a name="l00197"></a>00197         namemapptr-&gt;retries = 0;<a name="l00198"></a>00198       }<a name="l00199"></a>00199       hdr = (<span class="keyword">struct </span>dns_hdr *)<a class="code" href="a00150.html#g561b8eda32e059d4e7397f776268cc63">uip_appdata</a>;<a name="l00200"></a>00200       memset(hdr, 0, <span class="keyword">sizeof</span>(<span class="keyword">struct</span> dns_hdr));<a name="l00201"></a>00201       hdr-&gt;id = <a class="code" href="a00148.html#ga22b04cac8cf283ca12f028578bebc06">htons</a>(i);<a name="l00202"></a>00202       hdr-&gt;flags1 = <a class="code" href="a00102.html#72d99b1623afa14bd58c667b748c2ddc">DNS_FLAG1_RD</a>;<a name="l00203"></a>00203       hdr-&gt;numquestions = <a class="code" href="a00148.html#g69a7a4951ff21b302267532c21ee78fc">HTONS</a>(1);<a name="l00204"></a>00204       query = (<span class="keywordtype">char</span> *)<a class="code" href="a00150.html#g561b8eda32e059d4e7397f776268cc63">uip_appdata</a> + 12;<a name="l00205"></a>00205       nameptr = namemapptr-&gt;name;<a name="l00206"></a>00206       --nameptr;<a name="l00207"></a>00207       <span class="comment">/* Convert hostname into suitable query format. */</span><a name="l00208"></a>00208       <span class="keywordflow">do</span> {<a name="l00209"></a>00209         ++nameptr;<a name="l00210"></a>00210         nptr = query;<a name="l00211"></a>00211         ++query;<a name="l00212"></a>00212         <span class="keywordflow">for</span>(n = 0; *nameptr != <span class="charliteral">'.'</span> &amp;&amp; *nameptr != 0; ++nameptr) {<a name="l00213"></a>00213           *query = *nameptr;<a name="l00214"></a>00214           ++query;<a name="l00215"></a>00215           ++n;<a name="l00216"></a>00216         }<a name="l00217"></a>00217         *nptr = n;<a name="l00218"></a>00218       } <span class="keywordflow">while</span>(*nameptr != 0);<a name="l00219"></a>00219       {<a name="l00220"></a>00220         <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> endquery[] =<a name="l00221"></a>00221           {0,0,1,0,1};<a name="l00222"></a>00222         memcpy(query, endquery, 5);<a name="l00223"></a>00223       }<a name="l00224"></a>00224       <a class="code" href="a00147.html#ge5ab69d40013e6cf86ef1763c95d920e">uip_udp_send</a>((<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>)(query + 5 - (<span class="keywordtype">char</span> *)<a class="code" href="a00150.html#g561b8eda32e059d4e7397f776268cc63">uip_appdata</a>));<a name="l00225"></a>00225       <span class="keywordflow">break</span>;<a name="l00226"></a>00226     }

⌨️ 快捷键说明

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