1/* 2 * Copyright (c) 1997-2006 Erez Zadok 3 * Copyright (c) 1989 Jan-Simon Pendry 4 * Copyright (c) 1989 Imperial College of Science, Technology & Medicine 5 * Copyright (c) 1989 The Regents of the University of California. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Jan-Simon Pendry at Imperial College, London. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgment: 21 * This product includes software developed by the University of 22 * California, Berkeley and its contributors. 23 * 4. Neither the name of the University nor the names of its contributors 24 * may be used to endorse or promote products derived from this software 25 * without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * 40 * File: am-utils/amd/info_hesiod.c 41 * 42 */ 43 44/* 45 * Get info from Hesiod 46 */ 47 48#ifdef HAVE_CONFIG_H 49# include <config.h> 50#endif /* HAVE_CONFIG_H */ 51#include <am_defs.h> 52#include <amd.h> 53 54#define HES_PREFIX "hesiod." 55#define HES_PREFLEN 7 56 57#ifdef HAVE_HESIOD_INIT 58/* bsdi3 does not define this extern in any header file */ 59extern char **hesiod_resolve(void *context, const char *name, const char *type); 60extern int hesiod_init(void **context); 61static voidp hesiod_context; 62#endif /* HAVE_HESIOD_INIT */ 63 64/* forward declarations */ 65int amu_hesiod_init(mnt_map *m, char *map, time_t *tp); 66int hesiod_search(mnt_map *m, char *map, char *key, char **pval, time_t *tp); 67int hesiod_isup(mnt_map *m, char *map); 68 69/* 70 * No easy way to probe the server - check the map name begins with "hesiod." 71 * Note: this name includes 'amu_' so as to not conflict with libhesiod's 72 * hesiod_init() function. 73 */ 74int 75amu_hesiod_init(mnt_map *m, char *map, time_t *tp) 76{ 77 dlog("amu_hesiod_init(%s)", map); 78 *tp = 0; 79 80#ifdef HAVE_HESIOD_INIT 81 if (!hesiod_context && hesiod_init(&hesiod_context) != 0) 82 return ENOENT; 83#endif /* HAVE_HESIOD_INIT */ 84 85 return NSTREQ(map, HES_PREFIX, HES_PREFLEN) ? 0 : ENOENT; 86} 87 88 89/* 90 * Do a Hesiod nameserver call. 91 * Modify time is ignored by Hesiod - XXX 92 */ 93int 94hesiod_search(mnt_map *m, char *map, char *key, char **pval, time_t *tp) 95{ 96 char hes_key[MAXPATHLEN]; 97 char **rvec; 98#ifndef HAVE_HESIOD_INIT 99 int error; 100#endif /* not HAVE_HESIOD_INIT */ 101 102 dlog("hesiod_search(m=%lx, map=%s, key=%s, pval=%lx tp=%lx)", 103 (unsigned long) m, map, key, (unsigned long) pval, (unsigned long) tp); 104 105 if (key[0] == '.') 106 return ENOENT; 107 108 xsnprintf(hes_key, sizeof(hes_key), "%s.%s", key, map + HES_PREFLEN); 109 110 /* 111 * Call the resolver 112 */ 113 dlog("Hesiod base is: %s\n", gopt.hesiod_base); 114 dlog("hesiod_search: hes_resolve(%s, %s)", hes_key, gopt.hesiod_base); 115 if (amuDebug(D_INFO)) 116 _res.options |= RES_DEBUG; 117 118#ifdef HAVE_HESIOD_INIT 119 /* new style hesiod */ 120 rvec = hesiod_resolve(hesiod_context, hes_key, gopt.hesiod_base); 121#else /* not HAVE_HESIOD_INIT */ 122 rvec = hes_resolve(hes_key, gopt.hesiod_base); 123#endif /* not HAVE_HESIOD_INIT */ 124 125 /* 126 * If a reply was forthcoming then return 127 * it (and free subsequent replies) 128 */ 129 if (rvec && *rvec) { 130 *pval = *rvec; 131 while (*++rvec) 132 XFREE(*rvec); 133 return 0; 134 } 135 136#ifdef HAVE_HESIOD_INIT 137 /* new style hesiod */ 138 return errno; 139#else /* not HAVE_HESIOD_INIT */ 140 /* 141 * Otherwise reflect the hesiod error into a Un*x error 142 */ 143 dlog("hesiod_search: Error: %d", hes_error()); 144 switch (hes_error()) { 145 case HES_ER_NOTFOUND: 146 error = ENOENT; 147 break; 148 case HES_ER_CONFIG: 149 error = EIO; 150 break; 151 case HES_ER_NET: 152 error = ETIMEDOUT; 153 break; 154 default: 155 error = EINVAL; 156 break; 157 } 158 dlog("hesiod_search: Returning: %d", error); 159 return error; 160#endif /* not HAVE_HESIOD_INIT */ 161} 162 163 164/* 165 * Check if Hesiod is up, so we can determine if to clear the map or not. 166 * Test it by querying for /defaults. 167 * Returns: 0 if Hesiod is down, 1 if it is up. 168 */ 169int 170hesiod_isup(mnt_map *m, char *map) 171{ 172 int error; 173 char *val; 174 time_t mtime; 175 static int last_status = 1; /* assume up by default */ 176 177 error = hesiod_search(m, map, "/defaults", &val, &mtime); 178 dlog("hesiod_isup(%s): %s", map, strerror(error)); 179 if (error != 0 && error != ENOENT) { 180 plog(XLOG_ERROR, 181 "hesiod_isup: error getting `/defaults' entry in map %s: %m", map); 182 last_status = 0; 183 return 0; /* Hesiod is down */ 184 } 185 if (last_status == 0) { /* if was down before */ 186 plog(XLOG_INFO, "hesiod_isup: Hesiod came back up for map %s", map); 187 last_status = 1; 188 } 189 return 1; /* Hesiod is up */ 190} 191