Commit | Line | Data |
---|---|---|
0aef8126 WJ |
1 | /* |
2 | * Copyright (c) 1986, 1988 Regents of the University of California. | |
3 | * All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | #ifndef lint | |
35 | static char sccsid[] = "@(#)db_reload.c 4.22 (Berkeley) 3/21/91"; | |
36 | #endif /* not lint */ | |
37 | ||
38 | #include <sys/param.h> | |
39 | #include <sys/time.h> | |
40 | #include <netinet/in.h> | |
41 | #include <arpa/nameser.h> | |
42 | #include <stdio.h> | |
43 | #include <syslog.h> | |
44 | #include "ns.h" | |
45 | #include "db.h" | |
46 | ||
47 | extern time_t resettime; | |
48 | ||
49 | /* | |
50 | * Flush and reload data base. | |
51 | */ | |
52 | ||
53 | db_reload() | |
54 | { | |
55 | extern char *bootfile; | |
56 | ||
57 | #ifdef DEBUG | |
58 | if (debug >= 3) | |
59 | fprintf(ddt,"reload()\n"); | |
60 | #endif | |
61 | syslog(LOG_NOTICE, "reloading nameserver\n"); | |
62 | ||
63 | qflush(); | |
64 | sqflush(); | |
65 | fwdtab_free(); | |
66 | free_sort_list(); | |
67 | getnetconf(); | |
68 | ns_init(bootfile); | |
69 | time(&resettime); | |
70 | } | |
71 | ||
72 | db_free(htp) | |
73 | struct hashbuf *htp; | |
74 | { | |
75 | register struct databuf *dp, *nextdp; | |
76 | register struct namebuf *np, *nextnp; | |
77 | struct namebuf **npp, **nppend; | |
78 | ||
79 | npp = htp->h_tab; | |
80 | nppend = npp + htp->h_size; | |
81 | while (npp < nppend) { | |
82 | for (np = *npp++; np != NULL; np = nextnp) { | |
83 | if (np->n_hash != NULL) | |
84 | db_free(np->n_hash); | |
85 | (void) free((char *)np->n_dname); | |
86 | for (dp = np->n_data; dp != NULL; ) { | |
87 | nextdp = dp->d_next; | |
88 | (void) free((char *)dp); | |
89 | dp = nextdp; | |
90 | } | |
91 | nextnp = np->n_next; | |
92 | free((char *)np); | |
93 | } | |
94 | } | |
95 | (void) free((char *)htp); | |
96 | } | |
97 | ||
98 | db_inv_free() | |
99 | { | |
100 | register struct invbuf *ip; | |
101 | register int i, j; | |
102 | ||
103 | for (i = 0; i < INVHASHSZ; i++) | |
104 | for (ip = invtab[i]; ip != NULL; ip = ip->i_next) | |
105 | for (j = 0; j < INVBLKSZ; j++) | |
106 | ip->i_dname[j] = NULL; | |
107 | } | |
108 | ||
109 | fwdtab_free() | |
110 | { | |
111 | extern struct fwdinfo *fwdtab; | |
112 | struct fwdinfo *fp, *nextfp; | |
113 | ||
114 | for (fp = fwdtab; fp != NULL; fp = nextfp) { | |
115 | nextfp = fp->next; | |
116 | free((char *)fp); | |
117 | } | |
118 | fwdtab = NULL; | |
119 | } |