1.1 --- a/epoc32/include/stdapis/resolv.h Tue Nov 24 13:55:44 2009 +0000
1.2 +++ b/epoc32/include/stdapis/resolv.h Tue Mar 16 16:12:26 2010 +0000
1.3 @@ -1,1 +1,265 @@
1.4 -resolv.h
1.5 +/*-
1.6 + * Copyright (c) 1983, 1987, 1989, 1993
1.7 + * The Regents of the University of California. All rights reserved.
1.8 + *
1.9 + * Redistribution and use in source and binary forms, with or without
1.10 + * modification, are permitted provided that the following conditions
1.11 + * are met:
1.12 + * 1. Redistributions of source code must retain the above copyright
1.13 + * notice, this list of conditions and the following disclaimer.
1.14 + * 2. Redistributions in binary form must reproduce the above copyright
1.15 + * notice, this list of conditions and the following disclaimer in the
1.16 + * documentation and/or other materials provided with the distribution.
1.17 + * 4. Neither the name of the University nor the names of its contributors
1.18 + * may be used to endorse or promote products derived from this software
1.19 + * without specific prior written permission.
1.20 + *
1.21 + * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
1.22 + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.23 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.24 + * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
1.25 + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1.26 + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1.27 + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1.28 + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1.29 + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1.30 + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1.31 + * SUCH DAMAGE.
1.32 + */
1.33 +
1.34 +/*
1.35 + * Portions Copyright (c) 1996 by Internet Software Consortium.
1.36 + *
1.37 + * Permission to use, copy, modify, and distribute this software for any
1.38 + * purpose with or without fee is hereby granted, provided that the above
1.39 + * copyright notice and this permission notice appear in all copies.
1.40 + *
1.41 + * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
1.42 + * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
1.43 + * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
1.44 + * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
1.45 + * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
1.46 + * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
1.47 + * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
1.48 + * SOFTWARE.
1.49 + * © Portions copyright (c) 2007 Symbian Software Ltd. All rights reserved.
1.50 + */
1.51 +
1.52 +/*
1.53 + * @(#)resolv.h 8.1 (Berkeley) 6/2/93
1.54 + * From Id: resolv.h,v 8.12 1998/04/28 19:36:46 halley Exp $
1.55 + * $FreeBSD: src/include/resolv.h,v 1.26 2004/09/09 17:39:47 yar Exp $
1.56 + */
1.57 +
1.58 +#ifndef _RESOLV_H_
1.59 +#define _RESOLV_H_
1.60 +
1.61 +#include <sys/param.h>
1.62 +#include <sys/types.h>
1.63 +#include <sys/cdefs.h>
1.64 +#include <sys/socket.h>
1.65 +#include <stdio.h>
1.66 +
1.67 +/*
1.68 + * Revision information. This is the release date in YYYYMMDD format.
1.69 + * It can change every day so the right thing to do with it is use it
1.70 + * in preprocessor commands such as "#if (__RES > 19931104)". Do not
1.71 + * compare for equality; rather, use it to determine whether your resolver
1.72 + * is new enough to contain a certain feature.
1.73 + */
1.74 +
1.75 +#define __RES 19960801
1.76 +
1.77 +/*
1.78 + * Resolver configuration file.
1.79 + * Normally not present, but may contain the address of the
1.80 + * inital name server(s) to query and the domain search list.
1.81 + */
1.82 +
1.83 +#ifndef _PATH_RESCONF
1.84 +#define _PATH_RESCONF "/etc/resolv.conf"
1.85 +#endif
1.86 +
1.87 +/*
1.88 + * Global defines and variables for resolver stub.
1.89 + */
1.90 +#define MAXNS 3 /* max # name servers we'll track */
1.91 +#define MAXDFLSRCH 3 /* # default domain levels to try */
1.92 +#define MAXDNSRCH 6 /* max # domains in search path */
1.93 +#define LOCALDOMAINPARTS 2 /* min levels in name that is "local" */
1.94 +
1.95 +#define RES_TIMEOUT 5 /* min. seconds between retries */
1.96 +#define RES_DFLRETRY 4 /* retries per each name server */
1.97 +#define MAXRESOLVSORT 10 /* number of net to sort on */
1.98 +#define RES_MAXNDOTS 15 /* should reflect bit field size */
1.99 +#define RES_MAXRETRANS 30 /* only for resolv.conf/RES_OPTIONS */
1.100 +#define RES_MAXRETRY 5 /* only for resolv.conf/RES_OPTIONS */
1.101 +
1.102 +struct __res_state {
1.103 + int retrans; /* retransmition time interval */
1.104 + int retry; /* number of times to retransmit */
1.105 + u_long options; /* option flags - see below. */
1.106 + int nscount; /* number of name servers */
1.107 + struct sockaddr_in
1.108 + nsaddr_list[MAXNS]; /* address of name server */
1.109 +#define nsaddr nsaddr_list[0] /* for backward compatibility */
1.110 + u_short id; /* current message id */
1.111 + char *dnsrch[MAXDNSRCH+1]; /* components of domain to search */
1.112 + char defdname[256]; /* default domain (deprecated) */
1.113 + u_long pfcode; /* RES_PRF_ flags - see below. */
1.114 + unsigned ndots:4; /* threshold for initial abs. query */
1.115 + unsigned nsort:4; /* number of elements in sort_list[] */
1.116 + char unused[3];
1.117 + struct {
1.118 + struct in_addr addr;
1.119 + u_int32_t mask;
1.120 + } sort_list[MAXRESOLVSORT];
1.121 + char pad[72]; /* on an i386 this means 512b total */
1.122 +};
1.123 +
1.124 +/* for INET6 */
1.125 +/*
1.126 + * replacement of __res_state, separated to keep binary compatibility.
1.127 + */
1.128 +struct __res_state_ext {
1.129 + struct sockaddr_storage nsaddr_list[MAXNS];
1.130 + struct {
1.131 + int af; /* address family for addr, mask */
1.132 + union {
1.133 + struct in_addr ina;
1.134 + struct in6_addr in6a;
1.135 + } addr, mask;
1.136 + } sort_list[MAXRESOLVSORT];
1.137 +};
1.138 +
1.139 +/*
1.140 + * Resolver options (keep these in synch with res_debug.c, please)
1.141 + */
1.142 +#define RES_INIT 0x00000001 /* address initialized */
1.143 +#define RES_DEBUG 0x00000002 /* print debug messages */
1.144 +#define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL)*/
1.145 +#define RES_USEVC 0x00000008 /* use virtual circuit */
1.146 +#define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */
1.147 +#define RES_IGNTC 0x00000020 /* ignore truncation errors */
1.148 +#define RES_RECURSE 0x00000040 /* recursion desired */
1.149 +#define RES_DEFNAMES 0x00000080 /* use default domain name */
1.150 +#define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */
1.151 +#define RES_DNSRCH 0x00000200 /* search up local domain tree */
1.152 +#define RES_INSECURE1 0x00000400 /* type 1 security disabled */
1.153 +#define RES_INSECURE2 0x00000800 /* type 2 security disabled */
1.154 +#define RES_NOALIASES 0x00001000 /* shuts off HOSTALIASES feature */
1.155 +#define RES_USE_INET6 0x00002000 /* use/map IPv6 in gethostbyname() */
1.156 +#define RES_NOTLDQUERY 0x00004000 /* Don't query TLD names */
1.157 +/* KAME extensions: use higher bit to avoid conflict with ISC use */
1.158 +#define RES_USE_EDNS0 0x40000000 /* use EDNS0 */
1.159 +
1.160 +#define RES_DEFAULT (RES_RECURSE | RES_DEFNAMES | RES_DNSRCH)
1.161 +
1.162 +/*
1.163 + * Resolver "pfcode" values. Used by dig.
1.164 + */
1.165 +#define RES_PRF_STATS 0x00000001
1.166 +#define RES_PRF_UPDATE 0x00000002
1.167 +#define RES_PRF_CLASS 0x00000004
1.168 +#define RES_PRF_CMD 0x00000008
1.169 +#define RES_PRF_QUES 0x00000010
1.170 +#define RES_PRF_ANS 0x00000020
1.171 +#define RES_PRF_AUTH 0x00000040
1.172 +#define RES_PRF_ADD 0x00000080
1.173 +#define RES_PRF_HEAD1 0x00000100
1.174 +#define RES_PRF_HEAD2 0x00000200
1.175 +#define RES_PRF_TTLID 0x00000400
1.176 +#define RES_PRF_HEADX 0x00000800
1.177 +#define RES_PRF_QUERY 0x00001000
1.178 +#define RES_PRF_REPLY 0x00002000
1.179 +#define RES_PRF_INIT 0x00004000
1.180 +/* 0x00008000 */
1.181 +
1.182 +typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error }
1.183 + res_sendhookact;
1.184 +
1.185 +typedef res_sendhookact (*res_send_qhook)(struct sockaddr * const *ns,
1.186 + const u_char **query,
1.187 + int *querylen,
1.188 + u_char *ans,
1.189 + int anssiz,
1.190 + int *resplen);
1.191 +
1.192 +typedef res_sendhookact (*res_send_rhook)(const struct sockaddr *ns,
1.193 + const u_char *query,
1.194 + int querylen,
1.195 + u_char *ans,
1.196 + int anssiz,
1.197 + int *resplen);
1.198 +
1.199 +struct res_sym {
1.200 + int number; /* Identifying number, like T_MX */
1.201 + char * name; /* Its symbolic name, like "MX" */
1.202 + char * humanname; /* Its fun name, like "mail exchanger" */
1.203 +};
1.204 +
1.205 +__BEGIN_DECLS
1.206 +extern struct __res_state *___res(void);
1.207 +extern struct __res_state_ext *___res_ext(void);
1.208 +__END_DECLS
1.209 +#define _res (*___res())
1.210 +#define _res_ext (*___res_ext())
1.211 +/* for INET6 */
1.212 +extern struct __res_state_ext _res_ext;
1.213 +
1.214 +extern const struct res_sym __p_class_syms[];
1.215 +extern const struct res_sym __p_type_syms[];
1.216 +
1.217 +/* Private routines shared between libc/net, named, nslookup and others. */
1.218 +#define res_hnok __res_hnok
1.219 +#define res_ownok __res_ownok
1.220 +#define res_mailok __res_mailok
1.221 +#define res_dnok __res_dnok
1.222 +#define sym_ston __sym_ston
1.223 +#define sym_ntos __sym_ntos
1.224 +#define sym_ntop __sym_ntop
1.225 +#define b64_ntop __b64_ntop
1.226 +#define b64_pton __b64_pton
1.227 +#define loc_ntoa __loc_ntoa
1.228 +#define loc_aton __loc_aton
1.229 +#define fp_resstat __fp_resstat
1.230 +#define p_query __p_query
1.231 +#define dn_skipname __dn_skipname
1.232 +#define fp_resstat __fp_resstat
1.233 +#define fp_query __fp_query
1.234 +#define fp_nquery __fp_nquery
1.235 +#define hostalias __hostalias
1.236 +#define putlong __putlong
1.237 +#define putshort __putshort
1.238 +#define p_class __p_class
1.239 +#define p_time __p_time
1.240 +#define p_type __p_type
1.241 +#define p_query __p_query
1.242 +#define p_cdnname __p_cdnname
1.243 +#define p_section __p_section
1.244 +#define p_cdname __p_cdname
1.245 +#define p_fqnname __p_fqnname
1.246 +#define p_fqname __p_fqname
1.247 +#define p_option __p_option
1.248 +#define p_secstodate __p_secstodate
1.249 +#define dn_count_labels __dn_count_labels
1.250 +#define dn_comp __dn_comp
1.251 +#define dn_expand __dn_expand
1.252 +#define res_init __res_init
1.253 +#define res_randomid __res_randomid
1.254 +#define res_query __res_query
1.255 +#define res_search __res_search
1.256 +#define res_querydomain __res_querydomain
1.257 +#define res_mkquery __res_mkquery
1.258 +#define res_send __res_send
1.259 +#define res_isourserver __res_isourserver
1.260 +#define res_nameinquery __res_nameinquery
1.261 +#define res_queriesmatch __res_queriesmatch
1.262 +#define res_close __res_close
1.263 +#define res_opt __res_opt
1.264 +#define res_mkupdate __res_mkupdate
1.265 +#define res_mkupdrec __res_mkupdrec
1.266 +#define res_freeupdrec __res_freeupdrec
1.267 +
1.268 +
1.269 +#endif /* !_RESOLV_H_ */