512a2b11e4e4511b61e946482fe823b7886ac089
3 * - declarations of private objects with external linkage (adns__*)
4 * - definitons of internal macros
5 * - comments regarding library data structures
8 * This file is part of adns, which is
9 * Copyright (C) 1997-2000,2003,2006 Ian Jackson
10 * Copyright (C) 1999-2000,2003,2006 Tony Finch
11 * Copyright (C) 1991 Massachusetts Institute of Technology
12 * (See the file INSTALL for full details.)
14 * This program is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation; either version 2, or (at your option)
19 * This program is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with this program; if not, write to the Free Software Foundation,
26 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 #ifndef ADNS_INTERNAL_H_INCLUDED
30 #define ADNS_INTERNAL_H_INCLUDED
33 typedef unsigned char byte
;
48 #ifdef ADNS_REGRESS_TEST
49 # include "hredirect.h"
52 /* Configuration and constants */
55 #define MAXSORTLIST 15
56 #define UDPMAXRETRIES 15
57 #define UDPRETRYMS 2000
58 #define TCPWAITMS 30000
59 #define TCPCONNMS 14000
60 #define TCPIDLEMS 30000
61 #define MAXTTLBELIEVE (7*86400) /* any TTL > 7 days is capped */
64 #define DNS_MAXUDP 512
65 #define DNS_MAXLABEL 63
66 #define DNS_MAXDOMAIN 255
67 #define DNS_HDRSIZE 12
68 #define DNS_IDOFFSET 0
69 #define DNS_CLASS_IN 1
71 #define DNS_INADDR_ARPA "in-addr", "arpa"
73 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
90 /* Shared data structures */
102 int dglen
, nsstart
, nscount
, arcount
;
106 typedef struct typeinfo
{
112 void (*makefinal
)(adns_query qu
, void *data
);
113 /* Change memory management of *data.
114 * Previously, used alloc_interim, now use alloc_final.
117 adns_status (*convstring
)(vbuf
*vb
, const void *data
);
118 /* Converts the RR data to a string representation in vbuf.
119 * vbuf will be appended to (it must have been initialised),
120 * and will not be null-terminated by convstring.
123 adns_status (*parse
)(const parseinfo
*pai
, int cbyte
,
124 int max
, void *store_r
);
125 /* Parse one RR, in dgram of length dglen, starting at cbyte and
126 * extending until at most max.
128 * The RR should be stored at *store_r, of length qu->typei->rrsz.
130 * If there is an overrun which might indicate truncation, it should set
131 * *rdstart to -1; otherwise it may set it to anything else positive.
133 * nsstart is the offset of the authority section.
136 int (*diff_needswap
)(adns_state ads
,const void *datap_a
,const void *datap_b
);
137 /* Returns !0 if RR a should be strictly after RR b in the sort order,
138 * 0 otherwise. Must not fail.
141 adns_status (*qdparselabel
)(adns_state ads
,
142 const char **p_io
, const char *pe
, int labelnum
,
143 char label_r
[DNS_MAXDOMAIN
], int *ll_io
,
144 adns_queryflags flags
,
145 const struct typeinfo
*typei
);
146 /* Parses one label from the query domain string. On entry, *p_io
147 * points to the next character to parse and *ll_io is the size of
148 * the buffer. pe points just after the end of the query domain
149 * string. On successful return, label_r[] and *ll_io are filled in
150 * and *p_io points to *pe or just after the label-ending `.'. */
152 void (*postsort
)(adns_state ads
, void *array
, int nrrs
,
153 const struct typeinfo
*typei
);
154 /* Called immediately after the RRs have been sorted, and may rearrange
155 * them. (This is really for the benefit of SRV's bizarre weighting
156 * stuff.) May be 0 to mean nothing needs to be done.
160 adns_status
adns__qdpl_normal(adns_state ads
,
161 const char **p_io
, const char *pe
, int labelnum
,
162 char label_r
[], int *ll_io
,
163 adns_queryflags flags
,
164 const typeinfo
*typei
);
165 /* implemented in transmit.c, used by types.c as default
166 * and as part of implementation for some fancier types */
168 typedef struct allocnode
{
169 struct allocnode
*next
, *back
;
183 void (*callback
)(adns_query parent
, adns_query child
);
186 adns_rr_addr ptr_addr
;
187 } tinfo
; /* type-specific state for the query itself: zero-init if you
188 * don't know better. */
191 adns_rr_hostaddr
*hostaddr
;
192 } pinfo
; /* state for use by parent's callback function */
197 enum { query_tosend
, query_tcpw
, query_childw
, query_done
} state
;
198 adns_query back
, next
, parent
;
199 struct { adns_query head
, tail
; } children
;
200 struct { adns_query back
, next
; } siblings
;
201 struct { allocnode
*head
, *tail
; } allocations
;
202 int interim_allocd
, preserved_allocd
;
203 void *final_allocspace
;
205 const typeinfo
*typei
;
210 /* General-purpose messing-about buffer.
211 * Wherever a `big' interface is crossed, this may be corrupted/changed
212 * unless otherwise specified.
216 /* This is allocated when a query is submitted, to avoid being unable
217 * to relate errors to queries if we run out of memory. During
218 * query processing status, rrs is 0. cname is set if
219 * we found a cname (this corresponds to cname_dgram in the query
220 * structure). type is set from the word go. nrrs and rrs
221 * are set together, when we find how many rrs there are.
222 * owner is set during querying unless we're doing searchlist,
223 * in which case it is set only when we find an answer.
227 int cname_dglen
, cname_begin
;
228 /* If non-0, has been allocated using . */
231 int search_origlen
, search_pos
, search_doneabs
;
232 /* Used by the searching algorithm. The query domain in textual form
233 * is copied into the vbuf, and _origlen set to its length. Then
234 * we walk the searchlist, if we want to. _pos says where we are
235 * (next entry to try), and _doneabs says whether we've done the
236 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
237 * but not done yet). If flags doesn't have adns_qf_search then
238 * the vbuf is initialised but empty and everything else is zero.
241 int id
, flags
, retries
;
243 unsigned long udpsent
; /* bitmap indexed by server */
244 struct timeval timeout
;
245 time_t expires
; /* Earliest expiry time of any record we used. */
251 * state Queue child id nextudpserver udpsent tcpfailed
253 * tosend NONE null >=0 0 zero zero
254 * tosend udpw null >=0 any nonzero zero
255 * tosend NONE null >=0 any nonzero zero
257 * tcpw tcpw null >=0 irrelevant any any
259 * child childw set >=0 irrelevant irrelevant irrelevant
260 * child NONE null >=0 irrelevant irrelevant irrelevant
261 * done output null -1 irrelevant irrelevant irrelevant
263 * Queries are only not on a queue when they are actually being processed.
264 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
265 * iff the tcp connection is in state server_ok.
267 * +------------------------+
268 * START -----> | tosend/NONE |
269 * +------------------------+
271 * too big for UDP / UDP timeout \ \ send via UDP
272 * send via TCP / more retries \ \
273 * when conn'd / desired \ \
276 * +-----------+ +-------------+
277 * | tcpw/tcpw | ________ | tosend/udpw |
278 * +-----------+ \ +-------------+
279 * | | | UDP timeout | |
282 * \ | TCP died | desired | |
284 * \ \ servers | TCP / |
285 * \ \ to try | timeout / |
287 * reply \ _| +------------------+ / reply
288 * \ | done/output FAIL | /
289 * \ +------------------+ /
292 * (..... got reply ....)
294 * need child query/ies / \ no child query
297 * +---------------+ +----------------+
298 * | childw/childw | ----------------> | done/output OK |
299 * +---------------+ children done +----------------+
303 struct query_queue
{ adns_query head
, tail
; };
306 adns_initflags iflags
;
307 adns_logcallbackfn
*logfn
;
310 struct query_queue udpw
, tcpw
, childw
, output
;
311 adns_query forallnext
;
312 int nextid
, udpsocket
, tcpsocket
;
313 vbuf tcpsend
, tcprecv
;
314 int nservers
, nsortlist
, nsearchlist
, searchndots
, tcpserver
, tcprecv_skip
;
315 enum adns__tcpstate
{
316 server_disconnected
, server_connecting
,
317 server_ok
, server_broken
319 struct timeval tcptimeout
;
320 /* This will have tv_sec==0 if it is not valid. It will always be
321 * valid if tcpstate _connecting. When _ok, it will be nonzero if
322 * we are idle (ie, tcpw queue is empty), in which case it is the
323 * absolute time when we will close the connection.
325 struct sigaction stdsigpipe
;
327 struct pollfd pollfds_buf
[MAX_POLLFDS
];
330 } servers
[MAXSERVERS
];
332 struct in_addr base
, mask
;
333 } sortlist
[MAXSORTLIST
];
335 unsigned short rand48xsubi
[3];
340 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
342 /* From general.c: */
344 void adns__vlprintf(adns_state ads
, const char *fmt
, va_list al
);
345 void adns__lprintf(adns_state ads
, const char *fmt
,
346 ...) PRINTFFORMAT(2,3);
348 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
349 int serv
, adns_query qu
, const char *fmt
, va_list al
);
351 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
352 const char *fmt
, ...) PRINTFFORMAT(4,5);
353 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
354 const char *fmt
, ...) PRINTFFORMAT(4,5);
355 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
356 const char *fmt
, ...) PRINTFFORMAT(4,5);
358 int adns__vbuf_ensure(vbuf
*vb
, int want
);
359 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* doesn't include nul */
360 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
361 /* 1=>success, 0=>realloc failed */
362 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
363 void adns__vbuf_init(vbuf
*vb
);
364 void adns__vbuf_free(vbuf
*vb
);
366 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
368 const byte
*dgram
, int dglen
, int cbyte
);
369 /* Unpicks a domain in a datagram and returns a string suitable for
370 * printing it as. Never fails - if an error occurs, it will
371 * return some kind of string describing the error.
373 * serv may be -1 and qu may be 0. vb must have been initialised,
374 * and will be left in an arbitrary consistent state.
376 * Returns either vb->buf, or a pointer to a string literal. Do not modify
377 * vb before using the return value.
380 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
381 int (*needswap
)(void *context
, const void *a
, const void *b
),
383 /* Does an insertion sort of array which must contain nobjs objects
384 * each sz bytes long. tempbuf must point to a buffer at least
385 * sz bytes long. needswap should return !0 if a>b (strictly, ie
386 * wrong order) 0 if a<=b (ie, order is fine).
389 void adns__sigpipe_protect(adns_state
);
390 void adns__sigpipe_unprotect(adns_state
);
391 /* If SIGPIPE protection is not disabled, will block all signals except
392 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
393 * Each call to _protect must be followed by a call to _unprotect before
394 * any significant amount of code gets to run, since the old signal mask
395 * is stored in the adns structure.
398 /* From transmit.c: */
400 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
401 const char *owner
, int ol
,
402 const typeinfo
*typei
, adns_rrtype type
,
403 adns_queryflags flags
);
404 /* Assembles a query packet in vb. A new id is allocated and returned.
407 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
408 const byte
*qd_dgram
, int qd_dglen
,
410 adns_rrtype type
, adns_queryflags flags
);
411 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
412 * That domain must be correct and untruncated.
415 void adns__querysend_tcp(adns_query qu
, struct timeval now
);
416 /* Query must be in state tcpw/tcpw; it will be sent if possible and
417 * no further processing can be done on it for now. The connection
418 * might be broken, but no reconnect will be attempted.
421 void adns__query_send(adns_query qu
, struct timeval now
);
422 /* Query must be in state tosend/NONE; it will be moved to a new state,
423 * and no further processing can be done on it for now.
424 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
425 * connected), tcpsent/timew, child/childw or done/output.)
426 * __query_send may decide to use either UDP or TCP depending whether
427 * _qf_usevc is set (or has become set) and whether the query is too
433 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
434 const typeinfo
*typei
, vbuf
*qumsg_vb
,
436 adns_queryflags flags
, struct timeval now
,
437 const qcontext
*ctx
);
438 /* Submits a query (for internal use, called during external submits).
440 * The new query is returned in *query_r, or we return adns_s_nomemory.
442 * The query datagram should already have been assembled in qumsg_vb;
443 * the memory for it is _taken over_ by this routine whether it
444 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
446 * *ctx is copied byte-for-byte into the query.
448 * When the child query is done, ctx->callback will be called. The
449 * child will already have been taken off both the global list of
450 * queries in ads and the list of children in the parent. The child
451 * will be freed when the callback returns. The parent will have been
452 * taken off the global childw queue.
454 * The callback should either call adns__query_done, if it is
455 * complete, or adns__query_fail, if an error has occurred, in which
456 * case the other children (if any) will be cancelled. If the parent
457 * has more unfinished children (or has just submitted more) then the
458 * callback may choose to wait for them - it must then put the parent
459 * back on the childw queue.
462 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
);
463 /* Walks down the searchlist for a query with adns_qf_search.
464 * The query should have just had a negative response, or not had
465 * any queries sent yet, and should not be on any queue.
466 * The query_dgram if any will be freed and forgotten and a new
467 * one constructed from the search_* members of the query.
469 * Cannot fail (in case of error, calls adns__query_fail).
472 void *adns__alloc_interim(adns_query qu
, size_t sz
);
473 void *adns__alloc_preserved(adns_query qu
, size_t sz
);
474 /* Allocates some memory, and records which query it came from
475 * and how much there was.
477 * If an error occurs in the query, all the memory from _interim is
478 * simply freed. If the query succeeds, one large buffer will be made
479 * which is big enough for all these allocations, and then
480 * adns__alloc_final will get memory from this buffer.
482 * _alloc_interim can fail (and return 0).
483 * The caller must ensure that the query is failed.
485 * The memory from _preserved is is kept and transferred into the
486 * larger buffer - unless we run out of memory, in which case it too
487 * is freed. When you use _preserved you have to add code to the
488 * x_nomem error exit case in adns__makefinal_query to clear out the
489 * pointers you made to those allocations, because that's when they're
490 * thrown away; you should also make a note in the declaration of
491 * those pointer variables, to note that they are _preserved rather
492 * than _interim. If they're in the answer, note it here:
493 * answer->cname and answer->owner are _preserved.
496 void adns__transfer_interim(adns_query from
, adns_query to
,
497 void *block
, size_t sz
);
498 /* Transfers an interim allocation from one query to another, so that
499 * the `to' query will have room for the data when we get to makefinal
500 * and so that the free will happen when the `to' query is freed
501 * rather than the `from' query.
503 * It is legal to call adns__transfer_interim with a null pointer; this
506 * _transfer_interim also ensures that the expiry time of the `to' query
507 * is no later than that of the `from' query, so that child queries'
508 * TTLs get inherited by their parents.
511 void *adns__alloc_mine(adns_query qu
, size_t sz
);
512 /* Like _interim, but does not record the length for later
513 * copying into the answer. This just ensures that the memory
514 * will be freed when we're done with the query.
517 void *adns__alloc_final(adns_query qu
, size_t sz
);
518 /* Cannot fail, and cannot return 0.
521 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
522 void adns__makefinal_str(adns_query qu
, char **strp
);
524 void adns__reset_preserved(adns_query qu
);
525 /* Resets all of the memory management stuff etc. to take account of
526 * only the _preserved stuff from _alloc_preserved. Used when we find
527 * an error somewhere and want to just report the error (with perhaps
528 * CNAME, owner, etc. info), and also when we're halfway through RRs
529 * in a datagram and discover that we need to retry the query.
532 void adns__query_done(adns_query qu
);
533 void adns__query_fail(adns_query qu
, adns_status stat
);
537 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
538 int serv
, int viatcp
, struct timeval now
);
539 /* This function is allowed to cause new datagrams to be constructed
540 * and sent, or even new queries to be started. However,
541 * query-sending functions are not allowed to call any general event
542 * loop functions in case they accidentally call this.
544 * Ie, receiving functions may call sending functions.
545 * Sending functions may NOT call receiving functions.
550 const typeinfo
*adns__findtype(adns_rrtype type
);
559 int dglen
, max
, cbyte
, namelen
;
563 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
564 int serv
, adns_query qu
,
565 const byte
*dgram
, int dglen
, int max
,
566 int dmbegin
, int *dmend_rlater
);
567 /* Finds labels in a domain in a datagram.
569 * Call this routine first.
570 * dmend_rlater may be null. ads (and of course fls) may not be.
571 * serv may be -1, qu may be null - they are for error reporting.
574 adns_status
adns__findlabel_next(findlabel_state
*fls
,
575 int *lablen_r
, int *labstart_r
);
576 /* Then, call this one repeatedly.
578 * It will return adns_s_ok if all is well, and tell you the length
579 * and start of successive labels. labstart_r may be null, but
580 * lablen_r must not be.
582 * After the last label, it will return with *lablen_r zero.
583 * Do not then call it again; instead, just throw away the findlabel_state.
585 * *dmend_rlater will have been set to point to the next part of
586 * the datagram after the label (or after the uncompressed part,
587 * if compression was used). *namelen_rlater will have been set
588 * to the length of the domain name (total length of labels plus
589 * 1 for each intervening dot).
591 * If the datagram appears to be truncated, *lablen_r will be -1.
592 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
593 * Do not call _next again.
595 * There may also be errors, in which case *dmend_rlater,
596 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
597 * Do not then call findlabel_next again.
604 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
605 vbuf
*vb
, parsedomain_flags flags
,
606 const byte
*dgram
, int dglen
, int *cbyte_io
,
608 /* vb must already have been initialised; it will be reset if necessary.
609 * If there is truncation, vb->used will be set to 0; otherwise
610 * (if there is no error) vb will be null-terminated.
611 * If there is an error vb and *cbyte_io may be left indeterminate.
613 * serv may be -1 and qu may be 0 - they are used for error reporting only.
616 adns_status
adns__parse_domain_more(findlabel_state
*fls
, adns_state ads
,
617 adns_query qu
, vbuf
*vb
,
618 parsedomain_flags flags
,
620 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
621 * for continuing an existing domain or some such of some kind. Also, unlike
622 * _parse_domain, the domain data will be appended to vb, rather than replacing
623 * the existing contents.
626 adns_status
adns__findrr(adns_query qu
, int serv
,
627 const byte
*dgram
, int dglen
, int *cbyte_io
,
628 int *type_r
, int *class_r
, unsigned long *ttl_r
,
629 int *rdlen_r
, int *rdstart_r
,
630 int *ownermatchedquery_r
);
631 /* Finds the extent and some of the contents of an RR in a datagram
632 * and does some checks. The datagram is *dgram, length dglen, and
633 * the RR starts at *cbyte_io (which is updated afterwards to point
634 * to the end of the RR).
636 * The type, class, TTL and RRdata length and start are returned iff
637 * the corresponding pointer variables are not null. type_r, class_r
638 * and ttl_r may not be null. The TTL will be capped.
640 * If ownermatchedquery_r != 0 then the owner domain of this
641 * RR will be compared with that in the query (or, if the query
642 * has gone to a CNAME lookup, with the canonical name).
643 * In this case, *ownermatchedquery_r will be set to 0 or 1.
644 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
646 * If there is truncation then *type_r will be set to -1 and
647 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
650 * qu must obviously be non-null.
652 * If an error is returned then *type_r will be undefined too.
655 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
656 const byte
*dgram
, int dglen
, int *cbyte_io
,
657 int *type_r
, int *class_r
,
658 unsigned long *ttl_r
,
659 int *rdlen_r
, int *rdstart_r
,
660 const byte
*eo_dgram
, int eo_dglen
,
661 int eo_cbyte
, int *eo_matched_r
);
662 /* Like adns__findrr_checked, except that the datagram and
663 * owner to compare with can be specified explicitly.
665 * If the caller thinks they know what the owner of the RR ought to
666 * be they can pass in details in eo_*: this is another (or perhaps
667 * the same datagram), and a pointer to where the putative owner
668 * starts in that datagram. In this case *eo_matched_r will be set
669 * to 1 if the datagram matched or 0 if it did not. Either
670 * both eo_dgram and eo_matched_r must both be non-null, or they
671 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
672 * The eo datagram and contained owner domain MUST be valid and
676 void adns__update_expires(adns_query qu
, unsigned long ttl
,
678 /* Updates the `expires' field in the query, so that it doesn't exceed
682 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
686 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
687 /* what and why may be both 0, or both non-0. */
689 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
691 void adns__autosys(adns_state ads
, struct timeval now
);
692 /* Make all the system calls we want to if the application wants us to.
693 * Must not be called from within adns internal processing functions,
694 * lest we end up in recursive descent !
697 void adns__must_gettimeofday(adns_state ads
, const struct timeval
**now_io
,
698 struct timeval
*tv_buf
);
700 int adns__pollfds(adns_state ads
, struct pollfd pollfds_buf
[MAX_POLLFDS
]);
701 void adns__fdevents(adns_state ads
,
702 const struct pollfd
*pollfds
, int npollfds
,
703 int maxfd
, const fd_set
*readfds
,
704 const fd_set
*writefds
, const fd_set
*exceptfds
,
705 struct timeval now
, int *r_r
);
706 int adns__internal_check(adns_state ads
,
707 adns_query
*query_io
,
708 adns_answer
**answer
,
711 void adns__timeouts(adns_state ads
, int act
,
712 struct timeval
**tv_io
, struct timeval
*tvbuf
,
714 /* If act is !0, then this will also deal with the TCP connection
715 * if previous events broke it or require it to be connected.
720 void adns__consistency(adns_state ads
, adns_query qu
, consistency_checks cc
);
722 /* Useful static inline functions: */
724 static inline int ctype_whitespace(int c
) {
725 return c
==' ' || c
=='\n' || c
=='\t';
727 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
728 static inline int ctype_alpha(int c
) {
729 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' && c
<= 'Z');
731 static inline int ctype_822special(int c
) {
732 return strchr("()<>@,;:\\\".[]",c
) != 0;
734 static inline int ctype_domainunquoted(int c
) {
735 return ctype_alpha(c
) || ctype_digit(c
) || (strchr("-_/+",c
) != 0);
738 static inline int errno_resources(int e
) { return e
==ENOMEM
|| e
==ENOBUFS
; }
742 #define MEM_ROUND(sz) \
743 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
744 * sizeof(union maxalign) )
746 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
747 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
748 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
749 #define GET_L(cb,tv) ( (tv)=0, \
750 (tv)|=(GETIL_B((cb))<<24), \
751 (tv)|=(GETIL_B((cb))<<16), \
752 (tv)|=(GETIL_B((cb))<<8), \