[adns] / src / query.c

/*
 * query.c
 * - overall query management (allocation, completion)
 * - per-query memory management
 * - query submission and cancellation (user-visible and internal)
 */
/*
 *  This file is part of adns, which is Copyright (C) 1997-1999 Ian Jackson
 *  
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2, or (at your option)
 *  any later version.
 *  
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *  
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software Foundation,
 *  Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. 
 */

#include "internal.h"

#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>

#include <sys/time.h>

#include "internal.h"

static adns_query query_alloc(adns_state ads, const typeinfo *typei,
			      adns_queryflags flags, struct timeval now) {
  /* Allocate a virgin query and return it. */
  adns_query qu;
  
  qu= malloc(sizeof(*qu));  if (!qu) return 0;
  qu->answer= malloc(sizeof(*qu->answer));  if (!qu->answer) { free(qu); return 0; }
  
  qu->ads= ads;
  qu->state= query_udp;
  qu->back= qu->next= qu->parent= 0;
  LIST_INIT(qu->children);
  LINK_INIT(qu->siblings);
  LIST_INIT(qu->allocations);
  qu->interim_allocd= 0;
  qu->final_allocspace= 0;

  qu->typei= typei;
  qu->query_dgram= 0;
  qu->query_dglen= 0;
  adns__vbuf_init(&qu->vb);

  qu->cname_dgram= 0;
  qu->cname_dglen= qu->cname_begin= 0;

  adns__vbuf_init(&qu->search_vb);
  qu->search_origlen= qu->search_pos= qu->search_doneabs= 0;

  qu->id= 0;
  qu->flags= flags;
  qu->udpretries= 0;
  qu->udpnextserver= 0;
  qu->udpsent= qu->tcpfailed= 0;
  timerclear(&qu->timeout);
  qu->expires= now.tv_sec + MAXTTLBELIEVE;

  memset(&qu->ctx,0,sizeof(qu->ctx));

  qu->answer->status= adns_s_ok;
  qu->answer->cname= 0;
  qu->answer->type= typei->type;
  qu->answer->expires= -1;
  qu->answer->nrrs= 0;
  qu->answer->rrs= 0;
  qu->answer->rrsz= typei->rrsz;

  return qu;
}

static void query_submit(adns_state ads, adns_query qu,
			 const typeinfo *typei, vbuf *qumsg_vb, int id,
			 adns_queryflags flags, struct timeval now) {
  /* Fills in the query message in for a previously-allocated query,
   * and submits it.  Cannot fail.
   */

  qu->vb= *qumsg_vb;
  adns__vbuf_init(qumsg_vb);

  qu->query_dgram= malloc(qu->vb.used);
  if (!qu->query_dgram) { adns__query_fail(qu,adns_s_nomemory); return; }
  
  qu->id= id;
  qu->query_dglen= qu->vb.used;
  memcpy(qu->query_dgram,qu->vb.buf,qu->vb.used);
  
  adns__query_udp(qu,now);
  adns__autosys(ads,now);
}

adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
				  const typeinfo *typei, vbuf *qumsg_vb, int id,
				  adns_queryflags flags, struct timeval now,
				  const qcontext *ctx) {
  adns_query qu;

  qu= query_alloc(ads,typei,flags,now);
  if (!qu) { adns__vbuf_free(qumsg_vb); return adns_s_nomemory; }
  *query_r= qu;

  memcpy(&qu->ctx,ctx,sizeof(qu->ctx));
  query_submit(ads,qu, typei,qumsg_vb,id,flags,now);
  
  return adns_s_ok;
}

static void query_simple(adns_state ads, adns_query qu,
			 const char *owner, int ol,
			 const typeinfo *typei, adns_queryflags flags,
			 struct timeval now) {
  vbuf vb;
  int id;
  adns_status stat;

  adns__vbuf_init(&vb);
  
  stat= adns__mkquery(ads,&vb,&id, owner,ol, typei,flags);
  if (stat) { adns__query_fail(qu,stat); return; }

  query_submit(ads,qu, typei,&vb,id, flags,now);
}

