resolv.c 68 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783
  1. /* resolv.c: DNS Resolver
  2. *
  3. * Copyright (C) 1998 Kenneth Albanowski <kjahds@kjahds.com>,
  4. * The Silver Hammer Group, Ltd.
  5. *
  6. * This library is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Library General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. */
  11. /*
  12. * Portions Copyright (c) 1985, 1993
  13. * The Regents of the University of California. All rights reserved.
  14. *
  15. * Redistribution and use in source and binary forms, with or without
  16. * modification, are permitted provided that the following conditions
  17. * are met:
  18. * 1. Redistributions of source code must retain the above copyright
  19. * notice, this list of conditions and the following disclaimer.
  20. * 2. Redistributions in binary form must reproduce the above copyright
  21. * notice, this list of conditions and the following disclaimer in the
  22. * documentation and/or other materials provided with the distribution.
  23. * 4. Neither the name of the University nor the names of its contributors
  24. * may be used to endorse or promote products derived from this software
  25. * without specific prior written permission.
  26. *
  27. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  28. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  29. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  30. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  31. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  32. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  33. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  34. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  35. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  36. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  37. * SUCH DAMAGE.
  38. */
  39. /*
  40. * Portions Copyright (c) 1993 by Digital Equipment Corporation.
  41. *
  42. * Permission to use, copy, modify, and distribute this software for any
  43. * purpose with or without fee is hereby granted, provided that the above
  44. * copyright notice and this permission notice appear in all copies, and that
  45. * the name of Digital Equipment Corporation not be used in advertising or
  46. * publicity pertaining to distribution of the document or software without
  47. * specific, written prior permission.
  48. *
  49. * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
  50. * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
  51. * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
  52. * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  53. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  54. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
  55. * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
  56. * SOFTWARE.
  57. */
  58. /*
  59. * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
  60. *
  61. * Permission to use, copy, modify, and distribute this software for any
  62. * purpose with or without fee is hereby granted, provided that the above
  63. * copyright notice and this permission notice appear in all copies.
  64. *
  65. * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
  66. * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
  67. * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
  68. * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  69. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  70. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
  71. * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
  72. * SOFTWARE.
  73. */
  74. /*
  75. *
  76. * 5-Oct-2000 W. Greathouse wgreathouse@smva.com
  77. * Fix memory leak and memory corruption.
  78. * -- Every name resolution resulted in
  79. * a new parse of resolv.conf and new
  80. * copy of nameservers allocated by
  81. * strdup.
  82. * -- Every name resolution resulted in
  83. * a new read of resolv.conf without
  84. * resetting index from prior read...
  85. * resulting in exceeding array bounds.
  86. *
  87. * Limit nameservers read from resolv.conf
  88. *
  89. * Add "search" domains from resolv.conf
  90. *
  91. * Some systems will return a security
  92. * signature along with query answer for
  93. * dynamic DNS entries.
  94. * -- skip/ignore this answer
  95. *
  96. * Include arpa/nameser.h for defines.
  97. *
  98. * General cleanup
  99. *
  100. * 20-Jun-2001 Michal Moskal <malekith@pld.org.pl>
  101. * partial IPv6 support (i.e. gethostbyname2() and resolve_address2()
  102. * functions added), IPv6 nameservers are also supported.
  103. *
  104. * 6-Oct-2001 Jari Korva <jari.korva@iki.fi>
  105. * more IPv6 support (IPv6 support for gethostbyaddr();
  106. * address family parameter and improved IPv6 support for get_hosts_byname
  107. * and read_etc_hosts; getnameinfo() port from glibc; defined
  108. * defined ip6addr_any and in6addr_loopback)
  109. *
  110. * 2-Feb-2002 Erik Andersen <andersen@codepoet.org>
  111. * Added gethostent(), sethostent(), and endhostent()
  112. *
  113. * 17-Aug-2002 Manuel Novoa III <mjn3@codepoet.org>
  114. * Fixed __read_etc_hosts_r to return alias list, and modified buffer
  115. * allocation accordingly. See MAX_ALIASES and ALIAS_DIM below.
  116. * This fixes the segfault in the Python 2.2.1 socket test.
  117. *
  118. * 04-Jan-2003 Jay Kulpinski <jskulpin@berkshire.rr.com>
  119. * Fixed __decode_dotted to count the terminating null character
  120. * in a host name.
  121. *
  122. * 02-Oct-2003 Tony J. White <tjw@tjw.org>
  123. * Lifted dn_expand() and dependent ns_name_uncompress(), ns_name_unpack(),
  124. * and ns_name_ntop() from glibc 2.3.2 for compatibility with ipsec-tools
  125. * and openldap.
  126. *
  127. * 7-Sep-2004 Erik Andersen <andersen@codepoet.org>
  128. * Added gethostent_r()
  129. *
  130. */
  131. #define __FORCE_GLIBC
  132. #include <features.h>
  133. #include <string.h>
  134. #include <stdio.h>
  135. #include <signal.h>
  136. #include <errno.h>
  137. #include <sys/poll.h>
  138. #include <sys/socket.h>
  139. #include <sys/types.h>
  140. #include <sys/time.h>
  141. #include <netinet/in.h>
  142. #include <arpa/inet.h>
  143. #include <stdlib.h>
  144. #include <unistd.h>
  145. #include <resolv.h>
  146. #include <netdb.h>
  147. #include <ctype.h>
  148. #include <stdbool.h>
  149. #include <arpa/nameser.h>
  150. #include <sys/utsname.h>
  151. #include <sys/un.h>
  152. #include <bits/uClibc_mutex.h>
  153. /* poll() is not supported in kernel <= 2.0, therefore if __NR_poll is
  154. * not available, we assume an old Linux kernel is in use and we will
  155. * use select() instead. */
  156. #include <sys/syscall.h>
  157. #ifndef __NR_poll
  158. # define USE_SELECT
  159. #endif
  160. __UCLIBC_MUTEX_EXTERN(__resolv_lock);
  161. /* Experimentally off - libc_hidden_proto(memcpy) */
  162. /* Experimentally off - libc_hidden_proto(memset) */
  163. /* Experimentally off - libc_hidden_proto(memmove) */
  164. /* Experimentally off - libc_hidden_proto(strchr) */
  165. /* Experimentally off - libc_hidden_proto(strcmp) */
  166. /* Experimentally off - libc_hidden_proto(strcpy) */
  167. /* Experimentally off - libc_hidden_proto(strdup) */
  168. /* Experimentally off - libc_hidden_proto(strlen) */
  169. /* Experimentally off - libc_hidden_proto(strncat) */
  170. /* Experimentally off - libc_hidden_proto(strncpy) */
  171. /* libc_hidden_proto(strnlen) */
  172. /* Experimentally off - libc_hidden_proto(strstr) */
  173. /* Experimentally off - libc_hidden_proto(strcasecmp) */
  174. libc_hidden_proto(socket)
  175. libc_hidden_proto(close)
  176. libc_hidden_proto(fopen)
  177. libc_hidden_proto(fclose)
  178. libc_hidden_proto(random)
  179. libc_hidden_proto(getservbyport)
  180. libc_hidden_proto(uname)
  181. libc_hidden_proto(inet_addr)
  182. libc_hidden_proto(inet_aton)
  183. libc_hidden_proto(inet_pton)
  184. libc_hidden_proto(inet_ntop)
  185. libc_hidden_proto(connect)
  186. libc_hidden_proto(poll)
  187. libc_hidden_proto(select)
  188. libc_hidden_proto(recv)
  189. libc_hidden_proto(send)
  190. libc_hidden_proto(printf)
  191. libc_hidden_proto(sprintf)
  192. libc_hidden_proto(snprintf)
  193. libc_hidden_proto(fgets)
  194. libc_hidden_proto(gethostbyname)
  195. libc_hidden_proto(gethostbyname_r)
  196. libc_hidden_proto(gethostbyname2_r)
  197. libc_hidden_proto(gethostbyaddr)
  198. libc_hidden_proto(gethostbyaddr_r)
  199. libc_hidden_proto(ns_name_uncompress)
  200. libc_hidden_proto(ns_name_unpack)
  201. libc_hidden_proto(ns_name_ntop)
  202. libc_hidden_proto(res_init)
  203. libc_hidden_proto(res_query)
  204. libc_hidden_proto(res_querydomain)
  205. libc_hidden_proto(gethostent_r)
  206. libc_hidden_proto(fprintf)
  207. libc_hidden_proto(__h_errno_location)
  208. #ifdef __UCLIBC_HAS_XLOCALE__
  209. libc_hidden_proto(__ctype_b_loc)
  210. #elif defined __UCLIBC_HAS_CTYPE_TABLES__
  211. libc_hidden_proto(__ctype_b)
  212. #endif
  213. int __libc_getdomainname(char *name, size_t len);
  214. libc_hidden_proto(__libc_getdomainname)
  215. #define MAX_RECURSE 5
  216. #define REPLY_TIMEOUT 10
  217. #define MAX_RETRIES 3
  218. #define MAX_SERVERS 3
  219. #define MAX_SEARCH 4
  220. #define MAX_ALIASES 5
  221. /* 1:ip + 1:full + MAX_ALIASES:aliases + 1:NULL */
  222. #define ALIAS_DIM (2 + MAX_ALIASES + 1)
  223. #undef DEBUG
  224. /* #define DEBUG */
  225. #ifdef DEBUG
  226. #define DPRINTF(X,args...) fprintf(stderr, X, ##args)
  227. #else
  228. #define DPRINTF(X,args...)
  229. #endif /* DEBUG */
  230. /* Make sure the incoming char * buffer is aligned enough to handle our random
  231. * structures. This define is the same as we use for malloc alignment (which
  232. * has same requirements). The offset is the number of bytes we need to adjust
  233. * in order to attain desired alignment.
  234. */
  235. #define ALIGN_ATTR __alignof__(double __attribute_aligned__ (sizeof(size_t)))
  236. #define ALIGN_BUFFER_OFFSET(buf) ((ALIGN_ATTR - ((size_t)buf % ALIGN_ATTR)) % ALIGN_ATTR)
  237. /* Global stuff (stuff needing to be locked to be thread safe)... */
  238. extern int __nameservers attribute_hidden;
  239. extern char * __nameserver[MAX_SERVERS] attribute_hidden;
  240. extern int __searchdomains attribute_hidden;
  241. extern char * __searchdomain[MAX_SEARCH] attribute_hidden;
  242. /* Structs */
  243. struct resolv_header {
  244. int id;
  245. int qr,opcode,aa,tc,rd,ra,rcode;
  246. int qdcount;
  247. int ancount;
  248. int nscount;
  249. int arcount;
  250. };
  251. struct resolv_question {
  252. char * dotted;
  253. int qtype;
  254. int qclass;
  255. };
  256. struct resolv_answer {
  257. char * dotted;
  258. int atype;
  259. int aclass;
  260. int ttl;
  261. int rdlength;
  262. const unsigned char * rdata;
  263. int rdoffset;
  264. char* buf;
  265. size_t buflen;
  266. size_t add_count;
  267. };
  268. enum etc_hosts_action {
  269. GET_HOSTS_BYNAME = 0,
  270. GETHOSTENT,
  271. GET_HOSTS_BYADDR,
  272. };
  273. /* function prototypes */
  274. extern int __get_hosts_byname_r(const char * name, int type,
  275. struct hostent * result_buf,
  276. char * buf, size_t buflen,
  277. struct hostent ** result,
  278. int * h_errnop) attribute_hidden;
  279. extern int __get_hosts_byaddr_r(const char * addr, int len, int type,
  280. struct hostent * result_buf,
  281. char * buf, size_t buflen,
  282. struct hostent ** result,
  283. int * h_errnop) attribute_hidden;
  284. extern FILE * __open_etc_hosts(void) attribute_hidden;
  285. extern int __read_etc_hosts_r(FILE *fp, const char * name, int type,
  286. enum etc_hosts_action action,
  287. struct hostent * result_buf,
  288. char * buf, size_t buflen,
  289. struct hostent ** result,
  290. int * h_errnop) attribute_hidden;
  291. extern int __dns_lookup(const char * name, int type, int nscount,
  292. char ** nsip, unsigned char ** outpacket, struct resolv_answer * a) attribute_hidden;
  293. extern int __encode_dotted(const char * dotted, unsigned char * dest, int maxlen) attribute_hidden;
  294. extern int __decode_dotted(const unsigned char * const message, int offset,
  295. char * dest, int maxlen) attribute_hidden;
  296. extern int __length_dotted(const unsigned char * const message, int offset) attribute_hidden;
  297. extern int __encode_header(struct resolv_header * h, unsigned char * dest, int maxlen) attribute_hidden;
  298. extern int __decode_header(unsigned char * data, struct resolv_header * h) attribute_hidden;
  299. extern int __encode_question(const struct resolv_question * const q,
  300. unsigned char * dest, int maxlen) attribute_hidden;
  301. extern int __decode_question(const unsigned char * const message, int offset,
  302. struct resolv_question * q) attribute_hidden;
  303. extern int __encode_answer(struct resolv_answer * a,
  304. unsigned char * dest, int maxlen) attribute_hidden;
  305. extern int __decode_answer(const unsigned char * message, int offset,
  306. struct resolv_answer * a) attribute_hidden;
  307. extern int __length_question(const unsigned char * const message, int offset) attribute_hidden;
  308. extern void __open_nameservers(void) attribute_hidden;
  309. extern void __close_nameservers(void) attribute_hidden;
  310. extern int __dn_expand(const u_char *, const u_char *, const u_char *,
  311. char *, int);
  312. #ifdef L_encodeh
  313. int attribute_hidden __encode_header(struct resolv_header *h, unsigned char *dest, int maxlen)
  314. {
  315. if (maxlen < HFIXEDSZ)
  316. return -1;
  317. dest[0] = (h->id & 0xff00) >> 8;
  318. dest[1] = (h->id & 0x00ff) >> 0;
  319. dest[2] = (h->qr ? 0x80 : 0) |
  320. ((h->opcode & 0x0f) << 3) |
  321. (h->aa ? 0x04 : 0) |
  322. (h->tc ? 0x02 : 0) |
  323. (h->rd ? 0x01 : 0);
  324. dest[3] = (h->ra ? 0x80 : 0) | (h->rcode & 0x0f);
  325. dest[4] = (h->qdcount & 0xff00) >> 8;
  326. dest[5] = (h->qdcount & 0x00ff) >> 0;
  327. dest[6] = (h->ancount & 0xff00) >> 8;
  328. dest[7] = (h->ancount & 0x00ff) >> 0;
  329. dest[8] = (h->nscount & 0xff00) >> 8;
  330. dest[9] = (h->nscount & 0x00ff) >> 0;
  331. dest[10] = (h->arcount & 0xff00) >> 8;
  332. dest[11] = (h->arcount & 0x00ff) >> 0;
  333. return HFIXEDSZ;
  334. }
  335. #endif
  336. #ifdef L_decodeh
  337. int attribute_hidden __decode_header(unsigned char *data, struct resolv_header *h)
  338. {
  339. h->id = (data[0] << 8) | data[1];
  340. h->qr = (data[2] & 0x80) ? 1 : 0;
  341. h->opcode = (data[2] >> 3) & 0x0f;
  342. h->aa = (data[2] & 0x04) ? 1 : 0;
  343. h->tc = (data[2] & 0x02) ? 1 : 0;
  344. h->rd = (data[2] & 0x01) ? 1 : 0;
  345. h->ra = (data[3] & 0x80) ? 1 : 0;
  346. h->rcode = data[3] & 0x0f;
  347. h->qdcount = (data[4] << 8) | data[5];
  348. h->ancount = (data[6] << 8) | data[7];
  349. h->nscount = (data[8] << 8) | data[9];
  350. h->arcount = (data[10] << 8) | data[11];
  351. return HFIXEDSZ;
  352. }
  353. #endif
  354. #ifdef L_encoded
  355. /* Encode a dotted string into nameserver transport-level encoding.
  356. This routine is fairly dumb, and doesn't attempt to compress
  357. the data */
  358. int attribute_hidden __encode_dotted(const char *dotted, unsigned char *dest, int maxlen)
  359. {
  360. unsigned used = 0;
  361. while (dotted && *dotted) {
  362. char *c = strchr(dotted, '.');
  363. int l = c ? c - dotted : strlen(dotted);
  364. /* two consecutive dots are not valid */
  365. if (l == 0)
  366. return -1;
  367. if (l >= (maxlen - used - 1))
  368. return -1;
  369. dest[used++] = l;
  370. memcpy(dest + used, dotted, l);
  371. used += l;
  372. if (c)
  373. dotted = c + 1;
  374. else
  375. break;
  376. }
  377. if (maxlen < 1)
  378. return -1;
  379. dest[used++] = 0;
  380. return used;
  381. }
  382. #endif
  383. #ifdef L_decoded
  384. /* Decode a dotted string from nameserver transport-level encoding.
  385. This routine understands compressed data. */
  386. int attribute_hidden __decode_dotted(const unsigned char * const data, int offset,
  387. char *dest, int maxlen)
  388. {
  389. int l;
  390. bool measure = 1;
  391. unsigned total = 0;
  392. unsigned used = 0;
  393. if (!data)
  394. return -1;
  395. while ((l = data[offset++])) {
  396. if (measure)
  397. total++;
  398. if ((l & 0xc0) == (0xc0)) {
  399. if (measure)
  400. total++;
  401. /* compressed item, redirect */
  402. offset = ((l & 0x3f) << 8) | data[offset];
  403. measure = 0;
  404. continue;
  405. }
  406. if ((used + l + 1) >= maxlen)
  407. return -1;
  408. memcpy(dest + used, data + offset, l);
  409. offset += l;
  410. used += l;
  411. if (measure)
  412. total += l;
  413. if (data[offset] != 0)
  414. dest[used++] = '.';
  415. else
  416. dest[used++] = '\0';
  417. }
  418. /* The null byte must be counted too */
  419. if (measure)
  420. total++;
  421. DPRINTF("Total decode len = %d\n", total);
  422. return total;
  423. }
  424. #endif
  425. #ifdef L_lengthd
  426. int attribute_hidden __length_dotted(const unsigned char * const data, int offset)
  427. {
  428. int orig_offset = offset;
  429. int l;
  430. if (!data)
  431. return -1;
  432. while ((l = data[offset++])) {
  433. if ((l & 0xc0) == (0xc0)) {
  434. offset++;
  435. break;
  436. }
  437. offset += l;
  438. }
  439. return offset - orig_offset;
  440. }
  441. #endif
  442. #ifdef L_encodeq
  443. int attribute_hidden __encode_question(const struct resolv_question * const q,
  444. unsigned char *dest, int maxlen)
  445. {
  446. int i;
  447. i = __encode_dotted(q->dotted, dest, maxlen);
  448. if (i < 0)
  449. return i;
  450. dest += i;
  451. maxlen -= i;
  452. if (maxlen < 4)
  453. return -1;
  454. dest[0] = (q->qtype & 0xff00) >> 8;
  455. dest[1] = (q->qtype & 0x00ff) >> 0;
  456. dest[2] = (q->qclass & 0xff00) >> 8;
  457. dest[3] = (q->qclass & 0x00ff) >> 0;
  458. return i + 4;
  459. }
  460. #endif
  461. #ifdef L_decodeq
  462. int attribute_hidden __decode_question(const unsigned char * const message, int offset,
  463. struct resolv_question *q)
  464. {
  465. char temp[256];
  466. int i;
  467. i = __decode_dotted(message, offset, temp, sizeof(temp));
  468. if (i < 0)
  469. return i;
  470. offset += i;
  471. q->dotted = strdup(temp);
  472. //TODO: what if this fails?
  473. q->qtype = (message[offset + 0] << 8) | message[offset + 1];
  474. q->qclass = (message[offset + 2] << 8) | message[offset + 3];
  475. return i + 4;
  476. }
  477. #endif
  478. #ifdef L_lengthq
  479. int attribute_hidden __length_question(const unsigned char * const message, int offset)
  480. {
  481. int i;
  482. i = __length_dotted(message, offset);
  483. if (i < 0)
  484. return i;
  485. return i + 4;
  486. }
  487. #endif
  488. #ifdef L_encodea
  489. int attribute_hidden __encode_answer(struct resolv_answer *a, unsigned char *dest, int maxlen)
  490. {
  491. int i;
  492. i = __encode_dotted(a->dotted, dest, maxlen);
  493. if (i < 0)
  494. return i;
  495. dest += i;
  496. maxlen -= i;
  497. if (maxlen < (RRFIXEDSZ + a->rdlength))
  498. return -1;
  499. *dest++ = (a->atype & 0xff00) >> 8;
  500. *dest++ = (a->atype & 0x00ff) >> 0;
  501. *dest++ = (a->aclass & 0xff00) >> 8;
  502. *dest++ = (a->aclass & 0x00ff) >> 0;
  503. *dest++ = (a->ttl & 0xff000000) >> 24;
  504. *dest++ = (a->ttl & 0x00ff0000) >> 16;
  505. *dest++ = (a->ttl & 0x0000ff00) >> 8;
  506. *dest++ = (a->ttl & 0x000000ff) >> 0;
  507. *dest++ = (a->rdlength & 0xff00) >> 8;
  508. *dest++ = (a->rdlength & 0x00ff) >> 0;
  509. memcpy(dest, a->rdata, a->rdlength);
  510. return i + RRFIXEDSZ + a->rdlength;
  511. }
  512. #endif
  513. #ifdef L_decodea
  514. int attribute_hidden __decode_answer(const unsigned char *message, int offset,
  515. struct resolv_answer *a)
  516. {
  517. char temp[256];
  518. int i;
  519. i = __decode_dotted(message, offset, temp, sizeof(temp));
  520. if (i < 0)
  521. return i;
  522. message += offset + i;
  523. a->dotted = strdup(temp); /* TODO: what if this fails? */
  524. a->atype = (message[0] << 8) | message[1];
  525. message += 2;
  526. a->aclass = (message[0] << 8) | message[1];
  527. message += 2;
  528. a->ttl = (message[0] << 24) |
  529. (message[1] << 16) | (message[2] << 8) | (message[3] << 0);
  530. message += 4;
  531. a->rdlength = (message[0] << 8) | message[1];
  532. message += 2;
  533. a->rdata = message;
  534. a->rdoffset = offset + i + RRFIXEDSZ;
  535. DPRINTF("i=%d,rdlength=%d\n", i, a->rdlength);
  536. return i + RRFIXEDSZ + a->rdlength;
  537. }
  538. #endif
  539. #ifdef L_encodep
  540. int __encode_packet(struct resolv_header *h,
  541. struct resolv_question **q,
  542. struct resolv_answer **an,
  543. struct resolv_answer **ns,
  544. struct resolv_answer **ar,
  545. unsigned char *dest, int maxlen) attribute_hidden;
  546. int __encode_packet(struct resolv_header *h,
  547. struct resolv_question **q,
  548. struct resolv_answer **an,
  549. struct resolv_answer **ns,
  550. struct resolv_answer **ar,
  551. unsigned char *dest, int maxlen)
  552. {
  553. int i, total = 0;
  554. unsigned j;
  555. i = __encode_header(h, dest, maxlen);
  556. if (i < 0)
  557. return i;
  558. dest += i;
  559. maxlen -= i;
  560. total += i;
  561. for (j = 0; j < h->qdcount; j++) {
  562. i = __encode_question(q[j], dest, maxlen);
  563. if (i < 0)
  564. return i;
  565. dest += i;
  566. maxlen -= i;
  567. total += i;
  568. }
  569. for (j = 0; j < h->ancount; j++) {
  570. i = __encode_answer(an[j], dest, maxlen);
  571. if (i < 0)
  572. return i;
  573. dest += i;
  574. maxlen -= i;
  575. total += i;
  576. }
  577. for (j = 0; j < h->nscount; j++) {
  578. i = __encode_answer(ns[j], dest, maxlen);
  579. if (i < 0)
  580. return i;
  581. dest += i;
  582. maxlen -= i;
  583. total += i;
  584. }
  585. for (j = 0; j < h->arcount; j++) {
  586. i = __encode_answer(ar[j], dest, maxlen);
  587. if (i < 0)
  588. return i;
  589. dest += i;
  590. maxlen -= i;
  591. total += i;
  592. }
  593. return total;
  594. }
  595. #endif
  596. #ifdef L_decodep
  597. int __decode_packet(unsigned char *data, struct resolv_header *h) attribute_hidden;
  598. int __decode_packet(unsigned char *data, struct resolv_header *h)
  599. {
  600. return __decode_header(data, h);
  601. }
  602. #endif
  603. #ifdef L_formquery
  604. int __form_query(int id, const char *name, int type, unsigned char *packet, int maxlen);
  605. int __form_query(int id, const char *name, int type, unsigned char *packet,
  606. int maxlen)
  607. {
  608. struct resolv_header h;
  609. struct resolv_question q;
  610. int i, j;
  611. memset(&h, 0, sizeof(h));
  612. h.id = id;
  613. h.qdcount = 1;
  614. q.dotted = (char *) name;
  615. q.qtype = type;
  616. q.qclass = C_IN; /* CLASS_IN */
  617. i = __encode_header(&h, packet, maxlen);
  618. if (i < 0)
  619. return i;
  620. j = __encode_question(&q, packet + i, maxlen - i);
  621. if (j < 0)
  622. return j;
  623. return i + j;
  624. }
  625. #endif
  626. #ifdef L_dnslookup
  627. __UCLIBC_MUTEX_STATIC(mylock, PTHREAD_MUTEX_INITIALIZER);
  628. /* Just for the record, having to lock __dns_lookup() just for these two globals
  629. * is pretty lame. I think these two variables can probably be de-global-ized,
  630. * which should eliminate the need for doing locking here... Needs a closer
  631. * look anyways. */
  632. static int static_ns = 0;
  633. /* uint16: minimizing rw data size, even if code grows a tiny bit.
  634. * rw data costs more. */
  635. static uint16_t static_id = 1;
  636. int attribute_hidden __dns_lookup(const char *name, int type, int nscount, char **nsip,
  637. unsigned char **outpacket, struct resolv_answer *a)
  638. {
  639. int i, j, len, fd, pos, rc;
  640. #ifdef USE_SELECT
  641. struct timeval tv;
  642. fd_set fds;
  643. #else
  644. struct pollfd fds;
  645. #endif
  646. struct resolv_header h;
  647. struct resolv_question q;
  648. struct resolv_answer ma;
  649. bool first_answer = 1;
  650. unsigned retries = 0;
  651. unsigned char *packet = malloc(PACKETSZ);
  652. char *dns, *lookup = malloc(MAXDNAME);
  653. int variant = -1; /* search domain to append, -1 - none */
  654. int local_ns = -1, local_id = -1;
  655. bool ends_with_dot;
  656. #ifdef __UCLIBC_HAS_IPV6__
  657. bool v6;
  658. struct sockaddr_in6 sa6;
  659. #endif
  660. #ifdef __UCLIBC_HAS_IPV4__
  661. struct sockaddr_in sa;
  662. #endif
  663. fd = -1;
  664. if (!packet || !lookup || !nscount || !name[0])
  665. goto fail;
  666. DPRINTF("Looking up type %d answer for '%s'\n", type, name);
  667. ends_with_dot = (name[strlen(name) - 1] == '.');
  668. /* Mess with globals while under lock */
  669. __UCLIBC_MUTEX_LOCK(mylock);
  670. local_ns = static_ns % nscount;
  671. local_id = static_id;
  672. __UCLIBC_MUTEX_UNLOCK(mylock);
  673. while (retries < MAX_RETRIES) {
  674. if (fd != -1)
  675. close(fd);
  676. memset(packet, 0, PACKETSZ);
  677. memset(&h, 0, sizeof(h));
  678. ++local_id;
  679. local_id &= 0xffff;
  680. h.id = local_id;
  681. h.qdcount = 1;
  682. h.rd = 1;
  683. DPRINTF("encoding header\n", h.rd);
  684. i = __encode_header(&h, packet, PACKETSZ);
  685. if (i < 0)
  686. goto fail;
  687. strncpy(lookup, name, MAXDNAME);
  688. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  689. /* nsip is really __nameserver[] which is a global that
  690. needs to hold __resolv_lock before access!! */
  691. dns = nsip[local_ns];
  692. /* TODO: all future accesses to 'dns' are guarded by __resolv_lock too.
  693. * Why? We already fetched nsip[local_ns] here,
  694. * future changes to nsip[] by other threads cannot affect us.
  695. * We can use 'dns' without locking. If I'm wrong,
  696. * please explain in comments why locking is needed. */
  697. if (variant >= 0) {
  698. if (variant < __searchdomains) {
  699. strncat(lookup, ".", MAXDNAME);
  700. strncat(lookup, __searchdomain[variant], MAXDNAME);
  701. }
  702. }
  703. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  704. DPRINTF("lookup name: %s\n", lookup);
  705. q.dotted = (char *)lookup;
  706. q.qtype = type;
  707. q.qclass = C_IN; /* CLASS_IN */
  708. j = __encode_question(&q, packet+i, PACKETSZ-i);
  709. if (j < 0)
  710. goto fail;
  711. len = i + j;
  712. DPRINTF("On try %d, sending query to port %d of machine %s\n",
  713. retries+1, NAMESERVER_PORT, dns);
  714. #ifdef __UCLIBC_HAS_IPV6__
  715. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  716. /* 'dns' is really __nameserver[] which is a global that
  717. needs to hold __resolv_lock before access!! */
  718. v6 = inet_pton(AF_INET6, dns, &sa6.sin6_addr) > 0;
  719. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  720. fd = socket(v6 ? AF_INET6 : AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  721. #else
  722. fd = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  723. #endif
  724. if (fd < 0) {
  725. retries++;
  726. continue;
  727. }
  728. /* Connect to the UDP socket so that asyncronous errors are returned */
  729. #ifdef __UCLIBC_HAS_IPV6__
  730. if (v6) {
  731. sa6.sin6_family = AF_INET6;
  732. sa6.sin6_port = htons(NAMESERVER_PORT);
  733. /* sa6.sin6_addr is already here */
  734. rc = connect(fd, (struct sockaddr *) &sa6, sizeof(sa6));
  735. } else {
  736. #endif
  737. #ifdef __UCLIBC_HAS_IPV4__
  738. sa.sin_family = AF_INET;
  739. sa.sin_port = htons(NAMESERVER_PORT);
  740. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  741. /* 'dns' is really __nameserver[] which is a global that
  742. needs to hold __resolv_lock before access!! */
  743. sa.sin_addr.s_addr = inet_addr(dns);
  744. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  745. rc = connect(fd, (struct sockaddr *) &sa, sizeof(sa));
  746. #endif
  747. #ifdef __UCLIBC_HAS_IPV6__
  748. }
  749. #endif
  750. if (rc < 0) {
  751. if (errno == ENETUNREACH) {
  752. /* routing error, presume not transient */
  753. goto tryall;
  754. }
  755. /* retry */
  756. retries++;
  757. continue;
  758. }
  759. DPRINTF("Transmitting packet of length %d, id=%d, qr=%d\n",
  760. len, h.id, h.qr);
  761. send(fd, packet, len, 0);
  762. #ifdef USE_SELECT
  763. FD_ZERO(&fds);
  764. FD_SET(fd, &fds);
  765. tv.tv_sec = REPLY_TIMEOUT;
  766. tv.tv_usec = 0;
  767. if (select(fd + 1, &fds, NULL, NULL, &tv) <= 0) {
  768. DPRINTF("Timeout\n");
  769. /* timed out, so retry send and receive,
  770. * to next nameserver on queue */
  771. goto tryall;
  772. }
  773. #else
  774. fds.fd = fd;
  775. fds.events = POLLIN;
  776. if (poll(&fds, 1, REPLY_TIMEOUT * 1000) <= 0) {
  777. DPRINTF("Timeout\n");
  778. /* timed out, so retry send and receive,
  779. * to next nameserver on queue */
  780. goto tryall;
  781. }
  782. #endif
  783. len = recv(fd, packet, PACKETSZ, 0);
  784. if (len < HFIXEDSZ) {
  785. /* too short ! */
  786. goto again;
  787. }
  788. __decode_header(packet, &h);
  789. DPRINTF("id = %d, qr = %d\n", h.id, h.qr);
  790. if ((h.id != local_id) || (!h.qr)) {
  791. /* unsolicited */
  792. goto again;
  793. }
  794. DPRINTF("Got response %s\n", "(i think)!");
  795. DPRINTF("qrcount=%d,ancount=%d,nscount=%d,arcount=%d\n",
  796. h.qdcount, h.ancount, h.nscount, h.arcount);
  797. DPRINTF("opcode=%d,aa=%d,tc=%d,rd=%d,ra=%d,rcode=%d\n",
  798. h.opcode, h.aa, h.tc, h.rd, h.ra, h.rcode);
  799. if ((h.rcode) || (h.ancount < 1)) {
  800. /* negative result, not present */
  801. goto again;
  802. }
  803. pos = HFIXEDSZ;
  804. for (j = 0; j < h.qdcount; j++) {
  805. DPRINTF("Skipping question %d at %d\n", j, pos);
  806. i = __length_question(packet, pos);
  807. DPRINTF("Length of question %d is %d\n", j, i);
  808. if (i < 0)
  809. goto again;
  810. pos += i;
  811. }
  812. DPRINTF("Decoding answer at pos %d\n", pos);
  813. first_answer = 1;
  814. for (j = 0; j < h.ancount; j++, pos += i) {
  815. i = __decode_answer(packet, pos, &ma);
  816. if (i < 0) {
  817. DPRINTF("failed decode %d\n", i);
  818. goto again;
  819. }
  820. if (first_answer) {
  821. ma.buf = a->buf;
  822. ma.buflen = a->buflen;
  823. ma.add_count = a->add_count;
  824. memcpy(a, &ma, sizeof(ma));
  825. if (a->atype != T_SIG && (0 == a->buf || (type != T_A && type != T_AAAA)))
  826. break;
  827. if (a->atype != type) {
  828. free(a->dotted);
  829. continue;
  830. }
  831. a->add_count = h.ancount - j - 1;
  832. if ((a->rdlength + sizeof(struct in_addr*)) * a->add_count > a->buflen)
  833. break;
  834. a->add_count = 0;
  835. first_answer = 0;
  836. } else {
  837. free(ma.dotted);
  838. if (ma.atype != type)
  839. continue;
  840. if (a->rdlength != ma.rdlength) {
  841. free(a->dotted);
  842. DPRINTF("Answer address len(%u) differs from original(%u)\n",
  843. ma.rdlength, a->rdlength);
  844. goto again;
  845. }
  846. memcpy(a->buf + (a->add_count * ma.rdlength), ma.rdata, ma.rdlength);
  847. ++a->add_count;
  848. }
  849. }
  850. DPRINTF("Answer name = |%s|\n", a->dotted);
  851. DPRINTF("Answer type = |%d|\n", a->atype);
  852. close(fd);
  853. if (outpacket)
  854. *outpacket = packet;
  855. else
  856. free(packet);
  857. free(lookup);
  858. /* Mess with globals while under lock */
  859. __UCLIBC_MUTEX_LOCK(mylock);
  860. static_ns = local_ns;
  861. static_id = local_id;
  862. __UCLIBC_MUTEX_UNLOCK(mylock);
  863. return len; /* success! */
  864. tryall:
  865. /* if there are other nameservers, give them a go,
  866. otherwise return with error */
  867. variant = -1;
  868. local_ns = (local_ns + 1) % nscount;
  869. if (local_ns == 0)
  870. retries++;
  871. continue;
  872. again:
  873. /* if there are searchdomains, try them or fallback as passed */
  874. if (!ends_with_dot) {
  875. int sdomains;
  876. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  877. sdomains = __searchdomains;
  878. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  879. if (variant < sdomains - 1) {
  880. /* next search */
  881. variant++;
  882. continue;
  883. }
  884. }
  885. /* next server, first search */
  886. local_ns = (local_ns + 1) % nscount;
  887. if (local_ns == 0)
  888. retries++;
  889. variant = -1;
  890. }
  891. fail:
  892. if (fd != -1)
  893. close(fd);
  894. free(lookup);
  895. free(packet);
  896. h_errno = NETDB_INTERNAL;
  897. /* Mess with globals while under lock */
  898. if (local_ns != -1) {
  899. __UCLIBC_MUTEX_LOCK(mylock);
  900. static_ns = local_ns;
  901. static_id = local_id;
  902. __UCLIBC_MUTEX_UNLOCK(mylock);
  903. }
  904. return -1;
  905. }
  906. #endif
  907. #ifdef L_opennameservers
  908. /* We use __resolv_lock to guard access to the
  909. * '__nameservers' and __searchdomains globals */
  910. int __nameservers;
  911. char * __nameserver[MAX_SERVERS];
  912. int __searchdomains;
  913. char * __searchdomain[MAX_SEARCH];
  914. __UCLIBC_MUTEX_INIT(__resolv_lock, PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP);
  915. /*
  916. * we currently read formats not quite the same as that on normal
  917. * unix systems, we can have a list of nameservers after the keyword.
  918. */
  919. void attribute_hidden __open_nameservers(void)
  920. {
  921. FILE *fp;
  922. int i;
  923. #define RESOLV_ARGS 5
  924. char szBuffer[128], *p, *argv[RESOLV_ARGS];
  925. int argc;
  926. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  927. if (__nameservers > 0)
  928. goto DONE;
  929. if ((fp = fopen("/etc/resolv.conf", "r")) ||
  930. (fp = fopen("/etc/config/resolv.conf", "r")))
  931. {
  932. while (fgets(szBuffer, sizeof(szBuffer), fp) != NULL) {
  933. for (p = szBuffer; *p && isspace(*p); p++)
  934. /* skip white space */;
  935. if (*p == '\0' || *p == '\n' || *p == '#') /* skip comments etc */
  936. continue;
  937. argc = 0;
  938. while (*p && argc < RESOLV_ARGS) {
  939. argv[argc++] = p;
  940. while (*p && !isspace(*p) && *p != '\n')
  941. p++;
  942. while (*p && (isspace(*p) || *p == '\n')) /* remove spaces */
  943. *p++ = '\0';
  944. }
  945. if (strcmp(argv[0], "nameserver") == 0) {
  946. for (i = 1; i < argc && __nameservers < MAX_SERVERS; i++) {
  947. __nameserver[__nameservers++] = strdup(argv[i]); /* TODO: what if this fails? */
  948. DPRINTF("adding nameserver %s\n", argv[i]);
  949. }
  950. }
  951. /* domain and search are mutually exclusive, the last one wins */
  952. if (strcmp(argv[0],"domain") == 0 || strcmp(argv[0],"search") == 0) {
  953. while (__searchdomains > 0) {
  954. free(__searchdomain[--__searchdomains]);
  955. __searchdomain[__searchdomains] = NULL;
  956. }
  957. for (i = 1; i < argc && __searchdomains < MAX_SEARCH; i++) {
  958. __searchdomain[__searchdomains++] = strdup(argv[i]); /* TODO: what if this fails? */
  959. DPRINTF("adding search %s\n", argv[i]);
  960. }
  961. }
  962. }
  963. fclose(fp);
  964. DPRINTF("nameservers = %d\n", __nameservers);
  965. goto DONE;
  966. }
  967. DPRINTF("failed to open %s\n", "resolv.conf");
  968. h_errno = NO_RECOVERY;
  969. /* rv = -1; */
  970. DONE:
  971. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  972. /* return rv; */
  973. }
  974. #endif
  975. #ifdef L_closenameservers
  976. void attribute_hidden __close_nameservers(void)
  977. {
  978. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  979. while (__nameservers > 0) {
  980. free(__nameserver[--__nameservers]);
  981. __nameserver[__nameservers] = NULL;
  982. }
  983. while (__searchdomains > 0) {
  984. free(__searchdomain[--__searchdomains]);
  985. __searchdomain[__searchdomains] = NULL;
  986. }
  987. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  988. }
  989. #endif
  990. #ifdef L_gethostbyname
  991. struct hostent *gethostbyname(const char *name)
  992. {
  993. static struct hostent h;
  994. static char buf[sizeof(struct in_addr) +
  995. sizeof(struct in_addr *)*2 +
  996. sizeof(char *)*ALIAS_DIM + 384/*namebuffer*/ + 32/* margin */];
  997. struct hostent *hp;
  998. gethostbyname_r(name, &h, buf, sizeof(buf), &hp, &h_errno);
  999. return hp;
  1000. }
  1001. libc_hidden_def(gethostbyname)
  1002. #endif
  1003. #ifdef L_gethostbyname2
  1004. struct hostent *gethostbyname2(const char *name, int family)
  1005. {
  1006. #ifndef __UCLIBC_HAS_IPV6__
  1007. return family == AF_INET ? gethostbyname(name) : (struct hostent*)0;
  1008. #else /* __UCLIBC_HAS_IPV6__ */
  1009. static struct hostent h;
  1010. static char buf[sizeof(struct in6_addr) +
  1011. sizeof(struct in6_addr *)*2 +
  1012. sizeof(char *)*ALIAS_DIM + 384/*namebuffer*/ + 32/* margin */];
  1013. struct hostent *hp;
  1014. gethostbyname2_r(name, family, &h, buf, sizeof(buf), &hp, &h_errno);
  1015. return hp;
  1016. #endif /* __UCLIBC_HAS_IPV6__ */
  1017. }
  1018. #endif
  1019. #ifdef L_res_init
  1020. /* We use __resolv_lock to guard access to global '_res' */
  1021. struct __res_state _res;
  1022. int res_init(void)
  1023. {
  1024. struct __res_state *rp = &(_res);
  1025. __UCLIBC_MUTEX_LOCK(__resolv_lock); /* must be a recursive lock! */
  1026. __close_nameservers();
  1027. __open_nameservers();
  1028. rp->retrans = RES_TIMEOUT;
  1029. rp->retry = 4;
  1030. rp->options = RES_INIT;
  1031. rp->id = (u_int) random();
  1032. rp->nsaddr.sin_addr.s_addr = INADDR_ANY;
  1033. rp->nsaddr.sin_family = AF_INET;
  1034. rp->nsaddr.sin_port = htons(NAMESERVER_PORT);
  1035. rp->ndots = 1;
  1036. /** rp->pfcode = 0; **/
  1037. rp->_vcsock = -1;
  1038. /** rp->_flags = 0; **/
  1039. /** rp->qhook = NULL; **/
  1040. /** rp->rhook = NULL; **/
  1041. /** rp->_u._ext.nsinit = 0; **/
  1042. if (__searchdomains) {
  1043. int i;
  1044. for (i = 0; i < __searchdomains; i++)
  1045. rp->dnsrch[i] = __searchdomain[i];
  1046. }
  1047. if (__nameservers) {
  1048. int i;
  1049. struct in_addr a;
  1050. for (i = 0; i < __nameservers; i++) {
  1051. if (inet_aton(__nameserver[i], &a)) {
  1052. rp->nsaddr_list[i].sin_addr = a;
  1053. rp->nsaddr_list[i].sin_family = AF_INET;
  1054. rp->nsaddr_list[i].sin_port = htons(NAMESERVER_PORT);
  1055. }
  1056. }
  1057. }
  1058. rp->nscount = __nameservers;
  1059. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1060. return 0;
  1061. }
  1062. libc_hidden_def(res_init)
  1063. #ifdef __UCLIBC_HAS_BSD_RES_CLOSE__
  1064. void res_close(void)
  1065. {
  1066. __close_nameservers();
  1067. memset(&_res, 0, sizeof(_res));
  1068. }
  1069. #endif
  1070. #endif
  1071. #ifdef L_res_query
  1072. #ifndef MIN
  1073. #define MIN(x, y) ((x) < (y) ? (x) : (y))
  1074. #endif
  1075. int res_query(const char *dname, int class, int type,
  1076. unsigned char *answer, int anslen)
  1077. {
  1078. int i;
  1079. unsigned char * packet = 0;
  1080. struct resolv_answer a;
  1081. int __nameserversXX;
  1082. char ** __nameserverXX;
  1083. if (!dname || class != 1 /* CLASS_IN */) {
  1084. h_errno = NO_RECOVERY;
  1085. return -1;
  1086. }
  1087. memset(&a, '\0', sizeof(a));
  1088. __open_nameservers();
  1089. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1090. __nameserversXX = __nameservers;
  1091. __nameserverXX = __nameserver;
  1092. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1093. i = __dns_lookup(dname, type, __nameserversXX, __nameserverXX, &packet, &a);
  1094. if (i < 0) {
  1095. h_errno = TRY_AGAIN;
  1096. return -1;
  1097. }
  1098. free(a.dotted);
  1099. if (a.atype == type) { /* CNAME */
  1100. i = MIN(anslen, i);
  1101. memcpy(answer, packet, i);
  1102. }
  1103. free(packet);
  1104. return i;
  1105. }
  1106. libc_hidden_def(res_query)
  1107. /*
  1108. * Formulate a normal query, send, and retrieve answer in supplied buffer.
  1109. * Return the size of the response on success, -1 on error.
  1110. * If enabled, implement search rules until answer or unrecoverable failure
  1111. * is detected. Error code, if any, is left in h_errno.
  1112. */
  1113. #define __TRAILING_DOT (1<<0)
  1114. #define __GOT_NODATA (1<<1)
  1115. #define __GOT_SERVFAIL (1<<2)
  1116. #define __TRIED_AS_IS (1<<3)
  1117. int res_search(const char *name, int class, int type, u_char *answer,
  1118. int anslen)
  1119. {
  1120. const char *cp, * const *domain;
  1121. HEADER *hp = (HEADER *)(void *)answer;
  1122. u_int dots;
  1123. unsigned _state = 0;
  1124. int ret, saved_herrno;
  1125. u_long _res_options;
  1126. unsigned _res_ndots;
  1127. char **_res_dnsrch;
  1128. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1129. _res_options = _res.options;
  1130. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1131. if ((!name || !answer) || ((_res_options & RES_INIT) == 0 && res_init() == -1)) {
  1132. h_errno = NETDB_INTERNAL;
  1133. return -1;
  1134. }
  1135. errno = 0;
  1136. h_errno = HOST_NOT_FOUND; /* default, if we never query */
  1137. dots = 0;
  1138. for (cp = name; *cp; cp++)
  1139. dots += (*cp == '.');
  1140. if (cp > name && *--cp == '.')
  1141. _state |= __TRAILING_DOT;
  1142. /*
  1143. * If there are dots in the name already, let's just give it a try
  1144. * 'as is'. The threshold can be set with the "ndots" option.
  1145. */
  1146. saved_herrno = -1;
  1147. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1148. _res_ndots = _res.ndots;
  1149. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1150. if (dots >= _res_ndots) {
  1151. ret = res_querydomain(name, NULL, class, type, answer, anslen);
  1152. if (ret > 0)
  1153. return ret;
  1154. saved_herrno = h_errno;
  1155. _state |= __TRIED_AS_IS;
  1156. }
  1157. /*
  1158. * We do at least one level of search if
  1159. * - there is no dot and RES_DEFNAME is set, or
  1160. * - there is at least one dot, there is no trailing dot,
  1161. * and RES_DNSRCH is set.
  1162. */
  1163. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1164. _res_options = _res.options;
  1165. _res_dnsrch = _res.dnsrch;
  1166. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1167. if ((!dots && (_res_options & RES_DEFNAMES)) ||
  1168. (dots && !(_state & __TRAILING_DOT) && (_res_options & RES_DNSRCH))) {
  1169. bool done = 0;
  1170. for (domain = (const char * const *)_res_dnsrch;
  1171. *domain && !done;
  1172. domain++) {
  1173. ret = res_querydomain(name, *domain, class, type,
  1174. answer, anslen);
  1175. if (ret > 0)
  1176. return ret;
  1177. /*
  1178. * If no server present, give up.
  1179. * If name isn't found in this domain,
  1180. * keep trying higher domains in the search list
  1181. * (if that's enabled).
  1182. * On a NO_DATA error, keep trying, otherwise
  1183. * a wildcard entry of another type could keep us
  1184. * from finding this entry higher in the domain.
  1185. * If we get some other error (negative answer or
  1186. * server failure), then stop searching up,
  1187. * but try the input name below in case it's
  1188. * fully-qualified.
  1189. */
  1190. if (errno == ECONNREFUSED) {
  1191. h_errno = TRY_AGAIN;
  1192. return -1;
  1193. }
  1194. switch (h_errno) {
  1195. case NO_DATA:
  1196. _state |= __GOT_NODATA;
  1197. /* FALLTHROUGH */
  1198. case HOST_NOT_FOUND:
  1199. /* keep trying */
  1200. break;
  1201. case TRY_AGAIN:
  1202. if (hp->rcode == SERVFAIL) {
  1203. /* try next search element, if any */
  1204. _state |= __GOT_SERVFAIL;
  1205. break;
  1206. }
  1207. /* FALLTHROUGH */
  1208. default:
  1209. /* anything else implies that we're done */
  1210. done = 1;
  1211. }
  1212. /*
  1213. * if we got here for some reason other than DNSRCH,
  1214. * we only wanted one iteration of the loop, so stop.
  1215. */
  1216. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1217. _res_options = _res.options;
  1218. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1219. if (!(_res_options & RES_DNSRCH))
  1220. done = 1;
  1221. }
  1222. }
  1223. /*
  1224. * if we have not already tried the name "as is", do that now.
  1225. * note that we do this regardless of how many dots were in the
  1226. * name or whether it ends with a dot.
  1227. */
  1228. if (!(_state & __TRIED_AS_IS)) {
  1229. ret = res_querydomain(name, NULL, class, type, answer, anslen);
  1230. if (ret > 0)
  1231. return ret;
  1232. }
  1233. /*
  1234. * if we got here, we didn't satisfy the search.
  1235. * if we did an initial full query, return that query's h_errno
  1236. * (note that we wouldn't be here if that query had succeeded).
  1237. * else if we ever got a nodata, send that back as the reason.
  1238. * else send back meaningless h_errno, that being the one from
  1239. * the last DNSRCH we did.
  1240. */
  1241. if (saved_herrno != -1)
  1242. h_errno = saved_herrno;
  1243. else if (_state & __GOT_NODATA)
  1244. h_errno = NO_DATA;
  1245. else if (_state & __GOT_SERVFAIL)
  1246. h_errno = TRY_AGAIN;
  1247. return -1;
  1248. }
  1249. #undef __TRAILING_DOT
  1250. #undef __GOT_NODATA
  1251. #undef __GOT_SERVFAIL
  1252. #undef __TRIED_AS_IS
  1253. /*
  1254. * Perform a call on res_query on the concatenation of name and domain,
  1255. * removing a trailing dot from name if domain is NULL.
  1256. */
  1257. int res_querydomain(const char *name, const char *domain, int class, int type,
  1258. u_char * answer, int anslen)
  1259. {
  1260. char nbuf[MAXDNAME];
  1261. const char *longname = nbuf;
  1262. size_t n, d;
  1263. u_long _res_options;
  1264. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1265. _res_options = _res.options;
  1266. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1267. if ((!name || !answer) || ((_res_options & RES_INIT) == 0 && res_init() == -1)) {
  1268. h_errno = NETDB_INTERNAL;
  1269. return -1;
  1270. }
  1271. #ifdef DEBUG
  1272. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1273. _res_options = _res.options;
  1274. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1275. if (_res_options & RES_DEBUG)
  1276. printf(";; res_querydomain(%s, %s, %d, %d)\n",
  1277. name, (domain ? domain : "<Nil>"), class, type);
  1278. #endif
  1279. if (domain == NULL) {
  1280. /*
  1281. * Check for trailing '.';
  1282. * copy without '.' if present.
  1283. */
  1284. n = strlen(name);
  1285. if (n + 1 > sizeof(nbuf)) {
  1286. h_errno = NO_RECOVERY;
  1287. return -1;
  1288. }
  1289. if (n > 0 && name[--n] == '.') {
  1290. strncpy(nbuf, name, n);
  1291. nbuf[n] = '\0';
  1292. } else
  1293. longname = name;
  1294. } else {
  1295. n = strlen(name);
  1296. d = strlen(domain);
  1297. if (n + 1 + d + 1 > sizeof(nbuf)) {
  1298. h_errno = NO_RECOVERY;
  1299. return -1;
  1300. }
  1301. snprintf(nbuf, sizeof(nbuf), "%s.%s", name, domain);
  1302. }
  1303. return res_query(longname, class, type, answer, anslen);
  1304. }
  1305. libc_hidden_def(res_querydomain)
  1306. /* res_mkquery */
  1307. /* res_send */
  1308. /* dn_comp */
  1309. /* dn_expand */
  1310. #endif
  1311. #ifdef L_gethostbyaddr
  1312. struct hostent *gethostbyaddr (const void *addr, socklen_t len, int type)
  1313. {
  1314. static struct hostent h;
  1315. static char buf[
  1316. #ifndef __UCLIBC_HAS_IPV6__
  1317. sizeof(struct in_addr) + sizeof(struct in_addr *)*2 +
  1318. #else
  1319. sizeof(struct in6_addr) + sizeof(struct in6_addr *)*2 +
  1320. #endif /* __UCLIBC_HAS_IPV6__ */
  1321. sizeof(char *)*ALIAS_DIM + 384 /*namebuffer*/ + 32 /* margin */];
  1322. struct hostent *hp;
  1323. gethostbyaddr_r(addr, len, type, &h, buf, sizeof(buf), &hp, &h_errno);
  1324. return hp;
  1325. }
  1326. libc_hidden_def(gethostbyaddr)
  1327. #endif
  1328. #ifdef L_read_etc_hosts_r
  1329. FILE * __open_etc_hosts(void)
  1330. {
  1331. FILE * fp;
  1332. if ((fp = fopen("/etc/hosts", "r")) == NULL) {
  1333. fp = fopen("/etc/config/hosts", "r");
  1334. }
  1335. return fp;
  1336. }
  1337. int attribute_hidden __read_etc_hosts_r(FILE * fp, const char * name, int type,
  1338. enum etc_hosts_action action,
  1339. struct hostent * result_buf,
  1340. char * buf, size_t buflen,
  1341. struct hostent ** result,
  1342. int * h_errnop)
  1343. {
  1344. struct in_addr *in = NULL;
  1345. struct in_addr **addr_list = NULL;
  1346. #ifdef __UCLIBC_HAS_IPV6__
  1347. struct in6_addr *in6 = NULL;
  1348. struct in6_addr **addr_list6 = NULL;
  1349. #endif /* __UCLIBC_HAS_IPV6__ */
  1350. char *cp, **alias;
  1351. int aliases, i, ret = HOST_NOT_FOUND;
  1352. /* make sure user char * is aligned */
  1353. i = ALIGN_BUFFER_OFFSET(buf);
  1354. if (unlikely(i)) {
  1355. if (buflen < i)
  1356. return ERANGE;
  1357. buf += i;
  1358. buflen -= i;
  1359. }
  1360. if (buflen < sizeof(char *)*ALIAS_DIM)
  1361. return ERANGE;
  1362. alias = (char **)buf;
  1363. buf += sizeof(char **)*ALIAS_DIM;
  1364. buflen -= sizeof(char **)*ALIAS_DIM;
  1365. if (action != GETHOSTENT) {
  1366. #ifdef __UCLIBC_HAS_IPV6__
  1367. char *p = buf;
  1368. size_t len = buflen;
  1369. #endif /* __UCLIBC_HAS_IPV6__ */
  1370. *h_errnop = NETDB_INTERNAL;
  1371. if (buflen < sizeof(*in))
  1372. return ERANGE;
  1373. in = (struct in_addr*)buf;
  1374. buf += sizeof(*in);
  1375. buflen -= sizeof(*in);
  1376. if (buflen < sizeof(*addr_list)*2)
  1377. return ERANGE;
  1378. addr_list = (struct in_addr **)buf;
  1379. buf += sizeof(*addr_list)*2;
  1380. buflen -= sizeof(*addr_list)*2;
  1381. #ifdef __UCLIBC_HAS_IPV6__
  1382. if (len < sizeof(*in6))
  1383. return ERANGE;
  1384. in6 = (struct in6_addr*)p;
  1385. p += sizeof(*in6);
  1386. len -= sizeof(*in6);
  1387. if (len < sizeof(*addr_list6)*2)
  1388. return ERANGE;
  1389. addr_list6 = (struct in6_addr**)p;
  1390. p += sizeof(*addr_list6)*2;
  1391. len -= sizeof(*addr_list6)*2;
  1392. if (len < buflen) {
  1393. buflen = len;
  1394. buf = p;
  1395. }
  1396. #endif /* __UCLIBC_HAS_IPV6__ */
  1397. if (buflen < 80)
  1398. return ERANGE;
  1399. fp = __open_etc_hosts();
  1400. if (fp == NULL) {
  1401. *result = NULL;
  1402. return errno;
  1403. }
  1404. }
  1405. *h_errnop = HOST_NOT_FOUND;
  1406. while (fgets(buf, buflen, fp)) {
  1407. cp = strchr(buf, '#');
  1408. if (cp)
  1409. *cp = '\0';
  1410. DPRINTF("Looking at: %s\n", buf);
  1411. aliases = 0;
  1412. cp = buf;
  1413. while (*cp) {
  1414. while (*cp && isspace(*cp))
  1415. *cp++ = '\0';
  1416. if (!*cp)
  1417. break;
  1418. if (aliases < (2+MAX_ALIASES))
  1419. alias[aliases++] = cp;
  1420. while (*cp && !isspace(*cp))
  1421. cp++;
  1422. }
  1423. alias[aliases] = 0;
  1424. if (aliases < 2)
  1425. continue; /* syntax error really */
  1426. if (action == GETHOSTENT) {
  1427. /* Return whatever the next entry happens to be. */
  1428. break;
  1429. }
  1430. if (action == GET_HOSTS_BYADDR) {
  1431. if (strcmp(name, alias[0]) != 0)
  1432. continue;
  1433. } else {
  1434. /* GET_HOSTS_BYNAME */
  1435. for (i = 1; i < aliases; i++)
  1436. if (strcasecmp(name, alias[i]) == 0)
  1437. break;
  1438. if (i >= aliases)
  1439. continue;
  1440. }
  1441. if (type == AF_INET && inet_pton(AF_INET, alias[0], in) > 0) {
  1442. DPRINTF("Found INET\n");
  1443. addr_list[0] = in;
  1444. addr_list[1] = 0;
  1445. result_buf->h_name = alias[1];
  1446. result_buf->h_addrtype = AF_INET;
  1447. result_buf->h_length = sizeof(*in);
  1448. result_buf->h_addr_list = (char**) addr_list;
  1449. result_buf->h_aliases = alias + 2;
  1450. *result = result_buf;
  1451. ret = NETDB_SUCCESS;
  1452. #ifdef __UCLIBC_HAS_IPV6__
  1453. } else if (type == AF_INET6 && inet_pton(AF_INET6, alias[0], in6) > 0) {
  1454. DPRINTF("Found INET6\n");
  1455. addr_list6[0] = in6;
  1456. addr_list6[1] = 0;
  1457. result_buf->h_name = alias[1];
  1458. result_buf->h_addrtype = AF_INET6;
  1459. result_buf->h_length = sizeof(*in6);
  1460. result_buf->h_addr_list = (char**) addr_list6;
  1461. result_buf->h_aliases = alias + 2;
  1462. *result = result_buf;
  1463. ret = NETDB_SUCCESS;
  1464. #endif /* __UCLIBC_HAS_IPV6__ */
  1465. } else {
  1466. /* continue parsing in the hope the user has multiple
  1467. * host types listed in the database like so:
  1468. * <ipv4 addr> host
  1469. * <ipv6 addr> host
  1470. * If looking for an IPv6 addr, don't bail when we got the IPv4
  1471. */
  1472. DPRINTF("Error: Found host but diff network type\n");
  1473. /* NB: gethostbyname2_r depends on this feature
  1474. * to avoid looking for IPv6 addr of "localhost" etc */
  1475. ret = TRY_AGAIN;
  1476. continue;
  1477. }
  1478. break;
  1479. }
  1480. if (action != GETHOSTENT)
  1481. fclose(fp);
  1482. return ret;
  1483. }
  1484. #endif
  1485. #ifdef L_gethostent
  1486. __UCLIBC_MUTEX_STATIC(mylock, PTHREAD_MUTEX_INITIALIZER);
  1487. static smallint __stay_open;
  1488. static FILE * __gethostent_fp;
  1489. void endhostent(void)
  1490. {
  1491. __UCLIBC_MUTEX_LOCK(mylock);
  1492. __stay_open = 0;
  1493. if (__gethostent_fp) {
  1494. fclose(__gethostent_fp);
  1495. __gethostent_fp = NULL;
  1496. }
  1497. __UCLIBC_MUTEX_UNLOCK(mylock);
  1498. }
  1499. void sethostent(int stay_open)
  1500. {
  1501. __UCLIBC_MUTEX_LOCK(mylock);
  1502. __stay_open = (stay_open != 0);
  1503. __UCLIBC_MUTEX_UNLOCK(mylock);
  1504. }
  1505. int gethostent_r(struct hostent *result_buf, char *buf, size_t buflen,
  1506. struct hostent **result, int *h_errnop)
  1507. {
  1508. int ret;
  1509. __UCLIBC_MUTEX_LOCK(mylock);
  1510. if (__gethostent_fp == NULL) {
  1511. __gethostent_fp = __open_etc_hosts();
  1512. if (__gethostent_fp == NULL) {
  1513. *result = NULL;
  1514. ret = TRY_AGAIN;
  1515. goto DONE;
  1516. }
  1517. }
  1518. ret = __read_etc_hosts_r(__gethostent_fp, NULL, AF_INET, GETHOSTENT,
  1519. result_buf, buf, buflen, result, h_errnop);
  1520. if (__stay_open == 0) {
  1521. fclose(__gethostent_fp);
  1522. __gethostent_fp = NULL;
  1523. }
  1524. DONE:
  1525. __UCLIBC_MUTEX_UNLOCK(mylock);
  1526. return ret;
  1527. }
  1528. libc_hidden_def(gethostent_r)
  1529. struct hostent *gethostent(void)
  1530. {
  1531. static struct hostent h;
  1532. static char buf[
  1533. #ifndef __UCLIBC_HAS_IPV6__
  1534. sizeof(struct in_addr) + sizeof(struct in_addr *)*2 +
  1535. #else
  1536. sizeof(struct in6_addr) + sizeof(struct in6_addr *)*2 +
  1537. #endif /* __UCLIBC_HAS_IPV6__ */
  1538. sizeof(char *)*ALIAS_DIM +
  1539. 80 /*namebuffer*/ + 2 /* margin */];
  1540. struct hostent *host;
  1541. __UCLIBC_MUTEX_LOCK(mylock);
  1542. gethostent_r(&h, buf, sizeof(buf), &host, &h_errno);
  1543. __UCLIBC_MUTEX_UNLOCK(mylock);
  1544. return host;
  1545. }
  1546. #endif
  1547. #ifdef L_get_hosts_byname_r
  1548. int attribute_hidden __get_hosts_byname_r(const char * name, int type,
  1549. struct hostent * result_buf,
  1550. char * buf, size_t buflen,
  1551. struct hostent ** result,
  1552. int * h_errnop)
  1553. {
  1554. return __read_etc_hosts_r(NULL, name, type, GET_HOSTS_BYNAME,
  1555. result_buf, buf, buflen, result, h_errnop);
  1556. }
  1557. #endif
  1558. #ifdef L_get_hosts_byaddr_r
  1559. int attribute_hidden __get_hosts_byaddr_r(const char * addr, int len, int type,
  1560. struct hostent * result_buf,
  1561. char * buf, size_t buflen,
  1562. struct hostent ** result,
  1563. int * h_errnop)
  1564. {
  1565. #ifndef __UCLIBC_HAS_IPV6__
  1566. char ipaddr[INET_ADDRSTRLEN];
  1567. #else
  1568. char ipaddr[INET6_ADDRSTRLEN];
  1569. #endif /* __UCLIBC_HAS_IPV6__ */
  1570. switch (type) {
  1571. case AF_INET:
  1572. if (len != sizeof(struct in_addr))
  1573. return 0;
  1574. break;
  1575. #ifdef __UCLIBC_HAS_IPV6__
  1576. case AF_INET6:
  1577. if (len != sizeof(struct in6_addr))
  1578. return 0;
  1579. break;
  1580. #endif /* __UCLIBC_HAS_IPV6__ */
  1581. default:
  1582. return 0;
  1583. }
  1584. inet_ntop(type, addr, ipaddr, sizeof(ipaddr));
  1585. return __read_etc_hosts_r(NULL, ipaddr, type, GET_HOSTS_BYADDR,
  1586. result_buf, buf, buflen, result, h_errnop);
  1587. }
  1588. #endif
  1589. #ifdef L_getnameinfo
  1590. #ifndef min
  1591. # define min(x,y) (((x) > (y)) ? (y) : (x))
  1592. #endif /* min */
  1593. libc_hidden_proto(getnameinfo)
  1594. int getnameinfo(const struct sockaddr *sa, socklen_t addrlen, char *host,
  1595. socklen_t hostlen, char *serv, socklen_t servlen,
  1596. unsigned int flags)
  1597. {
  1598. int serrno = errno;
  1599. unsigned ok;
  1600. struct hostent *h = NULL;
  1601. char domain[256];
  1602. if (flags & ~(NI_NUMERICHOST|NI_NUMERICSERV|NI_NOFQDN|NI_NAMEREQD|NI_DGRAM))
  1603. return EAI_BADFLAGS;
  1604. if (sa == NULL || addrlen < sizeof (sa_family_t))
  1605. goto BAD_FAM;
  1606. ok = sa->sa_family;
  1607. if (ok == AF_LOCAL) /* valid */;
  1608. #ifdef __UCLIBC_HAS_IPV4__
  1609. else if (ok == AF_INET) {
  1610. if (addrlen < sizeof (struct sockaddr_in))
  1611. goto BAD_FAM;
  1612. }
  1613. #endif
  1614. #ifdef __UCLIBC_HAS_IPV6__
  1615. else if (ok == AF_INET6) {
  1616. if (addrlen < sizeof (struct sockaddr_in6))
  1617. goto BAD_FAM;
  1618. }
  1619. #endif /* __UCLIBC_HAS_IPV6__ */
  1620. else
  1621. BAD_FAM:
  1622. return EAI_FAMILY;
  1623. ok = 0;
  1624. if (host != NULL && hostlen > 0)
  1625. switch (sa->sa_family) {
  1626. case AF_INET:
  1627. #ifdef __UCLIBC_HAS_IPV6__
  1628. case AF_INET6:
  1629. #endif /* __UCLIBC_HAS_IPV6__ */
  1630. if (!(flags & NI_NUMERICHOST)) {
  1631. #ifdef __UCLIBC_HAS_IPV6__
  1632. if (sa->sa_family == AF_INET6)
  1633. h = gethostbyaddr ((const void *)
  1634. &(((const struct sockaddr_in6 *) sa)->sin6_addr),
  1635. sizeof(struct in6_addr), AF_INET6);
  1636. #endif /* __UCLIBC_HAS_IPV6__ */
  1637. #if defined __UCLIBC_HAS_IPV6__ && defined __UCLIBC_HAS_IPV4__
  1638. else
  1639. #endif
  1640. #ifdef __UCLIBC_HAS_IPV4__
  1641. h = gethostbyaddr ((const void *)
  1642. &(((const struct sockaddr_in *)sa)->sin_addr),
  1643. sizeof(struct in_addr), AF_INET);
  1644. #endif /* __UCLIBC_HAS_IPV4__ */
  1645. if (h) {
  1646. char *c;
  1647. if ((flags & NI_NOFQDN)
  1648. && (__libc_getdomainname (domain, sizeof(domain)) == 0)
  1649. && (c = strstr (h->h_name, domain))
  1650. && (c != h->h_name) && (*(--c) == '.')) {
  1651. strncpy (host, h->h_name,
  1652. min(hostlen, (size_t) (c - h->h_name)));
  1653. host[min(hostlen - 1, (size_t) (c - h->h_name))] = '\0';
  1654. } else {
  1655. strncpy (host, h->h_name, hostlen);
  1656. }
  1657. ok = 1;
  1658. }
  1659. }
  1660. if (!ok) {
  1661. const char *c;
  1662. if (flags & NI_NAMEREQD) {
  1663. errno = serrno;
  1664. return EAI_NONAME;
  1665. }
  1666. #ifdef __UCLIBC_HAS_IPV6__
  1667. if (sa->sa_family == AF_INET6) {
  1668. const struct sockaddr_in6 *sin6p;
  1669. sin6p = (const struct sockaddr_in6 *) sa;
  1670. c = inet_ntop (AF_INET6,
  1671. (const void *) &sin6p->sin6_addr, host, hostlen);
  1672. #if 0
  1673. /* Does scope id need to be supported? */
  1674. uint32_t scopeid;
  1675. scopeid = sin6p->sin6_scope_id;
  1676. if (scopeid != 0) {
  1677. /* Buffer is >= IFNAMSIZ+1. */
  1678. char scopebuf[IFNAMSIZ + 1];
  1679. char *scopeptr;
  1680. int ni_numericscope = 0;
  1681. size_t real_hostlen = strnlen (host, hostlen);
  1682. size_t scopelen = 0;
  1683. scopebuf[0] = SCOPE_DELIMITER;
  1684. scopebuf[1] = '\0';
  1685. scopeptr = &scopebuf[1];
  1686. if (IN6_IS_ADDR_LINKLOCAL (&sin6p->sin6_addr)
  1687. || IN6_IS_ADDR_MC_LINKLOCAL (&sin6p->sin6_addr)) {
  1688. if (if_indextoname (scopeid, scopeptr) == NULL)
  1689. ++ni_numericscope;
  1690. else
  1691. scopelen = strlen (scopebuf);
  1692. } else {
  1693. ++ni_numericscope;
  1694. }
  1695. if (ni_numericscope)
  1696. scopelen = 1 + snprintf (scopeptr,
  1697. (scopebuf
  1698. + sizeof scopebuf
  1699. - scopeptr),
  1700. "%u", scopeid);
  1701. if (real_hostlen + scopelen + 1 > hostlen)
  1702. return EAI_SYSTEM;
  1703. memcpy (host + real_hostlen, scopebuf, scopelen + 1);
  1704. }
  1705. #endif
  1706. }
  1707. #endif /* __UCLIBC_HAS_IPV6__ */
  1708. #if defined __UCLIBC_HAS_IPV6__ && defined __UCLIBC_HAS_IPV4__
  1709. else
  1710. #endif /* __UCLIBC_HAS_IPV6__ && defined __UCLIBC_HAS_IPV4__ */
  1711. #if defined __UCLIBC_HAS_IPV4__
  1712. c = inet_ntop (AF_INET, (const void *)
  1713. &(((const struct sockaddr_in *) sa)->sin_addr),
  1714. host, hostlen);
  1715. #endif /* __UCLIBC_HAS_IPV4__ */
  1716. if (c == NULL) {
  1717. errno = serrno;
  1718. return EAI_SYSTEM;
  1719. }
  1720. ok = 1;
  1721. }
  1722. break;
  1723. case AF_LOCAL:
  1724. if (!(flags & NI_NUMERICHOST)) {
  1725. struct utsname utsname;
  1726. if (!uname (&utsname)) {
  1727. strncpy (host, utsname.nodename, hostlen);
  1728. break;
  1729. };
  1730. };
  1731. if (flags & NI_NAMEREQD) {
  1732. errno = serrno;
  1733. return EAI_NONAME;
  1734. }
  1735. strncpy (host, "localhost", hostlen);
  1736. break;
  1737. /* Already checked above
  1738. default:
  1739. return EAI_FAMILY;
  1740. */
  1741. }
  1742. if (serv && (servlen > 0)) {
  1743. if (sa->sa_family == AF_LOCAL) {
  1744. strncpy (serv, ((const struct sockaddr_un *) sa)->sun_path, servlen);
  1745. } else { /* AF_INET || AF_INET6 */
  1746. if (!(flags & NI_NUMERICSERV)) {
  1747. struct servent *s;
  1748. s = getservbyport (((const struct sockaddr_in *) sa)->sin_port,
  1749. ((flags & NI_DGRAM) ? "udp" : "tcp"));
  1750. if (s) {
  1751. strncpy (serv, s->s_name, servlen);
  1752. goto DONE;
  1753. }
  1754. }
  1755. snprintf (serv, servlen, "%d",
  1756. ntohs (((const struct sockaddr_in *) sa)->sin_port));
  1757. }
  1758. }
  1759. DONE:
  1760. if (host && (hostlen > 0))
  1761. host[hostlen-1] = 0;
  1762. if (serv && (servlen > 0))
  1763. serv[servlen-1] = 0;
  1764. errno = serrno;
  1765. return 0;
  1766. }
  1767. libc_hidden_def(getnameinfo)
  1768. #endif
  1769. #ifdef L_gethostbyname_r
  1770. int gethostbyname_r(const char * name,
  1771. struct hostent * result_buf,
  1772. char * buf, size_t buflen,
  1773. struct hostent ** result,
  1774. int * h_errnop)
  1775. {
  1776. struct in_addr *in;
  1777. struct in_addr **addr_list;
  1778. char **alias;
  1779. unsigned char *packet;
  1780. struct resolv_answer a;
  1781. int i;
  1782. int __nameserversXX;
  1783. char ** __nameserverXX;
  1784. *result = NULL;
  1785. if (!name)
  1786. return EINVAL;
  1787. /* do /etc/hosts first */
  1788. {
  1789. int old_errno = errno; /* save the old errno and reset errno */
  1790. __set_errno(0); /* to check for missing /etc/hosts. */
  1791. i = __get_hosts_byname_r(name, AF_INET, result_buf,
  1792. buf, buflen, result, h_errnop);
  1793. if (i == 0)
  1794. return i;
  1795. switch (*h_errnop) {
  1796. case HOST_NOT_FOUND:
  1797. case NO_ADDRESS:
  1798. break;
  1799. case NETDB_INTERNAL:
  1800. if (errno == ENOENT) {
  1801. break;
  1802. }
  1803. /* else fall through */
  1804. default:
  1805. return i;
  1806. }
  1807. __set_errno(old_errno);
  1808. }
  1809. DPRINTF("Nothing found in /etc/hosts\n");
  1810. /* make sure user char * is aligned */
  1811. i = ALIGN_BUFFER_OFFSET(buf);
  1812. if (unlikely(i)) {
  1813. if (buflen < i)
  1814. return ERANGE;
  1815. buf += i;
  1816. buflen -= i;
  1817. }
  1818. *h_errnop = NETDB_INTERNAL;
  1819. if (buflen < sizeof(*in))
  1820. return ERANGE;
  1821. in = (struct in_addr*)buf;
  1822. buf += sizeof(*in);
  1823. buflen -= sizeof(*in);
  1824. if (buflen < sizeof(*addr_list)*2)
  1825. return ERANGE;
  1826. addr_list = (struct in_addr**)buf;
  1827. buf += sizeof(*addr_list)*2;
  1828. buflen -= sizeof(*addr_list)*2;
  1829. addr_list[0] = in;
  1830. addr_list[1] = 0;
  1831. if (buflen < sizeof(char *)*ALIAS_DIM)
  1832. return ERANGE;
  1833. alias = (char **)buf;
  1834. buf += sizeof(char **)*ALIAS_DIM;
  1835. buflen -= sizeof(char **)*ALIAS_DIM;
  1836. if (buflen < 256)
  1837. return ERANGE;
  1838. strncpy(buf, name, buflen);
  1839. alias[0] = buf;
  1840. alias[1] = NULL;
  1841. /* First check if this is already an address */
  1842. if (inet_aton(name, in)) {
  1843. result_buf->h_name = buf;
  1844. result_buf->h_addrtype = AF_INET;
  1845. result_buf->h_length = sizeof(*in);
  1846. result_buf->h_addr_list = (char **) addr_list;
  1847. result_buf->h_aliases = alias;
  1848. *result = result_buf;
  1849. *h_errnop = NETDB_SUCCESS;
  1850. return NETDB_SUCCESS;
  1851. }
  1852. __open_nameservers();
  1853. /*for (;;)*/ {
  1854. //FIXME: why was it a loop? It never loops...
  1855. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  1856. __nameserversXX = __nameservers;
  1857. __nameserverXX = __nameserver;
  1858. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  1859. a.buf = buf;
  1860. a.buflen = buflen;
  1861. a.add_count = 0;
  1862. i = __dns_lookup(name, T_A, __nameserversXX, __nameserverXX, &packet, &a);
  1863. if (i < 0) {
  1864. *h_errnop = HOST_NOT_FOUND;
  1865. DPRINTF("__dns_lookup\n");
  1866. return TRY_AGAIN;
  1867. }
  1868. if ((a.rdlength + sizeof(struct in_addr*)) * a.add_count + 256 > buflen) {
  1869. free(a.dotted);
  1870. free(packet);
  1871. *h_errnop = NETDB_INTERNAL;
  1872. DPRINTF("buffer too small for all addresses\n");
  1873. return ERANGE;
  1874. }
  1875. if (a.add_count > 0) {
  1876. memmove(buf - sizeof(struct in_addr*)*2, buf, a.add_count * a.rdlength);
  1877. addr_list = (struct in_addr**)(buf + a.add_count * a.rdlength);
  1878. addr_list[0] = in;
  1879. for (i = a.add_count - 1; i >= 0; --i)
  1880. addr_list[i+1] = (struct in_addr*)(buf - sizeof(struct in_addr*)*2 + a.rdlength * i);
  1881. addr_list[a.add_count + 1] = 0;
  1882. buflen -= (((char*)&(addr_list[a.add_count + 2])) - buf);
  1883. buf = (char*)&addr_list[a.add_count + 2];
  1884. }
  1885. strncpy(buf, a.dotted, buflen);
  1886. free(a.dotted);
  1887. if (a.atype == T_A) { /* ADDRESS */
  1888. memcpy(in, a.rdata, sizeof(*in));
  1889. result_buf->h_name = buf;
  1890. result_buf->h_addrtype = AF_INET;
  1891. result_buf->h_length = sizeof(*in);
  1892. result_buf->h_addr_list = (char **) addr_list;
  1893. #ifdef __UCLIBC_MJN3_ONLY__
  1894. #warning TODO -- generate the full list
  1895. #endif
  1896. result_buf->h_aliases = alias; /* TODO: generate the full list */
  1897. free(packet);
  1898. /*was: break;*/
  1899. *result = result_buf;
  1900. *h_errnop = NETDB_SUCCESS;
  1901. return NETDB_SUCCESS;
  1902. }
  1903. free(packet);
  1904. *h_errnop = HOST_NOT_FOUND;
  1905. return TRY_AGAIN;
  1906. }
  1907. /*
  1908. *result = result_buf;
  1909. *h_errnop = NETDB_SUCCESS;
  1910. return NETDB_SUCCESS;
  1911. */
  1912. }
  1913. libc_hidden_def(gethostbyname_r)
  1914. #endif
  1915. #ifdef L_gethostbyname2_r
  1916. int gethostbyname2_r(const char *name, int family,
  1917. struct hostent * result_buf,
  1918. char * buf, size_t buflen,
  1919. struct hostent ** result,
  1920. int * h_errnop)
  1921. {
  1922. #ifndef __UCLIBC_HAS_IPV6__
  1923. return family == (AF_INET)
  1924. ? gethostbyname_r(name, result_buf, buf, buflen, result, h_errnop)
  1925. : HOST_NOT_FOUND;
  1926. #else /* __UCLIBC_HAS_IPV6__ */
  1927. struct in6_addr *in;
  1928. struct in6_addr **addr_list;
  1929. unsigned char *packet;
  1930. struct resolv_answer a;
  1931. int i;
  1932. int nest = 0;
  1933. int __nameserversXX;
  1934. char ** __nameserverXX;
  1935. int wrong_af = 0;
  1936. if (family == AF_INET)
  1937. return gethostbyname_r(name, result_buf, buf, buflen, result, h_errnop);
  1938. if (family != AF_INET6)
  1939. return EINVAL;
  1940. __open_nameservers();
  1941. *result = NULL;
  1942. if (!name)
  1943. return EINVAL;
  1944. /* do /etc/hosts first */
  1945. {
  1946. int old_errno = errno; /* Save the old errno and reset errno */
  1947. __set_errno(0); /* to check for missing /etc/hosts. */
  1948. i = __get_hosts_byname_r(name, family, result_buf,
  1949. buf, buflen, result, h_errnop);
  1950. if (i == NETDB_SUCCESS) {
  1951. //FIXME: restore errno?
  1952. return i;
  1953. }
  1954. switch (*h_errnop) {
  1955. case HOST_NOT_FOUND:
  1956. wrong_af = (i == TRY_AGAIN);
  1957. case NO_ADDRESS:
  1958. break;
  1959. case NETDB_INTERNAL:
  1960. if (errno == ENOENT) {
  1961. break;
  1962. }
  1963. /* else fall through */
  1964. default:
  1965. return i;
  1966. }
  1967. __set_errno(old_errno);
  1968. }
  1969. DPRINTF("Nothing found in /etc/hosts\n");
  1970. *h_errnop = NETDB_INTERNAL;
  1971. if (buflen < sizeof(*in))
  1972. return ERANGE;
  1973. in = (struct in6_addr*)buf;
  1974. buf += sizeof(*in);
  1975. buflen -= sizeof(*in);
  1976. if (buflen < sizeof(*addr_list)*2)
  1977. return ERANGE;
  1978. addr_list = (struct in6_addr**)buf;
  1979. buf += sizeof(*addr_list)*2;
  1980. buflen -= sizeof(*addr_list)*2;
  1981. addr_list[0] = in;
  1982. addr_list[1] = 0;
  1983. if (buflen < 256)
  1984. return ERANGE;
  1985. strncpy(buf, name, buflen);
  1986. /* First check if this is already an address */
  1987. if (inet_pton(AF_INET6, name, in)) {
  1988. result_buf->h_name = buf;
  1989. result_buf->h_addrtype = AF_INET6;
  1990. result_buf->h_length = sizeof(*in);
  1991. result_buf->h_addr_list = (char **) addr_list;
  1992. *result = result_buf;
  1993. *h_errnop = NETDB_SUCCESS;
  1994. return NETDB_SUCCESS;
  1995. }
  1996. /* What if /etc/hosts has it but it's not IPv6?
  1997. * F.e. "127.0.0.1 localhost". We don't do DNS query for such hosts -
  1998. * "ping localhost" should be fast even if DNS server is down! */
  1999. if (wrong_af) {
  2000. *h_errnop = HOST_NOT_FOUND;
  2001. return TRY_AGAIN;
  2002. }
  2003. memset(&a, '\0', sizeof(a));
  2004. for (;;) {
  2005. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  2006. __nameserversXX = __nameservers;
  2007. __nameserverXX = __nameserver;
  2008. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  2009. i = __dns_lookup(buf, T_AAAA, __nameserversXX, __nameserverXX, &packet, &a);
  2010. if (i < 0) {
  2011. *h_errnop = HOST_NOT_FOUND;
  2012. return TRY_AGAIN;
  2013. }
  2014. strncpy(buf, a.dotted, buflen);
  2015. free(a.dotted);
  2016. if (a.atype == T_CNAME) { /* CNAME */
  2017. DPRINTF("Got a CNAME in gethostbyname()\n");
  2018. i = __decode_dotted(packet, a.rdoffset, buf, buflen);
  2019. free(packet);
  2020. if (i < 0) {
  2021. *h_errnop = NO_RECOVERY;
  2022. return -1;
  2023. }
  2024. if (++nest > MAX_RECURSE) {
  2025. *h_errnop = NO_RECOVERY;
  2026. return -1;
  2027. }
  2028. continue;
  2029. }
  2030. if (a.atype == T_AAAA) { /* ADDRESS */
  2031. memcpy(in, a.rdata, sizeof(*in));
  2032. result_buf->h_name = buf;
  2033. result_buf->h_addrtype = AF_INET6;
  2034. result_buf->h_length = sizeof(*in);
  2035. result_buf->h_addr_list = (char **) addr_list;
  2036. free(packet);
  2037. break;
  2038. }
  2039. free(packet);
  2040. *h_errnop = HOST_NOT_FOUND;
  2041. return TRY_AGAIN;
  2042. }
  2043. *result = result_buf;
  2044. *h_errnop = NETDB_SUCCESS;
  2045. return NETDB_SUCCESS;
  2046. #endif /* __UCLIBC_HAS_IPV6__ */
  2047. }
  2048. libc_hidden_def(gethostbyname2_r)
  2049. #endif
  2050. #ifdef L_gethostbyaddr_r
  2051. int gethostbyaddr_r(const void *addr, socklen_t len, int type,
  2052. struct hostent * result_buf,
  2053. char * buf, size_t buflen,
  2054. struct hostent ** result,
  2055. int * h_errnop)
  2056. {
  2057. struct in_addr *in;
  2058. struct in_addr **addr_list;
  2059. #ifdef __UCLIBC_HAS_IPV6__
  2060. char *qp;
  2061. size_t plen;
  2062. struct in6_addr *in6;
  2063. struct in6_addr **addr_list6;
  2064. #endif /* __UCLIBC_HAS_IPV6__ */
  2065. char **alias;
  2066. unsigned char *packet;
  2067. struct resolv_answer a;
  2068. int i;
  2069. int nest = 0;
  2070. int __nameserversXX;
  2071. char ** __nameserverXX;
  2072. *result = NULL;
  2073. if (!addr)
  2074. return EINVAL;
  2075. memset((char *) &a, '\0', sizeof(a));
  2076. switch (type) {
  2077. case AF_INET:
  2078. if (len != sizeof(struct in_addr))
  2079. return EINVAL;
  2080. break;
  2081. #ifdef __UCLIBC_HAS_IPV6__
  2082. case AF_INET6:
  2083. if (len != sizeof(struct in6_addr))
  2084. return EINVAL;
  2085. break;
  2086. #endif /* __UCLIBC_HAS_IPV6__ */
  2087. default:
  2088. return EINVAL;
  2089. }
  2090. /* do /etc/hosts first */
  2091. if ((i = __get_hosts_byaddr_r(addr, len, type, result_buf,
  2092. buf, buflen, result, h_errnop)) == 0)
  2093. return i;
  2094. switch (*h_errnop) {
  2095. case HOST_NOT_FOUND:
  2096. case NO_ADDRESS:
  2097. break;
  2098. default:
  2099. return i;
  2100. }
  2101. __open_nameservers();
  2102. #ifdef __UCLIBC_HAS_IPV6__
  2103. qp = buf;
  2104. plen = buflen;
  2105. #endif /* __UCLIBC_HAS_IPV6__ */
  2106. *h_errnop = NETDB_INTERNAL;
  2107. if (buflen < sizeof(*in))
  2108. return ERANGE;
  2109. in = (struct in_addr*)buf;
  2110. buf += sizeof(*in);
  2111. buflen -= sizeof(*in);
  2112. if (buflen < sizeof(*addr_list)*2)
  2113. return ERANGE;
  2114. addr_list = (struct in_addr**)buf;
  2115. buf += sizeof(*addr_list)*2;
  2116. buflen -= sizeof(*addr_list)*2;
  2117. if (buflen < sizeof(char *)*ALIAS_DIM)
  2118. return ERANGE;
  2119. alias = (char **)buf;
  2120. buf += sizeof(*alias)*ALIAS_DIM;
  2121. buflen -= sizeof(*alias)*ALIAS_DIM;
  2122. #ifdef __UCLIBC_HAS_IPV6__
  2123. if (plen < sizeof(*in6))
  2124. return ERANGE;
  2125. in6 = (struct in6_addr*)qp;
  2126. qp += sizeof(*in6);
  2127. plen -= sizeof(*in6);
  2128. if (plen < sizeof(*addr_list6)*2)
  2129. return ERANGE;
  2130. addr_list6 = (struct in6_addr**)qp;
  2131. qp += sizeof(*addr_list6)*2;
  2132. plen -= sizeof(*addr_list6)*2;
  2133. if (plen < buflen) {
  2134. buflen = plen;
  2135. buf = qp;
  2136. }
  2137. #endif /* __UCLIBC_HAS_IPV6__ */
  2138. if (buflen < 256)
  2139. return ERANGE;
  2140. if (type == AF_INET) {
  2141. unsigned char *tmp_addr = (unsigned char *)addr;
  2142. memcpy(&in->s_addr, addr, len);
  2143. addr_list[0] = in;
  2144. sprintf(buf, "%u.%u.%u.%u.in-addr.arpa",
  2145. tmp_addr[3], tmp_addr[2], tmp_addr[1], tmp_addr[0]);
  2146. #ifdef __UCLIBC_HAS_IPV6__
  2147. } else {
  2148. memcpy(in6->s6_addr, addr, len);
  2149. addr_list6[0] = in6;
  2150. qp = buf;
  2151. for (i = len - 1; i >= 0; i--) {
  2152. qp += sprintf(qp, "%x.%x.", in6->s6_addr[i] & 0xf,
  2153. (in6->s6_addr[i] >> 4) & 0xf);
  2154. }
  2155. strcpy(qp, "ip6.arpa");
  2156. #endif /* __UCLIBC_HAS_IPV6__ */
  2157. }
  2158. addr_list[1] = 0;
  2159. alias[0] = buf;
  2160. alias[1] = 0;
  2161. for (;;) {
  2162. __UCLIBC_MUTEX_LOCK(__resolv_lock);
  2163. __nameserversXX = __nameservers;
  2164. __nameserverXX = __nameserver;
  2165. __UCLIBC_MUTEX_UNLOCK(__resolv_lock);
  2166. i = __dns_lookup(buf, T_PTR, __nameserversXX, __nameserverXX, &packet, &a);
  2167. if (i < 0) {
  2168. *h_errnop = HOST_NOT_FOUND;
  2169. return TRY_AGAIN;
  2170. }
  2171. strncpy(buf, a.dotted, buflen);
  2172. free(a.dotted);
  2173. if (a.atype == T_CNAME) { /* CNAME */
  2174. DPRINTF("Got a CNAME in gethostbyaddr()\n");
  2175. i = __decode_dotted(packet, a.rdoffset, buf, buflen);
  2176. free(packet);
  2177. if (i < 0) {
  2178. *h_errnop = NO_RECOVERY;
  2179. return -1;
  2180. }
  2181. if (++nest > MAX_RECURSE) {
  2182. *h_errnop = NO_RECOVERY;
  2183. return -1;
  2184. }
  2185. continue;
  2186. }
  2187. if (a.atype == T_PTR) { /* ADDRESS */
  2188. i = __decode_dotted(packet, a.rdoffset, buf, buflen);
  2189. free(packet);
  2190. result_buf->h_name = buf;
  2191. result_buf->h_addrtype = type;
  2192. if (type == AF_INET) {
  2193. result_buf->h_length = sizeof(*in);
  2194. #ifdef __UCLIBC_HAS_IPV6__
  2195. } else {
  2196. result_buf->h_length = sizeof(*in6);
  2197. #endif /* __UCLIBC_HAS_IPV6__ */
  2198. }
  2199. result_buf->h_addr_list = (char **) addr_list;
  2200. result_buf->h_aliases = alias;
  2201. break;
  2202. }
  2203. free(packet);
  2204. *h_errnop = NO_ADDRESS;
  2205. return TRY_AGAIN;
  2206. }
  2207. *result = result_buf;
  2208. *h_errnop = NETDB_SUCCESS;
  2209. return NETDB_SUCCESS;
  2210. }
  2211. libc_hidden_def(gethostbyaddr_r)
  2212. #endif
  2213. #ifdef L_res_comp
  2214. /*
  2215. * Expand compressed domain name 'comp_dn' to full domain name.
  2216. * 'msg' is a pointer to the begining of the message,
  2217. * 'eomorig' points to the first location after the message,
  2218. * 'exp_dn' is a pointer to a buffer of size 'length' for the result.
  2219. * Return size of compressed name or -1 if there was an error.
  2220. */
  2221. int __dn_expand(const u_char *msg, const u_char *eom, const u_char *src,
  2222. char *dst, int dstsiz)
  2223. {
  2224. int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz);
  2225. if (n > 0 && dst[0] == '.')
  2226. dst[0] = '\0';
  2227. return n;
  2228. }
  2229. #endif /* L_res_comp */
  2230. #ifdef L_ns_name
  2231. /*
  2232. * printable(ch)
  2233. * Thinking in noninternationalized USASCII (per the DNS spec),
  2234. * is this character visible and not a space when printed ?
  2235. * return:
  2236. * boolean.
  2237. */
  2238. static int printable(int ch)
  2239. {
  2240. return (ch > 0x20 && ch < 0x7f);
  2241. }
  2242. /*
  2243. * special(ch)
  2244. * Thinking in noninternationalized USASCII (per the DNS spec),
  2245. * is this characted special ("in need of quoting") ?
  2246. * return:
  2247. * boolean.
  2248. */
  2249. static int special(int ch)
  2250. {
  2251. switch (ch) {
  2252. case 0x22: /* '"' */
  2253. case 0x2E: /* '.' */
  2254. case 0x3B: /* ';' */
  2255. case 0x5C: /* '\\' */
  2256. /* Special modifiers in zone files. */
  2257. case 0x40: /* '@' */
  2258. case 0x24: /* '$' */
  2259. return 1;
  2260. default:
  2261. return 0;
  2262. }
  2263. }
  2264. /*
  2265. * ns_name_uncompress(msg, eom, src, dst, dstsiz)
  2266. * Expand compressed domain name to presentation format.
  2267. * return:
  2268. * Number of bytes read out of `src', or -1 (with errno set).
  2269. * note:
  2270. * Root domain returns as "." not "".
  2271. */
  2272. int ns_name_uncompress(const u_char *msg, const u_char *eom,
  2273. const u_char *src, char *dst, size_t dstsiz)
  2274. {
  2275. u_char tmp[NS_MAXCDNAME];
  2276. int n;
  2277. if ((n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp)) == -1)
  2278. return -1;
  2279. if (ns_name_ntop(tmp, dst, dstsiz) == -1)
  2280. return -1;
  2281. return n;
  2282. }
  2283. libc_hidden_def(ns_name_uncompress)
  2284. /*
  2285. * ns_name_ntop(src, dst, dstsiz)
  2286. * Convert an encoded domain name to printable ascii as per RFC1035.
  2287. * return:
  2288. * Number of bytes written to buffer, or -1 (with errno set)
  2289. * notes:
  2290. * The root is returned as "."
  2291. * All other domains are returned in non absolute form
  2292. */
  2293. int ns_name_ntop(const u_char *src, char *dst, size_t dstsiz)
  2294. {
  2295. static const char digits[] = "0123456789";
  2296. const u_char *cp;
  2297. char *dn, *eom;
  2298. u_char c;
  2299. u_int n;
  2300. cp = src;
  2301. dn = dst;
  2302. eom = dst + dstsiz;
  2303. while ((n = *cp++) != 0) {
  2304. if ((n & NS_CMPRSFLGS) != 0) {
  2305. /* Some kind of compression pointer. */
  2306. __set_errno(EMSGSIZE);
  2307. return -1;
  2308. }
  2309. if (dn != dst) {
  2310. if (dn >= eom) {
  2311. __set_errno(EMSGSIZE);
  2312. return -1;
  2313. }
  2314. *dn++ = '.';
  2315. }
  2316. if (dn + n >= eom) {
  2317. __set_errno(EMSGSIZE);
  2318. return -1;
  2319. }
  2320. for ((void)NULL; n > 0; n--) {
  2321. c = *cp++;
  2322. if (special(c)) {
  2323. if (dn + 1 >= eom) {
  2324. __set_errno(EMSGSIZE);
  2325. return -1;
  2326. }
  2327. *dn++ = '\\';
  2328. *dn++ = (char)c;
  2329. } else if (!printable(c)) {
  2330. if (dn + 3 >= eom) {
  2331. __set_errno(EMSGSIZE);
  2332. return -1;
  2333. }
  2334. *dn++ = '\\';
  2335. *dn++ = digits[c / 100];
  2336. *dn++ = digits[(c % 100) / 10];
  2337. *dn++ = digits[c % 10];
  2338. } else {
  2339. if (dn >= eom) {
  2340. __set_errno(EMSGSIZE);
  2341. return -1;
  2342. }
  2343. *dn++ = (char)c;
  2344. }
  2345. }
  2346. }
  2347. if (dn == dst) {
  2348. if (dn >= eom) {
  2349. __set_errno(EMSGSIZE);
  2350. return -1;
  2351. }
  2352. *dn++ = '.';
  2353. }
  2354. if (dn >= eom) {
  2355. __set_errno(EMSGSIZE);
  2356. return -1;
  2357. }
  2358. *dn++ = '\0';
  2359. return (dn - dst);
  2360. }
  2361. libc_hidden_def(ns_name_ntop)
  2362. /*
  2363. * ns_name_unpack(msg, eom, src, dst, dstsiz)
  2364. * Unpack a domain name from a message, source may be compressed.
  2365. * return:
  2366. * -1 if it fails, or consumed octets if it succeeds.
  2367. */
  2368. int ns_name_unpack(const u_char *msg, const u_char *eom, const u_char *src,
  2369. u_char *dst, size_t dstsiz)
  2370. {
  2371. const u_char *srcp, *dstlim;
  2372. u_char *dstp;
  2373. int n, len, checked;
  2374. len = -1;
  2375. checked = 0;
  2376. dstp = dst;
  2377. srcp = src;
  2378. dstlim = dst + dstsiz;
  2379. if (srcp < msg || srcp >= eom) {
  2380. __set_errno(EMSGSIZE);
  2381. return -1;
  2382. }
  2383. /* Fetch next label in domain name. */
  2384. while ((n = *srcp++) != 0) {
  2385. /* Check for indirection. */
  2386. switch (n & NS_CMPRSFLGS) {
  2387. case 0:
  2388. /* Limit checks. */
  2389. if (dstp + n + 1 >= dstlim || srcp + n >= eom) {
  2390. __set_errno(EMSGSIZE);
  2391. return -1;
  2392. }
  2393. checked += n + 1;
  2394. *dstp++ = n;
  2395. memcpy(dstp, srcp, n);
  2396. dstp += n;
  2397. srcp += n;
  2398. break;
  2399. case NS_CMPRSFLGS:
  2400. if (srcp >= eom) {
  2401. __set_errno(EMSGSIZE);
  2402. return -1;
  2403. }
  2404. if (len < 0)
  2405. len = srcp - src + 1;
  2406. srcp = msg + (((n & 0x3f) << 8) | (*srcp & 0xff));
  2407. if (srcp < msg || srcp >= eom) { /* Out of range. */
  2408. __set_errno(EMSGSIZE);
  2409. return -1;
  2410. }
  2411. checked += 2;
  2412. /*
  2413. * Check for loops in the compressed name;
  2414. * if we've looked at the whole message,
  2415. * there must be a loop.
  2416. */
  2417. if (checked >= eom - msg) {
  2418. __set_errno(EMSGSIZE);
  2419. return -1;
  2420. }
  2421. break;
  2422. default:
  2423. __set_errno(EMSGSIZE);
  2424. return -1; /* flag error */
  2425. }
  2426. }
  2427. *dstp = '\0';
  2428. if (len < 0)
  2429. len = srcp - src;
  2430. return len;
  2431. }
  2432. libc_hidden_def(ns_name_unpack)
  2433. #endif /* L_ns_name */
  2434. /* vi: set sw=4 ts=4: */