resolv.c 65 KB

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