2N/A/*
2N/A * Copyright (c) 1989, 1993, 1995
2N/A * The Regents of the University of California. All rights reserved.
2N/A *
2N/A * Redistribution and use in source and binary forms, with or without
2N/A * modification, are permitted provided that the following conditions
2N/A * are met:
2N/A * 1. Redistributions of source code must retain the above copyright
2N/A * notice, this list of conditions and the following disclaimer.
2N/A * 2. Redistributions in binary form must reproduce the above copyright
2N/A * notice, this list of conditions and the following disclaimer in the
2N/A * documentation and/or other materials provided with the distribution.
2N/A * 3. All advertising materials mentioning features or use of this software
2N/A * must display the following acknowledgement:
2N/A * This product includes software developed by the University of
2N/A * California, Berkeley and its contributors.
2N/A * 4. Neither the name of the University nor the names of its contributors
2N/A * may be used to endorse or promote products derived from this software
2N/A * without specific prior written permission.
2N/A *
2N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
2N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2N/A * SUCH DAMAGE.
2N/A */
2N/A
2N/A/*
2N/A * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
2N/A * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
2N/A *
2N/A * Permission to use, copy, modify, and distribute this software for any
2N/A * purpose with or without fee is hereby granted, provided that the above
2N/A * copyright notice and this permission notice appear in all copies.
2N/A *
2N/A * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
2N/A * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
2N/A * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
2N/A * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
2N/A * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
2N/A * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
2N/A * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
2N/A */
2N/A
2N/A#if defined(LIBC_SCCS) && !defined(lint)
2N/Astatic const char rcsid[] = "$Id: lcl_sv.c,v 1.4 2005/04/27 04:56:31 sra Exp $";
2N/A#endif /* LIBC_SCCS and not lint */
2N/A
2N/A/* extern */
2N/A
2N/A#include "port_before.h"
2N/A
2N/A#include <sys/types.h>
2N/A#include <sys/socket.h>
2N/A#include <netinet/in.h>
2N/A#include <arpa/nameser.h>
2N/A#include <resolv.h>
2N/A
2N/A#ifdef IRS_LCL_SV_DB
2N/A#include <db.h>
2N/A#endif
2N/A#include <errno.h>
2N/A#include <fcntl.h>
2N/A#include <limits.h>
2N/A#include <stdio.h>
2N/A#include <string.h>
2N/A#include <stdlib.h>
2N/A
2N/A#include <irs.h>
2N/A#include <isc/memcluster.h>
2N/A
2N/A#include "port_after.h"
2N/A
2N/A#include "irs_p.h"
2N/A#include "lcl_p.h"
2N/A
2N/A#ifdef SPRINTF_CHAR
2N/A# define SPRINTF(x) strlen(sprintf/**/x)
2N/A#else
2N/A# define SPRINTF(x) ((size_t)sprintf x)
2N/A#endif
2N/A
2N/A/* Types */
2N/A
2N/Astruct pvt {
2N/A#ifdef IRS_LCL_SV_DB
2N/A DB * dbh;
2N/A int dbf;
2N/A#endif
2N/A struct lcl_sv sv;
2N/A};
2N/A
2N/A/* Forward */
2N/A
2N/Astatic void sv_close(struct irs_sv*);
2N/Astatic struct servent * sv_next(struct irs_sv *);
2N/Astatic struct servent * sv_byname(struct irs_sv *, const char *,
2N/A const char *);
2N/Astatic struct servent * sv_byport(struct irs_sv *, int, const char *);
2N/Astatic void sv_rewind(struct irs_sv *);
2N/Astatic void sv_minimize(struct irs_sv *);
2N/A/*global*/ struct servent * irs_lclsv_fnxt(struct lcl_sv *);
2N/A#ifdef IRS_LCL_SV_DB
2N/Astatic struct servent * sv_db_rec(struct lcl_sv *, DBT *, DBT *);
2N/A#endif
2N/A
2N/A/* Portability */
2N/A
2N/A#ifndef SEEK_SET
2N/A# define SEEK_SET 0
2N/A#endif
2N/A
2N/A/* Public */
2N/A
2N/Astruct irs_sv *
2N/Airs_lcl_sv(struct irs_acc *this) {
2N/A struct irs_sv *sv;
2N/A struct pvt *pvt;
2N/A
2N/A UNUSED(this);
2N/A
2N/A if ((sv = memget(sizeof *sv)) == NULL) {
2N/A errno = ENOMEM;
2N/A return (NULL);
2N/A }
2N/A memset(sv, 0x5e, sizeof *sv);
2N/A if ((pvt = memget(sizeof *pvt)) == NULL) {
2N/A memput(sv, sizeof *sv);
2N/A errno = ENOMEM;
2N/A return (NULL);
2N/A }
2N/A memset(pvt, 0, sizeof *pvt);
2N/A sv->private = pvt;
2N/A sv->close = sv_close;
2N/A sv->next = sv_next;
2N/A sv->byname = sv_byname;
2N/A sv->byport = sv_byport;
2N/A sv->rewind = sv_rewind;
2N/A sv->minimize = sv_minimize;
2N/A sv->res_get = NULL;
2N/A sv->res_set = NULL;
2N/A#ifdef IRS_LCL_SV_DB
2N/A pvt->dbf = R_FIRST;
2N/A#endif
2N/A return (sv);
2N/A}
2N/A
2N/A/* Methods */
2N/A
2N/Astatic void
2N/Asv_close(struct irs_sv *this) {
2N/A struct pvt *pvt = (struct pvt *)this->private;
2N/A
2N/A#ifdef IRS_LCL_SV_DB
2N/A if (pvt->dbh != NULL)
2N/A (*pvt->dbh->close)(pvt->dbh);
2N/A#endif
2N/A if (pvt->sv.fp)
2N/A fclose(pvt->sv.fp);
2N/A memput(pvt, sizeof *pvt);
2N/A memput(this, sizeof *this);
2N/A}
2N/A
2N/Astatic struct servent *
2N/Asv_byname(struct irs_sv *this, const char *name, const char *proto) {
2N/A#ifdef IRS_LCL_SV_DB
2N/A struct pvt *pvt = (struct pvt *)this->private;
2N/A#endif
2N/A struct servent *p;
2N/A char **cp;
2N/A
2N/A sv_rewind(this);
2N/A#ifdef IRS_LCL_SV_DB
2N/A if (pvt->dbh != NULL) {
2N/A DBT key, data;
2N/A
2N/A /* Note that (sizeof "/") == 2. */
2N/A if ((strlen(name) + sizeof "/" + proto ? strlen(proto) : 0)
2N/A > sizeof pvt->sv.line)
2N/A goto try_local;
2N/A key.data = pvt->sv.line;
2N/A key.size = SPRINTF((pvt->sv.line, "%s/%s", name,
2N/A proto ? proto : "")) + 1;
2N/A if (proto != NULL) {
2N/A if ((*pvt->dbh->get)(pvt->dbh, &key, &data, 0) != 0)
2N/A return (NULL);
2N/A } else if ((*pvt->dbh->seq)(pvt->dbh, &key, &data, R_CURSOR)
2N/A != 0)
2N/A return (NULL);
2N/A return (sv_db_rec(&pvt->sv, &key, &data));
2N/A }
2N/A try_local:
2N/A#endif
2N/A
2N/A while ((p = sv_next(this))) {
2N/A if (strcmp(name, p->s_name) == 0)
2N/A goto gotname;
2N/A for (cp = p->s_aliases; *cp; cp++)
2N/A if (strcmp(name, *cp) == 0)
2N/A goto gotname;
2N/A continue;
2N/A gotname:
2N/A if (proto == NULL || strcmp(p->s_proto, proto) == 0)
2N/A break;
2N/A }
2N/A return (p);
2N/A}
2N/A
2N/Astatic struct servent *
2N/Asv_byport(struct irs_sv *this, int port, const char *proto) {
2N/A#ifdef IRS_LCL_SV_DB
2N/A struct pvt *pvt = (struct pvt *)this->private;
2N/A#endif
2N/A struct servent *p;
2N/A
2N/A sv_rewind(this);
2N/A#ifdef IRS_LCL_SV_DB
2N/A if (pvt->dbh != NULL) {
2N/A DBT key, data;
2N/A u_short *ports;
2N/A
2N/A ports = (u_short *)pvt->sv.line;
2N/A ports[0] = 0;
2N/A ports[1] = port;
2N/A key.data = ports;
2N/A key.size = sizeof(u_short) * 2;
2N/A if (proto && *proto) {
2N/A strncpy((char *)ports + key.size, proto,
2N/A BUFSIZ - key.size);
2N/A key.size += strlen((char *)ports + key.size) + 1;
2N/A if ((*pvt->dbh->get)(pvt->dbh, &key, &data, 0) != 0)
2N/A return (NULL);
2N/A } else {
2N/A if ((*pvt->dbh->seq)(pvt->dbh, &key, &data, R_CURSOR)
2N/A != 0)
2N/A return (NULL);
2N/A }
2N/A return (sv_db_rec(&pvt->sv, &key, &data));
2N/A }
2N/A#endif
2N/A while ((p = sv_next(this))) {
2N/A if (p->s_port != port)
2N/A continue;
2N/A if (proto == NULL || strcmp(p->s_proto, proto) == 0)
2N/A break;
2N/A }
2N/A return (p);
2N/A}
2N/A
2N/Astatic void
2N/Asv_rewind(struct irs_sv *this) {
2N/A struct pvt *pvt = (struct pvt *)this->private;
2N/A
2N/A if (pvt->sv.fp) {
2N/A if (fseek(pvt->sv.fp, 0L, SEEK_SET) == 0)
2N/A return;
2N/A (void)fclose(pvt->sv.fp);
2N/A pvt->sv.fp = NULL;
2N/A }
2N/A#ifdef IRS_LCL_SV_DB
2N/A pvt->dbf = R_FIRST;
2N/A if (pvt->dbh != NULL)
2N/A return;
2N/A pvt->dbh = dbopen(_PATH_SERVICES_DB, O_RDONLY,O_RDONLY,DB_BTREE, NULL);
2N/A if (pvt->dbh != NULL) {
2N/A if (fcntl((*pvt->dbh->fd)(pvt->dbh), F_SETFD, 1) < 0) {
2N/A (*pvt->dbh->close)(pvt->dbh);
2N/A pvt->dbh = NULL;
2N/A }
2N/A return;
2N/A }
2N/A#endif
2N/A if ((pvt->sv.fp = fopen(_PATH_SERVICES, "r")) == NULL)
2N/A return;
2N/A if (fcntl(fileno(pvt->sv.fp), F_SETFD, 1) < 0) {
2N/A (void)fclose(pvt->sv.fp);
2N/A pvt->sv.fp = NULL;
2N/A }
2N/A}
2N/A
2N/Astatic struct servent *
2N/Asv_next(struct irs_sv *this) {
2N/A struct pvt *pvt = (struct pvt *)this->private;
2N/A
2N/A#ifdef IRS_LCL_SV_DB
2N/A if (pvt->dbh == NULL && pvt->sv.fp == NULL)
2N/A#else
2N/A if (pvt->sv.fp == NULL)
2N/A#endif
2N/A sv_rewind(this);
2N/A
2N/A#ifdef IRS_LCL_SV_DB
2N/A if (pvt->dbh != NULL) {
2N/A DBT key, data;
2N/A
2N/A while ((*pvt->dbh->seq)(pvt->dbh, &key, &data, pvt->dbf) == 0){
2N/A pvt->dbf = R_NEXT;
2N/A if (((char *)key.data)[0])
2N/A continue;
2N/A return (sv_db_rec(&pvt->sv, &key, &data));
2N/A }
2N/A }
2N/A#endif
2N/A
2N/A if (pvt->sv.fp == NULL)
2N/A return (NULL);
2N/A return (irs_lclsv_fnxt(&pvt->sv));
2N/A}
2N/A
2N/Astatic void
2N/Asv_minimize(struct irs_sv *this) {
2N/A struct pvt *pvt = (struct pvt *)this->private;
2N/A
2N/A#ifdef IRS_LCL_SV_DB
2N/A if (pvt->dbh != NULL) {
2N/A (*pvt->dbh->close)(pvt->dbh);
2N/A pvt->dbh = NULL;
2N/A }
2N/A#endif
2N/A if (pvt->sv.fp != NULL) {
2N/A (void)fclose(pvt->sv.fp);
2N/A pvt->sv.fp = NULL;
2N/A }
2N/A}
2N/A
2N/A/* Quasipublic. */
2N/A
2N/Astruct servent *
2N/Airs_lclsv_fnxt(struct lcl_sv *sv) {
2N/A char *p, *cp, **q;
2N/A
2N/A again:
2N/A if ((p = fgets(sv->line, BUFSIZ, sv->fp)) == NULL)
2N/A return (NULL);
2N/A if (*p == '#')
2N/A goto again;
2N/A sv->serv.s_name = p;
2N/A while (*p && *p != '\n' && *p != ' ' && *p != '\t' && *p != '#')
2N/A ++p;
2N/A if (*p == '\0' || *p == '#' || *p == '\n')
2N/A goto again;
2N/A *p++ = '\0';
2N/A while (*p == ' ' || *p == '\t')
2N/A p++;
2N/A if (*p == '\0' || *p == '#' || *p == '\n')
2N/A goto again;
2N/A sv->serv.s_port = htons((u_short)strtol(p, &cp, 10));
2N/A if (cp == p || (*cp != '/' && *cp != ','))
2N/A goto again;
2N/A p = cp + 1;
2N/A sv->serv.s_proto = p;
2N/A
2N/A q = sv->serv.s_aliases = sv->serv_aliases;
2N/A
2N/A while (*p && *p != '\n' && *p != ' ' && *p != '\t' && *p != '#')
2N/A ++p;
2N/A
2N/A while (*p == ' ' || *p == '\t') {
2N/A *p++ = '\0';
2N/A while (*p == ' ' || *p == '\t')
2N/A ++p;
2N/A if (*p == '\0' || *p == '#' || *p == '\n')
2N/A break;
2N/A if (q < &sv->serv_aliases[IRS_SV_MAXALIASES - 1])
2N/A *q++ = p;
2N/A while (*p && *p != '\n' && *p != ' ' && *p != '\t' && *p != '#')
2N/A ++p;
2N/A }
2N/A
2N/A *p = '\0';
2N/A *q = NULL;
2N/A return (&sv->serv);
2N/A}
2N/A
2N/A/* Private. */
2N/A
2N/A#ifdef IRS_LCL_SV_DB
2N/Astatic struct servent *
2N/Asv_db_rec(struct lcl_sv *sv, DBT *key, DBT *data) {
2N/A char *p, **q;
2N/A int n;
2N/A
2N/A p = data->data;
2N/A p[data->size - 1] = '\0'; /*%< should be, but we depend on it */
2N/A if (((char *)key->data)[0] == '\0') {
2N/A if (key->size < sizeof(u_short)*2 || data->size < 2)
2N/A return (NULL);
2N/A sv->serv.s_port = ((u_short *)key->data)[1];
2N/A n = strlen(p) + 1;
2N/A if ((size_t)n > sizeof(sv->line)) {
2N/A n = sizeof(sv->line);
2N/A }
2N/A memcpy(sv->line, p, n);
2N/A sv->serv.s_name = sv->line;
2N/A if ((sv->serv.s_proto = strchr(sv->line, '/')) != NULL)
2N/A *(sv->serv.s_proto)++ = '\0';
2N/A p += n;
2N/A data->size -= n;
2N/A } else {
2N/A if (data->size < sizeof(u_short) + 1)
2N/A return (NULL);
2N/A if (key->size > sizeof(sv->line))
2N/A key->size = sizeof(sv->line);
2N/A ((char *)key->data)[key->size - 1] = '\0';
2N/A memcpy(sv->line, key->data, key->size);
2N/A sv->serv.s_name = sv->line;
2N/A if ((sv->serv.s_proto = strchr(sv->line, '/')) != NULL)
2N/A *(sv->serv.s_proto)++ = '\0';
2N/A sv->serv.s_port = *(u_short *)data->data;
2N/A p += sizeof(u_short);
2N/A data->size -= sizeof(u_short);
2N/A }
2N/A q = sv->serv.s_aliases = sv->serv_aliases;
2N/A while (data->size > 0 && q < &sv->serv_aliases[IRS_SV_MAXALIASES - 1]) {
2N/A
2N/A *q++ = p;
2N/A n = strlen(p) + 1;
2N/A data->size -= n;
2N/A p += n;
2N/A }
2N/A *q = NULL;
2N/A return (&sv->serv);
2N/A}
2N/A#endif
2N/A
2N/A/*! \file */