216 lines
6.9 KiB
C
216 lines
6.9 KiB
C
#if !defined(lint) && !defined(SABER)
|
|
static const char sccsid[] = "@(#)db_save.c 4.16 (Berkeley) 3/21/91";
|
|
static const char rcsid[] = "$Id: db_save.c,v 8.30 2002/05/18 01:02:56 marka Exp $";
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* Copyright (c) 1986
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
|
|
*
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies, and that
|
|
* the name of Digital Equipment Corporation not be used in advertising or
|
|
* publicity pertaining to distribution of the document or software without
|
|
* specific, written prior permission.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
|
|
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
|
|
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
|
* SOFTWARE.
|
|
*/
|
|
|
|
/*
|
|
* Portions Copyright (c) 1996-2000 by Internet Software Consortium.
|
|
*
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
|
* SOFTWARE.
|
|
*/
|
|
|
|
/*
|
|
* Buffer allocation and deallocation routines.
|
|
*/
|
|
|
|
#include "port_before.h"
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/param.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/un.h>
|
|
|
|
#include <netinet/in.h>
|
|
#include <arpa/nameser.h>
|
|
|
|
#include <errno.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <syslog.h>
|
|
#include <time.h>
|
|
|
|
#include <isc/eventlib.h>
|
|
#include <isc/logging.h>
|
|
#include <isc/memcluster.h>
|
|
|
|
#include "port_after.h"
|
|
|
|
#include "named.h"
|
|
|
|
/*
|
|
* Allocate a name buffer & save name.
|
|
*/
|
|
struct namebuf *
|
|
savename(const char *name, int len) {
|
|
struct namebuf *np;
|
|
|
|
/*
|
|
* Note that MAXLABEL * 4 < 256, so a single length byte is enough.
|
|
* Also, we use MAXLABEL * 4 because each label character can
|
|
* expand into up to four characters when rendered in canonical
|
|
* form.
|
|
*/
|
|
INSIST(len >= 0 && len <= (MAXLABEL * 4));
|
|
np = (struct namebuf *) memget(NAMESIZE(len));
|
|
if (np == NULL)
|
|
panic("savename: memget", NULL);
|
|
memset(np, 0, NAMESIZE(len));
|
|
NAMELEN(*np) = (unsigned)len;
|
|
memcpy(NAME(*np), name, len);
|
|
NAME(*np)[len] = '\0';
|
|
return (np);
|
|
}
|
|
|
|
/*
|
|
* Allocate a data buffer & save data.
|
|
*/
|
|
struct databuf *
|
|
savedata(class, type, ttl, data, size)
|
|
int class, type;
|
|
u_int32_t ttl;
|
|
u_char *data;
|
|
int size;
|
|
{
|
|
struct databuf *dp;
|
|
int bytes = BIND_DATASIZE(size);
|
|
|
|
dp = (struct databuf *)memget(bytes);
|
|
if (dp == NULL)
|
|
panic("savedata: memget", NULL);
|
|
if (class > CLASS_MAX)
|
|
panic("savedata: bad class", NULL);
|
|
memset(dp, 0, bytes);
|
|
dp->d_next = NULL;
|
|
dp->d_type = type;
|
|
dp->d_class = class;
|
|
dp->d_ttl = ttl;
|
|
dp->d_size = size;
|
|
dp->d_mark = 0;
|
|
dp->d_flags = 0;
|
|
dp->d_cred = 0;
|
|
dp->d_clev = 0;
|
|
dp->d_secure = DB_S_INSECURE;
|
|
dp->d_rcode = NOERROR;
|
|
dp->d_addr.s_addr = htonl(0);
|
|
dp->d_nstime = 0;
|
|
dp->d_rcnt = 1;
|
|
#ifdef CHECK_MAGIC
|
|
dp->d_magic = DATABUF_MAGIC;
|
|
#endif
|
|
memcpy(dp->d_data, data, dp->d_size);
|
|
return (dp);
|
|
}
|
|
|
|
/*
|
|
* Allocate a data buffer & save data.
|
|
*/
|
|
struct hashbuf *
|
|
savehash(oldhtp)
|
|
struct hashbuf *oldhtp;
|
|
{
|
|
struct hashbuf *htp;
|
|
struct namebuf *np, *nnp, **hp;
|
|
int n, newsize;
|
|
|
|
if (oldhtp == NULL)
|
|
newsize = hashsizes[0];
|
|
else {
|
|
for (n = 0; (newsize = hashsizes[n++]) != 0; (void)NULL)
|
|
if (oldhtp->h_size == newsize) {
|
|
newsize = hashsizes[n];
|
|
break;
|
|
}
|
|
if (newsize == 0)
|
|
newsize = oldhtp->h_size * 2 + 1;
|
|
}
|
|
ns_debug(ns_log_db, 4, "savehash GROWING to %d", newsize);
|
|
htp = (struct hashbuf *) memget(HASHSIZE(newsize));
|
|
if (htp == NULL)
|
|
ns_panic(ns_log_db, 0, "savehash: %s", strerror(errno));
|
|
htp->h_size = newsize;
|
|
memset(htp->h_tab, 0, newsize * sizeof(struct namebuf *));
|
|
if (oldhtp == NULL) {
|
|
htp->h_cnt = 0;
|
|
return (htp);
|
|
}
|
|
ns_debug(ns_log_db, 4, "savehash(%#lx) cnt=%d, sz=%d, newsz=%d",
|
|
(u_long)oldhtp, oldhtp->h_cnt, oldhtp->h_size, newsize);
|
|
htp->h_cnt = oldhtp->h_cnt;
|
|
for (n = 0; n < oldhtp->h_size; n++) {
|
|
for (np = oldhtp->h_tab[n]; np != NULL; np = nnp) {
|
|
nnp = np->n_next;
|
|
hp = &htp->h_tab[np->n_hashval % htp->h_size];
|
|
np->n_next = *hp;
|
|
*hp = np;
|
|
}
|
|
}
|
|
oldhtp->h_cnt = 0; /* Keep rm_hash() happy. */
|
|
rm_hash(oldhtp);
|
|
return (htp);
|
|
}
|