void adns__search_next(adns_state ads, adns_query qu, struct timeval now) {
  const char *nextentry;
  adns_status stat;
  
  if (qu->search_doneabs<0) {
    nextentry= 0;
    qu->search_doneabs= 1;
  } else {
    if (qu->search_pos >= ads->nsearchlist) {
      if (qu->search_doneabs) {
	stat= adns_s_nxdomain; goto x_fail;
	return;
      } else {
	nextentry= 0;
	qu->search_doneabs= 1;
      }
    } else {
      nextentry= ads->searchlist[qu->search_pos++];
    }
  }

  qu->search_vb.used= qu->search_origlen;
  if (nextentry) {
    if (!adns__vbuf_append(&qu->search_vb,".",1) ||
	!adns__vbuf_appendstr(&qu->search_vb,nextentry)) {
      stat= adns_s_nomemory; goto x_fail;
    }
  }

  free(qu->query_dgram);
  qu->query_dgram= 0; qu->query_dglen= 0;

  query_simple(ads,qu, qu->search_vb.buf, qu->search_vb.used, qu->typei, qu->flags, now);
  return;
  
x_fail:
  adns__query_fail(qu,stat);
}

int adns_submit(adns_state ads,
		const char *owner,
		adns_rrtype type,
		adns_queryflags flags,
		void *context,
		adns_query *query_r) {
  int r, ol, ndots;
  adns_status stat;
  const typeinfo *typei;
  struct timeval now;
  adns_query qu;
  const char *p;

  typei= adns__findtype(type);
  if (!typei) return adns_s_unknownrrtype;

  r= gettimeofday(&now,0); if (r) goto x_errno;
  qu= query_alloc(ads,typei,flags,now); if (!qu) goto x_errno;
  
  qu->ctx.ext= context;
  qu->ctx.callback= 0;
  memset(&qu->ctx.info,0,sizeof(qu->ctx.info));

  *query_r= qu;

  ol= strlen(owner);
  if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
  if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
				 
  if (ol>=2 && owner[ol-1]=='.' && owner[ol-2]!='\\') { flags &= ~adns_qf_search; ol--; }

  if (flags & adns_qf_search) {
    r= adns__vbuf_append(&qu->search_vb,owner,ol);
    if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }

    for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
    qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
    qu->search_origlen= ol;
    adns__search_next(ads,qu,now);
  } else {
    query_simple(ads,qu, owner,ol, typei,flags, now);
  }
  return 0;

 x_adnsfail:
  adns__query_fail(qu,stat);
  return 0;

 x_errno:
  r= errno;
  assert(r);
  return r;
}

int adns_synchronous(adns_state ads,
		     const char *owner,
		     adns_rrtype type,
		     adns_queryflags flags,
		     adns_answer **answer_r) {
  adns_query qu;
  int r;
  
  r= adns_submit(ads,owner,type,flags,0,&qu);
  if (r) return r;

  r= adns_wait(ads,&qu,answer_r,0);
  if (r) adns_cancel(qu);

  return r;
}

static void *alloc_common(adns_query qu, size_t sz) {
  allocnode *an;

  if (!sz) return qu; /* Any old pointer will do */
  assert(!qu->final_allocspace);
  an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
  if (!an) return 0;
  LIST_LINK_TAIL(qu->allocations,an);
  return (byte*)an + MEM_ROUND(sizeof(*an));
}

void *adns__alloc_interim(adns_query qu, size_t sz) {
  sz= MEM_ROUND(sz);
  qu->interim_allocd += sz;
  return alloc_common(qu,sz);
}

void *adns__alloc_mine(adns_query qu, size_t sz) {
  return alloc_common(qu,MEM_ROUND(sz));
}

void adns__transfer_interim(adns_query from, adns_query to, void *block, size_t sz) {
  allocnode *an;

  if (!block) return;
  an= (void*)((byte*)block - MEM_ROUND(sizeof(*an)));

  assert(!to->final_allocspace);
  assert(!from->final_allocspace);
  
  LIST_UNLINK(from->allocations,an);
  LIST_LINK_TAIL(to->allocations,an);

  from->interim_allocd -= sz;
  to->interim_allocd += sz;

  if (to->expires > from->expires) to->expires= from->expires;
}

void *adns__alloc_final(adns_query qu, size_t sz) {
  /* When we're in the _final stage, we _subtract_ from interim_alloc'd
   * each allocation, and use final_allocspace to point to the next free
   * bit.
   */
  void *rp;

  sz= MEM_ROUND(sz);
  rp= qu->final_allocspace;
  assert(rp);
  qu->interim_allocd -= sz;
  assert(qu->interim_allocd>=0);
  qu->final_allocspace= (byte*)rp + sz;
  return rp;
}

