config.c revision 4e68c7c87c30c28490c92937adc112dca5b5d5ae
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * Copyright (C) 2004-2011 Internet Systems Consortium, Inc. ("ISC")
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * Copyright (C) 2001-2003 Internet Software Consortium.
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * Permission to use, copy, modify, and/or distribute this software for any
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * purpose with or without fee is hereby granted, provided that the above
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * copyright notice and this permission notice appear in all copies.
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt * PERFORMANCE OF THIS SOFTWARE.
36ec0d374836d070ba05b495e6f0a27f60e94476Evan Hunt/* $Id: config.c,v 1.121 2011/08/30 23:46:51 tbox Exp $ */
#include <config.h>
#include <stdlib.h>
#include "bind.keys.h"
#ifndef WIN32
secroots-file \"named.secroots\";\n\
#ifdef PATH_RANDOMDEV
statistics-file \"named.stats\";\n\
#ifdef ALLOW_FILTER_AAAA_ON_V4
zone \"id.server\" chaos {\n\
# sysconfdir/bind.keys doesn't exist).\n\
/* Imported from bind.keys.h: */
isc_buffer_t b;
return (ISC_R_NOTFOUND);
return (ISC_R_SUCCESS);
return (ISC_R_NOTFOUND);
return (ISC_R_SUCCESS);
which) == 0) {
return (ISC_R_SUCCESS);
const cfg_listelt_t *e;
return (ISC_R_SUCCESS);
return (result);
return (ISC_R_SUCCESS);
return (result);
const char *str;
INSIST(0);
return (ztype);
int count, i = 0;
return (ISC_R_RANGE);
} else if (defport != 0)
return (result);
return (ISC_R_NOMEMORY);
return (ISC_R_SUCCESS);
static isc_result_t
return (result);
const char *listname;
return (ISC_R_SUCCESS);
return (ISC_R_NOTFOUND);
goto cleanup;
goto cleanup;
const char *keystr;
isc_buffer_t b;
if (listcount == l) {
void * new;
goto cleanup;
if (listcount != 0) {
goto cleanup;
goto cleanup;
void * new;
goto cleanup;
if (stackcount != 0) {
pushed++;
goto newlist;
if (i == addrcount) {
void * new;
goto cleanup;
if (addrcount != 0) {
goto cleanup;
if (keycount != 0) {
goto cleanup;
goto cleanup;
keys[i]);
goto cleanup;
if (pushed != 0) {
pushed--;
goto resume;
if (i < addrcount) {
void * new;
goto cleanup;
addrcount = i;
goto cleanup;
keycount = i;
return (ISC_R_SUCCESS);
return (result);
for (i = 0; i < count; i++) {
return (ISC_R_RANGE);
return (ISC_R_SUCCESS);
struct keyalgorithms {
const char *str;
unsigned int type;
} algorithms[] = {
return (ISC_R_NOTFOUND);
return (result);
return (ISC_R_RANGE);
INSIST(0);
return (ISC_R_SUCCESS);