120 lines
3.3 KiB
C
120 lines
3.3 KiB
C
|
/*
|
||
|
* Copyright (c) 1986, 1988 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.
|
||
|
*/
|
||
|
|
||
|
#ifndef lint
|
||
|
static char sccsid[] = "@(#)db_reload.c 4.22 (Berkeley) 3/21/91";
|
||
|
#endif /* not lint */
|
||
|
|
||
|
#include <sys/param.h>
|
||
|
#include <sys/time.h>
|
||
|
#include <netinet/in.h>
|
||
|
#include <arpa/nameser.h>
|
||
|
#include <stdio.h>
|
||
|
#include <syslog.h>
|
||
|
#include "ns.h"
|
||
|
#include "db.h"
|
||
|
|
||
|
extern time_t resettime;
|
||
|
|
||
|
/*
|
||
|
* Flush and reload data base.
|
||
|
*/
|
||
|
|
||
|
db_reload()
|
||
|
{
|
||
|
extern char *bootfile;
|
||
|
|
||
|
#ifdef DEBUG
|
||
|
if (debug >= 3)
|
||
|
fprintf(ddt,"reload()\n");
|
||
|
#endif
|
||
|
syslog(LOG_NOTICE, "reloading nameserver\n");
|
||
|
|
||
|
qflush();
|
||
|
sqflush();
|
||
|
fwdtab_free();
|
||
|
free_sort_list();
|
||
|
getnetconf();
|
||
|
ns_init(bootfile);
|
||
|
time(&resettime);
|
||
|
}
|
||
|
|
||
|
db_free(htp)
|
||
|
struct hashbuf *htp;
|
||
|
{
|
||
|
register struct databuf *dp, *nextdp;
|
||
|
register struct namebuf *np, *nextnp;
|
||
|
struct namebuf **npp, **nppend;
|
||
|
|
||
|
npp = htp->h_tab;
|
||
|
nppend = npp + htp->h_size;
|
||
|
while (npp < nppend) {
|
||
|
for (np = *npp++; np != NULL; np = nextnp) {
|
||
|
if (np->n_hash != NULL)
|
||
|
db_free(np->n_hash);
|
||
|
(void) free((char *)np->n_dname);
|
||
|
for (dp = np->n_data; dp != NULL; ) {
|
||
|
nextdp = dp->d_next;
|
||
|
(void) free((char *)dp);
|
||
|
dp = nextdp;
|
||
|
}
|
||
|
nextnp = np->n_next;
|
||
|
free((char *)np);
|
||
|
}
|
||
|
}
|
||
|
(void) free((char *)htp);
|
||
|
}
|
||
|
|
||
|
db_inv_free()
|
||
|
{
|
||
|
register struct invbuf *ip;
|
||
|
register int i, j;
|
||
|
|
||
|
for (i = 0; i < INVHASHSZ; i++)
|
||
|
for (ip = invtab[i]; ip != NULL; ip = ip->i_next)
|
||
|
for (j = 0; j < INVBLKSZ; j++)
|
||
|
ip->i_dname[j] = NULL;
|
||
|
}
|
||
|
|
||
|
fwdtab_free()
|
||
|
{
|
||
|
extern struct fwdinfo *fwdtab;
|
||
|
struct fwdinfo *fp, *nextfp;
|
||
|
|
||
|
for (fp = fwdtab; fp != NULL; fp = nextfp) {
|
||
|
nextfp = fp->next;
|
||
|
free((char *)fp);
|
||
|
}
|
||
|
fwdtab = NULL;
|
||
|
}
|