static void cancel_children(adns_query qu) {
  adns_query cqu, ncqu;

  for (cqu= qu->children.head; cqu; cqu= ncqu) {
    ncqu= cqu->siblings.next;
    adns_cancel(cqu);
  }
  LIST_INIT(qu->children);
}

void adns__reset_cnameonly(adns_query qu) {
  assert(!qu->final_allocspace);
  cancel_children(qu);
  qu->answer->nrrs= 0;
  qu->answer->rrs= 0;
  qu->interim_allocd= qu->answer->cname ? MEM_ROUND(strlen(qu->answer->cname)+1) : 0;
}

static void free_query_allocs(adns_query qu) {
  allocnode *an, *ann;

  cancel_children(qu);
  for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
  adns__vbuf_free(&qu->vb);
}

void adns_cancel(adns_query qu) {
  switch (qu->state) {
  case query_udp: case query_tcpwait: case query_tcpsent:
    LIST_UNLINK(qu->ads->timew,qu);
    break;
  case query_child:
    LIST_UNLINK(qu->ads->childw,qu);
    break;
  case query_done:
    LIST_UNLINK(qu->ads->output,qu);
    break;
  default:
    abort();
  }
  free_query_allocs(qu);
  free(qu->answer);
  free(qu);
}

void adns__update_expires(adns_query qu, unsigned long ttl, struct timeval now) {
  time_t max;

  assert(ttl <= MAXTTLBELIEVE);
  max= now.tv_sec + ttl;
  if (qu->expires < max) return;
  qu->expires= max;
}

static void makefinal_query(adns_query qu) {
  adns_answer *ans;
  int rrn;

  ans= qu->answer;

  if (qu->interim_allocd) {
    ans= realloc(qu->answer, MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
    if (!ans) goto x_nomem;
    qu->answer= ans;
  }

  qu->final_allocspace= (byte*)ans + MEM_ROUND(sizeof(*ans));
  adns__makefinal_str(qu,&ans->cname);
  
  if (ans->nrrs) {
    adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);

    for (rrn=0; rrn<ans->nrrs; rrn++)
      qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
  }
  
  free_query_allocs(qu);
  return;
  
 x_nomem:
  qu->answer->status= adns_s_nomemory;
  qu->answer->cname= 0;
  adns__reset_cnameonly(qu);
  free_query_allocs(qu);
}

void adns__query_done(adns_query qu) {
  adns_answer *ans;
  adns_query parent;

  qu->id= -1;
  ans= qu->answer;

  if (ans->nrrs && qu->typei->diff_needswap) {
    if (!adns__vbuf_ensure(&qu->vb,qu->typei->rrsz)) {
      adns__query_fail(qu,adns_s_nomemory);
      return;
    }
    adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
		qu->vb.buf,
		(int(*)(void*, const void*, const void*))qu->typei->diff_needswap,
		qu->ads);
  }

  ans->expires= qu->expires;
  parent= qu->parent;
  if (parent) {
    LIST_UNLINK_PART(parent->children,qu,siblings.);
    qu->ctx.callback(parent,qu);
    free_query_allocs(qu);
    free(qu);
  } else {
    makefinal_query(qu);
    LIST_LINK_TAIL(qu->ads->output,qu);
  }
}

void adns__query_fail(adns_query qu, adns_status stat) {
  adns__reset_cnameonly(qu);
  qu->answer->status= stat;
  adns__query_done(qu);
}

void adns__makefinal_str(adns_query qu, char **strp) {
  int l;
  char *before, *after;

  before= *strp;
  if (!before) return;
  l= strlen(before)+1;
  after= adns__alloc_final(qu,l);
  memcpy(after,before,l);
  *strp= after;  
}

void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
  void *before, *after;

  before= *blpp;
  if (!before) return;
  after= adns__alloc_final(qu,sz);
  memcpy(after,before,sz);
  *blpp= after;
}
Commit	Line	Data
e576be50	1	/*
	2	* query.c
	3	* - overall query management (allocation, completion)
	4	* - per-query memory management
	5	* - query submission and cancellation (user-visible and internal)
	6	*/
	7	/*
a719a4be	8	* This file is part of adns, which is Copyright (C) 1997-1999 Ian Jackson
e576be50	9	*
	10	* This program is free software; you can redistribute it and/or modify
	11	* it under the terms of the GNU General Public License as published by
	12	* the Free Software Foundation; either version 2, or (at your option)
	13	* any later version.
	14	*
	15	* This program is distributed in the hope that it will be useful,
	16	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	17	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	18	* GNU General Public License for more details.
	19	*
	20	* You should have received a copy of the GNU General Public License
	21	* along with this program; if not, write to the Free Software Foundation,
	22	* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
	23	*/
