/*
|
/*
|
** protocols.c /etc/protocols access functions
|
** protocols.c /etc/protocols access functions
|
**
|
**
|
** This file is part of the NYS Library.
|
** This file is part of the NYS Library.
|
**
|
**
|
** The NYS Library is free software; you can redistribute it and/or
|
** The NYS Library is free software; you can redistribute it and/or
|
** modify it under the terms of the GNU Library General Public License as
|
** modify it under the terms of the GNU Library General Public License as
|
** published by the Free Software Foundation; either version 2 of the
|
** published by the Free Software Foundation; either version 2 of the
|
** License, or (at your option) any later version.
|
** License, or (at your option) any later version.
|
**
|
**
|
** The NYS Library is distributed in the hope that it will be useful,
|
** The NYS Library is distributed in the hope that it will be useful,
|
** but WITHOUT ANY WARRANTY; without even the implied warranty of
|
** but WITHOUT ANY WARRANTY; without even the implied warranty of
|
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
** Library General Public License for more details.
|
** Library General Public License for more details.
|
**
|
**
|
** You should have received a copy of the GNU Library General Public
|
** You should have received a copy of the GNU Library General Public
|
** License along with the NYS Library; see the file COPYING.LIB. If
|
** License along with the NYS Library; see the file COPYING.LIB. If
|
** not, write to the Free Software Foundation, Inc., 675 Mass Ave,
|
** not, write to the Free Software Foundation, Inc., 675 Mass Ave,
|
** Cambridge, MA 02139, USA.
|
** Cambridge, MA 02139, USA.
|
**
|
**
|
**
|
**
|
** Copyright (c) 1983 Regents of the University of California.
|
** Copyright (c) 1983 Regents of the University of California.
|
** All rights reserved.
|
** All rights reserved.
|
**
|
**
|
** Redistribution and use in source and binary forms, with or without
|
** Redistribution and use in source and binary forms, with or without
|
** modification, are permitted provided that the following conditions
|
** modification, are permitted provided that the following conditions
|
** are met:
|
** are met:
|
** 1. Redistributions of source code must retain the above copyright
|
** 1. Redistributions of source code must retain the above copyright
|
** notice, this list of conditions and the following disclaimer.
|
** notice, this list of conditions and the following disclaimer.
|
** 2. Redistributions in binary form must reproduce the above copyright
|
** 2. Redistributions in binary form must reproduce the above copyright
|
** notice, this list of conditions and the following disclaimer in the
|
** notice, this list of conditions and the following disclaimer in the
|
** documentation and/or other materials provided with the distribution.
|
** documentation and/or other materials provided with the distribution.
|
** 3. All advertising materials mentioning features or use of this software
|
** 3. All advertising materials mentioning features or use of this software
|
** must display the following acknowledgement:
|
** must display the following acknowledgement:
|
** This product includes software developed by the University of
|
** This product includes software developed by the University of
|
** California, Berkeley and its contributors.
|
** California, Berkeley and its contributors.
|
** 4. Neither the name of the University nor the names of 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
|
** may be used to endorse or promote products derived from this software
|
** without specific prior written permission.
|
** without specific prior written permission.
|
**
|
**
|
** THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
** THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
** ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
** ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
** LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
** 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
|
** OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
** SUCH DAMAGE.
|
** SUCH DAMAGE.
|
*/
|
*/
|
|
|
#define __FORCE_GLIBC
|
#define __FORCE_GLIBC
|
#define _GNU_SOURCE
|
#define _GNU_SOURCE
|
#include <features.h>
|
#include <features.h>
|
#include <sys/types.h>
|
#include <sys/types.h>
|
#include <sys/socket.h>
|
#include <sys/socket.h>
|
#include <netdb.h>
|
#include <netdb.h>
|
#include <stdio.h>
|
#include <stdio.h>
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#include <string.h>
|
#include <string.h>
|
#include <errno.h>
|
#include <errno.h>
|
|
|
#ifdef __UCLIBC_HAS_THREADS__
|
#ifdef __UCLIBC_HAS_THREADS__
|
#include <pthread.h>
|
#include <pthread.h>
|
static pthread_mutex_t mylock = PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP;
|
static pthread_mutex_t mylock = PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP;
|
# define LOCK __pthread_mutex_lock(&mylock)
|
# define LOCK __pthread_mutex_lock(&mylock)
|
# define UNLOCK __pthread_mutex_unlock(&mylock);
|
# define UNLOCK __pthread_mutex_unlock(&mylock);
|
#else
|
#else
|
# define LOCK
|
# define LOCK
|
# define UNLOCK
|
# define UNLOCK
|
#endif
|
#endif
|
|
|
|
|
|
|
#define MAXALIASES 35
|
#define MAXALIASES 35
|
|
|
static FILE *protof = NULL;
|
static FILE *protof = NULL;
|
static struct protoent proto;
|
static struct protoent proto;
|
static char static_aliases[BUFSIZ+1 + sizeof(char *)*MAXALIASES];
|
static char static_aliases[BUFSIZ+1 + sizeof(char *)*MAXALIASES];
|
static int proto_stayopen;
|
static int proto_stayopen;
|
|
|
void setprotoent(int f)
|
void setprotoent(int f)
|
{
|
{
|
LOCK;
|
LOCK;
|
if (protof == NULL)
|
if (protof == NULL)
|
protof = fopen(_PATH_PROTOCOLS, "r" );
|
protof = fopen(_PATH_PROTOCOLS, "r" );
|
else
|
else
|
rewind(protof);
|
rewind(protof);
|
proto_stayopen |= f;
|
proto_stayopen |= f;
|
UNLOCK;
|
UNLOCK;
|
}
|
}
|
|
|
void endprotoent(void)
|
void endprotoent(void)
|
{
|
{
|
LOCK;
|
LOCK;
|
if (protof) {
|
if (protof) {
|
fclose(protof);
|
fclose(protof);
|
protof = NULL;
|
protof = NULL;
|
}
|
}
|
proto_stayopen = 0;
|
proto_stayopen = 0;
|
UNLOCK;
|
UNLOCK;
|
}
|
}
|
|
|
int getprotoent_r(struct protoent *result_buf,
|
int getprotoent_r(struct protoent *result_buf,
|
char *buf, size_t buflen,
|
char *buf, size_t buflen,
|
struct protoent **result)
|
struct protoent **result)
|
{
|
{
|
char *p;
|
char *p;
|
register char *cp, **q;
|
register char *cp, **q;
|
char **proto_aliases;
|
char **proto_aliases;
|
char *line;
|
char *line;
|
|
|
*result = NULL;
|
*result = NULL;
|
|
|
if (buflen < sizeof(*proto_aliases)*MAXALIASES) {
|
if (buflen < sizeof(*proto_aliases)*MAXALIASES) {
|
errno=ERANGE;
|
errno=ERANGE;
|
return errno;
|
return errno;
|
}
|
}
|
LOCK;
|
LOCK;
|
proto_aliases=(char **)buf;
|
proto_aliases=(char **)buf;
|
buf+=sizeof(*proto_aliases)*MAXALIASES;
|
buf+=sizeof(*proto_aliases)*MAXALIASES;
|
buflen-=sizeof(*proto_aliases)*MAXALIASES;
|
buflen-=sizeof(*proto_aliases)*MAXALIASES;
|
|
|
if (buflen < BUFSIZ+1) {
|
if (buflen < BUFSIZ+1) {
|
UNLOCK;
|
UNLOCK;
|
errno=ERANGE;
|
errno=ERANGE;
|
return errno;
|
return errno;
|
}
|
}
|
line=buf;
|
line=buf;
|
buf+=BUFSIZ+1;
|
buf+=BUFSIZ+1;
|
buflen-=BUFSIZ+1;
|
buflen-=BUFSIZ+1;
|
|
|
if (protof == NULL && (protof = fopen(_PATH_PROTOCOLS, "r" )) == NULL) {
|
if (protof == NULL && (protof = fopen(_PATH_PROTOCOLS, "r" )) == NULL) {
|
UNLOCK;
|
UNLOCK;
|
return errno;
|
return errno;
|
}
|
}
|
again:
|
again:
|
if ((p = fgets(line, BUFSIZ, protof)) == NULL) {
|
if ((p = fgets(line, BUFSIZ, protof)) == NULL) {
|
UNLOCK;
|
UNLOCK;
|
return TRY_AGAIN;
|
return TRY_AGAIN;
|
}
|
}
|
|
|
if (*p == '#')
|
if (*p == '#')
|
goto again;
|
goto again;
|
cp = strpbrk(p, "#\n");
|
cp = strpbrk(p, "#\n");
|
if (cp == NULL)
|
if (cp == NULL)
|
goto again;
|
goto again;
|
*cp = '\0';
|
*cp = '\0';
|
result_buf->p_name = p;
|
result_buf->p_name = p;
|
cp = strpbrk(p, " \t");
|
cp = strpbrk(p, " \t");
|
if (cp == NULL)
|
if (cp == NULL)
|
goto again;
|
goto again;
|
*cp++ = '\0';
|
*cp++ = '\0';
|
while (*cp == ' ' || *cp == '\t')
|
while (*cp == ' ' || *cp == '\t')
|
cp++;
|
cp++;
|
p = strpbrk(cp, " \t");
|
p = strpbrk(cp, " \t");
|
if (p != NULL)
|
if (p != NULL)
|
*p++ = '\0';
|
*p++ = '\0';
|
result_buf->p_proto = atoi(cp);
|
result_buf->p_proto = atoi(cp);
|
q = result_buf->p_aliases = proto_aliases;
|
q = result_buf->p_aliases = proto_aliases;
|
if (p != NULL) {
|
if (p != NULL) {
|
cp = p;
|
cp = p;
|
while (cp && *cp) {
|
while (cp && *cp) {
|
if (*cp == ' ' || *cp == '\t') {
|
if (*cp == ' ' || *cp == '\t') {
|
cp++;
|
cp++;
|
continue;
|
continue;
|
}
|
}
|
if (q < &proto_aliases[MAXALIASES - 1])
|
if (q < &proto_aliases[MAXALIASES - 1])
|
*q++ = cp;
|
*q++ = cp;
|
cp = strpbrk(cp, " \t");
|
cp = strpbrk(cp, " \t");
|
if (cp != NULL)
|
if (cp != NULL)
|
*cp++ = '\0';
|
*cp++ = '\0';
|
}
|
}
|
}
|
}
|
*q = NULL;
|
*q = NULL;
|
*result=result_buf;
|
*result=result_buf;
|
UNLOCK;
|
UNLOCK;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
struct protoent * getprotoent(void)
|
struct protoent * getprotoent(void)
|
{
|
{
|
struct protoent *result;
|
struct protoent *result;
|
getprotoent_r(&proto, static_aliases, sizeof(static_aliases), &result);
|
getprotoent_r(&proto, static_aliases, sizeof(static_aliases), &result);
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
int getprotobyname_r(const char *name,
|
int getprotobyname_r(const char *name,
|
struct protoent *result_buf,
|
struct protoent *result_buf,
|
char *buf, size_t buflen,
|
char *buf, size_t buflen,
|
struct protoent **result)
|
struct protoent **result)
|
{
|
{
|
register char **cp;
|
register char **cp;
|
int ret;
|
int ret;
|
|
|
LOCK;
|
LOCK;
|
setprotoent(proto_stayopen);
|
setprotoent(proto_stayopen);
|
while (!(ret=getprotoent_r(result_buf, buf, buflen, result))) {
|
while (!(ret=getprotoent_r(result_buf, buf, buflen, result))) {
|
if (strcmp(result_buf->p_name, name) == 0)
|
if (strcmp(result_buf->p_name, name) == 0)
|
break;
|
break;
|
for (cp = result_buf->p_aliases; *cp != 0; cp++)
|
for (cp = result_buf->p_aliases; *cp != 0; cp++)
|
if (strcmp(*cp, name) == 0)
|
if (strcmp(*cp, name) == 0)
|
goto found;
|
goto found;
|
}
|
}
|
found:
|
found:
|
if (!proto_stayopen)
|
if (!proto_stayopen)
|
endprotoent();
|
endprotoent();
|
UNLOCK;
|
UNLOCK;
|
return *result?0:ret;
|
return *result?0:ret;
|
}
|
}
|
|
|
|
|
struct protoent * getprotobyname(const char *name)
|
struct protoent * getprotobyname(const char *name)
|
{
|
{
|
struct protoent *result;
|
struct protoent *result;
|
getprotobyname_r(name, &proto, static_aliases, sizeof(static_aliases), &result);
|
getprotobyname_r(name, &proto, static_aliases, sizeof(static_aliases), &result);
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
int getprotobynumber_r (int proto_num,
|
int getprotobynumber_r (int proto_num,
|
struct protoent *result_buf,
|
struct protoent *result_buf,
|
char *buf, size_t buflen,
|
char *buf, size_t buflen,
|
struct protoent **result)
|
struct protoent **result)
|
{
|
{
|
int ret;
|
int ret;
|
|
|
LOCK;
|
LOCK;
|
setprotoent(proto_stayopen);
|
setprotoent(proto_stayopen);
|
while (!(ret=getprotoent_r(result_buf, buf, buflen, result)))
|
while (!(ret=getprotoent_r(result_buf, buf, buflen, result)))
|
if (result_buf->p_proto == proto_num)
|
if (result_buf->p_proto == proto_num)
|
break;
|
break;
|
if (!proto_stayopen)
|
if (!proto_stayopen)
|
endprotoent();
|
endprotoent();
|
UNLOCK;
|
UNLOCK;
|
return *result?0:ret;
|
return *result?0:ret;
|
}
|
}
|
|
|
struct protoent * getprotobynumber(int proto_num)
|
struct protoent * getprotobynumber(int proto_num)
|
{
|
{
|
struct protoent *result;
|
struct protoent *result;
|
getprotobynumber_r(proto_num, &proto, static_aliases, sizeof(static_aliases), &result);
|
getprotobynumber_r(proto_num, &proto, static_aliases, sizeof(static_aliases), &result);
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