4353a5c4	24
4bec51a4	25	#include "internal.h"
656b2da9	26
e576be50	27	#include <stdlib.h>
	28	#include <unistd.h>
	29	#include <errno.h>
a6536d8b	30	#include <string.h>
656b2da9	31
e576be50	32	#include <sys/time.h>
656b2da9	33
e576be50	34	#include "internal.h"
ddfda861	35
660d7d3b	36	static adns_query query_alloc(adns_state ads, const typeinfo *typei,
	37	adns_queryflags flags, struct timeval now) {
	38	/* Allocate a virgin query and return it. */
e576be50	39	adns_query qu;
660d7d3b	40
	41	qu= malloc(sizeof(*qu)); if (!qu) return 0;
	42	qu->answer= malloc(sizeof(*qu->answer)); if (!qu->answer) { free(qu); return 0; }
	43
3955725c	44	qu->ads= ads;
e576be50	45	qu->state= query_udp;
	46	qu->back= qu->next= qu->parent= 0;
	47	LIST_INIT(qu->children);
660d7d3b	48	LINK_INIT(qu->siblings);
551ff40f	49	LIST_INIT(qu->allocations);
e576be50	50	qu->interim_allocd= 0;
3955725c	51	qu->final_allocspace= 0;
e576be50	52
3955725c	53	qu->typei= typei;
660d7d3b	54	qu->query_dgram= 0;
660d7d3b	55	qu->query_dglen= 0;
e576be50	56	adns__vbuf_init(&qu->vb);
	57
	58	qu->cname_dgram= 0;
	59	qu->cname_dglen= qu->cname_begin= 0;
660d7d3b	60
	61	adns__vbuf_init(&qu->search_vb);
	62	qu->search_origlen= qu->search_pos= qu->search_doneabs= 0;
	63
	64	qu->id= 0;
e576be50	65	qu->flags= flags;
	66	qu->udpretries= 0;
	67	qu->udpnextserver= 0;
	68	qu->udpsent= qu->tcpfailed= 0;
	69	timerclear(&qu->timeout);
73dba56e	70	qu->expires= now.tv_sec + MAXTTLBELIEVE;
e576be50	71
660d7d3b	72	memset(&qu->ctx,0,sizeof(qu->ctx));
660d7d3b	73
e576be50	74	qu->answer->status= adns_s_ok;
e576be50	75	qu->answer->cname= 0;
3955725c	76	qu->answer->type= typei->type;
660d7d3b	77	qu->answer->expires= -1;
e576be50	78	qu->answer->nrrs= 0;
e576be50	79	qu->answer->rrs= 0;
3955725c	80	qu->answer->rrsz= typei->rrsz;
ddfda861	81
660d7d3b	82	return qu;
	83	}
	84
	85	static void query_submit(adns_state ads, adns_query qu,
	86	const typeinfo typei, vbuf qumsg_vb, int id,
	87	adns_queryflags flags, struct timeval now) {
	88	/* Fills in the query message in for a previously-allocated query,
	89	* and submits it. Cannot fail.
	90	*/
	91
e576be50	92	qu->vb= *qumsg_vb;
e576be50	93	adns__vbuf_init(qumsg_vb);
660d7d3b	94
	95	qu->query_dgram= malloc(qu->vb.used);
	96	if (!qu->query_dgram) { adns__query_fail(qu,adns_s_nomemory); return; }
	97
	98	qu->id= id;
	99	qu->query_dglen= qu->vb.used;
	100	memcpy(qu->query_dgram,qu->vb.buf,qu->vb.used);
e576be50	101
3955725c	102	adns__query_udp(qu,now);
e576be50	103	adns__autosys(ads,now);
660d7d3b	104	}
	105
	106	adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
	107	const typeinfo typei, vbuf qumsg_vb, int id,
	108	adns_queryflags flags, struct timeval now,
	109	const qcontext *ctx) {
	110	adns_query qu;
	111
	112	qu= query_alloc(ads,typei,flags,now);
	113	if (!qu) { adns__vbuf_free(qumsg_vb); return adns_s_nomemory; }
	114	*query_r= qu;
e576be50	115
660d7d3b	116	memcpy(&qu->ctx,ctx,sizeof(qu->ctx));
	117	query_submit(ads,qu, typei,qumsg_vb,id,flags,now);
	118
3955725c	119	return adns_s_ok;
660d7d3b	120	}
	121
	122	static void query_simple(adns_state ads, adns_query qu,
	123	const char *owner, int ol,
	124	const typeinfo *typei, adns_queryflags flags,
	125	struct timeval now) {
	126	vbuf vb;
	127	int id;
	128	adns_status stat;
e576be50	129
660d7d3b	130	adns__vbuf_init(&vb);
	131
	132	stat= adns__mkquery(ads,&vb,&id, owner,ol, typei,flags);
	133	if (stat) { adns__query_fail(qu,stat); return; }
	134
	135	query_submit(ads,qu, typei,&vb,id, flags,now);
	136	}
	137
	138	void adns__search_next(adns_state ads, adns_query qu, struct timeval now) {
	139	const char *nextentry;
	140	adns_status stat;
	141
	142	if (qu->search_doneabs<0) {
	143	nextentry= 0;
	144	qu->search_doneabs= 1;
	145	} else {
	146	if (qu->search_pos >= ads->nsearchlist) {
	147	if (qu->search_doneabs) {
	148	stat= adns_s_nxdomain; goto x_fail;
	149	return;
	150	} else {
	151	nextentry= 0;
	152	qu->search_doneabs= 1;
	153	}
	154	} else {
	155	nextentry= ads->searchlist[qu->search_pos++];
	156	}
	157	}
	158
e2632eb9	159	qu->search_vb.used= qu->search_origlen;
660d7d3b	160	if (nextentry) {
	161	if (!adns__vbuf_append(&qu->search_vb,".",1) \|\|
	162	!adns__vbuf_appendstr(&qu->search_vb,nextentry)) {
	163	stat= adns_s_nomemory; goto x_fail;
660d7d3b	164	}
	165	}
	166
	167	free(qu->query_dgram);
	168	qu->query_dgram= 0; qu->query_dglen= 0;
	169
	170	query_simple(ads,qu, qu->search_vb.buf, qu->search_vb.used, qu->typei, qu->flags, now);
	171	return;
	172
	173	x_fail:
	174	adns__query_fail(qu,stat);
4bec51a4	175	}
4bec51a4	176
e576be50	177	int adns_submit(adns_state ads,
	178	const char *owner,
	179	adns_rrtype type,
	180	adns_queryflags flags,
	181	void *context,
	182	adns_query *query_r) {
660d7d3b	183	int r, ol, ndots;
3955725c	184	adns_status stat;
	185	const typeinfo *typei;
	186	struct timeval now;
660d7d3b	187	adns_query qu;
660d7d3b	188	const char *p;
e576be50	189
3955725c	190	typei= adns__findtype(type);
ea1e31e3	191	if (!typei) return adns_s_unknownrrtype;
e576be50	192
660d7d3b	193	r= gettimeofday(&now,0); if (r) goto x_errno;
	194	qu= query_alloc(ads,typei,flags,now); if (!qu) goto x_errno;
	195
	196	qu->ctx.ext= context;
	197	qu->ctx.callback= 0;
	198	memset(&qu->ctx.info,0,sizeof(qu->ctx.info));
e576be50	199
e2632eb9	200	*query_r= qu;
e2632eb9	201
e576be50	202	ol= strlen(owner);
660d7d3b	203	if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
660d7d3b	204	if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
e576be50	205
32af6b2a	206	if (ol>=2 && owner[ol-1]=='.' && owner[ol-2]!='\\') { flags &= ~adns_qf_search; ol--; }
e576be50	207
660d7d3b	208	if (flags & adns_qf_search) {
	209	r= adns__vbuf_append(&qu->search_vb,owner,ol);
	210	if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }
	211
	212	for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
	213	qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
660d7d3b	214	qu->search_origlen= ol;
660d7d3b	215	adns__search_next(ads,qu,now);
e2632eb9	216	} else {
e2632eb9	217	query_simple(ads,qu, owner,ol, typei,flags, now);
660d7d3b	218	}
660d7d3b	219	return 0;
	220
	221	x_adnsfail:
	222	adns__query_fail(qu,stat);
	223	return 0;
	224
	225	x_errno:
	226	r= errno;
	227	assert(r);
	228	return r;
ddfda861	229	}
ddfda861	230
e576be50	231	int adns_synchronous(adns_state ads,
	232	const char *owner,
	233	adns_rrtype type,
	234	adns_queryflags flags,
	235	adns_answer **answer_r) {
	236	adns_query qu;
	237	int r;
	238
	239	r= adns_submit(ads,owner,type,flags,0,&qu);
	240	if (r) return r;
4bec51a4	241
88372443	242	r= adns_wait(ads,&qu,answer_r,0);
3955725c	243	if (r) adns_cancel(qu);
ddfda861	244
88372443	245	return r;
e576be50	246	}
e576be50	247
f759e52e	248	static void *alloc_common(adns_query qu, size_t sz) {
e576be50	249	allocnode *an;
e576be50	250
a49a6d7b	251	if (!sz) return qu; /* Any old pointer will do */
e576be50	252	assert(!qu->final_allocspace);
e576be50	253	an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
e062dcae	254	if (!an) return 0;
551ff40f	255	LIST_LINK_TAIL(qu->allocations,an);
e576be50	256	return (byte)an + MEM_ROUND(sizeof(an));
e576be50	257	}
4bec51a4	258
f759e52e	259	void *adns__alloc_interim(adns_query qu, size_t sz) {
	260	sz= MEM_ROUND(sz);
	261	qu->interim_allocd += sz;
	262	return alloc_common(qu,sz);
	263	}
	264
	265	void *adns__alloc_mine(adns_query qu, size_t sz) {
	266	return alloc_common(qu,MEM_ROUND(sz));
	267	}
	268
551ff40f	269	void adns__transfer_interim(adns_query from, adns_query to, void *block, size_t sz) {
	270	allocnode *an;
	271
	272	if (!block) return;
	273	an= (void)((byte)block - MEM_ROUND(sizeof(*an)));
	274
	275	assert(!to->final_allocspace);
	276	assert(!from->final_allocspace);
	277
	278	LIST_UNLINK(from->allocations,an);
	279	LIST_LINK_TAIL(to->allocations,an);
	280
	281	from->interim_allocd -= sz;
	282	to->interim_allocd += sz;
73dba56e	283
73dba56e	284	if (to->expires > from->expires) to->expires= from->expires;
551ff40f	285	}
551ff40f	286
e576be50	287	void *adns__alloc_final(adns_query qu, size_t sz) {
	288	/* When we're in the _final stage, we _subtract_ from interim_alloc'd
	289	* each allocation, and use final_allocspace to point to the next free
	290	* bit.
	291	*/
	292	void *rp;
	293
	294	sz= MEM_ROUND(sz);
	295	rp= qu->final_allocspace;
	296	assert(rp);
	297	qu->interim_allocd -= sz;
	298	assert(qu->interim_allocd>=0);
	299	qu->final_allocspace= (byte*)rp + sz;
	300	return rp;
	301	}
	302
9ec44266	303	static void cancel_children(adns_query qu) {
	304	adns_query cqu, ncqu;
	305
	306	for (cqu= qu->children.head; cqu; cqu= ncqu) {
	307	ncqu= cqu->siblings.next;
	308	adns_cancel(cqu);
	309	}
	310	LIST_INIT(qu->children);
	311	}
	312
3955725c	313	void adns__reset_cnameonly(adns_query qu) {
9557e604	314	assert(!qu->final_allocspace);
9ec44266	315	cancel_children(qu);
e576be50	316	qu->answer->nrrs= 0;
	317	qu->answer->rrs= 0;
	318	qu->interim_allocd= qu->answer->cname ? MEM_ROUND(strlen(qu->answer->cname)+1) : 0;
4353a5c4	319	}
4353a5c4	320
88372443	321	static void free_query_allocs(adns_query qu) {
88372443	322	allocnode an, ann;
88372443	323
9ec44266	324	cancel_children(qu);
551ff40f	325	for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
88372443	326	adns__vbuf_free(&qu->vb);
	327	}
	328
1dfe95d8	329	void adns_cancel(adns_query qu) {
88372443	330	switch (qu->state) {
88372443	331	case query_udp: case query_tcpwait: case query_tcpsent:
1dfe95d8	332	LIST_UNLINK(qu->ads->timew,qu);
88372443	333	break;
88372443	334	case query_child:
1dfe95d8	335	LIST_UNLINK(qu->ads->childw,qu);
88372443	336	break;
88372443	337	case query_done:
1dfe95d8	338	LIST_UNLINK(qu->ads->output,qu);
88372443	339	break;
	340	default:
	341	abort();
	342	}
	343	free_query_allocs(qu);
	344	free(qu->answer);
	345	free(qu);
	346	}
551ff40f	347
73dba56e	348	void adns__update_expires(adns_query qu, unsigned long ttl, struct timeval now) {
	349	time_t max;
	350
	351	assert(ttl <= MAXTTLBELIEVE);
	352	max= now.tv_sec + ttl;
	353	if (qu->expires < max) return;
	354	qu->expires= max;
	355	}
	356
551ff40f	357	static void makefinal_query(adns_query qu) {
98a3f706	358	adns_answer *ans;
88372443	359	int rrn;
8e5b0abb	360
88372443	361	ans= qu->answer;
551ff40f	362
88372443	363	if (qu->interim_allocd) {
88372443	364	ans= realloc(qu->answer, MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
551ff40f	365	if (!ans) goto x_nomem;
e062dcae	366	qu->answer= ans;
e062dcae	367	}
8e5b0abb	368
88372443	369	qu->final_allocspace= (byte)ans + MEM_ROUND(sizeof(ans));
8e5b0abb	370	adns__makefinal_str(qu,&ans->cname);
88372443	371
8e5b0abb	372	if (ans->nrrs) {
88372443	373	adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);
8e5b0abb	374
88372443	375	for (rrn=0; rrn<ans->nrrs; rrn++)
88372443	376	qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
88372443	377	}
73dba56e	378
88372443	379	free_query_allocs(qu);
551ff40f	380	return;
8e5b0abb	381
551ff40f	382	x_nomem:
ea1e31e3	383	qu->answer->status= adns_s_nomemory;
551ff40f	384	qu->answer->cname= 0;
	385	adns__reset_cnameonly(qu);
	386	free_query_allocs(qu);
	387	}
	388
	389	void adns__query_done(adns_query qu) {
	390	adns_answer *ans;
	391	adns_query parent;
	392
4353a5c4	393	qu->id= -1;
551ff40f	394	ans= qu->answer;
	395
	396	if (ans->nrrs && qu->typei->diff_needswap) {
	397	if (!adns__vbuf_ensure(&qu->vb,qu->typei->rrsz)) {
ea1e31e3	398	adns__query_fail(qu,adns_s_nomemory);
551ff40f	399	return;
	400	}
	401	adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
09957b1c	402	qu->vb.buf,
	403	(int()(void, const void, const void))qu->typei->diff_needswap,
	404	qu->ads);
551ff40f	405	}
e553d072	406
73dba56e	407	ans->expires= qu->expires;
551ff40f	408	parent= qu->parent;
	409	if (parent) {
	410	LIST_UNLINK_PART(parent->children,qu,siblings.);
a6536d8b	411	qu->ctx.callback(parent,qu);
551ff40f	412	free_query_allocs(qu);
551ff40f	413	free(qu);
551ff40f	414	} else {
	415	makefinal_query(qu);
	416	LIST_LINK_TAIL(qu->ads->output,qu);
	417	}
656b2da9	418	}
656b2da9	419
3955725c	420	void adns__query_fail(adns_query qu, adns_status stat) {
3955725c	421	adns__reset_cnameonly(qu);
8e5b0abb	422	qu->answer->status= stat;
3955725c	423	adns__query_done(qu);
656b2da9	424	}
e576be50	425
	426	void adns__makefinal_str(adns_query qu, char **strp) {
	427	int l;
	428	char before, after;
	429
	430	before= *strp;
9557e604	431	if (!before) return;
e576be50	432	l= strlen(before)+1;
	433	after= adns__alloc_final(qu,l);
	434	memcpy(after,before,l);
	435	*strp= after;
	436	}
	437
3955725c	438	void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
9557e604	439	void before, after;
e576be50	440
9557e604	441	before= *blpp;
9557e604	442	if (!before) return;
e576be50	443	after= adns__alloc_final(qu,sz);
9557e604	444	memcpy(after,before,sz);
e576be50	445	*blpp= after;
e576be50	446	}