Page MenuHomeFreeBSD
Files F87408455

No OneTemporary
Actions

View Options

This file is larger than 256 KB, so syntax highlighting was skipped.
diff --git a/bin/chio/defs.h b/bin/chio/defs.h
index 8f10c9d9243a..6b4381a3d447 100644
--- a/bin/chio/defs.h
+++ b/bin/chio/defs.h
@@ -1,57 +1,56 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 1996 Jason R. Thorpe <thorpej@and.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgements:
* This product includes software developed by Jason R. Thorpe
* for And Communications, http://www.and.com/
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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
* SUCH DAMAGE.
*/
struct element_type {
const char *et_name; /* name; i.e. "picker, "slot", etc. */
int et_type; /* type number */
};
struct changer_command {
const char *cc_name; /* command name */
/* command handler */
int (*cc_handler)(const char *, int, char **);
};
struct special_word {
const char *sw_name; /* special word */
int sw_value; /* token value */
};
/* sw_value */
#define SW_INVERT 1 /* set "invert media" flag */
#define SW_INVERT1 2 /* set "invert media 1" flag */
#define SW_INVERT2 3 /* set "invert media 2" flag */
/* Environment variable to check for default changer. */
#define CHANGER_ENV_VAR "CHANGER"
diff --git a/bin/chio/pathnames.h b/bin/chio/pathnames.h
index 5b9b1e429dc2..a8308ed7b0ac 100644
--- a/bin/chio/pathnames.h
+++ b/bin/chio/pathnames.h
@@ -1,35 +1,34 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 1996 Jason R. Thorpe <thorpej@and.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgements:
* This product includes software developed by Jason R. Thorpe
* for And Communications, http://www.and.com/
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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
* SUCH DAMAGE.
*/
#define _PATH_CH "/dev/ch0"
diff --git a/bin/csh/config.h b/bin/csh/config.h
index 103ceb604062..6705cc58f5bd 100644
--- a/bin/csh/config.h
+++ b/bin/csh/config.h
@@ -1,277 +1,276 @@
-/* $FreeBSD$ */
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.in by autoheader. */
/* Define to the type of elements in the array set by `getgroups'. Usually
this is either `int' or `gid_t'. */
#define GETGROUPS_T gid_t
/* Define to 1 if the `getpgrp' function requires zero arguments. */
#define GETPGRP_VOID 1
/* Define to 1 if you have the <auth.h> header file. */
/* #undef HAVE_AUTH_H */
/* Define to 1 if you have the <crypt.h> header file. */
/* #undef HAVE_CRYPT_H */
/* Define to 1 if you have the declaration of `crypt', and to 0 if you don't.
*/
#define HAVE_DECL_CRYPT 1
/* Define to 1 if you have the declaration of `environ', and to 0 if you
don't. */
#define HAVE_DECL_ENVIRON 0
/* Define to 1 if you have the declaration of `gethostname', and to 0 if you
don't. */
#define HAVE_DECL_GETHOSTNAME 1
/* Define to 1 if you have the declaration of `getpgrp', and to 0 if you
don't. */
#define HAVE_DECL_GETPGRP 1
/* Define to 1 if you have the <dirent.h> header file, and it defines `DIR'.
*/
#define HAVE_DIRENT_H 1
/* Define to 1 if you have the `dup2' function. */
#define HAVE_DUP2 1
/* Define to 1 if you have the <features.h> header file. */
/* #undef HAVE_FEATURES_H */
/* Define to 1 if you have the `getauthid' function. */
/* #undef HAVE_GETAUTHID */
/* Define to 1 if you have the `getcwd' function. */
#define HAVE_GETCWD 1
/* Define to 1 if you have the `gethostname' function. */
#define HAVE_GETHOSTNAME 1
/* Define to 1 if you have the `getpwent' function. */
#define HAVE_GETPWENT 1
/* Define to 1 if you have the `getutent' function. */
/* #undef HAVE_GETUTENT */
/* Define to 1 if you have the `getutxent' function. */
#define HAVE_GETUTXENT 1
/* Define if you have the iconv() function and it works. */
/* #undef HAVE_ICONV */
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if the system has the type `long long'. */
#define HAVE_LONG_LONG 1
/* Define to 1 if you have the `mallinfo' function. */
/* #undef HAVE_MALLINFO */
/* Define to 1 if mbrtowc and mbstate_t are properly declared. */
#define HAVE_MBRTOWC 1
/* Define to 1 if you have the `memmove' function. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `memset' function. */
#define HAVE_MEMSET 1
/* Define to 1 if you have the `mkstemp' function. */
#define HAVE_MKSTEMP 1
/* Define to 1 if you have the <ndir.h> header file, and it defines `DIR'. */
/* #undef HAVE_NDIR_H */
/* Define to 1 if you have the `nice' function. */
#define HAVE_NICE 1
/* Define to 1 if you have the `nl_langinfo' function. */
#define HAVE_NL_LANGINFO 1
/* Define to 1 if you have the <paths.h> header file. */
#define HAVE_PATHS_H 1
/* Define to 1 if you have the `sbrk' function. */
/* #undef HAVE_SBRK 1 */
/* Define to 1 if you have the `setpgid' function. */
#define HAVE_SETPGID 1
/* Define to 1 if you have the `setpriority' function. */
#define HAVE_SETPRIORITY 1
/* Define to 1 if you have the <shadow.h> header file. */
/* #undef HAVE_SHADOW_H */
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strcoll' function and it is properly defined.
*/
#define HAVE_STRCOLL 1
/* Define to 1 if you have the `strerror' function. */
#define HAVE_STRERROR 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strstr' function. */
#define HAVE_STRSTR 1
/* Define to 1 if `d_ino' is a member of `struct dirent'. */
#define HAVE_STRUCT_DIRENT_D_INO 1
/* Define to 1 if `ss_family' is a member of `struct sockaddr_storage'. */
#define HAVE_STRUCT_SOCKADDR_STORAGE_SS_FAMILY 1
/* Define to 1 if `ut_host' is a member of `struct utmpx'. */
#define HAVE_STRUCT_UTMPX_UT_HOST 1
/* Define to 1 if `ut_tv' is a member of `struct utmpx'. */
#define HAVE_STRUCT_UTMPX_UT_TV 1
/* Define to 1 if `ut_user' is a member of `struct utmpx'. */
#define HAVE_STRUCT_UTMPX_UT_USER 1
/* Define to 1 if `ut_xtime' is a member of `struct utmpx'. */
/* #undef HAVE_STRUCT_UTMPX_UT_XTIME */
/* Define to 1 if `ut_host' is a member of `struct utmp'. */
#define HAVE_STRUCT_UTMP_UT_HOST 1
/* Define to 1 if `ut_tv' is a member of `struct utmp'. */
#define HAVE_STRUCT_UTMP_UT_TV 1
/* Define to 1 if `ut_user' is a member of `struct utmp'. */
#define HAVE_STRUCT_UTMP_UT_USER 1
/* Define to 1 if `ut_xtime' is a member of `struct utmp'. */
/* #undef HAVE_STRUCT_UTMP_UT_XTIME */
/* Define to 1 if you have the `sysconf' function. */
#define HAVE_SYSCONF 1
/* Define to 1 if you have the <sys/dir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_DIR_H */
/* Define to 1 if you have the <sys/ndir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_NDIR_H */
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the <utmpx.h> header file. */
#define HAVE_UTMPX_H 1
/* Define to 1 if you have the <utmp.h> header file. */
/* #undef HAVE_UTMP_H */
/* Define to 1 if you have the <wchar.h> header file. */
#define HAVE_WCHAR_H 1
/* Define to 1 if you have the <wctype.h> header file. */
#define HAVE_WCTYPE_H 1
/* Define to 1 if you have the `wcwidth' function. */
#define HAVE_WCWIDTH 1
/* Define as const if the declaration of iconv() needs const. */
#define ICONV_CONST
/* Support NLS. */
#define NLS 1
/* Support NLS catalogs. */
#define NLS_CATALOGS 1
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "http://bugs.gw.com/"
/* Define to the full name of this package. */
#define PACKAGE_NAME "tcsh"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "tcsh 6.18.01"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "tcsh"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "6.18.01"
/* Define to 1 if the `setpgrp' function takes no argument. */
/* #undef SETPGRP_VOID */
/* The size of `wchar_t', as computed by sizeof. */
#define SIZEOF_WCHAR_T 4
/* Define to 1 if the `S_IS*' macros in <sys/stat.h> do not work properly. */
/* #undef STAT_MACROS_BROKEN */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT32_T */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef gid_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef mode_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to `int' if neither <sys/types.h> nor <sys/socket.h> define. */
/* #undef socklen_t */
/* Define to `int' not defined in <sys/types.h>. */
/* #undef ssize_t */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef uid_t */
/* Define to the type of an unsigned integer type of width exactly 32 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint32_t */
/* Define to empty if the keyword `volatile' does not work. Warning: valid
code using `volatile' can become incorrect without. Disable with care. */
/* #undef volatile */
#include "config_p.h"
#include "config_f.h"
/* Work around a vendor issue where config_f.h is #undef'ing this setting */
#define SYSMALLOC
diff --git a/bin/csh/config_p.h b/bin/csh/config_p.h
index c25e87a903ea..8b7ecd20de19 100644
--- a/bin/csh/config_p.h
+++ b/bin/csh/config_p.h
@@ -1,112 +1,111 @@
-/* $FreeBSD$ */
/*
* config.h -- configure various defines for tcsh
*
* All source files should #include this FIRST.
*
* Edit this to match your system type.
*/
#ifndef _h_config
#define _h_config
/****************** System dependent compilation flags ****************/
/*
* POSIX This system supports IEEE Std 1003.1-1988 (POSIX).
*/
#define POSIX
/*
* POSIXJOBS This system supports the optional IEEE Std 1003.1-1988 (POSIX)
* job control facilities.
*/
#define POSIXJOBS
/*
* VFORK This machine has a vfork().
* It used to be that for job control to work, this define
* was mandatory. This is not the case any more.
* If you think you still need it, but you don't have vfork,
* define this anyway and then do #define vfork fork.
* I do this anyway on a Sun because of yellow pages brain damage,
* [should not be needed under 4.1]
* and on the iris4d cause SGI's fork is sufficiently "virtual"
* that vfork isn't necessary. (Besides, SGI's vfork is weird).
* Note that some machines eg. rs6000 have a vfork, but not
* with the berkeley semantics, so we cannot use it there either.
*/
/* #define VFORK */
#define vfork fork
/*
* BSDJOBS You have BSD-style job control (both process groups and
* a tty that deals correctly
*/
#define BSDJOBS
/*
* BSDTIMES You have BSD-style process time stuff (like rusage)
* This may or may not be true. For example, Apple Unix
* (OREO) has BSDJOBS but not BSDTIMES.
*/
#define BSDTIMES
/*
* BSDLIMIT You have BSD-style resource limit stuff (getrlimit/setrlimit)
*/
#define BSDLIMIT
/*
* TERMIO You have struct termio instead of struct sgttyb.
* This is usually the case for SYSV systems, where
* BSD uses sgttyb. POSIX systems should define this
* anyway, even though they use struct termios.
*/
#define TERMIO
/*
* SYSVREL Your machine is SYSV based (HPUX, A/UX)
* NOTE: don't do this if you are on a Pyramid -- tcsh is
* built in a BSD universe.
* Set SYSVREL to 1, 2, 3, or 4, depending the version of System V
* you are running. Or set it to 0 if you are not SYSV based
*/
#define SYSVREL 0
/*
* YPBUGS Work around Sun YP bugs that cause expansion of ~username
* to send command output to /dev/null
*/
#undef YPBUGS
/****************** local defines *********************/
#if defined(__FreeBSD__)
#define NLS_BUGS
#define BSD_STYLE_COLORLS
/* Use LC_MESSAGES locale category to open the message catalog */
#define MCLoadBySet NL_CAT_LOCALE
#define BUFSIZE 8192
#define UTMPX_FILE "/var/run/utx.active"
#endif
#if defined(__bsdi__)
/*
* _PATH_TCSHELL if you've change the installation location (vix)
*/
#include <sys/param.h>
# ifdef _BSDI_VERSION >= 199701
# define _PATH_TCSHELL "/bin/tcsh"
# undef SYSMALLOC
# define SYSMALLOC
# else
# define _PATH_TCSHELL "/usr/contrib/bin/tcsh"
# endif
# undef NLS
# undef NLS_CATALOGS
#elif defined(__APPLE__)
# define SYSMALLOC
#endif
#endif /* _h_config */
diff --git a/cddl/compat/opensolaris/include/libintl.h b/cddl/compat/opensolaris/include/libintl.h
index da13f4749081..5dbc06a75b2f 100644
--- a/cddl/compat/opensolaris/include/libintl.h
+++ b/cddl/compat/opensolaris/include/libintl.h
@@ -1,13 +1,12 @@
-/* $FreeBSD$ */
#ifndef _LIBINTL_H_
#define _LIBINTL_H_
#include <sys/cdefs.h>
#include <stdio.h>
#define textdomain(domain) 0
#define gettext(...) (__VA_ARGS__)
#define dgettext(domain, ...) (__VA_ARGS__)
#endif /* !_SOLARIS_H_ */
diff --git a/cddl/compat/opensolaris/include/priv.h b/cddl/compat/opensolaris/include/priv.h
index 2fee5b0d40c8..182921a02b3f 100644
--- a/cddl/compat/opensolaris/include/priv.h
+++ b/cddl/compat/opensolaris/include/priv.h
@@ -1,20 +1,19 @@
-/* $FreeBSD$ */
#ifndef _OPENSOLARIS_PRIV_H_
#define _OPENSOLARIS_PRIV_H_
#include <sys/types.h>
#include <unistd.h>
#include <assert.h>
#define PRIV_SYS_CONFIG 0
static __inline int
priv_ineffect(int priv)
{
assert(priv == PRIV_SYS_CONFIG);
return (geteuid() == 0);
}
#endif /* !_OPENSOLARIS_PRIV_H_ */
diff --git a/cddl/compat/opensolaris/include/solaris.h b/cddl/compat/opensolaris/include/solaris.h
index 9bead018bcec..b4fb71be92a6 100644
--- a/cddl/compat/opensolaris/include/solaris.h
+++ b/cddl/compat/opensolaris/include/solaris.h
@@ -1,14 +1,13 @@
-/* $FreeBSD$ */
#ifndef _SOLARIS_H_
#define _SOLARIS_H_
#include <sys/ccompile.h>
#include <fcntl.h>
#define NOTE(s)
int mkdirp(const char *, mode_t);
#endif /* !_SOLARIS_H_ */
diff --git a/cddl/compat/opensolaris/include/zone.h b/cddl/compat/opensolaris/include/zone.h
index 8c377cf6574d..66a041772963 100644
--- a/cddl/compat/opensolaris/include/zone.h
+++ b/cddl/compat/opensolaris/include/zone.h
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#ifndef _ZONE_H_
#define _ZONE_H_
#include <sys/zone.h>
#endif /* !_ZONE_H_ */
diff --git a/include/getopt.h b/include/getopt.h
index 4c0399db8545..caeef8ff5ed7 100644
--- a/include/getopt.h
+++ b/include/getopt.h
@@ -1,80 +1,79 @@
/* $NetBSD: getopt.h,v 1.4 2000/07/07 10:43:54 ad Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2000 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Dieter Baron and Thomas Klausner.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifndef _GETOPT_H_
#define _GETOPT_H_
#include <sys/cdefs.h>
/*
* GNU-like getopt_long()/getopt_long_only() with 4.4BSD optreset extension.
* getopt() is declared here too for GNU programs.
*/
#define no_argument 0
#define required_argument 1
#define optional_argument 2
struct option {
/* name of long option */
const char *name;
/*
* one of no_argument, required_argument, and optional_argument:
* whether option takes an argument
*/
int has_arg;
/* if not NULL, set *flag to val when option found */
int *flag;
/* if flag not NULL, value to set *flag to; else return value */
int val;
};
__BEGIN_DECLS
int getopt_long(int, char * const *, const char *,
const struct option *, int *);
int getopt_long_only(int, char * const *, const char *,
const struct option *, int *);
#ifndef _GETOPT_DECLARED
#define _GETOPT_DECLARED
int getopt(int, char * const [], const char *);
extern char *optarg; /* getopt(3) external variables */
extern int optind, opterr, optopt;
#endif
#ifndef _OPTRESET_DECLARED
#define _OPTRESET_DECLARED
extern int optreset; /* getopt(3) external variable */
#endif
__END_DECLS
#endif /* !_GETOPT_H_ */
diff --git a/include/gssapi.h b/include/gssapi.h
index 5557de8f7356..560edb730960 100644
--- a/include/gssapi.h
+++ b/include/gssapi.h
@@ -1,5 +1,4 @@
-/* $FreeBSD$ */
#ifdef __GNUC__
#warning "this file includes <gssapi.h> which is deprecated, use <gssapi/gssapi.h> instead"
#endif
#include <gssapi/gssapi.h>
diff --git a/include/hesiod.h b/include/hesiod.h
index a06b69d32413..1fb96b4dc0e0 100644
--- a/include/hesiod.h
+++ b/include/hesiod.h
@@ -1,93 +1,92 @@
/* $NetBSD: hesiod.h,v 1.3 1999/01/24 23:53:18 lukem Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: (BSD-2-Clause AND ISC)
*
* Copyright (c) 1997, 1998, 1999 The NetBSD Foundation, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1996 by Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
#ifndef _HESIOD_H_
#define _HESIOD_H_
/* Application-visible indication that we have the new interfaces */
#define HESIOD_INTERFACES
/* Configuration information. */
#ifndef _PATH_HESIOD_CONF /* Configuration file. */
#define _PATH_HESIOD_CONF "/etc/hesiod.conf"
#endif
#define DEF_RHS "" /* Defaults if HESIOD_CONF */
#define DEF_LHS "" /* file is not present. */
/* Error codes (for backwards compatibility) */
#define HES_ER_UNINIT -1 /* uninitialized */
#define HES_ER_OK 0 /* no error */
#define HES_ER_NOTFOUND 1 /* Hesiod name not found by server */
#define HES_ER_CONFIG 2 /* local problem (no config file?) */
#define HES_ER_NET 3 /* network problem */
/* Declaration of routines */
#include <sys/cdefs.h>
__BEGIN_DECLS
int hesiod_init(void **);
char **hesiod_resolve(void *, const char *, const char *);
void hesiod_free_list(void *, char **);
char *hesiod_to_bind(void *, const char *, const char *);
void hesiod_end(void *);
/* backwards compatibility */
int hes_init(void);
char *hes_to_bind(const char *, const char *);
char **hes_resolve(const char *, const char *);
int hes_error(void);
void hes_free(char **);
__END_DECLS
#endif /* ! _HESIOD_H_ */
diff --git a/include/iconv.h b/include/iconv.h
index 338ca1544d8a..05e7427a4bf0 100644
--- a/include/iconv.h
+++ b/include/iconv.h
@@ -1,135 +1,134 @@
-/* $FreeBSD$ */
/* $NetBSD: iconv.h,v 1.6 2005/02/03 04:39:32 perry Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2003 Citrus Project,
* Copyright (c) 2009, 2010 Gabor Kovesdan <gabor@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _ICONV_H_
#define _ICONV_H_
#include <sys/cdefs.h>
#include <sys/types.h>
#include <wchar.h>
#include <sys/cdefs.h>
#include <sys/types.h>
#ifdef __cplusplus
typedef bool __iconv_bool;
#elif __STDC_VERSION__ >= 199901L
typedef _Bool __iconv_bool;
#else
typedef int __iconv_bool;
#endif
struct __tag_iconv_t;
typedef struct __tag_iconv_t *iconv_t;
__BEGIN_DECLS
iconv_t iconv_open(const char *, const char *);
size_t iconv(iconv_t, char ** __restrict,
size_t * __restrict, char ** __restrict,
size_t * __restrict);
int iconv_close(iconv_t);
/*
* non-portable interfaces for iconv
*/
int __iconv_get_list(char ***, size_t *, __iconv_bool);
void __iconv_free_list(char **, size_t);
size_t __iconv(iconv_t, char **, size_t *, char **,
size_t *, __uint32_t, size_t *);
#define __ICONV_F_HIDE_INVALID 0x0001
/*
* GNU interfaces for iconv
*/
typedef struct {
void *spaceholder[64];
} iconv_allocation_t;
int iconv_open_into(const char *, const char *, iconv_allocation_t *);
void iconv_set_relocation_prefix(const char *, const char *);
/*
* iconvctl() request macros
*/
#define ICONV_TRIVIALP 0
#define ICONV_GET_TRANSLITERATE 1
#define ICONV_SET_TRANSLITERATE 2
#define ICONV_GET_DISCARD_ILSEQ 3
#define ICONV_SET_DISCARD_ILSEQ 4
#define ICONV_SET_HOOKS 5
#define ICONV_SET_FALLBACKS 6
#define ICONV_GET_ILSEQ_INVALID 128
#define ICONV_SET_ILSEQ_INVALID 129
typedef void (*iconv_unicode_char_hook) (unsigned int mbr, void *data);
typedef void (*iconv_wide_char_hook) (wchar_t wc, void *data);
struct iconv_hooks {
iconv_unicode_char_hook uc_hook;
iconv_wide_char_hook wc_hook;
void *data;
};
/*
* Fallbacks aren't supported but type definitions are provided for
* source compatibility.
*/
typedef void (*iconv_unicode_mb_to_uc_fallback) (const char*,
size_t, void (*write_replacement) (const unsigned int *,
size_t, void*), void*, void*);
typedef void (*iconv_unicode_uc_to_mb_fallback) (unsigned int,
void (*write_replacement) (const char *, size_t, void*),
void*, void*);
typedef void (*iconv_wchar_mb_to_wc_fallback) (const char*, size_t,
void (*write_replacement) (const wchar_t *, size_t, void*),
void*, void*);
typedef void (*iconv_wchar_wc_to_mb_fallback) (wchar_t,
void (*write_replacement) (const char *, size_t, void*),
void*, void*);
struct iconv_fallbacks {
iconv_unicode_mb_to_uc_fallback mb_to_uc_fallback;
iconv_unicode_uc_to_mb_fallback uc_to_mb_fallback;
iconv_wchar_mb_to_wc_fallback mb_to_wc_fallback;
iconv_wchar_wc_to_mb_fallback wc_to_mb_fallback;
void *data;
};
void iconvlist(int (*do_one) (unsigned int, const char * const *,
void *), void *);
const char *iconv_canonicalize(const char *);
int iconvctl(iconv_t, int, void *);
__END_DECLS
#endif /* !_ICONV_H_ */
diff --git a/include/ieeefp.h b/include/ieeefp.h
index 3f64555d5a14..0639150e40b9 100644
--- a/include/ieeefp.h
+++ b/include/ieeefp.h
@@ -1,15 +1,14 @@
/* $NetBSD: ieeefp.h,v 1.4 1998/01/09 08:03:43 perry Exp $ */
-/* $FreeBSD$ */
/*
* Written by J.T. Conklin, Apr 6, 1995
* Public domain.
*/
#ifndef _IEEEFP_H_
#define _IEEEFP_H_
#include <sys/cdefs.h>
#include <machine/ieeefp.h>
#endif /* _IEEEFP_H_ */
diff --git a/include/ifaddrs.h b/include/ifaddrs.h
index 5e1953639af6..08a4a695b89f 100644
--- a/include/ifaddrs.h
+++ b/include/ifaddrs.h
@@ -1,67 +1,66 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-1-Clause
*
* Copyright (c) 1995, 1999
* Berkeley Software Design, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* THIS SOFTWARE IS PROVIDED BY Berkeley Software Design, Inc. ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL Berkeley Software Design, Inc. BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* BSDI ifaddrs.h,v 2.5 2000/02/23 14:51:59 dab Exp
*/
#ifndef _IFADDRS_H_
#define _IFADDRS_H_
struct ifaddrs {
struct ifaddrs *ifa_next;
char *ifa_name;
unsigned int ifa_flags;
struct sockaddr *ifa_addr;
struct sockaddr *ifa_netmask;
struct sockaddr *ifa_dstaddr;
void *ifa_data;
};
/*
* This may have been defined in <net/if.h>. Note that if <net/if.h> is
* to be included it must be included before this header file.
*/
#ifndef ifa_broadaddr
#define ifa_broadaddr ifa_dstaddr /* broadcast address interface */
#endif
struct ifmaddrs {
struct ifmaddrs *ifma_next;
struct sockaddr *ifma_name;
struct sockaddr *ifma_addr;
struct sockaddr *ifma_lladdr;
};
#include <sys/cdefs.h>
__BEGIN_DECLS
extern int getifaddrs(struct ifaddrs **);
extern void freeifaddrs(struct ifaddrs *);
extern int getifmaddrs(struct ifmaddrs **);
extern void freeifmaddrs(struct ifmaddrs *);
__END_DECLS
#endif
diff --git a/include/libgen.h b/include/libgen.h
index 615d1dd6202e..036362ebcb9a 100644
--- a/include/libgen.h
+++ b/include/libgen.h
@@ -1,65 +1,64 @@
/* $OpenBSD: libgen.h,v 1.4 1999/05/28 22:00:22 espie Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1997 Todd C. Miller <Todd.Miller@courtesan.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifndef _LIBGEN_H_
#define _LIBGEN_H_
#include <sys/cdefs.h>
__BEGIN_DECLS
char *basename(char *);
char *dirname(char *);
__END_DECLS
/*
* In FreeBSD 12, the prototypes of basename() and dirname() were
* modified to comply to POSIX. These functions may now modify their
* input. Unfortunately, our copy of xinstall(8) shipped with previous
* versions of FreeBSD is built using the host headers and libc during
* the bootstrapping phase and depends on the old behavior.
*
* Apply a workaround where we explicitly link against basename@FBSD_1.0
* and dirname@FBSD_1.0 in case these functions are called on constant
* strings, instead of making the program crash at runtime.
*/
#if defined(__generic) && !defined(__cplusplus)
__BEGIN_DECLS
char *__old_basename(char *);
char *__old_dirname(char *);
__END_DECLS
__sym_compat(basename, __old_basename, FBSD_1.0);
__sym_compat(dirname, __old_dirname, FBSD_1.0);
#define basename(x) __generic(x, const char *, __old_basename, basename)(x)
#define dirname(x) __generic(x, const char *, __old_dirname, dirname)(x)
#endif
#endif /* !_LIBGEN_H_ */
diff --git a/include/netconfig.h b/include/netconfig.h
index c4aec6a3e791..6185d6890dfa 100644
--- a/include/netconfig.h
+++ b/include/netconfig.h
@@ -1,126 +1,125 @@
/* $NetBSD: netconfig.h,v 1.6 2008/04/28 20:22:54 martin Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2004 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Frank van der Linden.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifndef _NETCONFIG_H_
#define _NETCONFIG_H_
#include <sys/cdefs.h>
#define NETCONFIG "/etc/netconfig"
#define NETPATH "NETPATH"
struct netconfig {
char *nc_netid; /* Network ID */
unsigned long nc_semantics; /* Semantics (see below) */
unsigned long nc_flag; /* Flags (see below) */
char *nc_protofmly; /* Protocol family */
char *nc_proto; /* Protocol name */
char *nc_device; /* Network device pathname */
unsigned long nc_nlookups; /* Number of directory lookup libs */
char **nc_lookups; /* Names of the libraries */
unsigned long nc_unused[9]; /* reserved */
};
typedef struct {
struct netconfig **nc_head;
struct netconfig **nc_curr;
} NCONF_HANDLE;
/*
* nc_semantics values
*/
#define NC_TPI_CLTS 1 /* Connectionless transport */
#define NC_TPI_COTS 2 /* Connection oriented transport */
#define NC_TPI_COTS_ORD 3 /* Connection oriented, ordered transport */
#define NC_TPI_RAW 4 /* Raw connection */
/*
* nc_flag values
*/
#define NC_NOFLAG 0x00
#define NC_VISIBLE 0x01
#define NC_BROADCAST 0x02
/*
* nc_protofmly values
*/
#define NC_NOPROTOFMLY "-"
#define NC_LOOPBACK "loopback"
#define NC_INET "inet"
#define NC_INET6 "inet6"
#define NC_IMPLINK "implink"
#define NC_PUP "pup"
#define NC_CHAOS "chaos"
#define NC_NS "ns"
#define NC_NBS "nbs"
#define NC_ECMA "ecma"
#define NC_DATAKIT "datakit"
#define NC_CCITT "ccitt"
#define NC_SNA "sna"
#define NC_DECNET "decnet"
#define NC_DLI "dli"
#define NC_LAT "lat"
#define NC_HYLINK "hylink"
#define NC_APPLETALK "appletalk"
#define NC_NIT "nit"
#define NC_IEEE802 "ieee802"
#define NC_OSI "osi"
#define NC_X25 "x25"
#define NC_OSINET "osinet"
#define NC_GOSIP "gosip"
/*
* nc_proto values
*/
#define NC_NOPROTO "-"
#define NC_TCP "tcp"
#define NC_UDP "udp"
#define NC_ICMP "icmp"
__BEGIN_DECLS
void *setnetconfig(void);
struct netconfig *getnetconfig(void *);
struct netconfig *getnetconfigent(const char *);
void freenetconfigent(struct netconfig *);
int endnetconfig(void *);
void *setnetpath(void);
struct netconfig *getnetpath(void *);
int endnetpath(void *);
void nc_perror(const char *);
char *nc_sperror(void);
__END_DECLS
#endif /* _NETCONFIG_H_ */
diff --git a/include/nsswitch.h b/include/nsswitch.h
index e44a9e4a44a3..b94ffdcab291 100644
--- a/include/nsswitch.h
+++ b/include/nsswitch.h
@@ -1,247 +1,246 @@
/* $NetBSD: nsswitch.h,v 1.6 1999/01/26 01:04:07 lukem Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1997, 1998, 1999 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Luke Mewburn.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifndef _NSSWITCH_H
#define _NSSWITCH_H 1
#include <sys/types.h>
#include <stdarg.h>
#define NSS_MODULE_INTERFACE_VERSION 1
#ifndef _PATH_NS_CONF
#define _PATH_NS_CONF "/etc/nsswitch.conf"
#endif
/* NSS source actions */
#define NS_ACTION_CONTINUE 0 /* try the next source */
#define NS_ACTION_RETURN 1 /* look no further */
#define NS_SUCCESS (1<<0) /* entry was found */
#define NS_UNAVAIL (1<<1) /* source not responding, or corrupt */
#define NS_NOTFOUND (1<<2) /* source responded 'no such entry' */
#define NS_TRYAGAIN (1<<3) /* source busy, may respond to retry */
#define NS_RETURN (1<<4) /* stop search, e.g. for ERANGE */
#define NS_ADDRFAMILY (1<<5) /* no addr for fam, getaddrinfo only */
#define NS_TERMINATE (NS_SUCCESS|NS_RETURN) /* flags that end search */
#define NS_STATUSMASK 0x000000ff /* bitmask to get the status flags */
/*
* currently implemented sources
*/
#define NSSRC_FILES "files" /* local files */
#define NSSRC_DB "db" /* database */
#define NSSRC_DNS "dns" /* DNS; IN for hosts, HS for others */
#define NSSRC_NIS "nis" /* YP/NIS */
#define NSSRC_COMPAT "compat" /* passwd,group in YP compat mode */
#define NSSRC_CACHE "cache" /* nscd daemon */
#define NSSRC_FALLBACK "__fallback" /* internal fallback source */
/*
* currently implemented databases
*/
#define NSDB_HOSTS "hosts"
#define NSDB_GROUP "group"
#define NSDB_GROUP_COMPAT "group_compat"
#define NSDB_NETGROUP "netgroup"
#define NSDB_NETWORKS "networks"
#define NSDB_PASSWD "passwd"
#define NSDB_PASSWD_COMPAT "passwd_compat"
#define NSDB_SHELLS "shells"
#define NSDB_SERVICES "services"
#define NSDB_SERVICES_COMPAT "services_compat"
#define NSDB_SSH_HOSTKEYS "ssh_hostkeys"
#define NSDB_PROTOCOLS "protocols"
#define NSDB_RPC "rpc"
/*
* suggested databases to implement
*/
#define NSDB_ALIASES "aliases"
#define NSDB_AUTH "auth"
#define NSDB_AUTOMOUNT "automount"
#define NSDB_BOOTPARAMS "bootparams"
#define NSDB_ETHERS "ethers"
#define NSDB_EXPORTS "exports"
#define NSDB_NETMASKS "netmasks"
#define NSDB_PHONES "phones"
#define NSDB_PRINTCAP "printcap"
#define NSDB_REMOTE "remote"
#define NSDB_SENDMAILVARS "sendmailvars"
#define NSDB_TERMCAP "termcap"
#define NSDB_TTYS "ttys"
/*
* ns_dtab `method' function signature.
*/
typedef int (*nss_method)(void *_retval, void *_mdata, va_list _ap);
/*
* Macro for generating method prototypes.
*/
#define NSS_METHOD_PROTOTYPE(method) \
int method(void *, void *, va_list)
/*
* ns_dtab - `nsswitch dispatch table'
* Contains an entry for each source and the appropriate function to
* call. ns_dtabs are used in the nsdispatch() API in order to allow
* the application to override built-in actions.
*/
typedef struct _ns_dtab {
const char *src; /* Source this entry implements */
nss_method method; /* Method to be called */
void *mdata; /* Data passed to method */
} ns_dtab;
/*
* macros to help build an ns_dtab[]
*/
#define NS_FILES_CB(F,C) { NSSRC_FILES, F, C },
#define NS_COMPAT_CB(F,C) { NSSRC_COMPAT, F, C },
#define NS_FALLBACK_CB(F) { NSSRC_FALLBACK, F, NULL },
#ifdef HESIOD
# define NS_DNS_CB(F,C) { NSSRC_DNS, F, C },
#else
# define NS_DNS_CB(F,C)
#endif
#ifdef YP
# define NS_NIS_CB(F,C) { NSSRC_NIS, F, C },
#else
# define NS_NIS_CB(F,C)
#endif
/*
* ns_src - `nsswitch source'
* used by the nsparser routines to store a mapping between a source
* and its dispatch control flags for a given database.
*/
typedef struct _ns_src {
const char *name;
u_int32_t flags;
} ns_src;
/*
* default sourcelist (if nsswitch.conf is missing, corrupt,
* or the requested database doesn't have an entry.
*/
extern const ns_src __nsdefaultsrc[];
/*
* ns_mtab - NSS method table
* An NSS module provides a mapping from (database name, method name)
* tuples to the nss_method and associated data.
*/
typedef struct _ns_mtab {
const char *database;
const char *name;
nss_method method;
void *mdata;
} ns_mtab;
/*
* NSS module de-registration, called at module unload.
*/
typedef void (*nss_module_unregister_fn)(ns_mtab *, unsigned int);
/*
* NSS module registration, called at module load.
*/
typedef ns_mtab *(*nss_module_register_fn)(const char *, unsigned int *,
nss_module_unregister_fn *);
/*
* Many NSS interfaces follow the getXXnam, getXXid, getXXent pattern.
* Developers are encouraged to use nss_lookup_type where approriate.
*/
enum nss_lookup_type {
nss_lt_name = 1,
nss_lt_id = 2,
nss_lt_all = 3
};
#ifdef _NS_PRIVATE
/*
* private data structures for back-end nsswitch implementation
*/
/*
* ns_dbt - `nsswitch database thang'
* for each database in /etc/nsswitch.conf there is a ns_dbt, with its
* name and a list of ns_src's containing the source information.
*/
typedef struct _ns_dbt {
const char *name; /* name of database */
ns_src *srclist; /* list of sources */
int srclistsize; /* size of srclist */
} ns_dbt;
/*
* ns_mod - NSS module
*/
typedef struct _ns_mod {
char *name; /* module name */
void *handle; /* handle from dlopen */
ns_mtab *mtab; /* method table */
unsigned int mtabsize; /* count of entries in method table */
nss_module_unregister_fn unregister; /* called to unload module */
} ns_mod;
#endif /* _NS_PRIVATE */
#include <sys/cdefs.h>
__BEGIN_DECLS
extern int nsdispatch(void *, const ns_dtab [], const char *,
const char *, const ns_src [], ...);
#ifdef _NS_PRIVATE
extern void _nsdbtaddsrc(ns_dbt *, const ns_src *);
extern void _nsdbtput(const ns_dbt *);
extern void _nsyyerror(const char *);
extern int _nsyylex(void);
extern int _nsyyparse(void);
extern int _nsyylineno;
#ifdef _NSS_DEBUG
extern void _nsdbtdump(const ns_dbt *);
#endif
#endif /* _NS_PRIVATE */
__END_DECLS
#endif /* !_NSSWITCH_H */
diff --git a/include/readpassphrase.h b/include/readpassphrase.h
index fd54642da21b..9dfef0bc9f25 100644
--- a/include/readpassphrase.h
+++ b/include/readpassphrase.h
@@ -1,49 +1,48 @@
/* $OpenBSD: readpassphrase.h,v 1.5 2003/06/17 21:56:23 millert Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: ISC
*
* Copyright (c) 2000, 2002 Todd C. Miller <Todd.Miller@courtesan.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* Sponsored in part by the Defense Advanced Research Projects
* Agency (DARPA) and Air Force Research Laboratory, Air Force
* Materiel Command, USAF, under agreement number F39502-99-1-0512.
*/
#ifndef _READPASSPHRASE_H_
#define _READPASSPHRASE_H_
#define RPP_ECHO_OFF 0x00 /* Turn off echo (default). */
#define RPP_ECHO_ON 0x01 /* Leave echo on. */
#define RPP_REQUIRE_TTY 0x02 /* Fail if there is no tty. */
#define RPP_FORCELOWER 0x04 /* Force input to lower case. */
#define RPP_FORCEUPPER 0x08 /* Force input to upper case. */
#define RPP_SEVENBIT 0x10 /* Strip the high bit from input. */
#define RPP_STDIN 0x20 /* Read from stdin, not /dev/tty */
#include <sys/cdefs.h>
#include <sys/_types.h>
#ifndef _SIZE_T_DECLARED
typedef __size_t size_t;
#define _SIZE_T_DECLARED
#endif
__BEGIN_DECLS
char * readpassphrase(const char *, char *, size_t, int);
__END_DECLS
#endif /* !_READPASSPHRASE_H_ */
diff --git a/include/rpc/auth_des.h b/include/rpc/auth_des.h
index 3b860d8c7ac3..d395dbf49a46 100644
--- a/include/rpc/auth_des.h
+++ b/include/rpc/auth_des.h
@@ -1,127 +1,126 @@
/* @(#)auth_des.h 2.2 88/07/29 4.0 RPCSRC; from 1.3 88/02/08 SMI */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*
* from: @(#)auth_des.h 2.2 88/07/29 4.0 RPCSRC
* from: @(#)auth_des.h 1.14 94/04/25 SMI
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/*
* auth_des.h, Protocol for DES style authentication for RPC
*/
#ifndef _AUTH_DES_
#define _AUTH_DES_
/*
* There are two kinds of "names": fullnames and nicknames
*/
enum authdes_namekind {
ADN_FULLNAME,
ADN_NICKNAME
};
/*
* A fullname contains the network name of the client,
* a conversation key and the window
*/
struct authdes_fullname {
char *name; /* network name of client, up to MAXNETNAMELEN */
des_block key; /* conversation key */
u_long window; /* associated window */
};
/*
* A credential
*/
struct authdes_cred {
enum authdes_namekind adc_namekind;
struct authdes_fullname adc_fullname;
u_long adc_nickname;
};
/*
* A des authentication verifier
*/
struct authdes_verf {
union {
struct timeval adv_ctime; /* clear time */
des_block adv_xtime; /* crypt time */
} adv_time_u;
u_long adv_int_u;
};
/*
* des authentication verifier: client variety
*
* adv_timestamp is the current time.
* adv_winverf is the credential window + 1.
* Both are encrypted using the conversation key.
*/
#define adv_timestamp adv_time_u.adv_ctime
#define adv_xtimestamp adv_time_u.adv_xtime
#define adv_winverf adv_int_u
/*
* des authentication verifier: server variety
*
* adv_timeverf is the client's timestamp + client's window
* adv_nickname is the server's nickname for the client.
* adv_timeverf is encrypted using the conversation key.
*/
#define adv_timeverf adv_time_u.adv_ctime
#define adv_xtimeverf adv_time_u.adv_xtime
#define adv_nickname adv_int_u
/*
* Map a des credential into a unix cred.
*
*/
__BEGIN_DECLS
extern int authdes_getucred( struct authdes_cred *, uid_t *, gid_t *, int *, gid_t * );
__END_DECLS
__BEGIN_DECLS
extern bool_t xdr_authdes_cred(XDR *, struct authdes_cred *);
extern bool_t xdr_authdes_verf(XDR *, struct authdes_verf *);
extern int rtime(dev_t, struct netbuf *, int, struct timeval *,
struct timeval *);
extern void kgetnetname(char *);
extern enum auth_stat _svcauth_des(struct svc_req *, struct rpc_msg *);
__END_DECLS
#endif /* ndef _AUTH_DES_ */
diff --git a/include/rpc/auth_kerb.h b/include/rpc/auth_kerb.h
index 29b09d507006..726741f91ddb 100644
--- a/include/rpc/auth_kerb.h
+++ b/include/rpc/auth_kerb.h
@@ -1,142 +1,141 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* auth_kerb.h, Protocol for Kerberos style authentication for RPC
*
* Copyright (C) 1986, Sun Microsystems, Inc.
*/
#ifndef _RPC_AUTH_KERB_H
#define _RPC_AUTH_KERB_H
#ifdef KERBEROS
#include <kerberos/krb.h>
#include <sys/socket.h>
#include <sys/t_kuser.h>
#include <netinet/in.h>
#include <rpc/svc.h>
/*
* There are two kinds of "names": fullnames and nicknames
*/
enum authkerb_namekind {
AKN_FULLNAME,
AKN_NICKNAME
};
/*
* A fullname contains the ticket and the window
*/
struct authkerb_fullname {
KTEXT_ST ticket;
u_long window; /* associated window */
};
/*
* cooked credential stored in rq_clntcred
*/
struct authkerb_clnt_cred {
/* start of AUTH_DAT */
unsigned char k_flags; /* Flags from ticket */
char pname[ANAME_SZ]; /* Principal's name */
char pinst[INST_SZ]; /* His Instance */
char prealm[REALM_SZ]; /* His Realm */
unsigned long checksum; /* Data checksum (opt) */
C_Block session; /* Session Key */
int life; /* Life of ticket */
unsigned long time_sec; /* Time ticket issued */
unsigned long address; /* Address in ticket */
/* KTEXT_ST reply; Auth reply (opt) */
/* end of AUTH_DAT */
unsigned long expiry; /* time the ticket is expiring */
u_long nickname; /* Nickname into cache */
u_long window; /* associated window */
};
typedef struct authkerb_clnt_cred authkerb_clnt_cred;
/*
* A credential
*/
struct authkerb_cred {
enum authkerb_namekind akc_namekind;
struct authkerb_fullname akc_fullname;
u_long akc_nickname;
};
/*
* A kerb authentication verifier
*/
struct authkerb_verf {
union {
struct timeval akv_ctime; /* clear time */
des_block akv_xtime; /* crypt time */
} akv_time_u;
u_long akv_int_u;
};
/*
* des authentication verifier: client variety
*
* akv_timestamp is the current time.
* akv_winverf is the credential window + 1.
* Both are encrypted using the conversation key.
*/
#ifndef akv_timestamp
#define akv_timestamp akv_time_u.akv_ctime
#define akv_xtimestamp akv_time_u.akv_xtime
#define akv_winverf akv_int_u
#endif
/*
* des authentication verifier: server variety
*
* akv_timeverf is the client's timestamp + client's window
* akv_nickname is the server's nickname for the client.
* akv_timeverf is encrypted using the conversation key.
*/
#ifndef akv_timeverf
#define akv_timeverf akv_time_u.akv_ctime
#define akv_xtimeverf akv_time_u.akv_xtime
#define akv_nickname akv_int_u
#endif
/*
* Register the service name, instance and realm.
*/
extern int authkerb_create(char *, char *, char *, u_int,
struct netbuf *, int *, dev_t, int, AUTH **);
extern bool_t xdr_authkerb_cred(XDR *, struct authkerb_cred *);
extern bool_t xdr_authkerb_verf(XDR *, struct authkerb_verf *);
extern int svc_kerb_reg(SVCXPRT *, char *, char *, char *);
extern enum auth_stat _svcauth_kerb(struct svc_req *, struct rpc_msg *);
#endif /* KERBEROS */
#endif /* !_RPC_AUTH_KERB_H */
diff --git a/include/rpc/clnt_soc.h b/include/rpc/clnt_soc.h
index c16609bb6aac..e20edc4cca0a 100644
--- a/include/rpc/clnt_soc.h
+++ b/include/rpc/clnt_soc.h
@@ -1,107 +1,106 @@
/* $NetBSD: clnt_soc.h,v 1.1 2000/06/02 22:57:55 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1984 - 1991 by Sun Microsystems, Inc.
*/
/*
* clnt.h - Client side remote procedure call interface.
*/
#ifndef _RPC_CLNT_SOC_H
#define _RPC_CLNT_SOC_H
/* derived from clnt_soc.h 1.3 88/12/17 SMI */
/*
* All the following declarations are only for backward compatibility
* with TS-RPC.
*/
#include <sys/cdefs.h>
#define UDPMSGSIZE 8800 /* rpc imposed limit on udp msg size */
/*
* TCP based rpc
* CLIENT *
* clnttcp_create(raddr, prog, vers, sockp, sendsz, recvsz)
* struct sockaddr_in *raddr;
* u_long prog;
* u_long version;
* register int *sockp;
* u_int sendsz;
* u_int recvsz;
*/
__BEGIN_DECLS
extern CLIENT *clnttcp_create(struct sockaddr_in *, u_long, u_long, int *,
u_int, u_int);
__END_DECLS
/*
* Raw (memory) rpc.
*/
__BEGIN_DECLS
extern CLIENT *clntraw_create(u_long, u_long);
__END_DECLS
/*
* UDP based rpc.
* CLIENT *
* clntudp_create(raddr, program, version, wait, sockp)
* struct sockaddr_in *raddr;
* u_long program;
* u_long version;
* struct timeval wait;
* int *sockp;
*
* Same as above, but you specify max packet sizes.
* CLIENT *
* clntudp_bufcreate(raddr, program, version, wait, sockp, sendsz, recvsz)
* struct sockaddr_in *raddr;
* u_long program;
* u_long version;
* struct timeval wait;
* int *sockp;
* u_int sendsz;
* u_int recvsz;
*/
__BEGIN_DECLS
extern CLIENT *clntudp_create(struct sockaddr_in *, u_long, u_long,
struct timeval, int *);
extern CLIENT *clntudp_bufcreate(struct sockaddr_in *, u_long, u_long,
struct timeval, int *, u_int, u_int);
__END_DECLS
#endif /* _RPC_CLNT_SOC_H */
diff --git a/include/rpc/clnt_stat.h b/include/rpc/clnt_stat.h
index 6148b4eb94a5..7b367132f2d4 100644
--- a/include/rpc/clnt_stat.h
+++ b/include/rpc/clnt_stat.h
@@ -1,83 +1,82 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 1986 - 1991, 1994, 1996, 1997 by Sun Microsystems, Inc.
* All rights reserved.
*/
/*
* clnt_stat.h - Client side remote procedure call enum
*
*/
#ifndef _RPC_CLNT_STAT_H
#define _RPC_CLNT_STAT_H
/* #pragma ident "@(#)clnt_stat.h 1.2 97/04/28 SMI" */
#ifdef __cplusplus
extern "C" {
#endif
enum clnt_stat {
RPC_SUCCESS = 0, /* call succeeded */
/*
* local errors
*/
RPC_CANTENCODEARGS = 1, /* can't encode arguments */
RPC_CANTDECODERES = 2, /* can't decode results */
RPC_CANTSEND = 3, /* failure in sending call */
RPC_CANTRECV = 4,
/* failure in receiving result */
RPC_TIMEDOUT = 5, /* call timed out */
RPC_INTR = 18, /* call interrupted */
RPC_UDERROR = 23, /* recv got uderr indication */
/*
* remote errors
*/
RPC_VERSMISMATCH = 6, /* rpc versions not compatible */
RPC_AUTHERROR = 7, /* authentication error */
RPC_PROGUNAVAIL = 8, /* program not available */
RPC_PROGVERSMISMATCH = 9, /* program version mismatched */
RPC_PROCUNAVAIL = 10, /* procedure unavailable */
RPC_CANTDECODEARGS = 11, /* decode arguments error */
RPC_SYSTEMERROR = 12, /* generic "other problem" */
/*
* rpc_call & clnt_create errors
*/
RPC_UNKNOWNHOST = 13, /* unknown host name */
RPC_UNKNOWNPROTO = 17, /* unknown protocol */
RPC_UNKNOWNADDR = 19, /* Remote address unknown */
RPC_NOBROADCAST = 21, /* Broadcasting not supported */
/*
* rpcbind errors
*/
RPC_RPCBFAILURE = 14, /* the pmapper failed in its call */
#define RPC_PMAPFAILURE RPC_RPCBFAILURE
RPC_PROGNOTREGISTERED = 15, /* remote program is not registered */
RPC_N2AXLATEFAILURE = 22,
/* Name to address translation failed */
/*
* Misc error in the TLI library
*/
RPC_TLIERROR = 20,
/*
* unspecified error
*/
RPC_FAILED = 16,
/*
* asynchronous errors
*/
RPC_INPROGRESS = 24,
RPC_STALERACHANDLE = 25,
RPC_CANTCONNECT = 26, /* couldn't make connection (cots) */
RPC_XPRTFAILED = 27, /* received discon from remote (cots) */
RPC_CANTCREATESTREAM = 28 /* can't push rpc module (cots) */
};
#ifdef __cplusplus
}
#endif
#endif /* !_RPC_CLNT_STAT_H */
diff --git a/include/rpc/des.h b/include/rpc/des.h
index 93698cce6cbc..4c3ca16e8e39 100644
--- a/include/rpc/des.h
+++ b/include/rpc/des.h
@@ -1,84 +1,83 @@
/* @(#)des.h 2.2 88/08/10 4.0 RPCSRC; from 2.7 88/02/08 SMI */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Generic DES driver interface
* Keep this file hardware independent!
* Copyright (c) 1986 by Sun Microsystems, Inc.
*/
#define DES_MAXLEN 65536 /* maximum # of bytes to encrypt */
#define DES_QUICKLEN 16 /* maximum # of bytes to encrypt quickly */
enum desdir { ENCRYPT, DECRYPT };
enum desmode { CBC, ECB };
/*
* parameters to ioctl call
*/
struct desparams {
u_char des_key[8]; /* key (with low bit parity) */
enum desdir des_dir; /* direction */
enum desmode des_mode; /* mode */
u_char des_ivec[8]; /* input vector */
unsigned des_len; /* number of bytes to crypt */
union {
u_char UDES_data[DES_QUICKLEN];
u_char *UDES_buf;
} UDES;
# define des_data UDES.UDES_data /* direct data here if quick */
# define des_buf UDES.UDES_buf /* otherwise, pointer to data */
};
#ifdef notdef
/*
* These ioctls are only implemented in SunOS. Maybe someday
* if somebody writes a driver for DES hardware that works
* with FreeBSD, we can being that back.
*/
/*
* Encrypt an arbitrary sized buffer
*/
#define DESIOCBLOCK _IOWR('d', 6, struct desparams)
/*
* Encrypt of small amount of data, quickly
*/
#define DESIOCQUICK _IOWR('d', 7, struct desparams)
#endif
/*
* Software DES.
*/
extern int _des_crypt( char *, int, struct desparams * );
diff --git a/include/rpc/nettype.h b/include/rpc/nettype.h
index 39c1f76970fb..42986de892db 100644
--- a/include/rpc/nettype.h
+++ b/include/rpc/nettype.h
@@ -1,65 +1,64 @@
/* $NetBSD: nettype.h,v 1.2 2000/07/06 03:17:19 christos Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/*
* nettype.h, Nettype definitions.
* All for the topmost layer of rpc
*
*/
#ifndef _RPC_NETTYPE_H
#define _RPC_NETTYPE_H
#include <netconfig.h>
#define _RPC_NONE 0
#define _RPC_NETPATH 1
#define _RPC_VISIBLE 2
#define _RPC_CIRCUIT_V 3
#define _RPC_DATAGRAM_V 4
#define _RPC_CIRCUIT_N 5
#define _RPC_DATAGRAM_N 6
#define _RPC_TCP 7
#define _RPC_UDP 8
__BEGIN_DECLS
extern void *__rpc_setconf(const char *);
extern void __rpc_endconf(void *);
extern struct netconfig *__rpc_getconf(void *);
extern struct netconfig *__rpc_getconfip(const char *);
__END_DECLS
#endif /* !_RPC_NETTYPE_H */
diff --git a/include/rpc/raw.h b/include/rpc/raw.h
index b56b9026d93f..9c4e8b05dd2c 100644
--- a/include/rpc/raw.h
+++ b/include/rpc/raw.h
@@ -1,59 +1,58 @@
/* $NetBSD: raw.h,v 1.1 2000/06/02 22:57:56 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
#ifndef _RPC_RAW_H
#define _RPC_RAW_H
/* from: @(#)raw.h 1.11 94/04/25 SMI */
/* from: @(#)raw.h 1.2 88/10/25 SMI */
#ifdef __cplusplus
extern "C" {
#endif
/*
* raw.h
*
* Raw interface
* The common memory area over which they will communicate
*/
extern char *__rpc_rawcombuf;
#ifdef __cplusplus
}
#endif
#endif /* _RPC_RAW_H */
diff --git a/include/rpc/rpc_com.h b/include/rpc/rpc_com.h
index dd331e2601f6..a98e3f73bac8 100644
--- a/include/rpc/rpc_com.h
+++ b/include/rpc/rpc_com.h
@@ -1,84 +1,83 @@
/* $NetBSD: rpc_com.h,v 1.3 2000/12/10 04:10:08 christos Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/*
* rpc_com.h, Common definitions for both the server and client side.
* All for the topmost layer of rpc
*
*/
#ifndef _RPC_RPCCOM_H
#define _RPC_RPCCOM_H
#include <sys/cdefs.h>
/* #pragma ident "@(#)rpc_com.h 1.11 93/07/05 SMI" */
/*
* The max size of the transport, if the size cannot be determined
* by other means.
*/
#define RPC_MAXDATASIZE 9000
#define RPC_MAXADDRSIZE 1024
#define __RPC_GETXID(now) ((u_int32_t)getpid() ^ (u_int32_t)(now)->tv_sec ^ \
(u_int32_t)(now)->tv_usec)
__BEGIN_DECLS
extern u_int __rpc_get_a_size(int);
extern int __rpc_dtbsize(void);
extern int _rpc_dtablesize(void);
extern struct netconfig * __rpcgettp(int);
extern int __rpc_get_default_domain(char **);
char *__rpc_taddr2uaddr_af(int, const struct netbuf *);
struct netbuf *__rpc_uaddr2taddr_af(int, const char *);
int __rpc_fixup_addr(struct netbuf *, const struct netbuf *);
int __rpc_sockinfo2netid(struct __rpc_sockinfo *, const char **);
int __rpc_seman2socktype(int);
int __rpc_socktype2seman(int);
void *rpc_nullproc(CLIENT *);
int __rpc_sockisbound(int);
struct netbuf *__rpcb_findaddr(rpcprog_t, rpcvers_t, const struct netconfig *,
const char *, CLIENT **);
bool_t rpc_control(int,void *);
char *_get_next_token(char *, int);
__END_DECLS
#endif /* _RPC_RPCCOM_H */
diff --git a/include/rpc/rpcb_clnt.h b/include/rpc/rpcb_clnt.h
index b642aacd6a57..4b1f58d273ff 100644
--- a/include/rpc/rpcb_clnt.h
+++ b/include/rpc/rpcb_clnt.h
@@ -1,86 +1,85 @@
/* $NetBSD: rpcb_clnt.h,v 1.1 2000/06/02 22:57:56 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/*
* rpcb_clnt.h
* Supplies C routines to get to rpcbid services.
*
*/
/*
* Usage:
* success = rpcb_set(program, version, nconf, address);
* success = rpcb_unset(program, version, nconf);
* success = rpcb_getaddr(program, version, nconf, host);
* head = rpcb_getmaps(nconf, host);
* clnt_stat = rpcb_rmtcall(nconf, host, program, version, procedure,
* xdrargs, argsp, xdrres, resp, tout, addr_ptr)
* success = rpcb_gettime(host, timep)
* uaddr = rpcb_taddr2uaddr(nconf, taddr);
* taddr = rpcb_uaddr2uaddr(nconf, uaddr);
*/
#ifndef _RPC_RPCB_CLNT_H
#define _RPC_RPCB_CLNT_H
/* #pragma ident "@(#)rpcb_clnt.h 1.13 94/04/25 SMI" */
/* rpcb_clnt.h 1.3 88/12/05 SMI */
#include <rpc/types.h>
#include <rpc/rpcb_prot.h>
__BEGIN_DECLS
extern bool_t rpcb_set(const rpcprog_t, const rpcvers_t,
const struct netconfig *, const struct netbuf *);
extern bool_t rpcb_unset(const rpcprog_t, const rpcvers_t,
const struct netconfig *);
extern rpcblist *rpcb_getmaps(const struct netconfig *, const char *);
extern enum clnt_stat rpcb_rmtcall(const struct netconfig *,
const char *, const rpcprog_t,
const rpcvers_t, const rpcproc_t,
const xdrproc_t, const caddr_t,
const xdrproc_t, const caddr_t,
const struct timeval,
const struct netbuf *);
extern bool_t rpcb_getaddr(const rpcprog_t, const rpcvers_t,
const struct netconfig *, struct netbuf *,
const char *);
extern bool_t rpcb_gettime(const char *, time_t *);
extern char *rpcb_taddr2uaddr(struct netconfig *, struct netbuf *);
extern struct netbuf *rpcb_uaddr2taddr(struct netconfig *, char *);
__END_DECLS
#endif /* !_RPC_RPCB_CLNT_H */
diff --git a/include/rpc/rpcent.h b/include/rpc/rpcent.h
index 15c4ae4d00a6..b9f154d4ebfe 100644
--- a/include/rpc/rpcent.h
+++ b/include/rpc/rpcent.h
@@ -1,68 +1,67 @@
/* $NetBSD: rpcent.h,v 1.1 2000/06/02 22:57:56 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/*
* rpcent.h,
* For converting rpc program numbers to names etc.
*
*/
#ifndef _RPC_RPCENT_H
#define _RPC_RPCENT_H
/* #pragma ident "@(#)rpcent.h 1.13 94/04/25 SMI" */
/* @(#)rpcent.h 1.1 88/12/06 SMI */
struct rpcent {
char *r_name; /* name of server for this rpc program */
char **r_aliases; /* alias list */
int r_number; /* rpc program number */
};
__BEGIN_DECLS
/*
* These interfaces are currently implemented through nsswitch and are
* MT-safe.
*/
extern struct rpcent *getrpcbyname(const char *);
extern struct rpcent *getrpcbynumber(int);
extern struct rpcent *getrpcent(void);
extern void setrpcent(int);
extern void endrpcent(void);
__END_DECLS
#endif /* !_RPC_CENT_H */
diff --git a/include/rpc/svc_dg.h b/include/rpc/svc_dg.h
index d9f3012c4f06..51397113d372 100644
--- a/include/rpc/svc_dg.h
+++ b/include/rpc/svc_dg.h
@@ -1,52 +1,51 @@
/* $NetBSD: svc_dg.h,v 1.1 2000/06/02 23:11:16 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* XXX - this file exists only so that the rpcbind code can pull it in.
* This should go away. It should only be include by svc_dg.c and
* rpcb_svc_com.c in the rpcbind code.
*/
/*
* kept in xprt->xp_p2
*/
struct svc_dg_data {
/* XXX: optbuf should be the first field, used by ti_opts.c code */
size_t su_iosz; /* size of send.recv buffer */
u_int32_t su_xid; /* transaction id */
XDR su_xdrs; /* XDR handle */
char su_verfbody[MAX_AUTH_BYTES]; /* verifier body */
void *su_cache; /* cached data, NULL if none */
struct netbuf su_srcaddr; /* dst address of last msg */
};
#define __rpcb_get_dg_xidp(x) (&((struct svc_dg_data *)(x)->xp_p2)->su_xid)
diff --git a/include/rpc/svc_soc.h b/include/rpc/svc_soc.h
index 912e2ec2df1f..e82215b33d65 100644
--- a/include/rpc/svc_soc.h
+++ b/include/rpc/svc_soc.h
@@ -1,117 +1,116 @@
/* $NetBSD: svc_soc.h,v 1.1 2000/06/02 22:57:57 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/*
* svc.h, Server-side remote procedure call interface.
*/
#ifndef _RPC_SVC_SOC_H
#define _RPC_SVC_SOC_H
#include <sys/cdefs.h>
/* #pragma ident "@(#)svc_soc.h 1.11 94/04/25 SMI" */
/* svc_soc.h 1.8 89/05/01 SMI */
/*
* All the following declarations are only for backward compatibility
* with TS-RPC
*/
/*
* Approved way of getting address of caller
*/
#define svc_getcaller(x) (&(x)->xp_raddr)
/*
* Service registration
*
* svc_register(xprt, prog, vers, dispatch, protocol)
* SVCXPRT *xprt;
* u_long prog;
* u_long vers;
* void (*dispatch)();
* int protocol; like TCP or UDP, zero means do not register
*/
__BEGIN_DECLS
extern bool_t svc_register(SVCXPRT *, u_long, u_long,
void (*)(struct svc_req *, SVCXPRT *), int);
__END_DECLS
/*
* Service un-registration
*
* svc_unregister(prog, vers)
* u_long prog;
* u_long vers;
*/
__BEGIN_DECLS
extern void svc_unregister(u_long, u_long);
__END_DECLS
/*
* Memory based rpc for testing and timing.
*/
__BEGIN_DECLS
extern SVCXPRT *svcraw_create(void);
__END_DECLS
/*
* Udp based rpc.
*/
__BEGIN_DECLS
extern SVCXPRT *svcudp_create(int);
extern SVCXPRT *svcudp_bufcreate(int, u_int, u_int);
extern int svcudp_enablecache(SVCXPRT *, u_long);
__END_DECLS
/*
* Tcp based rpc.
*/
__BEGIN_DECLS
extern SVCXPRT *svctcp_create(int, u_int, u_int);
__END_DECLS
/*
* Fd based rpc.
*/
__BEGIN_DECLS
extern SVCXPRT *svcfd_create(int, u_int, u_int);
__END_DECLS
#endif /* !_RPC_SVC_SOC_H */
diff --git a/include/rpcsvc/nis_object.x b/include/rpcsvc/nis_object.x
index f63cf938571a..1507828b60ff 100644
--- a/include/rpcsvc/nis_object.x
+++ b/include/rpcsvc/nis_object.x
@@ -1,319 +1,318 @@
%/*-
% * Copyright (c) 2010, Oracle America, Inc.
% *
% * Redistribution and use in source and binary forms, with or without
% * modification, are permitted provided that the following conditions are
% * met:
% *
% * * Redistributions of source code must retain the above copyright
% * notice, this list of conditions and the following disclaimer.
% * * Redistributions in binary form must reproduce the above
% * copyright notice, this list of conditions and the following
% * disclaimer in the documentation and/or other materials
% * provided with the distribution.
% * * Neither the name of the "Oracle America, Inc." nor the names of its
% * contributors may be used to endorse or promote products derived
% * from this software without specific prior written permission.
% *
% * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
% * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
% * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
% * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
% * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
% * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
% * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
% * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
% * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
% * WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
% */
/*
* nis_object.x
*
* Copyright (c) 1988-1992 Sun Microsystems Inc
* All Rights Reserved.
*/
-/* $FreeBSD$ */
/* From: %#pragma ident "@(#)nis_object.x 1.10 94/05/03 SMI" */
#if RPC_HDR
%
%#ifndef __nis_object_h
%#define __nis_object_h
%
#endif
/*
* This file defines the format for a NIS object in RPC language.
* It is included by the main .x file and the database access protocol
* file. It is common because both of them need to deal with the same
* type of object. Generating the actual code though is a bit messy because
* the nis.x file and the nis_dba.x file will generate xdr routines to
* encode/decode objects when only one set is needed. Such is life when
* one is using rpcgen.
*
* Note, the protocol doesn't specify any limits on such things as
* maximum name length, number of attributes, etc. These are enforced
* by the database backend. When you hit them you will no. Also see
* the db_getlimits() function for fetching the limit values.
*
*/
/* Some manifest constants, chosen to maximize flexibility without
* plugging the wire full of data.
*/
const NIS_MAXSTRINGLEN = 255;
const NIS_MAXNAMELEN = 1024;
const NIS_MAXATTRNAME = 32;
const NIS_MAXATTRVAL = 2048;
const NIS_MAXCOLUMNS = 64;
const NIS_MAXATTR = 16;
const NIS_MAXPATH = 1024;
const NIS_MAXREPLICAS = 128;
const NIS_MAXLINKS = 16;
const NIS_PK_NONE = 0; /* no public key (unix/sys auth) */
const NIS_PK_DH = 1; /* Public key is Diffie-Hellman type */
const NIS_PK_RSA = 2; /* Public key if RSA type */
const NIS_PK_KERB = 3; /* Use kerberos style authentication */
/*
* The fundamental name type of NIS. The name may consist of two parts,
* the first being the fully qualified name, and the second being an
* optional set of attribute/value pairs.
*/
struct nis_attr {
string zattr_ndx<>; /* name of the index */
opaque zattr_val<>; /* Value for the attribute. */
};
typedef string nis_name<>; /* The NIS name itself. */
/* NIS object types are defined by the following enumeration. The numbers
* they use are based on the following scheme :
* 0 - 1023 are reserved for Sun,
* 1024 - 2047 are defined to be private to a particular tree.
* 2048 - 4095 are defined to be user defined.
* 4096 - ... are reserved for future use.
*/
enum zotypes {
BOGUS_OBJ = 0, /* Uninitialized object structure */
NO_OBJ = 1, /* NULL object (no data) */
DIRECTORY_OBJ = 2, /* Directory object describing domain */
GROUP_OBJ = 3, /* Group object (a list of names) */
TABLE_OBJ = 4, /* Table object (a database schema) */
ENTRY_OBJ = 5, /* Entry object (a database record) */
LINK_OBJ = 6, /* A name link. */
PRIVATE_OBJ = 7 /* Private object (all opaque data) */
};
/*
* The types of Name services NIS knows about. They are enumerated
* here. The Binder code will use this type to determine if it has
* a set of library routines that will access the indicated name service.
*/
enum nstype {
UNKNOWN = 0,
NIS = 1, /* Nis Plus Service */
SUNYP = 2, /* Old NIS Service */
IVY = 3, /* Nis Plus Plus Service */
DNS = 4, /* Domain Name Service */
X500 = 5, /* ISO/CCCIT X.500 Service */
DNANS = 6, /* Digital DECNet Name Service */
XCHS = 7, /* Xerox ClearingHouse Service */
CDS= 8
};
/*
* DIRECTORY - The name service object. These objects identify other name
* servers that are serving some portion of the name space. Each has a
* type associated with it. The resolver library will note whether or not
* is has the needed routines to access that type of service.
* The oarmask structure defines an access rights mask on a per object
* type basis for the name spaces. The only bits currently used are
* create and destroy. By enabling or disabling these access rights for
* a specific object type for a one of the accessor entities (owner,
* group, world) the administrator can control what types of objects
* may be freely added to the name space and which require the
* administrator's approval.
*/
struct oar_mask {
u_long oa_rights; /* Access rights mask */
zotypes oa_otype; /* Object type */
};
struct endpoint {
string uaddr<>;
string family<>; /* Transport family (INET, OSI, etc) */
string proto<>; /* Protocol (TCP, UDP, CLNP, etc) */
};
/*
* Note: pkey is a netobj which is limited to 1024 bytes which limits the
* keysize to 8192 bits. This is consider to be a reasonable limit for
* the expected lifetime of this service.
*/
struct nis_server {
nis_name name; /* Principal name of the server */
endpoint ep<>; /* Universal addr(s) for server */
u_long key_type; /* Public key type */
netobj pkey; /* server's public key */
};
struct directory_obj {
nis_name do_name; /* Name of the directory being served */
nstype do_type; /* one of NIS, DNS, IVY, YP, or X.500 */
nis_server do_servers<>; /* <0> == Primary name server */
u_long do_ttl; /* Time To Live (for caches) */
oar_mask do_armask<>; /* Create/Destroy rights by object type */
};
/*
* ENTRY - This is one row of data from an information base.
* The type value is used by the client library to convert the entry to
* it's internal structure representation. The Table name is a back pointer
* to the table where the entry is stored. This allows the client library
* to determine where to send a request if the client wishes to change this
* entry but got to it through a LINK rather than directly.
* If the entry is a "standalone" entry then this field is void.
*/
const EN_BINARY = 1; /* Indicates value is binary data */
const EN_CRYPT = 2; /* Indicates the value is encrypted */
const EN_XDR = 4; /* Indicates the value is XDR encoded */
const EN_MODIFIED = 8; /* Indicates entry is modified. */
const EN_ASN1 = 64; /* Means contents use ASN.1 encoding */
struct entry_col {
u_long ec_flags; /* Flags for this value */
opaque ec_value<>; /* It's textual value */
};
struct entry_obj {
string en_type<>; /* Type of entry such as "passwd" */
entry_col en_cols<>; /* Value for the entry */
};
/*
* GROUP - The group object contains a list of NIS principal names. Groups
* are used to authorize principals. Each object has a set of access rights
* for members of its group. Principal names in groups are in the form
* name.directory and recursive groups are expressed as @groupname.directory
*/
struct group_obj {
u_long gr_flags; /* Flags controlling group */
nis_name gr_members<>; /* List of names in group */
};
/*
* LINK - This is the LINK object. It is quite similar to a symbolic link
* in the UNIX filesystem. The attributes in the main object structure are
* relative to the LINK data and not what it points to (like the file system)
* "modify" privleges here indicate the right to modify what the link points
* at and not to modify that actual object pointed to by the link.
*/
struct link_obj {
zotypes li_rtype; /* Real type of the object */
nis_attr li_attrs<>; /* Attribute/Values for tables */
nis_name li_name; /* The object's real NIS name */
};
/*
* TABLE - This is the table object. It implements a simple
* data base that applications and use for configuration or
* administration purposes. The role of the table is to group together
* a set of related entries. Tables are the simple database component
* of NIS. Like many databases, tables are logically divided into columns
* and rows. The columns are labeled with indexes and each ENTRY makes
* up a row. Rows may be addressed within the table by selecting one
* or more indexes, and values for those indexes. Each row which has
* a value for the given index that matches the desired value is returned.
* Within the definition of each column there is a flags variable, this
* variable contains flags which determine whether or not the column is
* searchable, contains binary data, and access rights for the entry objects
* column value.
*/
const TA_BINARY = 1; /* Means table data is binary */
const TA_CRYPT = 2; /* Means value should be encrypted */
const TA_XDR = 4; /* Means value is XDR encoded */
const TA_SEARCHABLE = 8; /* Means this column is searchable */
const TA_CASE = 16; /* Means this column is Case Sensitive */
const TA_MODIFIED = 32; /* Means this columns attrs are modified*/
const TA_ASN1 = 64; /* Means contents use ASN.1 encoding */
struct table_col {
string tc_name<64>; /* Column Name */
u_long tc_flags; /* control flags */
u_long tc_rights; /* Access rights mask */
};
struct table_obj {
string ta_type<64>; /* Table type such as "passwd" */
int ta_maxcol; /* Total number of columns */
u_char ta_sep; /* Separator character */
table_col ta_cols<>; /* The number of table indexes */
string ta_path<>; /* A search path for this table */
};
/*
* This union joins together all of the currently known objects.
*/
union objdata switch (zotypes zo_type) {
case DIRECTORY_OBJ :
struct directory_obj di_data;
case GROUP_OBJ :
struct group_obj gr_data;
case TABLE_OBJ :
struct table_obj ta_data;
case ENTRY_OBJ:
struct entry_obj en_data;
case LINK_OBJ :
struct link_obj li_data;
case PRIVATE_OBJ :
opaque po_data<>;
case NO_OBJ :
void;
case BOGUS_OBJ :
void;
default :
void;
};
/*
* This is the basic NIS object data type. It consists of a generic part
* which all objects contain, and a specialized part which varies depending
* on the type of the object. All of the specialized sections have been
* described above. You might have wondered why they all start with an
* integer size, followed by the useful data. The answer is, when the
* server doesn't recognize the type returned it treats it as opaque data.
* And the definition for opaque data is {int size; char *data;}. In this
* way, servers and utility routines that do not understand a given type
* may still pass it around. One has to be careful in setting
* this variable accurately, it must take into account such things as
* XDR padding of structures etc. The best way to set it is to note one's
* position in the XDR encoding stream, encode the structure, look at the
* new position and calculate the size.
*/
struct nis_oid {
u_long ctime; /* Time of objects creation */
u_long mtime; /* Time of objects modification */
};
struct nis_object {
nis_oid zo_oid; /* object identity verifier. */
nis_name zo_name; /* The NIS name for this object */
nis_name zo_owner; /* NIS name of object owner. */
nis_name zo_group; /* NIS name of access group. */
nis_name zo_domain; /* The administrator for the object */
u_long zo_access; /* Access rights (owner, group, world) */
u_long zo_ttl; /* Object's time to live in seconds. */
objdata zo_data; /* Data structure for this type */
};
#if RPC_HDR
%
%#endif /* if __nis_object_h */
%
#endif
diff --git a/include/rpcsvc/nis_tags.h b/include/rpcsvc/nis_tags.h
index 55920a0297fd..0c30d9b33a82 100644
--- a/include/rpcsvc/nis_tags.h
+++ b/include/rpcsvc/nis_tags.h
@@ -1,142 +1,141 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2010, Oracle America, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
* * Neither the name of the "Oracle America, Inc." nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1991, Sun Microsystems Inc.
*/
/*
* nis_tags.h
*
* This file contains the tags and statistics definitions. It is
* automatically included by nis.h
*/
#ifndef _RPCSVC_NIS_TAGS_H
#define _RPCSVC_NIS_TAGS_H
-/* $FreeBSD$ */
/* From: #pragma ident "@(#)nis_tags.h 1.10 94/05/03 SMI" */
/* from file: zns_tags.h 1.7 Copyright (c) 1990 Sun Microsystems */
#ifdef __cplusplus
extern "C" {
#endif
#ifndef ORIGINAL_DECLS
#define NIS_DIR "data"
#endif
/* Lookup and List function flags */
#define FOLLOW_LINKS (1<<0) /* Follow link objects */
#define FOLLOW_PATH (1<<1) /* Follow the path in a table */
#define HARD_LOOKUP (1<<2) /* Block until successful */
#define ALL_RESULTS (1<<3) /* Retrieve all results */
#define NO_CACHE (1<<4) /* Do not return 'cached' results */
#define MASTER_ONLY (1<<5) /* Get value only from master server */
#define EXPAND_NAME (1<<6) /* Expand partitially qualified names */
/* Semantic modification for table operations flags */
#define RETURN_RESULT (1<<7) /* Return resulting object to client */
#define ADD_OVERWRITE (1<<8) /* Allow overwrites on ADD */
#define REM_MULTIPLE (1<<9) /* Allow wildcard deletes */
#define MOD_SAMEOBJ (1<<10) /* Check modified object before write */
#define ADD_RESERVED (1<<11) /* Spare ADD semantic */
#define REM_RESERVED (1<<12) /* Spare REM semantic */
#ifdef ORIGINAL_DECLS
#define MOD_RESERVED (1<<13) /* Spare MOD semantic */
#else
#define MOD_EXCLUSIVE (1<<13) /* Modify no overwrite on modified keys */
#endif
/* Transport specific modifications to the operation */
#define USE_DGRAM (1<<16) /* Use a datagram transport */
#define NO_AUTHINFO (1<<17) /* Don't bother attaching auth info */
/*
* Declarations for "standard" NIS+ tags
* State variable tags have values 0 - 2047
* Statistic tags have values 2048 - 65535
* User Tags have values >2^16
*/
#define TAG_DEBUG 1 /* set debug level */
#define TAG_STATS 2 /* Enable/disable statistics */
#define TAG_GCACHE 3 /* Flush the Group Cache */
#ifndef ORIGINAL_DECLS
#define TAG_GCACHE_ALL TAG_GCACHE
#endif
#define TAG_DCACHE 4 /* Flush the directory cache */
#ifndef ORIGINAL_DECLS
#define TAG_DCACHE_ONE TAG_DCACHE
#endif
#define TAG_OCACHE 5 /* Flush the Object Cache */
#define TAG_SECURE 6 /* Set the security level */
#ifndef ORIGINAL_DECLS
#define TAG_TCACHE_ONE 7 /* Flush the table cache */
#define TAG_DCACHE_ALL 8 /* Flush entire directory cache */
#define TAG_TCACHE_ALL 9 /* Flush entire table cache */
#define TAG_GCACHE_ONE 10 /* Flush one group object */
#define TAG_DCACHE_ONE_REFRESH 11 /* Flush and refresh one DO */
#endif
#define TAG_OPSTATS 2048 /* NIS+ operations statistics */
#define TAG_THREADS 2049 /* Child process/thread status */
#define TAG_HEAP 2050 /* Heap usage statistics */
#define TAG_UPDATES 2051 /* Updates to this service */
#define TAG_VISIBLE 2052 /* First update that isn't replicated */
#define TAG_S_DCACHE 2053 /* Directory cache statistics */
#define TAG_S_OCACHE 2054 /* Object cache statistics */
#define TAG_S_GCACHE 2055 /* Group cache statistics */
#define TAG_S_STORAGE 2056 /* Group cache statistics */
#define TAG_UPTIME 2057 /* Time that server has been up */
#ifndef ORIGINAL_DECLS
#define TAG_DIRLIST 2058 /* Dir served by this server */
#define TAG_NISCOMPAT 2059 /* Whether supports NIS compat mode */
#define TAG_DNSFORWARDING 2060 /* Whether DNS forwarding supported*/
#define TAG_SECURITY_LEVEL 2061 /* Security level of the server */
#define TAG_ROOTSERVER 2062 /* Whether root server */
#endif
/*
* Declarations for the Group object flags. Currently
* there are only 3.
*/
#define IMPMEM_GROUPS 1 /* Implicit Membership allowed */
#define RECURS_GROUPS 2 /* Recursive Groups allowed */
#define NEGMEM_GROUPS 4 /* Negative Groups allowed */
#ifdef __cplusplus
}
#endif
#endif /* _RPCSVC_NIS_TAGS_H */
diff --git a/kerberos5/include/config.h b/kerberos5/include/config.h
index 73aacf8dfa6e..7e59c57727f6 100644
--- a/kerberos5/include/config.h
+++ b/kerberos5/include/config.h
@@ -1,1633 +1,1632 @@
/* include/config.h. Generated from config.h.in by configure. */
/* include/config.h.in. Generated from configure.ac by autoheader. */
-/* $FreeBSD$ */
#ifndef RCSID
#define RCSID(msg) \
static /**/const char *const rcsid[] = { (const char *)rcsid, "@(#)" msg }
#endif
/* Maximum values on all known systems */
#define MaxHostNameLen (64+4)
#define MaxPathLen (1024+4)
#ifdef BUILD_KRB5_LIB
#ifndef KRB5_LIB
#ifdef _WIN32_
#define KRB5_LIB_FUNCTION __declspec(dllexport)
#define KRB5_LIB_CALL __stdcall
#define KRB5_LIB_VARIABLE __declspec(dllexport)
#else
#define KRB5_LIB_FUNCTION
#define KRB5_LIB_CALL
#define KRB5_LIB_VARIABLE
#endif
#endif
#endif
#ifdef BUILD_ROKEN_LIB
#ifndef ROKEN_LIB
#ifdef _WIN32_
#define ROKEN_LIB_FUNCTION __declspec(dllexport)
#define ROKEN_LIB_CALL __stdcall
#define ROKEN_LIB_VARIABLE __declspec(dllexport)
#else
#define ROKEN_LIB_FUNCTION
#define ROKEN_LIB_CALL
#define ROKEN_LIB_VARIABLE
#endif
#endif
#endif
#ifdef BUILD_GSSAPI_LIB
#ifndef GSSAPI_LIB
#ifdef _WIN32_
#define GSSAPI_LIB_FUNCTION __declspec(dllexport)
#define GSSAPI_LIB_CALL __stdcall
#define GSSAPI_LIB_VARIABLE __declspec(dllexport)
#else
#define GSSAPI_LIB_FUNCTION
#define GSSAPI_LIB_CALL
#define GSSAPI_LIB_VARIABLE
#endif
#endif
#endif
/* Define if you want authentication support in telnet. */
#define AUTHENTICATION 1
/* path to bin */
#define BINDIR "/usr/bin"
/* Define if realloc(NULL) doesn't work. */
/* #undef BROKEN_REALLOC */
/* Define if you want support for DCE/DFS PAG's. */
/* #undef DCE */
/* Define if you want to use DES encryption in telnet. */
#define DES_ENCRYPTION 1
/* Define this to enable diagnostics in telnet. */
#define DIAGNOSTICS 1
/* Define to enable DIGEST. */
#define DIGEST 1
/* Define if want to use the weak AFS string to key functions. */
#define ENABLE_AFS_STRING_TO_KEY 1
/* Define if you want have a thread safe libraries */
#define ENABLE_PTHREAD_SUPPORT 1
/* Define if you want encryption support in telnet. */
#define ENCRYPTION 1
/* define if sys/param.h defines the endiness */
#define ENDIANESS_IN_SYS_PARAM_H 1
/* Define this if you want support for broken ENV_{VAR,VAL} telnets. */
/* #undef ENV_HACK */
/* define if prototype of gethostbyaddr is compatible with struct hostent
*gethostbyaddr(const void *, size_t, int) */
/* #undef GETHOSTBYADDR_PROTO_COMPATIBLE */
/* define if prototype of gethostbyname is compatible with struct hostent
*gethostbyname(const char *) */
#define GETHOSTBYNAME_PROTO_COMPATIBLE 1
/* define if prototype of getservbyname is compatible with struct servent
*getservbyname(const char *, const char *) */
#define GETSERVBYNAME_PROTO_COMPATIBLE 1
/* define if prototype of getsockname is compatible with int getsockname(int,
struct sockaddr*, socklen_t*) */
#define GETSOCKNAME_PROTO_COMPATIBLE 1
/* Define if you have the `altzone' variable. */
/* #undef HAVE_ALTZONE */
/* Define to 1 if you have the `arc4random' function. */
#define HAVE_ARC4RANDOM 1
/* Define to 1 if you have the <arpa/ftp.h> header file. */
#define HAVE_ARPA_FTP_H 1
/* Define to 1 if you have the <arpa/inet.h> header file. */
#define HAVE_ARPA_INET_H 1
/* Define to 1 if you have the <arpa/nameser.h> header file. */
#define HAVE_ARPA_NAMESER_H 1
/* Define to 1 if you have the <arpa/telnet.h> header file. */
#define HAVE_ARPA_TELNET_H 1
/* Define to 1 if you have the <asl.h> header file. */
/* #undef HAVE_ASL_H */
/* Define to 1 if you have the `asnprintf' function. */
/* #undef HAVE_ASNPRINTF */
/* Define to 1 if you have the `asprintf' function. */
#define HAVE_ASPRINTF 1
/* Define to 1 if you have the `atexit' function. */
#define HAVE_ATEXIT 1
/* Define to 1 if you have the `backtrace' function. */
/* #undef HAVE_BACKTRACE */
/* Define to 1 if you have the <bind/bitypes.h> header file. */
/* #undef HAVE_BIND_BITYPES_H */
/* Define to 1 if you have the <bsdsetjmp.h> header file. */
/* #undef HAVE_BSDSETJMP_H */
/* Define to 1 if you have the `bswap16' function. */
/* #undef HAVE_BSWAP16 */
/* Define to 1 if you have the `bswap32' function. */
/* #undef HAVE_BSWAP32 */
/* Define to 1 if you have the <capability.h> header file. */
/* #undef HAVE_CAPABILITY_H */
/* whether capng is available for privilege reduction */
/* #undef HAVE_CAPNG */
/* Define to 1 if you have the `cap_set_proc' function. */
/* #undef HAVE_CAP_SET_PROC */
/* Define to 1 if you have the `cgetent' function. */
#define HAVE_CGETENT 1
/* Define if you have the function `chown'. */
#define HAVE_CHOWN 1
/* Define if you have the function `closefrom'. */
#define HAVE_CLOSEFROM 1
/* Define to 1 if you have the <CommonCrypto/CommonCryptor.h> header file. */
/* #undef HAVE_COMMONCRYPTO_COMMONCRYPTOR_H */
/* Define to 1 if you have the <CommonCrypto/CommonDigest.h> header file. */
/* #undef HAVE_COMMONCRYPTO_COMMONDIGEST_H */
/* Define to 1 if you have the <config.h> header file. */
/* #undef HAVE_CONFIG_H */
/* Define if you have the function `copyhostent'. */
/* #undef HAVE_COPYHOSTENT */
/* Define to 1 if you have the `crypt' function. */
#define HAVE_CRYPT 1
/* Define to 1 if you have the <crypt.h> header file. */
/* #undef HAVE_CRYPT_H */
/* Define to 1 if you have the <curses.h> header file. */
#define HAVE_CURSES_H 1
/* Define if you have the function `daemon'. */
#define HAVE_DAEMON 1
/* define if you have a berkeley db1/2 library */
#define HAVE_DB1 1
/* define if you have a berkeley db3/4/5 library */
/* #undef HAVE_DB3 */
/* Define to 1 if you have the <db3/db.h> header file. */
/* #undef HAVE_DB3_DB_H */
/* Define to 1 if you have the <db4/db.h> header file. */
/* #undef HAVE_DB4_DB_H */
/* Define to 1 if you have the <db5/db.h> header file. */
/* #undef HAVE_DB5_DB_H */
/* Define if you have user supplied header location */
/* #undef HAVE_DBHEADER */
/* Define to 1 if you have the `dbm_firstkey' function. */
#define HAVE_DBM_FIRSTKEY 1
/* Define to 1 if you have the <dbm.h> header file. */
/* #undef HAVE_DBM_H */
/* Define to 1 if you have the `dbopen' function. */
#define HAVE_DBOPEN 1
/* Define to 1 if you have the `db_create' function. */
/* #undef HAVE_DB_CREATE */
/* Define to 1 if you have the <db.h> header file. */
#define HAVE_DB_H 1
/* define if you have ndbm compat in db */
/* #undef HAVE_DB_NDBM */
/* Define to 1 if you have the declaration of `altzone', and to 0 if you
don't. */
/* #undef HAVE_DECL_ALTZONE */
/* Define to 1 if you have the declaration of `environ', and to 0 if you
don't. */
#define HAVE_DECL_ENVIRON 0
/* Define to 1 if you have the declaration of `h_errlist', and to 0 if you
don't. */
#define HAVE_DECL_H_ERRLIST 0
/* Define to 1 if you have the declaration of `h_errno', and to 0 if you
don't. */
#define HAVE_DECL_H_ERRNO 1
/* Define to 1 if you have the declaration of `h_nerr', and to 0 if you don't.
*/
/* #undef HAVE_DECL_H_NERR */
/* Define to 1 if you have the declaration of `optarg', and to 0 if you don't.
*/
#define HAVE_DECL_OPTARG 1
/* Define to 1 if you have the declaration of `opterr', and to 0 if you don't.
*/
#define HAVE_DECL_OPTERR 1
/* Define to 1 if you have the declaration of `optind', and to 0 if you don't.
*/
#define HAVE_DECL_OPTIND 1
/* Define to 1 if you have the declaration of `optopt', and to 0 if you don't.
*/
#define HAVE_DECL_OPTOPT 1
/* Define to 1 if you have the declaration of `timezone', and to 0 if you
don't. */
#define HAVE_DECL_TIMEZONE 1
/* Define to 1 if you have the declaration of `_res', and to 0 if you don't.
*/
#define HAVE_DECL__RES 1
/* Define to 1 if you have the declaration of `__progname', and to 0 if you
don't. */
#define HAVE_DECL___PROGNAME 0
/* Define to 1 if you have the <dirent.h> header file. */
#define HAVE_DIRENT_H 1
/* have a dirfd function/macro */
#define HAVE_DIRFD 1
/* Define if DIR has field dd_fd. */
#define HAVE_DIR_DD_FD 1
/* Define to 1 if you have the `dispatch_async_f' function. */
/* #undef HAVE_DISPATCH_ASYNC_F */
/* Define to 1 if you have the <dispatch/dispatch.h> header file. */
/* #undef HAVE_DISPATCH_DISPATCH_H */
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the `dlopen' function. */
#define HAVE_DLOPEN 1
/* Define to 1 if you have the <dns.h> header file. */
/* #undef HAVE_DNS_H */
/* Define to 1 if you have the `dns_search' function. */
/* #undef HAVE_DNS_SEARCH */
/* Define to 1 if you have the `dn_expand' function. */
#define HAVE_DN_EXPAND 1
/* Define to 1 if you have the `door_create' function. */
/* #undef HAVE_DOOR_CREATE */
/* Define if you have the function `ecalloc'. */
/* #undef HAVE_ECALLOC */
/* Define if you have the function `emalloc'. */
/* #undef HAVE_EMALLOC */
/* Define if you have the function `erealloc'. */
/* #undef HAVE_EREALLOC */
/* Define if you have the function `err'. */
#define HAVE_ERR 1
/* Define to 1 if you have the <errno.h> header file. */
#define HAVE_ERRNO_H 1
/* Define if you have the function `errx'. */
#define HAVE_ERRX 1
/* Define to 1 if you have the <err.h> header file. */
#define HAVE_ERR_H 1
/* Define if you have the function `estrdup'. */
/* #undef HAVE_ESTRDUP */
/* Define to 1 if you have the <execinfo.h> header file. */
/* #undef HAVE_EXECINFO_H */
/* Define if you have the function `fchown'. */
#define HAVE_FCHOWN 1
/* Define to 1 if you have the `fcntl' function. */
#define HAVE_FCNTL 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define if you have the function `flock'. */
#define HAVE_FLOCK 1
/* Define if you have the function `fnmatch'. */
#define HAVE_FNMATCH 1
/* Define to 1 if you have the <fnmatch.h> header file. */
#define HAVE_FNMATCH_H 1
/* Have -framework Security */
/* #undef HAVE_FRAMEWORK_SECURITY */
/* Define to 1 if you have the `freeaddrinfo' function. */
#define HAVE_FREEADDRINFO 1
/* Define if you have the function `freehostent'. */
#define HAVE_FREEHOSTENT 1
/* Define to 1 if you have the `gai_strerror' function. */
#define HAVE_GAI_STRERROR 1
/* Define if os support gcd. */
/* #undef HAVE_GCD */
/* Define to 1 if you have the <gdbm/ndbm.h> header file. */
/* #undef HAVE_GDBM_NDBM_H */
/* Define to 1 if you have the `getaddrinfo' function. */
#define HAVE_GETADDRINFO 1
/* Define to 1 if you have the `getconfattr' function. */
/* #undef HAVE_GETCONFATTR */
/* Define if you have the function `getcwd'. */
#define HAVE_GETCWD 1
/* Define if you have the function `getdtablesize'. */
#define HAVE_GETDTABLESIZE 1
/* Define if you have the function `getegid'. */
#define HAVE_GETEGID 1
/* Define if you have the function `geteuid'. */
#define HAVE_GETEUID 1
/* Define if you have the function `getgid'. */
#define HAVE_GETGID 1
/* Define to 1 if you have the `gethostbyname' function. */
#define HAVE_GETHOSTBYNAME 1
/* Define to 1 if you have the `gethostbyname2' function. */
#define HAVE_GETHOSTBYNAME2 1
/* Define if you have the function `gethostname'. */
#define HAVE_GETHOSTNAME 1
/* Define if you have the function `getifaddrs'. */
#define HAVE_GETIFADDRS 1
/* Define if you have the function `getipnodebyaddr'. */
#define HAVE_GETIPNODEBYADDR 1
/* Define if you have the function `getipnodebyname'. */
#define HAVE_GETIPNODEBYNAME 1
/* Define to 1 if you have the `getlogin' function. */
#define HAVE_GETLOGIN 1
/* Define if you have a working getmsg. */
/* #undef HAVE_GETMSG */
/* Define to 1 if you have the `getnameinfo' function. */
#define HAVE_GETNAMEINFO 1
/* Define if you have the function `getopt'. */
#define HAVE_GETOPT 1
/* Define to 1 if you have the `getpagesize' function. */
#define HAVE_GETPAGESIZE 1
/* Define to 1 if you have the `getpeereid' function. */
#define HAVE_GETPEEREID 1
/* Define to 1 if you have the `getpeerucred' function. */
/* #undef HAVE_GETPEERUCRED */
/* Define to 1 if you have the `getprogname' function. */
#define HAVE_GETPROGNAME 1
/* Define to 1 if you have the `getpwnam_r' function. */
#define HAVE_GETPWNAM_R 1
/* Define to 1 if you have the `getrlimit' function. */
#define HAVE_GETRLIMIT 1
/* Define to 1 if you have the `getsockopt' function. */
#define HAVE_GETSOCKOPT 1
/* Define to 1 if you have the `getspnam' function. */
/* #undef HAVE_GETSPNAM */
/* Define if you have the function `gettimeofday'. */
#define HAVE_GETTIMEOFDAY 1
/* Define to 1 if you have the `getudbnam' function. */
/* #undef HAVE_GETUDBNAM */
/* Define if you have the function `getuid'. */
#define HAVE_GETUID 1
/* Define if you have the function `getusershell'. */
#define HAVE_GETUSERSHELL 1
/* define if you have a glob() that groks GLOB_BRACE, GLOB_NOCHECK,
GLOB_QUOTE, GLOB_TILDE, and GLOB_LIMIT */
#define HAVE_GLOB 1
/* Define to 1 if you have the `grantpt' function. */
#define HAVE_GRANTPT 1
/* Define to 1 if you have the <grp.h> header file. */
#define HAVE_GRP_H 1
/* Define to 1 if you have the `hstrerror' function. */
#define HAVE_HSTRERROR 1
/* Define if you have the `h_errlist' variable. */
#define HAVE_H_ERRLIST 1
/* Define if you have the `h_errno' variable. */
#define HAVE_H_ERRNO 1
/* Define if you have the `h_nerr' variable. */
/* #undef HAVE_H_NERR */
/* Define to 1 if you have the <ifaddrs.h> header file. */
#define HAVE_IFADDRS_H 1
/* Define if you have the in6addr_loopback variable */
#define HAVE_IN6ADDR_LOOPBACK 1
/* define */
#define HAVE_INET_ATON 1
/* define */
#define HAVE_INET_NTOP 1
/* define */
#define HAVE_INET_PTON 1
/* Define if you have the function `initgroups'. */
#define HAVE_INITGROUPS 1
/* Define if you have the function `innetgr'. */
#define HAVE_INNETGR 1
/* Define to 1 if the system has the type `int16_t'. */
#define HAVE_INT16_T 1
/* Define to 1 if the system has the type `int32_t'. */
#define HAVE_INT32_T 1
/* Define to 1 if the system has the type `int64_t'. */
#define HAVE_INT64_T 1
/* Define to 1 if the system has the type `int8_t'. */
#define HAVE_INT8_T 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the <io.h> header file. */
/* #undef HAVE_IO_H */
/* Define if you have IPv6. */
#define HAVE_IPV6 1
/* Define if you have the function `iruserok'. */
#define HAVE_IRUSEROK 1
/* Define to 1 if you have the `issetugid' function. */
#define HAVE_ISSETUGID 1
/* Define if you want to use the Kerberos Credentials Manager. */
#define HAVE_KCM 1
/* Define to 1 if you have the <libutil.h> header file. */
#define HAVE_LIBUTIL_H 1
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define to 1 if you have the `loadquery' function. */
/* #undef HAVE_LOADQUERY */
/* Define to 1 if you have the <locale.h> header file. */
#define HAVE_LOCALE_H 1
/* Define if you have the function `localtime_r'. */
#define HAVE_LOCALTIME_R 1
/* Define to 1 if you have the `logout' function. */
/* #undef HAVE_LOGOUT */
/* Define to 1 if you have the `logwtmp' function. */
/* #undef HAVE_LOGWTMP */
/* Define to 1 if the system has the type `long long'. */
#define HAVE_LONG_LONG 1
/* Define if you have the function `lstat'. */
#define HAVE_LSTAT 1
/* Define to 1 if you have the <maillock.h> header file. */
/* #undef HAVE_MAILLOCK_H */
/* Define if you have the function `memmove'. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define if you have the function `mkstemp'. */
#define HAVE_MKSTEMP 1
/* Define to 1 if you have the `mktime' function. */
#define HAVE_MKTIME 1
/* Define to 1 if you have a working `mmap' system call. */
#define HAVE_MMAP 1
/* define if you have a ndbm library */
#define HAVE_NDBM 1
/* Define to 1 if you have the <ndbm.h> header file. */
#define HAVE_NDBM_H 1
/* Define to 1 if you have the <netdb.h> header file. */
#define HAVE_NETDB_H 1
/* Define to 1 if you have the <netgroup.h> header file. */
/* #undef HAVE_NETGROUP_H */
/* Define to 1 if you have the <netinet6/in6.h> header file. */
/* #undef HAVE_NETINET6_IN6_H */
/* Define to 1 if you have the <netinet6/in6_var.h> header file. */
/* #undef HAVE_NETINET6_IN6_VAR_H */
/* Define to 1 if you have the <netinet/in6.h> header file. */
/* #undef HAVE_NETINET_IN6_H */
/* Define to 1 if you have the <netinet/in6_machtypes.h> header file. */
/* #undef HAVE_NETINET_IN6_MACHTYPES_H */
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if you have the <netinet/in_systm.h> header file. */
#define HAVE_NETINET_IN_SYSTM_H 1
/* Define to 1 if you have the <netinet/ip.h> header file. */
#define HAVE_NETINET_IP_H 1
/* Define to 1 if you have the <netinet/tcp.h> header file. */
#define HAVE_NETINET_TCP_H 1
/* Define to 1 if you have the <net/if.h> header file. */
#define HAVE_NET_IF_H 1
/* Define if NDBM really is DB (creates files *.db) */
#define HAVE_NEW_DB 1
/* Define to 1 if you have the `on_exit' function. */
/* #undef HAVE_ON_EXIT */
/* Define to 1 if you have the `openpty' function. */
#define HAVE_OPENPTY 1
/* define to use openssl's libcrypto */
#define HAVE_OPENSSL 1
/* Define to enable basic OSF C2 support. */
/* #undef HAVE_OSFC2 */
/* Define to 1 if you have the <paths.h> header file. */
#define HAVE_PATHS_H 1
/* Define to 1 if you have the `pidfile' function. */
/* #undef HAVE_PIDFILE */
/* Define to 1 if you have the `poll' function. */
#define HAVE_POLL 1
/* Define to 1 if you have the <poll.h> header file. */
#define HAVE_POLL_H 1
/* Define to 1 if you have the <pthread.h> header file. */
#define HAVE_PTHREAD_H 1
/* Define to 1 if you have the `ptsname' function. */
#define HAVE_PTSNAME 1
/* Define to 1 if you have the <pty.h> header file. */
/* #undef HAVE_PTY_H */
/* Define if you have the function `putenv'. */
#define HAVE_PUTENV 1
/* Define to 1 if you have the <pwd.h> header file. */
#define HAVE_PWD_H 1
/* Define to 1 if you have the `rand' function. */
#define HAVE_RAND 1
/* Define to 1 if you have the `random' function. */
#define HAVE_RANDOM 1
/* Define if you have the function `rcmd'. */
#define HAVE_RCMD 1
/* Define if you have a readline compatible library. */
#define HAVE_READLINE 1
/* Define to 1 if you have the
<[readline.h])[][]_AH_CHECK_HEADER([readline/readline.h]> header file. */
/* #undef HAVE_READLINE_H */
/* Define to 1 if you have the <readline/readline.h > header file. */
/* #undef HAVE_READLINE_READLINE_H_ */
/* Define if you have the function `readv'. */
#define HAVE_READV 1
/* Define if you have the function `recvmsg'. */
#define HAVE_RECVMSG 1
/* Define to 1 if you have the <resolv.h> header file. */
#define HAVE_RESOLV_H 1
/* Define to 1 if you have the `res_ndestroy' function. */
#define HAVE_RES_NDESTROY 1
/* Define to 1 if you have the `res_nsearch' function. */
#define HAVE_RES_NSEARCH 1
/* Define to 1 if you have the `res_search' function. */
#define HAVE_RES_SEARCH 1
/* Define to 1 if you have the `revoke' function. */
#define HAVE_REVOKE 1
/* Define to 1 if you have the <rpcsvc/ypclnt.h> header file. */
#define HAVE_RPCSVC_YPCLNT_H 1
/* Define to 1 if you have the <sac.h> header file. */
/* #undef HAVE_SAC_H */
/* Define to 1 if the system has the type `sa_family_t'. */
#define HAVE_SA_FAMILY_T 1
/* Define if you want support for cache in sqlite. */
#undef HAVE_SCC
/* Define to 1 if you have the <search.h> header file. */
#define HAVE_SEARCH_H 1
/* Define to 1 if you have the <security/pam_modules.h> header file. */
#define HAVE_SECURITY_PAM_MODULES_H 1
/* Define to 1 if you have the `select' function. */
#define HAVE_SELECT 1
/* Define if you have the function `sendmsg'. */
#define HAVE_SENDMSG 1
/* Define if you have the function `setegid'. */
#define HAVE_SETEGID 1
/* Define if you have the function `setenv'. */
#define HAVE_SETENV 1
/* Define if you have the function `seteuid'. */
#define HAVE_SETEUID 1
/* Define to 1 if you have the `setitimer' function. */
#define HAVE_SETITIMER 1
/* Define to 1 if you have the `setlim' function. */
/* #undef HAVE_SETLIM */
/* Define to 1 if you have the `setlogin' function. */
#define HAVE_SETLOGIN 1
/* Define to 1 if you have the `setpcred' function. */
/* #undef HAVE_SETPCRED */
/* Define to 1 if you have the `setpgid' function. */
#define HAVE_SETPGID 1
/* Define to 1 if you have the `setproctitle' function. */
#define HAVE_SETPROCTITLE 1
/* Define to 1 if you have the `setprogname' function. */
#define HAVE_SETPROGNAME 1
/* Define to 1 if you have the `setregid' function. */
#define HAVE_SETREGID 1
/* Define to 1 if you have the `setresgid' function. */
#define HAVE_SETRESGID 1
/* Define to 1 if you have the `setresuid' function. */
#define HAVE_SETRESUID 1
/* Define to 1 if you have the `setreuid' function. */
#define HAVE_SETREUID 1
/* Define to 1 if you have the `setsid' function. */
#define HAVE_SETSID 1
/* Define to 1 if you have the `setsockopt' function. */
#define HAVE_SETSOCKOPT 1
/* Define to 1 if you have the `setutent' function. */
/* #undef HAVE_SETUTENT */
/* Define to 1 if you have the `sgi_getcapabilitybyname' function. */
/* #undef HAVE_SGI_GETCAPABILITYBYNAME */
/* Define to 1 if you have the <sgtty.h> header file. */
/* #undef HAVE_SGTTY_H */
/* Define to 1 if you have the <shadow.h> header file. */
/* #undef HAVE_SHADOW_H */
/* Define to 1 if you have the <siad.h> header file. */
/* #undef HAVE_SIAD_H */
/* Define to 1 if you have the `sigaction' function. */
#define HAVE_SIGACTION 1
/* Define to 1 if you have the <signal.h> header file. */
#define HAVE_SIGNAL_H 1
/* define if you have a working snprintf */
#define HAVE_SNPRINTF 1
/* Define to 1 if you have the `socket' function. */
#define HAVE_SOCKET 1
/* Define to 1 if the system has the type `socklen_t'. */
#define HAVE_SOCKLEN_T 1
/* Define if you want support for sqlite in Heimdal. */
#define HAVE_SQLITE3 1
/* Define to 1 if the system has the type `ssize_t'. */
#define HAVE_SSIZE_T 1
/* Define to 1 if you have the <standards.h> header file. */
/* #undef HAVE_STANDARDS_H */
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define if you have the function `strcasecmp'. */
#define HAVE_STRCASECMP 1
/* Define if you have the function `strdup'. */
#define HAVE_STRDUP 1
/* Define if you have the function `strerror'. */
#define HAVE_STRERROR 1
/* Define if you have the function strerror_r. */
#define HAVE_STRERROR_R 1
/* Define if you have the function `strftime'. */
#define HAVE_STRFTIME 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define if you have the function `strlcat'. */
#define HAVE_STRLCAT 1
/* Define if you have the function `strlcpy'. */
#define HAVE_STRLCPY 1
/* Define if you have the function `strlwr'. */
/* #undef HAVE_STRLWR */
/* Define if you have the function `strncasecmp'. */
#define HAVE_STRNCASECMP 1
/* Define if you have the function `strndup'. */
#define HAVE_STRNDUP 1
/* Define if you have the function `strnlen'. */
#define HAVE_STRNLEN 1
/* Define to 1 if you have the <stropts.h> header file. */
/* #undef HAVE_STROPTS_H */
/* Define if you have the function `strptime'. */
#define HAVE_STRPTIME 1
/* Define if you have the function `strsep'. */
#define HAVE_STRSEP 1
/* Define if you have the function `strsep_copy'. */
/* #undef HAVE_STRSEP_COPY */
/* Define to 1 if you have the `strstr' function. */
#define HAVE_STRSTR 1
/* Define to 1 if you have the `strsvis' function. */
/* #undef HAVE_STRSVIS */
/* Define to 1 if you have the `strsvisx' function. */
/* #undef HAVE_STRSVISX */
/* Define if you have the function `strtok_r'. */
#define HAVE_STRTOK_R 1
/* Define to 1 if the system has the type `struct addrinfo'. */
#define HAVE_STRUCT_ADDRINFO 1
/* Define to 1 if the system has the type `struct ifaddrs'. */
#define HAVE_STRUCT_IFADDRS 1
/* Define to 1 if the system has the type `struct iovec'. */
#define HAVE_STRUCT_IOVEC 1
/* Define to 1 if the system has the type `struct msghdr'. */
#define HAVE_STRUCT_MSGHDR 1
/* Define to 1 if the system has the type `struct sockaddr'. */
#define HAVE_STRUCT_SOCKADDR 1
/* Define if struct sockaddr has field sa_len. */
#define HAVE_STRUCT_SOCKADDR_SA_LEN 1
/* Define to 1 if the system has the type `struct sockaddr_storage'. */
#define HAVE_STRUCT_SOCKADDR_STORAGE 1
/* define if you have struct spwd */
/* #undef HAVE_STRUCT_SPWD */
/* Define if struct tm has field tm_gmtoff. */
#define HAVE_STRUCT_TM_TM_GMTOFF 1
/* Define if struct tm has field tm_zone. */
#define HAVE_STRUCT_TM_TM_ZONE 1
/* Define if struct utmpx has field ut_exit. */
/* #undef HAVE_STRUCT_UTMPX_UT_EXIT */
/* Define if struct utmpx has field ut_host. */
#define HAVE_STRUCT_UTMPX_UT_HOST 1
/* Define if struct utmpx has field ut_id. */
#define HAVE_STRUCT_UTMPX_UT_ID 1
/* Define if struct utmpx has field ut_line. */
#define HAVE_STRUCT_UTMPX_UT_LINE 1
/* Define if struct utmpx has field ut_pid. */
#define HAVE_STRUCT_UTMPX_UT_PID 1
/* Define if struct utmpx has field ut_syslen. */
/* #undef HAVE_STRUCT_UTMPX_UT_SYSLEN */
/* Define if struct utmpx has field ut_tv. */
#define HAVE_STRUCT_UTMPX_UT_TV 1
/* Define if struct utmpx has field ut_type. */
#define HAVE_STRUCT_UTMPX_UT_TYPE 1
/* Define if struct utmpx has field ut_user. */
#define HAVE_STRUCT_UTMPX_UT_USER 1
/* Define if struct utmp has field ut_addr. */
/* #undef HAVE_STRUCT_UTMP_UT_ADDR */
/* Define if struct utmp has field ut_host. */
/* #undef HAVE_STRUCT_UTMP_UT_HOST */
/* Define if struct utmp has field ut_id. */
/* #undef HAVE_STRUCT_UTMP_UT_ID */
/* Define if struct utmp has field ut_pid. */
/* #undef HAVE_STRUCT_UTMP_UT_PID */
/* Define if struct utmp has field ut_type. */
/* #undef HAVE_STRUCT_UTMP_UT_TYPE */
/* Define if struct utmp has field ut_user. */
/* #undef HAVE_STRUCT_UTMP_UT_USER */
/* define if struct winsize is declared in sys/termios.h */
#define HAVE_STRUCT_WINSIZE 1
/* Define to 1 if you have the `strunvis' function. */
#define HAVE_STRUNVIS 1
/* Define if you have the function `strupr'. */
/* #undef HAVE_STRUPR */
/* Define to 1 if you have the `strvis' function. */
#define HAVE_STRVIS 1
/* Define to 1 if you have the `strvisx' function. */
#define HAVE_STRVISX 1
/* Define to 1 if you have the `svis' function. */
#define HAVE_SVIS 1
/* Define if you have the function `swab'. */
#define HAVE_SWAB 1
/* Define to 1 if you have the `sysconf' function. */
#define HAVE_SYSCONF 1
/* Define to 1 if you have the `sysctl' function. */
#define HAVE_SYSCTL 1
/* Define to 1 if you have the `syslog' function. */
#define HAVE_SYSLOG 1
/* Define to 1 if you have the <syslog.h> header file. */
#define HAVE_SYSLOG_H 1
/* Define to 1 if you have the <sys/bitypes.h> header file. */
/* #undef HAVE_SYS_BITYPES_H */
/* Define to 1 if you have the <sys/bswap.h> header file. */
/* #undef HAVE_SYS_BSWAP_H */
/* Define to 1 if you have the <sys/capability.h> header file. */
#define HAVE_SYS_CAPABILITY_H 1
/* Define to 1 if you have the <sys/category.h> header file. */
/* #undef HAVE_SYS_CATEGORY_H */
/* Define to 1 if you have the <sys/file.h> header file. */
#define HAVE_SYS_FILE_H 1
/* Define to 1 if you have the <sys/filio.h> header file. */
#define HAVE_SYS_FILIO_H 1
/* Define to 1 if you have the <sys/ioccom.h> header file. */
#define HAVE_SYS_IOCCOM_H 1
/* Define to 1 if you have the <sys/ioctl.h> header file. */
#define HAVE_SYS_IOCTL_H 1
/* Define to 1 if you have the <sys/mman.h> header file. */
#define HAVE_SYS_MMAN_H 1
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/proc.h> header file. */
#define HAVE_SYS_PROC_H 1
/* Define to 1 if you have the <sys/ptyio.h> header file. */
/* #undef HAVE_SYS_PTYIO_H */
/* Define to 1 if you have the <sys/ptyvar.h> header file. */
/* #undef HAVE_SYS_PTYVAR_H */
/* Define to 1 if you have the <sys/pty.h> header file. */
/* #undef HAVE_SYS_PTY_H */
/* Define to 1 if you have the <sys/resource.h> header file. */
#define HAVE_SYS_RESOURCE_H 1
/* Define to 1 if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/sockio.h> header file. */
#define HAVE_SYS_SOCKIO_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/stream.h> header file. */
/* #undef HAVE_SYS_STREAM_H */
/* Define to 1 if you have the <sys/stropts.h> header file. */
/* #undef HAVE_SYS_STROPTS_H */
/* Define to 1 if you have the <sys/strtty.h> header file. */
/* #undef HAVE_SYS_STRTTY_H */
/* Define to 1 if you have the <sys/str_tty.h> header file. */
/* #undef HAVE_SYS_STR_TTY_H */
/* Define to 1 if you have the <sys/syscall.h> header file. */
#define HAVE_SYS_SYSCALL_H 1
/* Define to 1 if you have the <sys/sysctl.h> header file. */
#define HAVE_SYS_SYSCTL_H 1
/* Define to 1 if you have the <sys/termio.h> header file. */
/* #undef HAVE_SYS_TERMIO_H */
/* Define to 1 if you have the <sys/timeb.h> header file. */
#define HAVE_SYS_TIMEB_H 1
/* Define to 1 if you have the <sys/times.h> header file. */
#define HAVE_SYS_TIMES_H 1
/* Define to 1 if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define to 1 if you have the <sys/tty.h> header file. */
#define HAVE_SYS_TTY_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/ucred.h> header file. */
#define HAVE_SYS_UCRED_H 1
/* Define to 1 if you have the <sys/uio.h> header file. */
#define HAVE_SYS_UIO_H 1
/* Define to 1 if you have the <sys/un.h> header file. */
#define HAVE_SYS_UN_H 1
/* Define to 1 if you have the <sys/utsname.h> header file. */
#define HAVE_SYS_UTSNAME_H 1
/* Define to 1 if you have the <sys/wait.h> header file. */
#define HAVE_SYS_WAIT_H 1
/* Define to 1 if you have the `tdelete' function. */
#define HAVE_TDELETE 1
/* Define to 1 if you have the <termcap.h> header file. */
#define HAVE_TERMCAP_H 1
/* Define to 1 if you have the <termios.h> header file. */
#define HAVE_TERMIOS_H 1
/* Define to 1 if you have the <termio.h> header file. */
/* #undef HAVE_TERMIO_H */
/* Define to 1 if you have the <term.h> header file. */
#define HAVE_TERM_H 1
/* Define to 1 if you have the `tfind' function. */
#define HAVE_TFIND 1
/* Define to 1 if you have the `tgetent' function. */
#define HAVE_TGETENT 1
/* Define if you have the function `timegm'. */
#define HAVE_TIMEGM 1
/* Define if you have the `timezone' variable. */
#define HAVE_TIMEZONE 1
/* Define to 1 if you have the <time.h> header file. */
#define HAVE_TIME_H 1
/* Define to 1 if you have the <tmpdir.h> header file. */
/* #undef HAVE_TMPDIR_H */
/* Define if you have the function `tsearch'. */
#define HAVE_TSEARCH 1
/* Define to 1 if you have the `ttyname' function. */
#define HAVE_TTYNAME 1
/* Define to 1 if you have the `ttyslot' function. */
/* #undef HAVE_TTYSLOT */
/* Define to 1 if you have the `twalk' function. */
#define HAVE_TWALK 1
/* Define to 1 if you have the <udb.h> header file. */
/* #undef HAVE_UDB_H */
/* Define to 1 if the system has the type `uint16_t'. */
#define HAVE_UINT16_T 1
/* Define to 1 if the system has the type `uint32_t'. */
#define HAVE_UINT32_T 1
/* Define to 1 if the system has the type `uint64_t'. */
#define HAVE_UINT64_T 1
/* Define to 1 if the system has the type `uint8_t'. */
#define HAVE_UINT8_T 1
/* Define to 1 if the system has the type `uintptr_t'. */
#define HAVE_UINTPTR_T 1
/* Define to 1 if you have the `umask' function. */
#define HAVE_UMASK 1
/* Define to 1 if you have the `uname' function. */
#define HAVE_UNAME 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `unlockpt' function. */
#define HAVE_UNLOCKPT 1
/* Define if you have the function `unsetenv'. */
#define HAVE_UNSETENV 1
/* Define to 1 if you have the `unvis' function. */
#define HAVE_UNVIS 1
/* Define to 1 if you have the <userconf.h> header file. */
/* #undef HAVE_USERCONF_H */
/* Define to 1 if you have the <usersec.h> header file. */
/* #undef HAVE_USERSEC_H */
/* Define to 1 if you have the <util.h> header file. */
/* #undef HAVE_UTIL_H */
/* Define to 1 if you have the <utmpx.h> header file. */
#define HAVE_UTMPX_H 1
/* Define to 1 if you have the <utmp.h> header file. */
/* #undef HAVE_UTMP_H */
/* Define to 1 if the system has the type `u_int16_t'. */
#define HAVE_U_INT16_T 1
/* Define to 1 if the system has the type `u_int32_t'. */
#define HAVE_U_INT32_T 1
/* Define to 1 if the system has the type `u_int64_t'. */
#define HAVE_U_INT64_T 1
/* Define to 1 if the system has the type `u_int8_t'. */
#define HAVE_U_INT8_T 1
/* Define to 1 if you have the `vasnprintf' function. */
/* #undef HAVE_VASNPRINTF */
/* Define to 1 if you have the `vasprintf' function. */
#define HAVE_VASPRINTF 1
/* Define if you have the function `verr'. */
#define HAVE_VERR 1
/* Define if you have the function `verrx'. */
#define HAVE_VERRX 1
/* Define to 1 if you have the `vhangup' function. */
/* #undef HAVE_VHANGUP */
/* Define to 1 if you have the `vis' function. */
#define HAVE_VIS 1
/* Define to 1 if you have the <vis.h> header file. */
#define HAVE_VIS_H 1
/* define if you have a working vsnprintf */
#define HAVE_VSNPRINTF 1
/* Define if you have the function `vsyslog'. */
#define HAVE_VSYSLOG 1
/* Define if you have the function `vwarn'. */
#define HAVE_VWARN 1
/* Define if you have the function `vwarnx'. */
#define HAVE_VWARNX 1
/* Define if you have the function `warn'. */
#define HAVE_WARN 1
/* Define if you have the function `warnx'. */
#define HAVE_WARNX 1
/* Define to 1 if you have the <winsock2.h> header file. */
/* #undef HAVE_WINSOCK2_H */
/* Define if you have the function `writev'. */
#define HAVE_WRITEV 1
/* Define to 1 if you have the <ws2tcpip.h> header file. */
/* #undef HAVE_WS2TCPIP_H */
/* define if struct winsize has ws_xpixel */
#define HAVE_WS_XPIXEL 1
/* define if struct winsize has ws_ypixel */
#define HAVE_WS_YPIXEL 1
/* Define to 1 if you have the `XauFileName' function. */
/* #undef HAVE_XAUFILENAME */
/* Define to 1 if you have the `XauReadAuth' function. */
/* #undef HAVE_XAUREADAUTH */
/* Define to 1 if you have the `XauWriteAuth' function. */
/* #undef HAVE_XAUWRITEAUTH */
/* Define to 1 if you have the `yp_get_default_domain' function. */
#define HAVE_YP_GET_DEFAULT_DOMAIN 1
/* Define to 1 if you have the `_getpty' function. */
/* #undef HAVE__GETPTY */
/* Define if you have the `_res' variable. */
#define HAVE__RES 1
/* Define to 1 if you have the `_scrsize' function. */
/* #undef HAVE__SCRSIZE */
/* define if your compiler has __attribute__ */
#define HAVE___ATTRIBUTE__ 1
/* Define if you have the `__progname' variable. */
#define HAVE___PROGNAME 1
/* have __sync_add_and_fetch */
#if defined(__FreeBSD__) && (defined(__arm__) || defined(__mips__))
#undef HAVE___SYNC_ADD_AND_FETCH /* Not supported on FreeBSD/arm */
#else
#define HAVE___SYNC_ADD_AND_FETCH 1
#endif
/* Define if you want support for weak crypto */
#define HEIM_WEAK_CRYPTO 1
/* Define if you have the hesiod package. */
/* #undef HESIOD */
/* Enable Kerberos 5 support in applications. */
#define KRB5 1
/* Define to enable kx509. */
#define KX509 1
/* path to lib */
#define LIBDIR "/usr/lib"
/* Define if you have the libedit package. */
/* #undef LIBEDIT */
/* path to libexec */
#define LIBEXECDIR "/usr/libexec"
/* Define if you have the libintl package. */
/* #undef LIBINTL */
/* path to localstate */
#define LOCALSTATEDIR "/var/heimdal"
/* Define to the sub-directory in which libtool stores uninstalled libraries.
*/
#define LT_OBJDIR ".libs/"
/* define if the system is missing a prototype for asnprintf() */
#define NEED_ASNPRINTF_PROTO 1
/* define if the system is missing a prototype for asprintf() */
/* #undef NEED_ASPRINTF_PROTO */
/* define if the system is missing a prototype for crypt() */
/* #undef NEED_CRYPT_PROTO */
/* define if the system is missing a prototype for daemon() */
#define NEED_DAEMON_PROTO 1
/* define if the system is missing a prototype for gethostname() */
/* #undef NEED_GETHOSTNAME_PROTO */
/* define if the system is missing a prototype for getusershell() */
/* #undef NEED_GETUSERSHELL_PROTO */
/* define if the system is missing a prototype for glob() */
/* #undef NEED_GLOB_PROTO */
/* define if the system is missing a prototype for hstrerror() */
/* #undef NEED_HSTRERROR_PROTO */
/* define if the system is missing a prototype for inet_aton() */
/* #undef NEED_INET_ATON_PROTO */
/* define if the system is missing a prototype for iruserok() */
/* #undef NEED_IRUSEROK_PROTO */
/* define if the system is missing a prototype for mkstemp() */
/* #undef NEED_MKSTEMP_PROTO */
/* if your qsort is not a stable sort */
/* #undef NEED_QSORT */
/* define if the system is missing a prototype for SecKeyGetCSPHandle() */
/* #undef NEED_SECKEYGETCSPHANDLE_PROTO */
/* define if the system is missing a prototype for setenv() */
/* #undef NEED_SETENV_PROTO */
/* define if the system is missing a prototype for snprintf() */
/* #undef NEED_SNPRINTF_PROTO */
/* define if the system is missing a prototype for strndup() */
/* #undef NEED_STRNDUP_PROTO */
/* define if the system is missing a prototype for strsep() */
/* #undef NEED_STRSEP_PROTO */
/* define if the system is missing a prototype for strsvisx() */
#define NEED_STRSVISX_PROTO 1
/* define if the system is missing a prototype for strsvis() */
#define NEED_STRSVIS_PROTO 1
/* define if the system is missing a prototype for strtok_r() */
/* #undef NEED_STRTOK_R_PROTO */
/* define if the system is missing a prototype for strunvis() */
/* #undef NEED_STRUNVIS_PROTO */
/* define if the system is missing a prototype for strvisx() */
/* #undef NEED_STRVISX_PROTO */
/* define if the system is missing a prototype for strvis() */
/* #undef NEED_STRVIS_PROTO */
/* define if the system is missing a prototype for svis() */
#define NEED_SVIS_PROTO 1
/* define if the system is missing a prototype for unsetenv() */
/* #undef NEED_UNSETENV_PROTO */
/* define if the system is missing a prototype for unvis() */
/* #undef NEED_UNVIS_PROTO */
/* define if the system is missing a prototype for vasnprintf() */
#define NEED_VASNPRINTF_PROTO 1
/* define if the system is missing a prototype for vasprintf() */
/* #undef NEED_VASPRINTF_PROTO */
/* define if the system is missing a prototype for vis() */
/* #undef NEED_VIS_PROTO */
/* define if the system is missing a prototype for vsnprintf() */
/* #undef NEED_VSNPRINTF_PROTO */
/* Define if you don't wan't support for AFS. */
/* #undef NO_AFS */
/* Define to 1 if your C compiler doesn't accept -c and -o together. */
/* #undef NO_MINUS_C_MINUS_O */
/* Define if you don't want to use mmap. */
/* #undef NO_MMAP */
/* Define this to enable old environment option in telnet. */
#define OLD_ENVIRON 1
/* Define if you have the openldap package. */
/* #undef OPENLDAP */
/* Define if you want support for hdb ldap module */
/* #undef OPENLDAP_MODULE */
/* define if prototype of openlog is compatible with void openlog(const char
*, int, int) */
#define OPENLOG_PROTO_COMPATIBLE 1
/* Define if you want OTP support in applications. */
#define OTP 1
/* Name of package */
#define PACKAGE "heimdal"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "heimdal-bugs@h5l.org"
/* Define to the full name of this package. */
#define PACKAGE_NAME "Heimdal"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "Heimdal 1.5.2"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "heimdal"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "1.5.2"
/* Define to enable PKINIT. */
#define PKINIT 1
/* Define if getlogin has POSIX flavour (and not BSD). */
/* #undef POSIX_GETLOGIN */
/* Define if getpwnam_r has POSIX flavour. */
#define POSIX_GETPWNAM_R 1
/* Define if you have the readline package. */
/* #undef READLINE */
/* Define as the return type of signal handlers (`int' or `void'). */
#define RETSIGTYPE void
/* path to sbin */
#define SBINDIR "/usr/sbin"
/* Define if you want to use samba socket wrappers. */
/* #undef SOCKET_WRAPPER_REPLACE */
/* Define if you have the sqlite3 package. */
/* #undef SQLITE3 */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define if you have streams ptys. */
/* #undef STREAMSPTY */
/* define if prototype of strerror_r is compatible with int strerror_r(int,
char *, size_t) */
#define STRERROR_R_PROTO_COMPATIBLE 1
/* Define if os support want to detach is daemonens. */
#define SUPPORT_DETACH 1
/* Enable use of inetd style startup. */
#define SUPPORT_INETD 1
/* path to sysconf */
#define SYSCONFDIR "/etc"
/* Define to what version of SunOS you are running. */
/* #undef SunOS */
/* Define to 1 if you can safely include both <sys/time.h> and <time.h>. */
#define TIME_WITH_SYS_TIME 1
/* Define to 1 if your <sys/time.h> declares `struct tm'. */
/* #undef TM_IN_SYS_TIME */
/* Version number of package */
#define VERSION "1.5.2"
/* Define if signal handlers return void. */
#define VOID_RETSIGTYPE 1
/* define if target is big endian */
/* #undef WORDS_BIGENDIAN */
/* Define to 1 if the X Window System is missing or not being used. */
#define X_DISPLAY_MISSING 1
/* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a
`char[]'. */
#define YYTEXT_POINTER 1
/* Required for functional/sane headers on AIX */
/* #undef _ALL_SOURCE */
/* Number of bits in a file offset, on hosts where this is settable. */
/* #undef _FILE_OFFSET_BITS */
/* Define to enable extensions on glibc-based systems such as Linux. */
#define _GNU_SOURCE 1
/* Define for large files, on AIX-style hosts. */
/* #undef _LARGE_FILES */
/* Define to get POSIX getpwnam_r in some systems. */
/* #undef _POSIX_PTHREAD_SEMANTICS */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef gid_t */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define this to what the type mode_t should be. */
/* #undef mode_t */
/* Define to `long int' if <sys/types.h> does not define. */
/* #undef off_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* Path name delimiter */
#define rk_PATH_DELIM '/'
/* Define this to what the type sig_atomic_t should be. */
/* #undef sig_atomic_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef uid_t */
#ifdef _AIX
/* XXX this is gross, but kills about a gazillion warnings */
struct ether_addr;
struct sockaddr;
struct sockaddr_dl;
struct sockaddr_in;
#endif
#ifdef __APPLE__
#include <AvailabilityMacros.h>
#endif
#ifdef ROKEN_RENAME
#include "roken_rename.h"
#endif
#ifdef VOID_RETSIGTYPE
#define SIGRETURN(x) return
#else
#define SIGRETURN(x) return (RETSIGTYPE)(x)
#endif
#ifdef BROKEN_REALLOC
#define realloc(X, Y) rk_realloc((X), (Y))
#endif
#ifdef ENDIANESS_IN_SYS_PARAM_H
# include <sys/types.h>
# include <sys/param.h>
# if BYTE_ORDER == BIG_ENDIAN
# define WORDS_BIGENDIAN 1
# endif
#endif
/* Set this to the default system lead string for telnetd
* can contain %-escapes: %s=sysname, %m=machine, %r=os-release
* %v=os-version, %t=tty, %h=hostname, %d=date and time
*/
/* #undef USE_IM */
/* Used with login -p */
/* #undef LOGIN_ARGS */
/* set this to a sensible login */
#ifndef LOGIN_PATH
#define LOGIN_PATH BINDIR "/login"
#endif
diff --git a/kerberos5/include/crypto-headers.h b/kerberos5/include/crypto-headers.h
index 625c8083a6eb..3ae0d9624ffd 100644
--- a/kerberos5/include/crypto-headers.h
+++ b/kerberos5/include/crypto-headers.h
@@ -1,22 +1,21 @@
-/* $FreeBSD$ */
#ifndef __crypto_headers_h__
#define __crypto_headers_h__
#include <openssl/evp.h>
#include <openssl/des.h>
#include <openssl/rc4.h>
#include <openssl/rc2.h>
#include <openssl/md4.h>
#include <openssl/md5.h>
#include <openssl/sha.h>
#include <openssl/ui.h>
#include <openssl/rand.h>
#include <openssl/engine.h>
#include <openssl/pkcs12.h>
#include <openssl/pem.h>
#include <openssl/hmac.h>
#include <openssl/ec.h>
#include <openssl/ecdsa.h>
#include <openssl/ecdh.h>
#endif /* __crypto_headers_h__ */
diff --git a/kerberos5/include/krb5-types.h b/kerberos5/include/krb5-types.h
index 32b20fae88ca..8d228ecc2d4a 100644
--- a/kerberos5/include/krb5-types.h
+++ b/kerberos5/include/krb5-types.h
@@ -1,63 +1,62 @@
/*
* generic krb5-types.h for cross compiling, assume system is posix/sus
*/
-/* $FreeBSD$ */
#ifndef __krb5_types_h__
#define __krb5_types_h__
#include <inttypes.h>
#include <sys/types.h>
#include <sys/socket.h>
typedef socklen_t krb5_socklen_t;
#include <unistd.h>
typedef ssize_t krb5_ssize_t;
#if !defined(__has_extension)
#define __has_extension(x) 0
#endif
#define KRB5TYPES_REQUIRE_GNUC(m,n,p) \
(((__GNUC__ * 10000) + (__GNUC_MINOR__ * 100) + __GNUC_PATCHLEVEL__) >= \
(((m) * 10000) + ((n) * 100) + (p)))
#ifndef HEIMDAL_DEPRECATED
#if __has_extension(deprecated) || KRB5TYPES_REQUIRE_GNUC(3,1,0)
#define HEIMDAL_DEPRECATED __attribute__((deprecated))
#elif defined(_MSC_VER) && (_MSC_VER>1200)
#define HEIMDAL_DEPRECATED __declspec(deprecated)
#else
#define HEIMDAL_DEPRECATED
#endif
#endif
#ifndef HEIMDAL_PRINTF_ATTRIBUTE
#if __has_extension(format) || KRB5TYPES_REQUIRE_GNUC(3,1,0)
#define HEIMDAL_PRINTF_ATTRIBUTE(x) __attribute__((format x))
#else
#define HEIMDAL_PRINTF_ATTRIBUTE(x)
#endif
#endif
#ifndef HEIMDAL_NORETURN_ATTRIBUTE
#if __has_extension(noreturn) || KRB5TYPES_REQUIRE_GNUC(3,1,0)
#define HEIMDAL_NORETURN_ATTRIBUTE __attribute__((noreturn))
#else
#define HEIMDAL_NORETURN_ATTRIBUTE
#endif
#endif
#ifndef HEIMDAL_UNUSED_ATTRIBUTE
#if __has_extension(unused) || KRB5TYPES_REQUIRE_GNUC(3,1,0)
#define HEIMDAL_UNUSED_ATTRIBUTE __attribute__((unused))
#else
#define HEIMDAL_UNUSED_ATTRIBUTE
#endif
#endif
typedef int krb5_socket_t;
#endif /* __krb5_types_h__ */
diff --git a/kerberos5/include/version.h b/kerberos5/include/version.h
index ee4d93db1947..de3758e47ffa 100644
--- a/kerberos5/include/version.h
+++ b/kerberos5/include/version.h
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
#ifndef VERSION_HIDDEN
#define VERSION_HIDDEN
#endif
VERSION_HIDDEN const char *heimdal_long_version = "@(#)$Version: Heimdal 1.5.2 (FreeBSD) $";
VERSION_HIDDEN const char *heimdal_version = "Heimdal 1.5.2";
diff --git a/kerberos5/lib/libgssapi_krb5/gss_oid.c b/kerberos5/lib/libgssapi_krb5/gss_oid.c
index d359afae4d31..a52c66abbc89 100644
--- a/kerberos5/lib/libgssapi_krb5/gss_oid.c
+++ b/kerberos5/lib/libgssapi_krb5/gss_oid.c
@@ -1,227 +1,226 @@
/* Generated file */
-/* $FreeBSD$ */
#include <gssapi/gssapi.h>
#include <roken.h>
#include "config.h"
/* GSS_KRB5_COPY_CCACHE_X - 1.2.752.43.13.1 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_copy_ccache_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x01") };
/* GSS_KRB5_GET_TKT_FLAGS_X - 1.2.752.43.13.2 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_tkt_flags_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x02") };
/* GSS_KRB5_EXTRACT_AUTHZ_DATA_FROM_SEC_CONTEXT_X - 1.2.752.43.13.3 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_extract_authz_data_from_sec_context_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x03") };
/* GSS_KRB5_COMPAT_DES3_MIC_X - 1.2.752.43.13.4 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_compat_des3_mic_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x04") };
/* GSS_KRB5_REGISTER_ACCEPTOR_IDENTITY_X - 1.2.752.43.13.5 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_register_acceptor_identity_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x05") };
/* GSS_KRB5_EXPORT_LUCID_CONTEXT_X - 1.2.752.43.13.6 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_export_lucid_context_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x06") };
/* GSS_KRB5_EXPORT_LUCID_CONTEXT_V1_X - 1.2.752.43.13.6.1 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_export_lucid_context_v1_x_oid_desc = { 7, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x06\x01") };
/* GSS_KRB5_SET_DNS_CANONICALIZE_X - 1.2.752.43.13.7 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_set_dns_canonicalize_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x07") };
/* GSS_KRB5_GET_SUBKEY_X - 1.2.752.43.13.8 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_subkey_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x08") };
/* GSS_KRB5_GET_INITIATOR_SUBKEY_X - 1.2.752.43.13.9 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_initiator_subkey_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x09") };
/* GSS_KRB5_GET_ACCEPTOR_SUBKEY_X - 1.2.752.43.13.10 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_acceptor_subkey_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x0a") };
/* GSS_KRB5_SEND_TO_KDC_X - 1.2.752.43.13.11 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_send_to_kdc_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x0b") };
/* GSS_KRB5_GET_AUTHTIME_X - 1.2.752.43.13.12 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_authtime_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x0c") };
/* GSS_KRB5_GET_SERVICE_KEYBLOCK_X - 1.2.752.43.13.13 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_service_keyblock_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x0d") };
/* GSS_KRB5_SET_ALLOWABLE_ENCTYPES_X - 1.2.752.43.13.14 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_set_allowable_enctypes_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x0e") };
/* GSS_KRB5_SET_DEFAULT_REALM_X - 1.2.752.43.13.15 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_set_default_realm_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x0f") };
/* GSS_KRB5_CCACHE_NAME_X - 1.2.752.43.13.16 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_ccache_name_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x10") };
/* GSS_KRB5_SET_TIME_OFFSET_X - 1.2.752.43.13.17 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_set_time_offset_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x11") };
/* GSS_KRB5_GET_TIME_OFFSET_X - 1.2.752.43.13.18 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_get_time_offset_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x12") };
/* GSS_KRB5_PLUGIN_REGISTER_X - 1.2.752.43.13.19 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_plugin_register_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x13") };
/* GSS_NTLM_GET_SESSION_KEY_X - 1.2.752.43.13.20 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_ntlm_get_session_key_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x14") };
/* GSS_C_NT_NTLM - 1.2.752.43.13.21 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_nt_ntlm_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x15") };
/* GSS_C_NT_DN - 1.2.752.43.13.22 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_nt_dn_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x16") };
/* GSS_KRB5_NT_PRINCIPAL_NAME_REFERRAL - 1.2.752.43.13.23 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_nt_principal_name_referral_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x17") };
/* GSS_C_NTLM_AVGUEST - 1.2.752.43.13.24 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ntlm_avguest_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x18") };
/* GSS_C_NTLM_V1 - 1.2.752.43.13.25 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ntlm_v1_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x19") };
/* GSS_C_NTLM_V2 - 1.2.752.43.13.26 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ntlm_v2_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x1a") };
/* GSS_C_NTLM_SESSION_KEY - 1.2.752.43.13.27 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ntlm_session_key_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x1b") };
/* GSS_C_NTLM_FORCE_V1 - 1.2.752.43.13.28 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ntlm_force_v1_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x1c") };
/* GSS_KRB5_CRED_NO_CI_FLAGS_X - 1.2.752.43.13.29 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_cred_no_ci_flags_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x1d") };
/* GSS_KRB5_IMPORT_CRED_X - 1.2.752.43.13.30 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_import_cred_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x1e") };
/* GSS_C_MA_SASL_MECH_NAME - 1.2.752.43.13.100 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_sasl_mech_name_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x64") };
/* GSS_C_MA_MECH_NAME - 1.2.752.43.13.101 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_name_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x65") };
/* GSS_C_MA_MECH_DESCRIPTION - 1.2.752.43.13.102 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_description_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x66") };
/* GSS_C_CRED_PASSWORD - 1.2.752.43.13.200 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_cred_password_oid_desc = { 7, "\x2a\x85\x70\x2b\x0d\x81\x48" };
/* GSS_C_CRED_CERTIFICATE - 1.2.752.43.13.201 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_cred_certificate_oid_desc = { 7, "\x2a\x85\x70\x2b\x0d\x81\x49" };
/* GSS_SASL_DIGEST_MD5_MECHANISM - 1.2.752.43.14.1 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_sasl_digest_md5_mechanism_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0e\x01") };
/* GSS_NETLOGON_MECHANISM - 1.2.752.43.14.2 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_netlogon_mechanism_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0e\x02") };
/* GSS_NETLOGON_SET_SESSION_KEY_X - 1.2.752.43.14.3 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_netlogon_set_session_key_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0e\x03") };
/* GSS_NETLOGON_SET_SIGN_ALGORITHM_X - 1.2.752.43.14.4 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_netlogon_set_sign_algorithm_x_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0e\x04") };
/* GSS_NETLOGON_NT_NETBIOS_DNS_NAME - 1.2.752.43.14.5 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_netlogon_nt_netbios_dns_name_oid_desc = { 6, rk_UNCONST("\x2a\x85\x70\x2b\x0e\x05") };
/* GSS_C_INQ_WIN2K_PAC_X - 1.2.752.43.13.3.128 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_inq_win2k_pac_x_oid_desc = { 8, rk_UNCONST("\x2a\x85\x70\x2b\x0d\x03\x81\x00") };
/* GSS_C_INQ_SSPI_SESSION_KEY - 1.2.840.113554.1.2.2.5.5 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_inq_sspi_session_key_oid_desc = { 11, rk_UNCONST("\x2a\x86\x48\x86\xf7\x12\x01\x02\x02\x05\x05") };
/* GSS_KRB5_MECHANISM - 1.2.840.113554.1.2.2 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_krb5_mechanism_oid_desc = { 9, rk_UNCONST("\x2a\x86\x48\x86\xf7\x12\x01\x02\x02") };
/* GSS_NTLM_MECHANISM - 1.3.6.1.4.1.311.2.2.10 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_ntlm_mechanism_oid_desc = { 10, rk_UNCONST("\x2b\x06\x01\x04\x01\x82\x37\x02\x02\x0a") };
/* GSS_SPNEGO_MECHANISM - 1.3.6.1.5.5.2 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_spnego_mechanism_oid_desc = { 6, rk_UNCONST("\x2b\x06\x01\x05\x05\x02") };
/* GSS_C_PEER_HAS_UPDATED_SPNEGO - 1.3.6.1.4.1.9513.19.5 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_peer_has_updated_spnego_oid_desc = { 9, rk_UNCONST("\x2b\x06\x01\x04\x01\xca\x29\x13\x05") };
/* GSS_C_MA_MECH_CONCRETE - 1.3.6.1.5.5.13.1 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_concrete_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x01") };
/* GSS_C_MA_MECH_PSEUDO - 1.3.6.1.5.5.13.2 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_pseudo_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x02") };
/* GSS_C_MA_MECH_COMPOSITE - 1.3.6.1.5.5.13.3 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_composite_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x03") };
/* GSS_C_MA_MECH_NEGO - 1.3.6.1.5.5.13.4 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_nego_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x04") };
/* GSS_C_MA_MECH_GLUE - 1.3.6.1.5.5.13.5 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mech_glue_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x05") };
/* GSS_C_MA_NOT_MECH - 1.3.6.1.5.5.13.6 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_not_mech_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x06") };
/* GSS_C_MA_DEPRECATED - 1.3.6.1.5.5.13.7 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_deprecated_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x07") };
/* GSS_C_MA_NOT_DFLT_MECH - 1.3.6.1.5.5.13.8 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_not_dflt_mech_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x08") };
/* GSS_C_MA_ITOK_FRAMED - 1.3.6.1.5.5.13.9 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_itok_framed_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x09") };
/* GSS_C_MA_AUTH_INIT - 1.3.6.1.5.5.13.10 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_auth_init_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x0a") };
/* GSS_C_MA_AUTH_TARG - 1.3.6.1.5.5.13.11 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_auth_targ_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x0b") };
/* GSS_C_MA_AUTH_INIT_INIT - 1.3.6.1.5.5.13.12 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_auth_init_init_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x0c") };
/* GSS_C_MA_AUTH_TARG_INIT - 1.3.6.1.5.5.13.13 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_auth_targ_init_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x0d") };
/* GSS_C_MA_AUTH_INIT_ANON - 1.3.6.1.5.5.13.14 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_auth_init_anon_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x0e") };
/* GSS_C_MA_AUTH_TARG_ANON - 1.3.6.1.5.5.13.15 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_auth_targ_anon_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x0f") };
/* GSS_C_MA_DELEG_CRED - 1.3.6.1.5.5.13.16 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_deleg_cred_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x10") };
/* GSS_C_MA_INTEG_PROT - 1.3.6.1.5.5.13.17 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_integ_prot_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x11") };
/* GSS_C_MA_CONF_PROT - 1.3.6.1.5.5.13.18 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_conf_prot_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x12") };
/* GSS_C_MA_MIC - 1.3.6.1.5.5.13.19 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_mic_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x13") };
/* GSS_C_MA_WRAP - 1.3.6.1.5.5.13.20 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_wrap_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x14") };
/* GSS_C_MA_PROT_READY - 1.3.6.1.5.5.13.21 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_prot_ready_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x15") };
/* GSS_C_MA_REPLAY_DET - 1.3.6.1.5.5.13.22 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_replay_det_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x16") };
/* GSS_C_MA_OOS_DET - 1.3.6.1.5.5.13.23 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_oos_det_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x17") };
/* GSS_C_MA_CBINDINGS - 1.3.6.1.5.5.13.24 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_cbindings_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x18") };
/* GSS_C_MA_PFS - 1.3.6.1.5.5.13.25 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_pfs_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x19") };
/* GSS_C_MA_COMPRESS - 1.3.6.1.5.5.13.26 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_compress_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x1a") };
/* GSS_C_MA_CTX_TRANS - 1.3.6.1.5.5.13.27 */
gss_OID_desc GSSAPI_LIB_VARIABLE __gss_c_ma_ctx_trans_oid_desc = { 7, rk_UNCONST("\x2b\x06\x01\x05\x05\x0d\x1b") };
diff --git a/kerberos5/lib/libgssapi_krb5/pname_to_uid.c b/kerberos5/lib/libgssapi_krb5/pname_to_uid.c
index 9c996479947e..faf54cf1e5ea 100644
--- a/kerberos5/lib/libgssapi_krb5/pname_to_uid.c
+++ b/kerberos5/lib/libgssapi_krb5/pname_to_uid.c
@@ -1,85 +1,84 @@
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Isilon Inc http://www.isilon.com/
* Authors: Doug Rabson <dfr@rabson.org>
* Developed with Red Inc: Alfred Perlstein <alfred@freebsd.org>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <errno.h>
#include <pwd.h>
#include "krb5/gsskrb5_locl.h"
OM_uint32
_gsskrb5_pname_to_uid(OM_uint32 *minor_status, const gss_name_t pname,
const gss_OID mech, uid_t *uidp)
{
krb5_context context;
krb5_const_principal name = (krb5_const_principal) pname;
krb5_error_code kret;
char lname[MAXLOGNAME + 1], buf[1024], *bufp;
struct passwd pwd, *pw;
size_t buflen;
int error;
OM_uint32 ret;
static size_t buflen_hint = 1024;
GSSAPI_KRB5_INIT (&context);
kret = krb5_aname_to_localname(context, name, sizeof(lname), lname);
if (kret) {
*minor_status = kret;
return (GSS_S_FAILURE);
}
*minor_status = 0;
buflen = buflen_hint;
for (;;) {
pw = NULL;
bufp = buf;
if (buflen > sizeof(buf))
bufp = malloc(buflen);
if (bufp == NULL)
break;
error = getpwnam_r(lname, &pwd, bufp, buflen, &pw);
if (error != ERANGE)
break;
if (buflen > sizeof(buf))
free(bufp);
buflen += 1024;
if (buflen > buflen_hint)
buflen_hint = buflen;
}
if (pw) {
*uidp = pw->pw_uid;
ret = GSS_S_COMPLETE;
} else {
ret = GSS_S_FAILURE;
}
if (bufp != NULL && buflen > sizeof(buf))
free(bufp);
return (ret);
}
diff --git a/lib/csu/aarch64/crt.h b/lib/csu/aarch64/crt.h
index 9f41c2fac0fe..d3dcf25e9039 100644
--- a/lib/csu/aarch64/crt.h
+++ b/lib/csu/aarch64/crt.h
@@ -1,2 +1 @@
-/* $FreeBSD$ */
/* Empty so we can include this unconditionally */
diff --git a/lib/csu/arm/crt.h b/lib/csu/arm/crt.h
index 9f41c2fac0fe..d3dcf25e9039 100644
--- a/lib/csu/arm/crt.h
+++ b/lib/csu/arm/crt.h
@@ -1,2 +1 @@
-/* $FreeBSD$ */
/* Empty so we can include this unconditionally */
diff --git a/lib/csu/riscv/crt.h b/lib/csu/riscv/crt.h
index 8332092a36ad..e6b6b97f2525 100644
--- a/lib/csu/riscv/crt.h
+++ b/lib/csu/riscv/crt.h
@@ -1,9 +1,8 @@
-/* $FreeBSD$ */
#ifndef _CRT_H_
#define _CRT_H_
#define HAVE_CTORS
#define INIT_CALL_SEQ(func) "call " __STRING(func)
#endif
diff --git a/lib/libblocksruntime/config.h b/lib/libblocksruntime/config.h
index 36418d30fedf..fe7921dba95a 100644
--- a/lib/libblocksruntime/config.h
+++ b/lib/libblocksruntime/config.h
@@ -1,14 +1,13 @@
-/* $FreeBSD$ */
/* #undef HAVE_SYS_BYTEORDER_H */
/* #undef HAVE_AVAILABILITY_MACROS_H */
/* #undef HAVE_TARGET_CONDITIONALS_H */
/* #undef HAVE_LIBKERN_OSATOMIC_H */
#define HAVE_SYSCONF 1
/* #undef HAVE_OSATOMIC_COMPARE_AND_SWAP_INT */
/* #undef HAVE_OSATOMIC_COMPARE_AND_SWAP_LONG */
#define HAVE_SYNC_BOOL_COMPARE_AND_SWAP_INT 1
#define HAVE_SYNC_BOOL_COMPARE_AND_SWAP_LONG 1
diff --git a/lib/libc++/libc++.ldscript b/lib/libc++/libc++.ldscript
index bec57f161698..50f8581fec58 100644
--- a/lib/libc++/libc++.ldscript
+++ b/lib/libc++/libc++.ldscript
@@ -1,2 +1 @@
-/* $FreeBSD$ */
GROUP ( @@SHLIB@@ @@LIBDIR@@/libcxxrt.so )
diff --git a/lib/libc/amd64/gen/fpgetmask.c b/lib/libc/amd64/gen/fpgetmask.c
index 03bb2741ef6a..a1ab8a79c2ea 100644
--- a/lib/libc/amd64/gen/fpgetmask.c
+++ b/lib/libc/amd64/gen/fpgetmask.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_except_t fpgetmask(void)
{
return __fpgetmask();
}
diff --git a/lib/libc/amd64/gen/fpgetprec.c b/lib/libc/amd64/gen/fpgetprec.c
index 22d21480566a..eed244f3c36f 100644
--- a/lib/libc/amd64/gen/fpgetprec.c
+++ b/lib/libc/amd64/gen/fpgetprec.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_prec_t fpgetprec(void)
{
return __fpgetprec();
}
diff --git a/lib/libc/amd64/gen/fpgetround.c b/lib/libc/amd64/gen/fpgetround.c
index 9c066b149ca2..6d79bb9d30c6 100644
--- a/lib/libc/amd64/gen/fpgetround.c
+++ b/lib/libc/amd64/gen/fpgetround.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_rnd_t fpgetround(void)
{
return __fpgetround();
}
diff --git a/lib/libc/amd64/gen/fpgetsticky.c b/lib/libc/amd64/gen/fpgetsticky.c
index c3acb91d63e5..842fb2cdf748 100644
--- a/lib/libc/amd64/gen/fpgetsticky.c
+++ b/lib/libc/amd64/gen/fpgetsticky.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_except_t fpgetsticky(void)
{
return __fpgetsticky();
}
diff --git a/lib/libc/amd64/gen/fpsetmask.c b/lib/libc/amd64/gen/fpsetmask.c
index 996e167ac1d9..808144dce4b8 100644
--- a/lib/libc/amd64/gen/fpsetmask.c
+++ b/lib/libc/amd64/gen/fpsetmask.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_except_t fpsetmask(fp_except_t m)
{
return (__fpsetmask(m));
}
diff --git a/lib/libc/amd64/gen/fpsetprec.c b/lib/libc/amd64/gen/fpsetprec.c
index 5898de7e0e82..8fd0249652bd 100644
--- a/lib/libc/amd64/gen/fpsetprec.c
+++ b/lib/libc/amd64/gen/fpsetprec.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_prec_t fpsetprec(fp_prec_t m)
{
return (__fpsetprec(m));
}
diff --git a/lib/libc/amd64/gen/fpsetround.c b/lib/libc/amd64/gen/fpsetround.c
index 6f13367510d6..a069ec2e372c 100644
--- a/lib/libc/amd64/gen/fpsetround.c
+++ b/lib/libc/amd64/gen/fpsetround.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define __IEEEFP_NOINLINES__ 1
#include <ieeefp.h>
fp_rnd_t fpsetround(fp_rnd_t m)
{
return (__fpsetround(m));
}
diff --git a/lib/libc/amd64/string/memcpy.S b/lib/libc/amd64/string/memcpy.S
index 2b6c73abeb98..1876ee600f20 100644
--- a/lib/libc/amd64/string/memcpy.S
+++ b/lib/libc/amd64/string/memcpy.S
@@ -1,5 +1,4 @@
/* $NetBSD: memcpy.S,v 1.1 2001/06/19 00:25:05 fvdl Exp $ */
-/* $FreeBSD$ */
#define MEMCPY
#include "memmove.S"
diff --git a/lib/libc/arm/softfloat/arm-gcc.h b/lib/libc/arm/softfloat/arm-gcc.h
index 0e20ef91f059..00ee99a5af3e 100644
--- a/lib/libc/arm/softfloat/arm-gcc.h
+++ b/lib/libc/arm/softfloat/arm-gcc.h
@@ -1,101 +1,100 @@
/* $NetBSD: arm-gcc.h,v 1.2 2001/02/21 18:09:25 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
-------------------------------------------------------------------------------
One of the macros `BIGENDIAN' or `LITTLEENDIAN' must be defined.
-------------------------------------------------------------------------------
*/
#ifdef __ARMEB__
#define BIGENDIAN
#else
#define LITTLEENDIAN
#endif
/*
-------------------------------------------------------------------------------
The macro `BITS64' can be defined to indicate that 64-bit integer types are
supported by the compiler.
-------------------------------------------------------------------------------
*/
#define BITS64
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines the most convenient type that holds
integers of at least as many bits as specified. For example, `uint8' should
be the most convenient type that can hold unsigned integers of as many as
8 bits. The `flag' type must be able to hold either a 0 or 1. For most
implementations of C, `flag', `uint8', and `int8' should all be `typedef'ed
to the same as `int'.
-------------------------------------------------------------------------------
*/
typedef int flag;
typedef int uint8;
typedef int int8;
typedef int uint16;
typedef int int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifdef BITS64
typedef unsigned long long int uint64;
typedef signed long long int int64;
#endif
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines a type that holds integers
of _exactly_ the number of bits specified. For instance, for most
implementation of C, `bits16' and `sbits16' should be `typedef'ed to
`unsigned short int' and `signed short int' (or `short int'), respectively.
-------------------------------------------------------------------------------
*/
typedef unsigned char bits8;
typedef signed char sbits8;
typedef unsigned short int bits16;
typedef signed short int sbits16;
typedef unsigned int bits32;
typedef signed int sbits32;
#ifdef BITS64
typedef unsigned long long int bits64;
typedef signed long long int sbits64;
#endif
#ifdef BITS64
/*
-------------------------------------------------------------------------------
The `LIT64' macro takes as its argument a textual integer literal and
if necessary ``marks'' the literal as having a 64-bit integer type.
For example, the GNU C Compiler (`gcc') requires that 64-bit literals be
appended with the letters `LL' standing for `long long', which is `gcc's
name for the 64-bit integer type. Some compilers may allow `LIT64' to be
defined as the identity macro: `#define LIT64( a ) a'.
-------------------------------------------------------------------------------
*/
#define LIT64( a ) a##LL
#endif
/*
-------------------------------------------------------------------------------
The macro `INLINE' can be used before functions that should be inlined. If
a compiler does not support explicit inlining, this macro should be defined
to be `static'.
-------------------------------------------------------------------------------
*/
#define INLINE static __inline
/*
-------------------------------------------------------------------------------
The ARM FPA is odd in that it stores doubles high-order word first, no matter
what the endianness of the CPU. VFP is sane.
-------------------------------------------------------------------------------
*/
#if defined(SOFTFLOAT_FOR_GCC)
#if defined (__ARM_EABI__) || defined(__VFP_FP__) || defined(__ARMEB__)
#define FLOAT64_DEMANGLE(a) (a)
#define FLOAT64_MANGLE(a) (a)
#else
#define FLOAT64_DEMANGLE(a) ((((a) & 0xfffffffful) << 32) | ((a) >> 32))
#define FLOAT64_MANGLE(a) FLOAT64_DEMANGLE(a)
#endif
#endif
diff --git a/lib/libc/arm/softfloat/milieu.h b/lib/libc/arm/softfloat/milieu.h
index 54775c768b91..a3f829c4281b 100644
--- a/lib/libc/arm/softfloat/milieu.h
+++ b/lib/libc/arm/softfloat/milieu.h
@@ -1,49 +1,48 @@
/* $NetBSD: milieu.h,v 1.1 2000/12/29 20:13:54 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "arm-gcc.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/arm/softfloat/softfloat.h b/lib/libc/arm/softfloat/softfloat.h
index 6aef49975a38..d202a1f7f420 100644
--- a/lib/libc/arm/softfloat/softfloat.h
+++ b/lib/libc/arm/softfloat/softfloat.h
@@ -1,315 +1,314 @@
/* $NetBSD: softfloat.h,v 1.6 2002/05/12 13:12:46 bjh21 Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
/* #define FLOATX80 */
/* #define FLOAT128 */
#include <fenv.h>
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef unsigned int float32;
typedef unsigned long long float64;
#ifdef FLOATX80
typedef struct {
unsigned short high;
unsigned long long low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
unsigned long long high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
#ifndef SOFTFLOAT_FOR_GCC
extern int float_detect_tininess;
#endif
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern int float_rounding_mode;
enum {
float_round_nearest_even = FE_TONEAREST,
float_round_to_zero = FE_TOWARDZERO,
float_round_down = FE_DOWNWARD,
float_round_up = FE_UPWARD
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
extern int float_exception_flags;
extern int float_exception_mask;
enum {
float_flag_inexact = FE_INEXACT,
float_flag_underflow = FE_UNDERFLOW,
float_flag_overflow = FE_OVERFLOW,
float_flag_divbyzero = FE_DIVBYZERO,
float_flag_invalid = FE_INVALID
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( int );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( int );
float64 int32_to_float64( int );
#ifdef FLOATX80
floatx80 int32_to_floatx80( int );
#endif
#ifdef FLOAT128
float128 int32_to_float128( int );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __floatdi?f is in libgcc2.c */
float32 int64_to_float32( long long );
float64 int64_to_float64( long long );
#ifdef FLOATX80
floatx80 int64_to_floatx80( long long );
#endif
#ifdef FLOAT128
float128 int64_to_float128( long long );
#endif
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float32_to_int32( float32 );
int float32_to_int32_round_to_zero( float32 );
#if defined(SOFTFLOAT_FOR_GCC) && defined(SOFTFLOAT_NEED_FIXUNS)
unsigned int float32_to_uint32_round_to_zero( float32 );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __fix?fdi provided by libgcc2.c */
long long float32_to_int64( float32 );
long long float32_to_int64_round_to_zero( float32 );
#endif
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
int float32_eq( float32, float32 );
int float32_le( float32, float32 );
int float32_lt( float32, float32 );
int float32_eq_signaling( float32, float32 );
int float32_le_quiet( float32, float32 );
int float32_lt_quiet( float32, float32 );
#ifndef SOFTFLOAT_FOR_GCC
int float32_is_signaling_nan( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float64_to_int32( float64 );
int float64_to_int32_round_to_zero( float64 );
#if defined(SOFTFLOAT_FOR_GCC) && defined(SOFTFLOAT_NEED_FIXUNS)
unsigned int float64_to_uint32_round_to_zero( float64 );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __fix?fdi provided by libgcc2.c */
long long float64_to_int64( float64 );
long long float64_to_int64_round_to_zero( float64 );
#endif
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
int float64_eq( float64, float64 );
int float64_le( float64, float64 );
int float64_lt( float64, float64 );
int float64_eq_signaling( float64, float64 );
int float64_le_quiet( float64, float64 );
int float64_lt_quiet( float64, float64 );
#ifndef SOFTFLOAT_FOR_GCC
int float64_is_signaling_nan( float64 );
#endif
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int floatx80_to_int32( floatx80 );
int floatx80_to_int32_round_to_zero( floatx80 );
long long floatx80_to_int64( floatx80 );
long long floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern int floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
int floatx80_eq( floatx80, floatx80 );
int floatx80_le( floatx80, floatx80 );
int floatx80_lt( floatx80, floatx80 );
int floatx80_eq_signaling( floatx80, floatx80 );
int floatx80_le_quiet( floatx80, floatx80 );
int floatx80_lt_quiet( floatx80, floatx80 );
int floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float128_to_int32( float128 );
int float128_to_int32_round_to_zero( float128 );
long long float128_to_int64( float128 );
long long float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
int float128_eq( float128, float128 );
int float128_le( float128, float128 );
int float128_lt( float128, float128 );
int float128_eq_signaling( float128, float128 );
int float128_le_quiet( float128, float128 );
int float128_lt_quiet( float128, float128 );
int float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/iconv/_strtol.h b/lib/libc/iconv/_strtol.h
index dee7bab733e8..786ae2efbaa9 100644
--- a/lib/libc/iconv/_strtol.h
+++ b/lib/libc/iconv/_strtol.h
@@ -1,169 +1,168 @@
-/* $FreeBSD$ */
/* $NetBSD: _strtol.h,v 1.2 2009/05/20 22:03:29 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Original version ID:
* NetBSD: src/lib/libc/locale/_wcstol.h,v 1.2 2003/08/07 16:43:03 agc Exp
*/
/*
* function template for strtol, strtoll and strtoimax.
*
* parameters:
* _FUNCNAME : function name
* __INT : return type
* __INT_MIN : lower limit of the return type
* __INT_MAX : upper limit of the return type
*/
__INT
_FUNCNAME(const char *nptr, char **endptr, int base)
{
const char *s;
__INT acc, cutoff;
unsigned char c;
int any, cutlim, i, neg;
/* check base value */
if (base && (base < 2 || base > 36)) {
#if !defined(_KERNEL) && !defined(_STANDALONE)
errno = EINVAL;
if (endptr != NULL)
/* LINTED interface specification */
*endptr = __DECONST(void *, nptr);
return (0);
#else
panic("%s: invalid base %d", __func__, base);
#endif
}
/*
* Skip white space and pick up leading +/- sign if any.
* If base is 0, allow 0x for hex and 0 for octal, else
* assume decimal; if base is already 16, allow 0x.
*/
s = nptr;
do {
c = *s++;
} while (isspace(c));
if (c == '-') {
neg = 1;
c = *s++;
} else {
neg = 0;
if (c == '+')
c = *s++;
}
if ((base == 0 || base == 16) &&
c == '0' && (*s == 'x' || *s == 'X')) {
c = s[1];
s += 2;
base = 16;
}
if (base == 0)
base = (c == '0' ? 8 : 10);
/*
* Compute the cutoff value between legal numbers and illegal
* numbers. That is the largest legal value, divided by the
* base. An input number that is greater than this value, if
* followed by a legal input character, is too big. One that
* is equal to this value may be valid or not; the limit
* between valid and invalid numbers is then based on the last
* digit. For instance, if the range for longs is
* [-2147483648..2147483647] and the input base is 10,
* cutoff will be set to 214748364 and cutlim to either
* 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
* a value > 214748364, or equal but the next digit is > 7 (or 8),
* the number is too big, and we will return a range error.
*
* Set any if any `digits' consumed; make it negative to indicate
* overflow.
*/
cutoff = (neg ? __INT_MIN : __INT_MAX);
cutlim = (int)(cutoff % base);
cutoff /= base;
if (neg) {
if (cutlim > 0) {
cutlim -= base;
cutoff += 1;
}
cutlim = -cutlim;
}
for (acc = 0, any = 0;; c = *s++) {
if (isdigit(c))
i = c - '0';
else if (isalpha(c))
i = c - (isupper(c) ? 'A' - 10 : 'a' - 10);
else
break;
if (i >= base)
break;
if (any < 0)
continue;
if (neg) {
if (acc < cutoff || (acc == cutoff && i > cutlim)) {
acc = __INT_MIN;
#if !defined(_KERNEL) && !defined(_STANDALONE)
any = -1;
errno = ERANGE;
#else
any = 0;
break;
#endif
} else {
any = 1;
acc *= base;
acc -= i;
}
} else {
if (acc > cutoff || (acc == cutoff && i > cutlim)) {
acc = __INT_MAX;
#if !defined(_KERNEL) && !defined(_STANDALONE)
any = -1;
errno = ERANGE;
#else
any = 0;
break;
#endif
} else {
any = 1;
acc *= base;
acc += i;
}
}
}
if (endptr != NULL)
/* LINTED interface specification */
*endptr = __DECONST(void *, any ? s - 1 : nptr);
return(acc);
}
diff --git a/lib/libc/iconv/_strtoul.h b/lib/libc/iconv/_strtoul.h
index 2dd3e92ba302..2d5c7776b0e3 100644
--- a/lib/libc/iconv/_strtoul.h
+++ b/lib/libc/iconv/_strtoul.h
@@ -1,128 +1,127 @@
-/* $FreeBSD$ */
/* $NetBSD: _strtoul.h,v 1.1 2008/08/20 12:42:26 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Original version ID:
* NetBSD: src/lib/libc/locale/_wcstoul.h,v 1.2 2003/08/07 16:43:03 agc Exp
*/
/*
* function template for strtoul, strtoull and strtoumax.
*
* parameters:
* _FUNCNAME : function name
* __UINT : return type
* __UINT_MAX : upper limit of the return type
*/
__UINT
_FUNCNAME(const char *nptr, char **endptr, int base)
{
const char *s;
__UINT acc, cutoff;
unsigned char c;
int any, cutlim, i, neg;
/* check base value */
if (base && (base < 2 || base > 36)) {
#if !defined(_KERNEL) && !defined(_STANDALONE)
errno = EINVAL;
return (0);
#else
panic("%s: invalid base %d", __func__, base);
#endif
}
/*
* Skip white space and pick up leading +/- sign if any.
* If base is 0, allow 0x for hex and 0 for octal, else
* assume decimal; if base is already 16, allow 0x.
*/
s = nptr;
do {
c = *s++;
} while (isspace(c));
if (c == '-') {
neg = 1;
c = *s++;
} else {
neg = 0;
if (c == '+')
c = *s++;
}
if ((base == 0 || base == 16) &&
c == '0' && (*s == 'x' || *s == 'X')) {
c = s[1];
s += 2;
base = 16;
}
if (base == 0)
base = (c == '0' ? 8 : 10);
/*
* See strtol for comments as to the logic used.
*/
cutoff = __UINT_MAX / (__UINT)base;
cutlim = (int)(__UINT_MAX % (__UINT)base);
for (acc = 0, any = 0;; c = *s++) {
if (isdigit(c))
i = c - '0';
else if (isalpha(c))
i = c - (isupper(c) ? 'A' - 10 : 'a' - 10);
else
break;
if (i >= base)
break;
if (any < 0)
continue;
if (acc > cutoff || (acc == cutoff && i > cutlim)) {
acc = __UINT_MAX;
#if !defined(_KERNEL) && !defined(_STANDALONE)
any = -1;
errno = ERANGE;
#else
any = 0;
break;
#endif
} else {
any = 1;
acc *= (__UINT)base;
acc += i;
}
}
if (neg && any > 0)
acc = -acc;
if (endptr != NULL)
/* LINTED interface specification */
*endptr = __DECONST(void *, any ? s - 1 : nptr);
return (acc);
}
diff --git a/lib/libc/iconv/bsd_iconv.c b/lib/libc/iconv/bsd_iconv.c
index 0fcff0e2d1b8..04583ebcf6c0 100644
--- a/lib/libc/iconv/bsd_iconv.c
+++ b/lib/libc/iconv/bsd_iconv.c
@@ -1,327 +1,326 @@
-/* $FreeBSD$ */
/* $NetBSD: iconv.c,v 1.11 2009/03/03 16:22:33 explorer Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2003 Citrus Project,
* Copyright (c) 2009, 2010 Gabor Kovesdan <gabor@FreeBSD.org>,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <iconv.h>
#include <limits.h>
#include <paths.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_esdb.h"
#include "citrus_hash.h"
#include "citrus_iconv.h"
#include "iconv-internal.h"
#define ISBADF(_h_) (!(_h_) || (_h_) == (iconv_t)-1)
static iconv_t
__bsd___iconv_open(const char *out, const char *in, struct _citrus_iconv *handle)
{
const char *out_slashes;
char *out_noslashes;
int ret;
/*
* Remove anything following a //, as these are options (like
* //ignore, //translate, etc) and we just don't handle them.
* This is for compatibility with software that uses these
* blindly.
*/
out_slashes = strstr(out, "//");
if (out_slashes != NULL) {
out_noslashes = strndup(out, out_slashes - out);
if (out_noslashes == NULL) {
errno = ENOMEM;
return ((iconv_t)-1);
}
ret = _citrus_iconv_open(&handle, in, out_noslashes);
free(out_noslashes);
} else {
ret = _citrus_iconv_open(&handle, in, out);
}
if (ret) {
errno = ret == ENOENT ? EINVAL : ret;
return ((iconv_t)-1);
}
handle->cv_shared->ci_discard_ilseq = strcasestr(out, "//IGNORE");
handle->cv_shared->ci_ilseq_invalid = false;
handle->cv_shared->ci_hooks = NULL;
return ((iconv_t)(void *)handle);
}
iconv_t
__bsd_iconv_open(const char *out, const char *in)
{
return (__bsd___iconv_open(out, in, NULL));
}
int
__bsd_iconv_open_into(const char *out, const char *in, iconv_allocation_t *ptr)
{
struct _citrus_iconv *handle;
handle = (struct _citrus_iconv *)ptr;
return ((__bsd___iconv_open(out, in, handle) == (iconv_t)-1) ? -1 : 0);
}
int
__bsd_iconv_close(iconv_t handle)
{
if (ISBADF(handle)) {
errno = EBADF;
return (-1);
}
_citrus_iconv_close((struct _citrus_iconv *)(void *)handle);
return (0);
}
size_t
__bsd_iconv(iconv_t handle, char **in, size_t *szin, char **out, size_t *szout)
{
size_t ret;
int err;
if (ISBADF(handle)) {
errno = EBADF;
return ((size_t)-1);
}
err = _citrus_iconv_convert((struct _citrus_iconv *)(void *)handle,
in, szin, out, szout, 0, &ret);
if (err) {
errno = err;
ret = (size_t)-1;
}
return (ret);
}
size_t
__bsd___iconv(iconv_t handle, char **in, size_t *szin, char **out,
size_t *szout, uint32_t flags, size_t *invalids)
{
size_t ret;
int err;
if (ISBADF(handle)) {
errno = EBADF;
return ((size_t)-1);
}
err = _citrus_iconv_convert((struct _citrus_iconv *)(void *)handle,
in, szin, out, szout, flags, &ret);
if (invalids)
*invalids = ret;
if (err) {
errno = err;
ret = (size_t)-1;
}
return (ret);
}
int
__bsd___iconv_get_list(char ***rlist, size_t *rsz, bool sorted)
{
int ret;
ret = _citrus_esdb_get_list(rlist, rsz, sorted);
if (ret) {
errno = ret;
return (-1);
}
return (0);
}
void
__bsd___iconv_free_list(char **list, size_t sz)
{
_citrus_esdb_free_list(list, sz);
}
/*
* GNU-compatibile non-standard interfaces.
*/
static int
qsort_helper(const void *first, const void *second)
{
const char * const *s1;
const char * const *s2;
s1 = first;
s2 = second;
return (strcmp(*s1, *s2));
}
void
__bsd_iconvlist(int (*do_one) (unsigned int, const char * const *,
void *), void *data)
{
char **list, **names;
const char * const *np;
char *curitem, *curkey, *slashpos;
size_t sz;
unsigned int i, j, n;
i = 0;
names = NULL;
if (__bsd___iconv_get_list(&list, &sz, true)) {
list = NULL;
goto out;
}
qsort((void *)list, sz, sizeof(char *), qsort_helper);
while (i < sz) {
j = 0;
slashpos = strchr(list[i], '/');
names = malloc(sz * sizeof(char *));
if (names == NULL)
goto out;
curkey = strndup(list[i], slashpos - list[i]);
if (curkey == NULL)
goto out;
names[j++] = curkey;
for (; (i < sz) && (memcmp(curkey, list[i], strlen(curkey)) == 0); i++) {
slashpos = strchr(list[i], '/');
if (strcmp(curkey, &slashpos[1]) == 0)
continue;
curitem = strdup(&slashpos[1]);
if (curitem == NULL)
goto out;
names[j++] = curitem;
}
np = (const char * const *)names;
do_one(j, np, data);
for (n = 0; n < j; n++)
free(names[n]);
free(names);
names = NULL;
}
out:
if (names != NULL) {
for (n = 0; n < j; n++)
free(names[n]);
free(names);
}
if (list != NULL)
__bsd___iconv_free_list(list, sz);
}
__inline const char *
__bsd_iconv_canonicalize(const char *name)
{
return (_citrus_iconv_canonicalize(name));
}
int
__bsd_iconvctl(iconv_t cd, int request, void *argument)
{
struct _citrus_iconv *cv;
struct iconv_hooks *hooks;
const char *convname;
char *dst;
int *i;
size_t srclen;
cv = (struct _citrus_iconv *)(void *)cd;
hooks = (struct iconv_hooks *)argument;
i = (int *)argument;
if (ISBADF(cd)) {
errno = EBADF;
return (-1);
}
switch (request) {
case ICONV_TRIVIALP:
convname = cv->cv_shared->ci_convname;
dst = strchr(convname, '/');
srclen = dst - convname;
dst++;
*i = (srclen == strlen(dst)) && !memcmp(convname, dst, srclen);
return (0);
case ICONV_GET_TRANSLITERATE:
*i = 1;
return (0);
case ICONV_SET_TRANSLITERATE:
return ((*i == 1) ? 0 : -1);
case ICONV_GET_DISCARD_ILSEQ:
*i = cv->cv_shared->ci_discard_ilseq ? 1 : 0;
return (0);
case ICONV_SET_DISCARD_ILSEQ:
cv->cv_shared->ci_discard_ilseq = *i;
return (0);
case ICONV_SET_HOOKS:
cv->cv_shared->ci_hooks = hooks;
return (0);
case ICONV_SET_FALLBACKS:
errno = EOPNOTSUPP;
return (-1);
case ICONV_GET_ILSEQ_INVALID:
*i = cv->cv_shared->ci_ilseq_invalid ? 1 : 0;
return (0);
case ICONV_SET_ILSEQ_INVALID:
cv->cv_shared->ci_ilseq_invalid = *i;
return (0);
default:
errno = EINVAL;
return (-1);
}
}
void
__bsd_iconv_set_relocation_prefix(const char *orig_prefix __unused,
const char *curr_prefix __unused)
{
}
diff --git a/lib/libc/iconv/citrus_aliasname_local.h b/lib/libc/iconv/citrus_aliasname_local.h
index 0dc883a54c92..e4ae8c70562c 100644
--- a/lib/libc/iconv/citrus_aliasname_local.h
+++ b/lib/libc/iconv/citrus_aliasname_local.h
@@ -1,51 +1,50 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_aliasname_local.h,v 1.2 2009/01/11 02:46:24 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2008 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ALIASNAME_LOCAL_H_
#define _CITRUS_ALIASNAME_LOCAL_H_
static __inline const char *
__unaliasname(const char *dbname, const char *alias,
void *buf, size_t bufsize)
{
return (_lookup_simple(dbname, alias,
buf, bufsize, _LOOKUP_CASE_SENSITIVE));
}
static __inline int
__isforcemapping(const char *name)
{
return (_bcs_strcasecmp("/force", name));
}
#endif /*_CITRUS_ALIASNAME_LOCAL_H_*/
diff --git a/lib/libc/iconv/citrus_bcs.c b/lib/libc/iconv/citrus_bcs.c
index cd88ea7fe2fd..9e7cb8c0749f 100644
--- a/lib/libc/iconv/citrus_bcs.c
+++ b/lib/libc/iconv/citrus_bcs.c
@@ -1,170 +1,169 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_bcs.c,v 1.5 2005/05/14 17:55:42 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <stdlib.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
/*
* case insensitive comparison between two C strings.
*/
int
_citrus_bcs_strcasecmp(const char * __restrict str1,
const char * __restrict str2)
{
int c1, c2;
c1 = c2 = 1;
while (c1 && c2 && c1 == c2) {
c1 = _bcs_toupper(*str1++);
c2 = _bcs_toupper(*str2++);
}
return ((c1 == c2) ? 0 : ((c1 > c2) ? 1 : -1));
}
/*
* case insensitive comparison between two C strings with limitation of length.
*/
int
_citrus_bcs_strncasecmp(const char * __restrict str1,
const char * __restrict str2, size_t sz)
{
int c1, c2;
c1 = c2 = 1;
while (c1 && c2 && c1 == c2 && sz != 0) {
c1 = _bcs_toupper(*str1++);
c2 = _bcs_toupper(*str2++);
sz--;
}
return ((c1 == c2) ? 0 : ((c1 > c2) ? 1 : -1));
}
/*
* skip white space characters.
*/
const char *
_citrus_bcs_skip_ws(const char *p)
{
while (*p && _bcs_isspace(*p))
p++;
return (p);
}
/*
* skip non white space characters.
*/
const char *
_citrus_bcs_skip_nonws(const char *p)
{
while (*p && !_bcs_isspace(*p))
p++;
return (p);
}
/*
* skip white space characters with limitation of length.
*/
const char *
_citrus_bcs_skip_ws_len(const char * __restrict p, size_t * __restrict len)
{
while (*len > 0 && *p && _bcs_isspace(*p)) {
p++;
(*len)--;
}
return (p);
}
/*
* skip non white space characters with limitation of length.
*/
const char *
_citrus_bcs_skip_nonws_len(const char * __restrict p, size_t * __restrict len)
{
while (*len > 0 && *p && !_bcs_isspace(*p)) {
p++;
(*len)--;
}
return (p);
}
/*
* truncate trailing white space characters.
*/
void
_citrus_bcs_trunc_rws_len(const char * __restrict p, size_t * __restrict len)
{
while (*len > 0 && _bcs_isspace(p[*len - 1]))
(*len)--;
}
/*
* destructive transliterate to lowercase.
*/
void
_citrus_bcs_convert_to_lower(char *s)
{
while (*s) {
*s = _bcs_tolower(*s);
s++;
}
}
/*
* destructive transliterate to uppercase.
*/
void
_citrus_bcs_convert_to_upper(char *s)
{
while (*s) {
*s = _bcs_toupper(*s);
s++;
}
}
diff --git a/lib/libc/iconv/citrus_bcs.h b/lib/libc/iconv/citrus_bcs.h
index 3bf6f72e988e..ba4d97aa7c3f 100644
--- a/lib/libc/iconv/citrus_bcs.h
+++ b/lib/libc/iconv/citrus_bcs.h
@@ -1,104 +1,103 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_bcs.h,v 1.6 2009/01/11 02:46:24 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/types.h>
#ifndef _CITRUS_BCS_H_
#define _CITRUS_BCS_H_
/*
* predicate/conversion for basic character set.
*
* `Basic character set' is a term defined in the ISO C standard.
* Citrus bcs is, if anything, close to `portable character set'
* defined in the POSIX.
*/
#define _CITRUS_BCS_PRED(_name_, _cond_) \
static __inline int _citrus_bcs_##_name_(uint8_t c) { return (_cond_); }
/*
* predicates.
* Unlike predicates defined in ctype.h, these do not accept EOF.
*/
_CITRUS_BCS_PRED(isblank, c == ' ' || c == '\t')
_CITRUS_BCS_PRED(iseol, c == '\n' || c == '\r')
_CITRUS_BCS_PRED(isspace, _citrus_bcs_isblank(c) || _citrus_bcs_iseol(c) ||
c == '\f' || c == '\v')
_CITRUS_BCS_PRED(isdigit, c >= '0' && c <= '9')
_CITRUS_BCS_PRED(isupper, c >= 'A' && c <= 'Z')
_CITRUS_BCS_PRED(islower, c >= 'a' && c <= 'z')
_CITRUS_BCS_PRED(isalpha, _citrus_bcs_isupper(c) || _citrus_bcs_islower(c))
_CITRUS_BCS_PRED(isalnum, _citrus_bcs_isdigit(c) || _citrus_bcs_isalpha(c))
_CITRUS_BCS_PRED(isxdigit, _citrus_bcs_isdigit(c) ||
(c >= 'A' && c <= 'F') || (c >= 'a' && c <= 'f'))
/*
* transliterate between uppercase and lowercase.
* Unlike transliterator defined in ctype.h, these do not accept EOF.
*/
static __inline uint8_t
_citrus_bcs_toupper(uint8_t c)
{
return (_citrus_bcs_islower(c) ? (c - 'a' + 'A') : c);
}
static __inline uint8_t
_citrus_bcs_tolower(uint8_t c)
{
return (_citrus_bcs_isupper(c) ? (c - 'A' + 'a') : c);
}
__BEGIN_DECLS
int _citrus_bcs_strcasecmp(const char * __restrict,
const char * __restrict);
int _citrus_bcs_strncasecmp(const char * __restrict,
const char * __restrict, size_t);
const char *_citrus_bcs_skip_ws(const char * __restrict);
const char *_citrus_bcs_skip_nonws(const char * __restrict);
const char *_citrus_bcs_skip_ws_len(const char * __restrict,
size_t * __restrict);
const char *_citrus_bcs_skip_nonws_len(const char * __restrict,
size_t * __restrict);
void _citrus_bcs_trunc_rws_len(const char * __restrict,
size_t * __restrict);
void _citrus_bcs_convert_to_lower(char *);
void _citrus_bcs_convert_to_upper(char *);
long int _citrus_bcs_strtol(const char * __restrict,
char ** __restrict, int);
unsigned long _citrus_bcs_strtoul(const char * __restrict,
char ** __restrict, int);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_bcs_strtol.c b/lib/libc/iconv/citrus_bcs_strtol.c
index fda263b6479f..c1273acba344 100644
--- a/lib/libc/iconv/citrus_bcs_strtol.c
+++ b/lib/libc/iconv/citrus_bcs_strtol.c
@@ -1,59 +1,58 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_bcs_strtol.c,v 1.4 2013/04/26 21:20:47 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2005 The DragonFly Project. All rights reserved.
* Copyright (c) 2003, 2008 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdint.h>
#include <stdlib.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#define _FUNCNAME _bcs_strtol
#define __INT long int
#undef isspace
#define isspace(c) _bcs_isspace(c)
#undef isdigit
#define isdigit(c) _bcs_isdigit(c)
#undef isalpha
#define isalpha(c) _bcs_isalpha(c)
#undef isupper
#define isupper(c) _bcs_isupper(c)
#include "_strtol.h"
diff --git a/lib/libc/iconv/citrus_bcs_strtoul.c b/lib/libc/iconv/citrus_bcs_strtoul.c
index 981aa5ad1b8c..0ea896d90b0e 100644
--- a/lib/libc/iconv/citrus_bcs_strtoul.c
+++ b/lib/libc/iconv/citrus_bcs_strtoul.c
@@ -1,59 +1,58 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_bcs_strtoul.c,v 1.5 2013/04/26 21:20:48 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2005 The DragonFly Project. All rights reserved.
* Copyright (c) 2003, 2008 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdint.h>
#include <stdlib.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#define _FUNCNAME _bcs_strtoul
#define __UINT unsigned long int
#undef isspace
#define isspace(c) _bcs_isspace(c)
#undef isdigit
#define isdigit(c) _bcs_isdigit(c)
#undef isalpha
#define isalpha(c) _bcs_isalpha(c)
#undef isupper
#define isupper(c) _bcs_isupper(c)
#include "_strtoul.h"
diff --git a/lib/libc/iconv/citrus_csmapper.c b/lib/libc/iconv/citrus_csmapper.c
index 90d52cba2ce3..e59ccfb3f02a 100644
--- a/lib/libc/iconv/citrus_csmapper.c
+++ b/lib/libc/iconv/citrus_csmapper.c
@@ -1,388 +1,387 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_csmapper.c,v 1.11 2011/11/20 07:43:52 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <sys/types.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <paths.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_lock.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_module.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#include "citrus_csmapper.h"
#include "citrus_pivot_file.h"
#include "citrus_db.h"
#include "citrus_db_hash.h"
#include "citrus_lookup.h"
static struct _citrus_mapper_area *maparea = NULL;
static pthread_rwlock_t ma_lock = PTHREAD_RWLOCK_INITIALIZER;
#define CS_ALIAS _PATH_CSMAPPER "/charset.alias"
#define CS_PIVOT _PATH_CSMAPPER "/charset.pivot"
/* ---------------------------------------------------------------------- */
static int
get32(struct _region *r, uint32_t *rval)
{
if (_region_size(r) != 4)
return (EFTYPE);
memcpy(rval, _region_head(r), (size_t)4);
*rval = be32toh(*rval);
return (0);
}
static int
open_subdb(struct _citrus_db **subdb, struct _citrus_db *db, const char *src)
{
struct _region r;
int ret;
ret = _db_lookup_by_s(db, src, &r, NULL);
if (ret)
return (ret);
ret = _db_open(subdb, &r, _CITRUS_PIVOT_SUB_MAGIC, _db_hash_std, NULL);
if (ret)
return (ret);
return (0);
}
#define NO_SUCH_FILE EOPNOTSUPP
static int
find_best_pivot_pvdb(const char *src, const char *dst, char *pivot,
size_t pvlen, unsigned long *rnorm)
{
struct _citrus_db *db1, *db2, *db3;
struct _region fr, r1, r2;
char buf[LINE_MAX];
uint32_t val32;
unsigned long norm;
int i, num, ret;
ret = _map_file(&fr, CS_PIVOT ".pvdb");
if (ret) {
if (ret == ENOENT)
ret = NO_SUCH_FILE;
return (ret);
}
ret = _db_open(&db1, &fr, _CITRUS_PIVOT_MAGIC, _db_hash_std, NULL);
if (ret)
goto quit1;
ret = open_subdb(&db2, db1, src);
if (ret)
goto quit2;
num = _db_get_num_entries(db2);
*rnorm = ULONG_MAX;
for (i = 0; i < num; i++) {
/* iterate each pivot */
ret = _db_get_entry(db2, i, &r1, &r2);
if (ret)
goto quit3;
/* r1:pivot name, r2:norm among src and pivot */
ret = get32(&r2, &val32);
if (ret)
goto quit3;
norm = val32;
snprintf(buf, sizeof(buf), "%.*s",
(int)_region_size(&r1), (char *)_region_head(&r1));
/* buf: pivot name */
ret = open_subdb(&db3, db1, buf);
if (ret)
goto quit3;
if (_db_lookup_by_s(db3, dst, &r2, NULL) != 0)
/* don't break the loop, test all src/dst pairs. */
goto quit4;
/* r2: norm among pivot and dst */
ret = get32(&r2, &val32);
if (ret)
goto quit4;
norm += val32;
/* judge minimum norm */
if (norm < *rnorm) {
*rnorm = norm;
strlcpy(pivot, buf, pvlen);
}
quit4:
_db_close(db3);
if (ret)
goto quit3;
}
quit3:
_db_close(db2);
quit2:
_db_close(db1);
quit1:
_unmap_file(&fr);
if (ret)
return (ret);
if (*rnorm == ULONG_MAX)
return (ENOENT);
return (0);
}
/* ---------------------------------------------------------------------- */
struct zone {
const char *begin, *end;
};
struct parse_arg {
char dst[PATH_MAX];
unsigned long norm;
};
static int
parse_line(struct parse_arg *pa, struct _region *r)
{
struct zone z1, z2;
char buf[20];
size_t len;
len = _region_size(r);
z1.begin = _bcs_skip_ws_len(_region_head(r), &len);
if (len == 0)
return (EFTYPE);
z1.end = _bcs_skip_nonws_len(z1.begin, &len);
if (len == 0)
return (EFTYPE);
z2.begin = _bcs_skip_ws_len(z1.end, &len);
if (len == 0)
return (EFTYPE);
z2.end = _bcs_skip_nonws_len(z2.begin, &len);
/* z1 : dst name, z2 : norm */
snprintf(pa->dst, sizeof(pa->dst),
"%.*s", (int)(z1.end-z1.begin), z1.begin);
snprintf(buf, sizeof(buf),
"%.*s", (int)(z2.end-z2.begin), z2.begin);
pa->norm = _bcs_strtoul(buf, NULL, 0);
return (0);
}
static int
find_dst(struct parse_arg *pasrc, const char *dst)
{
struct _lookup *cl;
struct parse_arg padst;
struct _region data;
int ret;
ret = _lookup_seq_open(&cl, CS_PIVOT, _LOOKUP_CASE_IGNORE);
if (ret)
return (ret);
ret = _lookup_seq_lookup(cl, pasrc->dst, &data);
while (ret == 0) {
ret = parse_line(&padst, &data);
if (ret)
break;
if (strcmp(dst, padst.dst) == 0) {
pasrc->norm += padst.norm;
break;
}
ret = _lookup_seq_next(cl, NULL, &data);
}
_lookup_seq_close(cl);
return (ret);
}
static int
find_best_pivot_lookup(const char *src, const char *dst, char *pivot,
size_t pvlen, unsigned long *rnorm)
{
struct _lookup *cl;
struct _region data;
struct parse_arg pa;
char pivot_min[PATH_MAX];
unsigned long norm_min;
int ret;
ret = _lookup_seq_open(&cl, CS_PIVOT, _LOOKUP_CASE_IGNORE);
if (ret)
return (ret);
norm_min = ULONG_MAX;
/* find pivot code */
ret = _lookup_seq_lookup(cl, src, &data);
while (ret == 0) {
ret = parse_line(&pa, &data);
if (ret)
break;
ret = find_dst(&pa, dst);
if (ret)
break;
if (pa.norm < norm_min) {
norm_min = pa.norm;
strlcpy(pivot_min, pa.dst, sizeof(pivot_min));
}
ret = _lookup_seq_next(cl, NULL, &data);
}
_lookup_seq_close(cl);
if (ret != ENOENT)
return (ret);
if (norm_min == ULONG_MAX)
return (ENOENT);
strlcpy(pivot, pivot_min, pvlen);
if (rnorm)
*rnorm = norm_min;
return (0);
}
static int
find_best_pivot(const char *src, const char *dst, char *pivot, size_t pvlen,
unsigned long *rnorm)
{
int ret;
ret = find_best_pivot_pvdb(src, dst, pivot, pvlen, rnorm);
if (ret == NO_SUCH_FILE)
ret = find_best_pivot_lookup(src, dst, pivot, pvlen, rnorm);
return (ret);
}
static __inline int
open_serial_mapper(struct _citrus_mapper_area *__restrict ma,
struct _citrus_mapper * __restrict * __restrict rcm,
const char *src, const char *pivot, const char *dst)
{
char buf[PATH_MAX];
snprintf(buf, sizeof(buf), "%s/%s,%s/%s", src, pivot, pivot, dst);
return (_mapper_open_direct(ma, rcm, "mapper_serial", buf));
}
static struct _citrus_csmapper *csm_none = NULL;
static int
get_none(struct _citrus_mapper_area *__restrict ma,
struct _citrus_csmapper *__restrict *__restrict rcsm)
{
int ret;
WLOCK(&ma_lock);
if (csm_none) {
*rcsm = csm_none;
ret = 0;
goto quit;
}
ret = _mapper_open_direct(ma, &csm_none, "mapper_none", "");
if (ret)
goto quit;
_mapper_set_persistent(csm_none);
*rcsm = csm_none;
ret = 0;
quit:
UNLOCK(&ma_lock);
return (ret);
}
int
_citrus_csmapper_open(struct _citrus_csmapper * __restrict * __restrict rcsm,
const char * __restrict src, const char * __restrict dst, uint32_t flags,
unsigned long *rnorm)
{
const char *realsrc, *realdst;
char buf1[PATH_MAX], buf2[PATH_MAX], key[PATH_MAX], pivot[PATH_MAX];
unsigned long norm;
int ret;
norm = 0;
ret = _citrus_mapper_create_area(&maparea, _PATH_CSMAPPER);
if (ret)
return (ret);
realsrc = _lookup_alias(CS_ALIAS, src, buf1, sizeof(buf1),
_LOOKUP_CASE_IGNORE);
realdst = _lookup_alias(CS_ALIAS, dst, buf2, sizeof(buf2),
_LOOKUP_CASE_IGNORE);
if (!strcmp(realsrc, realdst)) {
ret = get_none(maparea, rcsm);
if (ret == 0 && rnorm != NULL)
*rnorm = 0;
return (ret);
}
snprintf(key, sizeof(key), "%s/%s", realsrc, realdst);
ret = _mapper_open(maparea, rcsm, key);
if (ret == 0) {
if (rnorm != NULL)
*rnorm = 0;
return (0);
}
if (ret != ENOENT || (flags & _CSMAPPER_F_PREVENT_PIVOT)!=0)
return (ret);
ret = find_best_pivot(realsrc, realdst, pivot, sizeof(pivot), &norm);
if (ret)
return (ret);
ret = open_serial_mapper(maparea, rcsm, realsrc, pivot, realdst);
if (ret == 0 && rnorm != NULL)
*rnorm = norm;
return (ret);
}
diff --git a/lib/libc/iconv/citrus_csmapper.h b/lib/libc/iconv/citrus_csmapper.h
index cdc7b0e3375e..d19e754adb44 100644
--- a/lib/libc/iconv/citrus_csmapper.h
+++ b/lib/libc/iconv/citrus_csmapper.h
@@ -1,50 +1,49 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_csmapper.h,v 1.3 2013/06/24 17:28:35 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_CSMAPPER_H_
#define _CITRUS_CSMAPPER_H_
#define _citrus_csmapper _citrus_mapper
#define _citrus_csmapper_close _citrus_mapper_close
#define _citrus_csmapper_convert _citrus_mapper_convert
#define _citrus_csmapper_init_state _citrus_mapper_init_state
#define _citrus_csmapper_get_state_size _citrus_mapper_get_state_size
#define _citrus_csmapper_get_src_max _citrus_mapper_get_src_max
#define _citrus_csmapper_get_dst_max _citrus_mapper_get_dst_max
#define _CITRUS_CSMAPPER_F_PREVENT_PIVOT 0x00000001
__BEGIN_DECLS
int _citrus_csmapper_open(struct _citrus_csmapper *__restrict *__restrict,
const char *__restrict, const char *__restrict, uint32_t,
unsigned long *);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_db.c b/lib/libc/iconv/citrus_db.c
index 09df5bfaf07f..4a89a9cb86f4 100644
--- a/lib/libc/iconv/citrus_db.c
+++ b/lib/libc/iconv/citrus_db.c
@@ -1,333 +1,332 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db.c,v 1.5 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_db.h"
#include "citrus_db_factory.h"
#include "citrus_db_file.h"
struct _citrus_db {
struct _region db_region;
_citrus_db_hash_func_t db_hashfunc;
void *db_hashfunc_closure;
};
int
_citrus_db_open(struct _citrus_db **rdb, struct _region *r, const char *magic,
_citrus_db_hash_func_t hashfunc, void *hashfunc_closure)
{
struct _citrus_db *db;
struct _citrus_db_header_x *dhx;
struct _memstream ms;
_memstream_bind(&ms, r);
/* sanity check */
dhx = _memstream_getregion(&ms, NULL, sizeof(*dhx));
if (dhx == NULL)
return (EFTYPE);
if (strncmp(dhx->dhx_magic, magic, _CITRUS_DB_MAGIC_SIZE) != 0)
return (EFTYPE);
if (_memstream_seek(&ms, be32toh(dhx->dhx_entry_offset), SEEK_SET))
return (EFTYPE);
if (be32toh(dhx->dhx_num_entries)*_CITRUS_DB_ENTRY_SIZE >
_memstream_remainder(&ms))
return (EFTYPE);
db = malloc(sizeof(*db));
if (db == NULL)
return (errno);
db->db_region = *r;
db->db_hashfunc = hashfunc;
db->db_hashfunc_closure = hashfunc_closure;
*rdb = db;
return (0);
}
void
_citrus_db_close(struct _citrus_db *db)
{
free(db);
}
int
_citrus_db_lookup(struct _citrus_db *db, struct _citrus_region *key,
struct _citrus_region *data, struct _citrus_db_locator *dl)
{
struct _citrus_db_entry_x *dex;
struct _citrus_db_header_x *dhx;
struct _citrus_region r;
struct _memstream ms;
uint32_t hashval, num_entries;
size_t offset;
_memstream_bind(&ms, &db->db_region);
dhx = _memstream_getregion(&ms, NULL, sizeof(*dhx));
num_entries = be32toh(dhx->dhx_num_entries);
if (num_entries == 0)
return (ENOENT);
if (dl != NULL && dl->dl_offset>0) {
hashval = dl->dl_hashval;
offset = dl->dl_offset;
if (offset >= _region_size(&db->db_region))
return (ENOENT);
} else {
hashval = db->db_hashfunc(key)%num_entries;
offset = be32toh(dhx->dhx_entry_offset) +
hashval * _CITRUS_DB_ENTRY_SIZE;
if (dl)
dl->dl_hashval = hashval;
}
do {
/* seek to the next entry */
if (_citrus_memory_stream_seek(&ms, offset, SEEK_SET))
return (EFTYPE);
/* get the entry record */
dex = _memstream_getregion(&ms, NULL, _CITRUS_DB_ENTRY_SIZE);
if (dex == NULL)
return (EFTYPE);
/* jump to next entry having the same hash value. */
offset = be32toh(dex->dex_next_offset);
/* save the current position */
if (dl) {
dl->dl_offset = offset;
if (offset == 0)
dl->dl_offset = _region_size(&db->db_region);
}
/* compare hash value. */
if (be32toh(dex->dex_hash_value) != hashval)
/* not found */
break;
/* compare key length */
if (be32toh(dex->dex_key_size) == _region_size(key)) {
/* seek to the head of the key. */
if (_memstream_seek(&ms, be32toh(dex->dex_key_offset),
SEEK_SET))
return (EFTYPE);
/* get the region of the key */
if (_memstream_getregion(&ms, &r,
_region_size(key)) == NULL)
return (EFTYPE);
/* compare key byte stream */
if (memcmp(_region_head(&r), _region_head(key),
_region_size(key)) == 0) {
/* match */
if (_memstream_seek(
&ms, be32toh(dex->dex_data_offset),
SEEK_SET))
return (EFTYPE);
if (_memstream_getregion(
&ms, data,
be32toh(dex->dex_data_size)) == NULL)
return (EFTYPE);
return (0);
}
}
} while (offset != 0);
return (ENOENT);
}
int
_citrus_db_lookup_by_string(struct _citrus_db *db, const char *key,
struct _citrus_region *data, struct _citrus_db_locator *dl)
{
struct _region r;
_region_init(&r, __DECONST(void *, key), strlen(key));
return (_citrus_db_lookup(db, &r, data, dl));
}
int
_citrus_db_lookup8_by_string(struct _citrus_db *db, const char *key,
uint8_t *rval, struct _citrus_db_locator *dl)
{
struct _region r;
int ret;
ret = _citrus_db_lookup_by_string(db, key, &r, dl);
if (ret)
return (ret);
if (_region_size(&r) != 1)
return (EFTYPE);
if (rval)
memcpy(rval, _region_head(&r), 1);
return (0);
}
int
_citrus_db_lookup16_by_string(struct _citrus_db *db, const char *key,
uint16_t *rval, struct _citrus_db_locator *dl)
{
struct _region r;
int ret;
uint16_t val;
ret = _citrus_db_lookup_by_string(db, key, &r, dl);
if (ret)
return (ret);
if (_region_size(&r) != 2)
return (EFTYPE);
if (rval) {
memcpy(&val, _region_head(&r), 2);
*rval = be16toh(val);
}
return (0);
}
int
_citrus_db_lookup32_by_string(struct _citrus_db *db, const char *key,
uint32_t *rval, struct _citrus_db_locator *dl)
{
struct _region r;
uint32_t val;
int ret;
ret = _citrus_db_lookup_by_string(db, key, &r, dl);
if (ret)
return (ret);
if (_region_size(&r) != 4)
return (EFTYPE);
if (rval) {
memcpy(&val, _region_head(&r), 4);
*rval = be32toh(val);
}
return (0);
}
int
_citrus_db_lookup_string_by_string(struct _citrus_db *db, const char *key,
const char **rdata, struct _citrus_db_locator *dl)
{
struct _region r;
int ret;
ret = _citrus_db_lookup_by_string(db, key, &r, dl);
if (ret)
return (ret);
/* check whether the string is null terminated */
if (_region_size(&r) == 0)
return (EFTYPE);
if (*((const char*)_region_head(&r)+_region_size(&r)-1) != '\0')
return (EFTYPE);
if (rdata)
*rdata = _region_head(&r);
return (0);
}
int
_citrus_db_get_number_of_entries(struct _citrus_db *db)
{
struct _citrus_db_header_x *dhx;
struct _memstream ms;
_memstream_bind(&ms, &db->db_region);
dhx = _memstream_getregion(&ms, NULL, sizeof(*dhx));
return ((int)be32toh(dhx->dhx_num_entries));
}
int
_citrus_db_get_entry(struct _citrus_db *db, int idx, struct _region *key,
struct _region *data)
{
struct _citrus_db_entry_x *dex;
struct _citrus_db_header_x *dhx;
struct _memstream ms;
uint32_t num_entries;
size_t offset;
_memstream_bind(&ms, &db->db_region);
dhx = _memstream_getregion(&ms, NULL, sizeof(*dhx));
num_entries = be32toh(dhx->dhx_num_entries);
if (idx < 0 || (uint32_t)idx >= num_entries)
return (EINVAL);
/* seek to the next entry */
offset = be32toh(dhx->dhx_entry_offset) + idx * _CITRUS_DB_ENTRY_SIZE;
if (_citrus_memory_stream_seek(&ms, offset, SEEK_SET))
return (EFTYPE);
/* get the entry record */
dex = _memstream_getregion(&ms, NULL, _CITRUS_DB_ENTRY_SIZE);
if (dex == NULL)
return (EFTYPE);
/* seek to the head of the key. */
if (_memstream_seek(&ms, be32toh(dex->dex_key_offset), SEEK_SET))
return (EFTYPE);
/* get the region of the key. */
if (_memstream_getregion(&ms, key, be32toh(dex->dex_key_size))==NULL)
return (EFTYPE);
/* seek to the head of the data. */
if (_memstream_seek(&ms, be32toh(dex->dex_data_offset), SEEK_SET))
return (EFTYPE);
/* get the region of the data. */
if (_memstream_getregion(&ms, data, be32toh(dex->dex_data_size))==NULL)
return (EFTYPE);
return (0);
}
diff --git a/lib/libc/iconv/citrus_db.h b/lib/libc/iconv/citrus_db.h
index fd46675a5d0b..b885df55c53f 100644
--- a/lib/libc/iconv/citrus_db.h
+++ b/lib/libc/iconv/citrus_db.h
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db.h,v 1.2 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_DB_H_
#define _CITRUS_DB_H_
#include "citrus_db_factory.h"
struct _citrus_db;
struct _citrus_db_locator {
uint32_t dl_hashval;
size_t dl_offset;
};
__BEGIN_DECLS
int _citrus_db_open(struct _citrus_db **, struct _citrus_region *,
const char *, _citrus_db_hash_func_t, void *);
void _citrus_db_close(struct _citrus_db *);
int _citrus_db_lookup(struct _citrus_db *, struct _citrus_region *,
struct _citrus_region *, struct _citrus_db_locator *);
int _citrus_db_lookup_by_string(struct _citrus_db *, const char *,
struct _citrus_region *, struct _citrus_db_locator *);
int _citrus_db_lookup8_by_string(struct _citrus_db *, const char *,
uint8_t *, struct _citrus_db_locator *);
int _citrus_db_lookup16_by_string(struct _citrus_db *, const char *,
uint16_t *, struct _citrus_db_locator *);
int _citrus_db_lookup32_by_string(struct _citrus_db *, const char *,
uint32_t *, struct _citrus_db_locator *);
int _citrus_db_lookup_string_by_string(struct _citrus_db *, const char *,
const char **, struct _citrus_db_locator *);
int _citrus_db_get_number_of_entries(struct _citrus_db *);
int _citrus_db_get_entry(struct _citrus_db *, int,
struct _citrus_region *, struct _citrus_region *);
__END_DECLS
static __inline void
_citrus_db_locator_init(struct _citrus_db_locator *dl)
{
dl->dl_hashval = 0;
dl->dl_offset = 0;
}
#endif
diff --git a/lib/libc/iconv/citrus_db_factory.c b/lib/libc/iconv/citrus_db_factory.c
index fd3375d6b2e0..589c1f43a60b 100644
--- a/lib/libc/iconv/citrus_db_factory.c
+++ b/lib/libc/iconv/citrus_db_factory.c
@@ -1,339 +1,338 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db_factory.c,v 1.10 2013/09/14 13:05:51 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <sys/queue.h>
#include <arpa/inet.h>
#include <assert.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_region.h"
#include "citrus_db_file.h"
#include "citrus_db_factory.h"
struct _citrus_db_factory_entry {
STAILQ_ENTRY(_citrus_db_factory_entry) de_entry;
struct _citrus_db_factory_entry *de_next;
uint32_t de_hashvalue;
struct _region de_key;
int de_key_free;
struct _region de_data;
int de_data_free;
int de_idx;
};
struct _citrus_db_factory {
size_t df_num_entries;
STAILQ_HEAD(, _citrus_db_factory_entry) df_entries;
size_t df_total_key_size;
size_t df_total_data_size;
uint32_t (*df_hashfunc)(struct _citrus_region *);
void *df_hashfunc_closure;
};
#define DB_ALIGN 16
int
_citrus_db_factory_create(struct _citrus_db_factory **rdf,
_citrus_db_hash_func_t hashfunc, void *hashfunc_closure)
{
struct _citrus_db_factory *df;
df = malloc(sizeof(*df));
if (df == NULL)
return (errno);
df->df_num_entries = 0;
df->df_total_key_size = df->df_total_data_size = 0;
STAILQ_INIT(&df->df_entries);
df->df_hashfunc = hashfunc;
df->df_hashfunc_closure = hashfunc_closure;
*rdf = df;
return (0);
}
void
_citrus_db_factory_free(struct _citrus_db_factory *df)
{
struct _citrus_db_factory_entry *de;
while ((de = STAILQ_FIRST(&df->df_entries)) != NULL) {
STAILQ_REMOVE_HEAD(&df->df_entries, de_entry);
if (de->de_key_free)
free(_region_head(&de->de_key));
if (de->de_data_free)
free(_region_head(&de->de_data));
free(de);
}
free(df);
}
static __inline size_t
ceilto(size_t sz)
{
return ((sz + DB_ALIGN - 1) & ~(DB_ALIGN - 1));
}
int
_citrus_db_factory_add(struct _citrus_db_factory *df, struct _region *key,
int keyfree, struct _region *data, int datafree)
{
struct _citrus_db_factory_entry *de;
de = malloc(sizeof(*de));
if (de == NULL)
return (-1);
de->de_hashvalue = df->df_hashfunc(key);
de->de_key = *key;
de->de_key_free = keyfree;
de->de_data = *data;
de->de_data_free = datafree;
de->de_idx = -1;
STAILQ_INSERT_TAIL(&df->df_entries, de, de_entry);
df->df_total_key_size += _region_size(key);
df->df_total_data_size += ceilto(_region_size(data));
df->df_num_entries++;
return (0);
}
int
_citrus_db_factory_add_by_string(struct _citrus_db_factory *df,
const char *key, struct _citrus_region *data, int datafree)
{
struct _region r;
char *tmp;
tmp = strdup(key);
if (tmp == NULL)
return (errno);
_region_init(&r, tmp, strlen(key));
return _citrus_db_factory_add(df, &r, 1, data, datafree);
}
int
_citrus_db_factory_add8_by_string(struct _citrus_db_factory *df,
const char *key, uint8_t val)
{
struct _region r;
uint8_t *p;
p = malloc(sizeof(*p));
if (p == NULL)
return (errno);
*p = val;
_region_init(&r, p, 1);
return (_citrus_db_factory_add_by_string(df, key, &r, 1));
}
int
_citrus_db_factory_add16_by_string(struct _citrus_db_factory *df,
const char *key, uint16_t val)
{
struct _region r;
uint16_t *p;
p = malloc(sizeof(*p));
if (p == NULL)
return (errno);
*p = htons(val);
_region_init(&r, p, 2);
return (_citrus_db_factory_add_by_string(df, key, &r, 1));
}
int
_citrus_db_factory_add32_by_string(struct _citrus_db_factory *df,
const char *key, uint32_t val)
{
struct _region r;
uint32_t *p;
p = malloc(sizeof(*p));
if (p == NULL)
return (errno);
*p = htonl(val);
_region_init(&r, p, 4);
return (_citrus_db_factory_add_by_string(df, key, &r, 1));
}
int
_citrus_db_factory_add_string_by_string(struct _citrus_db_factory *df,
const char *key, const char *data)
{
char *p;
struct _region r;
p = strdup(data);
if (p == NULL)
return (errno);
_region_init(&r, p, strlen(p) + 1);
return (_citrus_db_factory_add_by_string(df, key, &r, 1));
}
size_t
_citrus_db_factory_calc_size(struct _citrus_db_factory *df)
{
size_t sz;
sz = ceilto(_CITRUS_DB_HEADER_SIZE);
sz += ceilto(_CITRUS_DB_ENTRY_SIZE * df->df_num_entries);
sz += ceilto(df->df_total_key_size);
sz += df->df_total_data_size;
return (sz);
}
static __inline void
put8(struct _region *r, size_t *rofs, uint8_t val)
{
*(uint8_t *)_region_offset(r, *rofs) = val;
*rofs += 1;
}
static __inline void
put32(struct _region *r, size_t *rofs, uint32_t val)
{
val = htonl(val);
memcpy(_region_offset(r, *rofs), &val, 4);
*rofs += 4;
}
static __inline void
putpad(struct _region *r, size_t *rofs)
{
size_t i;
for (i = ceilto(*rofs) - *rofs; i > 0; i--)
put8(r, rofs, 0);
}
static __inline void
dump_header(struct _region *r, const char *magic, size_t *rofs,
size_t num_entries)
{
while (*rofs<_CITRUS_DB_MAGIC_SIZE)
put8(r, rofs, *magic++);
put32(r, rofs, num_entries);
put32(r, rofs, _CITRUS_DB_HEADER_SIZE);
}
int
_citrus_db_factory_serialize(struct _citrus_db_factory *df, const char *magic,
struct _region *r)
{
struct _citrus_db_factory_entry *de, **depp, *det;
size_t dataofs, i, keyofs, nextofs, ofs;
ofs = 0;
/* check whether more than 0 entries exist */
if (df->df_num_entries == 0) {
dump_header(r, magic, &ofs, 0);
return (0);
}
/* allocate hash table */
depp = calloc(df->df_num_entries, sizeof(*depp));
if (depp == NULL)
return (-1);
/* step1: store the entries which are not conflicting */
STAILQ_FOREACH(de, &df->df_entries, de_entry) {
de->de_hashvalue %= df->df_num_entries;
de->de_idx = -1;
de->de_next = NULL;
if (depp[de->de_hashvalue] == NULL) {
depp[de->de_hashvalue] = de;
de->de_idx = (int)de->de_hashvalue;
}
}
/* step2: resolve conflicts */
i = 0;
STAILQ_FOREACH(de, &df->df_entries, de_entry) {
if (de->de_idx == -1) {
det = depp[de->de_hashvalue];
while (det->de_next != NULL)
det = det->de_next;
det->de_next = de;
while (depp[i] != NULL)
i++;
depp[i] = de;
de->de_idx = (int)i;
}
}
keyofs = _CITRUS_DB_HEADER_SIZE +
ceilto(df->df_num_entries*_CITRUS_DB_ENTRY_SIZE);
dataofs = keyofs + ceilto(df->df_total_key_size);
/* dump header */
dump_header(r, magic, &ofs, df->df_num_entries);
/* dump entries */
for (i = 0; i < df->df_num_entries; i++) {
de = depp[i];
nextofs = 0;
if (de->de_next) {
nextofs = _CITRUS_DB_HEADER_SIZE +
de->de_next->de_idx * _CITRUS_DB_ENTRY_SIZE;
}
put32(r, &ofs, de->de_hashvalue);
put32(r, &ofs, nextofs);
put32(r, &ofs, keyofs);
put32(r, &ofs, _region_size(&de->de_key));
put32(r, &ofs, dataofs);
put32(r, &ofs, _region_size(&de->de_data));
memcpy(_region_offset(r, keyofs),
_region_head(&de->de_key), _region_size(&de->de_key));
keyofs += _region_size(&de->de_key);
memcpy(_region_offset(r, dataofs),
_region_head(&de->de_data), _region_size(&de->de_data));
dataofs += _region_size(&de->de_data);
putpad(r, &dataofs);
}
putpad(r, &ofs);
putpad(r, &keyofs);
free(depp);
return (0);
}
diff --git a/lib/libc/iconv/citrus_db_factory.h b/lib/libc/iconv/citrus_db_factory.h
index c542046532c1..cf3c1b166cb7 100644
--- a/lib/libc/iconv/citrus_db_factory.h
+++ b/lib/libc/iconv/citrus_db_factory.h
@@ -1,59 +1,58 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db_factory.h,v 1.3 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_DB_FACTORY_H_
#define _CITRUS_DB_FACTORY_H_
struct _citrus_db_factory;
typedef uint32_t (*_citrus_db_hash_func_t)(struct _citrus_region *);
__BEGIN_DECLS
int _citrus_db_factory_create(struct _citrus_db_factory **,
_citrus_db_hash_func_t, void *);
void _citrus_db_factory_free(struct _citrus_db_factory *);
int _citrus_db_factory_add(struct _citrus_db_factory *,
struct _citrus_region *, int, struct _citrus_region *, int);
int _citrus_db_factory_add_by_string(struct _citrus_db_factory *,
const char *, struct _citrus_region *, int);
int _citrus_db_factory_add8_by_string(struct _citrus_db_factory *,
const char *, uint8_t);
int _citrus_db_factory_add16_by_string(struct _citrus_db_factory *,
const char *, uint16_t);
int _citrus_db_factory_add32_by_string(struct _citrus_db_factory *,
const char *, uint32_t);
int _citrus_db_factory_add_string_by_string(struct _citrus_db_factory *,
const char *, const char *);
size_t _citrus_db_factory_calc_size(struct _citrus_db_factory *);
int _citrus_db_factory_serialize(struct _citrus_db_factory *,
const char *, struct _citrus_region *);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_db_file.h b/lib/libc/iconv/citrus_db_file.h
index 7eea27694746..6fedc6064646 100644
--- a/lib/libc/iconv/citrus_db_file.h
+++ b/lib/libc/iconv/citrus_db_file.h
@@ -1,87 +1,86 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db_file.h,v 1.4 2008/02/10 05:58:22 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_DB_FILE_H_
#define _CITRUS_DB_FILE_H_
/*
* db format:
* +---
* | header
* | - magic
* | - num entries
* +---
* | entry directory
* | +------------
* | | entry0
* | | - hash value
* | | - next entry
* | | - key offset
* | | - key len
* | | - data offset
* | | - data size
* | |---
* | | entry1
* | | ..
* | | entryN
* | +---
* +---
* | key table
* | - key0
* | ...
* | - keyN
* +---
* | data table
* | - data0
* | ...
* | - dataN
* +---
*/
#define _CITRUS_DB_MAGIC_SIZE 8
#define _CITRUS_DB_HEADER_SIZE 16
struct _citrus_db_header_x {
char dhx_magic[_CITRUS_DB_MAGIC_SIZE];
uint32_t dhx_num_entries;
uint32_t dhx_entry_offset;
} __packed;
struct _citrus_db_entry_x {
uint32_t dex_hash_value;
uint32_t dex_next_offset;
uint32_t dex_key_offset;
uint32_t dex_key_size;
uint32_t dex_data_offset;
uint32_t dex_data_size;
} __packed;
#define _CITRUS_DB_ENTRY_SIZE 24
#endif
diff --git a/lib/libc/iconv/citrus_db_hash.c b/lib/libc/iconv/citrus_db_hash.c
index 1033c3fe8867..9e9918e38655 100644
--- a/lib/libc/iconv/citrus_db_hash.c
+++ b/lib/libc/iconv/citrus_db_hash.c
@@ -1,66 +1,65 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db_hash.c,v 1.5 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_db_hash.h"
uint32_t
_citrus_db_hash_std(struct _region *r)
{
const uint8_t *p;
uint32_t hash, tmp;
size_t i;
hash = 0;
p = _region_head(r);
for (i = _region_size(r); i > 0; i--) {
hash <<= 4;
hash += _bcs_tolower(*p);
tmp = hash & 0xF0000000;
if (tmp != 0) {
hash ^= tmp;
hash ^= tmp >> 24;
}
p++;
}
return (hash);
}
diff --git a/lib/libc/iconv/citrus_db_hash.h b/lib/libc/iconv/citrus_db_hash.h
index ca2caa5282af..5f8703396502 100644
--- a/lib/libc/iconv/citrus_db_hash.h
+++ b/lib/libc/iconv/citrus_db_hash.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_db_hash.h,v 1.2 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_DB_HASH_H_
#define _CITRUS_DB_HASH_H_
__BEGIN_DECLS
uint32_t _citrus_db_hash_std(struct _citrus_region *);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_esdb.c b/lib/libc/iconv/citrus_esdb.c
index a07d5d09e72f..15c107566101 100644
--- a/lib/libc/iconv/citrus_esdb.c
+++ b/lib/libc/iconv/citrus_esdb.c
@@ -1,368 +1,367 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_esdb.c,v 1.5 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <paths.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_lookup.h"
#include "citrus_db.h"
#include "citrus_db_hash.h"
#include "citrus_esdb.h"
#include "citrus_esdb_file.h"
#define ESDB_DIR "esdb.dir"
#define ESDB_ALIAS "esdb.alias"
/*
* _citrus_esdb_alias:
* resolve encoding scheme name aliases.
*/
const char *
_citrus_esdb_alias(const char *esname, char *buf, size_t bufsize)
{
return (_lookup_alias(_PATH_ESDB "/" ESDB_ALIAS, esname, buf, bufsize,
_LOOKUP_CASE_IGNORE));
}
/*
* conv_esdb:
* external representation -> local structure.
*/
static int
conv_esdb(struct _citrus_esdb *esdb, struct _region *fr)
{
struct _citrus_db *db;
const char *str;
char buf[100];
uint32_t csid, i, num_charsets, tmp, version;
int ret;
/* open db */
ret = _db_open(&db, fr, _CITRUS_ESDB_MAGIC, &_db_hash_std, NULL);
if (ret)
goto err0;
/* check version */
ret = _db_lookup32_by_s(db, _CITRUS_ESDB_SYM_VERSION, &version, NULL);
if (ret)
goto err1;
switch (version) {
case 0x00000001:
/* current version */
/* initial version */
break;
default:
ret = EFTYPE;
goto err1;
}
/* get encoding/variable */
ret = _db_lookupstr_by_s(db, _CITRUS_ESDB_SYM_ENCODING, &str, NULL);
if (ret)
goto err1;
esdb->db_encname = strdup(str);
if (esdb->db_encname == NULL) {
ret = errno;
goto err1;
}
esdb->db_len_variable = 0;
esdb->db_variable = NULL;
ret = _db_lookupstr_by_s(db, _CITRUS_ESDB_SYM_VARIABLE, &str, NULL);
if (ret == 0) {
esdb->db_len_variable = strlen(str) + 1;
esdb->db_variable = strdup(str);
if (esdb->db_variable == NULL) {
ret = errno;
goto err2;
}
} else if (ret != ENOENT)
goto err2;
/* get number of charsets */
ret = _db_lookup32_by_s(db, _CITRUS_ESDB_SYM_NUM_CHARSETS,
&num_charsets, NULL);
if (ret)
goto err3;
esdb->db_num_charsets = num_charsets;
/* get invalid character */
ret = _db_lookup32_by_s(db, _CITRUS_ESDB_SYM_INVALID, &tmp, NULL);
if (ret == 0) {
esdb->db_use_invalid = 1;
esdb->db_invalid = tmp;
} else if (ret == ENOENT)
esdb->db_use_invalid = 0;
else
goto err3;
/* get charsets */
esdb->db_charsets = malloc(num_charsets * sizeof(*esdb->db_charsets));
if (esdb->db_charsets == NULL) {
ret = errno;
goto err3;
}
for (i = 0; i < num_charsets; i++) {
snprintf(buf, sizeof(buf),
_CITRUS_ESDB_SYM_CSID_PREFIX "%d", i);
ret = _db_lookup32_by_s(db, buf, &csid, NULL);
if (ret)
goto err4;
esdb->db_charsets[i].ec_csid = csid;
snprintf(buf, sizeof(buf),
_CITRUS_ESDB_SYM_CSNAME_PREFIX "%d", i);
ret = _db_lookupstr_by_s(db, buf, &str, NULL);
if (ret)
goto err4;
esdb->db_charsets[i].ec_csname = strdup(str);
if (esdb->db_charsets[i].ec_csname == NULL) {
ret = errno;
goto err4;
}
}
_db_close(db);
return (0);
err4:
for (; i > 0; i--)
free(esdb->db_charsets[i - 1].ec_csname);
free(esdb->db_charsets);
err3:
free(esdb->db_variable);
err2:
free(esdb->db_encname);
err1:
_db_close(db);
if (ret == ENOENT)
ret = EFTYPE;
err0:
return (ret);
}
/*
* _citrus_esdb_open:
* open an ESDB file.
*/
int
_citrus_esdb_open(struct _citrus_esdb *db, const char *esname)
{
struct _region fr;
const char *realname, *encfile;
char buf1[PATH_MAX], buf2[PATH_MAX], path[PATH_MAX];
int ret;
snprintf(path, sizeof(path), "%s/%s", _PATH_ESDB, ESDB_ALIAS);
realname = _lookup_alias(path, esname, buf1, sizeof(buf1),
_LOOKUP_CASE_IGNORE);
snprintf(path, sizeof(path), "%s/%s", _PATH_ESDB, ESDB_DIR);
encfile = _lookup_simple(path, realname, buf2, sizeof(buf2),
_LOOKUP_CASE_IGNORE);
if (encfile == NULL)
return (ENOENT);
/* open file */
snprintf(path, sizeof(path), "%s/%s", _PATH_ESDB, encfile);
ret = _map_file(&fr, path);
if (ret)
return (ret);
ret = conv_esdb(db, &fr);
_unmap_file(&fr);
return (ret);
}
/*
* _citrus_esdb_close:
* free an ESDB.
*/
void
_citrus_esdb_close(struct _citrus_esdb *db)
{
for (int i = 0; i < db->db_num_charsets; i++)
free(db->db_charsets[i].ec_csname);
db->db_num_charsets = 0;
free(db->db_charsets); db->db_charsets = NULL;
free(db->db_encname); db->db_encname = NULL;
db->db_len_variable = 0;
free(db->db_variable); db->db_variable = NULL;
}
/*
* _citrus_esdb_free_list:
* free the list.
*/
void
_citrus_esdb_free_list(char **list, size_t num)
{
for (size_t i = 0; i < num; i++)
free(list[i]);
free(list);
}
/*
* _citrus_esdb_get_list:
* get esdb entries.
*/
int
_citrus_esdb_get_list(char ***rlist, size_t *rnum, bool sorted)
{
struct _citrus_lookup *cla, *cld;
struct _region key, data;
char **list, **q;
char buf[PATH_MAX];
size_t num;
int ret;
ret = _lookup_seq_open(&cla, _PATH_ESDB "/" ESDB_ALIAS,
_LOOKUP_CASE_IGNORE);
if (ret)
goto quit0;
ret = _lookup_seq_open(&cld, _PATH_ESDB "/" ESDB_DIR,
_LOOKUP_CASE_IGNORE);
if (ret)
goto quit1;
/* count number of entries */
num = _lookup_get_num_entries(cla) + _lookup_get_num_entries(cld);
_lookup_seq_rewind(cla);
_lookup_seq_rewind(cld);
/* allocate list pointer space */
list = malloc(num * sizeof(char *));
num = 0;
if (list == NULL) {
ret = errno;
goto quit3;
}
/* get alias entries */
while ((ret = _lookup_seq_next(cla, &key, &data)) == 0) {
/* XXX: sorted? */
snprintf(buf, sizeof(buf), "%.*s/%.*s",
(int)_region_size(&data),
(const char *)_region_head(&data),
(int)_region_size(&key),
(const char *)_region_head(&key));
_bcs_convert_to_upper(buf);
list[num] = strdup(buf);
if (list[num] == NULL) {
ret = errno;
goto quit3;
}
num++;
}
if (ret != ENOENT)
goto quit3;
/* get dir entries */
while ((ret = _lookup_seq_next(cld, &key, &data)) == 0) {
if (!sorted)
snprintf(buf, sizeof(buf), "%.*s",
(int)_region_size(&key),
(const char *)_region_head(&key));
else {
/* check duplicated entry */
char *p;
char buf1[PATH_MAX];
snprintf(buf1, sizeof(buf1), "%.*s",
(int)_region_size(&data),
(const char *)_region_head(&data));
if ((p = strchr(buf1, '/')) != NULL)
memmove(buf1, p + 1, strlen(p) - 1);
if ((p = strstr(buf1, ".esdb")) != NULL)
*p = '\0';
snprintf(buf, sizeof(buf), "%s/%.*s", buf1,
(int)_region_size(&key),
(const char *)_region_head(&key));
}
_bcs_convert_to_upper(buf);
ret = _lookup_seq_lookup(cla, buf, NULL);
if (ret) {
if (ret != ENOENT)
goto quit3;
/* not duplicated */
list[num] = strdup(buf);
if (list[num] == NULL) {
ret = errno;
goto quit3;
}
num++;
}
}
if (ret != ENOENT)
goto quit3;
ret = 0;
/* XXX: why reallocing the list space posteriorly?
shouldn't be done earlier? */
q = reallocarray(list, num, sizeof(char *));
if (!q) {
ret = ENOMEM;
goto quit3;
}
list = q;
*rlist = list;
*rnum = num;
quit3:
if (ret)
_citrus_esdb_free_list(list, num);
_lookup_seq_close(cld);
quit1:
_lookup_seq_close(cla);
quit0:
return (ret);
}
diff --git a/lib/libc/iconv/citrus_esdb.h b/lib/libc/iconv/citrus_esdb.h
index a2fb8041554d..3c4ef2f7e1e6 100644
--- a/lib/libc/iconv/citrus_esdb.h
+++ b/lib/libc/iconv/citrus_esdb.h
@@ -1,60 +1,59 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_esdb.h,v 1.1 2003/06/25 09:51:32 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ESDB_H_
#define _CITRUS_ESDB_H_
#include "citrus_types.h"
struct _citrus_esdb_charset {
_citrus_csid_t ec_csid;
char *ec_csname;
};
struct _citrus_esdb {
char *db_encname;
void *db_variable;
size_t db_len_variable;
int db_num_charsets;
struct _citrus_esdb_charset *db_charsets;
int db_use_invalid;
_citrus_wc_t db_invalid;
};
__BEGIN_DECLS
const char *_citrus_esdb_alias(const char *, char *, size_t);
int _citrus_esdb_open(struct _citrus_esdb *, const char *);
void _citrus_esdb_close(struct _citrus_esdb *);
void _citrus_esdb_free_list(char **, size_t);
int _citrus_esdb_get_list(char ***, size_t *, bool);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_esdb_file.h b/lib/libc/iconv/citrus_esdb_file.h
index 518d35587326..81548d49c061 100644
--- a/lib/libc/iconv/citrus_esdb_file.h
+++ b/lib/libc/iconv/citrus_esdb_file.h
@@ -1,47 +1,46 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_esdb_file.h,v 1.1 2003/06/25 09:51:32 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ESDB_FILE_H_
#define _CITRUS_ESDB_FILE_H_
#define _CITRUS_ESDB_MAGIC "ESDB\0\0\0\0"
#define _CITRUS_ESDB_SYM_VERSION "version"
#define _CITRUS_ESDB_SYM_ENCODING "encoding"
#define _CITRUS_ESDB_SYM_VARIABLE "variable"
#define _CITRUS_ESDB_SYM_NUM_CHARSETS "num_charsets"
#define _CITRUS_ESDB_SYM_INVALID "invalid"
#define _CITRUS_ESDB_SYM_CSNAME_PREFIX "csname_"
#define _CITRUS_ESDB_SYM_CSID_PREFIX "csid_"
#define _CITRUS_ESDB_VERSION 0x00000001
#endif
diff --git a/lib/libc/iconv/citrus_fix_grouping.h b/lib/libc/iconv/citrus_fix_grouping.h
index 31f9c23f42de..460989426b53 100644
--- a/lib/libc/iconv/citrus_fix_grouping.h
+++ b/lib/libc/iconv/citrus_fix_grouping.h
@@ -1,55 +1,54 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_fix_grouping.h,v 1.2 2009/01/11 02:46:24 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2008 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_FIX_GROUPING_H_
#define _CITRUS_FIX_GROUPING_H_
#define _CITRUS_LC_GROUPING_VALUE_MIN 0
#define _CITRUS_LC_GROUPING_VALUE_MAX 126
#define _CITRUS_LC_GROUPING_VALUE_NO_FUTHER 127
#if CHAR_MAX != _CITRUS_LC_GROUPING_VALUE_NO_FUTHER
static __inline void
_citrus_fixup_char_max_md(char *grouping)
{
char *p;
for (p = grouping; *p != '\0'; ++p)
if (*p == _CITRUS_LC_GROUPING_VALUE_NO_FUTHER)
*p = (char)CHAR_MAX;
}
#define _CITRUS_FIXUP_CHAR_MAX_MD(grouping) \
_citrus_fixup_char_max_md(__DECONST(void *, grouping))
#else
#define _CITRUS_FIXUP_CHAR_MAX_MD(grouping) /* nothing to do */
#endif
#endif /*_CITRUS_FIX_GROUPING_H_*/
diff --git a/lib/libc/iconv/citrus_hash.c b/lib/libc/iconv/citrus_hash.c
index aff6d55bcfbd..9dcf86354b3d 100644
--- a/lib/libc/iconv/citrus_hash.c
+++ b/lib/libc/iconv/citrus_hash.c
@@ -1,53 +1,52 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_hash.c,v 1.3 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_region.h"
#include "citrus_hash.h"
#include "citrus_db_hash.h"
int
_citrus_string_hash_func(const char *key, int hashsize)
{
struct _region r;
_region_init(&r, __DECONST(void *, key), strlen(key));
return ((int)(_db_hash_std(&r) % (uint32_t)hashsize));
}
diff --git a/lib/libc/iconv/citrus_hash.h b/lib/libc/iconv/citrus_hash.h
index 62f2ae23b872..d44571d00a40 100644
--- a/lib/libc/iconv/citrus_hash.h
+++ b/lib/libc/iconv/citrus_hash.h
@@ -1,61 +1,60 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_hash.h,v 1.3 2004/01/02 21:49:35 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_HASH_H_
#define _CITRUS_HASH_H_
#define _CITRUS_HASH_ENTRY(type) LIST_ENTRY(type)
#define _CITRUS_HASH_HEAD(headname, type, hashsize) \
struct headname { \
LIST_HEAD(, type) chh_table[hashsize]; \
}
#define _CITRUS_HASH_INIT(head, hashsize) \
do { \
int _ch_loop; \
\
for (_ch_loop = 0; _ch_loop < hashsize; _ch_loop++) \
LIST_INIT(&(head)->chh_table[_ch_loop]); \
} while (0)
#define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
#define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
#define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
do { \
LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
if (matchfunc((elm), key) == 0) \
break; \
} while (0)
__BEGIN_DECLS
int _citrus_string_hash_func(const char *, int);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_iconv.c b/lib/libc/iconv/citrus_iconv.c
index fbabf6524399..73986cb5b033 100644
--- a/lib/libc/iconv/citrus_iconv.c
+++ b/lib/libc/iconv/citrus_iconv.c
@@ -1,361 +1,360 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv.c,v 1.10 2011/11/19 18:34:21 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <sys/queue.h>
#include <assert.h>
#include <dirent.h>
#include <errno.h>
#include <iconv.h>
#include <langinfo.h>
#include <limits.h>
#include <paths.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#include "citrus_esdb.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_module.h"
#include "citrus_lock.h"
#include "citrus_lookup.h"
#include "citrus_hash.h"
#include "citrus_iconv.h"
#define _CITRUS_ICONV_DIR "iconv.dir"
#define _CITRUS_ICONV_ALIAS "iconv.alias"
#define CI_HASH_SIZE 101
#define CI_INITIAL_MAX_REUSE 5
#define CI_ENV_MAX_REUSE "ICONV_MAX_REUSE"
static bool isinit = false;
static int shared_max_reuse, shared_num_unused;
static _CITRUS_HASH_HEAD(, _citrus_iconv_shared, CI_HASH_SIZE) shared_pool;
static TAILQ_HEAD(, _citrus_iconv_shared) shared_unused;
static pthread_rwlock_t ci_lock = PTHREAD_RWLOCK_INITIALIZER;
static __inline void
init_cache(void)
{
WLOCK(&ci_lock);
if (!isinit) {
_CITRUS_HASH_INIT(&shared_pool, CI_HASH_SIZE);
TAILQ_INIT(&shared_unused);
shared_max_reuse = -1;
if (!issetugid() && getenv(CI_ENV_MAX_REUSE))
shared_max_reuse = atoi(getenv(CI_ENV_MAX_REUSE));
if (shared_max_reuse < 0)
shared_max_reuse = CI_INITIAL_MAX_REUSE;
isinit = true;
}
UNLOCK(&ci_lock);
}
static __inline void
close_shared(struct _citrus_iconv_shared *ci)
{
if (ci) {
if (ci->ci_module) {
if (ci->ci_ops) {
if (ci->ci_closure)
(*ci->ci_ops->io_uninit_shared)(ci);
free(ci->ci_ops);
}
_citrus_unload_module(ci->ci_module);
}
free(ci);
}
}
static __inline int
open_shared(struct _citrus_iconv_shared * __restrict * __restrict rci,
const char * __restrict convname, const char * __restrict src,
const char * __restrict dst)
{
struct _citrus_iconv_shared *ci;
_citrus_iconv_getops_t getops;
const char *module;
size_t len_convname;
int ret;
#ifdef INCOMPATIBLE_WITH_GNU_ICONV
/*
* Sadly, the gnu tools expect iconv to actually parse the
* byte stream and don't allow for a pass-through when
* the (src,dest) encodings are the same.
* See gettext-0.18.3+ NEWS:
* msgfmt now checks PO file headers more strictly with less
* false-positives.
* NetBSD don't do this either.
*/
module = (strcmp(src, dst) != 0) ? "iconv_std" : "iconv_none";
#else
module = "iconv_std";
#endif
/* initialize iconv handle */
len_convname = strlen(convname);
ci = malloc(sizeof(*ci) + len_convname + 1);
if (!ci) {
ret = errno;
goto err;
}
ci->ci_module = NULL;
ci->ci_ops = NULL;
ci->ci_closure = NULL;
ci->ci_convname = (void *)&ci[1];
memcpy(ci->ci_convname, convname, len_convname + 1);
/* load module */
ret = _citrus_load_module(&ci->ci_module, module);
if (ret)
goto err;
/* get operators */
getops = (_citrus_iconv_getops_t)_citrus_find_getops(ci->ci_module,
module, "iconv");
if (!getops) {
ret = EOPNOTSUPP;
goto err;
}
ci->ci_ops = malloc(sizeof(*ci->ci_ops));
if (!ci->ci_ops) {
ret = errno;
goto err;
}
ret = (*getops)(ci->ci_ops);
if (ret)
goto err;
if (ci->ci_ops->io_init_shared == NULL ||
ci->ci_ops->io_uninit_shared == NULL ||
ci->ci_ops->io_init_context == NULL ||
ci->ci_ops->io_uninit_context == NULL ||
ci->ci_ops->io_convert == NULL) {
ret = EINVAL;
goto err;
}
/* initialize the converter */
ret = (*ci->ci_ops->io_init_shared)(ci, src, dst);
if (ret)
goto err;
*rci = ci;
return (0);
err:
close_shared(ci);
return (ret);
}
static __inline int
hash_func(const char *key)
{
return (_string_hash_func(key, CI_HASH_SIZE));
}
static __inline int
match_func(struct _citrus_iconv_shared * __restrict ci,
const char * __restrict key)
{
return (strcmp(ci->ci_convname, key));
}
static int
get_shared(struct _citrus_iconv_shared * __restrict * __restrict rci,
const char *src, const char *dst)
{
struct _citrus_iconv_shared * ci;
char convname[PATH_MAX];
int hashval, ret = 0;
snprintf(convname, sizeof(convname), "%s/%s", src, dst);
WLOCK(&ci_lock);
/* lookup alread existing entry */
hashval = hash_func(convname);
_CITRUS_HASH_SEARCH(&shared_pool, ci, ci_hash_entry, match_func,
convname, hashval);
if (ci != NULL) {
/* found */
if (ci->ci_used_count == 0) {
TAILQ_REMOVE(&shared_unused, ci, ci_tailq_entry);
shared_num_unused--;
}
ci->ci_used_count++;
*rci = ci;
goto quit;
}
/* create new entry */
ret = open_shared(&ci, convname, src, dst);
if (ret)
goto quit;
_CITRUS_HASH_INSERT(&shared_pool, ci, ci_hash_entry, hashval);
ci->ci_used_count = 1;
*rci = ci;
quit:
UNLOCK(&ci_lock);
return (ret);
}
static void
release_shared(struct _citrus_iconv_shared * __restrict ci)
{
WLOCK(&ci_lock);
ci->ci_used_count--;
if (ci->ci_used_count == 0) {
/* put it into unused list */
shared_num_unused++;
TAILQ_INSERT_TAIL(&shared_unused, ci, ci_tailq_entry);
/* flood out */
while (shared_num_unused > shared_max_reuse) {
ci = TAILQ_FIRST(&shared_unused);
TAILQ_REMOVE(&shared_unused, ci, ci_tailq_entry);
_CITRUS_HASH_REMOVE(ci, ci_hash_entry);
shared_num_unused--;
close_shared(ci);
}
}
UNLOCK(&ci_lock);
}
/*
* _citrus_iconv_open:
* open a converter for the specified in/out codes.
*/
int
_citrus_iconv_open(struct _citrus_iconv * __restrict * __restrict rcv,
const char * __restrict src, const char * __restrict dst)
{
struct _citrus_iconv *cv = NULL;
struct _citrus_iconv_shared *ci = NULL;
char realdst[PATH_MAX], realsrc[PATH_MAX];
#ifdef _PATH_ICONV
char buf[PATH_MAX], path[PATH_MAX];
#endif
int ret;
init_cache();
/* GNU behaviour, using locale encoding if "" or "char" is specified */
if ((strcmp(src, "") == 0) || (strcmp(src, "char") == 0))
src = nl_langinfo(CODESET);
if ((strcmp(dst, "") == 0) || (strcmp(dst, "char") == 0))
dst = nl_langinfo(CODESET);
/* resolve codeset name aliases */
#ifdef _PATH_ICONV
snprintf(path, sizeof(path), "%s/%s", _PATH_ICONV, _CITRUS_ICONV_ALIAS);
strlcpy(realsrc, _lookup_alias(path, src, buf, (size_t)PATH_MAX,
_LOOKUP_CASE_IGNORE), (size_t)PATH_MAX);
strlcpy(realdst, _lookup_alias(path, dst, buf, (size_t)PATH_MAX,
_LOOKUP_CASE_IGNORE), (size_t)PATH_MAX);
#else
strlcpy(realsrc, src, (size_t)PATH_MAX);
strlcpy(realdst, dst, (size_t)PATH_MAX);
#endif
/* sanity check */
if (strchr(realsrc, '/') != NULL || strchr(realdst, '/'))
return (EINVAL);
/* get shared record */
ret = get_shared(&ci, realsrc, realdst);
if (ret)
return (ret);
/* create/init context */
if (*rcv == NULL) {
cv = malloc(sizeof(*cv));
if (cv == NULL) {
ret = errno;
release_shared(ci);
return (ret);
}
*rcv = cv;
}
(*rcv)->cv_shared = ci;
ret = (*ci->ci_ops->io_init_context)(*rcv);
if (ret) {
release_shared(ci);
free(cv);
return (ret);
}
return (0);
}
/*
* _citrus_iconv_close:
* close the specified converter.
*/
void
_citrus_iconv_close(struct _citrus_iconv *cv)
{
if (cv) {
(*cv->cv_shared->ci_ops->io_uninit_context)(cv);
release_shared(cv->cv_shared);
free(cv);
}
}
const char
*_citrus_iconv_canonicalize(const char *name)
{
char *buf;
if ((buf = calloc((size_t)PATH_MAX, sizeof(*buf))) == NULL)
return (NULL);
_citrus_esdb_alias(name, buf, (size_t)PATH_MAX);
return (buf);
}
diff --git a/lib/libc/iconv/citrus_iconv.h b/lib/libc/iconv/citrus_iconv.h
index 8fe630af6c2d..49117cc15051 100644
--- a/lib/libc/iconv/citrus_iconv.h
+++ b/lib/libc/iconv/citrus_iconv.h
@@ -1,66 +1,65 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv.h,v 1.5 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ICONV_H_
#define _CITRUS_ICONV_H_
struct _citrus_iconv_shared;
struct _citrus_iconv_ops;
struct _citrus_iconv;
__BEGIN_DECLS
int _citrus_iconv_open(struct _citrus_iconv * __restrict * __restrict,
const char * __restrict, const char * __restrict);
void _citrus_iconv_close(struct _citrus_iconv *);
const char *_citrus_iconv_canonicalize(const char *);
__END_DECLS
#include "citrus_iconv_local.h"
#define _CITRUS_ICONV_F_HIDE_INVALID 0x0001
/*
* _citrus_iconv_convert:
* convert a string.
*/
static __inline int
_citrus_iconv_convert(struct _citrus_iconv * __restrict cv,
char * __restrict * __restrict in, size_t * __restrict inbytes,
char * __restrict * __restrict out, size_t * __restrict outbytes,
uint32_t flags, size_t * __restrict nresults)
{
return (*cv->cv_shared->ci_ops->io_convert)(cv, in, inbytes, out,
outbytes, flags, nresults);
}
#endif
diff --git a/lib/libc/iconv/citrus_iconv_local.h b/lib/libc/iconv/citrus_iconv_local.h
index bd02d085d1ca..0374a05c324c 100644
--- a/lib/libc/iconv/citrus_iconv_local.h
+++ b/lib/libc/iconv/citrus_iconv_local.h
@@ -1,112 +1,111 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv_local.h,v 1.3 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ICONV_LOCAL_H_
#define _CITRUS_ICONV_LOCAL_H_
#include <iconv.h>
#include <stdbool.h>
#define _CITRUS_ICONV_GETOPS_FUNC_BASE(_n_) \
int _n_(struct _citrus_iconv_ops *)
#define _CITRUS_ICONV_GETOPS_FUNC(_n_) \
_CITRUS_ICONV_GETOPS_FUNC_BASE(_citrus_##_n_##_iconv_getops)
#define _CITRUS_ICONV_DECLS(_m_) \
static int _citrus_##_m_##_iconv_init_shared \
(struct _citrus_iconv_shared * __restrict, \
const char * __restrict, const char * __restrict); \
static void _citrus_##_m_##_iconv_uninit_shared \
(struct _citrus_iconv_shared *); \
static int _citrus_##_m_##_iconv_convert \
(struct _citrus_iconv * __restrict, \
char * __restrict * __restrict, \
size_t * __restrict, \
char * __restrict * __restrict, \
size_t * __restrict outbytes, \
uint32_t, size_t * __restrict); \
static int _citrus_##_m_##_iconv_init_context \
(struct _citrus_iconv *); \
static void _citrus_##_m_##_iconv_uninit_context \
(struct _citrus_iconv *)
#define _CITRUS_ICONV_DEF_OPS(_m_) \
extern struct _citrus_iconv_ops _citrus_##_m_##_iconv_ops; \
struct _citrus_iconv_ops _citrus_##_m_##_iconv_ops = { \
/* io_init_shared */ &_citrus_##_m_##_iconv_init_shared, \
/* io_uninit_shared */ &_citrus_##_m_##_iconv_uninit_shared, \
/* io_init_context */ &_citrus_##_m_##_iconv_init_context, \
/* io_uninit_context */ &_citrus_##_m_##_iconv_uninit_context, \
/* io_convert */ &_citrus_##_m_##_iconv_convert \
}
typedef _CITRUS_ICONV_GETOPS_FUNC_BASE((*_citrus_iconv_getops_t));
typedef int (*_citrus_iconv_init_shared_t)
(struct _citrus_iconv_shared * __restrict,
const char * __restrict, const char * __restrict);
typedef void (*_citrus_iconv_uninit_shared_t)
(struct _citrus_iconv_shared *);
typedef int (*_citrus_iconv_convert_t)
(struct _citrus_iconv * __restrict,
char *__restrict* __restrict, size_t * __restrict,
char * __restrict * __restrict, size_t * __restrict, uint32_t,
size_t * __restrict);
typedef int (*_citrus_iconv_init_context_t)(struct _citrus_iconv *);
typedef void (*_citrus_iconv_uninit_context_t)(struct _citrus_iconv *);
struct _citrus_iconv_ops {
_citrus_iconv_init_shared_t io_init_shared;
_citrus_iconv_uninit_shared_t io_uninit_shared;
_citrus_iconv_init_context_t io_init_context;
_citrus_iconv_uninit_context_t io_uninit_context;
_citrus_iconv_convert_t io_convert;
};
struct _citrus_iconv_shared {
struct _citrus_iconv_ops *ci_ops;
void *ci_closure;
_CITRUS_HASH_ENTRY(_citrus_iconv_shared) ci_hash_entry;
TAILQ_ENTRY(_citrus_iconv_shared) ci_tailq_entry;
_citrus_module_t ci_module;
unsigned int ci_used_count;
char *ci_convname;
bool ci_discard_ilseq;
struct iconv_hooks *ci_hooks;
bool ci_ilseq_invalid;
};
struct _citrus_iconv {
struct _citrus_iconv_shared *cv_shared;
void *cv_closure;
};
#endif
diff --git a/lib/libc/iconv/citrus_lock.h b/lib/libc/iconv/citrus_lock.h
index f49b338a6d63..7c42e7bc7c26 100644
--- a/lib/libc/iconv/citrus_lock.h
+++ b/lib/libc/iconv/citrus_lock.h
@@ -1,35 +1,34 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2010 Gabor Kovesdan <gabor@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <pthread.h>
#define WLOCK(lock) if (__isthreaded) \
pthread_rwlock_wrlock(lock);
#define UNLOCK(lock) if (__isthreaded) \
pthread_rwlock_unlock(lock);
diff --git a/lib/libc/iconv/citrus_lookup.c b/lib/libc/iconv/citrus_lookup.c
index 51a82951376c..4d66a7d53ef2 100644
--- a/lib/libc/iconv/citrus_lookup.c
+++ b/lib/libc/iconv/citrus_lookup.c
@@ -1,364 +1,363 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_lookup.c,v 1.7 2012/05/04 16:45:05 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <limits.h>
#include <paths.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_db.h"
#include "citrus_db_hash.h"
#include "citrus_lookup.h"
#include "citrus_lookup_file.h"
struct _citrus_lookup {
union {
struct {
struct _citrus_db *db;
struct _citrus_region file;
int num, idx;
struct _db_locator locator;
} db;
struct {
struct _region r;
struct _memstream ms;
} plain;
} u;
#define cl_db u.db.db
#define cl_dbidx u.db.idx
#define cl_dbfile u.db.file
#define cl_dbnum u.db.num
#define cl_dblocator u.db.locator
#define cl_plainr u.plain.r
#define cl_plainms u.plain.ms
int cl_ignore_case;
int cl_rewind;
char *cl_key;
size_t cl_keylen;
int (*cl_next)(struct _citrus_lookup *, struct _region *,
struct _region *);
int (*cl_lookup)(struct _citrus_lookup *, const char *,
struct _region *);
int (*cl_num_entries)(struct _citrus_lookup *);
void (*cl_close)(struct _citrus_lookup *);
};
static int
seq_get_num_entries_db(struct _citrus_lookup *cl)
{
return (cl->cl_dbnum);
}
static int
seq_next_db(struct _citrus_lookup *cl, struct _region *key,
struct _region *data)
{
if (cl->cl_key) {
if (key)
_region_init(key, cl->cl_key, cl->cl_keylen);
return (_db_lookup_by_s(cl->cl_db, cl->cl_key, data,
&cl->cl_dblocator));
}
if (cl->cl_rewind) {
cl->cl_dbidx = 0;
}
cl->cl_rewind = 0;
if (cl->cl_dbidx >= cl->cl_dbnum)
return (ENOENT);
return (_db_get_entry(cl->cl_db, cl->cl_dbidx++, key, data));
}
static int
seq_lookup_db(struct _citrus_lookup *cl, const char *key, struct _region *data)
{
cl->cl_rewind = 0;
free(cl->cl_key);
cl->cl_key = strdup(key);
if (cl->cl_ignore_case)
_bcs_convert_to_lower(cl->cl_key);
cl->cl_keylen = strlen(cl->cl_key);
_db_locator_init(&cl->cl_dblocator);
return (_db_lookup_by_s(cl->cl_db, cl->cl_key, data,
&cl->cl_dblocator));
}
static void
seq_close_db(struct _citrus_lookup *cl)
{
_db_close(cl->cl_db);
_unmap_file(&cl->cl_dbfile);
}
static int
seq_open_db(struct _citrus_lookup *cl, const char *name)
{
struct _region r;
char path[PATH_MAX];
int ret;
snprintf(path, sizeof(path), "%s.db", name);
ret = _map_file(&r, path);
if (ret)
return (ret);
ret = _db_open(&cl->cl_db, &r, _CITRUS_LOOKUP_MAGIC,
_db_hash_std, NULL);
if (ret) {
_unmap_file(&r);
return (ret);
}
cl->cl_dbfile = r;
cl->cl_dbnum = _db_get_num_entries(cl->cl_db);
cl->cl_dbidx = 0;
cl->cl_rewind = 1;
cl->cl_lookup = &seq_lookup_db;
cl->cl_next = &seq_next_db;
cl->cl_num_entries = &seq_get_num_entries_db;
cl->cl_close = &seq_close_db;
return (0);
}
#define T_COMM '#'
static int
seq_next_plain(struct _citrus_lookup *cl, struct _region *key,
struct _region *data)
{
const char *p, *q;
size_t len;
if (cl->cl_rewind)
_memstream_bind(&cl->cl_plainms, &cl->cl_plainr);
cl->cl_rewind = 0;
retry:
p = _memstream_getln(&cl->cl_plainms, &len);
if (p == NULL)
return (ENOENT);
/* ignore comment */
q = memchr(p, T_COMM, len);
if (q) {
len = q - p;
}
/* ignore trailing spaces */
_bcs_trunc_rws_len(p, &len);
p = _bcs_skip_ws_len(p, &len);
q = _bcs_skip_nonws_len(p, &len);
if (p == q)
goto retry;
if (cl->cl_key && ((size_t)(q - p) != cl->cl_keylen ||
memcmp(p, cl->cl_key, (size_t)(q - p)) != 0))
goto retry;
/* found a entry */
if (key)
_region_init(key, __DECONST(void *, p), (size_t)(q - p));
p = _bcs_skip_ws_len(q, &len);
if (data)
_region_init(data, len ? __DECONST(void *, p) : NULL, len);
return (0);
}
static int
seq_get_num_entries_plain(struct _citrus_lookup *cl)
{
int num;
num = 0;
while (seq_next_plain(cl, NULL, NULL) == 0)
num++;
return (num);
}
static int
seq_lookup_plain(struct _citrus_lookup *cl, const char *key,
struct _region *data)
{
size_t len;
const char *p;
cl->cl_rewind = 0;
free(cl->cl_key);
cl->cl_key = strdup(key);
if (cl->cl_ignore_case)
_bcs_convert_to_lower(cl->cl_key);
cl->cl_keylen = strlen(cl->cl_key);
_memstream_bind(&cl->cl_plainms, &cl->cl_plainr);
p = _memstream_matchline(&cl->cl_plainms, cl->cl_key, &len, 0);
if (p == NULL)
return (ENOENT);
if (data)
_region_init(data, __DECONST(void *, p), len);
return (0);
}
static void
seq_close_plain(struct _citrus_lookup *cl)
{
_unmap_file(&cl->cl_plainr);
}
static int
seq_open_plain(struct _citrus_lookup *cl, const char *name)
{
int ret;
/* open read stream */
ret = _map_file(&cl->cl_plainr, name);
if (ret)
return (ret);
cl->cl_rewind = 1;
cl->cl_next = &seq_next_plain;
cl->cl_lookup = &seq_lookup_plain;
cl->cl_num_entries = &seq_get_num_entries_plain;
cl->cl_close = &seq_close_plain;
return (0);
}
int
_citrus_lookup_seq_open(struct _citrus_lookup **rcl, const char *name,
int ignore_case)
{
int ret;
struct _citrus_lookup *cl;
cl = malloc(sizeof(*cl));
if (cl == NULL)
return (errno);
cl->cl_key = NULL;
cl->cl_keylen = 0;
cl->cl_ignore_case = ignore_case;
ret = seq_open_db(cl, name);
if (ret == ENOENT)
ret = seq_open_plain(cl, name);
if (!ret)
*rcl = cl;
else
free(cl);
return (ret);
}
void
_citrus_lookup_seq_rewind(struct _citrus_lookup *cl)
{
cl->cl_rewind = 1;
free(cl->cl_key);
cl->cl_key = NULL;
cl->cl_keylen = 0;
}
int
_citrus_lookup_seq_next(struct _citrus_lookup *cl,
struct _region *key, struct _region *data)
{
return ((*cl->cl_next)(cl, key, data));
}
int
_citrus_lookup_seq_lookup(struct _citrus_lookup *cl, const char *key,
struct _region *data)
{
return ((*cl->cl_lookup)(cl, key, data));
}
int
_citrus_lookup_get_number_of_entries(struct _citrus_lookup *cl)
{
return ((*cl->cl_num_entries)(cl));
}
void
_citrus_lookup_seq_close(struct _citrus_lookup *cl)
{
free(cl->cl_key);
(*cl->cl_close)(cl);
free(cl);
}
char *
_citrus_lookup_simple(const char *name, const char *key,
char *linebuf, size_t linebufsize, int ignore_case)
{
struct _citrus_lookup *cl;
struct _region data;
int ret;
ret = _citrus_lookup_seq_open(&cl, name, ignore_case);
if (ret)
return (NULL);
ret = _citrus_lookup_seq_lookup(cl, key, &data);
if (ret) {
_citrus_lookup_seq_close(cl);
return (NULL);
}
snprintf(linebuf, linebufsize, "%.*s", (int)_region_size(&data),
(const char *)_region_head(&data));
_citrus_lookup_seq_close(cl);
return (linebuf);
}
diff --git a/lib/libc/iconv/citrus_lookup.h b/lib/libc/iconv/citrus_lookup.h
index 88a0d4e7ef51..53ce42ea943b 100644
--- a/lib/libc/iconv/citrus_lookup.h
+++ b/lib/libc/iconv/citrus_lookup.h
@@ -1,66 +1,65 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_lookup.h,v 1.2 2004/07/21 14:16:34 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_LOOKUP_H_
#define _CITRUS_LOOKUP_H_
#define _CITRUS_LOOKUP_CASE_SENSITIVE 0
#define _CITRUS_LOOKUP_CASE_IGNORE 1
struct _citrus_lookup;
__BEGIN_DECLS
char *_citrus_lookup_simple(const char *, const char *, char *,
size_t, int);
int _citrus_lookup_seq_open(struct _citrus_lookup **,
const char *, int);
void _citrus_lookup_seq_rewind(struct _citrus_lookup *);
int _citrus_lookup_seq_next(struct _citrus_lookup *,
struct _region *, struct _region *);
int _citrus_lookup_seq_lookup(struct _citrus_lookup *,
const char *, struct _region *);
int _citrus_lookup_get_number_of_entries(struct _citrus_lookup *);
void _citrus_lookup_seq_close(struct _citrus_lookup *);
__END_DECLS
static __inline const char *
_citrus_lookup_alias(const char *path, const char *key, char *buf, size_t n,
int ignore_case)
{
const char *ret;
ret = _citrus_lookup_simple(path, key, buf, n, ignore_case);
if (ret == NULL)
ret = key;
return (ret);
}
#endif
diff --git a/lib/libc/iconv/citrus_lookup_factory.c b/lib/libc/iconv/citrus_lookup_factory.c
index 85d20dfe8cfe..c2afe1d869b8 100644
--- a/lib/libc/iconv/citrus_lookup_factory.c
+++ b/lib/libc/iconv/citrus_lookup_factory.c
@@ -1,123 +1,122 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_lookup_factory.c,v 1.4 2003/10/27 00:12:42 lukem Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_region.h"
#include "citrus_bcs.h"
#include "citrus_db_factory.h"
#include "citrus_db_hash.h"
#include "citrus_lookup_factory.h"
#include "citrus_lookup_file.h"
#define T_COMM '#'
static int
convert_line(struct _citrus_db_factory *df, const char *line, size_t len)
{
const char *p;
char data[LINE_MAX], key[LINE_MAX];
/* cut off trailing comment */
p = memchr(line, T_COMM, len);
if (p)
len = p - line;
/* key */
line = _bcs_skip_ws_len(line, &len);
if (len == 0)
return (0);
p = _bcs_skip_nonws_len(line, &len);
if (p == line)
return (0);
snprintf(key, sizeof(key), "%.*s", (int)(p-line), line);
_bcs_convert_to_lower(key);
/* data */
line = _bcs_skip_ws_len(p, &len);
_bcs_trunc_rws_len(line, &len);
snprintf(data, sizeof(data), "%.*s", (int)len, line);
return (_db_factory_addstr_by_s(df, key, data));
}
static int
dump_db(struct _citrus_db_factory *df, struct _region *r)
{
void *ptr;
size_t size;
size = _db_factory_calc_size(df);
ptr = malloc(size);
if (ptr == NULL)
return (errno);
_region_init(r, ptr, size);
return (_db_factory_serialize(df, _CITRUS_LOOKUP_MAGIC, r));
}
int
_citrus_lookup_factory_convert(FILE *out, FILE *in)
{
struct _citrus_db_factory *df;
struct _region r;
char *line;
size_t size;
int ret;
ret = _db_factory_create(&df, &_db_hash_std, NULL);
if (ret)
return (ret);
while ((line = fgetln(in, &size)) != NULL)
if ((ret = convert_line(df, line, size))) {
_db_factory_free(df);
return (ret);
}
ret = dump_db(df, &r);
_db_factory_free(df);
if (ret)
return (ret);
if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1)
return (errno);
return (0);
}
diff --git a/lib/libc/iconv/citrus_lookup_factory.h b/lib/libc/iconv/citrus_lookup_factory.h
index e716184a8d17..e630578b931e 100644
--- a/lib/libc/iconv/citrus_lookup_factory.h
+++ b/lib/libc/iconv/citrus_lookup_factory.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_lookup_factory.h,v 1.1 2003/06/25 09:51:35 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_LOOKUP_FACTORY_H_
#define _CITRUS_LOOKUP_FACTORY_H_
__BEGIN_DECLS
int _citrus_lookup_factory_convert(FILE *, FILE *);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_lookup_file.h b/lib/libc/iconv/citrus_lookup_file.h
index a2ada5fc7d5c..c7510d134d00 100644
--- a/lib/libc/iconv/citrus_lookup_file.h
+++ b/lib/libc/iconv/citrus_lookup_file.h
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_lookup_file.h,v 1.1 2003/06/25 09:51:36 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_LOOKUP_FILE_H_
#define _CITRUS_LOOKUP_FILE_H_
#define _CITRUS_LOOKUP_MAGIC "LOOKUP\0\0"
#endif
diff --git a/lib/libc/iconv/citrus_mapper.c b/lib/libc/iconv/citrus_mapper.c
index cbc0a58c35c9..5b919a9e9c92 100644
--- a/lib/libc/iconv/citrus_mapper.c
+++ b/lib/libc/iconv/citrus_mapper.c
@@ -1,407 +1,406 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper.c,v 1.10 2012/06/08 07:49:42 martin Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_region.h"
#include "citrus_lock.h"
#include "citrus_memstream.h"
#include "citrus_bcs.h"
#include "citrus_mmap.h"
#include "citrus_module.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#define _CITRUS_MAPPER_DIR "mapper.dir"
#define CM_HASH_SIZE 101
#define REFCOUNT_PERSISTENT -1
static pthread_rwlock_t cm_lock = PTHREAD_RWLOCK_INITIALIZER;
struct _citrus_mapper_area {
_CITRUS_HASH_HEAD(, _citrus_mapper, CM_HASH_SIZE) ma_cache;
char *ma_dir;
};
/*
* _citrus_mapper_create_area:
* create mapper area
*/
int
_citrus_mapper_create_area(
struct _citrus_mapper_area *__restrict *__restrict rma,
const char *__restrict area)
{
struct _citrus_mapper_area *ma;
struct stat st;
char path[PATH_MAX];
int ret;
WLOCK(&cm_lock);
if (*rma != NULL) {
ret = 0;
goto quit;
}
snprintf(path, (size_t)PATH_MAX, "%s/%s", area, _CITRUS_MAPPER_DIR);
ret = stat(path, &st);
if (ret)
goto quit;
ma = malloc(sizeof(*ma));
if (ma == NULL) {
ret = errno;
goto quit;
}
ma->ma_dir = strdup(area);
if (ma->ma_dir == NULL) {
ret = errno;
free(ma);
goto quit;
}
_CITRUS_HASH_INIT(&ma->ma_cache, CM_HASH_SIZE);
*rma = ma;
ret = 0;
quit:
UNLOCK(&cm_lock);
return (ret);
}
/*
* lookup_mapper_entry:
* lookup mapper.dir entry in the specified directory.
*
* line format of iconv.dir file:
* mapper module arg
* mapper : mapper name.
* module : mapper module name.
* arg : argument for the module (generally, description file name)
*/
static int
lookup_mapper_entry(const char *dir, const char *mapname, void *linebuf,
size_t linebufsize, const char **module, const char **variable)
{
struct _region r;
struct _memstream ms;
const char *cp, *cq;
char *p;
char path[PATH_MAX];
size_t len;
int ret;
/* create mapper.dir path */
snprintf(path, (size_t)PATH_MAX, "%s/%s", dir, _CITRUS_MAPPER_DIR);
/* open read stream */
ret = _map_file(&r, path);
if (ret)
return (ret);
_memstream_bind(&ms, &r);
/* search the line matching to the map name */
cp = _memstream_matchline(&ms, mapname, &len, 0);
if (!cp) {
ret = ENOENT;
goto quit;
}
if (!len || len > linebufsize - 1) {
ret = EINVAL;
goto quit;
}
p = linebuf;
/* get module name */
*module = p;
cq = _bcs_skip_nonws_len(cp, &len);
strlcpy(p, cp, (size_t)(cq - cp + 1));
p += cq - cp + 1;
/* get variable */
*variable = p;
cp = _bcs_skip_ws_len(cq, &len);
strlcpy(p, cp, len + 1);
ret = 0;
quit:
_unmap_file(&r);
return (ret);
}
/*
* mapper_close:
* simply close a mapper. (without handling hash)
*/
static void
mapper_close(struct _citrus_mapper *cm)
{
if (cm->cm_module) {
if (cm->cm_ops) {
if (cm->cm_closure)
(*cm->cm_ops->mo_uninit)(cm);
free(cm->cm_ops);
}
_citrus_unload_module(cm->cm_module);
}
free(cm->cm_traits);
free(cm);
}
/*
* mapper_open:
* simply open a mapper. (without handling hash)
*/
static int
mapper_open(struct _citrus_mapper_area *__restrict ma,
struct _citrus_mapper * __restrict * __restrict rcm,
const char * __restrict module,
const char * __restrict variable)
{
struct _citrus_mapper *cm;
_citrus_mapper_getops_t getops;
int ret;
/* initialize mapper handle */
cm = malloc(sizeof(*cm));
if (!cm)
return (errno);
cm->cm_module = NULL;
cm->cm_ops = NULL;
cm->cm_closure = NULL;
cm->cm_traits = NULL;
cm->cm_refcount = 0;
cm->cm_key = NULL;
/* load module */
ret = _citrus_load_module(&cm->cm_module, module);
if (ret)
goto err;
/* get operators */
getops = (_citrus_mapper_getops_t)
_citrus_find_getops(cm->cm_module, module, "mapper");
if (!getops) {
ret = EOPNOTSUPP;
goto err;
}
cm->cm_ops = malloc(sizeof(*cm->cm_ops));
if (!cm->cm_ops) {
ret = errno;
goto err;
}
ret = (*getops)(cm->cm_ops);
if (ret)
goto err;
if (!cm->cm_ops->mo_init ||
!cm->cm_ops->mo_uninit ||
!cm->cm_ops->mo_convert ||
!cm->cm_ops->mo_init_state) {
ret = EINVAL;
goto err;
}
/* allocate traits structure */
cm->cm_traits = malloc(sizeof(*cm->cm_traits));
if (cm->cm_traits == NULL) {
ret = errno;
goto err;
}
/* initialize the mapper */
ret = (*cm->cm_ops->mo_init)(ma, cm, ma->ma_dir,
(const void *)variable, strlen(variable) + 1,
cm->cm_traits, sizeof(*cm->cm_traits));
if (ret)
goto err;
*rcm = cm;
return (0);
err:
mapper_close(cm);
return (ret);
}
/*
* _citrus_mapper_open_direct:
* open a mapper.
*/
int
_citrus_mapper_open_direct(struct _citrus_mapper_area *__restrict ma,
struct _citrus_mapper * __restrict * __restrict rcm,
const char * __restrict module, const char * __restrict variable)
{
return (mapper_open(ma, rcm, module, variable));
}
/*
* hash_func
*/
static __inline int
hash_func(const char *key)
{
return (_string_hash_func(key, CM_HASH_SIZE));
}
/*
* match_func
*/
static __inline int
match_func(struct _citrus_mapper *cm, const char *key)
{
return (strcmp(cm->cm_key, key));
}
/*
* _citrus_mapper_open:
* open a mapper with looking up "mapper.dir".
*/
int
_citrus_mapper_open(struct _citrus_mapper_area *__restrict ma,
struct _citrus_mapper * __restrict * __restrict rcm,
const char * __restrict mapname)
{
struct _citrus_mapper *cm;
char linebuf[PATH_MAX];
const char *module, *variable;
int hashval, ret;
variable = NULL;
WLOCK(&cm_lock);
/* search in the cache */
hashval = hash_func(mapname);
_CITRUS_HASH_SEARCH(&ma->ma_cache, cm, cm_entry, match_func, mapname,
hashval);
if (cm) {
/* found */
cm->cm_refcount++;
*rcm = cm;
ret = 0;
goto quit;
}
/* search mapper entry */
ret = lookup_mapper_entry(ma->ma_dir, mapname, linebuf,
(size_t)PATH_MAX, &module, &variable);
if (ret)
goto quit;
/* open mapper */
UNLOCK(&cm_lock);
ret = mapper_open(ma, &cm, module, variable);
WLOCK(&cm_lock);
if (ret)
goto quit;
cm->cm_key = strdup(mapname);
if (cm->cm_key == NULL) {
ret = errno;
_mapper_close(cm);
goto quit;
}
/* insert to the cache */
cm->cm_refcount = 1;
_CITRUS_HASH_INSERT(&ma->ma_cache, cm, cm_entry, hashval);
*rcm = cm;
ret = 0;
quit:
UNLOCK(&cm_lock);
return (ret);
}
/*
* _citrus_mapper_close:
* close the specified mapper.
*/
void
_citrus_mapper_close(struct _citrus_mapper *cm)
{
if (cm) {
WLOCK(&cm_lock);
if (cm->cm_refcount == REFCOUNT_PERSISTENT)
goto quit;
if (cm->cm_refcount > 0) {
if (--cm->cm_refcount > 0)
goto quit;
_CITRUS_HASH_REMOVE(cm, cm_entry);
free(cm->cm_key);
}
UNLOCK(&cm_lock);
mapper_close(cm);
return;
quit:
UNLOCK(&cm_lock);
}
}
/*
* _citrus_mapper_set_persistent:
* set persistent count.
*/
void
_citrus_mapper_set_persistent(struct _citrus_mapper * __restrict cm)
{
WLOCK(&cm_lock);
cm->cm_refcount = REFCOUNT_PERSISTENT;
UNLOCK(&cm_lock);
}
diff --git a/lib/libc/iconv/citrus_mapper.h b/lib/libc/iconv/citrus_mapper.h
index 7e9056c761e9..ae093fc97ce3 100644
--- a/lib/libc/iconv/citrus_mapper.h
+++ b/lib/libc/iconv/citrus_mapper.h
@@ -1,133 +1,132 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper.h,v 1.3 2003/07/12 15:39:19 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_H_
#define _CITRUS_MAPPER_H_
struct _citrus_mapper_area;
struct _citrus_mapper;
struct _citrus_mapper_ops;
struct _citrus_mapper_traits;
__BEGIN_DECLS
int _citrus_mapper_create_area(
struct _citrus_mapper_area *__restrict *__restrict,
const char *__restrict);
int _citrus_mapper_open(struct _citrus_mapper_area *__restrict,
struct _citrus_mapper *__restrict *__restrict,
const char *__restrict);
int _citrus_mapper_open_direct(
struct _citrus_mapper_area *__restrict,
struct _citrus_mapper *__restrict *__restrict,
const char *__restrict, const char *__restrict);
void _citrus_mapper_close(struct _citrus_mapper *);
void _citrus_mapper_set_persistent(struct _citrus_mapper * __restrict);
__END_DECLS
#include "citrus_mapper_local.h"
/* return values of _citrus_mapper_convert */
#define _CITRUS_MAPPER_CONVERT_SUCCESS (0)
#define _CITRUS_MAPPER_CONVERT_NONIDENTICAL (1)
#define _CITRUS_MAPPER_CONVERT_SRC_MORE (2)
#define _CITRUS_MAPPER_CONVERT_DST_MORE (3)
#define _CITRUS_MAPPER_CONVERT_ILSEQ (4)
#define _CITRUS_MAPPER_CONVERT_FATAL (5)
/*
* _citrus_mapper_convert:
* convert an index.
* - if the converter supports M:1 converter, the function may return
* _CITRUS_MAPPER_CONVERT_SRC_MORE and the storage pointed by dst
* may be unchanged in this case, although the internal status of
* the mapper is affected.
* - if the converter supports 1:N converter, the function may return
* _CITRUS_MAPPER_CONVERT_DST_MORE. In this case, the contiguous
* call of this function ignores src and changes the storage pointed
* by dst.
* - if the converter supports M:N converter, the function may behave
* the combination of the above.
*
*/
static __inline int
_citrus_mapper_convert(struct _citrus_mapper * __restrict cm,
_citrus_index_t * __restrict dst, _citrus_index_t src,
void * __restrict ps)
{
return ((*cm->cm_ops->mo_convert)(cm, dst, src, ps));
}
/*
* _citrus_mapper_init_state:
* initialize the state.
*/
static __inline void
_citrus_mapper_init_state(struct _citrus_mapper * __restrict cm)
{
(*cm->cm_ops->mo_init_state)();
}
/*
* _citrus_mapper_get_state_size:
* get the size of state storage.
*/
static __inline size_t
_citrus_mapper_get_state_size(struct _citrus_mapper * __restrict cm)
{
return (cm->cm_traits->mt_state_size);
}
/*
* _citrus_mapper_get_src_max:
* get the maximum number of suspended sources.
*/
static __inline size_t
_citrus_mapper_get_src_max(struct _citrus_mapper * __restrict cm)
{
return (cm->cm_traits->mt_src_max);
}
/*
* _citrus_mapper_get_dst_max:
* get the maximum number of suspended destinations.
*/
static __inline size_t
_citrus_mapper_get_dst_max(struct _citrus_mapper * __restrict cm)
{
return (cm->cm_traits->mt_dst_max);
}
#endif
diff --git a/lib/libc/iconv/citrus_mapper_local.h b/lib/libc/iconv/citrus_mapper_local.h
index cfdb3be868e2..cb18e2eae8c1 100644
--- a/lib/libc/iconv/citrus_mapper_local.h
+++ b/lib/libc/iconv/citrus_mapper_local.h
@@ -1,99 +1,98 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_local.h,v 1.2 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_LOCAL_H_
#define _CITRUS_MAPPER_LOCAL_H_
#define _CITRUS_MAPPER_GETOPS_FUNC_BASE(_n_) \
int _n_(struct _citrus_mapper_ops *)
#define _CITRUS_MAPPER_GETOPS_FUNC(_n_) \
_CITRUS_MAPPER_GETOPS_FUNC_BASE(_citrus_##_n_##_mapper_getops)
#define _CITRUS_MAPPER_DECLS(_m_) \
static int _citrus_##_m_##_mapper_init \
(struct _citrus_mapper_area *__restrict, \
struct _citrus_mapper * __restrict, \
const char * __restrict, const void * __restrict, \
size_t, struct _citrus_mapper_traits * __restrict, \
size_t); \
static void _citrus_##_m_##_mapper_uninit( \
struct _citrus_mapper *); \
static int _citrus_##_m_##_mapper_convert \
(struct _citrus_mapper * __restrict, \
_citrus_index_t * __restrict, _citrus_index_t, \
void * __restrict); \
static void _citrus_##_m_##_mapper_init_state \
(void);
#define _CITRUS_MAPPER_DEF_OPS(_m_) \
extern struct _citrus_mapper_ops _citrus_##_m_##_mapper_ops; \
struct _citrus_mapper_ops _citrus_##_m_##_mapper_ops = { \
/* mo_init */ &_citrus_##_m_##_mapper_init, \
/* mo_uninit */ &_citrus_##_m_##_mapper_uninit, \
/* mo_convert */ &_citrus_##_m_##_mapper_convert, \
/* mo_init_state */ &_citrus_##_m_##_mapper_init_state \
}
typedef _CITRUS_MAPPER_GETOPS_FUNC_BASE((*_citrus_mapper_getops_t));
typedef int (*_citrus_mapper_init_t)(
struct _citrus_mapper_area *__restrict,
struct _citrus_mapper *__restrict, const char *__restrict,
const void *__restrict, size_t,
struct _citrus_mapper_traits * __restrict, size_t);
typedef void (*_citrus_mapper_uninit_t)(struct _citrus_mapper *);
typedef int (*_citrus_mapper_convert_t)(struct _citrus_mapper * __restrict,
_citrus_index_t * __restrict, _citrus_index_t, void * __restrict);
typedef void (*_citrus_mapper_init_state_t)(void);
struct _citrus_mapper_ops {
_citrus_mapper_init_t mo_init;
_citrus_mapper_uninit_t mo_uninit;
_citrus_mapper_convert_t mo_convert;
_citrus_mapper_init_state_t mo_init_state;
};
struct _citrus_mapper_traits {
/* version 0x00000001 */
size_t mt_state_size;
size_t mt_src_max;
size_t mt_dst_max;
};
struct _citrus_mapper {
struct _citrus_mapper_ops *cm_ops;
void *cm_closure;
_citrus_module_t cm_module;
struct _citrus_mapper_traits *cm_traits;
_CITRUS_HASH_ENTRY(_citrus_mapper) cm_entry;
int cm_refcount;
char *cm_key;
};
#endif
diff --git a/lib/libc/iconv/citrus_memstream.c b/lib/libc/iconv/citrus_memstream.c
index 51092cb792b7..25ab088ee413 100644
--- a/lib/libc/iconv/citrus_memstream.c
+++ b/lib/libc/iconv/citrus_memstream.c
@@ -1,149 +1,148 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_memstream.c,v 1.5 2012/03/13 21:13:31 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_bcs.h"
const char *
_citrus_memory_stream_getln(struct _citrus_memory_stream * __restrict ms,
size_t * __restrict rlen)
{
const uint8_t *h, *p;
size_t i, ret;
if (ms->ms_pos>=_region_size(&ms->ms_region))
return (NULL);
h = p = (uint8_t *)_region_offset(&ms->ms_region, ms->ms_pos);
ret = 0;
for (i = _region_size(&ms->ms_region) - ms->ms_pos; i > 0; i--) {
ret++;
if (_bcs_iseol(*p))
break;
p++;
}
ms->ms_pos += ret;
*rlen = ret;
return ((const char *)h);
}
#define T_COMM '#'
const char *
_citrus_memory_stream_matchline(struct _citrus_memory_stream * __restrict ms,
const char * __restrict key, size_t * __restrict rlen, int iscasesensitive)
{
const char *p, *q;
size_t keylen, len;
keylen = strlen(key);
for(;;) {
p = _citrus_memory_stream_getln(ms, &len);
if (p == NULL)
return (NULL);
/* ignore comment */
q = memchr(p, T_COMM, len);
if (q) {
len = q - p;
}
/* ignore trailing white space and newline */
_bcs_trunc_rws_len(p, &len);
if (len == 0)
continue; /* ignore null line */
/* skip white spaces at the head of the line */
p = _bcs_skip_ws_len(p, &len);
q = _bcs_skip_nonws_len(p, &len);
if ((size_t)(q - p) == keylen) {
if (iscasesensitive) {
if (memcmp(key, p, keylen) == 0)
break; /* match */
} else {
if (_bcs_strncasecmp(key, p, keylen) == 0)
break; /* match */
}
}
}
p = _bcs_skip_ws_len(q, &len);
*rlen = len;
return (p);
}
void *
_citrus_memory_stream_chr(struct _citrus_memory_stream *ms,
struct _citrus_region *r, char ch)
{
void *chr, *head;
size_t sz;
if (ms->ms_pos >= _region_size(&ms->ms_region))
return (NULL);
head = _region_offset(&ms->ms_region, ms->ms_pos);
chr = memchr(head, ch, _memstream_remainder(ms));
if (chr == NULL) {
_region_init(r, head, _memstream_remainder(ms));
ms->ms_pos = _region_size(&ms->ms_region);
return (NULL);
}
sz = (char *)chr - (char *)head;
_region_init(r, head, sz);
ms->ms_pos += sz + 1;
return (chr);
}
void
_citrus_memory_stream_skip_ws(struct _citrus_memory_stream *ms)
{
int ch;
while ((ch = _memstream_peek(ms)) != EOF) {
if (!_bcs_isspace(ch))
break;
_memstream_getc(ms);
}
}
diff --git a/lib/libc/iconv/citrus_memstream.h b/lib/libc/iconv/citrus_memstream.h
index 4c398a8c7a5b..998aeefe1dff 100644
--- a/lib/libc/iconv/citrus_memstream.h
+++ b/lib/libc/iconv/citrus_memstream.h
@@ -1,228 +1,227 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_memstream.h,v 1.3 2005/05/14 17:55:42 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_MEMSTREAM_H_
#define _CITRUS_MEMSTREAM_H_
struct _citrus_memory_stream {
struct _citrus_region ms_region;
size_t ms_pos;
};
__BEGIN_DECLS
const char *_citrus_memory_stream_getln(
struct _citrus_memory_stream * __restrict,
size_t * __restrict);
const char *_citrus_memory_stream_matchline(
struct _citrus_memory_stream * __restrict,
const char * __restrict, size_t * __restrict, int);
void *_citrus_memory_stream_chr(struct _citrus_memory_stream *,
struct _citrus_region *, char);
void _citrus_memory_stream_skip_ws(struct _citrus_memory_stream *);
__END_DECLS
static __inline int
_citrus_memory_stream_iseof(struct _citrus_memory_stream *ms)
{
return (ms->ms_pos >= _citrus_region_size(&ms->ms_region));
}
static __inline void
_citrus_memory_stream_bind(struct _citrus_memory_stream * __restrict ms,
const struct _citrus_region * __restrict r)
{
ms->ms_region = *r;
ms->ms_pos = 0;
}
static __inline void
_citrus_memory_stream_bind_ptr(struct _citrus_memory_stream * __restrict ms,
void *ptr, size_t sz)
{
struct _citrus_region r;
_citrus_region_init(&r, ptr, sz);
_citrus_memory_stream_bind(ms, &r);
}
static __inline void
_citrus_memory_stream_rewind(struct _citrus_memory_stream *ms)
{
ms->ms_pos = 0;
}
static __inline size_t
_citrus_memory_stream_tell(struct _citrus_memory_stream *ms)
{
return (ms->ms_pos);
}
static __inline size_t
_citrus_memory_stream_remainder(struct _citrus_memory_stream *ms)
{
size_t sz;
sz = _citrus_region_size(&ms->ms_region);
if (ms->ms_pos>sz)
return (0);
return (sz-ms->ms_pos);
}
static __inline int
_citrus_memory_stream_seek(struct _citrus_memory_stream *ms, size_t pos, int w)
{
size_t sz;
sz = _citrus_region_size(&ms->ms_region);
switch (w) {
case SEEK_SET:
if (pos >= sz)
return (-1);
ms->ms_pos = pos;
break;
case SEEK_CUR:
pos += (ssize_t)ms->ms_pos;
if (pos >= sz)
return (-1);
ms->ms_pos = pos;
break;
case SEEK_END:
if (sz < pos)
return (-1);
ms->ms_pos = sz - pos;
break;
}
return (0);
}
static __inline int
_citrus_memory_stream_getc(struct _citrus_memory_stream *ms)
{
if (_citrus_memory_stream_iseof(ms))
return (EOF);
return (_citrus_region_peek8(&ms->ms_region, ms->ms_pos++));
}
static __inline void
_citrus_memory_stream_ungetc(struct _citrus_memory_stream *ms, int ch)
{
if (ch != EOF && ms->ms_pos > 0)
ms->ms_pos--;
}
static __inline int
_citrus_memory_stream_peek(struct _citrus_memory_stream *ms)
{
if (_citrus_memory_stream_iseof(ms))
return (EOF);
return (_citrus_region_peek8(&ms->ms_region, ms->ms_pos));
}
static __inline void *
_citrus_memory_stream_getregion(struct _citrus_memory_stream *ms,
struct _citrus_region *r, size_t sz)
{
void *ret;
if (ms->ms_pos + sz > _citrus_region_size(&ms->ms_region))
return (NULL);
ret = _citrus_region_offset(&ms->ms_region, ms->ms_pos);
ms->ms_pos += sz;
if (r)
_citrus_region_init(r, ret, sz);
return (ret);
}
static __inline int
_citrus_memory_stream_get8(struct _citrus_memory_stream *ms, uint8_t *rval)
{
if (ms->ms_pos + 1 > _citrus_region_size(&ms->ms_region))
return (-1);
*rval = _citrus_region_peek8(&ms->ms_region, ms->ms_pos);
ms->ms_pos += 2;
return (0);
}
static __inline int
_citrus_memory_stream_get16(struct _citrus_memory_stream *ms, uint16_t *rval)
{
if (ms->ms_pos + 2 > _citrus_region_size(&ms->ms_region))
return (-1);
*rval = _citrus_region_peek16(&ms->ms_region, ms->ms_pos);
ms->ms_pos += 2;
return (0);
}
static __inline int
_citrus_memory_stream_get32(struct _citrus_memory_stream *ms, uint32_t *rval)
{
if (ms->ms_pos + 4 > _citrus_region_size(&ms->ms_region))
return (-1);
*rval = _citrus_region_peek32(&ms->ms_region, ms->ms_pos);
ms->ms_pos += 4;
return (0);
}
static __inline int
_citrus_memory_stream_getln_region(struct _citrus_memory_stream *ms,
struct _citrus_region *r)
{
const char *ptr;
size_t sz;
ptr = _citrus_memory_stream_getln(ms, &sz);
if (ptr)
_citrus_region_init(r, __DECONST(void *, ptr), sz);
return (ptr == NULL);
}
#endif
diff --git a/lib/libc/iconv/citrus_mmap.c b/lib/libc/iconv/citrus_mmap.c
index e058f3d2cdc3..b48242d94d38 100644
--- a/lib/libc/iconv/citrus_mmap.c
+++ b/lib/libc/iconv/citrus_mmap.c
@@ -1,97 +1,96 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mmap.c,v 1.4 2011/10/15 23:00:01 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include "namespace.h"
#include <sys/cdefs.h>
#include <sys/mman.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <assert.h>
#include <errno.h>
#include <fcntl.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "un-namespace.h"
#include "citrus_namespace.h"
#include "citrus_region.h"
#include "citrus_mmap.h"
int
_citrus_map_file(struct _citrus_region * __restrict r,
const char * __restrict path)
{
struct stat st;
void *head;
int fd, ret;
ret = 0;
_region_init(r, NULL, 0);
if ((fd = _open(path, O_RDONLY | O_CLOEXEC)) == -1)
return (errno);
if (_fstat(fd, &st) == -1) {
ret = errno;
goto error;
}
if (!S_ISREG(st.st_mode)) {
ret = EOPNOTSUPP;
goto error;
}
head = mmap(NULL, (size_t)st.st_size, PROT_READ, MAP_FILE|MAP_PRIVATE,
fd, (off_t)0);
if (head == MAP_FAILED) {
ret = errno;
goto error;
}
_region_init(r, head, (size_t)st.st_size);
error:
(void)_close(fd);
return (ret);
}
void
_citrus_unmap_file(struct _citrus_region *r)
{
if (_region_head(r) != NULL) {
(void)munmap(_region_head(r), _region_size(r));
_region_init(r, NULL, 0);
}
}
diff --git a/lib/libc/iconv/citrus_mmap.h b/lib/libc/iconv/citrus_mmap.h
index 83520646f378..b06ddd4909c6 100644
--- a/lib/libc/iconv/citrus_mmap.h
+++ b/lib/libc/iconv/citrus_mmap.h
@@ -1,42 +1,41 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mmap.h,v 1.1 2003/06/25 09:51:38 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_MMAP_H_
#define _CITRUS_MMAP_H_
__BEGIN_DECLS
int _citrus_map_file(struct _citrus_region * __restrict,
const char * __restrict);
void _citrus_unmap_file(struct _citrus_region *);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_module.c b/lib/libc/iconv/citrus_module.c
index 64ef0271ea18..25150032cda4 100644
--- a/lib/libc/iconv/citrus_module.c
+++ b/lib/libc/iconv/citrus_module.c
@@ -1,317 +1,316 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_module.c,v 1.9 2009/01/11 02:46:24 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)1999, 2000, 2001, 2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*-
* Copyright (c) 1998 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Paul Kranenburg.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Paul Borman at Krystal Technologies.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <dirent.h>
#include <dlfcn.h>
#include <errno.h>
#include <limits.h>
#include <paths.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define I18NMODULE_MAJOR 4
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "libc_private.h"
static int _getdewey(int[], char *);
static int _cmpndewey(int[], int, int[], int);
static const char *_findshlib(char *, int *, int *);
static const char *_pathI18nModule = NULL;
/* from libexec/ld.aout_so/shlib.c */
#undef major
#undef minor
#define MAXDEWEY 3 /*ELF*/
static int
_getdewey(int dewey[], char *cp)
{
int i, n;
for (n = 0, i = 0; i < MAXDEWEY; i++) {
if (*cp == '\0')
break;
if (*cp == '.') cp++;
if (*cp < '0' || '9' < *cp)
return (0);
dewey[n++] = (int)_bcs_strtol(cp, &cp, 10);
}
return (n);
}
/*
* Compare two dewey arrays.
* Return -1 if `d1' represents a smaller value than `d2'.
* Return 1 if `d1' represents a greater value than `d2'.
* Return 0 if equal.
*/
static int
_cmpndewey(int d1[], int n1, int d2[], int n2)
{
int i;
for (i = 0; i < n1 && i < n2; i++) {
if (d1[i] < d2[i])
return (-1);
if (d1[i] > d2[i])
return (1);
}
if (n1 == n2)
return (0);
if (i == n1)
return (-1);
if (i == n2)
return (1);
/* cannot happen */
return (0);
}
static const char *
_findshlib(char *name, int *majorp, int *minorp)
{
char *lname;
const char *search_dirs[1];
static char path[PATH_MAX];
int dewey[MAXDEWEY], tmp[MAXDEWEY];
int i, len, major, minor, ndewey, n_search_dirs;
n_search_dirs = 1;
major = *majorp;
minor = *minorp;
path[0] = '\0';
search_dirs[0] = _pathI18nModule;
len = strlen(name);
lname = name;
ndewey = 0;
for (i = 0; i < n_search_dirs; i++) {
struct dirent *dp;
DIR *dd = opendir(search_dirs[i]);
int found_dot_a = 0, found_dot_so = 0;
if (dd == NULL)
break;
while ((dp = readdir(dd)) != NULL) {
int n;
if (dp->d_namlen < len + 4)
continue;
if (strncmp(dp->d_name, lname, (size_t)len) != 0)
continue;
if (strncmp(dp->d_name+len, ".so.", 4) != 0)
continue;
if ((n = _getdewey(tmp, dp->d_name+len+4)) == 0)
continue;
if (major != -1 && found_dot_a)
found_dot_a = 0;
/* XXX should verify the library is a.out/ELF? */
if (major == -1 && minor == -1)
goto compare_version;
else if (major != -1 && minor == -1) {
if (tmp[0] == major)
goto compare_version;
} else if (major != -1 && minor != -1) {
if (tmp[0] == major) {
if (n == 1 || tmp[1] >= minor)
goto compare_version;
}
}
/* else, this file does not qualify */
continue;
compare_version:
if (_cmpndewey(tmp, n, dewey, ndewey) <= 0)
continue;
/* We have a better version */
found_dot_so = 1;
snprintf(path, sizeof(path), "%s/%s", search_dirs[i],
dp->d_name);
found_dot_a = 0;
bcopy(tmp, dewey, sizeof(dewey));
ndewey = n;
*majorp = dewey[0];
*minorp = dewey[1];
}
closedir(dd);
if (found_dot_a || found_dot_so)
/*
* There's a lib in this dir; take it.
*/
return (path[0] ? path : NULL);
}
return (path[0] ? path : NULL);
}
void *
_citrus_find_getops(_citrus_module_t handle, const char *modname,
const char *ifname)
{
char name[PATH_MAX];
void *p;
snprintf(name, sizeof(name), "_citrus_%s_%s_getops",
modname, ifname);
p = dlsym((void *)handle, name);
return (p);
}
int
_citrus_load_module(_citrus_module_t *rhandle, const char *encname)
{
const char *p;
char path[PATH_MAX];
void *handle;
int maj, min;
if (_pathI18nModule == NULL) {
p = getenv("PATH_I18NMODULE");
if (p != NULL && !issetugid()) {
_pathI18nModule = strdup(p);
if (_pathI18nModule == NULL)
return (ENOMEM);
} else
_pathI18nModule = _PATH_I18NMODULE;
}
(void)snprintf(path, sizeof(path), "lib%s", encname);
maj = I18NMODULE_MAJOR;
min = -1;
p = _findshlib(path, &maj, &min);
if (!p)
return (EINVAL);
handle = libc_dlopen(p, RTLD_LAZY);
if (!handle) {
printf("%s", dlerror());
return (EINVAL);
}
*rhandle = (_citrus_module_t)handle;
return (0);
}
void
_citrus_unload_module(_citrus_module_t handle)
{
if (handle)
dlclose((void *)handle);
}
diff --git a/lib/libc/iconv/citrus_module.h b/lib/libc/iconv/citrus_module.h
index 0bcb53e2efa5..c733fb1fe3cb 100644
--- a/lib/libc/iconv/citrus_module.h
+++ b/lib/libc/iconv/citrus_module.h
@@ -1,56 +1,55 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_module.h,v 1.1 2002/03/17 22:14:20 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_MODULE_H_
#define _CITRUS_MODULE_H_
#define MATCH(x, act) \
do { \
if (lenvar >= (sizeof(#x)-1) && \
_bcs_strncasecmp(p, #x, sizeof(#x)-1) == 0) { \
act; \
lenvar -= sizeof(#x)-1; \
p += sizeof(#x)-1; \
} \
} while (0)
typedef struct _citrus_module_rec *_citrus_module_t;
__BEGIN_DECLS
void *_citrus_find_getops(_citrus_module_t __restrict,
const char * __restrict, const char * __restrict);
int _citrus_load_module(_citrus_module_t * __restrict,
const char * __restrict);
void _citrus_unload_module(_citrus_module_t);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_namespace.h b/lib/libc/iconv/citrus_namespace.h
index 4244c70d701e..3e57ba7e7854 100644
--- a/lib/libc/iconv/citrus_namespace.h
+++ b/lib/libc/iconv/citrus_namespace.h
@@ -1,243 +1,242 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_namespace.h,v 1.8 2009/01/11 02:46:24 christos Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include "citrus_bcs.h"
#ifndef _CITRUS_NAMESPACE_H_
#define _CITRUS_NAMESPACE_H_
/* citrus_alias */
#ifndef _CITRUS_ALIAS_NO_NAMESPACE
#define _alias_lookup _citrus_alias_lookup
#endif /* _CITRUS_ALIAS_NO_NAMESPACE */
/* citrus_bcs */
#ifndef _CITRUS_BCS_NO_NAMESPACE
#define _bcs_isalnum _citrus_bcs_isalnum
#define _bcs_isalpha _citrus_bcs_isalpha
#define _bcs_isblank _citrus_bcs_isblank
#define _bcs_isdigit _citrus_bcs_isdigit
#define _bcs_islower _citrus_bcs_islower
#define _bcs_iseol _citrus_bcs_iseol
#define _bcs_isspace _citrus_bcs_isspace
#define _bcs_isupper _citrus_bcs_isupper
#define _bcs_isxdigit _citrus_bcs_isxdigit
#define _bcs_skip_nonws _citrus_bcs_skip_nonws
#define _bcs_skip_nonws_len _citrus_bcs_skip_nonws_len
#define _bcs_skip_ws _citrus_bcs_skip_ws
#define _bcs_skip_ws_len _citrus_bcs_skip_ws_len
#define _bcs_strcasecmp _citrus_bcs_strcasecmp
#define _bcs_strncasecmp _citrus_bcs_strncasecmp
#define _bcs_tolower _citrus_bcs_tolower
#define _bcs_toupper _citrus_bcs_toupper
#define _bcs_trunc_rws_len _citrus_bcs_trunc_rws_len
#define _bcs_convert_to_lower _citrus_bcs_convert_to_lower
#define _bcs_convert_to_upper _citrus_bcs_convert_to_upper
#define _bcs_strtol _citrus_bcs_strtol
#define _bcs_strtoul _citrus_bcs_strtoul
#endif /* _CITRUS_BCS_NO_NAMESPACE */
/* citrus_csmapper */
#ifndef _CITRUS_CSMAPPER_NO_NAMESPACE
#define _csmapper _citrus_csmapper
#define _csmapper_open _citrus_csmapper_open
#define _csmapper_close _citrus_csmapper_close
#define _csmapper_convert _citrus_csmapper_convert
#define _csmapper_init_state _citrus_csmapper_init_state
#define _csmapper_get_state_size _citrus_csmapper_get_state_size
#define _csmapper_get_src_max _citrus_csmapper_get_src_max
#define _csmapper_get_dst_max _citrus_csmapper_get_dst_max
#define _CSMAPPER_F_PREVENT_PIVOT _CITRUS_CSMAPPER_F_PREVENT_PIVOT
#endif /* _CITRUS_CSMAPPER_NO_NAMESPACE */
/* citrus_db */
#ifndef _CITRUS_DB_NO_NAMESPACE
#define _db_open _citrus_db_open
#define _db_close _citrus_db_close
#define _db_lookup _citrus_db_lookup
#define _db_lookup_by_s _citrus_db_lookup_by_string
#define _db_lookup8_by_s _citrus_db_lookup8_by_string
#define _db_lookup16_by_s _citrus_db_lookup16_by_string
#define _db_lookup32_by_s _citrus_db_lookup32_by_string
#define _db_lookupstr_by_s _citrus_db_lookup_string_by_string
#define _db_hash_std _citrus_db_hash_std
#define _db_get_num_entries _citrus_db_get_number_of_entries
#define _db_get_entry _citrus_db_get_entry
#define _db_locator _citrus_db_locator
#define _db_locator_init _citrus_db_locator_init
#endif /* _CITRUS_DB_NO_NAMESPACE */
/* citrus_db_factory */
#ifndef _CITRUS_DB_FACTORY_NO_NAMESPACE
#define _db_factory _citrus_db_factory
#define _db_factory_create _citrus_db_factory_create
#define _db_factory_free _citrus_db_factory_free
#define _db_factory_add _citrus_db_factory_add
#define _db_factory_add_by_s _citrus_db_factory_add_by_string
#define _db_factory_add8_by_s _citrus_db_factory_add8_by_string
#define _db_factory_add16_by_s _citrus_db_factory_add16_by_string
#define _db_factory_add32_by_s _citrus_db_factory_add32_by_string
#define _db_factory_addstr_by_s _citrus_db_factory_add_string_by_string
#define _db_factory_calc_size _citrus_db_factory_calc_size
#define _db_factory_serialize _citrus_db_factory_serialize
#endif /* _CITRUS_DB_FACTORY_NO_NAMESPACE */
/* citrus_lookup */
#ifndef _CITRUS_DB_NO_NAMESPACE
#define _LOOKUP_CASE_SENSITIVE _CITRUS_LOOKUP_CASE_SENSITIVE
#define _LOOKUP_CASE_IGNORE _CITRUS_LOOKUP_CASE_IGNORE
#define _lookup _citrus_lookup
#define _lookup_simple _citrus_lookup_simple
#define _lookup_alias _citrus_lookup_alias
#define _lookup_seq_open _citrus_lookup_seq_open
#define _lookup_seq_rewind _citrus_lookup_seq_rewind
#define _lookup_seq_next _citrus_lookup_seq_next
#define _lookup_seq_lookup _citrus_lookup_seq_lookup
#define _lookup_get_num_entries _citrus_lookup_get_number_of_entries
#define _lookup_seq_close _citrus_lookup_seq_close
#define _lookup_factory_convert _citrus_lookup_factory_convert
#endif /* _CITRUS_DB_NO_NAMESPACE */
/* citrus_esdb */
#ifndef _CITRUS_ESDB_NO_NAMESPACE
#define _esdb _citrus_esdb
#define _esdb_charset _citrus_esdb_charset
#define _esdb_open _citrus_esdb_open
#define _esdb_close _citrus_esdb_close
#define _esdb_get_list _citrus_esdb_get_list
#define _esdb_free_list _citrus_esdb_free_list
#endif /* _CITRUS_ESDB_NO_NAMESPACE */
/* citrus_hash */
#ifndef _CITRUS_HASH_NO_NAMESPACE
#define _citrus_string_hash_func _string_hash_func
#endif /* _CITRUS_HASH_NO_NAMESPACE */
/* citrus_mapper */
#ifndef _CITRUS_MAPPER_NO_NAMESPACE
#define _mapper _citrus_mapper
#define _mapper_ops _citrus_mapper_ops
#define _mapper_traits _citrus_mapper_traits
#define _mapper_open _citrus_mapper_open
#define _mapper_open_direct _citrus_mapper_open_direct
#define _mapper_close _citrus_mapper_close
#define _MAPPER_CONVERT_SUCCESS _CITRUS_MAPPER_CONVERT_SUCCESS
#define _MAPPER_CONVERT_NONIDENTICAL _CITRUS_MAPPER_CONVERT_NONIDENTICAL
#define _MAPPER_CONVERT_SRC_MORE _CITRUS_MAPPER_CONVERT_SRC_MORE
#define _MAPPER_CONVERT_DST_MORE _CITRUS_MAPPER_CONVERT_DST_MORE
#define _MAPPER_CONVERT_ILSEQ _CITRUS_MAPPER_CONVERT_ILSEQ
#define _MAPPER_CONVERT_FATAL _CITRUS_MAPPER_CONVERT_FATAL
#define _mapper_convert _citrus_mapper_convert
#define _mapper_init_state _citrus_mapper_init_state
#define _mapper_get_state_size _citrus_mapper_get_state_size
#define _mapper_get_src_max _citrus_mapper_get_src_max
#define _mapper_get_dst_max _citrus_mapper_get_dst_max
#define _mapper_set_persistent _citrus_mapper_set_persistent
#endif /* _CITRUS_MAPPER_NO_NAMESPACE */
/* citrus_memstream */
#ifndef _CITRUS_MEMSTREAM_NO_NAMESPACE
#define _memstream _citrus_memory_stream
#define _memstream_getln _citrus_memory_stream_getln
#define _memstream_matchline _citrus_memory_stream_matchline
#define _memstream_chr _citrus_memory_stream_chr
#define _memstream_skip_ws _citrus_memory_stream_skip_ws
#define _memstream_iseof _citrus_memory_stream_iseof
#define _memstream_bind _citrus_memory_stream_bind
#define _memstream_bind_ptr _citrus_memory_stream_bind_ptr
#define _memstream_seek _citrus_memory_stream_seek
#define _memstream_rewind _citrus_memory_stream_rewind
#define _memstream_tell _citrus_memory_stream_tell
#define _memstream_remainder _citrus_memory_stream_remainder
#define _memstream_getc _citrus_memory_stream_getc
#define _memstream_ungetc _citrus_memory_stream_ungetc
#define _memstream_peek _citrus_memory_stream_peek
#define _memstream_getregion _citrus_memory_stream_getregion
#define _memstream_getln_region _citrus_memory_stream_getln_region
#endif /* _CITRUS_MEMSTREAM_NO_NAMESPACE */
/* citrus_mmap */
#ifndef _CITRUS_MMAP_NO_NAMESPACE
#define _map_file _citrus_map_file
#define _unmap_file _citrus_unmap_file
#endif /* _CITRUS_MMAP_NO_NAMESPACE */
#ifndef _CITRUS_PIVOT_NO_NAMESPACE
#define _pivot_factory_convert _citrus_pivot_factory_convert
#endif /* _CITRUS_PIVOT_NO_NAMESPACE */
/* citrus_region.h */
#ifndef _CITRUS_REGION_NO_NAMESPACE
#define _region _citrus_region
#define _region_init _citrus_region_init
#define _region_head _citrus_region_head
#define _region_size _citrus_region_size
#define _region_check _citrus_region_check
#define _region_offset _citrus_region_offset
#define _region_peek8 _citrus_region_peek8
#define _region_peek16 _citrus_region_peek16
#define _region_peek32 _citrus_region_peek32
#define _region_get_subregion _citrus_region_get_subregion
#endif /* _CITRUS_REGION_NO_NAMESPACE */
/* citrus_stdenc.h */
#ifndef _CITRUS_STDENC_NO_NAMESPACE
#define _stdenc _citrus_stdenc
#define _stdenc_ops _citrus_stdenc_ops
#define _stdenc_traits _citrus_stdenc_traits
#define _stdenc_state_desc _citrus_stdenc_state_desc
#define _stdenc_open _citrus_stdenc_open
#define _stdenc_close _citrus_stdenc_close
#define _stdenc_init_state _citrus_stdenc_init_state
#define _stdenc_mbtocs _citrus_stdenc_mbtocs
#define _stdenc_cstomb _citrus_stdenc_cstomb
#define _stdenc_mbtowc _citrus_stdenc_mbtowc
#define _stdenc_wctomb _citrus_stdenc_wctomb
#define _stdenc_put_state_reset _citrus_stdenc_put_state_reset
#define _stdenc_get_state_size _citrus_stdenc_get_state_size
#define _stdenc_get_mb_cur_max _citrus_stdenc_get_mb_cur_max
#define _stdenc_get_state_desc _citrus_stdenc_get_state_desc
#define _STDENC_SDID_GENERIC _CITRUS_STDENC_SDID_GENERIC
#define _STDENC_SDGEN_UNKNOWN _CITRUS_STDENC_SDGEN_UNKNOWN
#define _STDENC_SDGEN_INITIAL _CITRUS_STDENC_SDGEN_INITIAL
#define _STDENC_SDGEN_STABLE _CITRUS_STDENC_SDGEN_STABLE
#define _STDENC_SDGEN_INCOMPLETE_CHAR _CITRUS_STDENC_SDGEN_INCOMPLETE_CHAR
#define _STDENC_SDGEN_INCOMPLETE_SHIFT _CITRUS_STDENC_SDGEN_INCOMPLETE_SHIFT
#endif /* _CITRUS_STDENC_NO_NAMESPACE */
/* citrus_types.h */
#ifndef _CITRUS_TYPES_NO_NAMESPACE
#define _index_t _citrus_index_t
#define _csid_t _citrus_csid_t
#define _wc_t _citrus_wc_t
#endif /* _CITRUS_TYPES_NO_NAMESPACE */
#endif
diff --git a/lib/libc/iconv/citrus_none.c b/lib/libc/iconv/citrus_none.c
index 033fe4011e00..3ae0a236f8f1 100644
--- a/lib/libc/iconv/citrus_none.c
+++ b/lib/libc/iconv/citrus_none.c
@@ -1,239 +1,238 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_none.c,v 1.18 2008/06/14 16:01:07 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2002 Citrus Project,
* Copyright (c) 2010 Gabor Kovesdan <gabor@FreeBSD.org>,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <iconv.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_none.h"
#include "citrus_stdenc.h"
_CITRUS_STDENC_DECLS(NONE);
_CITRUS_STDENC_DEF_OPS(NONE);
struct _citrus_stdenc_traits _citrus_NONE_stdenc_traits = {
0, /* et_state_size */
1, /* mb_cur_max */
};
static int
_citrus_NONE_stdenc_init(struct _citrus_stdenc * __restrict ce,
const void *var __unused, size_t lenvar __unused,
struct _citrus_stdenc_traits * __restrict et)
{
et->et_state_size = 0;
et->et_mb_cur_max = 1;
ce->ce_closure = NULL;
return (0);
}
static void
_citrus_NONE_stdenc_uninit(struct _citrus_stdenc *ce __unused)
{
}
static int
_citrus_NONE_stdenc_init_state(struct _citrus_stdenc * __restrict ce __unused,
void * __restrict ps __unused)
{
return (0);
}
static int
_citrus_NONE_stdenc_mbtocs(struct _citrus_stdenc * __restrict ce __unused,
_csid_t *csid, _index_t *idx, char **s, size_t n,
void *ps __unused, size_t *nresult, struct iconv_hooks *hooks)
{
if (n < 1) {
*nresult = (size_t)-2;
return (0);
}
*csid = 0;
*idx = (_index_t)(unsigned char)*(*s)++;
*nresult = *idx == 0 ? 0 : 1;
if ((hooks != NULL) && (hooks->uc_hook != NULL))
hooks->uc_hook((unsigned int)*idx, hooks->data);
return (0);
}
static int
_citrus_NONE_stdenc_cstomb(struct _citrus_stdenc * __restrict ce __unused,
char *s, size_t n, _csid_t csid, _index_t idx, void *ps __unused,
size_t *nresult, struct iconv_hooks *hooks __unused)
{
if (csid == _CITRUS_CSID_INVALID) {
*nresult = 0;
return (0);
}
if (csid != 0)
return (EILSEQ);
if ((idx & 0x000000FF) == idx) {
if (n < 1) {
*nresult = (size_t)-1;
return (E2BIG);
}
*s = (char)idx;
*nresult = 1;
} else if ((idx & 0x0000FFFF) == idx) {
if (n < 2) {
*nresult = (size_t)-1;
return (E2BIG);
}
s[0] = (char)idx;
/* XXX: might be endian dependent */
s[1] = (char)(idx >> 8);
*nresult = 2;
} else if ((idx & 0x00FFFFFF) == idx) {
if (n < 3) {
*nresult = (size_t)-1;
return (E2BIG);
}
s[0] = (char)idx;
/* XXX: might be endian dependent */
s[1] = (char)(idx >> 8);
s[2] = (char)(idx >> 16);
*nresult = 3;
} else {
if (n < 4) {
*nresult = (size_t)-1;
return (E2BIG);
}
s[0] = (char)idx;
/* XXX: might be endian dependent */
s[1] = (char)(idx >> 8);
s[2] = (char)(idx >> 16);
s[3] = (char)(idx >> 24);
*nresult = 4;
}
return (0);
}
static int
_citrus_NONE_stdenc_mbtowc(struct _citrus_stdenc * __restrict ce __unused,
_wc_t * __restrict pwc, char ** __restrict s, size_t n,
void * __restrict pspriv __unused, size_t * __restrict nresult,
struct iconv_hooks *hooks)
{
if (*s == NULL) {
*nresult = 0;
return (0);
}
if (n == 0) {
*nresult = (size_t)-2;
return (0);
}
if (pwc != NULL)
*pwc = (_wc_t)(unsigned char) **s;
*nresult = **s == '\0' ? 0 : 1;
if ((hooks != NULL) && (hooks->wc_hook != NULL))
hooks->wc_hook(*pwc, hooks->data);
return (0);
}
static int
_citrus_NONE_stdenc_wctomb(struct _citrus_stdenc * __restrict ce __unused,
char * __restrict s, size_t n, _wc_t wc,
void * __restrict pspriv __unused, size_t * __restrict nresult,
struct iconv_hooks *hooks __unused)
{
if ((wc & ~0xFFU) != 0) {
*nresult = (size_t)-1;
return (EILSEQ);
}
if (n == 0) {
*nresult = (size_t)-1;
return (E2BIG);
}
*nresult = 1;
if (s != NULL && n > 0)
*s = (char)wc;
return (0);
}
static int
_citrus_NONE_stdenc_put_state_reset(struct _citrus_stdenc * __restrict ce __unused,
char * __restrict s __unused, size_t n __unused,
void * __restrict pspriv __unused, size_t * __restrict nresult)
{
*nresult = 0;
return (0);
}
static int
_citrus_NONE_stdenc_get_state_desc(struct _stdenc * __restrict ce __unused,
void * __restrict ps __unused, int id,
struct _stdenc_state_desc * __restrict d)
{
int ret = 0;
switch (id) {
case _STDENC_SDID_GENERIC:
d->u.generic.state = _STDENC_SDGEN_INITIAL;
break;
default:
ret = EOPNOTSUPP;
}
return (ret);
}
diff --git a/lib/libc/iconv/citrus_none.h b/lib/libc/iconv/citrus_none.h
index a0ebd61f296e..241b4db1cd58 100644
--- a/lib/libc/iconv/citrus_none.h
+++ b/lib/libc/iconv/citrus_none.h
@@ -1,38 +1,37 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_none.h,v 1.3 2003/06/25 09:51:38 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_NONE_H_
#define _CITRUS_NONE_H_
extern struct _citrus_stdenc_ops _citrus_NONE_stdenc_ops;
extern struct _citrus_stdenc_traits _citrus_NONE_stdenc_traits;
#endif
diff --git a/lib/libc/iconv/citrus_pivot_factory.c b/lib/libc/iconv/citrus_pivot_factory.c
index c307a9d5aa32..8441ae3c5cdb 100644
--- a/lib/libc/iconv/citrus_pivot_factory.c
+++ b/lib/libc/iconv/citrus_pivot_factory.c
@@ -1,227 +1,226 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_pivot_factory.c,v 1.7 2009/04/12 14:20:19 lukem Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_region.h"
#include "citrus_bcs.h"
#include "citrus_db_factory.h"
#include "citrus_db_hash.h"
#include "citrus_pivot_file.h"
#include "citrus_pivot_factory.h"
struct src_entry {
char *se_name;
struct _citrus_db_factory *se_df;
STAILQ_ENTRY(src_entry) se_entry;
};
STAILQ_HEAD(src_head, src_entry);
static int
find_src(struct src_head *sh, struct src_entry **rse, const char *name)
{
int ret;
struct src_entry *se;
STAILQ_FOREACH(se, sh, se_entry) {
if (_bcs_strcasecmp(se->se_name, name) == 0) {
*rse = se;
return (0);
}
}
se = malloc(sizeof(*se));
if (se == NULL)
return (errno);
se->se_name = strdup(name);
if (se->se_name == NULL) {
ret = errno;
free(se);
return (ret);
}
ret = _db_factory_create(&se->se_df, &_db_hash_std, NULL);
if (ret) {
free(se->se_name);
free(se);
return (ret);
}
STAILQ_INSERT_TAIL(sh, se, se_entry);
*rse = se;
return (0);
}
static void
free_src(struct src_head *sh)
{
struct src_entry *se;
while ((se = STAILQ_FIRST(sh)) != NULL) {
STAILQ_REMOVE_HEAD(sh, se_entry);
_db_factory_free(se->se_df);
free(se->se_name);
free(se);
}
}
#define T_COMM '#'
static int
convert_line(struct src_head *sh, const char *line, size_t len)
{
struct src_entry *se;
const char *p;
char key1[LINE_MAX], key2[LINE_MAX], data[LINE_MAX];
char *ep;
uint32_t val;
int ret;
se = NULL;
/* cut off trailing comment */
p = memchr(line, T_COMM, len);
if (p)
len = p - line;
/* key1 */
line = _bcs_skip_ws_len(line, &len);
if (len == 0)
return (0);
p = _bcs_skip_nonws_len(line, &len);
if (p == line)
return (0);
snprintf(key1, sizeof(key1), "%.*s", (int)(p - line), line);
/* key2 */
line = _bcs_skip_ws_len(p, &len);
if (len == 0)
return (0);
p = _bcs_skip_nonws_len(line, &len);
if (p == line)
return (0);
snprintf(key2, sizeof(key2), "%.*s", (int)(p - line), line);
/* data */
line = _bcs_skip_ws_len(p, &len);
_bcs_trunc_rws_len(line, &len);
snprintf(data, sizeof(data), "%.*s", (int)len, line);
val = strtoul(data, &ep, 0);
if (*ep != '\0')
return (EFTYPE);
/* insert to DB */
ret = find_src(sh, &se, key1);
if (ret)
return (ret);
return (_db_factory_add32_by_s(se->se_df, key2, val));
}
static int
dump_db(struct src_head *sh, struct _region *r)
{
struct _db_factory *df;
struct src_entry *se;
struct _region subr;
void *ptr;
size_t size;
int ret;
ret = _db_factory_create(&df, &_db_hash_std, NULL);
if (ret)
return (ret);
STAILQ_FOREACH(se, sh, se_entry) {
size = _db_factory_calc_size(se->se_df);
ptr = malloc(size);
if (ptr == NULL)
goto quit;
_region_init(&subr, ptr, size);
ret = _db_factory_serialize(se->se_df, _CITRUS_PIVOT_SUB_MAGIC,
&subr);
if (ret)
goto quit;
ret = _db_factory_add_by_s(df, se->se_name, &subr, 1);
if (ret)
goto quit;
}
size = _db_factory_calc_size(df);
ptr = malloc(size);
if (ptr == NULL)
goto quit;
_region_init(r, ptr, size);
ret = _db_factory_serialize(df, _CITRUS_PIVOT_MAGIC, r);
ptr = NULL;
quit:
free(ptr);
_db_factory_free(df);
return (ret);
}
int
_citrus_pivot_factory_convert(FILE *out, FILE *in)
{
struct src_head sh;
struct _region r;
char *line;
size_t size;
int ret;
STAILQ_INIT(&sh);
while ((line = fgetln(in, &size)) != NULL)
if ((ret = convert_line(&sh, line, size))) {
free_src(&sh);
return (ret);
}
ret = dump_db(&sh, &r);
free_src(&sh);
if (ret)
return (ret);
if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1)
return (errno);
return (0);
}
diff --git a/lib/libc/iconv/citrus_pivot_factory.h b/lib/libc/iconv/citrus_pivot_factory.h
index adbfc8c77524..0b4d8513f732 100644
--- a/lib/libc/iconv/citrus_pivot_factory.h
+++ b/lib/libc/iconv/citrus_pivot_factory.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_pivot_factory.h,v 1.1 2003/06/25 09:51:39 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_PIVOT_FACTORY_H_
#define _CITRUS_PIVOT_FACTORY_H_
__BEGIN_DECLS
int _citrus_pivot_factory_convert(FILE *, FILE *);
__END_DECLS
#endif
diff --git a/lib/libc/iconv/citrus_pivot_file.h b/lib/libc/iconv/citrus_pivot_file.h
index b2b4f2408dba..24b9101b9071 100644
--- a/lib/libc/iconv/citrus_pivot_file.h
+++ b/lib/libc/iconv/citrus_pivot_file.h
@@ -1,38 +1,37 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_pivot_file.h,v 1.1 2003/06/25 09:51:39 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_PIVOT_FILE_H_
#define _CITRUS_PIVOT_FILE_H_
#define _CITRUS_PIVOT_MAGIC "CSPIVOT\0"
#define _CITRUS_PIVOT_SUB_MAGIC "CSPIVSUB"
#endif
diff --git a/lib/libc/iconv/citrus_prop.c b/lib/libc/iconv/citrus_prop.c
index 0b627f362c22..283200f10073 100644
--- a/lib/libc/iconv/citrus_prop.c
+++ b/lib/libc/iconv/citrus_prop.c
@@ -1,448 +1,447 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_prop.c,v 1.4 2011/03/30 08:22:01 jruoho Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_prop.h"
typedef struct {
_citrus_prop_type_t type;
union {
const char *str;
int chr;
bool boolean;
uint64_t num;
} u;
} _citrus_prop_object_t;
static __inline void
_citrus_prop_object_init(_citrus_prop_object_t *obj, _citrus_prop_type_t type)
{
obj->type = type;
memset(&obj->u, 0, sizeof(obj->u));
}
static __inline void
_citrus_prop_object_uninit(_citrus_prop_object_t *obj)
{
if (obj->type == _CITRUS_PROP_STR)
free(__DECONST(void *, obj->u.str));
}
static const char *xdigit = "0123456789ABCDEF";
#define _CITRUS_PROP_READ_UINT_COMMON(_func_, _type_, _max_) \
static int \
_citrus_prop_read_##_func_##_common(struct _memstream * __restrict ms, \
_type_ * __restrict result, int base, int neg) \
{ \
_type_ acc, cutoff; \
int ch, cutlim, n; \
char *p; \
\
acc = (_type_)0; \
cutoff = _max_ / base; \
cutlim = _max_ % base; \
for (;;) { \
ch = _memstream_getc(ms); \
p = strchr(xdigit, _bcs_toupper(ch)); \
if (p == NULL || (n = (p - xdigit)) >= base) \
break; \
if (acc > cutoff || (acc == cutoff && n > cutlim)) \
break; \
acc *= base; \
acc += n; \
} \
_memstream_ungetc(ms, ch); \
*result = neg ? -acc : acc; \
return (0); \
}
_CITRUS_PROP_READ_UINT_COMMON(chr, int, UCHAR_MAX)
_CITRUS_PROP_READ_UINT_COMMON(num, uint64_t, UINT64_MAX)
#undef _CITRUS_PROP_READ_UINT_COMMON
#define _CITRUS_PROP_READ_INT(_func_, _type_) \
static int \
_citrus_prop_read_##_func_(struct _memstream * __restrict ms, \
_citrus_prop_object_t * __restrict obj) \
{ \
int base, ch, neg; \
\
_memstream_skip_ws(ms); \
ch = _memstream_getc(ms); \
neg = 0; \
switch (ch) { \
case '-': \
neg = 1; \
case '+': \
ch = _memstream_getc(ms); \
} \
base = 10; \
if (ch == '0') { \
base -= 2; \
ch = _memstream_getc(ms); \
if (ch == 'x' || ch == 'X') { \
ch = _memstream_getc(ms); \
if (_bcs_isxdigit(ch) == 0) { \
_memstream_ungetc(ms, ch); \
obj->u._func_ = 0; \
return (0); \
} \
base += 8; \
} \
} else if (_bcs_isdigit(ch) == 0) \
return (EINVAL); \
_memstream_ungetc(ms, ch); \
return (_citrus_prop_read_##_func_##_common \
(ms, &obj->u._func_, base, neg)); \
}
_CITRUS_PROP_READ_INT(chr, int)
_CITRUS_PROP_READ_INT(num, uint64_t)
#undef _CITRUS_PROP_READ_INT
static int
_citrus_prop_read_character_common(struct _memstream * __restrict ms,
int * __restrict result)
{
int base, ch;
ch = _memstream_getc(ms);
if (ch != '\\')
*result = ch;
else {
ch = _memstream_getc(ms);
base = 16;
switch (ch) {
case 'a':
*result = '\a';
break;
case 'b':
*result = '\b';
break;
case 'f':
*result = '\f';
break;
case 'n':
*result = '\n';
break;
case 'r':
*result = '\r';
break;
case 't':
*result = '\t';
break;
case 'v':
*result = '\v';
break;
case '0': case '1': case '2': case '3':
case '4': case '5': case '6': case '7':
_memstream_ungetc(ms, ch);
base -= 8;
/*FALLTHROUGH*/
case 'x':
return (_citrus_prop_read_chr_common(ms, result,
base, 0));
/*NOTREACHED*/
default:
/* unknown escape */
*result = ch;
}
}
return (0);
}
static int
_citrus_prop_read_character(struct _memstream * __restrict ms,
_citrus_prop_object_t * __restrict obj)
{
int ch, errnum;
_memstream_skip_ws(ms);
ch = _memstream_getc(ms);
if (ch != '\'') {
_memstream_ungetc(ms, ch);
return (_citrus_prop_read_chr(ms, obj));
}
errnum = _citrus_prop_read_character_common(ms, &ch);
if (errnum != 0)
return (errnum);
obj->u.chr = ch;
ch = _memstream_getc(ms);
if (ch != '\'')
return (EINVAL);
return (0);
}
static int
_citrus_prop_read_bool(struct _memstream * __restrict ms,
_citrus_prop_object_t * __restrict obj)
{
_memstream_skip_ws(ms);
switch (_bcs_tolower(_memstream_getc(ms))) {
case 't':
if (_bcs_tolower(_memstream_getc(ms)) == 'r' &&
_bcs_tolower(_memstream_getc(ms)) == 'u' &&
_bcs_tolower(_memstream_getc(ms)) == 'e') {
obj->u.boolean = true;
return (0);
}
break;
case 'f':
if (_bcs_tolower(_memstream_getc(ms)) == 'a' &&
_bcs_tolower(_memstream_getc(ms)) == 'l' &&
_bcs_tolower(_memstream_getc(ms)) == 's' &&
_bcs_tolower(_memstream_getc(ms)) == 'e') {
obj->u.boolean = false;
return (0);
}
}
return (EINVAL);
}
static int
_citrus_prop_read_str(struct _memstream * __restrict ms,
_citrus_prop_object_t * __restrict obj)
{
int ch, errnum, quot;
char *s, *t;
#define _CITRUS_PROP_STR_BUFSIZ 512
size_t m, n;
m = _CITRUS_PROP_STR_BUFSIZ;
s = malloc(m);
if (s == NULL)
return (ENOMEM);
n = 0;
_memstream_skip_ws(ms);
quot = _memstream_getc(ms);
switch (quot) {
case EOF:
goto done;
/*NOTREACHED*/
case '\\':
_memstream_ungetc(ms, quot);
quot = EOF;
/*FALLTHROUGH*/
case '\"': case '\'':
break;
default:
s[n] = quot;
++n, --m;
quot = EOF;
}
for (;;) {
if (m < 1) {
m = _CITRUS_PROP_STR_BUFSIZ;
t = realloc(s, n + m);
if (t == NULL) {
free(s);
return (ENOMEM);
}
s = t;
}
ch = _memstream_getc(ms);
if (quot == ch || (quot == EOF &&
(ch == ';' || _bcs_isspace(ch)))) {
done:
s[n] = '\0';
obj->u.str = (const char *)s;
return (0);
}
_memstream_ungetc(ms, ch);
errnum = _citrus_prop_read_character_common(ms, &ch);
if (errnum != 0) {
free(s);
return (errnum);
}
s[n] = ch;
++n, --m;
}
free(s);
return (EINVAL);
#undef _CITRUS_PROP_STR_BUFSIZ
}
typedef int (*_citrus_prop_read_type_t)(struct _memstream * __restrict,
_citrus_prop_object_t * __restrict);
static const _citrus_prop_read_type_t readers[] = {
_citrus_prop_read_bool,
_citrus_prop_read_str,
_citrus_prop_read_character,
_citrus_prop_read_num,
};
static __inline int
_citrus_prop_read_symbol(struct _memstream * __restrict ms,
char * __restrict s, size_t n)
{
int ch;
size_t m;
for (m = 0; m < n; ++m) {
ch = _memstream_getc(ms);
if (ch != '_' && _bcs_isalnum(ch) == 0)
goto name_found;
s[m] = ch;
}
ch = _memstream_getc(ms);
if (ch == '_' || _bcs_isalnum(ch) != 0)
return (EINVAL);
name_found:
_memstream_ungetc(ms, ch);
s[m] = '\0';
return (0);
}
static int
_citrus_prop_parse_element(struct _memstream * __restrict ms,
const _citrus_prop_hint_t * __restrict hints, void * __restrict context)
{
int ch, errnum;
#define _CITRUS_PROP_HINT_NAME_LEN_MAX 255
char name[_CITRUS_PROP_HINT_NAME_LEN_MAX + 1];
const _citrus_prop_hint_t *hint;
_citrus_prop_object_t ostart, oend;
errnum = _citrus_prop_read_symbol(ms, name, sizeof(name));
if (errnum != 0)
return (errnum);
for (hint = hints; hint->name != NULL; ++hint)
if (_citrus_bcs_strcasecmp(name, hint->name) == 0)
goto hint_found;
return (EINVAL);
hint_found:
_memstream_skip_ws(ms);
ch = _memstream_getc(ms);
if (ch != '=' && ch != ':')
_memstream_ungetc(ms, ch);
do {
_citrus_prop_object_init(&ostart, hint->type);
_citrus_prop_object_init(&oend, hint->type);
errnum = (*readers[hint->type])(ms, &ostart);
if (errnum != 0)
return (errnum);
_memstream_skip_ws(ms);
ch = _memstream_getc(ms);
switch (hint->type) {
case _CITRUS_PROP_BOOL:
/*FALLTHROUGH*/
case _CITRUS_PROP_STR:
break;
default:
if (ch != '-')
break;
errnum = (*readers[hint->type])(ms, &oend);
if (errnum != 0)
return (errnum);
_memstream_skip_ws(ms);
ch = _memstream_getc(ms);
}
#define CALL0(_func_) \
do { \
errnum = (*hint->cb._func_.func)(context, \
hint->name, ostart.u._func_); \
} while (0)
#define CALL1(_func_) \
do { \
errnum = (*hint->cb._func_.func)(context, \
hint->name, ostart.u._func_, oend.u._func_);\
} while (0)
switch (hint->type) {
case _CITRUS_PROP_BOOL:
CALL0(boolean);
break;
case _CITRUS_PROP_STR:
CALL0(str);
break;
case _CITRUS_PROP_CHR:
CALL1(chr);
break;
case _CITRUS_PROP_NUM:
CALL1(num);
break;
default:
abort();
/*NOTREACHED*/
}
#undef CALL0
#undef CALL1
_citrus_prop_object_uninit(&ostart);
_citrus_prop_object_uninit(&oend);
if (errnum != 0)
return (errnum);
} while (ch == ',');
if (ch != ';')
_memstream_ungetc(ms, ch);
return (0);
}
int
_citrus_prop_parse_variable(const _citrus_prop_hint_t * __restrict hints,
void * __restrict context, const void *var, size_t lenvar)
{
struct _memstream ms;
int ch, errnum;
_memstream_bind_ptr(&ms, __DECONST(void *, var), lenvar);
for (;;) {
_memstream_skip_ws(&ms);
ch = _memstream_getc(&ms);
if (ch == EOF || ch == '\0')
break;
_memstream_ungetc(&ms, ch);
errnum = _citrus_prop_parse_element(&ms, hints, context);
if (errnum != 0)
return (errnum);
}
return (0);
}
diff --git a/lib/libc/iconv/citrus_prop.h b/lib/libc/iconv/citrus_prop.h
index f09c833b8da6..065055f0d9bc 100644
--- a/lib/libc/iconv/citrus_prop.h
+++ b/lib/libc/iconv/citrus_prop.h
@@ -1,94 +1,93 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_prop.h,v 1.5 2011/05/23 14:52:32 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_PROP_H_
#define _CITRUS_PROP_H_
typedef enum {
_CITRUS_PROP_BOOL = 0,
_CITRUS_PROP_STR = 1,
_CITRUS_PROP_CHR = 2,
_CITRUS_PROP_NUM = 3,
} _citrus_prop_type_t;
typedef struct _citrus_prop_hint_t _citrus_prop_hint_t;
#define _CITRUS_PROP_CB0_T(_func_, _type_) \
typedef int (*_citrus_prop_##_func_##_cb_func_t) \
(void * __restrict, const char *, _type_); \
typedef struct { \
_citrus_prop_##_func_##_cb_func_t func; \
} _citrus_prop_##_func_##_cb_t;
_CITRUS_PROP_CB0_T(boolean, int)
_CITRUS_PROP_CB0_T(str, const char *)
#undef _CITRUS_PROP_CB0_T
#define _CITRUS_PROP_CB1_T(_func_, _type_) \
typedef int (*_citrus_prop_##_func_##_cb_func_t) \
(void * __restrict, const char *, _type_, _type_); \
typedef struct { \
_citrus_prop_##_func_##_cb_func_t func; \
} _citrus_prop_##_func_##_cb_t;
_CITRUS_PROP_CB1_T(chr, int)
_CITRUS_PROP_CB1_T(num, uint64_t)
#undef _CITRUS_PROP_CB1_T
struct _citrus_prop_hint_t {
const char *name;
_citrus_prop_type_t type;
#define _CITRUS_PROP_CB_T_OPS(_name_) \
_citrus_prop_##_name_##_cb_t _name_
union {
_CITRUS_PROP_CB_T_OPS(boolean);
_CITRUS_PROP_CB_T_OPS(str);
_CITRUS_PROP_CB_T_OPS(chr);
_CITRUS_PROP_CB_T_OPS(num);
} cb;
};
#define _CITRUS_PROP_HINT_BOOL(name, cb) \
{ name, _CITRUS_PROP_BOOL, { .boolean = { cb } } }
#define _CITRUS_PROP_HINT_STR(name, cb) \
{ name, _CITRUS_PROP_STR, { .str = { cb } } }
#define _CITRUS_PROP_HINT_CHR(name, cb) \
{ name, _CITRUS_PROP_CHR, { .chr = { cb } } }
#define _CITRUS_PROP_HINT_NUM(name, cb) \
{ name, _CITRUS_PROP_NUM, { .num = { cb } } }
#define _CITRUS_PROP_HINT_END \
{ .name = NULL }
__BEGIN_DECLS
int _citrus_prop_parse_variable(const _citrus_prop_hint_t * __restrict,
void * __restrict, const void *, size_t);
__END_DECLS
#endif /* !_CITRUS_PROP_H_ */
diff --git a/lib/libc/iconv/citrus_region.h b/lib/libc/iconv/citrus_region.h
index 0a78eec2b85c..f84d4163e240 100644
--- a/lib/libc/iconv/citrus_region.h
+++ b/lib/libc/iconv/citrus_region.h
@@ -1,115 +1,114 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_region.h,v 1.7 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_REGION_H_
#define _CITRUS_REGION_H_
#include <sys/types.h>
struct _citrus_region {
void *r_head;
size_t r_size;
};
static __inline void
_citrus_region_init(struct _citrus_region *r, void *h, size_t sz)
{
r->r_head = h;
r->r_size = sz;
}
static __inline void *
_citrus_region_head(const struct _citrus_region *r)
{
return (r->r_head);
}
static __inline size_t
_citrus_region_size(const struct _citrus_region *r)
{
return (r->r_size);
}
static __inline int
_citrus_region_check(const struct _citrus_region *r, size_t ofs, size_t sz)
{
return (r->r_size >= ofs + sz ? 0 : -1);
}
static __inline void *
_citrus_region_offset(const struct _citrus_region *r, size_t pos)
{
return ((void *)((uint8_t *)r->r_head + pos));
}
static __inline uint8_t
_citrus_region_peek8(const struct _citrus_region *r, size_t pos)
{
return (*(uint8_t *)_citrus_region_offset(r, pos));
}
static __inline uint16_t
_citrus_region_peek16(const struct _citrus_region *r, size_t pos)
{
uint16_t val;
memcpy(&val, _citrus_region_offset(r, pos), (size_t)2);
return (val);
}
static __inline uint32_t
_citrus_region_peek32(const struct _citrus_region *r, size_t pos)
{
uint32_t val;
memcpy(&val, _citrus_region_offset(r, pos), (size_t)4);
return (val);
}
static __inline int
_citrus_region_get_subregion(struct _citrus_region *subr,
const struct _citrus_region *r, size_t ofs, size_t sz)
{
if (_citrus_region_check(r, ofs, sz))
return (-1);
_citrus_region_init(subr, _citrus_region_offset(r, ofs), sz);
return (0);
}
#endif
diff --git a/lib/libc/iconv/citrus_stdenc.c b/lib/libc/iconv/citrus_stdenc.c
index 2bc79a11d333..afb472507c14 100644
--- a/lib/libc/iconv/citrus_stdenc.c
+++ b/lib/libc/iconv/citrus_stdenc.c
@@ -1,149 +1,148 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_stdenc.c,v 1.4 2011/11/19 18:39:58 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_none.h"
#include "citrus_stdenc.h"
struct _citrus_stdenc _citrus_stdenc_default = {
&_citrus_NONE_stdenc_ops, /* ce_ops */
NULL, /* ce_closure */
NULL, /* ce_module */
&_citrus_NONE_stdenc_traits, /* ce_traits */
};
int
_citrus_stdenc_open(struct _citrus_stdenc * __restrict * __restrict rce,
char const * __restrict encname, const void * __restrict variable,
size_t lenvar)
{
struct _citrus_stdenc *ce;
_citrus_module_t handle;
_citrus_stdenc_getops_t getops;
int ret;
if (!strcmp(encname, _CITRUS_DEFAULT_STDENC_NAME)) {
*rce = &_citrus_stdenc_default;
return (0);
}
ce = malloc(sizeof(*ce));
if (ce == NULL) {
ret = errno;
goto bad;
}
ce->ce_ops = NULL;
ce->ce_closure = NULL;
ce->ce_module = NULL;
ce->ce_traits = NULL;
ret = _citrus_load_module(&handle, encname);
if (ret)
goto bad;
ce->ce_module = handle;
getops = (_citrus_stdenc_getops_t)_citrus_find_getops(ce->ce_module,
encname, "stdenc");
if (getops == NULL) {
ret = EINVAL;
goto bad;
}
ce->ce_ops = (struct _citrus_stdenc_ops *)malloc(sizeof(*ce->ce_ops));
if (ce->ce_ops == NULL) {
ret = errno;
goto bad;
}
ret = (*getops)(ce->ce_ops, sizeof(*ce->ce_ops));
if (ret)
goto bad;
/* validation check */
if (ce->ce_ops->eo_init == NULL ||
ce->ce_ops->eo_uninit == NULL ||
ce->ce_ops->eo_init_state == NULL ||
ce->ce_ops->eo_mbtocs == NULL ||
ce->ce_ops->eo_cstomb == NULL ||
ce->ce_ops->eo_mbtowc == NULL ||
ce->ce_ops->eo_wctomb == NULL ||
ce->ce_ops->eo_get_state_desc == NULL) {
ret = EINVAL;
goto bad;
}
/* allocate traits */
ce->ce_traits = malloc(sizeof(*ce->ce_traits));
if (ce->ce_traits == NULL) {
ret = errno;
goto bad;
}
/* init and get closure */
ret = (*ce->ce_ops->eo_init)(ce, variable, lenvar, ce->ce_traits);
if (ret)
goto bad;
*rce = ce;
return (0);
bad:
_citrus_stdenc_close(ce);
return (ret);
}
void
_citrus_stdenc_close(struct _citrus_stdenc *ce)
{
if (ce == &_citrus_stdenc_default)
return;
if (ce->ce_module) {
if (ce->ce_ops) {
if (ce->ce_closure && ce->ce_ops->eo_uninit)
(*ce->ce_ops->eo_uninit)(ce);
free(ce->ce_ops);
}
free(ce->ce_traits);
_citrus_unload_module(ce->ce_module);
}
free(ce);
}
diff --git a/lib/libc/iconv/citrus_stdenc.h b/lib/libc/iconv/citrus_stdenc.h
index a643b77a27aa..7367a917ea1c 100644
--- a/lib/libc/iconv/citrus_stdenc.h
+++ b/lib/libc/iconv/citrus_stdenc.h
@@ -1,126 +1,125 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_stdenc.h,v 1.4 2005/10/29 18:02:04 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_STDENC_H_
#define _CITRUS_STDENC_H_
struct _citrus_stdenc;
struct _citrus_stdenc_ops;
struct _citrus_stdenc_traits;
#define _CITRUS_STDENC_SDID_GENERIC 0
struct _citrus_stdenc_state_desc
{
union {
struct {
int state;
#define _CITRUS_STDENC_SDGEN_UNKNOWN 0
#define _CITRUS_STDENC_SDGEN_INITIAL 1
#define _CITRUS_STDENC_SDGEN_STABLE 2
#define _CITRUS_STDENC_SDGEN_INCOMPLETE_CHAR 3
#define _CITRUS_STDENC_SDGEN_INCOMPLETE_SHIFT 4
} generic;
} u;
};
#include "citrus_stdenc_local.h"
__BEGIN_DECLS
int _citrus_stdenc_open(struct _citrus_stdenc * __restrict * __restrict,
char const * __restrict, const void * __restrict, size_t);
void _citrus_stdenc_close(struct _citrus_stdenc *);
__END_DECLS
static __inline int
_citrus_stdenc_init_state(struct _citrus_stdenc * __restrict ce,
void * __restrict ps)
{
return ((*ce->ce_ops->eo_init_state)(ce, ps));
}
static __inline int
_citrus_stdenc_mbtocs(struct _citrus_stdenc * __restrict ce,
_citrus_csid_t * __restrict csid, _citrus_index_t * __restrict idx,
char ** __restrict s, size_t n, void * __restrict ps,
size_t * __restrict nresult, struct iconv_hooks *hooks)
{
return ((*ce->ce_ops->eo_mbtocs)(ce, csid, idx, s, n, ps, nresult,
hooks));
}
static __inline int
_citrus_stdenc_cstomb(struct _citrus_stdenc * __restrict ce,
char * __restrict s, size_t n, _citrus_csid_t csid, _citrus_index_t idx,
void * __restrict ps, size_t * __restrict nresult,
struct iconv_hooks *hooks)
{
return ((*ce->ce_ops->eo_cstomb)(ce, s, n, csid, idx, ps, nresult,
hooks));
}
static __inline int
_citrus_stdenc_wctomb(struct _citrus_stdenc * __restrict ce,
char * __restrict s, size_t n, _citrus_wc_t wc, void * __restrict ps,
size_t * __restrict nresult, struct iconv_hooks *hooks)
{
return ((*ce->ce_ops->eo_wctomb)(ce, s, n, wc, ps, nresult, hooks));
}
static __inline int
_citrus_stdenc_put_state_reset(struct _citrus_stdenc * __restrict ce,
char * __restrict s, size_t n, void * __restrict ps,
size_t * __restrict nresult)
{
return ((*ce->ce_ops->eo_put_state_reset)(ce, s, n, ps, nresult));
}
static __inline size_t
_citrus_stdenc_get_state_size(struct _citrus_stdenc *ce)
{
return (ce->ce_traits->et_state_size);
}
static __inline int
_citrus_stdenc_get_state_desc(struct _citrus_stdenc * __restrict ce,
void * __restrict ps, int id,
struct _citrus_stdenc_state_desc * __restrict d)
{
return ((*ce->ce_ops->eo_get_state_desc)(ce, ps, id, d));
}
#endif
diff --git a/lib/libc/iconv/citrus_stdenc_local.h b/lib/libc/iconv/citrus_stdenc_local.h
index 2af3b8a992b7..057120e5dcab 100644
--- a/lib/libc/iconv/citrus_stdenc_local.h
+++ b/lib/libc/iconv/citrus_stdenc_local.h
@@ -1,164 +1,163 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_stdenc_local.h,v 1.4 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#ifndef _CITRUS_STDENC_LOCAL_H_
#define _CITRUS_STDENC_LOCAL_H_
#include <iconv.h>
#include "citrus_module.h"
#define _CITRUS_STDENC_GETOPS_FUNC_BASE(n) \
int n(struct _citrus_stdenc_ops *, size_t)
#define _CITRUS_STDENC_GETOPS_FUNC(_e_) \
_CITRUS_STDENC_GETOPS_FUNC_BASE(_citrus_##_e_##_stdenc_getops)
typedef _CITRUS_STDENC_GETOPS_FUNC_BASE((*_citrus_stdenc_getops_t));
#define _CITRUS_STDENC_DECLS(_e_) \
static int _citrus_##_e_##_stdenc_init \
(struct _citrus_stdenc * __restrict, \
const void * __restrict, size_t, \
struct _citrus_stdenc_traits * __restrict); \
static void _citrus_##_e_##_stdenc_uninit(struct _citrus_stdenc *);\
static int _citrus_##_e_##_stdenc_init_state \
(struct _citrus_stdenc * __restrict, \
void * __restrict); \
static int _citrus_##_e_##_stdenc_mbtocs \
(struct _citrus_stdenc * __restrict, \
_citrus_csid_t * __restrict, \
_citrus_index_t * __restrict, \
char ** __restrict, size_t, \
void * __restrict, size_t * __restrict, \
struct iconv_hooks *); \
static int _citrus_##_e_##_stdenc_cstomb \
(struct _citrus_stdenc * __restrict, \
char * __restrict, size_t, _citrus_csid_t, \
_citrus_index_t, void * __restrict, \
size_t * __restrict, struct iconv_hooks *); \
static int _citrus_##_e_##_stdenc_mbtowc \
(struct _citrus_stdenc * __restrict, \
_citrus_wc_t * __restrict, \
char ** __restrict, size_t, \
void * __restrict, size_t * __restrict, \
struct iconv_hooks *); \
static int _citrus_##_e_##_stdenc_wctomb \
(struct _citrus_stdenc * __restrict, \
char * __restrict, size_t, _citrus_wc_t, \
void * __restrict, size_t * __restrict, \
struct iconv_hooks *); \
static int _citrus_##_e_##_stdenc_put_state_reset \
(struct _citrus_stdenc * __restrict, \
char * __restrict, size_t, void * __restrict, \
size_t * __restrict); \
static int _citrus_##_e_##_stdenc_get_state_desc \
(struct _citrus_stdenc * __restrict, \
void * __restrict, int, \
struct _citrus_stdenc_state_desc * __restrict)
#define _CITRUS_STDENC_DEF_OPS(_e_) \
extern struct _citrus_stdenc_ops _citrus_##_e_##_stdenc_ops; \
struct _citrus_stdenc_ops _citrus_##_e_##_stdenc_ops = { \
/* eo_init */ &_citrus_##_e_##_stdenc_init, \
/* eo_uninit */ &_citrus_##_e_##_stdenc_uninit, \
/* eo_init_state */ &_citrus_##_e_##_stdenc_init_state, \
/* eo_mbtocs */ &_citrus_##_e_##_stdenc_mbtocs, \
/* eo_cstomb */ &_citrus_##_e_##_stdenc_cstomb, \
/* eo_mbtowc */ &_citrus_##_e_##_stdenc_mbtowc, \
/* eo_wctomb */ &_citrus_##_e_##_stdenc_wctomb, \
/* eo_put_state_reset */&_citrus_##_e_##_stdenc_put_state_reset,\
/* eo_get_state_desc */ &_citrus_##_e_##_stdenc_get_state_desc \
}
typedef int (*_citrus_stdenc_init_t)
(struct _citrus_stdenc * __reatrict, const void * __restrict , size_t,
struct _citrus_stdenc_traits * __restrict);
typedef void (*_citrus_stdenc_uninit_t)(struct _citrus_stdenc * __restrict);
typedef int (*_citrus_stdenc_init_state_t)
(struct _citrus_stdenc * __restrict, void * __restrict);
typedef int (*_citrus_stdenc_mbtocs_t)
(struct _citrus_stdenc * __restrict,
_citrus_csid_t * __restrict, _citrus_index_t * __restrict,
char ** __restrict, size_t,
void * __restrict, size_t * __restrict,
struct iconv_hooks *);
typedef int (*_citrus_stdenc_cstomb_t)
(struct _citrus_stdenc *__restrict, char * __restrict, size_t,
_citrus_csid_t, _citrus_index_t, void * __restrict,
size_t * __restrict, struct iconv_hooks *);
typedef int (*_citrus_stdenc_mbtowc_t)
(struct _citrus_stdenc * __restrict,
_citrus_wc_t * __restrict,
char ** __restrict, size_t,
void * __restrict, size_t * __restrict,
struct iconv_hooks *);
typedef int (*_citrus_stdenc_wctomb_t)
(struct _citrus_stdenc *__restrict, char * __restrict, size_t,
_citrus_wc_t, void * __restrict, size_t * __restrict,
struct iconv_hooks *);
typedef int (*_citrus_stdenc_put_state_reset_t)
(struct _citrus_stdenc *__restrict, char * __restrict, size_t,
void * __restrict, size_t * __restrict);
typedef int (*_citrus_stdenc_get_state_desc_t)
(struct _citrus_stdenc * __restrict, void * __restrict, int,
struct _citrus_stdenc_state_desc * __restrict);
struct _citrus_stdenc_ops {
_citrus_stdenc_init_t eo_init;
_citrus_stdenc_uninit_t eo_uninit;
_citrus_stdenc_init_state_t eo_init_state;
_citrus_stdenc_mbtocs_t eo_mbtocs;
_citrus_stdenc_cstomb_t eo_cstomb;
_citrus_stdenc_mbtowc_t eo_mbtowc;
_citrus_stdenc_wctomb_t eo_wctomb;
_citrus_stdenc_put_state_reset_t eo_put_state_reset;
/* version 0x00000002 */
_citrus_stdenc_get_state_desc_t eo_get_state_desc;
};
struct _citrus_stdenc_traits {
/* version 0x00000001 */
size_t et_state_size;
size_t et_mb_cur_max;
};
struct _citrus_stdenc {
/* version 0x00000001 */
struct _citrus_stdenc_ops *ce_ops;
void *ce_closure;
_citrus_module_t ce_module;
struct _citrus_stdenc_traits *ce_traits;
};
#define _CITRUS_DEFAULT_STDENC_NAME "NONE"
#endif
diff --git a/lib/libc/iconv/citrus_stdenc_template.h b/lib/libc/iconv/citrus_stdenc_template.h
index 06fca844392f..eec40c8eaf4f 100644
--- a/lib/libc/iconv/citrus_stdenc_template.h
+++ b/lib/libc/iconv/citrus_stdenc_template.h
@@ -1,213 +1,212 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_stdenc_template.h,v 1.4 2008/02/09 14:56:20 junyoung Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <iconv.h>
/*
* CAUTION: THIS IS NOT STANDALONE FILE
*
* function templates of iconv standard encoding handler for each encodings.
*
*/
/*
* macros
*/
#undef _TO_EI
#undef _CE_TO_EI
#undef _TO_STATE
#define _TO_EI(_cl_) ((_ENCODING_INFO*)(_cl_))
#define _CE_TO_EI(_ce_) (_TO_EI((_ce_)->ce_closure))
#define _TO_STATE(_ps_) ((_ENCODING_STATE*)(_ps_))
/* ----------------------------------------------------------------------
* templates for public functions
*/
int
_FUNCNAME(stdenc_getops)(struct _citrus_stdenc_ops *ops,
size_t lenops __unused)
{
memcpy(ops, &_FUNCNAME(stdenc_ops), sizeof(_FUNCNAME(stdenc_ops)));
return (0);
}
static int
_FUNCNAME(stdenc_init)(struct _citrus_stdenc * __restrict ce,
const void * __restrict var, size_t lenvar,
struct _citrus_stdenc_traits * __restrict et)
{
_ENCODING_INFO *ei;
int ret;
ei = NULL;
if (sizeof(_ENCODING_INFO) > 0) {
ei = calloc(1, sizeof(_ENCODING_INFO));
if (ei == NULL)
return (errno);
}
ret = _FUNCNAME(encoding_module_init)(ei, var, lenvar);
if (ret) {
free((void *)ei);
return (ret);
}
ce->ce_closure = ei;
et->et_state_size = sizeof(_ENCODING_STATE);
et->et_mb_cur_max = _ENCODING_MB_CUR_MAX(_CE_TO_EI(ce));
return (0);
}
static void
_FUNCNAME(stdenc_uninit)(struct _citrus_stdenc * __restrict ce)
{
if (ce) {
_FUNCNAME(encoding_module_uninit)(_CE_TO_EI(ce));
free(ce->ce_closure);
}
}
static int
_FUNCNAME(stdenc_init_state)(struct _citrus_stdenc * __restrict ce,
void * __restrict ps)
{
_FUNCNAME(init_state)(_CE_TO_EI(ce), _TO_STATE(ps));
return (0);
}
static int
_FUNCNAME(stdenc_mbtocs)(struct _citrus_stdenc * __restrict ce,
_citrus_csid_t * __restrict csid, _citrus_index_t * __restrict idx,
char ** __restrict s, size_t n, void * __restrict ps,
size_t * __restrict nresult, struct iconv_hooks *hooks)
{
wchar_t wc;
int ret;
ret = _FUNCNAME(mbrtowc_priv)(_CE_TO_EI(ce), &wc, s, n,
_TO_STATE(ps), nresult);
if ((ret == 0) && *nresult != (size_t)-2)
ret = _FUNCNAME(stdenc_wctocs)(_CE_TO_EI(ce), csid, idx, wc);
if ((ret == 0) && (hooks != NULL) && (hooks->uc_hook != NULL))
hooks->uc_hook((unsigned int)*idx, hooks->data);
return (ret);
}
static int
_FUNCNAME(stdenc_cstomb)(struct _citrus_stdenc * __restrict ce,
char * __restrict s, size_t n, _citrus_csid_t csid, _citrus_index_t idx,
void * __restrict ps, size_t * __restrict nresult,
struct iconv_hooks *hooks __unused)
{
wchar_t wc;
int ret;
wc = ret = 0;
if (csid != _CITRUS_CSID_INVALID)
ret = _FUNCNAME(stdenc_cstowc)(_CE_TO_EI(ce), &wc, csid, idx);
if (ret == 0)
ret = _FUNCNAME(wcrtomb_priv)(_CE_TO_EI(ce), s, n, wc,
_TO_STATE(ps), nresult);
return (ret);
}
static int
_FUNCNAME(stdenc_mbtowc)(struct _citrus_stdenc * __restrict ce,
_citrus_wc_t * __restrict wc, char ** __restrict s, size_t n,
void * __restrict ps, size_t * __restrict nresult,
struct iconv_hooks *hooks)
{
int ret;
ret = _FUNCNAME(mbrtowc_priv)(_CE_TO_EI(ce), wc, s, n,
_TO_STATE(ps), nresult);
if ((ret == 0) && (hooks != NULL) && (hooks->wc_hook != NULL))
hooks->wc_hook(*wc, hooks->data);
return (ret);
}
static int
_FUNCNAME(stdenc_wctomb)(struct _citrus_stdenc * __restrict ce,
char * __restrict s, size_t n, _citrus_wc_t wc, void * __restrict ps,
size_t * __restrict nresult, struct iconv_hooks *hooks __unused)
{
int ret;
ret = _FUNCNAME(wcrtomb_priv)(_CE_TO_EI(ce), s, n, wc, _TO_STATE(ps),
nresult);
return (ret);
}
static int
_FUNCNAME(stdenc_put_state_reset)(struct _citrus_stdenc * __restrict ce __unused,
char * __restrict s __unused, size_t n __unused,
void * __restrict ps __unused, size_t * __restrict nresult)
{
#if _ENCODING_IS_STATE_DEPENDENT
return ((_FUNCNAME(put_state_reset)(_CE_TO_EI(ce), s, n, _TO_STATE(ps),
nresult)));
#else
*nresult = 0;
return (0);
#endif
}
static int
_FUNCNAME(stdenc_get_state_desc)(struct _citrus_stdenc * __restrict ce,
void * __restrict ps, int id,
struct _citrus_stdenc_state_desc * __restrict d)
{
int ret;
switch (id) {
case _STDENC_SDID_GENERIC:
ret = _FUNCNAME(stdenc_get_state_desc_generic)(
_CE_TO_EI(ce), _TO_STATE(ps), &d->u.generic.state);
break;
default:
ret = EOPNOTSUPP;
}
return (ret);
}
diff --git a/lib/libc/iconv/citrus_types.h b/lib/libc/iconv/citrus_types.h
index 2e4be11dd4cd..55ef4929ec6f 100644
--- a/lib/libc/iconv/citrus_types.h
+++ b/lib/libc/iconv/citrus_types.h
@@ -1,42 +1,41 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_types.h,v 1.3 2003/10/27 00:12:42 lukem Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/types.h>
#ifndef _CITRUS_TYPES_H_
#define _CITRUS_TYPES_H_
typedef uint32_t _citrus_wc_t;
typedef uint32_t _citrus_index_t;
typedef uint32_t _citrus_csid_t;
#define _CITRUS_CSID_INVALID ((_citrus_csid_t)-1)
#endif
diff --git a/lib/libc/include/isc/list.h b/lib/libc/include/isc/list.h
index cdc98a8474be..66c67a72a22b 100644
--- a/lib/libc/include/isc/list.h
+++ b/lib/libc/include/isc/list.h
@@ -1,127 +1,126 @@
/*-
* SPDX-License-Identifier: ISC
*
* Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
* Copyright (c) 1997,1999 by Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
-/* $FreeBSD$ */
#ifndef LIST_H
#define LIST_H 1
#ifdef _LIBC
#include <assert.h>
#define INSIST(cond) assert(cond)
#else
#include <isc/assertions.h>
#endif
#define LIST(type) struct { type *head, *tail; }
#define INIT_LIST(list) \
do { (list).head = NULL; (list).tail = NULL; } while (0)
#define LINK(type) struct { type *prev, *next; }
#define INIT_LINK_TYPE(elt, link, type) \
do { \
(elt)->link.prev = (type *)(-1); \
(elt)->link.next = (type *)(-1); \
} while (0)
#define INIT_LINK(elt, link) \
INIT_LINK_TYPE(elt, link, void)
#define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
(void *)((elt)->link.next) != (void *)(-1))
#define HEAD(list) ((list).head)
#define TAIL(list) ((list).tail)
#define EMPTY(list) ((list).head == NULL)
#define PREPEND(list, elt, link) \
do { \
INSIST(!LINKED(elt, link));\
if ((list).head != NULL) \
(list).head->link.prev = (elt); \
else \
(list).tail = (elt); \
(elt)->link.prev = NULL; \
(elt)->link.next = (list).head; \
(list).head = (elt); \
} while (0)
#define APPEND(list, elt, link) \
do { \
INSIST(!LINKED(elt, link));\
if ((list).tail != NULL) \
(list).tail->link.next = (elt); \
else \
(list).head = (elt); \
(elt)->link.prev = (list).tail; \
(elt)->link.next = NULL; \
(list).tail = (elt); \
} while (0)
#define UNLINK_TYPE(list, elt, link, type) \
do { \
INSIST(LINKED(elt, link));\
if ((elt)->link.next != NULL) \
(elt)->link.next->link.prev = (elt)->link.prev; \
else { \
INSIST((list).tail == (elt)); \
(list).tail = (elt)->link.prev; \
} \
if ((elt)->link.prev != NULL) \
(elt)->link.prev->link.next = (elt)->link.next; \
else { \
INSIST((list).head == (elt)); \
(list).head = (elt)->link.next; \
} \
INIT_LINK_TYPE(elt, link, type); \
} while (0)
#define UNLINK(list, elt, link) \
UNLINK_TYPE(list, elt, link, void)
#define PREV(elt, link) ((elt)->link.prev)
#define NEXT(elt, link) ((elt)->link.next)
#define INSERT_BEFORE(list, before, elt, link) \
do { \
INSIST(!LINKED(elt, link));\
if ((before)->link.prev == NULL) \
PREPEND(list, elt, link); \
else { \
(elt)->link.prev = (before)->link.prev; \
(before)->link.prev = (elt); \
(elt)->link.prev->link.next = (elt); \
(elt)->link.next = (before); \
} \
} while (0)
#define INSERT_AFTER(list, after, elt, link) \
do { \
INSIST(!LINKED(elt, link));\
if ((after)->link.next == NULL) \
APPEND(list, elt, link); \
else { \
(elt)->link.next = (after)->link.next; \
(after)->link.next = (elt); \
(elt)->link.next->link.prev = (elt); \
(elt)->link.prev = (after); \
} \
} while (0)
#define ENQUEUE(list, elt, link) APPEND(list, elt, link)
#define DEQUEUE(list, elt, link) UNLINK(list, elt, link)
#endif /* LIST_H */
/*! \file */
diff --git a/lib/libc/include/isc/platform.h b/lib/libc/include/isc/platform.h
index b514cb4243a3..06997eea3c8e 100644
--- a/lib/libc/include/isc/platform.h
+++ b/lib/libc/include/isc/platform.h
@@ -1,39 +1,38 @@
/*-
* SPDX-License-Identifier: ISC
*
* Copyright (C) 2008 Internet Systems Consortium, Inc. ("ISC")
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
* REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
* INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
* LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
* OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: platform.h.in,v 1.2.6.2 2008/01/23 02:15:02 tbox Exp $ */
-/* $FreeBSD$ */
/*! \file */
#ifndef ISC_PLATFORM_H
#define ISC_PLATFORM_H
/*
* Define if the OS does not define struct timespec.
*/
#undef ISC_PLATFORM_NEEDTIMESPEC
#ifdef ISC_PLATFORM_NEEDTIMESPEC
#include <time.h> /* For time_t */
struct timespec {
time_t tv_sec; /* seconds */
long tv_nsec; /* nanoseconds */
};
#endif
#endif
diff --git a/lib/libc/include/port_after.h b/lib/libc/include/port_after.h
index 94f3a6431e98..1bbece4f350b 100644
--- a/lib/libc/include/port_after.h
+++ b/lib/libc/include/port_after.h
@@ -1,11 +1,10 @@
-/* $FreeBSD$ */
#ifndef _PORT_AFTER_H_
#define _PORT_AFTER_H_
#define HAVE_SA_LEN 1
#define HAS_INET6_STRUCTS 1
#define HAVE_SIN6_SCOPE_ID 1
#define HAVE_TIME_R 1
#endif /* _PORT_AFTER_H_ */
diff --git a/lib/libc/include/port_before.h b/lib/libc/include/port_before.h
index 430d23363c87..cfc43c53f157 100644
--- a/lib/libc/include/port_before.h
+++ b/lib/libc/include/port_before.h
@@ -1,23 +1,22 @@
-/* $FreeBSD$ */
#ifndef _PORT_BEFORE_H_
#define _PORT_BEFORE_H_
#define _LIBC 1
#define DO_PTHREADS 1
#define USE_POLL 1
#define HAVE_MD5 1
#define ISC_SOCKLEN_T socklen_t
#define ISC_FORMAT_PRINTF(fmt, args) \
__attribute__((__format__(__printf__, fmt, args)))
#define DE_CONST(konst, var) \
do { \
union { const void *k; void *v; } _u; \
_u.k = konst; \
var = _u.v; \
} while (0)
#define UNUSED(x) (void)(x)
#endif /* _PORT_BEFORE_H_ */
diff --git a/lib/libc/libc.ldscript b/lib/libc/libc.ldscript
index 02e4d962a318..0e89e1868f9a 100644
--- a/lib/libc/libc.ldscript
+++ b/lib/libc/libc.ldscript
@@ -1,2 +1 @@
-/* $FreeBSD$ */
GROUP ( @@SHLIB@@ @@LIBDIR@@/libc_nonshared.a @@LIBDIR@@/libssp_nonshared.a )
diff --git a/lib/libc/libc_nossp.ldscript b/lib/libc/libc_nossp.ldscript
index c610cc21e018..be6325610595 100644
--- a/lib/libc/libc_nossp.ldscript
+++ b/lib/libc/libc_nossp.ldscript
@@ -1,2 +1 @@
-/* $FreeBSD$ */
GROUP ( @@SHLIB@@ @@LIBDIR@@/libc_nonshared.a )
diff --git a/lib/libc/locale/c16rtomb_iconv.c b/lib/libc/locale/c16rtomb_iconv.c
index 86bd9dab2a52..df671bd6e320 100644
--- a/lib/libc/locale/c16rtomb_iconv.c
+++ b/lib/libc/locale/c16rtomb_iconv.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define charXX_t char16_t
#define cXXrtomb c16rtomb
#define cXXrtomb_l c16rtomb_l
#define SRCBUF_LEN 2
#define UTF_XX_INTERNAL "UTF-16-INTERNAL"
#include "cXXrtomb_iconv.h"
diff --git a/lib/libc/locale/c32rtomb_iconv.c b/lib/libc/locale/c32rtomb_iconv.c
index dabbfd7f7ab4..5d89baac3f69 100644
--- a/lib/libc/locale/c32rtomb_iconv.c
+++ b/lib/libc/locale/c32rtomb_iconv.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define charXX_t char32_t
#define cXXrtomb c32rtomb
#define cXXrtomb_l c32rtomb_l
#define SRCBUF_LEN 1
#define UTF_XX_INTERNAL "UTF-32-INTERNAL"
#include "cXXrtomb_iconv.h"
diff --git a/lib/libc/locale/mbrtoc16_iconv.c b/lib/libc/locale/mbrtoc16_iconv.c
index f1eaf1925496..f4e37a0489eb 100644
--- a/lib/libc/locale/mbrtoc16_iconv.c
+++ b/lib/libc/locale/mbrtoc16_iconv.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define charXX_t char16_t
#define mbrtocXX mbrtoc16
#define mbrtocXX_l mbrtoc16_l
#define DSTBUF_LEN 2
#define UTF_XX_INTERNAL "UTF-16-INTERNAL"
#include "mbrtocXX_iconv.h"
diff --git a/lib/libc/locale/mbrtoc32_iconv.c b/lib/libc/locale/mbrtoc32_iconv.c
index ec2c0145d9d6..503d7b378538 100644
--- a/lib/libc/locale/mbrtoc32_iconv.c
+++ b/lib/libc/locale/mbrtoc32_iconv.c
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define charXX_t char32_t
#define mbrtocXX mbrtoc32
#define mbrtocXX_l mbrtoc32_l
#define DSTBUF_LEN 1
#define UTF_XX_INTERNAL "UTF-32-INTERNAL"
#include "mbrtocXX_iconv.h"
diff --git a/lib/libc/mips/SYS.h b/lib/libc/mips/SYS.h
index c4767a5cd96b..2fbbfe0737e4 100644
--- a/lib/libc/mips/SYS.h
+++ b/lib/libc/mips/SYS.h
@@ -1,153 +1,152 @@
/* $NetBSD: SYS.h,v 1.19 2009/12/14 01:07:41 matt Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: (BSD-4-Clause AND BSD-3-Clause)
*
* Copyright (c) 1996 Jonathan Stone
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Jonathan Stone for
* the NetBSD Project.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Ralph Campbell.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* from: @(#)SYS.h 8.1 (Berkeley) 6/4/93
*/
#include <sys/syscall.h>
#include <machine/asm.h>
/*
* If compiling for shared libs, Emit sysV ABI PIC segment pseudo-ops.
*
* i) Emit .abicalls before .LEAF entrypoint, and .cpload/.cprestore after.
* ii) Do interprocedure jumps indirectly via t9, with the side-effect of
* preserving the callee's entry address in t9.
*/
#ifdef __ABICALLS__
.abicalls
# if defined(__mips_o32) || defined(__mips_o64)
# define PIC_PROLOGUE(x) SETUP_GP
# define PIC_TAILCALL(l) PTR_LA t9, _C_LABEL(l); jr t9
# define PIC_RETURN() j ra
# else
# define PIC_PROLOGUE(x) SETUP_GP64(t3, x)
# define PIC_TAILCALL(l) PTR_LA t9, _C_LABEL(l); RESTORE_GP64; jr t9
# define PIC_RETURN() RESTORE_GP64; j ra
# endif
#else
# define PIC_PROLOGUE(x)
# define PIC_TAILCALL(l) j _C_LABEL(l)
# define PIC_RETURN() j ra
#endif /* __ABICALLS__ */
# define SYSTRAP(x) li v0,SYS_ ## x; syscall;
/*
* Do a syscall that cannot fail (sync, get{p,u,g,eu,eg)id)
*/
#define RSYSCALL_NOERROR(x) \
LEAF(__sys_ ## x); \
.weak _C_LABEL(x); \
_C_LABEL(x) = _C_LABEL(__CONCAT(__sys_,x)); \
.weak _C_LABEL(__CONCAT(_,x)); \
_C_LABEL(__CONCAT(_,x)) = _C_LABEL(__CONCAT(__sys_,x)); \
SYSTRAP(x); \
j ra; \
END(__sys_ ## x)
/*
* Do a normal syscall.
*/
#define RSYSCALL(x) \
LEAF(__sys_ ## x); \
.weak _C_LABEL(x); \
_C_LABEL(x) = _C_LABEL(__CONCAT(__sys_,x)); \
.weak _C_LABEL(__CONCAT(_,x)); \
_C_LABEL(__CONCAT(_,x)) = _C_LABEL(__CONCAT(__sys_,x)); \
PIC_PROLOGUE(__sys_ ## x); \
SYSTRAP(x); \
bne a3,zero,err; \
PIC_RETURN(); \
err: \
PIC_TAILCALL(__cerror); \
END(__sys_ ## x)
/*
* Do a renamed or pseudo syscall (e.g., _exit()), where the entrypoint
* and syscall name are not the same.
*/
#define PSEUDO_NOERROR(x) \
LEAF(__sys_ ## x); \
.weak _C_LABEL(__CONCAT(_,x)); \
_C_LABEL(__CONCAT(_,x)) = _C_LABEL(__CONCAT(__sys_,x)); \
SYSTRAP(x); \
j ra; \
END(__sys_ ## x)
#define PSEUDO(x) \
LEAF(__sys_ ## x); \
.weak _C_LABEL(__CONCAT(_,x)); \
_C_LABEL(__CONCAT(_,x)) = _C_LABEL(__CONCAT(__sys_,x)); \
PIC_PROLOGUE(__sys_ ## x); \
SYSTRAP(x); \
bne a3,zero,err; \
PIC_RETURN(); \
err: \
PIC_TAILCALL(__cerror); \
END(__sys_ ## x)
diff --git a/lib/libc/mips/softfloat/milieu.h b/lib/libc/mips/softfloat/milieu.h
index e04b26692113..0bf7e42d5f70 100644
--- a/lib/libc/mips/softfloat/milieu.h
+++ b/lib/libc/mips/softfloat/milieu.h
@@ -1,48 +1,47 @@
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "mips-gcc.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/mips/softfloat/mips-gcc.h b/lib/libc/mips/softfloat/mips-gcc.h
index c8ec07c839c8..1a588921b3e6 100644
--- a/lib/libc/mips/softfloat/mips-gcc.h
+++ b/lib/libc/mips/softfloat/mips-gcc.h
@@ -1,91 +1,90 @@
/* $NetBSD: arm-gcc.h,v 1.2 2001/02/21 18:09:25 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
-------------------------------------------------------------------------------
One of the macros `BIGENDIAN' or `LITTLEENDIAN' must be defined.
-------------------------------------------------------------------------------
*/
#ifdef __MIPSEB__
#define BIGENDIAN
#else
#define LITTLEENDIAN
#endif
/*
-------------------------------------------------------------------------------
The macro `BITS64' can be defined to indicate that 64-bit integer types are
supported by the compiler.
-------------------------------------------------------------------------------
*/
#define BITS64
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines the most convenient type that holds
integers of at least as many bits as specified. For example, `uint8' should
be the most convenient type that can hold unsigned integers of as many as
8 bits. The `flag' type must be able to hold either a 0 or 1. For most
implementations of C, `flag', `uint8', and `int8' should all be `typedef'ed
to the same as `int'.
-------------------------------------------------------------------------------
*/
typedef int flag;
typedef int uint8;
typedef int int8;
typedef int uint16;
typedef int int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifdef BITS64
typedef unsigned long long int uint64;
typedef signed long long int int64;
#endif
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines a type that holds integers
of _exactly_ the number of bits specified. For instance, for most
implementation of C, `bits16' and `sbits16' should be `typedef'ed to
`unsigned short int' and `signed short int' (or `short int'), respectively.
-------------------------------------------------------------------------------
*/
typedef unsigned char bits8;
typedef signed char sbits8;
typedef unsigned short int bits16;
typedef signed short int sbits16;
typedef unsigned int bits32;
typedef signed int sbits32;
#ifdef BITS64
typedef unsigned long long int bits64;
typedef signed long long int sbits64;
#endif
#ifdef BITS64
/*
-------------------------------------------------------------------------------
The `LIT64' macro takes as its argument a textual integer literal and
if necessary ``marks'' the literal as having a 64-bit integer type.
For example, the GNU C Compiler (`gcc') requires that 64-bit literals be
appended with the letters `LL' standing for `long long', which is `gcc's
name for the 64-bit integer type. Some compilers may allow `LIT64' to be
defined as the identity macro: `#define LIT64( a ) a'.
-------------------------------------------------------------------------------
*/
#define LIT64( a ) a##LL
#endif
/*
-------------------------------------------------------------------------------
The macro `INLINE' can be used before functions that should be inlined. If
a compiler does not support explicit inlining, this macro should be defined
to be `static'.
-------------------------------------------------------------------------------
*/
#define INLINE static __inline
#if defined(SOFTFLOAT_FOR_GCC)
/* XXXMIPS: check this one */
#define FLOAT64_DEMANGLE(a) (a)
#define FLOAT64_MANGLE(a) (a)
#endif
diff --git a/lib/libc/mips/softfloat/softfloat.h b/lib/libc/mips/softfloat/softfloat.h
index 6aef49975a38..d202a1f7f420 100644
--- a/lib/libc/mips/softfloat/softfloat.h
+++ b/lib/libc/mips/softfloat/softfloat.h
@@ -1,315 +1,314 @@
/* $NetBSD: softfloat.h,v 1.6 2002/05/12 13:12:46 bjh21 Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
/* #define FLOATX80 */
/* #define FLOAT128 */
#include <fenv.h>
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef unsigned int float32;
typedef unsigned long long float64;
#ifdef FLOATX80
typedef struct {
unsigned short high;
unsigned long long low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
unsigned long long high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
#ifndef SOFTFLOAT_FOR_GCC
extern int float_detect_tininess;
#endif
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern int float_rounding_mode;
enum {
float_round_nearest_even = FE_TONEAREST,
float_round_to_zero = FE_TOWARDZERO,
float_round_down = FE_DOWNWARD,
float_round_up = FE_UPWARD
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
extern int float_exception_flags;
extern int float_exception_mask;
enum {
float_flag_inexact = FE_INEXACT,
float_flag_underflow = FE_UNDERFLOW,
float_flag_overflow = FE_OVERFLOW,
float_flag_divbyzero = FE_DIVBYZERO,
float_flag_invalid = FE_INVALID
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( int );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( int );
float64 int32_to_float64( int );
#ifdef FLOATX80
floatx80 int32_to_floatx80( int );
#endif
#ifdef FLOAT128
float128 int32_to_float128( int );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __floatdi?f is in libgcc2.c */
float32 int64_to_float32( long long );
float64 int64_to_float64( long long );
#ifdef FLOATX80
floatx80 int64_to_floatx80( long long );
#endif
#ifdef FLOAT128
float128 int64_to_float128( long long );
#endif
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float32_to_int32( float32 );
int float32_to_int32_round_to_zero( float32 );
#if defined(SOFTFLOAT_FOR_GCC) && defined(SOFTFLOAT_NEED_FIXUNS)
unsigned int float32_to_uint32_round_to_zero( float32 );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __fix?fdi provided by libgcc2.c */
long long float32_to_int64( float32 );
long long float32_to_int64_round_to_zero( float32 );
#endif
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
int float32_eq( float32, float32 );
int float32_le( float32, float32 );
int float32_lt( float32, float32 );
int float32_eq_signaling( float32, float32 );
int float32_le_quiet( float32, float32 );
int float32_lt_quiet( float32, float32 );
#ifndef SOFTFLOAT_FOR_GCC
int float32_is_signaling_nan( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float64_to_int32( float64 );
int float64_to_int32_round_to_zero( float64 );
#if defined(SOFTFLOAT_FOR_GCC) && defined(SOFTFLOAT_NEED_FIXUNS)
unsigned int float64_to_uint32_round_to_zero( float64 );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __fix?fdi provided by libgcc2.c */
long long float64_to_int64( float64 );
long long float64_to_int64_round_to_zero( float64 );
#endif
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
int float64_eq( float64, float64 );
int float64_le( float64, float64 );
int float64_lt( float64, float64 );
int float64_eq_signaling( float64, float64 );
int float64_le_quiet( float64, float64 );
int float64_lt_quiet( float64, float64 );
#ifndef SOFTFLOAT_FOR_GCC
int float64_is_signaling_nan( float64 );
#endif
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int floatx80_to_int32( floatx80 );
int floatx80_to_int32_round_to_zero( floatx80 );
long long floatx80_to_int64( floatx80 );
long long floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern int floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
int floatx80_eq( floatx80, floatx80 );
int floatx80_le( floatx80, floatx80 );
int floatx80_lt( floatx80, floatx80 );
int floatx80_eq_signaling( floatx80, floatx80 );
int floatx80_le_quiet( floatx80, floatx80 );
int floatx80_lt_quiet( floatx80, floatx80 );
int floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float128_to_int32( float128 );
int float128_to_int32_round_to_zero( float128 );
long long float128_to_int64( float128 );
long long float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
int float128_eq( float128, float128 );
int float128_le( float128, float128 );
int float128_lt( float128, float128 );
int float128_eq_signaling( float128, float128 );
int float128_le_quiet( float128, float128 );
int float128_lt_quiet( float128, float128 );
int float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/net/res_config.h b/lib/libc/net/res_config.h
index 51b609b48eaf..f049d6817b7a 100644
--- a/lib/libc/net/res_config.h
+++ b/lib/libc/net/res_config.h
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
#define DEBUG 1 /* enable debugging code (needed for dig) */
#define RESOLVSORT /* allow sorting of addresses in gethostbyname */
#undef SUNSECURITY /* verify gethostbyaddr() calls - WE DON'T NEED IT */
#define MULTI_PTRS_ARE_ALIASES 1 /* fold multiple PTR records into aliases */
diff --git a/lib/libc/powerpc/softfloat/milieu.h b/lib/libc/powerpc/softfloat/milieu.h
index e2e43b150073..6139aa58b982 100644
--- a/lib/libc/powerpc/softfloat/milieu.h
+++ b/lib/libc/powerpc/softfloat/milieu.h
@@ -1,49 +1,48 @@
/* $NetBSD: milieu.h,v 1.1 2000/12/29 20:13:54 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "powerpc-gcc.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/powerpc/softfloat/powerpc-gcc.h b/lib/libc/powerpc/softfloat/powerpc-gcc.h
index 0fbb8006e22d..4520826cc36d 100644
--- a/lib/libc/powerpc/softfloat/powerpc-gcc.h
+++ b/lib/libc/powerpc/softfloat/powerpc-gcc.h
@@ -1,96 +1,95 @@
/* $NetBSD: arm-gcc.h,v 1.2 2001/02/21 18:09:25 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
-------------------------------------------------------------------------------
One of the macros `BIGENDIAN' or `LITTLEENDIAN' must be defined.
-------------------------------------------------------------------------------
*/
#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
#define LITTLEENDIAN
#else
#define BIGENDIAN
#endif
/*
-------------------------------------------------------------------------------
The macro `BITS64' can be defined to indicate that 64-bit integer types are
supported by the compiler.
-------------------------------------------------------------------------------
*/
#define BITS64
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines the most convenient type that holds
integers of at least as many bits as specified. For example, `uint8' should
be the most convenient type that can hold unsigned integers of as many as
8 bits. The `flag' type must be able to hold either a 0 or 1. For most
implementations of C, `flag', `uint8', and `int8' should all be `typedef'ed
to the same as `int'.
-------------------------------------------------------------------------------
*/
typedef int flag;
typedef unsigned int uint8;
typedef int int8;
typedef unsigned int uint16;
typedef int int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifdef BITS64
typedef unsigned long long int uint64;
typedef signed long long int int64;
#endif
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines a type that holds integers
of _exactly_ the number of bits specified. For instance, for most
implementation of C, `bits16' and `sbits16' should be `typedef'ed to
`unsigned short int' and `signed short int' (or `short int'), respectively.
-------------------------------------------------------------------------------
*/
typedef unsigned char bits8;
typedef signed char sbits8;
typedef unsigned short int bits16;
typedef signed short int sbits16;
typedef unsigned int bits32;
typedef signed int sbits32;
#ifdef BITS64
typedef unsigned long long int bits64;
typedef signed long long int sbits64;
#endif
#ifdef BITS64
/*
-------------------------------------------------------------------------------
The `LIT64' macro takes as its argument a textual integer literal and
if necessary ``marks'' the literal as having a 64-bit integer type.
For example, the GNU C Compiler (`gcc') requires that 64-bit literals be
appended with the letters `LL' standing for `long long', which is `gcc's
name for the 64-bit integer type. Some compilers may allow `LIT64' to be
defined as the identity macro: `#define LIT64( a ) a'.
-------------------------------------------------------------------------------
*/
#define LIT64( a ) a##LL
#endif
/*
-------------------------------------------------------------------------------
The macro `INLINE' can be used before functions that should be inlined. If
a compiler does not support explicit inlining, this macro should be defined
to be `static'.
-------------------------------------------------------------------------------
*/
#define INLINE static __inline
/*
-------------------------------------------------------------------------------
The ARM FPA is odd in that it stores doubles high-order word first, no matter
what the endianness of the CPU. VFP is sane.
-------------------------------------------------------------------------------
*/
#if defined(SOFTFLOAT_FOR_GCC)
#define FLOAT64_DEMANGLE(a) (a)
#define FLOAT64_MANGLE(a) (a)
#endif
diff --git a/lib/libc/powerpc/softfloat/softfloat.h b/lib/libc/powerpc/softfloat/softfloat.h
index 6b9c9b06956d..b20cb3e7aa00 100644
--- a/lib/libc/powerpc/softfloat/softfloat.h
+++ b/lib/libc/powerpc/softfloat/softfloat.h
@@ -1,307 +1,306 @@
/* $NetBSD: softfloat.h,v 1.6 2002/05/12 13:12:46 bjh21 Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
/* #define FLOATX80 */
/* #define FLOAT128 */
#include <machine/ieeefp.h>
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef unsigned int float32;
typedef unsigned long long float64;
#ifdef FLOATX80
typedef struct {
unsigned short high;
unsigned long long low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
unsigned long long high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
#ifndef SOFTFLOAT_FOR_GCC
extern int8 float_detect_tininess;
#endif
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern fp_rnd_t float_rounding_mode;
enum {
float_round_nearest_even = FP_RN,
float_round_to_zero = FP_RZ,
float_round_down = FP_RM,
float_round_up = FP_RP
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
typedef fp_except_t fp_except;
extern fp_except float_exception_flags;
extern fp_except float_exception_mask;
enum {
float_flag_inexact = FP_X_IMP,
float_flag_underflow = FP_X_UFL,
float_flag_overflow = FP_X_OFL,
float_flag_divbyzero = FP_X_DZ,
float_flag_invalid = FP_X_INV
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( fp_except );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( int );
float64 int32_to_float64( int );
#ifdef FLOATX80
floatx80 int32_to_floatx80( int );
#endif
#ifdef FLOAT128
float128 int32_to_float128( int );
#endif
float32 int64_to_float32( long long );
float64 int64_to_float64( long long );
#ifdef FLOATX80
floatx80 int64_to_floatx80( long long );
#endif
#ifdef FLOAT128
float128 int64_to_float128( long long );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float32_to_int32( float32 );
int float32_to_int32_round_to_zero( float32 );
unsigned int float32_to_uint32_round_to_zero( float32 );
long long float32_to_int64( float32 );
long long float32_to_int64_round_to_zero( float32 );
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
int float32_eq( float32, float32 );
int float32_le( float32, float32 );
int float32_lt( float32, float32 );
int float32_eq_signaling( float32, float32 );
int float32_le_quiet( float32, float32 );
int float32_lt_quiet( float32, float32 );
#ifndef SOFTFLOAT_FOR_GCC
int float32_is_signaling_nan( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float64_to_int32( float64 );
int float64_to_int32_round_to_zero( float64 );
unsigned int float64_to_uint32_round_to_zero( float64 );
long long float64_to_int64( float64 );
long long float64_to_int64_round_to_zero( float64 );
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
int float64_eq( float64, float64 );
int float64_le( float64, float64 );
int float64_lt( float64, float64 );
int float64_eq_signaling( float64, float64 );
int float64_le_quiet( float64, float64 );
int float64_lt_quiet( float64, float64 );
#ifndef SOFTFLOAT_FOR_GCC
int float64_is_signaling_nan( float64 );
#endif
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int floatx80_to_int32( floatx80 );
int floatx80_to_int32_round_to_zero( floatx80 );
long long floatx80_to_int64( floatx80 );
long long floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern int floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
int floatx80_eq( floatx80, floatx80 );
int floatx80_le( floatx80, floatx80 );
int floatx80_lt( floatx80, floatx80 );
int floatx80_eq_signaling( floatx80, floatx80 );
int floatx80_le_quiet( floatx80, floatx80 );
int floatx80_lt_quiet( floatx80, floatx80 );
int floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float128_to_int32( float128 );
int float128_to_int32_round_to_zero( float128 );
long long float128_to_int64( float128 );
long long float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
int float128_eq( float128, float128 );
int float128_le( float128, float128 );
int float128_lt( float128, float128 );
int float128_eq_signaling( float128, float128 );
int float128_le_quiet( float128, float128 );
int float128_lt_quiet( float128, float128 );
int float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/powerpc64/softfloat/milieu.h b/lib/libc/powerpc64/softfloat/milieu.h
index e2e43b150073..6139aa58b982 100644
--- a/lib/libc/powerpc64/softfloat/milieu.h
+++ b/lib/libc/powerpc64/softfloat/milieu.h
@@ -1,49 +1,48 @@
/* $NetBSD: milieu.h,v 1.1 2000/12/29 20:13:54 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "powerpc-gcc.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/powerpc64/softfloat/powerpc-gcc.h b/lib/libc/powerpc64/softfloat/powerpc-gcc.h
index e2f8680dd74e..d11198866e39 100644
--- a/lib/libc/powerpc64/softfloat/powerpc-gcc.h
+++ b/lib/libc/powerpc64/softfloat/powerpc-gcc.h
@@ -1,92 +1,91 @@
/* $NetBSD: arm-gcc.h,v 1.2 2001/02/21 18:09:25 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
-------------------------------------------------------------------------------
One of the macros `BIGENDIAN' or `LITTLEENDIAN' must be defined.
-------------------------------------------------------------------------------
*/
#define BIGENDIAN
/*
-------------------------------------------------------------------------------
The macro `BITS64' can be defined to indicate that 64-bit integer types are
supported by the compiler.
-------------------------------------------------------------------------------
*/
#define BITS64
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines the most convenient type that holds
integers of at least as many bits as specified. For example, `uint8' should
be the most convenient type that can hold unsigned integers of as many as
8 bits. The `flag' type must be able to hold either a 0 or 1. For most
implementations of C, `flag', `uint8', and `int8' should all be `typedef'ed
to the same as `int'.
-------------------------------------------------------------------------------
*/
typedef int flag;
typedef unsigned int uint8;
typedef int int8;
typedef unsigned int uint16;
typedef int int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifdef BITS64
typedef unsigned long long int uint64;
typedef signed long long int int64;
#endif
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines a type that holds integers
of _exactly_ the number of bits specified. For instance, for most
implementation of C, `bits16' and `sbits16' should be `typedef'ed to
`unsigned short int' and `signed short int' (or `short int'), respectively.
-------------------------------------------------------------------------------
*/
typedef unsigned char bits8;
typedef signed char sbits8;
typedef unsigned short int bits16;
typedef signed short int sbits16;
typedef unsigned int bits32;
typedef signed int sbits32;
#ifdef BITS64
typedef unsigned long long int bits64;
typedef signed long long int sbits64;
#endif
#ifdef BITS64
/*
-------------------------------------------------------------------------------
The `LIT64' macro takes as its argument a textual integer literal and
if necessary ``marks'' the literal as having a 64-bit integer type.
For example, the GNU C Compiler (`gcc') requires that 64-bit literals be
appended with the letters `LL' standing for `long long', which is `gcc's
name for the 64-bit integer type. Some compilers may allow `LIT64' to be
defined as the identity macro: `#define LIT64( a ) a'.
-------------------------------------------------------------------------------
*/
#define LIT64( a ) a##LL
#endif
/*
-------------------------------------------------------------------------------
The macro `INLINE' can be used before functions that should be inlined. If
a compiler does not support explicit inlining, this macro should be defined
to be `static'.
-------------------------------------------------------------------------------
*/
#define INLINE static __inline
/*
-------------------------------------------------------------------------------
The ARM FPA is odd in that it stores doubles high-order word first, no matter
what the endianness of the CPU. VFP is sane.
-------------------------------------------------------------------------------
*/
#if defined(SOFTFLOAT_FOR_GCC)
#define FLOAT64_DEMANGLE(a) (a)
#define FLOAT64_MANGLE(a) (a)
#endif
diff --git a/lib/libc/powerpc64/softfloat/softfloat.h b/lib/libc/powerpc64/softfloat/softfloat.h
index 6b9c9b06956d..b20cb3e7aa00 100644
--- a/lib/libc/powerpc64/softfloat/softfloat.h
+++ b/lib/libc/powerpc64/softfloat/softfloat.h
@@ -1,307 +1,306 @@
/* $NetBSD: softfloat.h,v 1.6 2002/05/12 13:12:46 bjh21 Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
/* #define FLOATX80 */
/* #define FLOAT128 */
#include <machine/ieeefp.h>
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef unsigned int float32;
typedef unsigned long long float64;
#ifdef FLOATX80
typedef struct {
unsigned short high;
unsigned long long low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
unsigned long long high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
#ifndef SOFTFLOAT_FOR_GCC
extern int8 float_detect_tininess;
#endif
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern fp_rnd_t float_rounding_mode;
enum {
float_round_nearest_even = FP_RN,
float_round_to_zero = FP_RZ,
float_round_down = FP_RM,
float_round_up = FP_RP
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
typedef fp_except_t fp_except;
extern fp_except float_exception_flags;
extern fp_except float_exception_mask;
enum {
float_flag_inexact = FP_X_IMP,
float_flag_underflow = FP_X_UFL,
float_flag_overflow = FP_X_OFL,
float_flag_divbyzero = FP_X_DZ,
float_flag_invalid = FP_X_INV
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( fp_except );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( int );
float64 int32_to_float64( int );
#ifdef FLOATX80
floatx80 int32_to_floatx80( int );
#endif
#ifdef FLOAT128
float128 int32_to_float128( int );
#endif
float32 int64_to_float32( long long );
float64 int64_to_float64( long long );
#ifdef FLOATX80
floatx80 int64_to_floatx80( long long );
#endif
#ifdef FLOAT128
float128 int64_to_float128( long long );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float32_to_int32( float32 );
int float32_to_int32_round_to_zero( float32 );
unsigned int float32_to_uint32_round_to_zero( float32 );
long long float32_to_int64( float32 );
long long float32_to_int64_round_to_zero( float32 );
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
int float32_eq( float32, float32 );
int float32_le( float32, float32 );
int float32_lt( float32, float32 );
int float32_eq_signaling( float32, float32 );
int float32_le_quiet( float32, float32 );
int float32_lt_quiet( float32, float32 );
#ifndef SOFTFLOAT_FOR_GCC
int float32_is_signaling_nan( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float64_to_int32( float64 );
int float64_to_int32_round_to_zero( float64 );
unsigned int float64_to_uint32_round_to_zero( float64 );
long long float64_to_int64( float64 );
long long float64_to_int64_round_to_zero( float64 );
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
int float64_eq( float64, float64 );
int float64_le( float64, float64 );
int float64_lt( float64, float64 );
int float64_eq_signaling( float64, float64 );
int float64_le_quiet( float64, float64 );
int float64_lt_quiet( float64, float64 );
#ifndef SOFTFLOAT_FOR_GCC
int float64_is_signaling_nan( float64 );
#endif
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int floatx80_to_int32( floatx80 );
int floatx80_to_int32_round_to_zero( floatx80 );
long long floatx80_to_int64( floatx80 );
long long floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern int floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
int floatx80_eq( floatx80, floatx80 );
int floatx80_le( floatx80, floatx80 );
int floatx80_lt( floatx80, floatx80 );
int floatx80_eq_signaling( floatx80, floatx80 );
int floatx80_le_quiet( floatx80, floatx80 );
int floatx80_lt_quiet( floatx80, floatx80 );
int floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float128_to_int32( float128 );
int float128_to_int32_round_to_zero( float128 );
long long float128_to_int64( float128 );
long long float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
int float128_eq( float128, float128 );
int float128_le( float128, float128 );
int float128_lt( float128, float128 );
int float128_eq_signaling( float128, float128 );
int float128_le_quiet( float128, float128 );
int float128_lt_quiet( float128, float128 );
int float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/powerpc64/string/memcpy_resolver.c b/lib/libc/powerpc64/string/memcpy_resolver.c
index d5f4303f3069..d1ac75edf5b4 100644
--- a/lib/libc/powerpc64/string/memcpy_resolver.c
+++ b/lib/libc/powerpc64/string/memcpy_resolver.c
@@ -1,4 +1,3 @@
-/* $FreeBSD$ */
#define MEMCOPY
#include "bcopy_resolver.c"
diff --git a/lib/libc/powerpc64/string/memmove.S b/lib/libc/powerpc64/string/memmove.S
index e0b8c6c502f1..3d49c57100df 100644
--- a/lib/libc/powerpc64/string/memmove.S
+++ b/lib/libc/powerpc64/string/memmove.S
@@ -1,4 +1,3 @@
-/* $FreeBSD$ */
#define MEMMOVE
#include "bcopy.S"
diff --git a/lib/libc/powerpc64/string/memmove_resolver.c b/lib/libc/powerpc64/string/memmove_resolver.c
index 3f5fd973bd0a..fcb11ee0ae43 100644
--- a/lib/libc/powerpc64/string/memmove_resolver.c
+++ b/lib/libc/powerpc64/string/memmove_resolver.c
@@ -1,4 +1,3 @@
-/* $FreeBSD$ */
#define MEMMOVE
#include "bcopy_resolver.c"
diff --git a/lib/libc/powerpc64/string/memmove_vsx.S b/lib/libc/powerpc64/string/memmove_vsx.S
index bf8a90da468a..9e7d51ce4683 100644
--- a/lib/libc/powerpc64/string/memmove_vsx.S
+++ b/lib/libc/powerpc64/string/memmove_vsx.S
@@ -1,5 +1,4 @@
-/* $FreeBSD$ */
#define MEMMOVE
#define FN_NAME __memmove_vsx
#include "bcopy_vsx.S"
diff --git a/lib/libc/powerpcspe/softfloat/milieu.h b/lib/libc/powerpcspe/softfloat/milieu.h
index e2e43b150073..6139aa58b982 100644
--- a/lib/libc/powerpcspe/softfloat/milieu.h
+++ b/lib/libc/powerpcspe/softfloat/milieu.h
@@ -1,49 +1,48 @@
/* $NetBSD: milieu.h,v 1.1 2000/12/29 20:13:54 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "powerpc-gcc.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/powerpcspe/softfloat/powerpc-gcc.h b/lib/libc/powerpcspe/softfloat/powerpc-gcc.h
index e2f8680dd74e..d11198866e39 100644
--- a/lib/libc/powerpcspe/softfloat/powerpc-gcc.h
+++ b/lib/libc/powerpcspe/softfloat/powerpc-gcc.h
@@ -1,92 +1,91 @@
/* $NetBSD: arm-gcc.h,v 1.2 2001/02/21 18:09:25 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
-------------------------------------------------------------------------------
One of the macros `BIGENDIAN' or `LITTLEENDIAN' must be defined.
-------------------------------------------------------------------------------
*/
#define BIGENDIAN
/*
-------------------------------------------------------------------------------
The macro `BITS64' can be defined to indicate that 64-bit integer types are
supported by the compiler.
-------------------------------------------------------------------------------
*/
#define BITS64
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines the most convenient type that holds
integers of at least as many bits as specified. For example, `uint8' should
be the most convenient type that can hold unsigned integers of as many as
8 bits. The `flag' type must be able to hold either a 0 or 1. For most
implementations of C, `flag', `uint8', and `int8' should all be `typedef'ed
to the same as `int'.
-------------------------------------------------------------------------------
*/
typedef int flag;
typedef unsigned int uint8;
typedef int int8;
typedef unsigned int uint16;
typedef int int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifdef BITS64
typedef unsigned long long int uint64;
typedef signed long long int int64;
#endif
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines a type that holds integers
of _exactly_ the number of bits specified. For instance, for most
implementation of C, `bits16' and `sbits16' should be `typedef'ed to
`unsigned short int' and `signed short int' (or `short int'), respectively.
-------------------------------------------------------------------------------
*/
typedef unsigned char bits8;
typedef signed char sbits8;
typedef unsigned short int bits16;
typedef signed short int sbits16;
typedef unsigned int bits32;
typedef signed int sbits32;
#ifdef BITS64
typedef unsigned long long int bits64;
typedef signed long long int sbits64;
#endif
#ifdef BITS64
/*
-------------------------------------------------------------------------------
The `LIT64' macro takes as its argument a textual integer literal and
if necessary ``marks'' the literal as having a 64-bit integer type.
For example, the GNU C Compiler (`gcc') requires that 64-bit literals be
appended with the letters `LL' standing for `long long', which is `gcc's
name for the 64-bit integer type. Some compilers may allow `LIT64' to be
defined as the identity macro: `#define LIT64( a ) a'.
-------------------------------------------------------------------------------
*/
#define LIT64( a ) a##LL
#endif
/*
-------------------------------------------------------------------------------
The macro `INLINE' can be used before functions that should be inlined. If
a compiler does not support explicit inlining, this macro should be defined
to be `static'.
-------------------------------------------------------------------------------
*/
#define INLINE static __inline
/*
-------------------------------------------------------------------------------
The ARM FPA is odd in that it stores doubles high-order word first, no matter
what the endianness of the CPU. VFP is sane.
-------------------------------------------------------------------------------
*/
#if defined(SOFTFLOAT_FOR_GCC)
#define FLOAT64_DEMANGLE(a) (a)
#define FLOAT64_MANGLE(a) (a)
#endif
diff --git a/lib/libc/powerpcspe/softfloat/softfloat.h b/lib/libc/powerpcspe/softfloat/softfloat.h
index 6b9c9b06956d..b20cb3e7aa00 100644
--- a/lib/libc/powerpcspe/softfloat/softfloat.h
+++ b/lib/libc/powerpcspe/softfloat/softfloat.h
@@ -1,307 +1,306 @@
/* $NetBSD: softfloat.h,v 1.6 2002/05/12 13:12:46 bjh21 Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
/* #define FLOATX80 */
/* #define FLOAT128 */
#include <machine/ieeefp.h>
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef unsigned int float32;
typedef unsigned long long float64;
#ifdef FLOATX80
typedef struct {
unsigned short high;
unsigned long long low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
unsigned long long high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
#ifndef SOFTFLOAT_FOR_GCC
extern int8 float_detect_tininess;
#endif
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern fp_rnd_t float_rounding_mode;
enum {
float_round_nearest_even = FP_RN,
float_round_to_zero = FP_RZ,
float_round_down = FP_RM,
float_round_up = FP_RP
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
typedef fp_except_t fp_except;
extern fp_except float_exception_flags;
extern fp_except float_exception_mask;
enum {
float_flag_inexact = FP_X_IMP,
float_flag_underflow = FP_X_UFL,
float_flag_overflow = FP_X_OFL,
float_flag_divbyzero = FP_X_DZ,
float_flag_invalid = FP_X_INV
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( fp_except );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( int );
float64 int32_to_float64( int );
#ifdef FLOATX80
floatx80 int32_to_floatx80( int );
#endif
#ifdef FLOAT128
float128 int32_to_float128( int );
#endif
float32 int64_to_float32( long long );
float64 int64_to_float64( long long );
#ifdef FLOATX80
floatx80 int64_to_floatx80( long long );
#endif
#ifdef FLOAT128
float128 int64_to_float128( long long );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float32_to_int32( float32 );
int float32_to_int32_round_to_zero( float32 );
unsigned int float32_to_uint32_round_to_zero( float32 );
long long float32_to_int64( float32 );
long long float32_to_int64_round_to_zero( float32 );
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
int float32_eq( float32, float32 );
int float32_le( float32, float32 );
int float32_lt( float32, float32 );
int float32_eq_signaling( float32, float32 );
int float32_le_quiet( float32, float32 );
int float32_lt_quiet( float32, float32 );
#ifndef SOFTFLOAT_FOR_GCC
int float32_is_signaling_nan( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float64_to_int32( float64 );
int float64_to_int32_round_to_zero( float64 );
unsigned int float64_to_uint32_round_to_zero( float64 );
long long float64_to_int64( float64 );
long long float64_to_int64_round_to_zero( float64 );
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
int float64_eq( float64, float64 );
int float64_le( float64, float64 );
int float64_lt( float64, float64 );
int float64_eq_signaling( float64, float64 );
int float64_le_quiet( float64, float64 );
int float64_lt_quiet( float64, float64 );
#ifndef SOFTFLOAT_FOR_GCC
int float64_is_signaling_nan( float64 );
#endif
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int floatx80_to_int32( floatx80 );
int floatx80_to_int32_round_to_zero( floatx80 );
long long floatx80_to_int64( floatx80 );
long long floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern int floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
int floatx80_eq( floatx80, floatx80 );
int floatx80_le( floatx80, floatx80 );
int floatx80_lt( floatx80, floatx80 );
int floatx80_eq_signaling( floatx80, floatx80 );
int floatx80_le_quiet( floatx80, floatx80 );
int floatx80_lt_quiet( floatx80, floatx80 );
int floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float128_to_int32( float128 );
int float128_to_int32_round_to_zero( float128 );
long long float128_to_int64( float128 );
long long float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
int float128_eq( float128, float128 );
int float128_le( float128, float128 );
int float128_lt( float128, float128 );
int float128_eq_signaling( float128, float128 );
int float128_le_quiet( float128, float128 );
int float128_lt_quiet( float128, float128 );
int float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/resolv/res_private.h b/lib/libc/resolv/res_private.h
index a986e95ce2eb..0b86f6c742a1 100644
--- a/lib/libc/resolv/res_private.h
+++ b/lib/libc/resolv/res_private.h
@@ -1,27 +1,26 @@
-/* $FreeBSD$ */
#ifndef res_private_h
#define res_private_h
struct __res_state_ext {
union res_sockaddr_union nsaddrs[MAXNS];
struct sort_list {
int af;
union {
struct in_addr ina;
struct in6_addr in6a;
} addr, mask;
} sort_list[MAXRESOLVSORT];
char nsuffix[64];
char nsuffix2[64];
struct timespec conf_mtim; /* mod time of loaded resolv.conf */
time_t conf_stat; /* time of last stat(resolv.conf) */
u_short reload_period; /* seconds between stat(resolv.conf) */
};
extern int
res_ourserver_p(const res_state statp, const struct sockaddr *sa);
#endif
/*! \file */
diff --git a/lib/libc/riscv/softfloat/milieu.h b/lib/libc/riscv/softfloat/milieu.h
index e97437bdc2d1..0b5fda35de30 100644
--- a/lib/libc/riscv/softfloat/milieu.h
+++ b/lib/libc/riscv/softfloat/milieu.h
@@ -1,48 +1,47 @@
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "riscv-gcc.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/riscv/softfloat/riscv-gcc.h b/lib/libc/riscv/softfloat/riscv-gcc.h
index 3fe1767e63cc..945536012289 100644
--- a/lib/libc/riscv/softfloat/riscv-gcc.h
+++ b/lib/libc/riscv/softfloat/riscv-gcc.h
@@ -1,86 +1,85 @@
/* $NetBSD: arm-gcc.h,v 1.2 2001/02/21 18:09:25 bjh21 Exp $ */
-/* $FreeBSD$ */
/*
-------------------------------------------------------------------------------
One of the macros `BIGENDIAN' or `LITTLEENDIAN' must be defined.
-------------------------------------------------------------------------------
*/
#define LITTLEENDIAN
/*
-------------------------------------------------------------------------------
The macro `BITS64' can be defined to indicate that 64-bit integer types are
supported by the compiler.
-------------------------------------------------------------------------------
*/
#define BITS64
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines the most convenient type that holds
integers of at least as many bits as specified. For example, `uint8' should
be the most convenient type that can hold unsigned integers of as many as
8 bits. The `flag' type must be able to hold either a 0 or 1. For most
implementations of C, `flag', `uint8', and `int8' should all be `typedef'ed
to the same as `int'.
-------------------------------------------------------------------------------
*/
typedef int flag;
typedef int uint8;
typedef int int8;
typedef int uint16;
typedef int int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifdef BITS64
typedef unsigned long long int uint64;
typedef signed long long int int64;
#endif
/*
-------------------------------------------------------------------------------
Each of the following `typedef's defines a type that holds integers
of _exactly_ the number of bits specified. For instance, for most
implementation of C, `bits16' and `sbits16' should be `typedef'ed to
`unsigned short int' and `signed short int' (or `short int'), respectively.
-------------------------------------------------------------------------------
*/
typedef unsigned char bits8;
typedef signed char sbits8;
typedef unsigned short int bits16;
typedef signed short int sbits16;
typedef unsigned int bits32;
typedef signed int sbits32;
#ifdef BITS64
typedef unsigned long long int bits64;
typedef signed long long int sbits64;
#endif
#ifdef BITS64
/*
-------------------------------------------------------------------------------
The `LIT64' macro takes as its argument a textual integer literal and
if necessary ``marks'' the literal as having a 64-bit integer type.
For example, the GNU C Compiler (`gcc') requires that 64-bit literals be
appended with the letters `LL' standing for `long long', which is `gcc's
name for the 64-bit integer type. Some compilers may allow `LIT64' to be
defined as the identity macro: `#define LIT64( a ) a'.
-------------------------------------------------------------------------------
*/
#define LIT64( a ) a##LL
#endif
/*
-------------------------------------------------------------------------------
The macro `INLINE' can be used before functions that should be inlined. If
a compiler does not support explicit inlining, this macro should be defined
to be `static'.
-------------------------------------------------------------------------------
*/
#define INLINE static __inline
#if defined(SOFTFLOAT_FOR_GCC)
#define FLOAT64_DEMANGLE(a) (a)
#define FLOAT64_MANGLE(a) (a)
#endif
diff --git a/lib/libc/riscv/softfloat/softfloat.h b/lib/libc/riscv/softfloat/softfloat.h
index 6aef49975a38..d202a1f7f420 100644
--- a/lib/libc/riscv/softfloat/softfloat.h
+++ b/lib/libc/riscv/softfloat/softfloat.h
@@ -1,315 +1,314 @@
/* $NetBSD: softfloat.h,v 1.6 2002/05/12 13:12:46 bjh21 Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
/* #define FLOATX80 */
/* #define FLOAT128 */
#include <fenv.h>
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef unsigned int float32;
typedef unsigned long long float64;
#ifdef FLOATX80
typedef struct {
unsigned short high;
unsigned long long low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
unsigned long long high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
#ifndef SOFTFLOAT_FOR_GCC
extern int float_detect_tininess;
#endif
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern int float_rounding_mode;
enum {
float_round_nearest_even = FE_TONEAREST,
float_round_to_zero = FE_TOWARDZERO,
float_round_down = FE_DOWNWARD,
float_round_up = FE_UPWARD
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
extern int float_exception_flags;
extern int float_exception_mask;
enum {
float_flag_inexact = FE_INEXACT,
float_flag_underflow = FE_UNDERFLOW,
float_flag_overflow = FE_OVERFLOW,
float_flag_divbyzero = FE_DIVBYZERO,
float_flag_invalid = FE_INVALID
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( int );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( int );
float64 int32_to_float64( int );
#ifdef FLOATX80
floatx80 int32_to_floatx80( int );
#endif
#ifdef FLOAT128
float128 int32_to_float128( int );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __floatdi?f is in libgcc2.c */
float32 int64_to_float32( long long );
float64 int64_to_float64( long long );
#ifdef FLOATX80
floatx80 int64_to_floatx80( long long );
#endif
#ifdef FLOAT128
float128 int64_to_float128( long long );
#endif
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float32_to_int32( float32 );
int float32_to_int32_round_to_zero( float32 );
#if defined(SOFTFLOAT_FOR_GCC) && defined(SOFTFLOAT_NEED_FIXUNS)
unsigned int float32_to_uint32_round_to_zero( float32 );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __fix?fdi provided by libgcc2.c */
long long float32_to_int64( float32 );
long long float32_to_int64_round_to_zero( float32 );
#endif
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
int float32_eq( float32, float32 );
int float32_le( float32, float32 );
int float32_lt( float32, float32 );
int float32_eq_signaling( float32, float32 );
int float32_le_quiet( float32, float32 );
int float32_lt_quiet( float32, float32 );
#ifndef SOFTFLOAT_FOR_GCC
int float32_is_signaling_nan( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float64_to_int32( float64 );
int float64_to_int32_round_to_zero( float64 );
#if defined(SOFTFLOAT_FOR_GCC) && defined(SOFTFLOAT_NEED_FIXUNS)
unsigned int float64_to_uint32_round_to_zero( float64 );
#endif
#ifndef SOFTFLOAT_FOR_GCC /* __fix?fdi provided by libgcc2.c */
long long float64_to_int64( float64 );
long long float64_to_int64_round_to_zero( float64 );
#endif
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
int float64_eq( float64, float64 );
int float64_le( float64, float64 );
int float64_lt( float64, float64 );
int float64_eq_signaling( float64, float64 );
int float64_le_quiet( float64, float64 );
int float64_lt_quiet( float64, float64 );
#ifndef SOFTFLOAT_FOR_GCC
int float64_is_signaling_nan( float64 );
#endif
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
int floatx80_to_int32( floatx80 );
int floatx80_to_int32_round_to_zero( floatx80 );
long long floatx80_to_int64( floatx80 );
long long floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern int floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
int floatx80_eq( floatx80, floatx80 );
int floatx80_le( floatx80, floatx80 );
int floatx80_lt( floatx80, floatx80 );
int floatx80_eq_signaling( floatx80, floatx80 );
int floatx80_le_quiet( floatx80, floatx80 );
int floatx80_lt_quiet( floatx80, floatx80 );
int floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
int float128_to_int32( float128 );
int float128_to_int32_round_to_zero( float128 );
long long float128_to_int64( float128 );
long long float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
int float128_eq( float128, float128 );
int float128_le( float128, float128 );
int float128_lt( float128, float128 );
int float128_eq_signaling( float128, float128 );
int float128_le_quiet( float128, float128 );
int float128_lt_quiet( float128, float128 );
int float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/rpc/DISCLAIMER b/lib/libc/rpc/DISCLAIMER
index d8dcb7ffd4a6..8e0763a0e4dd 100644
--- a/lib/libc/rpc/DISCLAIMER
+++ b/lib/libc/rpc/DISCLAIMER
@@ -1,60 +1,59 @@
/* $NetBSD: DISCLAIMER,v 1.2 1998/01/09 04:11:51 perry Exp $ */
-/* $FreeBSD$ */
/*-
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Copyright (c) 2010, Oracle America, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
* * Neither the name of the "Oracle America, Inc." nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
diff --git a/lib/libc/softfloat/bits32/softfloat-macros b/lib/libc/softfloat/bits32/softfloat-macros
index db4e038eb0b7..59e6e76fe00d 100644
--- a/lib/libc/softfloat/bits32/softfloat-macros
+++ b/lib/libc/softfloat/bits32/softfloat-macros
@@ -1,649 +1,648 @@
-/* $FreeBSD$ */
/*
===============================================================================
This C source fragment is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Shifts `a' right by the number of bits given in `count'. If any nonzero
bits are shifted off, they are ``jammed'' into the least significant bit of
the result by setting the least significant bit to 1. The value of `count'
can be arbitrarily large; in particular, if `count' is greater than 32, the
result will be either 0 or 1, depending on whether `a' is zero or nonzero.
The result is stored in the location pointed to by `zPtr'.
-------------------------------------------------------------------------------
*/
INLINE void shift32RightJamming( bits32 a, int16 count, bits32 *zPtr )
{
bits32 z;
if ( count == 0 ) {
z = a;
}
else if ( count < 32 ) {
z = ( a>>count ) | ( ( a<<( ( - count ) & 31 ) ) != 0 );
}
else {
z = ( a != 0 );
}
*zPtr = z;
}
/*
-------------------------------------------------------------------------------
Shifts the 64-bit value formed by concatenating `a0' and `a1' right by the
number of bits given in `count'. Any bits shifted off are lost. The value
of `count' can be arbitrarily large; in particular, if `count' is greater
than 64, the result will be 0. The result is broken into two 32-bit pieces
which are stored at the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shift64Right(
bits32 a0, bits32 a1, int16 count, bits32 *z0Ptr, bits32 *z1Ptr )
{
bits32 z0, z1;
int8 negCount = ( - count ) & 31;
if ( count == 0 ) {
z1 = a1;
z0 = a0;
}
else if ( count < 32 ) {
z1 = ( a0<<negCount ) | ( a1>>count );
z0 = a0>>count;
}
else {
z1 = ( count < 64 ) ? ( a0>>( count & 31 ) ) : 0;
z0 = 0;
}
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 64-bit value formed by concatenating `a0' and `a1' right by the
number of bits given in `count'. If any nonzero bits are shifted off, they
are ``jammed'' into the least significant bit of the result by setting the
least significant bit to 1. The value of `count' can be arbitrarily large;
in particular, if `count' is greater than 64, the result will be either 0
or 1, depending on whether the concatenation of `a0' and `a1' is zero or
nonzero. The result is broken into two 32-bit pieces which are stored at
the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shift64RightJamming(
bits32 a0, bits32 a1, int16 count, bits32 *z0Ptr, bits32 *z1Ptr )
{
bits32 z0, z1;
int8 negCount = ( - count ) & 31;
if ( count == 0 ) {
z1 = a1;
z0 = a0;
}
else if ( count < 32 ) {
z1 = ( a0<<negCount ) | ( a1>>count ) | ( ( a1<<negCount ) != 0 );
z0 = a0>>count;
}
else {
if ( count == 32 ) {
z1 = a0 | ( a1 != 0 );
}
else if ( count < 64 ) {
z1 = ( a0>>( count & 31 ) ) | ( ( ( a0<<negCount ) | a1 ) != 0 );
}
else {
z1 = ( ( a0 | a1 ) != 0 );
}
z0 = 0;
}
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 96-bit value formed by concatenating `a0', `a1', and `a2' right
by 32 _plus_ the number of bits given in `count'. The shifted result is
at most 64 nonzero bits; these are broken into two 32-bit pieces which are
stored at the locations pointed to by `z0Ptr' and `z1Ptr'. The bits shifted
off form a third 32-bit result as follows: The _last_ bit shifted off is
the most-significant bit of the extra result, and the other 31 bits of the
extra result are all zero if and only if _all_but_the_last_ bits shifted off
were all zero. This extra result is stored in the location pointed to by
`z2Ptr'. The value of `count' can be arbitrarily large.
(This routine makes more sense if `a0', `a1', and `a2' are considered
to form a fixed-point value with binary point between `a1' and `a2'. This
fixed-point value is shifted right by the number of bits given in `count',
and the integer part of the result is returned at the locations pointed to
by `z0Ptr' and `z1Ptr'. The fractional part of the result may be slightly
corrupted as described above, and is returned at the location pointed to by
`z2Ptr'.)
-------------------------------------------------------------------------------
*/
INLINE void
shift64ExtraRightJamming(
bits32 a0,
bits32 a1,
bits32 a2,
int16 count,
bits32 *z0Ptr,
bits32 *z1Ptr,
bits32 *z2Ptr
)
{
bits32 z0, z1, z2;
int8 negCount = ( - count ) & 31;
if ( count == 0 ) {
z2 = a2;
z1 = a1;
z0 = a0;
}
else {
if ( count < 32 ) {
z2 = a1<<negCount;
z1 = ( a0<<negCount ) | ( a1>>count );
z0 = a0>>count;
}
else {
if ( count == 32 ) {
z2 = a1;
z1 = a0;
}
else {
a2 |= a1;
if ( count < 64 ) {
z2 = a0<<negCount;
z1 = a0>>( count & 31 );
}
else {
z2 = ( count == 64 ) ? a0 : ( a0 != 0 );
z1 = 0;
}
}
z0 = 0;
}
z2 |= ( a2 != 0 );
}
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 64-bit value formed by concatenating `a0' and `a1' left by the
number of bits given in `count'. Any bits shifted off are lost. The value
of `count' must be less than 32. The result is broken into two 32-bit
pieces which are stored at the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shortShift64Left(
bits32 a0, bits32 a1, int16 count, bits32 *z0Ptr, bits32 *z1Ptr )
{
*z1Ptr = a1<<count;
*z0Ptr =
( count == 0 ) ? a0 : ( a0<<count ) | ( a1>>( ( - count ) & 31 ) );
}
/*
-------------------------------------------------------------------------------
Shifts the 96-bit value formed by concatenating `a0', `a1', and `a2' left
by the number of bits given in `count'. Any bits shifted off are lost.
The value of `count' must be less than 32. The result is broken into three
32-bit pieces which are stored at the locations pointed to by `z0Ptr',
`z1Ptr', and `z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shortShift96Left(
bits32 a0,
bits32 a1,
bits32 a2,
int16 count,
bits32 *z0Ptr,
bits32 *z1Ptr,
bits32 *z2Ptr
)
{
bits32 z0, z1, z2;
int8 negCount;
z2 = a2<<count;
z1 = a1<<count;
z0 = a0<<count;
if ( 0 < count ) {
negCount = ( ( - count ) & 31 );
z1 |= a2>>negCount;
z0 |= a1>>negCount;
}
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Adds the 64-bit value formed by concatenating `a0' and `a1' to the 64-bit
value formed by concatenating `b0' and `b1'. Addition is modulo 2^64, so
any carry out is lost. The result is broken into two 32-bit pieces which
are stored at the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
add64(
bits32 a0, bits32 a1, bits32 b0, bits32 b1, bits32 *z0Ptr, bits32 *z1Ptr )
{
bits32 z1;
z1 = a1 + b1;
*z1Ptr = z1;
*z0Ptr = a0 + b0 + ( z1 < a1 );
}
/*
-------------------------------------------------------------------------------
Adds the 96-bit value formed by concatenating `a0', `a1', and `a2' to the
96-bit value formed by concatenating `b0', `b1', and `b2'. Addition is
modulo 2^96, so any carry out is lost. The result is broken into three
32-bit pieces which are stored at the locations pointed to by `z0Ptr',
`z1Ptr', and `z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
add96(
bits32 a0,
bits32 a1,
bits32 a2,
bits32 b0,
bits32 b1,
bits32 b2,
bits32 *z0Ptr,
bits32 *z1Ptr,
bits32 *z2Ptr
)
{
bits32 z0, z1, z2;
int8 carry0, carry1;
z2 = a2 + b2;
carry1 = ( z2 < a2 );
z1 = a1 + b1;
carry0 = ( z1 < a1 );
z0 = a0 + b0;
z1 += carry1;
z0 += ( z1 < (bits32)carry1 );
z0 += carry0;
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Subtracts the 64-bit value formed by concatenating `b0' and `b1' from the
64-bit value formed by concatenating `a0' and `a1'. Subtraction is modulo
2^64, so any borrow out (carry out) is lost. The result is broken into two
32-bit pieces which are stored at the locations pointed to by `z0Ptr' and
`z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
sub64(
bits32 a0, bits32 a1, bits32 b0, bits32 b1, bits32 *z0Ptr, bits32 *z1Ptr )
{
*z1Ptr = a1 - b1;
*z0Ptr = a0 - b0 - ( a1 < b1 );
}
/*
-------------------------------------------------------------------------------
Subtracts the 96-bit value formed by concatenating `b0', `b1', and `b2' from
the 96-bit value formed by concatenating `a0', `a1', and `a2'. Subtraction
is modulo 2^96, so any borrow out (carry out) is lost. The result is broken
into three 32-bit pieces which are stored at the locations pointed to by
`z0Ptr', `z1Ptr', and `z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
sub96(
bits32 a0,
bits32 a1,
bits32 a2,
bits32 b0,
bits32 b1,
bits32 b2,
bits32 *z0Ptr,
bits32 *z1Ptr,
bits32 *z2Ptr
)
{
bits32 z0, z1, z2;
int8 borrow0, borrow1;
z2 = a2 - b2;
borrow1 = ( a2 < b2 );
z1 = a1 - b1;
borrow0 = ( a1 < b1 );
z0 = a0 - b0;
z0 -= ( z1 < (bits32)borrow1 );
z1 -= borrow1;
z0 -= borrow0;
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Multiplies `a' by `b' to obtain a 64-bit product. The product is broken
into two 32-bit pieces which are stored at the locations pointed to by
`z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void mul32To64( bits32 a, bits32 b, bits32 *z0Ptr, bits32 *z1Ptr )
{
bits16 aHigh, aLow, bHigh, bLow;
bits32 z0, zMiddleA, zMiddleB, z1;
aLow = a;
aHigh = a>>16;
bLow = b;
bHigh = b>>16;
z1 = ( (bits32) aLow ) * bLow;
zMiddleA = ( (bits32) aLow ) * bHigh;
zMiddleB = ( (bits32) aHigh ) * bLow;
z0 = ( (bits32) aHigh ) * bHigh;
zMiddleA += zMiddleB;
z0 += ( ( (bits32) ( zMiddleA < zMiddleB ) )<<16 ) + ( zMiddleA>>16 );
zMiddleA <<= 16;
z1 += zMiddleA;
z0 += ( z1 < zMiddleA );
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Multiplies the 64-bit value formed by concatenating `a0' and `a1' by `b'
to obtain a 96-bit product. The product is broken into three 32-bit pieces
which are stored at the locations pointed to by `z0Ptr', `z1Ptr', and
`z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
mul64By32To96(
bits32 a0,
bits32 a1,
bits32 b,
bits32 *z0Ptr,
bits32 *z1Ptr,
bits32 *z2Ptr
)
{
bits32 z0, z1, z2, more1;
mul32To64( a1, b, &z1, &z2 );
mul32To64( a0, b, &z0, &more1 );
add64( z0, more1, 0, z1, &z0, &z1 );
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Multiplies the 64-bit value formed by concatenating `a0' and `a1' to the
64-bit value formed by concatenating `b0' and `b1' to obtain a 128-bit
product. The product is broken into four 32-bit pieces which are stored at
the locations pointed to by `z0Ptr', `z1Ptr', `z2Ptr', and `z3Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
mul64To128(
bits32 a0,
bits32 a1,
bits32 b0,
bits32 b1,
bits32 *z0Ptr,
bits32 *z1Ptr,
bits32 *z2Ptr,
bits32 *z3Ptr
)
{
bits32 z0, z1, z2, z3;
bits32 more1, more2;
mul32To64( a1, b1, &z2, &z3 );
mul32To64( a1, b0, &z1, &more2 );
add64( z1, more2, 0, z2, &z1, &z2 );
mul32To64( a0, b0, &z0, &more1 );
add64( z0, more1, 0, z1, &z0, &z1 );
mul32To64( a0, b1, &more1, &more2 );
add64( more1, more2, 0, z2, &more1, &z2 );
add64( z0, z1, 0, more1, &z0, &z1 );
*z3Ptr = z3;
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Returns an approximation to the 32-bit integer quotient obtained by dividing
`b' into the 64-bit value formed by concatenating `a0' and `a1'. The
divisor `b' must be at least 2^31. If q is the exact quotient truncated
toward zero, the approximation returned lies between q and q + 2 inclusive.
If the exact quotient q is larger than 32 bits, the maximum positive 32-bit
unsigned integer is returned.
-------------------------------------------------------------------------------
*/
static bits32 estimateDiv64To32( bits32 a0, bits32 a1, bits32 b )
{
bits32 b0, b1;
bits32 rem0, rem1, term0, term1;
bits32 z;
if ( b <= a0 ) return 0xFFFFFFFF;
b0 = b>>16;
z = ( b0<<16 <= a0 ) ? 0xFFFF0000 : ( a0 / b0 )<<16;
mul32To64( b, z, &term0, &term1 );
sub64( a0, a1, term0, term1, &rem0, &rem1 );
while ( ( (sbits32) rem0 ) < 0 ) {
z -= 0x10000;
b1 = b<<16;
add64( rem0, rem1, b0, b1, &rem0, &rem1 );
}
rem0 = ( rem0<<16 ) | ( rem1>>16 );
z |= ( b0<<16 <= rem0 ) ? 0xFFFF : rem0 / b0;
return z;
}
#ifndef SOFTFLOAT_FOR_GCC
/*
-------------------------------------------------------------------------------
Returns an approximation to the square root of the 32-bit significand given
by `a'. Considered as an integer, `a' must be at least 2^31. If bit 0 of
`aExp' (the least significant bit) is 1, the integer returned approximates
2^31*sqrt(`a'/2^31), where `a' is considered an integer. If bit 0 of `aExp'
is 0, the integer returned approximates 2^31*sqrt(`a'/2^30). In either
case, the approximation returned lies strictly within +/-2 of the exact
value.
-------------------------------------------------------------------------------
*/
static bits32 estimateSqrt32( int16 aExp, bits32 a )
{
static const bits16 sqrtOddAdjustments[] = {
0x0004, 0x0022, 0x005D, 0x00B1, 0x011D, 0x019F, 0x0236, 0x02E0,
0x039C, 0x0468, 0x0545, 0x0631, 0x072B, 0x0832, 0x0946, 0x0A67
};
static const bits16 sqrtEvenAdjustments[] = {
0x0A2D, 0x08AF, 0x075A, 0x0629, 0x051A, 0x0429, 0x0356, 0x029E,
0x0200, 0x0179, 0x0109, 0x00AF, 0x0068, 0x0034, 0x0012, 0x0002
};
int8 index;
bits32 z;
index = ( a>>27 ) & 15;
if ( aExp & 1 ) {
z = 0x4000 + ( a>>17 ) - sqrtOddAdjustments[ index ];
z = ( ( a / z )<<14 ) + ( z<<15 );
a >>= 1;
}
else {
z = 0x8000 + ( a>>17 ) - sqrtEvenAdjustments[ index ];
z = a / z + z;
z = ( 0x20000 <= z ) ? 0xFFFF8000 : ( z<<15 );
if ( z <= a ) return (bits32) ( ( (sbits32) a )>>1 );
}
return ( ( estimateDiv64To32( a, 0, z ) )>>1 ) + ( z>>1 );
}
#endif
/*
-------------------------------------------------------------------------------
Returns the number of leading 0 bits before the most-significant 1 bit of
`a'. If `a' is zero, 32 is returned.
-------------------------------------------------------------------------------
*/
static int8 countLeadingZeros32( bits32 a )
{
static const int8 countLeadingZerosHigh[] = {
8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
int8 shiftCount;
shiftCount = 0;
if ( a < 0x10000 ) {
shiftCount += 16;
a <<= 16;
}
if ( a < 0x1000000 ) {
shiftCount += 8;
a <<= 8;
}
shiftCount += countLeadingZerosHigh[ a>>24 ];
return shiftCount;
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 64-bit value formed by concatenating `a0' and `a1' is
equal to the 64-bit value formed by concatenating `b0' and `b1'. Otherwise,
returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag eq64( bits32 a0, bits32 a1, bits32 b0, bits32 b1 )
{
return ( a0 == b0 ) && ( a1 == b1 );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 64-bit value formed by concatenating `a0' and `a1' is less
than or equal to the 64-bit value formed by concatenating `b0' and `b1'.
Otherwise, returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag le64( bits32 a0, bits32 a1, bits32 b0, bits32 b1 )
{
return ( a0 < b0 ) || ( ( a0 == b0 ) && ( a1 <= b1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 64-bit value formed by concatenating `a0' and `a1' is less
than the 64-bit value formed by concatenating `b0' and `b1'. Otherwise,
returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag lt64( bits32 a0, bits32 a1, bits32 b0, bits32 b1 )
{
return ( a0 < b0 ) || ( ( a0 == b0 ) && ( a1 < b1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 64-bit value formed by concatenating `a0' and `a1' is not
equal to the 64-bit value formed by concatenating `b0' and `b1'. Otherwise,
returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag ne64( bits32 a0, bits32 a1, bits32 b0, bits32 b1 )
{
return ( a0 != b0 ) || ( a1 != b1 );
}
diff --git a/lib/libc/softfloat/bits64/softfloat-macros b/lib/libc/softfloat/bits64/softfloat-macros
index 7fedb0c348d0..22124031855c 100644
--- a/lib/libc/softfloat/bits64/softfloat-macros
+++ b/lib/libc/softfloat/bits64/softfloat-macros
@@ -1,746 +1,745 @@
/* $NetBSD: softfloat-macros,v 1.2 2009/02/16 10:23:35 tron Exp $ */
-/* $FreeBSD$ */
/*
===============================================================================
This C source fragment is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Shifts `a' right by the number of bits given in `count'. If any nonzero
bits are shifted off, they are ``jammed'' into the least significant bit of
the result by setting the least significant bit to 1. The value of `count'
can be arbitrarily large; in particular, if `count' is greater than 32, the
result will be either 0 or 1, depending on whether `a' is zero or nonzero.
The result is stored in the location pointed to by `zPtr'.
-------------------------------------------------------------------------------
*/
INLINE void shift32RightJamming( bits32 a, int16 count, bits32 *zPtr )
{
bits32 z;
if ( count == 0 ) {
z = a;
}
else if ( count < 32 ) {
z = ( a>>count ) | ( ( a<<( ( - count ) & 31 ) ) != 0 );
}
else {
z = ( a != 0 );
}
*zPtr = z;
}
/*
-------------------------------------------------------------------------------
Shifts `a' right by the number of bits given in `count'. If any nonzero
bits are shifted off, they are ``jammed'' into the least significant bit of
the result by setting the least significant bit to 1. The value of `count'
can be arbitrarily large; in particular, if `count' is greater than 64, the
result will be either 0 or 1, depending on whether `a' is zero or nonzero.
The result is stored in the location pointed to by `zPtr'.
-------------------------------------------------------------------------------
*/
INLINE void shift64RightJamming( bits64 a, int16 count, bits64 *zPtr )
{
bits64 z;
if ( count == 0 ) {
z = a;
}
else if ( count < 64 ) {
z = ( a>>count ) | ( ( a<<( ( - count ) & 63 ) ) != 0 );
}
else {
z = ( a != 0 );
}
*zPtr = z;
}
/*
-------------------------------------------------------------------------------
Shifts the 128-bit value formed by concatenating `a0' and `a1' right by 64
_plus_ the number of bits given in `count'. The shifted result is at most
64 nonzero bits; this is stored at the location pointed to by `z0Ptr'. The
bits shifted off form a second 64-bit result as follows: The _last_ bit
shifted off is the most-significant bit of the extra result, and the other
63 bits of the extra result are all zero if and only if _all_but_the_last_
bits shifted off were all zero. This extra result is stored in the location
pointed to by `z1Ptr'. The value of `count' can be arbitrarily large.
(This routine makes more sense if `a0' and `a1' are considered to form a
fixed-point value with binary point between `a0' and `a1'. This fixed-point
value is shifted right by the number of bits given in `count', and the
integer part of the result is returned at the location pointed to by
`z0Ptr'. The fractional part of the result may be slightly corrupted as
described above, and is returned at the location pointed to by `z1Ptr'.)
-------------------------------------------------------------------------------
*/
INLINE void
shift64ExtraRightJamming(
bits64 a0, bits64 a1, int16 count, bits64 *z0Ptr, bits64 *z1Ptr )
{
bits64 z0, z1;
int8 negCount = ( - count ) & 63;
if ( count == 0 ) {
z1 = a1;
z0 = a0;
}
else if ( count < 64 ) {
z1 = ( a0<<negCount ) | ( a1 != 0 );
z0 = a0>>count;
}
else {
if ( count == 64 ) {
z1 = a0 | ( a1 != 0 );
}
else {
z1 = ( ( a0 | a1 ) != 0 );
}
z0 = 0;
}
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 128-bit value formed by concatenating `a0' and `a1' right by the
number of bits given in `count'. Any bits shifted off are lost. The value
of `count' can be arbitrarily large; in particular, if `count' is greater
than 128, the result will be 0. The result is broken into two 64-bit pieces
which are stored at the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shift128Right(
bits64 a0, bits64 a1, int16 count, bits64 *z0Ptr, bits64 *z1Ptr )
{
bits64 z0, z1;
int8 negCount = ( - count ) & 63;
if ( count == 0 ) {
z1 = a1;
z0 = a0;
}
else if ( count < 64 ) {
z1 = ( a0<<negCount ) | ( a1>>count );
z0 = a0>>count;
}
else {
z1 = ( count < 128 ) ? ( a0>>( count & 63 ) ) : 0;
z0 = 0;
}
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 128-bit value formed by concatenating `a0' and `a1' right by the
number of bits given in `count'. If any nonzero bits are shifted off, they
are ``jammed'' into the least significant bit of the result by setting the
least significant bit to 1. The value of `count' can be arbitrarily large;
in particular, if `count' is greater than 128, the result will be either
0 or 1, depending on whether the concatenation of `a0' and `a1' is zero or
nonzero. The result is broken into two 64-bit pieces which are stored at
the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shift128RightJamming(
bits64 a0, bits64 a1, int16 count, bits64 *z0Ptr, bits64 *z1Ptr )
{
bits64 z0, z1;
int8 negCount = ( - count ) & 63;
if ( count == 0 ) {
z1 = a1;
z0 = a0;
}
else if ( count < 64 ) {
z1 = ( a0<<negCount ) | ( a1>>count ) | ( ( a1<<negCount ) != 0 );
z0 = a0>>count;
}
else {
if ( count == 64 ) {
z1 = a0 | ( a1 != 0 );
}
else if ( count < 128 ) {
z1 = ( a0>>( count & 63 ) ) | ( ( ( a0<<negCount ) | a1 ) != 0 );
}
else {
z1 = ( ( a0 | a1 ) != 0 );
}
z0 = 0;
}
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 192-bit value formed by concatenating `a0', `a1', and `a2' right
by 64 _plus_ the number of bits given in `count'. The shifted result is
at most 128 nonzero bits; these are broken into two 64-bit pieces which are
stored at the locations pointed to by `z0Ptr' and `z1Ptr'. The bits shifted
off form a third 64-bit result as follows: The _last_ bit shifted off is
the most-significant bit of the extra result, and the other 63 bits of the
extra result are all zero if and only if _all_but_the_last_ bits shifted off
were all zero. This extra result is stored in the location pointed to by
`z2Ptr'. The value of `count' can be arbitrarily large.
(This routine makes more sense if `a0', `a1', and `a2' are considered
to form a fixed-point value with binary point between `a1' and `a2'. This
fixed-point value is shifted right by the number of bits given in `count',
and the integer part of the result is returned at the locations pointed to
by `z0Ptr' and `z1Ptr'. The fractional part of the result may be slightly
corrupted as described above, and is returned at the location pointed to by
`z2Ptr'.)
-------------------------------------------------------------------------------
*/
INLINE void
shift128ExtraRightJamming(
bits64 a0,
bits64 a1,
bits64 a2,
int16 count,
bits64 *z0Ptr,
bits64 *z1Ptr,
bits64 *z2Ptr
)
{
bits64 z0, z1, z2;
int8 negCount = ( - count ) & 63;
if ( count == 0 ) {
z2 = a2;
z1 = a1;
z0 = a0;
}
else {
if ( count < 64 ) {
z2 = a1<<negCount;
z1 = ( a0<<negCount ) | ( a1>>count );
z0 = a0>>count;
}
else {
if ( count == 64 ) {
z2 = a1;
z1 = a0;
}
else {
a2 |= a1;
if ( count < 128 ) {
z2 = a0<<negCount;
z1 = a0>>( count & 63 );
}
else {
z2 = ( count == 128 ) ? a0 : ( a0 != 0 );
z1 = 0;
}
}
z0 = 0;
}
z2 |= ( a2 != 0 );
}
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Shifts the 128-bit value formed by concatenating `a0' and `a1' left by the
number of bits given in `count'. Any bits shifted off are lost. The value
of `count' must be less than 64. The result is broken into two 64-bit
pieces which are stored at the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shortShift128Left(
bits64 a0, bits64 a1, int16 count, bits64 *z0Ptr, bits64 *z1Ptr )
{
*z1Ptr = a1<<count;
*z0Ptr =
( count == 0 ) ? a0 : ( a0<<count ) | ( a1>>( ( - count ) & 63 ) );
}
/*
-------------------------------------------------------------------------------
Shifts the 192-bit value formed by concatenating `a0', `a1', and `a2' left
by the number of bits given in `count'. Any bits shifted off are lost.
The value of `count' must be less than 64. The result is broken into three
64-bit pieces which are stored at the locations pointed to by `z0Ptr',
`z1Ptr', and `z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
shortShift192Left(
bits64 a0,
bits64 a1,
bits64 a2,
int16 count,
bits64 *z0Ptr,
bits64 *z1Ptr,
bits64 *z2Ptr
)
{
bits64 z0, z1, z2;
int8 negCount;
z2 = a2<<count;
z1 = a1<<count;
z0 = a0<<count;
if ( 0 < count ) {
negCount = ( ( - count ) & 63 );
z1 |= a2>>negCount;
z0 |= a1>>negCount;
}
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Adds the 128-bit value formed by concatenating `a0' and `a1' to the 128-bit
value formed by concatenating `b0' and `b1'. Addition is modulo 2^128, so
any carry out is lost. The result is broken into two 64-bit pieces which
are stored at the locations pointed to by `z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
add128(
bits64 a0, bits64 a1, bits64 b0, bits64 b1, bits64 *z0Ptr, bits64 *z1Ptr )
{
bits64 z1;
z1 = a1 + b1;
*z1Ptr = z1;
*z0Ptr = a0 + b0 + ( z1 < a1 );
}
/*
-------------------------------------------------------------------------------
Adds the 192-bit value formed by concatenating `a0', `a1', and `a2' to the
192-bit value formed by concatenating `b0', `b1', and `b2'. Addition is
modulo 2^192, so any carry out is lost. The result is broken into three
64-bit pieces which are stored at the locations pointed to by `z0Ptr',
`z1Ptr', and `z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
add192(
bits64 a0,
bits64 a1,
bits64 a2,
bits64 b0,
bits64 b1,
bits64 b2,
bits64 *z0Ptr,
bits64 *z1Ptr,
bits64 *z2Ptr
)
{
bits64 z0, z1, z2;
int8 carry0, carry1;
z2 = a2 + b2;
carry1 = ( z2 < a2 );
z1 = a1 + b1;
carry0 = ( z1 < a1 );
z0 = a0 + b0;
z1 += carry1;
z0 += ( z1 < (bits64)carry1 );
z0 += carry0;
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Subtracts the 128-bit value formed by concatenating `b0' and `b1' from the
128-bit value formed by concatenating `a0' and `a1'. Subtraction is modulo
2^128, so any borrow out (carry out) is lost. The result is broken into two
64-bit pieces which are stored at the locations pointed to by `z0Ptr' and
`z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
sub128(
bits64 a0, bits64 a1, bits64 b0, bits64 b1, bits64 *z0Ptr, bits64 *z1Ptr )
{
*z1Ptr = a1 - b1;
*z0Ptr = a0 - b0 - ( a1 < b1 );
}
/*
-------------------------------------------------------------------------------
Subtracts the 192-bit value formed by concatenating `b0', `b1', and `b2'
from the 192-bit value formed by concatenating `a0', `a1', and `a2'.
Subtraction is modulo 2^192, so any borrow out (carry out) is lost. The
result is broken into three 64-bit pieces which are stored at the locations
pointed to by `z0Ptr', `z1Ptr', and `z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
sub192(
bits64 a0,
bits64 a1,
bits64 a2,
bits64 b0,
bits64 b1,
bits64 b2,
bits64 *z0Ptr,
bits64 *z1Ptr,
bits64 *z2Ptr
)
{
bits64 z0, z1, z2;
int8 borrow0, borrow1;
z2 = a2 - b2;
borrow1 = ( a2 < b2 );
z1 = a1 - b1;
borrow0 = ( a1 < b1 );
z0 = a0 - b0;
z0 -= ( z1 < (bits64)borrow1 );
z1 -= borrow1;
z0 -= borrow0;
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Multiplies `a' by `b' to obtain a 128-bit product. The product is broken
into two 64-bit pieces which are stored at the locations pointed to by
`z0Ptr' and `z1Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void mul64To128( bits64 a, bits64 b, bits64 *z0Ptr, bits64 *z1Ptr )
{
bits32 aHigh, aLow, bHigh, bLow;
bits64 z0, zMiddleA, zMiddleB, z1;
aLow = a;
aHigh = a>>32;
bLow = b;
bHigh = b>>32;
z1 = ( (bits64) aLow ) * bLow;
zMiddleA = ( (bits64) aLow ) * bHigh;
zMiddleB = ( (bits64) aHigh ) * bLow;
z0 = ( (bits64) aHigh ) * bHigh;
zMiddleA += zMiddleB;
z0 += ( ( (bits64) ( zMiddleA < zMiddleB ) )<<32 ) + ( zMiddleA>>32 );
zMiddleA <<= 32;
z1 += zMiddleA;
z0 += ( z1 < zMiddleA );
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Multiplies the 128-bit value formed by concatenating `a0' and `a1' by
`b' to obtain a 192-bit product. The product is broken into three 64-bit
pieces which are stored at the locations pointed to by `z0Ptr', `z1Ptr', and
`z2Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
mul128By64To192(
bits64 a0,
bits64 a1,
bits64 b,
bits64 *z0Ptr,
bits64 *z1Ptr,
bits64 *z2Ptr
)
{
bits64 z0, z1, z2, more1;
mul64To128( a1, b, &z1, &z2 );
mul64To128( a0, b, &z0, &more1 );
add128( z0, more1, 0, z1, &z0, &z1 );
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Multiplies the 128-bit value formed by concatenating `a0' and `a1' to the
128-bit value formed by concatenating `b0' and `b1' to obtain a 256-bit
product. The product is broken into four 64-bit pieces which are stored at
the locations pointed to by `z0Ptr', `z1Ptr', `z2Ptr', and `z3Ptr'.
-------------------------------------------------------------------------------
*/
INLINE void
mul128To256(
bits64 a0,
bits64 a1,
bits64 b0,
bits64 b1,
bits64 *z0Ptr,
bits64 *z1Ptr,
bits64 *z2Ptr,
bits64 *z3Ptr
)
{
bits64 z0, z1, z2, z3;
bits64 more1, more2;
mul64To128( a1, b1, &z2, &z3 );
mul64To128( a1, b0, &z1, &more2 );
add128( z1, more2, 0, z2, &z1, &z2 );
mul64To128( a0, b0, &z0, &more1 );
add128( z0, more1, 0, z1, &z0, &z1 );
mul64To128( a0, b1, &more1, &more2 );
add128( more1, more2, 0, z2, &more1, &z2 );
add128( z0, z1, 0, more1, &z0, &z1 );
*z3Ptr = z3;
*z2Ptr = z2;
*z1Ptr = z1;
*z0Ptr = z0;
}
/*
-------------------------------------------------------------------------------
Returns an approximation to the 64-bit integer quotient obtained by dividing
`b' into the 128-bit value formed by concatenating `a0' and `a1'. The
divisor `b' must be at least 2^63. If q is the exact quotient truncated
toward zero, the approximation returned lies between q and q + 2 inclusive.
If the exact quotient q is larger than 64 bits, the maximum positive 64-bit
unsigned integer is returned.
-------------------------------------------------------------------------------
*/
static bits64 estimateDiv128To64( bits64 a0, bits64 a1, bits64 b )
{
bits64 b0, b1;
bits64 rem0, rem1, term0, term1;
bits64 z;
if ( b <= a0 ) return LIT64( 0xFFFFFFFFFFFFFFFF );
b0 = b>>32;
z = ( b0<<32 <= a0 ) ? LIT64( 0xFFFFFFFF00000000 ) : ( a0 / b0 )<<32;
mul64To128( b, z, &term0, &term1 );
sub128( a0, a1, term0, term1, &rem0, &rem1 );
while ( ( (sbits64) rem0 ) < 0 ) {
z -= LIT64( 0x100000000 );
b1 = b<<32;
add128( rem0, rem1, b0, b1, &rem0, &rem1 );
}
rem0 = ( rem0<<32 ) | ( rem1>>32 );
z |= ( b0<<32 <= rem0 ) ? 0xFFFFFFFF : rem0 / b0;
return z;
}
#if !defined(SOFTFLOAT_FOR_GCC) || defined(FLOATX80) || defined(FLOAT128)
/*
-------------------------------------------------------------------------------
Returns an approximation to the square root of the 32-bit significand given
by `a'. Considered as an integer, `a' must be at least 2^31. If bit 0 of
`aExp' (the least significant bit) is 1, the integer returned approximates
2^31*sqrt(`a'/2^31), where `a' is considered an integer. If bit 0 of `aExp'
is 0, the integer returned approximates 2^31*sqrt(`a'/2^30). In either
case, the approximation returned lies strictly within +/-2 of the exact
value.
-------------------------------------------------------------------------------
*/
static bits32 estimateSqrt32( int16 aExp, bits32 a )
{
static const bits16 sqrtOddAdjustments[] = {
0x0004, 0x0022, 0x005D, 0x00B1, 0x011D, 0x019F, 0x0236, 0x02E0,
0x039C, 0x0468, 0x0545, 0x0631, 0x072B, 0x0832, 0x0946, 0x0A67
};
static const bits16 sqrtEvenAdjustments[] = {
0x0A2D, 0x08AF, 0x075A, 0x0629, 0x051A, 0x0429, 0x0356, 0x029E,
0x0200, 0x0179, 0x0109, 0x00AF, 0x0068, 0x0034, 0x0012, 0x0002
};
int8 idx;
bits32 z;
idx = ( a>>27 ) & 15;
if ( aExp & 1 ) {
z = 0x4000 + ( a>>17 ) - sqrtOddAdjustments[ idx ];
z = ( ( a / z )<<14 ) + ( z<<15 );
a >>= 1;
}
else {
z = 0x8000 + ( a>>17 ) - sqrtEvenAdjustments[ idx ];
z = a / z + z;
z = ( 0x20000 <= z ) ? 0xFFFF8000 : ( z<<15 );
if ( z <= a ) return (bits32) ( ( (sbits32) a )>>1 );
}
return ( (bits32) ( ( ( (bits64) a )<<31 ) / z ) ) + ( z>>1 );
}
#endif
/*
-------------------------------------------------------------------------------
Returns the number of leading 0 bits before the most-significant 1 bit of
`a'. If `a' is zero, 32 is returned.
-------------------------------------------------------------------------------
*/
static int8 countLeadingZeros32( bits32 a )
{
static const int8 countLeadingZerosHigh[] = {
8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
int8 shiftCount;
shiftCount = 0;
if ( a < 0x10000 ) {
shiftCount += 16;
a <<= 16;
}
if ( a < 0x1000000 ) {
shiftCount += 8;
a <<= 8;
}
shiftCount += countLeadingZerosHigh[ a>>24 ];
return shiftCount;
}
/*
-------------------------------------------------------------------------------
Returns the number of leading 0 bits before the most-significant 1 bit of
`a'. If `a' is zero, 64 is returned.
-------------------------------------------------------------------------------
*/
static int8 countLeadingZeros64( bits64 a )
{
int8 shiftCount;
shiftCount = 0;
if ( a < ( (bits64) 1 )<<32 ) {
shiftCount += 32;
}
else {
a >>= 32;
}
shiftCount += countLeadingZeros32( a );
return shiftCount;
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 128-bit value formed by concatenating `a0' and `a1'
is equal to the 128-bit value formed by concatenating `b0' and `b1'.
Otherwise, returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag eq128( bits64 a0, bits64 a1, bits64 b0, bits64 b1 )
{
return ( a0 == b0 ) && ( a1 == b1 );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 128-bit value formed by concatenating `a0' and `a1' is less
than or equal to the 128-bit value formed by concatenating `b0' and `b1'.
Otherwise, returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag le128( bits64 a0, bits64 a1, bits64 b0, bits64 b1 )
{
return ( a0 < b0 ) || ( ( a0 == b0 ) && ( a1 <= b1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 128-bit value formed by concatenating `a0' and `a1' is less
than the 128-bit value formed by concatenating `b0' and `b1'. Otherwise,
returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag lt128( bits64 a0, bits64 a1, bits64 b0, bits64 b1 )
{
return ( a0 < b0 ) || ( ( a0 == b0 ) && ( a1 < b1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the 128-bit value formed by concatenating `a0' and `a1' is
not equal to the 128-bit value formed by concatenating `b0' and `b1'.
Otherwise, returns 0.
-------------------------------------------------------------------------------
*/
INLINE flag ne128( bits64 a0, bits64 a1, bits64 b0, bits64 b1 )
{
return ( a0 != b0 ) || ( a1 != b1 );
}
diff --git a/lib/libc/softfloat/softfloat-for-gcc.h b/lib/libc/softfloat/softfloat-for-gcc.h
index cf17e56768a9..8a62de032879 100644
--- a/lib/libc/softfloat/softfloat-for-gcc.h
+++ b/lib/libc/softfloat/softfloat-for-gcc.h
@@ -1,169 +1,168 @@
/* $NetBSD: softfloat-for-gcc.h,v 1.8 2009/12/14 01:07:42 matt Exp $ */
-/* $FreeBSD$ */
/*
* Move private identifiers with external linkage into implementation
* namespace. -- Klaus Klein <kleink@NetBSD.org>, May 5, 1999
*/
#define float_exception_flags __softfloat_float_exception_flags
#define float_exception_mask __softfloat_float_exception_mask
#define float_rounding_mode __softfloat_float_rounding_mode
#define float_raise __softfloat_float_raise
/* The following batch are called by GCC through wrappers */
#define float32_eq __softfloat_float32_eq
#define float32_le __softfloat_float32_le
#define float32_lt __softfloat_float32_lt
#define float64_eq __softfloat_float64_eq
#define float64_le __softfloat_float64_le
#define float64_lt __softfloat_float64_lt
#define float128_eq __softfloat_float128_eq
#define float128_le __softfloat_float128_le
#define float128_lt __softfloat_float128_lt
/*
* Macros to define functions with the GCC expected names
*/
#define float32_add __addsf3
#define float64_add __adddf3
#define floatx80_add __addxf3
#define float128_add __addtf3
#define float32_sub __subsf3
#define float64_sub __subdf3
#define floatx80_sub __subxf3
#define float128_sub __subtf3
#define float32_mul __mulsf3
#define float64_mul __muldf3
#define floatx80_mul __mulxf3
#define float128_mul __multf3
#define float32_div __divsf3
#define float64_div __divdf3
#define floatx80_div __divxf3
#define float128_div __divtf3
#if 0
#define float32_neg __negsf2
#define float64_neg __negdf2
#define floatx80_neg __negxf2
#define float128_neg __negtf2
#endif
#define int32_to_float32 __floatsisf
#define int32_to_float64 __floatsidf
#define int32_to_floatx80 __floatsixf
#define int32_to_float128 __floatsitf
#define int64_to_float32 __floatdisf
#define int64_to_float64 __floatdidf
#define int64_to_floatx80 __floatdixf
#define int64_to_float128 __floatditf
#define int128_to_float32 __floattisf
#define int128_to_float64 __floattidf
#define int128_to_floatx80 __floattixf
#define int128_to_float128 __floattitf
#define uint32_to_float32 __floatunsisf
#define uint32_to_float64 __floatunsidf
#define uint32_to_floatx80 __floatunsixf
#define uint32_to_float128 __floatunsitf
#define uint64_to_float32 __floatundisf
#define uint64_to_float64 __floatundidf
#define uint64_to_floatx80 __floatundixf
#define uint64_to_float128 __floatunditf
#define uint128_to_float32 __floatuntisf
#define uint128_to_float64 __floatuntidf
#define uint128_to_floatx80 __floatuntixf
#define uint128_to_float128 __floatuntitf
#define float32_to_int32_round_to_zero __fixsfsi
#define float64_to_int32_round_to_zero __fixdfsi
#define floatx80_to_int32_round_to_zero __fixxfsi
#define float128_to_int32_round_to_zero __fixtfsi
#define float32_to_int64_round_to_zero __fixsfdi
#define float64_to_int64_round_to_zero __fixdfdi
#define floatx80_to_int64_round_to_zero __fixxfdi
#define float128_to_int64_round_to_zero __fixtfdi
#define float32_to_int128_round_to_zero __fixsfti
#define float64_to_int128_round_to_zero __fixdfti
#define floatx80_to_int128_round_to_zero __fixxfti
#define float128_to_int128_round_to_zero __fixtfti
#define float32_to_uint32_round_to_zero __fixunssfsi
#define float64_to_uint32_round_to_zero __fixunsdfsi
#define floatx80_to_uint32_round_to_zero __fixunsxfsi
#define float128_to_uint32_round_to_zero __fixunstfsi
#define float32_to_uint64_round_to_zero __fixunssfdi
#define float64_to_uint64_round_to_zero __fixunsdfdi
#define floatx80_to_uint64_round_to_zero __fixunsxfdi
#define float128_to_uint64_round_to_zero __fixunstfdi
#define float32_to_uint128_round_to_zero __fixunssfti
#define float64_to_uint128_round_to_zero __fixunsdfti
#define floatx80_to_uint128_round_to_zero __fixunsxfti
#define float128_to_uint128_round_to_zero __fixunstfti
#define float32_to_float64 __extendsfdf2
#define float32_to_floatx80 __extendsfxf2
#define float32_to_float128 __extendsftf2
#define float64_to_floatx80 __extenddfxf2
#define float64_to_float128 __extenddftf2
#define float128_to_float64 __trunctfdf2
#define floatx80_to_float64 __truncxfdf2
#define float128_to_float32 __trunctfsf2
#define floatx80_to_float32 __truncxfsf2
#define float64_to_float32 __truncdfsf2
#if 0
#define float32_cmp __cmpsf2
#define float32_unord __unordsf2
#define float32_eq __eqsf2
#define float32_ne __nesf2
#define float32_ge __gesf2
#define float32_lt __ltsf2
#define float32_le __lesf2
#define float32_gt __gtsf2
#endif
#if 0
#define float64_cmp __cmpdf2
#define float64_unord __unorddf2
#define float64_eq __eqdf2
#define float64_ne __nedf2
#define float64_ge __gedf2
#define float64_lt __ltdf2
#define float64_le __ledf2
#define float64_gt __gtdf2
#endif
/* XXX not in libgcc */
#if 1
#define floatx80_cmp __cmpxf2
#define floatx80_unord __unordxf2
#define floatx80_eq __eqxf2
#define floatx80_ne __nexf2
#define floatx80_ge __gexf2
#define floatx80_lt __ltxf2
#define floatx80_le __lexf2
#define floatx80_gt __gtxf2
#endif
#if 0
#define float128_cmp __cmptf2
#define float128_unord __unordtf2
#define float128_eq __eqtf2
#define float128_ne __netf2
#define float128_ge __getf2
#define float128_lt __lttf2
#define float128_le __letf2
#define float128_gt __gttf2
#endif
diff --git a/lib/libc/softfloat/softfloat-specialize b/lib/libc/softfloat/softfloat-specialize
index b5eb8c34cdc8..13f2d6fa351a 100644
--- a/lib/libc/softfloat/softfloat-specialize
+++ b/lib/libc/softfloat/softfloat-specialize
@@ -1,521 +1,520 @@
/* $NetBSD: softfloat-specialize,v 1.6 2011/03/06 10:27:37 martin Exp $ */
-/* $FreeBSD$ */
/* This is a derivative work. */
/*
===============================================================================
This C source fragment is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
#include <signal.h>
#include <string.h>
#include <unistd.h>
/*
-------------------------------------------------------------------------------
Underflow tininess-detection mode, statically initialized to default value.
(The declaration in `softfloat.h' must match the `int8' type here.)
-------------------------------------------------------------------------------
*/
#ifdef SOFTFLOAT_FOR_GCC
static
#endif
#ifdef __sparc64__
int8 float_detect_tininess = float_tininess_before_rounding;
#else
int8 float_detect_tininess = float_tininess_after_rounding;
#endif
/*
-------------------------------------------------------------------------------
Raises the exceptions specified by `flags'. Floating-point traps can be
defined here if desired. It is currently not possible for such a trap to
substitute a result value. If traps are not implemented, this routine
should be simply `float_exception_flags |= flags;'.
-------------------------------------------------------------------------------
*/
#ifdef SOFTFLOAT_FOR_GCC
#define float_exception_mask __softfloat_float_exception_mask
#endif
int float_exception_mask = 0;
void float_raise( int flags )
{
float_exception_flags |= flags;
if ( flags & float_exception_mask ) {
#if 0
siginfo_t info;
memset(&info, 0, sizeof info);
info.si_signo = SIGFPE;
info.si_pid = getpid();
info.si_uid = geteuid();
if (flags & float_flag_underflow)
info.si_code = FPE_FLTUND;
else if (flags & float_flag_overflow)
info.si_code = FPE_FLTOVF;
else if (flags & float_flag_divbyzero)
info.si_code = FPE_FLTDIV;
else if (flags & float_flag_invalid)
info.si_code = FPE_FLTINV;
else if (flags & float_flag_inexact)
info.si_code = FPE_FLTRES;
sigqueueinfo(getpid(), &info);
#else
raise( SIGFPE );
#endif
}
}
#undef float_exception_mask
/*
-------------------------------------------------------------------------------
Internal canonical NaN format.
-------------------------------------------------------------------------------
*/
typedef struct {
flag sign;
bits64 high, low;
} commonNaNT;
/*
-------------------------------------------------------------------------------
The pattern for a default generated single-precision NaN.
-------------------------------------------------------------------------------
*/
#define float32_default_nan 0xFFFFFFFF
/*
-------------------------------------------------------------------------------
Returns 1 if the single-precision floating-point value `a' is a NaN;
otherwise returns 0.
-------------------------------------------------------------------------------
*/
#ifdef SOFTFLOAT_FOR_GCC
static
#endif
flag float32_is_nan( float32 a )
{
return ( 0xFF000000 < (bits32) ( a<<1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the single-precision floating-point value `a' is a signaling
NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
#if defined(SOFTFLOAT_FOR_GCC) && !defined(SOFTFLOATSPARC64_FOR_GCC) && \
!defined(SOFTFLOAT_M68K_FOR_GCC)
static
#endif
flag float32_is_signaling_nan( float32 a )
{
return ( ( ( a>>22 ) & 0x1FF ) == 0x1FE ) && ( a & 0x003FFFFF );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the single-precision floating-point NaN
`a' to the canonical NaN format. If `a' is a signaling NaN, the invalid
exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT float32ToCommonNaN( float32 a )
{
commonNaNT z;
if ( float32_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a>>31;
z.low = 0;
z.high = ( (bits64) a )<<41;
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the single-
precision floating-point format.
-------------------------------------------------------------------------------
*/
static float32 commonNaNToFloat32( commonNaNT a )
{
return ( ( (bits32) a.sign )<<31 ) | 0x7FC00000 | ( a.high>>41 );
}
/*
-------------------------------------------------------------------------------
Takes two single-precision floating-point values `a' and `b', one of which
is a NaN, and returns the appropriate NaN result. If either `a' or `b' is a
signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static float32 propagateFloat32NaN( float32 a, float32 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = float32_is_nan( a );
aIsSignalingNaN = float32_is_signaling_nan( a );
bIsNaN = float32_is_nan( b );
bIsSignalingNaN = float32_is_signaling_nan( b );
a |= 0x00400000;
b |= 0x00400000;
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
/*
-------------------------------------------------------------------------------
The pattern for a default generated double-precision NaN.
-------------------------------------------------------------------------------
*/
#define float64_default_nan LIT64( 0xFFFFFFFFFFFFFFFF )
/*
-------------------------------------------------------------------------------
Returns 1 if the double-precision floating-point value `a' is a NaN;
otherwise returns 0.
-------------------------------------------------------------------------------
*/
#ifdef SOFTFLOAT_FOR_GCC
static
#endif
flag float64_is_nan( float64 a )
{
return ( LIT64( 0xFFE0000000000000 ) <
(bits64) ( FLOAT64_DEMANGLE(a)<<1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the double-precision floating-point value `a' is a signaling
NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
#if defined(SOFTFLOAT_FOR_GCC) && !defined(SOFTFLOATSPARC64_FOR_GCC) && \
!defined(SOFTFLOATM68K_FOR_GCC)
static
#endif
flag float64_is_signaling_nan( float64 a )
{
return
( ( ( FLOAT64_DEMANGLE(a)>>51 ) & 0xFFF ) == 0xFFE )
&& ( FLOAT64_DEMANGLE(a) & LIT64( 0x0007FFFFFFFFFFFF ) );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the double-precision floating-point NaN
`a' to the canonical NaN format. If `a' is a signaling NaN, the invalid
exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT float64ToCommonNaN( float64 a )
{
commonNaNT z;
if ( float64_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = FLOAT64_DEMANGLE(a)>>63;
z.low = 0;
z.high = FLOAT64_DEMANGLE(a)<<12;
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the double-
precision floating-point format.
-------------------------------------------------------------------------------
*/
static float64 commonNaNToFloat64( commonNaNT a )
{
return FLOAT64_MANGLE(
( ( (bits64) a.sign )<<63 )
| LIT64( 0x7FF8000000000000 )
| ( a.high>>12 ) );
}
/*
-------------------------------------------------------------------------------
Takes two double-precision floating-point values `a' and `b', one of which
is a NaN, and returns the appropriate NaN result. If either `a' or `b' is a
signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static float64 propagateFloat64NaN( float64 a, float64 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = float64_is_nan( a );
aIsSignalingNaN = float64_is_signaling_nan( a );
bIsNaN = float64_is_nan( b );
bIsSignalingNaN = float64_is_signaling_nan( b );
a |= FLOAT64_MANGLE(LIT64( 0x0008000000000000 ));
b |= FLOAT64_MANGLE(LIT64( 0x0008000000000000 ));
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
The pattern for a default generated extended double-precision NaN. The
`high' and `low' values hold the most- and least-significant bits,
respectively.
-------------------------------------------------------------------------------
*/
#define floatx80_default_nan_high 0xFFFF
#define floatx80_default_nan_low LIT64( 0xFFFFFFFFFFFFFFFF )
/*
-------------------------------------------------------------------------------
Returns 1 if the extended double-precision floating-point value `a' is a
NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag floatx80_is_nan( floatx80 a )
{
return ( ( a.high & 0x7FFF ) == 0x7FFF ) && (bits64) ( a.low<<1 );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the extended double-precision floating-point value `a' is a
signaling NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag floatx80_is_signaling_nan( floatx80 a )
{
bits64 aLow;
aLow = a.low & ~ LIT64( 0x4000000000000000 );
return
( ( a.high & 0x7FFF ) == 0x7FFF )
&& (bits64) ( aLow<<1 )
&& ( a.low == aLow );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the extended double-precision floating-
point NaN `a' to the canonical NaN format. If `a' is a signaling NaN, the
invalid exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT floatx80ToCommonNaN( floatx80 a )
{
commonNaNT z;
if ( floatx80_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a.high>>15;
z.low = 0;
z.high = a.low<<1;
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the extended
double-precision floating-point format.
-------------------------------------------------------------------------------
*/
static floatx80 commonNaNToFloatx80( commonNaNT a )
{
floatx80 z;
z.low = LIT64( 0xC000000000000000 ) | ( a.high>>1 );
z.high = ( ( (bits16) a.sign )<<15 ) | 0x7FFF;
return z;
}
/*
-------------------------------------------------------------------------------
Takes two extended double-precision floating-point values `a' and `b', one
of which is a NaN, and returns the appropriate NaN result. If either `a' or
`b' is a signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static floatx80 propagateFloatx80NaN( floatx80 a, floatx80 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = floatx80_is_nan( a );
aIsSignalingNaN = floatx80_is_signaling_nan( a );
bIsNaN = floatx80_is_nan( b );
bIsSignalingNaN = floatx80_is_signaling_nan( b );
a.low |= LIT64( 0xC000000000000000 );
b.low |= LIT64( 0xC000000000000000 );
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
The pattern for a default generated quadruple-precision NaN. The `high' and
`low' values hold the most- and least-significant bits, respectively.
-------------------------------------------------------------------------------
*/
#define float128_default_nan_high LIT64( 0xFFFFFFFFFFFFFFFF )
#define float128_default_nan_low LIT64( 0xFFFFFFFFFFFFFFFF )
/*
-------------------------------------------------------------------------------
Returns 1 if the quadruple-precision floating-point value `a' is a NaN;
otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float128_is_nan( float128 a )
{
return
( LIT64( 0xFFFE000000000000 ) <= (bits64) ( a.high<<1 ) )
&& ( a.low || ( a.high & LIT64( 0x0000FFFFFFFFFFFF ) ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the quadruple-precision floating-point value `a' is a
signaling NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float128_is_signaling_nan( float128 a )
{
return
( ( ( a.high>>47 ) & 0xFFFF ) == 0xFFFE )
&& ( a.low || ( a.high & LIT64( 0x00007FFFFFFFFFFF ) ) );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the quadruple-precision floating-point NaN
`a' to the canonical NaN format. If `a' is a signaling NaN, the invalid
exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT float128ToCommonNaN( float128 a )
{
commonNaNT z;
if ( float128_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a.high>>63;
shortShift128Left( a.high, a.low, 16, &z.high, &z.low );
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the quadruple-
precision floating-point format.
-------------------------------------------------------------------------------
*/
static float128 commonNaNToFloat128( commonNaNT a )
{
float128 z;
shift128Right( a.high, a.low, 16, &z.high, &z.low );
z.high |= ( ( (bits64) a.sign )<<63 ) | LIT64( 0x7FFF800000000000 );
return z;
}
/*
-------------------------------------------------------------------------------
Takes two quadruple-precision floating-point values `a' and `b', one of
which is a NaN, and returns the appropriate NaN result. If either `a' or
`b' is a signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static float128 propagateFloat128NaN( float128 a, float128 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = float128_is_nan( a );
aIsSignalingNaN = float128_is_signaling_nan( a );
bIsNaN = float128_is_nan( b );
bIsSignalingNaN = float128_is_signaling_nan( b );
a.high |= LIT64( 0x0000800000000000 );
b.high |= LIT64( 0x0000800000000000 );
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
#endif
diff --git a/lib/libc/softfloat/templates/milieu.h b/lib/libc/softfloat/templates/milieu.h
index 914efdf4fe7b..8a6414a8c86e 100644
--- a/lib/libc/softfloat/templates/milieu.h
+++ b/lib/libc/softfloat/templates/milieu.h
@@ -1,49 +1,48 @@
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Include common integer types and flags.
-------------------------------------------------------------------------------
*/
#include "../../../processors/!!!processor.h"
/*
-------------------------------------------------------------------------------
Symbolic Boolean literals.
-------------------------------------------------------------------------------
*/
enum {
FALSE = 0,
TRUE = 1
};
diff --git a/lib/libc/softfloat/templates/softfloat-specialize b/lib/libc/softfloat/templates/softfloat-specialize
index b1a39021734f..07eea64ddcc3 100644
--- a/lib/libc/softfloat/templates/softfloat-specialize
+++ b/lib/libc/softfloat/templates/softfloat-specialize
@@ -1,465 +1,464 @@
-/* $FreeBSD$ */
/*
===============================================================================
This C source fragment is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
Underflow tininess-detection mode, statically initialized to default value.
(The declaration in `softfloat.h' must match the `int8' type here.)
-------------------------------------------------------------------------------
*/
int8 float_detect_tininess = float_tininess_after_rounding;
/*
-------------------------------------------------------------------------------
Raises the exceptions specified by `flags'. Floating-point traps can be
defined here if desired. It is currently not possible for such a trap to
substitute a result value. If traps are not implemented, this routine
should be simply `float_exception_flags |= flags;'.
-------------------------------------------------------------------------------
*/
void float_raise( int8 flags )
{
float_exception_flags |= flags;
}
/*
-------------------------------------------------------------------------------
Internal canonical NaN format.
-------------------------------------------------------------------------------
*/
typedef struct {
flag sign;
bits64 high, low;
} commonNaNT;
/*
-------------------------------------------------------------------------------
The pattern for a default generated single-precision NaN.
-------------------------------------------------------------------------------
*/
#define float32_default_nan 0xFFFFFFFF
/*
-------------------------------------------------------------------------------
Returns 1 if the single-precision floating-point value `a' is a NaN;
otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float32_is_nan( float32 a )
{
return ( 0xFF000000 < (bits32) ( a<<1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the single-precision floating-point value `a' is a signaling
NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float32_is_signaling_nan( float32 a )
{
return ( ( ( a>>22 ) & 0x1FF ) == 0x1FE ) && ( a & 0x003FFFFF );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the single-precision floating-point NaN
`a' to the canonical NaN format. If `a' is a signaling NaN, the invalid
exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT float32ToCommonNaN( float32 a )
{
commonNaNT z;
if ( float32_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a>>31;
z.low = 0;
z.high = ( (bits64) a )<<41;
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the single-
precision floating-point format.
-------------------------------------------------------------------------------
*/
static float32 commonNaNToFloat32( commonNaNT a )
{
return ( ( (bits32) a.sign )<<31 ) | 0x7FC00000 | ( a.high>>41 );
}
/*
-------------------------------------------------------------------------------
Takes two single-precision floating-point values `a' and `b', one of which
is a NaN, and returns the appropriate NaN result. If either `a' or `b' is a
signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static float32 propagateFloat32NaN( float32 a, float32 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = float32_is_nan( a );
aIsSignalingNaN = float32_is_signaling_nan( a );
bIsNaN = float32_is_nan( b );
bIsSignalingNaN = float32_is_signaling_nan( b );
a |= 0x00400000;
b |= 0x00400000;
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
/*
-------------------------------------------------------------------------------
The pattern for a default generated double-precision NaN.
-------------------------------------------------------------------------------
*/
#define float64_default_nan LIT64( 0xFFFFFFFFFFFFFFFF )
/*
-------------------------------------------------------------------------------
Returns 1 if the double-precision floating-point value `a' is a NaN;
otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float64_is_nan( float64 a )
{
return ( LIT64( 0xFFE0000000000000 ) < (bits64) ( a<<1 ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the double-precision floating-point value `a' is a signaling
NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float64_is_signaling_nan( float64 a )
{
return
( ( ( a>>51 ) & 0xFFF ) == 0xFFE )
&& ( a & LIT64( 0x0007FFFFFFFFFFFF ) );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the double-precision floating-point NaN
`a' to the canonical NaN format. If `a' is a signaling NaN, the invalid
exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT float64ToCommonNaN( float64 a )
{
commonNaNT z;
if ( float64_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a>>63;
z.low = 0;
z.high = a<<12;
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the double-
precision floating-point format.
-------------------------------------------------------------------------------
*/
static float64 commonNaNToFloat64( commonNaNT a )
{
return
( ( (bits64) a.sign )<<63 )
| LIT64( 0x7FF8000000000000 )
| ( a.high>>12 );
}
/*
-------------------------------------------------------------------------------
Takes two double-precision floating-point values `a' and `b', one of which
is a NaN, and returns the appropriate NaN result. If either `a' or `b' is a
signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static float64 propagateFloat64NaN( float64 a, float64 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = float64_is_nan( a );
aIsSignalingNaN = float64_is_signaling_nan( a );
bIsNaN = float64_is_nan( b );
bIsSignalingNaN = float64_is_signaling_nan( b );
a |= LIT64( 0x0008000000000000 );
b |= LIT64( 0x0008000000000000 );
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
The pattern for a default generated extended double-precision NaN. The
`high' and `low' values hold the most- and least-significant bits,
respectively.
-------------------------------------------------------------------------------
*/
#define floatx80_default_nan_high 0xFFFF
#define floatx80_default_nan_low LIT64( 0xFFFFFFFFFFFFFFFF )
/*
-------------------------------------------------------------------------------
Returns 1 if the extended double-precision floating-point value `a' is a
NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag floatx80_is_nan( floatx80 a )
{
return ( ( a.high & 0x7FFF ) == 0x7FFF ) && (bits64) ( a.low<<1 );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the extended double-precision floating-point value `a' is a
signaling NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag floatx80_is_signaling_nan( floatx80 a )
{
bits64 aLow;
aLow = a.low & ~ LIT64( 0x4000000000000000 );
return
( ( a.high & 0x7FFF ) == 0x7FFF )
&& (bits64) ( aLow<<1 )
&& ( a.low == aLow );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the extended double-precision floating-
point NaN `a' to the canonical NaN format. If `a' is a signaling NaN, the
invalid exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT floatx80ToCommonNaN( floatx80 a )
{
commonNaNT z;
if ( floatx80_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a.high>>15;
z.low = 0;
z.high = a.low<<1;
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the extended
double-precision floating-point format.
-------------------------------------------------------------------------------
*/
static floatx80 commonNaNToFloatx80( commonNaNT a )
{
floatx80 z;
z.low = LIT64( 0xC000000000000000 ) | ( a.high>>1 );
z.high = ( ( (bits16) a.sign )<<15 ) | 0x7FFF;
return z;
}
/*
-------------------------------------------------------------------------------
Takes two extended double-precision floating-point values `a' and `b', one
of which is a NaN, and returns the appropriate NaN result. If either `a' or
`b' is a signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static floatx80 propagateFloatx80NaN( floatx80 a, floatx80 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = floatx80_is_nan( a );
aIsSignalingNaN = floatx80_is_signaling_nan( a );
bIsNaN = floatx80_is_nan( b );
bIsSignalingNaN = floatx80_is_signaling_nan( b );
a.low |= LIT64( 0xC000000000000000 );
b.low |= LIT64( 0xC000000000000000 );
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
The pattern for a default generated quadruple-precision NaN. The `high' and
`low' values hold the most- and least-significant bits, respectively.
-------------------------------------------------------------------------------
*/
#define float128_default_nan_high LIT64( 0xFFFFFFFFFFFFFFFF )
#define float128_default_nan_low LIT64( 0xFFFFFFFFFFFFFFFF )
/*
-------------------------------------------------------------------------------
Returns 1 if the quadruple-precision floating-point value `a' is a NaN;
otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float128_is_nan( float128 a )
{
return
( LIT64( 0xFFFE000000000000 ) <= (bits64) ( a.high<<1 ) )
&& ( a.low || ( a.high & LIT64( 0x0000FFFFFFFFFFFF ) ) );
}
/*
-------------------------------------------------------------------------------
Returns 1 if the quadruple-precision floating-point value `a' is a
signaling NaN; otherwise returns 0.
-------------------------------------------------------------------------------
*/
flag float128_is_signaling_nan( float128 a )
{
return
( ( ( a.high>>47 ) & 0xFFFF ) == 0xFFFE )
&& ( a.low || ( a.high & LIT64( 0x00007FFFFFFFFFFF ) ) );
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the quadruple-precision floating-point NaN
`a' to the canonical NaN format. If `a' is a signaling NaN, the invalid
exception is raised.
-------------------------------------------------------------------------------
*/
static commonNaNT float128ToCommonNaN( float128 a )
{
commonNaNT z;
if ( float128_is_signaling_nan( a ) ) float_raise( float_flag_invalid );
z.sign = a.high>>63;
shortShift128Left( a.high, a.low, 16, &z.high, &z.low );
return z;
}
/*
-------------------------------------------------------------------------------
Returns the result of converting the canonical NaN `a' to the quadruple-
precision floating-point format.
-------------------------------------------------------------------------------
*/
static float128 commonNaNToFloat128( commonNaNT a )
{
float128 z;
shift128Right( a.high, a.low, 16, &z.high, &z.low );
z.high |= ( ( (bits64) a.sign )<<63 ) | LIT64( 0x7FFF800000000000 );
return z;
}
/*
-------------------------------------------------------------------------------
Takes two quadruple-precision floating-point values `a' and `b', one of
which is a NaN, and returns the appropriate NaN result. If either `a' or
`b' is a signaling NaN, the invalid exception is raised.
-------------------------------------------------------------------------------
*/
static float128 propagateFloat128NaN( float128 a, float128 b )
{
flag aIsNaN, aIsSignalingNaN, bIsNaN, bIsSignalingNaN;
aIsNaN = float128_is_nan( a );
aIsSignalingNaN = float128_is_signaling_nan( a );
bIsNaN = float128_is_nan( b );
bIsSignalingNaN = float128_is_signaling_nan( b );
a.high |= LIT64( 0x0000800000000000 );
b.high |= LIT64( 0x0000800000000000 );
if ( aIsSignalingNaN | bIsSignalingNaN ) float_raise( float_flag_invalid );
if ( aIsNaN ) {
return ( aIsSignalingNaN & bIsNaN ) ? b : a;
}
else {
return b;
}
}
#endif
diff --git a/lib/libc/softfloat/templates/softfloat.h b/lib/libc/softfloat/templates/softfloat.h
index fd83aa43f133..aaf84e6842a0 100644
--- a/lib/libc/softfloat/templates/softfloat.h
+++ b/lib/libc/softfloat/templates/softfloat.h
@@ -1,291 +1,290 @@
-/* $FreeBSD$ */
/*
===============================================================================
This C header file is part of the SoftFloat IEC/IEEE Floating-point
Arithmetic Package, Release 2a.
Written by John R. Hauser. This work was made possible in part by the
International Computer Science Institute, located at Suite 600, 1947 Center
Street, Berkeley, California 94704. Funding was partially provided by the
National Science Foundation under grant MIP-9311980. The original version
of this code was written as part of a project to build a fixed-point vector
processor in collaboration with the University of California at Berkeley,
overseen by Profs. Nelson Morgan and John Wawrzynek. More information
is available through the Web page `http://HTTP.CS.Berkeley.EDU/~jhauser/
arithmetic/SoftFloat.html'.
THIS SOFTWARE IS DISTRIBUTED AS IS, FOR FREE. Although reasonable effort
has been made to avoid it, THIS SOFTWARE MAY CONTAIN FAULTS THAT WILL AT
TIMES RESULT IN INCORRECT BEHAVIOR. USE OF THIS SOFTWARE IS RESTRICTED TO
PERSONS AND ORGANIZATIONS WHO CAN AND WILL TAKE FULL RESPONSIBILITY FOR ANY
AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
Derivative works are acceptable, even for commercial purposes, so long as
(1) they include prominent notice that the work is derivative, and (2) they
include prominent notice akin to these four paragraphs for those parts of
this code that are retained.
===============================================================================
*/
/*
-------------------------------------------------------------------------------
The macro `FLOATX80' must be defined to enable the extended double-precision
floating-point format `floatx80'. If this macro is not defined, the
`floatx80' type will not be defined, and none of the functions that either
input or output the `floatx80' type will be defined. The same applies to
the `FLOAT128' macro and the quadruple-precision format `float128'.
-------------------------------------------------------------------------------
*/
#define FLOATX80
#define FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point types.
-------------------------------------------------------------------------------
*/
typedef !!!bits32 float32;
typedef !!!bits64 float64;
#ifdef FLOATX80
typedef struct {
!!!bits16 high;
!!!bits64 low;
} floatx80;
#endif
#ifdef FLOAT128
typedef struct {
!!!bits64 high, low;
} float128;
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point underflow tininess-detection mode.
-------------------------------------------------------------------------------
*/
extern !!!int8 float_detect_tininess;
enum {
float_tininess_after_rounding = 0,
float_tininess_before_rounding = 1
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point rounding mode.
-------------------------------------------------------------------------------
*/
extern !!!int8 float_rounding_mode;
enum {
float_round_nearest_even = 0,
float_round_to_zero = 1,
float_round_down = 2,
float_round_up = 3
};
/*
-------------------------------------------------------------------------------
Software IEC/IEEE floating-point exception flags.
-------------------------------------------------------------------------------
*/
extern !!!int8 float_exception_flags;
enum {
float_flag_inexact = 1,
float_flag_underflow = 2,
float_flag_overflow = 4,
float_flag_divbyzero = 8,
float_flag_invalid = 16
};
/*
-------------------------------------------------------------------------------
Routine to raise any or all of the software IEC/IEEE floating-point
exception flags.
-------------------------------------------------------------------------------
*/
void float_raise( !!!int8 );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE integer-to-floating-point conversion routines.
-------------------------------------------------------------------------------
*/
float32 int32_to_float32( !!!int32 );
float64 int32_to_float64( !!!int32 );
#ifdef FLOATX80
floatx80 int32_to_floatx80( !!!int32 );
#endif
#ifdef FLOAT128
float128 int32_to_float128( !!!int32 );
#endif
float32 int64_to_float32( !!!int64 );
float64 int64_to_float64( !!!int64 );
#ifdef FLOATX80
floatx80 int64_to_floatx80( !!!int64 );
#endif
#ifdef FLOAT128
float128 int64_to_float128( !!!int64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision conversion routines.
-------------------------------------------------------------------------------
*/
!!!int32 float32_to_int32( float32 );
!!!int32 float32_to_int32_round_to_zero( float32 );
!!!int64 float32_to_int64( float32 );
!!!int64 float32_to_int64_round_to_zero( float32 );
float64 float32_to_float64( float32 );
#ifdef FLOATX80
floatx80 float32_to_floatx80( float32 );
#endif
#ifdef FLOAT128
float128 float32_to_float128( float32 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE single-precision operations.
-------------------------------------------------------------------------------
*/
float32 float32_round_to_int( float32 );
float32 float32_add( float32, float32 );
float32 float32_sub( float32, float32 );
float32 float32_mul( float32, float32 );
float32 float32_div( float32, float32 );
float32 float32_rem( float32, float32 );
float32 float32_sqrt( float32 );
!!!flag float32_eq( float32, float32 );
!!!flag float32_le( float32, float32 );
!!!flag float32_lt( float32, float32 );
!!!flag float32_eq_signaling( float32, float32 );
!!!flag float32_le_quiet( float32, float32 );
!!!flag float32_lt_quiet( float32, float32 );
!!!flag float32_is_signaling_nan( float32 );
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision conversion routines.
-------------------------------------------------------------------------------
*/
!!!int32 float64_to_int32( float64 );
!!!int32 float64_to_int32_round_to_zero( float64 );
!!!int64 float64_to_int64( float64 );
!!!int64 float64_to_int64_round_to_zero( float64 );
float32 float64_to_float32( float64 );
#ifdef FLOATX80
floatx80 float64_to_floatx80( float64 );
#endif
#ifdef FLOAT128
float128 float64_to_float128( float64 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE double-precision operations.
-------------------------------------------------------------------------------
*/
float64 float64_round_to_int( float64 );
float64 float64_add( float64, float64 );
float64 float64_sub( float64, float64 );
float64 float64_mul( float64, float64 );
float64 float64_div( float64, float64 );
float64 float64_rem( float64, float64 );
float64 float64_sqrt( float64 );
!!!flag float64_eq( float64, float64 );
!!!flag float64_le( float64, float64 );
!!!flag float64_lt( float64, float64 );
!!!flag float64_eq_signaling( float64, float64 );
!!!flag float64_le_quiet( float64, float64 );
!!!flag float64_lt_quiet( float64, float64 );
!!!flag float64_is_signaling_nan( float64 );
#ifdef FLOATX80
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision conversion routines.
-------------------------------------------------------------------------------
*/
!!!int32 floatx80_to_int32( floatx80 );
!!!int32 floatx80_to_int32_round_to_zero( floatx80 );
!!!int64 floatx80_to_int64( floatx80 );
!!!int64 floatx80_to_int64_round_to_zero( floatx80 );
float32 floatx80_to_float32( floatx80 );
float64 floatx80_to_float64( floatx80 );
#ifdef FLOAT128
float128 floatx80_to_float128( floatx80 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision rounding precision. Valid
values are 32, 64, and 80.
-------------------------------------------------------------------------------
*/
extern !!!int8 floatx80_rounding_precision;
/*
-------------------------------------------------------------------------------
Software IEC/IEEE extended double-precision operations.
-------------------------------------------------------------------------------
*/
floatx80 floatx80_round_to_int( floatx80 );
floatx80 floatx80_add( floatx80, floatx80 );
floatx80 floatx80_sub( floatx80, floatx80 );
floatx80 floatx80_mul( floatx80, floatx80 );
floatx80 floatx80_div( floatx80, floatx80 );
floatx80 floatx80_rem( floatx80, floatx80 );
floatx80 floatx80_sqrt( floatx80 );
!!!flag floatx80_eq( floatx80, floatx80 );
!!!flag floatx80_le( floatx80, floatx80 );
!!!flag floatx80_lt( floatx80, floatx80 );
!!!flag floatx80_eq_signaling( floatx80, floatx80 );
!!!flag floatx80_le_quiet( floatx80, floatx80 );
!!!flag floatx80_lt_quiet( floatx80, floatx80 );
!!!flag floatx80_is_signaling_nan( floatx80 );
#endif
#ifdef FLOAT128
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision conversion routines.
-------------------------------------------------------------------------------
*/
!!!int32 float128_to_int32( float128 );
!!!int32 float128_to_int32_round_to_zero( float128 );
!!!int64 float128_to_int64( float128 );
!!!int64 float128_to_int64_round_to_zero( float128 );
float32 float128_to_float32( float128 );
float64 float128_to_float64( float128 );
#ifdef FLOATX80
floatx80 float128_to_floatx80( float128 );
#endif
/*
-------------------------------------------------------------------------------
Software IEC/IEEE quadruple-precision operations.
-------------------------------------------------------------------------------
*/
float128 float128_round_to_int( float128 );
float128 float128_add( float128, float128 );
float128 float128_sub( float128, float128 );
float128 float128_mul( float128, float128 );
float128 float128_div( float128, float128 );
float128 float128_rem( float128, float128 );
float128 float128_sqrt( float128 );
!!!flag float128_eq( float128, float128 );
!!!flag float128_le( float128, float128 );
!!!flag float128_lt( float128, float128 );
!!!flag float128_eq_signaling( float128, float128 );
!!!flag float128_le_quiet( float128, float128 );
!!!flag float128_lt_quiet( float128, float128 );
!!!flag float128_is_signaling_nan( float128 );
#endif
diff --git a/lib/libc/tests/resolv/resolv_test.c b/lib/libc/tests/resolv/resolv_test.c
index 4f17469fa0cb..d7b836ed8f3e 100644
--- a/lib/libc/tests/resolv/resolv_test.c
+++ b/lib/libc/tests/resolv/resolv_test.c
@@ -1,355 +1,354 @@
/* $NetBSD: resolv.c,v 1.6 2004/05/23 16:59:11 christos Exp $ */
/*-
* Copyright (c) 2004 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Christos Zoulas.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: resolv.c,v 1.6 2004/05/23 16:59:11 christos Exp $");
#include <sys/types.h>
#include <sys/socket.h>
#include <assert.h>
#include <errno.h>
#include <pthread.h>
#include <stdio.h>
#include <stdatomic.h>
#include <netdb.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <stringlist.h>
#include <atf-c.h>
#define NTHREADS 10
#define NHOSTS 100
#define WS " \t\n\r"
enum method {
METHOD_GETADDRINFO,
METHOD_GETHOSTBY,
METHOD_GETIPNODEBY
};
static StringList *hosts = NULL;
static _Atomic(int) *ask = NULL;
static _Atomic(int) *got = NULL;
static bool debug_output = 0;
static void load(const char *);
static void resolvone(long, int, enum method);
static void *resolvloop(void *);
static pthread_t run(int, enum method, long);
#define DBG(...) do { \
if (debug_output) \
dprintf(STDOUT_FILENO, __VA_ARGS__); \
} while (0)
static void
load(const char *fname)
{
FILE *fp;
size_t linecap;
char *line;
fp = fopen(fname, "r");
ATF_REQUIRE(fp != NULL);
line = NULL;
linecap = 0;
while (getline(&line, &linecap, fp) >= 0) {
char *ptr;
for (ptr = strtok(line, WS); ptr; ptr = strtok(NULL, WS)) {
if (ptr[0] == '#')
break;
sl_add(hosts, strdup(ptr));
}
}
free(line);
(void)fclose(fp);
}
static int
resolv_getaddrinfo(long threadnum, char *host, int port, const char **errstr)
{
char portstr[6], hbuf[NI_MAXHOST], pbuf[NI_MAXSERV];
struct addrinfo hints, *res;
int error;
snprintf(portstr, sizeof(portstr), "%d", port);
memset(&hints, 0, sizeof(hints));
hints.ai_family = AF_UNSPEC;
hints.ai_flags = AI_PASSIVE;
hints.ai_socktype = SOCK_STREAM;
error = getaddrinfo(host, portstr, &hints, &res);
if (error == 0) {
DBG("T%ld: host %s ok\n", threadnum, host);
memset(hbuf, 0, sizeof(hbuf));
memset(pbuf, 0, sizeof(pbuf));
getnameinfo(res->ai_addr, res->ai_addrlen, hbuf, sizeof(hbuf),
pbuf, sizeof(pbuf), 0);
DBG("T%ld: reverse %s %s\n", threadnum, hbuf, pbuf);
freeaddrinfo(res);
} else {
*errstr = gai_strerror(error);
DBG("T%ld: host %s not found: %s\n", threadnum, host, *errstr);
}
return error;
}
static int
resolv_gethostby(long threadnum, char *host, const char **errstr)
{
char buf[1024];
struct hostent *hp, *hp2;
hp = gethostbyname(host);
if (hp) {
DBG("T%ld: host %s ok\n", threadnum, host);
memcpy(buf, hp->h_addr, hp->h_length);
hp2 = gethostbyaddr(buf, hp->h_length, hp->h_addrtype);
if (hp2) {
DBG("T%ld: reverse %s\n", threadnum, hp2->h_name);
}
} else {
*errstr = hstrerror(h_errno);
DBG("T%ld: host %s not found: %s\n", threadnum, host, *errstr);
}
return hp ? 0 : h_errno;
}
static int
resolv_getipnodeby(long threadnum, char *host, const char **errstr)
{
char buf[1024];
struct hostent *hp, *hp2;
int error = 0;
hp = getipnodebyname(host, AF_INET, 0, &error);
if (hp) {
DBG("T%ld: host %s ok\n", threadnum, host);
memcpy(buf, hp->h_addr, hp->h_length);
hp2 = getipnodebyaddr(buf, hp->h_length, hp->h_addrtype,
&error);
if (hp2) {
DBG("T%ld: reverse %s\n", threadnum, hp2->h_name);
freehostent(hp2);
}
freehostent(hp);
} else {
*errstr = hstrerror(error);
DBG("T%ld: host %s not found: %s\n", threadnum, host, *errstr);
}
return hp ? 0 : error;
}
static void
resolvone(long threadnum, int n, enum method method)
{
const char* errstr = NULL;
size_t i = (random() & 0x0fffffff) % hosts->sl_cur;
char *host = hosts->sl_str[i];
int error;
DBG("T%ld: %d resolving %s %zd\n", threadnum, n, host, i);
switch (method) {
case METHOD_GETADDRINFO:
error = resolv_getaddrinfo(threadnum, host, i, &errstr);
break;
case METHOD_GETHOSTBY:
error = resolv_gethostby(threadnum, host, &errstr);
break;
case METHOD_GETIPNODEBY:
error = resolv_getipnodeby(threadnum, host, &errstr);
break;
default:
/* UNREACHABLE */
/* XXX Needs an __assert_unreachable() for userland. */
assert(0 && "Unreachable segment reached");
abort();
break;
}
atomic_fetch_add_explicit(&ask[i], 1, memory_order_relaxed);
if (error == 0)
atomic_fetch_add_explicit(&got[i], 1, memory_order_relaxed);
else if (got[i] != 0)
fprintf(stderr,
"T%ld ERROR after previous success for %s: %d (%s)\n",
threadnum, hosts->sl_str[i], error, errstr);
}
struct resolvloop_args {
int nhosts;
enum method method;
long threadnum;
};
static void *
resolvloop(void *p)
{
struct resolvloop_args *args = p;
int nhosts = args->nhosts;
if (nhosts == 0) {
free(args);
return NULL;
}
do {
resolvone(args->threadnum, nhosts, args->method);
} while (--nhosts);
free(args);
return (void *)(uintptr_t)nhosts;
}
static pthread_t
run(int nhosts, enum method method, long i)
{
pthread_t t;
int rc;
struct resolvloop_args *args;
/* Created thread is responsible for free(). */
args = malloc(sizeof(*args));
ATF_REQUIRE(args != NULL);
args->nhosts = nhosts;
args->method = method;
args->threadnum = i + 1;
rc = pthread_create(&t, NULL, resolvloop, args);
ATF_REQUIRE_MSG(rc == 0, "pthread_create failed: %s", strerror(rc));
return t;
}
static int
run_tests(const char *hostlist_file, enum method method)
{
size_t nthreads = NTHREADS;
pthread_t *threads;
size_t nhosts = NHOSTS;
size_t i;
int c;
hosts = sl_init();
srandom(1234);
debug_output = getenv("DEBUG_OUTPUT") != NULL;
load(hostlist_file);
ATF_REQUIRE_MSG(0 < hosts->sl_cur, "0 hosts in %s", hostlist_file);
ask = calloc(hosts->sl_cur, sizeof(int));
ATF_REQUIRE(ask != NULL);
got = calloc(hosts->sl_cur, sizeof(int));
ATF_REQUIRE(got != NULL);
threads = calloc(nthreads, sizeof(pthread_t));
ATF_REQUIRE(threads != NULL);
for (i = 0; i < nthreads; i++) {
threads[i] = run(nhosts, method, i);
}
/* Wait for all threads to join and check that they checked all hosts */
for (i = 0; i < nthreads; i++) {
size_t remaining;
remaining = (uintptr_t)pthread_join(threads[i], NULL);
ATF_CHECK_EQ_MSG(0, remaining,
"Thread %zd still had %zd hosts to check!", i, remaining);
}
c = 0;
for (i = 0; i < hosts->sl_cur; i++) {
if (got[i] != 0) {
ATF_CHECK_EQ_MSG(ask[i], got[i],
"Error: host %s ask %d got %d", hosts->sl_str[i],
ask[i], got[i]);
c += ask[i] != got[i];
}
}
free(threads);
free(ask);
free(got);
sl_free(hosts, 1);
return c;
}
#define HOSTLIST_FILE "mach"
#define RUN_TESTS(tc, method) \
do { \
char *_hostlist_file; \
ATF_REQUIRE(0 < asprintf(&_hostlist_file, "%s/%s", \
atf_tc_get_config_var(tc, "srcdir"), HOSTLIST_FILE)); \
ATF_REQUIRE(run_tests(_hostlist_file, method) == 0); \
} while(0)
ATF_TC(getaddrinfo_test);
ATF_TC_HEAD(getaddrinfo_test, tc) {
atf_tc_set_md_var(tc, "timeout", "1200");
}
ATF_TC_BODY(getaddrinfo_test, tc)
{
RUN_TESTS(tc, METHOD_GETADDRINFO);
}
ATF_TC(gethostby_test);
ATF_TC_HEAD(gethostby_test, tc) {
atf_tc_set_md_var(tc, "timeout", "1200");
}
ATF_TC_BODY(gethostby_test, tc)
{
RUN_TESTS(tc, METHOD_GETHOSTBY);
}
ATF_TC(getipnodeby_test);
ATF_TC_HEAD(getipnodeby_test, tc) {
atf_tc_set_md_var(tc, "timeout", "1200");
}
ATF_TC_BODY(getipnodeby_test, tc)
{
RUN_TESTS(tc, METHOD_GETIPNODEBY);
}
ATF_TP_ADD_TCS(tp)
{
ATF_TP_ADD_TC(tp, getaddrinfo_test);
ATF_TP_ADD_TC(tp, gethostby_test);
ATF_TP_ADD_TC(tp, getipnodeby_test);
return (atf_no_error());
}
diff --git a/lib/libcuse/cuse.h b/lib/libcuse/cuse.h
index f82401b98bf3..acc19c2ca663 100644
--- a/lib/libcuse/cuse.h
+++ b/lib/libcuse/cuse.h
@@ -1,97 +1,96 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2014 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CUSE_H_
#define _CUSE_H_
#ifdef __cplusplus
extern "C" {
#endif
#include <fs/cuse/cuse_defs.h>
struct cuse_dev;
typedef int (cuse_open_t)(struct cuse_dev *, int fflags);
typedef int (cuse_close_t)(struct cuse_dev *, int fflags);
typedef int (cuse_read_t)(struct cuse_dev *, int fflags, void *user_ptr, int len);
typedef int (cuse_write_t)(struct cuse_dev *, int fflags, const void *user_ptr, int len);
typedef int (cuse_ioctl_t)(struct cuse_dev *, int fflags, unsigned long cmd, void *user_data);
typedef int (cuse_poll_t)(struct cuse_dev *, int fflags, int events);
struct cuse_methods {
cuse_open_t *cm_open;
cuse_close_t *cm_close;
cuse_read_t *cm_read;
cuse_write_t *cm_write;
cuse_ioctl_t *cm_ioctl;
cuse_poll_t *cm_poll;
};
int cuse_init(void);
int cuse_uninit(void);
void *cuse_vmalloc(unsigned);
int cuse_is_vmalloc_addr(void *);
void cuse_vmfree(void *);
unsigned long cuse_vmoffset(void *ptr);
int cuse_alloc_unit_number_by_id(int *, int);
int cuse_free_unit_number_by_id(int, int);
int cuse_alloc_unit_number(int *);
int cuse_free_unit_number(int);
struct cuse_dev *cuse_dev_create(const struct cuse_methods *, void *, void *, uid_t, gid_t, int, const char *,...);
void cuse_dev_destroy(struct cuse_dev *);
void *cuse_dev_get_priv0(struct cuse_dev *);
void *cuse_dev_get_priv1(struct cuse_dev *);
void cuse_dev_set_priv0(struct cuse_dev *, void *);
void cuse_dev_set_priv1(struct cuse_dev *, void *);
void cuse_set_local(int);
int cuse_get_local(void);
int cuse_wait_and_process(void);
void cuse_dev_set_per_file_handle(struct cuse_dev *, void *);
void *cuse_dev_get_per_file_handle(struct cuse_dev *);
int cuse_copy_out(const void *src, void *user_dst, int len);
int cuse_copy_in(const void *user_src, void *dst, int len);
int cuse_got_peer_signal(void);
void cuse_poll_wakeup(void);
struct cuse_dev *cuse_dev_get_current(int *);
extern int cuse_debug_level;
#ifdef __cplusplus
}
#endif
#endif /* _CUSE_H_ */
diff --git a/lib/libcuse/cuse_lib.c b/lib/libcuse/cuse_lib.c
index 2653ed3067d5..3f040d0eeeda 100644
--- a/lib/libcuse/cuse_lib.c
+++ b/lib/libcuse/cuse_lib.c
@@ -1,795 +1,794 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2010-2022 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdint.h>
#include <pthread.h>
#include <signal.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
#include <stdarg.h>
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/fcntl.h>
#include <sys/mman.h>
#include <sys/param.h>
#include <fs/cuse/cuse_ioctl.h>
#include "cuse.h"
int cuse_debug_level;
#ifdef HAVE_DEBUG
static const char *cuse_cmd_str(int cmd);
#define DPRINTF(...) do { \
if (cuse_debug_level != 0) \
printf(__VA_ARGS__); \
} while (0)
#else
#define DPRINTF(...) do { } while (0)
#endif
struct cuse_vm_allocation {
uint8_t *ptr;
uint32_t size;
};
struct cuse_dev_entered {
TAILQ_ENTRY(cuse_dev_entered) entry;
pthread_t thread;
void *per_file_handle;
struct cuse_dev *cdev;
int cmd;
int is_local;
int got_signal;
};
struct cuse_dev {
TAILQ_ENTRY(cuse_dev) entry;
const struct cuse_methods *mtod;
void *priv0;
void *priv1;
};
static int f_cuse = -1;
static pthread_mutex_t m_cuse;
static TAILQ_HEAD(, cuse_dev) h_cuse __guarded_by(m_cuse);
static TAILQ_HEAD(, cuse_dev_entered) h_cuse_entered __guarded_by(m_cuse);
static struct cuse_vm_allocation a_cuse[CUSE_ALLOC_UNIT_MAX]
__guarded_by(m_cuse);
#define CUSE_LOCK() \
pthread_mutex_lock(&m_cuse)
#define CUSE_UNLOCK() \
pthread_mutex_unlock(&m_cuse)
int
cuse_init(void)
{
pthread_mutexattr_t attr;
f_cuse = open("/dev/cuse", O_RDWR);
if (f_cuse < 0) {
if (feature_present("cuse") == 0)
return (CUSE_ERR_NOT_LOADED);
else
return (CUSE_ERR_INVALID);
}
pthread_mutexattr_init(&attr);
pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE);
pthread_mutex_init(&m_cuse, &attr);
TAILQ_INIT(&h_cuse);
TAILQ_INIT(&h_cuse_entered);
return (0);
}
int
cuse_uninit(void)
{
int f;
if (f_cuse < 0)
return (CUSE_ERR_INVALID);
f = f_cuse;
f_cuse = -1;
close(f);
pthread_mutex_destroy(&m_cuse);
memset(a_cuse, 0, sizeof(a_cuse));
return (0);
}
unsigned long
cuse_vmoffset(void *_ptr)
{
uint8_t *ptr_min;
uint8_t *ptr_max;
uint8_t *ptr = _ptr;
unsigned long remainder;
unsigned long n;
CUSE_LOCK();
for (n = remainder = 0; n != CUSE_ALLOC_UNIT_MAX; n++) {
if (a_cuse[n].ptr == NULL)
continue;
ptr_min = a_cuse[n].ptr;
ptr_max = a_cuse[n].ptr + a_cuse[n].size - 1;
if ((ptr >= ptr_min) && (ptr <= ptr_max)) {
remainder = (ptr - ptr_min);
break;
}
}
CUSE_UNLOCK();
return ((n << CUSE_ALLOC_UNIT_SHIFT) + remainder);
}
void *
cuse_vmalloc(unsigned size)
{
struct cuse_alloc_info info;
unsigned long pgsize;
unsigned long x;
unsigned long m;
unsigned long n;
void *ptr;
int error;
/* some sanity checks */
if (f_cuse < 0 || size < 1 || size > CUSE_ALLOC_BYTES_MAX)
return (NULL);
memset(&info, 0, sizeof(info));
pgsize = getpagesize();
info.page_count = howmany(size, pgsize);
/* compute how many units the allocation needs */
m = howmany(size, 1 << CUSE_ALLOC_UNIT_SHIFT);
if (m == 0 || m > CUSE_ALLOC_UNIT_MAX)
return (NULL);
CUSE_LOCK();
for (n = 0; n <= CUSE_ALLOC_UNIT_MAX - m; ) {
if (a_cuse[n].size != 0) {
/* skip to next available unit, depending on allocation size */
n += howmany(a_cuse[n].size, 1 << CUSE_ALLOC_UNIT_SHIFT);
continue;
}
/* check if there are "m" free units ahead */
for (x = 1; x != m; x++) {
if (a_cuse[n + x].size != 0)
break;
}
if (x != m) {
/* skip to next available unit, if any */
n += x + 1;
continue;
}
/* reserve this unit by setting the size to a non-zero value */
a_cuse[n].size = size;
CUSE_UNLOCK();
info.alloc_nr = n;
error = ioctl(f_cuse, CUSE_IOCTL_ALLOC_MEMORY, &info);
if (error == 0) {
ptr = mmap(NULL, info.page_count * pgsize,
PROT_READ | PROT_WRITE,
MAP_SHARED, f_cuse, n << CUSE_ALLOC_UNIT_SHIFT);
if (ptr != MAP_FAILED) {
CUSE_LOCK();
a_cuse[n].ptr = ptr;
CUSE_UNLOCK();
return (ptr); /* success */
}
(void) ioctl(f_cuse, CUSE_IOCTL_FREE_MEMORY, &info);
}
CUSE_LOCK();
a_cuse[n].size = 0;
n++;
}
CUSE_UNLOCK();
return (NULL); /* failure */
}
int
cuse_is_vmalloc_addr(void *ptr)
{
int n;
if (f_cuse < 0 || ptr == NULL)
return (0); /* false */
CUSE_LOCK();
for (n = 0; n != CUSE_ALLOC_UNIT_MAX; n++) {
if (a_cuse[n].ptr == ptr)
break;
}
CUSE_UNLOCK();
return (n != CUSE_ALLOC_UNIT_MAX);
}
void
cuse_vmfree(void *ptr)
{
struct cuse_vm_allocation temp;
struct cuse_alloc_info info;
int error;
int n;
if (f_cuse < 0 || ptr == NULL)
return;
CUSE_LOCK();
for (n = 0; n != CUSE_ALLOC_UNIT_MAX; n++) {
if (a_cuse[n].ptr != ptr)
continue;
temp = a_cuse[n];
CUSE_UNLOCK();
munmap(temp.ptr, temp.size);
memset(&info, 0, sizeof(info));
info.alloc_nr = n;
error = ioctl(f_cuse, CUSE_IOCTL_FREE_MEMORY, &info);
if (error != 0) {
/* ignore any errors */
DPRINTF("Freeing memory failed: %d\n", errno);
}
CUSE_LOCK();
a_cuse[n].ptr = NULL;
a_cuse[n].size = 0;
break;
}
CUSE_UNLOCK();
}
int
cuse_alloc_unit_number_by_id(int *pnum, int id)
{
int error;
if (f_cuse < 0)
return (CUSE_ERR_INVALID);
*pnum = (id & CUSE_ID_MASK);
error = ioctl(f_cuse, CUSE_IOCTL_ALLOC_UNIT_BY_ID, pnum);
if (error)
return (CUSE_ERR_NO_MEMORY);
return (0);
}
int
cuse_free_unit_number_by_id(int num, int id)
{
int error;
if (f_cuse < 0)
return (CUSE_ERR_INVALID);
if (num != -1 || id != -1)
num = (id & CUSE_ID_MASK) | (num & 0xFF);
error = ioctl(f_cuse, CUSE_IOCTL_FREE_UNIT_BY_ID, &num);
if (error)
return (CUSE_ERR_NO_MEMORY);
return (0);
}
int
cuse_alloc_unit_number(int *pnum)
{
int error;
if (f_cuse < 0)
return (CUSE_ERR_INVALID);
error = ioctl(f_cuse, CUSE_IOCTL_ALLOC_UNIT, pnum);
if (error)
return (CUSE_ERR_NO_MEMORY);
return (0);
}
int
cuse_free_unit_number(int num)
{
int error;
if (f_cuse < 0)
return (CUSE_ERR_INVALID);
error = ioctl(f_cuse, CUSE_IOCTL_FREE_UNIT, &num);
if (error)
return (CUSE_ERR_NO_MEMORY);
return (0);
}
struct cuse_dev *
cuse_dev_create(const struct cuse_methods *mtod, void *priv0, void *priv1,
uid_t _uid, gid_t _gid, int _perms, const char *_fmt,...)
{
struct cuse_create_dev info;
struct cuse_dev *cdev;
va_list args;
int error;
if (f_cuse < 0)
return (NULL);
cdev = malloc(sizeof(*cdev));
if (cdev == NULL)
return (NULL);
memset(cdev, 0, sizeof(*cdev));
cdev->mtod = mtod;
cdev->priv0 = priv0;
cdev->priv1 = priv1;
memset(&info, 0, sizeof(info));
info.dev = cdev;
info.user_id = _uid;
info.group_id = _gid;
info.permissions = _perms;
va_start(args, _fmt);
vsnprintf(info.devname, sizeof(info.devname), _fmt, args);
va_end(args);
error = ioctl(f_cuse, CUSE_IOCTL_CREATE_DEV, &info);
if (error) {
free(cdev);
return (NULL);
}
CUSE_LOCK();
TAILQ_INSERT_TAIL(&h_cuse, cdev, entry);
CUSE_UNLOCK();
return (cdev);
}
void
cuse_dev_destroy(struct cuse_dev *cdev)
{
int error;
if (f_cuse < 0)
return;
CUSE_LOCK();
TAILQ_REMOVE(&h_cuse, cdev, entry);
CUSE_UNLOCK();
error = ioctl(f_cuse, CUSE_IOCTL_DESTROY_DEV, &cdev);
if (error)
return;
free(cdev);
}
void *
cuse_dev_get_priv0(struct cuse_dev *cdev)
{
return (cdev->priv0);
}
void *
cuse_dev_get_priv1(struct cuse_dev *cdev)
{
return (cdev->priv1);
}
void
cuse_dev_set_priv0(struct cuse_dev *cdev, void *priv)
{
cdev->priv0 = priv;
}
void
cuse_dev_set_priv1(struct cuse_dev *cdev, void *priv)
{
cdev->priv1 = priv;
}
int
cuse_wait_and_process(void)
{
pthread_t curr = pthread_self();
struct cuse_dev_entered *pe;
struct cuse_dev_entered enter;
struct cuse_command info;
struct cuse_dev *cdev;
int error;
if (f_cuse < 0)
return (CUSE_ERR_INVALID);
error = ioctl(f_cuse, CUSE_IOCTL_GET_COMMAND, &info);
if (error)
return (CUSE_ERR_OTHER);
cdev = info.dev;
CUSE_LOCK();
enter.thread = curr;
enter.per_file_handle = (void *)info.per_file_handle;
enter.cmd = info.command;
enter.is_local = 0;
enter.got_signal = 0;
enter.cdev = cdev;
TAILQ_INSERT_TAIL(&h_cuse_entered, &enter, entry);
CUSE_UNLOCK();
DPRINTF("cuse: Command = %d = %s, flags = %d, arg = 0x%08x, ptr = 0x%08x\n",
(int)info.command, cuse_cmd_str(info.command), (int)info.fflags,
(int)info.argument, (int)info.data_pointer);
switch (info.command) {
case CUSE_CMD_OPEN:
if (cdev->mtod->cm_open != NULL)
error = (cdev->mtod->cm_open) (cdev, (int)info.fflags);
else
error = 0;
break;
case CUSE_CMD_CLOSE:
/* wait for other threads to stop */
while (1) {
error = 0;
CUSE_LOCK();
TAILQ_FOREACH(pe, &h_cuse_entered, entry) {
if (pe->cdev != cdev)
continue;
if (pe->thread == curr)
continue;
if (pe->per_file_handle !=
enter.per_file_handle)
continue;
pe->got_signal = 1;
pthread_kill(pe->thread, SIGHUP);
error = CUSE_ERR_BUSY;
}
CUSE_UNLOCK();
if (error == 0)
break;
else
usleep(10000);
}
if (cdev->mtod->cm_close != NULL)
error = (cdev->mtod->cm_close) (cdev, (int)info.fflags);
else
error = 0;
break;
case CUSE_CMD_READ:
if (cdev->mtod->cm_read != NULL) {
error = (cdev->mtod->cm_read) (cdev, (int)info.fflags,
(void *)info.data_pointer, (int)info.argument);
} else {
error = CUSE_ERR_INVALID;
}
break;
case CUSE_CMD_WRITE:
if (cdev->mtod->cm_write != NULL) {
error = (cdev->mtod->cm_write) (cdev, (int)info.fflags,
(void *)info.data_pointer, (int)info.argument);
} else {
error = CUSE_ERR_INVALID;
}
break;
case CUSE_CMD_IOCTL:
if (cdev->mtod->cm_ioctl != NULL) {
error = (cdev->mtod->cm_ioctl) (cdev, (int)info.fflags,
(unsigned int)info.argument, (void *)info.data_pointer);
} else {
error = CUSE_ERR_INVALID;
}
break;
case CUSE_CMD_POLL:
if (cdev->mtod->cm_poll != NULL) {
error = (cdev->mtod->cm_poll) (cdev, (int)info.fflags,
(int)info.argument);
} else {
error = CUSE_POLL_ERROR;
}
break;
case CUSE_CMD_SIGNAL:
CUSE_LOCK();
TAILQ_FOREACH(pe, &h_cuse_entered, entry) {
if (pe->cdev != cdev)
continue;
if (pe->thread == curr)
continue;
if (pe->per_file_handle !=
enter.per_file_handle)
continue;
pe->got_signal = 1;
pthread_kill(pe->thread, SIGHUP);
}
CUSE_UNLOCK();
break;
default:
error = CUSE_ERR_INVALID;
break;
}
DPRINTF("cuse: Command error = %d for %s\n",
error, cuse_cmd_str(info.command));
CUSE_LOCK();
TAILQ_REMOVE(&h_cuse_entered, &enter, entry);
CUSE_UNLOCK();
/* we ignore any sync command failures */
ioctl(f_cuse, CUSE_IOCTL_SYNC_COMMAND, &error);
return (0);
}
static struct cuse_dev_entered *
cuse_dev_get_entered(void)
{
struct cuse_dev_entered *pe;
pthread_t curr = pthread_self();
CUSE_LOCK();
TAILQ_FOREACH(pe, &h_cuse_entered, entry) {
if (pe->thread == curr)
break;
}
CUSE_UNLOCK();
return (pe);
}
void
cuse_dev_set_per_file_handle(struct cuse_dev *cdev, void *handle)
{
struct cuse_dev_entered *pe;
pe = cuse_dev_get_entered();
if (pe == NULL || pe->cdev != cdev)
return;
pe->per_file_handle = handle;
ioctl(f_cuse, CUSE_IOCTL_SET_PFH, &handle);
}
void *
cuse_dev_get_per_file_handle(struct cuse_dev *cdev)
{
struct cuse_dev_entered *pe;
pe = cuse_dev_get_entered();
if (pe == NULL || pe->cdev != cdev)
return (NULL);
return (pe->per_file_handle);
}
void
cuse_set_local(int val)
{
struct cuse_dev_entered *pe;
pe = cuse_dev_get_entered();
if (pe == NULL)
return;
pe->is_local = val;
}
#ifdef HAVE_DEBUG
static const char *
cuse_cmd_str(int cmd)
{
static const char *str[CUSE_CMD_MAX] = {
[CUSE_CMD_NONE] = "none",
[CUSE_CMD_OPEN] = "open",
[CUSE_CMD_CLOSE] = "close",
[CUSE_CMD_READ] = "read",
[CUSE_CMD_WRITE] = "write",
[CUSE_CMD_IOCTL] = "ioctl",
[CUSE_CMD_POLL] = "poll",
[CUSE_CMD_SIGNAL] = "signal",
[CUSE_CMD_SYNC] = "sync",
};
if ((cmd >= 0) && (cmd < CUSE_CMD_MAX) &&
(str[cmd] != NULL))
return (str[cmd]);
else
return ("unknown");
}
#endif
int
cuse_get_local(void)
{
struct cuse_dev_entered *pe;
pe = cuse_dev_get_entered();
if (pe == NULL)
return (0);
return (pe->is_local);
}
int
cuse_copy_out(const void *src, void *user_dst, int len)
{
struct cuse_data_chunk info;
struct cuse_dev_entered *pe;
int error;
if ((f_cuse < 0) || (len < 0))
return (CUSE_ERR_INVALID);
pe = cuse_dev_get_entered();
if (pe == NULL)
return (CUSE_ERR_INVALID);
DPRINTF("cuse: copy_out(%p,%p,%d), cmd = %d = %s\n",
src, user_dst, len, pe->cmd, cuse_cmd_str(pe->cmd));
if (pe->is_local) {
memcpy(user_dst, src, len);
} else {
info.local_ptr = (uintptr_t)src;
info.peer_ptr = (uintptr_t)user_dst;
info.length = len;
error = ioctl(f_cuse, CUSE_IOCTL_WRITE_DATA, &info);
if (error) {
DPRINTF("cuse: copy_out() error = %d\n", errno);
return (CUSE_ERR_FAULT);
}
}
return (0);
}
int
cuse_copy_in(const void *user_src, void *dst, int len)
{
struct cuse_data_chunk info;
struct cuse_dev_entered *pe;
int error;
if ((f_cuse < 0) || (len < 0))
return (CUSE_ERR_INVALID);
pe = cuse_dev_get_entered();
if (pe == NULL)
return (CUSE_ERR_INVALID);
DPRINTF("cuse: copy_in(%p,%p,%d), cmd = %d = %s\n",
user_src, dst, len, pe->cmd, cuse_cmd_str(pe->cmd));
if (pe->is_local) {
memcpy(dst, user_src, len);
} else {
info.local_ptr = (uintptr_t)dst;
info.peer_ptr = (uintptr_t)user_src;
info.length = len;
error = ioctl(f_cuse, CUSE_IOCTL_READ_DATA, &info);
if (error) {
DPRINTF("cuse: copy_in() error = %d\n", errno);
return (CUSE_ERR_FAULT);
}
}
return (0);
}
struct cuse_dev *
cuse_dev_get_current(int *pcmd)
{
struct cuse_dev_entered *pe;
pe = cuse_dev_get_entered();
if (pe == NULL) {
if (pcmd != NULL)
*pcmd = 0;
return (NULL);
}
if (pcmd != NULL)
*pcmd = pe->cmd;
return (pe->cdev);
}
int
cuse_got_peer_signal(void)
{
struct cuse_dev_entered *pe;
pe = cuse_dev_get_entered();
if (pe == NULL)
return (CUSE_ERR_INVALID);
if (pe->got_signal)
return (0);
return (CUSE_ERR_OTHER);
}
void
cuse_poll_wakeup(void)
{
int error = 0;
if (f_cuse < 0)
return;
ioctl(f_cuse, CUSE_IOCTL_SELWAKEUP, &error);
}
diff --git a/lib/libefivar/ProcessorBind.h b/lib/libefivar/ProcessorBind.h
index ecba6874b5fe..46abe715d38f 100644
--- a/lib/libefivar/ProcessorBind.h
+++ b/lib/libefivar/ProcessorBind.h
@@ -1,4 +1,3 @@
/* File in public domain */
/* Brings in the glue for UEFI/EDK2 Tianocore code to run on this OS */
-/* $FreeBSD$ */
#include "efi-osdep.h"
diff --git a/lib/libefivar/uefi-guid.c b/lib/libefivar/uefi-guid.c
index c173a449cf09..4ed3b8e616ce 100644
--- a/lib/libefivar/uefi-guid.c
+++ b/lib/libefivar/uefi-guid.c
@@ -1,36 +1,35 @@
/* This generated file is in the public domain */
-/* $FreeBSD$ */
#include <uuid.h>
#include <stdint.h>
typedef struct {
uint32_t Data1;
uint16_t Data2;
uint16_t Data3;
uint8_t Data4[8];
} EFI_GUID;
extern EFI_GUID gEfiDebugPortProtocolGuid;
extern EFI_GUID gEfiPcAnsiGuid;
extern EFI_GUID gEfiPersistentVirtualCdGuid;
extern EFI_GUID gEfiPersistentVirtualDiskGuid;
extern EFI_GUID gEfiSasDevicePathGuid;
extern EFI_GUID gEfiUartDevicePathGuid;
extern EFI_GUID gEfiVT100Guid;
extern EFI_GUID gEfiVT100PlusGuid;
extern EFI_GUID gEfiVTUTF8Guid;
extern EFI_GUID gEfiVirtualCdGuid;
extern EFI_GUID gEfiVirtualDiskGuid;
EFI_GUID gEfiDebugPortProtocolGuid = { 0xEBA4E8D2, 0x3858, 0x41EC, { 0xA2, 0x81, 0x26, 0x47, 0xBA, 0x96, 0x60, 0xD0 }} ;
EFI_GUID gEfiPcAnsiGuid = { 0xE0C14753, 0xF9BE, 0x11D2, { 0x9A, 0x0C, 0x00, 0x90, 0x27, 0x3F, 0xC1, 0x4D }} ;
EFI_GUID gEfiPersistentVirtualCdGuid = { 0x08018188, 0x42CD, 0xBB48, {0x10, 0x0F, 0x53, 0x87, 0xD5, 0x3D, 0xED, 0x3D }} ;
EFI_GUID gEfiPersistentVirtualDiskGuid = { 0x5CEA02C9, 0x4D07, 0x69D3, {0x26, 0x9F ,0x44, 0x96, 0xFB, 0xE0, 0x96, 0xF9 }} ;
EFI_GUID gEfiSasDevicePathGuid = { 0xd487ddb4, 0x008b, 0x11d9, { 0xaf, 0xdc, 0x00, 0x10, 0x83, 0xff, 0xca, 0x4d }} ;
EFI_GUID gEfiUartDevicePathGuid = { 0x37499a9d, 0x542f, 0x4c89, { 0xa0, 0x26, 0x35, 0xda, 0x14, 0x20, 0x94, 0xe4 }} ;
EFI_GUID gEfiVT100Guid = { 0xDFA66065, 0xB419, 0x11D3, { 0x9A, 0x2D, 0x00, 0x90, 0x27, 0x3F, 0xC1, 0x4D }} ;
EFI_GUID gEfiVT100PlusGuid = { 0x7BAEC70B, 0x57E0, 0x4C76, { 0x8E, 0x87, 0x2F, 0x9E, 0x28, 0x08, 0x83, 0x43 }} ;
EFI_GUID gEfiVTUTF8Guid = { 0xAD15A0D6, 0x8BEC, 0x4ACF, { 0xA0, 0x73, 0xD0, 0x1D, 0xE7, 0x7E, 0x2D, 0x88 }} ;
EFI_GUID gEfiVirtualCdGuid = { 0x3D5ABD30, 0x4175, 0x87CE, {0x6D, 0x64, 0xD2, 0xAD, 0xE5, 0x23, 0xC4, 0xBB }} ;
EFI_GUID gEfiVirtualDiskGuid = { 0x77AB535A, 0x45FC, 0x624B, {0x55, 0x60, 0xF7, 0xB2, 0x81, 0xD1, 0xF9, 0x6E }} ;
diff --git a/lib/libelftc/elftc_version.c b/lib/libelftc/elftc_version.c
index a0920e2724bc..def790f7ed6c 100644
--- a/lib/libelftc/elftc_version.c
+++ b/lib/libelftc/elftc_version.c
@@ -1,10 +1,9 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <libelftc.h>
const char *
elftc_version(void)
{
return "elftoolchain r3769";
}
diff --git a/lib/libgssapi/gss_buffer_set.c b/lib/libgssapi/gss_buffer_set.c
index 7105f33e9539..2e1e63304d41 100644
--- a/lib/libgssapi/gss_buffer_set.c
+++ b/lib/libgssapi/gss_buffer_set.c
@@ -1,128 +1,127 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2004, PADL Software Pty Ltd.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of PADL Software nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <gssapi/gssapi.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
/* RCSID("$Id: gss_buffer_set.c 18885 2006-10-24 21:53:02Z lha $"); */
OM_uint32
gss_create_empty_buffer_set(OM_uint32 * minor_status,
gss_buffer_set_t *buffer_set)
{
gss_buffer_set_t set;
set = (gss_buffer_set_desc *) malloc(sizeof(*set));
if (set == GSS_C_NO_BUFFER_SET) {
*minor_status = ENOMEM;
return (GSS_S_FAILURE);
}
set->count = 0;
set->elements = NULL;
*buffer_set = set;
*minor_status = 0;
return (GSS_S_COMPLETE);
}
OM_uint32
gss_add_buffer_set_member(OM_uint32 * minor_status,
const gss_buffer_t member_buffer, gss_buffer_set_t *buffer_set)
{
gss_buffer_set_t set;
gss_buffer_t p;
OM_uint32 ret;
if (*buffer_set == GSS_C_NO_BUFFER_SET) {
ret = gss_create_empty_buffer_set(minor_status,
buffer_set);
if (ret) {
return (ret);
}
}
set = *buffer_set;
set->elements = reallocarray(set->elements, set->count + 1,
sizeof(set->elements[0]));
if (set->elements == NULL) {
*minor_status = ENOMEM;
return (GSS_S_FAILURE);
}
p = &set->elements[set->count];
p->value = malloc(member_buffer->length);
if (p->value == NULL) {
*minor_status = ENOMEM;
return (GSS_S_FAILURE);
}
memcpy(p->value, member_buffer->value, member_buffer->length);
p->length = member_buffer->length;
set->count++;
*minor_status = 0;
return (GSS_S_COMPLETE);
}
OM_uint32
gss_release_buffer_set(OM_uint32 * minor_status, gss_buffer_set_t *buffer_set)
{
size_t i;
OM_uint32 minor;
*minor_status = 0;
if (*buffer_set == GSS_C_NO_BUFFER_SET)
return (GSS_S_COMPLETE);
for (i = 0; i < (*buffer_set)->count; i++)
gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
free((*buffer_set)->elements);
(*buffer_set)->elements = NULL;
(*buffer_set)->count = 0;
free(*buffer_set);
*buffer_set = GSS_C_NO_BUFFER_SET;
return (GSS_S_COMPLETE);
}
diff --git a/lib/libgssapi/gss_inquire_cred_by_oid.c b/lib/libgssapi/gss_inquire_cred_by_oid.c
index b3df65297446..8b4e0704dfd8 100644
--- a/lib/libgssapi/gss_inquire_cred_by_oid.c
+++ b/lib/libgssapi/gss_inquire_cred_by_oid.c
@@ -1,95 +1,94 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2004, PADL Software Pty Ltd.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of PADL Software nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <gssapi/gssapi.h>
#include "mech_switch.h"
#include "cred.h"
#include "name.h"
/* RCSID("$Id: gss_inquire_cred_by_oid.c 19960 2007-01-17 15:09:24Z lha $"); */
OM_uint32
gss_inquire_cred_by_oid (OM_uint32 *minor_status,
const gss_cred_id_t cred_handle,
const gss_OID desired_object,
gss_buffer_set_t *data_set)
{
struct _gss_cred *cred = (struct _gss_cred *) cred_handle;
OM_uint32 status = GSS_S_COMPLETE;
struct _gss_mechanism_cred *mc;
struct _gss_mech_switch *m;
gss_buffer_set_t set = GSS_C_NO_BUFFER_SET;
*minor_status = 0;
*data_set = GSS_C_NO_BUFFER_SET;
if (cred == NULL)
return GSS_S_NO_CRED;
SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
gss_buffer_set_t rset = GSS_C_NO_BUFFER_SET;
size_t i;
m = mc->gmc_mech;
if (m == NULL) {
gss_release_buffer_set(minor_status, &set);
*minor_status = 0;
return GSS_S_BAD_MECH;
}
if (m->gm_inquire_cred_by_oid == NULL)
continue;
status = m->gm_inquire_cred_by_oid(minor_status,
mc->gmc_cred, desired_object, &rset);
if (status != GSS_S_COMPLETE)
continue;
for (i = 0; i < rset->count; i++) {
status = gss_add_buffer_set_member(minor_status,
&rset->elements[i], &set);
if (status != GSS_S_COMPLETE)
break;
}
gss_release_buffer_set(minor_status, &rset);
}
if (set == GSS_C_NO_BUFFER_SET)
status = GSS_S_FAILURE;
*data_set = set;
*minor_status = 0;
return status;
}
diff --git a/lib/libgssapi/gss_oid_to_str.c b/lib/libgssapi/gss_oid_to_str.c
index 836b149676d8..6b58a3ff6640 100644
--- a/lib/libgssapi/gss_oid_to_str.c
+++ b/lib/libgssapi/gss_oid_to_str.c
@@ -1,120 +1,119 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2000 The Regents of the University of Michigan.
* All rights reserved.
*
* Copyright (c) 2000 Dug Song <dugsong@UMICH.EDU>.
* All rights reserved, all wrongs reversed.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <gssapi/gssapi.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include "utils.h"
OM_uint32
gss_oid_to_str(OM_uint32 *minor_status, gss_OID oid, gss_buffer_t oid_str)
{
char numstr[128];
unsigned long number;
int numshift;
size_t string_length;
size_t i;
unsigned char *cp;
char *bp;
*minor_status = 0;
_gss_buffer_zero(oid_str);
if (oid == GSS_C_NULL_OID)
return (GSS_S_FAILURE);
/* Decoded according to krb5/gssapi_krb5.c */
/* First determine the size of the string */
string_length = 0;
number = 0;
numshift = 0;
cp = (unsigned char *) oid->elements;
number = (unsigned long) cp[0];
sprintf(numstr, "%ld ", number/40);
string_length += strlen(numstr);
sprintf(numstr, "%ld ", number%40);
string_length += strlen(numstr);
for (i=1; i<oid->length; i++) {
if ( (size_t) (numshift+7) < (sizeof(unsigned long)*8)) {
number = (number << 7) | (cp[i] & 0x7f);
numshift += 7;
}
else {
*minor_status = 0;
return(GSS_S_FAILURE);
}
if ((cp[i] & 0x80) == 0) {
sprintf(numstr, "%ld ", number);
string_length += strlen(numstr);
number = 0;
numshift = 0;
}
}
/*
* If we get here, we've calculated the length of "n n n ... n ".
* Add 4 here for "{ " and "}\0".
*/
string_length += 4;
if ((bp = (char *) malloc(string_length))) {
strcpy(bp, "{ ");
number = (unsigned long) cp[0];
sprintf(numstr, "%ld ", number/40);
strcat(bp, numstr);
sprintf(numstr, "%ld ", number%40);
strcat(bp, numstr);
number = 0;
cp = (unsigned char *) oid->elements;
for (i=1; i<oid->length; i++) {
number = (number << 7) | (cp[i] & 0x7f);
if ((cp[i] & 0x80) == 0) {
sprintf(numstr, "%ld ", number);
strcat(bp, numstr);
number = 0;
}
}
strcat(bp, "}");
oid_str->length = strlen(bp)+1;
oid_str->value = (void *) bp;
*minor_status = 0;
return(GSS_S_COMPLETE);
}
*minor_status = ENOMEM;
return(GSS_S_FAILURE);
}
diff --git a/lib/libgssapi/gss_pname_to_uid.c b/lib/libgssapi/gss_pname_to_uid.c
index bd450c1e9a12..7f66d236ef35 100644
--- a/lib/libgssapi/gss_pname_to_uid.c
+++ b/lib/libgssapi/gss_pname_to_uid.c
@@ -1,71 +1,70 @@
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Isilon Inc http://www.isilon.com/
* Authors: Doug Rabson <dfr@rabson.org>
* Developed with Red Inc: Alfred Perlstein <alfred@freebsd.org>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <unistd.h>
#include <gssapi/gssapi.h>
#include "mech_switch.h"
#include "name.h"
#include "utils.h"
OM_uint32
gss_pname_to_uid(OM_uint32 *minor_status, const gss_name_t pname,
const gss_OID mech, uid_t *uidp)
{
struct _gss_name *name = (struct _gss_name *) pname;
struct _gss_mech_switch *m;
struct _gss_mechanism_name *mn;
OM_uint32 major_status;
*minor_status = 0;
if (pname == GSS_C_NO_NAME)
return (GSS_S_BAD_NAME);
m = _gss_find_mech_switch(mech);
if (!m)
return (GSS_S_BAD_MECH);
if (m->gm_pname_to_uid == NULL)
return (GSS_S_UNAVAILABLE);
major_status = _gss_find_mn(minor_status, name, mech, &mn);
if (major_status != GSS_S_COMPLETE) {
_gss_mg_error(m, major_status, *minor_status);
return (major_status);
}
major_status = (*m->gm_pname_to_uid)(minor_status, mn->gmn_name,
mech, uidp);
if (major_status != GSS_S_COMPLETE)
_gss_mg_error(m, major_status, *minor_status);
return (major_status);
}
diff --git a/lib/libgssapi/gss_pseudo_random.c b/lib/libgssapi/gss_pseudo_random.c
index 55c7d4905012..606137d8f481 100644
--- a/lib/libgssapi/gss_pseudo_random.c
+++ b/lib/libgssapi/gss_pseudo_random.c
@@ -1,75 +1,74 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2007 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/* $Id: gss_pseudo_random.c 20053 2007-01-24 01:31:35Z lha $ */
#include <gssapi/gssapi.h>
#include "mech_switch.h"
#include "context.h"
#include "utils.h"
OM_uint32
gss_pseudo_random(OM_uint32 *minor_status,
gss_ctx_id_t context,
int prf_key,
const gss_buffer_t prf_in,
ssize_t desired_output_len,
gss_buffer_t prf_out)
{
struct _gss_context *ctx = (struct _gss_context *) context;
struct _gss_mech_switch *m;
OM_uint32 major_status;
_gss_buffer_zero(prf_out);
*minor_status = 0;
if (ctx == NULL) {
*minor_status = 0;
return GSS_S_NO_CONTEXT;
}
m = ctx->gc_mech;
if (m->gm_pseudo_random == NULL)
return GSS_S_UNAVAILABLE;
major_status = (*m->gm_pseudo_random)(minor_status, ctx->gc_ctx,
prf_key, prf_in, desired_output_len,
prf_out);
if (major_status != GSS_S_COMPLETE)
_gss_mg_error(m, major_status, *minor_status);
return major_status;
}
diff --git a/lib/libgssapi/gss_release_oid.c b/lib/libgssapi/gss_release_oid.c
index 41b44d2e6f4f..106e188bc9a6 100644
--- a/lib/libgssapi/gss_release_oid.c
+++ b/lib/libgssapi/gss_release_oid.c
@@ -1,63 +1,62 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2006 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <gssapi/gssapi.h>
#include <stdlib.h>
/* RCSID("$Id: gss_release_oid.c 17747 2006-06-30 09:34:54Z lha $"); */
OM_uint32
gss_release_oid(OM_uint32 *minor_status, gss_OID *oid)
{
gss_OID o = *oid;
*oid = GSS_C_NO_OID;
if (minor_status != NULL)
*minor_status = 0;
if (o == GSS_C_NO_OID)
return (GSS_S_COMPLETE);
if (o->elements != NULL) {
free(o->elements);
o->elements = NULL;
}
o->length = 0;
free(o);
return (GSS_S_COMPLETE);
}
diff --git a/lib/libgssapi/gss_set_cred_option.c b/lib/libgssapi/gss_set_cred_option.c
index afb160c92c86..4208db8f055b 100644
--- a/lib/libgssapi/gss_set_cred_option.c
+++ b/lib/libgssapi/gss_set_cred_option.c
@@ -1,127 +1,126 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2004, PADL Software Pty Ltd.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of PADL Software nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/* RCSID("$Id: gss_set_cred_option.c 21126 2007-06-18 20:19:59Z lha $"); */
#include <gssapi/gssapi.h>
#include <stdlib.h>
#include <errno.h>
#include "mech_switch.h"
#include "cred.h"
OM_uint32
gss_set_cred_option (OM_uint32 *minor_status,
gss_cred_id_t *cred_handle,
const gss_OID object,
const gss_buffer_t value)
{
struct _gss_cred *cred = (struct _gss_cred *) *cred_handle;
OM_uint32 major_status = GSS_S_COMPLETE;
struct _gss_mechanism_cred *mc;
int one_ok = 0;
*minor_status = 0;
_gss_load_mech();
if (cred == NULL) {
struct _gss_mech_switch *m;
cred = malloc(sizeof(*cred));
if (cred == NULL)
return GSS_S_FAILURE;
SLIST_INIT(&cred->gc_mc);
SLIST_FOREACH(m, &_gss_mechs, gm_link) {
if (m->gm_set_cred_option == NULL)
continue;
mc = malloc(sizeof(*mc));
if (mc == NULL) {
*cred_handle = (gss_cred_id_t)cred;
gss_release_cred(minor_status, cred_handle);
*minor_status = ENOMEM;
return GSS_S_FAILURE;
}
mc->gmc_mech = m;
mc->gmc_mech_oid = &m->gm_mech_oid;
mc->gmc_cred = GSS_C_NO_CREDENTIAL;
major_status = m->gm_set_cred_option(
minor_status, &mc->gmc_cred, object, value);
if (major_status) {
free(mc);
continue;
}
one_ok = 1;
SLIST_INSERT_HEAD(&cred->gc_mc, mc, gmc_link);
}
*cred_handle = (gss_cred_id_t)cred;
if (!one_ok) {
OM_uint32 junk;
gss_release_cred(&junk, cred_handle);
}
} else {
struct _gss_mech_switch *m;
SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
m = mc->gmc_mech;
if (m == NULL)
return GSS_S_BAD_MECH;
if (m->gm_set_cred_option == NULL)
continue;
major_status = m->gm_set_cred_option(minor_status,
&mc->gmc_cred, object, value);
if (major_status == GSS_S_COMPLETE)
one_ok = 1;
else
_gss_mg_error(m, major_status, *minor_status);
}
}
if (one_ok) {
*minor_status = 0;
return (GSS_S_COMPLETE);
}
return (major_status);
}
diff --git a/lib/libgssapi/gss_set_sec_context_option.c b/lib/libgssapi/gss_set_sec_context_option.c
index cda908d7ded8..a94f27aa69d1 100644
--- a/lib/libgssapi/gss_set_sec_context_option.c
+++ b/lib/libgssapi/gss_set_sec_context_option.c
@@ -1,94 +1,93 @@
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2004, PADL Software Pty Ltd.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of PADL Software nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/* RCSID("$Id: gss_set_sec_context_option.c 19928 2007-01-16 10:37:54Z lha $"); */
#include <gssapi/gssapi.h>
#include "mech_switch.h"
#include "context.h"
OM_uint32
gss_set_sec_context_option (OM_uint32 *minor_status,
gss_ctx_id_t *context_handle,
const gss_OID object,
const gss_buffer_t value)
{
struct _gss_context *ctx;
OM_uint32 major_status;
struct _gss_mech_switch *m;
int one_ok = 0;
*minor_status = 0;
if (context_handle == NULL) {
_gss_load_mech();
major_status = GSS_S_BAD_MECH;
SLIST_FOREACH(m, &_gss_mechs, gm_link) {
if (!m->gm_set_sec_context_option)
continue;
major_status = m->gm_set_sec_context_option(
minor_status,
NULL, object, value);
if (major_status == GSS_S_COMPLETE)
one_ok = 1;
}
if (one_ok) {
*minor_status = 0;
return (GSS_S_COMPLETE);
}
return (major_status);
}
ctx = (struct _gss_context *) *context_handle;
if (ctx == NULL)
return (GSS_S_NO_CONTEXT);
m = ctx->gc_mech;
if (m == NULL)
return (GSS_S_BAD_MECH);
if (m->gm_set_sec_context_option != NULL) {
major_status = m->gm_set_sec_context_option(minor_status,
&ctx->gc_ctx, object, value);
if (major_status != GSS_S_COMPLETE)
_gss_mg_error(m, major_status, *minor_status);
} else
major_status = (GSS_S_BAD_MECH);
return (major_status);
}
diff --git a/lib/libiconv_modules/BIG5/citrus_big5.c b/lib/libiconv_modules/BIG5/citrus_big5.c
index 9486ddafc206..f9e758b7806b 100644
--- a/lib/libiconv_modules/BIG5/citrus_big5.c
+++ b/lib/libiconv_modules/BIG5/citrus_big5.c
@@ -1,460 +1,459 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_big5.c,v 1.13 2011/05/23 14:53:46 joerg Exp $ */
/*-
* Copyright (c)2002, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Paul Borman at Krystal Technologies.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_prop.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_big5.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
int chlen;
char ch[2];
} _BIG5State;
typedef struct _BIG5Exclude {
TAILQ_ENTRY(_BIG5Exclude) entry;
wint_t start;
wint_t end;
} _BIG5Exclude;
typedef TAILQ_HEAD(_BIG5ExcludeList, _BIG5Exclude) _BIG5ExcludeList;
typedef struct {
_BIG5ExcludeList excludes;
int cell[0x100];
} _BIG5EncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_BIG5_##m
#define _ENCODING_INFO _BIG5EncodingInfo
#define _ENCODING_STATE _BIG5State
#define _ENCODING_MB_CUR_MAX(_ei_) 2
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_BIG5_init_state(_BIG5EncodingInfo * __restrict ei __unused,
_BIG5State * __restrict s)
{
memset(s, 0, sizeof(*s));
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_BIG5_pack_state(_BIG5EncodingInfo * __restrict ei __unused,
void * __restrict pspriv,
const _BIG5State * __restrict s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_BIG5_unpack_state(_BIG5EncodingInfo * __restrict ei __unused,
_BIG5State * __restrict s,
const void * __restrict pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static __inline int
_citrus_BIG5_check(_BIG5EncodingInfo *ei, unsigned int c)
{
return ((ei->cell[c & 0xFF] & 0x1) ? 2 : 1);
}
static __inline int
_citrus_BIG5_check2(_BIG5EncodingInfo *ei, unsigned int c)
{
return ((ei->cell[c & 0xFF] & 0x2) ? 1 : 0);
}
static __inline int
_citrus_BIG5_check_excludes(_BIG5EncodingInfo *ei, wint_t c)
{
_BIG5Exclude *exclude;
TAILQ_FOREACH(exclude, &ei->excludes, entry) {
if (c >= exclude->start && c <= exclude->end)
return (EILSEQ);
}
return (0);
}
static int
_citrus_BIG5_fill_rowcol(void * __restrict ctx, const char * __restrict s,
uint64_t start, uint64_t end)
{
_BIG5EncodingInfo *ei;
uint64_t n;
int i;
if (start > 0xFF || end > 0xFF)
return (EINVAL);
ei = (_BIG5EncodingInfo *)ctx;
i = strcmp("row", s) ? 1 : 0;
i = 1 << i;
for (n = start; n <= end; ++n)
ei->cell[n & 0xFF] |= i;
return (0);
}
static int
/*ARGSUSED*/
_citrus_BIG5_fill_excludes(void * __restrict ctx,
const char * __restrict s __unused, uint64_t start, uint64_t end)
{
_BIG5EncodingInfo *ei;
_BIG5Exclude *exclude;
if (start > 0xFFFF || end > 0xFFFF)
return (EINVAL);
ei = (_BIG5EncodingInfo *)ctx;
exclude = TAILQ_LAST(&ei->excludes, _BIG5ExcludeList);
if (exclude != NULL && (wint_t)start <= exclude->end)
return (EINVAL);
exclude = (void *)malloc(sizeof(*exclude));
if (exclude == NULL)
return (ENOMEM);
exclude->start = (wint_t)start;
exclude->end = (wint_t)end;
TAILQ_INSERT_TAIL(&ei->excludes, exclude, entry);
return (0);
}
static const _citrus_prop_hint_t root_hints[] = {
_CITRUS_PROP_HINT_NUM("row", &_citrus_BIG5_fill_rowcol),
_CITRUS_PROP_HINT_NUM("col", &_citrus_BIG5_fill_rowcol),
_CITRUS_PROP_HINT_NUM("excludes", &_citrus_BIG5_fill_excludes),
_CITRUS_PROP_HINT_END
};
static void
/*ARGSUSED*/
_citrus_BIG5_encoding_module_uninit(_BIG5EncodingInfo *ei)
{
_BIG5Exclude *exclude;
while ((exclude = TAILQ_FIRST(&ei->excludes)) != NULL) {
TAILQ_REMOVE(&ei->excludes, exclude, entry);
free(exclude);
}
}
static int
/*ARGSUSED*/
_citrus_BIG5_encoding_module_init(_BIG5EncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
const char *s;
int err;
memset((void *)ei, 0, sizeof(*ei));
TAILQ_INIT(&ei->excludes);
if (lenvar > 0 && var != NULL) {
s = _bcs_skip_ws_len((const char *)var, &lenvar);
if (lenvar > 0 && *s != '\0') {
err = _citrus_prop_parse_variable(
root_hints, (void *)ei, s, lenvar);
if (err == 0)
return (0);
_citrus_BIG5_encoding_module_uninit(ei);
memset((void *)ei, 0, sizeof(*ei));
TAILQ_INIT(&ei->excludes);
}
}
/* fallback Big5-1984, for backward compatibility. */
_citrus_BIG5_fill_rowcol(ei, "row", 0xA1, 0xFE);
_citrus_BIG5_fill_rowcol(ei, "col", 0x40, 0x7E);
_citrus_BIG5_fill_rowcol(ei, "col", 0xA1, 0xFE);
return (0);
}
static int
/*ARGSUSED*/
_citrus_BIG5_mbrtowc_priv(_BIG5EncodingInfo * __restrict ei,
wchar_t * __restrict pwc,
char ** __restrict s, size_t n,
_BIG5State * __restrict psenc,
size_t * __restrict nresult)
{
wchar_t wchar;
char *s0;
int c, chlenbak;
s0 = *s;
if (s0 == NULL) {
_citrus_BIG5_init_state(ei, psenc);
*nresult = 0;
return (0);
}
chlenbak = psenc->chlen;
/* make sure we have the first byte in the buffer */
switch (psenc->chlen) {
case 0:
if (n < 1)
goto restart;
psenc->ch[0] = *s0++;
psenc->chlen = 1;
n--;
break;
case 1:
break;
default:
/* illegal state */
goto ilseq;
}
c = _citrus_BIG5_check(ei, psenc->ch[0] & 0xff);
if (c == 0)
goto ilseq;
while (psenc->chlen < c) {
if (n < 1) {
goto restart;
}
psenc->ch[psenc->chlen] = *s0++;
psenc->chlen++;
n--;
}
switch (c) {
case 1:
wchar = psenc->ch[0] & 0xff;
break;
case 2:
if (!_citrus_BIG5_check2(ei, psenc->ch[1] & 0xff))
goto ilseq;
wchar = ((psenc->ch[0] & 0xff) << 8) | (psenc->ch[1] & 0xff);
break;
default:
/* illegal state */
goto ilseq;
}
if (_citrus_BIG5_check_excludes(ei, (wint_t)wchar) != 0)
goto ilseq;
*s = s0;
psenc->chlen = 0;
if (pwc)
*pwc = wchar;
*nresult = wchar ? c - chlenbak : 0;
return (0);
ilseq:
psenc->chlen = 0;
*nresult = (size_t)-1;
return (EILSEQ);
restart:
*s = s0;
*nresult = (size_t)-2;
return (0);
}
static int
/*ARGSUSED*/
_citrus_BIG5_wcrtomb_priv(_BIG5EncodingInfo * __restrict ei,
char * __restrict s,
size_t n, wchar_t wc, _BIG5State * __restrict psenc __unused,
size_t * __restrict nresult)
{
size_t l;
int ret;
/* check invalid sequence */
if (wc & ~0xffff ||
_citrus_BIG5_check_excludes(ei, (wint_t)wc) != 0) {
ret = EILSEQ;
goto err;
}
if (wc & 0x8000) {
if (_citrus_BIG5_check(ei, (wc >> 8) & 0xff) != 2 ||
!_citrus_BIG5_check2(ei, wc & 0xff)) {
ret = EILSEQ;
goto err;
}
l = 2;
} else {
if (wc & ~0xff || !_citrus_BIG5_check(ei, wc & 0xff)) {
ret = EILSEQ;
goto err;
}
l = 1;
}
if (n < l) {
/* bound check failure */
ret = E2BIG;
goto err;
}
if (l == 2) {
s[0] = (wc >> 8) & 0xff;
s[1] = wc & 0xff;
} else
s[0] = wc & 0xff;
*nresult = l;
return (0);
err:
*nresult = (size_t)-1;
return (ret);
}
static __inline int
/*ARGSUSED*/
_citrus_BIG5_stdenc_wctocs(_BIG5EncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid,
_index_t * __restrict idx, wchar_t wc)
{
*csid = (wc < 0x100) ? 0 : 1;
*idx = (_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_BIG5_stdenc_cstowc(_BIG5EncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc,
_csid_t csid, _index_t idx)
{
switch (csid) {
case 0:
case 1:
*wc = (wchar_t)idx;
break;
default:
return (EILSEQ);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_BIG5_stdenc_get_state_desc_generic(_BIG5EncodingInfo * __restrict ei __unused,
_BIG5State * __restrict psenc,
int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(BIG5);
_CITRUS_STDENC_DEF_OPS(BIG5);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/BIG5/citrus_big5.h b/lib/libiconv_modules/BIG5/citrus_big5.h
index fd8de6af6dd8..b7b7310326da 100644
--- a/lib/libiconv_modules/BIG5/citrus_big5.h
+++ b/lib/libiconv_modules/BIG5/citrus_big5.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_big5.h,v 1.2 2003/06/25 09:51:41 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_BIG5_H_
#define _CITRUS_BIG5_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(BIG5);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/DECHanyu/citrus_dechanyu.c b/lib/libiconv_modules/DECHanyu/citrus_dechanyu.c
index fe27da24b383..9b0deb051d4e 100644
--- a/lib/libiconv_modules/DECHanyu/citrus_dechanyu.c
+++ b/lib/libiconv_modules/DECHanyu/citrus_dechanyu.c
@@ -1,396 +1,395 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_dechanyu.c,v 1.4 2011/11/19 18:20:13 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2007 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_dechanyu.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
size_t chlen;
char ch[4];
} _DECHanyuState;
typedef struct {
int dummy;
} _DECHanyuEncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.__CONCAT(s_,_func_)
#define _FUNCNAME(m) __CONCAT(_citrus_DECHanyu_,m)
#define _ENCODING_INFO _DECHanyuEncodingInfo
#define _ENCODING_STATE _DECHanyuState
#define _ENCODING_MB_CUR_MAX(_ei_) 4
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_DECHanyu_init_state(_DECHanyuEncodingInfo * __restrict ei __unused,
_DECHanyuState * __restrict psenc)
{
psenc->chlen = 0;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_DECHanyu_pack_state(_DECHanyuEncodingInfo * __restrict ei __unused,
void * __restrict pspriv, const _DECHanyuState * __restrict psenc)
{
memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
}
static __inline void
/*ARGSUSED*/
_citrus_DECHanyu_unpack_state(_DECHanyuEncodingInfo * __restrict ei __unused,
_DECHanyuState * __restrict psenc,
const void * __restrict pspriv)
{
memcpy((void *)psenc, pspriv, sizeof(*psenc));
}
#endif
static void
/*ARGSUSED*/
_citrus_DECHanyu_encoding_module_uninit(_DECHanyuEncodingInfo *ei __unused)
{
/* ei may be null */
}
static int
/*ARGSUSED*/
_citrus_DECHanyu_encoding_module_init(_DECHanyuEncodingInfo * __restrict ei __unused,
const void * __restrict var __unused, size_t lenvar __unused)
{
/* ei may be null */
return (0);
}
static __inline bool
is_singlebyte(int c)
{
return (c <= 0x7F);
}
static __inline bool
is_leadbyte(int c)
{
return (c >= 0xA1 && c <= 0xFE);
}
static __inline bool
is_trailbyte(int c)
{
c &= ~0x80;
return (c >= 0x21 && c <= 0x7E);
}
static __inline bool
is_hanyu1(int c)
{
return (c == 0xC2);
}
static __inline bool
is_hanyu2(int c)
{
return (c == 0xCB);
}
#define HANYUBIT 0xC2CB0000
static __inline bool
is_94charset(int c)
{
return (c >= 0x21 && c <= 0x7E);
}
static int
/*ARGSUSED*/
_citrus_DECHanyu_mbrtowc_priv(_DECHanyuEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_DECHanyuState * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
wchar_t wc;
int ch;
if (*s == NULL) {
_citrus_DECHanyu_init_state(ei, psenc);
*nresult = _ENCODING_IS_STATE_DEPENDENT;
return (0);
}
s0 = *s;
wc = (wchar_t)0;
switch (psenc->chlen) {
case 0:
if (n-- < 1)
goto restart;
ch = *s0++ & 0xFF;
if (is_singlebyte(ch)) {
if (pwc != NULL)
*pwc = (wchar_t)ch;
*nresult = (size_t)((ch == 0) ? 0 : 1);
*s = s0;
return (0);
}
if (!is_leadbyte(ch))
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
break;
case 1:
ch = psenc->ch[0] & 0xFF;
if (!is_leadbyte(ch))
return (EINVAL);
break;
case 2: case 3:
ch = psenc->ch[0] & 0xFF;
if (is_hanyu1(ch)) {
ch = psenc->ch[1] & 0xFF;
if (is_hanyu2(ch)) {
wc |= (wchar_t)HANYUBIT;
break;
}
}
/*FALLTHROUGH*/
default:
return (EINVAL);
}
switch (psenc->chlen) {
case 1:
if (is_hanyu1(ch)) {
if (n-- < 1)
goto restart;
ch = *s0++ & 0xFF;
if (!is_hanyu2(ch))
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
wc |= (wchar_t)HANYUBIT;
if (n-- < 1)
goto restart;
ch = *s0++ & 0xFF;
if (!is_leadbyte(ch))
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
}
break;
case 2:
if (n-- < 1)
goto restart;
ch = *s0++ & 0xFF;
if (!is_leadbyte(ch))
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
break;
case 3:
ch = psenc->ch[2] & 0xFF;
if (!is_leadbyte(ch))
return (EINVAL);
}
if (n-- < 1)
goto restart;
wc |= (wchar_t)(ch << 8);
ch = *s0++ & 0xFF;
if (!is_trailbyte(ch))
goto ilseq;
wc |= (wchar_t)ch;
if (pwc != NULL)
*pwc = wc;
*nresult = (size_t)(s0 - *s);
*s = s0;
psenc->chlen = 0;
return (0);
restart:
*nresult = (size_t)-2;
*s = s0;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
static int
/*ARGSUSED*/
_citrus_DECHanyu_wcrtomb_priv(_DECHanyuEncodingInfo * __restrict ei __unused,
char * __restrict s, size_t n, wchar_t wc,
_DECHanyuState * __restrict psenc, size_t * __restrict nresult)
{
int ch;
if (psenc->chlen != 0)
return (EINVAL);
/* XXX: assume wchar_t as int */
if ((uint32_t)wc <= 0x7F) {
ch = wc & 0xFF;
} else {
if ((uint32_t)wc > 0xFFFF) {
if ((wc & ~0xFFFF) != (wchar_t)HANYUBIT)
goto ilseq;
psenc->ch[psenc->chlen++] = (wc >> 24) & 0xFF;
psenc->ch[psenc->chlen++] = (wc >> 16) & 0xFF;
wc &= 0xFFFF;
}
ch = (wc >> 8) & 0xFF;
if (!is_leadbyte(ch))
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
ch = wc & 0xFF;
if (!is_trailbyte(ch))
goto ilseq;
}
psenc->ch[psenc->chlen++] = ch;
if (n < psenc->chlen) {
*nresult = (size_t)-1;
return (E2BIG);
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
psenc->chlen = 0;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
static __inline int
/*ARGSUSED*/
_citrus_DECHanyu_stdenc_wctocs(_DECHanyuEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
wchar_t mask;
int plane;
plane = 0;
mask = 0x7F;
/* XXX: assume wchar_t as int */
if ((uint32_t)wc > 0x7F) {
if ((uint32_t)wc > 0xFFFF) {
if ((wc & ~0xFFFF) != (wchar_t)HANYUBIT)
return (EILSEQ);
plane += 2;
}
if (!is_leadbyte((wc >> 8) & 0xFF) ||
!is_trailbyte(wc & 0xFF))
return (EILSEQ);
plane += (wc & 0x80) ? 1 : 2;
mask |= 0x7F00;
}
*csid = plane;
*idx = (_index_t)(wc & mask);
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_DECHanyu_stdenc_cstowc(_DECHanyuEncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
if (csid == 0) {
if (idx > 0x7F)
return (EILSEQ);
} else if (csid <= 4) {
if (!is_94charset(idx >> 8))
return (EILSEQ);
if (!is_94charset(idx & 0xFF))
return (EILSEQ);
if (csid % 2)
idx |= 0x80;
idx |= 0x8000;
if (csid > 2)
idx |= HANYUBIT;
} else
return (EILSEQ);
*wc = (wchar_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_DECHanyu_stdenc_get_state_desc_generic(
_DECHanyuEncodingInfo * __restrict ei __unused,
_DECHanyuState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0)
? _STDENC_SDGEN_INITIAL
: _STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(DECHanyu);
_CITRUS_STDENC_DEF_OPS(DECHanyu);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/DECHanyu/citrus_dechanyu.h b/lib/libiconv_modules/DECHanyu/citrus_dechanyu.h
index 28a752d7c7d3..107291da9439 100644
--- a/lib/libiconv_modules/DECHanyu/citrus_dechanyu.h
+++ b/lib/libiconv_modules/DECHanyu/citrus_dechanyu.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_dechanyu.h,v 1.1 2007/04/01 18:52:32 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_DECHANYU_H_
#define _CITRUS_DECHANYU_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(DECHanyu);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/EUC/citrus_euc.c b/lib/libiconv_modules/EUC/citrus_euc.c
index e83e23fb4666..fbc140a3c913 100644
--- a/lib/libiconv_modules/EUC/citrus_euc.c
+++ b/lib/libiconv_modules/EUC/citrus_euc.c
@@ -1,389 +1,388 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_euc.c,v 1.14 2009/01/11 02:46:24 christos Exp $ */
/*-
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Paul Borman at Krystal Technologies.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_bcs.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_euc.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
int chlen;
char ch[3];
} _EUCState;
typedef struct {
wchar_t bits[4];
wchar_t mask;
unsigned count[4];
unsigned mb_cur_max;
} _EUCEncodingInfo;
#define _SS2 0x008e
#define _SS3 0x008f
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_EUC_##m
#define _ENCODING_INFO _EUCEncodingInfo
#define _ENCODING_STATE _EUCState
#define _ENCODING_MB_CUR_MAX(_ei_) (_ei_)->mb_cur_max
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline int
_citrus_EUC_cs(unsigned int c)
{
c &= 0xff;
return ((c & 0x80) ? c == _SS3 ? 3 : c == _SS2 ? 2 : 1 : 0);
}
static __inline int
_citrus_EUC_parse_variable(_EUCEncodingInfo *ei, const void *var,
size_t lenvar __unused)
{
char *e;
const char *v;
int x;
/* parse variable string */
if (!var)
return (EFTYPE);
v = (const char *)var;
while (*v == ' ' || *v == '\t')
++v;
ei->mb_cur_max = 1;
for (x = 0; x < 4; ++x) {
ei->count[x] = (int)_bcs_strtol(v, (char **)&e, 0);
if (v == e || !(v = e) || ei->count[x] < 1 || ei->count[x] > 4) {
return (EFTYPE);
}
if (ei->mb_cur_max < ei->count[x])
ei->mb_cur_max = ei->count[x];
while (*v == ' ' || *v == '\t')
++v;
ei->bits[x] = (int)_bcs_strtol(v, (char **)&e, 0);
if (v == e || !(v = e)) {
return (EFTYPE);
}
while (*v == ' ' || *v == '\t')
++v;
}
ei->mask = (int)_bcs_strtol(v, (char **)&e, 0);
if (v == e || !(v = e)) {
return (EFTYPE);
}
return (0);
}
static __inline void
/*ARGSUSED*/
_citrus_EUC_init_state(_EUCEncodingInfo *ei __unused, _EUCState *s)
{
memset(s, 0, sizeof(*s));
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_EUC_pack_state(_EUCEncodingInfo *ei __unused, void *pspriv,
const _EUCState *s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_EUC_unpack_state(_EUCEncodingInfo *ei __unused, _EUCState *s,
const void *pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static int
_citrus_EUC_mbrtowc_priv(_EUCEncodingInfo *ei, wchar_t *pwc, char **s,
size_t n, _EUCState *psenc, size_t *nresult)
{
wchar_t wchar;
int c, chlenbak, cs, len;
char *s0, *s1 = NULL;
s0 = *s;
if (s0 == NULL) {
_citrus_EUC_init_state(ei, psenc);
*nresult = 0; /* state independent */
return (0);
}
chlenbak = psenc->chlen;
/* make sure we have the first byte in the buffer */
switch (psenc->chlen) {
case 0:
if (n < 1)
goto restart;
psenc->ch[0] = *s0++;
psenc->chlen = 1;
n--;
break;
case 1:
case 2:
break;
default:
/* illgeal state */
goto encoding_error;
}
c = ei->count[cs = _citrus_EUC_cs(psenc->ch[0] & 0xff)];
if (c == 0)
goto encoding_error;
while (psenc->chlen < c) {
if (n < 1)
goto restart;
psenc->ch[psenc->chlen] = *s0++;
psenc->chlen++;
n--;
}
*s = s0;
switch (cs) {
case 3:
case 2:
/* skip SS2/SS3 */
len = c - 1;
s1 = &psenc->ch[1];
break;
case 1:
case 0:
len = c;
s1 = &psenc->ch[0];
break;
default:
goto encoding_error;
}
wchar = 0;
while (len-- > 0)
wchar = (wchar << 8) | (*s1++ & 0xff);
wchar = (wchar & ~ei->mask) | ei->bits[cs];
psenc->chlen = 0;
if (pwc)
*pwc = wchar;
*nresult = wchar ? (size_t)(c - chlenbak) : 0;
return (0);
encoding_error:
psenc->chlen = 0;
*nresult = (size_t)-1;
return (EILSEQ);
restart:
*nresult = (size_t)-2;
*s = s0;
return (0);
}
static int
_citrus_EUC_wcrtomb_priv(_EUCEncodingInfo *ei, char *s, size_t n, wchar_t wc,
_EUCState *psenc __unused, size_t *nresult)
{
wchar_t m, nm;
unsigned int cs;
int ret;
short i;
m = wc & ei->mask;
nm = wc & ~m;
for (cs = 0; cs < sizeof(ei->count) / sizeof(ei->count[0]); cs++)
if (m == ei->bits[cs])
break;
/* fallback case - not sure if it is necessary */
if (cs == sizeof(ei->count) / sizeof(ei->count[0]))
cs = 1;
i = ei->count[cs];
if (n < (unsigned)i) {
ret = E2BIG;
goto err;
}
m = (cs) ? 0x80 : 0x00;
switch (cs) {
case 2:
*s++ = _SS2;
i--;
break;
case 3:
*s++ = _SS3;
i--;
break;
}
while (i-- > 0)
*s++ = ((nm >> (i << 3)) & 0xff) | m;
*nresult = (size_t)ei->count[cs];
return (0);
err:
*nresult = (size_t)-1;
return (ret);
}
static __inline int
/*ARGSUSED*/
_citrus_EUC_stdenc_wctocs(_EUCEncodingInfo * __restrict ei,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
wchar_t m, nm;
m = wc & ei->mask;
nm = wc & ~m;
*csid = (_citrus_csid_t)m;
*idx = (_citrus_index_t)nm;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_EUC_stdenc_cstowc(_EUCEncodingInfo * __restrict ei,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
if ((csid & ~ei->mask) != 0 || (idx & ei->mask) != 0)
return (EINVAL);
*wc = (wchar_t)csid | (wchar_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_EUC_stdenc_get_state_desc_generic(_EUCEncodingInfo * __restrict ei __unused,
_EUCState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
static int
/*ARGSUSED*/
_citrus_EUC_encoding_module_init(_EUCEncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
return (_citrus_EUC_parse_variable(ei, var, lenvar));
}
static void
/*ARGSUSED*/
_citrus_EUC_encoding_module_uninit(_EUCEncodingInfo * __restrict ei __unused)
{
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(EUC);
_CITRUS_STDENC_DEF_OPS(EUC);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/EUC/citrus_euc.h b/lib/libiconv_modules/EUC/citrus_euc.h
index a7ffa8ab47e0..19db7c13a51c 100644
--- a/lib/libiconv_modules/EUC/citrus_euc.h
+++ b/lib/libiconv_modules/EUC/citrus_euc.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_euc.h,v 1.2 2003/06/25 09:51:42 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_EUC_H_
#define _CITRUS_EUC_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(EUC);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/EUCTW/citrus_euctw.c b/lib/libiconv_modules/EUCTW/citrus_euctw.c
index 9132e38e5ecb..f2ce43c643d9 100644
--- a/lib/libiconv_modules/EUCTW/citrus_euctw.c
+++ b/lib/libiconv_modules/EUCTW/citrus_euctw.c
@@ -1,381 +1,380 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_euctw.c,v 1.11 2008/06/14 16:01:07 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*-
* Copyright (c)1999 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* $Citrus: xpg4dl/FreeBSD/lib/libc/locale/euctw.c,v 1.13 2001/06/21 01:51:44 yamt Exp $
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_euctw.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
int chlen;
char ch[4];
} _EUCTWState;
typedef struct {
int dummy;
} _EUCTWEncodingInfo;
#define _SS2 0x008e
#define _SS3 0x008f
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_EUCTW_##m
#define _ENCODING_INFO _EUCTWEncodingInfo
#define _ENCODING_STATE _EUCTWState
#define _ENCODING_MB_CUR_MAX(_ei_) 4
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline int
_citrus_EUCTW_cs(unsigned int c)
{
c &= 0xff;
return ((c & 0x80) ? (c == _SS2 ? 2 : 1) : 0);
}
static __inline int
_citrus_EUCTW_count(int cs)
{
switch (cs) {
case 0:
/*FALLTHROUGH*/
case 1:
/*FALLTHROUGH*/
case 2:
return (1 << cs);
case 3:
abort();
/*NOTREACHED*/
}
return (0);
}
static __inline void
/*ARGSUSED*/
_citrus_EUCTW_init_state(_EUCTWEncodingInfo * __restrict ei __unused,
_EUCTWState * __restrict s)
{
memset(s, 0, sizeof(*s));
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_EUCTW_pack_state(_EUCTWEncodingInfo * __restrict ei __unused,
void * __restrict pspriv, const _EUCTWState * __restrict s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_EUCTW_unpack_state(_EUCTWEncodingInfo * __restrict ei __unused,
_EUCTWState * __restrict s, const void * __restrict pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static int
/*ARGSUSED*/
_citrus_EUCTW_encoding_module_init(_EUCTWEncodingInfo * __restrict ei,
const void * __restrict var __unused, size_t lenvar __unused)
{
memset((void *)ei, 0, sizeof(*ei));
return (0);
}
static void
/*ARGSUSED*/
_citrus_EUCTW_encoding_module_uninit(_EUCTWEncodingInfo *ei __unused)
{
}
static int
_citrus_EUCTW_mbrtowc_priv(_EUCTWEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s,
size_t n, _EUCTWState * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
wchar_t wchar;
int c, chlenbak, cs;
s0 = *s;
if (s0 == NULL) {
_citrus_EUCTW_init_state(ei, psenc);
*nresult = 0; /* state independent */
return (0);
}
chlenbak = psenc->chlen;
/* make sure we have the first byte in the buffer */
switch (psenc->chlen) {
case 0:
if (n < 1)
goto restart;
psenc->ch[0] = *s0++;
psenc->chlen = 1;
n--;
break;
case 1:
case 2:
break;
default:
/* illgeal state */
goto ilseq;
}
c = _citrus_EUCTW_count(cs = _citrus_EUCTW_cs(psenc->ch[0] & 0xff));
if (c == 0)
goto ilseq;
while (psenc->chlen < c) {
if (n < 1)
goto ilseq;
psenc->ch[psenc->chlen] = *s0++;
psenc->chlen++;
n--;
}
wchar = 0;
switch (cs) {
case 0:
if (psenc->ch[0] & 0x80)
goto ilseq;
wchar = psenc->ch[0] & 0xff;
break;
case 1:
if (!(psenc->ch[0] & 0x80) || !(psenc->ch[1] & 0x80))
goto ilseq;
wchar = ((psenc->ch[0] & 0xff) << 8) | (psenc->ch[1] & 0xff);
wchar |= 'G' << 24;
break;
case 2:
if ((unsigned char)psenc->ch[1] < 0xa1 ||
0xa7 < (unsigned char)psenc->ch[1])
goto ilseq;
if (!(psenc->ch[2] & 0x80) || !(psenc->ch[3] & 0x80))
goto ilseq;
wchar = ((psenc->ch[2] & 0xff) << 8) | (psenc->ch[3] & 0xff);
wchar |= ('G' + psenc->ch[1] - 0xa1) << 24;
break;
default:
goto ilseq;
}
*s = s0;
psenc->chlen = 0;
if (pwc)
*pwc = wchar;
*nresult = wchar ? c - chlenbak : 0;
return (0);
ilseq:
psenc->chlen = 0;
*nresult = (size_t)-1;
return (EILSEQ);
restart:
*s = s0;
*nresult = (size_t)-1;
return (0);
}
static int
_citrus_EUCTW_wcrtomb_priv(_EUCTWEncodingInfo * __restrict ei __unused,
char * __restrict s, size_t n, wchar_t wc,
_EUCTWState * __restrict psenc __unused, size_t * __restrict nresult)
{
wchar_t cs, v;
int clen, i, ret;
size_t len;
cs = wc & 0x7f000080;
clen = 1;
if (wc & 0x00007f00)
clen = 2;
if ((wc & 0x007f0000) && !(wc & 0x00800000))
clen = 3;
if (clen == 1 && cs == 0x00000000) {
/* ASCII */
len = 1;
if (n < len) {
ret = E2BIG;
goto err;
}
v = wc & 0x0000007f;
} else if (clen == 2 && cs == ('G' << 24)) {
/* CNS-11643-1 */
len = 2;
if (n < len) {
ret = E2BIG;
goto err;
}
v = wc & 0x00007f7f;
v |= 0x00008080;
} else if (clen == 2 && 'H' <= (cs >> 24) && (cs >> 24) <= 'M') {
/* CNS-11643-[2-7] */
len = 4;
if (n < len) {
ret = E2BIG;
goto err;
}
*s++ = _SS2;
*s++ = (cs >> 24) - 'H' + 0xa2;
v = wc & 0x00007f7f;
v |= 0x00008080;
} else {
ret = EILSEQ;
goto err;
}
i = clen;
while (i-- > 0)
*s++ = (v >> (i << 3)) & 0xff;
*nresult = len;
return (0);
err:
*nresult = (size_t)-1;
return (ret);
}
static __inline int
/*ARGSUSED*/
_citrus_EUCTW_stdenc_wctocs(_EUCTWEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
*csid = (_csid_t)(wc >> 24) & 0xFF;
*idx = (_index_t)(wc & 0x7F7F);
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_EUCTW_stdenc_cstowc(_EUCTWEncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
if (csid == 0) {
if ((idx & ~0x7F) != 0)
return (EINVAL);
*wc = (wchar_t)idx;
} else {
if (csid < 'G' || csid > 'M' || (idx & ~0x7F7F) != 0)
return (EINVAL);
*wc = (wchar_t)idx | ((wchar_t)csid << 24);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_EUCTW_stdenc_get_state_desc_generic(_EUCTWEncodingInfo * __restrict ei __unused,
_EUCTWState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(EUCTW);
_CITRUS_STDENC_DEF_OPS(EUCTW);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/EUCTW/citrus_euctw.h b/lib/libiconv_modules/EUCTW/citrus_euctw.h
index 2dca8457cf8a..5783cc3256e1 100644
--- a/lib/libiconv_modules/EUCTW/citrus_euctw.h
+++ b/lib/libiconv_modules/EUCTW/citrus_euctw.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_euctw.h,v 1.2 2003/06/25 09:51:42 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_EUCTW_H_
#define _CITRUS_EUCTW_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(EUCTW);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/GBK2K/citrus_gbk2k.c b/lib/libiconv_modules/GBK2K/citrus_gbk2k.c
index 87ec6ebecc6a..83c1ee7e7ef8 100644
--- a/lib/libiconv_modules/GBK2K/citrus_gbk2k.c
+++ b/lib/libiconv_modules/GBK2K/citrus_gbk2k.c
@@ -1,421 +1,420 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_gbk2k.c,v 1.7 2008/06/14 16:01:07 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_gbk2k.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct _GBK2KState {
int chlen;
char ch[4];
} _GBK2KState;
typedef struct {
int mb_cur_max;
} _GBK2KEncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_GBK2K_##m
#define _ENCODING_INFO _GBK2KEncodingInfo
#define _ENCODING_STATE _GBK2KState
#define _ENCODING_MB_CUR_MAX(_ei_) (_ei_)->mb_cur_max
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_GBK2K_init_state(_GBK2KEncodingInfo * __restrict ei __unused,
_GBK2KState * __restrict s)
{
memset(s, 0, sizeof(*s));
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_GBK2K_pack_state(_GBK2KEncodingInfo * __restrict ei __unused,
void * __restrict pspriv, const _GBK2KState * __restrict s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_GBK2K_unpack_state(_GBK2KEncodingInfo * __restrict ei __unused,
_GBK2KState * __restrict s, const void * __restrict pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static __inline bool
_mb_singlebyte(int c)
{
return ((c & 0xff) <= 0x7f);
}
static __inline bool
_mb_leadbyte(int c)
{
c &= 0xff;
return (0x81 <= c && c <= 0xfe);
}
static __inline bool
_mb_trailbyte(int c)
{
c &= 0xff;
return ((0x40 <= c && c <= 0x7e) || (0x80 <= c && c <= 0xfe));
}
static __inline bool
_mb_surrogate(int c)
{
c &= 0xff;
return (0x30 <= c && c <= 0x39);
}
static __inline int
_mb_count(wchar_t v)
{
uint32_t c;
c = (uint32_t)v; /* XXX */
if (!(c & 0xffffff00))
return (1);
if (!(c & 0xffff0000))
return (2);
return (4);
}
#define _PSENC (psenc->ch[psenc->chlen - 1])
#define _PUSH_PSENC(c) (psenc->ch[psenc->chlen++] = (c))
static int
_citrus_GBK2K_mbrtowc_priv(_GBK2KEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_GBK2KState * __restrict psenc, size_t * __restrict nresult)
{
char *s0, *s1;
wchar_t wc;
int chlenbak, len;
s0 = *s;
if (s0 == NULL) {
/* _citrus_GBK2K_init_state(ei, psenc); */
psenc->chlen = 0;
*nresult = 0;
return (0);
}
chlenbak = psenc->chlen;
switch (psenc->chlen) {
case 3:
if (!_mb_leadbyte (_PSENC))
goto invalid;
/* FALLTHROUGH */
case 2:
if (!_mb_surrogate(_PSENC) || _mb_trailbyte(_PSENC))
goto invalid;
/* FALLTHROUGH */
case 1:
if (!_mb_leadbyte (_PSENC))
goto invalid;
/* FALLTHOROUGH */
case 0:
break;
default:
goto invalid;
}
for (;;) {
if (n-- < 1)
goto restart;
_PUSH_PSENC(*s0++);
switch (psenc->chlen) {
case 1:
if (_mb_singlebyte(_PSENC))
goto convert;
if (_mb_leadbyte (_PSENC))
continue;
goto ilseq;
case 2:
if (_mb_trailbyte (_PSENC))
goto convert;
if (ei->mb_cur_max == 4 &&
_mb_surrogate (_PSENC))
continue;
goto ilseq;
case 3:
if (_mb_leadbyte (_PSENC))
continue;
goto ilseq;
case 4:
if (_mb_surrogate (_PSENC))
goto convert;
goto ilseq;
}
}
convert:
len = psenc->chlen;
s1 = &psenc->ch[0];
wc = 0;
while (len-- > 0)
wc = (wc << 8) | (*s1++ & 0xff);
if (pwc != NULL)
*pwc = wc;
*s = s0;
*nresult = (wc == 0) ? 0 : psenc->chlen - chlenbak;
/* _citrus_GBK2K_init_state(ei, psenc); */
psenc->chlen = 0;
return (0);
restart:
*s = s0;
*nresult = (size_t)-2;
return (0);
invalid:
return (EINVAL);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
static int
_citrus_GBK2K_wcrtomb_priv(_GBK2KEncodingInfo * __restrict ei,
char * __restrict s, size_t n, wchar_t wc, _GBK2KState * __restrict psenc,
size_t * __restrict nresult)
{
size_t len;
int ret;
if (psenc->chlen != 0) {
ret = EINVAL;
goto err;
}
len = _mb_count(wc);
if (n < len) {
ret = E2BIG;
goto err;
}
switch (len) {
case 1:
if (!_mb_singlebyte(_PUSH_PSENC(wc ))) {
ret = EILSEQ;
goto err;
}
break;
case 2:
if (!_mb_leadbyte (_PUSH_PSENC(wc >> 8)) ||
!_mb_trailbyte (_PUSH_PSENC(wc))) {
ret = EILSEQ;
goto err;
}
break;
case 4:
if (ei->mb_cur_max != 4 ||
!_mb_leadbyte (_PUSH_PSENC(wc >> 24)) ||
!_mb_surrogate (_PUSH_PSENC(wc >> 16)) ||
!_mb_leadbyte (_PUSH_PSENC(wc >> 8)) ||
!_mb_surrogate (_PUSH_PSENC(wc))) {
ret = EILSEQ;
goto err;
}
break;
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
/* _citrus_GBK2K_init_state(ei, psenc); */
psenc->chlen = 0;
return (0);
err:
*nresult = (size_t)-1;
return (ret);
}
static __inline int
/*ARGSUSED*/
_citrus_GBK2K_stdenc_wctocs(_GBK2KEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
uint8_t ch, cl;
if ((uint32_t)wc < 0x80) {
/* ISO646 */
*csid = 0;
*idx = (_index_t)wc;
} else if ((uint32_t)wc >= 0x10000) {
/* GBKUCS : XXX */
*csid = 3;
*idx = (_index_t)wc;
} else {
ch = (uint8_t)(wc >> 8);
cl = (uint8_t)wc;
if (ch >= 0xA1 && cl >= 0xA1) {
/* EUC G1 */
*csid = 1;
*idx = (_index_t)wc & 0x7F7FU;
} else {
/* extended area (0x8140-) */
*csid = 2;
*idx = (_index_t)wc;
}
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_GBK2K_stdenc_cstowc(_GBK2KEncodingInfo * __restrict ei,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
switch (csid) {
case 0:
/* ISO646 */
*wc = (wchar_t)idx;
break;
case 1:
/* EUC G1 */
*wc = (wchar_t)idx | 0x8080U;
break;
case 2:
/* extended area */
*wc = (wchar_t)idx;
break;
case 3:
/* GBKUCS : XXX */
if (ei->mb_cur_max != 4)
return (EINVAL);
*wc = (wchar_t)idx;
break;
default:
return (EILSEQ);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_GBK2K_stdenc_get_state_desc_generic(_GBK2KEncodingInfo * __restrict ei __unused,
_GBK2KState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
static int
/*ARGSUSED*/
_citrus_GBK2K_encoding_module_init(_GBK2KEncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
const char *p;
p = var;
memset((void *)ei, 0, sizeof(*ei));
ei->mb_cur_max = 4;
while (lenvar > 0) {
switch (_bcs_tolower(*p)) {
case '2':
MATCH("2byte", ei->mb_cur_max = 2);
break;
}
p++;
lenvar--;
}
return (0);
}
static void
/*ARGSUSED*/
_citrus_GBK2K_encoding_module_uninit(_GBK2KEncodingInfo *ei __unused)
{
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(GBK2K);
_CITRUS_STDENC_DEF_OPS(GBK2K);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/GBK2K/citrus_gbk2k.h b/lib/libiconv_modules/GBK2K/citrus_gbk2k.h
index c5df93faa934..ab4716a3e1de 100644
--- a/lib/libiconv_modules/GBK2K/citrus_gbk2k.h
+++ b/lib/libiconv_modules/GBK2K/citrus_gbk2k.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_gbk2k.h,v 1.2 2003/06/25 09:51:43 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_GBK2K_H_
#define _CITRUS_GBK2K_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(GBK2K);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/HZ/citrus_hz.c b/lib/libiconv_modules/HZ/citrus_hz.c
index f41a302fff9e..f12938a7dab8 100644
--- a/lib/libiconv_modules/HZ/citrus_hz.c
+++ b/lib/libiconv_modules/HZ/citrus_hz.c
@@ -1,650 +1,649 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_hz.c,v 1.2 2008/06/14 16:01:07 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_hz.h"
#include "citrus_prop.h"
/*
* wchar_t mapping:
*
* CTRL/ASCII 00000000 00000000 00000000 gxxxxxxx
* GB2312 00000000 00000000 0xxxxxxx gxxxxxxx
* 94/96*n (~M) 0mmmmmmm 0xxxxxxx 0xxxxxxx gxxxxxxx
*/
#define ESCAPE_CHAR '~'
typedef enum {
CTRL = 0, ASCII = 1, GB2312 = 2, CS94 = 3, CS96 = 4
} charset_t;
typedef struct {
int start;
int end;
int width;
} range_t;
static const range_t ranges[] = {
#define RANGE(start, end) { start, end, (end - start) + 1 }
/* CTRL */ RANGE(0x00, 0x1F),
/* ASCII */ RANGE(0x20, 0x7F),
/* GB2312 */ RANGE(0x21, 0x7E),
/* CS94 */ RANGE(0x21, 0x7E),
/* CS96 */ RANGE(0x20, 0x7F),
#undef RANGE
};
typedef struct escape_t escape_t;
typedef struct {
charset_t charset;
escape_t *escape;
ssize_t length;
#define ROWCOL_MAX 3
} graphic_t;
typedef TAILQ_HEAD(escape_list, escape_t) escape_list;
struct escape_t {
TAILQ_ENTRY(escape_t) entry;
escape_list *set;
graphic_t *left;
graphic_t *right;
int ch;
};
#define GL(escape) ((escape)->left)
#define GR(escape) ((escape)->right)
#define SET(escape) ((escape)->set)
#define ESC(escape) ((escape)->ch)
#define INIT(escape) (TAILQ_FIRST(SET(escape)))
static __inline escape_t *
find_escape(escape_list *set, int ch)
{
escape_t *escape;
TAILQ_FOREACH(escape, set, entry) {
if (ESC(escape) == ch)
break;
}
return (escape);
}
typedef struct {
escape_list e0;
escape_list e1;
graphic_t *ascii;
graphic_t *gb2312;
} _HZEncodingInfo;
#define E0SET(ei) (&(ei)->e0)
#define E1SET(ei) (&(ei)->e1)
#define INIT0(ei) (TAILQ_FIRST(E0SET(ei)))
#define INIT1(ei) (TAILQ_FIRST(E1SET(ei)))
typedef struct {
escape_t *inuse;
int chlen;
char ch[ROWCOL_MAX];
} _HZState;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_HZ_##m
#define _ENCODING_INFO _HZEncodingInfo
#define _ENCODING_STATE _HZState
#define _ENCODING_MB_CUR_MAX(_ei_) MB_LEN_MAX
#define _ENCODING_IS_STATE_DEPENDENT 1
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) ((_ps_)->inuse == NULL)
static __inline void
_citrus_HZ_init_state(_HZEncodingInfo * __restrict ei,
_HZState * __restrict psenc)
{
psenc->chlen = 0;
psenc->inuse = INIT0(ei);
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_HZ_pack_state(_HZEncodingInfo * __restrict ei __unused,
void *__restrict pspriv, const _HZState * __restrict psenc)
{
memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
}
static __inline void
/*ARGSUSED*/
_citrus_HZ_unpack_state(_HZEncodingInfo * __restrict ei __unused,
_HZState * __restrict psenc, const void * __restrict pspriv)
{
memcpy((void *)psenc, pspriv, sizeof(*psenc));
}
#endif
static int
_citrus_HZ_mbrtowc_priv(_HZEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_HZState * __restrict psenc, size_t * __restrict nresult)
{
escape_t *candidate, *init;
graphic_t *graphic;
const range_t *range;
char *s0;
wchar_t wc;
int bit, ch, head, len, tail;
if (*s == NULL) {
_citrus_HZ_init_state(ei, psenc);
*nresult = 1;
return (0);
}
s0 = *s;
if (psenc->chlen < 0 || psenc->inuse == NULL)
return (EINVAL);
wc = (wchar_t)0;
bit = head = tail = 0;
graphic = NULL;
for (len = 0; len <= MB_LEN_MAX;) {
if (psenc->chlen == tail) {
if (n-- < 1) {
*s = s0;
*nresult = (size_t)-2;
return (0);
}
psenc->ch[psenc->chlen++] = *s0++;
++len;
}
ch = (unsigned char)psenc->ch[tail++];
if (tail == 1) {
if ((ch & ~0x80) <= 0x1F) {
if (psenc->inuse != INIT0(ei))
break;
wc = (wchar_t)ch;
goto done;
}
if (ch & 0x80) {
graphic = GR(psenc->inuse);
bit = 0x80;
ch &= ~0x80;
} else {
graphic = GL(psenc->inuse);
if (ch == ESCAPE_CHAR)
continue;
bit = 0x0;
}
if (graphic == NULL)
break;
} else if (tail == 2 && psenc->ch[0] == ESCAPE_CHAR) {
if (tail < psenc->chlen)
return (EINVAL);
if (ch == ESCAPE_CHAR) {
++head;
} else if (ch == '\n') {
if (psenc->inuse != INIT0(ei))
break;
tail = psenc->chlen = 0;
continue;
} else {
candidate = NULL;
init = INIT0(ei);
if (psenc->inuse == init) {
init = INIT1(ei);
} else if (INIT(psenc->inuse) == init) {
if (ESC(init) != ch)
break;
candidate = init;
}
if (candidate == NULL) {
candidate = find_escape(
SET(psenc->inuse), ch);
if (candidate == NULL) {
if (init == NULL ||
ESC(init) != ch)
break;
candidate = init;
}
}
psenc->inuse = candidate;
tail = psenc->chlen = 0;
continue;
}
} else if (ch & 0x80) {
if (graphic != GR(psenc->inuse))
break;
ch &= ~0x80;
} else {
if (graphic != GL(psenc->inuse))
break;
}
range = &ranges[(size_t)graphic->charset];
if (range->start > ch || range->end < ch)
break;
wc <<= 8;
wc |= ch;
if (graphic->length == (tail - head)) {
if (graphic->charset > GB2312)
bit |= ESC(psenc->inuse) << 24;
wc |= bit;
goto done;
}
}
*nresult = (size_t)-1;
return (EILSEQ);
done:
if (tail < psenc->chlen)
return (EINVAL);
*s = s0;
if (pwc != NULL)
*pwc = wc;
psenc->chlen = 0;
*nresult = (wc == 0) ? 0 : len;
return (0);
}
static int
_citrus_HZ_wcrtomb_priv(_HZEncodingInfo * __restrict ei,
char * __restrict s, size_t n, wchar_t wc,
_HZState * __restrict psenc, size_t * __restrict nresult)
{
escape_t *candidate, *init;
graphic_t *graphic;
const range_t *range;
size_t len;
int bit, ch;
if (psenc->chlen != 0 || psenc->inuse == NULL)
return (EINVAL);
if (wc & 0x80) {
bit = 0x80;
wc &= ~0x80;
} else {
bit = 0x0;
}
if ((uint32_t)wc <= 0x1F) {
candidate = INIT0(ei);
graphic = (bit == 0) ? candidate->left : candidate->right;
if (graphic == NULL)
goto ilseq;
range = &ranges[(size_t)CTRL];
len = 1;
} else if ((uint32_t)wc <= 0x7F) {
graphic = ei->ascii;
if (graphic == NULL)
goto ilseq;
candidate = graphic->escape;
range = &ranges[(size_t)graphic->charset];
len = graphic->length;
} else if ((uint32_t)wc <= 0x7F7F) {
graphic = ei->gb2312;
if (graphic == NULL)
goto ilseq;
candidate = graphic->escape;
range = &ranges[(size_t)graphic->charset];
len = graphic->length;
} else {
ch = (wc >> 24) & 0xFF;
candidate = find_escape(E0SET(ei), ch);
if (candidate == NULL) {
candidate = find_escape(E1SET(ei), ch);
if (candidate == NULL)
goto ilseq;
}
wc &= ~0xFF000000;
graphic = (bit == 0) ? candidate->left : candidate->right;
if (graphic == NULL)
goto ilseq;
range = &ranges[(size_t)graphic->charset];
len = graphic->length;
}
if (psenc->inuse != candidate) {
init = INIT0(ei);
if (SET(psenc->inuse) == SET(candidate)) {
if (INIT(psenc->inuse) != init ||
psenc->inuse == init || candidate == init)
init = NULL;
} else if (candidate == (init = INIT(candidate))) {
init = NULL;
}
if (init != NULL) {
if (n < 2)
return (E2BIG);
n -= 2;
psenc->ch[psenc->chlen++] = ESCAPE_CHAR;
psenc->ch[psenc->chlen++] = ESC(init);
}
if (n < 2)
return (E2BIG);
n -= 2;
psenc->ch[psenc->chlen++] = ESCAPE_CHAR;
psenc->ch[psenc->chlen++] = ESC(candidate);
psenc->inuse = candidate;
}
if (n < len)
return (E2BIG);
while (len-- > 0) {
ch = (wc >> (len * 8)) & 0xFF;
if (range->start > ch || range->end < ch)
goto ilseq;
psenc->ch[psenc->chlen++] = ch | bit;
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
psenc->chlen = 0;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
static __inline int
_citrus_HZ_put_state_reset(_HZEncodingInfo * __restrict ei,
char * __restrict s, size_t n, _HZState * __restrict psenc,
size_t * __restrict nresult)
{
escape_t *candidate;
if (psenc->chlen != 0 || psenc->inuse == NULL)
return (EINVAL);
candidate = INIT0(ei);
if (psenc->inuse != candidate) {
if (n < 2)
return (E2BIG);
n -= 2;
psenc->ch[psenc->chlen++] = ESCAPE_CHAR;
psenc->ch[psenc->chlen++] = ESC(candidate);
}
if (n < 1)
return (E2BIG);
if (psenc->chlen > 0)
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
_citrus_HZ_init_state(ei, psenc);
return (0);
}
static __inline int
_citrus_HZ_stdenc_get_state_desc_generic(_HZEncodingInfo * __restrict ei,
_HZState * __restrict psenc, int * __restrict rstate)
{
if (psenc->chlen < 0 || psenc->inuse == NULL)
return (EINVAL);
*rstate = (psenc->chlen == 0)
? ((psenc->inuse == INIT0(ei))
? _STDENC_SDGEN_INITIAL
: _STDENC_SDGEN_STABLE)
: ((psenc->ch[0] == ESCAPE_CHAR)
? _STDENC_SDGEN_INCOMPLETE_SHIFT
: _STDENC_SDGEN_INCOMPLETE_CHAR);
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_HZ_stdenc_wctocs(_HZEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
int bit;
if (wc & 0x80) {
bit = 0x80;
wc &= ~0x80;
} else
bit = 0x0;
if ((uint32_t)wc <= 0x7F) {
*csid = (_csid_t)bit;
*idx = (_index_t)wc;
} else if ((uint32_t)wc <= 0x7F7F) {
*csid = (_csid_t)(bit | 0x8000);
*idx = (_index_t)wc;
} else {
*csid = (_index_t)(wc & ~0x00FFFF7F);
*idx = (_csid_t)(wc & 0x00FFFF7F);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_HZ_stdenc_cstowc(_HZEncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
*wc = (wchar_t)idx;
switch (csid) {
case 0x80:
case 0x8080:
*wc |= (wchar_t)0x80;
/*FALLTHROUGH*/
case 0x0:
case 0x8000:
break;
default:
*wc |= (wchar_t)csid;
}
return (0);
}
static void
_citrus_HZ_encoding_module_uninit(_HZEncodingInfo *ei)
{
escape_t *escape;
while ((escape = TAILQ_FIRST(E0SET(ei))) != NULL) {
TAILQ_REMOVE(E0SET(ei), escape, entry);
free(GL(escape));
free(GR(escape));
free(escape);
}
while ((escape = TAILQ_FIRST(E1SET(ei))) != NULL) {
TAILQ_REMOVE(E1SET(ei), escape, entry);
free(GL(escape));
free(GR(escape));
free(escape);
}
}
static int
_citrus_HZ_parse_char(void *context, const char *name __unused, const char *s)
{
escape_t *escape;
void **p;
p = (void **)context;
escape = (escape_t *)p[0];
if (escape->ch != '\0')
return (EINVAL);
escape->ch = *s++;
if (escape->ch == ESCAPE_CHAR || *s != '\0')
return (EINVAL);
return (0);
}
static int
_citrus_HZ_parse_graphic(void *context, const char *name, const char *s)
{
_HZEncodingInfo *ei;
escape_t *escape;
graphic_t *graphic;
void **p;
p = (void **)context;
escape = (escape_t *)p[0];
ei = (_HZEncodingInfo *)p[1];
graphic = calloc(1, sizeof(*graphic));
if (graphic == NULL)
return (ENOMEM);
if (strcmp("GL", name) == 0) {
if (GL(escape) != NULL)
goto release;
GL(escape) = graphic;
} else if (strcmp("GR", name) == 0) {
if (GR(escape) != NULL)
goto release;
GR(escape) = graphic;
} else {
release:
free(graphic);
return (EINVAL);
}
graphic->escape = escape;
if (_bcs_strncasecmp("ASCII", s, 5) == 0) {
if (s[5] != '\0')
return (EINVAL);
graphic->charset = ASCII;
graphic->length = 1;
ei->ascii = graphic;
return (0);
} else if (_bcs_strncasecmp("GB2312", s, 6) == 0) {
if (s[6] != '\0')
return (EINVAL);
graphic->charset = GB2312;
graphic->length = 2;
ei->gb2312 = graphic;
return (0);
} else if (strncmp("94*", s, 3) == 0)
graphic->charset = CS94;
else if (strncmp("96*", s, 3) == 0)
graphic->charset = CS96;
else
return (EINVAL);
s += 3;
switch(*s) {
case '1': case '2': case '3':
graphic->length = (size_t)(*s - '0');
if (*++s == '\0')
break;
/*FALLTHROUGH*/
default:
return (EINVAL);
}
return (0);
}
static const _citrus_prop_hint_t escape_hints[] = {
_CITRUS_PROP_HINT_STR("CH", &_citrus_HZ_parse_char),
_CITRUS_PROP_HINT_STR("GL", &_citrus_HZ_parse_graphic),
_CITRUS_PROP_HINT_STR("GR", &_citrus_HZ_parse_graphic),
_CITRUS_PROP_HINT_END
};
static int
_citrus_HZ_parse_escape(void *context, const char *name, const char *s)
{
_HZEncodingInfo *ei;
escape_t *escape;
void *p[2];
ei = (_HZEncodingInfo *)context;
escape = calloc(1, sizeof(*escape));
if (escape == NULL)
return (EINVAL);
if (strcmp("0", name) == 0) {
escape->set = E0SET(ei);
TAILQ_INSERT_TAIL(E0SET(ei), escape, entry);
} else if (strcmp("1", name) == 0) {
escape->set = E1SET(ei);
TAILQ_INSERT_TAIL(E1SET(ei), escape, entry);
} else {
free(escape);
return (EINVAL);
}
p[0] = (void *)escape;
p[1] = (void *)ei;
return (_citrus_prop_parse_variable(
escape_hints, (void *)&p[0], s, strlen(s)));
}
static const _citrus_prop_hint_t root_hints[] = {
_CITRUS_PROP_HINT_STR("0", &_citrus_HZ_parse_escape),
_CITRUS_PROP_HINT_STR("1", &_citrus_HZ_parse_escape),
_CITRUS_PROP_HINT_END
};
static int
_citrus_HZ_encoding_module_init(_HZEncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
int errnum;
memset(ei, 0, sizeof(*ei));
TAILQ_INIT(E0SET(ei));
TAILQ_INIT(E1SET(ei));
errnum = _citrus_prop_parse_variable(
root_hints, (void *)ei, var, lenvar);
if (errnum != 0)
_citrus_HZ_encoding_module_uninit(ei);
return (errnum);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(HZ);
_CITRUS_STDENC_DEF_OPS(HZ);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/HZ/citrus_hz.h b/lib/libiconv_modules/HZ/citrus_hz.h
index 6fc36d5a1743..ade378d78184 100644
--- a/lib/libiconv_modules/HZ/citrus_hz.h
+++ b/lib/libiconv_modules/HZ/citrus_hz.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_hz.h,v 1.1 2006/11/22 23:38:27 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_HZ_H_
#define _CITRUS_HZ_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(HZ);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/ISO2022/citrus_iso2022.c b/lib/libiconv_modules/ISO2022/citrus_iso2022.c
index 394495de906e..a311dbc26e59 100644
--- a/lib/libiconv_modules/ISO2022/citrus_iso2022.c
+++ b/lib/libiconv_modules/ISO2022/citrus_iso2022.c
@@ -1,1294 +1,1293 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iso2022.c,v 1.20 2010/12/07 22:01:45 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)1999, 2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* $Citrus: xpg4dl/FreeBSD/lib/libc/locale/iso2022.c,v 1.23 2001/06/21 01:51:44 yamt Exp $
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_iso2022.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
/*
* wchar_t mappings:
* ASCII (ESC ( B) 00000000 00000000 00000000 0xxxxxxx
* iso-8859-1 (ESC , A) 00000000 00000000 00000000 1xxxxxxx
* 94 charset (ESC ( F) 0fffffff 00000000 00000000 0xxxxxxx
* 94 charset (ESC ( M F) 0fffffff 1mmmmmmm 00000000 0xxxxxxx
* 96 charset (ESC , F) 0fffffff 00000000 00000000 1xxxxxxx
* 96 charset (ESC , M F) 0fffffff 1mmmmmmm 00000000 1xxxxxxx
* 94x94 charset (ESC $ ( F) 0fffffff 00000000 0xxxxxxx 0xxxxxxx
* 96x96 charset (ESC $ , F) 0fffffff 00000000 0xxxxxxx 1xxxxxxx
* 94x94 charset (ESC & V ESC $ ( F)
* 0fffffff 1vvvvvvv 0xxxxxxx 0xxxxxxx
* 94x94x94 charset (ESC $ ( F) 0fffffff 0xxxxxxx 0xxxxxxx 0xxxxxxx
* 96x96x96 charset (ESC $ , F) 0fffffff 0xxxxxxx 0xxxxxxx 1xxxxxxx
* reserved for UCS4 co-existence (UCS4 is 31bit encoding thanks to mohta bit)
* 1xxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx
*/
#define CS94 (0U)
#define CS96 (1U)
#define CS94MULTI (2U)
#define CS96MULTI (3U)
typedef struct {
unsigned char type;
unsigned char final;
unsigned char interm;
unsigned char vers;
} _ISO2022Charset;
static const _ISO2022Charset ascii = { CS94, 'B', '\0', '\0' };
static const _ISO2022Charset iso88591 = { CS96, 'A', '\0', '\0' };
typedef struct {
_ISO2022Charset g[4];
/* need 3 bits to hold -1, 0, ..., 3 */
int gl:3,
gr:3,
singlegl:3,
singlegr:3;
char ch[7]; /* longest escape sequence (ESC & V ESC $ ( F) */
size_t chlen;
int flags;
#define _ISO2022STATE_FLAG_INITIALIZED 1
} _ISO2022State;
typedef struct {
_ISO2022Charset *recommend[4];
size_t recommendsize[4];
_ISO2022Charset initg[4];
int maxcharset;
int flags;
#define F_8BIT 0x0001
#define F_NOOLD 0x0002
#define F_SI 0x0010 /*0F*/
#define F_SO 0x0020 /*0E*/
#define F_LS0 0x0010 /*0F*/
#define F_LS1 0x0020 /*0E*/
#define F_LS2 0x0040 /*ESC n*/
#define F_LS3 0x0080 /*ESC o*/
#define F_LS1R 0x0100 /*ESC ~*/
#define F_LS2R 0x0200 /*ESC }*/
#define F_LS3R 0x0400 /*ESC |*/
#define F_SS2 0x0800 /*ESC N*/
#define F_SS3 0x1000 /*ESC O*/
#define F_SS2R 0x2000 /*8E*/
#define F_SS3R 0x4000 /*8F*/
} _ISO2022EncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_ISO2022_##m
#define _ENCODING_INFO _ISO2022EncodingInfo
#define _ENCODING_STATE _ISO2022State
#define _ENCODING_MB_CUR_MAX(_ei_) MB_LEN_MAX
#define _ENCODING_IS_STATE_DEPENDENT 1
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) \
(!((_ps_)->flags & _ISO2022STATE_FLAG_INITIALIZED))
#define _ISO2022INVALID (wchar_t)-1
static __inline bool isc0(__uint8_t x)
{
return ((x & 0x1f) == x);
}
static __inline bool isc1(__uint8_t x)
{
return (0x80 <= x && x <= 0x9f);
}
static __inline bool iscntl(__uint8_t x)
{
return (isc0(x) || isc1(x) || x == 0x7f);
}
static __inline bool is94(__uint8_t x)
{
return (0x21 <= x && x <= 0x7e);
}
static __inline bool is96(__uint8_t x)
{
return (0x20 <= x && x <= 0x7f);
}
static __inline bool isecma(__uint8_t x)
{
return (0x30 <= x && x <= 0x7f);
}
static __inline bool isinterm(__uint8_t x)
{
return (0x20 <= x && x <= 0x2f);
}
static __inline bool isthree(__uint8_t x)
{
return (0x60 <= x && x <= 0x6f);
}
static __inline int
getcs(const char * __restrict p, _ISO2022Charset * __restrict cs)
{
if (!strncmp(p, "94$", 3) && p[3] && !p[4]) {
cs->final = (unsigned char)(p[3] & 0xff);
cs->interm = '\0';
cs->vers = '\0';
cs->type = CS94MULTI;
} else if (!strncmp(p, "96$", 3) && p[3] && !p[4]) {
cs->final = (unsigned char)(p[3] & 0xff);
cs->interm = '\0';
cs->vers = '\0';
cs->type = CS96MULTI;
} else if (!strncmp(p, "94", 2) && p[2] && !p[3]) {
cs->final = (unsigned char)(p[2] & 0xff);
cs->interm = '\0';
cs->vers = '\0';
cs->type = CS94;
} else if (!strncmp(p, "96", 2) && p[2] && !p[3]) {
cs->final = (unsigned char )(p[2] & 0xff);
cs->interm = '\0';
cs->vers = '\0';
cs->type = CS96;
} else
return (1);
return (0);
}
#define _NOTMATCH 0
#define _MATCH 1
#define _PARSEFAIL 2
static __inline int
get_recommend(_ISO2022EncodingInfo * __restrict ei,
const char * __restrict token)
{
_ISO2022Charset cs, *p;
int i;
if (!strchr("0123", token[0]) || token[1] != '=')
return (_NOTMATCH);
if (getcs(&token[2], &cs) == 0)
;
else if (!strcmp(&token[2], "94")) {
cs.final = (unsigned char)(token[4]);
cs.interm = '\0';
cs.vers = '\0';
cs.type = CS94;
} else if (!strcmp(&token[2], "96")) {
cs.final = (unsigned char)(token[4]);
cs.interm = '\0';
cs.vers = '\0';
cs.type = CS96;
} else if (!strcmp(&token[2], "94$")) {
cs.final = (unsigned char)(token[5]);
cs.interm = '\0';
cs.vers = '\0';
cs.type = CS94MULTI;
} else if (!strcmp(&token[2], "96$")) {
cs.final = (unsigned char)(token[5]);
cs.interm = '\0';
cs.vers = '\0';
cs.type = CS96MULTI;
} else
return (_PARSEFAIL);
i = token[0] - '0';
if (!ei->recommend[i])
ei->recommend[i] = malloc(sizeof(_ISO2022Charset));
else {
p = reallocarray(ei->recommend[i], ei->recommendsize[i] + 1,
sizeof(_ISO2022Charset));
if (!p)
return (_PARSEFAIL);
ei->recommend[i] = p;
}
if (!ei->recommend[i])
return (_PARSEFAIL);
ei->recommendsize[i]++;
(ei->recommend[i] + (ei->recommendsize[i] - 1))->final = cs.final;
(ei->recommend[i] + (ei->recommendsize[i] - 1))->interm = cs.interm;
(ei->recommend[i] + (ei->recommendsize[i] - 1))->vers = cs.vers;
(ei->recommend[i] + (ei->recommendsize[i] - 1))->type = cs.type;
return (_MATCH);
}
static __inline int
get_initg(_ISO2022EncodingInfo * __restrict ei,
const char * __restrict token)
{
_ISO2022Charset cs;
if (strncmp("INIT", &token[0], 4) ||
!strchr("0123", token[4]) ||
token[5] != '=')
return (_NOTMATCH);
if (getcs(&token[6], &cs) != 0)
return (_PARSEFAIL);
ei->initg[token[4] - '0'].type = cs.type;
ei->initg[token[4] - '0'].final = cs.final;
ei->initg[token[4] - '0'].interm = cs.interm;
ei->initg[token[4] - '0'].vers = cs.vers;
return (_MATCH);
}
static __inline int
get_max(_ISO2022EncodingInfo * __restrict ei,
const char * __restrict token)
{
if (!strcmp(token, "MAX1"))
ei->maxcharset = 1;
else if (!strcmp(token, "MAX2"))
ei->maxcharset = 2;
else if (!strcmp(token, "MAX3"))
ei->maxcharset = 3;
else
return (_NOTMATCH);
return (_MATCH);
}
static __inline int
get_flags(_ISO2022EncodingInfo * __restrict ei,
const char * __restrict token)
{
static struct {
const char *tag;
int flag;
} const tags[] = {
{ "DUMMY", 0 },
{ "8BIT", F_8BIT },
{ "NOOLD", F_NOOLD },
{ "SI", F_SI },
{ "SO", F_SO },
{ "LS0", F_LS0 },
{ "LS1", F_LS1 },
{ "LS2", F_LS2 },
{ "LS3", F_LS3 },
{ "LS1R", F_LS1R },
{ "LS2R", F_LS2R },
{ "LS3R", F_LS3R },
{ "SS2", F_SS2 },
{ "SS3", F_SS3 },
{ "SS2R", F_SS2R },
{ "SS3R", F_SS3R },
{ NULL, 0 }
};
int i;
for (i = 0; tags[i].tag; i++)
if (!strcmp(token, tags[i].tag)) {
ei->flags |= tags[i].flag;
return (_MATCH);
}
return (_NOTMATCH);
}
static __inline int
_citrus_ISO2022_parse_variable(_ISO2022EncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar __unused)
{
char const *e, *v;
char buf[20];
size_t len;
int i, ret;
/*
* parse VARIABLE section.
*/
if (!var)
return (EFTYPE);
v = (const char *) var;
/* initialize structure */
ei->maxcharset = 0;
for (i = 0; i < 4; i++) {
ei->recommend[i] = NULL;
ei->recommendsize[i] = 0;
}
ei->flags = 0;
while (*v) {
while (*v == ' ' || *v == '\t')
++v;
/* find the token */
e = v;
while (*e && *e != ' ' && *e != '\t')
++e;
len = e - v;
if (len == 0)
break;
if (len >= sizeof(buf))
goto parsefail;
snprintf(buf, sizeof(buf), "%.*s", (int)len, v);
if ((ret = get_recommend(ei, buf)) != _NOTMATCH)
;
else if ((ret = get_initg(ei, buf)) != _NOTMATCH)
;
else if ((ret = get_max(ei, buf)) != _NOTMATCH)
;
else if ((ret = get_flags(ei, buf)) != _NOTMATCH)
;
else
ret = _PARSEFAIL;
if (ret == _PARSEFAIL)
goto parsefail;
v = e;
}
return (0);
parsefail:
free(ei->recommend[0]);
free(ei->recommend[1]);
free(ei->recommend[2]);
free(ei->recommend[3]);
return (EFTYPE);
}
static __inline void
/*ARGSUSED*/
_citrus_ISO2022_init_state(_ISO2022EncodingInfo * __restrict ei,
_ISO2022State * __restrict s)
{
int i;
memset(s, 0, sizeof(*s));
s->gl = 0;
s->gr = (ei->flags & F_8BIT) ? 1 : -1;
for (i = 0; i < 4; i++)
if (ei->initg[i].final) {
s->g[i].type = ei->initg[i].type;
s->g[i].final = ei->initg[i].final;
s->g[i].interm = ei->initg[i].interm;
}
s->singlegl = s->singlegr = -1;
s->flags |= _ISO2022STATE_FLAG_INITIALIZED;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_ISO2022_pack_state(_ISO2022EncodingInfo * __restrict ei __unused,
void * __restrict pspriv, const _ISO2022State * __restrict s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_ISO2022_unpack_state(_ISO2022EncodingInfo * __restrict ei __unused,
_ISO2022State * __restrict s, const void * __restrict pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static int
/*ARGSUSED*/
_citrus_ISO2022_encoding_module_init(_ISO2022EncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
return (_citrus_ISO2022_parse_variable(ei, var, lenvar));
}
static void
/*ARGSUSED*/
_citrus_ISO2022_encoding_module_uninit(_ISO2022EncodingInfo *ei __unused)
{
}
#define ESC '\033'
#define ECMA -1
#define INTERM -2
#define OECMA -3
static const struct seqtable {
int type;
int csoff;
int finaloff;
int intermoff;
int versoff;
int len;
int chars[10];
} seqtable[] = {
/* G0 94MULTI special */
{ CS94MULTI, -1, 2, -1, -1, 3, { ESC, '$', OECMA }, },
/* G0 94MULTI special with version identification */
{ CS94MULTI, -1, 5, -1, 2, 6, { ESC, '&', ECMA, ESC, '$', OECMA }, },
/* G? 94 */
{ CS94, 1, 2, -1, -1, 3, { ESC, CS94, ECMA, }, },
/* G? 94 with 2nd intermediate char */
{ CS94, 1, 3, 2, -1, 4, { ESC, CS94, INTERM, ECMA, }, },
/* G? 96 */
{ CS96, 1, 2, -1, -1, 3, { ESC, CS96, ECMA, }, },
/* G? 96 with 2nd intermediate char */
{ CS96, 1, 3, 2, -1, 4, { ESC, CS96, INTERM, ECMA, }, },
/* G? 94MULTI */
{ CS94MULTI, 2, 3, -1, -1, 4, { ESC, '$', CS94, ECMA, }, },
/* G? 96MULTI */
{ CS96MULTI, 2, 3, -1, -1, 4, { ESC, '$', CS96, ECMA, }, },
/* G? 94MULTI with version specification */
{ CS94MULTI, 5, 6, -1, 2, 7, { ESC, '&', ECMA, ESC, '$', CS94, ECMA, }, },
/* LS2/3 */
{ -1, -1, -1, -1, -1, 2, { ESC, 'n', }, },
{ -1, -1, -1, -1, -1, 2, { ESC, 'o', }, },
/* LS1/2/3R */
{ -1, -1, -1, -1, -1, 2, { ESC, '~', }, },
{ -1, -1, -1, -1, -1, 2, { ESC, /*{*/ '}', }, },
{ -1, -1, -1, -1, -1, 2, { ESC, '|', }, },
/* SS2/3 */
{ -1, -1, -1, -1, -1, 2, { ESC, 'N', }, },
{ -1, -1, -1, -1, -1, 2, { ESC, 'O', }, },
/* end of records */
// { 0, }
{ 0, 0, 0, 0, 0, 0, { ESC, 0, }, }
};
static int
seqmatch(const char * __restrict s, size_t n,
const struct seqtable * __restrict sp)
{
const int *p;
p = sp->chars;
while ((size_t)(p - sp->chars) < n && p - sp->chars < sp->len) {
switch (*p) {
case ECMA:
if (!isecma(*s))
goto terminate;
break;
case OECMA:
if (*s && strchr("@AB", *s))
break;
else
goto terminate;
case INTERM:
if (!isinterm(*s))
goto terminate;
break;
case CS94:
if (*s && strchr("()*+", *s))
break;
else
goto terminate;
case CS96:
if (*s && strchr(",-./", *s))
break;
else
goto terminate;
default:
if (*s != *p)
goto terminate;
break;
}
p++;
s++;
}
terminate:
return (p - sp->chars);
}
static wchar_t
_ISO2022_sgetwchar(_ISO2022EncodingInfo * __restrict ei __unused,
char * __restrict string, size_t n, char ** __restrict result,
_ISO2022State * __restrict psenc)
{
const struct seqtable *sp;
wchar_t wchar = 0;
int i, cur, nmatch;
while (1) {
/* SI/SO */
if (1 <= n && string[0] == '\017') {
psenc->gl = 0;
string++;
n--;
continue;
}
if (1 <= n && string[0] == '\016') {
psenc->gl = 1;
string++;
n--;
continue;
}
/* SS2/3R */
if (1 <= n && string[0] && strchr("\217\216", string[0])) {
psenc->singlegl = psenc->singlegr =
(string[0] - '\216') + 2;
string++;
n--;
continue;
}
/* eat the letter if this is not ESC */
if (1 <= n && string[0] != '\033')
break;
/* look for a perfect match from escape sequences */
for (sp = &seqtable[0]; sp->len; sp++) {
nmatch = seqmatch(string, n, sp);
if (sp->len == nmatch && n >= (size_t)(sp->len))
break;
}
if (!sp->len)
goto notseq;
if (sp->type != -1) {
if (sp->csoff == -1)
i = 0;
else {
switch (sp->type) {
case CS94:
case CS94MULTI:
i = string[sp->csoff] - '(';
break;
case CS96:
case CS96MULTI:
i = string[sp->csoff] - ',';
break;
default:
return (_ISO2022INVALID);
}
}
psenc->g[i].type = sp->type;
psenc->g[i].final = '\0';
psenc->g[i].interm = '\0';
psenc->g[i].vers = '\0';
/* sp->finaloff must not be -1 */
if (sp->finaloff != -1)
psenc->g[i].final = string[sp->finaloff];
if (sp->intermoff != -1)
psenc->g[i].interm = string[sp->intermoff];
if (sp->versoff != -1)
psenc->g[i].vers = string[sp->versoff];
string += sp->len;
n -= sp->len;
continue;
}
/* LS2/3 */
if (2 <= n && string[0] == '\033' &&
string[1] && strchr("no", string[1])) {
psenc->gl = string[1] - 'n' + 2;
string += 2;
n -= 2;
continue;
}
/* LS1/2/3R */
/* XXX: { for vi showmatch */
if (2 <= n && string[0] == '\033' &&
string[1] && strchr("~}|", string[1])) {
psenc->gr = 3 - (string[1] - '|');
string += 2;
n -= 2;
continue;
}
/* SS2/3 */
if (2 <= n && string[0] == '\033' && string[1] &&
strchr("NO", string[1])) {
psenc->singlegl = (string[1] - 'N') + 2;
string += 2;
n -= 2;
continue;
}
notseq:
/*
* if we've got an unknown escape sequence, eat the ESC at the
* head. otherwise, wait till full escape sequence comes.
*/
for (sp = &seqtable[0]; sp->len; sp++) {
nmatch = seqmatch(string, n, sp);
if (!nmatch)
continue;
/*
* if we are in the middle of escape sequence,
* we still need to wait for more characters to come
*/
if (n < (size_t)(sp->len)) {
if ((size_t)(nmatch) == n) {
if (result)
*result = string;
return (_ISO2022INVALID);
}
} else {
if (nmatch == sp->len) {
/* this case should not happen */
goto eat;
}
}
}
break;
}
eat:
/* no letter to eat */
if (n < 1) {
if (result)
*result = string;
return (_ISO2022INVALID);
}
/* normal chars. always eat C0/C1 as is. */
if (iscntl(*string & 0xff))
cur = -1;
else if (*string & 0x80)
cur = (psenc->singlegr == -1) ? psenc->gr : psenc->singlegr;
else
cur = (psenc->singlegl == -1) ? psenc->gl : psenc->singlegl;
if (cur == -1) {
asis:
wchar = *string++ & 0xff;
if (result)
*result = string;
/* reset single shift state */
psenc->singlegr = psenc->singlegl = -1;
return (wchar);
}
/* length error check */
switch (psenc->g[cur].type) {
case CS94MULTI:
case CS96MULTI:
if (!isthree(psenc->g[cur].final)) {
if (2 <= n &&
(string[0] & 0x80) == (string[1] & 0x80))
break;
} else {
if (3 <= n &&
(string[0] & 0x80) == (string[1] & 0x80) &&
(string[0] & 0x80) == (string[2] & 0x80))
break;
}
/* we still need to wait for more characters to come */
if (result)
*result = string;
return (_ISO2022INVALID);
case CS94:
case CS96:
if (1 <= n)
break;
/* we still need to wait for more characters to come */
if (result)
*result = string;
return (_ISO2022INVALID);
}
/* range check */
switch (psenc->g[cur].type) {
case CS94:
if (!(is94(string[0] & 0x7f)))
goto asis;
break;
case CS96:
if (!(is96(string[0] & 0x7f)))
goto asis;
break;
case CS94MULTI:
if (!(is94(string[0] & 0x7f) && is94(string[1] & 0x7f)))
goto asis;
break;
case CS96MULTI:
if (!(is96(string[0] & 0x7f) && is96(string[1] & 0x7f)))
goto asis;
break;
}
/* extract the character. */
switch (psenc->g[cur].type) {
case CS94:
/* special case for ASCII. */
if (psenc->g[cur].final == 'B' && !psenc->g[cur].interm) {
wchar = *string++;
wchar &= 0x7f;
break;
}
wchar = psenc->g[cur].final;
wchar = (wchar << 8);
wchar |= (psenc->g[cur].interm ? (0x80 | psenc->g[cur].interm) : 0);
wchar = (wchar << 8);
wchar = (wchar << 8) | (*string++ & 0x7f);
break;
case CS96:
/* special case for ISO-8859-1. */
if (psenc->g[cur].final == 'A' && !psenc->g[cur].interm) {
wchar = *string++;
wchar &= 0x7f;
wchar |= 0x80;
break;
}
wchar = psenc->g[cur].final;
wchar = (wchar << 8);
wchar |= (psenc->g[cur].interm ? (0x80 | psenc->g[cur].interm) : 0);
wchar = (wchar << 8);
wchar = (wchar << 8) | (*string++ & 0x7f);
wchar |= 0x80;
break;
case CS94MULTI:
case CS96MULTI:
wchar = psenc->g[cur].final;
wchar = (wchar << 8);
if (isthree(psenc->g[cur].final))
wchar |= (*string++ & 0x7f);
wchar = (wchar << 8) | (*string++ & 0x7f);
wchar = (wchar << 8) | (*string++ & 0x7f);
if (psenc->g[cur].type == CS96MULTI)
wchar |= 0x80;
break;
}
if (result)
*result = string;
/* reset single shift state */
psenc->singlegr = psenc->singlegl = -1;
return (wchar);
}
static int
_citrus_ISO2022_mbrtowc_priv(_ISO2022EncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s,
size_t n, _ISO2022State * __restrict psenc, size_t * __restrict nresult)
{
char *p, *result, *s0;
wchar_t wchar;
int c, chlenbak;
if (*s == NULL) {
_citrus_ISO2022_init_state(ei, psenc);
*nresult = _ENCODING_IS_STATE_DEPENDENT;
return (0);
}
s0 = *s;
c = 0;
chlenbak = psenc->chlen;
/*
* if we have something in buffer, use that.
* otherwise, skip here
*/
if (psenc->chlen > sizeof(psenc->ch)) {
/* illgeal state */
_citrus_ISO2022_init_state(ei, psenc);
goto encoding_error;
}
if (psenc->chlen == 0)
goto emptybuf;
/* buffer is not empty */
p = psenc->ch;
while (psenc->chlen < sizeof(psenc->ch)) {
if (n > 0) {
psenc->ch[psenc->chlen++] = *s0++;
n--;
}
wchar = _ISO2022_sgetwchar(ei, p, psenc->chlen - (p-psenc->ch),
&result, psenc);
c += result - p;
if (wchar != _ISO2022INVALID) {
if (psenc->chlen > (size_t)c)
memmove(psenc->ch, result, psenc->chlen - c);
if (psenc->chlen < (size_t)c)
psenc->chlen = 0;
else
psenc->chlen -= c;
goto output;
}
if (n == 0) {
if ((size_t)(result - p) == psenc->chlen)
/* complete shift sequence. */
psenc->chlen = 0;
goto restart;
}
p = result;
}
/* escape sequence too long? */
goto encoding_error;
emptybuf:
wchar = _ISO2022_sgetwchar(ei, s0, n, &result, psenc);
if (wchar != _ISO2022INVALID) {
c += result - s0;
psenc->chlen = 0;
s0 = result;
goto output;
}
if (result > s0) {
c += (result - s0);
n -= (result - s0);
s0 = result;
if (n > 0)
goto emptybuf;
/* complete shift sequence. */
goto restart;
}
n += c;
if (n < sizeof(psenc->ch)) {
memcpy(psenc->ch, s0 - c, n);
psenc->chlen = n;
s0 = result;
goto restart;
}
/* escape sequence too long? */
encoding_error:
psenc->chlen = 0;
*nresult = (size_t)-1;
return (EILSEQ);
output:
*s = s0;
if (pwc)
*pwc = wchar;
*nresult = wchar ? c - chlenbak : 0;
return (0);
restart:
*s = s0;
*nresult = (size_t)-2;
return (0);
}
static int
recommendation(_ISO2022EncodingInfo * __restrict ei,
_ISO2022Charset * __restrict cs)
{
_ISO2022Charset *recommend;
size_t j;
int i;
/* first, try a exact match. */
for (i = 0; i < 4; i++) {
recommend = ei->recommend[i];
for (j = 0; j < ei->recommendsize[i]; j++) {
if (cs->type != recommend[j].type)
continue;
if (cs->final != recommend[j].final)
continue;
if (cs->interm != recommend[j].interm)
continue;
return (i);
}
}
/* then, try a wildcard match over final char. */
for (i = 0; i < 4; i++) {
recommend = ei->recommend[i];
for (j = 0; j < ei->recommendsize[i]; j++) {
if (cs->type != recommend[j].type)
continue;
if (cs->final && (cs->final != recommend[j].final))
continue;
if (cs->interm && (cs->interm != recommend[j].interm))
continue;
return (i);
}
}
/* there's no recommendation. make a guess. */
if (ei->maxcharset == 0) {
return (0);
} else {
switch (cs->type) {
case CS94:
case CS94MULTI:
return (0);
case CS96:
case CS96MULTI:
return (1);
}
}
return (0);
}
static int
_ISO2022_sputwchar(_ISO2022EncodingInfo * __restrict ei, wchar_t wc,
char * __restrict string, size_t n, char ** __restrict result,
_ISO2022State * __restrict psenc, size_t * __restrict nresult)
{
_ISO2022Charset cs;
char *p;
char tmp[MB_LEN_MAX];
size_t len;
int bit8, i = 0, target;
unsigned char mask;
if (isc0(wc & 0xff)) {
/* go back to INIT0 or ASCII on control chars */
cs = ei->initg[0].final ? ei->initg[0] : ascii;
} else if (isc1(wc & 0xff)) {
/* go back to INIT1 or ISO-8859-1 on control chars */
cs = ei->initg[1].final ? ei->initg[1] : iso88591;
} else if (!(wc & ~0xff)) {
if (wc & 0x80) {
/* special treatment for ISO-8859-1 */
cs = iso88591;
} else {
/* special treatment for ASCII */
cs = ascii;
}
} else {
cs.final = (wc >> 24) & 0x7f;
if ((wc >> 16) & 0x80)
cs.interm = (wc >> 16) & 0x7f;
else
cs.interm = '\0';
if (wc & 0x80)
cs.type = (wc & 0x00007f00) ? CS96MULTI : CS96;
else
cs.type = (wc & 0x00007f00) ? CS94MULTI : CS94;
}
target = recommendation(ei, &cs);
p = tmp;
bit8 = ei->flags & F_8BIT;
/* designate the charset onto the target plane(G0/1/2/3). */
if (psenc->g[target].type == cs.type &&
psenc->g[target].final == cs.final &&
psenc->g[target].interm == cs.interm)
goto planeok;
*p++ = '\033';
if (cs.type == CS94MULTI || cs.type == CS96MULTI)
*p++ = '$';
if (target == 0 && cs.type == CS94MULTI && strchr("@AB", cs.final) &&
!cs.interm && !(ei->flags & F_NOOLD))
;
else if (cs.type == CS94 || cs.type == CS94MULTI)
*p++ = "()*+"[target];
else
*p++ = ",-./"[target];
if (cs.interm)
*p++ = cs.interm;
*p++ = cs.final;
psenc->g[target].type = cs.type;
psenc->g[target].final = cs.final;
psenc->g[target].interm = cs.interm;
planeok:
/* invoke the plane onto GL or GR. */
if (psenc->gl == target)
goto sideok;
if (bit8 && psenc->gr == target)
goto sideok;
if (target == 0 && (ei->flags & F_LS0)) {
*p++ = '\017';
psenc->gl = 0;
} else if (target == 1 && (ei->flags & F_LS1)) {
*p++ = '\016';
psenc->gl = 1;
} else if (target == 2 && (ei->flags & F_LS2)) {
*p++ = '\033';
*p++ = 'n';
psenc->gl = 2;
} else if (target == 3 && (ei->flags & F_LS3)) {
*p++ = '\033';
*p++ = 'o';
psenc->gl = 3;
} else if (bit8 && target == 1 && (ei->flags & F_LS1R)) {
*p++ = '\033';
*p++ = '~';
psenc->gr = 1;
} else if (bit8 && target == 2 && (ei->flags & F_LS2R)) {
*p++ = '\033';
/*{*/
*p++ = '}';
psenc->gr = 2;
} else if (bit8 && target == 3 && (ei->flags & F_LS3R)) {
*p++ = '\033';
*p++ = '|';
psenc->gr = 3;
} else if (target == 2 && (ei->flags & F_SS2)) {
*p++ = '\033';
*p++ = 'N';
psenc->singlegl = 2;
} else if (target == 3 && (ei->flags & F_SS3)) {
*p++ = '\033';
*p++ = 'O';
psenc->singlegl = 3;
} else if (bit8 && target == 2 && (ei->flags & F_SS2R)) {
*p++ = '\216';
*p++ = 'N';
psenc->singlegl = psenc->singlegr = 2;
} else if (bit8 && target == 3 && (ei->flags & F_SS3R)) {
*p++ = '\217';
*p++ = 'O';
psenc->singlegl = psenc->singlegr = 3;
} else
goto ilseq;
sideok:
if (psenc->singlegl == target)
mask = 0x00;
else if (psenc->singlegr == target)
mask = 0x80;
else if (psenc->gl == target)
mask = 0x00;
else if ((ei->flags & F_8BIT) && psenc->gr == target)
mask = 0x80;
else
goto ilseq;
switch (cs.type) {
case CS94:
case CS96:
i = 1;
break;
case CS94MULTI:
case CS96MULTI:
i = !iscntl(wc & 0xff) ?
(isthree(cs.final) ? 3 : 2) : 1;
break;
}
while (i-- > 0)
*p++ = ((wc >> (i << 3)) & 0x7f) | mask;
/* reset single shift state */
psenc->singlegl = psenc->singlegr = -1;
len = (size_t)(p - tmp);
if (n < len) {
if (result)
*result = (char *)0;
*nresult = (size_t)-1;
return (E2BIG);
}
if (result)
*result = string + len;
memcpy(string, tmp, len);
*nresult = len;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
static int
_citrus_ISO2022_put_state_reset(_ISO2022EncodingInfo * __restrict ei,
char * __restrict s, size_t n, _ISO2022State * __restrict psenc,
size_t * __restrict nresult)
{
char *result;
char buf[MB_LEN_MAX];
size_t len;
int ret;
/* XXX state will be modified after this operation... */
ret = _ISO2022_sputwchar(ei, L'\0', buf, sizeof(buf), &result, psenc,
&len);
if (ret) {
*nresult = len;
return (ret);
}
if (sizeof(buf) < len || n < len-1) {
/* XXX should recover state? */
*nresult = (size_t)-1;
return (E2BIG);
}
memcpy(s, buf, len - 1);
*nresult = len - 1;
return (0);
}
static int
_citrus_ISO2022_wcrtomb_priv(_ISO2022EncodingInfo * __restrict ei,
char * __restrict s, size_t n, wchar_t wc,
_ISO2022State * __restrict psenc, size_t * __restrict nresult)
{
char *result;
char buf[MB_LEN_MAX];
size_t len;
int ret;
/* XXX state will be modified after this operation... */
ret = _ISO2022_sputwchar(ei, wc, buf, sizeof(buf), &result, psenc,
&len);
if (ret) {
*nresult = len;
return (ret);
}
if (sizeof(buf) < len || n < len) {
/* XXX should recover state? */
*nresult = (size_t)-1;
return (E2BIG);
}
memcpy(s, buf, len);
*nresult = len;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_ISO2022_stdenc_wctocs(_ISO2022EncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
wchar_t m, nm;
m = wc & 0x7FFF8080;
nm = wc & 0x007F7F7F;
if (m & 0x00800000)
nm &= 0x00007F7F;
else
m &= 0x7F008080;
if (nm & 0x007F0000) {
/* ^3 mark */
m |= 0x007F0000;
} else if (nm & 0x00007F00) {
/* ^2 mark */
m |= 0x00007F00;
}
*csid = (_csid_t)m;
*idx = (_index_t)nm;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_ISO2022_stdenc_cstowc(_ISO2022EncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
*wc = (wchar_t)(csid & 0x7F808080) | (wchar_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_ISO2022_stdenc_get_state_desc_generic(_ISO2022EncodingInfo * __restrict ei __unused,
_ISO2022State * __restrict psenc, int * __restrict rstate)
{
if (psenc->chlen == 0) {
/* XXX: it should distinguish initial and stable. */
*rstate = _STDENC_SDGEN_STABLE;
} else
*rstate = (psenc->ch[0] == '\033') ?
_STDENC_SDGEN_INCOMPLETE_SHIFT :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(ISO2022);
_CITRUS_STDENC_DEF_OPS(ISO2022);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/ISO2022/citrus_iso2022.h b/lib/libiconv_modules/ISO2022/citrus_iso2022.h
index 30cbf012a3b3..5812483ea655 100644
--- a/lib/libiconv_modules/ISO2022/citrus_iso2022.h
+++ b/lib/libiconv_modules/ISO2022/citrus_iso2022.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iso2022.h,v 1.2 2003/06/25 09:51:44 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ISO2022_H_
#define _CITRUS_ISO2022_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(ISO2022);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/JOHAB/citrus_johab.c b/lib/libiconv_modules/JOHAB/citrus_johab.c
index cd50bd3ed0e0..3551f8199a78 100644
--- a/lib/libiconv_modules/JOHAB/citrus_johab.c
+++ b/lib/libiconv_modules/JOHAB/citrus_johab.c
@@ -1,337 +1,336 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_johab.c,v 1.4 2008/06/14 16:01:07 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_johab.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
int chlen;
char ch[2];
} _JOHABState;
typedef struct {
int dummy;
} _JOHABEncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_JOHAB_##m
#define _ENCODING_INFO _JOHABEncodingInfo
#define _ENCODING_STATE _JOHABState
#define _ENCODING_MB_CUR_MAX(_ei_) 2
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_JOHAB_init_state(_JOHABEncodingInfo * __restrict ei __unused,
_JOHABState * __restrict psenc)
{
psenc->chlen = 0;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_JOHAB_pack_state(_JOHABEncodingInfo * __restrict ei __unused,
void * __restrict pspriv, const _JOHABState * __restrict psenc)
{
memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
}
static __inline void
/*ARGSUSED*/
_citrus_JOHAB_unpack_state(_JOHABEncodingInfo * __restrict ei __unused,
_JOHABState * __restrict psenc, const void * __restrict pspriv)
{
memcpy((void *)psenc, pspriv, sizeof(*psenc));
}
#endif
static void
/*ARGSUSED*/
_citrus_JOHAB_encoding_module_uninit(_JOHABEncodingInfo *ei __unused)
{
/* ei may be null */
}
static int
/*ARGSUSED*/
_citrus_JOHAB_encoding_module_init(_JOHABEncodingInfo * __restrict ei __unused,
const void * __restrict var __unused, size_t lenvar __unused)
{
/* ei may be null */
return (0);
}
static __inline bool
ishangul(int l, int t)
{
return ((l >= 0x84 && l <= 0xD3) &&
((t >= 0x41 && t <= 0x7E) || (t >= 0x81 && t <= 0xFE)));
}
static __inline bool
isuda(int l, int t)
{
return ((l == 0xD8) &&
((t >= 0x31 && t <= 0x7E) || (t >= 0x91 && t <= 0xFE)));
}
static __inline bool
ishanja(int l, int t)
{
return (((l >= 0xD9 && l <= 0xDE) || (l >= 0xE0 && l <= 0xF9)) &&
((t >= 0x31 && t <= 0x7E) || (t >= 0x91 && t <= 0xFE)));
}
static int
/*ARGSUSED*/
_citrus_JOHAB_mbrtowc_priv(_JOHABEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_JOHABState * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
int l, t;
if (*s == NULL) {
_citrus_JOHAB_init_state(ei, psenc);
*nresult = _ENCODING_IS_STATE_DEPENDENT;
return (0);
}
s0 = *s;
switch (psenc->chlen) {
case 0:
if (n-- < 1)
goto restart;
l = *s0++ & 0xFF;
if (l <= 0x7F) {
if (pwc != NULL)
*pwc = (wchar_t)l;
*nresult = (l == 0) ? 0 : 1;
*s = s0;
return (0);
}
psenc->ch[psenc->chlen++] = l;
break;
case 1:
l = psenc->ch[0] & 0xFF;
break;
default:
return (EINVAL);
}
if (n-- < 1) {
restart:
*nresult = (size_t)-2;
*s = s0;
return (0);
}
t = *s0++ & 0xFF;
if (!ishangul(l, t) && !isuda(l, t) && !ishanja(l, t)) {
*nresult = (size_t)-1;
return (EILSEQ);
}
if (pwc != NULL)
*pwc = (wchar_t)(l << 8 | t);
*nresult = s0 - *s;
*s = s0;
psenc->chlen = 0;
return (0);
}
static int
/*ARGSUSED*/
_citrus_JOHAB_wcrtomb_priv(_JOHABEncodingInfo * __restrict ei __unused,
char * __restrict s, size_t n, wchar_t wc,
_JOHABState * __restrict psenc, size_t * __restrict nresult)
{
int l, t;
if (psenc->chlen != 0)
return (EINVAL);
/* XXX assume wchar_t as int */
if ((uint32_t)wc <= 0x7F) {
if (n < 1)
goto e2big;
*s = wc & 0xFF;
*nresult = 1;
} else if ((uint32_t)wc <= 0xFFFF) {
if (n < 2) {
e2big:
*nresult = (size_t)-1;
return (E2BIG);
}
l = (wc >> 8) & 0xFF;
t = wc & 0xFF;
if (!ishangul(l, t) && !isuda(l, t) && !ishanja(l, t))
goto ilseq;
*s++ = l;
*s = t;
*nresult = 2;
} else {
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_JOHAB_stdenc_wctocs(_JOHABEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
int m, l, linear, t;
/* XXX assume wchar_t as int */
if ((uint32_t)wc <= 0x7F) {
*idx = (_index_t)wc;
*csid = 0;
} else if ((uint32_t)wc <= 0xFFFF) {
l = (wc >> 8) & 0xFF;
t = wc & 0xFF;
if (ishangul(l, t) || isuda(l, t)) {
*idx = (_index_t)wc;
*csid = 1;
} else {
if (l >= 0xD9 && l <= 0xDE) {
linear = l - 0xD9;
m = 0x21;
} else if (l >= 0xE0 && l <= 0xF9) {
linear = l - 0xE0;
m = 0x4A;
} else
return (EILSEQ);
linear *= 188;
if (t >= 0x31 && t <= 0x7E)
linear += t - 0x31;
else if (t >= 0x91 && t <= 0xFE)
linear += t - 0x43;
else
return (EILSEQ);
l = (linear / 94) + m;
t = (linear % 94) + 0x21;
*idx = (_index_t)((l << 8) | t);
*csid = 2;
}
} else
return (EILSEQ);
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_JOHAB_stdenc_cstowc(_JOHABEncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
int m, n, l, linear, t;
switch (csid) {
case 0:
case 1:
*wc = (wchar_t)idx;
break;
case 2:
if (idx >= 0x2121 && idx <= 0x2C71) {
m = 0xD9;
n = 0x21;
} else if (idx >= 0x4A21 && idx <= 0x7D7E) {
m = 0xE0;
n = 0x4A;
} else
return (EILSEQ);
l = ((idx >> 8) & 0xFF) - n;
t = (idx & 0xFF) - 0x21;
linear = (l * 94) + t;
l = (linear / 188) + m;
t = linear % 188;
t += (t <= 0x4D) ? 0x31 : 0x43;
break;
default:
return (EILSEQ);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_JOHAB_stdenc_get_state_desc_generic(_JOHABEncodingInfo * __restrict ei __unused,
_JOHABState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(JOHAB);
_CITRUS_STDENC_DEF_OPS(JOHAB);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/JOHAB/citrus_johab.h b/lib/libiconv_modules/JOHAB/citrus_johab.h
index c91ffea023a0..bbf1df4c7027 100644
--- a/lib/libiconv_modules/JOHAB/citrus_johab.h
+++ b/lib/libiconv_modules/JOHAB/citrus_johab.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_johab.h,v 1.1 2006/10/18 17:54:55 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_JOHAB_H_
#define _CITRUS_JOHAB_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(JOHAB);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/MSKanji/citrus_mskanji.c b/lib/libiconv_modules/MSKanji/citrus_mskanji.c
index 423ea3b8592f..997221dcb3ab 100644
--- a/lib/libiconv_modules/MSKanji/citrus_mskanji.c
+++ b/lib/libiconv_modules/MSKanji/citrus_mskanji.c
@@ -1,477 +1,476 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mskanji.c,v 1.13 2008/06/14 16:01:08 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* ja_JP.SJIS locale table for BSD4.4/rune
* version 1.0
* (C) Sin'ichiro MIYATANI / Phase One, Inc
* May 12, 1995
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Phase One, Inc.
* 4. The name of Phase One, Inc. may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_mskanji.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct _MSKanjiState {
int chlen;
char ch[2];
} _MSKanjiState;
typedef struct {
int mode;
#define MODE_JIS2004 1
} _MSKanjiEncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_MSKanji_##m
#define _ENCODING_INFO _MSKanjiEncodingInfo
#define _ENCODING_STATE _MSKanjiState
#define _ENCODING_MB_CUR_MAX(_ei_) 2
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static bool
_mskanji1(int c)
{
return ((c >= 0x81 && c <= 0x9f) || (c >= 0xe0 && c <= 0xfc));
}
static bool
_mskanji2(int c)
{
return ((c >= 0x40 && c <= 0x7e) || (c >= 0x80 && c <= 0xfc));
}
static __inline void
/*ARGSUSED*/
_citrus_MSKanji_init_state(_MSKanjiEncodingInfo * __restrict ei __unused,
_MSKanjiState * __restrict s)
{
s->chlen = 0;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_MSKanji_pack_state(_MSKanjiEncodingInfo * __restrict ei __unused,
void * __restrict pspriv, const _MSKanjiState * __restrict s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_MSKanji_unpack_state(_MSKanjiEncodingInfo * __restrict ei __unused,
_MSKanjiState * __restrict s, const void * __restrict pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static int
/*ARGSUSED*/
_citrus_MSKanji_mbrtowc_priv(_MSKanjiEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_MSKanjiState * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
wchar_t wchar;
int chlenbak, len;
s0 = *s;
if (s0 == NULL) {
_citrus_MSKanji_init_state(ei, psenc);
*nresult = 0; /* state independent */
return (0);
}
chlenbak = psenc->chlen;
/* make sure we have the first byte in the buffer */
switch (psenc->chlen) {
case 0:
if (n < 1)
goto restart;
psenc->ch[0] = *s0++;
psenc->chlen = 1;
n--;
break;
case 1:
break;
default:
/* illegal state */
goto encoding_error;
}
len = _mskanji1(psenc->ch[0] & 0xff) ? 2 : 1;
while (psenc->chlen < len) {
if (n < 1)
goto restart;
psenc->ch[psenc->chlen] = *s0++;
psenc->chlen++;
n--;
}
*s = s0;
switch (len) {
case 1:
wchar = psenc->ch[0] & 0xff;
break;
case 2:
if (!_mskanji2(psenc->ch[1] & 0xff))
goto encoding_error;
wchar = ((psenc->ch[0] & 0xff) << 8) | (psenc->ch[1] & 0xff);
break;
default:
/* illegal state */
goto encoding_error;
}
psenc->chlen = 0;
if (pwc)
*pwc = wchar;
*nresult = wchar ? len - chlenbak : 0;
return (0);
encoding_error:
psenc->chlen = 0;
*nresult = (size_t)-1;
return (EILSEQ);
restart:
*nresult = (size_t)-2;
*s = s0;
return (0);
}
static int
_citrus_MSKanji_wcrtomb_priv(_MSKanjiEncodingInfo * __restrict ei __unused,
char * __restrict s, size_t n, wchar_t wc,
_MSKanjiState * __restrict psenc __unused, size_t * __restrict nresult)
{
int ret;
/* check invalid sequence */
if (wc & ~0xffff) {
ret = EILSEQ;
goto err;
}
if (wc & 0xff00) {
if (n < 2) {
ret = E2BIG;
goto err;
}
s[0] = (wc >> 8) & 0xff;
s[1] = wc & 0xff;
if (!_mskanji1(s[0] & 0xff) || !_mskanji2(s[1] & 0xff)) {
ret = EILSEQ;
goto err;
}
*nresult = 2;
return (0);
} else {
if (n < 1) {
ret = E2BIG;
goto err;
}
s[0] = wc & 0xff;
if (_mskanji1(s[0] & 0xff)) {
ret = EILSEQ;
goto err;
}
*nresult = 1;
return (0);
}
err:
*nresult = (size_t)-1;
return (ret);
}
static __inline int
/*ARGSUSED*/
_citrus_MSKanji_stdenc_wctocs(_MSKanjiEncodingInfo * __restrict ei,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
_index_t col, row;
int offset;
if ((_wc_t)wc < 0x80) {
/* ISO-646 */
*csid = 0;
*idx = (_index_t)wc;
} else if ((_wc_t)wc < 0x100) {
/* KANA */
*csid = 1;
*idx = (_index_t)wc & 0x7F;
} else {
/* Kanji (containing Gaiji zone) */
/*
* 94^2 zone (contains a part of Gaiji (0xED40 - 0xEEFC)):
* 0x8140 - 0x817E -> 0x2121 - 0x215F
* 0x8180 - 0x819E -> 0x2160 - 0x217E
* 0x819F - 0x81FC -> 0x2221 - 0x227E
*
* 0x8240 - 0x827E -> 0x2321 - 0x235F
* ...
* 0x9F9F - 0x9FFc -> 0x5E21 - 0x5E7E
*
* 0xE040 - 0xE07E -> 0x5F21 - 0x5F5F
* ...
* 0xEF9F - 0xEFFC -> 0x7E21 - 0x7E7E
*
* extended Gaiji zone:
* 0xF040 - 0xFCFC
*
* JIS X0213-plane2:
* 0xF040 - 0xF09E -> 0x2121 - 0x217E
* 0xF140 - 0xF19E -> 0x2321 - 0x237E
* ...
* 0xF240 - 0xF29E -> 0x2521 - 0x257E
*
* 0xF09F - 0xF0FC -> 0x2821 - 0x287E
* 0xF29F - 0xF2FC -> 0x2C21 - 0x2C7E
* ...
* 0xF44F - 0xF49E -> 0x2F21 - 0x2F7E
*
* 0xF49F - 0xF4FC -> 0x6E21 - 0x6E7E
* ...
* 0xFC9F - 0xFCFC -> 0x7E21 - 0x7E7E
*/
row = ((_wc_t)wc >> 8) & 0xFF;
col = (_wc_t)wc & 0xFF;
if (!_mskanji1(row) || !_mskanji2(col))
return (EILSEQ);
if ((ei->mode & MODE_JIS2004) == 0 || row < 0xF0) {
*csid = 2;
offset = 0x81;
} else {
*csid = 3;
if ((_wc_t)wc <= 0xF49E) {
offset = (_wc_t)wc >= 0xF29F ||
((_wc_t)wc >= 0xF09F &&
(_wc_t)wc <= 0xF0FC) ? 0xED : 0xF0;
} else
offset = 0xCE;
}
row -= offset;
if (row >= 0x5F)
row -= 0x40;
row = row * 2 + 0x21;
col -= 0x1F;
if (col >= 0x61)
col -= 1;
if (col > 0x7E) {
row += 1;
col -= 0x5E;
}
*idx = ((_index_t)row << 8) | col;
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_MSKanji_stdenc_cstowc(_MSKanjiEncodingInfo * __restrict ei,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
uint32_t col, row;
int offset;
switch (csid) {
case 0:
/* ISO-646 */
if (idx >= 0x80)
return (EILSEQ);
*wc = (wchar_t)idx;
break;
case 1:
/* kana */
if (idx >= 0x80)
return (EILSEQ);
*wc = (wchar_t)idx + 0x80;
break;
case 3:
if ((ei->mode & MODE_JIS2004) == 0)
return (EILSEQ);
/*FALLTHROUGH*/
case 2:
/* kanji */
row = (idx >> 8);
if (row < 0x21)
return (EILSEQ);
if (csid == 3) {
if (row <= 0x2F)
offset = (row == 0x22 || row >= 0x26) ?
0xED : 0xF0;
else if (row >= 0x4D && row <= 0x7E)
offset = 0xCE;
else
return (EILSEQ);
} else {
if (row > 0x97)
return (EILSEQ);
offset = (row < 0x5F) ? 0x81 : 0xC1;
}
col = idx & 0xFF;
if (col < 0x21 || col > 0x7E)
return (EILSEQ);
row -= 0x21; col -= 0x21;
if ((row & 1) == 0) {
col += 0x40;
if (col >= 0x7F)
col += 1;
} else
col += 0x9F;
row = row / 2 + offset;
*wc = ((wchar_t)row << 8) | col;
break;
default:
return (EILSEQ);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_MSKanji_stdenc_get_state_desc_generic(_MSKanjiEncodingInfo * __restrict ei __unused,
_MSKanjiState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
static int
/*ARGSUSED*/
_citrus_MSKanji_encoding_module_init(_MSKanjiEncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
const char *p;
p = var;
memset((void *)ei, 0, sizeof(*ei));
while (lenvar > 0) {
switch (_bcs_toupper(*p)) {
case 'J':
MATCH(JIS2004, ei->mode |= MODE_JIS2004);
break;
}
++p;
--lenvar;
}
return (0);
}
static void
_citrus_MSKanji_encoding_module_uninit(_MSKanjiEncodingInfo *ei __unused)
{
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(MSKanji);
_CITRUS_STDENC_DEF_OPS(MSKanji);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/MSKanji/citrus_mskanji.h b/lib/libiconv_modules/MSKanji/citrus_mskanji.h
index 36f79f26ce6b..4e8a57e928ed 100644
--- a/lib/libiconv_modules/MSKanji/citrus_mskanji.h
+++ b/lib/libiconv_modules/MSKanji/citrus_mskanji.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mskanji.h,v 1.2 2003/06/25 09:51:48 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MSKANJI_H_
#define _CITRUS_MSKANJI_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(MSKanji);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/UES/citrus_ues.c b/lib/libiconv_modules/UES/citrus_ues.c
index 1c7b83687854..083b2fa70b0c 100644
--- a/lib/libiconv_modules/UES/citrus_ues.c
+++ b/lib/libiconv_modules/UES/citrus_ues.c
@@ -1,416 +1,415 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_ues.c,v 1.3 2012/02/12 13:51:29 wiz Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_ues.h"
typedef struct {
size_t mb_cur_max;
int mode;
#define MODE_C99 1
} _UESEncodingInfo;
typedef struct {
int chlen;
char ch[12];
} _UESState;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_UES_##m
#define _ENCODING_INFO _UESEncodingInfo
#define _ENCODING_STATE _UESState
#define _ENCODING_MB_CUR_MAX(_ei_) (_ei_)->mb_cur_max
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_UES_init_state(_UESEncodingInfo * __restrict ei __unused,
_UESState * __restrict psenc)
{
psenc->chlen = 0;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_UES_pack_state(_UESEncodingInfo * __restrict ei __unused,
void *__restrict pspriv, const _UESState * __restrict psenc)
{
memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
}
static __inline void
/*ARGSUSED*/
_citrus_UES_unpack_state(_UESEncodingInfo * __restrict ei __unused,
_UESState * __restrict psenc, const void * __restrict pspriv)
{
memcpy((void *)psenc, pspriv, sizeof(*psenc));
}
#endif
static __inline int
to_int(int ch)
{
if (ch >= '0' && ch <= '9')
return (ch - '0');
else if (ch >= 'A' && ch <= 'F')
return ((ch - 'A') + 10);
else if (ch >= 'a' && ch <= 'f')
return ((ch - 'a') + 10);
return (-1);
}
#define ESCAPE '\\'
#define UCS2_ESC 'u'
#define UCS4_ESC 'U'
#define UCS2_BIT 16
#define UCS4_BIT 32
#define BMP_MAX UINT32_C(0xFFFF)
#define UCS2_MAX UINT32_C(0x10FFFF)
#define UCS4_MAX UINT32_C(0x7FFFFFFF)
static const char *xdig = "0123456789abcdef";
static __inline int
to_str(char *s, wchar_t wc, int bit)
{
char *p;
p = s;
*p++ = ESCAPE;
switch (bit) {
case UCS2_BIT:
*p++ = UCS2_ESC;
break;
case UCS4_BIT:
*p++ = UCS4_ESC;
break;
default:
abort();
}
do {
*p++ = xdig[(wc >> (bit -= 4)) & 0xF];
} while (bit > 0);
return (p - s);
}
static __inline bool
is_hi_surrogate(wchar_t wc)
{
return (wc >= 0xD800 && wc <= 0xDBFF);
}
static __inline bool
is_lo_surrogate(wchar_t wc)
{
return (wc >= 0xDC00 && wc <= 0xDFFF);
}
static __inline wchar_t
surrogate_to_ucs(wchar_t hi, wchar_t lo)
{
hi -= 0xD800;
lo -= 0xDC00;
return ((hi << 10 | lo) + 0x10000);
}
static __inline void
ucs_to_surrogate(wchar_t wc, wchar_t * __restrict hi, wchar_t * __restrict lo)
{
wc -= 0x10000;
*hi = (wc >> 10) + 0xD800;
*lo = (wc & 0x3FF) + 0xDC00;
}
static __inline bool
is_basic(wchar_t wc)
{
return ((uint32_t)wc <= 0x9F && wc != 0x24 && wc != 0x40 &&
wc != 0x60);
}
static int
_citrus_UES_mbrtowc_priv(_UESEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_UESState * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
int ch, head, num, tail;
wchar_t hi, wc;
if (*s == NULL) {
_citrus_UES_init_state(ei, psenc);
*nresult = 0;
return (0);
}
s0 = *s;
hi = (wchar_t)0;
tail = 0;
surrogate:
wc = (wchar_t)0;
head = tail;
if (psenc->chlen == head) {
if (n-- < 1)
goto restart;
psenc->ch[psenc->chlen++] = *s0++;
}
ch = (unsigned char)psenc->ch[head++];
if (ch == ESCAPE) {
if (psenc->chlen == head) {
if (n-- < 1)
goto restart;
psenc->ch[psenc->chlen++] = *s0++;
}
switch (psenc->ch[head]) {
case UCS2_ESC:
tail += 6;
break;
case UCS4_ESC:
if (ei->mode & MODE_C99) {
tail = 10;
break;
}
/*FALLTHROUGH*/
default:
tail = 0;
}
++head;
}
for (; head < tail; ++head) {
if (psenc->chlen == head) {
if (n-- < 1) {
restart:
*s = s0;
*nresult = (size_t)-2;
return (0);
}
psenc->ch[psenc->chlen++] = *s0++;
}
num = to_int((int)(unsigned char)psenc->ch[head]);
if (num < 0) {
tail = 0;
break;
}
wc = (wc << 4) | num;
}
head = 0;
switch (tail) {
case 0:
break;
case 6:
if (hi != (wchar_t)0)
break;
if ((ei->mode & MODE_C99) == 0) {
if (is_hi_surrogate(wc) != 0) {
hi = wc;
goto surrogate;
}
if ((uint32_t)wc <= 0x7F /* XXX */ ||
is_lo_surrogate(wc) != 0)
break;
goto done;
}
/*FALLTHROUGH*/
case 10:
if (is_basic(wc) == 0 && (uint32_t)wc <= UCS4_MAX &&
is_hi_surrogate(wc) == 0 && is_lo_surrogate(wc) == 0)
goto done;
*nresult = (size_t)-1;
return (EILSEQ);
case 12:
if (is_lo_surrogate(wc) == 0)
break;
wc = surrogate_to_ucs(hi, wc);
goto done;
}
ch = (unsigned char)psenc->ch[0];
head = psenc->chlen;
if (--head > 0)
memmove(&psenc->ch[0], &psenc->ch[1], head);
wc = (wchar_t)ch;
done:
psenc->chlen = head;
if (pwc != NULL)
*pwc = wc;
*nresult = (size_t)((wc == 0) ? 0 : (s0 - *s));
*s = s0;
return (0);
}
static int
_citrus_UES_wcrtomb_priv(_UESEncodingInfo * __restrict ei,
char * __restrict s, size_t n, wchar_t wc,
_UESState * __restrict psenc, size_t * __restrict nresult)
{
wchar_t hi, lo;
if (psenc->chlen != 0)
return (EINVAL);
if ((ei->mode & MODE_C99) ? is_basic(wc) : (uint32_t)wc <= 0x7F) {
if (n-- < 1)
goto e2big;
psenc->ch[psenc->chlen++] = (char)wc;
} else if ((uint32_t)wc <= BMP_MAX) {
if (n < 6)
goto e2big;
psenc->chlen = to_str(&psenc->ch[0], wc, UCS2_BIT);
} else if ((ei->mode & MODE_C99) == 0 && (uint32_t)wc <= UCS2_MAX) {
if (n < 12)
goto e2big;
ucs_to_surrogate(wc, &hi, &lo);
psenc->chlen += to_str(&psenc->ch[0], hi, UCS2_BIT);
psenc->chlen += to_str(&psenc->ch[6], lo, UCS2_BIT);
} else if ((ei->mode & MODE_C99) && (uint32_t)wc <= UCS4_MAX) {
if (n < 10)
goto e2big;
psenc->chlen = to_str(&psenc->ch[0], wc, UCS4_BIT);
} else {
*nresult = (size_t)-1;
return (EILSEQ);
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
psenc->chlen = 0;
return (0);
e2big:
*nresult = (size_t)-1;
return (E2BIG);
}
/*ARGSUSED*/
static int
_citrus_UES_stdenc_wctocs(_UESEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
*csid = 0;
*idx = (_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UES_stdenc_cstowc(_UESEncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
if (csid != 0)
return (EILSEQ);
*wc = (wchar_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UES_stdenc_get_state_desc_generic(_UESEncodingInfo * __restrict ei __unused,
_UESState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
static void
/*ARGSUSED*/
_citrus_UES_encoding_module_uninit(_UESEncodingInfo *ei __unused)
{
/* ei seems to be unused */
}
static int
/*ARGSUSED*/
_citrus_UES_encoding_module_init(_UESEncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
const char *p;
p = var;
memset((void *)ei, 0, sizeof(*ei));
while (lenvar > 0) {
switch (_bcs_toupper(*p)) {
case 'C':
MATCH(C99, ei->mode |= MODE_C99);
break;
}
++p;
--lenvar;
}
ei->mb_cur_max = (ei->mode & MODE_C99) ? 10 : 12;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(UES);
_CITRUS_STDENC_DEF_OPS(UES);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/UES/citrus_ues.h b/lib/libiconv_modules/UES/citrus_ues.h
index 82c13ac2b7ab..84d708244066 100644
--- a/lib/libiconv_modules/UES/citrus_ues.h
+++ b/lib/libiconv_modules/UES/citrus_ues.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_ues.h,v 1.1 2006/11/13 15:16:31 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_UES_H_
#define _CITRUS_UES_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(UES);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/UTF1632/citrus_utf1632.c b/lib/libiconv_modules/UTF1632/citrus_utf1632.c
index b9625165051c..8f3e9ce1027f 100644
--- a/lib/libiconv_modules/UTF1632/citrus_utf1632.c
+++ b/lib/libiconv_modules/UTF1632/citrus_utf1632.c
@@ -1,455 +1,454 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_utf1632.c,v 1.9 2008/06/14 16:01:08 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_bcs.h"
#include "citrus_utf1632.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
int chlen;
int current_endian;
uint8_t ch[4];
} _UTF1632State;
#define _ENDIAN_UNKNOWN 0
#define _ENDIAN_BIG 1
#define _ENDIAN_LITTLE 2
#if BYTE_ORDER == BIG_ENDIAN
#define _ENDIAN_INTERNAL _ENDIAN_BIG
#define _ENDIAN_SWAPPED _ENDIAN_LITTLE
#else
#define _ENDIAN_INTERNAL _ENDIAN_LITTLE
#define _ENDIAN_SWAPPED _ENDIAN_BIG
#endif
#define _MODE_UTF32 0x00000001U
#define _MODE_FORCE_ENDIAN 0x00000002U
typedef struct {
int preffered_endian;
unsigned int cur_max;
uint32_t mode;
} _UTF1632EncodingInfo;
#define _FUNCNAME(m) _citrus_UTF1632_##m
#define _ENCODING_INFO _UTF1632EncodingInfo
#define _ENCODING_STATE _UTF1632State
#define _ENCODING_MB_CUR_MAX(_ei_) ((_ei_)->cur_max)
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_UTF1632_init_state(_UTF1632EncodingInfo *ei __unused,
_UTF1632State *s)
{
memset(s, 0, sizeof(*s));
}
static int
_citrus_UTF1632_mbrtowc_priv(_UTF1632EncodingInfo *ei, wchar_t *pwc,
char **s, size_t n, _UTF1632State *psenc, size_t *nresult)
{
char *s0;
size_t result;
wchar_t wc = L'\0';
int chlenbak, endian, needlen;
s0 = *s;
if (s0 == NULL) {
_citrus_UTF1632_init_state(ei, psenc);
*nresult = 0; /* state independent */
return (0);
}
result = 0;
chlenbak = psenc->chlen;
refetch:
needlen = ((ei->mode & _MODE_UTF32) != 0 || chlenbak >= 2) ? 4 : 2;
while (chlenbak < needlen) {
if (n == 0)
goto restart;
psenc->ch[chlenbak++] = *s0++;
n--;
result++;
}
/* judge endian marker */
if ((ei->mode & _MODE_UTF32) == 0) {
/* UTF16 */
if (psenc->ch[0] == 0xFE && psenc->ch[1] == 0xFF) {
psenc->current_endian = _ENDIAN_BIG;
chlenbak = 0;
goto refetch;
} else if (psenc->ch[0] == 0xFF && psenc->ch[1] == 0xFE) {
psenc->current_endian = _ENDIAN_LITTLE;
chlenbak = 0;
goto refetch;
}
} else {
/* UTF32 */
if (psenc->ch[0] == 0x00 && psenc->ch[1] == 0x00 &&
psenc->ch[2] == 0xFE && psenc->ch[3] == 0xFF) {
psenc->current_endian = _ENDIAN_BIG;
chlenbak = 0;
goto refetch;
} else if (psenc->ch[0] == 0xFF && psenc->ch[1] == 0xFE &&
psenc->ch[2] == 0x00 && psenc->ch[3] == 0x00) {
psenc->current_endian = _ENDIAN_LITTLE;
chlenbak = 0;
goto refetch;
}
}
endian = ((ei->mode & _MODE_FORCE_ENDIAN) != 0 ||
psenc->current_endian == _ENDIAN_UNKNOWN) ? ei->preffered_endian :
psenc->current_endian;
/* get wc */
if ((ei->mode & _MODE_UTF32) == 0) {
/* UTF16 */
if (needlen == 2) {
switch (endian) {
case _ENDIAN_LITTLE:
wc = (psenc->ch[0] |
((wchar_t)psenc->ch[1] << 8));
break;
case _ENDIAN_BIG:
wc = (psenc->ch[1] |
((wchar_t)psenc->ch[0] << 8));
break;
default:
goto ilseq;
}
if (wc >= 0xD800 && wc <= 0xDBFF) {
/* surrogate high */
needlen = 4;
goto refetch;
}
} else {
/* surrogate low */
wc -= 0xD800; /* wc : surrogate high (see above) */
wc <<= 10;
switch (endian) {
case _ENDIAN_LITTLE:
if (psenc->ch[3] < 0xDC || psenc->ch[3] > 0xDF)
goto ilseq;
wc |= psenc->ch[2];
wc |= (wchar_t)(psenc->ch[3] & 3) << 8;
break;
case _ENDIAN_BIG:
if (psenc->ch[2]<0xDC || psenc->ch[2]>0xDF)
goto ilseq;
wc |= psenc->ch[3];
wc |= (wchar_t)(psenc->ch[2] & 3) << 8;
break;
default:
goto ilseq;
}
wc += 0x10000;
}
} else {
/* UTF32 */
switch (endian) {
case _ENDIAN_LITTLE:
wc = (psenc->ch[0] |
((wchar_t)psenc->ch[1] << 8) |
((wchar_t)psenc->ch[2] << 16) |
((wchar_t)psenc->ch[3] << 24));
break;
case _ENDIAN_BIG:
wc = (psenc->ch[3] |
((wchar_t)psenc->ch[2] << 8) |
((wchar_t)psenc->ch[1] << 16) |
((wchar_t)psenc->ch[0] << 24));
break;
default:
goto ilseq;
}
if (wc >= 0xD800 && wc <= 0xDFFF)
goto ilseq;
}
*pwc = wc;
psenc->chlen = 0;
*nresult = result;
*s = s0;
return (0);
ilseq:
*nresult = (size_t)-1;
psenc->chlen = 0;
return (EILSEQ);
restart:
*nresult = (size_t)-2;
psenc->chlen = chlenbak;
*s = s0;
return (0);
}
static int
_citrus_UTF1632_wcrtomb_priv(_UTF1632EncodingInfo *ei, char *s, size_t n,
wchar_t wc, _UTF1632State *psenc, size_t *nresult)
{
wchar_t wc2;
static const char _bom[4] = {
0x00, 0x00, 0xFE, 0xFF,
};
const char *bom = &_bom[0];
size_t cnt;
cnt = (size_t)0;
if (psenc->current_endian == _ENDIAN_UNKNOWN) {
if ((ei->mode & _MODE_FORCE_ENDIAN) == 0) {
if (ei->mode & _MODE_UTF32)
cnt = 4;
else {
cnt = 2;
bom += 2;
}
if (n < cnt)
goto e2big;
memcpy(s, bom, cnt);
s += cnt, n -= cnt;
}
psenc->current_endian = ei->preffered_endian;
}
wc2 = 0;
if ((ei->mode & _MODE_UTF32)==0) {
/* UTF16 */
if (wc > 0xFFFF) {
/* surrogate */
if (wc > 0x10FFFF)
goto ilseq;
if (n < 4)
goto e2big;
cnt += 4;
wc -= 0x10000;
wc2 = (wc & 0x3FF) | 0xDC00;
wc = (wc>>10) | 0xD800;
} else {
if (n < 2)
goto e2big;
cnt += 2;
}
surrogate:
switch (psenc->current_endian) {
case _ENDIAN_BIG:
s[1] = wc;
s[0] = (wc >>= 8);
break;
case _ENDIAN_LITTLE:
s[0] = wc;
s[1] = (wc >>= 8);
break;
}
if (wc2 != 0) {
wc = wc2;
wc2 = 0;
s += 2;
goto surrogate;
}
} else {
/* UTF32 */
if (wc >= 0xD800 && wc <= 0xDFFF)
goto ilseq;
if (n < 4)
goto e2big;
cnt += 4;
switch (psenc->current_endian) {
case _ENDIAN_BIG:
s[3] = wc;
s[2] = (wc >>= 8);
s[1] = (wc >>= 8);
s[0] = (wc >>= 8);
break;
case _ENDIAN_LITTLE:
s[0] = wc;
s[1] = (wc >>= 8);
s[2] = (wc >>= 8);
s[3] = (wc >>= 8);
break;
}
}
*nresult = cnt;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
e2big:
*nresult = (size_t)-1;
return (E2BIG);
}
static void
parse_variable(_UTF1632EncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
const char *p;
p = var;
while (lenvar > 0) {
switch (*p) {
case 'B':
case 'b':
MATCH(big, ei->preffered_endian = _ENDIAN_BIG);
break;
case 'L':
case 'l':
MATCH(little, ei->preffered_endian = _ENDIAN_LITTLE);
break;
case 'i':
case 'I':
MATCH(internal, ei->preffered_endian = _ENDIAN_INTERNAL);
break;
case 's':
case 'S':
MATCH(swapped, ei->preffered_endian = _ENDIAN_SWAPPED);
break;
case 'F':
case 'f':
MATCH(force, ei->mode |= _MODE_FORCE_ENDIAN);
break;
case 'U':
case 'u':
MATCH(utf32, ei->mode |= _MODE_UTF32);
break;
}
p++;
lenvar--;
}
}
static int
/*ARGSUSED*/
_citrus_UTF1632_encoding_module_init(_UTF1632EncodingInfo * __restrict ei,
const void * __restrict var, size_t lenvar)
{
memset((void *)ei, 0, sizeof(*ei));
parse_variable(ei, var, lenvar);
ei->cur_max = ((ei->mode&_MODE_UTF32) == 0) ? 6 : 8;
/* 6: endian + surrogate */
/* 8: endian + normal */
if (ei->preffered_endian == _ENDIAN_UNKNOWN) {
ei->preffered_endian = _ENDIAN_BIG;
}
return (0);
}
static void
/*ARGSUSED*/
_citrus_UTF1632_encoding_module_uninit(_UTF1632EncodingInfo *ei __unused)
{
}
static __inline int
/*ARGSUSED*/
_citrus_UTF1632_stdenc_wctocs(_UTF1632EncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, _wc_t wc)
{
*csid = 0;
*idx = (_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF1632_stdenc_cstowc(_UTF1632EncodingInfo * __restrict ei __unused,
_wc_t * __restrict wc, _csid_t csid, _index_t idx)
{
if (csid != 0)
return (EILSEQ);
*wc = (_wc_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF1632_stdenc_get_state_desc_generic(_UTF1632EncodingInfo * __restrict ei __unused,
_UTF1632State * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(UTF1632);
_CITRUS_STDENC_DEF_OPS(UTF1632);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/UTF1632/citrus_utf1632.h b/lib/libiconv_modules/UTF1632/citrus_utf1632.h
index 2327f5e14dc8..0a4775b4dbf5 100644
--- a/lib/libiconv_modules/UTF1632/citrus_utf1632.h
+++ b/lib/libiconv_modules/UTF1632/citrus_utf1632.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_utf1632.h,v 1.1 2003/06/25 09:51:49 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_UTF1632_H_
#define _CITRUS_UTF1632_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(UTF1632);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/UTF7/citrus_utf7.c b/lib/libiconv_modules/UTF7/citrus_utf7.c
index b899b1a4f5ba..f924366551f1 100644
--- a/lib/libiconv_modules/UTF7/citrus_utf7.c
+++ b/lib/libiconv_modules/UTF7/citrus_utf7.c
@@ -1,495 +1,494 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_utf7.c,v 1.5 2006/08/23 12:57:24 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004, 2005 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_utf7.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
#define EI_MASK UINT16_C(0xff)
#define EI_DIRECT UINT16_C(0x100)
#define EI_OPTION UINT16_C(0x200)
#define EI_SPACE UINT16_C(0x400)
typedef struct {
uint16_t cell[0x80];
} _UTF7EncodingInfo;
typedef struct {
unsigned int
mode: 1, /* whether base64 mode */
bits: 4, /* need to hold 0 - 15 */
cache: 22; /* 22 = BASE64_BIT + UTF16_BIT */
int chlen;
char ch[4]; /* BASE64_IN, 3 * 6 = 18, most closed to UTF16_BIT */
} _UTF7State;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_UTF7_##m
#define _ENCODING_INFO _UTF7EncodingInfo
#define _ENCODING_STATE _UTF7State
#define _ENCODING_MB_CUR_MAX(_ei_) 4
#define _ENCODING_IS_STATE_DEPENDENT 1
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_UTF7_init_state(_UTF7EncodingInfo * __restrict ei __unused,
_UTF7State * __restrict s)
{
memset((void *)s, 0, sizeof(*s));
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_UTF7_pack_state(_UTF7EncodingInfo * __restrict ei __unused,
void *__restrict pspriv, const _UTF7State * __restrict s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_UTF7_unpack_state(_UTF7EncodingInfo * __restrict ei __unused,
_UTF7State * __restrict s, const void * __restrict pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static const char base64[] =
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"abcdefghijklmnopqrstuvwxyz"
"0123456789+/";
static const char direct[] =
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"abcdefghijklmnopqrstuvwxyz"
"0123456789'(),-./:?";
static const char option[] = "!\"#$%&*;<=>@[]^_`{|}";
static const char spaces[] = " \t\r\n";
#define BASE64_BIT 6
#define UTF16_BIT 16
#define BASE64_MAX 0x3f
#define UTF16_MAX UINT16_C(0xffff)
#define UTF32_MAX UINT32_C(0x10ffff)
#define BASE64_IN '+'
#define BASE64_OUT '-'
#define SHIFT7BIT(c) ((c) >> 7)
#define ISSPECIAL(c) ((c) == '\0' || (c) == BASE64_IN)
#define FINDLEN(ei, c) \
(SHIFT7BIT((c)) ? -1 : (((ei)->cell[(c)] & EI_MASK) - 1))
#define ISDIRECT(ei, c) (!SHIFT7BIT((c)) && (ISSPECIAL((c)) || \
ei->cell[(c)] & (EI_DIRECT | EI_OPTION | EI_SPACE)))
#define ISSAFE(ei, c) (!SHIFT7BIT((c)) && (ISSPECIAL((c)) || \
(c < 0x80 && ei->cell[(c)] & (EI_DIRECT | EI_SPACE))))
/* surrogate pair */
#define SRG_BASE UINT32_C(0x10000)
#define HISRG_MIN UINT16_C(0xd800)
#define HISRG_MAX UINT16_C(0xdbff)
#define LOSRG_MIN UINT16_C(0xdc00)
#define LOSRG_MAX UINT16_C(0xdfff)
static int
_citrus_UTF7_mbtoutf16(_UTF7EncodingInfo * __restrict ei,
uint16_t * __restrict u16, char ** __restrict s, size_t n,
_UTF7State * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
int done, i, len;
*nresult = 0;
s0 = *s;
for (i = 0, done = 0; done == 0; i++) {
if (i == psenc->chlen) {
if (n-- < 1) {
*nresult = (size_t)-2;
*s = s0;
return (0);
}
psenc->ch[psenc->chlen++] = *s0++;
}
if (SHIFT7BIT((int)psenc->ch[i]))
goto ilseq;
if (!psenc->mode) {
if (psenc->bits > 0 || psenc->cache > 0)
return (EINVAL);
if (psenc->ch[i] == BASE64_IN)
psenc->mode = 1;
else {
if (!ISDIRECT(ei, (int)psenc->ch[i]))
goto ilseq;
*u16 = (uint16_t)psenc->ch[i];
done = 1;
continue;
}
} else {
if (psenc->ch[i] == BASE64_OUT && psenc->cache == 0) {
psenc->mode = 0;
*u16 = (uint16_t)BASE64_IN;
done = 1;
continue;
}
len = FINDLEN(ei, (int)psenc->ch[i]);
if (len < 0) {
if (psenc->bits >= BASE64_BIT)
return (EINVAL);
psenc->mode = 0;
psenc->bits = psenc->cache = 0;
if (psenc->ch[i] != BASE64_OUT) {
if (!ISDIRECT(ei, (int)psenc->ch[i]))
goto ilseq;
*u16 = (uint16_t)psenc->ch[i];
done = 1;
} else {
psenc->chlen--;
i--;
}
} else {
psenc->cache =
(psenc->cache << BASE64_BIT) | len;
switch (psenc->bits) {
case 0: case 2: case 4: case 6: case 8:
psenc->bits += BASE64_BIT;
break;
case 10: case 12: case 14:
psenc->bits -= (UTF16_BIT - BASE64_BIT);
*u16 = (psenc->cache >> psenc->bits) &
UTF16_MAX;
done = 1;
break;
default:
return (EINVAL);
}
}
}
}
if (psenc->chlen > i)
return (EINVAL);
psenc->chlen = 0;
*nresult = (size_t)((*u16 == 0) ? 0 : s0 - *s);
*s = s0;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
static int
_citrus_UTF7_mbrtowc_priv(_UTF7EncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_UTF7State * __restrict psenc, size_t * __restrict nresult)
{
uint32_t u32;
uint16_t hi, lo;
size_t nr, siz;
int err;
if (*s == NULL) {
_citrus_UTF7_init_state(ei, psenc);
*nresult = (size_t)_ENCODING_IS_STATE_DEPENDENT;
return (0);
}
err = _citrus_UTF7_mbtoutf16(ei, &hi, s, n, psenc, &nr);
if (nr == (size_t)-1 || nr == (size_t)-2) {
*nresult = nr;
return (err);
}
if (err != 0)
return (err);
n -= nr;
siz = nr;
if (hi < HISRG_MIN || hi > HISRG_MAX) {
u32 = (uint32_t)hi;
goto done;
}
err = _citrus_UTF7_mbtoutf16(ei, &lo, s, n, psenc, &nr);
if (nr == (size_t)-1 || nr == (size_t)-2) {
psenc->chlen = 1; /* make get_state_desc return incomplete */
*nresult = nr;
return (err);
}
if (err != 0)
return (err);
if (lo < LOSRG_MIN || lo > LOSRG_MAX) {
*nresult = (size_t)-1;
return (EILSEQ);
}
hi -= HISRG_MIN;
lo -= LOSRG_MIN;
u32 = (hi << 10 | lo) + SRG_BASE;
siz += nr;
done:
if (pwc != NULL)
*pwc = (wchar_t)u32;
if (u32 == (uint32_t)0) {
*nresult = (size_t)0;
_citrus_UTF7_init_state(ei, psenc);
} else {
*nresult = siz;
}
return (err);
}
static int
_citrus_UTF7_utf16tomb(_UTF7EncodingInfo * __restrict ei,
char * __restrict s, size_t n __unused, uint16_t u16,
_UTF7State * __restrict psenc, size_t * __restrict nresult)
{
int bits, i;
if (psenc->chlen != 0 || psenc->bits > BASE64_BIT)
return (EINVAL);
if (ISSAFE(ei, u16)) {
if (psenc->mode) {
if (psenc->bits > 0) {
bits = BASE64_BIT - psenc->bits;
i = (psenc->cache << bits) & BASE64_MAX;
psenc->ch[psenc->chlen++] = base64[i];
psenc->bits = psenc->cache = 0;
}
if (u16 == BASE64_OUT || FINDLEN(ei, u16) >= 0)
psenc->ch[psenc->chlen++] = BASE64_OUT;
psenc->mode = 0;
}
if (psenc->bits != 0)
return (EINVAL);
psenc->ch[psenc->chlen++] = (char)u16;
if (u16 == BASE64_IN)
psenc->ch[psenc->chlen++] = BASE64_OUT;
} else {
if (!psenc->mode) {
if (psenc->bits > 0)
return (EINVAL);
psenc->ch[psenc->chlen++] = BASE64_IN;
psenc->mode = 1;
}
psenc->cache = (psenc->cache << UTF16_BIT) | u16;
bits = UTF16_BIT + psenc->bits;
psenc->bits = bits % BASE64_BIT;
while ((bits -= BASE64_BIT) >= 0) {
i = (psenc->cache >> bits) & BASE64_MAX;
psenc->ch[psenc->chlen++] = base64[i];
}
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
psenc->chlen = 0;
return (0);
}
static int
_citrus_UTF7_wcrtomb_priv(_UTF7EncodingInfo * __restrict ei,
char * __restrict s, size_t n, wchar_t wchar,
_UTF7State * __restrict psenc, size_t * __restrict nresult)
{
uint32_t u32;
uint16_t u16[2];
int err, i, len;
size_t nr, siz;
u32 = (uint32_t)wchar;
if (u32 <= UTF16_MAX) {
u16[0] = (uint16_t)u32;
len = 1;
} else if (u32 <= UTF32_MAX) {
u32 -= SRG_BASE;
u16[0] = (u32 >> 10) + HISRG_MIN;
u16[1] = ((uint16_t)(u32 & UINT32_C(0x3ff))) + LOSRG_MIN;
len = 2;
} else {
*nresult = (size_t)-1;
return (EILSEQ);
}
siz = 0;
for (i = 0; i < len; ++i) {
err = _citrus_UTF7_utf16tomb(ei, s, n, u16[i], psenc, &nr);
if (err != 0)
return (err); /* XXX: state has been modified */
s += nr;
n -= nr;
siz += nr;
}
*nresult = siz;
return (0);
}
static int
/* ARGSUSED */
_citrus_UTF7_put_state_reset(_UTF7EncodingInfo * __restrict ei __unused,
char * __restrict s, size_t n, _UTF7State * __restrict psenc,
size_t * __restrict nresult)
{
int bits, pos;
if (psenc->chlen != 0 || psenc->bits > BASE64_BIT)
return (EINVAL);
if (psenc->mode) {
if (psenc->bits > 0) {
if (n-- < 1)
return (E2BIG);
bits = BASE64_BIT - psenc->bits;
pos = (psenc->cache << bits) & BASE64_MAX;
psenc->ch[psenc->chlen++] = base64[pos];
psenc->ch[psenc->chlen++] = BASE64_OUT;
psenc->bits = psenc->cache = 0;
}
psenc->mode = 0;
}
if (psenc->bits != 0)
return (EINVAL);
if (n-- < 1)
return (E2BIG);
*nresult = (size_t)psenc->chlen;
if (psenc->chlen > 0) {
memcpy(s, psenc->ch, psenc->chlen);
psenc->chlen = 0;
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF7_stdenc_wctocs(_UTF7EncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
*csid = 0;
*idx = (_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF7_stdenc_cstowc(_UTF7EncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
if (csid != 0)
return (EILSEQ);
*wc = (wchar_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF7_stdenc_get_state_desc_generic(_UTF7EncodingInfo * __restrict ei __unused,
_UTF7State * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
static void
/*ARGSUSED*/
_citrus_UTF7_encoding_module_uninit(_UTF7EncodingInfo *ei __unused)
{
/* ei seems to be unused */
}
static int
/*ARGSUSED*/
_citrus_UTF7_encoding_module_init(_UTF7EncodingInfo * __restrict ei,
const void * __restrict var __unused, size_t lenvar __unused)
{
const char *s;
memset(ei, 0, sizeof(*ei));
#define FILL(str, flag) \
do { \
for (s = str; *s != '\0'; s++) \
ei->cell[*s & 0x7f] |= flag; \
} while (/*CONSTCOND*/0)
FILL(base64, (s - base64) + 1);
FILL(direct, EI_DIRECT);
FILL(option, EI_OPTION);
FILL(spaces, EI_SPACE);
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(UTF7);
_CITRUS_STDENC_DEF_OPS(UTF7);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/UTF7/citrus_utf7.h b/lib/libiconv_modules/UTF7/citrus_utf7.h
index 925e970a90fc..c805cfd79cca 100644
--- a/lib/libiconv_modules/UTF7/citrus_utf7.h
+++ b/lib/libiconv_modules/UTF7/citrus_utf7.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_utf7.h,v 1.1 2005/03/05 18:05:15 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004,2005 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_UTF7_H_
#define _CITRUS_UTF7_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(UTF7);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/UTF8/citrus_utf8.c b/lib/libiconv_modules/UTF8/citrus_utf8.c
index 397823cf6144..c28cc5323c24 100644
--- a/lib/libiconv_modules/UTF8/citrus_utf8.c
+++ b/lib/libiconv_modules/UTF8/citrus_utf8.c
@@ -1,353 +1,352 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_utf8.c,v 1.17 2008/06/14 16:01:08 tnozaki Exp $ */
/*-
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Paul Borman at Krystal Technologies.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_utf8.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
static uint8_t _UTF8_count_array[256] = {
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 00 - 0F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 10 - 1F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 20 - 2F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 30 - 3F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 40 - 4F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 50 - 5F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 60 - 6F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 70 - 7F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 80 - 8F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 90 - 9F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* A0 - AF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* B0 - BF */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* C0 - CF */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* D0 - DF */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* E0 - EF */
4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 0, 0 /* F0 - FF */
};
static uint8_t const *_UTF8_count = _UTF8_count_array;
static const uint32_t _UTF8_range[] = {
0, /*dummy*/
0x00000000, 0x00000080, 0x00000800, 0x00010000,
0x00200000, 0x04000000, 0x80000000,
};
typedef struct {
int chlen;
char ch[6];
} _UTF8State;
typedef void *_UTF8EncodingInfo;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_ei_, _func_) (_ei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_UTF8_##m
#define _ENCODING_INFO _UTF8EncodingInfo
#define _ENCODING_STATE _UTF8State
#define _ENCODING_MB_CUR_MAX(_ei_) 6
#define _ENCODING_IS_STATE_DEPENDENT 0
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static size_t
_UTF8_findlen(wchar_t v)
{
size_t i;
uint32_t c;
c = (uint32_t)v; /*XXX*/
for (i = 1; i < sizeof(_UTF8_range) / sizeof(_UTF8_range[0]) - 1; i++)
if (c >= _UTF8_range[i] && c < _UTF8_range[i + 1])
return (i);
return (-1); /*out of range*/
}
static __inline bool
_UTF8_surrogate(wchar_t wc)
{
return (wc >= 0xd800 && wc <= 0xdfff);
}
static __inline void
/*ARGSUSED*/
_citrus_UTF8_init_state(_UTF8EncodingInfo *ei __unused, _UTF8State *s)
{
s->chlen = 0;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_UTF8_pack_state(_UTF8EncodingInfo *ei __unused, void *pspriv,
const _UTF8State *s)
{
memcpy(pspriv, (const void *)s, sizeof(*s));
}
static __inline void
/*ARGSUSED*/
_citrus_UTF8_unpack_state(_UTF8EncodingInfo *ei __unused, _UTF8State *s,
const void *pspriv)
{
memcpy((void *)s, pspriv, sizeof(*s));
}
#endif
static int
_citrus_UTF8_mbrtowc_priv(_UTF8EncodingInfo *ei, wchar_t *pwc, char **s,
size_t n, _UTF8State *psenc, size_t *nresult)
{
char *s0;
wchar_t wchar;
int i;
uint8_t c;
s0 = *s;
if (s0 == NULL) {
_citrus_UTF8_init_state(ei, psenc);
*nresult = 0; /* state independent */
return (0);
}
/* make sure we have the first byte in the buffer */
if (psenc->chlen == 0) {
if (n-- < 1)
goto restart;
psenc->ch[psenc->chlen++] = *s0++;
}
c = _UTF8_count[psenc->ch[0] & 0xff];
if (c < 1 || c < psenc->chlen)
goto ilseq;
if (c == 1)
wchar = psenc->ch[0] & 0xff;
else {
while (psenc->chlen < c) {
if (n-- < 1)
goto restart;
psenc->ch[psenc->chlen++] = *s0++;
}
wchar = psenc->ch[0] & (0x7f >> c);
for (i = 1; i < c; i++) {
if ((psenc->ch[i] & 0xc0) != 0x80)
goto ilseq;
wchar <<= 6;
wchar |= (psenc->ch[i] & 0x3f);
}
if (_UTF8_surrogate(wchar) || _UTF8_findlen(wchar) != c)
goto ilseq;
}
if (pwc != NULL)
*pwc = wchar;
*nresult = (wchar == 0) ? 0 : s0 - *s;
*s = s0;
psenc->chlen = 0;
return (0);
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
restart:
*s = s0;
*nresult = (size_t)-2;
return (0);
}
static int
_citrus_UTF8_wcrtomb_priv(_UTF8EncodingInfo *ei __unused, char *s, size_t n,
wchar_t wc, _UTF8State *psenc __unused, size_t *nresult)
{
wchar_t c;
size_t cnt;
int i, ret;
if (_UTF8_surrogate(wc)) {
ret = EILSEQ;
goto err;
}
cnt = _UTF8_findlen(wc);
if (cnt <= 0 || cnt > 6) {
/* invalid UCS4 value */
ret = EILSEQ;
goto err;
}
if (n < cnt) {
/* bound check failure */
ret = E2BIG;
goto err;
}
c = wc;
if (s) {
for (i = cnt - 1; i > 0; i--) {
s[i] = 0x80 | (c & 0x3f);
c >>= 6;
}
s[0] = c;
if (cnt == 1)
s[0] &= 0x7f;
else {
s[0] &= (0x7f >> cnt);
s[0] |= ((0xff00 >> cnt) & 0xff);
}
}
*nresult = (size_t)cnt;
return (0);
err:
*nresult = (size_t)-1;
return (ret);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF8_stdenc_wctocs(_UTF8EncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx,
wchar_t wc)
{
*csid = 0;
*idx = (_citrus_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF8_stdenc_cstowc(_UTF8EncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
if (csid != 0)
return (EILSEQ);
*wc = (wchar_t)idx;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_UTF8_stdenc_get_state_desc_generic(_UTF8EncodingInfo * __restrict ei __unused,
_UTF8State * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ? _STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
static int
/*ARGSUSED*/
_citrus_UTF8_encoding_module_init(_UTF8EncodingInfo * __restrict ei __unused,
const void * __restrict var __unused, size_t lenvar __unused)
{
return (0);
}
static void
/*ARGSUSED*/
_citrus_UTF8_encoding_module_uninit(_UTF8EncodingInfo *ei __unused)
{
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(UTF8);
_CITRUS_STDENC_DEF_OPS(UTF8);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/UTF8/citrus_utf8.h b/lib/libiconv_modules/UTF8/citrus_utf8.h
index 033d4ad659e9..6e7b403c9366 100644
--- a/lib/libiconv_modules/UTF8/citrus_utf8.h
+++ b/lib/libiconv_modules/UTF8/citrus_utf8.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_utf8.h,v 1.2 2003/06/25 09:51:49 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2002 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_UTF8_H_
#define _CITRUS_UTF8_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(UTF8);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/VIQR/citrus_viqr.c b/lib/libiconv_modules/VIQR/citrus_viqr.c
index f40910d8edf3..1747c0a1705e 100644
--- a/lib/libiconv_modules/VIQR/citrus_viqr.c
+++ b/lib/libiconv_modules/VIQR/citrus_viqr.c
@@ -1,500 +1,499 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_viqr.c,v 1.5 2011/11/19 18:20:13 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_viqr.h"
#define ESCAPE '\\'
/*
* this table generated from RFC 1456.
*/
static const char *mnemonic_rfc1456[0x100] = {
NULL , NULL , "A(?", NULL , NULL , "A(~", "A^~", NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , "Y?" , NULL , NULL , NULL ,
NULL , "Y~" , NULL , NULL , NULL , NULL , "Y." , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
NULL , NULL , NULL , NULL , NULL , NULL , NULL , NULL ,
"A." , "A('", "A(`", "A(.", "A^'", "A^`", "A^?", "A^.",
"E~" , "E." , "E^'", "E^`", "E^?", "E^~", "E^.", "O^'",
"O^`", "O^?", "O^~", "O^.", "O+.", "O+'", "O+`", "O+?",
"I." , "O?" , "O." , "I?" , "U?" , "U~" , "U." , "Y`" ,
"O~" , "a('", "a(`", "a(.", "a^'", "a^`", "a^?", "a^.",
"e~" , "e." , "e^'", "e^`", "e^?", "e^~", "e^.", "o^'",
"o^`", "o^?", "o^~", "O+~", "O+" , "o^.", "o+`", "o+?",
"i." , "U+.", "U+'", "U+`", "U+?", "o+" , "o+'", "U+" ,
"A`" , "A'" , "A^" , "A~" , "A?" , "A(" , "a(?", "a(~",
"E`" , "E'" , "E^" , "E?" , "I`" , "I'" , "I~" , "y`" ,
"DD" , "u+'", "O`" , "O'" , "O^" , "a." , "y?" , "u+`",
"u+?", "U`" , "U'" , "y~" , "y." , "Y'" , "o+~", "u+" ,
"a`" , "a'" , "a^" , "a~" , "a?" , "a(" , "u+~", "a^~",
"e`" , "e'" , "e^" , "e?" , "i`" , "i'" , "i~" , "i?" ,
"dd" , "u+.", "o`" , "o'" , "o^" , "o~" , "o?" , "o." ,
"u." , "u`" , "u'" , "u~" , "u?" , "y'" , "o+.", "U+~",
};
typedef struct {
const char *name;
wchar_t value;
} mnemonic_def_t;
static const mnemonic_def_t mnemonic_ext[] = {
/* add extra mnemonic here (should be sorted by wchar_t order). */
};
static const size_t mnemonic_ext_size =
sizeof(mnemonic_ext) / sizeof(mnemonic_def_t);
static const char *
mnemonic_ext_find(wchar_t wc, const mnemonic_def_t *head, size_t n)
{
const mnemonic_def_t *mid;
for (; n > 0; n >>= 1) {
mid = head + (n >> 1);
if (mid->value == wc)
return (mid->name);
else if (mid->value < wc) {
head = mid + 1;
--n;
}
}
return (NULL);
}
struct mnemonic_t;
typedef TAILQ_HEAD(mnemonic_list_t, mnemonic_t) mnemonic_list_t;
typedef struct mnemonic_t {
TAILQ_ENTRY(mnemonic_t) entry;
struct mnemonic_t *parent;
mnemonic_list_t child;
wchar_t value;
int ascii;
} mnemonic_t;
static mnemonic_t *
mnemonic_list_find(mnemonic_list_t *ml, int ch)
{
mnemonic_t *m;
TAILQ_FOREACH(m, ml, entry) {
if (m->ascii == ch)
return (m);
}
return (NULL);
}
static mnemonic_t *
mnemonic_create(mnemonic_t *parent, int ascii, wchar_t value)
{
mnemonic_t *m;
m = malloc(sizeof(*m));
if (m != NULL) {
m->parent = parent;
m->ascii = ascii;
m->value = value;
TAILQ_INIT(&m->child);
}
return (m);
}
static int
mnemonic_append_child(mnemonic_t *m, const char *s,
wchar_t value, wchar_t invalid)
{
mnemonic_t *m0;
int ch;
ch = (unsigned char)*s++;
if (ch == '\0')
return (EINVAL);
m0 = mnemonic_list_find(&m->child, ch);
if (m0 == NULL) {
m0 = mnemonic_create(m, ch, (wchar_t)ch);
if (m0 == NULL)
return (ENOMEM);
TAILQ_INSERT_TAIL(&m->child, m0, entry);
}
m = m0;
for (m0 = NULL; (ch = (unsigned char)*s) != '\0'; ++s) {
m0 = mnemonic_list_find(&m->child, ch);
if (m0 == NULL) {
m0 = mnemonic_create(m, ch, invalid);
if (m0 == NULL)
return (ENOMEM);
TAILQ_INSERT_TAIL(&m->child, m0, entry);
}
m = m0;
}
if (m0 == NULL)
return (EINVAL);
m0->value = value;
return (0);
}
static void
mnemonic_destroy(mnemonic_t *m)
{
mnemonic_t *m0, *n;
TAILQ_FOREACH_SAFE(m0, &m->child, entry, n)
mnemonic_destroy(m0);
free(m);
}
typedef struct {
mnemonic_t *mroot;
wchar_t invalid;
size_t mb_cur_max;
} _VIQREncodingInfo;
typedef struct {
int chlen;
char ch[MB_LEN_MAX];
} _VIQRState;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_VIQR_##m
#define _ENCODING_INFO _VIQREncodingInfo
#define _ENCODING_STATE _VIQRState
#define _ENCODING_MB_CUR_MAX(_ei_) (_ei_)->mb_cur_max
#define _ENCODING_IS_STATE_DEPENDENT 1
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) 0
static __inline void
/*ARGSUSED*/
_citrus_VIQR_init_state(_VIQREncodingInfo * __restrict ei __unused,
_VIQRState * __restrict psenc)
{
psenc->chlen = 0;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_VIQR_pack_state(_VIQREncodingInfo * __restrict ei __unused,
void *__restrict pspriv, const _VIQRState * __restrict psenc)
{
memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
}
static __inline void
/*ARGSUSED*/
_citrus_VIQR_unpack_state(_VIQREncodingInfo * __restrict ei __unused,
_VIQRState * __restrict psenc, const void * __restrict pspriv)
{
memcpy((void *)psenc, pspriv, sizeof(*psenc));
}
#endif
static int
_citrus_VIQR_mbrtowc_priv(_VIQREncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
_VIQRState * __restrict psenc, size_t * __restrict nresult)
{
mnemonic_t *m, *m0;
char *s0;
wchar_t wc;
ssize_t i;
int ch, escape;
if (*s == NULL) {
_citrus_VIQR_init_state(ei, psenc);
*nresult = (size_t)_ENCODING_IS_STATE_DEPENDENT;
return (0);
}
s0 = *s;
i = 0;
m = ei->mroot;
for (escape = 0;;) {
if (psenc->chlen == i) {
if (n-- < 1) {
*s = s0;
*nresult = (size_t)-2;
return (0);
}
psenc->ch[psenc->chlen++] = *s0++;
}
ch = (unsigned char)psenc->ch[i++];
if (ch == ESCAPE) {
if (m != ei->mroot)
break;
escape = 1;
continue;
}
if (escape != 0)
break;
m0 = mnemonic_list_find(&m->child, ch);
if (m0 == NULL)
break;
m = m0;
}
while (m != ei->mroot) {
--i;
if (m->value != ei->invalid)
break;
m = m->parent;
}
if (ch == ESCAPE && m != ei->mroot)
++i;
psenc->chlen -= i;
memmove(&psenc->ch[0], &psenc->ch[i], psenc->chlen);
wc = (m == ei->mroot) ? (wchar_t)ch : m->value;
if (pwc != NULL)
*pwc = wc;
*nresult = (size_t)(wc == 0 ? 0 : s0 - *s);
*s = s0;
return (0);
}
static int
_citrus_VIQR_wcrtomb_priv(_VIQREncodingInfo * __restrict ei,
char * __restrict s, size_t n, wchar_t wc,
_VIQRState * __restrict psenc, size_t * __restrict nresult)
{
mnemonic_t *m;
const char *p;
int ch = 0;
switch (psenc->chlen) {
case 0: case 1:
break;
default:
return (EINVAL);
}
m = NULL;
if ((uint32_t)wc <= 0xFF) {
p = mnemonic_rfc1456[wc & 0xFF];
if (p != NULL)
goto mnemonic_found;
if (n-- < 1)
goto e2big;
ch = (unsigned int)wc;
m = ei->mroot;
if (psenc->chlen > 0) {
m = mnemonic_list_find(&m->child, psenc->ch[0]);
if (m == NULL)
return (EINVAL);
psenc->ch[0] = ESCAPE;
}
if (mnemonic_list_find(&m->child, ch) == NULL) {
psenc->chlen = 0;
m = NULL;
}
psenc->ch[psenc->chlen++] = ch;
} else {
p = mnemonic_ext_find(wc, &mnemonic_ext[0], mnemonic_ext_size);
if (p == NULL) {
*nresult = (size_t)-1;
return (EILSEQ);
} else {
mnemonic_found:
psenc->chlen = 0;
while (*p != '\0') {
if (n-- < 1)
goto e2big;
psenc->ch[psenc->chlen++] = *p++;
}
}
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
if (m == ei->mroot) {
psenc->ch[0] = ch;
psenc->chlen = 1;
} else
psenc->chlen = 0;
return (0);
e2big:
*nresult = (size_t)-1;
return (E2BIG);
}
static int
/* ARGSUSED */
_citrus_VIQR_put_state_reset(_VIQREncodingInfo * __restrict ei __unused,
char * __restrict s __unused, size_t n __unused,
_VIQRState * __restrict psenc, size_t * __restrict nresult)
{
switch (psenc->chlen) {
case 0: case 1:
break;
default:
return (EINVAL);
}
*nresult = 0;
psenc->chlen = 0;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_VIQR_stdenc_wctocs(_VIQREncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
*csid = 0;
*idx = (_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_VIQR_stdenc_cstowc(_VIQREncodingInfo * __restrict ei __unused,
wchar_t * __restrict pwc, _csid_t csid, _index_t idx)
{
if (csid != 0)
return (EILSEQ);
*pwc = (wchar_t)idx;
return (0);
}
static void
_citrus_VIQR_encoding_module_uninit(_VIQREncodingInfo *ei)
{
mnemonic_destroy(ei->mroot);
}
static int
/*ARGSUSED*/
_citrus_VIQR_encoding_module_init(_VIQREncodingInfo * __restrict ei,
const void * __restrict var __unused, size_t lenvar __unused)
{
const char *s;
size_t i, n;
int errnum;
ei->mb_cur_max = 1;
ei->invalid = (wchar_t)-1;
ei->mroot = mnemonic_create(NULL, '\0', ei->invalid);
if (ei->mroot == NULL)
return (ENOMEM);
for (i = 0; i < sizeof(mnemonic_rfc1456) / sizeof(const char *); ++i) {
s = mnemonic_rfc1456[i];
if (s == NULL)
continue;
n = strlen(s);
if (ei->mb_cur_max < n)
ei->mb_cur_max = n;
errnum = mnemonic_append_child(ei->mroot,
s, (wchar_t)i, ei->invalid);
if (errnum != 0) {
_citrus_VIQR_encoding_module_uninit(ei);
return (errnum);
}
}
/* a + 1 < b + 1 here to silence gcc warning about unsigned < 0. */
for (i = 0; i + 1 < mnemonic_ext_size + 1; ++i) {
const mnemonic_def_t *p;
p = &mnemonic_ext[i];
n = strlen(p->name);
if (ei->mb_cur_max < n)
ei->mb_cur_max = n;
errnum = mnemonic_append_child(ei->mroot,
p->name, p->value, ei->invalid);
if (errnum != 0) {
_citrus_VIQR_encoding_module_uninit(ei);
return (errnum);
}
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_VIQR_stdenc_get_state_desc_generic(_VIQREncodingInfo * __restrict ei __unused,
_VIQRState * __restrict psenc, int * __restrict rstate)
{
*rstate = (psenc->chlen == 0) ?
_STDENC_SDGEN_INITIAL :
_STDENC_SDGEN_INCOMPLETE_CHAR;
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(VIQR);
_CITRUS_STDENC_DEF_OPS(VIQR);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/VIQR/citrus_viqr.h b/lib/libiconv_modules/VIQR/citrus_viqr.h
index ed2c1c2a5fe7..5832a6ba9a00 100644
--- a/lib/libiconv_modules/VIQR/citrus_viqr.h
+++ b/lib/libiconv_modules/VIQR/citrus_viqr.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_viqr.h,v 1.1 2006/11/13 15:16:31 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_VIQR_H_
#define _CITRUS_VIQR_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(VIQR);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/ZW/citrus_zw.c b/lib/libiconv_modules/ZW/citrus_zw.c
index cbe86241196c..93590e550952 100644
--- a/lib/libiconv_modules/ZW/citrus_zw.c
+++ b/lib/libiconv_modules/ZW/citrus_zw.c
@@ -1,459 +1,458 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_zw.c,v 1.4 2008/06/14 16:01:08 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stddef.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_stdenc.h"
#include "citrus_zw.h"
/* ----------------------------------------------------------------------
* private stuffs used by templates
*/
typedef struct {
int dummy;
} _ZWEncodingInfo;
typedef enum {
NONE, AMBIGIOUS, ASCII, GB2312
} _ZWCharset;
typedef struct {
_ZWCharset charset;
int chlen;
char ch[4];
} _ZWState;
#define _CEI_TO_EI(_cei_) (&(_cei_)->ei)
#define _CEI_TO_STATE(_cei_, _func_) (_cei_)->states.s_##_func_
#define _FUNCNAME(m) _citrus_ZW_##m
#define _ENCODING_INFO _ZWEncodingInfo
#define _ENCODING_STATE _ZWState
#define _ENCODING_MB_CUR_MAX(_ei_) MB_LEN_MAX
#define _ENCODING_IS_STATE_DEPENDENT 1
#define _STATE_NEEDS_EXPLICIT_INIT(_ps_) ((_ps_)->charset != NONE)
static __inline void
/*ARGSUSED*/
_citrus_ZW_init_state(_ZWEncodingInfo * __restrict ei __unused,
_ZWState * __restrict psenc)
{
psenc->chlen = 0;
psenc->charset = NONE;
}
#if 0
static __inline void
/*ARGSUSED*/
_citrus_ZW_pack_state(_ZWEncodingInfo * __restrict ei __unused,
void *__restrict pspriv, const _ZWState * __restrict psenc)
{
memcpy(pspriv, (const void *)psenc, sizeof(*psenc));
}
static __inline void
/*ARGSUSED*/
_citrus_ZW_unpack_state(_ZWEncodingInfo * __restrict ei __unused,
_ZWState * __restrict psenc, const void * __restrict pspriv)
{
memcpy((void *)psenc, pspriv, sizeof(*psenc));
}
#endif
static int
_citrus_ZW_mbrtowc_priv(_ZWEncodingInfo * __restrict ei,
wchar_t * __restrict pwc, char **__restrict s, size_t n,
_ZWState * __restrict psenc, size_t * __restrict nresult)
{
char *s0;
wchar_t wc;
int ch, len;
if (*s == NULL) {
_citrus_ZW_init_state(ei, psenc);
*nresult = (size_t)_ENCODING_IS_STATE_DEPENDENT;
return (0);
}
s0 = *s;
len = 0;
#define STORE \
do { \
if (n-- < 1) { \
*nresult = (size_t)-2; \
*s = s0; \
return (0); \
} \
ch = (unsigned char)*s0++; \
if (len++ > MB_LEN_MAX || ch > 0x7F)\
goto ilseq; \
psenc->ch[psenc->chlen++] = ch; \
} while (/*CONSTCOND*/0)
loop:
switch (psenc->charset) {
case ASCII:
switch (psenc->chlen) {
case 0:
STORE;
switch (psenc->ch[0]) {
case '\0': case '\n':
psenc->charset = NONE;
}
/*FALLTHROUGH*/
case 1:
break;
default:
return (EINVAL);
}
ch = (unsigned char)psenc->ch[0];
if (ch > 0x7F)
goto ilseq;
wc = (wchar_t)ch;
psenc->chlen = 0;
break;
case NONE:
if (psenc->chlen != 0)
return (EINVAL);
STORE;
ch = (unsigned char)psenc->ch[0];
if (ch != 'z') {
if (ch != '\n' && ch != '\0')
psenc->charset = ASCII;
wc = (wchar_t)ch;
psenc->chlen = 0;
break;
}
psenc->charset = AMBIGIOUS;
psenc->chlen = 0;
/* FALLTHROUGH */
case AMBIGIOUS:
if (psenc->chlen != 0)
return (EINVAL);
STORE;
if (psenc->ch[0] != 'W') {
psenc->charset = ASCII;
wc = L'z';
break;
}
psenc->charset = GB2312;
psenc->chlen = 0;
/* FALLTHROUGH */
case GB2312:
switch (psenc->chlen) {
case 0:
STORE;
ch = (unsigned char)psenc->ch[0];
if (ch == '\0') {
psenc->charset = NONE;
wc = (wchar_t)ch;
psenc->chlen = 0;
break;
} else if (ch == '\n') {
psenc->charset = NONE;
psenc->chlen = 0;
goto loop;
}
/*FALLTHROUGH*/
case 1:
STORE;
if (psenc->ch[0] == ' ') {
ch = (unsigned char)psenc->ch[1];
wc = (wchar_t)ch;
psenc->chlen = 0;
break;
} else if (psenc->ch[0] == '#') {
ch = (unsigned char)psenc->ch[1];
if (ch == '\n') {
psenc->charset = NONE;
wc = (wchar_t)ch;
psenc->chlen = 0;
break;
} else if (ch == ' ') {
wc = (wchar_t)ch;
psenc->chlen = 0;
break;
}
}
ch = (unsigned char)psenc->ch[0];
if (ch < 0x21 || ch > 0x7E)
goto ilseq;
wc = (wchar_t)(ch << 8);
ch = (unsigned char)psenc->ch[1];
if (ch < 0x21 || ch > 0x7E) {
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
wc |= (wchar_t)ch;
psenc->chlen = 0;
break;
default:
return (EINVAL);
}
break;
default:
return (EINVAL);
}
if (pwc != NULL)
*pwc = wc;
*nresult = (size_t)(wc == 0 ? 0 : len);
*s = s0;
return (0);
}
static int
/*ARGSUSED*/
_citrus_ZW_wcrtomb_priv(_ZWEncodingInfo * __restrict ei __unused,
char *__restrict s, size_t n, wchar_t wc,
_ZWState * __restrict psenc, size_t * __restrict nresult)
{
int ch;
if (psenc->chlen != 0)
return (EINVAL);
if ((uint32_t)wc <= 0x7F) {
ch = (unsigned char)wc;
switch (psenc->charset) {
case NONE:
if (ch == '\0' || ch == '\n')
psenc->ch[psenc->chlen++] = ch;
else {
if (n < 4)
return (E2BIG);
n -= 4;
psenc->ch[psenc->chlen++] = 'z';
psenc->ch[psenc->chlen++] = 'W';
psenc->ch[psenc->chlen++] = ' ';
psenc->ch[psenc->chlen++] = ch;
psenc->charset = GB2312;
}
break;
case GB2312:
if (n < 2)
return (E2BIG);
n -= 2;
if (ch == '\0') {
psenc->ch[psenc->chlen++] = '\n';
psenc->ch[psenc->chlen++] = '\0';
psenc->charset = NONE;
} else if (ch == '\n') {
psenc->ch[psenc->chlen++] = '#';
psenc->ch[psenc->chlen++] = '\n';
psenc->charset = NONE;
} else {
psenc->ch[psenc->chlen++] = ' ';
psenc->ch[psenc->chlen++] = ch;
}
break;
default:
return (EINVAL);
}
} else if ((uint32_t)wc <= 0x7E7E) {
switch (psenc->charset) {
case NONE:
if (n < 2)
return (E2BIG);
n -= 2;
psenc->ch[psenc->chlen++] = 'z';
psenc->ch[psenc->chlen++] = 'W';
psenc->charset = GB2312;
/* FALLTHROUGH*/
case GB2312:
if (n < 2)
return (E2BIG);
n -= 2;
ch = (wc >> 8) & 0xFF;
if (ch < 0x21 || ch > 0x7E)
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
ch = wc & 0xFF;
if (ch < 0x21 || ch > 0x7E)
goto ilseq;
psenc->ch[psenc->chlen++] = ch;
break;
default:
return (EINVAL);
}
} else {
ilseq:
*nresult = (size_t)-1;
return (EILSEQ);
}
memcpy(s, psenc->ch, psenc->chlen);
*nresult = psenc->chlen;
psenc->chlen = 0;
return (0);
}
static int
/*ARGSUSED*/
_citrus_ZW_put_state_reset(_ZWEncodingInfo * __restrict ei __unused,
char * __restrict s, size_t n, _ZWState * __restrict psenc,
size_t * __restrict nresult)
{
if (psenc->chlen != 0)
return (EINVAL);
switch (psenc->charset) {
case GB2312:
if (n-- < 1)
return (E2BIG);
psenc->ch[psenc->chlen++] = '\n';
psenc->charset = NONE;
/*FALLTHROUGH*/
case NONE:
*nresult = psenc->chlen;
if (psenc->chlen > 0) {
memcpy(s, psenc->ch, psenc->chlen);
psenc->chlen = 0;
}
break;
default:
return (EINVAL);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_ZW_stdenc_get_state_desc_generic(_ZWEncodingInfo * __restrict ei __unused,
_ZWState * __restrict psenc, int * __restrict rstate)
{
switch (psenc->charset) {
case NONE:
if (psenc->chlen != 0)
return (EINVAL);
*rstate = _STDENC_SDGEN_INITIAL;
break;
case AMBIGIOUS:
if (psenc->chlen != 0)
return (EINVAL);
*rstate = _STDENC_SDGEN_INCOMPLETE_SHIFT;
break;
case ASCII:
case GB2312:
switch (psenc->chlen) {
case 0:
*rstate = _STDENC_SDGEN_STABLE;
break;
case 1:
*rstate = (psenc->ch[0] == '#') ?
_STDENC_SDGEN_INCOMPLETE_SHIFT :
_STDENC_SDGEN_INCOMPLETE_CHAR;
break;
default:
return (EINVAL);
}
break;
default:
return (EINVAL);
}
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_ZW_stdenc_wctocs(_ZWEncodingInfo * __restrict ei __unused,
_csid_t * __restrict csid, _index_t * __restrict idx, wchar_t wc)
{
*csid = (_csid_t)(wc <= (wchar_t)0x7FU) ? 0 : 1;
*idx = (_index_t)wc;
return (0);
}
static __inline int
/*ARGSUSED*/
_citrus_ZW_stdenc_cstowc(_ZWEncodingInfo * __restrict ei __unused,
wchar_t * __restrict wc, _csid_t csid, _index_t idx)
{
switch (csid) {
case 0: case 1:
break;
default:
return (EINVAL);
}
*wc = (wchar_t)idx;
return (0);
}
static void
/*ARGSUSED*/
_citrus_ZW_encoding_module_uninit(_ZWEncodingInfo *ei __unused)
{
}
static int
/*ARGSUSED*/
_citrus_ZW_encoding_module_init(_ZWEncodingInfo * __restrict ei __unused,
const void *__restrict var __unused, size_t lenvar __unused)
{
return (0);
}
/* ----------------------------------------------------------------------
* public interface for stdenc
*/
_CITRUS_STDENC_DECLS(ZW);
_CITRUS_STDENC_DEF_OPS(ZW);
#include "citrus_stdenc_template.h"
diff --git a/lib/libiconv_modules/ZW/citrus_zw.h b/lib/libiconv_modules/ZW/citrus_zw.h
index f86de57665e4..d97499750ea1 100644
--- a/lib/libiconv_modules/ZW/citrus_zw.h
+++ b/lib/libiconv_modules/ZW/citrus_zw.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_zw.h,v 1.1 2006/11/22 23:38:27 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2004,2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ZW_H_
#define _CITRUS_ZW_H_
__BEGIN_DECLS
_CITRUS_STDENC_GETOPS_FUNC(ZW);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/iconv_none/citrus_iconv_none.c b/lib/libiconv_modules/iconv_none/citrus_iconv_none.c
index ca09aab9451f..a2f2910c9da4 100644
--- a/lib/libiconv_modules/iconv_none/citrus_iconv_none.c
+++ b/lib/libiconv_modules/iconv_none/citrus_iconv_none.c
@@ -1,129 +1,128 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv_none.c,v 1.3 2011/05/23 14:45:44 joerg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_hash.h"
#include "citrus_iconv.h"
#include "citrus_iconv_none.h"
/* ---------------------------------------------------------------------- */
_CITRUS_ICONV_DECLS(iconv_none);
_CITRUS_ICONV_DEF_OPS(iconv_none);
/* ---------------------------------------------------------------------- */
int
_citrus_iconv_none_iconv_getops(struct _citrus_iconv_ops *ops)
{
memcpy(ops, &_citrus_iconv_none_iconv_ops,
sizeof(_citrus_iconv_none_iconv_ops));
return (0);
}
static int
/*ARGSUSED*/
_citrus_iconv_none_iconv_init_shared(
struct _citrus_iconv_shared * __restrict ci,
const char * __restrict in __unused, const char * __restrict out __unused)
{
ci->ci_closure = NULL;
return (0);
}
static void
/*ARGSUSED*/
_citrus_iconv_none_iconv_uninit_shared(struct _citrus_iconv_shared *ci __unused)
{
}
static int
/*ARGSUSED*/
_citrus_iconv_none_iconv_init_context(struct _citrus_iconv *cv)
{
cv->cv_closure = NULL;
return (0);
}
static void
/*ARGSUSED*/
_citrus_iconv_none_iconv_uninit_context(struct _citrus_iconv *cv __unused)
{
}
static int
/*ARGSUSED*/
_citrus_iconv_none_iconv_convert(struct _citrus_iconv * __restrict ci __unused,
char * __restrict * __restrict in, size_t * __restrict inbytes,
char * __restrict * __restrict out, size_t * __restrict outbytes,
uint32_t flags __unused, size_t * __restrict invalids)
{
size_t len;
int e2big;
if ((in == NULL) || (out == NULL) || (inbytes == NULL))
return (0);
if ((*in == NULL) || (*out == NULL) || (*inbytes == 0) || (*outbytes == 0))
return (0);
len = *inbytes;
e2big = 0;
if (*outbytes<len) {
e2big = 1;
len = *outbytes;
}
memcpy(*out, *in, len);
in += len;
*inbytes -= len;
out += len;
*outbytes -= len;
*invalids = 0;
if (e2big)
return (E2BIG);
return (0);
}
diff --git a/lib/libiconv_modules/iconv_none/citrus_iconv_none.h b/lib/libiconv_modules/iconv_none/citrus_iconv_none.h
index ef804377308a..d820097c6afe 100644
--- a/lib/libiconv_modules/iconv_none/citrus_iconv_none.h
+++ b/lib/libiconv_modules/iconv_none/citrus_iconv_none.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv_none.h,v 1.1 2003/06/25 09:51:43 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ICONV_NONE_H_
#define _CITRUS_ICONV_NONE_H_
__BEGIN_DECLS
_CITRUS_ICONV_GETOPS_FUNC(iconv_none);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/iconv_std/citrus_iconv_std.c b/lib/libiconv_modules/iconv_std/citrus_iconv_std.c
index ec9f21de541e..1dc856ebac4c 100644
--- a/lib/libiconv_modules/iconv_std/citrus_iconv_std.c
+++ b/lib/libiconv_modules/iconv_std/citrus_iconv_std.c
@@ -1,595 +1,594 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv_std.c,v 1.16 2012/02/12 13:51:29 wiz Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_region.h"
#include "citrus_mmap.h"
#include "citrus_hash.h"
#include "citrus_iconv.h"
#include "citrus_stdenc.h"
#include "citrus_mapper.h"
#include "citrus_csmapper.h"
#include "citrus_memstream.h"
#include "citrus_iconv_std.h"
#include "citrus_esdb.h"
/* ---------------------------------------------------------------------- */
_CITRUS_ICONV_DECLS(iconv_std);
_CITRUS_ICONV_DEF_OPS(iconv_std);
/* ---------------------------------------------------------------------- */
int
_citrus_iconv_std_iconv_getops(struct _citrus_iconv_ops *ops)
{
memcpy(ops, &_citrus_iconv_std_iconv_ops,
sizeof(_citrus_iconv_std_iconv_ops));
return (0);
}
/* ---------------------------------------------------------------------- */
/*
* convenience routines for stdenc.
*/
static __inline void
save_encoding_state(struct _citrus_iconv_std_encoding *se)
{
if (se->se_ps)
memcpy(se->se_pssaved, se->se_ps,
_stdenc_get_state_size(se->se_handle));
}
static __inline void
restore_encoding_state(struct _citrus_iconv_std_encoding *se)
{
if (se->se_ps)
memcpy(se->se_ps, se->se_pssaved,
_stdenc_get_state_size(se->se_handle));
}
static __inline void
init_encoding_state(struct _citrus_iconv_std_encoding *se)
{
if (se->se_ps)
_stdenc_init_state(se->se_handle, se->se_ps);
}
static __inline int
mbtocsx(struct _citrus_iconv_std_encoding *se,
_csid_t *csid, _index_t *idx, char **s, size_t n, size_t *nresult,
struct iconv_hooks *hooks)
{
return (_stdenc_mbtocs(se->se_handle, csid, idx, s, n, se->se_ps,
nresult, hooks));
}
static __inline int
cstombx(struct _citrus_iconv_std_encoding *se,
char *s, size_t n, _csid_t csid, _index_t idx, size_t *nresult,
struct iconv_hooks *hooks)
{
return (_stdenc_cstomb(se->se_handle, s, n, csid, idx, se->se_ps,
nresult, hooks));
}
static __inline int
wctombx(struct _citrus_iconv_std_encoding *se,
char *s, size_t n, _wc_t wc, size_t *nresult,
struct iconv_hooks *hooks)
{
return (_stdenc_wctomb(se->se_handle, s, n, wc, se->se_ps, nresult,
hooks));
}
static __inline int
put_state_resetx(struct _citrus_iconv_std_encoding *se, char *s, size_t n,
size_t *nresult)
{
return (_stdenc_put_state_reset(se->se_handle, s, n, se->se_ps, nresult));
}
static __inline int
get_state_desc_gen(struct _citrus_iconv_std_encoding *se, int *rstate)
{
struct _stdenc_state_desc ssd;
int ret;
ret = _stdenc_get_state_desc(se->se_handle, se->se_ps,
_STDENC_SDID_GENERIC, &ssd);
if (!ret)
*rstate = ssd.u.generic.state;
return (ret);
}
/*
* init encoding context
*/
static int
init_encoding(struct _citrus_iconv_std_encoding *se, struct _stdenc *cs,
void *ps1, void *ps2)
{
int ret = -1;
se->se_handle = cs;
se->se_ps = ps1;
se->se_pssaved = ps2;
if (se->se_ps)
ret = _stdenc_init_state(cs, se->se_ps);
if (!ret && se->se_pssaved)
ret = _stdenc_init_state(cs, se->se_pssaved);
return (ret);
}
static int
open_csmapper(struct _csmapper **rcm, const char *src, const char *dst,
unsigned long *rnorm)
{
struct _csmapper *cm;
int ret;
ret = _csmapper_open(&cm, src, dst, 0, rnorm);
if (ret)
return (ret);
if (_csmapper_get_src_max(cm) != 1 || _csmapper_get_dst_max(cm) != 1 ||
_csmapper_get_state_size(cm) != 0) {
_csmapper_close(cm);
return (EINVAL);
}
*rcm = cm;
return (0);
}
static void
close_dsts(struct _citrus_iconv_std_dst_list *dl)
{
struct _citrus_iconv_std_dst *sd;
while ((sd = TAILQ_FIRST(dl)) != NULL) {
TAILQ_REMOVE(dl, sd, sd_entry);
_csmapper_close(sd->sd_mapper);
free(sd);
}
}
static int
open_dsts(struct _citrus_iconv_std_dst_list *dl,
const struct _esdb_charset *ec, const struct _esdb *dbdst)
{
struct _citrus_iconv_std_dst *sd, *sdtmp;
unsigned long norm;
int i, ret;
sd = malloc(sizeof(*sd));
if (sd == NULL)
return (errno);
for (i = 0; i < dbdst->db_num_charsets; i++) {
ret = open_csmapper(&sd->sd_mapper, ec->ec_csname,
dbdst->db_charsets[i].ec_csname, &norm);
if (ret == 0) {
sd->sd_csid = dbdst->db_charsets[i].ec_csid;
sd->sd_norm = norm;
/* insert this mapper by sorted order. */
TAILQ_FOREACH(sdtmp, dl, sd_entry) {
if (sdtmp->sd_norm > norm) {
TAILQ_INSERT_BEFORE(sdtmp, sd,
sd_entry);
sd = NULL;
break;
}
}
if (sd)
TAILQ_INSERT_TAIL(dl, sd, sd_entry);
sd = malloc(sizeof(*sd));
if (sd == NULL) {
ret = errno;
close_dsts(dl);
return (ret);
}
} else if (ret != ENOENT) {
close_dsts(dl);
free(sd);
return (ret);
}
}
free(sd);
return (0);
}
static void
close_srcs(struct _citrus_iconv_std_src_list *sl)
{
struct _citrus_iconv_std_src *ss;
while ((ss = TAILQ_FIRST(sl)) != NULL) {
TAILQ_REMOVE(sl, ss, ss_entry);
close_dsts(&ss->ss_dsts);
free(ss);
}
}
static int
open_srcs(struct _citrus_iconv_std_src_list *sl,
const struct _esdb *dbsrc, const struct _esdb *dbdst)
{
struct _citrus_iconv_std_src *ss;
int count = 0, i, ret;
ss = malloc(sizeof(*ss));
if (ss == NULL)
return (errno);
TAILQ_INIT(&ss->ss_dsts);
for (i = 0; i < dbsrc->db_num_charsets; i++) {
ret = open_dsts(&ss->ss_dsts, &dbsrc->db_charsets[i], dbdst);
if (ret)
goto err;
if (!TAILQ_EMPTY(&ss->ss_dsts)) {
ss->ss_csid = dbsrc->db_charsets[i].ec_csid;
TAILQ_INSERT_TAIL(sl, ss, ss_entry);
ss = malloc(sizeof(*ss));
if (ss == NULL) {
ret = errno;
goto err;
}
count++;
TAILQ_INIT(&ss->ss_dsts);
}
}
free(ss);
return (count ? 0 : ENOENT);
err:
free(ss);
close_srcs(sl);
return (ret);
}
/* do convert a character */
#define E_NO_CORRESPONDING_CHAR ENOENT /* XXX */
static int
/*ARGSUSED*/
do_conv(const struct _citrus_iconv_std_shared *is,
_csid_t *csid, _index_t *idx)
{
struct _citrus_iconv_std_dst *sd;
struct _citrus_iconv_std_src *ss;
_index_t tmpidx;
int ret;
TAILQ_FOREACH(ss, &is->is_srcs, ss_entry) {
if (ss->ss_csid == *csid) {
TAILQ_FOREACH(sd, &ss->ss_dsts, sd_entry) {
ret = _csmapper_convert(sd->sd_mapper,
&tmpidx, *idx, NULL);
switch (ret) {
case _MAPPER_CONVERT_SUCCESS:
*csid = sd->sd_csid;
*idx = tmpidx;
return (0);
case _MAPPER_CONVERT_NONIDENTICAL:
break;
case _MAPPER_CONVERT_SRC_MORE:
/*FALLTHROUGH*/
case _MAPPER_CONVERT_DST_MORE:
/*FALLTHROUGH*/
case _MAPPER_CONVERT_ILSEQ:
return (EILSEQ);
case _MAPPER_CONVERT_FATAL:
return (EINVAL);
}
}
break;
}
}
return (E_NO_CORRESPONDING_CHAR);
}
/* ---------------------------------------------------------------------- */
static int
/*ARGSUSED*/
_citrus_iconv_std_iconv_init_shared(struct _citrus_iconv_shared *ci,
const char * __restrict src, const char * __restrict dst)
{
struct _citrus_esdb esdbdst, esdbsrc;
struct _citrus_iconv_std_shared *is;
int ret;
is = malloc(sizeof(*is));
if (is == NULL) {
ret = errno;
goto err0;
}
ret = _citrus_esdb_open(&esdbsrc, src);
if (ret)
goto err1;
ret = _citrus_esdb_open(&esdbdst, dst);
if (ret)
goto err2;
ret = _stdenc_open(&is->is_src_encoding, esdbsrc.db_encname,
esdbsrc.db_variable, esdbsrc.db_len_variable);
if (ret)
goto err3;
ret = _stdenc_open(&is->is_dst_encoding, esdbdst.db_encname,
esdbdst.db_variable, esdbdst.db_len_variable);
if (ret)
goto err4;
is->is_use_invalid = esdbdst.db_use_invalid;
is->is_invalid = esdbdst.db_invalid;
TAILQ_INIT(&is->is_srcs);
ret = open_srcs(&is->is_srcs, &esdbsrc, &esdbdst);
if (ret)
goto err5;
_esdb_close(&esdbsrc);
_esdb_close(&esdbdst);
ci->ci_closure = is;
return (0);
err5:
_stdenc_close(is->is_dst_encoding);
err4:
_stdenc_close(is->is_src_encoding);
err3:
_esdb_close(&esdbdst);
err2:
_esdb_close(&esdbsrc);
err1:
free(is);
err0:
return (ret);
}
static void
_citrus_iconv_std_iconv_uninit_shared(struct _citrus_iconv_shared *ci)
{
struct _citrus_iconv_std_shared *is = ci->ci_closure;
if (is == NULL)
return;
_stdenc_close(is->is_src_encoding);
_stdenc_close(is->is_dst_encoding);
close_srcs(&is->is_srcs);
free(is);
}
static int
_citrus_iconv_std_iconv_init_context(struct _citrus_iconv *cv)
{
const struct _citrus_iconv_std_shared *is = cv->cv_shared->ci_closure;
struct _citrus_iconv_std_context *sc;
char *ptr;
size_t sz, szpsdst, szpssrc;
szpssrc = _stdenc_get_state_size(is->is_src_encoding);
szpsdst = _stdenc_get_state_size(is->is_dst_encoding);
sz = (szpssrc + szpsdst)*2 + sizeof(struct _citrus_iconv_std_context);
sc = malloc(sz);
if (sc == NULL)
return (errno);
ptr = (char *)&sc[1];
if (szpssrc > 0)
init_encoding(&sc->sc_src_encoding, is->is_src_encoding,
ptr, ptr+szpssrc);
else
init_encoding(&sc->sc_src_encoding, is->is_src_encoding,
NULL, NULL);
ptr += szpssrc*2;
if (szpsdst > 0)
init_encoding(&sc->sc_dst_encoding, is->is_dst_encoding,
ptr, ptr+szpsdst);
else
init_encoding(&sc->sc_dst_encoding, is->is_dst_encoding,
NULL, NULL);
cv->cv_closure = (void *)sc;
return (0);
}
static void
_citrus_iconv_std_iconv_uninit_context(struct _citrus_iconv *cv)
{
free(cv->cv_closure);
}
static int
_citrus_iconv_std_iconv_convert(struct _citrus_iconv * __restrict cv,
char * __restrict * __restrict in, size_t * __restrict inbytes,
char * __restrict * __restrict out, size_t * __restrict outbytes,
uint32_t flags, size_t * __restrict invalids)
{
const struct _citrus_iconv_std_shared *is = cv->cv_shared->ci_closure;
struct _citrus_iconv_std_context *sc = cv->cv_closure;
_csid_t csid;
_index_t idx;
char *tmpin;
size_t inval, szrin, szrout;
int ret, state = 0;
inval = 0;
if (in == NULL || *in == NULL) {
/* special cases */
if (out != NULL && *out != NULL) {
/* init output state and store the shift sequence */
save_encoding_state(&sc->sc_src_encoding);
save_encoding_state(&sc->sc_dst_encoding);
szrout = 0;
ret = put_state_resetx(&sc->sc_dst_encoding,
*out, *outbytes, &szrout);
if (ret)
goto err;
if (szrout == (size_t)-2) {
/* too small to store the character */
ret = EINVAL;
goto err;
}
*out += szrout;
*outbytes -= szrout;
} else
/* otherwise, discard the shift sequence */
init_encoding_state(&sc->sc_dst_encoding);
init_encoding_state(&sc->sc_src_encoding);
*invalids = 0;
return (0);
}
/* normal case */
for (;;) {
if (*inbytes == 0) {
ret = get_state_desc_gen(&sc->sc_src_encoding, &state);
if (state == _STDENC_SDGEN_INITIAL ||
state == _STDENC_SDGEN_STABLE)
break;
}
/* save the encoding states for the error recovery */
save_encoding_state(&sc->sc_src_encoding);
save_encoding_state(&sc->sc_dst_encoding);
/* mb -> csid/index */
tmpin = *in;
szrin = szrout = 0;
ret = mbtocsx(&sc->sc_src_encoding, &csid, &idx, &tmpin,
*inbytes, &szrin, cv->cv_shared->ci_hooks);
if (ret)
goto err;
if (szrin == (size_t)-2) {
/* incompleted character */
ret = get_state_desc_gen(&sc->sc_src_encoding, &state);
if (ret) {
ret = EINVAL;
goto err;
}
switch (state) {
case _STDENC_SDGEN_INITIAL:
case _STDENC_SDGEN_STABLE:
/* fetch shift sequences only. */
goto next;
}
ret = EINVAL;
goto err;
}
/* convert the character */
ret = do_conv(is, &csid, &idx);
if (ret) {
if (ret == E_NO_CORRESPONDING_CHAR) {
/*
* GNU iconv returns EILSEQ when no
* corresponding character in the output.
* Some software depends on this behavior
* though this is against POSIX specification.
*/
if (cv->cv_shared->ci_ilseq_invalid != 0) {
ret = EILSEQ;
goto err;
}
inval++;
szrout = 0;
if ((((flags & _CITRUS_ICONV_F_HIDE_INVALID) == 0) &&
!cv->cv_shared->ci_discard_ilseq) &&
is->is_use_invalid) {
ret = wctombx(&sc->sc_dst_encoding,
*out, *outbytes, is->is_invalid,
&szrout, cv->cv_shared->ci_hooks);
if (ret)
goto err;
}
goto next;
} else
goto err;
}
/* csid/index -> mb */
ret = cstombx(&sc->sc_dst_encoding,
*out, *outbytes, csid, idx, &szrout,
cv->cv_shared->ci_hooks);
if (ret)
goto err;
next:
*inbytes -= tmpin-*in; /* szrin is insufficient on \0. */
*in = tmpin;
*outbytes -= szrout;
*out += szrout;
}
*invalids = inval;
return (0);
err:
restore_encoding_state(&sc->sc_src_encoding);
restore_encoding_state(&sc->sc_dst_encoding);
*invalids = inval;
return (ret);
}
diff --git a/lib/libiconv_modules/iconv_std/citrus_iconv_std.h b/lib/libiconv_modules/iconv_std/citrus_iconv_std.h
index 5ca21bf48ea1..1190b61ef299 100644
--- a/lib/libiconv_modules/iconv_std/citrus_iconv_std.h
+++ b/lib/libiconv_modules/iconv_std/citrus_iconv_std.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv_std.h,v 1.1 2003/06/25 09:51:44 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ICONV_STD_H_
#define _CITRUS_ICONV_STD_H_
#include "citrus_iconv_std_local.h"
_CITRUS_ICONV_GETOPS_FUNC(iconv_std);
#endif
diff --git a/lib/libiconv_modules/iconv_std/citrus_iconv_std_local.h b/lib/libiconv_modules/iconv_std/citrus_iconv_std_local.h
index 97c89dc89eee..dedb730e5441 100644
--- a/lib/libiconv_modules/iconv_std/citrus_iconv_std_local.h
+++ b/lib/libiconv_modules/iconv_std/citrus_iconv_std_local.h
@@ -1,84 +1,83 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_iconv_std_local.h,v 1.2 2003/07/01 09:42:16 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_ICONV_STD_LOCAL_H_
#define _CITRUS_ICONV_STD_LOCAL_H_
/*
* encoding
*/
struct _citrus_iconv_std_encoding {
struct _citrus_stdenc *se_handle;
void *se_ps;
void *se_pssaved;
};
/*
* dst
*/
struct _citrus_iconv_std_dst {
TAILQ_ENTRY(_citrus_iconv_std_dst) sd_entry;
struct _citrus_csmapper *sd_mapper;
_citrus_csid_t sd_csid;
unsigned long sd_norm;
};
TAILQ_HEAD(_citrus_iconv_std_dst_list, _citrus_iconv_std_dst);
/*
* src
*/
struct _citrus_iconv_std_src {
TAILQ_ENTRY(_citrus_iconv_std_src) ss_entry;
struct _citrus_iconv_std_dst_list ss_dsts;
_citrus_csid_t ss_csid;
};
TAILQ_HEAD(_citrus_iconv_std_src_list, _citrus_iconv_std_src);
/*
* iconv_std handle
*/
struct _citrus_iconv_std_shared {
struct _citrus_stdenc *is_dst_encoding;
struct _citrus_stdenc *is_src_encoding;
struct _citrus_iconv_std_src_list is_srcs;
_citrus_wc_t is_invalid;
int is_use_invalid;
};
/*
* iconv_std context
*/
struct _citrus_iconv_std_context {
struct _citrus_iconv_std_encoding sc_dst_encoding;
struct _citrus_iconv_std_encoding sc_src_encoding;
};
#endif
diff --git a/lib/libiconv_modules/mapper_646/citrus_mapper_646.c b/lib/libiconv_modules/mapper_646/citrus_mapper_646.c
index 6295afde2864..97210359179c 100644
--- a/lib/libiconv_modules/mapper_646/citrus_mapper_646.c
+++ b/lib/libiconv_modules/mapper_646/citrus_mapper_646.c
@@ -1,251 +1,250 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_646.c,v 1.4 2003/07/14 11:37:49 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#include "citrus_mapper_646.h"
/* ---------------------------------------------------------------------- */
_CITRUS_MAPPER_DECLS(mapper_646);
_CITRUS_MAPPER_DEF_OPS(mapper_646);
/* ---------------------------------------------------------------------- */
#define ILSEQ 0xFFFFFFFE
#define INVALID 0xFFFFFFFF
#define SPECIALS(x) \
x(0x23) \
x(0x24) \
x(0x40) \
x(0x5B) \
x(0x5C) \
x(0x5D) \
x(0x5E) \
x(0x60) \
x(0x7B) \
x(0x7C) \
x(0x7D) \
x(0x7E)
#define INDEX(x) INDEX_##x,
enum {
SPECIALS(INDEX)
NUM_OF_SPECIALS
};
struct _citrus_mapper_646 {
_index_t m6_map[NUM_OF_SPECIALS];
int m6_forward;
};
int
_citrus_mapper_646_mapper_getops(struct _citrus_mapper_ops *ops)
{
memcpy(ops, &_citrus_mapper_646_mapper_ops,
sizeof(_citrus_mapper_646_mapper_ops));
return (0);
}
#define T_COMM '#'
static int
parse_file(struct _citrus_mapper_646 *m6, const char *path)
{
struct _memstream ms;
struct _region r;
const char *p;
char *pp;
size_t len;
char buf[PATH_MAX];
int i, ret;
ret = _map_file(&r, path);
if (ret)
return (ret);
_memstream_bind(&ms, &r);
for (i = 0; i < NUM_OF_SPECIALS; i++) {
retry:
p = _memstream_getln(&ms, &len);
if (p == NULL) {
ret = EINVAL;
break;
}
p = _bcs_skip_ws_len(p, &len);
if (*p == T_COMM || len==0)
goto retry;
if (!_bcs_isdigit(*p)) {
ret = EINVAL;
break;
}
snprintf(buf, sizeof(buf), "%.*s", (int)len, p);
pp = __DECONST(void *, p);
m6->m6_map[i] = strtoul(buf, (char **)&pp, 0);
p = _bcs_skip_ws(buf);
if (*p != T_COMM && !*p) {
ret = EINVAL;
break;
}
}
_unmap_file(&r);
return (ret);
};
static int
parse_var(struct _citrus_mapper_646 *m6, struct _memstream *ms,
const char *dir)
{
struct _region r;
char path[PATH_MAX];
m6->m6_forward = 1;
_memstream_skip_ws(ms);
/* whether backward */
if (_memstream_peek(ms) == '!') {
_memstream_getc(ms);
m6->m6_forward = 0;
}
/* get description file path */
_memstream_getregion(ms, &r, _memstream_remainder(ms));
snprintf(path, sizeof(path), "%s/%.*s",
dir, (int)_region_size(&r), (char *)_region_head(&r));
/* remove trailing white spaces */
path[_bcs_skip_nonws(path)-path] = '\0';
return (parse_file(m6, path));
}
static int
/*ARGSUSED*/
_citrus_mapper_646_mapper_init(struct _citrus_mapper_area *__restrict ma __unused,
struct _citrus_mapper * __restrict cm, const char * __restrict dir,
const void * __restrict var, size_t lenvar,
struct _citrus_mapper_traits * __restrict mt, size_t lenmt)
{
struct _citrus_mapper_646 *m6;
struct _memstream ms;
struct _region r;
int ret;
if (lenmt < sizeof(*mt))
return (EINVAL);
m6 = malloc(sizeof(*m6));
if (m6 == NULL)
return (errno);
_region_init(&r, __DECONST(void *, var), lenvar);
_memstream_bind(&ms, &r);
ret = parse_var(m6, &ms, dir);
if (ret) {
free(m6);
return (ret);
}
cm->cm_closure = m6;
mt->mt_src_max = mt->mt_dst_max = 1; /* 1:1 converter */
mt->mt_state_size = 0; /* stateless */
return (0);
}
static void
/*ARGSUSED*/
_citrus_mapper_646_mapper_uninit(struct _citrus_mapper *cm)
{
if (cm && cm->cm_closure)
free(cm->cm_closure);
}
static int
/*ARGSUSED*/
_citrus_mapper_646_mapper_convert(struct _citrus_mapper * __restrict cm,
_index_t * __restrict dst, _index_t src, void * __restrict ps __unused)
{
struct _citrus_mapper_646 *m6;
m6 = cm->cm_closure;
if (m6->m6_forward) {
/* forward */
if (src >= 0x80)
return (_MAPPER_CONVERT_ILSEQ);
#define FORWARD(x) \
if (src == (x)) { \
if (m6->m6_map[INDEX_##x]==INVALID) \
return (_MAPPER_CONVERT_NONIDENTICAL); \
*dst = m6->m6_map[INDEX_##x]; \
return (0); \
} else
SPECIALS(FORWARD);
*dst = src;
} else {
/* backward */
#define BACKWARD(x) \
if (m6->m6_map[INDEX_##x] != INVALID && src == m6->m6_map[INDEX_##x]) { \
*dst = (x); \
return (0); \
} else if (src == (x)) \
return (_MAPPER_CONVERT_ILSEQ); \
else
SPECIALS(BACKWARD);
if (src >= 0x80)
return (_MAPPER_CONVERT_NONIDENTICAL);
*dst = src;
}
return (_MAPPER_CONVERT_SUCCESS);
}
static void
/*ARGSUSED*/
_citrus_mapper_646_mapper_init_state(void)
{
}
diff --git a/lib/libiconv_modules/mapper_646/citrus_mapper_646.h b/lib/libiconv_modules/mapper_646/citrus_mapper_646.h
index c4cb50bc0b3e..129188741f3b 100644
--- a/lib/libiconv_modules/mapper_646/citrus_mapper_646.h
+++ b/lib/libiconv_modules/mapper_646/citrus_mapper_646.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_646.h,v 1.1 2003/06/25 09:51:45 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_646_H_
#define _CITRUS_MAPPER_646_H_
__BEGIN_DECLS
_CITRUS_MAPPER_GETOPS_FUNC(mapper_646);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/mapper_none/citrus_mapper_none.c b/lib/libiconv_modules/mapper_none/citrus_mapper_none.c
index 59f9c23d4294..2a400fc9548b 100644
--- a/lib/libiconv_modules/mapper_none/citrus_mapper_none.c
+++ b/lib/libiconv_modules/mapper_none/citrus_mapper_none.c
@@ -1,106 +1,105 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_none.c,v 1.2 2003/06/27 17:53:31 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_module.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#include "citrus_mapper_none.h"
/* ---------------------------------------------------------------------- */
_CITRUS_MAPPER_DECLS(mapper_none);
_CITRUS_MAPPER_DEF_OPS(mapper_none);
/* ---------------------------------------------------------------------- */
int
_citrus_mapper_none_mapper_getops(struct _citrus_mapper_ops *ops)
{
memcpy(ops, &_citrus_mapper_none_mapper_ops,
sizeof(_citrus_mapper_none_mapper_ops));
return (0);
}
static int
/*ARGSUSED*/
_citrus_mapper_none_mapper_init(struct _citrus_mapper_area *__restrict ma __unused,
struct _citrus_mapper * __restrict cm, const char * __restrict dir __unused,
const void * __restrict var __unused, size_t lenvar __unused,
struct _citrus_mapper_traits * __restrict mt, size_t lenmt)
{
if (lenmt < sizeof(*mt))
return (EINVAL);
cm->cm_closure = NULL;
mt->mt_src_max = mt->mt_dst_max = 1; /* 1:1 converter */
mt->mt_state_size = 0; /* stateless */
return (0);
}
static void
/*ARGSUSED*/
_citrus_mapper_none_mapper_uninit(struct _citrus_mapper *cm __unused)
{
}
static int
/*ARGSUSED*/
_citrus_mapper_none_mapper_convert(struct _citrus_mapper * __restrict cm __unused,
_citrus_index_t * __restrict dst, _citrus_index_t src,
void * __restrict ps __unused)
{
*dst = src;
return (_CITRUS_MAPPER_CONVERT_SUCCESS);
}
static void
/*ARGSUSED*/
_citrus_mapper_none_mapper_init_state(void)
{
}
diff --git a/lib/libiconv_modules/mapper_none/citrus_mapper_none.h b/lib/libiconv_modules/mapper_none/citrus_mapper_none.h
index 45dc72ccf2cb..9930fcee52de 100644
--- a/lib/libiconv_modules/mapper_none/citrus_mapper_none.h
+++ b/lib/libiconv_modules/mapper_none/citrus_mapper_none.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_none.h,v 1.1 2003/06/25 09:51:45 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_NONE_H_
#define _CITRUS_MAPPER_NONE_H_
__BEGIN_DECLS
_CITRUS_MAPPER_GETOPS_FUNC(mapper_none);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.c b/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.c
index 37633c15cf72..a194378b0085 100644
--- a/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.c
+++ b/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.c
@@ -1,248 +1,247 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_serial.c,v 1.2 2003/07/12 15:39:20 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#include "citrus_mapper_serial.h"
/* ---------------------------------------------------------------------- */
_CITRUS_MAPPER_DECLS(mapper_serial);
_CITRUS_MAPPER_DEF_OPS(mapper_serial);
#define _citrus_mapper_parallel_mapper_init \
_citrus_mapper_serial_mapper_init
#define _citrus_mapper_parallel_mapper_uninit \
_citrus_mapper_serial_mapper_uninit
#define _citrus_mapper_parallel_mapper_init_state \
_citrus_mapper_serial_mapper_init_state
static int _citrus_mapper_parallel_mapper_convert(
struct _citrus_mapper * __restrict, _index_t * __restrict,
_index_t, void * __restrict);
_CITRUS_MAPPER_DEF_OPS(mapper_parallel);
#undef _citrus_mapper_parallel_mapper_init
#undef _citrus_mapper_parallel_mapper_uninit
#undef _citrus_mapper_parallel_mapper_init_state
/* ---------------------------------------------------------------------- */
struct maplink {
STAILQ_ENTRY(maplink) ml_entry;
struct _mapper *ml_mapper;
};
STAILQ_HEAD(maplist, maplink);
struct _citrus_mapper_serial {
struct maplist sr_mappers;
};
int
_citrus_mapper_serial_mapper_getops(struct _citrus_mapper_ops *ops)
{
memcpy(ops, &_citrus_mapper_serial_mapper_ops,
sizeof(_citrus_mapper_serial_mapper_ops));
return (0);
}
int
_citrus_mapper_parallel_mapper_getops(struct _citrus_mapper_ops *ops)
{
memcpy(ops, &_citrus_mapper_parallel_mapper_ops,
sizeof(_citrus_mapper_parallel_mapper_ops));
return (0);
}
static void
uninit(struct _citrus_mapper_serial *sr)
{
struct maplink *ml;
while ((ml = STAILQ_FIRST(&sr->sr_mappers)) != NULL) {
STAILQ_REMOVE_HEAD(&sr->sr_mappers, ml_entry);
_mapper_close(ml->ml_mapper);
free(ml);
}
}
static int
parse_var(struct _citrus_mapper_area *__restrict ma,
struct _citrus_mapper_serial *sr, struct _memstream *ms)
{
struct _region r;
struct maplink *ml;
char mapname[PATH_MAX];
int ret;
STAILQ_INIT(&sr->sr_mappers);
while (1) {
/* remove beginning white spaces */
_memstream_skip_ws(ms);
if (_memstream_iseof(ms))
break;
/* cut down a mapper name */
_memstream_chr(ms, &r, ',');
snprintf(mapname, sizeof(mapname), "%.*s",
(int)_region_size(&r), (char *)_region_head(&r));
/* remove trailing white spaces */
mapname[_bcs_skip_nonws(mapname)-mapname] = '\0';
/* create a new mapper record */
ml = malloc(sizeof(*ml));
if (ml == NULL)
return (errno);
ret = _mapper_open(ma, &ml->ml_mapper, mapname);
if (ret) {
free(ml);
return (ret);
}
/* support only 1:1 and stateless converter */
if (_mapper_get_src_max(ml->ml_mapper) != 1 ||
_mapper_get_dst_max(ml->ml_mapper) != 1 ||
_mapper_get_state_size(ml->ml_mapper) != 0) {
free(ml);
return (EINVAL);
}
STAILQ_INSERT_TAIL(&sr->sr_mappers, ml, ml_entry);
}
return (0);
}
static int
/*ARGSUSED*/
_citrus_mapper_serial_mapper_init(struct _citrus_mapper_area *__restrict ma __unused,
struct _citrus_mapper * __restrict cm, const char * __restrict dir __unused,
const void * __restrict var, size_t lenvar,
struct _citrus_mapper_traits * __restrict mt, size_t lenmt)
{
struct _citrus_mapper_serial *sr;
struct _memstream ms;
struct _region r;
if (lenmt < sizeof(*mt))
return (EINVAL);
sr = malloc(sizeof(*sr));
if (sr == NULL)
return (errno);
_region_init(&r, __DECONST(void *, var), lenvar);
_memstream_bind(&ms, &r);
if (parse_var(ma, sr, &ms)) {
uninit(sr);
free(sr);
return (EINVAL);
}
cm->cm_closure = sr;
mt->mt_src_max = mt->mt_dst_max = 1; /* 1:1 converter */
mt->mt_state_size = 0; /* stateless */
return (0);
}
static void
/*ARGSUSED*/
_citrus_mapper_serial_mapper_uninit(struct _citrus_mapper *cm)
{
if (cm && cm->cm_closure) {
uninit(cm->cm_closure);
free(cm->cm_closure);
}
}
static int
/*ARGSUSED*/
_citrus_mapper_serial_mapper_convert(struct _citrus_mapper * __restrict cm,
_index_t * __restrict dst, _index_t src, void * __restrict ps __unused)
{
struct _citrus_mapper_serial *sr;
struct maplink *ml;
int ret;
sr = cm->cm_closure;
STAILQ_FOREACH(ml, &sr->sr_mappers, ml_entry) {
ret = _mapper_convert(ml->ml_mapper, &src, src, NULL);
if (ret != _MAPPER_CONVERT_SUCCESS)
return (ret);
}
*dst = src;
return (_MAPPER_CONVERT_SUCCESS);
}
static int
/*ARGSUSED*/
_citrus_mapper_parallel_mapper_convert(struct _citrus_mapper * __restrict cm,
_index_t * __restrict dst, _index_t src, void * __restrict ps __unused)
{
struct _citrus_mapper_serial *sr;
struct maplink *ml;
_index_t tmp;
int ret;
sr = cm->cm_closure;
STAILQ_FOREACH(ml, &sr->sr_mappers, ml_entry) {
ret = _mapper_convert(ml->ml_mapper, &tmp, src, NULL);
if (ret == _MAPPER_CONVERT_SUCCESS) {
*dst = tmp;
return (_MAPPER_CONVERT_SUCCESS);
} else if (ret == _MAPPER_CONVERT_ILSEQ)
return (_MAPPER_CONVERT_ILSEQ);
}
return (_MAPPER_CONVERT_NONIDENTICAL);
}
static void
/*ARGSUSED*/
_citrus_mapper_serial_mapper_init_state(void)
{
}
diff --git a/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.h b/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.h
index 45fb8f83d12d..2564ae525ae1 100644
--- a/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.h
+++ b/lib/libiconv_modules/mapper_serial/citrus_mapper_serial.h
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_serial.h,v 1.1 2003/06/25 09:51:46 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_SERIAL_H_
#define _CITRUS_MAPPER_SERIAL_H_
__BEGIN_DECLS
_CITRUS_MAPPER_GETOPS_FUNC(mapper_serial);
_CITRUS_MAPPER_GETOPS_FUNC(mapper_parallel);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/mapper_std/citrus_mapper_std.c b/lib/libiconv_modules/mapper_std/citrus_mapper_std.c
index 23f88f6f2fe1..5db142fcd36a 100644
--- a/lib/libiconv_modules/mapper_std/citrus_mapper_std.c
+++ b/lib/libiconv_modules/mapper_std/citrus_mapper_std.c
@@ -1,440 +1,439 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_std.c,v 1.11 2018/06/11 18:03:38 kamil Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_region.h"
#include "citrus_mmap.h"
#include "citrus_module.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#include "citrus_db.h"
#include "citrus_db_hash.h"
#include "citrus_mapper_std.h"
#include "citrus_mapper_std_file.h"
/* ---------------------------------------------------------------------- */
_CITRUS_MAPPER_DECLS(mapper_std);
_CITRUS_MAPPER_DEF_OPS(mapper_std);
/* ---------------------------------------------------------------------- */
int
_citrus_mapper_std_mapper_getops(struct _citrus_mapper_ops *ops)
{
memcpy(ops, &_citrus_mapper_std_mapper_ops,
sizeof(_citrus_mapper_std_mapper_ops));
return (0);
}
/* ---------------------------------------------------------------------- */
static int
/*ARGSUSED*/
rowcol_convert(struct _citrus_mapper_std * __restrict ms,
_index_t * __restrict dst, _index_t src, void * __restrict ps __unused)
{
struct _citrus_mapper_std_linear_zone *lz;
struct _citrus_mapper_std_rowcol *rc;
_index_t idx = 0, n;
size_t i;
uint32_t conv;
/* ps may be unused */
rc = &ms->ms_rowcol;
for (i = rc->rc_src_rowcol_len * rc->rc_src_rowcol_bits,
lz = &rc->rc_src_rowcol[0]; i > 0; ++lz) {
i -= rc->rc_src_rowcol_bits;
n = (src >> i) & rc->rc_src_rowcol_mask;
if (n < lz->begin || n > lz->end) {
switch (rc->rc_oob_mode) {
case _CITRUS_MAPPER_STD_OOB_NONIDENTICAL:
*dst = rc->rc_dst_invalid;
return (_MAPPER_CONVERT_NONIDENTICAL);
case _CITRUS_MAPPER_STD_OOB_ILSEQ:
return (_MAPPER_CONVERT_ILSEQ);
default:
return (_MAPPER_CONVERT_FATAL);
}
}
idx = idx * lz->width + n - lz->begin;
}
switch (rc->rc_dst_unit_bits) {
case 8:
conv = _region_peek8(&rc->rc_table, idx);
break;
case 16:
conv = be16toh(_region_peek16(&rc->rc_table, idx*2));
break;
case 32:
conv = be32toh(_region_peek32(&rc->rc_table, idx*4));
break;
default:
return (_MAPPER_CONVERT_FATAL);
}
if (conv == rc->rc_dst_invalid) {
*dst = rc->rc_dst_invalid;
return (_MAPPER_CONVERT_NONIDENTICAL);
}
if (conv == rc->rc_dst_ilseq)
return (_MAPPER_CONVERT_ILSEQ);
*dst = conv;
return (_MAPPER_CONVERT_SUCCESS);
}
static __inline int
set_linear_zone(struct _citrus_mapper_std_linear_zone *lz,
uint32_t begin, uint32_t end)
{
if (begin > end)
return (EFTYPE);
lz->begin = begin;
lz->end = end;
lz->width= end - begin + 1;
return (0);
}
static __inline int
rowcol_parse_variable_compat(struct _citrus_mapper_std_rowcol *rc,
struct _region *r)
{
const struct _citrus_mapper_std_rowcol_info_compat_x *rcx;
struct _citrus_mapper_std_linear_zone *lz;
uint32_t m, n;
int ret;
rcx = _region_head(r);
rc->rc_dst_invalid = be32toh(rcx->rcx_dst_invalid);
rc->rc_dst_unit_bits = be32toh(rcx->rcx_dst_unit_bits);
m = be32toh(rcx->rcx_src_col_bits);
n = 1U << (m - 1);
n |= n - 1;
rc->rc_src_rowcol_bits = m;
rc->rc_src_rowcol_mask = n;
rc->rc_src_rowcol = malloc(2 *
sizeof(*rc->rc_src_rowcol));
if (rc->rc_src_rowcol == NULL)
return (ENOMEM);
lz = rc->rc_src_rowcol;
rc->rc_src_rowcol_len = 1;
m = be32toh(rcx->rcx_src_row_begin);
n = be32toh(rcx->rcx_src_row_end);
if (m + n > 0) {
ret = set_linear_zone(lz, m, n);
if (ret != 0) {
free(rc->rc_src_rowcol);
rc->rc_src_rowcol = NULL;
return (ret);
}
++rc->rc_src_rowcol_len, ++lz;
}
m = be32toh(rcx->rcx_src_col_begin);
n = be32toh(rcx->rcx_src_col_end);
return (set_linear_zone(lz, m, n));
}
static __inline int
rowcol_parse_variable(struct _citrus_mapper_std_rowcol *rc,
struct _region *r)
{
const struct _citrus_mapper_std_rowcol_info_x *rcx;
struct _citrus_mapper_std_linear_zone *lz;
size_t i;
uint32_t m, n;
int ret;
rcx = _region_head(r);
rc->rc_dst_invalid = be32toh(rcx->rcx_dst_invalid);
rc->rc_dst_unit_bits = be32toh(rcx->rcx_dst_unit_bits);
m = be32toh(rcx->rcx_src_rowcol_bits);
n = 1 << (m - 1);
n |= n - 1;
rc->rc_src_rowcol_bits = m;
rc->rc_src_rowcol_mask = n;
rc->rc_src_rowcol_len = be32toh(rcx->rcx_src_rowcol_len);
if (rc->rc_src_rowcol_len > _CITRUS_MAPPER_STD_ROWCOL_MAX)
return (EFTYPE);
rc->rc_src_rowcol = malloc(rc->rc_src_rowcol_len *
sizeof(*rc->rc_src_rowcol));
if (rc->rc_src_rowcol == NULL)
return (ENOMEM);
for (i = 0, lz = rc->rc_src_rowcol;
i < rc->rc_src_rowcol_len; ++i, ++lz) {
m = be32toh(rcx->rcx_src_rowcol[i].begin),
n = be32toh(rcx->rcx_src_rowcol[i].end);
ret = set_linear_zone(lz, m, n);
if (ret != 0) {
free(rc->rc_src_rowcol);
rc->rc_src_rowcol = NULL;
return (ret);
}
}
return (0);
}
static void
rowcol_uninit(struct _citrus_mapper_std *ms)
{
struct _citrus_mapper_std_rowcol *rc;
rc = &ms->ms_rowcol;
free(rc->rc_src_rowcol);
}
static int
rowcol_init(struct _citrus_mapper_std *ms)
{
struct _citrus_mapper_std_linear_zone *lz;
struct _citrus_mapper_std_rowcol *rc;
const struct _citrus_mapper_std_rowcol_ext_ilseq_info_x *eix;
struct _region r;
uint64_t table_size;
size_t i;
int ret;
ms->ms_convert = &rowcol_convert;
ms->ms_uninit = &rowcol_uninit;
rc = &ms->ms_rowcol;
/* get table region */
ret = _db_lookup_by_s(ms->ms_db, _CITRUS_MAPPER_STD_SYM_TABLE,
&rc->rc_table, NULL);
if (ret) {
if (ret == ENOENT)
ret = EFTYPE;
return (ret);
}
/* get table information */
ret = _db_lookup_by_s(ms->ms_db, _CITRUS_MAPPER_STD_SYM_INFO, &r, NULL);
if (ret) {
if (ret == ENOENT)
ret = EFTYPE;
return (ret);
}
switch (_region_size(&r)) {
case _CITRUS_MAPPER_STD_ROWCOL_INFO_COMPAT_SIZE:
ret = rowcol_parse_variable_compat(rc, &r);
break;
case _CITRUS_MAPPER_STD_ROWCOL_INFO_SIZE:
ret = rowcol_parse_variable(rc, &r);
break;
default:
return (EFTYPE);
}
if (ret != 0)
return (ret);
/* sanity check */
switch (rc->rc_src_rowcol_bits) {
case 8: case 16: case 32:
if (rc->rc_src_rowcol_len <= 32 / rc->rc_src_rowcol_bits)
break;
/*FALLTHROUGH*/
default:
return (EFTYPE);
}
/* ilseq extension */
rc->rc_oob_mode = _CITRUS_MAPPER_STD_OOB_NONIDENTICAL;
rc->rc_dst_ilseq = rc->rc_dst_invalid;
ret = _db_lookup_by_s(ms->ms_db,
_CITRUS_MAPPER_STD_SYM_ROWCOL_EXT_ILSEQ, &r, NULL);
if (ret && ret != ENOENT)
return (ret);
if (_region_size(&r) < sizeof(*eix))
return (EFTYPE);
if (ret == 0) {
eix = _region_head(&r);
rc->rc_oob_mode = be32toh(eix->eix_oob_mode);
rc->rc_dst_ilseq = be32toh(eix->eix_dst_ilseq);
}
/* calcurate expected table size */
i = rc->rc_src_rowcol_len;
lz = &rc->rc_src_rowcol[--i];
table_size = lz->width;
while (i > 0) {
lz = &rc->rc_src_rowcol[--i];
table_size *= lz->width;
}
table_size *= rc->rc_dst_unit_bits/8;
if (table_size > UINT32_MAX ||
_region_size(&rc->rc_table) < table_size)
return (EFTYPE);
return (0);
}
typedef int (*initfunc_t)(struct _citrus_mapper_std *);
static const struct {
initfunc_t t_init;
const char *t_name;
} types[] = {
{ &rowcol_init, _CITRUS_MAPPER_STD_TYPE_ROWCOL },
};
#define NUM_OF_TYPES ((int)(sizeof(types)/sizeof(types[0])))
static int
/*ARGSUSED*/
_citrus_mapper_std_mapper_init(struct _citrus_mapper_area *__restrict ma __unused,
struct _citrus_mapper * __restrict cm, const char * __restrict curdir,
const void * __restrict var, size_t lenvar,
struct _citrus_mapper_traits * __restrict mt, size_t lenmt)
{
struct _citrus_mapper_std *ms;
char path[PATH_MAX];
const char *type;
int id, ret;
/* set traits */
if (lenmt < sizeof(*mt)) {
ret = EINVAL;
goto err0;
}
mt->mt_src_max = mt->mt_dst_max = 1; /* 1:1 converter */
mt->mt_state_size = 0; /* stateless */
/* alloc mapper std structure */
ms = malloc(sizeof(*ms));
if (ms == NULL) {
ret = errno;
goto err0;
}
/* open mapper file */
snprintf(path, sizeof(path), "%s/%.*s", curdir, (int)lenvar,
(const char *)var);
ret = _map_file(&ms->ms_file, path);
if (ret)
goto err1;
ret = _db_open(&ms->ms_db, &ms->ms_file, _CITRUS_MAPPER_STD_MAGIC,
&_db_hash_std, NULL);
if (ret)
goto err2;
/* get mapper type */
ret = _db_lookupstr_by_s(ms->ms_db, _CITRUS_MAPPER_STD_SYM_TYPE,
&type, NULL);
if (ret) {
if (ret == ENOENT)
ret = EFTYPE;
goto err3;
}
for (id = 0; id < NUM_OF_TYPES; id++)
if (_bcs_strcasecmp(type, types[id].t_name) == 0)
break;
if (id == NUM_OF_TYPES)
goto err3;
/* init the per-type structure */
ret = (*types[id].t_init)(ms);
if (ret)
goto err3;
cm->cm_closure = ms;
return (0);
err3:
_db_close(ms->ms_db);
err2:
_unmap_file(&ms->ms_file);
err1:
free(ms);
err0:
return (ret);
}
static void
/*ARGSUSED*/
_citrus_mapper_std_mapper_uninit(struct _citrus_mapper *cm)
{
struct _citrus_mapper_std *ms;
ms = cm->cm_closure;
if (ms->ms_uninit)
(*ms->ms_uninit)(ms);
_db_close(ms->ms_db);
_unmap_file(&ms->ms_file);
free(ms);
}
static void
/*ARGSUSED*/
_citrus_mapper_std_mapper_init_state(void)
{
}
static int
/*ARGSUSED*/
_citrus_mapper_std_mapper_convert(struct _citrus_mapper * __restrict cm,
_index_t * __restrict dst, _index_t src, void * __restrict ps)
{
struct _citrus_mapper_std *ms;
ms = cm->cm_closure;
return ((*ms->ms_convert)(ms, dst, src, ps));
}
diff --git a/lib/libiconv_modules/mapper_std/citrus_mapper_std.h b/lib/libiconv_modules/mapper_std/citrus_mapper_std.h
index 10e5a1e36770..d3443f42e078 100644
--- a/lib/libiconv_modules/mapper_std/citrus_mapper_std.h
+++ b/lib/libiconv_modules/mapper_std/citrus_mapper_std.h
@@ -1,41 +1,40 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_std.h,v 1.1 2003/06/25 09:51:47 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_STD_H_
#define _CITRUS_MAPPER_STD_H_
#include "citrus_mapper_std_local.h"
__BEGIN_DECLS
_CITRUS_MAPPER_GETOPS_FUNC(mapper_std);
__END_DECLS
#endif
diff --git a/lib/libiconv_modules/mapper_std/citrus_mapper_std_file.h b/lib/libiconv_modules/mapper_std/citrus_mapper_std_file.h
index 96f0f59bef27..c61a9f360738 100644
--- a/lib/libiconv_modules/mapper_std/citrus_mapper_std_file.h
+++ b/lib/libiconv_modules/mapper_std/citrus_mapper_std_file.h
@@ -1,78 +1,77 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_std_file.h,v 1.3 2006/09/09 14:35:17 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_STD_FILE_H_
#define _CITRUS_MAPPER_STD_FILE_H_
#define _CITRUS_MAPPER_STD_MAGIC "MAPPER\0\0"
#define _CITRUS_MAPPER_STD_SYM_TYPE "type"
#define _CITRUS_MAPPER_STD_SYM_INFO "info"
#define _CITRUS_MAPPER_STD_SYM_TABLE "table"
#define _CITRUS_MAPPER_STD_TYPE_ROWCOL "rowcol"
struct _citrus_mapper_std_rowcol_info_x {
uint32_t rcx_src_rowcol_bits;
uint32_t rcx_dst_invalid;
#define _CITRUS_MAPPER_STD_ROWCOL_MAX 4
struct {
uint32_t begin;
uint32_t end;
} __packed rcx_src_rowcol[_CITRUS_MAPPER_STD_ROWCOL_MAX];
uint32_t rcx_dst_unit_bits;
uint32_t rcx_src_rowcol_len;
} __packed;
#define _CITRUS_MAPPER_STD_ROWCOL_INFO_SIZE 48
/* old file layout */
struct _citrus_mapper_std_rowcol_info_compat_x {
uint32_t rcx_src_col_bits;
uint32_t rcx_dst_invalid;
uint32_t rcx_src_row_begin;
uint32_t rcx_src_row_end;
uint32_t rcx_src_col_begin;
uint32_t rcx_src_col_end;
uint32_t rcx_dst_unit_bits;
uint32_t rcx_pad;
} __packed;
#define _CITRUS_MAPPER_STD_ROWCOL_INFO_COMPAT_SIZE 32
/* rowcol oob extension info */
#define _CITRUS_MAPPER_STD_SYM_ROWCOL_EXT_ILSEQ "rowcol_ext_ilseq"
struct _citrus_mapper_std_rowcol_ext_ilseq_info_x {
#define _CITRUS_MAPPER_STD_OOB_NONIDENTICAL 0
#define _CITRUS_MAPPER_STD_OOB_ILSEQ 1
uint32_t eix_oob_mode;
uint32_t eix_dst_ilseq;
} __packed;
#define _CITRUS_MAPPER_STD_ROWCOL_EXT_ILSEQ_SIZE 8
#endif
diff --git a/lib/libiconv_modules/mapper_std/citrus_mapper_std_local.h b/lib/libiconv_modules/mapper_std/citrus_mapper_std_local.h
index 02e8601e4f12..5d978838af67 100644
--- a/lib/libiconv_modules/mapper_std/citrus_mapper_std_local.h
+++ b/lib/libiconv_modules/mapper_std/citrus_mapper_std_local.h
@@ -1,73 +1,72 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_std_local.h,v 1.3 2006/09/09 14:35:17 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_STD_LOCAL_H_
#define _CITRUS_MAPPER_STD_LOCAL_H_
typedef uint32_t (*_citrus_mapper_std_getvalfunc_t)(const void *, uint32_t);
struct _citrus_mapper_std_linear_zone {
_citrus_index_t begin;
_citrus_index_t end;
_citrus_index_t width;
};
struct _citrus_mapper_std_rowcol {
struct _citrus_region rc_table;
size_t rc_src_rowcol_len;
struct _citrus_mapper_std_linear_zone
*rc_src_rowcol;
_citrus_index_t rc_src_rowcol_bits;
_citrus_index_t rc_src_rowcol_mask;
_citrus_index_t rc_dst_invalid;
_citrus_index_t rc_dst_unit_bits;
int rc_oob_mode;
_citrus_index_t rc_dst_ilseq;
};
struct _citrus_mapper_std;
typedef int (*_citrus_mapper_std_convert_t)(
struct _citrus_mapper_std *__restrict,
_index_t *__restrict, _index_t, void *__restrict);
typedef void (*_citrus_mapper_std_uninit_t)(struct _citrus_mapper_std *);
struct _citrus_mapper_std {
struct _citrus_region ms_file;
struct _citrus_db *ms_db;
_citrus_mapper_std_convert_t ms_convert;
_citrus_mapper_std_uninit_t ms_uninit;
union {
struct _citrus_mapper_std_rowcol rowcol;
} u;
#define ms_rowcol u.rowcol
};
#endif
diff --git a/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.c b/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.c
index 12d6d1171126..dd1926c7ec2b 100644
--- a/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.c
+++ b/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.c
@@ -1,387 +1,386 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_zone.c,v 1.4 2003/07/12 15:39:21 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <assert.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_bcs.h"
#include "citrus_module.h"
#include "citrus_region.h"
#include "citrus_memstream.h"
#include "citrus_mmap.h"
#include "citrus_hash.h"
#include "citrus_mapper.h"
#include "citrus_mapper_zone.h"
/* ---------------------------------------------------------------------- */
_CITRUS_MAPPER_DECLS(mapper_zone);
_CITRUS_MAPPER_DEF_OPS(mapper_zone);
/* ---------------------------------------------------------------------- */
struct _zone {
uint32_t z_begin;
uint32_t z_end;
};
struct _citrus_mapper_zone {
struct _zone mz_col;
struct _zone mz_row;
int32_t mz_col_offset;
int32_t mz_row_offset;
int mz_col_bits;
};
struct _parse_state {
enum { S_BEGIN, S_OFFSET } ps_state;
union {
uint32_t u_imm;
int32_t s_imm;
struct _zone zone;
} u;
#define ps_u_imm u.u_imm
#define ps_s_imm u.s_imm
#define ps_zone u.zone
int ps_top;
};
int
_citrus_mapper_zone_mapper_getops(struct _citrus_mapper_ops *ops)
{
memcpy(ops, &_citrus_mapper_zone_mapper_ops,
sizeof(_citrus_mapper_zone_mapper_ops));
return (0);
}
#define BUFSIZE 20
#define T_ERR 0x100
#define T_IMM 0x101
static int
get_imm(struct _memstream *ms, struct _parse_state *ps)
{
int c, i, sign = 0;
char buf[BUFSIZE + 1];
char *p;
for (i = 0; i < BUFSIZE; i++) {
retry:
c = _memstream_peek(ms);
if (i == 0) {
if (sign == 0 && (c == '+' || c == '-')) {
sign = c;
_memstream_getc(ms);
goto retry;
} else if (!_bcs_isdigit(c))
break;
} else if (!_bcs_isxdigit(c))
if (!(i == 1 && c == 'x'))
break;
buf[i] = _memstream_getc(ms);
}
buf[i] = '\0';
ps->ps_u_imm = strtoul(buf, &p, 0);
if ((p - buf) != i)
return (T_ERR);
if (sign == '-')
ps->ps_u_imm = (unsigned long)-(long)ps->ps_u_imm;
return (T_IMM);
}
static int
get_tok(struct _memstream *ms, struct _parse_state *ps)
{
int c;
loop:
c = _memstream_peek(ms);
if (c == 0x00)
return (EOF);
if (_bcs_isspace(c)) {
_memstream_getc(ms);
goto loop;
}
switch (ps->ps_state) {
case S_BEGIN:
switch (c) {
case ':':
case '-':
case '/':
_memstream_getc(ms);
return (c);
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
return (get_imm(ms, ps));
}
break;
case S_OFFSET:
switch (c) {
case '/':
_memstream_getc(ms);
return (c);
case '+':
case '-':
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
return (get_imm(ms, ps));
}
break;
}
return (T_ERR);
}
static int
parse_zone(struct _memstream *ms, struct _parse_state *ps, struct _zone *z)
{
if (get_tok(ms, ps) != T_IMM)
return (-1);
z->z_begin = ps->ps_u_imm;
if (get_tok(ms, ps) != '-')
return (-1);
if (get_tok(ms, ps) != T_IMM)
return (-1);
z->z_end = ps->ps_u_imm;
if (z->z_begin > z->z_end)
return (-1);
return (0);
}
static int
check_rowcol(struct _zone *z, int32_t ofs, uint32_t maxval)
{
uint32_t remain;
if (maxval != 0 && z->z_end >= maxval)
return (-1);
if (ofs > 0) {
if (maxval == 0)
/* this should 0x100000000 - z->z_end */
remain = (z->z_end == 0) ? 0xFFFFFFFF :
0xFFFFFFFF - z->z_end + 1;
else
remain = maxval - z->z_end;
if ((uint32_t)ofs > remain)
return (-1);
} else if (ofs < 0) {
if (z->z_begin < (uint32_t)-ofs)
return (-1);
}
return (0);
}
static int
parse_var(struct _citrus_mapper_zone *mz, struct _memstream *ms)
{
struct _parse_state ps;
uint32_t colmax, rowmax;
int isrc, ret;
ps.ps_state = S_BEGIN;
if (parse_zone(ms, &ps, &mz->mz_col))
return (-1);
ret = get_tok(ms, &ps);
if (ret == '/') {
/* rowzone / colzone / bits */
isrc = 1;
mz->mz_row = mz->mz_col;
if (parse_zone(ms, &ps, &mz->mz_col))
return (-1);
if (get_tok(ms, &ps) != '/')
return (-1);
if (get_tok(ms, &ps) != T_IMM)
return (-1);
mz->mz_col_bits = ps.ps_u_imm;
if (mz->mz_col_bits < 0 || mz->mz_col_bits > 32)
return (-1);
ret = get_tok(ms, &ps);
} else {
/* colzone */
isrc = 0;
mz->mz_col_bits = 32;
mz->mz_row.z_begin = mz->mz_row.z_end = 0;
}
if (ret == ':') {
/* offset */
ps.ps_state = S_OFFSET;
if (get_tok(ms, &ps) != T_IMM)
return (-1);
mz->mz_col_offset = ps.ps_s_imm;
if (isrc) {
/* row/col */
mz->mz_row_offset = mz->mz_col_offset;
if (get_tok(ms, &ps) != '/')
return (-1);
if (get_tok(ms, &ps) != T_IMM)
return (-1);
mz->mz_col_offset = ps.ps_s_imm;
} else
mz->mz_row_offset = 0;
ret = get_tok(ms, &ps);
}
if (ret != EOF)
return (-1);
/* sanity check */
colmax = (mz->mz_col_bits == 32) ? 0 : 1 << mz->mz_col_bits;
rowmax = (mz->mz_col_bits == 0) ? 0 : 1 << (32-mz->mz_col_bits);
if (check_rowcol(&mz->mz_col, mz->mz_col_offset, colmax))
return (-1);
if (check_rowcol(&mz->mz_row, mz->mz_row_offset, rowmax))
return (-1);
return (0);
}
static int
/*ARGSUSED*/
_citrus_mapper_zone_mapper_init(struct _citrus_mapper_area *__restrict ma __unused,
struct _citrus_mapper * __restrict cm, const char * __restrict dir __unused,
const void * __restrict var, size_t lenvar,
struct _citrus_mapper_traits * __restrict mt, size_t lenmt)
{
struct _citrus_mapper_zone *mz;
struct _memstream ms;
struct _region r;
if (lenmt < sizeof(*mt))
return (EINVAL);
mz = malloc(sizeof(*mz));
if (mz == NULL)
return (errno);
mz->mz_col.z_begin = mz->mz_col.z_end = 0;
mz->mz_row.z_begin = mz->mz_row.z_end = 0;
mz->mz_col_bits = 0;
mz->mz_row_offset = 0;
mz->mz_col_offset = 0;
_region_init(&r, __DECONST(void *, var), lenvar);
_memstream_bind(&ms, &r);
if (parse_var(mz, &ms)) {
free(mz);
return (EINVAL);
}
cm->cm_closure = mz;
mt->mt_src_max = mt->mt_dst_max = 1; /* 1:1 converter */
mt->mt_state_size = 0; /* stateless */
return (0);
}
static void
/*ARGSUSED*/
_citrus_mapper_zone_mapper_uninit(struct _citrus_mapper *cm __unused)
{
}
static int
/*ARGSUSED*/
_citrus_mapper_zone_mapper_convert(struct _citrus_mapper * __restrict cm,
_citrus_index_t * __restrict dst, _citrus_index_t src,
void * __restrict ps __unused)
{
struct _citrus_mapper_zone *mz = cm->cm_closure;
uint32_t col, row;
if (mz->mz_col_bits == 32) {
col = src;
row = 0;
if (col < mz->mz_col.z_begin || col > mz->mz_col.z_end)
return (_CITRUS_MAPPER_CONVERT_NONIDENTICAL);
if (mz->mz_col_offset > 0)
col += (uint32_t)mz->mz_col_offset;
else
col -= (uint32_t)-mz->mz_col_offset;
*dst = col;
} else {
col = src & (((uint32_t)1 << mz->mz_col_bits) - 1);
row = src >> mz->mz_col_bits;
if (row < mz->mz_row.z_begin || row > mz->mz_row.z_end ||
col < mz->mz_col.z_begin || col > mz->mz_col.z_end)
return (_CITRUS_MAPPER_CONVERT_NONIDENTICAL);
if (mz->mz_col_offset > 0)
col += (uint32_t)mz->mz_col_offset;
else
col -= (uint32_t)-mz->mz_col_offset;
if (mz->mz_row_offset > 0)
row += (uint32_t)mz->mz_row_offset;
else
row -= (uint32_t)-mz->mz_row_offset;
*dst = col | (row << mz->mz_col_bits);
}
return (_CITRUS_MAPPER_CONVERT_SUCCESS);
}
static void
/*ARGSUSED*/
_citrus_mapper_zone_mapper_init_state(void)
{
}
diff --git a/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.h b/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.h
index 3274f0760e96..969cccfc9f25 100644
--- a/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.h
+++ b/lib/libiconv_modules/mapper_zone/citrus_mapper_zone.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* $NetBSD: citrus_mapper_zone.h,v 1.1 2003/06/25 09:51:48 tshiozak Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _CITRUS_MAPPER_ZONE_H_
#define _CITRUS_MAPPER_ZONE_H_
__BEGIN_DECLS
_CITRUS_MAPPER_GETOPS_FUNC(mapper_zone);
__END_DECLS
#endif
diff --git a/lib/libipsec/ipsec_strerror.h b/lib/libipsec/ipsec_strerror.h
index 3eed691eeb75..05c0d11b2e3b 100644
--- a/lib/libipsec/ipsec_strerror.h
+++ b/lib/libipsec/ipsec_strerror.h
@@ -1,65 +1,64 @@
-/* $FreeBSD$ */
/* $KAME: ipsec_strerror.h,v 1.8 2000/07/30 00:45:12 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
extern int __ipsec_errcode;
extern void __ipsec_set_strerror(const char *);
#define EIPSEC_NO_ERROR 0 /*success*/
#define EIPSEC_NOT_SUPPORTED 1 /*not supported*/
#define EIPSEC_INVAL_ARGUMENT 2 /*invalid argument*/
#define EIPSEC_INVAL_SADBMSG 3 /*invalid sadb message*/
#define EIPSEC_INVAL_VERSION 4 /*invalid version*/
#define EIPSEC_INVAL_POLICY 5 /*invalid security policy*/
#define EIPSEC_INVAL_ADDRESS 6 /*invalid address specification*/
#define EIPSEC_INVAL_PROTO 7 /*invalid ipsec protocol*/
#define EIPSEC_INVAL_MODE 8 /*Invalid ipsec mode*/
#define EIPSEC_INVAL_LEVEL 9 /*invalid ipsec level*/
#define EIPSEC_INVAL_SATYPE 10 /*invalid SA type*/
#define EIPSEC_INVAL_MSGTYPE 11 /*invalid message type*/
#define EIPSEC_INVAL_EXTTYPE 12 /*invalid extension type*/
#define EIPSEC_INVAL_ALGS 13 /*Invalid algorithm type*/
#define EIPSEC_INVAL_KEYLEN 14 /*invalid key length*/
#define EIPSEC_INVAL_FAMILY 15 /*invalid address family*/
#define EIPSEC_INVAL_PREFIXLEN 16 /*SPI range violation*/
#define EIPSEC_INVAL_DIR 17 /*Invalid direction*/
#define EIPSEC_INVAL_SPI 18 /*invalid prefixlen*/
#define EIPSEC_NO_PROTO 19 /*no protocol specified*/
#define EIPSEC_NO_ALGS 20 /*No algorithm specified*/
#define EIPSEC_NO_BUFS 21 /*no buffers available*/
#define EIPSEC_DO_GET_SUPP_LIST 22 /*must get supported algorithm first*/
#define EIPSEC_PROTO_MISMATCH 23 /*protocol mismatch*/
#define EIPSEC_FAMILY_MISMATCH 24 /*family mismatch*/
#define EIPSEC_FEW_ARGUMENTS 25 /*Too few arguments*/
#define EIPSEC_SYSTEM_ERROR 26 /*system error*/
#define EIPSEC_MAX 27 /*unknown error*/
diff --git a/lib/libipsec/libpfkey.h b/lib/libipsec/libpfkey.h
index c4c191e3e438..87a38b6bea18 100644
--- a/lib/libipsec/libpfkey.h
+++ b/lib/libipsec/libpfkey.h
@@ -1,88 +1,87 @@
-/* $FreeBSD$ */
/* $KAME: libpfkey.h,v 1.6 2001/03/05 18:22:17 thorpej Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
struct sadb_msg;
extern void pfkey_sadump(struct sadb_msg *);
extern void pfkey_spdump(struct sadb_msg *);
struct sockaddr;
struct sadb_alg;
int ipsec_check_keylen(u_int, u_int, u_int);
int ipsec_check_keylen2(u_int, u_int, u_int);
int ipsec_get_keylen(u_int, u_int, struct sadb_alg *);
u_int pfkey_set_softrate(u_int, u_int);
u_int pfkey_get_softrate(u_int);
int pfkey_send_getspi(int, u_int, u_int, struct sockaddr *, struct sockaddr *,
u_int32_t, u_int32_t, u_int32_t, u_int32_t);
int pfkey_send_update(int, u_int, u_int, struct sockaddr *, struct sockaddr *,
u_int32_t, u_int32_t, u_int, caddr_t, u_int, u_int, u_int, u_int,
u_int, u_int32_t, u_int64_t, u_int64_t, u_int64_t, u_int32_t);
int pfkey_send_add(int, u_int, u_int, struct sockaddr *, struct sockaddr *,
u_int32_t, u_int32_t, u_int, caddr_t, u_int, u_int, u_int, u_int,
u_int, u_int32_t, u_int64_t, u_int64_t, u_int64_t, u_int32_t);
int pfkey_send_delete(int, u_int, u_int, struct sockaddr *, struct sockaddr *,
u_int32_t);
int pfkey_send_delete_all(int, u_int, u_int, struct sockaddr *,
struct sockaddr *);
int pfkey_send_get(int, u_int, u_int, struct sockaddr *, struct sockaddr *,
u_int32_t);
int pfkey_send_register(int, u_int);
int pfkey_recv_register(int);
int pfkey_set_supported(struct sadb_msg *, int);
int pfkey_send_flush(int, u_int);
int pfkey_send_dump(int, u_int);
int pfkey_send_promisc_toggle(int, int);
int pfkey_send_spdadd(int, struct sockaddr *, u_int, struct sockaddr *, u_int,
u_int, caddr_t, int, u_int32_t);
int pfkey_send_spdadd2(int, struct sockaddr *, u_int, struct sockaddr *, u_int,
u_int, u_int64_t, u_int64_t, caddr_t, int, u_int32_t);
int pfkey_send_spdupdate(int, struct sockaddr *, u_int, struct sockaddr *,
u_int, u_int, caddr_t, int, u_int32_t);
int pfkey_send_spdupdate2(int, struct sockaddr *, u_int, struct sockaddr *,
u_int, u_int, u_int64_t, u_int64_t, caddr_t, int, u_int32_t);
int pfkey_send_spddelete(int, struct sockaddr *, u_int, struct sockaddr *,
u_int, u_int, caddr_t, int, u_int32_t);
int pfkey_send_spddelete2(int, u_int32_t);
int pfkey_send_spdget(int, u_int32_t);
int pfkey_send_spdsetidx(int, struct sockaddr *, u_int, struct sockaddr *,
u_int, u_int, caddr_t, int, u_int32_t);
int pfkey_send_spdflush(int);
int pfkey_send_spddump(int);
int pfkey_open(void);
void pfkey_close(int);
struct sadb_msg *pfkey_recv(int);
int pfkey_send(int, struct sadb_msg *, int);
int pfkey_align(struct sadb_msg *, caddr_t *);
int pfkey_check(caddr_t *);
diff --git a/lib/libipsec/policy_token.l b/lib/libipsec/policy_token.l
index 81893912714d..ee8b0b0e89d4 100644
--- a/lib/libipsec/policy_token.l
+++ b/lib/libipsec/policy_token.l
@@ -1,158 +1,157 @@
-/* $FreeBSD$ */
/* $KAME: policy_token.l,v 1.13 2003/05/09 05:19:55 sakane Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
%{
#include <sys/types.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <net/route.h>
#include <net/pfkeyv2.h>
#include <netipsec/keydb.h>
#include <netinet/in.h>
#include <netipsec/ipsec.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include "y.tab.h"
#define yylval __libipsecyylval /* XXX */
int yylex(void);
%}
%option noyywrap
%option nounput
%option noinput
/* common section */
nl \n
ws [ \t]+
digit [0-9]
hexdigit [0-9A-Fa-f]
special [()+\|\?\*,]
dot \.
comma \,
hyphen \-
colon \:
slash \/
bcl \{
ecl \}
blcl \[
elcl \]
percent \%
semi \;
usec {dot}{digit}{1,6}
comment \#.*
ccomment "/*"
bracketstring \<[^>]*\>
quotedstring \"[^"]*\"
decstring {digit}+
hexpair {hexdigit}{hexdigit}
hexstring 0[xX]{hexdigit}+
octetstring {octet}({dot}{octet})+
ipaddress [a-zA-Z0-9:\._][a-zA-Z0-9:\._]*(%[a-zA-Z0-9]+)?
%%
in { yylval.num = IPSEC_DIR_INBOUND; return(DIR); }
out { yylval.num = IPSEC_DIR_OUTBOUND; return(DIR); }
discard { yylval.num = IPSEC_POLICY_DISCARD; return(ACTION); }
none { yylval.num = IPSEC_POLICY_NONE; return(ACTION); }
ipsec { yylval.num = IPSEC_POLICY_IPSEC; return(ACTION); }
bypass { yylval.num = IPSEC_POLICY_BYPASS; return(ACTION); }
entrust { yylval.num = IPSEC_POLICY_ENTRUST; return(ACTION); }
esp { yylval.num = IPPROTO_ESP; return(PROTOCOL); }
ah { yylval.num = IPPROTO_AH; return(PROTOCOL); }
ipcomp { yylval.num = IPPROTO_IPCOMP; return(PROTOCOL); }
tcp { yylval.num = IPPROTO_TCP; return(PROTOCOL); }
transport { yylval.num = IPSEC_MODE_TRANSPORT; return(MODE); }
tunnel { yylval.num = IPSEC_MODE_TUNNEL; return(MODE); }
me { return(ME); }
any { return(ANY); }
default { yylval.num = IPSEC_LEVEL_DEFAULT; return(LEVEL); }
use { yylval.num = IPSEC_LEVEL_USE; return(LEVEL); }
require { yylval.num = IPSEC_LEVEL_REQUIRE; return(LEVEL); }
unique{colon}{decstring} {
yylval.val.len = strlen(yytext + 7);
yylval.val.buf = yytext + 7;
return(LEVEL_SPECIFY);
}
unique { yylval.num = IPSEC_LEVEL_UNIQUE; return(LEVEL); }
{slash} { return(SLASH); }
{ipaddress} {
yylval.val.len = strlen(yytext);
yylval.val.buf = yytext;
return(IPADDRESS);
}
{hyphen} { return(HYPHEN); }
{ws} { ; }
{nl} { ; }
%%
void __policy__strbuffer__init__(char *);
void __policy__strbuffer__free__(void);
static YY_BUFFER_STATE strbuffer;
void
__policy__strbuffer__init__(msg)
char *msg;
{
if (YY_CURRENT_BUFFER)
yy_delete_buffer(YY_CURRENT_BUFFER);
strbuffer = (YY_BUFFER_STATE)yy_scan_string(msg);
yy_switch_to_buffer(strbuffer);
return;
}
void
__policy__strbuffer__free__()
{
yy_delete_buffer(strbuffer);
return;
}
diff --git a/lib/libmd/i386/rmd160.S b/lib/libmd/i386/rmd160.S
index 7ccfb22daf12..57da14f83a7c 100644
--- a/lib/libmd/i386/rmd160.S
+++ b/lib/libmd/i386/rmd160.S
@@ -1,2019 +1,2018 @@
-/* $FreeBSD$ */
/* Run the C pre-processor over this file with one of the following defined
* ELF - elf object files,
* OUT - a.out object files,
* BSDI - BSDI style a.out object files
* SOL - Solaris style elf
*/
#ifndef PIC
#define TYPE(a,b) .type a,b
#define SIZE(a,b) .size a,b
#if defined(OUT) || defined(BSDI)
#define ripemd160_block_x86 _ripemd160_block_x86
#endif
#ifdef OUT
#define OK 1
#define ALIGN 4
#endif
#ifdef BSDI
#define OK 1
#define ALIGN 4
#undef SIZE
#undef TYPE
#define SIZE(a,b)
#define TYPE(a,b)
#endif
#if defined(ELF) || defined(SOL)
#define OK 1
#define ALIGN 4
#endif
#ifndef OK
You need to define one of
ELF - elf systems - linux-elf, NetBSD and DG-UX
OUT - a.out systems - linux-a.out and FreeBSD
SOL - solaris systems, which are elf with strange comment lines
BSDI - a.out with a very primative version of as.
#endif
/* Let the Assembler begin :-) */
/* Don't even think of reading this code */
/* It was automatically generated by rmd-586.pl */
/* Which is a perl program used to generate the x86 assember for */
/* any of elf, a.out, BSDI,Win32, or Solaris */
/* eric <eay@cryptsoft.com> */
.file "rmd-586.s"
.version "01.01"
gcc2_compiled.:
.text
.p2align ALIGN
.globl ripemd160_block_x86
TYPE(ripemd160_block_x86,@function)
ripemd160_block_x86:
pushl %esi
movl 16(%esp), %ecx
pushl %edi
movl 16(%esp), %esi
pushl %ebp
addl %esi, %ecx
pushl %ebx
subl $64, %ecx
subl $88, %esp
movl %ecx, (%esp)
movl 108(%esp), %edi
.L000start:
movl (%esi), %eax
movl 4(%esi), %ebx
movl %eax, 4(%esp)
movl %ebx, 8(%esp)
movl 8(%esi), %eax
movl 12(%esi), %ebx
movl %eax, 12(%esp)
movl %ebx, 16(%esp)
movl 16(%esi), %eax
movl 20(%esi), %ebx
movl %eax, 20(%esp)
movl %ebx, 24(%esp)
movl 24(%esi), %eax
movl 28(%esi), %ebx
movl %eax, 28(%esp)
movl %ebx, 32(%esp)
movl 32(%esi), %eax
movl 36(%esi), %ebx
movl %eax, 36(%esp)
movl %ebx, 40(%esp)
movl 40(%esi), %eax
movl 44(%esi), %ebx
movl %eax, 44(%esp)
movl %ebx, 48(%esp)
movl 48(%esi), %eax
movl 52(%esi), %ebx
movl %eax, 52(%esp)
movl %ebx, 56(%esp)
movl 56(%esi), %eax
movl 60(%esi), %ebx
movl %eax, 60(%esp)
movl %ebx, 64(%esp)
addl $64, %esi
movl (%edi), %eax
movl %esi, 112(%esp)
movl 4(%edi), %ebx
movl 8(%edi), %ecx
movl 12(%edi), %edx
movl 16(%edi), %ebp
/* 0 */
movl %ecx, %esi
xorl %edx, %esi
movl 4(%esp), %edi
xorl %ebx, %esi
addl %edi, %eax
roll $10, %ecx
addl %esi, %eax
movl %ebx, %esi
roll $11, %eax
addl %ebp, %eax
/* 1 */
xorl %ecx, %esi
movl 8(%esp), %edi
xorl %eax, %esi
addl %esi, %ebp
movl %eax, %esi
roll $10, %ebx
addl %edi, %ebp
xorl %ebx, %esi
roll $14, %ebp
addl %edx, %ebp
/* 2 */
movl 12(%esp), %edi
xorl %ebp, %esi
addl %edi, %edx
roll $10, %eax
addl %esi, %edx
movl %ebp, %esi
roll $15, %edx
addl %ecx, %edx
/* 3 */
xorl %eax, %esi
movl 16(%esp), %edi
xorl %edx, %esi
addl %esi, %ecx
movl %edx, %esi
roll $10, %ebp
addl %edi, %ecx
xorl %ebp, %esi
roll $12, %ecx
addl %ebx, %ecx
/* 4 */
movl 20(%esp), %edi
xorl %ecx, %esi
addl %edi, %ebx
roll $10, %edx
addl %esi, %ebx
movl %ecx, %esi
roll $5, %ebx
addl %eax, %ebx
/* 5 */
xorl %edx, %esi
movl 24(%esp), %edi
xorl %ebx, %esi
addl %esi, %eax
movl %ebx, %esi
roll $10, %ecx
addl %edi, %eax
xorl %ecx, %esi
roll $8, %eax
addl %ebp, %eax
/* 6 */
movl 28(%esp), %edi
xorl %eax, %esi
addl %edi, %ebp
roll $10, %ebx
addl %esi, %ebp
movl %eax, %esi
roll $7, %ebp
addl %edx, %ebp
/* 7 */
xorl %ebx, %esi
movl 32(%esp), %edi
xorl %ebp, %esi
addl %esi, %edx
movl %ebp, %esi
roll $10, %eax
addl %edi, %edx
xorl %eax, %esi
roll $9, %edx
addl %ecx, %edx
/* 8 */
movl 36(%esp), %edi
xorl %edx, %esi
addl %edi, %ecx
roll $10, %ebp
addl %esi, %ecx
movl %edx, %esi
roll $11, %ecx
addl %ebx, %ecx
/* 9 */
xorl %ebp, %esi
movl 40(%esp), %edi
xorl %ecx, %esi
addl %esi, %ebx
movl %ecx, %esi
roll $10, %edx
addl %edi, %ebx
xorl %edx, %esi
roll $13, %ebx
addl %eax, %ebx
/* 10 */
movl 44(%esp), %edi
xorl %ebx, %esi
addl %edi, %eax
roll $10, %ecx
addl %esi, %eax
movl %ebx, %esi
roll $14, %eax
addl %ebp, %eax
/* 11 */
xorl %ecx, %esi
movl 48(%esp), %edi
xorl %eax, %esi
addl %esi, %ebp
movl %eax, %esi
roll $10, %ebx
addl %edi, %ebp
xorl %ebx, %esi
roll $15, %ebp
addl %edx, %ebp
/* 12 */
movl 52(%esp), %edi
xorl %ebp, %esi
addl %edi, %edx
roll $10, %eax
addl %esi, %edx
movl %ebp, %esi
roll $6, %edx
addl %ecx, %edx
/* 13 */
xorl %eax, %esi
movl 56(%esp), %edi
xorl %edx, %esi
addl %esi, %ecx
movl %edx, %esi
roll $10, %ebp
addl %edi, %ecx
xorl %ebp, %esi
roll $7, %ecx
addl %ebx, %ecx
/* 14 */
movl 60(%esp), %edi
xorl %ecx, %esi
addl %edi, %ebx
roll $10, %edx
addl %esi, %ebx
movl %ecx, %esi
roll $9, %ebx
addl %eax, %ebx
/* 15 */
xorl %edx, %esi
movl 64(%esp), %edi
xorl %ebx, %esi
addl %esi, %eax
movl $-1, %esi
roll $10, %ecx
addl %edi, %eax
movl 32(%esp), %edi
roll $8, %eax
addl %ebp, %eax
/* 16 */
addl %edi, %ebp
movl %ebx, %edi
subl %eax, %esi
andl %eax, %edi
andl %ecx, %esi
orl %esi, %edi
movl 20(%esp), %esi
roll $10, %ebx
leal 1518500249(%ebp,%edi,1),%ebp
movl $-1, %edi
roll $7, %ebp
addl %edx, %ebp
/* 17 */
addl %esi, %edx
movl %eax, %esi
subl %ebp, %edi
andl %ebp, %esi
andl %ebx, %edi
orl %edi, %esi
movl 56(%esp), %edi
roll $10, %eax
leal 1518500249(%edx,%esi,1),%edx
movl $-1, %esi
roll $6, %edx
addl %ecx, %edx
/* 18 */
addl %edi, %ecx
movl %ebp, %edi
subl %edx, %esi
andl %edx, %edi
andl %eax, %esi
orl %esi, %edi
movl 8(%esp), %esi
roll $10, %ebp
leal 1518500249(%ecx,%edi,1),%ecx
movl $-1, %edi
roll $8, %ecx
addl %ebx, %ecx
/* 19 */
addl %esi, %ebx
movl %edx, %esi
subl %ecx, %edi
andl %ecx, %esi
andl %ebp, %edi
orl %edi, %esi
movl 44(%esp), %edi
roll $10, %edx
leal 1518500249(%ebx,%esi,1),%ebx
movl $-1, %esi
roll $13, %ebx
addl %eax, %ebx
/* 20 */
addl %edi, %eax
movl %ecx, %edi
subl %ebx, %esi
andl %ebx, %edi
andl %edx, %esi
orl %esi, %edi
movl 28(%esp), %esi
roll $10, %ecx
leal 1518500249(%eax,%edi,1),%eax
movl $-1, %edi
roll $11, %eax
addl %ebp, %eax
/* 21 */
addl %esi, %ebp
movl %ebx, %esi
subl %eax, %edi
andl %eax, %esi
andl %ecx, %edi
orl %edi, %esi
movl 64(%esp), %edi
roll $10, %ebx
leal 1518500249(%ebp,%esi,1),%ebp
movl $-1, %esi
roll $9, %ebp
addl %edx, %ebp
/* 22 */
addl %edi, %edx
movl %eax, %edi
subl %ebp, %esi
andl %ebp, %edi
andl %ebx, %esi
orl %esi, %edi
movl 16(%esp), %esi
roll $10, %eax
leal 1518500249(%edx,%edi,1),%edx
movl $-1, %edi
roll $7, %edx
addl %ecx, %edx
/* 23 */
addl %esi, %ecx
movl %ebp, %esi
subl %edx, %edi
andl %edx, %esi
andl %eax, %edi
orl %edi, %esi
movl 52(%esp), %edi
roll $10, %ebp
leal 1518500249(%ecx,%esi,1),%ecx
movl $-1, %esi
roll $15, %ecx
addl %ebx, %ecx
/* 24 */
addl %edi, %ebx
movl %edx, %edi
subl %ecx, %esi
andl %ecx, %edi
andl %ebp, %esi
orl %esi, %edi
movl 4(%esp), %esi
roll $10, %edx
leal 1518500249(%ebx,%edi,1),%ebx
movl $-1, %edi
roll $7, %ebx
addl %eax, %ebx
/* 25 */
addl %esi, %eax
movl %ecx, %esi
subl %ebx, %edi
andl %ebx, %esi
andl %edx, %edi
orl %edi, %esi
movl 40(%esp), %edi
roll $10, %ecx
leal 1518500249(%eax,%esi,1),%eax
movl $-1, %esi
roll $12, %eax
addl %ebp, %eax
/* 26 */
addl %edi, %ebp
movl %ebx, %edi
subl %eax, %esi
andl %eax, %edi
andl %ecx, %esi
orl %esi, %edi
movl 24(%esp), %esi
roll $10, %ebx
leal 1518500249(%ebp,%edi,1),%ebp
movl $-1, %edi
roll $15, %ebp
addl %edx, %ebp
/* 27 */
addl %esi, %edx
movl %eax, %esi
subl %ebp, %edi
andl %ebp, %esi
andl %ebx, %edi
orl %edi, %esi
movl 12(%esp), %edi
roll $10, %eax
leal 1518500249(%edx,%esi,1),%edx
movl $-1, %esi
roll $9, %edx
addl %ecx, %edx
/* 28 */
addl %edi, %ecx
movl %ebp, %edi
subl %edx, %esi
andl %edx, %edi
andl %eax, %esi
orl %esi, %edi
movl 60(%esp), %esi
roll $10, %ebp
leal 1518500249(%ecx,%edi,1),%ecx
movl $-1, %edi
roll $11, %ecx
addl %ebx, %ecx
/* 29 */
addl %esi, %ebx
movl %edx, %esi
subl %ecx, %edi
andl %ecx, %esi
andl %ebp, %edi
orl %edi, %esi
movl 48(%esp), %edi
roll $10, %edx
leal 1518500249(%ebx,%esi,1),%ebx
movl $-1, %esi
roll $7, %ebx
addl %eax, %ebx
/* 30 */
addl %edi, %eax
movl %ecx, %edi
subl %ebx, %esi
andl %ebx, %edi
andl %edx, %esi
orl %esi, %edi
movl 36(%esp), %esi
roll $10, %ecx
leal 1518500249(%eax,%edi,1),%eax
movl $-1, %edi
roll $13, %eax
addl %ebp, %eax
/* 31 */
addl %esi, %ebp
movl %ebx, %esi
subl %eax, %edi
andl %eax, %esi
andl %ecx, %edi
orl %edi, %esi
movl $-1, %edi
roll $10, %ebx
leal 1518500249(%ebp,%esi,1),%ebp
subl %eax, %edi
roll $12, %ebp
addl %edx, %ebp
/* 32 */
movl 16(%esp), %esi
orl %ebp, %edi
addl %esi, %edx
xorl %ebx, %edi
movl $-1, %esi
roll $10, %eax
leal 1859775393(%edx,%edi,1),%edx
subl %ebp, %esi
roll $11, %edx
addl %ecx, %edx
/* 33 */
movl 44(%esp), %edi
orl %edx, %esi
addl %edi, %ecx
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebp
leal 1859775393(%ecx,%esi,1),%ecx
subl %edx, %edi
roll $13, %ecx
addl %ebx, %ecx
/* 34 */
movl 60(%esp), %esi
orl %ecx, %edi
addl %esi, %ebx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %edx
leal 1859775393(%ebx,%edi,1),%ebx
subl %ecx, %esi
roll $6, %ebx
addl %eax, %ebx
/* 35 */
movl 20(%esp), %edi
orl %ebx, %esi
addl %edi, %eax
xorl %edx, %esi
movl $-1, %edi
roll $10, %ecx
leal 1859775393(%eax,%esi,1),%eax
subl %ebx, %edi
roll $7, %eax
addl %ebp, %eax
/* 36 */
movl 40(%esp), %esi
orl %eax, %edi
addl %esi, %ebp
xorl %ecx, %edi
movl $-1, %esi
roll $10, %ebx
leal 1859775393(%ebp,%edi,1),%ebp
subl %eax, %esi
roll $14, %ebp
addl %edx, %ebp
/* 37 */
movl 64(%esp), %edi
orl %ebp, %esi
addl %edi, %edx
xorl %ebx, %esi
movl $-1, %edi
roll $10, %eax
leal 1859775393(%edx,%esi,1),%edx
subl %ebp, %edi
roll $9, %edx
addl %ecx, %edx
/* 38 */
movl 36(%esp), %esi
orl %edx, %edi
addl %esi, %ecx
xorl %eax, %edi
movl $-1, %esi
roll $10, %ebp
leal 1859775393(%ecx,%edi,1),%ecx
subl %edx, %esi
roll $13, %ecx
addl %ebx, %ecx
/* 39 */
movl 8(%esp), %edi
orl %ecx, %esi
addl %edi, %ebx
xorl %ebp, %esi
movl $-1, %edi
roll $10, %edx
leal 1859775393(%ebx,%esi,1),%ebx
subl %ecx, %edi
roll $15, %ebx
addl %eax, %ebx
/* 40 */
movl 12(%esp), %esi
orl %ebx, %edi
addl %esi, %eax
xorl %edx, %edi
movl $-1, %esi
roll $10, %ecx
leal 1859775393(%eax,%edi,1),%eax
subl %ebx, %esi
roll $14, %eax
addl %ebp, %eax
/* 41 */
movl 32(%esp), %edi
orl %eax, %esi
addl %edi, %ebp
xorl %ecx, %esi
movl $-1, %edi
roll $10, %ebx
leal 1859775393(%ebp,%esi,1),%ebp
subl %eax, %edi
roll $8, %ebp
addl %edx, %ebp
/* 42 */
movl 4(%esp), %esi
orl %ebp, %edi
addl %esi, %edx
xorl %ebx, %edi
movl $-1, %esi
roll $10, %eax
leal 1859775393(%edx,%edi,1),%edx
subl %ebp, %esi
roll $13, %edx
addl %ecx, %edx
/* 43 */
movl 28(%esp), %edi
orl %edx, %esi
addl %edi, %ecx
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebp
leal 1859775393(%ecx,%esi,1),%ecx
subl %edx, %edi
roll $6, %ecx
addl %ebx, %ecx
/* 44 */
movl 56(%esp), %esi
orl %ecx, %edi
addl %esi, %ebx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %edx
leal 1859775393(%ebx,%edi,1),%ebx
subl %ecx, %esi
roll $5, %ebx
addl %eax, %ebx
/* 45 */
movl 48(%esp), %edi
orl %ebx, %esi
addl %edi, %eax
xorl %edx, %esi
movl $-1, %edi
roll $10, %ecx
leal 1859775393(%eax,%esi,1),%eax
subl %ebx, %edi
roll $12, %eax
addl %ebp, %eax
/* 46 */
movl 24(%esp), %esi
orl %eax, %edi
addl %esi, %ebp
xorl %ecx, %edi
movl $-1, %esi
roll $10, %ebx
leal 1859775393(%ebp,%edi,1),%ebp
subl %eax, %esi
roll $7, %ebp
addl %edx, %ebp
/* 47 */
movl 52(%esp), %edi
orl %ebp, %esi
addl %edi, %edx
xorl %ebx, %esi
movl $-1, %edi
roll $10, %eax
leal 1859775393(%edx,%esi,1),%edx
movl %eax, %esi
roll $5, %edx
addl %ecx, %edx
/* 48 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 8(%esp), %esi
roll $10, %ebp
leal 2400959708(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
movl %ebp, %esi
roll $11, %ecx
addl %ebx, %ecx
/* 49 */
subl %ebp, %edi
andl %ecx, %esi
andl %edx, %edi
orl %esi, %edi
movl 40(%esp), %esi
roll $10, %edx
leal 2400959708(%ebx,%edi,),%ebx
movl $-1, %edi
addl %esi, %ebx
movl %edx, %esi
roll $12, %ebx
addl %eax, %ebx
/* 50 */
subl %edx, %edi
andl %ebx, %esi
andl %ecx, %edi
orl %esi, %edi
movl 48(%esp), %esi
roll $10, %ecx
leal 2400959708(%eax,%edi,),%eax
movl $-1, %edi
addl %esi, %eax
movl %ecx, %esi
roll $14, %eax
addl %ebp, %eax
/* 51 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 44(%esp), %esi
roll $10, %ebx
leal 2400959708(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
movl %ebx, %esi
roll $15, %ebp
addl %edx, %ebp
/* 52 */
subl %ebx, %edi
andl %ebp, %esi
andl %eax, %edi
orl %esi, %edi
movl 4(%esp), %esi
roll $10, %eax
leal 2400959708(%edx,%edi,),%edx
movl $-1, %edi
addl %esi, %edx
movl %eax, %esi
roll $14, %edx
addl %ecx, %edx
/* 53 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 36(%esp), %esi
roll $10, %ebp
leal 2400959708(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
movl %ebp, %esi
roll $15, %ecx
addl %ebx, %ecx
/* 54 */
subl %ebp, %edi
andl %ecx, %esi
andl %edx, %edi
orl %esi, %edi
movl 52(%esp), %esi
roll $10, %edx
leal 2400959708(%ebx,%edi,),%ebx
movl $-1, %edi
addl %esi, %ebx
movl %edx, %esi
roll $9, %ebx
addl %eax, %ebx
/* 55 */
subl %edx, %edi
andl %ebx, %esi
andl %ecx, %edi
orl %esi, %edi
movl 20(%esp), %esi
roll $10, %ecx
leal 2400959708(%eax,%edi,),%eax
movl $-1, %edi
addl %esi, %eax
movl %ecx, %esi
roll $8, %eax
addl %ebp, %eax
/* 56 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 56(%esp), %esi
roll $10, %ebx
leal 2400959708(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
movl %ebx, %esi
roll $9, %ebp
addl %edx, %ebp
/* 57 */
subl %ebx, %edi
andl %ebp, %esi
andl %eax, %edi
orl %esi, %edi
movl 16(%esp), %esi
roll $10, %eax
leal 2400959708(%edx,%edi,),%edx
movl $-1, %edi
addl %esi, %edx
movl %eax, %esi
roll $14, %edx
addl %ecx, %edx
/* 58 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 32(%esp), %esi
roll $10, %ebp
leal 2400959708(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
movl %ebp, %esi
roll $5, %ecx
addl %ebx, %ecx
/* 59 */
subl %ebp, %edi
andl %ecx, %esi
andl %edx, %edi
orl %esi, %edi
movl 64(%esp), %esi
roll $10, %edx
leal 2400959708(%ebx,%edi,),%ebx
movl $-1, %edi
addl %esi, %ebx
movl %edx, %esi
roll $6, %ebx
addl %eax, %ebx
/* 60 */
subl %edx, %edi
andl %ebx, %esi
andl %ecx, %edi
orl %esi, %edi
movl 60(%esp), %esi
roll $10, %ecx
leal 2400959708(%eax,%edi,),%eax
movl $-1, %edi
addl %esi, %eax
movl %ecx, %esi
roll $8, %eax
addl %ebp, %eax
/* 61 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 24(%esp), %esi
roll $10, %ebx
leal 2400959708(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
movl %ebx, %esi
roll $6, %ebp
addl %edx, %ebp
/* 62 */
subl %ebx, %edi
andl %ebp, %esi
andl %eax, %edi
orl %esi, %edi
movl 28(%esp), %esi
roll $10, %eax
leal 2400959708(%edx,%edi,),%edx
movl $-1, %edi
addl %esi, %edx
movl %eax, %esi
roll $5, %edx
addl %ecx, %edx
/* 63 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 12(%esp), %esi
roll $10, %ebp
leal 2400959708(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
subl %ebp, %edi
roll $12, %ecx
addl %ebx, %ecx
/* 64 */
movl 20(%esp), %esi
orl %edx, %edi
addl %esi, %ebx
xorl %ecx, %edi
movl $-1, %esi
roll $10, %edx
leal 2840853838(%ebx,%edi,1),%ebx
subl %edx, %esi
roll $9, %ebx
addl %eax, %ebx
/* 65 */
movl 4(%esp), %edi
orl %ecx, %esi
addl %edi, %eax
xorl %ebx, %esi
movl $-1, %edi
roll $10, %ecx
leal 2840853838(%eax,%esi,1),%eax
subl %ecx, %edi
roll $15, %eax
addl %ebp, %eax
/* 66 */
movl 24(%esp), %esi
orl %ebx, %edi
addl %esi, %ebp
xorl %eax, %edi
movl $-1, %esi
roll $10, %ebx
leal 2840853838(%ebp,%edi,1),%ebp
subl %ebx, %esi
roll $5, %ebp
addl %edx, %ebp
/* 67 */
movl 40(%esp), %edi
orl %eax, %esi
addl %edi, %edx
xorl %ebp, %esi
movl $-1, %edi
roll $10, %eax
leal 2840853838(%edx,%esi,1),%edx
subl %eax, %edi
roll $11, %edx
addl %ecx, %edx
/* 68 */
movl 32(%esp), %esi
orl %ebp, %edi
addl %esi, %ecx
xorl %edx, %edi
movl $-1, %esi
roll $10, %ebp
leal 2840853838(%ecx,%edi,1),%ecx
subl %ebp, %esi
roll $6, %ecx
addl %ebx, %ecx
/* 69 */
movl 52(%esp), %edi
orl %edx, %esi
addl %edi, %ebx
xorl %ecx, %esi
movl $-1, %edi
roll $10, %edx
leal 2840853838(%ebx,%esi,1),%ebx
subl %edx, %edi
roll $8, %ebx
addl %eax, %ebx
/* 70 */
movl 12(%esp), %esi
orl %ecx, %edi
addl %esi, %eax
xorl %ebx, %edi
movl $-1, %esi
roll $10, %ecx
leal 2840853838(%eax,%edi,1),%eax
subl %ecx, %esi
roll $13, %eax
addl %ebp, %eax
/* 71 */
movl 44(%esp), %edi
orl %ebx, %esi
addl %edi, %ebp
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebx
leal 2840853838(%ebp,%esi,1),%ebp
subl %ebx, %edi
roll $12, %ebp
addl %edx, %ebp
/* 72 */
movl 60(%esp), %esi
orl %eax, %edi
addl %esi, %edx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %eax
leal 2840853838(%edx,%edi,1),%edx
subl %eax, %esi
roll $5, %edx
addl %ecx, %edx
/* 73 */
movl 8(%esp), %edi
orl %ebp, %esi
addl %edi, %ecx
xorl %edx, %esi
movl $-1, %edi
roll $10, %ebp
leal 2840853838(%ecx,%esi,1),%ecx
subl %ebp, %edi
roll $12, %ecx
addl %ebx, %ecx
/* 74 */
movl 16(%esp), %esi
orl %edx, %edi
addl %esi, %ebx
xorl %ecx, %edi
movl $-1, %esi
roll $10, %edx
leal 2840853838(%ebx,%edi,1),%ebx
subl %edx, %esi
roll $13, %ebx
addl %eax, %ebx
/* 75 */
movl 36(%esp), %edi
orl %ecx, %esi
addl %edi, %eax
xorl %ebx, %esi
movl $-1, %edi
roll $10, %ecx
leal 2840853838(%eax,%esi,1),%eax
subl %ecx, %edi
roll $14, %eax
addl %ebp, %eax
/* 76 */
movl 48(%esp), %esi
orl %ebx, %edi
addl %esi, %ebp
xorl %eax, %edi
movl $-1, %esi
roll $10, %ebx
leal 2840853838(%ebp,%edi,1),%ebp
subl %ebx, %esi
roll $11, %ebp
addl %edx, %ebp
/* 77 */
movl 28(%esp), %edi
orl %eax, %esi
addl %edi, %edx
xorl %ebp, %esi
movl $-1, %edi
roll $10, %eax
leal 2840853838(%edx,%esi,1),%edx
subl %eax, %edi
roll $8, %edx
addl %ecx, %edx
/* 78 */
movl 64(%esp), %esi
orl %ebp, %edi
addl %esi, %ecx
xorl %edx, %edi
movl $-1, %esi
roll $10, %ebp
leal 2840853838(%ecx,%edi,1),%ecx
subl %ebp, %esi
roll $5, %ecx
addl %ebx, %ecx
/* 79 */
movl 56(%esp), %edi
orl %edx, %esi
addl %edi, %ebx
xorl %ecx, %esi
movl 108(%esp), %edi
roll $10, %edx
leal 2840853838(%ebx,%esi,1),%ebx
movl %eax, 68(%esp)
roll $6, %ebx
addl %eax, %ebx
movl (%edi), %eax
movl %ebx, 72(%esp)
movl %ecx, 76(%esp)
movl 4(%edi), %ebx
movl %edx, 80(%esp)
movl 8(%edi), %ecx
movl %ebp, 84(%esp)
movl 12(%edi), %edx
movl 16(%edi), %ebp
/* 80 */
movl $-1, %edi
subl %edx, %edi
movl 24(%esp), %esi
orl %ecx, %edi
addl %esi, %eax
xorl %ebx, %edi
movl $-1, %esi
roll $10, %ecx
leal 1352829926(%eax,%edi,1),%eax
subl %ecx, %esi
roll $8, %eax
addl %ebp, %eax
/* 81 */
movl 60(%esp), %edi
orl %ebx, %esi
addl %edi, %ebp
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebx
leal 1352829926(%ebp,%esi,1),%ebp
subl %ebx, %edi
roll $9, %ebp
addl %edx, %ebp
/* 82 */
movl 32(%esp), %esi
orl %eax, %edi
addl %esi, %edx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %eax
leal 1352829926(%edx,%edi,1),%edx
subl %eax, %esi
roll $9, %edx
addl %ecx, %edx
/* 83 */
movl 4(%esp), %edi
orl %ebp, %esi
addl %edi, %ecx
xorl %edx, %esi
movl $-1, %edi
roll $10, %ebp
leal 1352829926(%ecx,%esi,1),%ecx
subl %ebp, %edi
roll $11, %ecx
addl %ebx, %ecx
/* 84 */
movl 40(%esp), %esi
orl %edx, %edi
addl %esi, %ebx
xorl %ecx, %edi
movl $-1, %esi
roll $10, %edx
leal 1352829926(%ebx,%edi,1),%ebx
subl %edx, %esi
roll $13, %ebx
addl %eax, %ebx
/* 85 */
movl 12(%esp), %edi
orl %ecx, %esi
addl %edi, %eax
xorl %ebx, %esi
movl $-1, %edi
roll $10, %ecx
leal 1352829926(%eax,%esi,1),%eax
subl %ecx, %edi
roll $15, %eax
addl %ebp, %eax
/* 86 */
movl 48(%esp), %esi
orl %ebx, %edi
addl %esi, %ebp
xorl %eax, %edi
movl $-1, %esi
roll $10, %ebx
leal 1352829926(%ebp,%edi,1),%ebp
subl %ebx, %esi
roll $15, %ebp
addl %edx, %ebp
/* 87 */
movl 20(%esp), %edi
orl %eax, %esi
addl %edi, %edx
xorl %ebp, %esi
movl $-1, %edi
roll $10, %eax
leal 1352829926(%edx,%esi,1),%edx
subl %eax, %edi
roll $5, %edx
addl %ecx, %edx
/* 88 */
movl 56(%esp), %esi
orl %ebp, %edi
addl %esi, %ecx
xorl %edx, %edi
movl $-1, %esi
roll $10, %ebp
leal 1352829926(%ecx,%edi,1),%ecx
subl %ebp, %esi
roll $7, %ecx
addl %ebx, %ecx
/* 89 */
movl 28(%esp), %edi
orl %edx, %esi
addl %edi, %ebx
xorl %ecx, %esi
movl $-1, %edi
roll $10, %edx
leal 1352829926(%ebx,%esi,1),%ebx
subl %edx, %edi
roll $7, %ebx
addl %eax, %ebx
/* 90 */
movl 64(%esp), %esi
orl %ecx, %edi
addl %esi, %eax
xorl %ebx, %edi
movl $-1, %esi
roll $10, %ecx
leal 1352829926(%eax,%edi,1),%eax
subl %ecx, %esi
roll $8, %eax
addl %ebp, %eax
/* 91 */
movl 36(%esp), %edi
orl %ebx, %esi
addl %edi, %ebp
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebx
leal 1352829926(%ebp,%esi,1),%ebp
subl %ebx, %edi
roll $11, %ebp
addl %edx, %ebp
/* 92 */
movl 8(%esp), %esi
orl %eax, %edi
addl %esi, %edx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %eax
leal 1352829926(%edx,%edi,1),%edx
subl %eax, %esi
roll $14, %edx
addl %ecx, %edx
/* 93 */
movl 44(%esp), %edi
orl %ebp, %esi
addl %edi, %ecx
xorl %edx, %esi
movl $-1, %edi
roll $10, %ebp
leal 1352829926(%ecx,%esi,1),%ecx
subl %ebp, %edi
roll $14, %ecx
addl %ebx, %ecx
/* 94 */
movl 16(%esp), %esi
orl %edx, %edi
addl %esi, %ebx
xorl %ecx, %edi
movl $-1, %esi
roll $10, %edx
leal 1352829926(%ebx,%edi,1),%ebx
subl %edx, %esi
roll $12, %ebx
addl %eax, %ebx
/* 95 */
movl 52(%esp), %edi
orl %ecx, %esi
addl %edi, %eax
xorl %ebx, %esi
movl $-1, %edi
roll $10, %ecx
leal 1352829926(%eax,%esi,1),%eax
movl %ecx, %esi
roll $6, %eax
addl %ebp, %eax
/* 96 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 28(%esp), %esi
roll $10, %ebx
leal 1548603684(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
movl %ebx, %esi
roll $9, %ebp
addl %edx, %ebp
/* 97 */
subl %ebx, %edi
andl %ebp, %esi
andl %eax, %edi
orl %esi, %edi
movl 48(%esp), %esi
roll $10, %eax
leal 1548603684(%edx,%edi,),%edx
movl $-1, %edi
addl %esi, %edx
movl %eax, %esi
roll $13, %edx
addl %ecx, %edx
/* 98 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 16(%esp), %esi
roll $10, %ebp
leal 1548603684(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
movl %ebp, %esi
roll $15, %ecx
addl %ebx, %ecx
/* 99 */
subl %ebp, %edi
andl %ecx, %esi
andl %edx, %edi
orl %esi, %edi
movl 32(%esp), %esi
roll $10, %edx
leal 1548603684(%ebx,%edi,),%ebx
movl $-1, %edi
addl %esi, %ebx
movl %edx, %esi
roll $7, %ebx
addl %eax, %ebx
/* 100 */
subl %edx, %edi
andl %ebx, %esi
andl %ecx, %edi
orl %esi, %edi
movl 4(%esp), %esi
roll $10, %ecx
leal 1548603684(%eax,%edi,),%eax
movl $-1, %edi
addl %esi, %eax
movl %ecx, %esi
roll $12, %eax
addl %ebp, %eax
/* 101 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 56(%esp), %esi
roll $10, %ebx
leal 1548603684(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
movl %ebx, %esi
roll $8, %ebp
addl %edx, %ebp
/* 102 */
subl %ebx, %edi
andl %ebp, %esi
andl %eax, %edi
orl %esi, %edi
movl 24(%esp), %esi
roll $10, %eax
leal 1548603684(%edx,%edi,),%edx
movl $-1, %edi
addl %esi, %edx
movl %eax, %esi
roll $9, %edx
addl %ecx, %edx
/* 103 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 44(%esp), %esi
roll $10, %ebp
leal 1548603684(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
movl %ebp, %esi
roll $11, %ecx
addl %ebx, %ecx
/* 104 */
subl %ebp, %edi
andl %ecx, %esi
andl %edx, %edi
orl %esi, %edi
movl 60(%esp), %esi
roll $10, %edx
leal 1548603684(%ebx,%edi,),%ebx
movl $-1, %edi
addl %esi, %ebx
movl %edx, %esi
roll $7, %ebx
addl %eax, %ebx
/* 105 */
subl %edx, %edi
andl %ebx, %esi
andl %ecx, %edi
orl %esi, %edi
movl 64(%esp), %esi
roll $10, %ecx
leal 1548603684(%eax,%edi,),%eax
movl $-1, %edi
addl %esi, %eax
movl %ecx, %esi
roll $7, %eax
addl %ebp, %eax
/* 106 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 36(%esp), %esi
roll $10, %ebx
leal 1548603684(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
movl %ebx, %esi
roll $12, %ebp
addl %edx, %ebp
/* 107 */
subl %ebx, %edi
andl %ebp, %esi
andl %eax, %edi
orl %esi, %edi
movl 52(%esp), %esi
roll $10, %eax
leal 1548603684(%edx,%edi,),%edx
movl $-1, %edi
addl %esi, %edx
movl %eax, %esi
roll $7, %edx
addl %ecx, %edx
/* 108 */
subl %eax, %edi
andl %edx, %esi
andl %ebp, %edi
orl %esi, %edi
movl 20(%esp), %esi
roll $10, %ebp
leal 1548603684(%ecx,%edi,),%ecx
movl $-1, %edi
addl %esi, %ecx
movl %ebp, %esi
roll $6, %ecx
addl %ebx, %ecx
/* 109 */
subl %ebp, %edi
andl %ecx, %esi
andl %edx, %edi
orl %esi, %edi
movl 40(%esp), %esi
roll $10, %edx
leal 1548603684(%ebx,%edi,),%ebx
movl $-1, %edi
addl %esi, %ebx
movl %edx, %esi
roll $15, %ebx
addl %eax, %ebx
/* 110 */
subl %edx, %edi
andl %ebx, %esi
andl %ecx, %edi
orl %esi, %edi
movl 8(%esp), %esi
roll $10, %ecx
leal 1548603684(%eax,%edi,),%eax
movl $-1, %edi
addl %esi, %eax
movl %ecx, %esi
roll $13, %eax
addl %ebp, %eax
/* 111 */
subl %ecx, %edi
andl %eax, %esi
andl %ebx, %edi
orl %esi, %edi
movl 12(%esp), %esi
roll $10, %ebx
leal 1548603684(%ebp,%edi,),%ebp
movl $-1, %edi
addl %esi, %ebp
subl %eax, %edi
roll $11, %ebp
addl %edx, %ebp
/* 112 */
movl 64(%esp), %esi
orl %ebp, %edi
addl %esi, %edx
xorl %ebx, %edi
movl $-1, %esi
roll $10, %eax
leal 1836072691(%edx,%edi,1),%edx
subl %ebp, %esi
roll $9, %edx
addl %ecx, %edx
/* 113 */
movl 24(%esp), %edi
orl %edx, %esi
addl %edi, %ecx
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebp
leal 1836072691(%ecx,%esi,1),%ecx
subl %edx, %edi
roll $7, %ecx
addl %ebx, %ecx
/* 114 */
movl 8(%esp), %esi
orl %ecx, %edi
addl %esi, %ebx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %edx
leal 1836072691(%ebx,%edi,1),%ebx
subl %ecx, %esi
roll $15, %ebx
addl %eax, %ebx
/* 115 */
movl 16(%esp), %edi
orl %ebx, %esi
addl %edi, %eax
xorl %edx, %esi
movl $-1, %edi
roll $10, %ecx
leal 1836072691(%eax,%esi,1),%eax
subl %ebx, %edi
roll $11, %eax
addl %ebp, %eax
/* 116 */
movl 32(%esp), %esi
orl %eax, %edi
addl %esi, %ebp
xorl %ecx, %edi
movl $-1, %esi
roll $10, %ebx
leal 1836072691(%ebp,%edi,1),%ebp
subl %eax, %esi
roll $8, %ebp
addl %edx, %ebp
/* 117 */
movl 60(%esp), %edi
orl %ebp, %esi
addl %edi, %edx
xorl %ebx, %esi
movl $-1, %edi
roll $10, %eax
leal 1836072691(%edx,%esi,1),%edx
subl %ebp, %edi
roll $6, %edx
addl %ecx, %edx
/* 118 */
movl 28(%esp), %esi
orl %edx, %edi
addl %esi, %ecx
xorl %eax, %edi
movl $-1, %esi
roll $10, %ebp
leal 1836072691(%ecx,%edi,1),%ecx
subl %edx, %esi
roll $6, %ecx
addl %ebx, %ecx
/* 119 */
movl 40(%esp), %edi
orl %ecx, %esi
addl %edi, %ebx
xorl %ebp, %esi
movl $-1, %edi
roll $10, %edx
leal 1836072691(%ebx,%esi,1),%ebx
subl %ecx, %edi
roll $14, %ebx
addl %eax, %ebx
/* 120 */
movl 48(%esp), %esi
orl %ebx, %edi
addl %esi, %eax
xorl %edx, %edi
movl $-1, %esi
roll $10, %ecx
leal 1836072691(%eax,%edi,1),%eax
subl %ebx, %esi
roll $12, %eax
addl %ebp, %eax
/* 121 */
movl 36(%esp), %edi
orl %eax, %esi
addl %edi, %ebp
xorl %ecx, %esi
movl $-1, %edi
roll $10, %ebx
leal 1836072691(%ebp,%esi,1),%ebp
subl %eax, %edi
roll $13, %ebp
addl %edx, %ebp
/* 122 */
movl 52(%esp), %esi
orl %ebp, %edi
addl %esi, %edx
xorl %ebx, %edi
movl $-1, %esi
roll $10, %eax
leal 1836072691(%edx,%edi,1),%edx
subl %ebp, %esi
roll $5, %edx
addl %ecx, %edx
/* 123 */
movl 12(%esp), %edi
orl %edx, %esi
addl %edi, %ecx
xorl %eax, %esi
movl $-1, %edi
roll $10, %ebp
leal 1836072691(%ecx,%esi,1),%ecx
subl %edx, %edi
roll $14, %ecx
addl %ebx, %ecx
/* 124 */
movl 44(%esp), %esi
orl %ecx, %edi
addl %esi, %ebx
xorl %ebp, %edi
movl $-1, %esi
roll $10, %edx
leal 1836072691(%ebx,%edi,1),%ebx
subl %ecx, %esi
roll $13, %ebx
addl %eax, %ebx
/* 125 */
movl 4(%esp), %edi
orl %ebx, %esi
addl %edi, %eax
xorl %edx, %esi
movl $-1, %edi
roll $10, %ecx
leal 1836072691(%eax,%esi,1),%eax
subl %ebx, %edi
roll $13, %eax
addl %ebp, %eax
/* 126 */
movl 20(%esp), %esi
orl %eax, %edi
addl %esi, %ebp
xorl %ecx, %edi
movl $-1, %esi
roll $10, %ebx
leal 1836072691(%ebp,%edi,1),%ebp
subl %eax, %esi
roll $7, %ebp
addl %edx, %ebp
/* 127 */
movl 56(%esp), %edi
orl %ebp, %esi
addl %edi, %edx
xorl %ebx, %esi
movl 36(%esp), %edi
roll $10, %eax
leal 1836072691(%edx,%esi,1),%edx
movl $-1, %esi
roll $5, %edx
addl %ecx, %edx
/* 128 */
addl %edi, %ecx
movl %ebp, %edi
subl %edx, %esi
andl %edx, %edi
andl %eax, %esi
orl %esi, %edi
movl 28(%esp), %esi
roll $10, %ebp
leal 2053994217(%ecx,%edi,1),%ecx
movl $-1, %edi
roll $15, %ecx
addl %ebx, %ecx
/* 129 */
addl %esi, %ebx
movl %edx, %esi
subl %ecx, %edi
andl %ecx, %esi
andl %ebp, %edi
orl %edi, %esi
movl 20(%esp), %edi
roll $10, %edx
leal 2053994217(%ebx,%esi,1),%ebx
movl $-1, %esi
roll $5, %ebx
addl %eax, %ebx
/* 130 */
addl %edi, %eax
movl %ecx, %edi
subl %ebx, %esi
andl %ebx, %edi
andl %edx, %esi
orl %esi, %edi
movl 8(%esp), %esi
roll $10, %ecx
leal 2053994217(%eax,%edi,1),%eax
movl $-1, %edi
roll $8, %eax
addl %ebp, %eax
/* 131 */
addl %esi, %ebp
movl %ebx, %esi
subl %eax, %edi
andl %eax, %esi
andl %ecx, %edi
orl %edi, %esi
movl 16(%esp), %edi
roll $10, %ebx
leal 2053994217(%ebp,%esi,1),%ebp
movl $-1, %esi
roll $11, %ebp
addl %edx, %ebp
/* 132 */
addl %edi, %edx
movl %eax, %edi
subl %ebp, %esi
andl %ebp, %edi
andl %ebx, %esi
orl %esi, %edi
movl 48(%esp), %esi
roll $10, %eax
leal 2053994217(%edx,%edi,1),%edx
movl $-1, %edi
roll $14, %edx
addl %ecx, %edx
/* 133 */
addl %esi, %ecx
movl %ebp, %esi
subl %edx, %edi
andl %edx, %esi
andl %eax, %edi
orl %edi, %esi
movl 64(%esp), %edi
roll $10, %ebp
leal 2053994217(%ecx,%esi,1),%ecx
movl $-1, %esi
roll $14, %ecx
addl %ebx, %ecx
/* 134 */
addl %edi, %ebx
movl %edx, %edi
subl %ecx, %esi
andl %ecx, %edi
andl %ebp, %esi
orl %esi, %edi
movl 4(%esp), %esi
roll $10, %edx
leal 2053994217(%ebx,%edi,1),%ebx
movl $-1, %edi
roll $6, %ebx
addl %eax, %ebx
/* 135 */
addl %esi, %eax
movl %ecx, %esi
subl %ebx, %edi
andl %ebx, %esi
andl %edx, %edi
orl %edi, %esi
movl 24(%esp), %edi
roll $10, %ecx
leal 2053994217(%eax,%esi,1),%eax
movl $-1, %esi
roll $14, %eax
addl %ebp, %eax
/* 136 */
addl %edi, %ebp
movl %ebx, %edi
subl %eax, %esi
andl %eax, %edi
andl %ecx, %esi
orl %esi, %edi
movl 52(%esp), %esi
roll $10, %ebx
leal 2053994217(%ebp,%edi,1),%ebp
movl $-1, %edi
roll $6, %ebp
addl %edx, %ebp
/* 137 */
addl %esi, %edx
movl %eax, %esi
subl %ebp, %edi
andl %ebp, %esi
andl %ebx, %edi
orl %edi, %esi
movl 12(%esp), %edi
roll $10, %eax
leal 2053994217(%edx,%esi,1),%edx
movl $-1, %esi
roll $9, %edx
addl %ecx, %edx
/* 138 */
addl %edi, %ecx
movl %ebp, %edi
subl %edx, %esi
andl %edx, %edi
andl %eax, %esi
orl %esi, %edi
movl 56(%esp), %esi
roll $10, %ebp
leal 2053994217(%ecx,%edi,1),%ecx
movl $-1, %edi
roll $12, %ecx
addl %ebx, %ecx
/* 139 */
addl %esi, %ebx
movl %edx, %esi
subl %ecx, %edi
andl %ecx, %esi
andl %ebp, %edi
orl %edi, %esi
movl 40(%esp), %edi
roll $10, %edx
leal 2053994217(%ebx,%esi,1),%ebx
movl $-1, %esi
roll $9, %ebx
addl %eax, %ebx
/* 140 */
addl %edi, %eax
movl %ecx, %edi
subl %ebx, %esi
andl %ebx, %edi
andl %edx, %esi
orl %esi, %edi
movl 32(%esp), %esi
roll $10, %ecx
leal 2053994217(%eax,%edi,1),%eax
movl $-1, %edi
roll $12, %eax
addl %ebp, %eax
/* 141 */
addl %esi, %ebp
movl %ebx, %esi
subl %eax, %edi
andl %eax, %esi
andl %ecx, %edi
orl %edi, %esi
movl 44(%esp), %edi
roll $10, %ebx
leal 2053994217(%ebp,%esi,1),%ebp
movl $-1, %esi
roll $5, %ebp
addl %edx, %ebp
/* 142 */
addl %edi, %edx
movl %eax, %edi
subl %ebp, %esi
andl %ebp, %edi
andl %ebx, %esi
orl %esi, %edi
movl 60(%esp), %esi
roll $10, %eax
leal 2053994217(%edx,%edi,1),%edx
movl $-1, %edi
roll $15, %edx
addl %ecx, %edx
/* 143 */
addl %esi, %ecx
movl %ebp, %esi
subl %edx, %edi
andl %edx, %esi
andl %eax, %edi
orl %esi, %edi
movl %edx, %esi
roll $10, %ebp
leal 2053994217(%ecx,%edi,1),%ecx
xorl %ebp, %esi
roll $8, %ecx
addl %ebx, %ecx
/* 144 */
movl 52(%esp), %edi
xorl %ecx, %esi
addl %edi, %ebx
roll $10, %edx
addl %esi, %ebx
movl %ecx, %esi
roll $8, %ebx
addl %eax, %ebx
/* 145 */
xorl %edx, %esi
movl 64(%esp), %edi
xorl %ebx, %esi
addl %esi, %eax
movl %ebx, %esi
roll $10, %ecx
addl %edi, %eax
xorl %ecx, %esi
roll $5, %eax
addl %ebp, %eax
/* 146 */
movl 44(%esp), %edi
xorl %eax, %esi
addl %edi, %ebp
roll $10, %ebx
addl %esi, %ebp
movl %eax, %esi
roll $12, %ebp
addl %edx, %ebp
/* 147 */
xorl %ebx, %esi
movl 20(%esp), %edi
xorl %ebp, %esi
addl %esi, %edx
movl %ebp, %esi
roll $10, %eax
addl %edi, %edx
xorl %eax, %esi
roll $9, %edx
addl %ecx, %edx
/* 148 */
movl 8(%esp), %edi
xorl %edx, %esi
addl %edi, %ecx
roll $10, %ebp
addl %esi, %ecx
movl %edx, %esi
roll $12, %ecx
addl %ebx, %ecx
/* 149 */
xorl %ebp, %esi
movl 24(%esp), %edi
xorl %ecx, %esi
addl %esi, %ebx
movl %ecx, %esi
roll $10, %edx
addl %edi, %ebx
xorl %edx, %esi
roll $5, %ebx
addl %eax, %ebx
/* 150 */
movl 36(%esp), %edi
xorl %ebx, %esi
addl %edi, %eax
roll $10, %ecx
addl %esi, %eax
movl %ebx, %esi
roll $14, %eax
addl %ebp, %eax
/* 151 */
xorl %ecx, %esi
movl 32(%esp), %edi
xorl %eax, %esi
addl %esi, %ebp
movl %eax, %esi
roll $10, %ebx
addl %edi, %ebp
xorl %ebx, %esi
roll $6, %ebp
addl %edx, %ebp
/* 152 */
movl 28(%esp), %edi
xorl %ebp, %esi
addl %edi, %edx
roll $10, %eax
addl %esi, %edx
movl %ebp, %esi
roll $8, %edx
addl %ecx, %edx
/* 153 */
xorl %eax, %esi
movl 12(%esp), %edi
xorl %edx, %esi
addl %esi, %ecx
movl %edx, %esi
roll $10, %ebp
addl %edi, %ecx
xorl %ebp, %esi
roll $13, %ecx
addl %ebx, %ecx
/* 154 */
movl 56(%esp), %edi
xorl %ecx, %esi
addl %edi, %ebx
roll $10, %edx
addl %esi, %ebx
movl %ecx, %esi
roll $6, %ebx
addl %eax, %ebx
/* 155 */
xorl %edx, %esi
movl 60(%esp), %edi
xorl %ebx, %esi
addl %esi, %eax
movl %ebx, %esi
roll $10, %ecx
addl %edi, %eax
xorl %ecx, %esi
roll $5, %eax
addl %ebp, %eax
/* 156 */
movl 4(%esp), %edi
xorl %eax, %esi
addl %edi, %ebp
roll $10, %ebx
addl %esi, %ebp
movl %eax, %esi
roll $15, %ebp
addl %edx, %ebp
/* 157 */
xorl %ebx, %esi
movl 16(%esp), %edi
xorl %ebp, %esi
addl %esi, %edx
movl %ebp, %esi
roll $10, %eax
addl %edi, %edx
xorl %eax, %esi
roll $13, %edx
addl %ecx, %edx
/* 158 */
movl 40(%esp), %edi
xorl %edx, %esi
addl %edi, %ecx
roll $10, %ebp
addl %esi, %ecx
movl %edx, %esi
roll $11, %ecx
addl %ebx, %ecx
/* 159 */
xorl %ebp, %esi
movl 48(%esp), %edi
xorl %ecx, %esi
addl %esi, %ebx
roll $10, %edx
addl %edi, %ebx
movl 108(%esp), %edi
roll $11, %ebx
addl %eax, %ebx
movl 4(%edi), %esi
addl %esi, %edx
movl 76(%esp), %esi
addl %esi, %edx
movl 8(%edi), %esi
addl %esi, %ebp
movl 80(%esp), %esi
addl %esi, %ebp
movl 12(%edi), %esi
addl %esi, %eax
movl 84(%esp), %esi
addl %esi, %eax
movl 16(%edi), %esi
addl %esi, %ebx
movl 68(%esp), %esi
addl %esi, %ebx
movl (%edi), %esi
addl %esi, %ecx
movl 72(%esp), %esi
addl %esi, %ecx
movl %edx, (%edi)
movl %ebp, 4(%edi)
movl %eax, 8(%edi)
movl %ebx, 12(%edi)
movl %ecx, 16(%edi)
movl (%esp), %edi
movl 112(%esp), %esi
cmpl %esi, %edi
movl 108(%esp), %edi
jae .L000start
addl $88, %esp
popl %ebx
popl %ebp
popl %edi
popl %esi
ret
.ripemd160_block_x86_end:
SIZE(ripemd160_block_x86,.ripemd160_block_x86_end-ripemd160_block_x86)
.ident "desasm.pl"
#endif /* not PIC */
diff --git a/lib/libmd/i386/sha.S b/lib/libmd/i386/sha.S
index 1e5201f5cb89..3bb54aa9b251 100644
--- a/lib/libmd/i386/sha.S
+++ b/lib/libmd/i386/sha.S
@@ -1,1952 +1,1951 @@
-/* $FreeBSD$ */
/* -*- Fundamental -*- Emacs' assembler mode hoses this file */
#ifndef PIC
/* Run the C pre-processor over this file with one of the following defined
* ELF - elf object files,
* OUT - a.out object files,
* BSDI - BSDI style a.out object files
* SOL - Solaris style elf
*/
#define TYPE(a,b) .type a,b
#define SIZE(a,b) .size a,b
#if defined(OUT) || defined(BSDI)
#define sha1_block_x86 _sha1_block_x86
#endif
#ifdef OUT
#define OK 1
#define ALIGN 4
#endif
#ifdef BSDI
#define OK 1
#define ALIGN 4
#undef SIZE
#undef TYPE
#define SIZE(a,b)
#define TYPE(a,b)
#endif
#if defined(ELF) || defined(SOL)
#define OK 1
#define ALIGN 4
#endif
#ifndef OK
You need to define one of
ELF - elf systems - linux-elf, NetBSD and DG-UX
OUT - a.out systems - linux-a.out and FreeBSD
SOL - solaris systems, which are elf with strange comment lines
BSDI - a.out with a very primative version of as.
#endif
/* Let the Assembler begin :-) */
/* Don't even think of reading this code */
/* It was automatically generated by sha1-586.pl */
/* Which is a perl program used to generate the x86 assember for */
/* any of elf, a.out, BSDI,Win32, or Solaris */
/* eric <eay@cryptsoft.com> */
.file "sha1-586.s"
.version "01.01"
gcc2_compiled.:
.text
.p2align ALIGN
.globl sha1_block_x86
TYPE(sha1_block_x86,@function)
sha1_block_x86:
pushl %esi
pushl %ebp
movl 20(%esp), %eax
movl 16(%esp), %esi
addl %esi, %eax
movl 12(%esp), %ebp
pushl %ebx
subl $64, %eax
pushl %edi
movl 4(%ebp), %ebx
subl $72, %esp
movl 12(%ebp), %edx
movl 16(%ebp), %edi
movl 8(%ebp), %ecx
movl %eax, 68(%esp)
/* First we need to setup the X array */
movl (%esi), %eax
.L000start:
/* First, load the words onto the stack in network byte order */
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, (%esp)
movl 4(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 4(%esp)
movl 8(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 8(%esp)
movl 12(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 12(%esp)
movl 16(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 16(%esp)
movl 20(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 20(%esp)
movl 24(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 24(%esp)
movl 28(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 28(%esp)
movl 32(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 32(%esp)
movl 36(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 36(%esp)
movl 40(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 40(%esp)
movl 44(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 44(%esp)
movl 48(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 48(%esp)
movl 52(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 52(%esp)
movl 56(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 56(%esp)
movl 60(%esi), %eax
.byte 15
.byte 200 /* bswapl %eax */
movl %eax, 60(%esp)
/* We now have the X array on the stack */
/* starting at sp-4 */
movl %esi, 64(%esp)
/* Start processing */
movl (%ebp), %eax
/* 00_15 0 */
movl %ecx, %esi
movl %eax, %ebp
xorl %edx, %esi
roll $5, %ebp
andl %ebx, %esi
addl %edi, %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
movl (%esp), %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %edx, %esi
leal 1518500249(%ebp,%edi,1),%ebp
movl %ebx, %edi
addl %ebp, %esi
xorl %ecx, %edi
movl %esi, %ebp
andl %eax, %edi
roll $5, %ebp
addl %edx, %ebp
movl 4(%esp), %edx
.byte 209
.byte 200 /* rorl $1 %eax */
xorl %ecx, %edi
.byte 209
.byte 200 /* rorl $1 %eax */
leal 1518500249(%ebp,%edx,1),%ebp
addl %ebp, %edi
/* 00_15 2 */
movl %eax, %edx
movl %edi, %ebp
xorl %ebx, %edx
roll $5, %ebp
andl %esi, %edx
addl %ecx, %ebp
.byte 209
.byte 206 /* rorl $1 %esi */
movl 8(%esp), %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
xorl %ebx, %edx
leal 1518500249(%ebp,%ecx,1),%ebp
movl %esi, %ecx
addl %ebp, %edx
xorl %eax, %ecx
movl %edx, %ebp
andl %edi, %ecx
roll $5, %ebp
addl %ebx, %ebp
movl 12(%esp), %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
xorl %eax, %ecx
.byte 209
.byte 207 /* rorl $1 %edi */
leal 1518500249(%ebp,%ebx,1),%ebp
addl %ebp, %ecx
/* 00_15 4 */
movl %edi, %ebx
movl %ecx, %ebp
xorl %esi, %ebx
roll $5, %ebp
andl %edx, %ebx
addl %eax, %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
movl 16(%esp), %eax
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %esi, %ebx
leal 1518500249(%ebp,%eax,1),%ebp
movl %edx, %eax
addl %ebp, %ebx
xorl %edi, %eax
movl %ebx, %ebp
andl %ecx, %eax
roll $5, %ebp
addl %esi, %ebp
movl 20(%esp), %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
xorl %edi, %eax
.byte 209
.byte 201 /* rorl $1 %ecx */
leal 1518500249(%ebp,%esi,1),%ebp
addl %ebp, %eax
/* 00_15 6 */
movl %ecx, %esi
movl %eax, %ebp
xorl %edx, %esi
roll $5, %ebp
andl %ebx, %esi
addl %edi, %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
movl 24(%esp), %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %edx, %esi
leal 1518500249(%ebp,%edi,1),%ebp
movl %ebx, %edi
addl %ebp, %esi
xorl %ecx, %edi
movl %esi, %ebp
andl %eax, %edi
roll $5, %ebp
addl %edx, %ebp
movl 28(%esp), %edx
.byte 209
.byte 200 /* rorl $1 %eax */
xorl %ecx, %edi
.byte 209
.byte 200 /* rorl $1 %eax */
leal 1518500249(%ebp,%edx,1),%ebp
addl %ebp, %edi
/* 00_15 8 */
movl %eax, %edx
movl %edi, %ebp
xorl %ebx, %edx
roll $5, %ebp
andl %esi, %edx
addl %ecx, %ebp
.byte 209
.byte 206 /* rorl $1 %esi */
movl 32(%esp), %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
xorl %ebx, %edx
leal 1518500249(%ebp,%ecx,1),%ebp
movl %esi, %ecx
addl %ebp, %edx
xorl %eax, %ecx
movl %edx, %ebp
andl %edi, %ecx
roll $5, %ebp
addl %ebx, %ebp
movl 36(%esp), %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
xorl %eax, %ecx
.byte 209
.byte 207 /* rorl $1 %edi */
leal 1518500249(%ebp,%ebx,1),%ebp
addl %ebp, %ecx
/* 00_15 10 */
movl %edi, %ebx
movl %ecx, %ebp
xorl %esi, %ebx
roll $5, %ebp
andl %edx, %ebx
addl %eax, %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
movl 40(%esp), %eax
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %esi, %ebx
leal 1518500249(%ebp,%eax,1),%ebp
movl %edx, %eax
addl %ebp, %ebx
xorl %edi, %eax
movl %ebx, %ebp
andl %ecx, %eax
roll $5, %ebp
addl %esi, %ebp
movl 44(%esp), %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
xorl %edi, %eax
.byte 209
.byte 201 /* rorl $1 %ecx */
leal 1518500249(%ebp,%esi,1),%ebp
addl %ebp, %eax
/* 00_15 12 */
movl %ecx, %esi
movl %eax, %ebp
xorl %edx, %esi
roll $5, %ebp
andl %ebx, %esi
addl %edi, %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
movl 48(%esp), %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %edx, %esi
leal 1518500249(%ebp,%edi,1),%ebp
movl %ebx, %edi
addl %ebp, %esi
xorl %ecx, %edi
movl %esi, %ebp
andl %eax, %edi
roll $5, %ebp
addl %edx, %ebp
movl 52(%esp), %edx
.byte 209
.byte 200 /* rorl $1 %eax */
xorl %ecx, %edi
.byte 209
.byte 200 /* rorl $1 %eax */
leal 1518500249(%ebp,%edx,1),%ebp
addl %ebp, %edi
/* 00_15 14 */
movl %eax, %edx
movl %edi, %ebp
xorl %ebx, %edx
roll $5, %ebp
andl %esi, %edx
addl %ecx, %ebp
.byte 209
.byte 206 /* rorl $1 %esi */
movl 56(%esp), %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
xorl %ebx, %edx
leal 1518500249(%ebp,%ecx,1),%ebp
movl %esi, %ecx
addl %ebp, %edx
xorl %eax, %ecx
movl %edx, %ebp
andl %edi, %ecx
roll $5, %ebp
addl %ebx, %ebp
movl 60(%esp), %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
xorl %eax, %ecx
.byte 209
.byte 207 /* rorl $1 %edi */
leal 1518500249(%ebp,%ebx,1),%ebp
addl %ebp, %ecx
/* 16_19 16 */
nop
movl (%esp), %ebp
movl 8(%esp), %ebx
xorl %ebp, %ebx
movl 32(%esp), %ebp
xorl %ebp, %ebx
movl 52(%esp), %ebp
xorl %ebp, %ebx
movl %edi, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %esi, %ebp
movl %ebx, (%esp)
andl %edx, %ebp
leal 1518500249(%ebx,%eax,1),%ebx
xorl %esi, %ebp
movl %ecx, %eax
addl %ebp, %ebx
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
movl 4(%esp), %eax
movl 12(%esp), %ebp
xorl %ebp, %eax
movl 36(%esp), %ebp
xorl %ebp, %eax
movl 56(%esp), %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %ebp, %eax
.byte 209
.byte 192 /* roll $1 %eax */
movl %edx, %ebp
xorl %edi, %ebp
movl %eax, 4(%esp)
andl %ecx, %ebp
leal 1518500249(%eax,%esi,1),%eax
xorl %edi, %ebp
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %eax
/* 16_19 18 */
movl 8(%esp), %ebp
movl 16(%esp), %esi
xorl %ebp, %esi
movl 40(%esp), %ebp
xorl %ebp, %esi
movl 60(%esp), %ebp
xorl %ebp, %esi
movl %ecx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %edx, %ebp
movl %esi, 8(%esp)
andl %ebx, %ebp
leal 1518500249(%esi,%edi,1),%esi
xorl %edx, %ebp
movl %eax, %edi
addl %ebp, %esi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
movl 12(%esp), %edi
movl 20(%esp), %ebp
xorl %ebp, %edi
movl 44(%esp), %ebp
xorl %ebp, %edi
movl (%esp), %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %ebp, %edi
.byte 209
.byte 199 /* roll $1 %edi */
movl %ebx, %ebp
xorl %ecx, %ebp
movl %edi, 12(%esp)
andl %eax, %ebp
leal 1518500249(%edi,%edx,1),%edi
xorl %ecx, %ebp
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edi
/* 20_39 20 */
movl 16(%esp), %edx
movl 24(%esp), %ebp
xorl %ebp, %edx
movl 48(%esp), %ebp
xorl %ebp, %edx
movl 4(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, 16(%esp)
xorl %ebx, %ebp
leal 1859775393(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 21 */
movl 20(%esp), %ecx
movl 28(%esp), %ebp
xorl %ebp, %ecx
movl 52(%esp), %ebp
xorl %ebp, %ecx
movl 8(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 20(%esp)
xorl %eax, %ebp
leal 1859775393(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 20_39 22 */
movl 24(%esp), %ebx
movl 32(%esp), %ebp
xorl %ebp, %ebx
movl 56(%esp), %ebp
xorl %ebp, %ebx
movl 12(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %edi, %ebp
movl %ebx, 24(%esp)
xorl %esi, %ebp
leal 1859775393(%ebx,%eax,1),%ebx
movl %ecx, %eax
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %ebp, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
/* 20_39 23 */
movl 28(%esp), %eax
movl 36(%esp), %ebp
xorl %ebp, %eax
movl 60(%esp), %ebp
xorl %ebp, %eax
movl 16(%esp), %ebp
xorl %ebp, %eax
movl %ecx, %ebp
.byte 209
.byte 192 /* roll $1 %eax */
xorl %edx, %ebp
movl %eax, 28(%esp)
xorl %edi, %ebp
leal 1859775393(%eax,%esi,1),%eax
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
/* 20_39 24 */
movl 32(%esp), %esi
movl 40(%esp), %ebp
xorl %ebp, %esi
movl (%esp), %ebp
xorl %ebp, %esi
movl 20(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 32(%esp)
xorl %edx, %ebp
leal 1859775393(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 25 */
movl 36(%esp), %edi
movl 44(%esp), %ebp
xorl %ebp, %edi
movl 4(%esp), %ebp
xorl %ebp, %edi
movl 24(%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 36(%esp)
xorl %ecx, %ebp
leal 1859775393(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
/* 20_39 26 */
movl 40(%esp), %edx
movl 48(%esp), %ebp
xorl %ebp, %edx
movl 8(%esp), %ebp
xorl %ebp, %edx
movl 28(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, 40(%esp)
xorl %ebx, %ebp
leal 1859775393(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 27 */
movl 44(%esp), %ecx
movl 52(%esp), %ebp
xorl %ebp, %ecx
movl 12(%esp), %ebp
xorl %ebp, %ecx
movl 32(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 44(%esp)
xorl %eax, %ebp
leal 1859775393(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 20_39 28 */
movl 48(%esp), %ebx
movl 56(%esp), %ebp
xorl %ebp, %ebx
movl 16(%esp), %ebp
xorl %ebp, %ebx
movl 36(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %edi, %ebp
movl %ebx, 48(%esp)
xorl %esi, %ebp
leal 1859775393(%ebx,%eax,1),%ebx
movl %ecx, %eax
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %ebp, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
/* 20_39 29 */
movl 52(%esp), %eax
movl 60(%esp), %ebp
xorl %ebp, %eax
movl 20(%esp), %ebp
xorl %ebp, %eax
movl 40(%esp), %ebp
xorl %ebp, %eax
movl %ecx, %ebp
.byte 209
.byte 192 /* roll $1 %eax */
xorl %edx, %ebp
movl %eax, 52(%esp)
xorl %edi, %ebp
leal 1859775393(%eax,%esi,1),%eax
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
/* 20_39 30 */
movl 56(%esp), %esi
movl (%esp), %ebp
xorl %ebp, %esi
movl 24(%esp), %ebp
xorl %ebp, %esi
movl 44(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 56(%esp)
xorl %edx, %ebp
leal 1859775393(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 31 */
movl 60(%esp), %edi
movl 4(%esp), %ebp
xorl %ebp, %edi
movl 28(%esp), %ebp
xorl %ebp, %edi
movl 48(%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 60(%esp)
xorl %ecx, %ebp
leal 1859775393(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
/* 20_39 32 */
movl (%esp), %edx
movl 8(%esp), %ebp
xorl %ebp, %edx
movl 32(%esp), %ebp
xorl %ebp, %edx
movl 52(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, (%esp)
xorl %ebx, %ebp
leal 1859775393(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 33 */
movl 4(%esp), %ecx
movl 12(%esp), %ebp
xorl %ebp, %ecx
movl 36(%esp), %ebp
xorl %ebp, %ecx
movl 56(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 4(%esp)
xorl %eax, %ebp
leal 1859775393(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 20_39 34 */
movl 8(%esp), %ebx
movl 16(%esp), %ebp
xorl %ebp, %ebx
movl 40(%esp), %ebp
xorl %ebp, %ebx
movl 60(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %edi, %ebp
movl %ebx, 8(%esp)
xorl %esi, %ebp
leal 1859775393(%ebx,%eax,1),%ebx
movl %ecx, %eax
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %ebp, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
/* 20_39 35 */
movl 12(%esp), %eax
movl 20(%esp), %ebp
xorl %ebp, %eax
movl 44(%esp), %ebp
xorl %ebp, %eax
movl (%esp), %ebp
xorl %ebp, %eax
movl %ecx, %ebp
.byte 209
.byte 192 /* roll $1 %eax */
xorl %edx, %ebp
movl %eax, 12(%esp)
xorl %edi, %ebp
leal 1859775393(%eax,%esi,1),%eax
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
/* 20_39 36 */
movl 16(%esp), %esi
movl 24(%esp), %ebp
xorl %ebp, %esi
movl 48(%esp), %ebp
xorl %ebp, %esi
movl 4(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 16(%esp)
xorl %edx, %ebp
leal 1859775393(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 37 */
movl 20(%esp), %edi
movl 28(%esp), %ebp
xorl %ebp, %edi
movl 52(%esp), %ebp
xorl %ebp, %edi
movl 8(%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 20(%esp)
xorl %ecx, %ebp
leal 1859775393(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
/* 20_39 38 */
movl 24(%esp), %edx
movl 32(%esp), %ebp
xorl %ebp, %edx
movl 56(%esp), %ebp
xorl %ebp, %edx
movl 12(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, 24(%esp)
xorl %ebx, %ebp
leal 1859775393(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 39 */
movl 28(%esp), %ecx
movl 36(%esp), %ebp
xorl %ebp, %ecx
movl 60(%esp), %ebp
xorl %ebp, %ecx
movl 16(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 28(%esp)
xorl %eax, %ebp
leal 1859775393(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 40_59 40 */
movl 32(%esp), %ebx
movl 40(%esp), %ebp
xorl %ebp, %ebx
movl (%esp), %ebp
xorl %ebp, %ebx
movl 20(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
orl %edi, %ebp
movl %ebx, 32(%esp)
andl %esi, %ebp
leal 2400959708(%ebx,%eax,1),%ebx
movl %edx, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
andl %edi, %eax
orl %eax, %ebp
movl %ecx, %eax
roll $5, %eax
addl %eax, %ebp
movl 36(%esp), %eax
addl %ebp, %ebx
movl 44(%esp), %ebp
xorl %ebp, %eax
movl 4(%esp), %ebp
xorl %ebp, %eax
movl 24(%esp), %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %ebp, %eax
.byte 209
.byte 192 /* roll $1 %eax */
movl %ecx, %ebp
movl %eax, 36(%esp)
orl %edx, %ebp
leal 2400959708(%eax,%esi,1),%eax
movl %ecx, %esi
andl %edi, %ebp
andl %edx, %esi
orl %esi, %ebp
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %ebp
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %eax
/* 40_59 41 */
/* 40_59 42 */
movl 40(%esp), %esi
movl 48(%esp), %ebp
xorl %ebp, %esi
movl 8(%esp), %ebp
xorl %ebp, %esi
movl 28(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
orl %ecx, %ebp
movl %esi, 40(%esp)
andl %edx, %ebp
leal 2400959708(%esi,%edi,1),%esi
movl %ebx, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
andl %ecx, %edi
orl %edi, %ebp
movl %eax, %edi
roll $5, %edi
addl %edi, %ebp
movl 44(%esp), %edi
addl %ebp, %esi
movl 52(%esp), %ebp
xorl %ebp, %edi
movl 12(%esp), %ebp
xorl %ebp, %edi
movl 32(%esp), %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %ebp, %edi
.byte 209
.byte 199 /* roll $1 %edi */
movl %eax, %ebp
movl %edi, 44(%esp)
orl %ebx, %ebp
leal 2400959708(%edi,%edx,1),%edi
movl %eax, %edx
andl %ecx, %ebp
andl %ebx, %edx
orl %edx, %ebp
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %ebp
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edi
/* 40_59 43 */
/* 40_59 44 */
movl 48(%esp), %edx
movl 56(%esp), %ebp
xorl %ebp, %edx
movl 16(%esp), %ebp
xorl %ebp, %edx
movl 36(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
orl %eax, %ebp
movl %edx, 48(%esp)
andl %ebx, %ebp
leal 2400959708(%edx,%ecx,1),%edx
movl %esi, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
andl %eax, %ecx
orl %ecx, %ebp
movl %edi, %ecx
roll $5, %ecx
addl %ecx, %ebp
movl 52(%esp), %ecx
addl %ebp, %edx
movl 60(%esp), %ebp
xorl %ebp, %ecx
movl 20(%esp), %ebp
xorl %ebp, %ecx
movl 40(%esp), %ebp
.byte 209
.byte 206 /* rorl $1 %esi */
xorl %ebp, %ecx
.byte 209
.byte 193 /* roll $1 %ecx */
movl %edi, %ebp
movl %ecx, 52(%esp)
orl %esi, %ebp
leal 2400959708(%ecx,%ebx,1),%ecx
movl %edi, %ebx
andl %eax, %ebp
andl %esi, %ebx
orl %ebx, %ebp
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ebp
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ecx
/* 40_59 45 */
/* 40_59 46 */
movl 56(%esp), %ebx
movl (%esp), %ebp
xorl %ebp, %ebx
movl 24(%esp), %ebp
xorl %ebp, %ebx
movl 44(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
orl %edi, %ebp
movl %ebx, 56(%esp)
andl %esi, %ebp
leal 2400959708(%ebx,%eax,1),%ebx
movl %edx, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
andl %edi, %eax
orl %eax, %ebp
movl %ecx, %eax
roll $5, %eax
addl %eax, %ebp
movl 60(%esp), %eax
addl %ebp, %ebx
movl 4(%esp), %ebp
xorl %ebp, %eax
movl 28(%esp), %ebp
xorl %ebp, %eax
movl 48(%esp), %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %ebp, %eax
.byte 209
.byte 192 /* roll $1 %eax */
movl %ecx, %ebp
movl %eax, 60(%esp)
orl %edx, %ebp
leal 2400959708(%eax,%esi,1),%eax
movl %ecx, %esi
andl %edi, %ebp
andl %edx, %esi
orl %esi, %ebp
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %ebp
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %eax
/* 40_59 47 */
/* 40_59 48 */
movl (%esp), %esi
movl 8(%esp), %ebp
xorl %ebp, %esi
movl 32(%esp), %ebp
xorl %ebp, %esi
movl 52(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
orl %ecx, %ebp
movl %esi, (%esp)
andl %edx, %ebp
leal 2400959708(%esi,%edi,1),%esi
movl %ebx, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
andl %ecx, %edi
orl %edi, %ebp
movl %eax, %edi
roll $5, %edi
addl %edi, %ebp
movl 4(%esp), %edi
addl %ebp, %esi
movl 12(%esp), %ebp
xorl %ebp, %edi
movl 36(%esp), %ebp
xorl %ebp, %edi
movl 56(%esp), %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %ebp, %edi
.byte 209
.byte 199 /* roll $1 %edi */
movl %eax, %ebp
movl %edi, 4(%esp)
orl %ebx, %ebp
leal 2400959708(%edi,%edx,1),%edi
movl %eax, %edx
andl %ecx, %ebp
andl %ebx, %edx
orl %edx, %ebp
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %ebp
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edi
/* 40_59 49 */
/* 40_59 50 */
movl 8(%esp), %edx
movl 16(%esp), %ebp
xorl %ebp, %edx
movl 40(%esp), %ebp
xorl %ebp, %edx
movl 60(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
orl %eax, %ebp
movl %edx, 8(%esp)
andl %ebx, %ebp
leal 2400959708(%edx,%ecx,1),%edx
movl %esi, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
andl %eax, %ecx
orl %ecx, %ebp
movl %edi, %ecx
roll $5, %ecx
addl %ecx, %ebp
movl 12(%esp), %ecx
addl %ebp, %edx
movl 20(%esp), %ebp
xorl %ebp, %ecx
movl 44(%esp), %ebp
xorl %ebp, %ecx
movl (%esp), %ebp
.byte 209
.byte 206 /* rorl $1 %esi */
xorl %ebp, %ecx
.byte 209
.byte 193 /* roll $1 %ecx */
movl %edi, %ebp
movl %ecx, 12(%esp)
orl %esi, %ebp
leal 2400959708(%ecx,%ebx,1),%ecx
movl %edi, %ebx
andl %eax, %ebp
andl %esi, %ebx
orl %ebx, %ebp
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ebp
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ecx
/* 40_59 51 */
/* 40_59 52 */
movl 16(%esp), %ebx
movl 24(%esp), %ebp
xorl %ebp, %ebx
movl 48(%esp), %ebp
xorl %ebp, %ebx
movl 4(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
orl %edi, %ebp
movl %ebx, 16(%esp)
andl %esi, %ebp
leal 2400959708(%ebx,%eax,1),%ebx
movl %edx, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
andl %edi, %eax
orl %eax, %ebp
movl %ecx, %eax
roll $5, %eax
addl %eax, %ebp
movl 20(%esp), %eax
addl %ebp, %ebx
movl 28(%esp), %ebp
xorl %ebp, %eax
movl 52(%esp), %ebp
xorl %ebp, %eax
movl 8(%esp), %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %ebp, %eax
.byte 209
.byte 192 /* roll $1 %eax */
movl %ecx, %ebp
movl %eax, 20(%esp)
orl %edx, %ebp
leal 2400959708(%eax,%esi,1),%eax
movl %ecx, %esi
andl %edi, %ebp
andl %edx, %esi
orl %esi, %ebp
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %ebp
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %eax
/* 40_59 53 */
/* 40_59 54 */
movl 24(%esp), %esi
movl 32(%esp), %ebp
xorl %ebp, %esi
movl 56(%esp), %ebp
xorl %ebp, %esi
movl 12(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
orl %ecx, %ebp
movl %esi, 24(%esp)
andl %edx, %ebp
leal 2400959708(%esi,%edi,1),%esi
movl %ebx, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
andl %ecx, %edi
orl %edi, %ebp
movl %eax, %edi
roll $5, %edi
addl %edi, %ebp
movl 28(%esp), %edi
addl %ebp, %esi
movl 36(%esp), %ebp
xorl %ebp, %edi
movl 60(%esp), %ebp
xorl %ebp, %edi
movl 16(%esp), %ebp
.byte 209
.byte 203 /* rorl $1 %ebx */
xorl %ebp, %edi
.byte 209
.byte 199 /* roll $1 %edi */
movl %eax, %ebp
movl %edi, 28(%esp)
orl %ebx, %ebp
leal 2400959708(%edi,%edx,1),%edi
movl %eax, %edx
andl %ecx, %ebp
andl %ebx, %edx
orl %edx, %ebp
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %ebp
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edi
/* 40_59 55 */
/* 40_59 56 */
movl 32(%esp), %edx
movl 40(%esp), %ebp
xorl %ebp, %edx
movl (%esp), %ebp
xorl %ebp, %edx
movl 20(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
orl %eax, %ebp
movl %edx, 32(%esp)
andl %ebx, %ebp
leal 2400959708(%edx,%ecx,1),%edx
movl %esi, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
andl %eax, %ecx
orl %ecx, %ebp
movl %edi, %ecx
roll $5, %ecx
addl %ecx, %ebp
movl 36(%esp), %ecx
addl %ebp, %edx
movl 44(%esp), %ebp
xorl %ebp, %ecx
movl 4(%esp), %ebp
xorl %ebp, %ecx
movl 24(%esp), %ebp
.byte 209
.byte 206 /* rorl $1 %esi */
xorl %ebp, %ecx
.byte 209
.byte 193 /* roll $1 %ecx */
movl %edi, %ebp
movl %ecx, 36(%esp)
orl %esi, %ebp
leal 2400959708(%ecx,%ebx,1),%ecx
movl %edi, %ebx
andl %eax, %ebp
andl %esi, %ebx
orl %ebx, %ebp
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ebp
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ecx
/* 40_59 57 */
/* 40_59 58 */
movl 40(%esp), %ebx
movl 48(%esp), %ebp
xorl %ebp, %ebx
movl 8(%esp), %ebp
xorl %ebp, %ebx
movl 28(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
orl %edi, %ebp
movl %ebx, 40(%esp)
andl %esi, %ebp
leal 2400959708(%ebx,%eax,1),%ebx
movl %edx, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
andl %edi, %eax
orl %eax, %ebp
movl %ecx, %eax
roll $5, %eax
addl %eax, %ebp
movl 44(%esp), %eax
addl %ebp, %ebx
movl 52(%esp), %ebp
xorl %ebp, %eax
movl 12(%esp), %ebp
xorl %ebp, %eax
movl 32(%esp), %ebp
.byte 209
.byte 202 /* rorl $1 %edx */
xorl %ebp, %eax
.byte 209
.byte 192 /* roll $1 %eax */
movl %ecx, %ebp
movl %eax, 44(%esp)
orl %edx, %ebp
leal 2400959708(%eax,%esi,1),%eax
movl %ecx, %esi
andl %edi, %ebp
andl %edx, %esi
orl %esi, %ebp
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %ebp
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %eax
/* 40_59 59 */
/* 20_39 60 */
movl 48(%esp), %esi
movl 56(%esp), %ebp
xorl %ebp, %esi
movl 16(%esp), %ebp
xorl %ebp, %esi
movl 36(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 48(%esp)
xorl %edx, %ebp
leal 3395469782(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 61 */
movl 52(%esp), %edi
movl 60(%esp), %ebp
xorl %ebp, %edi
movl 20(%esp), %ebp
xorl %ebp, %edi
movl 40(%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 52(%esp)
xorl %ecx, %ebp
leal 3395469782(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
/* 20_39 62 */
movl 56(%esp), %edx
movl (%esp), %ebp
xorl %ebp, %edx
movl 24(%esp), %ebp
xorl %ebp, %edx
movl 44(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, 56(%esp)
xorl %ebx, %ebp
leal 3395469782(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 63 */
movl 60(%esp), %ecx
movl 4(%esp), %ebp
xorl %ebp, %ecx
movl 28(%esp), %ebp
xorl %ebp, %ecx
movl 48(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 60(%esp)
xorl %eax, %ebp
leal 3395469782(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 20_39 64 */
movl (%esp), %ebx
movl 8(%esp), %ebp
xorl %ebp, %ebx
movl 32(%esp), %ebp
xorl %ebp, %ebx
movl 52(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %edi, %ebp
movl %ebx, (%esp)
xorl %esi, %ebp
leal 3395469782(%ebx,%eax,1),%ebx
movl %ecx, %eax
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %ebp, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
/* 20_39 65 */
movl 4(%esp), %eax
movl 12(%esp), %ebp
xorl %ebp, %eax
movl 36(%esp), %ebp
xorl %ebp, %eax
movl 56(%esp), %ebp
xorl %ebp, %eax
movl %ecx, %ebp
.byte 209
.byte 192 /* roll $1 %eax */
xorl %edx, %ebp
movl %eax, 4(%esp)
xorl %edi, %ebp
leal 3395469782(%eax,%esi,1),%eax
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
/* 20_39 66 */
movl 8(%esp), %esi
movl 16(%esp), %ebp
xorl %ebp, %esi
movl 40(%esp), %ebp
xorl %ebp, %esi
movl 60(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 8(%esp)
xorl %edx, %ebp
leal 3395469782(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 67 */
movl 12(%esp), %edi
movl 20(%esp), %ebp
xorl %ebp, %edi
movl 44(%esp), %ebp
xorl %ebp, %edi
movl (%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 12(%esp)
xorl %ecx, %ebp
leal 3395469782(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
/* 20_39 68 */
movl 16(%esp), %edx
movl 24(%esp), %ebp
xorl %ebp, %edx
movl 48(%esp), %ebp
xorl %ebp, %edx
movl 4(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, 16(%esp)
xorl %ebx, %ebp
leal 3395469782(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 69 */
movl 20(%esp), %ecx
movl 28(%esp), %ebp
xorl %ebp, %ecx
movl 52(%esp), %ebp
xorl %ebp, %ecx
movl 8(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 20(%esp)
xorl %eax, %ebp
leal 3395469782(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 20_39 70 */
movl 24(%esp), %ebx
movl 32(%esp), %ebp
xorl %ebp, %ebx
movl 56(%esp), %ebp
xorl %ebp, %ebx
movl 12(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %edi, %ebp
movl %ebx, 24(%esp)
xorl %esi, %ebp
leal 3395469782(%ebx,%eax,1),%ebx
movl %ecx, %eax
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %ebp, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
/* 20_39 71 */
movl 28(%esp), %eax
movl 36(%esp), %ebp
xorl %ebp, %eax
movl 60(%esp), %ebp
xorl %ebp, %eax
movl 16(%esp), %ebp
xorl %ebp, %eax
movl %ecx, %ebp
.byte 209
.byte 192 /* roll $1 %eax */
xorl %edx, %ebp
movl %eax, 28(%esp)
xorl %edi, %ebp
leal 3395469782(%eax,%esi,1),%eax
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
/* 20_39 72 */
movl 32(%esp), %esi
movl 40(%esp), %ebp
xorl %ebp, %esi
movl (%esp), %ebp
xorl %ebp, %esi
movl 20(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 32(%esp)
xorl %edx, %ebp
leal 3395469782(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 73 */
movl 36(%esp), %edi
movl 44(%esp), %ebp
xorl %ebp, %edi
movl 4(%esp), %ebp
xorl %ebp, %edi
movl 24(%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 36(%esp)
xorl %ecx, %ebp
leal 3395469782(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %ebp, %edx
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
/* 20_39 74 */
movl 40(%esp), %edx
movl 48(%esp), %ebp
xorl %ebp, %edx
movl 8(%esp), %ebp
xorl %ebp, %edx
movl 28(%esp), %ebp
xorl %ebp, %edx
movl %esi, %ebp
.byte 209
.byte 194 /* roll $1 %edx */
xorl %eax, %ebp
movl %edx, 40(%esp)
xorl %ebx, %ebp
leal 3395469782(%edx,%ecx,1),%edx
movl %edi, %ecx
roll $5, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ebp, %ecx
.byte 209
.byte 206 /* rorl $1 %esi */
addl %ecx, %edx
/* 20_39 75 */
movl 44(%esp), %ecx
movl 52(%esp), %ebp
xorl %ebp, %ecx
movl 12(%esp), %ebp
xorl %ebp, %ecx
movl 32(%esp), %ebp
xorl %ebp, %ecx
movl %edi, %ebp
.byte 209
.byte 193 /* roll $1 %ecx */
xorl %esi, %ebp
movl %ecx, 44(%esp)
xorl %eax, %ebp
leal 3395469782(%ecx,%ebx,1),%ecx
movl %edx, %ebx
roll $5, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebp, %ebx
.byte 209
.byte 207 /* rorl $1 %edi */
addl %ebx, %ecx
/* 20_39 76 */
movl 48(%esp), %ebx
movl 56(%esp), %ebp
xorl %ebp, %ebx
movl 16(%esp), %ebp
xorl %ebp, %ebx
movl 36(%esp), %ebp
xorl %ebp, %ebx
movl %edx, %ebp
.byte 209
.byte 195 /* roll $1 %ebx */
xorl %edi, %ebp
movl %ebx, 48(%esp)
xorl %esi, %ebp
leal 3395469782(%ebx,%eax,1),%ebx
movl %ecx, %eax
roll $5, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %ebp, %eax
.byte 209
.byte 202 /* rorl $1 %edx */
addl %eax, %ebx
/* 20_39 77 */
movl 52(%esp), %eax
movl 60(%esp), %ebp
xorl %ebp, %eax
movl 20(%esp), %ebp
xorl %ebp, %eax
movl 40(%esp), %ebp
xorl %ebp, %eax
movl %ecx, %ebp
.byte 209
.byte 192 /* roll $1 %eax */
xorl %edx, %ebp
movl %eax, 52(%esp)
xorl %edi, %ebp
leal 3395469782(%eax,%esi,1),%eax
movl %ebx, %esi
roll $5, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %ebp, %esi
.byte 209
.byte 201 /* rorl $1 %ecx */
addl %esi, %eax
/* 20_39 78 */
movl 56(%esp), %esi
movl (%esp), %ebp
xorl %ebp, %esi
movl 24(%esp), %ebp
xorl %ebp, %esi
movl 44(%esp), %ebp
xorl %ebp, %esi
movl %ebx, %ebp
.byte 209
.byte 198 /* roll $1 %esi */
xorl %ecx, %ebp
movl %esi, 56(%esp)
xorl %edx, %ebp
leal 3395469782(%esi,%edi,1),%esi
movl %eax, %edi
roll $5, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %ebp, %edi
.byte 209
.byte 203 /* rorl $1 %ebx */
addl %edi, %esi
/* 20_39 79 */
movl 60(%esp), %edi
movl 4(%esp), %ebp
xorl %ebp, %edi
movl 28(%esp), %ebp
xorl %ebp, %edi
movl 48(%esp), %ebp
xorl %ebp, %edi
movl %eax, %ebp
.byte 209
.byte 199 /* roll $1 %edi */
xorl %ebx, %ebp
movl %edi, 60(%esp)
xorl %ecx, %ebp
leal 3395469782(%edi,%edx,1),%edi
movl %esi, %edx
roll $5, %edx
addl %ebp, %edx
movl 92(%esp), %ebp
.byte 209
.byte 200 /* rorl $1 %eax */
addl %edx, %edi
.byte 209
.byte 200 /* rorl $1 %eax */
/* End processing */
movl 12(%ebp), %edx
addl %ebx, %edx
movl 4(%ebp), %ebx
addl %esi, %ebx
movl %eax, %esi
movl (%ebp), %eax
movl %edx, 12(%ebp)
addl %edi, %eax
movl 16(%ebp), %edi
addl %ecx, %edi
movl 8(%ebp), %ecx
addl %esi, %ecx
movl %eax, (%ebp)
movl 64(%esp), %esi
movl %ecx, 8(%ebp)
addl $64, %esi
movl 68(%esp), %eax
movl %edi, 16(%ebp)
cmpl %esi, %eax
movl %ebx, 4(%ebp)
jb .L001end
movl (%esi), %eax
jmp .L000start
.L001end:
addl $72, %esp
popl %edi
popl %ebx
popl %ebp
popl %esi
ret
.sha1_block_x86_end:
SIZE(sha1_block_x86,.sha1_block_x86_end-sha1_block_x86)
.ident "desasm.pl"
#endif
diff --git a/lib/libmd/md5.h b/lib/libmd/md5.h
index 631dec819e79..a4a9f47d4d90 100644
--- a/lib/libmd/md5.h
+++ b/lib/libmd/md5.h
@@ -1,47 +1,46 @@
-/* $FreeBSD$ */
#ifndef _MD5_H_
#define _MD5_H_
#ifndef _KERNEL
/* Ensure libmd symbols do not clash with libcrypto */
#ifndef MD5Init
#define MD5Init _libmd_MD5Init
#endif
#ifndef MD5Update
#define MD5Update _libmd_MD5Update
#endif
#ifndef MD5Pad
#define MD5Pad _libmd_MD5Pad
#endif
#ifndef MD5Final
#define MD5Final _libmd_MD5Final
#endif
#ifndef MD5Transform
#define MD5Transform _libmd_MD5Transform
#endif
#ifndef MD5End
#define MD5End _libmd_MD5End
#endif
#ifndef MD5Fd
#define MD5Fd _libmd_MD5Fd
#endif
#ifndef MD5FdChunk
#define MD5FdChunk _libmd_MD5FdChunk
#endif
#ifndef MD5File
#define MD5File _libmd_MD5File
#endif
#ifndef MD5FileChunk
#define MD5FileChunk _libmd_MD5FileChunk
#endif
#ifndef MD5Data
#define MD5Data _libmd_MD5Data
#endif
#endif
#include <sys/md5.h>
#endif /* _MD5_H_ */
diff --git a/lib/libmp/mp.h b/lib/libmp/mp.h
index 78f09fd4a129..16a6d040bc29 100644
--- a/lib/libmp/mp.h
+++ b/lib/libmp/mp.h
@@ -1,32 +1,31 @@
-/* $FreeBSD$ */
#ifndef _MP_H_
#define _MP_H_
#ifndef HEADER_BN_H_
#include <openssl/bn.h>
#endif
typedef struct _mint {
BIGNUM *bn;
} MINT;
void mp_gcd(const MINT *, const MINT *, MINT *);
MINT *mp_itom(short);
void mp_madd(const MINT *, const MINT *, MINT *);
int mp_mcmp(const MINT *, const MINT *);
void mp_mdiv(const MINT *, const MINT *, MINT *, MINT *);
void mp_mfree(MINT *);
void mp_min(MINT *);
void mp_mout(const MINT *);
void mp_move(const MINT *, MINT *);
void mp_msqrt(const MINT *, MINT *, MINT *);
void mp_msub(const MINT *, const MINT *, MINT *);
char *mp_mtox(const MINT *);
void mp_mult(const MINT *, const MINT *, MINT *);
void mp_pow(const MINT *, const MINT *, const MINT *, MINT *);
void mp_rpow(const MINT *, short, MINT *);
void mp_sdiv(const MINT *, short, MINT *, short *);
MINT *mp_xtom(const char *);
#endif /* !_MP_H_ */
diff --git a/lib/libnetbsd/efun.c b/lib/libnetbsd/efun.c
index 8a622e4e5524..495bfc5b9368 100644
--- a/lib/libnetbsd/efun.c
+++ b/lib/libnetbsd/efun.c
@@ -1,160 +1,159 @@
/* $NetBSD: efun.c,v 1.10 2015/07/26 02:20:30 kamil Exp $ */
-/* $FreeBSD$ */
/*-
* Copyright (c) 2006 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Christos Zoulas.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#if HAVE_NBTOOL_CONFIG_H
#include "nbtool_config.h"
#endif
#include <sys/cdefs.h>
#ifdef __RCSID
__RCSID("$NetBSD: efun.c,v 1.10 2015/07/26 02:20:30 kamil Exp $");
#endif
#include <err.h>
#include <errno.h>
#include <inttypes.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <util.h>
static void (*efunc)(int, const char *, ...) = err;
void (*
esetfunc(void (*ef)(int, const char *, ...)))(int, const char *, ...)
{
void (*of)(int, const char *, ...) = efunc;
efunc = ef == NULL ? (void (*)(int, const char *, ...))exit : ef;
return of;
}
size_t
estrlcpy(char *dst, const char *src, size_t len)
{
size_t rv;
if ((rv = strlcpy(dst, src, len)) >= len) {
errno = ENAMETOOLONG;
(*efunc)(1,
"Cannot copy string; %zu chars needed %zu provided",
rv, len);
}
return rv;
}
size_t
estrlcat(char *dst, const char *src, size_t len)
{
size_t rv;
if ((rv = strlcat(dst, src, len)) >= len) {
errno = ENAMETOOLONG;
(*efunc)(1,
"Cannot append to string; %zu chars needed %zu provided",
rv, len);
}
return rv;
}
char *
estrdup(const char *s)
{
char *d = strdup(s);
if (d == NULL)
(*efunc)(1, "Cannot copy string");
return d;
}
char *
estrndup(const char *s, size_t len)
{
char *d = strndup(s, len);
if (d == NULL)
(*efunc)(1, "Cannot copy string");
return d;
}
void *
emalloc(size_t n)
{
void *p = malloc(n);
if (p == NULL && n != 0)
(*efunc)(1, "Cannot allocate %zu bytes", n);
return p;
}
void *
ecalloc(size_t n, size_t s)
{
void *p = calloc(n, s);
if (p == NULL && n != 0 && s != 0)
(*efunc)(1, "Cannot allocate %zu blocks of size %zu", n, s);
return p;
}
void *
erealloc(void *p, size_t n)
{
void *q = realloc(p, n);
if (q == NULL && n != 0)
(*efunc)(1, "Cannot re-allocate %zu bytes", n);
return q;
}
FILE *
efopen(const char *p, const char *m)
{
FILE *fp = fopen(p, m);
if (fp == NULL)
(*efunc)(1, "Cannot open `%s'", p);
return fp;
}
int
easprintf(char ** __restrict ret, const char * __restrict format, ...)
{
int rv;
va_list ap;
va_start(ap, format);
if ((rv = vasprintf(ret, format, ap)) == -1)
(*efunc)(1, "Cannot format string");
va_end(ap);
return rv;
}
int
evasprintf(char ** __restrict ret, const char * __restrict format, va_list ap)
{
int rv;
if ((rv = vasprintf(ret, format, ap)) == -1)
(*efunc)(1, "Cannot format string");
return rv;
}
diff --git a/lib/libnetbsd/netinet/in.h b/lib/libnetbsd/netinet/in.h
index c108ae3b4445..d77238a005c2 100644
--- a/lib/libnetbsd/netinet/in.h
+++ b/lib/libnetbsd/netinet/in.h
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 1982, 1986, 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)in.h 8.3 (Berkeley) 1/3/94
*/
#ifndef _LIBNETBSD_NETINET_IN_H_
#define _LIBNETBSD_NETINET_IN_H_
#include_next <netinet/in.h>
/*
* Local port number conventions:
*
* Ports < IPPORT_RESERVED are reserved for privileged processes (e.g. root),
* unless a kernel is compiled with IPNOPRIVPORTS defined.
*
* When a user does a bind(2) or connect(2) with a port number of zero,
* a non-conflicting local port address is chosen.
*
* The default range is IPPORT_ANONMIN to IPPORT_ANONMAX, although
* that is settable by sysctl(3); net.inet.ip.anonportmin and
* net.inet.ip.anonportmax respectively.
*
* A user may set the IPPROTO_IP option IP_PORTRANGE to change this
* default assignment range.
*
* The value IP_PORTRANGE_DEFAULT causes the default behavior.
*
* The value IP_PORTRANGE_HIGH is the same as IP_PORTRANGE_DEFAULT,
* and exists only for FreeBSD compatibility purposes.
*
* The value IP_PORTRANGE_LOW changes the range to the "low" are
* that is (by convention) restricted to privileged processes.
* This convention is based on "vouchsafe" principles only.
* It is only secure if you trust the remote host to restrict these ports.
* The range is IPPORT_RESERVEDMIN to IPPORT_RESERVEDMAX.
*/
#define IPPORT_ANONMIN 49152
#define IPPORT_ANONMAX 65535
#define IPPORT_RESERVEDMIN 600
#define IPPORT_RESERVEDMAX (IPPORT_RESERVED-1)
#endif
diff --git a/lib/libnetbsd/rmd160.h b/lib/libnetbsd/rmd160.h
index 0eefac837f57..6aff4b7bcf1c 100644
--- a/lib/libnetbsd/rmd160.h
+++ b/lib/libnetbsd/rmd160.h
@@ -1,46 +1,45 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2012 SRI International
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _RMD160_H_
#define _RMD160_H_
#include <ripemd.h>
#define RMD160_CTX RIPEMD160_CTX
#define RMD160End RIPEMD160_End
#define RMD160File RIPEMD160_File
#define RMD160Init RIPEMD160_Init
#define RMD160Update RIPEMD160_Update
#endif /* _RMD160_H_ */
diff --git a/lib/libnetbsd/sha1.h b/lib/libnetbsd/sha1.h
index 3dc7ce5536a5..f74f465620c7 100644
--- a/lib/libnetbsd/sha1.h
+++ b/lib/libnetbsd/sha1.h
@@ -1,48 +1,47 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2012 SRI International
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _SHA1_H_
#define _SHA1_H_
#include <sha.h>
#define SHA1_CTX SHA_CTX
#define SHA1End SHA1_End
#define SHA1File SHA1_File
#define SHA1Final SHA1_Final
#define SHA1Init SHA1_Init
#define SHA1Update SHA1_Update
#endif /* _SHA1_H_ */
diff --git a/lib/libnetbsd/sha2.h b/lib/libnetbsd/sha2.h
index 84d79310e882..6831e134bb86 100644
--- a/lib/libnetbsd/sha2.h
+++ b/lib/libnetbsd/sha2.h
@@ -1,42 +1,41 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2012 SRI International
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _SHA2_H_
#define _SHA2_H_
#include <sha256.h>
#include <sha384.h>
#include <sha512.h>
#endif /* _SHA2_H_ */
diff --git a/lib/libnetbsd/stdlib.h b/lib/libnetbsd/stdlib.h
index 1ccc18b3ec49..82ce33420492 100644
--- a/lib/libnetbsd/stdlib.h
+++ b/lib/libnetbsd/stdlib.h
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2012 SRI International
* Copyright (c) 2001-2002,2004 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Luke Mewburn.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _LIBNETBSD_STDLIB_H_
#define _LIBNETBSD_STDLIB_H_
#include_next <stdlib.h>
long long strsuftoll(const char *, const char *, long long, long long);
long long strsuftollx(const char *, const char *,
long long, long long, char *, size_t);
#endif /* _LIBNETBSD_STDLIB_H_ */
diff --git a/lib/libnetbsd/sys/cdefs.h b/lib/libnetbsd/sys/cdefs.h
index 9adb99193d83..8da812693961 100644
--- a/lib/libnetbsd/sys/cdefs.h
+++ b/lib/libnetbsd/sys/cdefs.h
@@ -1,85 +1,84 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2012 SRI International
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _LIBNETBSD_SYS_CDEFS_H_
#define _LIBNETBSD_SYS_CDEFS_H_
#include_next <sys/cdefs.h>
#ifndef __dead
#ifdef __dead2
#define __dead __dead2
#else
#define __dead
#endif
#endif /* !__dead */
/*
* The __CONCAT macro is used to concatenate parts of symbol names, e.g.
* with "#define OLD(foo) __CONCAT(old,foo)", OLD(foo) produces oldfoo.
* The __CONCAT macro is a bit tricky -- make sure you don't put spaces
* in between its arguments. __CONCAT can also concatenate double-quoted
* strings produced by the __STRING macro, but this only works with ANSI C.
*/
#define ___STRING(x) __STRING(x)
#define ___CONCAT(x,y) __CONCAT(x,y)
/*
* The following macro is used to remove const cast-away warnings
* from gcc -Wcast-qual; it should be used with caution because it
* can hide valid errors; in particular most valid uses are in
* situations where the API requires it, not to cast away string
* constants. We don't use *intptr_t on purpose here and we are
* explicit about unsigned long so that we don't have additional
* dependencies.
*/
#define __UNCONST(a) ((void *)(unsigned long)(const void *)(a))
/*
* Return the number of elements in a statically-allocated array,
* __x.
*/
#define __arraycount(__x) (sizeof(__x) / sizeof(__x[0]))
/* __BIT(n): nth bit, where __BIT(0) == 0x1. */
#define __BIT(__n) \
(((uintmax_t)(__n) >= NBBY * sizeof(uintmax_t)) ? 0 : \
((uintmax_t)1 << (uintmax_t)((__n) & (NBBY * sizeof(uintmax_t) - 1))))
/* __BITS(m, n): bits m through n, m < n. */
#define __BITS(__m, __n) \
((__BIT(MAX((__m), (__n)) + 1) - 1) ^ (__BIT(MIN((__m), (__n))) - 1))
#endif /* _LIBNETBSD_SYS_CDEFS_H_ */
diff --git a/lib/libnetbsd/util.h b/lib/libnetbsd/util.h
index 47100fd45375..1fbd2eee0ebc 100644
--- a/lib/libnetbsd/util.h
+++ b/lib/libnetbsd/util.h
@@ -1,60 +1,59 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2012 SRI International
* Copyright (c) 1995
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _LIBNETBSD_UTIL_H_
#define _LIBNETBSD_UTIL_H_
#include <sys/types.h>
#include <libutil.h>
#include <stdio.h>
void (*esetfunc(void (*)(int, const char *, ...)))(int, const char *, ...);
size_t estrlcpy(char *, const char *, size_t);
size_t estrlcat(char *, const char *, size_t);
char *estrdup(const char *);
char *estrndup(const char *, size_t);
void *emalloc(size_t);
void *ecalloc(size_t, size_t);
void *erealloc(void *, size_t);
FILE *efopen(const char *, const char *);
int easprintf(char ** __restrict, const char * __restrict, ...)
__printflike(2, 3);
int evasprintf(char ** __restrict, const char * __restrict, __va_list)
__printflike(2, 0);
char *flags_to_string(u_long flags, const char *def);
int sockaddr_snprintf(char *, size_t, const char *,
const struct sockaddr *);
int string_to_flags(char **stringp, u_long *setp, u_long *clrp);
#endif
diff --git a/lib/libopie/config.h b/lib/libopie/config.h
index b9bc40c06627..b1d1e453324a 100644
--- a/lib/libopie/config.h
+++ b/lib/libopie/config.h
@@ -1,381 +1,380 @@
-/* $FreeBSD$ */
/* config.h. Generated automatically by configure. */
/* config.h.in. Generated automatically from configure.in by autoheader. */
/* Define if on AIX 3.
System headers sometimes define this.
We just want to avoid a redefinition error message. */
#ifndef _ALL_SOURCE
/* #undef _ALL_SOURCE */
#endif
/* Define if using alloca.c. */
/* #undef C_ALLOCA */
/* Define to empty if the keyword does not work. */
/* #undef const */
/* Define to one of _getb67, GETB67, getb67 for Cray-2 and Cray-YMP systems.
This function is required for alloca.c support on those systems. */
/* #undef CRAY_STACKSEG_END */
/* Define if you have alloca, as a function or macro. */
#define HAVE_ALLOCA 1
/* Define if you have <alloca.h> and it should be used (not on Ultrix). */
/* #undef HAVE_ALLOCA_H */
/* Define if you have <sys/wait.h> that is POSIX.1 compatible. */
#define HAVE_SYS_WAIT_H 1
/* Define if on MINIX. */
/* #undef _MINIX */
/* Define if the system does not provide POSIX.1 features except
with this defined. */
/* #undef _POSIX_1_SOURCE */
/* Define if you need to in order for stat and other things to work. */
/* #undef _POSIX_SOURCE */
/* Define as the return type of signal handlers (int or void). */
#define RETSIGTYPE void
/* If using the C implementation of alloca, define if you know the
direction of stack growth for your system; otherwise it will be
automatically deduced at run-time.
STACK_DIRECTION > 0 => grows toward higher addresses
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown
*/
/* #undef STACK_DIRECTION */
/* Define if you want the FTP daemon to support anonymous logins. */
/* #undef DOANONYMOUS */
/* The default value of the PATH environment variable */
#define DEFAULT_PATH "/usr/bin:/bin:/usr/sbin:/sbin"
/* Defined if the file /etc/default/login exists
(and, presumably, should be looked at by login) */
/* #undef HAVE_ETC_DEFAULT_LOGIN */
/* Defined to the name of a file that contains a list of files whose
permissions and ownerships should be changed on login. */
/* #undef HAVE_LOGIN_PERMFILE */
/* Defined to the name of a file that contains a list of environment
values that should be set on login. */
/* #undef HAVE_LOGIN_ENVFILE */
/* Defined if the file /etc/securetty exists
(and, presumably, should be looked at by login) */
/* #undef HAVE_SECURETTY */
/* Defined if the file /etc/shadow exists
(and, presumably, should be looked at for shadow passwords) */
/* #undef HAVE_ETC_SHADOW */
/* The path to the access file, if we're going to use it */
/* #undef PATH_ACCESS_FILE */
/* The path to the mail spool, if we know it */
#define PATH_MAIL "/var/mail"
/* The path to the utmp file, if we know it */
#define PATH_UTMP_AC "/var/run/utmp"
/* The path to the wtmp file, if we know it */
#define PATH_WTMP_AC "/var/log/wtmp"
/* The path to the wtmpx file, if we know it */
/* #undef PATH_WTMPX_AC */
/* Defined if the system's profile (/etc/profile) displays
the motd file */
/* #undef HAVE_MOTD_IN_PROFILE */
/* Defined if the system's profile (/etc/profile) informs the
user of new mail */
/* #undef HAVE_MAILCHECK_IN_PROFILE */
/* Define if you have a nonstandard gettimeofday() that takes one argument
instead of two. */
/* #undef HAVE_ONE_ARG_GETTIMEOFDAY */
/* Define if the system has the getenv function */
#define HAVE_GETENV 1
/* Define if the system has the setenv function */
#define HAVE_SETENV 1
/* Define if the system has the /var/adm/sulog file */
/* #undef HAVE_SULOG */
/* Define if the system has the unsetenv function */
#define HAVE_UNSETENV 1
/* Define if the compiler can handle ANSI-style argument lists */
#define HAVE_ANSIDECL 1
/* Define if the compiler can handle ANSI-style prototypes */
#define HAVE_ANSIPROTO 1
/* Define if the system has an ANSI-style printf (returns int instead of char *) */
#define HAVE_ANSISPRINTF 1
/* Define if the compiler can handle ANSI-style variable argument lists */
#define HAVE_ANSISTDARG 1
/* Define if the compiler can handle void argument lists to functions */
#define HAVE_VOIDARG 1
/* Define if the compiler can handle void return "values" from functions */
#define HAVE_VOIDRET 1
/* Define if the compiler can handle void pointers to our liking */
#define HAVE_VOIDPTR 1
/* Define if the /bin/ls command seems to support the -g flag */
/* #undef HAVE_LS_G_FLAG */
/* Define if there is a ut_pid field in struct utmp */
/* #undef HAVE_UT_PID */
/* Define if there is a ut_type field in struct utmp */
/* #undef HAVE_UT_TYPE */
/* Define if there is a ut_name field in struct utmp */
#define HAVE_UT_NAME 1
/* Define if there is a ut_host field in struct utmp */
#define HAVE_UT_HOST 1
/* Define if the system has getutline() */
/* #undef HAVE_GETUTLINE */
/* Defined if the system has SunOS C2 security shadow passwords */
/* #undef HAVE_SUNOS_C2_SHADOW */
/* Defined if you want to disable utmp support */
/* #undef DISABLE_UTMP */
/* Defined if you want to allow users to override the insecure checks */
/* #undef INSECURE_OVERRIDE */
/* Defined to the default hash value, always defined */
#define MDX 5
/* Defined if new-style prompts are to be used */
#define NEW_PROMPTS 1
/* Defined to the path of the OPIE lock directory */
#define OPIE_LOCK_DIR "/var/spool/opielocks"
/* Defined if users are to be asked to re-type secret pass phrases */
/* #undef RETYPE */
/* Defined if su should not switch to disabled accounts */
/* #undef SU_STAR_CHECK */
/* Don't turn it on! It allows intruder easily disable whole OPIE for user */
/* Defined if user locking is to be used */
/* #undef USER_LOCKING */
/* Define if you have the bcopy function. */
/* #undef HAVE_BCOPY */
/* Define if you have the bzero function. */
/* #undef HAVE_BZERO */
/* Define if you have the endspent function. */
/* #undef HAVE_ENDSPENT */
/* Define if you have the fpurge function. */
#define HAVE_FPURGE 1
/* Define if you have the getdtablesize function. */
/* #undef HAVE_GETDTABLESIZE */
/* Define if you have the getgroups function. */
#define HAVE_GETGROUPS 1
/* Define if you have the gethostname function. */
/* #undef HAVE_GETHOSTNAME */
/* Define if you have the getspnam function. */
/* #undef HAVE_GETSPNAM */
/* Define if you have the gettimeofday function. */
#define HAVE_GETTIMEOFDAY 1
/* Define if you have the getttynam function. */
#define HAVE_GETTTYNAM 1
/* Define if you have the getusershell function. */
#define HAVE_GETUSERSHELL 1
/* Define if you have the getutxline function. */
#define HAVE_GETUTXLINE 1
/* Define if you have the getwd function. */
/* #undef HAVE_GETWD */
/* Define if you have the index function. */
/* #undef HAVE_INDEX */
/* Define if you have the lstat function. */
#define HAVE_LSTAT 1
/* Define if you have the on_exit function. */
/* #undef HAVE_ON_EXIT */
/* Define if you have the pututxline function. */
#define HAVE_PUTUTXLINE 1
/* Define if you have the rindex function. */
/* #undef HAVE_RINDEX */
/* Define if you have the setgroups function. */
#define HAVE_SETGROUPS 1
/* Define if you have the setlogin function. */
#define HAVE_SETLOGIN 1
/* Define if you have the setpriority function. */
#define HAVE_SETPRIORITY 1
/* Define if you have the setregid function. */
/* #undef HAVE_SETREGID */
/* Define if you have the setresgid function. */
/* #undef HAVE_SETRESGID */
/* Define if you have the setresuid function. */
/* #undef HAVE_SETRESUID */
/* Define if you have the setreuid function. */
/* #undef HAVE_SETREUID */
/* Define if you have the setvbuf function. */
#define HAVE_SETVBUF 1
/* Define if you have the sigaddset function. */
#define HAVE_SIGADDSET 1
/* Define if you have the sigblock function. */
/* #undef HAVE_SIGBLOCK */
/* Define if you have the sigemptyset function. */
#define HAVE_SIGEMPTYSET 1
/* Define if you have the sigsetmask function. */
/* #undef HAVE_SIGSETMASK */
/* Define if you have the socket function. */
#define HAVE_SOCKET 1
/* Define if you have the strerror function. */
#define HAVE_STRERROR 1
/* Define if you have the strftime function. */
#define HAVE_STRFTIME 1
/* Define if you have the strncasecmp function. */
#define HAVE_STRNCASECMP 1
/* Define if you have the strstr function. */
#define HAVE_STRSTR 1
/* Define if you have the ttyslot function. */
#define HAVE_TTYSLOT 1
/* Define if you have the usleep function. */
#define HAVE_USLEEP 1
/* Define if you have the <crypt.h> header file. */
/* #undef HAVE_CRYPT_H */
/* Define if you have the <dirent.h> header file. */
#define HAVE_DIRENT_H 1
/* Define if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define if you have the <lastlog.h> header file. */
/* #undef HAVE_LASTLOG_H */
/* Define if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define if you have the <ndir.h> header file. */
/* #undef HAVE_NDIR_H */
/* Define if you have the <paths.h> header file. */
#define HAVE_PATHS_H 1
/* Define if you have the <pwd.h> header file. */
#define HAVE_PWD_H 1
/* Define if you have the <shadow.h> header file. */
/* #undef HAVE_SHADOW_H */
/* Define if you have the <signal.h> header file. */
#define HAVE_SIGNAL_H 1
/* Define if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define if you have the <sys/dir.h> header file. */
/* #undef HAVE_SYS_DIR_H */
/* Define if you have the <sys/file.h> header file. */
#define HAVE_SYS_FILE_H 1
/* Define if you have the <sys/ioctl.h> header file. */
#define HAVE_SYS_IOCTL_H 1
/* Define if you have the <sys/ndir.h> header file. */
/* #undef HAVE_SYS_NDIR_H */
/* Define if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define if you have the <sys/signal.h> header file. */
#define HAVE_SYS_SIGNAL_H 1
/* Define if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define if you have the <sys/utsname.h> header file. */
#define HAVE_SYS_UTSNAME_H 1
/* Define if you have the <syslog.h> header file. */
#define HAVE_SYSLOG_H 1
/* Define if you have the <termios.h> header file. */
#define HAVE_TERMIOS_H 1
/* Define if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define if you have the <utmpx.h> header file. */
#define HAVE_UTMPX_H 1
/* Define if you have the crypt library (-lcrypt). */
#define HAVE_LIBCRYPT 1
/* Define if you have the nsl library (-lnsl). */
/* #undef HAVE_LIBNSL */
/* Define if you have the posix library (-lposix). */
/* #undef HAVE_LIBPOSIX */
/* Define if you have the socket library (-lsocket). */
/* #undef HAVE_LIBSOCKET */
diff --git a/lib/libpcap/config.h b/lib/libpcap/config.h
index a0e94c76c8b9..0ba6342040ef 100644
--- a/lib/libpcap/config.h
+++ b/lib/libpcap/config.h
@@ -1,223 +1,222 @@
-/* $FreeBSD$ */
/* This is an edited copy of the config.h generated by configure. */
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.ac by autoheader. */
/* Define to 1 if you have the `asprintf' function. */
#define HAVE_ASPRINTF 1
/* Define to 1 if you have the `ether_hostton' function. */
#define HAVE_ETHER_HOSTTON 1
/* Define to 1 if you have the `ffs' function. */
#define HAVE_FFS 1
/* Define to 1 if fseeko (and presumably ftello) exists and is declared. */
#define HAVE_FSEEKO 1
/* on HP-UX 10.20 or later */
/* #undef HAVE_HPUX10_20_OR_LATER */
/* on HP-UX 9.x */
/* #undef HAVE_HPUX9 */
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* if libdlpi exists */
/* #undef HAVE_LIBDLPI */
/* if libnl exists */
/* #undef HAVE_LIBNL */
/* if libnl exists and is version 2.x */
/* #undef HAVE_LIBNL_2_x */
/* if libnl exists and is version 3.x */
/* #undef HAVE_LIBNL_3_x */
/* libnl has NLE_FAILURE */
/* #undef HAVE_LIBNL_NLE */
/* libnl has new-style socket api */
/* #undef HAVE_LIBNL_SOCKETS */
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define to 1 if you have the <linux/compiler.h> header file. */
/* #undef HAVE_LINUX_COMPILER_H */
/* Define to 1 if you have the <linux/ethtool.h> header file. */
/* #undef HAVE_LINUX_ETHTOOL_H */
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the <netpacket/packet.h> header file. */
/* #undef HAVE_NETPACKET_PACKET_H */
/* Define to 1 if you have the <net/bpf.h> header file. */
#define HAVE_NET_BPF_H 1
/* Define to 1 if you have the <net/if_media.h> header file. */
#define HAVE_NET_IF_MEDIA_H 1
/* Define to 1 if you have the <net/pfvar.h> header file. */
/* See Makefile */
/* #undef HAVE_NET_PFVAR_H */
/* if there's an os_proto.h for this platform, to use additional prototypes */
/* #undef HAVE_OS_PROTO_H */
/* define if net/pfvar.h defines PF_NAT through PF_NORDR */
#define HAVE_PF_NAT_THROUGH_PF_NORDR 1
/* define if you have the Septel API */
/* #undef HAVE_SEPTEL_API */
/* define if you have the Myricom SNF API */
/* #undef HAVE_SNF_API */
/* Define to 1 if you have the `snprintf' function. */
#define HAVE_SNPRINTF 1
/* Define to 1 if the system has the type `socklen_t'. */
#define HAVE_SOCKLEN_T 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strerror' function. */
#define HAVE_STRERROR 1
/* Define to 1 if you have the `strerror_r' function. */
#define HAVE_STRERROR_R 1
/* Define to 1 if you have the `strerror_s' function. */
/* #undef HAVE_STRERROR_S */
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcat' function. */
#define HAVE_STRLCAT 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the `strtok_r' function. */
#define HAVE_STRTOK_R 1
/* Define to 1 if the system has the type `struct BPF_TIMEVAL'. */
/* #undef HAVE_STRUCT_BPF_TIMEVAL */
/* Define to 1 if the system has the type `struct ether_addr'. */
/* #undef HAVE_STRUCT_ETHER_ADDR */
/* Define to 1 if `sa_len' is a member of `struct sockaddr'. */
#define HAVE_STRUCT_SOCKADDR_SA_LEN 1
/* Define to 1 if the system has the type `struct sockaddr_storage'. */
#define HAVE_STRUCT_SOCKADDR_STORAGE 1
/* Define to 1 if you have the <sys/bufmod.h> header file. */
/* #undef HAVE_SYS_BUFMOD_H */
/* Define to 1 if you have the <sys/dlpi_ext.h> header file. */
/* #undef HAVE_SYS_DLPI_EXT_H */
/* Define to 1 if you have the <sys/ioccom.h> header file. */
#define HAVE_SYS_IOCCOM_H 1
/* Define to 1 if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define to 1 if you have the <sys/sockio.h> header file. */
#define HAVE_SYS_SOCKIO_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* define if you have the TurboCap API */
/* #undef HAVE_TC_API */
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `vsnprintf' function. */
#define HAVE_VSNPRINTF 1
/* IPv6 */
/* See Makefile */
/* #undef INET6 */
/* if unaligned access fails */
/* #undef LBL_ALIGN */
/* path for device for USB sniffing */
/* #undef LINUX_USB_MON_DEV */
/* Define to 1 if netinet/ether.h declares `ether_hostton' */
/* #undef NETINET_ETHER_H_DECLARES_ETHER_HOSTTON */
/* Define to 1 if netinet/if_ether.h declares `ether_hostton' */
#define NETINET_IF_ETHER_H_DECLARES_ETHER_HOSTTON /**/
/* do not use protochain */
/* #undef NO_PROTOCHAIN */
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT ""
/* Define to the full name of this package. */
#define PACKAGE_NAME "pcap"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "pcap 1.9.1"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "pcap"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "1.9.1"
/* target host supports netmap */
#define PCAP_SUPPORT_NETMAP 1
/* use packet ring capture support on Linux if available */
#define PCAP_SUPPORT_PACKET_RING 1
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define to 1 if strings.h declares `ffs' */
#define STRINGS_H_DECLARES_FFS /**/
/* Enable parser debugging */
/* #undef YYDEBUG */
/* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a
`char[]'. */
#define YYTEXT_POINTER 1
/* Enable large inode numbers on Mac OS X 10.5. */
#ifndef _DARWIN_USE_64_BIT_INODE
# define _DARWIN_USE_64_BIT_INODE 1
#endif
/* Define as token for inline if inlining supported */
#define inline inline
diff --git a/lib/libpmc/pmu-events/jsmn.h b/lib/libpmc/pmu-events/jsmn.h
index cb92cabeb5b8..1bdfd55fff30 100644
--- a/lib/libpmc/pmu-events/jsmn.h
+++ b/lib/libpmc/pmu-events/jsmn.h
@@ -1,69 +1,68 @@
/* SPDX-License-Identifier: MIT */
-/* $FreeBSD$ */
#ifndef __JSMN_H_
#define __JSMN_H_
/*
* JSON type identifier. Basic types are:
* o Object
* o Array
* o String
* o Other primitive: number, boolean (true/false) or null
*/
typedef enum {
JSMN_PRIMITIVE = 0,
JSMN_OBJECT = 1,
JSMN_ARRAY = 2,
JSMN_STRING = 3
} jsmntype_t;
typedef enum {
/* Not enough tokens were provided */
JSMN_ERROR_NOMEM = -1,
/* Invalid character inside JSON string */
JSMN_ERROR_INVAL = -2,
/* The string is not a full JSON packet, more bytes expected */
JSMN_ERROR_PART = -3,
/* Everything was fine */
JSMN_SUCCESS = 0
} jsmnerr_t;
/*
* JSON token description.
* @param type type (object, array, string etc.)
* @param start start position in JSON data string
* @param end end position in JSON data string
*/
typedef struct {
jsmntype_t type;
int start;
int end;
int size;
} jsmntok_t;
/*
* JSON parser. Contains an array of token blocks available. Also stores
* the string being parsed now and current position in that string
*/
typedef struct {
unsigned int pos; /* offset in the JSON string */
int toknext; /* next token to allocate */
int toksuper; /* superior token node, e.g parent object or array */
} jsmn_parser;
/*
* Create JSON parser over an array of tokens
*/
void jsmn_init(jsmn_parser *parser);
/*
* Run JSON parser. It parses a JSON data string into and array of tokens,
* each describing a single JSON object.
*/
jsmnerr_t jsmn_parse(jsmn_parser *parser, const char *js,
size_t len,
jsmntok_t *tokens, unsigned int num_tokens);
const char *jsmn_strerror(jsmnerr_t err);
#endif /* __JSMN_H_ */
diff --git a/lib/libpmc/pmu-events/json.h b/lib/libpmc/pmu-events/json.h
index 871362aaf1da..278ebd32cfb6 100644
--- a/lib/libpmc/pmu-events/json.h
+++ b/lib/libpmc/pmu-events/json.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
#ifndef JSON_H
#define JSON_H 1
#include "jsmn.h"
jsmntok_t *parse_json(const char *fn, char **map, size_t *size, int *len);
void free_json(char *map, size_t size, jsmntok_t *tokens);
int json_line(char *map, jsmntok_t *t);
const char *json_name(jsmntok_t *t);
int json_streq(char *map, jsmntok_t *t, const char *s);
int json_len(jsmntok_t *t);
extern int verbose;
#include <stdbool.h>
extern int eprintf(int level, int var, const char *fmt, ...);
#define pr_fmt(fmt) fmt
#define pr_err(fmt, ...) \
eprintf(0, verbose, pr_fmt(fmt), ##__VA_ARGS__)
#define pr_info(fmt, ...) \
eprintf(1, verbose, pr_fmt(fmt), ##__VA_ARGS__)
#define pr_debug(fmt, ...) \
eprintf(2, verbose, pr_fmt(fmt), ##__VA_ARGS__)
#ifndef roundup
#define roundup(x, y) ( \
{ \
const typeof(y) __y = y; \
(((x) + (__y - 1)) / __y) * __y; \
} \
)
#endif
#endif
diff --git a/lib/librpcsec_gss/rpcsec_gss_int.h b/lib/librpcsec_gss/rpcsec_gss_int.h
index e247d70fc3c5..34f75cb1a0d5 100644
--- a/lib/librpcsec_gss/rpcsec_gss_int.h
+++ b/lib/librpcsec_gss/rpcsec_gss_int.h
@@ -1,97 +1,96 @@
/*
SPDX-License-Identifier: BSD-3-Clause
rpcsec_gss.h
Copyright (c) 2000 The Regents of the University of Michigan.
All rights reserved.
Copyright (c) 2000 Dug Song <dugsong@UMICH.EDU>.
All rights reserved, all wrongs reversed.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
$Id: auth_gss.h,v 1.12 2001/04/30 19:44:47 andros Exp $
*/
-/* $FreeBSD$ */
#ifndef _RPCSEC_GSS_INT_H
#define _RPCSEC_GSS_INT_H
/* RPCSEC_GSS control procedures. */
typedef enum {
RPCSEC_GSS_DATA = 0,
RPCSEC_GSS_INIT = 1,
RPCSEC_GSS_CONTINUE_INIT = 2,
RPCSEC_GSS_DESTROY = 3
} rpc_gss_proc_t;
#define RPCSEC_GSS_VERSION 1
/* Credentials. */
struct rpc_gss_cred {
u_int gc_version; /* version */
rpc_gss_proc_t gc_proc; /* control procedure */
u_int gc_seq; /* sequence number */
rpc_gss_service_t gc_svc; /* service */
gss_buffer_desc gc_handle; /* handle to server-side context */
};
/* Context creation response. */
struct rpc_gss_init_res {
gss_buffer_desc gr_handle; /* handle to server-side context */
u_int gr_major; /* major status */
u_int gr_minor; /* minor status */
u_int gr_win; /* sequence window */
gss_buffer_desc gr_token; /* token */
};
/* Maximum sequence number value. */
#define MAXSEQ 0x80000000
/* Prototypes. */
__BEGIN_DECLS
bool_t xdr_gss_buffer_desc(XDR *xdrs, gss_buffer_desc *p);
bool_t xdr_rpc_gss_cred(XDR *xdrs, struct rpc_gss_cred *p);
bool_t xdr_rpc_gss_init_res(XDR *xdrs, struct rpc_gss_init_res *p);
bool_t xdr_rpc_gss_wrap_data(XDR *xdrs, xdrproc_t xdr_func,
caddr_t xdr_ptr, gss_ctx_id_t ctx, gss_qop_t qop, rpc_gss_service_t svc,
u_int seq);
bool_t xdr_rpc_gss_unwrap_data(XDR *xdrs, xdrproc_t xdr_func,
caddr_t xdr_ptr, gss_ctx_id_t ctx, gss_qop_t qop, rpc_gss_service_t svc,
u_int seq);
const char *_rpc_gss_num_to_qop(const char *mech, u_int num);
void _rpc_gss_set_error(int rpc_gss_error, int system_error);
void log_debug(const char *fmt, ...);
void log_status(const char *m, gss_OID mech, OM_uint32 major,
OM_uint32 minor);
void log_hexdump(const u_char *buf, int len, int offset);
__END_DECLS
#endif /* !_RPCSEC_GSS_INT_H */
diff --git a/lib/librpcsec_gss/rpcsec_gss_prot.c b/lib/librpcsec_gss/rpcsec_gss_prot.c
index 08a00f6bdb97..466bccd989d2 100644
--- a/lib/librpcsec_gss/rpcsec_gss_prot.c
+++ b/lib/librpcsec_gss/rpcsec_gss_prot.c
@@ -1,292 +1,291 @@
/*
SPDX-License-Identifier: BSD-3-Clause
rpcsec_gss_prot.c
Copyright (c) 2000 The Regents of the University of Michigan.
All rights reserved.
Copyright (c) 2000 Dug Song <dugsong@UMICH.EDU>.
All rights reserved, all wrongs reversed.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
$Id: authgss_prot.c,v 1.18 2000/09/01 04:14:03 dugsong Exp $
*/
-/* $FreeBSD$ */
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <rpc/rpc.h>
#include <rpc/rpcsec_gss.h>
#include "rpcsec_gss_int.h"
#define MAX_GSS_SIZE 10240 /* XXX */
bool_t
xdr_gss_buffer_desc(XDR *xdrs, gss_buffer_desc *p)
{
char *val;
u_int len;
bool_t ret;
val = p->value;
len = p->length;
ret = xdr_bytes(xdrs, &val, &len, MAX_GSS_SIZE);
p->value = val;
p->length = len;
return (ret);
}
bool_t
xdr_rpc_gss_cred(XDR *xdrs, struct rpc_gss_cred *p)
{
enum_t proc, svc;
bool_t ret;
proc = p->gc_proc;
svc = p->gc_svc;
ret = (xdr_u_int(xdrs, &p->gc_version) &&
xdr_enum(xdrs, &proc) &&
xdr_u_int(xdrs, &p->gc_seq) &&
xdr_enum(xdrs, &svc) &&
xdr_gss_buffer_desc(xdrs, &p->gc_handle));
p->gc_proc = proc;
p->gc_svc = svc;
return (ret);
}
bool_t
xdr_rpc_gss_init_res(XDR *xdrs, struct rpc_gss_init_res *p)
{
return (xdr_gss_buffer_desc(xdrs, &p->gr_handle) &&
xdr_u_int(xdrs, &p->gr_major) &&
xdr_u_int(xdrs, &p->gr_minor) &&
xdr_u_int(xdrs, &p->gr_win) &&
xdr_gss_buffer_desc(xdrs, &p->gr_token));
}
bool_t
xdr_rpc_gss_wrap_data(XDR *xdrs, xdrproc_t xdr_func, caddr_t xdr_ptr,
gss_ctx_id_t ctx, gss_qop_t qop,
rpc_gss_service_t svc, u_int seq)
{
gss_buffer_desc databuf, wrapbuf;
OM_uint32 maj_stat, min_stat;
int start, end, conf_state;
u_int len;
bool_t xdr_stat;
/* Skip databody length. */
start = XDR_GETPOS(xdrs);
XDR_SETPOS(xdrs, start + 4);
/* Marshal rpc_gss_data_t (sequence number + arguments). */
if (!xdr_u_int(xdrs, &seq) || !xdr_func(xdrs, xdr_ptr))
return (FALSE);
end = XDR_GETPOS(xdrs);
/* Set databuf to marshalled rpc_gss_data_t. */
databuf.length = end - start - 4;
XDR_SETPOS(xdrs, start + 4);
databuf.value = XDR_INLINE(xdrs, databuf.length);
xdr_stat = FALSE;
if (svc == rpc_gss_svc_integrity) {
/* Marshal databody_integ length. */
XDR_SETPOS(xdrs, start);
len = databuf.length;
if (!xdr_u_int(xdrs, &len))
return (FALSE);
/* Checksum rpc_gss_data_t. */
maj_stat = gss_get_mic(&min_stat, ctx, qop,
&databuf, &wrapbuf);
if (maj_stat != GSS_S_COMPLETE) {
log_debug("gss_get_mic failed");
return (FALSE);
}
/* Marshal checksum. */
XDR_SETPOS(xdrs, end);
xdr_stat = xdr_gss_buffer_desc(xdrs, &wrapbuf);
gss_release_buffer(&min_stat, &wrapbuf);
}
else if (svc == rpc_gss_svc_privacy) {
/* Encrypt rpc_gss_data_t. */
maj_stat = gss_wrap(&min_stat, ctx, TRUE, qop, &databuf,
&conf_state, &wrapbuf);
if (maj_stat != GSS_S_COMPLETE) {
log_status("gss_wrap", NULL, maj_stat, min_stat);
return (FALSE);
}
/* Marshal databody_priv. */
XDR_SETPOS(xdrs, start);
xdr_stat = xdr_gss_buffer_desc(xdrs, &wrapbuf);
gss_release_buffer(&min_stat, &wrapbuf);
}
return (xdr_stat);
}
bool_t
xdr_rpc_gss_unwrap_data(XDR *xdrs, xdrproc_t xdr_func, caddr_t xdr_ptr,
gss_ctx_id_t ctx, gss_qop_t qop,
rpc_gss_service_t svc, u_int seq)
{
XDR tmpxdrs;
gss_buffer_desc databuf, wrapbuf;
OM_uint32 maj_stat, min_stat;
u_int seq_num, conf_state, qop_state;
bool_t xdr_stat;
if (xdr_func == (xdrproc_t) xdr_void || xdr_ptr == NULL)
return (TRUE);
memset(&databuf, 0, sizeof(databuf));
memset(&wrapbuf, 0, sizeof(wrapbuf));
if (svc == rpc_gss_svc_integrity) {
/* Decode databody_integ. */
if (!xdr_gss_buffer_desc(xdrs, &databuf)) {
log_debug("xdr decode databody_integ failed");
return (FALSE);
}
/* Decode checksum. */
if (!xdr_gss_buffer_desc(xdrs, &wrapbuf)) {
mem_free(databuf.value, databuf.length);
log_debug("xdr decode checksum failed");
return (FALSE);
}
/* Verify checksum and QOP. */
maj_stat = gss_verify_mic(&min_stat, ctx, &databuf,
&wrapbuf, &qop_state);
mem_free(wrapbuf.value, wrapbuf.length);
if (maj_stat != GSS_S_COMPLETE || qop_state != qop) {
mem_free(databuf.value, databuf.length);
log_status("gss_verify_mic", NULL, maj_stat, min_stat);
return (FALSE);
}
} else if (svc == rpc_gss_svc_privacy) {
/* Decode databody_priv. */
if (!xdr_gss_buffer_desc(xdrs, &wrapbuf)) {
log_debug("xdr decode databody_priv failed");
return (FALSE);
}
/* Decrypt databody. */
maj_stat = gss_unwrap(&min_stat, ctx, &wrapbuf, &databuf,
&conf_state, &qop_state);
mem_free(wrapbuf.value, wrapbuf.length);
/* Verify encryption and QOP. */
if (maj_stat != GSS_S_COMPLETE || qop_state != qop ||
conf_state != TRUE) {
gss_release_buffer(&min_stat, &databuf);
log_status("gss_unwrap", NULL, maj_stat, min_stat);
return (FALSE);
}
}
/* Decode rpc_gss_data_t (sequence number + arguments). */
xdrmem_create(&tmpxdrs, databuf.value, databuf.length, XDR_DECODE);
xdr_stat = (xdr_u_int(&tmpxdrs, &seq_num) &&
xdr_func(&tmpxdrs, xdr_ptr));
XDR_DESTROY(&tmpxdrs);
/*
* Integrity service allocates databuf via XDR so free it the
* same way.
*/
if (svc == rpc_gss_svc_integrity) {
xdr_free((xdrproc_t) xdr_gss_buffer_desc, (char *) &databuf);
} else {
gss_release_buffer(&min_stat, &databuf);
}
/* Verify sequence number. */
if (xdr_stat == TRUE && seq_num != seq) {
log_debug("wrong sequence number in databody");
return (FALSE);
}
return (xdr_stat);
}
#ifdef DEBUG
#include <ctype.h>
void
log_debug(const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
fprintf(stderr, "rpcsec_gss: ");
vfprintf(stderr, fmt, ap);
fprintf(stderr, "\n");
va_end(ap);
}
void
log_status(const char *m, gss_OID mech, OM_uint32 maj_stat, OM_uint32 min_stat)
{
OM_uint32 min;
gss_buffer_desc msg;
int msg_ctx = 0;
fprintf(stderr, "rpcsec_gss: %s: ", m);
gss_display_status(&min, maj_stat, GSS_C_GSS_CODE, GSS_C_NULL_OID,
&msg_ctx, &msg);
fprintf(stderr, "%s - ", (char *)msg.value);
gss_release_buffer(&min, &msg);
gss_display_status(&min, min_stat, GSS_C_MECH_CODE, mech,
&msg_ctx, &msg);
fprintf(stderr, "%s\n", (char *)msg.value);
gss_release_buffer(&min, &msg);
}
#else
void
log_debug(__unused const char *fmt, ...)
{
}
void
log_status(__unused const char *m, __unused gss_OID mech,
__unused OM_uint32 maj_stat, __unused OM_uint32 min_stat)
{
}
#endif
diff --git a/lib/libusb/libusb.h b/lib/libusb/libusb.h
index 28542881a558..022b5562a819 100644
--- a/lib/libusb/libusb.h
+++ b/lib/libusb/libusb.h
@@ -1,616 +1,615 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Sylvestre Gallon. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef __LIBUSB_H__
#define __LIBUSB_H__
#ifndef LIBUSB_GLOBAL_INCLUDE_FILE
#include <stdint.h>
#include <sys/time.h>
#include <sys/types.h>
#endif
#define LIBUSB_API_VERSION 0x01000102
#define LIBUSB_CALL
#ifdef __cplusplus
extern "C" {
#endif
#if 0
} /* indent fix */
#endif
/* libusb enums */
enum libusb_class_code {
LIBUSB_CLASS_PER_INTERFACE = 0,
LIBUSB_CLASS_AUDIO = 1,
LIBUSB_CLASS_COMM = 2,
LIBUSB_CLASS_HID = 3,
LIBUSB_CLASS_PHYSICAL = 5,
LIBUSB_CLASS_PTP = 6,
LIBUSB_CLASS_IMAGE = 6,
LIBUSB_CLASS_PRINTER = 7,
LIBUSB_CLASS_MASS_STORAGE = 8,
LIBUSB_CLASS_HUB = 9,
LIBUSB_CLASS_DATA = 10,
LIBUSB_CLASS_SMART_CARD = 11,
LIBUSB_CLASS_CONTENT_SECURITY = 13,
LIBUSB_CLASS_VIDEO = 14,
LIBUSB_CLASS_PERSONAL_HEALTHCARE = 15,
LIBUSB_CLASS_DIAGNOSTIC_DEVICE = 0xdc,
LIBUSB_CLASS_WIRELESS = 0xe0,
LIBUSB_CLASS_APPLICATION = 0xfe,
LIBUSB_CLASS_VENDOR_SPEC = 0xff,
};
enum libusb_descriptor_type {
LIBUSB_DT_DEVICE = 0x01,
LIBUSB_DT_CONFIG = 0x02,
LIBUSB_DT_STRING = 0x03,
LIBUSB_DT_INTERFACE = 0x04,
LIBUSB_DT_ENDPOINT = 0x05,
LIBUSB_DT_HID = 0x21,
LIBUSB_DT_REPORT = 0x22,
LIBUSB_DT_PHYSICAL = 0x23,
LIBUSB_DT_HUB = 0x29,
LIBUSB_DT_BOS = 0x0f,
LIBUSB_DT_DEVICE_CAPABILITY = 0x10,
LIBUSB_DT_SS_ENDPOINT_COMPANION = 0x30,
};
enum libusb_device_capability_type {
LIBUSB_WIRELESS_USB_DEVICE_CAPABILITY = 0x1,
LIBUSB_USB_2_0_EXTENSION_DEVICE_CAPABILITY = 0x2,
LIBUSB_SS_USB_DEVICE_CAPABILITY = 0x3,
LIBUSB_CONTAINER_ID_DEVICE_CAPABILITY = 0x4,
};
#define LIBUSB_DT_DEVICE_SIZE 18
#define LIBUSB_DT_CONFIG_SIZE 9
#define LIBUSB_DT_INTERFACE_SIZE 9
#define LIBUSB_DT_ENDPOINT_SIZE 7
#define LIBUSB_DT_ENDPOINT_AUDIO_SIZE 9
#define LIBUSB_DT_HUB_NONVAR_SIZE 7
#define LIBUSB_DT_SS_ENDPOINT_COMPANION_SIZE 6
#define LIBUSB_DT_BOS_SIZE 5
#define LIBUSB_USB_2_0_EXTENSION_DEVICE_CAPABILITY_SIZE 7
#define LIBUSB_SS_USB_DEVICE_CAPABILITY_SIZE 10
#define LIBUSB_BT_USB_2_0_EXTENSION_SIZE 7
#define LIBUSB_BT_SS_USB_DEVICE_CAPABILITY_SIZE 10
#define LIBUSB_BT_CONTAINER_ID_SIZE 20
#define LIBUSB_ENDPOINT_ADDRESS_MASK 0x0f
#define LIBUSB_ENDPOINT_DIR_MASK 0x80
enum libusb_endpoint_direction {
LIBUSB_ENDPOINT_IN = 0x80,
LIBUSB_ENDPOINT_OUT = 0x00,
};
#define LIBUSB_TRANSFER_TYPE_MASK 0x03
enum libusb_transfer_type {
LIBUSB_TRANSFER_TYPE_CONTROL = 0,
LIBUSB_TRANSFER_TYPE_ISOCHRONOUS = 1,
LIBUSB_TRANSFER_TYPE_BULK = 2,
LIBUSB_TRANSFER_TYPE_INTERRUPT = 3,
};
enum libusb_standard_request {
LIBUSB_REQUEST_GET_STATUS = 0x00,
LIBUSB_REQUEST_CLEAR_FEATURE = 0x01,
LIBUSB_REQUEST_SET_FEATURE = 0x03,
LIBUSB_REQUEST_SET_ADDRESS = 0x05,
LIBUSB_REQUEST_GET_DESCRIPTOR = 0x06,
LIBUSB_REQUEST_SET_DESCRIPTOR = 0x07,
LIBUSB_REQUEST_GET_CONFIGURATION = 0x08,
LIBUSB_REQUEST_SET_CONFIGURATION = 0x09,
LIBUSB_REQUEST_GET_INTERFACE = 0x0A,
LIBUSB_REQUEST_SET_INTERFACE = 0x0B,
LIBUSB_REQUEST_SYNCH_FRAME = 0x0C,
LIBUSB_REQUEST_SET_SEL = 0x30,
LIBUSB_REQUEST_SET_ISOCH_DELAY = 0x31,
};
enum libusb_request_type {
LIBUSB_REQUEST_TYPE_STANDARD = (0x00 << 5),
LIBUSB_REQUEST_TYPE_CLASS = (0x01 << 5),
LIBUSB_REQUEST_TYPE_VENDOR = (0x02 << 5),
LIBUSB_REQUEST_TYPE_RESERVED = (0x03 << 5),
};
enum libusb_request_recipient {
LIBUSB_RECIPIENT_DEVICE = 0x00,
LIBUSB_RECIPIENT_INTERFACE = 0x01,
LIBUSB_RECIPIENT_ENDPOINT = 0x02,
LIBUSB_RECIPIENT_OTHER = 0x03,
};
#define LIBUSB_ISO_SYNC_TYPE_MASK 0x0C
enum libusb_iso_sync_type {
LIBUSB_ISO_SYNC_TYPE_NONE = 0,
LIBUSB_ISO_SYNC_TYPE_ASYNC = 1,
LIBUSB_ISO_SYNC_TYPE_ADAPTIVE = 2,
LIBUSB_ISO_SYNC_TYPE_SYNC = 3,
};
#define LIBUSB_ISO_USAGE_TYPE_MASK 0x30
enum libusb_iso_usage_type {
LIBUSB_ISO_USAGE_TYPE_DATA = 0,
LIBUSB_ISO_USAGE_TYPE_FEEDBACK = 1,
LIBUSB_ISO_USAGE_TYPE_IMPLICIT = 2,
};
enum libusb_bos_type {
LIBUSB_BT_WIRELESS_USB_DEVICE_CAPABILITY = 1,
LIBUSB_BT_USB_2_0_EXTENSION = 2,
LIBUSB_BT_SS_USB_DEVICE_CAPABILITY = 3,
LIBUSB_BT_CONTAINER_ID = 4,
};
enum libusb_capability {
/* libusb supports libusb_has_capability(). */
LIBUSB_CAP_HAS_CAPABILITY = 0,
/* Hotplug support is available. */
LIBUSB_CAP_HAS_HOTPLUG,
/* Can access HID devices without requiring user intervention. */
LIBUSB_CAP_HAS_HID_ACCESS,
/*
* Supports detaching of the default USB driver with
* libusb_detach_kernel_driver().
*/
LIBUSB_CAP_SUPPORTS_DETACH_KERNEL_DRIVER,
};
enum libusb_error {
LIBUSB_SUCCESS = 0,
LIBUSB_ERROR_IO = -1,
LIBUSB_ERROR_INVALID_PARAM = -2,
LIBUSB_ERROR_ACCESS = -3,
LIBUSB_ERROR_NO_DEVICE = -4,
LIBUSB_ERROR_NOT_FOUND = -5,
LIBUSB_ERROR_BUSY = -6,
LIBUSB_ERROR_TIMEOUT = -7,
LIBUSB_ERROR_OVERFLOW = -8,
LIBUSB_ERROR_PIPE = -9,
LIBUSB_ERROR_INTERRUPTED = -10,
LIBUSB_ERROR_NO_MEM = -11,
LIBUSB_ERROR_NOT_SUPPORTED = -12,
LIBUSB_ERROR_OTHER = -99,
};
enum libusb_speed {
LIBUSB_SPEED_UNKNOWN = 0,
LIBUSB_SPEED_LOW = 1,
LIBUSB_SPEED_FULL = 2,
LIBUSB_SPEED_HIGH = 3,
LIBUSB_SPEED_SUPER = 4,
};
enum libusb_transfer_status {
LIBUSB_TRANSFER_COMPLETED,
LIBUSB_TRANSFER_ERROR,
LIBUSB_TRANSFER_TIMED_OUT,
LIBUSB_TRANSFER_CANCELLED,
LIBUSB_TRANSFER_STALL,
LIBUSB_TRANSFER_NO_DEVICE,
LIBUSB_TRANSFER_OVERFLOW,
};
enum libusb_transfer_flags {
LIBUSB_TRANSFER_SHORT_NOT_OK = 1 << 0,
LIBUSB_TRANSFER_FREE_BUFFER = 1 << 1,
LIBUSB_TRANSFER_FREE_TRANSFER = 1 << 2,
};
enum libusb_log_level {
LIBUSB_LOG_LEVEL_NONE = 0,
LIBUSB_LOG_LEVEL_ERROR,
LIBUSB_LOG_LEVEL_WARNING,
LIBUSB_LOG_LEVEL_INFO,
LIBUSB_LOG_LEVEL_DEBUG
};
/* XXX */
/* libusb_set_debug should take parameters from libusb_log_level
* above according to
* http://libusb.sourceforge.net/api-1.0/group__lib.html
*/
enum libusb_debug_level {
LIBUSB_DEBUG_NO=0,
LIBUSB_DEBUG_FUNCTION=1,
LIBUSB_DEBUG_TRANSFER=2,
};
#define LIBUSB_HOTPLUG_MATCH_ANY -1
typedef enum {
LIBUSB_HOTPLUG_NO_FLAGS = 0,
LIBUSB_HOTPLUG_ENUMERATE = 1 << 0,
} libusb_hotplug_flag;
typedef enum {
LIBUSB_HOTPLUG_EVENT_DEVICE_ARRIVED = 1,
LIBUSB_HOTPLUG_EVENT_DEVICE_LEFT = 2,
} libusb_hotplug_event;
enum libusb_option {
LIBUSB_OPTION_LOG_LEVEL = 0,
LIBUSB_OPTION_USE_USBDK = 1,
LIBUSB_OPTION_NO_DEVICE_DISCOVERY = 2,
LIBUSB_OPTION_WEAK_AUTHORITY = 2,
LIBUSB_OPTION_MAX = 3,
};
/* libusb structures */
struct libusb_context;
struct libusb_device;
struct libusb_transfer;
struct libusb_device_handle;
struct libusb_hotplug_callback_handle_struct;
struct libusb_pollfd {
int fd;
short events;
};
struct libusb_version {
const uint16_t major;
const uint16_t minor;
const uint16_t micro;
const uint16_t nano;
const char *rc;
const char *describe;
};
struct libusb_init_option {
enum libusb_option option;
union {
int64_t ival;
} value;
};
typedef struct libusb_context libusb_context;
typedef struct libusb_device libusb_device;
typedef struct libusb_device_handle libusb_device_handle;
typedef struct libusb_pollfd libusb_pollfd;
typedef void (*libusb_pollfd_added_cb) (int fd, short events, void *user_data);
typedef void (*libusb_pollfd_removed_cb) (int fd, void *user_data);
typedef struct libusb_hotplug_callback_handle_struct *libusb_hotplug_callback_handle;
typedef struct libusb_device_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t bcdUSB;
uint8_t bDeviceClass;
uint8_t bDeviceSubClass;
uint8_t bDeviceProtocol;
uint8_t bMaxPacketSize0;
uint16_t idVendor;
uint16_t idProduct;
uint16_t bcdDevice;
uint8_t iManufacturer;
uint8_t iProduct;
uint8_t iSerialNumber;
uint8_t bNumConfigurations;
} libusb_device_descriptor;
typedef struct libusb_endpoint_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bEndpointAddress;
uint8_t bmAttributes;
uint16_t wMaxPacketSize;
uint8_t bInterval;
uint8_t bRefresh;
uint8_t bSynchAddress;
uint8_t *extra;
int extra_length;
} libusb_endpoint_descriptor __aligned(sizeof(void *));
typedef struct libusb_ss_endpoint_companion_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bMaxBurst;
uint8_t bmAttributes;
uint16_t wBytesPerInterval;
} libusb_ss_endpoint_companion_descriptor __aligned(sizeof(void *));
typedef struct libusb_interface_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bInterfaceNumber;
uint8_t bAlternateSetting;
uint8_t bNumEndpoints;
uint8_t bInterfaceClass;
uint8_t bInterfaceSubClass;
uint8_t bInterfaceProtocol;
uint8_t iInterface;
struct libusb_endpoint_descriptor *endpoint;
uint8_t *extra;
int extra_length;
} libusb_interface_descriptor __aligned(sizeof(void *));
typedef struct libusb_interface {
struct libusb_interface_descriptor *altsetting;
int num_altsetting;
} libusb_interface __aligned(sizeof(void *));
typedef struct libusb_config_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t wTotalLength;
uint8_t bNumInterfaces;
uint8_t bConfigurationValue;
uint8_t iConfiguration;
uint8_t bmAttributes;
uint8_t MaxPower;
struct libusb_interface *interface;
uint8_t *extra;
int extra_length;
} libusb_config_descriptor __aligned(sizeof(void *));
typedef struct libusb_usb_2_0_device_capability_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bDevCapabilityType;
uint32_t bmAttributes;
#define LIBUSB_USB_2_0_CAPABILITY_LPM_SUPPORT (1 << 1)
} libusb_usb_2_0_device_capability_descriptor __aligned(sizeof(void *));
typedef struct libusb_ss_usb_device_capability_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bDevCapabilityType;
uint8_t bmAttributes;
#define LIBUSB_SS_USB_CAPABILITY_LPM_SUPPORT (1 << 1)
uint16_t wSpeedSupported;
#define LIBUSB_CAPABILITY_LOW_SPEED_OPERATION (1)
#define LIBUSB_CAPABILITY_FULL_SPEED_OPERATION (1 << 1)
#define LIBUSB_CAPABILITY_HIGH_SPEED_OPERATION (1 << 2)
#define LIBUSB_CAPABILITY_5GBPS_OPERATION (1 << 3)
uint8_t bFunctionalitySupport;
uint8_t bU1DevExitLat;
uint16_t wU2DevExitLat;
} libusb_ss_usb_device_capability_descriptor __aligned(sizeof(void *));
typedef struct libusb_bos_dev_capability_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bDevCapabilityType;
uint8_t dev_capability_data[0];
} libusb_bos_dev_capability_descriptor __aligned(sizeof(void *));
typedef struct libusb_bos_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t wTotalLength;
uint8_t bNumDeviceCapabilities;
struct libusb_usb_2_0_device_capability_descriptor *usb_2_0_ext_cap;
struct libusb_ss_usb_device_capability_descriptor *ss_usb_cap;
struct libusb_bos_dev_capability_descriptor **dev_capability;
} libusb_bos_descriptor __aligned(sizeof(void *));
typedef struct libusb_usb_2_0_extension_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bDevCapabilityType;
uint32_t bmAttributes;
} libusb_usb_2_0_extension_descriptor __aligned(sizeof(void *));
typedef struct libusb_container_id_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bDevCapabilityType;
uint8_t bReserved;
uint8_t ContainerID[16];
} libusb_container_id_descriptor __aligned(sizeof(void *));
typedef struct libusb_control_setup {
uint8_t bmRequestType;
uint8_t bRequest;
uint16_t wValue;
uint16_t wIndex;
uint16_t wLength;
} libusb_control_setup;
#define LIBUSB_CONTROL_SETUP_SIZE 8 /* bytes */
typedef struct libusb_iso_packet_descriptor {
uint32_t length;
uint32_t actual_length;
enum libusb_transfer_status status;
} libusb_iso_packet_descriptor __aligned(sizeof(void *));
typedef void (*libusb_transfer_cb_fn) (struct libusb_transfer *transfer);
typedef struct libusb_transfer {
libusb_device_handle *dev_handle;
uint8_t flags;
uint8_t endpoint;
uint8_t type;
uint32_t timeout;
enum libusb_transfer_status status;
int length;
int actual_length;
libusb_transfer_cb_fn callback;
void *user_data;
uint8_t *buffer;
int num_iso_packets;
struct libusb_iso_packet_descriptor iso_packet_desc[0];
} libusb_transfer __aligned(sizeof(void *));
/* Library initialisation */
void libusb_set_debug(libusb_context * ctx, int level);
const struct libusb_version *libusb_get_version(void);
const char *libusb_strerror(int code);
const char *libusb_error_name(int code);
int libusb_init(libusb_context ** context);
int libusb_init_context(libusb_context **, const struct libusb_init_option [], int num_options);
void libusb_exit(struct libusb_context *ctx);
int libusb_has_capability(uint32_t capability);
/* Device handling and enumeration */
ssize_t libusb_get_device_list(libusb_context * ctx, libusb_device *** list);
void libusb_free_device_list(libusb_device ** list, int unref_devices);
uint8_t libusb_get_bus_number(libusb_device * dev);
uint8_t libusb_get_port_number(libusb_device * dev);
int libusb_get_port_numbers(libusb_device *dev, uint8_t *buf, uint8_t bufsize);
int libusb_get_port_path(libusb_context *ctx, libusb_device *dev, uint8_t *buf, uint8_t bufsize);
uint8_t libusb_get_device_address(libusb_device * dev);
enum libusb_speed libusb_get_device_speed(libusb_device * dev);
int libusb_clear_halt(libusb_device_handle *devh, uint8_t endpoint);
int libusb_get_max_packet_size(libusb_device * dev, uint8_t endpoint);
int libusb_get_max_iso_packet_size(libusb_device * dev, uint8_t endpoint);
libusb_device *libusb_ref_device(libusb_device * dev);
void libusb_unref_device(libusb_device * dev);
int libusb_open(libusb_device * dev, libusb_device_handle ** devh);
libusb_device_handle *libusb_open_device_with_vid_pid(libusb_context * ctx, uint16_t vendor_id, uint16_t product_id);
void libusb_close(libusb_device_handle * devh);
libusb_device *libusb_get_device(libusb_device_handle * devh);
int libusb_get_configuration(libusb_device_handle * devh, int *config);
int libusb_set_configuration(libusb_device_handle * devh, int configuration);
int libusb_claim_interface(libusb_device_handle * devh, int interface_number);
int libusb_release_interface(libusb_device_handle * devh, int interface_number);
int libusb_reset_device(libusb_device_handle * devh);
int libusb_check_connected(libusb_device_handle * devh);
int libusb_kernel_driver_active(libusb_device_handle * devh, int interface);
int libusb_get_driver_np(libusb_device_handle * devh, int interface, char *name, int namelen);
int libusb_get_driver(libusb_device_handle * devh, int interface, char *name, int namelen);
int libusb_detach_kernel_driver_np(libusb_device_handle * devh, int interface);
int libusb_detach_kernel_driver(libusb_device_handle * devh, int interface);
int libusb_attach_kernel_driver(libusb_device_handle * devh, int interface);
int libusb_set_auto_detach_kernel_driver(libusb_device_handle *dev, int enable);
int libusb_set_interface_alt_setting(libusb_device_handle * devh, int interface_number, int alternate_setting);
/* USB Descriptors */
int libusb_get_device_descriptor(libusb_device * dev, struct libusb_device_descriptor *desc);
int libusb_get_active_config_descriptor(libusb_device * dev, struct libusb_config_descriptor **config);
int libusb_get_config_descriptor(libusb_device * dev, uint8_t config_index, struct libusb_config_descriptor **config);
int libusb_get_config_descriptor_by_value(libusb_device * dev, uint8_t bConfigurationValue, struct libusb_config_descriptor **config);
void libusb_free_config_descriptor(struct libusb_config_descriptor *config);
int libusb_get_ss_endpoint_companion_descriptor(struct libusb_context *ctx, const struct libusb_endpoint_descriptor *endpoint, struct libusb_ss_endpoint_companion_descriptor **ep_comp);
void libusb_free_ss_endpoint_companion_descriptor(struct libusb_ss_endpoint_companion_descriptor *ep_comp);
int libusb_get_string_descriptor(libusb_device_handle * devh, uint8_t desc_index, uint16_t langid, unsigned char *data, int length);
int libusb_get_string_descriptor_ascii(libusb_device_handle * devh, uint8_t desc_index, uint8_t *data, int length);
int libusb_get_descriptor(libusb_device_handle * devh, uint8_t desc_type, uint8_t desc_index, uint8_t *data, int length);
int libusb_parse_ss_endpoint_comp(const void *buf, int len, struct libusb_ss_endpoint_companion_descriptor **ep_comp);
void libusb_free_ss_endpoint_comp(struct libusb_ss_endpoint_companion_descriptor *ep_comp);
int libusb_parse_bos_descriptor(const void *buf, int len, struct libusb_bos_descriptor **bos);
void libusb_free_bos_descriptor(struct libusb_bos_descriptor *bos);
int libusb_get_bos_descriptor(libusb_device_handle *handle, struct libusb_bos_descriptor **bos);
int libusb_get_usb_2_0_extension_descriptor(struct libusb_context *ctx, struct libusb_bos_dev_capability_descriptor *dev_cap, struct libusb_usb_2_0_extension_descriptor **usb_2_0_extension);
void libusb_free_usb_2_0_extension_descriptor(struct libusb_usb_2_0_extension_descriptor *usb_2_0_extension);
int libusb_get_ss_usb_device_capability_descriptor(struct libusb_context *ctx, struct libusb_bos_dev_capability_descriptor *dev_cap, struct libusb_ss_usb_device_capability_descriptor **ss_usb_device_capability);
void libusb_free_ss_usb_device_capability_descriptor(struct libusb_ss_usb_device_capability_descriptor *ss_usb_device_capability);
int libusb_get_container_id_descriptor(struct libusb_context *ctx, struct libusb_bos_dev_capability_descriptor *dev_cap, struct libusb_container_id_descriptor **container_id);
void libusb_free_container_id_descriptor(struct libusb_container_id_descriptor *container_id);
/* Asynchronous device I/O */
struct libusb_transfer *libusb_alloc_transfer(int iso_packets);
void libusb_free_transfer(struct libusb_transfer *transfer);
int libusb_submit_transfer(struct libusb_transfer *transfer);
int libusb_cancel_transfer(struct libusb_transfer *transfer);
uint8_t *libusb_get_iso_packet_buffer(struct libusb_transfer *transfer, uint32_t index);
uint8_t *libusb_get_iso_packet_buffer_simple(struct libusb_transfer *transfer, uint32_t index);
void libusb_set_iso_packet_lengths(struct libusb_transfer *transfer, uint32_t length);
uint8_t *libusb_control_transfer_get_data(struct libusb_transfer *transfer);
struct libusb_control_setup *libusb_control_transfer_get_setup(struct libusb_transfer *transfer);
void libusb_fill_control_setup(uint8_t *buf, uint8_t bmRequestType, uint8_t bRequest, uint16_t wValue, uint16_t wIndex, uint16_t wLength);
void libusb_fill_control_transfer(struct libusb_transfer *transfer, libusb_device_handle *devh, uint8_t *buf, libusb_transfer_cb_fn callback, void *user_data, uint32_t timeout);
void libusb_fill_bulk_transfer(struct libusb_transfer *transfer, libusb_device_handle *devh, uint8_t endpoint, uint8_t *buf, int length, libusb_transfer_cb_fn callback, void *user_data, uint32_t timeout);
void libusb_fill_interrupt_transfer(struct libusb_transfer *transfer, libusb_device_handle *devh, uint8_t endpoint, uint8_t *buf, int length, libusb_transfer_cb_fn callback, void *user_data, uint32_t timeout);
void libusb_fill_iso_transfer(struct libusb_transfer *transfer, libusb_device_handle *devh, uint8_t endpoint, uint8_t *buf, int length, int npacket, libusb_transfer_cb_fn callback, void *user_data, uint32_t timeout);
/* Polling and timing */
int libusb_try_lock_events(libusb_context * ctx);
void libusb_lock_events(libusb_context * ctx);
void libusb_unlock_events(libusb_context * ctx);
int libusb_event_handling_ok(libusb_context * ctx);
int libusb_event_handler_active(libusb_context * ctx);
void libusb_interrupt_event_handler(libusb_context *ctx);
void libusb_lock_event_waiters(libusb_context * ctx);
void libusb_unlock_event_waiters(libusb_context * ctx);
int libusb_wait_for_event(libusb_context * ctx, struct timeval *tv);
int libusb_handle_events_timeout_completed(libusb_context * ctx, struct timeval *tv, int *completed);
int libusb_handle_events_completed(libusb_context * ctx, int *completed);
int libusb_handle_events_timeout(libusb_context * ctx, struct timeval *tv);
int libusb_handle_events(libusb_context * ctx);
int libusb_handle_events_locked(libusb_context * ctx, struct timeval *tv);
int libusb_get_next_timeout(libusb_context * ctx, struct timeval *tv);
void libusb_set_pollfd_notifiers(libusb_context * ctx, libusb_pollfd_added_cb added_cb, libusb_pollfd_removed_cb removed_cb, void *user_data);
const struct libusb_pollfd **libusb_get_pollfds(libusb_context * ctx);
/* Synchronous device I/O */
int libusb_control_transfer(libusb_device_handle * devh, uint8_t bmRequestType, uint8_t bRequest, uint16_t wValue, uint16_t wIndex, uint8_t *data, uint16_t wLength, uint32_t timeout);
int libusb_bulk_transfer(libusb_device_handle * devh, uint8_t endpoint, uint8_t *data, int length, int *transferred, uint32_t timeout);
int libusb_interrupt_transfer(libusb_device_handle * devh, uint8_t endpoint, uint8_t *data, int length, int *transferred, uint32_t timeout);
/* Byte-order */
uint16_t libusb_cpu_to_le16(uint16_t x);
uint16_t libusb_le16_to_cpu(uint16_t x);
/* Hotplug support */
typedef int (*libusb_hotplug_callback_fn)(libusb_context *ctx,
libusb_device *device, libusb_hotplug_event event, void *user_data);
int libusb_hotplug_register_callback(libusb_context *ctx, libusb_hotplug_event events, libusb_hotplug_flag flags, int vendor_id, int product_id, int dev_class, libusb_hotplug_callback_fn cb_fn, void *user_data, libusb_hotplug_callback_handle *handle);
void libusb_hotplug_deregister_callback(libusb_context *ctx, libusb_hotplug_callback_handle handle);
/* Streams support */
int libusb_alloc_streams(libusb_device_handle *dev, uint32_t num_streams, unsigned char *endpoints, int num_endpoints);
int libusb_free_streams(libusb_device_handle *dev, unsigned char *endpoints, int num_endpoints);
void libusb_transfer_set_stream_id(struct libusb_transfer *transfer, uint32_t stream_id);
uint32_t libusb_transfer_get_stream_id(struct libusb_transfer *transfer);
#if 0
{ /* indent fix */
#endif
#ifdef __cplusplus
}
#endif
#endif /* __LIBUSB_H__ */
diff --git a/lib/libusb/libusb01.c b/lib/libusb/libusb01.c
index 46370b7250ae..7017016693af 100644
--- a/lib/libusb/libusb01.c
+++ b/lib/libusb/libusb01.c
@@ -1,1024 +1,1023 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* This file contains the emulation layer for LibUSB v0.1 from sourceforge.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <sys/queue.h>
#endif
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
#include "usb.h"
/*
* The two following macros were taken from the original LibUSB v0.1
* for sake of compatibility:
*/
#define LIST_ADD(begin, ent) \
do { \
if (begin) { \
ent->next = begin; \
ent->next->prev = ent; \
} else { \
ent->next = NULL; \
} \
ent->prev = NULL; \
begin = ent; \
} while(0)
#define LIST_DEL(begin, ent) \
do { \
if (ent->prev) { \
ent->prev->next = ent->next; \
} else { \
begin = ent->next; \
} \
if (ent->next) { \
ent->next->prev = ent->prev; \
} \
ent->prev = NULL; \
ent->next = NULL; \
} while (0)
struct usb_bus *usb_busses = NULL;
static struct usb_bus usb_global_bus = {
.dirname = {"/dev/usb"},
.root_dev = NULL,
.devices = NULL,
};
static struct libusb20_backend *usb_backend = NULL;
struct usb_parse_state {
struct {
struct libusb20_endpoint *currep;
struct libusb20_interface *currifc;
struct libusb20_config *currcfg;
struct libusb20_me_struct *currextra;
} a;
struct {
struct usb_config_descriptor *currcfg;
struct usb_interface_descriptor *currifc;
struct usb_endpoint_descriptor *currep;
struct usb_interface *currifcw;
uint8_t *currextra;
} b;
uint8_t preparse;
};
static struct libusb20_transfer *
usb_get_transfer_by_ep_no(usb_dev_handle * dev, uint8_t ep_no)
{
struct libusb20_device *pdev = (void *)dev;
struct libusb20_transfer *xfer;
int err;
uint32_t bufsize;
uint8_t x;
uint8_t speed;
x = (ep_no & LIBUSB20_ENDPOINT_ADDRESS_MASK) * 2;
if (ep_no & LIBUSB20_ENDPOINT_DIR_MASK) {
/* this is an IN endpoint */
x |= 1;
}
speed = libusb20_dev_get_speed(pdev);
/* select a sensible buffer size */
if (speed == LIBUSB20_SPEED_LOW) {
bufsize = 256;
} else if (speed == LIBUSB20_SPEED_FULL) {
bufsize = 4096;
} else if (speed == LIBUSB20_SPEED_SUPER) {
bufsize = 65536;
} else {
bufsize = 16384;
}
xfer = libusb20_tr_get_pointer(pdev, x);
if (xfer == NULL)
return (xfer);
err = libusb20_tr_open(xfer, bufsize, 1, ep_no);
if (err == LIBUSB20_ERROR_BUSY) {
/* already opened */
return (xfer);
} else if (err) {
return (NULL);
}
/* success */
return (xfer);
}
usb_dev_handle *
usb_open(struct usb_device *dev)
{
int err;
err = libusb20_dev_open(dev->dev, 16 * 2);
if (err == LIBUSB20_ERROR_BUSY) {
/*
* Workaround buggy USB applications which open the USB
* device multiple times:
*/
return (dev->dev);
}
if (err)
return (NULL);
/*
* Dequeue USB device from backend queue so that it does not get
* freed when the backend is re-scanned:
*/
libusb20_be_dequeue_device(usb_backend, dev->dev);
return (dev->dev);
}
int
usb_close(usb_dev_handle * udev)
{
struct usb_device *dev;
int err;
err = libusb20_dev_close((void *)udev);
if (err)
return (-1);
if (usb_backend != NULL) {
/*
* Enqueue USB device to backend queue so that it gets freed
* when the backend is re-scanned:
*/
libusb20_be_enqueue_device(usb_backend, (void *)udev);
} else {
/*
* The backend is gone. Free device data so that we
* don't start leaking memory!
*/
dev = usb_device(udev);
libusb20_dev_free((void *)udev);
LIST_DEL(usb_global_bus.devices, dev);
free(dev);
}
return (0);
}
int
usb_get_string(usb_dev_handle * dev, int strindex,
int langid, char *buf, size_t buflen)
{
int err;
if (dev == NULL)
return (-1);
if (buflen > 65535)
buflen = 65535;
err = libusb20_dev_req_string_sync((void *)dev,
strindex, langid, buf, buflen);
if (err)
return (-1);
return (0);
}
int
usb_get_string_simple(usb_dev_handle * dev, int strindex,
char *buf, size_t buflen)
{
int err;
if (dev == NULL)
return (-1);
if (buflen > 65535)
buflen = 65535;
err = libusb20_dev_req_string_simple_sync((void *)dev,
strindex, buf, buflen);
if (err)
return (-1);
return (strlen(buf));
}
int
usb_get_descriptor_by_endpoint(usb_dev_handle * udev, int ep, uint8_t type,
uint8_t ep_index, void *buf, int size)
{
memset(buf, 0, size);
if (udev == NULL)
return (-1);
if (size > 65535)
size = 65535;
return (usb_control_msg(udev, ep | USB_ENDPOINT_IN,
USB_REQ_GET_DESCRIPTOR, (type << 8) + ep_index, 0,
buf, size, 1000));
}
int
usb_get_descriptor(usb_dev_handle * udev, uint8_t type, uint8_t desc_index,
void *buf, int size)
{
memset(buf, 0, size);
if (udev == NULL)
return (-1);
if (size > 65535)
size = 65535;
return (usb_control_msg(udev, USB_ENDPOINT_IN, USB_REQ_GET_DESCRIPTOR,
(type << 8) + desc_index, 0, buf, size, 1000));
}
int
usb_parse_descriptor(uint8_t *source, char *description, void *dest)
{
uint8_t *sp = source;
uint8_t *dp = dest;
uint16_t w;
uint32_t d;
char *cp;
for (cp = description; *cp; cp++) {
switch (*cp) {
case 'b': /* 8-bit byte */
*dp++ = *sp++;
break;
/*
* 16-bit word, convert from little endian to CPU
*/
case 'w':
w = (sp[1] << 8) | sp[0];
sp += 2;
/* Align to word boundary */
dp += ((dp - (uint8_t *)0) & 1);
*((uint16_t *)dp) = w;
dp += 2;
break;
/*
* 32-bit dword, convert from little endian to CPU
*/
case 'd':
d = (sp[3] << 24) | (sp[2] << 16) |
(sp[1] << 8) | sp[0];
sp += 4;
/* Align to word boundary */
dp += ((dp - (uint8_t *)0) & 1);
/* Align to double word boundary */
dp += ((dp - (uint8_t *)0) & 2);
*((uint32_t *)dp) = d;
dp += 4;
break;
}
}
return (sp - source);
}
static void
usb_parse_extra(struct usb_parse_state *ps, uint8_t **pptr, int *plen)
{
void *ptr;
uint16_t len;
ptr = ps->a.currextra->ptr;
len = ps->a.currextra->len;
if (ps->preparse == 0) {
memcpy(ps->b.currextra, ptr, len);
*pptr = ps->b.currextra;
*plen = len;
}
ps->b.currextra += len;
return;
}
static void
usb_parse_endpoint(struct usb_parse_state *ps)
{
struct usb_endpoint_descriptor *bep;
struct libusb20_endpoint *aep;
aep = ps->a.currep;
bep = ps->b.currep++;
if (ps->preparse == 0) {
/* copy descriptor fields */
bep->bLength = aep->desc.bLength;
bep->bDescriptorType = aep->desc.bDescriptorType;
bep->bEndpointAddress = aep->desc.bEndpointAddress;
bep->bmAttributes = aep->desc.bmAttributes;
bep->wMaxPacketSize = aep->desc.wMaxPacketSize;
bep->bInterval = aep->desc.bInterval;
bep->bRefresh = aep->desc.bRefresh;
bep->bSynchAddress = aep->desc.bSynchAddress;
}
ps->a.currextra = &aep->extra;
usb_parse_extra(ps, &bep->extra, &bep->extralen);
return;
}
static void
usb_parse_iface_sub(struct usb_parse_state *ps)
{
struct libusb20_interface *aifc;
struct usb_interface_descriptor *bifc;
uint8_t x;
aifc = ps->a.currifc;
bifc = ps->b.currifc++;
if (ps->preparse == 0) {
/* copy descriptor fields */
bifc->bLength = aifc->desc.bLength;
bifc->bDescriptorType = aifc->desc.bDescriptorType;
bifc->bInterfaceNumber = aifc->desc.bInterfaceNumber;
bifc->bAlternateSetting = aifc->desc.bAlternateSetting;
bifc->bNumEndpoints = aifc->num_endpoints;
bifc->bInterfaceClass = aifc->desc.bInterfaceClass;
bifc->bInterfaceSubClass = aifc->desc.bInterfaceSubClass;
bifc->bInterfaceProtocol = aifc->desc.bInterfaceProtocol;
bifc->iInterface = aifc->desc.iInterface;
bifc->endpoint = ps->b.currep;
}
for (x = 0; x != aifc->num_endpoints; x++) {
ps->a.currep = aifc->endpoints + x;
usb_parse_endpoint(ps);
}
ps->a.currextra = &aifc->extra;
usb_parse_extra(ps, &bifc->extra, &bifc->extralen);
return;
}
static void
usb_parse_iface(struct usb_parse_state *ps)
{
struct libusb20_interface *aifc;
struct usb_interface *bifc;
uint8_t x;
aifc = ps->a.currifc;
bifc = ps->b.currifcw++;
if (ps->preparse == 0) {
/* initialise interface wrapper */
bifc->altsetting = ps->b.currifc;
bifc->num_altsetting = aifc->num_altsetting + 1;
}
usb_parse_iface_sub(ps);
for (x = 0; x != aifc->num_altsetting; x++) {
ps->a.currifc = aifc->altsetting + x;
usb_parse_iface_sub(ps);
}
return;
}
static void
usb_parse_config(struct usb_parse_state *ps)
{
struct libusb20_config *acfg;
struct usb_config_descriptor *bcfg;
uint8_t x;
acfg = ps->a.currcfg;
bcfg = ps->b.currcfg;
if (ps->preparse == 0) {
/* initialise config wrapper */
bcfg->bLength = acfg->desc.bLength;
bcfg->bDescriptorType = acfg->desc.bDescriptorType;
bcfg->wTotalLength = acfg->desc.wTotalLength;
bcfg->bNumInterfaces = acfg->num_interface;
bcfg->bConfigurationValue = acfg->desc.bConfigurationValue;
bcfg->iConfiguration = acfg->desc.iConfiguration;
bcfg->bmAttributes = acfg->desc.bmAttributes;
bcfg->MaxPower = acfg->desc.bMaxPower;
bcfg->interface = ps->b.currifcw;
}
for (x = 0; x != acfg->num_interface; x++) {
ps->a.currifc = acfg->interface + x;
usb_parse_iface(ps);
}
ps->a.currextra = &acfg->extra;
usb_parse_extra(ps, &bcfg->extra, &bcfg->extralen);
return;
}
int
usb_parse_configuration(struct usb_config_descriptor *config,
uint8_t *buffer)
{
struct usb_parse_state ps;
uint8_t *ptr;
uint32_t a;
uint32_t b;
uint32_t c;
uint32_t d;
if ((buffer == NULL) || (config == NULL)) {
return (-1);
}
memset(&ps, 0, sizeof(ps));
ps.a.currcfg = libusb20_parse_config_desc(buffer);
ps.b.currcfg = config;
if (ps.a.currcfg == NULL) {
/* could not parse config or out of memory */
return (-1);
}
/* do the pre-parse */
ps.preparse = 1;
usb_parse_config(&ps);
a = ((uint8_t *)(ps.b.currifcw) - ((uint8_t *)0));
b = ((uint8_t *)(ps.b.currifc) - ((uint8_t *)0));
c = ((uint8_t *)(ps.b.currep) - ((uint8_t *)0));
d = ((uint8_t *)(ps.b.currextra) - ((uint8_t *)0));
/* allocate memory for our configuration */
ptr = malloc(a + b + c + d);
if (ptr == NULL) {
/* free config structure */
free(ps.a.currcfg);
return (-1);
}
/* "currifcw" must be first, hence this pointer is freed */
ps.b.currifcw = (void *)(ptr);
ps.b.currifc = (void *)(ptr + a);
ps.b.currep = (void *)(ptr + a + b);
ps.b.currextra = (void *)(ptr + a + b + c);
/* generate a libusb v0.1 compatible structure */
ps.preparse = 0;
usb_parse_config(&ps);
/* free config structure */
free(ps.a.currcfg);
return (0); /* success */
}
void
usb_destroy_configuration(struct usb_device *dev)
{
uint8_t c;
if (dev->config == NULL) {
return;
}
for (c = 0; c != dev->descriptor.bNumConfigurations; c++) {
struct usb_config_descriptor *cf = &dev->config[c];
if (cf->interface != NULL) {
free(cf->interface);
cf->interface = NULL;
}
}
free(dev->config);
dev->config = NULL;
return;
}
void
usb_fetch_and_parse_descriptors(usb_dev_handle * udev)
{
struct usb_device *dev;
struct libusb20_device *pdev;
uint8_t *ptr;
int error;
uint32_t size;
uint16_t len;
uint8_t x;
if (udev == NULL) {
/* be NULL safe */
return;
}
dev = usb_device(udev);
pdev = (void *)udev;
if (dev->descriptor.bNumConfigurations == 0) {
/* invalid device */
return;
}
size = dev->descriptor.bNumConfigurations *
sizeof(struct usb_config_descriptor);
dev->config = malloc(size);
if (dev->config == NULL) {
/* out of memory */
return;
}
memset(dev->config, 0, size);
for (x = 0; x != dev->descriptor.bNumConfigurations; x++) {
error = (pdev->methods->get_config_desc_full) (
pdev, &ptr, &len, x);
if (error) {
usb_destroy_configuration(dev);
return;
}
usb_parse_configuration(dev->config + x, ptr);
/* free config buffer */
free(ptr);
}
return;
}
static int
usb_std_io(usb_dev_handle * dev, int ep, char *bytes, int size,
int timeout, int is_intr)
{
struct libusb20_transfer *xfer;
uint32_t temp;
uint32_t maxsize;
uint32_t actlen;
char *oldbytes;
xfer = usb_get_transfer_by_ep_no(dev, ep);
if (xfer == NULL)
return (-1);
if (libusb20_tr_pending(xfer)) {
/* there is already a transfer ongoing */
return (-1);
}
maxsize = libusb20_tr_get_max_total_length(xfer);
oldbytes = bytes;
/*
* We allow transferring zero bytes which is the same
* equivalent to a zero length USB packet.
*/
do {
temp = size;
if (temp > maxsize) {
/* find maximum possible length */
temp = maxsize;
}
if (is_intr)
libusb20_tr_setup_intr(xfer, bytes, temp, timeout);
else
libusb20_tr_setup_bulk(xfer, bytes, temp, timeout);
libusb20_tr_start(xfer);
while (1) {
if (libusb20_dev_process((void *)dev) != 0) {
/* device detached */
return (-1);
}
if (libusb20_tr_pending(xfer) == 0) {
/* transfer complete */
break;
}
/* wait for USB event from kernel */
libusb20_dev_wait_process((void *)dev, -1);
}
switch (libusb20_tr_get_status(xfer)) {
case 0:
/* success */
break;
case LIBUSB20_TRANSFER_TIMED_OUT:
/* transfer timeout */
return (-ETIMEDOUT);
default:
/* other transfer error */
return (-ENXIO);
}
actlen = libusb20_tr_get_actual_length(xfer);
bytes += actlen;
size -= actlen;
if (actlen != temp) {
/* short transfer */
break;
}
} while (size > 0);
return (bytes - oldbytes);
}
int
usb_bulk_write(usb_dev_handle * dev, int ep, char *bytes,
int size, int timeout)
{
return (usb_std_io(dev, ep & ~USB_ENDPOINT_DIR_MASK,
bytes, size, timeout, 0));
}
int
usb_bulk_read(usb_dev_handle * dev, int ep, char *bytes,
int size, int timeout)
{
return (usb_std_io(dev, ep | USB_ENDPOINT_DIR_MASK,
bytes, size, timeout, 0));
}
int
usb_interrupt_write(usb_dev_handle * dev, int ep, char *bytes,
int size, int timeout)
{
return (usb_std_io(dev, ep & ~USB_ENDPOINT_DIR_MASK,
bytes, size, timeout, 1));
}
int
usb_interrupt_read(usb_dev_handle * dev, int ep, char *bytes,
int size, int timeout)
{
return (usb_std_io(dev, ep | USB_ENDPOINT_DIR_MASK,
bytes, size, timeout, 1));
}
int
usb_control_msg(usb_dev_handle * dev, int requesttype, int request,
int value, int wIndex, char *bytes, int size, int timeout)
{
struct LIBUSB20_CONTROL_SETUP_DECODED req;
int err;
uint16_t actlen;
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &req);
req.bmRequestType = requesttype;
req.bRequest = request;
req.wValue = value;
req.wIndex = wIndex;
req.wLength = size;
err = libusb20_dev_request_sync((void *)dev, &req, bytes,
&actlen, timeout, 0);
if (err)
return (-1);
return (actlen);
}
int
usb_set_configuration(usb_dev_handle * udev, int bConfigurationValue)
{
struct usb_device *dev;
int err;
uint8_t i;
/*
* Need to translate from "bConfigurationValue" to
* configuration index:
*/
if (bConfigurationValue == 0) {
/* unconfigure */
i = 255;
} else {
/* lookup configuration index */
dev = usb_device(udev);
/* check if the configuration array is not there */
if (dev->config == NULL) {
return (-1);
}
for (i = 0;; i++) {
if (i == dev->descriptor.bNumConfigurations) {
/* "bConfigurationValue" not found */
return (-1);
}
if ((dev->config + i)->bConfigurationValue ==
bConfigurationValue) {
break;
}
}
}
err = libusb20_dev_set_config_index((void *)udev, i);
if (err)
return (-1);
return (0);
}
int
usb_claim_interface(usb_dev_handle * dev, int interface)
{
struct libusb20_device *pdev = (void *)dev;
pdev->claimed_interface = interface;
return (0);
}
int
usb_release_interface(usb_dev_handle * dev, int interface)
{
/* do nothing */
return (0);
}
int
usb_set_altinterface(usb_dev_handle * dev, int alternate)
{
struct libusb20_device *pdev = (void *)dev;
int err;
uint8_t iface;
iface = pdev->claimed_interface;
err = libusb20_dev_set_alt_index((void *)dev, iface, alternate);
if (err)
return (-1);
return (0);
}
int
usb_resetep(usb_dev_handle * dev, unsigned int ep)
{
/* emulate an endpoint reset through clear-STALL */
return (usb_clear_halt(dev, ep));
}
int
usb_clear_halt(usb_dev_handle * dev, unsigned int ep)
{
struct libusb20_transfer *xfer;
xfer = usb_get_transfer_by_ep_no(dev, ep);
if (xfer == NULL)
return (-1);
libusb20_tr_clear_stall_sync(xfer);
return (0);
}
int
usb_reset(usb_dev_handle * dev)
{
int err;
err = libusb20_dev_reset((void *)dev);
if (err)
return (-1);
/*
* Be compatible with LibUSB from sourceforge and close the
* handle after reset!
*/
return (usb_close(dev));
}
int
usb_check_connected(usb_dev_handle * dev)
{
int err;
err = libusb20_dev_check_connected((void *)dev);
if (err)
return (-1);
return (0);
}
const char *
usb_strerror(void)
{
/* TODO */
return ("Unknown error");
}
void
usb_init(void)
{
/* nothing to do */
return;
}
void
usb_set_debug(int level)
{
/* use kernel UGEN debugging if you need to see what is going on */
return;
}
int
usb_find_busses(void)
{
usb_busses = &usb_global_bus;
return (1);
}
int
usb_find_devices(void)
{
struct libusb20_device *pdev;
struct usb_device *udev;
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
int devnum;
int err;
/* cleanup after last device search */
/* close all opened devices, if any */
while ((pdev = libusb20_be_device_foreach(usb_backend, NULL))) {
udev = pdev->privLuData;
libusb20_be_dequeue_device(usb_backend, pdev);
libusb20_dev_free(pdev);
if (udev != NULL) {
LIST_DEL(usb_global_bus.devices, udev);
free(udev);
}
}
/* free old USB backend, if any */
libusb20_be_free(usb_backend);
/* do a new backend device search */
usb_backend = libusb20_be_alloc_default();
if (usb_backend == NULL) {
return (-1);
}
/* iterate all devices */
devnum = 1;
pdev = NULL;
while ((pdev = libusb20_be_device_foreach(usb_backend, pdev))) {
udev = malloc(sizeof(*udev));
if (udev == NULL)
break;
memset(udev, 0, sizeof(*udev));
udev->bus = &usb_global_bus;
snprintf(udev->filename, sizeof(udev->filename),
"/dev/ugen%u.%u",
libusb20_dev_get_bus_number(pdev),
libusb20_dev_get_address(pdev));
ddesc = libusb20_dev_get_device_desc(pdev);
udev->descriptor.bLength = sizeof(udev->descriptor);
udev->descriptor.bDescriptorType = ddesc->bDescriptorType;
udev->descriptor.bcdUSB = ddesc->bcdUSB;
udev->descriptor.bDeviceClass = ddesc->bDeviceClass;
udev->descriptor.bDeviceSubClass = ddesc->bDeviceSubClass;
udev->descriptor.bDeviceProtocol = ddesc->bDeviceProtocol;
udev->descriptor.bMaxPacketSize0 = ddesc->bMaxPacketSize0;
udev->descriptor.idVendor = ddesc->idVendor;
udev->descriptor.idProduct = ddesc->idProduct;
udev->descriptor.bcdDevice = ddesc->bcdDevice;
udev->descriptor.iManufacturer = ddesc->iManufacturer;
udev->descriptor.iProduct = ddesc->iProduct;
udev->descriptor.iSerialNumber = ddesc->iSerialNumber;
udev->descriptor.bNumConfigurations =
ddesc->bNumConfigurations;
if (udev->descriptor.bNumConfigurations > USB_MAXCONFIG) {
/* truncate number of configurations */
udev->descriptor.bNumConfigurations = USB_MAXCONFIG;
}
udev->devnum = devnum++;
/* link together the two structures */
udev->dev = pdev;
pdev->privLuData = udev;
err = libusb20_dev_open(pdev, 0);
if (err == 0) {
/* XXX get all config descriptors by default */
usb_fetch_and_parse_descriptors((void *)pdev);
libusb20_dev_close(pdev);
}
LIST_ADD(usb_global_bus.devices, udev);
}
return (devnum - 1); /* success */
}
struct usb_device *
usb_device(usb_dev_handle * dev)
{
struct libusb20_device *pdev;
pdev = (void *)dev;
return (pdev->privLuData);
}
struct usb_bus *
usb_get_busses(void)
{
return (usb_busses);
}
int
usb_get_driver_np(usb_dev_handle * dev, int interface, char *name, int namelen)
{
struct libusb20_device *pdev;
char *ptr;
int err;
pdev = (void *)dev;
if (pdev == NULL)
return (-1);
if (namelen < 1)
return (-1);
if (namelen > 255)
namelen = 255;
err = libusb20_dev_get_iface_desc(pdev, interface, name, namelen);
if (err != 0)
return (-1);
/* we only want the driver name */
ptr = strstr(name, ":");
if (ptr != NULL)
*ptr = 0;
return (0);
}
int
usb_detach_kernel_driver_np(usb_dev_handle * dev, int interface)
{
struct libusb20_device *pdev;
int err;
pdev = (void *)dev;
if (pdev == NULL)
return (-1);
err = libusb20_dev_detach_kernel_driver(pdev, interface);
if (err != 0)
return (-1);
return (0);
}
diff --git a/lib/libusb/libusb10.c b/lib/libusb/libusb10.c
index fb82e99b6d52..6d9c11910ea0 100644
--- a/lib/libusb/libusb10.c
+++ b/lib/libusb/libusb10.c
@@ -1,1777 +1,1776 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Sylvestre Gallon. All rights reserved.
* Copyright (c) 2009-2023 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <assert.h>
#include <errno.h>
#include <poll.h>
#include <pthread.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <sys/fcntl.h>
#include <sys/ioctl.h>
#include <sys/queue.h>
#include <sys/endian.h>
#endif
#define libusb_device_handle libusb20_device
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
#include "libusb.h"
#include "libusb10.h"
#define LIBUSB_NUM_SW_ENDPOINTS (16 * 4)
static pthread_mutex_t default_context_lock = PTHREAD_MUTEX_INITIALIZER;
struct libusb_context *usbi_default_context = NULL;
/* Prototypes */
static struct libusb20_transfer *libusb10_get_transfer(struct libusb20_device *, uint8_t, uint8_t);
static int libusb10_get_buffsize(struct libusb20_device *, libusb_transfer *);
static int libusb10_convert_error(uint8_t status);
static void libusb10_complete_transfer(struct libusb20_transfer *, struct libusb_super_transfer *, int);
static void libusb10_isoc_proxy(struct libusb20_transfer *);
static void libusb10_bulk_intr_proxy(struct libusb20_transfer *);
static void libusb10_ctrl_proxy(struct libusb20_transfer *);
static void libusb10_submit_transfer_sub(struct libusb20_device *, uint8_t);
/* Library initialisation / deinitialisation */
static const struct libusb_version libusb_version = {
.major = 1,
.minor = 0,
.micro = 0,
.nano = 2016,
.rc = "",
.describe = "https://www.freebsd.org"
};
const struct libusb_version *
libusb_get_version(void)
{
return (&libusb_version);
}
void
libusb_set_debug(libusb_context *ctx, int level)
{
ctx = GET_CONTEXT(ctx);
/* debug_fixed is set when the environment overrides libusb_set_debug */
if (ctx && ctx->debug_fixed == 0)
ctx->debug = level;
}
static void
libusb_set_nonblocking(int f)
{
int flags;
/*
* We ignore any failures in this function, hence the
* non-blocking flag is not critical to the operation of
* libUSB. We use F_GETFL and F_SETFL to be compatible with
* Linux.
*/
flags = fcntl(f, F_GETFL, NULL);
if (flags == -1)
return;
flags |= O_NONBLOCK;
fcntl(f, F_SETFL, flags);
}
void
libusb_interrupt_event_handler(libusb_context *ctx)
{
uint8_t dummy;
int err;
if (ctx == NULL)
return;
dummy = 0;
err = write(ctx->ctrl_pipe[1], &dummy, sizeof(dummy));
if (err < (int)sizeof(dummy)) {
/* ignore error, if any */
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "Waking up event loop failed!");
}
}
int
libusb_init(libusb_context **context)
{
return (libusb_init_context(context, NULL, 0));
}
int
libusb_init_context(libusb_context **context,
const struct libusb_init_option option[], int num_options)
{
struct libusb_context *ctx;
pthread_condattr_t attr;
char *debug, *ep;
int ret;
if (num_options < 0)
return (LIBUSB_ERROR_INVALID_PARAM);
ctx = malloc(sizeof(*ctx));
if (!ctx)
return (LIBUSB_ERROR_INVALID_PARAM);
memset(ctx, 0, sizeof(*ctx));
debug = getenv("LIBUSB_DEBUG");
if (debug != NULL) {
/*
* If LIBUSB_DEBUG is set, we'll honor that first and
* use it to override any future libusb_set_debug()
* calls or init options.
*/
errno = 0;
ctx->debug = strtol(debug, &ep, 10);
if (errno == 0 && *ep == '\0') {
ctx->debug_fixed = 1;
} else {
/*
* LIBUSB_DEBUG conversion failed for some reason, but
* we don't care about the specifics all that much. We
* can't use it either way. Force it to the default,
* 0, in case we had a partial number.
*/
ctx->debug = 0;
}
} else {
/*
* If the LIBUSB_OPTION_LOG_LEVEL is set, honor that.
*/
for (int i = 0; i != num_options; i++) {
if (option[i].option != LIBUSB_OPTION_LOG_LEVEL)
continue;
ctx->debug = (int)option[i].value.ival;
if ((int64_t)ctx->debug == option[i].value.ival) {
ctx->debug_fixed = 1;
} else {
free(ctx);
return (LIBUSB_ERROR_INVALID_PARAM);
}
}
}
TAILQ_INIT(&ctx->pollfds);
TAILQ_INIT(&ctx->tr_done);
TAILQ_INIT(&ctx->hotplug_cbh);
TAILQ_INIT(&ctx->hotplug_devs);
if (pthread_mutex_init(&ctx->ctx_lock, NULL) != 0) {
free(ctx);
return (LIBUSB_ERROR_NO_MEM);
}
if (pthread_mutex_init(&ctx->hotplug_lock, NULL) != 0) {
pthread_mutex_destroy(&ctx->ctx_lock);
free(ctx);
return (LIBUSB_ERROR_NO_MEM);
}
if (pthread_condattr_init(&attr) != 0) {
pthread_mutex_destroy(&ctx->ctx_lock);
pthread_mutex_destroy(&ctx->hotplug_lock);
free(ctx);
return (LIBUSB_ERROR_NO_MEM);
}
if (pthread_condattr_setclock(&attr, CLOCK_MONOTONIC) != 0) {
pthread_mutex_destroy(&ctx->ctx_lock);
pthread_mutex_destroy(&ctx->hotplug_lock);
pthread_condattr_destroy(&attr);
free(ctx);
return (LIBUSB_ERROR_OTHER);
}
if (pthread_cond_init(&ctx->ctx_cond, &attr) != 0) {
pthread_mutex_destroy(&ctx->ctx_lock);
pthread_mutex_destroy(&ctx->hotplug_lock);
pthread_condattr_destroy(&attr);
free(ctx);
return (LIBUSB_ERROR_NO_MEM);
}
pthread_condattr_destroy(&attr);
ctx->ctx_handler = NO_THREAD;
ctx->hotplug_handler = NO_THREAD;
ret = pipe(ctx->ctrl_pipe);
if (ret < 0) {
pthread_mutex_destroy(&ctx->ctx_lock);
pthread_mutex_destroy(&ctx->hotplug_lock);
pthread_cond_destroy(&ctx->ctx_cond);
free(ctx);
return (LIBUSB_ERROR_OTHER);
}
/* set non-blocking mode on the control pipe to avoid deadlock */
libusb_set_nonblocking(ctx->ctrl_pipe[0]);
libusb_set_nonblocking(ctx->ctrl_pipe[1]);
libusb10_add_pollfd(ctx, &ctx->ctx_poll, NULL, ctx->ctrl_pipe[0], POLLIN);
pthread_mutex_lock(&default_context_lock);
if (usbi_default_context == NULL) {
usbi_default_context = ctx;
}
pthread_mutex_unlock(&default_context_lock);
if (context)
*context = ctx;
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_init complete");
signal(SIGPIPE, SIG_IGN);
return (0);
}
void
libusb_exit(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
if (ctx == NULL)
return;
/* stop hotplug thread, if any */
if (ctx->hotplug_handler != NO_THREAD) {
pthread_t td;
void *ptr;
HOTPLUG_LOCK(ctx);
td = ctx->hotplug_handler;
ctx->hotplug_handler = NO_THREAD;
HOTPLUG_UNLOCK(ctx);
pthread_join(td, &ptr);
}
/* XXX cleanup devices */
libusb10_remove_pollfd(ctx, &ctx->ctx_poll);
close(ctx->ctrl_pipe[0]);
close(ctx->ctrl_pipe[1]);
pthread_mutex_destroy(&ctx->ctx_lock);
pthread_mutex_destroy(&ctx->hotplug_lock);
pthread_cond_destroy(&ctx->ctx_cond);
pthread_mutex_lock(&default_context_lock);
if (ctx == usbi_default_context) {
usbi_default_context = NULL;
}
pthread_mutex_unlock(&default_context_lock);
free(ctx);
}
/* Device handling and initialisation. */
ssize_t
libusb_get_device_list(libusb_context *ctx, libusb_device ***list)
{
struct libusb20_backend *usb_backend;
struct libusb20_device *pdev;
struct libusb_device *dev;
int i;
ctx = GET_CONTEXT(ctx);
if (ctx == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (list == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
usb_backend = libusb20_be_alloc_default();
if (usb_backend == NULL)
return (LIBUSB_ERROR_NO_MEM);
/* figure out how many USB devices are present */
pdev = NULL;
i = 0;
while ((pdev = libusb20_be_device_foreach(usb_backend, pdev)))
i++;
/* allocate device pointer list */
*list = malloc((i + 1) * sizeof(void *));
if (*list == NULL) {
libusb20_be_free(usb_backend);
return (LIBUSB_ERROR_NO_MEM);
}
/* create libusb v1.0 compliant devices */
i = 0;
while ((pdev = libusb20_be_device_foreach(usb_backend, NULL))) {
dev = malloc(sizeof(*dev));
if (dev == NULL) {
while (i != 0) {
libusb_unref_device((*list)[i - 1]);
i--;
}
free(*list);
*list = NULL;
libusb20_be_free(usb_backend);
return (LIBUSB_ERROR_NO_MEM);
}
/* get device into libUSB v1.0 list */
libusb20_be_dequeue_device(usb_backend, pdev);
memset(dev, 0, sizeof(*dev));
/* init transfer queues */
TAILQ_INIT(&dev->tr_head);
/* set context we belong to */
dev->ctx = ctx;
/* link together the two structures */
dev->os_priv = pdev;
pdev->privLuData = dev;
(*list)[i] = libusb_ref_device(dev);
i++;
}
(*list)[i] = NULL;
libusb20_be_free(usb_backend);
return (i);
}
void
libusb_free_device_list(libusb_device **list, int unref_devices)
{
int i;
if (list == NULL)
return; /* be NULL safe */
if (unref_devices) {
for (i = 0; list[i] != NULL; i++)
libusb_unref_device(list[i]);
}
free(list);
}
uint8_t
libusb_get_bus_number(libusb_device *dev)
{
if (dev == NULL)
return (0); /* should not happen */
return (libusb20_dev_get_bus_number(dev->os_priv));
}
uint8_t
libusb_get_port_number(libusb_device *dev)
{
if (dev == NULL)
return (0); /* should not happen */
return (libusb20_dev_get_parent_port(dev->os_priv));
}
int
libusb_get_port_numbers(libusb_device *dev, uint8_t *buf, uint8_t bufsize)
{
return (libusb20_dev_get_port_path(dev->os_priv, buf, bufsize));
}
int
libusb_get_port_path(libusb_context *ctx, libusb_device *dev, uint8_t *buf,
uint8_t bufsize)
{
return (libusb20_dev_get_port_path(dev->os_priv, buf, bufsize));
}
uint8_t
libusb_get_device_address(libusb_device *dev)
{
if (dev == NULL)
return (0); /* should not happen */
return (libusb20_dev_get_address(dev->os_priv));
}
enum libusb_speed
libusb_get_device_speed(libusb_device *dev)
{
if (dev == NULL)
return (LIBUSB_SPEED_UNKNOWN); /* should not happen */
switch (libusb20_dev_get_speed(dev->os_priv)) {
case LIBUSB20_SPEED_LOW:
return (LIBUSB_SPEED_LOW);
case LIBUSB20_SPEED_FULL:
return (LIBUSB_SPEED_FULL);
case LIBUSB20_SPEED_HIGH:
return (LIBUSB_SPEED_HIGH);
case LIBUSB20_SPEED_SUPER:
return (LIBUSB_SPEED_SUPER);
default:
break;
}
return (LIBUSB_SPEED_UNKNOWN);
}
int
libusb_get_max_packet_size(libusb_device *dev, uint8_t endpoint)
{
struct libusb_config_descriptor *pdconf;
struct libusb_interface *pinf;
struct libusb_interface_descriptor *pdinf;
struct libusb_endpoint_descriptor *pdend;
int i;
int j;
int k;
int ret;
if (dev == NULL)
return (LIBUSB_ERROR_NO_DEVICE);
ret = libusb_get_active_config_descriptor(dev, &pdconf);
if (ret < 0)
return (ret);
ret = LIBUSB_ERROR_NOT_FOUND;
for (i = 0; i < pdconf->bNumInterfaces; i++) {
pinf = &pdconf->interface[i];
for (j = 0; j < pinf->num_altsetting; j++) {
pdinf = &pinf->altsetting[j];
for (k = 0; k < pdinf->bNumEndpoints; k++) {
pdend = &pdinf->endpoint[k];
if (pdend->bEndpointAddress == endpoint) {
ret = pdend->wMaxPacketSize;
goto out;
}
}
}
}
out:
libusb_free_config_descriptor(pdconf);
return (ret);
}
int
libusb_get_max_iso_packet_size(libusb_device *dev, uint8_t endpoint)
{
int multiplier;
int ret;
ret = libusb_get_max_packet_size(dev, endpoint);
switch (libusb20_dev_get_speed(dev->os_priv)) {
case LIBUSB20_SPEED_LOW:
case LIBUSB20_SPEED_FULL:
break;
default:
if (ret > -1) {
multiplier = (1 + ((ret >> 11) & 3));
if (multiplier > 3)
multiplier = 3;
ret = (ret & 0x7FF) * multiplier;
}
break;
}
return (ret);
}
libusb_device *
libusb_ref_device(libusb_device *dev)
{
if (dev == NULL)
return (NULL); /* be NULL safe */
CTX_LOCK(dev->ctx);
dev->refcnt++;
CTX_UNLOCK(dev->ctx);
return (dev);
}
void
libusb_unref_device(libusb_device *dev)
{
if (dev == NULL)
return; /* be NULL safe */
CTX_LOCK(dev->ctx);
dev->refcnt--;
CTX_UNLOCK(dev->ctx);
if (dev->refcnt == 0) {
libusb20_dev_free(dev->os_priv);
free(dev);
}
}
int
libusb_open(libusb_device *dev, libusb_device_handle **devh)
{
libusb_context *ctx = dev->ctx;
struct libusb20_device *pdev = dev->os_priv;
int err;
if (devh == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
/* set default device handle value */
*devh = NULL;
dev = libusb_ref_device(dev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
err = libusb20_dev_open(pdev, LIBUSB_NUM_SW_ENDPOINTS);
if (err) {
libusb_unref_device(dev);
return (LIBUSB_ERROR_NO_MEM);
}
/*
* Clear the device gone flag, in case the device was opened
* after a re-attach, to allow new transaction:
*/
CTX_LOCK(ctx);
dev->device_is_gone = 0;
CTX_UNLOCK(ctx);
libusb10_add_pollfd(ctx, &dev->dev_poll, pdev, libusb20_dev_get_fd(pdev), POLLIN |
POLLOUT | POLLRDNORM | POLLWRNORM);
/* make sure our event loop detects the new device */
libusb_interrupt_event_handler(ctx);
*devh = pdev;
return (0);
}
libusb_device_handle *
libusb_open_device_with_vid_pid(libusb_context *ctx, uint16_t vendor_id,
uint16_t product_id)
{
struct libusb_device **devs;
struct libusb20_device *pdev;
struct LIBUSB20_DEVICE_DESC_DECODED *pdesc;
int i;
int j;
ctx = GET_CONTEXT(ctx);
if (ctx == NULL)
return (NULL); /* be NULL safe */
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_open_device_with_vid_pid enter");
if ((i = libusb_get_device_list(ctx, &devs)) < 0)
return (NULL);
pdev = NULL;
for (j = 0; j < i; j++) {
struct libusb20_device *tdev;
tdev = devs[j]->os_priv;
pdesc = libusb20_dev_get_device_desc(tdev);
/*
* NOTE: The USB library will automatically swap the
* fields in the device descriptor to be of host
* endian type!
*/
if (pdesc->idVendor == vendor_id &&
pdesc->idProduct == product_id) {
libusb_open(devs[j], &pdev);
break;
}
}
libusb_free_device_list(devs, 1);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_open_device_with_vid_pid leave");
return (pdev);
}
void
libusb_close(struct libusb20_device *pdev)
{
libusb_context *ctx;
struct libusb_device *dev;
if (pdev == NULL)
return; /* be NULL safe */
dev = libusb_get_device(pdev);
ctx = dev->ctx;
libusb10_remove_pollfd(ctx, &dev->dev_poll);
libusb20_dev_close(pdev);
/* unref will free the "pdev" when the refcount reaches zero */
libusb_unref_device(dev);
/* make sure our event loop detects the closed device */
libusb_interrupt_event_handler(ctx);
}
libusb_device *
libusb_get_device(struct libusb20_device *pdev)
{
if (pdev == NULL)
return (NULL);
return ((libusb_device *)pdev->privLuData);
}
int
libusb_get_configuration(struct libusb20_device *pdev, int *config)
{
struct libusb20_config *pconf;
if (pdev == NULL || config == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
pconf = libusb20_dev_alloc_config(pdev, libusb20_dev_get_config_index(pdev));
if (pconf == NULL)
return (LIBUSB_ERROR_NO_MEM);
*config = pconf->desc.bConfigurationValue;
free(pconf);
return (0);
}
int
libusb_set_configuration(struct libusb20_device *pdev, int configuration)
{
struct libusb20_config *pconf;
struct libusb_device *dev;
int err;
uint8_t i;
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (configuration < 1) {
/* unconfigure */
i = 255;
} else {
for (i = 0; i != 255; i++) {
uint8_t found;
pconf = libusb20_dev_alloc_config(pdev, i);
if (pconf == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
found = (pconf->desc.bConfigurationValue
== configuration);
free(pconf);
if (found)
goto set_config;
}
return (LIBUSB_ERROR_INVALID_PARAM);
}
set_config:
libusb10_cancel_all_transfer(dev);
libusb10_remove_pollfd(dev->ctx, &dev->dev_poll);
err = libusb20_dev_set_config_index(pdev, i);
libusb10_add_pollfd(dev->ctx, &dev->dev_poll, pdev, libusb20_dev_get_fd(pdev), POLLIN |
POLLOUT | POLLRDNORM | POLLWRNORM);
return (err ? LIBUSB_ERROR_INVALID_PARAM : 0);
}
int
libusb_claim_interface(struct libusb20_device *pdev, int interface_number)
{
libusb_device *dev;
int err = 0;
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (interface_number < 0 || interface_number > 31)
return (LIBUSB_ERROR_INVALID_PARAM);
if (pdev->auto_detach != 0) {
err = libusb_detach_kernel_driver(pdev, interface_number);
if (err != 0)
goto done;
}
CTX_LOCK(dev->ctx);
dev->claimed_interfaces |= (1 << interface_number);
CTX_UNLOCK(dev->ctx);
done:
return (err);
}
int
libusb_release_interface(struct libusb20_device *pdev, int interface_number)
{
libusb_device *dev;
int err = 0;
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (interface_number < 0 || interface_number > 31)
return (LIBUSB_ERROR_INVALID_PARAM);
if (pdev->auto_detach != 0) {
err = libusb_attach_kernel_driver(pdev, interface_number);
if (err != 0)
goto done;
}
CTX_LOCK(dev->ctx);
if (!(dev->claimed_interfaces & (1 << interface_number)))
err = LIBUSB_ERROR_NOT_FOUND;
else
dev->claimed_interfaces &= ~(1 << interface_number);
CTX_UNLOCK(dev->ctx);
done:
return (err);
}
int
libusb_set_interface_alt_setting(struct libusb20_device *pdev,
int interface_number, int alternate_setting)
{
libusb_device *dev;
int err = 0;
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (interface_number < 0 || interface_number > 31)
return (LIBUSB_ERROR_INVALID_PARAM);
CTX_LOCK(dev->ctx);
if (!(dev->claimed_interfaces & (1 << interface_number)))
err = LIBUSB_ERROR_NOT_FOUND;
CTX_UNLOCK(dev->ctx);
if (err)
return (err);
libusb10_cancel_all_transfer(dev);
libusb10_remove_pollfd(dev->ctx, &dev->dev_poll);
err = libusb20_dev_set_alt_index(pdev,
interface_number, alternate_setting);
libusb10_add_pollfd(dev->ctx, &dev->dev_poll,
pdev, libusb20_dev_get_fd(pdev),
POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM);
return (err ? LIBUSB_ERROR_OTHER : 0);
}
static struct libusb20_transfer *
libusb10_get_transfer(struct libusb20_device *pdev,
uint8_t endpoint, uint8_t xfer_index)
{
xfer_index &= 1; /* double buffering */
xfer_index |= (endpoint & LIBUSB20_ENDPOINT_ADDRESS_MASK) * 4;
if (endpoint & LIBUSB20_ENDPOINT_DIR_MASK) {
/* this is an IN endpoint */
xfer_index |= 2;
}
return (libusb20_tr_get_pointer(pdev, xfer_index));
}
int
libusb_clear_halt(struct libusb20_device *pdev, uint8_t endpoint)
{
struct libusb20_transfer *xfer;
struct libusb_device *dev;
int err;
xfer = libusb10_get_transfer(pdev, endpoint, 0);
if (xfer == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
CTX_LOCK(dev->ctx);
err = libusb20_tr_open(xfer, 0, 1, endpoint);
CTX_UNLOCK(dev->ctx);
if (err != 0 && err != LIBUSB20_ERROR_BUSY)
return (LIBUSB_ERROR_OTHER);
libusb20_tr_clear_stall_sync(xfer);
/* check if we opened the transfer */
if (err == 0) {
CTX_LOCK(dev->ctx);
libusb20_tr_close(xfer);
CTX_UNLOCK(dev->ctx);
}
return (0); /* success */
}
int
libusb_reset_device(struct libusb20_device *pdev)
{
libusb_device *dev;
int err;
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
libusb10_cancel_all_transfer(dev);
libusb10_remove_pollfd(dev->ctx, &dev->dev_poll);
err = libusb20_dev_reset(pdev);
libusb10_add_pollfd(dev->ctx, &dev->dev_poll,
pdev, libusb20_dev_get_fd(pdev),
POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM);
return (err ? LIBUSB_ERROR_OTHER : 0);
}
int
libusb_check_connected(struct libusb20_device *pdev)
{
libusb_device *dev;
int err;
dev = libusb_get_device(pdev);
if (dev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
err = libusb20_dev_check_connected(pdev);
return (err ? LIBUSB_ERROR_NO_DEVICE : 0);
}
int
libusb_kernel_driver_active(struct libusb20_device *pdev, int interface)
{
if (pdev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (libusb20_dev_kernel_driver_active(pdev, interface))
return (0); /* no kernel driver is active */
else
return (1); /* kernel driver is active */
}
int
libusb_get_driver_np(struct libusb20_device *pdev, int interface,
char *name, int namelen)
{
return (libusb_get_driver(pdev, interface, name, namelen));
}
int
libusb_get_driver(struct libusb20_device *pdev, int interface,
char *name, int namelen)
{
char *ptr;
int err;
if (pdev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (namelen < 1)
return (LIBUSB_ERROR_INVALID_PARAM);
if (namelen > 255)
namelen = 255;
err = libusb20_dev_get_iface_desc(
pdev, interface, name, namelen);
if (err != 0)
return (LIBUSB_ERROR_OTHER);
/* we only want the driver name */
ptr = strstr(name, ":");
if (ptr != NULL)
*ptr = 0;
return (0);
}
int
libusb_detach_kernel_driver_np(struct libusb20_device *pdev, int interface)
{
return (libusb_detach_kernel_driver(pdev, interface));
}
int
libusb_detach_kernel_driver(struct libusb20_device *pdev, int interface)
{
int err;
if (pdev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
err = libusb20_dev_detach_kernel_driver(
pdev, interface);
return (err ? LIBUSB_ERROR_OTHER : 0);
}
int
libusb_attach_kernel_driver(struct libusb20_device *pdev, int interface)
{
if (pdev == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
/* stub - currently not supported by libusb20 */
return (0);
}
int
libusb_set_auto_detach_kernel_driver(libusb_device_handle *dev, int enable)
{
dev->auto_detach = (enable ? 1 : 0);
return (0);
}
/* Asynchronous device I/O */
struct libusb_transfer *
libusb_alloc_transfer(int iso_packets)
{
struct libusb_transfer *uxfer;
struct libusb_super_transfer *sxfer;
int len;
len = sizeof(struct libusb_transfer) +
sizeof(struct libusb_super_transfer) +
(iso_packets * sizeof(libusb_iso_packet_descriptor));
sxfer = malloc(len);
if (sxfer == NULL)
return (NULL);
memset(sxfer, 0, len);
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
/* set default value */
uxfer->num_iso_packets = iso_packets;
return (uxfer);
}
void
libusb_free_transfer(struct libusb_transfer *uxfer)
{
struct libusb_super_transfer *sxfer;
if (uxfer == NULL)
return; /* be NULL safe */
/* check if we should free the transfer buffer */
if (uxfer->flags & LIBUSB_TRANSFER_FREE_BUFFER)
free(uxfer->buffer);
sxfer = (struct libusb_super_transfer *)(
(uint8_t *)uxfer - sizeof(*sxfer));
free(sxfer);
}
static uint32_t
libusb10_get_maxframe(struct libusb20_device *pdev, libusb_transfer *xfer)
{
uint32_t ret;
switch (xfer->type) {
case LIBUSB_TRANSFER_TYPE_ISOCHRONOUS:
ret = 60 | LIBUSB20_MAX_FRAME_PRE_SCALE; /* 60ms */
break;
case LIBUSB_TRANSFER_TYPE_CONTROL:
ret = 2;
break;
default:
ret = 1;
break;
}
return (ret);
}
static int
libusb10_get_buffsize(struct libusb20_device *pdev, libusb_transfer *xfer)
{
int ret;
int usb_speed;
usb_speed = libusb20_dev_get_speed(pdev);
switch (xfer->type) {
case LIBUSB_TRANSFER_TYPE_ISOCHRONOUS:
ret = 0; /* kernel will auto-select */
break;
case LIBUSB_TRANSFER_TYPE_CONTROL:
ret = 1024;
break;
default:
switch (usb_speed) {
case LIBUSB20_SPEED_LOW:
ret = 256;
break;
case LIBUSB20_SPEED_FULL:
ret = 4096;
break;
case LIBUSB20_SPEED_SUPER:
ret = 65536;
break;
default:
ret = 16384;
break;
}
break;
}
return (ret);
}
static int
libusb10_convert_error(uint8_t status)
{
; /* indent fix */
switch (status) {
case LIBUSB20_TRANSFER_START:
case LIBUSB20_TRANSFER_COMPLETED:
return (LIBUSB_TRANSFER_COMPLETED);
case LIBUSB20_TRANSFER_OVERFLOW:
return (LIBUSB_TRANSFER_OVERFLOW);
case LIBUSB20_TRANSFER_NO_DEVICE:
return (LIBUSB_TRANSFER_NO_DEVICE);
case LIBUSB20_TRANSFER_STALL:
return (LIBUSB_TRANSFER_STALL);
case LIBUSB20_TRANSFER_CANCELLED:
return (LIBUSB_TRANSFER_CANCELLED);
case LIBUSB20_TRANSFER_TIMED_OUT:
return (LIBUSB_TRANSFER_TIMED_OUT);
default:
return (LIBUSB_TRANSFER_ERROR);
}
}
/* This function must be called locked */
static void
libusb10_complete_transfer(struct libusb20_transfer *pxfer,
struct libusb_super_transfer *sxfer, int status)
{
struct libusb_transfer *uxfer;
struct libusb_device *dev;
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
if (pxfer != NULL)
libusb20_tr_set_priv_sc1(pxfer, NULL);
/* set transfer status */
uxfer->status = status;
/* update super transfer state */
sxfer->state = LIBUSB_SUPER_XFER_ST_NONE;
dev = libusb_get_device(uxfer->dev_handle);
TAILQ_INSERT_TAIL(&dev->ctx->tr_done, sxfer, entry);
}
/* This function must be called locked */
static void
libusb10_isoc_proxy(struct libusb20_transfer *pxfer)
{
struct libusb_super_transfer *sxfer;
struct libusb_transfer *uxfer;
uint32_t actlen;
uint16_t iso_packets;
uint16_t i;
uint8_t status;
status = libusb20_tr_get_status(pxfer);
sxfer = libusb20_tr_get_priv_sc1(pxfer);
actlen = libusb20_tr_get_actual_length(pxfer);
iso_packets = libusb20_tr_get_max_frames(pxfer);
if (sxfer == NULL)
return; /* cancelled - nothing to do */
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
if (iso_packets > uxfer->num_iso_packets)
iso_packets = uxfer->num_iso_packets;
if (iso_packets == 0)
return; /* nothing to do */
/* make sure that the number of ISOCHRONOUS packets is valid */
uxfer->num_iso_packets = iso_packets;
switch (status) {
case LIBUSB20_TRANSFER_COMPLETED:
/* update actual length */
uxfer->actual_length = actlen;
for (i = 0; i != iso_packets; i++) {
uxfer->iso_packet_desc[i].actual_length =
libusb20_tr_get_length(pxfer, i);
}
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_COMPLETED);
break;
case LIBUSB20_TRANSFER_START:
/* setup length(s) */
actlen = 0;
for (i = 0; i != iso_packets; i++) {
libusb20_tr_setup_isoc(pxfer,
&uxfer->buffer[actlen],
uxfer->iso_packet_desc[i].length, i);
actlen += uxfer->iso_packet_desc[i].length;
}
/* no remainder */
sxfer->rem_len = 0;
libusb20_tr_set_total_frames(pxfer, iso_packets);
libusb20_tr_submit(pxfer);
/* fork another USB transfer, if any */
libusb10_submit_transfer_sub(libusb20_tr_get_priv_sc0(pxfer), uxfer->endpoint);
break;
default:
libusb10_complete_transfer(pxfer, sxfer, libusb10_convert_error(status));
break;
}
}
/* This function must be called locked */
static void
libusb10_bulk_intr_proxy(struct libusb20_transfer *pxfer)
{
struct libusb_super_transfer *sxfer;
struct libusb_transfer *uxfer;
uint32_t max_bulk;
uint32_t actlen;
uint8_t status;
uint8_t flags;
status = libusb20_tr_get_status(pxfer);
sxfer = libusb20_tr_get_priv_sc1(pxfer);
max_bulk = libusb20_tr_get_max_total_length(pxfer);
actlen = libusb20_tr_get_actual_length(pxfer);
if (sxfer == NULL)
return; /* cancelled - nothing to do */
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
flags = uxfer->flags;
switch (status) {
case LIBUSB20_TRANSFER_COMPLETED:
uxfer->actual_length += actlen;
/* check for short packet */
if (sxfer->last_len != actlen) {
if (flags & LIBUSB_TRANSFER_SHORT_NOT_OK) {
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_ERROR);
} else {
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_COMPLETED);
}
break;
}
/* check for end of data */
if (sxfer->rem_len == 0) {
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_COMPLETED);
break;
}
/* FALLTHROUGH */
case LIBUSB20_TRANSFER_START:
if (max_bulk > sxfer->rem_len) {
max_bulk = sxfer->rem_len;
}
/* setup new BULK or INTERRUPT transaction */
libusb20_tr_setup_bulk(pxfer,
sxfer->curr_data, max_bulk, uxfer->timeout);
/* update counters */
sxfer->last_len = max_bulk;
sxfer->curr_data += max_bulk;
sxfer->rem_len -= max_bulk;
libusb20_tr_submit(pxfer);
/* check if we can fork another USB transfer */
if (sxfer->rem_len == 0)
libusb10_submit_transfer_sub(libusb20_tr_get_priv_sc0(pxfer), uxfer->endpoint);
break;
default:
libusb10_complete_transfer(pxfer, sxfer, libusb10_convert_error(status));
break;
}
}
/* This function must be called locked */
static void
libusb10_ctrl_proxy(struct libusb20_transfer *pxfer)
{
struct libusb_super_transfer *sxfer;
struct libusb_transfer *uxfer;
uint32_t max_bulk;
uint32_t actlen;
uint8_t status;
uint8_t flags;
status = libusb20_tr_get_status(pxfer);
sxfer = libusb20_tr_get_priv_sc1(pxfer);
max_bulk = libusb20_tr_get_max_total_length(pxfer);
actlen = libusb20_tr_get_actual_length(pxfer);
if (sxfer == NULL)
return; /* cancelled - nothing to do */
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
flags = uxfer->flags;
switch (status) {
case LIBUSB20_TRANSFER_COMPLETED:
uxfer->actual_length += actlen;
/* subtract length of SETUP packet, if any */
actlen -= libusb20_tr_get_length(pxfer, 0);
/* check for short packet */
if (sxfer->last_len != actlen) {
if (flags & LIBUSB_TRANSFER_SHORT_NOT_OK) {
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_ERROR);
} else {
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_COMPLETED);
}
break;
}
/* check for end of data */
if (sxfer->rem_len == 0) {
libusb10_complete_transfer(pxfer, sxfer, LIBUSB_TRANSFER_COMPLETED);
break;
}
/* FALLTHROUGH */
case LIBUSB20_TRANSFER_START:
if (max_bulk > sxfer->rem_len) {
max_bulk = sxfer->rem_len;
}
/* setup new CONTROL transaction */
if (status == LIBUSB20_TRANSFER_COMPLETED) {
/* next fragment - don't send SETUP packet */
libusb20_tr_set_length(pxfer, 0, 0);
} else {
/* first fragment - send SETUP packet */
libusb20_tr_set_length(pxfer, 8, 0);
libusb20_tr_set_buffer(pxfer, uxfer->buffer, 0);
}
if (max_bulk != 0) {
libusb20_tr_set_length(pxfer, max_bulk, 1);
libusb20_tr_set_buffer(pxfer, sxfer->curr_data, 1);
libusb20_tr_set_total_frames(pxfer, 2);
} else {
libusb20_tr_set_total_frames(pxfer, 1);
}
/* update counters */
sxfer->last_len = max_bulk;
sxfer->curr_data += max_bulk;
sxfer->rem_len -= max_bulk;
libusb20_tr_submit(pxfer);
/* check if we can fork another USB transfer */
if (sxfer->rem_len == 0)
libusb10_submit_transfer_sub(libusb20_tr_get_priv_sc0(pxfer), uxfer->endpoint);
break;
default:
libusb10_complete_transfer(pxfer, sxfer, libusb10_convert_error(status));
break;
}
}
/* The following function must be called locked */
static void
libusb10_submit_transfer_sub(struct libusb20_device *pdev, uint8_t endpoint)
{
struct libusb20_transfer *pxfer0;
struct libusb20_transfer *pxfer1;
struct libusb_super_transfer *sxfer;
struct libusb_transfer *uxfer;
struct libusb_device *dev;
int err;
int buffsize;
int maxframe;
int temp;
dev = libusb_get_device(pdev);
pxfer0 = libusb10_get_transfer(pdev, endpoint, 0);
pxfer1 = libusb10_get_transfer(pdev, endpoint, 1);
if (pxfer0 == NULL || pxfer1 == NULL)
return; /* shouldn't happen */
temp = 0;
if (libusb20_tr_pending(pxfer0))
temp |= 1;
if (libusb20_tr_pending(pxfer1))
temp |= 2;
switch (temp) {
case 3:
/* wait till one of the transfers complete */
return;
case 2:
sxfer = libusb20_tr_get_priv_sc1(pxfer1);
if (sxfer == NULL)
return; /* cancelling */
if (sxfer->rem_len)
return; /* cannot queue another one */
/* swap transfers */
pxfer1 = pxfer0;
break;
case 1:
sxfer = libusb20_tr_get_priv_sc1(pxfer0);
if (sxfer == NULL)
return; /* cancelling */
if (sxfer->rem_len)
return; /* cannot queue another one */
/* swap transfers */
pxfer0 = pxfer1;
break;
default:
break;
}
/* find next transfer on same endpoint */
TAILQ_FOREACH(sxfer, &dev->tr_head, entry) {
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
if (uxfer->endpoint == endpoint) {
TAILQ_REMOVE(&dev->tr_head, sxfer, entry);
sxfer->entry.tqe_prev = NULL;
goto found;
}
}
return; /* success */
found:
libusb20_tr_set_priv_sc0(pxfer0, pdev);
libusb20_tr_set_priv_sc1(pxfer0, sxfer);
/* reset super transfer state */
sxfer->rem_len = uxfer->length;
sxfer->curr_data = uxfer->buffer;
uxfer->actual_length = 0;
switch (uxfer->type) {
case LIBUSB_TRANSFER_TYPE_ISOCHRONOUS:
libusb20_tr_set_callback(pxfer0, libusb10_isoc_proxy);
break;
case LIBUSB_TRANSFER_TYPE_BULK:
case LIBUSB_TRANSFER_TYPE_INTERRUPT:
libusb20_tr_set_callback(pxfer0, libusb10_bulk_intr_proxy);
break;
case LIBUSB_TRANSFER_TYPE_CONTROL:
libusb20_tr_set_callback(pxfer0, libusb10_ctrl_proxy);
if (sxfer->rem_len < 8)
goto failure;
/* remove SETUP packet from data */
sxfer->rem_len -= 8;
sxfer->curr_data += 8;
break;
default:
goto failure;
}
buffsize = libusb10_get_buffsize(pdev, uxfer);
maxframe = libusb10_get_maxframe(pdev, uxfer);
/* make sure the transfer is opened */
err = libusb20_tr_open_stream(pxfer0, buffsize, maxframe,
endpoint, sxfer->stream_id);
if (err && (err != LIBUSB20_ERROR_BUSY)) {
goto failure;
}
libusb20_tr_start(pxfer0);
return;
failure:
libusb10_complete_transfer(pxfer0, sxfer, LIBUSB_TRANSFER_ERROR);
/* make sure our event loop spins the done handler */
libusb_interrupt_event_handler(dev->ctx);
}
/* The following function must be called unlocked */
int
libusb_submit_transfer(struct libusb_transfer *uxfer)
{
struct libusb20_transfer *pxfer0;
struct libusb20_transfer *pxfer1;
struct libusb_super_transfer *sxfer;
struct libusb_device *dev;
uint8_t endpoint;
int err;
if (uxfer == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if (uxfer->dev_handle == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
endpoint = uxfer->endpoint;
dev = libusb_get_device(uxfer->dev_handle);
DPRINTF(dev->ctx, LIBUSB_DEBUG_FUNCTION, "libusb_submit_transfer enter");
sxfer = (struct libusb_super_transfer *)(
(uint8_t *)uxfer - sizeof(*sxfer));
CTX_LOCK(dev->ctx);
pxfer0 = libusb10_get_transfer(uxfer->dev_handle, endpoint, 0);
pxfer1 = libusb10_get_transfer(uxfer->dev_handle, endpoint, 1);
if (pxfer0 == NULL || pxfer1 == NULL) {
err = LIBUSB_ERROR_OTHER;
} else if ((sxfer->entry.tqe_prev != NULL) ||
(libusb20_tr_get_priv_sc1(pxfer0) == sxfer) ||
(libusb20_tr_get_priv_sc1(pxfer1) == sxfer)) {
err = LIBUSB_ERROR_BUSY;
} else if (dev->device_is_gone != 0) {
err = LIBUSB_ERROR_NO_DEVICE;
} else {
/* set pending state */
sxfer->state = LIBUSB_SUPER_XFER_ST_PEND;
/* insert transfer into transfer head list */
TAILQ_INSERT_TAIL(&dev->tr_head, sxfer, entry);
/* start work transfers */
libusb10_submit_transfer_sub(
uxfer->dev_handle, endpoint);
err = 0; /* success */
}
CTX_UNLOCK(dev->ctx);
DPRINTF(dev->ctx, LIBUSB_DEBUG_FUNCTION, "libusb_submit_transfer leave %d", err);
return (err);
}
/* Asynchronous transfer cancel */
int
libusb_cancel_transfer(struct libusb_transfer *uxfer)
{
struct libusb20_transfer *pxfer0;
struct libusb20_transfer *pxfer1;
struct libusb_super_transfer *sxfer;
struct libusb_device *dev;
struct libusb_device_handle *devh;
uint8_t endpoint;
int retval;
if (uxfer == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
/* check if not initialised */
if ((devh = uxfer->dev_handle) == NULL)
return (LIBUSB_ERROR_NOT_FOUND);
endpoint = uxfer->endpoint;
dev = libusb_get_device(devh);
DPRINTF(dev->ctx, LIBUSB_DEBUG_FUNCTION, "libusb_cancel_transfer enter");
sxfer = (struct libusb_super_transfer *)(
(uint8_t *)uxfer - sizeof(*sxfer));
retval = 0;
CTX_LOCK(dev->ctx);
pxfer0 = libusb10_get_transfer(devh, endpoint, 0);
pxfer1 = libusb10_get_transfer(devh, endpoint, 1);
if (sxfer->state != LIBUSB_SUPER_XFER_ST_PEND) {
/* only update the transfer status */
uxfer->status = LIBUSB_TRANSFER_CANCELLED;
retval = LIBUSB_ERROR_NOT_FOUND;
} else if (sxfer->entry.tqe_prev != NULL) {
/* we are lucky - transfer is on a queue */
TAILQ_REMOVE(&dev->tr_head, sxfer, entry);
sxfer->entry.tqe_prev = NULL;
libusb10_complete_transfer(NULL,
sxfer, LIBUSB_TRANSFER_CANCELLED);
/* make sure our event loop spins the done handler */
libusb_interrupt_event_handler(dev->ctx);
} else if (pxfer0 == NULL || pxfer1 == NULL) {
/* not started */
retval = LIBUSB_ERROR_NOT_FOUND;
} else if (libusb20_tr_get_priv_sc1(pxfer0) == sxfer) {
libusb10_complete_transfer(pxfer0,
sxfer, LIBUSB_TRANSFER_CANCELLED);
if (dev->device_is_gone != 0) {
/* clear transfer pointer */
libusb20_tr_set_priv_sc1(pxfer0, NULL);
/* make sure our event loop spins the done handler */
libusb_interrupt_event_handler(dev->ctx);
} else {
libusb20_tr_stop(pxfer0);
/* make sure the queue doesn't stall */
libusb10_submit_transfer_sub(devh, endpoint);
}
} else if (libusb20_tr_get_priv_sc1(pxfer1) == sxfer) {
libusb10_complete_transfer(pxfer1,
sxfer, LIBUSB_TRANSFER_CANCELLED);
/* check if handle is still active */
if (dev->device_is_gone != 0) {
/* clear transfer pointer */
libusb20_tr_set_priv_sc1(pxfer1, NULL);
/* make sure our event loop spins the done handler */
libusb_interrupt_event_handler(dev->ctx);
} else {
libusb20_tr_stop(pxfer1);
/* make sure the queue doesn't stall */
libusb10_submit_transfer_sub(devh, endpoint);
}
} else {
/* not started */
retval = LIBUSB_ERROR_NOT_FOUND;
}
CTX_UNLOCK(dev->ctx);
DPRINTF(dev->ctx, LIBUSB_DEBUG_FUNCTION, "libusb_cancel_transfer leave");
return (retval);
}
UNEXPORTED void
libusb10_cancel_all_transfer(libusb_device *dev)
{
struct libusb20_device *pdev = dev->os_priv;
unsigned x;
for (x = 0; x != LIBUSB_NUM_SW_ENDPOINTS; x++) {
struct libusb20_transfer *xfer;
xfer = libusb20_tr_get_pointer(pdev, x);
if (xfer == NULL)
continue;
libusb20_tr_close(xfer);
}
}
UNEXPORTED void
libusb10_cancel_all_transfer_locked(struct libusb20_device *pdev, struct libusb_device *dev)
{
struct libusb_super_transfer *sxfer;
unsigned x;
for (x = 0; x != LIBUSB_NUM_SW_ENDPOINTS; x++) {
struct libusb20_transfer *xfer;
xfer = libusb20_tr_get_pointer(pdev, x);
if (xfer == NULL)
continue;
if (libusb20_tr_pending(xfer) == 0)
continue;
sxfer = libusb20_tr_get_priv_sc1(xfer);
if (sxfer == NULL)
continue;
/* complete pending transfer */
libusb10_complete_transfer(xfer, sxfer, LIBUSB_TRANSFER_ERROR);
}
while ((sxfer = TAILQ_FIRST(&dev->tr_head))) {
TAILQ_REMOVE(&dev->tr_head, sxfer, entry);
/* complete pending transfer */
libusb10_complete_transfer(NULL, sxfer, LIBUSB_TRANSFER_ERROR);
}
}
uint16_t
libusb_cpu_to_le16(uint16_t x)
{
return (htole16(x));
}
uint16_t
libusb_le16_to_cpu(uint16_t x)
{
return (le16toh(x));
}
const char *
libusb_strerror(int code)
{
switch (code) {
case LIBUSB_SUCCESS:
return ("Success");
case LIBUSB_ERROR_IO:
return ("I/O error");
case LIBUSB_ERROR_INVALID_PARAM:
return ("Invalid parameter");
case LIBUSB_ERROR_ACCESS:
return ("Permissions error");
case LIBUSB_ERROR_NO_DEVICE:
return ("No device");
case LIBUSB_ERROR_NOT_FOUND:
return ("Not found");
case LIBUSB_ERROR_BUSY:
return ("Device busy");
case LIBUSB_ERROR_TIMEOUT:
return ("Timeout");
case LIBUSB_ERROR_OVERFLOW:
return ("Overflow");
case LIBUSB_ERROR_PIPE:
return ("Pipe error");
case LIBUSB_ERROR_INTERRUPTED:
return ("Interrupted");
case LIBUSB_ERROR_NO_MEM:
return ("Out of memory");
case LIBUSB_ERROR_NOT_SUPPORTED:
return ("Not supported");
case LIBUSB_ERROR_OTHER:
return ("Other error");
default:
return ("Unknown error");
}
}
const char *
libusb_error_name(int code)
{
switch (code) {
case LIBUSB_SUCCESS:
return ("LIBUSB_SUCCESS");
case LIBUSB_ERROR_IO:
return ("LIBUSB_ERROR_IO");
case LIBUSB_ERROR_INVALID_PARAM:
return ("LIBUSB_ERROR_INVALID_PARAM");
case LIBUSB_ERROR_ACCESS:
return ("LIBUSB_ERROR_ACCESS");
case LIBUSB_ERROR_NO_DEVICE:
return ("LIBUSB_ERROR_NO_DEVICE");
case LIBUSB_ERROR_NOT_FOUND:
return ("LIBUSB_ERROR_NOT_FOUND");
case LIBUSB_ERROR_BUSY:
return ("LIBUSB_ERROR_BUSY");
case LIBUSB_ERROR_TIMEOUT:
return ("LIBUSB_ERROR_TIMEOUT");
case LIBUSB_ERROR_OVERFLOW:
return ("LIBUSB_ERROR_OVERFLOW");
case LIBUSB_ERROR_PIPE:
return ("LIBUSB_ERROR_PIPE");
case LIBUSB_ERROR_INTERRUPTED:
return ("LIBUSB_ERROR_INTERRUPTED");
case LIBUSB_ERROR_NO_MEM:
return ("LIBUSB_ERROR_NO_MEM");
case LIBUSB_ERROR_NOT_SUPPORTED:
return ("LIBUSB_ERROR_NOT_SUPPORTED");
case LIBUSB_ERROR_OTHER:
return ("LIBUSB_ERROR_OTHER");
default:
return ("LIBUSB_ERROR_UNKNOWN");
}
}
int
libusb_has_capability(uint32_t capability)
{
switch (capability) {
case LIBUSB_CAP_HAS_CAPABILITY:
case LIBUSB_CAP_HAS_HOTPLUG:
case LIBUSB_CAP_HAS_HID_ACCESS:
case LIBUSB_CAP_SUPPORTS_DETACH_KERNEL_DRIVER:
return (1);
default:
return (0);
}
}
diff --git a/lib/libusb/libusb10.h b/lib/libusb/libusb10.h
index 18c8aab9e5dc..544364386061 100644
--- a/lib/libusb/libusb10.h
+++ b/lib/libusb/libusb10.h
@@ -1,145 +1,144 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Sylvestre Gallon. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef __LIBUSB10_H__
#define __LIBUSB10_H__
#ifndef LIBUSB_GLOBAL_INCLUDE_FILE
#include <sys/queue.h>
#endif
#define GET_CONTEXT(ctx) (((ctx) == NULL) ? usbi_default_context : (ctx))
#define UNEXPORTED __attribute__((__visibility__("hidden")))
#define CTX_LOCK(ctx) pthread_mutex_lock(&(ctx)->ctx_lock)
#define CTX_TRYLOCK(ctx) pthread_mutex_trylock(&(ctx)->ctx_lock)
#define CTX_UNLOCK(ctx) pthread_mutex_unlock(&(ctx)->ctx_lock)
#define HOTPLUG_LOCK(ctx) pthread_mutex_lock(&(ctx)->hotplug_lock)
#define HOTPLUG_UNLOCK(ctx) pthread_mutex_unlock(&(ctx)->hotplug_lock)
#define DPRINTF(ctx, dbg, format, ...) do { \
switch (dbg) { \
case LIBUSB_DEBUG_FUNCTION: \
if ((ctx)->debug & LIBUSB_DEBUG_FUNCTION) { \
printf("LIBUSB_FUNCTION: " \
format "\n", ## __VA_ARGS__); \
} \
break; \
case LIBUSB_DEBUG_TRANSFER: \
if ((ctx)->debug & LIBUSB_DEBUG_TRANSFER) { \
printf("LIBUSB_TRANSFER: " \
format "\n", ## __VA_ARGS__); \
} \
break; \
default: \
break; \
} \
} while (0)
/* internal structures */
struct libusb_super_pollfd {
TAILQ_ENTRY(libusb_super_pollfd) entry;
struct libusb20_device *pdev;
struct libusb_pollfd pollfd;
};
struct libusb_super_transfer {
TAILQ_ENTRY(libusb_super_transfer) entry;
uint8_t *curr_data;
uint32_t rem_len;
uint32_t last_len;
uint32_t stream_id;
uint8_t state;
#define LIBUSB_SUPER_XFER_ST_NONE 0
#define LIBUSB_SUPER_XFER_ST_PEND 1
};
struct libusb_hotplug_callback_handle_struct {
TAILQ_ENTRY(libusb_hotplug_callback_handle_struct) entry;
int events;
int vendor;
int product;
int devclass;
libusb_hotplug_callback_fn fn;
void *user_data;
};
TAILQ_HEAD(libusb_device_head, libusb_device);
struct libusb_context {
int debug;
int debug_fixed;
int ctrl_pipe[2];
int tr_done_ref;
int tr_done_gen;
pthread_mutex_t ctx_lock;
pthread_mutex_t hotplug_lock;
pthread_cond_t ctx_cond;
pthread_t hotplug_handler;
pthread_t ctx_handler;
#define NO_THREAD ((pthread_t)-1)
TAILQ_HEAD(, libusb_super_pollfd) pollfds;
TAILQ_HEAD(, libusb_super_transfer) tr_done;
TAILQ_HEAD(, libusb_hotplug_callback_handle_struct) hotplug_cbh;
struct libusb_device_head hotplug_devs;
struct libusb_super_pollfd ctx_poll;
libusb_pollfd_added_cb fd_added_cb;
libusb_pollfd_removed_cb fd_removed_cb;
void *fd_cb_user_data;
};
struct libusb_device {
int refcnt;
int device_is_gone;
uint32_t claimed_interfaces;
struct libusb_super_pollfd dev_poll;
struct libusb_context *ctx;
TAILQ_ENTRY(libusb_device) hotplug_entry;
TAILQ_HEAD(, libusb_super_transfer) tr_head;
struct libusb20_device *os_priv;
};
extern struct libusb_context *usbi_default_context;
void libusb10_add_pollfd(libusb_context *ctx, struct libusb_super_pollfd *pollfd, struct libusb20_device *pdev, int fd, short events);
void libusb10_remove_pollfd(libusb_context *ctx, struct libusb_super_pollfd *pollfd);
void libusb10_cancel_all_transfer(libusb_device *dev);
void libusb10_cancel_all_transfer_locked(struct libusb20_device *pdev, struct libusb_device *dev);
#endif /* __LIBUSB10_H__ */
diff --git a/lib/libusb/libusb10_desc.c b/lib/libusb/libusb10_desc.c
index f73d9756685b..3e36009cbb3a 100644
--- a/lib/libusb/libusb10_desc.c
+++ b/lib/libusb/libusb10_desc.c
@@ -1,716 +1,715 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Sylvestre Gallon. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <sys/queue.h>
#endif
#define libusb_device_handle libusb20_device
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
#include "libusb.h"
#include "libusb10.h"
#define N_ALIGN(n) (-((-(n)) & (-8UL)))
/* USB descriptors */
int
libusb_get_device_descriptor(libusb_device *dev,
struct libusb_device_descriptor *desc)
{
struct LIBUSB20_DEVICE_DESC_DECODED *pdesc;
struct libusb20_device *pdev;
if ((dev == NULL) || (desc == NULL))
return (LIBUSB_ERROR_INVALID_PARAM);
pdev = dev->os_priv;
pdesc = libusb20_dev_get_device_desc(pdev);
desc->bLength = pdesc->bLength;
desc->bDescriptorType = pdesc->bDescriptorType;
desc->bcdUSB = pdesc->bcdUSB;
desc->bDeviceClass = pdesc->bDeviceClass;
desc->bDeviceSubClass = pdesc->bDeviceSubClass;
desc->bDeviceProtocol = pdesc->bDeviceProtocol;
desc->bMaxPacketSize0 = pdesc->bMaxPacketSize0;
desc->idVendor = pdesc->idVendor;
desc->idProduct = pdesc->idProduct;
desc->bcdDevice = pdesc->bcdDevice;
desc->iManufacturer = pdesc->iManufacturer;
desc->iProduct = pdesc->iProduct;
desc->iSerialNumber = pdesc->iSerialNumber;
desc->bNumConfigurations = pdesc->bNumConfigurations;
return (0);
}
int
libusb_get_active_config_descriptor(libusb_device *dev,
struct libusb_config_descriptor **config)
{
struct libusb20_device *pdev;
uint8_t config_index;
pdev = dev->os_priv;
config_index = libusb20_dev_get_config_index(pdev);
return (libusb_get_config_descriptor(dev, config_index, config));
}
int
libusb_get_config_descriptor(libusb_device *dev, uint8_t config_index,
struct libusb_config_descriptor **config)
{
struct libusb20_device *pdev;
struct libusb20_config *pconf;
struct libusb20_interface *pinf;
struct libusb20_endpoint *pend;
struct libusb_config_descriptor *pconfd;
struct libusb_interface_descriptor *ifd;
struct libusb_endpoint_descriptor *endd;
uint8_t *pextra;
uint16_t nextra;
uint8_t nif;
uint8_t nep;
uint8_t nalt;
uint8_t i;
uint8_t j;
uint8_t k;
if (dev == NULL || config == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
*config = NULL;
pdev = dev->os_priv;
pconf = libusb20_dev_alloc_config(pdev, config_index);
if (pconf == NULL)
return (LIBUSB_ERROR_NOT_FOUND);
nalt = nif = pconf->num_interface;
nep = 0;
nextra = N_ALIGN(pconf->extra.len);
for (i = 0; i < nif; i++) {
pinf = pconf->interface + i;
nextra += N_ALIGN(pinf->extra.len);
nep += pinf->num_endpoints;
k = pinf->num_endpoints;
pend = pinf->endpoints;
while (k--) {
nextra += N_ALIGN(pend->extra.len);
pend++;
}
j = pinf->num_altsetting;
nalt += pinf->num_altsetting;
pinf = pinf->altsetting;
while (j--) {
nextra += N_ALIGN(pinf->extra.len);
nep += pinf->num_endpoints;
k = pinf->num_endpoints;
pend = pinf->endpoints;
while (k--) {
nextra += N_ALIGN(pend->extra.len);
pend++;
}
pinf++;
}
}
nextra = nextra +
(1 * sizeof(libusb_config_descriptor)) +
(nif * sizeof(libusb_interface)) +
(nalt * sizeof(libusb_interface_descriptor)) +
(nep * sizeof(libusb_endpoint_descriptor));
nextra = N_ALIGN(nextra);
pconfd = malloc(nextra);
if (pconfd == NULL) {
free(pconf);
return (LIBUSB_ERROR_NO_MEM);
}
/* make sure memory is initialised */
memset(pconfd, 0, nextra);
pconfd->interface = (libusb_interface *) (pconfd + 1);
ifd = (libusb_interface_descriptor *) (pconfd->interface + nif);
endd = (libusb_endpoint_descriptor *) (ifd + nalt);
pextra = (uint8_t *)(endd + nep);
/* fill in config descriptor */
pconfd->bLength = pconf->desc.bLength;
pconfd->bDescriptorType = pconf->desc.bDescriptorType;
pconfd->wTotalLength = pconf->desc.wTotalLength;
pconfd->bNumInterfaces = pconf->desc.bNumInterfaces;
pconfd->bConfigurationValue = pconf->desc.bConfigurationValue;
pconfd->iConfiguration = pconf->desc.iConfiguration;
pconfd->bmAttributes = pconf->desc.bmAttributes;
pconfd->MaxPower = pconf->desc.bMaxPower;
if (pconf->extra.len != 0) {
pconfd->extra_length = pconf->extra.len;
pconfd->extra = pextra;
memcpy(pextra, pconf->extra.ptr, pconfd->extra_length);
pextra += N_ALIGN(pconfd->extra_length);
}
/* setup all interface and endpoint pointers */
for (i = 0; i < nif; i++) {
pconfd->interface[i].altsetting = ifd;
ifd->endpoint = endd;
endd += pconf->interface[i].num_endpoints;
ifd++;
for (j = 0; j < pconf->interface[i].num_altsetting; j++) {
ifd->endpoint = endd;
endd += pconf->interface[i].altsetting[j].num_endpoints;
ifd++;
}
}
/* fill in all interface and endpoint data */
for (i = 0; i < nif; i++) {
pinf = &pconf->interface[i];
pconfd->interface[i].num_altsetting = pinf->num_altsetting + 1;
for (j = 0; j < pconfd->interface[i].num_altsetting; j++) {
if (j != 0)
pinf = &pconf->interface[i].altsetting[j - 1];
ifd = &pconfd->interface[i].altsetting[j];
ifd->bLength = pinf->desc.bLength;
ifd->bDescriptorType = pinf->desc.bDescriptorType;
ifd->bInterfaceNumber = pinf->desc.bInterfaceNumber;
ifd->bAlternateSetting = pinf->desc.bAlternateSetting;
ifd->bNumEndpoints = pinf->desc.bNumEndpoints;
ifd->bInterfaceClass = pinf->desc.bInterfaceClass;
ifd->bInterfaceSubClass = pinf->desc.bInterfaceSubClass;
ifd->bInterfaceProtocol = pinf->desc.bInterfaceProtocol;
ifd->iInterface = pinf->desc.iInterface;
if (pinf->extra.len != 0) {
ifd->extra_length = pinf->extra.len;
ifd->extra = pextra;
memcpy(pextra, pinf->extra.ptr, pinf->extra.len);
pextra += N_ALIGN(pinf->extra.len);
}
for (k = 0; k < pinf->num_endpoints; k++) {
pend = &pinf->endpoints[k];
endd = &ifd->endpoint[k];
endd->bLength = pend->desc.bLength;
endd->bDescriptorType = pend->desc.bDescriptorType;
endd->bEndpointAddress = pend->desc.bEndpointAddress;
endd->bmAttributes = pend->desc.bmAttributes;
endd->wMaxPacketSize = pend->desc.wMaxPacketSize;
endd->bInterval = pend->desc.bInterval;
endd->bRefresh = pend->desc.bRefresh;
endd->bSynchAddress = pend->desc.bSynchAddress;
if (pend->extra.len != 0) {
endd->extra_length = pend->extra.len;
endd->extra = pextra;
memcpy(pextra, pend->extra.ptr, pend->extra.len);
pextra += N_ALIGN(pend->extra.len);
}
}
}
}
free(pconf);
*config = pconfd;
return (0); /* success */
}
int
libusb_get_config_descriptor_by_value(libusb_device *dev,
uint8_t bConfigurationValue, struct libusb_config_descriptor **config)
{
struct LIBUSB20_DEVICE_DESC_DECODED *pdesc;
struct libusb20_device *pdev;
int i;
int err;
if (dev == NULL || config == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
pdev = dev->os_priv;
pdesc = libusb20_dev_get_device_desc(pdev);
for (i = 0; i < pdesc->bNumConfigurations; i++) {
err = libusb_get_config_descriptor(dev, i, config);
if (err)
return (err);
if ((*config)->bConfigurationValue == bConfigurationValue)
return (0); /* success */
libusb_free_config_descriptor(*config);
}
*config = NULL;
return (LIBUSB_ERROR_NOT_FOUND);
}
void
libusb_free_config_descriptor(struct libusb_config_descriptor *config)
{
free(config);
}
int
libusb_get_string_descriptor(libusb_device_handle *pdev,
uint8_t desc_index, uint16_t langid, unsigned char *data,
int length)
{
if (pdev == NULL || data == NULL || length < 1)
return (LIBUSB_ERROR_INVALID_PARAM);
if (length > 65535)
length = 65535;
/* put some default data into the destination buffer */
data[0] = 0;
return (libusb_control_transfer(pdev, LIBUSB_ENDPOINT_IN,
LIBUSB_REQUEST_GET_DESCRIPTOR, (LIBUSB_DT_STRING << 8) | desc_index,
langid, data, length, 1000));
}
int
libusb_get_string_descriptor_ascii(libusb_device_handle *pdev,
uint8_t desc_index, unsigned char *data, int length)
{
if (pdev == NULL || data == NULL || length < 1)
return (LIBUSB_ERROR_INVALID_PARAM);
if (length > 65535)
length = 65535;
/* put some default data into the destination buffer */
data[0] = 0;
if (libusb20_dev_req_string_simple_sync(pdev, desc_index,
data, length) == 0)
return (strlen((char *)data));
return (LIBUSB_ERROR_OTHER);
}
int
libusb_get_descriptor(libusb_device_handle * devh, uint8_t desc_type,
uint8_t desc_index, uint8_t *data, int length)
{
if (devh == NULL || data == NULL || length < 1)
return (LIBUSB_ERROR_INVALID_PARAM);
if (length > 65535)
length = 65535;
return (libusb_control_transfer(devh, LIBUSB_ENDPOINT_IN,
LIBUSB_REQUEST_GET_DESCRIPTOR, (desc_type << 8) | desc_index, 0, data,
length, 1000));
}
int
libusb_parse_ss_endpoint_comp(const void *buf, int len,
struct libusb_ss_endpoint_companion_descriptor **ep_comp)
{
if (buf == NULL || ep_comp == NULL || len < 1)
return (LIBUSB_ERROR_INVALID_PARAM);
if (len > 65535)
len = 65535;
*ep_comp = NULL;
while (len != 0) {
uint8_t dlen;
uint8_t dtype;
dlen = ((const uint8_t *)buf)[0];
dtype = ((const uint8_t *)buf)[1];
if (dlen < 2 || dlen > len)
break;
if (dlen >= LIBUSB_DT_SS_ENDPOINT_COMPANION_SIZE &&
dtype == LIBUSB_DT_SS_ENDPOINT_COMPANION) {
struct libusb_ss_endpoint_companion_descriptor *ptr;
ptr = malloc(sizeof(*ptr));
if (ptr == NULL)
return (LIBUSB_ERROR_NO_MEM);
ptr->bLength = LIBUSB_DT_SS_ENDPOINT_COMPANION_SIZE;
ptr->bDescriptorType = dtype;
ptr->bMaxBurst = ((const uint8_t *)buf)[2];
ptr->bmAttributes = ((const uint8_t *)buf)[3];
ptr->wBytesPerInterval = ((const uint8_t *)buf)[4] |
(((const uint8_t *)buf)[5] << 8);
*ep_comp = ptr;
return (0); /* success */
}
buf = ((const uint8_t *)buf) + dlen;
len -= dlen;
}
return (LIBUSB_ERROR_IO);
}
void
libusb_free_ss_endpoint_comp(struct libusb_ss_endpoint_companion_descriptor *ep_comp)
{
if (ep_comp == NULL)
return;
free(ep_comp);
}
int
libusb_get_ss_endpoint_companion_descriptor(struct libusb_context *ctx,
const struct libusb_endpoint_descriptor *endpoint,
struct libusb_ss_endpoint_companion_descriptor **ep_comp)
{
if (endpoint == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
return (libusb_parse_ss_endpoint_comp(endpoint->extra, endpoint->extra_length, ep_comp));
}
void
libusb_free_ss_endpoint_companion_descriptor(struct libusb_ss_endpoint_companion_descriptor *ep_comp)
{
libusb_free_ss_endpoint_comp(ep_comp);
}
int
libusb_parse_bos_descriptor(const void *buf, int len,
struct libusb_bos_descriptor **bos)
{
struct libusb_bos_descriptor *ptr;
struct libusb_usb_2_0_device_capability_descriptor *dcap_20 = NULL;
struct libusb_ss_usb_device_capability_descriptor *ss_cap = NULL;
uint8_t index = 0;
if (buf == NULL || bos == NULL || len < 1)
return (LIBUSB_ERROR_INVALID_PARAM);
if (len > 65535)
len = 65535;
*bos = ptr = NULL;
while (len != 0) {
uint8_t dlen;
uint8_t dtype;
dlen = ((const uint8_t *)buf)[0];
dtype = ((const uint8_t *)buf)[1];
if (dlen < 2 || dlen > len)
break;
if (dlen >= LIBUSB_DT_BOS_SIZE &&
dtype == LIBUSB_DT_BOS &&
ptr == NULL) {
ptr = malloc(sizeof(*ptr) + sizeof(*dcap_20) +
sizeof(*ss_cap));
if (ptr == NULL)
return (LIBUSB_ERROR_NO_MEM);
*bos = ptr;
ptr->bLength = LIBUSB_DT_BOS_SIZE;
ptr->bDescriptorType = dtype;
ptr->wTotalLength = ((const uint8_t *)buf)[2] |
(((const uint8_t *)buf)[3] << 8);
ptr->bNumDeviceCapabilities = ((const uint8_t *)buf)[4];
ptr->usb_2_0_ext_cap = NULL;
ptr->ss_usb_cap = NULL;
ptr->dev_capability = calloc(ptr->bNumDeviceCapabilities, sizeof(void *));
if (ptr->dev_capability == NULL) {
free(ptr);
return (LIBUSB_ERROR_NO_MEM);
}
dcap_20 = (void *)(ptr + 1);
ss_cap = (void *)(dcap_20 + 1);
}
if (dlen >= 3 &&
ptr != NULL &&
dtype == LIBUSB_DT_DEVICE_CAPABILITY) {
if (index != ptr->bNumDeviceCapabilities) {
ptr->dev_capability[index] = malloc(dlen);
if (ptr->dev_capability[index] == NULL) {
libusb_free_bos_descriptor(ptr);
return LIBUSB_ERROR_NO_MEM;
}
memcpy(ptr->dev_capability[index], buf, dlen);
index++;
}
switch (((const uint8_t *)buf)[2]) {
case LIBUSB_USB_2_0_EXTENSION_DEVICE_CAPABILITY:
if (ptr->usb_2_0_ext_cap != NULL || dcap_20 == NULL)
break;
if (dlen < LIBUSB_USB_2_0_EXTENSION_DEVICE_CAPABILITY_SIZE)
break;
ptr->usb_2_0_ext_cap = dcap_20;
dcap_20->bLength = LIBUSB_USB_2_0_EXTENSION_DEVICE_CAPABILITY_SIZE;
dcap_20->bDescriptorType = dtype;
dcap_20->bDevCapabilityType = ((const uint8_t *)buf)[2];
dcap_20->bmAttributes = ((const uint8_t *)buf)[3] |
(((const uint8_t *)buf)[4] << 8) |
(((const uint8_t *)buf)[5] << 16) |
(((const uint8_t *)buf)[6] << 24);
break;
case LIBUSB_SS_USB_DEVICE_CAPABILITY:
if (ptr->ss_usb_cap != NULL || ss_cap == NULL)
break;
if (dlen < LIBUSB_SS_USB_DEVICE_CAPABILITY_SIZE)
break;
ptr->ss_usb_cap = ss_cap;
ss_cap->bLength = LIBUSB_SS_USB_DEVICE_CAPABILITY_SIZE;
ss_cap->bDescriptorType = dtype;
ss_cap->bDevCapabilityType = ((const uint8_t *)buf)[2];
ss_cap->bmAttributes = ((const uint8_t *)buf)[3];
ss_cap->wSpeedSupported = ((const uint8_t *)buf)[4] |
(((const uint8_t *)buf)[5] << 8);
ss_cap->bFunctionalitySupport = ((const uint8_t *)buf)[6];
ss_cap->bU1DevExitLat = ((const uint8_t *)buf)[7];
ss_cap->wU2DevExitLat = ((const uint8_t *)buf)[8] |
(((const uint8_t *)buf)[9] << 8);
break;
default:
break;
}
}
buf = ((const uint8_t *)buf) + dlen;
len -= dlen;
}
if (ptr != NULL) {
ptr->bNumDeviceCapabilities = index;
return (0); /* success */
}
return (LIBUSB_ERROR_IO);
}
void
libusb_free_bos_descriptor(struct libusb_bos_descriptor *bos)
{
uint8_t i;
if (bos == NULL)
return;
for (i = 0; i != bos->bNumDeviceCapabilities; i++)
free(bos->dev_capability[i]);
free(bos->dev_capability);
free(bos);
}
int
libusb_get_bos_descriptor(libusb_device_handle *handle,
struct libusb_bos_descriptor **bos)
{
uint8_t bos_header[LIBUSB_DT_BOS_SIZE] = {0};
uint16_t wTotalLength;
uint8_t *bos_data;
int err;
err = libusb_get_descriptor(handle, LIBUSB_DT_BOS, 0,
bos_header, sizeof(bos_header));
if (err < 0)
return (err);
wTotalLength = bos_header[2] | (bos_header[3] << 8);
if (wTotalLength < LIBUSB_DT_BOS_SIZE)
return (LIBUSB_ERROR_INVALID_PARAM);
bos_data = calloc(wTotalLength, 1);
if (bos_data == NULL)
return (LIBUSB_ERROR_NO_MEM);
err = libusb_get_descriptor(handle, LIBUSB_DT_BOS, 0,
bos_data, wTotalLength);
if (err < 0)
goto done;
/* avoid descriptor length mismatches */
bos_data[2] = (wTotalLength & 0xFF);
bos_data[3] = (wTotalLength >> 8);
err = libusb_parse_bos_descriptor(bos_data, wTotalLength, bos);
done:
free(bos_data);
return (err);
}
int
libusb_get_usb_2_0_extension_descriptor(struct libusb_context *ctx,
struct libusb_bos_dev_capability_descriptor *dev_cap,
struct libusb_usb_2_0_extension_descriptor **usb_2_0_extension)
{
struct libusb_usb_2_0_extension_descriptor *desc;
if (dev_cap == NULL || usb_2_0_extension == NULL ||
dev_cap->bDevCapabilityType != LIBUSB_BT_USB_2_0_EXTENSION)
return (LIBUSB_ERROR_INVALID_PARAM);
if (dev_cap->bLength < LIBUSB_BT_USB_2_0_EXTENSION_SIZE)
return (LIBUSB_ERROR_IO);
desc = malloc(sizeof(*desc));
if (desc == NULL)
return (LIBUSB_ERROR_NO_MEM);
desc->bLength = LIBUSB_BT_USB_2_0_EXTENSION_SIZE;
desc->bDescriptorType = dev_cap->bDescriptorType;
desc->bDevCapabilityType = dev_cap->bDevCapabilityType;
desc->bmAttributes =
(dev_cap->dev_capability_data[0]) |
(dev_cap->dev_capability_data[1] << 8) |
(dev_cap->dev_capability_data[2] << 16) |
(dev_cap->dev_capability_data[3] << 24);
*usb_2_0_extension = desc;
return (0);
}
void
libusb_free_usb_2_0_extension_descriptor(
struct libusb_usb_2_0_extension_descriptor *usb_2_0_extension)
{
free(usb_2_0_extension);
}
int
libusb_get_ss_usb_device_capability_descriptor(struct libusb_context *ctx,
struct libusb_bos_dev_capability_descriptor *dev_cap,
struct libusb_ss_usb_device_capability_descriptor **ss_usb_device_capability)
{
struct libusb_ss_usb_device_capability_descriptor *desc;
if (dev_cap == NULL || ss_usb_device_capability == NULL ||
dev_cap->bDevCapabilityType != LIBUSB_BT_SS_USB_DEVICE_CAPABILITY)
return (LIBUSB_ERROR_INVALID_PARAM);
if (dev_cap->bLength < LIBUSB_BT_SS_USB_DEVICE_CAPABILITY_SIZE)
return (LIBUSB_ERROR_IO);
desc = malloc(sizeof(*desc));
if (desc == NULL)
return (LIBUSB_ERROR_NO_MEM);
desc->bLength = LIBUSB_BT_SS_USB_DEVICE_CAPABILITY_SIZE;
desc->bDescriptorType = dev_cap->bDescriptorType;
desc->bDevCapabilityType = dev_cap->bDevCapabilityType;
desc->bmAttributes = dev_cap->dev_capability_data[0];
desc->wSpeedSupported = dev_cap->dev_capability_data[1] |
(dev_cap->dev_capability_data[2] << 8);
desc->bFunctionalitySupport = dev_cap->dev_capability_data[3];
desc->bU1DevExitLat = dev_cap->dev_capability_data[4];
desc->wU2DevExitLat = dev_cap->dev_capability_data[5] |
(dev_cap->dev_capability_data[6] << 8);
*ss_usb_device_capability = desc;
return (0);
}
void
libusb_free_ss_usb_device_capability_descriptor(
struct libusb_ss_usb_device_capability_descriptor *ss_usb_device_capability)
{
free(ss_usb_device_capability);
}
int
libusb_get_container_id_descriptor(struct libusb_context *ctx,
struct libusb_bos_dev_capability_descriptor *dev_cap,
struct libusb_container_id_descriptor **container_id)
{
struct libusb_container_id_descriptor *desc;
if (dev_cap == NULL || container_id == NULL ||
dev_cap->bDevCapabilityType != LIBUSB_BT_CONTAINER_ID)
return (LIBUSB_ERROR_INVALID_PARAM);
if (dev_cap->bLength < LIBUSB_BT_CONTAINER_ID_SIZE)
return (LIBUSB_ERROR_IO);
desc = malloc(sizeof(*desc));
if (desc == NULL)
return (LIBUSB_ERROR_NO_MEM);
desc->bLength = LIBUSB_BT_CONTAINER_ID_SIZE;
desc->bDescriptorType = dev_cap->bDescriptorType;
desc->bDevCapabilityType = dev_cap->bDevCapabilityType;
desc->bReserved = dev_cap->dev_capability_data[0];
memcpy(desc->ContainerID, dev_cap->dev_capability_data + 1,
sizeof(desc->ContainerID));
*container_id = desc;
return (0);
}
void
libusb_free_container_id_descriptor(
struct libusb_container_id_descriptor *container_id)
{
free(container_id);
}
diff --git a/lib/libusb/libusb10_hotplug.c b/lib/libusb/libusb10_hotplug.c
index fb1c3d59e51f..9d00b1dbe5a0 100644
--- a/lib/libusb/libusb10_hotplug.c
+++ b/lib/libusb/libusb10_hotplug.c
@@ -1,250 +1,249 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2016-2019 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <assert.h>
#include <errno.h>
#include <poll.h>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <sys/fcntl.h>
#include <sys/ioctl.h>
#include <sys/queue.h>
#include <sys/endian.h>
#endif
#define libusb_device_handle libusb20_device
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
#include "libusb.h"
#include "libusb10.h"
static int
libusb_hotplug_equal(libusb_device *_adev, libusb_device *_bdev)
{
struct libusb20_device *adev = _adev->os_priv;
struct libusb20_device *bdev = _bdev->os_priv;
if (adev->bus_number != bdev->bus_number)
return (0);
if (adev->device_address != bdev->device_address)
return (0);
if (memcmp(&adev->ddesc, &bdev->ddesc, sizeof(adev->ddesc)))
return (0);
if (memcmp(&adev->session_data, &bdev->session_data, sizeof(adev->session_data)))
return (0);
return (1);
}
static int
libusb_hotplug_filter(libusb_context *ctx, libusb_hotplug_callback_handle pcbh,
libusb_device *dev, libusb_hotplug_event event)
{
if (!(pcbh->events & event))
return (0);
if (pcbh->vendor != LIBUSB_HOTPLUG_MATCH_ANY &&
pcbh->vendor != libusb20_dev_get_device_desc(dev->os_priv)->idVendor)
return (0);
if (pcbh->product != LIBUSB_HOTPLUG_MATCH_ANY &&
pcbh->product != libusb20_dev_get_device_desc(dev->os_priv)->idProduct)
return (0);
if (pcbh->devclass != LIBUSB_HOTPLUG_MATCH_ANY &&
pcbh->devclass != libusb20_dev_get_device_desc(dev->os_priv)->bDeviceClass)
return (0);
return (pcbh->fn(ctx, dev, event, pcbh->user_data));
}
static int
libusb_hotplug_enumerate(libusb_context *ctx, struct libusb_device_head *phead)
{
libusb_device **ppdev;
ssize_t count;
ssize_t x;
count = libusb_get_device_list(ctx, &ppdev);
if (count < 0)
return (-1);
for (x = 0; x != count; x++)
TAILQ_INSERT_TAIL(phead, ppdev[x], hotplug_entry);
libusb_free_device_list(ppdev, 0);
return (0);
}
static void *
libusb_hotplug_scan(void *arg)
{
struct libusb_device_head hotplug_devs;
libusb_hotplug_callback_handle acbh;
libusb_hotplug_callback_handle bcbh;
libusb_context *ctx = arg;
libusb_device *temp;
libusb_device *adev;
libusb_device *bdev;
unsigned do_loop = 1;
while (do_loop) {
usleep(4000000);
HOTPLUG_LOCK(ctx);
TAILQ_INIT(&hotplug_devs);
if (ctx->hotplug_handler != NO_THREAD) {
if (libusb_hotplug_enumerate(ctx, &hotplug_devs) < 0) {
HOTPLUG_UNLOCK(ctx);
continue;
}
} else {
do_loop = 0;
}
/* figure out which devices are gone */
TAILQ_FOREACH_SAFE(adev, &ctx->hotplug_devs, hotplug_entry, temp) {
TAILQ_FOREACH(bdev, &hotplug_devs, hotplug_entry) {
if (libusb_hotplug_equal(adev, bdev))
break;
}
if (bdev == NULL) {
TAILQ_REMOVE(&ctx->hotplug_devs, adev, hotplug_entry);
TAILQ_FOREACH_SAFE(acbh, &ctx->hotplug_cbh, entry, bcbh) {
if (libusb_hotplug_filter(ctx, acbh, adev,
LIBUSB_HOTPLUG_EVENT_DEVICE_LEFT) == 0)
continue;
TAILQ_REMOVE(&ctx->hotplug_cbh, acbh, entry);
free(acbh);
}
libusb_unref_device(adev);
}
}
/* figure out which devices are new */
TAILQ_FOREACH_SAFE(adev, &hotplug_devs, hotplug_entry, temp) {
TAILQ_FOREACH(bdev, &ctx->hotplug_devs, hotplug_entry) {
if (libusb_hotplug_equal(adev, bdev))
break;
}
if (bdev == NULL) {
TAILQ_REMOVE(&hotplug_devs, adev, hotplug_entry);
TAILQ_INSERT_TAIL(&ctx->hotplug_devs, adev, hotplug_entry);
TAILQ_FOREACH_SAFE(acbh, &ctx->hotplug_cbh, entry, bcbh) {
if (libusb_hotplug_filter(ctx, acbh, adev,
LIBUSB_HOTPLUG_EVENT_DEVICE_ARRIVED) == 0)
continue;
TAILQ_REMOVE(&ctx->hotplug_cbh, acbh, entry);
free(acbh);
}
}
}
HOTPLUG_UNLOCK(ctx);
/* unref remaining devices */
while ((adev = TAILQ_FIRST(&hotplug_devs)) != NULL) {
TAILQ_REMOVE(&hotplug_devs, adev, hotplug_entry);
libusb_unref_device(adev);
}
}
return (NULL);
}
int libusb_hotplug_register_callback(libusb_context *ctx,
libusb_hotplug_event events, libusb_hotplug_flag flags,
int vendor_id, int product_id, int dev_class,
libusb_hotplug_callback_fn cb_fn, void *user_data,
libusb_hotplug_callback_handle *phandle)
{
libusb_hotplug_callback_handle handle;
struct libusb_device *adev;
ctx = GET_CONTEXT(ctx);
if (ctx == NULL || cb_fn == NULL || events == 0 ||
vendor_id < -1 || vendor_id > 0xffff ||
product_id < -1 || product_id > 0xffff ||
dev_class < -1 || dev_class > 0xff)
return (LIBUSB_ERROR_INVALID_PARAM);
handle = malloc(sizeof(*handle));
if (handle == NULL)
return (LIBUSB_ERROR_NO_MEM);
HOTPLUG_LOCK(ctx);
if (ctx->hotplug_handler == NO_THREAD) {
libusb_hotplug_enumerate(ctx, &ctx->hotplug_devs);
if (pthread_create(&ctx->hotplug_handler, NULL,
&libusb_hotplug_scan, ctx) != 0)
ctx->hotplug_handler = NO_THREAD;
}
handle->events = events;
handle->vendor = vendor_id;
handle->product = product_id;
handle->devclass = dev_class;
handle->fn = cb_fn;
handle->user_data = user_data;
if (flags & LIBUSB_HOTPLUG_ENUMERATE) {
TAILQ_FOREACH(adev, &ctx->hotplug_devs, hotplug_entry) {
if (libusb_hotplug_filter(ctx, handle, adev,
LIBUSB_HOTPLUG_EVENT_DEVICE_ARRIVED) == 0)
continue;
free(handle);
handle = NULL;
break;
}
}
if (handle != NULL)
TAILQ_INSERT_TAIL(&ctx->hotplug_cbh, handle, entry);
HOTPLUG_UNLOCK(ctx);
if (phandle != NULL)
*phandle = handle;
return (LIBUSB_SUCCESS);
}
void libusb_hotplug_deregister_callback(libusb_context *ctx,
libusb_hotplug_callback_handle handle)
{
ctx = GET_CONTEXT(ctx);
if (ctx == NULL || handle == NULL)
return;
HOTPLUG_LOCK(ctx);
TAILQ_REMOVE(&ctx->hotplug_cbh, handle, entry);
HOTPLUG_UNLOCK(ctx);
free(handle);
}
diff --git a/lib/libusb/libusb10_io.c b/lib/libusb/libusb10_io.c
index fff76475390e..59bac60c4672 100644
--- a/lib/libusb/libusb10_io.c
+++ b/lib/libusb/libusb10_io.c
@@ -1,845 +1,844 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Sylvestre Gallon. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <errno.h>
#include <poll.h>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include <sys/queue.h>
#include <sys/endian.h>
#endif
#define libusb_device_handle libusb20_device
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
#include "libusb.h"
#include "libusb10.h"
UNEXPORTED void
libusb10_add_pollfd(libusb_context *ctx, struct libusb_super_pollfd *pollfd,
struct libusb20_device *pdev, int fd, short events)
{
if (ctx == NULL)
return; /* invalid */
if (pollfd->entry.tqe_prev != NULL)
return; /* already queued */
if (fd < 0)
return; /* invalid */
pollfd->pdev = pdev;
pollfd->pollfd.fd = fd;
pollfd->pollfd.events = events;
CTX_LOCK(ctx);
TAILQ_INSERT_TAIL(&ctx->pollfds, pollfd, entry);
CTX_UNLOCK(ctx);
if (ctx->fd_added_cb)
ctx->fd_added_cb(fd, events, ctx->fd_cb_user_data);
}
UNEXPORTED void
libusb10_remove_pollfd(libusb_context *ctx, struct libusb_super_pollfd *pollfd)
{
if (ctx == NULL)
return; /* invalid */
if (pollfd->entry.tqe_prev == NULL)
return; /* already dequeued */
CTX_LOCK(ctx);
TAILQ_REMOVE(&ctx->pollfds, pollfd, entry);
pollfd->entry.tqe_prev = NULL;
CTX_UNLOCK(ctx);
if (ctx->fd_removed_cb)
ctx->fd_removed_cb(pollfd->pollfd.fd, ctx->fd_cb_user_data);
}
/* This function must be called locked */
static int
libusb10_handle_events_sub(struct libusb_context *ctx, struct timeval *tv)
{
struct libusb_device *dev;
struct libusb20_device **ppdev;
struct libusb_super_pollfd *pfd;
struct pollfd *fds;
struct libusb_super_transfer *sxfer;
struct libusb_transfer *uxfer;
nfds_t nfds;
int timeout;
int i;
int err;
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb10_handle_events_sub enter");
nfds = 0;
i = 0;
TAILQ_FOREACH(pfd, &ctx->pollfds, entry)
nfds++;
fds = alloca(sizeof(*fds) * nfds);
if (fds == NULL)
return (LIBUSB_ERROR_NO_MEM);
ppdev = alloca(sizeof(*ppdev) * nfds);
if (ppdev == NULL)
return (LIBUSB_ERROR_NO_MEM);
TAILQ_FOREACH(pfd, &ctx->pollfds, entry) {
fds[i].fd = pfd->pollfd.fd;
fds[i].events = pfd->pollfd.events;
fds[i].revents = 0;
ppdev[i] = pfd->pdev;
if (pfd->pdev != NULL)
libusb_get_device(pfd->pdev)->refcnt++;
i++;
}
if (tv == NULL)
timeout = -1;
else
timeout = (tv->tv_sec * 1000) + ((tv->tv_usec + 999) / 1000);
CTX_UNLOCK(ctx);
err = poll(fds, nfds, timeout);
CTX_LOCK(ctx);
if ((err == -1) && (errno == EINTR))
err = LIBUSB_ERROR_INTERRUPTED;
else if (err < 0)
err = LIBUSB_ERROR_IO;
if (err < 1) {
for (i = 0; i != (int)nfds; i++) {
if (ppdev[i] != NULL) {
CTX_UNLOCK(ctx);
libusb_unref_device(libusb_get_device(ppdev[i]));
CTX_LOCK(ctx);
}
}
goto do_done;
}
for (i = 0; i != (int)nfds; i++) {
if (ppdev[i] != NULL) {
dev = libusb_get_device(ppdev[i]);
if (fds[i].revents != 0) {
err = libusb20_dev_process(ppdev[i]);
if (err) {
/*
* When the device is opened
* set the "device_is_gone"
* flag. This prevents the
* client from submitting new
* USB transfers to a detached
* device.
*/
if (ppdev[i]->is_opened)
dev->device_is_gone = 1;
/* remove USB device from polling loop */
libusb10_remove_pollfd(dev->ctx, &dev->dev_poll);
/* cancel all pending transfers */
libusb10_cancel_all_transfer_locked(ppdev[i], dev);
}
}
CTX_UNLOCK(ctx);
libusb_unref_device(dev);
CTX_LOCK(ctx);
} else {
uint8_t dummy;
while (read(fds[i].fd, &dummy, 1) == 1)
;
}
}
err = 0;
do_done:
/* Do all done callbacks */
while ((sxfer = TAILQ_FIRST(&ctx->tr_done))) {
uint8_t flags;
TAILQ_REMOVE(&ctx->tr_done, sxfer, entry);
sxfer->entry.tqe_prev = NULL;
ctx->tr_done_ref++;
CTX_UNLOCK(ctx);
uxfer = (struct libusb_transfer *)(
((uint8_t *)sxfer) + sizeof(*sxfer));
/* Allow the callback to free the transfer itself. */
flags = uxfer->flags;
if (uxfer->callback != NULL)
(uxfer->callback) (uxfer);
/* Check if the USB transfer should be automatically freed. */
if (flags & LIBUSB_TRANSFER_FREE_TRANSFER)
libusb_free_transfer(uxfer);
CTX_LOCK(ctx);
ctx->tr_done_ref--;
ctx->tr_done_gen++;
}
/* Wakeup other waiters */
pthread_cond_broadcast(&ctx->ctx_cond);
return (err);
}
/* Polling and timing */
int
libusb_try_lock_events(libusb_context *ctx)
{
int err;
ctx = GET_CONTEXT(ctx);
if (ctx == NULL)
return (1);
err = CTX_TRYLOCK(ctx);
if (err)
return (1);
err = (ctx->ctx_handler != NO_THREAD);
if (err)
CTX_UNLOCK(ctx);
else
ctx->ctx_handler = pthread_self();
return (err);
}
void
libusb_lock_events(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
CTX_LOCK(ctx);
if (ctx->ctx_handler == NO_THREAD)
ctx->ctx_handler = pthread_self();
}
void
libusb_unlock_events(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
if (ctx->ctx_handler == pthread_self()) {
ctx->ctx_handler = NO_THREAD;
pthread_cond_broadcast(&ctx->ctx_cond);
}
CTX_UNLOCK(ctx);
}
int
libusb_event_handling_ok(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
return (ctx->ctx_handler == pthread_self());
}
int
libusb_event_handler_active(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
return (ctx->ctx_handler != NO_THREAD);
}
void
libusb_lock_event_waiters(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
CTX_LOCK(ctx);
}
void
libusb_unlock_event_waiters(libusb_context *ctx)
{
ctx = GET_CONTEXT(ctx);
CTX_UNLOCK(ctx);
}
int
libusb_wait_for_event(libusb_context *ctx, struct timeval *tv)
{
struct timespec ts;
int err;
ctx = GET_CONTEXT(ctx);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_wait_for_event enter");
if (tv == NULL) {
pthread_cond_wait(&ctx->ctx_cond,
&ctx->ctx_lock);
/* try to grab polling of actual events, if any */
if (ctx->ctx_handler == NO_THREAD)
ctx->ctx_handler = pthread_self();
return (0);
}
err = clock_gettime(CLOCK_MONOTONIC, &ts);
if (err < 0)
return (LIBUSB_ERROR_OTHER);
/*
* The "tv" arguments points to a relative time structure and
* not an absolute time structure.
*/
ts.tv_sec += tv->tv_sec;
ts.tv_nsec += tv->tv_usec * 1000;
if (ts.tv_nsec >= 1000000000) {
ts.tv_nsec -= 1000000000;
ts.tv_sec++;
}
err = pthread_cond_timedwait(&ctx->ctx_cond,
&ctx->ctx_lock, &ts);
/* try to grab polling of actual events, if any */
if (ctx->ctx_handler == NO_THREAD)
ctx->ctx_handler = pthread_self();
if (err == ETIMEDOUT)
return (1);
return (0);
}
int
libusb_handle_events_timeout_completed(libusb_context *ctx,
struct timeval *tv, int *completed)
{
int err = 0;
ctx = GET_CONTEXT(ctx);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_handle_events_timeout_completed enter");
libusb_lock_events(ctx);
while (1) {
if (completed != NULL) {
if (*completed != 0 || err != 0)
break;
}
err = libusb_handle_events_locked(ctx, tv);
if (completed == NULL)
break;
}
libusb_unlock_events(ctx);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_handle_events_timeout_completed exit");
return (err);
}
int
libusb_handle_events_completed(libusb_context *ctx, int *completed)
{
return (libusb_handle_events_timeout_completed(ctx, NULL, completed));
}
int
libusb_handle_events_timeout(libusb_context *ctx, struct timeval *tv)
{
return (libusb_handle_events_timeout_completed(ctx, tv, NULL));
}
int
libusb_handle_events(libusb_context *ctx)
{
return (libusb_handle_events_timeout_completed(ctx, NULL, NULL));
}
int
libusb_handle_events_locked(libusb_context *ctx, struct timeval *tv)
{
int err;
ctx = GET_CONTEXT(ctx);
if (libusb_event_handling_ok(ctx)) {
err = libusb10_handle_events_sub(ctx, tv);
} else {
err = libusb_wait_for_event(ctx, tv);
if (err != 0)
err = LIBUSB_ERROR_TIMEOUT;
}
return (err);
}
int
libusb_get_next_timeout(libusb_context *ctx, struct timeval *tv)
{
/* all timeouts are currently being done by the kernel */
timerclear(tv);
return (0);
}
void
libusb_set_pollfd_notifiers(libusb_context *ctx,
libusb_pollfd_added_cb added_cb, libusb_pollfd_removed_cb removed_cb,
void *user_data)
{
ctx = GET_CONTEXT(ctx);
ctx->fd_added_cb = added_cb;
ctx->fd_removed_cb = removed_cb;
ctx->fd_cb_user_data = user_data;
}
const struct libusb_pollfd **
libusb_get_pollfds(libusb_context *ctx)
{
struct libusb_super_pollfd *pollfd;
libusb_pollfd **ret;
int i;
ctx = GET_CONTEXT(ctx);
CTX_LOCK(ctx);
i = 0;
TAILQ_FOREACH(pollfd, &ctx->pollfds, entry)
i++;
ret = calloc(i + 1, sizeof(struct libusb_pollfd *));
if (ret == NULL)
goto done;
i = 0;
TAILQ_FOREACH(pollfd, &ctx->pollfds, entry)
ret[i++] = &pollfd->pollfd;
ret[i] = NULL;
done:
CTX_UNLOCK(ctx);
return ((const struct libusb_pollfd **)ret);
}
/* Synchronous device I/O */
int
libusb_control_transfer(libusb_device_handle *devh,
uint8_t bmRequestType, uint8_t bRequest, uint16_t wValue, uint16_t wIndex,
uint8_t *data, uint16_t wLength, unsigned int timeout)
{
struct LIBUSB20_CONTROL_SETUP_DECODED req;
int err;
uint16_t actlen;
if (devh == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if ((wLength != 0) && (data == NULL))
return (LIBUSB_ERROR_INVALID_PARAM);
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &req);
req.bmRequestType = bmRequestType;
req.bRequest = bRequest;
req.wValue = wValue;
req.wIndex = wIndex;
req.wLength = wLength;
err = libusb20_dev_request_sync(devh, &req, data,
&actlen, timeout, 0);
if (err == LIBUSB20_ERROR_PIPE)
return (LIBUSB_ERROR_PIPE);
else if (err == LIBUSB20_ERROR_TIMEOUT)
return (LIBUSB_ERROR_TIMEOUT);
else if (err)
return (LIBUSB_ERROR_NO_DEVICE);
return (actlen);
}
static libusb_context *
libusb10_get_context_by_device_handle(libusb_device_handle *devh)
{
libusb_context *ctx;
if (devh != NULL)
ctx = libusb_get_device(devh)->ctx;
else
ctx = NULL;
return (GET_CONTEXT(ctx));
}
static void
libusb10_do_transfer_cb(struct libusb_transfer *transfer)
{
libusb_context *ctx;
int *pdone;
ctx = libusb10_get_context_by_device_handle(transfer->dev_handle);
DPRINTF(ctx, LIBUSB_DEBUG_TRANSFER, "sync I/O done");
pdone = transfer->user_data;
*pdone = 1;
}
/*
* TODO: Replace the following function. Allocating and freeing on a
* per-transfer basis is slow. --HPS
*/
static int
libusb10_do_transfer(libusb_device_handle *devh,
uint8_t endpoint, uint8_t *data, int length,
int *transferred, unsigned int timeout, int type)
{
libusb_context *ctx;
struct libusb_transfer *xfer;
int done;
int ret;
if (devh == NULL)
return (LIBUSB_ERROR_INVALID_PARAM);
if ((length != 0) && (data == NULL))
return (LIBUSB_ERROR_INVALID_PARAM);
xfer = libusb_alloc_transfer(0);
if (xfer == NULL)
return (LIBUSB_ERROR_NO_MEM);
ctx = libusb_get_device(devh)->ctx;
xfer->dev_handle = devh;
xfer->endpoint = endpoint;
xfer->type = type;
xfer->timeout = timeout;
xfer->buffer = data;
xfer->length = length;
xfer->user_data = (void *)&done;
xfer->callback = libusb10_do_transfer_cb;
done = 0;
if ((ret = libusb_submit_transfer(xfer)) < 0) {
libusb_free_transfer(xfer);
return (ret);
}
while (done == 0) {
if ((ret = libusb_handle_events(ctx)) < 0) {
libusb_cancel_transfer(xfer);
usleep(1000); /* nice it */
}
}
*transferred = xfer->actual_length;
switch (xfer->status) {
case LIBUSB_TRANSFER_COMPLETED:
ret = 0;
break;
case LIBUSB_TRANSFER_TIMED_OUT:
ret = LIBUSB_ERROR_TIMEOUT;
break;
case LIBUSB_TRANSFER_OVERFLOW:
ret = LIBUSB_ERROR_OVERFLOW;
break;
case LIBUSB_TRANSFER_STALL:
ret = LIBUSB_ERROR_PIPE;
break;
case LIBUSB_TRANSFER_NO_DEVICE:
ret = LIBUSB_ERROR_NO_DEVICE;
break;
default:
ret = LIBUSB_ERROR_OTHER;
break;
}
libusb_free_transfer(xfer);
return (ret);
}
int
libusb_bulk_transfer(libusb_device_handle *devh,
uint8_t endpoint, uint8_t *data, int length,
int *transferred, unsigned int timeout)
{
libusb_context *ctx;
int ret;
ctx = libusb10_get_context_by_device_handle(devh);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_bulk_transfer enter");
ret = libusb10_do_transfer(devh, endpoint, data, length, transferred,
timeout, LIBUSB_TRANSFER_TYPE_BULK);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_bulk_transfer leave");
return (ret);
}
int
libusb_interrupt_transfer(libusb_device_handle *devh,
uint8_t endpoint, uint8_t *data, int length,
int *transferred, unsigned int timeout)
{
libusb_context *ctx;
int ret;
ctx = libusb10_get_context_by_device_handle(devh);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_interrupt_transfer enter");
ret = libusb10_do_transfer(devh, endpoint, data, length, transferred,
timeout, LIBUSB_TRANSFER_TYPE_INTERRUPT);
DPRINTF(ctx, LIBUSB_DEBUG_FUNCTION, "libusb_interrupt_transfer leave");
return (ret);
}
uint8_t *
libusb_get_iso_packet_buffer(struct libusb_transfer *transfer, uint32_t off)
{
uint8_t *ptr;
uint32_t n;
if (transfer->num_iso_packets < 0)
return (NULL);
if (off >= (uint32_t)transfer->num_iso_packets)
return (NULL);
ptr = transfer->buffer;
if (ptr == NULL)
return (NULL);
for (n = 0; n != off; n++) {
ptr += transfer->iso_packet_desc[n].length;
}
return (ptr);
}
uint8_t *
libusb_get_iso_packet_buffer_simple(struct libusb_transfer *transfer, uint32_t off)
{
uint8_t *ptr;
if (transfer->num_iso_packets < 0)
return (NULL);
if (off >= (uint32_t)transfer->num_iso_packets)
return (NULL);
ptr = transfer->buffer;
if (ptr == NULL)
return (NULL);
ptr += transfer->iso_packet_desc[0].length * off;
return (ptr);
}
void
libusb_set_iso_packet_lengths(struct libusb_transfer *transfer, uint32_t length)
{
int n;
if (transfer->num_iso_packets < 0)
return;
for (n = 0; n != transfer->num_iso_packets; n++)
transfer->iso_packet_desc[n].length = length;
}
uint8_t *
libusb_control_transfer_get_data(struct libusb_transfer *transfer)
{
if (transfer->buffer == NULL)
return (NULL);
return (transfer->buffer + LIBUSB_CONTROL_SETUP_SIZE);
}
struct libusb_control_setup *
libusb_control_transfer_get_setup(struct libusb_transfer *transfer)
{
return ((struct libusb_control_setup *)transfer->buffer);
}
void
libusb_fill_control_setup(uint8_t *buf, uint8_t bmRequestType,
uint8_t bRequest, uint16_t wValue,
uint16_t wIndex, uint16_t wLength)
{
struct libusb_control_setup *req = (struct libusb_control_setup *)buf;
/* The alignment is OK for all fields below. */
req->bmRequestType = bmRequestType;
req->bRequest = bRequest;
req->wValue = htole16(wValue);
req->wIndex = htole16(wIndex);
req->wLength = htole16(wLength);
}
void
libusb_fill_control_transfer(struct libusb_transfer *transfer,
libusb_device_handle *devh, uint8_t *buf,
libusb_transfer_cb_fn callback, void *user_data,
uint32_t timeout)
{
struct libusb_control_setup *setup = (struct libusb_control_setup *)buf;
transfer->dev_handle = devh;
transfer->endpoint = 0;
transfer->type = LIBUSB_TRANSFER_TYPE_CONTROL;
transfer->timeout = timeout;
transfer->buffer = buf;
if (setup != NULL)
transfer->length = LIBUSB_CONTROL_SETUP_SIZE
+ le16toh(setup->wLength);
else
transfer->length = 0;
transfer->user_data = user_data;
transfer->callback = callback;
}
void
libusb_fill_bulk_transfer(struct libusb_transfer *transfer,
libusb_device_handle *devh, uint8_t endpoint, uint8_t *buf,
int length, libusb_transfer_cb_fn callback, void *user_data,
uint32_t timeout)
{
transfer->dev_handle = devh;
transfer->endpoint = endpoint;
transfer->type = LIBUSB_TRANSFER_TYPE_BULK;
transfer->timeout = timeout;
transfer->buffer = buf;
transfer->length = length;
transfer->user_data = user_data;
transfer->callback = callback;
}
void
libusb_fill_interrupt_transfer(struct libusb_transfer *transfer,
libusb_device_handle *devh, uint8_t endpoint, uint8_t *buf,
int length, libusb_transfer_cb_fn callback, void *user_data,
uint32_t timeout)
{
transfer->dev_handle = devh;
transfer->endpoint = endpoint;
transfer->type = LIBUSB_TRANSFER_TYPE_INTERRUPT;
transfer->timeout = timeout;
transfer->buffer = buf;
transfer->length = length;
transfer->user_data = user_data;
transfer->callback = callback;
}
void
libusb_fill_iso_transfer(struct libusb_transfer *transfer,
libusb_device_handle *devh, uint8_t endpoint, uint8_t *buf,
int length, int npacket, libusb_transfer_cb_fn callback,
void *user_data, uint32_t timeout)
{
transfer->dev_handle = devh;
transfer->endpoint = endpoint;
transfer->type = LIBUSB_TRANSFER_TYPE_ISOCHRONOUS;
transfer->timeout = timeout;
transfer->buffer = buf;
transfer->length = length;
transfer->num_iso_packets = npacket;
transfer->user_data = user_data;
transfer->callback = callback;
}
int
libusb_alloc_streams(libusb_device_handle *dev, uint32_t num_streams,
unsigned char *endpoints, int num_endpoints)
{
if (num_streams > 1)
return (LIBUSB_ERROR_INVALID_PARAM);
return (0);
}
int
libusb_free_streams(libusb_device_handle *dev, unsigned char *endpoints, int num_endpoints)
{
return (0);
}
void
libusb_transfer_set_stream_id(struct libusb_transfer *transfer, uint32_t stream_id)
{
struct libusb_super_transfer *sxfer;
if (transfer == NULL)
return;
sxfer = (struct libusb_super_transfer *)(
((uint8_t *)transfer) - sizeof(*sxfer));
/* set stream ID */
sxfer->stream_id = stream_id;
}
uint32_t
libusb_transfer_get_stream_id(struct libusb_transfer *transfer)
{
struct libusb_super_transfer *sxfer;
if (transfer == NULL)
return (0);
sxfer = (struct libusb_super_transfer *)(
((uint8_t *)transfer) - sizeof(*sxfer));
/* get stream ID */
return (sxfer->stream_id);
}
diff --git a/lib/libusb/libusb20.c b/lib/libusb/libusb20.c
index 6527b1d17ea2..25c95adc27ff 100644
--- a/lib/libusb/libusb20.c
+++ b/lib/libusb/libusb20.c
@@ -1,1417 +1,1416 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008-2009 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <ctype.h>
#include <poll.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <sys/queue.h>
#endif
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
static int
dummy_int(void)
{
return (LIBUSB20_ERROR_NOT_SUPPORTED);
}
static void
dummy_void(void)
{
return;
}
static void
dummy_callback(struct libusb20_transfer *xfer)
{
; /* style fix */
switch (libusb20_tr_get_status(xfer)) {
case LIBUSB20_TRANSFER_START:
libusb20_tr_submit(xfer);
break;
default:
/* complete or error */
break;
}
return;
}
#define dummy_get_config_desc_full (void *)dummy_int
#define dummy_get_config_index (void *)dummy_int
#define dummy_set_config_index (void *)dummy_int
#define dummy_set_alt_index (void *)dummy_int
#define dummy_reset_device (void *)dummy_int
#define dummy_check_connected (void *)dummy_int
#define dummy_set_power_mode (void *)dummy_int
#define dummy_get_power_mode (void *)dummy_int
#define dummy_get_power_usage (void *)dummy_int
#define dummy_get_stats (void *)dummy_int
#define dummy_kernel_driver_active (void *)dummy_int
#define dummy_detach_kernel_driver (void *)dummy_int
#define dummy_do_request_sync (void *)dummy_int
#define dummy_tr_open (void *)dummy_int
#define dummy_tr_close (void *)dummy_int
#define dummy_tr_clear_stall_sync (void *)dummy_int
#define dummy_process (void *)dummy_int
#define dummy_dev_info (void *)dummy_int
#define dummy_dev_get_iface_driver (void *)dummy_int
#define dummy_tr_submit (void *)dummy_void
#define dummy_tr_cancel_async (void *)dummy_void
static const struct libusb20_device_methods libusb20_dummy_methods = {
LIBUSB20_DEVICE(LIBUSB20_DECLARE, dummy)
};
void
libusb20_tr_callback_wrapper(struct libusb20_transfer *xfer)
{
; /* style fix */
repeat:
if (!xfer->is_pending) {
xfer->status = LIBUSB20_TRANSFER_START;
} else {
xfer->is_pending = 0;
}
xfer->callback(xfer);
if (xfer->is_restart) {
xfer->is_restart = 0;
goto repeat;
}
if (xfer->is_draining &&
(!xfer->is_pending)) {
xfer->is_draining = 0;
xfer->status = LIBUSB20_TRANSFER_DRAINED;
xfer->callback(xfer);
}
return;
}
int
libusb20_tr_close(struct libusb20_transfer *xfer)
{
int error;
if (!xfer->is_opened) {
return (LIBUSB20_ERROR_OTHER);
}
error = xfer->pdev->methods->tr_close(xfer);
if (xfer->pLength) {
free(xfer->pLength);
}
if (xfer->ppBuffer) {
free(xfer->ppBuffer);
}
/* reset variable fields in case the transfer is opened again */
xfer->priv_sc0 = NULL;
xfer->priv_sc1 = NULL;
xfer->is_opened = 0;
xfer->is_pending = 0;
xfer->is_cancel = 0;
xfer->is_draining = 0;
xfer->is_restart = 0;
xfer->status = 0;
xfer->flags = 0;
xfer->nFrames = 0;
xfer->aFrames = 0;
xfer->timeout = 0;
xfer->maxFrames = 0;
xfer->maxTotalLength = 0;
xfer->maxPacketLen = 0;
return (error);
}
int
libusb20_tr_open(struct libusb20_transfer *xfer, uint32_t MaxBufSize,
uint32_t MaxFrameCount, uint8_t ep_no)
{
return (libusb20_tr_open_stream(xfer, MaxBufSize, MaxFrameCount, ep_no, 0));
}
int
libusb20_tr_open_stream(struct libusb20_transfer *xfer, uint32_t MaxBufSize,
uint32_t MaxFrameCount, uint8_t ep_no, uint16_t stream_id)
{
uint32_t size;
uint8_t pre_scale;
int error;
if (xfer->is_opened)
return (LIBUSB20_ERROR_BUSY);
if (MaxFrameCount & LIBUSB20_MAX_FRAME_PRE_SCALE) {
MaxFrameCount &= ~LIBUSB20_MAX_FRAME_PRE_SCALE;
/*
* The kernel can setup 8 times more frames when
* pre-scaling ISOCHRONOUS transfers. Make sure the
* length and pointer buffers are big enough:
*/
MaxFrameCount *= 8;
pre_scale = 1;
} else {
pre_scale = 0;
}
if (MaxFrameCount == 0)
return (LIBUSB20_ERROR_INVALID_PARAM);
xfer->maxFrames = MaxFrameCount;
size = MaxFrameCount * sizeof(xfer->pLength[0]);
xfer->pLength = malloc(size);
if (xfer->pLength == NULL) {
return (LIBUSB20_ERROR_NO_MEM);
}
memset(xfer->pLength, 0, size);
size = MaxFrameCount * sizeof(xfer->ppBuffer[0]);
xfer->ppBuffer = malloc(size);
if (xfer->ppBuffer == NULL) {
free(xfer->pLength);
return (LIBUSB20_ERROR_NO_MEM);
}
memset(xfer->ppBuffer, 0, size);
if (pre_scale) {
error = xfer->pdev->methods->tr_open(xfer, MaxBufSize,
MaxFrameCount / 8, ep_no, stream_id, 1);
} else {
error = xfer->pdev->methods->tr_open(xfer, MaxBufSize,
MaxFrameCount, ep_no, stream_id, 0);
}
if (error) {
free(xfer->ppBuffer);
free(xfer->pLength);
} else {
xfer->is_opened = 1;
}
return (error);
}
struct libusb20_transfer *
libusb20_tr_get_pointer(struct libusb20_device *pdev, uint16_t trIndex)
{
if (trIndex >= pdev->nTransfer) {
return (NULL);
}
return (pdev->pTransfer + trIndex);
}
uint32_t
libusb20_tr_get_actual_frames(struct libusb20_transfer *xfer)
{
return (xfer->aFrames);
}
uint16_t
libusb20_tr_get_time_complete(struct libusb20_transfer *xfer)
{
return (xfer->timeComplete);
}
uint32_t
libusb20_tr_get_actual_length(struct libusb20_transfer *xfer)
{
uint32_t x;
uint32_t actlen = 0;
for (x = 0; x != xfer->aFrames; x++) {
actlen += xfer->pLength[x];
}
return (actlen);
}
uint32_t
libusb20_tr_get_max_frames(struct libusb20_transfer *xfer)
{
return (xfer->maxFrames);
}
uint32_t
libusb20_tr_get_max_packet_length(struct libusb20_transfer *xfer)
{
/*
* Special Case NOTE: If the packet multiplier is non-zero for
* High Speed USB, the value returned is equal to
* "wMaxPacketSize * multiplier" !
*/
return (xfer->maxPacketLen);
}
uint32_t
libusb20_tr_get_max_total_length(struct libusb20_transfer *xfer)
{
return (xfer->maxTotalLength);
}
uint8_t
libusb20_tr_get_status(struct libusb20_transfer *xfer)
{
return (xfer->status);
}
uint8_t
libusb20_tr_pending(struct libusb20_transfer *xfer)
{
return (xfer->is_pending);
}
void *
libusb20_tr_get_priv_sc0(struct libusb20_transfer *xfer)
{
return (xfer->priv_sc0);
}
void *
libusb20_tr_get_priv_sc1(struct libusb20_transfer *xfer)
{
return (xfer->priv_sc1);
}
void
libusb20_tr_stop(struct libusb20_transfer *xfer)
{
if (!xfer->is_opened) {
/* transfer is not opened */
return;
}
if (!xfer->is_pending) {
/* transfer not pending */
return;
}
if (xfer->is_cancel) {
/* already cancelling */
return;
}
xfer->is_cancel = 1; /* we are cancelling */
xfer->pdev->methods->tr_cancel_async(xfer);
return;
}
void
libusb20_tr_drain(struct libusb20_transfer *xfer)
{
if (!xfer->is_opened) {
/* transfer is not opened */
return;
}
/* make sure that we are cancelling */
libusb20_tr_stop(xfer);
if (xfer->is_pending) {
xfer->is_draining = 1;
}
return;
}
void
libusb20_tr_clear_stall_sync(struct libusb20_transfer *xfer)
{
xfer->pdev->methods->tr_clear_stall_sync(xfer);
return;
}
void
libusb20_tr_set_buffer(struct libusb20_transfer *xfer, void *buffer, uint16_t frIndex)
{
xfer->ppBuffer[frIndex] = buffer;
return;
}
void
libusb20_tr_set_callback(struct libusb20_transfer *xfer, libusb20_tr_callback_t *cb)
{
xfer->callback = cb;
return;
}
void
libusb20_tr_set_flags(struct libusb20_transfer *xfer, uint8_t flags)
{
xfer->flags = flags;
return;
}
uint32_t
libusb20_tr_get_length(struct libusb20_transfer *xfer, uint16_t frIndex)
{
return (xfer->pLength[frIndex]);
}
void
libusb20_tr_set_length(struct libusb20_transfer *xfer, uint32_t length, uint16_t frIndex)
{
xfer->pLength[frIndex] = length;
return;
}
void
libusb20_tr_set_priv_sc0(struct libusb20_transfer *xfer, void *sc0)
{
xfer->priv_sc0 = sc0;
return;
}
void
libusb20_tr_set_priv_sc1(struct libusb20_transfer *xfer, void *sc1)
{
xfer->priv_sc1 = sc1;
return;
}
void
libusb20_tr_set_timeout(struct libusb20_transfer *xfer, uint32_t timeout)
{
xfer->timeout = timeout;
return;
}
void
libusb20_tr_set_total_frames(struct libusb20_transfer *xfer, uint32_t nFrames)
{
if (nFrames > xfer->maxFrames) {
/* should not happen */
nFrames = xfer->maxFrames;
}
xfer->nFrames = nFrames;
return;
}
void
libusb20_tr_setup_bulk(struct libusb20_transfer *xfer, void *pBuf, uint32_t length, uint32_t timeout)
{
xfer->ppBuffer[0] = pBuf;
xfer->pLength[0] = length;
xfer->timeout = timeout;
xfer->nFrames = 1;
return;
}
void
libusb20_tr_setup_control(struct libusb20_transfer *xfer, void *psetup, void *pBuf, uint32_t timeout)
{
uint16_t len;
xfer->ppBuffer[0] = psetup;
xfer->pLength[0] = 8; /* fixed */
xfer->timeout = timeout;
len = ((uint8_t *)psetup)[6] | (((uint8_t *)psetup)[7] << 8);
if (len != 0) {
xfer->nFrames = 2;
xfer->ppBuffer[1] = pBuf;
xfer->pLength[1] = len;
} else {
xfer->nFrames = 1;
}
return;
}
void
libusb20_tr_setup_intr(struct libusb20_transfer *xfer, void *pBuf, uint32_t length, uint32_t timeout)
{
xfer->ppBuffer[0] = pBuf;
xfer->pLength[0] = length;
xfer->timeout = timeout;
xfer->nFrames = 1;
return;
}
void
libusb20_tr_setup_isoc(struct libusb20_transfer *xfer, void *pBuf, uint32_t length, uint16_t frIndex)
{
if (frIndex >= xfer->maxFrames) {
/* should not happen */
return;
}
xfer->ppBuffer[frIndex] = pBuf;
xfer->pLength[frIndex] = length;
return;
}
uint8_t
libusb20_tr_bulk_intr_sync(struct libusb20_transfer *xfer,
void *pbuf, uint32_t length, uint32_t *pactlen,
uint32_t timeout)
{
struct libusb20_device *pdev = xfer->pdev;
uint32_t transfer_max;
uint32_t transfer_act;
uint8_t retval;
/* set some sensible default value */
if (pactlen != NULL)
*pactlen = 0;
/* check for error condition */
if (libusb20_tr_pending(xfer))
return (LIBUSB20_ERROR_OTHER);
do {
/* compute maximum transfer length */
transfer_max =
libusb20_tr_get_max_total_length(xfer);
if (transfer_max > length)
transfer_max = length;
/* setup bulk or interrupt transfer */
libusb20_tr_setup_bulk(xfer, pbuf,
transfer_max, timeout);
/* start the transfer */
libusb20_tr_start(xfer);
/* wait for transfer completion */
while (libusb20_dev_process(pdev) == 0) {
if (libusb20_tr_pending(xfer) == 0)
break;
libusb20_dev_wait_process(pdev, -1);
}
transfer_act = libusb20_tr_get_actual_length(xfer);
/* update actual length, if any */
if (pactlen != NULL)
pactlen[0] += transfer_act;
/* check transfer status */
retval = libusb20_tr_get_status(xfer);
if (retval)
break;
/* check for short transfer */
if (transfer_act != transfer_max)
break;
/* update buffer pointer and length */
pbuf = ((uint8_t *)pbuf) + transfer_max;
length = length - transfer_max;
} while (length != 0);
return (retval);
}
void
libusb20_tr_submit(struct libusb20_transfer *xfer)
{
if (!xfer->is_opened) {
/* transfer is not opened */
return;
}
if (xfer->is_pending) {
/* should not happen */
return;
}
xfer->is_pending = 1; /* we are pending */
xfer->is_cancel = 0; /* not cancelling */
xfer->is_restart = 0; /* not restarting */
xfer->pdev->methods->tr_submit(xfer);
return;
}
void
libusb20_tr_start(struct libusb20_transfer *xfer)
{
if (!xfer->is_opened) {
/* transfer is not opened */
return;
}
if (xfer->is_pending) {
if (xfer->is_cancel) {
/* cancelling - restart */
xfer->is_restart = 1;
}
/* transfer not pending */
return;
}
/* get into the callback */
libusb20_tr_callback_wrapper(xfer);
return;
}
/* USB device operations */
int
libusb20_dev_close(struct libusb20_device *pdev)
{
struct libusb20_transfer *xfer;
uint16_t x;
int error = 0;
if (!pdev->is_opened) {
return (LIBUSB20_ERROR_OTHER);
}
for (x = 0; x != pdev->nTransfer; x++) {
xfer = pdev->pTransfer + x;
if (!xfer->is_opened) {
/* transfer is not opened */
continue;
}
libusb20_tr_drain(xfer);
libusb20_tr_close(xfer);
}
if (pdev->pTransfer != NULL) {
free(pdev->pTransfer);
pdev->pTransfer = NULL;
}
error = pdev->beMethods->close_device(pdev);
pdev->methods = &libusb20_dummy_methods;
pdev->is_opened = 0;
/*
* Make sure libusb20_tr_get_pointer() fails:
*/
pdev->nTransfer = 0;
/*
* The following variable is only used by the libusb v0.1
* compat layer:
*/
pdev->claimed_interface = 0;
/*
* The following variable is only used by the libusb v1.0
* compat layer:
*/
pdev->auto_detach = 0;
return (error);
}
int
libusb20_dev_detach_kernel_driver(struct libusb20_device *pdev, uint8_t ifaceIndex)
{
int error;
error = pdev->methods->detach_kernel_driver(pdev, ifaceIndex);
return (error);
}
struct LIBUSB20_DEVICE_DESC_DECODED *
libusb20_dev_get_device_desc(struct libusb20_device *pdev)
{
return (&(pdev->ddesc));
}
int
libusb20_dev_get_fd(struct libusb20_device *pdev)
{
return (pdev->file);
}
int
libusb20_dev_kernel_driver_active(struct libusb20_device *pdev, uint8_t ifaceIndex)
{
int error;
error = pdev->methods->kernel_driver_active(pdev, ifaceIndex);
return (error);
}
int
libusb20_dev_open(struct libusb20_device *pdev, uint16_t nTransferMax)
{
struct libusb20_transfer *xfer;
uint32_t size;
uint16_t x;
int error;
if (pdev->is_opened) {
return (LIBUSB20_ERROR_BUSY);
}
if (nTransferMax >= 256) {
return (LIBUSB20_ERROR_INVALID_PARAM);
} else if (nTransferMax != 0) {
size = sizeof(pdev->pTransfer[0]) * nTransferMax;
pdev->pTransfer = malloc(size);
if (pdev->pTransfer == NULL) {
return (LIBUSB20_ERROR_NO_MEM);
}
memset(pdev->pTransfer, 0, size);
}
/* initialise all transfers */
for (x = 0; x != nTransferMax; x++) {
xfer = pdev->pTransfer + x;
xfer->pdev = pdev;
xfer->trIndex = x;
xfer->callback = &dummy_callback;
}
/* set "nTransfer" early */
pdev->nTransfer = nTransferMax;
error = pdev->beMethods->open_device(pdev, nTransferMax);
if (error) {
if (pdev->pTransfer != NULL) {
free(pdev->pTransfer);
pdev->pTransfer = NULL;
}
pdev->file = -1;
pdev->file_ctrl = -1;
pdev->nTransfer = 0;
} else {
pdev->is_opened = 1;
}
return (error);
}
int
libusb20_dev_reset(struct libusb20_device *pdev)
{
int error;
error = pdev->methods->reset_device(pdev);
return (error);
}
int
libusb20_dev_check_connected(struct libusb20_device *pdev)
{
int error;
error = pdev->methods->check_connected(pdev);
return (error);
}
int
libusb20_dev_set_power_mode(struct libusb20_device *pdev, uint8_t power_mode)
{
int error;
error = pdev->methods->set_power_mode(pdev, power_mode);
return (error);
}
uint8_t
libusb20_dev_get_power_mode(struct libusb20_device *pdev)
{
int error;
uint8_t power_mode;
error = pdev->methods->get_power_mode(pdev, &power_mode);
if (error)
power_mode = LIBUSB20_POWER_ON; /* fake power mode */
return (power_mode);
}
int
libusb20_dev_get_port_path(struct libusb20_device *pdev, uint8_t *buf, uint8_t bufsize)
{
if (pdev->port_level == 0) {
/*
* Fallback for backends without port path:
*/
if (bufsize < 2)
return (LIBUSB20_ERROR_OVERFLOW);
buf[0] = pdev->parent_address;
buf[1] = pdev->parent_port;
return (2);
}
/* check if client buffer is too small */
if (pdev->port_level > bufsize)
return (LIBUSB20_ERROR_OVERFLOW);
/* copy port number information */
memcpy(buf, pdev->port_path, pdev->port_level);
return (pdev->port_level); /* success */
}
uint16_t
libusb20_dev_get_power_usage(struct libusb20_device *pdev)
{
int error;
uint16_t power_usage;
error = pdev->methods->get_power_usage(pdev, &power_usage);
if (error)
power_usage = 0;
return (power_usage);
}
int
libusb20_dev_set_alt_index(struct libusb20_device *pdev, uint8_t ifaceIndex, uint8_t altIndex)
{
int error;
error = pdev->methods->set_alt_index(pdev, ifaceIndex, altIndex);
return (error);
}
int
libusb20_dev_set_config_index(struct libusb20_device *pdev, uint8_t configIndex)
{
int error;
error = pdev->methods->set_config_index(pdev, configIndex);
return (error);
}
int
libusb20_dev_request_sync(struct libusb20_device *pdev,
struct LIBUSB20_CONTROL_SETUP_DECODED *setup, void *data,
uint16_t *pactlen, uint32_t timeout, uint8_t flags)
{
int error;
error = pdev->methods->do_request_sync(pdev,
setup, data, pactlen, timeout, flags);
return (error);
}
int
libusb20_dev_req_string_sync(struct libusb20_device *pdev,
uint8_t str_index, uint16_t langid, void *ptr, uint16_t len)
{
struct LIBUSB20_CONTROL_SETUP_DECODED req;
int error;
int flags;
/* make sure memory is initialised */
memset(ptr, 0, len);
if (len < 4) {
/* invalid length */
return (LIBUSB20_ERROR_INVALID_PARAM);
}
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &req);
/*
* We need to read the USB string in two steps else some USB
* devices will complain.
*/
req.bmRequestType =
LIBUSB20_REQUEST_TYPE_STANDARD |
LIBUSB20_RECIPIENT_DEVICE |
LIBUSB20_ENDPOINT_IN;
req.bRequest = LIBUSB20_REQUEST_GET_DESCRIPTOR;
req.wValue = (LIBUSB20_DT_STRING << 8) | str_index;
req.wIndex = langid;
req.wLength = 4; /* bytes */
error = libusb20_dev_request_sync(pdev, &req,
ptr, NULL, 1000, LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK);
if (error) {
/* try to request full string */
req.wLength = 255;
flags = 0;
} else {
/* extract length and request full string */
req.wLength = *(uint8_t *)ptr;
flags = LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK;
}
if (req.wLength > len) {
/* partial string read */
req.wLength = len;
}
error = libusb20_dev_request_sync(pdev, &req, ptr, NULL, 1000, flags);
if (error)
return (error);
if (((uint8_t *)ptr)[1] != LIBUSB20_DT_STRING)
return (LIBUSB20_ERROR_OTHER);
return (0); /* success */
}
int
libusb20_dev_req_string_simple_sync(struct libusb20_device *pdev,
uint8_t str_index, void *ptr, uint16_t len)
{
char *buf;
int error;
uint16_t langid;
uint16_t n;
uint16_t i;
uint16_t c;
uint8_t temp[255];
uint8_t swap;
/* the following code derives from the FreeBSD USB kernel */
if ((len < 1) || (ptr == NULL)) {
/* too short buffer */
return (LIBUSB20_ERROR_INVALID_PARAM);
}
error = libusb20_dev_req_string_sync(pdev,
0, 0, temp, sizeof(temp));
if (error < 0) {
*(uint8_t *)ptr = 0; /* zero terminate */
return (error);
}
langid = temp[2] | (temp[3] << 8);
error = libusb20_dev_req_string_sync(pdev, str_index,
langid, temp, sizeof(temp));
if (error < 0) {
*(uint8_t *)ptr = 0; /* zero terminate */
return (error);
}
if (temp[0] < 2) {
/* string length is too short */
*(uint8_t *)ptr = 0; /* zero terminate */
return (LIBUSB20_ERROR_OTHER);
}
/* reserve one byte for terminating zero */
len--;
/* find maximum length */
n = (temp[0] / 2) - 1;
if (n > len) {
n = len;
}
/* reset swap state */
swap = 3;
/* setup output buffer pointer */
buf = ptr;
/* convert and filter */
for (i = 0; (i != n); i++) {
c = temp[(2 * i) + 2] | (temp[(2 * i) + 3] << 8);
/* convert from Unicode, handle buggy strings */
if (((c & 0xff00) == 0) && (swap & 1)) {
/* Little Endian, default */
*buf = c;
swap = 1;
} else if (((c & 0x00ff) == 0) && (swap & 2)) {
/* Big Endian */
*buf = c >> 8;
swap = 2;
} else {
/* skip invalid character */
continue;
}
/*
* Filter by default - we don't allow greater and less than
* signs because they might confuse the dmesg printouts!
*/
if ((*buf == '<') || (*buf == '>') || (!isprint(*buf))) {
/* skip invalid character */
continue;
}
buf++;
}
*buf = 0; /* zero terminate string */
return (0);
}
struct libusb20_config *
libusb20_dev_alloc_config(struct libusb20_device *pdev, uint8_t configIndex)
{
struct libusb20_config *retval = NULL;
uint8_t *ptr;
uint16_t len;
uint8_t do_close;
int error;
/*
* Catch invalid configuration descriptor reads early on to
* avoid issues with devices that don't check for a valid USB
* configuration read request.
*/
if (configIndex >= pdev->ddesc.bNumConfigurations)
return (NULL);
if (!pdev->is_opened) {
error = libusb20_dev_open(pdev, 0);
if (error) {
return (NULL);
}
do_close = 1;
} else {
do_close = 0;
}
error = pdev->methods->get_config_desc_full(pdev,
&ptr, &len, configIndex);
if (error) {
goto done;
}
/* parse new config descriptor */
retval = libusb20_parse_config_desc(ptr);
/* free config descriptor */
free(ptr);
done:
if (do_close) {
error = libusb20_dev_close(pdev);
}
return (retval);
}
struct libusb20_device *
libusb20_dev_alloc(void)
{
struct libusb20_device *pdev;
pdev = malloc(sizeof(*pdev));
if (pdev == NULL) {
return (NULL);
}
memset(pdev, 0, sizeof(*pdev));
pdev->file = -1;
pdev->file_ctrl = -1;
pdev->methods = &libusb20_dummy_methods;
return (pdev);
}
uint8_t
libusb20_dev_get_config_index(struct libusb20_device *pdev)
{
int error;
uint8_t cfg_index;
uint8_t do_close;
if (!pdev->is_opened) {
error = libusb20_dev_open(pdev, 0);
if (error == 0) {
do_close = 1;
} else {
do_close = 0;
}
} else {
do_close = 0;
}
error = pdev->methods->get_config_index(pdev, &cfg_index);
if (error)
cfg_index = 0xFF; /* current config index */
if (do_close) {
if (libusb20_dev_close(pdev)) {
/* ignore */
}
}
return (cfg_index);
}
uint8_t
libusb20_dev_get_mode(struct libusb20_device *pdev)
{
return (pdev->usb_mode);
}
uint8_t
libusb20_dev_get_speed(struct libusb20_device *pdev)
{
return (pdev->usb_speed);
}
int
libusb20_dev_get_stats(struct libusb20_device *pdev, struct libusb20_device_stats *pstats)
{
uint8_t do_close;
int error;
if (!pdev->is_opened) {
error = libusb20_dev_open(pdev, 0);
if (error == 0) {
do_close = 1;
} else {
do_close = 0;
}
} else {
do_close = 0;
}
error = pdev->methods->get_stats(pdev, pstats);
if (do_close)
(void) libusb20_dev_close(pdev);
return (error);
}
/* if this function returns an error, the device is gone */
int
libusb20_dev_process(struct libusb20_device *pdev)
{
int error;
error = pdev->methods->process(pdev);
return (error);
}
void
libusb20_dev_wait_process(struct libusb20_device *pdev, int timeout)
{
struct pollfd pfd[1];
if (!pdev->is_opened) {
return;
}
pfd[0].fd = pdev->file;
pfd[0].events = (POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM);
pfd[0].revents = 0;
if (poll(pfd, 1, timeout)) {
/* ignore any error */
}
return;
}
void
libusb20_dev_free(struct libusb20_device *pdev)
{
if (pdev == NULL) {
/* be NULL safe */
return;
}
if (pdev->is_opened) {
if (libusb20_dev_close(pdev)) {
/* ignore any errors */
}
}
free(pdev);
return;
}
int
libusb20_dev_get_info(struct libusb20_device *pdev,
struct usb_device_info *pinfo)
{
if (pinfo == NULL)
return (LIBUSB20_ERROR_INVALID_PARAM);
return (pdev->beMethods->dev_get_info(pdev, pinfo));
}
const char *
libusb20_dev_get_backend_name(struct libusb20_device *pdev)
{
return (pdev->beMethods->get_backend_name());
}
const char *
libusb20_dev_get_desc(struct libusb20_device *pdev)
{
return (pdev->usb_desc);
}
void
libusb20_dev_set_debug(struct libusb20_device *pdev, int debug)
{
pdev->debug = debug;
return;
}
int
libusb20_dev_get_debug(struct libusb20_device *pdev)
{
return (pdev->debug);
}
uint8_t
libusb20_dev_get_address(struct libusb20_device *pdev)
{
return (pdev->device_address);
}
uint8_t
libusb20_dev_get_parent_address(struct libusb20_device *pdev)
{
return (pdev->parent_address);
}
uint8_t
libusb20_dev_get_parent_port(struct libusb20_device *pdev)
{
return (pdev->parent_port);
}
uint8_t
libusb20_dev_get_bus_number(struct libusb20_device *pdev)
{
return (pdev->bus_number);
}
int
libusb20_dev_get_iface_desc(struct libusb20_device *pdev,
uint8_t iface_index, char *buf, uint8_t len)
{
if ((buf == NULL) || (len == 0))
return (LIBUSB20_ERROR_INVALID_PARAM);
buf[0] = 0; /* set default string value */
return (pdev->beMethods->dev_get_iface_desc(
pdev, iface_index, buf, len));
}
/* USB backend operations */
int
libusb20_be_get_dev_quirk(struct libusb20_backend *pbe,
uint16_t quirk_index, struct libusb20_quirk *pq)
{
return (pbe->methods->root_get_dev_quirk(pbe, quirk_index, pq));
}
int
libusb20_be_get_quirk_name(struct libusb20_backend *pbe,
uint16_t quirk_index, struct libusb20_quirk *pq)
{
return (pbe->methods->root_get_quirk_name(pbe, quirk_index, pq));
}
int
libusb20_be_add_dev_quirk(struct libusb20_backend *pbe,
struct libusb20_quirk *pq)
{
return (pbe->methods->root_add_dev_quirk(pbe, pq));
}
int
libusb20_be_remove_dev_quirk(struct libusb20_backend *pbe,
struct libusb20_quirk *pq)
{
return (pbe->methods->root_remove_dev_quirk(pbe, pq));
}
int
libusb20_be_set_template(struct libusb20_backend *pbe, int temp)
{
return (pbe->methods->root_set_template(pbe, temp));
}
int
libusb20_be_get_template(struct libusb20_backend *pbe, int *ptemp)
{
int temp;
if (ptemp == NULL)
ptemp = &temp;
return (pbe->methods->root_get_template(pbe, ptemp));
}
struct libusb20_device *
libusb20_be_device_foreach(struct libusb20_backend *pbe, struct libusb20_device *pdev)
{
if (pbe == NULL) {
pdev = NULL;
} else if (pdev == NULL) {
pdev = TAILQ_FIRST(&(pbe->usb_devs));
} else {
pdev = TAILQ_NEXT(pdev, dev_entry);
}
return (pdev);
}
struct libusb20_backend *
libusb20_be_alloc(const struct libusb20_backend_methods *methods)
{
struct libusb20_backend *pbe;
pbe = malloc(sizeof(*pbe));
if (pbe == NULL) {
return (NULL);
}
memset(pbe, 0, sizeof(*pbe));
TAILQ_INIT(&(pbe->usb_devs));
pbe->methods = methods; /* set backend methods */
/* do the initial device scan */
if (pbe->methods->init_backend) {
pbe->methods->init_backend(pbe);
}
return (pbe);
}
struct libusb20_backend *
libusb20_be_alloc_linux(void)
{
return (NULL);
}
struct libusb20_backend *
libusb20_be_alloc_ugen20(void)
{
return (libusb20_be_alloc(&libusb20_ugen20_backend));
}
struct libusb20_backend *
libusb20_be_alloc_default(void)
{
struct libusb20_backend *pbe;
#ifdef __linux__
pbe = libusb20_be_alloc_linux();
if (pbe) {
return (pbe);
}
#endif
pbe = libusb20_be_alloc_ugen20();
if (pbe) {
return (pbe);
}
return (NULL); /* no backend found */
}
void
libusb20_be_free(struct libusb20_backend *pbe)
{
struct libusb20_device *pdev;
if (pbe == NULL) {
/* be NULL safe */
return;
}
while ((pdev = libusb20_be_device_foreach(pbe, NULL))) {
libusb20_be_dequeue_device(pbe, pdev);
libusb20_dev_free(pdev);
}
if (pbe->methods->exit_backend) {
pbe->methods->exit_backend(pbe);
}
/* free backend */
free(pbe);
}
void
libusb20_be_enqueue_device(struct libusb20_backend *pbe, struct libusb20_device *pdev)
{
pdev->beMethods = pbe->methods; /* copy backend methods */
TAILQ_INSERT_TAIL(&(pbe->usb_devs), pdev, dev_entry);
}
void
libusb20_be_dequeue_device(struct libusb20_backend *pbe,
struct libusb20_device *pdev)
{
TAILQ_REMOVE(&(pbe->usb_devs), pdev, dev_entry);
}
const char *
libusb20_strerror(int code)
{
switch (code) {
case LIBUSB20_SUCCESS:
return ("Success");
case LIBUSB20_ERROR_IO:
return ("I/O error");
case LIBUSB20_ERROR_INVALID_PARAM:
return ("Invalid parameter");
case LIBUSB20_ERROR_ACCESS:
return ("Permissions error");
case LIBUSB20_ERROR_NO_DEVICE:
return ("No device");
case LIBUSB20_ERROR_NOT_FOUND:
return ("Not found");
case LIBUSB20_ERROR_BUSY:
return ("Device busy");
case LIBUSB20_ERROR_TIMEOUT:
return ("Timeout");
case LIBUSB20_ERROR_OVERFLOW:
return ("Overflow");
case LIBUSB20_ERROR_PIPE:
return ("Pipe error");
case LIBUSB20_ERROR_INTERRUPTED:
return ("Interrupted");
case LIBUSB20_ERROR_NO_MEM:
return ("Out of memory");
case LIBUSB20_ERROR_NOT_SUPPORTED:
return ("Not supported");
case LIBUSB20_ERROR_OTHER:
return ("Other error");
default:
return ("Unknown error");
}
}
const char *
libusb20_error_name(int code)
{
switch (code) {
case LIBUSB20_SUCCESS:
return ("LIBUSB20_SUCCESS");
case LIBUSB20_ERROR_IO:
return ("LIBUSB20_ERROR_IO");
case LIBUSB20_ERROR_INVALID_PARAM:
return ("LIBUSB20_ERROR_INVALID_PARAM");
case LIBUSB20_ERROR_ACCESS:
return ("LIBUSB20_ERROR_ACCESS");
case LIBUSB20_ERROR_NO_DEVICE:
return ("LIBUSB20_ERROR_NO_DEVICE");
case LIBUSB20_ERROR_NOT_FOUND:
return ("LIBUSB20_ERROR_NOT_FOUND");
case LIBUSB20_ERROR_BUSY:
return ("LIBUSB20_ERROR_BUSY");
case LIBUSB20_ERROR_TIMEOUT:
return ("LIBUSB20_ERROR_TIMEOUT");
case LIBUSB20_ERROR_OVERFLOW:
return ("LIBUSB20_ERROR_OVERFLOW");
case LIBUSB20_ERROR_PIPE:
return ("LIBUSB20_ERROR_PIPE");
case LIBUSB20_ERROR_INTERRUPTED:
return ("LIBUSB20_ERROR_INTERRUPTED");
case LIBUSB20_ERROR_NO_MEM:
return ("LIBUSB20_ERROR_NO_MEM");
case LIBUSB20_ERROR_NOT_SUPPORTED:
return ("LIBUSB20_ERROR_NOT_SUPPORTED");
case LIBUSB20_ERROR_OTHER:
return ("LIBUSB20_ERROR_OTHER");
default:
return ("LIBUSB20_ERROR_UNKNOWN");
}
}
diff --git a/lib/libusb/libusb20.h b/lib/libusb/libusb20.h
index 868e8d7a4fdd..7bca2f7508c7 100644
--- a/lib/libusb/libusb20.h
+++ b/lib/libusb/libusb20.h
@@ -1,317 +1,316 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008-2009 Hans Petter Selasky. All rights reserved.
* Copyright (c) 2007-2008 Daniel Drake. All rights reserved.
* Copyright (c) 2001 Johannes Erdfelt. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _LIBUSB20_H_
#define _LIBUSB20_H_
#ifndef LIBUSB_GLOBAL_INCLUDE_FILE
#include <stdint.h>
#endif
#ifdef __cplusplus
extern "C" {
#endif
#if 0
}; /* style */
#endif
/** \ingroup misc
* Error codes. Most libusb20 functions return 0 on success or one of
* these codes on failure.
*/
enum libusb20_error {
/** Success (no error) */
LIBUSB20_SUCCESS = 0,
/** Input/output error */
LIBUSB20_ERROR_IO = -1,
/** Invalid parameter */
LIBUSB20_ERROR_INVALID_PARAM = -2,
/** Access denied (insufficient permissions) */
LIBUSB20_ERROR_ACCESS = -3,
/** No such device (it may have been disconnected) */
LIBUSB20_ERROR_NO_DEVICE = -4,
/** Entity not found */
LIBUSB20_ERROR_NOT_FOUND = -5,
/** Resource busy */
LIBUSB20_ERROR_BUSY = -6,
/** Operation timed out */
LIBUSB20_ERROR_TIMEOUT = -7,
/** Overflow */
LIBUSB20_ERROR_OVERFLOW = -8,
/** Pipe error */
LIBUSB20_ERROR_PIPE = -9,
/** System call interrupted (perhaps due to signal) */
LIBUSB20_ERROR_INTERRUPTED = -10,
/** Insufficient memory */
LIBUSB20_ERROR_NO_MEM = -11,
/** Operation not supported or unimplemented on this platform */
LIBUSB20_ERROR_NOT_SUPPORTED = -12,
/** Other error */
LIBUSB20_ERROR_OTHER = -99,
};
/** \ingroup asyncio
* libusb20_tr_get_status() values */
enum libusb20_transfer_status {
/** Transfer completed without error. Note that this does not
* indicate that the entire amount of requested data was
* transferred. */
LIBUSB20_TRANSFER_COMPLETED,
/** Callback code to start transfer */
LIBUSB20_TRANSFER_START,
/** Drain complete callback code */
LIBUSB20_TRANSFER_DRAINED,
/** Transfer failed */
LIBUSB20_TRANSFER_ERROR,
/** Transfer timed out */
LIBUSB20_TRANSFER_TIMED_OUT,
/** Transfer was cancelled */
LIBUSB20_TRANSFER_CANCELLED,
/** For bulk/interrupt endpoints: halt condition detected
* (endpoint stalled). For control endpoints: control request
* not supported. */
LIBUSB20_TRANSFER_STALL,
/** Device was disconnected */
LIBUSB20_TRANSFER_NO_DEVICE,
/** Device sent more data than requested */
LIBUSB20_TRANSFER_OVERFLOW,
};
/** \ingroup asyncio
* libusb20_tr_set_flags() values */
enum libusb20_transfer_flags {
/** Report a short frame as error */
LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK = 0x0001,
/** Multiple short frames are not allowed */
LIBUSB20_TRANSFER_MULTI_SHORT_NOT_OK = 0x0002,
/** All transmitted frames are short terminated */
LIBUSB20_TRANSFER_FORCE_SHORT = 0x0004,
/** Will do a clear-stall before xfer */
LIBUSB20_TRANSFER_DO_CLEAR_STALL = 0x0008,
};
/** \ingroup misc
* libusb20_dev_get_mode() values
*/
enum libusb20_device_mode {
LIBUSB20_MODE_HOST, /* default */
LIBUSB20_MODE_DEVICE,
};
/** \ingroup misc
* libusb20_dev_get_speed() values
*/
enum {
LIBUSB20_SPEED_UNKNOWN, /* default */
LIBUSB20_SPEED_LOW,
LIBUSB20_SPEED_FULL,
LIBUSB20_SPEED_HIGH,
LIBUSB20_SPEED_VARIABLE,
LIBUSB20_SPEED_SUPER,
};
/** \ingroup misc
* libusb20_dev_set_power() values
*/
enum {
LIBUSB20_POWER_OFF,
LIBUSB20_POWER_ON,
LIBUSB20_POWER_SAVE,
LIBUSB20_POWER_SUSPEND,
LIBUSB20_POWER_RESUME,
};
struct usb_device_info;
struct libusb20_transfer;
struct libusb20_backend;
struct libusb20_backend_methods;
struct libusb20_device;
struct libusb20_device_methods;
struct libusb20_config;
struct LIBUSB20_CONTROL_SETUP_DECODED;
struct LIBUSB20_DEVICE_DESC_DECODED;
typedef void (libusb20_tr_callback_t)(struct libusb20_transfer *xfer);
struct libusb20_quirk {
uint16_t vid; /* vendor ID */
uint16_t pid; /* product ID */
uint16_t bcdDeviceLow; /* low revision value, inclusive */
uint16_t bcdDeviceHigh; /* high revision value, inclusive */
uint16_t reserved[2]; /* for the future */
/* quirk name, UQ_XXX, including terminating zero */
char quirkname[64 - 12];
};
struct libusb20_device_stats {
uint64_t xfer_ok[4]; /* sorted by USB transfer type, UE_XXX */
uint64_t xfer_fail[4]; /* sorted by USB transfer type, UE_XXX */
uint64_t xfer_reserved[24]; /* reserved */
};
#define LIBUSB20_MAX_FRAME_PRE_SCALE (1U << 31)
/* USB transfer operations */
int libusb20_tr_close(struct libusb20_transfer *xfer);
int libusb20_tr_open(struct libusb20_transfer *xfer, uint32_t max_buf_size, uint32_t max_frame_count, uint8_t ep_no);
int libusb20_tr_open_stream(struct libusb20_transfer *xfer, uint32_t max_buf_size, uint32_t max_frame_count, uint8_t ep_no, uint16_t stream_id);
struct libusb20_transfer *libusb20_tr_get_pointer(struct libusb20_device *pdev, uint16_t tr_index);
uint16_t libusb20_tr_get_time_complete(struct libusb20_transfer *xfer);
uint32_t libusb20_tr_get_actual_frames(struct libusb20_transfer *xfer);
uint32_t libusb20_tr_get_actual_length(struct libusb20_transfer *xfer);
uint32_t libusb20_tr_get_max_frames(struct libusb20_transfer *xfer);
uint32_t libusb20_tr_get_max_packet_length(struct libusb20_transfer *xfer);
uint32_t libusb20_tr_get_max_total_length(struct libusb20_transfer *xfer);
uint8_t libusb20_tr_get_status(struct libusb20_transfer *xfer);
uint8_t libusb20_tr_pending(struct libusb20_transfer *xfer);
void libusb20_tr_callback_wrapper(struct libusb20_transfer *xfer);
void libusb20_tr_clear_stall_sync(struct libusb20_transfer *xfer);
void libusb20_tr_drain(struct libusb20_transfer *xfer);
void libusb20_tr_set_buffer(struct libusb20_transfer *xfer, void *buffer, uint16_t fr_index);
void libusb20_tr_set_callback(struct libusb20_transfer *xfer, libusb20_tr_callback_t *cb);
void libusb20_tr_set_flags(struct libusb20_transfer *xfer, uint8_t flags);
uint32_t libusb20_tr_get_length(struct libusb20_transfer *xfer, uint16_t fr_index);
void libusb20_tr_set_length(struct libusb20_transfer *xfer, uint32_t length, uint16_t fr_index);
void libusb20_tr_set_priv_sc0(struct libusb20_transfer *xfer, void *sc0);
void libusb20_tr_set_priv_sc1(struct libusb20_transfer *xfer, void *sc1);
void libusb20_tr_set_timeout(struct libusb20_transfer *xfer, uint32_t timeout);
void libusb20_tr_set_total_frames(struct libusb20_transfer *xfer, uint32_t nFrames);
void libusb20_tr_setup_bulk(struct libusb20_transfer *xfer, void *pbuf, uint32_t length, uint32_t timeout);
void libusb20_tr_setup_control(struct libusb20_transfer *xfer, void *psetup, void *pbuf, uint32_t timeout);
void libusb20_tr_setup_intr(struct libusb20_transfer *xfer, void *pbuf, uint32_t length, uint32_t timeout);
void libusb20_tr_setup_isoc(struct libusb20_transfer *xfer, void *pbuf, uint32_t length, uint16_t fr_index);
uint8_t libusb20_tr_bulk_intr_sync(struct libusb20_transfer *xfer, void *pbuf, uint32_t length, uint32_t *pactlen, uint32_t timeout);
void libusb20_tr_start(struct libusb20_transfer *xfer);
void libusb20_tr_stop(struct libusb20_transfer *xfer);
void libusb20_tr_submit(struct libusb20_transfer *xfer);
void *libusb20_tr_get_priv_sc0(struct libusb20_transfer *xfer);
void *libusb20_tr_get_priv_sc1(struct libusb20_transfer *xfer);
/* USB device operations */
const char *libusb20_dev_get_backend_name(struct libusb20_device *pdev);
const char *libusb20_dev_get_desc(struct libusb20_device *pdev);
int libusb20_dev_close(struct libusb20_device *pdev);
int libusb20_dev_detach_kernel_driver(struct libusb20_device *pdev, uint8_t iface_index);
int libusb20_dev_set_config_index(struct libusb20_device *pdev, uint8_t configIndex);
int libusb20_dev_get_debug(struct libusb20_device *pdev);
int libusb20_dev_get_fd(struct libusb20_device *pdev);
int libusb20_dev_get_stats(struct libusb20_device *pdev, struct libusb20_device_stats *pstat);
int libusb20_dev_kernel_driver_active(struct libusb20_device *pdev, uint8_t iface_index);
int libusb20_dev_open(struct libusb20_device *pdev, uint16_t transfer_max);
int libusb20_dev_process(struct libusb20_device *pdev);
int libusb20_dev_request_sync(struct libusb20_device *pdev, struct LIBUSB20_CONTROL_SETUP_DECODED *setup, void *data, uint16_t *pactlen, uint32_t timeout, uint8_t flags);
int libusb20_dev_req_string_sync(struct libusb20_device *pdev, uint8_t index, uint16_t langid, void *ptr, uint16_t len);
int libusb20_dev_req_string_simple_sync(struct libusb20_device *pdev, uint8_t index, void *ptr, uint16_t len);
int libusb20_dev_reset(struct libusb20_device *pdev);
int libusb20_dev_check_connected(struct libusb20_device *pdev);
int libusb20_dev_set_power_mode(struct libusb20_device *pdev, uint8_t power_mode);
uint8_t libusb20_dev_get_power_mode(struct libusb20_device *pdev);
int libusb20_dev_get_port_path(struct libusb20_device *pdev, uint8_t *buf, uint8_t bufsize);
uint16_t libusb20_dev_get_power_usage(struct libusb20_device *pdev);
int libusb20_dev_set_alt_index(struct libusb20_device *pdev, uint8_t iface_index, uint8_t alt_index);
int libusb20_dev_get_info(struct libusb20_device *pdev, struct usb_device_info *pinfo);
int libusb20_dev_get_iface_desc(struct libusb20_device *pdev, uint8_t iface_index, char *buf, uint8_t len);
struct LIBUSB20_DEVICE_DESC_DECODED *libusb20_dev_get_device_desc(struct libusb20_device *pdev);
struct libusb20_config *libusb20_dev_alloc_config(struct libusb20_device *pdev, uint8_t config_index);
struct libusb20_device *libusb20_dev_alloc(void);
uint8_t libusb20_dev_get_address(struct libusb20_device *pdev);
uint8_t libusb20_dev_get_parent_address(struct libusb20_device *pdev);
uint8_t libusb20_dev_get_parent_port(struct libusb20_device *pdev);
uint8_t libusb20_dev_get_bus_number(struct libusb20_device *pdev);
uint8_t libusb20_dev_get_mode(struct libusb20_device *pdev);
uint8_t libusb20_dev_get_speed(struct libusb20_device *pdev);
uint8_t libusb20_dev_get_config_index(struct libusb20_device *pdev);
void libusb20_dev_free(struct libusb20_device *pdev);
void libusb20_dev_set_debug(struct libusb20_device *pdev, int debug);
void libusb20_dev_wait_process(struct libusb20_device *pdev, int timeout);
/* USB global operations */
int libusb20_be_get_dev_quirk(struct libusb20_backend *pbe, uint16_t index, struct libusb20_quirk *pq);
int libusb20_be_get_quirk_name(struct libusb20_backend *pbe, uint16_t index, struct libusb20_quirk *pq);
int libusb20_be_add_dev_quirk(struct libusb20_backend *pbe, struct libusb20_quirk *pq);
int libusb20_be_remove_dev_quirk(struct libusb20_backend *pbe, struct libusb20_quirk *pq);
int libusb20_be_get_template(struct libusb20_backend *pbe, int *ptemp);
int libusb20_be_set_template(struct libusb20_backend *pbe, int temp);
/* USB backend operations */
struct libusb20_backend *libusb20_be_alloc(const struct libusb20_backend_methods *methods);
struct libusb20_backend *libusb20_be_alloc_default(void);
struct libusb20_backend *libusb20_be_alloc_freebsd(void);
struct libusb20_backend *libusb20_be_alloc_linux(void);
struct libusb20_backend *libusb20_be_alloc_ugen20(void);
struct libusb20_device *libusb20_be_device_foreach(struct libusb20_backend *pbe, struct libusb20_device *pdev);
void libusb20_be_dequeue_device(struct libusb20_backend *pbe, struct libusb20_device *pdev);
void libusb20_be_enqueue_device(struct libusb20_backend *pbe, struct libusb20_device *pdev);
void libusb20_be_free(struct libusb20_backend *pbe);
/* USB debugging */
const char *libusb20_strerror(int);
const char *libusb20_error_name(int);
#if 0
{ /* style */
#endif
#ifdef __cplusplus
}
#endif
#endif /* _LIBUSB20_H_ */
diff --git a/lib/libusb/libusb20_desc.c b/lib/libusb/libusb20_desc.c
index 3408a90690ca..89c01d5afeff 100644
--- a/lib/libusb/libusb20_desc.c
+++ b/lib/libusb/libusb20_desc.c
@@ -1,797 +1,796 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <sys/queue.h>
#endif
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
static const uint32_t libusb20_me_encode_empty[2]; /* dummy */
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_DEVICE_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_ENDPOINT_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_INTERFACE_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_CONFIG_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_CONTROL_SETUP);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_SS_ENDPT_COMP_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_USB_20_DEVCAP_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_SS_USB_DEVCAP_DESC);
LIBUSB20_MAKE_STRUCT_FORMAT(LIBUSB20_BOS_DESCRIPTOR);
/*------------------------------------------------------------------------*
* libusb20_parse_config_desc
*
* Return values:
* NULL: Out of memory.
* Else: A valid config structure pointer which must be passed to "free()"
*------------------------------------------------------------------------*/
struct libusb20_config *
libusb20_parse_config_desc(const void *config_desc)
{
struct libusb20_config *lub_config;
struct libusb20_interface *lub_interface;
struct libusb20_interface *lub_alt_interface;
struct libusb20_interface *last_if;
struct libusb20_endpoint *lub_endpoint;
struct libusb20_endpoint *last_ep;
struct libusb20_me_struct pcdesc;
const uint8_t *ptr;
uint32_t size;
uint16_t niface_no_alt;
uint16_t niface;
uint16_t nendpoint;
uint16_t iface_no;
ptr = config_desc;
if (ptr[1] != LIBUSB20_DT_CONFIG) {
return (NULL); /* not config descriptor */
}
/*
* The first "bInterfaceNumber" cannot start at 0xFFFF
* because the field is 8-bit.
*/
niface_no_alt = 0;
nendpoint = 0;
niface = 0;
iface_no = 0xFFFF;
ptr = NULL;
/* get "wTotalLength" and setup "pcdesc" */
pcdesc.ptr = LIBUSB20_ADD_BYTES(config_desc, 0);
pcdesc.len =
((const uint8_t *)config_desc)[2] |
(((const uint8_t *)config_desc)[3] << 8);
pcdesc.type = LIBUSB20_ME_IS_RAW;
/* descriptor pre-scan */
while ((ptr = libusb20_desc_foreach(&pcdesc, ptr))) {
if (ptr[1] == LIBUSB20_DT_ENDPOINT) {
nendpoint++;
} else if ((ptr[1] == LIBUSB20_DT_INTERFACE) && (ptr[0] >= 4)) {
niface++;
/* check "bInterfaceNumber" */
if (ptr[2] != iface_no) {
iface_no = ptr[2];
niface_no_alt++;
}
}
}
/* sanity checking */
if (niface >= 256) {
return (NULL); /* corrupt */
}
if (nendpoint >= 256) {
return (NULL); /* corrupt */
}
size = sizeof(*lub_config) +
(niface * sizeof(*lub_interface)) +
(nendpoint * sizeof(*lub_endpoint)) +
pcdesc.len;
lub_config = malloc(size);
if (lub_config == NULL) {
return (NULL); /* out of memory */
}
/* make sure memory is initialised */
memset(lub_config, 0, size);
lub_interface = (void *)(lub_config + 1);
lub_alt_interface = (void *)(lub_interface + niface_no_alt);
lub_endpoint = (void *)(lub_interface + niface);
/*
* Make a copy of the config descriptor, so that the caller can free
* the initial config descriptor pointer!
*/
memcpy((void *)(lub_endpoint + nendpoint), config_desc, pcdesc.len);
ptr = (const void *)(lub_endpoint + nendpoint);
pcdesc.ptr = LIBUSB20_ADD_BYTES(ptr, 0);
/* init config structure */
LIBUSB20_INIT(LIBUSB20_CONFIG_DESC, &lub_config->desc);
if (libusb20_me_decode(ptr, ptr[0], &lub_config->desc)) {
/* ignore */
}
lub_config->num_interface = 0;
lub_config->interface = lub_interface;
lub_config->extra.ptr = LIBUSB20_ADD_BYTES(ptr, ptr[0]);
lub_config->extra.len = -ptr[0];
lub_config->extra.type = LIBUSB20_ME_IS_RAW;
/* reset states */
niface = 0;
iface_no = 0xFFFF;
ptr = NULL;
lub_interface--;
lub_endpoint--;
last_if = NULL;
last_ep = NULL;
/* descriptor pre-scan */
while ((ptr = libusb20_desc_foreach(&pcdesc, ptr))) {
if (ptr[1] == LIBUSB20_DT_ENDPOINT) {
if (last_if) {
lub_endpoint++;
last_ep = lub_endpoint;
last_if->num_endpoints++;
LIBUSB20_INIT(LIBUSB20_ENDPOINT_DESC, &last_ep->desc);
if (libusb20_me_decode(ptr, ptr[0], &last_ep->desc)) {
/* ignore */
}
last_ep->extra.ptr = LIBUSB20_ADD_BYTES(ptr, ptr[0]);
last_ep->extra.len = 0;
last_ep->extra.type = LIBUSB20_ME_IS_RAW;
} else {
lub_config->extra.len += ptr[0];
}
} else if ((ptr[1] == LIBUSB20_DT_INTERFACE) && (ptr[0] >= 4)) {
if (ptr[2] != iface_no) {
/* new interface */
iface_no = ptr[2];
lub_interface++;
lub_config->num_interface++;
last_if = lub_interface;
niface++;
} else {
/* one more alternate setting */
lub_interface->num_altsetting++;
last_if = lub_alt_interface;
lub_alt_interface++;
}
LIBUSB20_INIT(LIBUSB20_INTERFACE_DESC, &last_if->desc);
if (libusb20_me_decode(ptr, ptr[0], &last_if->desc)) {
/* ignore */
}
/* detect broken USB descriptors when USB debugging is enabled */
if (last_if->desc.bInterfaceNumber != (uint8_t)(niface - 1)) {
const char *str = getenv("LIBUSB_DEBUG");
if (str != NULL && str[0] != '\0' && str[0] != '0') {
printf("LIBUSB_DEBUG: bInterfaceNumber(%u) is not sequential(%u)\n",
last_if->desc.bInterfaceNumber, niface - 1);
}
}
last_if->extra.ptr = LIBUSB20_ADD_BYTES(ptr, ptr[0]);
last_if->extra.len = 0;
last_if->extra.type = LIBUSB20_ME_IS_RAW;
last_if->endpoints = lub_endpoint + 1;
last_if->altsetting = lub_alt_interface;
last_if->num_altsetting = 0;
last_if->num_endpoints = 0;
last_ep = NULL;
} else {
/* unknown descriptor */
if (last_if) {
if (last_ep) {
last_ep->extra.len += ptr[0];
} else {
last_if->extra.len += ptr[0];
}
} else {
lub_config->extra.len += ptr[0];
}
}
}
return (lub_config);
}
/*------------------------------------------------------------------------*
* libusb20_desc_foreach
*
* Safe traversal of USB descriptors.
*
* Return values:
* NULL: End of descriptors
* Else: Pointer to next descriptor
*------------------------------------------------------------------------*/
const uint8_t *
libusb20_desc_foreach(const struct libusb20_me_struct *pdesc,
const uint8_t *psubdesc)
{
const uint8_t *start;
const uint8_t *end;
const uint8_t *desc_next;
/* be NULL safe */
if (pdesc == NULL)
return (NULL);
start = (const uint8_t *)pdesc->ptr;
end = LIBUSB20_ADD_BYTES(start, pdesc->len);
/* get start of next descriptor */
if (psubdesc == NULL)
psubdesc = start;
else
psubdesc = psubdesc + psubdesc[0];
/* check that the next USB descriptor is within the range */
if ((psubdesc < start) || (psubdesc >= end))
return (NULL); /* out of range, or EOD */
/* check start of the second next USB descriptor, if any */
desc_next = psubdesc + psubdesc[0];
if ((desc_next < start) || (desc_next > end))
return (NULL); /* out of range */
/* check minimum descriptor length */
if (psubdesc[0] < 3)
return (NULL); /* too short descriptor */
return (psubdesc); /* return start of next descriptor */
}
/*------------------------------------------------------------------------*
* libusb20_me_get_1 - safety wrapper to read out one byte
*------------------------------------------------------------------------*/
uint8_t
libusb20_me_get_1(const struct libusb20_me_struct *ie, uint16_t offset)
{
if (offset < ie->len) {
return (*((uint8_t *)LIBUSB20_ADD_BYTES(ie->ptr, offset)));
}
return (0);
}
/*------------------------------------------------------------------------*
* libusb20_me_get_2 - safety wrapper to read out one word
*------------------------------------------------------------------------*/
uint16_t
libusb20_me_get_2(const struct libusb20_me_struct *ie, uint16_t offset)
{
return (libusb20_me_get_1(ie, offset) |
(libusb20_me_get_1(ie, offset + 1) << 8));
}
/*------------------------------------------------------------------------*
* libusb20_me_encode - encode a message structure
*
* Description of parameters:
* "len" - maximum length of output buffer
* "ptr" - pointer to output buffer. If NULL, no data will be written
* "pd" - source structure
*
* Return values:
* 0..65535 - Number of bytes used, limited by the "len" input parameter.
*------------------------------------------------------------------------*/
uint16_t
libusb20_me_encode(void *ptr, uint16_t len, const void *pd)
{
const uint8_t *pf; /* pointer to format data */
uint8_t *buf; /* pointer to output buffer */
uint32_t pd_offset; /* decoded structure offset */
uint16_t len_old; /* old length */
uint16_t pd_count; /* decoded element count */
uint8_t me; /* message element */
/* initialise */
len_old = len;
buf = ptr;
pd_offset = sizeof(void *);
pf = (*((struct libusb20_me_format *const *)pd))->format;
/* scan */
while (1) {
/* get information element */
me = (pf[0]) & LIBUSB20_ME_MASK;
pd_count = pf[1] | (pf[2] << 8);
pf += 3;
/* encode the message element */
switch (me) {
case LIBUSB20_ME_INT8:
while (pd_count--) {
uint8_t temp;
if (len < 1) /* overflow */
goto done;
if (buf) {
temp = *((const uint8_t *)
LIBUSB20_ADD_BYTES(pd, pd_offset));
buf[0] = temp;
buf += 1;
}
pd_offset += 1;
len -= 1;
}
break;
case LIBUSB20_ME_INT16:
pd_offset = -((-pd_offset) & ~1); /* align */
while (pd_count--) {
uint16_t temp;
if (len < 2) /* overflow */
goto done;
if (buf) {
temp = *((const uint16_t *)
LIBUSB20_ADD_BYTES(pd, pd_offset));
buf[1] = (temp >> 8) & 0xFF;
buf[0] = temp & 0xFF;
buf += 2;
}
pd_offset += 2;
len -= 2;
}
break;
case LIBUSB20_ME_INT32:
pd_offset = -((-pd_offset) & ~3); /* align */
while (pd_count--) {
uint32_t temp;
if (len < 4) /* overflow */
goto done;
if (buf) {
temp = *((const uint32_t *)
LIBUSB20_ADD_BYTES(pd, pd_offset));
buf[3] = (temp >> 24) & 0xFF;
buf[2] = (temp >> 16) & 0xFF;
buf[1] = (temp >> 8) & 0xFF;
buf[0] = temp & 0xFF;
buf += 4;
}
pd_offset += 4;
len -= 4;
}
break;
case LIBUSB20_ME_INT64:
pd_offset = -((-pd_offset) & ~7); /* align */
while (pd_count--) {
uint64_t temp;
if (len < 8) /* overflow */
goto done;
if (buf) {
temp = *((const uint64_t *)
LIBUSB20_ADD_BYTES(pd, pd_offset));
buf[7] = (temp >> 56) & 0xFF;
buf[6] = (temp >> 48) & 0xFF;
buf[5] = (temp >> 40) & 0xFF;
buf[4] = (temp >> 32) & 0xFF;
buf[3] = (temp >> 24) & 0xFF;
buf[2] = (temp >> 16) & 0xFF;
buf[1] = (temp >> 8) & 0xFF;
buf[0] = temp & 0xFF;
buf += 8;
}
pd_offset += 8;
len -= 8;
}
break;
case LIBUSB20_ME_STRUCT:
pd_offset = -((-pd_offset) &
~(LIBUSB20_ME_STRUCT_ALIGN - 1)); /* align */
while (pd_count--) {
void *src_ptr;
uint16_t src_len;
struct libusb20_me_struct *ps;
ps = LIBUSB20_ADD_BYTES(pd, pd_offset);
switch (ps->type) {
case LIBUSB20_ME_IS_RAW:
src_len = ps->len;
src_ptr = ps->ptr;
break;
case LIBUSB20_ME_IS_ENCODED:
if (ps->len == 0) {
/*
* Length is encoded
* in the data itself
* and should be
* correct:
*/
ps->len = 0xFFFF;
}
src_len = libusb20_me_get_1(pd, 0);
src_ptr = LIBUSB20_ADD_BYTES(ps->ptr, 1);
if (src_len == 0xFF) {
/* length is escaped */
src_len = libusb20_me_get_2(pd, 1);
src_ptr =
LIBUSB20_ADD_BYTES(ps->ptr, 3);
}
break;
case LIBUSB20_ME_IS_DECODED:
/* reserve 3 length bytes */
src_len = libusb20_me_encode(NULL,
0xFFFF - 3, ps->ptr);
src_ptr = NULL;
break;
default: /* empty structure */
src_len = 0;
src_ptr = NULL;
break;
}
if (src_len > 0xFE) {
if (src_len > (0xFFFF - 3))
/* overflow */
goto done;
if (len < (src_len + 3))
/* overflow */
goto done;
if (buf) {
buf[0] = 0xFF;
buf[1] = (src_len & 0xFF);
buf[2] = (src_len >> 8) & 0xFF;
buf += 3;
}
len -= (src_len + 3);
} else {
if (len < (src_len + 1))
/* overflow */
goto done;
if (buf) {
buf[0] = (src_len & 0xFF);
buf += 1;
}
len -= (src_len + 1);
}
/* check for buffer and non-zero length */
if (buf && src_len) {
if (ps->type == LIBUSB20_ME_IS_DECODED) {
/*
* Repeat encode
* procedure - we have
* room for the
* complete structure:
*/
(void) libusb20_me_encode(buf,
0xFFFF - 3, ps->ptr);
} else {
bcopy(src_ptr, buf, src_len);
}
buf += src_len;
}
pd_offset += sizeof(struct libusb20_me_struct);
}
break;
default:
goto done;
}
}
done:
return (len_old - len);
}
/*------------------------------------------------------------------------*
* libusb20_me_decode - decode a message into a decoded structure
*
* Description of parameters:
* "ptr" - message pointer
* "len" - message length
* "pd" - pointer to decoded structure
*
* Returns:
* "0..65535" - number of bytes decoded, limited by "len"
*------------------------------------------------------------------------*/
uint16_t
libusb20_me_decode(const void *ptr, uint16_t len, void *pd)
{
const uint8_t *pf; /* pointer to format data */
const uint8_t *buf; /* pointer to input buffer */
uint32_t pd_offset; /* decoded structure offset */
uint16_t len_old; /* old length */
uint16_t pd_count; /* decoded element count */
uint8_t me; /* message element */
/* initialise */
len_old = len;
buf = ptr;
pd_offset = sizeof(void *);
pf = (*((struct libusb20_me_format **)pd))->format;
/* scan */
while (1) {
/* get information element */
me = (pf[0]) & LIBUSB20_ME_MASK;
pd_count = pf[1] | (pf[2] << 8);
pf += 3;
/* decode the message element by type */
switch (me) {
case LIBUSB20_ME_INT8:
while (pd_count--) {
uint8_t temp;
if (len < 1) {
len = 0;
temp = 0;
} else {
len -= 1;
temp = buf[0];
buf++;
}
*((uint8_t *)LIBUSB20_ADD_BYTES(pd,
pd_offset)) = temp;
pd_offset += 1;
}
break;
case LIBUSB20_ME_INT16:
pd_offset = -((-pd_offset) & ~1); /* align */
while (pd_count--) {
uint16_t temp;
if (len < 2) {
len = 0;
temp = 0;
} else {
len -= 2;
temp = buf[1] << 8;
temp |= buf[0];
buf += 2;
}
*((uint16_t *)LIBUSB20_ADD_BYTES(pd,
pd_offset)) = temp;
pd_offset += 2;
}
break;
case LIBUSB20_ME_INT32:
pd_offset = -((-pd_offset) & ~3); /* align */
while (pd_count--) {
uint32_t temp;
if (len < 4) {
len = 0;
temp = 0;
} else {
len -= 4;
temp = buf[3] << 24;
temp |= buf[2] << 16;
temp |= buf[1] << 8;
temp |= buf[0];
buf += 4;
}
*((uint32_t *)LIBUSB20_ADD_BYTES(pd,
pd_offset)) = temp;
pd_offset += 4;
}
break;
case LIBUSB20_ME_INT64:
pd_offset = -((-pd_offset) & ~7); /* align */
while (pd_count--) {
uint64_t temp;
if (len < 8) {
len = 0;
temp = 0;
} else {
len -= 8;
temp = ((uint64_t)buf[7]) << 56;
temp |= ((uint64_t)buf[6]) << 48;
temp |= ((uint64_t)buf[5]) << 40;
temp |= ((uint64_t)buf[4]) << 32;
temp |= buf[3] << 24;
temp |= buf[2] << 16;
temp |= buf[1] << 8;
temp |= buf[0];
buf += 8;
}
*((uint64_t *)LIBUSB20_ADD_BYTES(pd,
pd_offset)) = temp;
pd_offset += 8;
}
break;
case LIBUSB20_ME_STRUCT:
pd_offset = -((-pd_offset) &
~(LIBUSB20_ME_STRUCT_ALIGN - 1)); /* align */
while (pd_count--) {
uint16_t temp;
struct libusb20_me_struct *ps;
ps = LIBUSB20_ADD_BYTES(pd, pd_offset);
if (ps->type == LIBUSB20_ME_IS_ENCODED) {
/*
* Pre-store a de-constified
* pointer to the raw
* structure:
*/
ps->ptr = LIBUSB20_ADD_BYTES(buf, 0);
/*
* Get the correct number of
* length bytes:
*/
if (len != 0) {
if (buf[0] == 0xFF) {
ps->len = 3;
} else {
ps->len = 1;
}
} else {
ps->len = 0;
}
}
/* get the structure length */
if (len != 0) {
if (buf[0] == 0xFF) {
if (len < 3) {
len = 0;
temp = 0;
} else {
len -= 3;
temp = buf[1] |
(buf[2] << 8);
buf += 3;
}
} else {
len -= 1;
temp = buf[0];
buf += 1;
}
} else {
len = 0;
temp = 0;
}
/* check for invalid length */
if (temp > len) {
len = 0;
temp = 0;
}
/* check wanted structure type */
switch (ps->type) {
case LIBUSB20_ME_IS_ENCODED:
/* check for zero length */
if (temp == 0) {
/*
* The pointer must
* be valid:
*/
ps->ptr = LIBUSB20_ADD_BYTES(
libusb20_me_encode_empty, 0);
ps->len = 1;
} else {
ps->len += temp;
}
break;
case LIBUSB20_ME_IS_RAW:
/* update length and pointer */
ps->len = temp;
ps->ptr = LIBUSB20_ADD_BYTES(buf, 0);
break;
case LIBUSB20_ME_IS_EMPTY:
case LIBUSB20_ME_IS_DECODED:
/* check for non-zero length */
if (temp != 0) {
/* update type */
ps->type = LIBUSB20_ME_IS_DECODED;
ps->len = 0;
/*
* Recursivly decode
* the next structure
*/
(void) libusb20_me_decode(buf,
temp, ps->ptr);
} else {
/* update type */
ps->type = LIBUSB20_ME_IS_EMPTY;
ps->len = 0;
}
break;
default:
/*
* nothing to do - should
* not happen
*/
ps->ptr = NULL;
ps->len = 0;
break;
}
buf += temp;
len -= temp;
pd_offset += sizeof(struct libusb20_me_struct);
}
break;
default:
goto done;
}
}
done:
return (len_old - len);
}
diff --git a/lib/libusb/libusb20_desc.h b/lib/libusb/libusb20_desc.h
index ca0ebdccbf06..017148a34b1c 100644
--- a/lib/libusb/libusb20_desc.h
+++ b/lib/libusb/libusb20_desc.h
@@ -1,605 +1,604 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
* Copyright (c) 2007-2008 Daniel Drake. All rights reserved.
* Copyright (c) 2001 Johannes Erdfelt. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* NOTE: This file contains the definition of some standard USB
* structures. All structures which name ends by *DECODED use host byte
* order.
*/
/*
* NOTE: This file uses a lot of macros. If you want to see what the
* macros become when they are expanded then run the following
* commands from your shell:
*
* cpp libusb20_desc.h > temp.h
* indent temp.h
* less temp.h
*/
#ifndef _LIBUSB20_DESC_H_
#define _LIBUSB20_DESC_H_
#ifndef LIBUSB_GLOBAL_INCLUDE_FILE
#include <stdint.h>
#endif
#ifdef __cplusplus
extern "C" {
#endif
#if 0
}; /* style */
#endif
/* basic macros */
#define LIBUSB20__NOT(...) __VA_ARGS__
#define LIBUSB20_NOT(arg) LIBUSB20__NOT(LIBUSB20_YES arg(() LIBUSB20_NO))
#define LIBUSB20_YES(...) __VA_ARGS__
#define LIBUSB20_NO(...)
#define LIBUSB20_END(...) __VA_ARGS__
#define LIBUSB20_MAX(a,b) (((a) > (b)) ? (a) : (b))
#define LIBUSB20_MIN(a,b) (((a) < (b)) ? (a) : (b))
#define LIBUSB20_ADD_BYTES(ptr,off) \
((void *)(((const uint8_t *)(ptr)) + (off) - ((const uint8_t *)0)))
/* basic message elements */
enum {
LIBUSB20_ME_INT8,
LIBUSB20_ME_INT16,
LIBUSB20_ME_INT32,
LIBUSB20_ME_INT64,
LIBUSB20_ME_STRUCT,
LIBUSB20_ME_MAX, /* used to indicate end */
};
/* basic message element modifiers */
enum {
LIBUSB20_ME_IS_UNSIGNED = 0x00,
LIBUSB20_ME_IS_SIGNED = 0x80,
LIBUSB20_ME_MASK = 0x7F,
};
enum {
LIBUSB20_ME_IS_RAW, /* structure excludes length field
* (hardcoded value) */
LIBUSB20_ME_IS_ENCODED, /* structure includes length field */
LIBUSB20_ME_IS_EMPTY, /* no structure */
LIBUSB20_ME_IS_DECODED, /* structure is recursive */
};
/* basic helper structures and macros */
#define LIBUSB20_ME_STRUCT_ALIGN sizeof(void *)
struct libusb20_me_struct {
void *ptr; /* data pointer */
uint16_t len; /* defaults to zero */
uint16_t type; /* defaults to LIBUSB20_ME_IS_EMPTY */
} __aligned(LIBUSB20_ME_STRUCT_ALIGN);
struct libusb20_me_format {
const uint8_t *format; /* always set */
const char *desc; /* optionally set */
const char *fields; /* optionally set */
};
#define LIBUSB20_ME_STRUCT(n, field, arg, ismeta) \
ismeta ( LIBUSB20_ME_STRUCT, 1, 0, ) \
LIBUSB20_NOT(ismeta) ( struct libusb20_me_struct field; )
#define LIBUSB20_ME_STRUCT_ARRAY(n, field, arg, ismeta) \
ismeta ( LIBUSB20_ME_STRUCT , (arg) & 0xFF, \
((arg) / 0x100) & 0xFF, ) \
LIBUSB20_NOT(ismeta) ( struct libusb20_me_struct field [arg]; )
#define LIBUSB20_ME_INTEGER(n, field, ismeta, un, u, bits, a, size) \
ismeta ( LIBUSB20_ME_INT##bits | \
LIBUSB20_ME_IS_##un##SIGNED , \
(size) & 0xFF, ((size) / 0x100) & 0xFF, ) \
LIBUSB20_NOT(ismeta) ( u##int##bits##_t \
__aligned((bits) / 8) field a; )
#define LIBUSB20_ME_UINT8_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 8, , 1)
#define LIBUSB20_ME_UINT8_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 8, [arg], arg)
#define LIBUSB20_ME_SINT8_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 8, , 1)
#define LIBUSB20_ME_SINT8_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 8, [arg], arg)
#define LIBUSB20_ME_UINT16_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 16, , 1)
#define LIBUSB20_ME_UINT16_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 16, [arg], arg)
#define LIBUSB20_ME_SINT16_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 16, , 1)
#define LIBUSB20_ME_SINT16_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 16, [arg], arg)
#define LIBUSB20_ME_UINT32_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 32, , 1)
#define LIBUSB20_ME_UINT32_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 32, [arg], arg)
#define LIBUSB20_ME_SINT32_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 32, , 1)
#define LIBUSB20_ME_SINT32_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 32, [arg], arg)
#define LIBUSB20_ME_UINT64_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 64, , 1)
#define LIBUSB20_ME_UINT64_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 64, [arg], arg)
#define LIBUSB20_ME_SINT64_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 64, , 1)
#define LIBUSB20_ME_SINT64_ARRAY_T(n, field, arg, ismeta) \
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 64, [arg], arg)
#define LIBUSB20_MAKE_DECODED_FIELD(n, type, field, arg) \
LIBUSB20_ME_##type (n, field, arg, LIBUSB20_NO)
#define LIBUSB20_MAKE_STRUCT(name) \
extern const struct libusb20_me_format \
name##_FORMAT[1]; \
struct name##_DECODED { \
const struct libusb20_me_format *name##_FORMAT; \
name (LIBUSB20_MAKE_DECODED_FIELD,) \
}
#define LIBUSB20_MAKE_STRUCT_FORMAT(name) \
const struct libusb20_me_format \
name##_FORMAT[1] = {{ \
.format = LIBUSB20_MAKE_FORMAT(name), \
.desc = #name, \
.fields = NULL, \
}}
#define LIBUSB20_MAKE_FORMAT_SUB(n, type, field, arg) \
LIBUSB20_ME_##type (n, field, arg, LIBUSB20_YES)
#define LIBUSB20_MAKE_FORMAT(what) (const uint8_t []) \
{ what (LIBUSB20_MAKE_FORMAT_SUB, ) LIBUSB20_ME_MAX, 0, 0 }
#define LIBUSB20_INIT(what, ptr) do { \
memset(ptr, 0, sizeof(*(ptr))); \
(ptr)->what##_FORMAT = what##_FORMAT; \
} while (0)
#define LIBUSB20_DEVICE_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT16_T, bcdUSB, ) \
m(n, UINT8_T, bDeviceClass, ) \
m(n, UINT8_T, bDeviceSubClass, ) \
m(n, UINT8_T, bDeviceProtocol, ) \
m(n, UINT8_T, bMaxPacketSize0, ) \
m(n, UINT16_T, idVendor, ) \
m(n, UINT16_T, idProduct, ) \
m(n, UINT16_T, bcdDevice, ) \
m(n, UINT8_T, iManufacturer, ) \
m(n, UINT8_T, iProduct, ) \
m(n, UINT8_T, iSerialNumber, ) \
m(n, UINT8_T, bNumConfigurations, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_DEVICE_DESC);
#define LIBUSB20_ENDPOINT_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT8_T, bEndpointAddress, ) \
m(n, UINT8_T, bmAttributes, ) \
m(n, UINT16_T, wMaxPacketSize, ) \
m(n, UINT8_T, bInterval, ) \
m(n, UINT8_T, bRefresh, ) \
m(n, UINT8_T, bSynchAddress, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_ENDPOINT_DESC);
#define LIBUSB20_INTERFACE_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT8_T, bInterfaceNumber, ) \
m(n, UINT8_T, bAlternateSetting, ) \
m(n, UINT8_T, bNumEndpoints, ) \
m(n, UINT8_T, bInterfaceClass, ) \
m(n, UINT8_T, bInterfaceSubClass, ) \
m(n, UINT8_T, bInterfaceProtocol, ) \
m(n, UINT8_T, iInterface, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_INTERFACE_DESC);
#define LIBUSB20_CONFIG_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT16_T, wTotalLength, ) \
m(n, UINT8_T, bNumInterfaces, ) \
m(n, UINT8_T, bConfigurationValue, ) \
m(n, UINT8_T, iConfiguration, ) \
m(n, UINT8_T, bmAttributes, ) \
m(n, UINT8_T, bMaxPower, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_CONFIG_DESC);
#define LIBUSB20_CONTROL_SETUP(m,n) \
m(n, UINT8_T, bmRequestType, ) \
m(n, UINT8_T, bRequest, ) \
m(n, UINT16_T, wValue, ) \
m(n, UINT16_T, wIndex, ) \
m(n, UINT16_T, wLength, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_CONTROL_SETUP);
#define LIBUSB20_SS_ENDPT_COMP_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT8_T, bMaxBurst, ) \
m(n, UINT8_T, bmAttributes, ) \
m(n, UINT16_T, wBytesPerInterval, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_SS_ENDPT_COMP_DESC);
#define LIBUSB20_USB_20_DEVCAP_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT8_T, bDevCapabilityType, ) \
m(n, UINT32_T, bmAttributes, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_USB_20_DEVCAP_DESC);
#define LIBUSB20_SS_USB_DEVCAP_DESC(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT8_T, bDevCapabilityType, ) \
m(n, UINT8_T, bmAttributes, ) \
m(n, UINT16_T, wSpeedSupported, ) \
m(n, UINT8_T, bFunctionalitySupport, ) \
m(n, UINT8_T, bU1DevExitLat, ) \
m(n, UINT16_T, wU2DevExitLat, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_SS_USB_DEVCAP_DESC);
#define LIBUSB20_BOS_DESCRIPTOR(m,n) \
m(n, UINT8_T, bLength, ) \
m(n, UINT8_T, bDescriptorType, ) \
m(n, UINT16_T, wTotalLength, ) \
m(n, UINT8_T, bNumDeviceCapabilities, ) \
LIBUSB20_MAKE_STRUCT(LIBUSB20_BOS_DESCRIPTOR);
/* standard USB stuff */
/** \ingroup desc
* Device and/or Interface Class codes */
enum libusb20_class_code {
/** In the context of a \ref LIBUSB20_DEVICE_DESC "device
* descriptor", this bDeviceClass value indicates that each
* interface specifies its own class information and all
* interfaces operate independently.
*/
LIBUSB20_CLASS_PER_INTERFACE = 0,
/** Audio class */
LIBUSB20_CLASS_AUDIO = 1,
/** Communications class */
LIBUSB20_CLASS_COMM = 2,
/** Human Interface Device class */
LIBUSB20_CLASS_HID = 3,
/** Printer dclass */
LIBUSB20_CLASS_PRINTER = 7,
/** Picture transfer protocol class */
LIBUSB20_CLASS_PTP = 6,
/** Mass storage class */
LIBUSB20_CLASS_MASS_STORAGE = 8,
/** Hub class */
LIBUSB20_CLASS_HUB = 9,
/** Data class */
LIBUSB20_CLASS_DATA = 10,
/** Class is vendor-specific */
LIBUSB20_CLASS_VENDOR_SPEC = 0xff,
};
/** \ingroup desc
* Descriptor types as defined by the USB specification. */
enum libusb20_descriptor_type {
/** Device descriptor. See LIBUSB20_DEVICE_DESC. */
LIBUSB20_DT_DEVICE = 0x01,
/** Configuration descriptor. See LIBUSB20_CONFIG_DESC. */
LIBUSB20_DT_CONFIG = 0x02,
/** String descriptor */
LIBUSB20_DT_STRING = 0x03,
/** Interface descriptor. See LIBUSB20_INTERFACE_DESC. */
LIBUSB20_DT_INTERFACE = 0x04,
/** Endpoint descriptor. See LIBUSB20_ENDPOINT_DESC. */
LIBUSB20_DT_ENDPOINT = 0x05,
/** HID descriptor */
LIBUSB20_DT_HID = 0x21,
/** HID report descriptor */
LIBUSB20_DT_REPORT = 0x22,
/** Physical descriptor */
LIBUSB20_DT_PHYSICAL = 0x23,
/** Hub descriptor */
LIBUSB20_DT_HUB = 0x29,
/** Binary Object Store, BOS */
LIBUSB20_DT_BOS = 0x0f,
/** Device Capability */
LIBUSB20_DT_DEVICE_CAPABILITY = 0x10,
/** SuperSpeed endpoint companion */
LIBUSB20_DT_SS_ENDPOINT_COMPANION = 0x30,
};
/** \ingroup desc
* Device capability types as defined by the USB specification. */
enum libusb20_device_capability_type {
LIBUSB20_WIRELESS_USB_DEVICE_CAPABILITY = 0x1,
LIBUSB20_USB_2_0_EXTENSION_DEVICE_CAPABILITY = 0x2,
LIBUSB20_SS_USB_DEVICE_CAPABILITY = 0x3,
LIBUSB20_CONTAINER_ID_DEVICE_CAPABILITY = 0x4,
};
/* Descriptor sizes per descriptor type */
#define LIBUSB20_DT_DEVICE_SIZE 18
#define LIBUSB20_DT_CONFIG_SIZE 9
#define LIBUSB20_DT_INTERFACE_SIZE 9
#define LIBUSB20_DT_ENDPOINT_SIZE 7
#define LIBUSB20_DT_ENDPOINT_AUDIO_SIZE 9 /* Audio extension */
#define LIBUSB20_DT_HUB_NONVAR_SIZE 7
#define LIBUSB20_DT_SS_ENDPOINT_COMPANION_SIZE 6
#define LIBUSB20_DT_BOS_SIZE 5
#define LIBUSB20_USB_2_0_EXTENSION_DEVICE_CAPABILITY_SIZE 7
#define LIBUSB20_SS_USB_DEVICE_CAPABILITY_SIZE 10
#define LIBUSB20_ENDPOINT_ADDRESS_MASK 0x0f /* in bEndpointAddress */
#define LIBUSB20_ENDPOINT_DIR_MASK 0x80
/** \ingroup desc
* Endpoint direction. Values for bit 7 of the
* \ref LIBUSB20_ENDPOINT_DESC::bEndpointAddress "endpoint address" scheme.
*/
enum libusb20_endpoint_direction {
/** In: device-to-host */
LIBUSB20_ENDPOINT_IN = 0x80,
/** Out: host-to-device */
LIBUSB20_ENDPOINT_OUT = 0x00,
};
#define LIBUSB20_TRANSFER_TYPE_MASK 0x03 /* in bmAttributes */
/** \ingroup desc
* Endpoint transfer type. Values for bits 0:1 of the
* \ref LIBUSB20_ENDPOINT_DESC::bmAttributes "endpoint attributes" field.
*/
enum libusb20_transfer_type {
/** Control endpoint */
LIBUSB20_TRANSFER_TYPE_CONTROL = 0,
/** Isochronous endpoint */
LIBUSB20_TRANSFER_TYPE_ISOCHRONOUS = 1,
/** Bulk endpoint */
LIBUSB20_TRANSFER_TYPE_BULK = 2,
/** Interrupt endpoint */
LIBUSB20_TRANSFER_TYPE_INTERRUPT = 3,
};
/** \ingroup misc
* Standard requests, as defined in table 9-3 of the USB2 specifications */
enum libusb20_standard_request {
/** Request status of the specific recipient */
LIBUSB20_REQUEST_GET_STATUS = 0x00,
/** Clear or disable a specific feature */
LIBUSB20_REQUEST_CLEAR_FEATURE = 0x01,
/* 0x02 is reserved */
/** Set or enable a specific feature */
LIBUSB20_REQUEST_SET_FEATURE = 0x03,
/* 0x04 is reserved */
/** Set device address for all future accesses */
LIBUSB20_REQUEST_SET_ADDRESS = 0x05,
/** Get the specified descriptor */
LIBUSB20_REQUEST_GET_DESCRIPTOR = 0x06,
/** Used to update existing descriptors or add new descriptors */
LIBUSB20_REQUEST_SET_DESCRIPTOR = 0x07,
/** Get the current device configuration value */
LIBUSB20_REQUEST_GET_CONFIGURATION = 0x08,
/** Set device configuration */
LIBUSB20_REQUEST_SET_CONFIGURATION = 0x09,
/** Return the selected alternate setting for the specified
* interface */
LIBUSB20_REQUEST_GET_INTERFACE = 0x0A,
/** Select an alternate interface for the specified interface */
LIBUSB20_REQUEST_SET_INTERFACE = 0x0B,
/** Set then report an endpoint's synchronization frame */
LIBUSB20_REQUEST_SYNCH_FRAME = 0x0C,
/** Set U1 and U2 system exit latency */
LIBUSB20_REQUEST_SET_SEL = 0x30,
/** Set isochronous delay */
LIBUSB20_REQUEST_SET_ISOCH_DELAY = 0x31,
};
/** \ingroup misc
* Request type bits of the
* \ref libusb20_control_setup::bmRequestType "bmRequestType" field in
* control transfers. */
enum libusb20_request_type {
/** Standard */
LIBUSB20_REQUEST_TYPE_STANDARD = (0x00 << 5),
/** Class */
LIBUSB20_REQUEST_TYPE_CLASS = (0x01 << 5),
/** Vendor */
LIBUSB20_REQUEST_TYPE_VENDOR = (0x02 << 5),
/** Reserved */
LIBUSB20_REQUEST_TYPE_RESERVED = (0x03 << 5),
};
/** \ingroup misc
* Recipient bits of the
* \ref libusb20_control_setup::bmRequestType "bmRequestType" field in
* control transfers. Values 4 through 31 are reserved. */
enum libusb20_request_recipient {
/** Device */
LIBUSB20_RECIPIENT_DEVICE = 0x00,
/** Interface */
LIBUSB20_RECIPIENT_INTERFACE = 0x01,
/** Endpoint */
LIBUSB20_RECIPIENT_ENDPOINT = 0x02,
/** Other */
LIBUSB20_RECIPIENT_OTHER = 0x03,
};
#define LIBUSB20_ISO_SYNC_TYPE_MASK 0x0C
/** \ingroup desc
* Synchronization type for isochronous endpoints. Values for bits 2:3
* of the \ref LIBUSB20_ENDPOINT_DESC::bmAttributes "bmAttributes"
* field in LIBUSB20_ENDPOINT_DESC.
*/
enum libusb20_iso_sync_type {
/** No synchronization */
LIBUSB20_ISO_SYNC_TYPE_NONE = 0,
/** Asynchronous */
LIBUSB20_ISO_SYNC_TYPE_ASYNC = 1,
/** Adaptive */
LIBUSB20_ISO_SYNC_TYPE_ADAPTIVE = 2,
/** Synchronous */
LIBUSB20_ISO_SYNC_TYPE_SYNC = 3,
};
#define LIBUSB20_ISO_USAGE_TYPE_MASK 0x30
/** \ingroup desc
* Usage type for isochronous endpoints. Values for bits 4:5 of the
* \ref LIBUSB20_ENDPOINT_DESC::bmAttributes "bmAttributes" field in
* LIBUSB20_ENDPOINT_DESC.
*/
enum libusb20_iso_usage_type {
/** Data endpoint */
LIBUSB20_ISO_USAGE_TYPE_DATA = 0,
/** Feedback endpoint */
LIBUSB20_ISO_USAGE_TYPE_FEEDBACK = 1,
/** Implicit feedback Data endpoint */
LIBUSB20_ISO_USAGE_TYPE_IMPLICIT = 2,
};
struct libusb20_endpoint {
struct LIBUSB20_ENDPOINT_DESC_DECODED desc;
struct libusb20_me_struct extra;
} __aligned(sizeof(void *));
struct libusb20_interface {
struct LIBUSB20_INTERFACE_DESC_DECODED desc;
struct libusb20_me_struct extra;
struct libusb20_interface *altsetting;
struct libusb20_endpoint *endpoints;
uint8_t num_altsetting;
uint8_t num_endpoints;
} __aligned(sizeof(void *));
struct libusb20_config {
struct LIBUSB20_CONFIG_DESC_DECODED desc;
struct libusb20_me_struct extra;
struct libusb20_interface *interface;
uint8_t num_interface;
} __aligned(sizeof(void *));
uint8_t libusb20_me_get_1(const struct libusb20_me_struct *ie, uint16_t offset);
uint16_t libusb20_me_get_2(const struct libusb20_me_struct *ie, uint16_t offset);
uint16_t libusb20_me_encode(void *ptr, uint16_t len, const void *pd);
uint16_t libusb20_me_decode(const void *ptr, uint16_t len, void *pd);
const uint8_t *libusb20_desc_foreach(const struct libusb20_me_struct *pdesc, const uint8_t *psubdesc);
struct libusb20_config *libusb20_parse_config_desc(const void *config_desc);
#if 0
{ /* style */
#endif
#ifdef __cplusplus
}
#endif
#endif /* _LIBUSB20_DESC_H_ */
diff --git a/lib/libusb/libusb20_int.h b/lib/libusb/libusb20_int.h
index 8f3b19d79e18..4b0cef442c36 100644
--- a/lib/libusb/libusb20_int.h
+++ b/lib/libusb/libusb20_int.h
@@ -1,241 +1,240 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* This file describes internal structures.
*/
#ifndef _LIBUSB20_INT_H_
#define _LIBUSB20_INT_H_
struct libusb20_device;
struct libusb20_backend;
struct libusb20_transfer;
struct libusb20_quirk;
union libusb20_session_data {
unsigned long session_data;
struct timespec tv;
uint32_t plugtime;
};
/* USB backend specific */
typedef const char *(libusb20_get_backend_name_t)(void);
typedef int (libusb20_root_get_dev_quirk_t)(struct libusb20_backend *pbe, uint16_t index, struct libusb20_quirk *pq);
typedef int (libusb20_root_get_quirk_name_t)(struct libusb20_backend *pbe, uint16_t index, struct libusb20_quirk *pq);
typedef int (libusb20_root_add_dev_quirk_t)(struct libusb20_backend *pbe, struct libusb20_quirk *pq);
typedef int (libusb20_root_remove_dev_quirk_t)(struct libusb20_backend *pbe, struct libusb20_quirk *pq);
typedef int (libusb20_close_device_t)(struct libusb20_device *pdev);
typedef int (libusb20_dev_get_info_t)(struct libusb20_device *pdev, struct usb_device_info *pinfo);
typedef int (libusb20_dev_get_iface_desc_t)(struct libusb20_device *pdev, uint8_t iface_index, char *buf, uint8_t len);
typedef int (libusb20_init_backend_t)(struct libusb20_backend *pbe);
typedef int (libusb20_open_device_t)(struct libusb20_device *pdev, uint16_t transfer_count_max);
typedef void (libusb20_exit_backend_t)(struct libusb20_backend *pbe);
typedef int (libusb20_root_set_template_t)(struct libusb20_backend *pbe, int temp);
typedef int (libusb20_root_get_template_t)(struct libusb20_backend *pbe, int *ptemp);
#define LIBUSB20_DEFINE(n,field) \
libusb20_##field##_t *field;
#define LIBUSB20_DECLARE(n,field) \
/* .field = */ n##_##field,
#define LIBUSB20_BACKEND(m,n) \
/* description of this backend */ \
m(n, get_backend_name) \
/* optional backend methods */ \
m(n, init_backend) \
m(n, exit_backend) \
m(n, dev_get_info) \
m(n, dev_get_iface_desc) \
m(n, root_get_dev_quirk) \
m(n, root_get_quirk_name) \
m(n, root_add_dev_quirk) \
m(n, root_remove_dev_quirk) \
m(n, root_set_template) \
m(n, root_get_template) \
/* mandatory device methods */ \
m(n, open_device) \
m(n, close_device) \
struct libusb20_backend_methods {
LIBUSB20_BACKEND(LIBUSB20_DEFINE,)
};
/* USB dummy methods */
typedef int (libusb20_dummy_int_t)(void);
typedef void (libusb20_dummy_void_t)(void);
/* USB device specific */
typedef int (libusb20_detach_kernel_driver_t)(struct libusb20_device *pdev, uint8_t iface_index);
typedef int (libusb20_do_request_sync_t)(struct libusb20_device *pdev, struct LIBUSB20_CONTROL_SETUP_DECODED *setup, void *data, uint16_t *pactlen, uint32_t timeout, uint8_t flags);
typedef int (libusb20_get_config_desc_full_t)(struct libusb20_device *pdev, uint8_t **ppbuf, uint16_t *plen, uint8_t index);
typedef int (libusb20_get_config_index_t)(struct libusb20_device *pdev, uint8_t *pindex);
typedef int (libusb20_kernel_driver_active_t)(struct libusb20_device *pdev, uint8_t iface_index);
typedef int (libusb20_process_t)(struct libusb20_device *pdev);
typedef int (libusb20_reset_device_t)(struct libusb20_device *pdev);
typedef int (libusb20_set_power_mode_t)(struct libusb20_device *pdev, uint8_t power_mode);
typedef int (libusb20_get_power_mode_t)(struct libusb20_device *pdev, uint8_t *power_mode);
typedef int (libusb20_get_power_usage_t)(struct libusb20_device *pdev, uint16_t *power_usage);
typedef int (libusb20_get_stats_t)(struct libusb20_device *pdev, struct libusb20_device_stats *pstats);
typedef int (libusb20_set_alt_index_t)(struct libusb20_device *pdev, uint8_t iface_index, uint8_t alt_index);
typedef int (libusb20_set_config_index_t)(struct libusb20_device *pdev, uint8_t index);
typedef int (libusb20_check_connected_t)(struct libusb20_device *pdev);
/* USB transfer specific */
typedef int (libusb20_tr_open_t)(struct libusb20_transfer *xfer, uint32_t MaxBufSize, uint32_t MaxFrameCount, uint8_t ep_no, uint16_t stream_id, uint8_t pre_scale);
typedef int (libusb20_tr_close_t)(struct libusb20_transfer *xfer);
typedef int (libusb20_tr_clear_stall_sync_t)(struct libusb20_transfer *xfer);
typedef void (libusb20_tr_submit_t)(struct libusb20_transfer *xfer);
typedef void (libusb20_tr_cancel_async_t)(struct libusb20_transfer *xfer);
#define LIBUSB20_DEVICE(m,n) \
m(n, detach_kernel_driver) \
m(n, do_request_sync) \
m(n, get_config_desc_full) \
m(n, get_config_index) \
m(n, kernel_driver_active) \
m(n, process) \
m(n, reset_device) \
m(n, check_connected) \
m(n, set_power_mode) \
m(n, get_power_mode) \
m(n, get_power_usage) \
m(n, get_stats) \
m(n, set_alt_index) \
m(n, set_config_index) \
m(n, tr_cancel_async) \
m(n, tr_clear_stall_sync) \
m(n, tr_close) \
m(n, tr_open) \
m(n, tr_submit) \
struct libusb20_device_methods {
LIBUSB20_DEVICE(LIBUSB20_DEFINE,)
};
struct libusb20_backend {
TAILQ_HEAD(, libusb20_device) usb_devs;
const struct libusb20_backend_methods *methods;
};
struct libusb20_transfer {
struct libusb20_device *pdev; /* the USB device we belong to */
libusb20_tr_callback_t *callback;
void *priv_sc0; /* private client data */
void *priv_sc1; /* private client data */
/*
* Pointer to a list of buffer pointers:
*/
void **ppBuffer;
/*
* Pointer to frame lengths, which are updated to actual length
* after the USB transfer completes:
*/
uint32_t *pLength;
uint32_t maxTotalLength;
uint32_t maxFrames; /* total number of frames */
uint32_t nFrames; /* total number of frames */
uint32_t aFrames; /* actual number of frames */
uint32_t timeout;
/* isochronous completion time in milliseconds */
uint16_t timeComplete;
uint16_t trIndex;
uint16_t maxPacketLen;
uint8_t flags; /* see LIBUSB20_TRANSFER_XXX */
uint8_t status; /* see LIBUSB20_TRANSFER_XXX */
uint8_t is_opened;
uint8_t is_pending;
uint8_t is_cancel;
uint8_t is_draining;
uint8_t is_restart;
};
struct libusb20_device {
/* device descriptor */
struct LIBUSB20_DEVICE_DESC_DECODED ddesc;
/* device timestamp */
union libusb20_session_data session_data;
/* our device entry */
TAILQ_ENTRY(libusb20_device) dev_entry;
/* device methods */
const struct libusb20_device_methods *methods;
/* backend methods */
const struct libusb20_backend_methods *beMethods;
/* list of USB transfers */
struct libusb20_transfer *pTransfer;
/* private backend data */
void *privBeData;
/* libUSB v0.1 and v1.0 compat data */
void *privLuData;
/* claimed interface */
uint8_t claimed_interface;
/* auto detach kernel driver */
uint8_t auto_detach;
/* device file handle */
int file;
/* device file handle (control transfers only) */
int file_ctrl;
/* debugging level */
int debug;
/* number of USB transfers */
uint16_t nTransfer;
uint8_t bus_number;
uint8_t device_address;
uint8_t usb_mode;
uint8_t usb_speed;
uint8_t is_opened;
uint8_t parent_address;
uint8_t parent_port;
uint8_t port_level;
char usb_desc[96];
#define LIBUSB20_DEVICE_PORT_PATH_MAX 32
uint8_t port_path[LIBUSB20_DEVICE_PORT_PATH_MAX];
};
extern const struct libusb20_backend_methods libusb20_ugen20_backend;
extern const struct libusb20_backend_methods libusb20_linux_backend;
#endif /* _LIBUSB20_INT_H_ */
diff --git a/lib/libusb/libusb20_ugen20.c b/lib/libusb/libusb20_ugen20.c
index fe96509682f9..11064d2644d6 100644
--- a/lib/libusb/libusb20_ugen20.c
+++ b/lib/libusb/libusb20_ugen20.c
@@ -1,1087 +1,1086 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef LIBUSB_GLOBAL_INCLUDE_FILE
#include LIBUSB_GLOBAL_INCLUDE_FILE
#else
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <sys/queue.h>
#include <sys/types.h>
#endif
#include <dev/usb/usb.h>
#include <dev/usb/usbdi.h>
#include <dev/usb/usb_ioctl.h>
#include "libusb20.h"
#include "libusb20_desc.h"
#include "libusb20_int.h"
#ifndef IOUSB
#define IOUSB(a) a
#endif
static libusb20_init_backend_t ugen20_init_backend;
static libusb20_open_device_t ugen20_open_device;
static libusb20_close_device_t ugen20_close_device;
static libusb20_get_backend_name_t ugen20_get_backend_name;
static libusb20_exit_backend_t ugen20_exit_backend;
static libusb20_dev_get_iface_desc_t ugen20_dev_get_iface_desc;
static libusb20_dev_get_info_t ugen20_dev_get_info;
static libusb20_root_get_dev_quirk_t ugen20_root_get_dev_quirk;
static libusb20_root_get_quirk_name_t ugen20_root_get_quirk_name;
static libusb20_root_add_dev_quirk_t ugen20_root_add_dev_quirk;
static libusb20_root_remove_dev_quirk_t ugen20_root_remove_dev_quirk;
static libusb20_root_set_template_t ugen20_root_set_template;
static libusb20_root_get_template_t ugen20_root_get_template;
const struct libusb20_backend_methods libusb20_ugen20_backend = {
LIBUSB20_BACKEND(LIBUSB20_DECLARE, ugen20)
};
/* USB device specific */
static libusb20_get_config_desc_full_t ugen20_get_config_desc_full;
static libusb20_get_config_index_t ugen20_get_config_index;
static libusb20_set_config_index_t ugen20_set_config_index;
static libusb20_set_alt_index_t ugen20_set_alt_index;
static libusb20_reset_device_t ugen20_reset_device;
static libusb20_check_connected_t ugen20_check_connected;
static libusb20_set_power_mode_t ugen20_set_power_mode;
static libusb20_get_power_mode_t ugen20_get_power_mode;
static libusb20_get_power_usage_t ugen20_get_power_usage;
static libusb20_get_stats_t ugen20_get_stats;
static libusb20_kernel_driver_active_t ugen20_kernel_driver_active;
static libusb20_detach_kernel_driver_t ugen20_detach_kernel_driver;
static libusb20_do_request_sync_t ugen20_do_request_sync;
static libusb20_process_t ugen20_process;
/* USB transfer specific */
static libusb20_tr_open_t ugen20_tr_open;
static libusb20_tr_close_t ugen20_tr_close;
static libusb20_tr_clear_stall_sync_t ugen20_tr_clear_stall_sync;
static libusb20_tr_submit_t ugen20_tr_submit;
static libusb20_tr_cancel_async_t ugen20_tr_cancel_async;
static const struct libusb20_device_methods libusb20_ugen20_device_methods = {
LIBUSB20_DEVICE(LIBUSB20_DECLARE, ugen20)
};
static const char *
ugen20_get_backend_name(void)
{
return ("FreeBSD UGEN 2.0");
}
static uint32_t
ugen20_path_convert_one(const char **pp)
{
const char *ptr;
uint32_t temp = 0;
ptr = *pp;
while ((*ptr >= '0') && (*ptr <= '9')) {
temp *= 10;
temp += (*ptr - '0');
if (temp >= 1000000) {
/* catch overflow early */
return (0xFFFFFFFF);
}
ptr++;
}
if (*ptr == '.') {
/* skip dot */
ptr++;
}
*pp = ptr;
return (temp);
}
static int
ugen20_enumerate(struct libusb20_device *pdev, const char *id)
{
const char *tmp = id;
struct usb_device_descriptor ddesc;
struct usb_device_info devinfo;
struct usb_device_port_path udpp;
uint32_t plugtime;
char buf[64];
int f;
int error;
pdev->bus_number = ugen20_path_convert_one(&tmp);
pdev->device_address = ugen20_path_convert_one(&tmp);
snprintf(buf, sizeof(buf), "/dev/" USB_GENERIC_NAME "%u.%u",
pdev->bus_number, pdev->device_address);
f = open(buf, O_RDWR);
if (f < 0) {
return (LIBUSB20_ERROR_OTHER);
}
if (ioctl(f, IOUSB(USB_GET_PLUGTIME), &plugtime)) {
error = LIBUSB20_ERROR_OTHER;
goto done;
}
/* store when the device was plugged */
pdev->session_data.plugtime = plugtime;
if (ioctl(f, IOUSB(USB_GET_DEVICE_DESC), &ddesc)) {
error = LIBUSB20_ERROR_OTHER;
goto done;
}
LIBUSB20_INIT(LIBUSB20_DEVICE_DESC, &(pdev->ddesc));
libusb20_me_decode(&ddesc, sizeof(ddesc), &(pdev->ddesc));
if (pdev->ddesc.bNumConfigurations == 0) {
error = LIBUSB20_ERROR_OTHER;
goto done;
} else if (pdev->ddesc.bNumConfigurations >= 8) {
error = LIBUSB20_ERROR_OTHER;
goto done;
}
if (ioctl(f, IOUSB(USB_GET_DEVICEINFO), &devinfo)) {
error = LIBUSB20_ERROR_OTHER;
goto done;
}
switch (devinfo.udi_mode) {
case USB_MODE_DEVICE:
pdev->usb_mode = LIBUSB20_MODE_DEVICE;
break;
default:
pdev->usb_mode = LIBUSB20_MODE_HOST;
break;
}
switch (devinfo.udi_speed) {
case USB_SPEED_LOW:
pdev->usb_speed = LIBUSB20_SPEED_LOW;
break;
case USB_SPEED_FULL:
pdev->usb_speed = LIBUSB20_SPEED_FULL;
break;
case USB_SPEED_HIGH:
pdev->usb_speed = LIBUSB20_SPEED_HIGH;
break;
case USB_SPEED_VARIABLE:
pdev->usb_speed = LIBUSB20_SPEED_VARIABLE;
break;
case USB_SPEED_SUPER:
pdev->usb_speed = LIBUSB20_SPEED_SUPER;
break;
default:
pdev->usb_speed = LIBUSB20_SPEED_UNKNOWN;
break;
}
/* get parent HUB index and port */
pdev->parent_address = devinfo.udi_hubindex;
pdev->parent_port = devinfo.udi_hubport;
/* generate a nice description for printout */
snprintf(pdev->usb_desc, sizeof(pdev->usb_desc),
USB_GENERIC_NAME "%u.%u: <%s %s> at usbus%u", pdev->bus_number,
pdev->device_address, devinfo.udi_vendor,
devinfo.udi_product, pdev->bus_number);
/* get device port path, if any */
if (ioctl(f, IOUSB(USB_GET_DEV_PORT_PATH), &udpp) == 0 &&
udpp.udp_port_level < LIBUSB20_DEVICE_PORT_PATH_MAX) {
memcpy(pdev->port_path, udpp.udp_port_no, udpp.udp_port_level);
pdev->port_level = udpp.udp_port_level;
}
error = 0;
done:
close(f);
return (error);
}
struct ugen20_urd_state {
struct usb_read_dir urd;
uint32_t nparsed;
int f;
uint8_t *ptr;
const char *src;
const char *dst;
uint8_t buf[256];
uint8_t dummy_zero[1];
};
static int
ugen20_readdir(struct ugen20_urd_state *st)
{
; /* style fix */
repeat:
if (st->ptr == NULL) {
st->urd.urd_startentry += st->nparsed;
st->urd.urd_data = st->buf;
st->urd.urd_maxlen = sizeof(st->buf);
st->nparsed = 0;
if (ioctl(st->f, IOUSB(USB_READ_DIR), &st->urd)) {
return (EINVAL);
}
st->ptr = st->buf;
}
if (st->ptr[0] == 0) {
if (st->nparsed) {
st->ptr = NULL;
goto repeat;
} else {
return (ENXIO);
}
}
st->src = (void *)(st->ptr + 1);
st->dst = st->src + strlen(st->src) + 1;
st->ptr = st->ptr + st->ptr[0];
st->nparsed++;
if ((st->ptr < st->buf) ||
(st->ptr > st->dummy_zero)) {
/* invalid entry */
return (EINVAL);
}
return (0);
}
static int
ugen20_init_backend(struct libusb20_backend *pbe)
{
struct ugen20_urd_state state;
struct libusb20_device *pdev;
memset(&state, 0, sizeof(state));
state.f = open("/dev/" USB_DEVICE_NAME, O_RDONLY);
if (state.f < 0)
return (LIBUSB20_ERROR_OTHER);
while (ugen20_readdir(&state) == 0) {
if ((state.src[0] != 'u') ||
(state.src[1] != 'g') ||
(state.src[2] != 'e') ||
(state.src[3] != 'n')) {
continue;
}
pdev = libusb20_dev_alloc();
if (pdev == NULL) {
continue;
}
if (ugen20_enumerate(pdev, state.src + 4)) {
libusb20_dev_free(pdev);
continue;
}
/* put the device on the backend list */
libusb20_be_enqueue_device(pbe, pdev);
}
close(state.f);
return (0); /* success */
}
static void
ugen20_tr_release(struct libusb20_device *pdev)
{
struct usb_fs_uninit fs_uninit;
if (pdev->nTransfer == 0) {
return;
}
/* release all pending USB transfers */
if (pdev->privBeData != NULL) {
memset(&fs_uninit, 0, sizeof(fs_uninit));
if (ioctl(pdev->file, IOUSB(USB_FS_UNINIT), &fs_uninit)) {
/* ignore any errors of this kind */
}
}
return;
}
static int
ugen20_tr_renew(struct libusb20_device *pdev)
{
struct usb_fs_init fs_init;
struct usb_fs_endpoint *pfse;
int error;
uint32_t size;
uint16_t nMaxTransfer;
nMaxTransfer = pdev->nTransfer;
error = 0;
if (nMaxTransfer == 0) {
goto done;
}
size = nMaxTransfer * sizeof(*pfse);
if (pdev->privBeData == NULL) {
pfse = malloc(size);
if (pfse == NULL) {
error = LIBUSB20_ERROR_NO_MEM;
goto done;
}
pdev->privBeData = pfse;
}
/* reset endpoint data */
memset(pdev->privBeData, 0, size);
memset(&fs_init, 0, sizeof(fs_init));
fs_init.pEndpoints = pdev->privBeData;
fs_init.ep_index_max = nMaxTransfer;
if (ioctl(pdev->file, IOUSB(USB_FS_INIT), &fs_init)) {
error = LIBUSB20_ERROR_OTHER;
goto done;
}
done:
return (error);
}
static int
ugen20_open_device(struct libusb20_device *pdev, uint16_t nMaxTransfer)
{
uint32_t plugtime;
char buf[64];
int f;
int g;
int error;
snprintf(buf, sizeof(buf), "/dev/" USB_GENERIC_NAME "%u.%u",
pdev->bus_number, pdev->device_address);
/*
* We need two file handles, one for the control endpoint and one
* for BULK, INTERRUPT and ISOCHRONOUS transactions due to optimised
* kernel locking.
*/
g = open(buf, O_RDWR);
if (g < 0) {
return (LIBUSB20_ERROR_NO_DEVICE);
}
f = open(buf, O_RDWR);
if (f < 0) {
close(g);
return (LIBUSB20_ERROR_NO_DEVICE);
}
if (ioctl(f, IOUSB(USB_GET_PLUGTIME), &plugtime)) {
error = LIBUSB20_ERROR_OTHER;
goto done;
}
/* check that the correct device is still plugged */
if (pdev->session_data.plugtime != plugtime) {
error = LIBUSB20_ERROR_NO_DEVICE;
goto done;
}
/* need to set this before "tr_renew()" */
pdev->file = f;
pdev->file_ctrl = g;
/* renew all USB transfers */
error = ugen20_tr_renew(pdev);
if (error) {
goto done;
}
/* set methods */
pdev->methods = &libusb20_ugen20_device_methods;
done:
if (error) {
if (pdev->privBeData) {
/* cleanup after "tr_renew()" */
free(pdev->privBeData);
pdev->privBeData = NULL;
}
pdev->file = -1;
pdev->file_ctrl = -1;
close(f);
close(g);
}
return (error);
}
static int
ugen20_close_device(struct libusb20_device *pdev)
{
struct usb_fs_uninit fs_uninit;
if (pdev->privBeData) {
memset(&fs_uninit, 0, sizeof(fs_uninit));
if (ioctl(pdev->file, IOUSB(USB_FS_UNINIT), &fs_uninit)) {
/* ignore this error */
}
free(pdev->privBeData);
}
pdev->nTransfer = 0;
pdev->privBeData = NULL;
close(pdev->file);
close(pdev->file_ctrl);
pdev->file = -1;
pdev->file_ctrl = -1;
return (0); /* success */
}
static void
ugen20_exit_backend(struct libusb20_backend *pbe)
{
return; /* nothing to do */
}
static int
ugen20_get_config_desc_full(struct libusb20_device *pdev,
uint8_t **ppbuf, uint16_t *plen, uint8_t cfg_index)
{
struct usb_gen_descriptor gen_desc;
struct usb_config_descriptor cdesc;
uint8_t *ptr;
uint16_t len;
int error;
/* make sure memory is initialised */
memset(&cdesc, 0, sizeof(cdesc));
memset(&gen_desc, 0, sizeof(gen_desc));
gen_desc.ugd_data = &cdesc;
gen_desc.ugd_maxlen = sizeof(cdesc);
gen_desc.ugd_config_index = cfg_index;
error = ioctl(pdev->file_ctrl, IOUSB(USB_GET_FULL_DESC), &gen_desc);
if (error) {
return (LIBUSB20_ERROR_OTHER);
}
len = UGETW(cdesc.wTotalLength);
if (len < sizeof(cdesc)) {
/* corrupt descriptor */
return (LIBUSB20_ERROR_OTHER);
}
ptr = malloc(len);
if (!ptr) {
return (LIBUSB20_ERROR_NO_MEM);
}
/* make sure memory is initialised */
memset(ptr, 0, len);
gen_desc.ugd_data = ptr;
gen_desc.ugd_maxlen = len;
error = ioctl(pdev->file_ctrl, IOUSB(USB_GET_FULL_DESC), &gen_desc);
if (error) {
free(ptr);
return (LIBUSB20_ERROR_OTHER);
}
/* make sure that the device doesn't fool us */
memcpy(ptr, &cdesc, sizeof(cdesc));
*ppbuf = ptr;
*plen = len;
return (0); /* success */
}
static int
ugen20_get_config_index(struct libusb20_device *pdev, uint8_t *pindex)
{
int temp;
if (ioctl(pdev->file_ctrl, IOUSB(USB_GET_CONFIG), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
*pindex = temp;
return (0);
}
static int
ugen20_set_config_index(struct libusb20_device *pdev, uint8_t cfg_index)
{
int temp = cfg_index;
/* release all active USB transfers */
ugen20_tr_release(pdev);
if (ioctl(pdev->file_ctrl, IOUSB(USB_SET_CONFIG), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
return (ugen20_tr_renew(pdev));
}
static int
ugen20_set_alt_index(struct libusb20_device *pdev,
uint8_t iface_index, uint8_t alt_index)
{
struct usb_alt_interface alt_iface;
memset(&alt_iface, 0, sizeof(alt_iface));
alt_iface.uai_interface_index = iface_index;
alt_iface.uai_alt_index = alt_index;
/* release all active USB transfers */
ugen20_tr_release(pdev);
if (ioctl(pdev->file_ctrl, IOUSB(USB_SET_ALTINTERFACE), &alt_iface)) {
return (LIBUSB20_ERROR_OTHER);
}
return (ugen20_tr_renew(pdev));
}
static int
ugen20_reset_device(struct libusb20_device *pdev)
{
int temp = 0;
/* release all active USB transfers */
ugen20_tr_release(pdev);
if (ioctl(pdev->file_ctrl, IOUSB(USB_DEVICEENUMERATE), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
return (ugen20_tr_renew(pdev));
}
static int
ugen20_check_connected(struct libusb20_device *pdev)
{
uint32_t plugtime;
int error = 0;
if (ioctl(pdev->file_ctrl, IOUSB(USB_GET_PLUGTIME), &plugtime)) {
error = LIBUSB20_ERROR_NO_DEVICE;
goto done;
}
if (pdev->session_data.plugtime != plugtime) {
error = LIBUSB20_ERROR_NO_DEVICE;
goto done;
}
done:
return (error);
}
static int
ugen20_set_power_mode(struct libusb20_device *pdev, uint8_t power_mode)
{
int temp;
switch (power_mode) {
case LIBUSB20_POWER_OFF:
temp = USB_POWER_MODE_OFF;
break;
case LIBUSB20_POWER_ON:
temp = USB_POWER_MODE_ON;
break;
case LIBUSB20_POWER_SAVE:
temp = USB_POWER_MODE_SAVE;
break;
case LIBUSB20_POWER_SUSPEND:
temp = USB_POWER_MODE_SUSPEND;
break;
case LIBUSB20_POWER_RESUME:
temp = USB_POWER_MODE_RESUME;
break;
default:
return (LIBUSB20_ERROR_INVALID_PARAM);
}
if (ioctl(pdev->file_ctrl, IOUSB(USB_SET_POWER_MODE), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
return (0);
}
static int
ugen20_get_power_mode(struct libusb20_device *pdev, uint8_t *power_mode)
{
int temp;
if (ioctl(pdev->file_ctrl, IOUSB(USB_GET_POWER_MODE), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
switch (temp) {
case USB_POWER_MODE_OFF:
temp = LIBUSB20_POWER_OFF;
break;
case USB_POWER_MODE_ON:
temp = LIBUSB20_POWER_ON;
break;
case USB_POWER_MODE_SAVE:
temp = LIBUSB20_POWER_SAVE;
break;
case USB_POWER_MODE_SUSPEND:
temp = LIBUSB20_POWER_SUSPEND;
break;
case USB_POWER_MODE_RESUME:
temp = LIBUSB20_POWER_RESUME;
break;
default:
temp = LIBUSB20_POWER_ON;
break;
}
*power_mode = temp;
return (0); /* success */
}
static int
ugen20_get_power_usage(struct libusb20_device *pdev, uint16_t *power_usage)
{
int temp;
if (ioctl(pdev->file_ctrl, IOUSB(USB_GET_POWER_USAGE), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
*power_usage = temp;
return (0); /* success */
}
static int
ugen20_get_stats(struct libusb20_device *pdev, struct libusb20_device_stats *pstats)
{
struct usb_device_stats st;
if (ioctl(pdev->file_ctrl, IOUSB(USB_DEVICESTATS), &st))
return (LIBUSB20_ERROR_OTHER);
memset(pstats, 0, sizeof(*pstats));
pstats->xfer_ok[0] = st.uds_requests_ok[0];
pstats->xfer_ok[1] = st.uds_requests_ok[1];
pstats->xfer_ok[2] = st.uds_requests_ok[2];
pstats->xfer_ok[3] = st.uds_requests_ok[3];
pstats->xfer_fail[0] = st.uds_requests_fail[0];
pstats->xfer_fail[1] = st.uds_requests_fail[1];
pstats->xfer_fail[2] = st.uds_requests_fail[2];
pstats->xfer_fail[3] = st.uds_requests_fail[3];
return (0); /* success */
}
static int
ugen20_kernel_driver_active(struct libusb20_device *pdev,
uint8_t iface_index)
{
int temp = iface_index;
if (ioctl(pdev->file_ctrl, IOUSB(USB_IFACE_DRIVER_ACTIVE), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
return (0); /* kernel driver is active */
}
static int
ugen20_detach_kernel_driver(struct libusb20_device *pdev,
uint8_t iface_index)
{
int temp = iface_index;
if (ioctl(pdev->file_ctrl, IOUSB(USB_IFACE_DRIVER_DETACH), &temp)) {
return (LIBUSB20_ERROR_OTHER);
}
return (0); /* kernel driver is detached */
}
static int
ugen20_do_request_sync(struct libusb20_device *pdev,
struct LIBUSB20_CONTROL_SETUP_DECODED *setup,
void *data, uint16_t *pactlen, uint32_t timeout, uint8_t flags)
{
struct usb_ctl_request req;
memset(&req, 0, sizeof(req));
req.ucr_data = data;
if (!(flags & LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK)) {
req.ucr_flags |= USB_SHORT_XFER_OK;
}
if (libusb20_me_encode(&req.ucr_request,
sizeof(req.ucr_request), setup)) {
/* ignore */
}
if (ioctl(pdev->file_ctrl, IOUSB(USB_DO_REQUEST), &req)) {
return (LIBUSB20_ERROR_OTHER);
}
if (pactlen) {
/* get actual length */
*pactlen = req.ucr_actlen;
}
return (0); /* request was successful */
}
static int
ugen20_process(struct libusb20_device *pdev)
{
struct usb_fs_complete temp;
struct usb_fs_endpoint *fsep;
struct libusb20_transfer *xfer;
while (1) {
if (ioctl(pdev->file, IOUSB(USB_FS_COMPLETE), &temp)) {
if (errno == EBUSY) {
break;
} else {
/* device detached */
return (LIBUSB20_ERROR_OTHER);
}
}
fsep = pdev->privBeData;
xfer = pdev->pTransfer;
fsep += temp.ep_index;
xfer += temp.ep_index;
/* update transfer status */
if (fsep->status == 0) {
xfer->aFrames = fsep->aFrames;
xfer->timeComplete = fsep->isoc_time_complete;
xfer->status = LIBUSB20_TRANSFER_COMPLETED;
} else if (fsep->status == USB_ERR_CANCELLED) {
xfer->aFrames = 0;
xfer->timeComplete = 0;
xfer->status = LIBUSB20_TRANSFER_CANCELLED;
} else if (fsep->status == USB_ERR_STALLED) {
xfer->aFrames = 0;
xfer->timeComplete = 0;
xfer->status = LIBUSB20_TRANSFER_STALL;
} else if (fsep->status == USB_ERR_TIMEOUT) {
xfer->aFrames = 0;
xfer->timeComplete = 0;
xfer->status = LIBUSB20_TRANSFER_TIMED_OUT;
} else {
xfer->aFrames = 0;
xfer->timeComplete = 0;
xfer->status = LIBUSB20_TRANSFER_ERROR;
}
libusb20_tr_callback_wrapper(xfer);
}
return (0); /* done */
}
static int
ugen20_tr_open(struct libusb20_transfer *xfer, uint32_t MaxBufSize,
uint32_t MaxFrameCount, uint8_t ep_no, uint16_t stream_id,
uint8_t pre_scale)
{
union {
struct usb_fs_open fs_open;
struct usb_fs_open_stream fs_open_stream;
} temp;
struct usb_fs_endpoint *fsep;
if (pre_scale)
MaxFrameCount |= USB_FS_MAX_FRAMES_PRE_SCALE;
memset(&temp, 0, sizeof(temp));
fsep = xfer->pdev->privBeData;
fsep += xfer->trIndex;
temp.fs_open.max_bufsize = MaxBufSize;
temp.fs_open.max_frames = MaxFrameCount;
temp.fs_open.ep_index = xfer->trIndex;
temp.fs_open.ep_no = ep_no;
if (stream_id != 0) {
temp.fs_open_stream.stream_id = stream_id;
if (ioctl(xfer->pdev->file, IOUSB(USB_FS_OPEN_STREAM), &temp.fs_open_stream))
return (LIBUSB20_ERROR_INVALID_PARAM);
} else {
if (ioctl(xfer->pdev->file, IOUSB(USB_FS_OPEN), &temp.fs_open))
return (LIBUSB20_ERROR_INVALID_PARAM);
}
/* maximums might have changed - update */
xfer->maxFrames = temp.fs_open.max_frames;
/* "max_bufsize" should be multiple of "max_packet_length" */
xfer->maxTotalLength = temp.fs_open.max_bufsize;
xfer->maxPacketLen = temp.fs_open.max_packet_length;
/* setup buffer and length lists using zero copy */
fsep->ppBuffer = xfer->ppBuffer;
fsep->pLength = xfer->pLength;
return (0); /* success */
}
static int
ugen20_tr_close(struct libusb20_transfer *xfer)
{
struct usb_fs_close temp;
memset(&temp, 0, sizeof(temp));
temp.ep_index = xfer->trIndex;
if (ioctl(xfer->pdev->file, IOUSB(USB_FS_CLOSE), &temp)) {
return (LIBUSB20_ERROR_INVALID_PARAM);
}
return (0); /* success */
}
static int
ugen20_tr_clear_stall_sync(struct libusb20_transfer *xfer)
{
struct usb_fs_clear_stall_sync temp;
memset(&temp, 0, sizeof(temp));
/* if the transfer is active, an error will be returned */
temp.ep_index = xfer->trIndex;
if (ioctl(xfer->pdev->file, IOUSB(USB_FS_CLEAR_STALL_SYNC), &temp)) {
return (LIBUSB20_ERROR_INVALID_PARAM);
}
return (0); /* success */
}
static void
ugen20_tr_submit(struct libusb20_transfer *xfer)
{
struct usb_fs_start temp;
struct usb_fs_endpoint *fsep;
memset(&temp, 0, sizeof(temp));
fsep = xfer->pdev->privBeData;
fsep += xfer->trIndex;
fsep->nFrames = xfer->nFrames;
fsep->flags = 0;
if (!(xfer->flags & LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK)) {
fsep->flags |= USB_FS_FLAG_SINGLE_SHORT_OK;
}
if (!(xfer->flags & LIBUSB20_TRANSFER_MULTI_SHORT_NOT_OK)) {
fsep->flags |= USB_FS_FLAG_MULTI_SHORT_OK;
}
if (xfer->flags & LIBUSB20_TRANSFER_FORCE_SHORT) {
fsep->flags |= USB_FS_FLAG_FORCE_SHORT;
}
if (xfer->flags & LIBUSB20_TRANSFER_DO_CLEAR_STALL) {
fsep->flags |= USB_FS_FLAG_CLEAR_STALL;
}
/* NOTE: The "fsep->timeout" variable is 16-bit. */
if (xfer->timeout > 65535)
fsep->timeout = 65535;
else
fsep->timeout = xfer->timeout;
temp.ep_index = xfer->trIndex;
if (ioctl(xfer->pdev->file, IOUSB(USB_FS_START), &temp)) {
/* ignore any errors - should never happen */
}
return; /* success */
}
static void
ugen20_tr_cancel_async(struct libusb20_transfer *xfer)
{
struct usb_fs_stop temp;
memset(&temp, 0, sizeof(temp));
temp.ep_index = xfer->trIndex;
if (ioctl(xfer->pdev->file, IOUSB(USB_FS_STOP), &temp)) {
/* ignore any errors - should never happen */
}
return;
}
static int
ugen20_be_ioctl(uint32_t cmd, void *data)
{
int f;
int error;
f = open("/dev/" USB_DEVICE_NAME, O_RDONLY);
if (f < 0)
return (LIBUSB20_ERROR_OTHER);
error = ioctl(f, cmd, data);
if (error == -1) {
if (errno == EPERM) {
error = LIBUSB20_ERROR_ACCESS;
} else {
error = LIBUSB20_ERROR_OTHER;
}
}
close(f);
return (error);
}
static int
ugen20_dev_get_iface_desc(struct libusb20_device *pdev,
uint8_t iface_index, char *buf, uint8_t len)
{
struct usb_gen_descriptor ugd;
memset(&ugd, 0, sizeof(ugd));
ugd.ugd_data = buf;
ugd.ugd_maxlen = len;
ugd.ugd_iface_index = iface_index;
if (ioctl(pdev->file, IOUSB(USB_GET_IFACE_DRIVER), &ugd)) {
return (LIBUSB20_ERROR_INVALID_PARAM);
}
return (0);
}
static int
ugen20_dev_get_info(struct libusb20_device *pdev,
struct usb_device_info *pinfo)
{
if (ioctl(pdev->file, IOUSB(USB_GET_DEVICEINFO), pinfo)) {
return (LIBUSB20_ERROR_INVALID_PARAM);
}
return (0);
}
static int
ugen20_root_get_dev_quirk(struct libusb20_backend *pbe,
uint16_t quirk_index, struct libusb20_quirk *pq)
{
struct usb_gen_quirk q;
int error;
memset(&q, 0, sizeof(q));
q.index = quirk_index;
error = ugen20_be_ioctl(IOUSB(USB_DEV_QUIRK_GET), &q);
if (error) {
if (errno == EINVAL) {
return (LIBUSB20_ERROR_NOT_FOUND);
}
} else {
pq->vid = q.vid;
pq->pid = q.pid;
pq->bcdDeviceLow = q.bcdDeviceLow;
pq->bcdDeviceHigh = q.bcdDeviceHigh;
strlcpy(pq->quirkname, q.quirkname, sizeof(pq->quirkname));
}
return (error);
}
static int
ugen20_root_get_quirk_name(struct libusb20_backend *pbe, uint16_t quirk_index,
struct libusb20_quirk *pq)
{
struct usb_gen_quirk q;
int error;
memset(&q, 0, sizeof(q));
q.index = quirk_index;
error = ugen20_be_ioctl(IOUSB(USB_QUIRK_NAME_GET), &q);
if (error) {
if (errno == EINVAL) {
return (LIBUSB20_ERROR_NOT_FOUND);
}
} else {
strlcpy(pq->quirkname, q.quirkname, sizeof(pq->quirkname));
}
return (error);
}
static int
ugen20_root_add_dev_quirk(struct libusb20_backend *pbe,
struct libusb20_quirk *pq)
{
struct usb_gen_quirk q;
int error;
memset(&q, 0, sizeof(q));
q.vid = pq->vid;
q.pid = pq->pid;
q.bcdDeviceLow = pq->bcdDeviceLow;
q.bcdDeviceHigh = pq->bcdDeviceHigh;
strlcpy(q.quirkname, pq->quirkname, sizeof(q.quirkname));
error = ugen20_be_ioctl(IOUSB(USB_DEV_QUIRK_ADD), &q);
if (error) {
if (errno == ENOMEM) {
return (LIBUSB20_ERROR_NO_MEM);
}
}
return (error);
}
static int
ugen20_root_remove_dev_quirk(struct libusb20_backend *pbe,
struct libusb20_quirk *pq)
{
struct usb_gen_quirk q;
int error;
memset(&q, 0, sizeof(q));
q.vid = pq->vid;
q.pid = pq->pid;
q.bcdDeviceLow = pq->bcdDeviceLow;
q.bcdDeviceHigh = pq->bcdDeviceHigh;
strlcpy(q.quirkname, pq->quirkname, sizeof(q.quirkname));
error = ugen20_be_ioctl(IOUSB(USB_DEV_QUIRK_REMOVE), &q);
if (error) {
if (errno == EINVAL) {
return (LIBUSB20_ERROR_NOT_FOUND);
}
}
return (error);
}
static int
ugen20_root_set_template(struct libusb20_backend *pbe, int temp)
{
return (ugen20_be_ioctl(IOUSB(USB_SET_TEMPLATE), &temp));
}
static int
ugen20_root_get_template(struct libusb20_backend *pbe, int *ptemp)
{
return (ugen20_be_ioctl(IOUSB(USB_GET_TEMPLATE), ptemp));
}
diff --git a/lib/libusb/libusb_global_linux.h b/lib/libusb/libusb_global_linux.h
index 2d5446001b96..1964f19c6e5e 100644
--- a/lib/libusb/libusb_global_linux.h
+++ b/lib/libusb/libusb_global_linux.h
@@ -1,88 +1,87 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _LIBUSB_GLOBAL_LINUX_H_
#define _LIBUSB_GLOBAL_LINUX_H_
#define _XOPEN_SOURCE
#define _BSD_SOURCE
#ifdef __linux__
#define _POSIX_SOURCE
#endif
#define _POSIX_C_SOURCE 200809
#include <ctype.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>
#include <unistd.h>
#ifdef __linux__
#include <alloca.h>
#endif
#include <string.h>
#include <fcntl.h>
#include <limits.h>
#include <setjmp.h>
#include <signal.h>
#include <pthread.h>
#include <sys/queue.h>
#include <sys/ioctl.h>
#include <sys/poll.h>
#include <sys/time.h>
#include <dev/usb/usb_endian.h>
#include <dev/usb/usb_freebsd.h>
#include <compat/linux/linux_ioctl.h>
#define IOUSB(a) FBSD_L##a
#ifndef __aligned
#define __aligned(x) __attribute__((__aligned__(x)))
#endif
#ifndef __packed
#define __packed __attribute__((__packed__))
#endif
#ifndef strlcpy
#define strlcpy(d,s,len) do { \
strncpy(d,s,len); \
((char *)d)[(len) - 1] = 0; \
} while (0)
#endif
#ifndef TAILQ_FOREACH_SAFE
#define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
for ((var) = TAILQ_FIRST((head)); \
(var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
(var) = (tvar))
#endif
#endif /* _LIBUSB_GLOBAL_LINUX_H_ */
diff --git a/lib/libusb/usb.h b/lib/libusb/usb.h
index 01f742472ca5..ab225060c55e 100644
--- a/lib/libusb/usb.h
+++ b/lib/libusb/usb.h
@@ -1,316 +1,315 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _LIBUSB20_COMPAT_01_H_
#define _LIBUSB20_COMPAT_01_H_
#ifndef LIBUSB_GLOBAL_INCLUDE_FILE
#include <stdint.h>
#include <sys/param.h>
#include <sys/endian.h>
#endif
/* USB interface class codes */
#define USB_CLASS_PER_INTERFACE 0
#define USB_CLASS_AUDIO 1
#define USB_CLASS_COMM 2
#define USB_CLASS_HID 3
#define USB_CLASS_PRINTER 7
#define USB_CLASS_PTP 6
#define USB_CLASS_MASS_STORAGE 8
#define USB_CLASS_HUB 9
#define USB_CLASS_DATA 10
#define USB_CLASS_VENDOR_SPEC 0xff
/* USB descriptor types */
#define USB_DT_DEVICE 0x01
#define USB_DT_CONFIG 0x02
#define USB_DT_STRING 0x03
#define USB_DT_INTERFACE 0x04
#define USB_DT_ENDPOINT 0x05
#define USB_DT_HID 0x21
#define USB_DT_REPORT 0x22
#define USB_DT_PHYSICAL 0x23
#define USB_DT_HUB 0x29
/* USB descriptor type sizes */
#define USB_DT_DEVICE_SIZE 18
#define USB_DT_CONFIG_SIZE 9
#define USB_DT_INTERFACE_SIZE 9
#define USB_DT_ENDPOINT_SIZE 7
#define USB_DT_ENDPOINT_AUDIO_SIZE 9
#define USB_DT_HUB_NONVAR_SIZE 7
/* USB descriptor header */
struct usb_descriptor_header {
uint8_t bLength;
uint8_t bDescriptorType;
};
/* USB string descriptor */
struct usb_string_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t wData[1];
};
/* USB HID descriptor */
struct usb_hid_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t bcdHID;
uint8_t bCountryCode;
uint8_t bNumDescriptors;
/* uint8_t bReportDescriptorType; */
/* uint16_t wDescriptorLength; */
/* ... */
};
/* USB endpoint descriptor */
#define USB_MAXENDPOINTS 32
struct usb_endpoint_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bEndpointAddress;
#define USB_ENDPOINT_ADDRESS_MASK 0x0f
#define USB_ENDPOINT_DIR_MASK 0x80
uint8_t bmAttributes;
#define USB_ENDPOINT_TYPE_MASK 0x03
#define USB_ENDPOINT_TYPE_CONTROL 0
#define USB_ENDPOINT_TYPE_ISOCHRONOUS 1
#define USB_ENDPOINT_TYPE_BULK 2
#define USB_ENDPOINT_TYPE_INTERRUPT 3
uint16_t wMaxPacketSize;
uint8_t bInterval;
uint8_t bRefresh;
uint8_t bSynchAddress;
uint8_t *extra; /* Extra descriptors */
int extralen;
};
/* USB interface descriptor */
#define USB_MAXINTERFACES 32
struct usb_interface_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint8_t bInterfaceNumber;
uint8_t bAlternateSetting;
uint8_t bNumEndpoints;
uint8_t bInterfaceClass;
uint8_t bInterfaceSubClass;
uint8_t bInterfaceProtocol;
uint8_t iInterface;
struct usb_endpoint_descriptor *endpoint;
uint8_t *extra; /* Extra descriptors */
int extralen;
};
#define USB_MAXALTSETTING 128 /* Hard limit */
struct usb_interface {
struct usb_interface_descriptor *altsetting;
int num_altsetting;
};
/* USB configuration descriptor */
#define USB_MAXCONFIG 8
struct usb_config_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t wTotalLength;
uint8_t bNumInterfaces;
uint8_t bConfigurationValue;
uint8_t iConfiguration;
uint8_t bmAttributes;
uint8_t MaxPower;
struct usb_interface *interface;
uint8_t *extra; /* Extra descriptors */
int extralen;
};
/* USB device descriptor */
struct usb_device_descriptor {
uint8_t bLength;
uint8_t bDescriptorType;
uint16_t bcdUSB;
uint8_t bDeviceClass;
uint8_t bDeviceSubClass;
uint8_t bDeviceProtocol;
uint8_t bMaxPacketSize0;
uint16_t idVendor;
uint16_t idProduct;
uint16_t bcdDevice;
uint8_t iManufacturer;
uint8_t iProduct;
uint8_t iSerialNumber;
uint8_t bNumConfigurations;
};
/* USB setup packet */
struct usb_ctrl_setup {
uint8_t bRequestType;
#define USB_RECIP_DEVICE 0x00
#define USB_RECIP_INTERFACE 0x01
#define USB_RECIP_ENDPOINT 0x02
#define USB_RECIP_OTHER 0x03
#define USB_TYPE_STANDARD (0x00 << 5)
#define USB_TYPE_CLASS (0x01 << 5)
#define USB_TYPE_VENDOR (0x02 << 5)
#define USB_TYPE_RESERVED (0x03 << 5)
#define USB_ENDPOINT_IN 0x80
#define USB_ENDPOINT_OUT 0x00
uint8_t bRequest;
#define USB_REQ_GET_STATUS 0x00
#define USB_REQ_CLEAR_FEATURE 0x01
#define USB_REQ_SET_FEATURE 0x03
#define USB_REQ_SET_ADDRESS 0x05
#define USB_REQ_GET_DESCRIPTOR 0x06
#define USB_REQ_SET_DESCRIPTOR 0x07
#define USB_REQ_GET_CONFIGURATION 0x08
#define USB_REQ_SET_CONFIGURATION 0x09
#define USB_REQ_GET_INTERFACE 0x0A
#define USB_REQ_SET_INTERFACE 0x0B
#define USB_REQ_SYNCH_FRAME 0x0C
uint16_t wValue;
uint16_t wIndex;
uint16_t wLength;
};
/* Error codes */
#define USB_ERROR_BEGIN 500000
/* Byte swapping */
#define USB_LE16_TO_CPU(x) le16toh(x)
/* Data types */
struct usb_device;
struct usb_bus;
/*
* To maintain compatibility with applications already built with libusb,
* we must only add entries to the end of this structure. NEVER delete or
* move members and only change types if you really know what you're doing.
*/
struct usb_device {
struct usb_device *next;
struct usb_device *prev;
char filename[PATH_MAX + 1];
struct usb_bus *bus;
struct usb_device_descriptor descriptor;
struct usb_config_descriptor *config;
void *dev;
uint8_t devnum;
uint8_t num_children;
struct usb_device **children;
};
struct usb_bus {
struct usb_bus *next;
struct usb_bus *prev;
char dirname[PATH_MAX + 1];
struct usb_device *devices;
uint32_t location;
struct usb_device *root_dev;
};
struct usb_dev_handle;
typedef struct usb_dev_handle usb_dev_handle;
/* Variables */
extern struct usb_bus *usb_busses;
#ifdef __cplusplus
extern "C" {
#endif
#if 0
} /* style */
#endif
/* Function prototypes from "libusb20_compat01.c" */
usb_dev_handle *usb_open(struct usb_device *dev);
int usb_close(usb_dev_handle * dev);
int usb_get_string(usb_dev_handle * dev, int index, int langid, char *buf, size_t buflen);
int usb_get_string_simple(usb_dev_handle * dev, int index, char *buf, size_t buflen);
int usb_get_descriptor_by_endpoint(usb_dev_handle * udev, int ep, uint8_t type, uint8_t index, void *buf, int size);
int usb_get_descriptor(usb_dev_handle * udev, uint8_t type, uint8_t index, void *buf, int size);
int usb_parse_descriptor(uint8_t *source, char *description, void *dest);
int usb_parse_configuration(struct usb_config_descriptor *config, uint8_t *buffer);
void usb_destroy_configuration(struct usb_device *dev);
void usb_fetch_and_parse_descriptors(usb_dev_handle * udev);
int usb_bulk_write(usb_dev_handle * dev, int ep, char *bytes, int size, int timeout);
int usb_bulk_read(usb_dev_handle * dev, int ep, char *bytes, int size, int timeout);
int usb_interrupt_write(usb_dev_handle * dev, int ep, char *bytes, int size, int timeout);
int usb_interrupt_read(usb_dev_handle * dev, int ep, char *bytes, int size, int timeout);
int usb_control_msg(usb_dev_handle * dev, int requesttype, int request, int value, int index, char *bytes, int size, int timeout);
int usb_set_configuration(usb_dev_handle * dev, int configuration);
int usb_claim_interface(usb_dev_handle * dev, int interface);
int usb_release_interface(usb_dev_handle * dev, int interface);
int usb_set_altinterface(usb_dev_handle * dev, int alternate);
int usb_resetep(usb_dev_handle * dev, unsigned int ep);
int usb_clear_halt(usb_dev_handle * dev, unsigned int ep);
int usb_reset(usb_dev_handle * dev);
int usb_check_connected(usb_dev_handle * dev);
const char *usb_strerror(void);
void usb_init(void);
void usb_set_debug(int level);
int usb_find_busses(void);
int usb_find_devices(void);
struct usb_device *usb_device(usb_dev_handle * dev);
struct usb_bus *usb_get_busses(void);
int usb_get_driver_np(usb_dev_handle * dev, int interface, char *name, int namelen);
int usb_detach_kernel_driver_np(usb_dev_handle * dev, int interface);
#if 0
{ /* style */
#endif
#ifdef __cplusplus
}
#endif
#endif /* _LIBUSB20_COMPAT01_H_ */
diff --git a/lib/libxo/libxo/xo_config.h b/lib/libxo/libxo/xo_config.h
index 079eef508ad1..3eed725118c8 100644
--- a/lib/libxo/libxo/xo_config.h
+++ b/lib/libxo/libxo/xo_config.h
@@ -1,257 +1,256 @@
-/* $FreeBSD$ */
/* libxo/xo_config.h. Generated from xo_config.h.in by configure. */
/* libxo/xo_config.h.in. Generated from configure.ac by autoheader. */
/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP
systems. This function is required for `alloca.c' support on those systems.
*/
/* #undef CRAY_STACKSEG_END */
/* Define to 1 if using `alloca.c'. */
/* #undef C_ALLOCA */
/* Define to 1 if you have `alloca', as a function or macro. */
#define HAVE_ALLOCA 1
/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
*/
/* #undef HAVE_ALLOCA_H */
/* Define to 1 if you have the `asprintf' function. */
#define HAVE_ASPRINTF 1
/* Define to 1 if you have the `bzero' function. */
#define HAVE_BZERO 1
/* Define to 1 if you have the `ctime' function. */
#define HAVE_CTIME 1
/* Define to 1 if you have the <ctype.h> header file. */
#define HAVE_CTYPE_H 1
/* Define to 1 if you have the declaration of `__isthreaded', and to 0 if you
don't. */
#define HAVE_DECL___ISTHREADED 1
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the `dlfunc' function. */
#define HAVE_DLFUNC 1
/* Define to 1 if you have the <errno.h> header file. */
#define HAVE_ERRNO_H 1
/* Define to 1 if you have the `fdopen' function. */
#define HAVE_FDOPEN 1
/* Define to 1 if you have the `flock' function. */
#define HAVE_FLOCK 1
/* Define to 1 if you have the `getpass' function. */
#define HAVE_GETPASS 1
/* Define to 1 if you have the `getprogname' function. */
#define HAVE_GETPROGNAME 1
/* Define to 1 if you have the `getrusage' function. */
#define HAVE_GETRUSAGE 1
/* gettext(3) */
/* #undef HAVE_GETTEXT */
/* Define to 1 if you have the `gettimeofday' function. */
#define HAVE_GETTIMEOFDAY 1
/* humanize_number(3) */
#define HAVE_HUMANIZE_NUMBER 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the `crypto' library (-lcrypto). */
#define HAVE_LIBCRYPTO 1
/* Define to 1 if you have the `m' library (-lm). */
#define HAVE_LIBM 1
/* Define to 1 if you have the <libutil.h> header file. */
#define HAVE_LIBUTIL_H 1
/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
to 0 otherwise. */
#define HAVE_MALLOC 1
/* Define to 1 if you have the `memmove' function. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the <monitor.h> header file. */
/* #undef HAVE_MONITOR_H */
/* Support printflike */
/* #undef HAVE_PRINTFLIKE */
/* Define to 1 if your system has a GNU libc compatible `realloc' function,
and to 0 otherwise. */
#define HAVE_REALLOC 1
/* Define to 1 if you have the `srand' function. */
#define HAVE_SRAND 1
/* Define to 1 if you have the `sranddev' function. */
#define HAVE_SRANDDEV 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdio_ext.h> header file. */
/* #undef HAVE_STDIO_EXT_H */
/* Define to 1 if you have the <stdio.h> header file. */
#define HAVE_STDIO_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the <stdtime/tzfile.h> header file. */
/* #undef HAVE_STDTIME_TZFILE_H */
/* Define to 1 if you have the `strchr' function. */
#define HAVE_STRCHR 1
/* Define to 1 if you have the `strcspn' function. */
#define HAVE_STRCSPN 1
/* Define to 1 if you have the `strerror' function. */
#define HAVE_STRERROR 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the `strspn' function. */
#define HAVE_STRSPN 1
/* Have struct sockaddr_un.sun_len */
#define HAVE_SUN_LEN 1
/* Define to 1 if you have the `sysctlbyname' function. */
#define HAVE_SYSCTLBYNAME 1
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/sysctl.h> header file. */
#define HAVE_SYS_SYSCTL_H 1
/* Define to 1 if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <threads.h> header file. */
#define HAVE_THREADS_H 1
/* thread-local setting */
#define HAVE_THREAD_LOCAL THREAD_LOCAL_before
/* Define to 1 if you have the <tzfile.h> header file. */
/* #undef HAVE_TZFILE_H */
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `__flbf' function. */
/* #undef HAVE___FLBF */
/* Enable debugging */
/* #undef LIBXO_DEBUG */
/* Enable text-only rendering */
/* #undef LIBXO_TEXT_ONLY */
/* Version number as dotted value */
#define LIBXO_VERSION "1.4.0"
/* Version number extra information */
#define LIBXO_VERSION_EXTRA ""
/* Version number as a number */
#define LIBXO_VERSION_NUMBER 1004000
/* Version number as string */
#define LIBXO_VERSION_STRING "1004000"
/* Enable local wcwidth implementation */
#define LIBXO_WCWIDTH 1
/* Define to the sub-directory where libtool stores uninstalled libraries. */
#define LT_OBJDIR ".libs/"
/* Name of package */
#define PACKAGE "libxo"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "phil@juniper.net"
/* Define to the full name of this package. */
#define PACKAGE_NAME "libxo"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "libxo 1.4.0"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "libxo"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "1.4.0"
/* If using the C implementation of alloca, define if you know the
direction of stack growth for your system; otherwise it will be
automatically deduced at runtime.
STACK_DIRECTION > 0 => grows toward higher addresses
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown */
/* #undef STACK_DIRECTION */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Use int return codes */
/* #undef USE_INT_RETURN_CODES */
/* Version number of package */
#define VERSION "1.4.0"
/* Retain hash bucket size */
/* #undef XO_RETAIN_SIZE */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define to rpl_malloc if the replacement function should be used. */
/* #undef malloc */
/* Define to rpl_realloc if the replacement function should be used. */
/* #undef realloc */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
diff --git a/lib/msun/src/w_dremf.c b/lib/msun/src/w_dremf.c
index 4bfcff27f702..18df0780135f 100644
--- a/lib/msun/src/w_dremf.c
+++ b/lib/msun/src/w_dremf.c
@@ -1,16 +1,15 @@
/*
* dremf() wrapper for remainderf().
*
* Written by J.T. Conklin, <jtc@wimsey.com>
* Placed into the Public Domain, 1994.
*/
-/* $FreeBSD$ */
#include "math.h"
#include "math_private.h"
float
dremf(float x, float y)
{
return remainderf(x, y);
}
diff --git a/lib/ncurses/ncurses/ncurses_cfg.h b/lib/ncurses/ncurses/ncurses_cfg.h
index 0a92c2f23ba4..26f2066eb063 100644
--- a/lib/ncurses/ncurses/ncurses_cfg.h
+++ b/lib/ncurses/ncurses/ncurses_cfg.h
@@ -1,253 +1,252 @@
/* include/ncurses_cfg.h. Generated automatically by configure. */
/****************************************************************************
* Copyright (c) 1998-2016,2017 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Thomas E. Dickey 1997-on *
****************************************************************************/
/*
* $Id: ncurses_cfg.hin,v 1.11 2017/12/09 20:41:54 tom Exp $
*
* Both ncurses_cfg.h and ncurses_def.h are internal header-files used when
* building ncurses.
*
* This is a template-file used to generate the "ncurses_cfg.h" file.
*
* Rather than list every definition, the configuration script substitutes the
* definitions that it finds using 'sed'. You need a patch (original date
* 971222) to autoconf 2.12 or 2.13 to do this.
*
* See:
* http://invisible-island.net/autoconf/
* ftp://ftp.invisible-island.net/autoconf/
*/
-/* $FreeBSD$ */
#ifndef NC_CONFIG_H
#define NC_CONFIG_H
#define SYSTEM_NAME "FreeBSD"
#if 0
#include <stdlib.h>
#endif
#define HAVE_LONG_FILE_NAMES 1
#define MIXEDCASE_FILENAMES 1
#define USE_SYSMOUSE 1
#define HAVE_BIG_CORE 1
#define TERMPATH "/etc/termcap:/usr/share/misc/termcap"
#define USE_GETCAP 1
#define HAVE_UNISTD_H 1
#define HAVE_REMOVE 1
#define HAVE_UNLINK 1
#define HAVE_LINK 1
#define HAVE_SYMLINK 1
#define USE_LINKS 1
#define BSD_TPUTS 1
#define HAVE_LANGINFO_CODESET 1
#define HAVE_FSEEKO 1
#define STDC_HEADERS 1
#define HAVE_SYS_TYPES_H 1
#define HAVE_SYS_STAT_H 1
#define HAVE_STDLIB_H 1
#define HAVE_STRING_H 1
#define HAVE_MEMORY_H 1
#define HAVE_STRINGS_H 1
#define HAVE_INTTYPES_H 1
#define HAVE_STDINT_H 1
#define HAVE_UNISTD_H 1
#define SIZEOF_SIGNED_CHAR 1
#define NCURSES_EXT_FUNCS 1
#define HAVE_ASSUME_DEFAULT_COLORS 1
#define HAVE_CURSES_VERSION 1
#define HAVE_HAS_KEY 1
#define HAVE_RESIZETERM 1
#define HAVE_RESIZE_TERM 1
#define HAVE_TERM_ENTRY_H 1
#define HAVE_USE_DEFAULT_COLORS 1
#define HAVE_USE_EXTENDED_NAMES 1
#define HAVE_USE_SCREEN 1
#define HAVE_USE_WINDOW 1
#define HAVE_WRESIZE 1
#define NCURSES_SP_FUNCS 1
#define HAVE_TPUTS_SP 1
#define NCURSES_EXT_PUTWIN 1
#define NCURSES_NO_PADDING 1
#define USE_SIGWINCH 1
#define NCURSES_WRAP_PREFIX "_nc_"
#define USE_ASSUMED_COLOR 1
#define USE_HASHMAP 1
#define USE_COLORFGBG 1
#define GCC_SCANF 1
#define GCC_SCANFLIKE(fmt,var) __attribute__((format(scanf,fmt,var)))
#define GCC_PRINTF 1
#define GCC_PRINTFLIKE(fmt,var) __attribute__((format(printf,fmt,var)))
#define GCC_UNUSED __attribute__((unused))
#define GCC_NORETURN __attribute__((noreturn))
#define HAVE_NC_ALLOC_H 1
#define HAVE_GETTIMEOFDAY 1
#define STDC_HEADERS 1
#define HAVE_DIRENT_H 1
#define TIME_WITH_SYS_TIME 1
#define HAVE_REGEX_H_FUNCS 1
#define HAVE_FCNTL_H 1
#define HAVE_GETOPT_H 1
#define HAVE_LIMITS_H 1
#define HAVE_LOCALE_H 1
#define HAVE_MATH_H 1
#define HAVE_POLL_H 1
#define HAVE_SYS_IOCTL_H 1
#define HAVE_SYS_PARAM_H 1
#define HAVE_SYS_POLL_H 1
#define HAVE_SYS_SELECT_H 1
#define HAVE_SYS_TIME_H 1
#define HAVE_SYS_TIMES_H 1
#define HAVE_TTYENT_H 1
#define HAVE_UNISTD_H 1
#define HAVE_WCTYPE_H 1
#define HAVE_UNISTD_H 1
#define HAVE_GETOPT_H 1
#define HAVE_GETOPT_HEADER 1
#define HAVE_SYS_TIME_SELECT 1
#define SIG_ATOMIC_T volatile sig_atomic_t
#define HAVE_ERRNO 1
#define HAVE_GETCWD 1
#define HAVE_GETEGID 1
#define HAVE_GETEUID 1
#define HAVE_GETOPT 1
#define HAVE_GETTTYNAM 1
#define HAVE_ISSETUGID 1
#define HAVE_LOCALECONV 1
#define HAVE_POLL 1
#define HAVE_PUTENV 1
#define HAVE_REMOVE 1
#define HAVE_SELECT 1
#define HAVE_SETBUF 1
#define HAVE_SETBUFFER 1
#define HAVE_SETENV 1
#define HAVE_SETVBUF 1
#define HAVE_SIGACTION 1
#define HAVE_SIGVEC 1
#define HAVE_STRDUP 1
#define HAVE_STRSTR 1
#define HAVE_SYSCONF 1
#define HAVE_TCGETPGRP 1
#define HAVE_TIMES 1
#define HAVE_TSEARCH 1
#define HAVE_VSNPRINTF 1
#define HAVE_BSD_CGETENT 1
#define HAVE_ISASCII 1
#define HAVE_NANOSLEEP 1
#define HAVE_TERMIOS_H 1
#define HAVE_UNISTD_H 1
#define HAVE_SYS_IOCTL_H 1
#define HAVE_TCGETATTR 1
#define HAVE_VSSCANF 1
#define HAVE_UNISTD_H 1
#define HAVE_MKSTEMP 1
#define HAVE_SIZECHANGE 1
#define HAVE_WORKING_POLL 1
#define HAVE_VA_COPY 1
#define HAVE_UNISTD_H 1
#define HAVE_FORK 1
#define HAVE_VFORK 1
#define HAVE_WORKING_VFORK 1
#define HAVE_WORKING_FORK 1
#define USE_FOPEN_BIN_R 1
#define USE_OPENPTY_HEADER <libutil.h>
#define USE_XTERM_PTY 1
#define USE_HASHED_DB 1
#define HAVE_TYPEINFO 1
#define HAVE_IOSTREAM 1
#define IOSTREAM_NAMESPACE 1
#define CPP_HAS_STATIC_CAST 1
#define HAVE_SLK_COLOR 1
#define HAVE_PANEL_H 1
#define HAVE_LIBPANEL 1
#define HAVE_MENU_H 1
#define HAVE_LIBMENU 1
#define HAVE_FORM_H 1
#define HAVE_LIBFORM 1
#define NCURSES_PATHSEP ':'
#define NCURSES_VERSION_STRING "6.2.20200215"
#define NCURSES_OSPEED_COMPAT 1
#define HAVE_CURSES_DATA_BOOLNAMES 1
/*
* Begin FreeBSD-specific changes
*/
/* Support ENABLE_WIDEC */
#ifdef ENABLE_WIDEC
#define USE_WIDEC_SUPPORT 1
#define NCURSES_WIDECHAR 1
#define NCURSES_EXT_FUNCS 1
#define NCURSES_EXT_COLORS 1
#define HAVE_ALLOC_PAIR 1
#define HAVE_INIT_EXTENDED_COLOR 1
#define HAVE_RESET_COLOR_PAIRS 1
#define HAVE_PUTWC 1
#define HAVE_BTOWC 1
#define HAVE_WCTOB 1
#define HAVE_MBTOWC 1
#define HAVE_WCTOMB 1
#define HAVE_MBLEN 1
#define HAVE_MBRLEN 1
#define HAVE_MBRTOWC 1
#define HAVE_WCSRTOMBS 1
#define HAVE_MBSRTOWCS 1
#define HAVE_WCSTOMBS 1
#define HAVE_MBSTOWCS 1
#define NEED_WCHAR_H 1
#define SIZEOF_WCHAR_T 4
#endif
/*
* End FreeBSD-specific changes
*/
#include <ncurses_def.h>
/* The C compiler may not treat these properly but C++ has to */
#ifdef __cplusplus
#undef const
#undef inline
#endif
/* On HP-UX, the C compiler doesn't grok mbstate_t without
-D_XOPEN_SOURCE=500. However, this causes problems on
IRIX. So, we #define mbstate_t to int in configure.in
only for the C compiler if needed. */
#ifndef __cplusplus
#ifdef NEED_MBSTATE_T_DEF
#define mbstate_t int
#endif
#endif
/*
* vile:cmode
*/
#endif /* NC_CONFIG_H */
diff --git a/libexec/bootpd/bptypes.h b/libexec/bootpd/bptypes.h
index e27cc832c5fe..13882d03eb29 100644
--- a/libexec/bootpd/bptypes.h
+++ b/libexec/bootpd/bptypes.h
@@ -1,23 +1,22 @@
-/* $FreeBSD$
*/
#ifndef BPTYPES_H
#define BPTYPES_H
#include <sys/types.h>
/*
* 32 bit integers are different types on various architectures
*/
#define int32 int32_t
#define u_int32 u_int32_t
/*
* Nice typedefs. . .
*/
typedef int boolean;
typedef unsigned char byte;
#endif /* BPTYPES_H */
diff --git a/libexec/bootpd/dovend.h b/libexec/bootpd/dovend.h
index ef3b62de7126..f1ea014a2f01 100644
--- a/libexec/bootpd/dovend.h
+++ b/libexec/bootpd/dovend.h
@@ -1,6 +1,5 @@
/* dovend.h */
-/* $FreeBSD$ */
extern int dovend_rfc1497(struct host *hp, u_char *buf, int len);
extern int insert_ip(int, struct in_addr_list *, u_char **, int *);
extern void insert_u_long(u_int32, u_char **);
diff --git a/libexec/bootpd/getether.h b/libexec/bootpd/getether.h
index 026df158b50c..a68b1f8f12f5 100644
--- a/libexec/bootpd/getether.h
+++ b/libexec/bootpd/getether.h
@@ -1,4 +1,3 @@
/* getether.h */
-/* $FreeBSD$ */
extern int getether(char *ifname, char *eaptr);
diff --git a/libexec/bootpd/getif.h b/libexec/bootpd/getif.h
index a2c86cfba04b..3199b6c151dc 100644
--- a/libexec/bootpd/getif.h
+++ b/libexec/bootpd/getif.h
@@ -1,4 +1,3 @@
/* getif.h */
-/* $FreeBSD$ */
extern struct ifreq *getif(int, struct in_addr *);
diff --git a/libexec/bootpd/lookup.h b/libexec/bootpd/lookup.h
index 4940f054696a..3b1890967351 100644
--- a/libexec/bootpd/lookup.h
+++ b/libexec/bootpd/lookup.h
@@ -1,8 +1,7 @@
/* lookup.h */
-/* $FreeBSD$ */
#include "bptypes.h" /* for int32, u_int32 */
extern u_char *lookup_hwa(char *hostname, int htype);
extern int lookup_ipa(char *hostname, u_int32 *addr);
extern int lookup_netmask(u_int32 addr, u_int32 *mask);
diff --git a/libexec/bootpd/readfile.h b/libexec/bootpd/readfile.h
index be9cada23779..5da0c42af4a2 100644
--- a/libexec/bootpd/readfile.h
+++ b/libexec/bootpd/readfile.h
@@ -1,11 +1,10 @@
/* readfile.h */
-/* $FreeBSD$ */
#include "bptypes.h"
#include "hash.h"
extern boolean hwlookcmp(hash_datum *, hash_datum *);
extern boolean iplookcmp(hash_datum *, hash_datum *);
extern boolean nmcmp(hash_datum *, hash_datum *);
extern void readtab(int);
extern void rdtab_init(void);
diff --git a/libexec/bootpd/report.c b/libexec/bootpd/report.c
index 290e19e74063..94035e8e3e41 100644
--- a/libexec/bootpd/report.c
+++ b/libexec/bootpd/report.c
@@ -1,138 +1,137 @@
-/* $FreeBSD$ */
/*
* report() - calls syslog
*/
#include <stdarg.h>
#include <stdio.h>
#include <syslog.h>
#include <string.h>
#include <errno.h>
#include "report.h"
#ifndef LOG_NDELAY
#define LOG_NDELAY 0
#endif
#ifndef LOG_DAEMON
#define LOG_DAEMON 0
#endif
#ifndef LOG_BOOTP
#define LOG_BOOTP LOG_DAEMON
#endif
extern int debug;
extern char *progname;
/*
* This is initialized so you get stderr until you call
* report_init()
*/
static int stderr_only = 1;
void
report_init(nolog)
int nolog;
{
stderr_only = nolog;
#ifdef SYSLOG
if (!stderr_only) {
openlog(progname, LOG_PID | LOG_NDELAY, LOG_BOOTP);
}
#endif
}
/*
* This routine reports errors and such via stderr and syslog() if
* appopriate. It just helps avoid a lot of "#ifdef SYSLOG" constructs
* from being scattered throughout the code.
*
* The syntax is identical to syslog(3), but %m is not considered special
* for output to stderr (i.e. you'll see "%m" in the output. . .). Also,
* control strings should normally end with \n since newlines aren't
* automatically generated for stderr output (whereas syslog strips out all
* newlines and adds its own at the end).
*/
static char *levelnames[] = {
#ifdef LOG_SALERT
"level(0): ",
"alert(1): ",
"alert(2): ",
"emerg(3): ",
"error(4): ",
"crit(5): ",
"warn(6): ",
"note(7): ",
"info(8): ",
"debug(9): ",
"level(?): "
#else
"emerg(0): ",
"alert(1): ",
"crit(2): ",
"error(3): ",
"warn(4): ",
"note(5): ",
"info(6): ",
"debug(7): ",
"level(?): "
#endif
};
static int numlevels = sizeof(levelnames) / sizeof(levelnames[0]);
/*
* Print a log message using syslog(3) and/or stderr.
* The message passed in should not include a newline.
*/
void
report(int priority, const char *fmt,...)
{
va_list ap;
static char buf[128];
if ((priority < 0) || (priority >= numlevels)) {
priority = numlevels - 1;
}
va_start(ap, fmt);
vsnprintf(buf, sizeof(buf), fmt, ap);
va_end(ap);
/*
* Print the message
*/
if (stderr_only || (debug > 2)) {
fprintf(stderr, "%s: %s %s\n",
progname, levelnames[priority], buf);
}
#ifdef SYSLOG
if (!stderr_only)
syslog((priority | LOG_BOOTP), "%s", buf);
#endif
}
/*
* Return pointer to static string which gives full filesystem error message.
*/
const char *
get_errmsg()
{
return strerror(errno);
}
/*
* Local Variables:
* tab-width: 4
* c-indent-level: 4
* c-argdecl-indent: 4
* c-continued-statement-offset: 4
* c-continued-brace-offset: -4
* c-label-offset: -4
* c-brace-offset: 0
* End:
*/
diff --git a/libexec/bootpd/report.h b/libexec/bootpd/report.h
index 55cec5c76845..a51e5f27f1f1 100644
--- a/libexec/bootpd/report.h
+++ b/libexec/bootpd/report.h
@@ -1,6 +1,5 @@
/* report.h */
-/* $FreeBSD$ */
extern void report_init(int nolog);
extern void report(int, const char *, ...) __printflike(2, 3);
extern const char *get_errmsg(void);
diff --git a/libexec/bootpd/tools/bootptest/bootptest.h b/libexec/bootpd/tools/bootptest/bootptest.h
index 2d9e451bddef..e4da8c6bbb47 100644
--- a/libexec/bootpd/tools/bootptest/bootptest.h
+++ b/libexec/bootpd/tools/bootptest/bootptest.h
@@ -1,18 +1,17 @@
/* bootptest.h */
-/* $FreeBSD$ */
/*
* Hacks for sharing print-bootp.c between tcpdump and bootptest.
*/
#define ESRC(p) (p)
#define EDST(p) (p)
extern int vflag; /* verbose flag */
/* global pointers to beginning and end of current packet (during printing) */
extern unsigned char *packetp;
extern unsigned char *snapend;
void bootp_print(struct bootp *bp, int length, u_short sport,
u_short dport);
char *ipaddr_string(struct in_addr *);
int printfn(u_char *s, u_char *ep);
diff --git a/libexec/flua/linit_flua.c b/libexec/flua/linit_flua.c
index b62084b66ffa..671a0300783c 100644
--- a/libexec/flua/linit_flua.c
+++ b/libexec/flua/linit_flua.c
@@ -1,76 +1,75 @@
-/* $FreeBSD$ */
/*
** $Id: linit.c,v 1.39.1.1 2017/04/19 17:20:42 roberto Exp $
** Initialization of libraries for lua.c and other clients
** See Copyright Notice in lua.h
*/
#define linit_c
#define LUA_LIB
/*
** If you embed Lua in your program and need to open the standard
** libraries, call luaL_openlibs in your program. If you need a
** different set of libraries, copy this file to your project and edit
** it to suit your needs.
**
** You can also *preload* libraries, so that a later 'require' can
** open the library, which is already linked to the application.
** For that, do the following code:
**
** luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_PRELOAD_TABLE);
** lua_pushcfunction(L, luaopen_modname);
** lua_setfield(L, -2, modname);
** lua_pop(L, 1); // remove PRELOAD table
*/
#include "lprefix.h"
#include <stddef.h>
#include "lua.h"
#include "lualib.h"
#include "lauxlib.h"
#include "lfs.h"
#include "lposix.h"
#include "lua_ucl.h"
/*
** these libs are loaded by lua.c and are readily available to any Lua
** program
*/
static const luaL_Reg loadedlibs[] = {
{"_G", luaopen_base},
{LUA_LOADLIBNAME, luaopen_package},
{LUA_COLIBNAME, luaopen_coroutine},
{LUA_TABLIBNAME, luaopen_table},
{LUA_IOLIBNAME, luaopen_io},
{LUA_OSLIBNAME, luaopen_os},
{LUA_STRLIBNAME, luaopen_string},
{LUA_MATHLIBNAME, luaopen_math},
{LUA_UTF8LIBNAME, luaopen_utf8},
{LUA_DBLIBNAME, luaopen_debug},
#if defined(LUA_COMPAT_BITLIB)
{LUA_BITLIBNAME, luaopen_bit32},
#endif
/* FreeBSD Extensions */
{"lfs", luaopen_lfs},
{"posix.sys.stat", luaopen_posix_sys_stat},
{"posix.unistd", luaopen_posix_unistd},
{"ucl", luaopen_ucl},
{NULL, NULL}
};
LUALIB_API void luaL_openlibs (lua_State *L) {
const luaL_Reg *lib;
/* "require" functions from 'loadedlibs' and set results to global table */
for (lib = loadedlibs; lib->func; lib++) {
luaL_requiref(L, lib->name, lib->func, 1);
lua_pop(L, 1); /* remove lib */
}
}
diff --git a/libexec/flua/modules/lposix.h b/libexec/flua/modules/lposix.h
index d2d9ec0cd677..6085bf045d79 100644
--- a/libexec/flua/modules/lposix.h
+++ b/libexec/flua/modules/lposix.h
@@ -1,12 +1,11 @@
/*-
*
* This file is in the public domain.
*/
-/* $FreeBSD$ */
#pragma once
#include <lua.h>
int luaopen_posix_sys_stat(lua_State *L);
int luaopen_posix_unistd(lua_State *L);
diff --git a/libexec/ftpd/blacklist.c b/libexec/ftpd/blacklist.c
index 7aca755f7d2d..e8954f11bbe7 100644
--- a/libexec/ftpd/blacklist.c
+++ b/libexec/ftpd/blacklist.c
@@ -1,57 +1,56 @@
/*-
* Copyright (c) 2016 The FreeBSD Foundation
* All rights reserved.
*
* This software was developed by Kurt Lidl under sponsorship from the
* FreeBSD Foundation.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE. */
-/* $FreeBSD$ */
#include <ctype.h>
#include <stdarg.h>
#include <stdlib.h>
#include <unistd.h>
#include <blacklist.h>
#include "blacklist_client.h"
static struct blacklist *blstate;
extern int use_blacklist;
void
blacklist_init(void)
{
if (use_blacklist)
blstate = blacklist_open();
}
void
blacklist_notify(int action, int fd, const char *msg)
{
if (blstate == NULL)
return;
(void)blacklist_r(blstate, action, fd, msg);
}
diff --git a/libexec/ftpd/blacklist_client.h b/libexec/ftpd/blacklist_client.h
index 391b49c9bdfd..94ecc66c17ce 100644
--- a/libexec/ftpd/blacklist_client.h
+++ b/libexec/ftpd/blacklist_client.h
@@ -1,55 +1,54 @@
/*-
* Copyright (c) 2016 The FreeBSD Foundation
* All rights reserved.
*
* This software was developed by Kurt Lidl under sponsorship from the
* FreeBSD Foundation.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE. */
-/* $FreeBSD$ */
#ifndef BLACKLIST_CLIENT_H
#define BLACKLIST_CLIENT_H
#ifndef BLACKLIST_API_ENUM
enum {
BLACKLIST_AUTH_OK = 0,
BLACKLIST_AUTH_FAIL
};
#endif
#ifdef USE_BLACKLIST
void blacklist_init(void);
void blacklist_notify(int, int, const char *);
#define BLACKLIST_INIT() blacklist_init()
#define BLACKLIST_NOTIFY(x, y, z) blacklist_notify(x, y, z)
#else
#define BLACKLIST_INIT()
#define BLACKLIST_NOTIFY(x, y, z)
#endif
#endif /* BLACKLIST_CLIENT_H */
diff --git a/libexec/ftpd/config.h b/libexec/ftpd/config.h
index 8e10bbb270dc..c5ca1f01e10e 100644
--- a/libexec/ftpd/config.h
+++ b/libexec/ftpd/config.h
@@ -1,281 +1,280 @@
-/* $FreeBSD$ */
/* config.h. Generated automatically by configure. */
/* config.h.in. Generated automatically from configure.in by autoheader. */
/* $Id: config.h.in,v 1.15 2001/04/28 07:11:46 lukem Exp $ */
/* Define if the closedir function returns void instead of int. */
/* #undef CLOSEDIR_VOID */
/* Define to empty if the keyword does not work. */
/* #undef const */
/* Define if your C compiler doesn't accept -c and -o together. */
/* #undef NO_MINUS_C_MINUS_O */
/* Define if your Fortran 77 compiler doesn't accept -c and -o together. */
/* #undef F77_NO_MINUS_C_MINUS_O */
/* Define to `long' if <sys/types.h> doesn't define. */
/* #undef off_t */
/* Define to the type of arg1 for select(). */
/* #undef SELECT_TYPE_ARG1 */
/* Define to the type of args 2, 3 and 4 for select(). */
/* #undef SELECT_TYPE_ARG234 */
/* Define to the type of arg5 for select(). */
/* #undef SELECT_TYPE_ARG5 */
/* Define if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define if you can safely include both <sys/time.h> and <time.h>. */
#define TIME_WITH_SYS_TIME 1
/* Define if the closedir function returns void instead of int. */
/* #undef VOID_CLOSEDIR */
/* The number of bytes in a off_t. */
#define SIZEOF_OFF_T 0
/* Define if you have the err function. */
#define HAVE_ERR 1
/* Define if you have the fgetln function. */
#define HAVE_FGETLN 1
/* Define if you have the flock function. */
#define HAVE_FLOCK 1
/* Define if you have the fparseln function. */
#define HAVE_FPARSELN 1
/* Define if you have the fts_open function. */
#define HAVE_FTS_OPEN 1
/* Define if you have the getaddrinfo function. */
#define HAVE_GETADDRINFO 1
/* Define if you have the getgrouplist function. */
#define HAVE_GETGROUPLIST 1
/* Define if you have the getnameinfo function. */
#define HAVE_GETNAMEINFO 1
/* Define if you have the getspnam function. */
/* #undef HAVE_GETSPNAM */
/* Define if you have the getusershell function. */
#define HAVE_GETUSERSHELL 1
/* Define if you have the inet_net_pton function. */
#define HAVE_INET_NET_PTON 1
/* Define if you have the inet_ntop function. */
#define HAVE_INET_NTOP 1
/* Define if you have the inet_pton function. */
#define HAVE_INET_PTON 1
/* Define if you have the lockf function. */
#define HAVE_LOCKF 1
/* Define if you have the mkstemp function. */
#define HAVE_MKSTEMP 1
/* Define if you have the setlogin function. */
#define HAVE_SETLOGIN 1
/* Define if you have the setproctitle function. */
#define HAVE_SETPROCTITLE 1
/* Define if you have the sl_init function. */
#define HAVE_SL_INIT 1
/* Define if you have the snprintf function. */
#define HAVE_SNPRINTF 1
/* Define if you have the strdup function. */
#define HAVE_STRDUP 1
/* Define if you have the strerror function. */
#define HAVE_STRERROR 1
/* Define if you have the strlcat function. */
#define HAVE_STRLCAT 1
/* Define if you have the strlcpy function. */
#define HAVE_STRLCPY 1
/* Define if you have the strmode function. */
#define HAVE_STRMODE 1
/* Define if you have the strsep function. */
#define HAVE_STRSEP 1
/* Define if you have the strtoll function. */
#define HAVE_STRTOLL 1
/* Define if you have the user_from_uid function. */
#define HAVE_USER_FROM_UID 1
/* Define if you have the usleep function. */
#define HAVE_USLEEP 1
/* Define if you have the vfork function. */
#define HAVE_VFORK 1
/* Define if you have the vsyslog function. */
#define HAVE_VSYSLOG 1
/* Define if you have the <arpa/nameser.h> header file. */
#define HAVE_ARPA_NAMESER_H 1
/* Define if you have the <dirent.h> header file. */
#define HAVE_DIRENT_H 1
/* Define if you have the <err.h> header file. */
#define HAVE_ERR_H 1
/* Define if you have the <fts.h> header file. */
#define HAVE_FTS_H 1
/* Define if you have the <libutil.h> header file. */
#define HAVE_LIBUTIL_H 1
/* Define if you have the <ndir.h> header file. */
/* #undef HAVE_NDIR_H */
/* Define if you have the <paths.h> header file. */
#define HAVE_PATHS_H 1
/* Define if you have the <sys/dir.h> header file. */
#define HAVE_SYS_DIR_H 1
/* Define if you have the <sys/ndir.h> header file. */
/* #undef HAVE_SYS_NDIR_H */
/* Define if you have the <sys/sysmacros.h> header file. */
/* #undef HAVE_SYS_SYSMACROS_H */
/* Define if you have the <util.h> header file. */
/* #undef HAVE_UTIL_H */
/* Define if you have the crypt library (-lcrypt). */
#define HAVE_LIBCRYPT 1
/* Define if you have the nsl library (-lnsl). */
/* #undef HAVE_LIBNSL */
/* Define if you have the skey library (-lskey). */
/* #undef HAVE_LIBSKEY */
/* Define if you have the socket library (-lsocket). */
/* #undef HAVE_LIBSOCKET */
/* Define if you have the util library (-lutil). */
#define HAVE_LIBUTIL 1
/* Define if your compiler supports `long long' */
#define HAVE_LONG_LONG 1
/* Define if *printf() uses %qd to print `long long' (otherwise uses %lld) */
#define HAVE_PRINTF_QD 1
/* Define if in_port_t exists */
#define HAVE_IN_PORT_T 1
/* Define if struct sockaddr.sa_len exists (implies sockaddr_in.sin_len, etc) */
#define HAVE_SOCKADDR_SA_LEN 1
/* Define if socklen_t exists */
#define HAVE_SOCKLEN_T 1
/* Define if AF_INET6 exists in <sys/socket.h> */
#define HAVE_AF_INET6 1
/* Define if `struct sockaddr_in6' exists in <netinet/in.h> */
#define HAVE_SOCKADDR_IN6 1
/* Define if `struct addrinfo' exists in <netdb.h> */
#define HAVE_ADDRINFO 1
/*
* Define if <netdb.h> contains AI_NUMERICHOST et al.
* Systems which only implement RFC2133 will need this.
*/
#define HAVE_RFC2553_NETDB 1
/* Define if `struct direct' has a d_namlen element */
#define HAVE_D_NAMLEN 1
/* Define if struct passwd.pw_expire exists. */
#define HAVE_PW_EXPIRE 1
/* Define if GLOB_BRACE, gl_path and gl_match exist in <glob.h> */
#define HAVE_WORKING_GLOB 1
/* Define if crypt() is declared in <unistd.h> */
#define HAVE_CRYPT_D 1
/* Define if fclose() is declared in <stdio.h> */
#define HAVE_FCLOSE_D 1
/* Define if optarg is declared in <stdlib.h> or <unistd.h> */
#define HAVE_OPTARG_D 1
/* Define if optind is declared in <stdlib.h> or <unistd.h> */
#define HAVE_OPTIND_D 1
/* Define if optreset exists */
#define HAVE_OPTRESET 1
/* Define if pclose() is declared in <stdio.h> */
#define HAVE_PCLOSE_D 1
/* Define if getusershell() is declared in <unistd.h> */
#define HAVE_GETUSERSHELL_D 1
/* Define if `long long' is supported and sizeof(off_t) >= 8 */
#define HAVE_QUAD_SUPPORT 1
/* Define if not using in-built /bin/ls code */
/* #undef NO_INTERNAL_LS */
/* Define if using S/Key */
/* #undef SKEY */
/*
* Define this if compiling with SOCKS (the firewall traversal library).
* Also, you must define connect, getsockname, bind, accept, listen, and
* select to their R-versions.
*/
/* #undef SOCKS */
/* #undef SOCKS4 */
/* #undef SOCKS5 */
/* #undef connect */
/* #undef getsockname */
/* #undef bind */
/* #undef accept */
/* #undef listen */
/* #undef select */
/* #undef dup */
/* #undef dup2 */
/* #undef fclose */
/* #undef gethostbyname */
/* #undef getpeername */
/* #undef read */
/* #undef recv */
/* #undef recvfrom */
/* #undef rresvport */
/* #undef send */
/* #undef sendto */
/* #undef shutdown */
/* #undef write */
/* Define if you have the <arpa/ftp.h> header file. */
#define HAVE_FTP_NAMES 1
diff --git a/sbin/dhclient/dhcp.h b/sbin/dhclient/dhcp.h
index 9183a9c82aec..300deb464238 100644
--- a/sbin/dhclient/dhcp.h
+++ b/sbin/dhclient/dhcp.h
@@ -1,187 +1,186 @@
/* $OpenBSD: dhcp.h,v 1.5 2004/05/04 15:49:49 deraadt Exp $ */
-/* $FreeBSD$ */
/* Protocol structures... */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1995, 1996 The Internet Software Consortium.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of The Internet Software Consortium nor the names
* of its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INTERNET SOFTWARE CONSORTIUM AND
* CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE INTERNET SOFTWARE CONSORTIUM OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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
* SUCH DAMAGE.
*
* This software has been written for the Internet Software Consortium
* by Ted Lemon <mellon@fugue.com> in cooperation with Vixie
* Enterprises. To learn more about the Internet Software Consortium,
* see ``http://www.vix.com/isc''. To learn more about Vixie
* Enterprises, see ``http://www.vix.com''.
*/
#define DHCP_UDP_OVERHEAD (14 + /* Ethernet header */ \
20 + /* IP header */ \
8) /* UDP header */
#define DHCP_SNAME_LEN 64
#define DHCP_FILE_LEN 128
#define DHCP_FIXED_NON_UDP 236
#define DHCP_FIXED_LEN (DHCP_FIXED_NON_UDP + DHCP_UDP_OVERHEAD)
/* Everything but options. */
#define DHCP_MTU_MAX 1500
#define DHCP_OPTION_LEN (DHCP_MTU_MAX - DHCP_FIXED_LEN)
#define BOOTP_MIN_LEN 300
#define DHCP_MIN_LEN 548
struct dhcp_packet {
u_int8_t op; /* Message opcode/type */
u_int8_t htype; /* Hardware addr type (see net/if_types.h) */
u_int8_t hlen; /* Hardware addr length */
u_int8_t hops; /* Number of relay agent hops from client */
u_int32_t xid; /* Transaction ID */
u_int16_t secs; /* Seconds since client started looking */
u_int16_t flags; /* Flag bits */
struct in_addr ciaddr; /* Client IP address (if already in use) */
struct in_addr yiaddr; /* Client IP address */
struct in_addr siaddr; /* IP address of next server to talk to */
struct in_addr giaddr; /* DHCP relay agent IP address */
unsigned char chaddr[16]; /* Client hardware address */
char sname[DHCP_SNAME_LEN]; /* Server name */
char file[DHCP_FILE_LEN]; /* Boot filename */
unsigned char options[DHCP_OPTION_LEN];
/* Optional parameters
(actual length dependent on MTU). */
};
/* BOOTP (rfc951) message types */
#define BOOTREQUEST 1
#define BOOTREPLY 2
/* Possible values for flags field... */
#define BOOTP_BROADCAST 32768L
/* Possible values for hardware type (htype) field... */
#define HTYPE_ETHER 1 /* Ethernet */
#define HTYPE_IEEE802 6 /* IEEE 802.2 Token Ring... */
#define HTYPE_FDDI 8 /* FDDI... */
/* Magic cookie validating dhcp options field (and bootp vendor
extensions field). */
#define DHCP_OPTIONS_COOKIE "\143\202\123\143"
/* DHCP Option codes: */
#define DHO_PAD 0
#define DHO_SUBNET_MASK 1
#define DHO_TIME_OFFSET 2
#define DHO_ROUTERS 3
#define DHO_TIME_SERVERS 4
#define DHO_NAME_SERVERS 5
#define DHO_DOMAIN_NAME_SERVERS 6
#define DHO_LOG_SERVERS 7
#define DHO_COOKIE_SERVERS 8
#define DHO_LPR_SERVERS 9
#define DHO_IMPRESS_SERVERS 10
#define DHO_RESOURCE_LOCATION_SERVERS 11
#define DHO_HOST_NAME 12
#define DHO_BOOT_SIZE 13
#define DHO_MERIT_DUMP 14
#define DHO_DOMAIN_NAME 15
#define DHO_SWAP_SERVER 16
#define DHO_ROOT_PATH 17
#define DHO_EXTENSIONS_PATH 18
#define DHO_IP_FORWARDING 19
#define DHO_NON_LOCAL_SOURCE_ROUTING 20
#define DHO_POLICY_FILTER 21
#define DHO_MAX_DGRAM_REASSEMBLY 22
#define DHO_DEFAULT_IP_TTL 23
#define DHO_PATH_MTU_AGING_TIMEOUT 24
#define DHO_PATH_MTU_PLATEAU_TABLE 25
#define DHO_INTERFACE_MTU 26
#define DHO_ALL_SUBNETS_LOCAL 27
#define DHO_BROADCAST_ADDRESS 28
#define DHO_PERFORM_MASK_DISCOVERY 29
#define DHO_MASK_SUPPLIER 30
#define DHO_ROUTER_DISCOVERY 31
#define DHO_ROUTER_SOLICITATION_ADDRESS 32
#define DHO_STATIC_ROUTES 33
#define DHO_TRAILER_ENCAPSULATION 34
#define DHO_ARP_CACHE_TIMEOUT 35
#define DHO_IEEE802_3_ENCAPSULATION 36
#define DHO_DEFAULT_TCP_TTL 37
#define DHO_TCP_KEEPALIVE_INTERVAL 38
#define DHO_TCP_KEEPALIVE_GARBAGE 39
#define DHO_NIS_DOMAIN 40
#define DHO_NIS_SERVERS 41
#define DHO_NTP_SERVERS 42
#define DHO_VENDOR_ENCAPSULATED_OPTIONS 43
#define DHO_NETBIOS_NAME_SERVERS 44
#define DHO_NETBIOS_DD_SERVER 45
#define DHO_NETBIOS_NODE_TYPE 46
#define DHO_NETBIOS_SCOPE 47
#define DHO_FONT_SERVERS 48
#define DHO_X_DISPLAY_MANAGER 49
#define DHO_DHCP_REQUESTED_ADDRESS 50
#define DHO_DHCP_LEASE_TIME 51
#define DHO_DHCP_OPTION_OVERLOAD 52
#define DHO_DHCP_MESSAGE_TYPE 53
#define DHO_DHCP_SERVER_IDENTIFIER 54
#define DHO_DHCP_PARAMETER_REQUEST_LIST 55
#define DHO_DHCP_MESSAGE 56
#define DHO_DHCP_MAX_MESSAGE_SIZE 57
#define DHO_DHCP_RENEWAL_TIME 58
#define DHO_DHCP_REBINDING_TIME 59
#define DHO_DHCP_CLASS_IDENTIFIER 60
#define DHO_DHCP_CLIENT_IDENTIFIER 61
#define DHO_NISPLUS_DOMAIN 64
#define DHO_NISPLUS_SERVERS 65
#define DHO_TFTP_SERVER_NAME 66
#define DHO_BOOTFILE_NAME 67
#define DHO_MOBILE_IP_HOME_AGENT 68
#define DHO_SMTP_SERVER 69
#define DHO_POP_SERVER 70
#define DHO_NNTP_SERVER 71
#define DHO_WWW_SERVER 72
#define DHO_FINGER_SERVER 73
#define DHO_IRC_SERVER 74
#define DHO_STREETTALK_SERVER 75
#define DHO_STREETTALK_DA_SERVER 76
#define DHO_DHCP_USER_CLASS_ID 77
#define DHO_URL 114
#define DHO_DOMAIN_SEARCH 119
#define DHO_CLASSLESS_ROUTES 121
#define DHO_END 255
/* DHCP message types. */
#define DHCPDISCOVER 1
#define DHCPOFFER 2
#define DHCPREQUEST 3
#define DHCPDECLINE 4
#define DHCPACK 5
#define DHCPNAK 6
#define DHCPRELEASE 7
#define DHCPINFORM 8
diff --git a/sbin/dhclient/tests/fake.c b/sbin/dhclient/tests/fake.c
index 6a170953beb0..6bfaf3d01656 100644
--- a/sbin/dhclient/tests/fake.c
+++ b/sbin/dhclient/tests/fake.c
@@ -1,63 +1,62 @@
-/* $FreeBSD$ */
#include <setjmp.h>
#include <stdarg.h>
#include <stdio.h>
#include "dhcpd.h"
extern jmp_buf env;
void
error(const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
(void)vfprintf(stderr, fmt, ap);
va_end(ap);
fprintf(stderr, "\n");
longjmp(env, 1);
}
int
warning(const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
(void)vfprintf(stderr, fmt, ap);
va_end(ap);
fprintf(stderr, "\n");
/*
* The original warning() would return "ret" here. We do this to
* check warnings explicitly.
*/
longjmp(env, 1);
}
int
note(const char *fmt, ...)
{
int ret;
va_list ap;
va_start(ap, fmt);
ret = vfprintf(stderr, fmt, ap);
va_end(ap);
fprintf(stderr, "\n");
return ret;
}
void
bootp(struct packet *packet)
{
}
void
dhcp(struct packet *packet)
{
}
diff --git a/sbin/dhclient/tests/option-domain-search.c b/sbin/dhclient/tests/option-domain-search.c
index b79f9a560137..2969f300693b 100644
--- a/sbin/dhclient/tests/option-domain-search.c
+++ b/sbin/dhclient/tests/option-domain-search.c
@@ -1,328 +1,327 @@
-/* $FreeBSD$ */
#include <setjmp.h>
#include <stdlib.h>
#include "dhcpd.h"
jmp_buf env;
void expand_domain_search(struct packet *packet);
void
no_option_present()
{
int ret;
struct option_data option;
struct packet p;
option.data = NULL;
option.len = 0;
p.options[DHO_DOMAIN_SEARCH] = option;
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (p.options[DHO_DOMAIN_SEARCH].len != 0 ||
p.options[DHO_DOMAIN_SEARCH].data != NULL)
abort();
}
void
one_domain_valid()
{
int ret;
struct packet p;
struct option_data *option;
char *data = "\007example\003org\0";
char *expected = "example.org.";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 13;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (option->len != strlen(expected) ||
strcmp(option->data, expected) != 0)
abort();
free(option->data);
}
void
one_domain_truncated1()
{
int ret;
struct option_data *option;
struct packet p;
char *data = "\007example\003org";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 12;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
one_domain_truncated2()
{
int ret;
struct option_data *option;
struct packet p;
char *data = "\007ex";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 3;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
two_domains_valid()
{
int ret;
struct packet p;
struct option_data *option;
char *data = "\007example\003org\0\007example\003com\0";
char *expected = "example.org. example.com.";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 26;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (option->len != strlen(expected) ||
strcmp(option->data, expected) != 0)
abort();
free(option->data);
}
void
two_domains_truncated1()
{
int ret;
struct option_data *option;
struct packet p;
char *data = "\007example\003org\0\007example\003com";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 25;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
two_domains_truncated2()
{
int ret;
struct option_data *option;
struct packet p;
char *data = "\007example\003org\0\007ex";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 16;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
two_domains_compressed()
{
int ret;
struct packet p;
struct option_data *option;
char *data = "\007example\003org\0\006foobar\xc0\x08";
char *expected = "example.org. foobar.org.";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 22;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (option->len != strlen(expected) ||
strcmp(option->data, expected) != 0)
abort();
free(option->data);
}
void
two_domains_infloop()
{
int ret;
struct packet p;
struct option_data *option;
char *data = "\007example\003org\0\006foobar\xc0\x0d";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 22;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
two_domains_forwardptr()
{
int ret;
struct packet p;
struct option_data *option;
char *data = "\007example\003org\xc0\x0d\006foobar\0";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 22;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
two_domains_truncatedptr()
{
int ret;
struct packet p;
struct option_data *option;
char *data = "\007example\003org\0\006foobar\xc0";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 21;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (ret != 1)
abort();
free(option->data);
}
void
multiple_domains_valid()
{
int ret;
struct packet p;
struct option_data *option;
char *data =
"\007example\003org\0\002cl\006foobar\003com\0\002fr\xc0\x10";
char *expected = "example.org. cl.foobar.com. fr.foobar.com.";
option = &p.options[DHO_DOMAIN_SEARCH];
option->len = 33;
option->data = malloc(option->len);
memcpy(option->data, data, option->len);
ret = setjmp(env);
if (ret == 0)
expand_domain_search(&p);
if (option->len != strlen(expected) ||
strcmp(option->data, expected) != 0)
abort();
free(option->data);
}
int
main(int argc, char *argv[])
{
no_option_present();
one_domain_valid();
one_domain_truncated1();
one_domain_truncated2();
two_domains_valid();
two_domains_truncated1();
two_domains_truncated2();
two_domains_compressed();
two_domains_infloop();
two_domains_forwardptr();
two_domains_truncatedptr();
multiple_domains_valid();
return (0);
}
diff --git a/sbin/etherswitchcfg/ifmedia.c b/sbin/etherswitchcfg/ifmedia.c
index 03ed4e56ab79..a54857ee2437 100644
--- a/sbin/etherswitchcfg/ifmedia.c
+++ b/sbin/etherswitchcfg/ifmedia.c
@@ -1,752 +1,751 @@
/* $NetBSD: ifconfig.c,v 1.34 1997/04/21 01:17:58 lukem Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1997 Jason R. Thorpe.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the NetBSD Project
* by Jason R. Thorpe.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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
* SUCH DAMAGE.
*/
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* based on sbin/ifconfig/ifmedia.c r221954
*/
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <sys/time.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/if_types.h>
#include <net/if_media.h>
#include <net/route.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
void domediaopt(const char *, int, int);
int get_media_subtype(int, const char *);
int get_media_mode(int, const char *);
int get_media_options(int, const char *);
int lookup_media_word(struct ifmedia_description *, const char *);
void print_media_word(int, int);
void print_media_word_ifconfig(int);
#if 0
static struct ifmedia_description *get_toptype_desc(int);
static struct ifmedia_type_to_subtype *get_toptype_ttos(int);
static struct ifmedia_description *get_subtype_desc(int,
struct ifmedia_type_to_subtype *ttos);
#define IFM_OPMODE(x) \
((x) & (IFM_IEEE80211_ADHOC | IFM_IEEE80211_HOSTAP | \
IFM_IEEE80211_IBSS | IFM_IEEE80211_WDS | IFM_IEEE80211_MONITOR | \
IFM_IEEE80211_MBSS))
#define IFM_IEEE80211_STA 0
static void
media_status(int s)
{
struct ifmediareq ifmr;
int *media_list, i;
(void) memset(&ifmr, 0, sizeof(ifmr));
(void) strncpy(ifmr.ifm_name, name, sizeof(ifmr.ifm_name));
if (ioctl(s, SIOCGIFMEDIA, (caddr_t)&ifmr) < 0) {
/*
* Interface doesn't support SIOC{G,S}IFMEDIA.
*/
return;
}
if (ifmr.ifm_count == 0) {
warnx("%s: no media types?", name);
return;
}
media_list = (int *)malloc(ifmr.ifm_count * sizeof(int));
if (media_list == NULL)
err(1, "malloc");
ifmr.ifm_ulist = media_list;
if (ioctl(s, SIOCGIFMEDIA, (caddr_t)&ifmr) < 0)
err(1, "SIOCGIFMEDIA");
printf("\tmedia: ");
print_media_word(ifmr.ifm_current, 1);
if (ifmr.ifm_active != ifmr.ifm_current) {
putchar(' ');
putchar('(');
print_media_word(ifmr.ifm_active, 0);
putchar(')');
}
putchar('\n');
if (ifmr.ifm_status & IFM_AVALID) {
printf("\tstatus: ");
switch (IFM_TYPE(ifmr.ifm_active)) {
case IFM_ETHER:
case IFM_ATM:
if (ifmr.ifm_status & IFM_ACTIVE)
printf("active");
else
printf("no carrier");
break;
case IFM_IEEE80211:
if (ifmr.ifm_status & IFM_ACTIVE) {
/* NB: only sta mode associates */
if (IFM_OPMODE(ifmr.ifm_active) == IFM_IEEE80211_STA)
printf("associated");
else
printf("running");
} else
printf("no carrier");
break;
}
putchar('\n');
}
if (ifmr.ifm_count > 0 && supmedia) {
printf("\tsupported media:\n");
for (i = 0; i < ifmr.ifm_count; i++) {
printf("\t\t");
print_media_word_ifconfig(media_list[i]);
putchar('\n');
}
}
free(media_list);
}
struct ifmediareq *
ifmedia_getstate(int s)
{
static struct ifmediareq *ifmr = NULL;
int *mwords;
if (ifmr == NULL) {
ifmr = (struct ifmediareq *)malloc(sizeof(struct ifmediareq));
if (ifmr == NULL)
err(1, "malloc");
(void) memset(ifmr, 0, sizeof(struct ifmediareq));
(void) strncpy(ifmr->ifm_name, name,
sizeof(ifmr->ifm_name));
ifmr->ifm_count = 0;
ifmr->ifm_ulist = NULL;
/*
* We must go through the motions of reading all
* supported media because we need to know both
* the current media type and the top-level type.
*/
if (ioctl(s, SIOCGIFMEDIA, (caddr_t)ifmr) < 0) {
err(1, "SIOCGIFMEDIA");
}
if (ifmr->ifm_count == 0)
errx(1, "%s: no media types?", name);
mwords = (int *)malloc(ifmr->ifm_count * sizeof(int));
if (mwords == NULL)
err(1, "malloc");
ifmr->ifm_ulist = mwords;
if (ioctl(s, SIOCGIFMEDIA, (caddr_t)ifmr) < 0)
err(1, "SIOCGIFMEDIA");
}
return ifmr;
}
static void
setifmediacallback(int s, void *arg)
{
struct ifmediareq *ifmr = (struct ifmediareq *)arg;
static int did_it = 0;
if (!did_it) {
ifr.ifr_media = ifmr->ifm_current;
if (ioctl(s, SIOCSIFMEDIA, (caddr_t)&ifr) < 0)
err(1, "SIOCSIFMEDIA (media)");
free(ifmr->ifm_ulist);
free(ifmr);
did_it = 1;
}
}
static void
setmedia(const char *val, int d, int s, const struct afswtch *afp)
{
struct ifmediareq *ifmr;
int subtype;
ifmr = ifmedia_getstate(s);
/*
* We are primarily concerned with the top-level type.
* However, "current" may be only IFM_NONE, so we just look
* for the top-level type in the first "supported type"
* entry.
*
* (I'm assuming that all supported media types for a given
* interface will be the same top-level type..)
*/
subtype = get_media_subtype(IFM_TYPE(ifmr->ifm_ulist[0]), val);
strncpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = (ifmr->ifm_current & IFM_IMASK) |
IFM_TYPE(ifmr->ifm_ulist[0]) | subtype;
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static void
setmediaopt(const char *val, int d, int s, const struct afswtch *afp)
{
domediaopt(val, 0, s);
}
static void
unsetmediaopt(const char *val, int d, int s, const struct afswtch *afp)
{
domediaopt(val, 1, s);
}
static void
domediaopt(const char *val, int clear, int s)
{
struct ifmediareq *ifmr;
int options;
ifmr = ifmedia_getstate(s);
options = get_media_options(IFM_TYPE(ifmr->ifm_ulist[0]), val);
strncpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = ifmr->ifm_current;
if (clear)
ifr.ifr_media &= ~options;
else {
if (options & IFM_HDX) {
ifr.ifr_media &= ~IFM_FDX;
options &= ~IFM_HDX;
}
ifr.ifr_media |= options;
}
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static void
setmediainst(const char *val, int d, int s, const struct afswtch *afp)
{
struct ifmediareq *ifmr;
int inst;
ifmr = ifmedia_getstate(s);
inst = atoi(val);
if (inst < 0 || inst > (int)IFM_INST_MAX)
errx(1, "invalid media instance: %s", val);
strncpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = (ifmr->ifm_current & ~IFM_IMASK) | inst << IFM_ISHIFT;
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static void
setmediamode(const char *val, int d, int s, const struct afswtch *afp)
{
struct ifmediareq *ifmr;
int mode;
ifmr = ifmedia_getstate(s);
mode = get_media_mode(IFM_TYPE(ifmr->ifm_ulist[0]), val);
strncpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = (ifmr->ifm_current & ~IFM_MMASK) | mode;
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
#endif
/**********************************************************************
* A good chunk of this is duplicated from sys/net/ifmedia.c
**********************************************************************/
static struct ifmedia_description ifm_type_descriptions[] =
IFM_TYPE_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_ethernet_descriptions[] =
IFM_SUBTYPE_ETHERNET_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_ethernet_aliases[] =
IFM_SUBTYPE_ETHERNET_ALIASES;
static struct ifmedia_description ifm_subtype_ethernet_option_descriptions[] =
IFM_SUBTYPE_ETHERNET_OPTION_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_ieee80211_descriptions[] =
IFM_SUBTYPE_IEEE80211_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_ieee80211_aliases[] =
IFM_SUBTYPE_IEEE80211_ALIASES;
static struct ifmedia_description ifm_subtype_ieee80211_option_descriptions[] =
IFM_SUBTYPE_IEEE80211_OPTION_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_ieee80211_mode_descriptions[] =
IFM_SUBTYPE_IEEE80211_MODE_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_ieee80211_mode_aliases[] =
IFM_SUBTYPE_IEEE80211_MODE_ALIASES;
static struct ifmedia_description ifm_subtype_atm_descriptions[] =
IFM_SUBTYPE_ATM_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_atm_aliases[] =
IFM_SUBTYPE_ATM_ALIASES;
static struct ifmedia_description ifm_subtype_atm_option_descriptions[] =
IFM_SUBTYPE_ATM_OPTION_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_shared_descriptions[] =
IFM_SUBTYPE_SHARED_DESCRIPTIONS;
static struct ifmedia_description ifm_subtype_shared_aliases[] =
IFM_SUBTYPE_SHARED_ALIASES;
static struct ifmedia_description ifm_shared_option_descriptions[] =
IFM_SHARED_OPTION_DESCRIPTIONS;
static struct ifmedia_description ifm_shared_option_aliases[] =
IFM_SHARED_OPTION_ALIASES;
struct ifmedia_type_to_subtype {
struct {
struct ifmedia_description *desc;
int alias;
} subtypes[5];
struct {
struct ifmedia_description *desc;
int alias;
} options[4];
struct {
struct ifmedia_description *desc;
int alias;
} modes[3];
};
/* must be in the same order as IFM_TYPE_DESCRIPTIONS */
static struct ifmedia_type_to_subtype ifmedia_types_to_subtypes[] = {
{
{
{ &ifm_subtype_shared_descriptions[0], 0 },
{ &ifm_subtype_shared_aliases[0], 1 },
{ &ifm_subtype_ethernet_descriptions[0], 0 },
{ &ifm_subtype_ethernet_aliases[0], 1 },
{ NULL, 0 },
},
{
{ &ifm_shared_option_descriptions[0], 0 },
{ &ifm_shared_option_aliases[0], 1 },
{ &ifm_subtype_ethernet_option_descriptions[0], 0 },
{ NULL, 0 },
},
{
{ NULL, 0 },
},
},
{
{
{ &ifm_subtype_shared_descriptions[0], 0 },
{ &ifm_subtype_shared_aliases[0], 1 },
{ &ifm_subtype_ieee80211_descriptions[0], 0 },
{ &ifm_subtype_ieee80211_aliases[0], 1 },
{ NULL, 0 },
},
{
{ &ifm_shared_option_descriptions[0], 0 },
{ &ifm_shared_option_aliases[0], 1 },
{ &ifm_subtype_ieee80211_option_descriptions[0], 0 },
{ NULL, 0 },
},
{
{ &ifm_subtype_ieee80211_mode_descriptions[0], 0 },
{ &ifm_subtype_ieee80211_mode_aliases[0], 0 },
{ NULL, 0 },
},
},
{
{
{ &ifm_subtype_shared_descriptions[0], 0 },
{ &ifm_subtype_shared_aliases[0], 1 },
{ &ifm_subtype_atm_descriptions[0], 0 },
{ &ifm_subtype_atm_aliases[0], 1 },
{ NULL, 0 },
},
{
{ &ifm_shared_option_descriptions[0], 0 },
{ &ifm_shared_option_aliases[0], 1 },
{ &ifm_subtype_atm_option_descriptions[0], 0 },
{ NULL, 0 },
},
{
{ NULL, 0 },
},
},
};
int
get_media_subtype(int type, const char *val)
{
struct ifmedia_description *desc;
struct ifmedia_type_to_subtype *ttos;
int rval, i;
/* Find the top-level interface type. */
for (desc = ifm_type_descriptions, ttos = ifmedia_types_to_subtypes;
desc->ifmt_string != NULL; desc++, ttos++)
if (type == desc->ifmt_word)
break;
if (desc->ifmt_string == NULL)
errx(1, "unknown media type 0x%x", type);
for (i = 0; ttos->subtypes[i].desc != NULL; i++) {
rval = lookup_media_word(ttos->subtypes[i].desc, val);
if (rval != -1)
return (rval);
}
errx(1, "unknown media subtype: %s", val);
/*NOTREACHED*/
}
int
get_media_mode(int type, const char *val)
{
struct ifmedia_description *desc;
struct ifmedia_type_to_subtype *ttos;
int rval, i;
/* Find the top-level interface type. */
for (desc = ifm_type_descriptions, ttos = ifmedia_types_to_subtypes;
desc->ifmt_string != NULL; desc++, ttos++)
if (type == desc->ifmt_word)
break;
if (desc->ifmt_string == NULL)
errx(1, "unknown media mode 0x%x", type);
for (i = 0; ttos->modes[i].desc != NULL; i++) {
rval = lookup_media_word(ttos->modes[i].desc, val);
if (rval != -1)
return (rval);
}
return -1;
}
int
get_media_options(int type, const char *val)
{
struct ifmedia_description *desc;
struct ifmedia_type_to_subtype *ttos;
char *optlist, *optptr;
int option = 0, i, rval = 0;
/* We muck with the string, so copy it. */
optlist = strdup(val);
if (optlist == NULL)
err(1, "strdup");
/* Find the top-level interface type. */
for (desc = ifm_type_descriptions, ttos = ifmedia_types_to_subtypes;
desc->ifmt_string != NULL; desc++, ttos++)
if (type == desc->ifmt_word)
break;
if (desc->ifmt_string == NULL)
errx(1, "unknown media type 0x%x", type);
/*
* Look up the options in the user-provided comma-separated
* list.
*/
optptr = optlist;
for (; (optptr = strtok(optptr, ",")) != NULL; optptr = NULL) {
for (i = 0; ttos->options[i].desc != NULL; i++) {
option = lookup_media_word(ttos->options[i].desc, optptr);
if (option != -1)
break;
}
if (option == 0)
errx(1, "unknown option: %s", optptr);
rval |= option;
}
free(optlist);
return (rval);
}
int
lookup_media_word(struct ifmedia_description *desc, const char *val)
{
for (; desc->ifmt_string != NULL; desc++)
if (strcasecmp(desc->ifmt_string, val) == 0)
return (desc->ifmt_word);
return (-1);
}
static struct ifmedia_description *get_toptype_desc(int ifmw)
{
struct ifmedia_description *desc;
for (desc = ifm_type_descriptions; desc->ifmt_string != NULL; desc++)
if (IFM_TYPE(ifmw) == desc->ifmt_word)
break;
return desc;
}
static struct ifmedia_type_to_subtype *get_toptype_ttos(int ifmw)
{
struct ifmedia_description *desc;
struct ifmedia_type_to_subtype *ttos;
for (desc = ifm_type_descriptions, ttos = ifmedia_types_to_subtypes;
desc->ifmt_string != NULL; desc++, ttos++)
if (IFM_TYPE(ifmw) == desc->ifmt_word)
break;
return ttos;
}
static struct ifmedia_description *get_subtype_desc(int ifmw,
struct ifmedia_type_to_subtype *ttos)
{
int i;
struct ifmedia_description *desc;
for (i = 0; ttos->subtypes[i].desc != NULL; i++) {
if (ttos->subtypes[i].alias)
continue;
for (desc = ttos->subtypes[i].desc;
desc->ifmt_string != NULL; desc++) {
if (IFM_SUBTYPE(ifmw) == desc->ifmt_word)
return desc;
}
}
return NULL;
}
static struct ifmedia_description *get_mode_desc(int ifmw,
struct ifmedia_type_to_subtype *ttos)
{
int i;
struct ifmedia_description *desc;
for (i = 0; ttos->modes[i].desc != NULL; i++) {
if (ttos->modes[i].alias)
continue;
for (desc = ttos->modes[i].desc;
desc->ifmt_string != NULL; desc++) {
if (IFM_MODE(ifmw) == desc->ifmt_word)
return desc;
}
}
return NULL;
}
void
print_media_word(int ifmw, int print_toptype)
{
struct ifmedia_description *desc;
struct ifmedia_type_to_subtype *ttos;
int seen_option = 0, i;
/* Find the top-level interface type. */
desc = get_toptype_desc(ifmw);
ttos = get_toptype_ttos(ifmw);
if (desc->ifmt_string == NULL) {
printf("<unknown type>");
return;
} else if (print_toptype) {
printf("%s", desc->ifmt_string);
}
/*
* Don't print the top-level type; it's not like we can
* change it, or anything.
*/
/* Find subtype. */
desc = get_subtype_desc(ifmw, ttos);
if (desc == NULL) {
printf("<unknown subtype>");
return;
}
if (print_toptype)
putchar(' ');
printf("%s", desc->ifmt_string);
if (print_toptype) {
desc = get_mode_desc(ifmw, ttos);
if (desc != NULL && strcasecmp("autoselect", desc->ifmt_string))
printf(" mode %s", desc->ifmt_string);
}
/* Find options. */
for (i = 0; ttos->options[i].desc != NULL; i++) {
if (ttos->options[i].alias)
continue;
for (desc = ttos->options[i].desc;
desc->ifmt_string != NULL; desc++) {
if (ifmw & desc->ifmt_word) {
if (seen_option == 0)
printf(" <");
printf("%s%s", seen_option++ ? "," : "",
desc->ifmt_string);
}
}
}
printf("%s", seen_option ? ">" : "");
if (print_toptype && IFM_INST(ifmw) != 0)
printf(" instance %d", IFM_INST(ifmw));
}
void
print_media_word_ifconfig(int ifmw)
{
struct ifmedia_description *desc;
struct ifmedia_type_to_subtype *ttos;
int seen_option = 0, i;
/* Find the top-level interface type. */
desc = get_toptype_desc(ifmw);
ttos = get_toptype_ttos(ifmw);
if (desc->ifmt_string == NULL) {
printf("<unknown type>");
return;
}
/*
* Don't print the top-level type; it's not like we can
* change it, or anything.
*/
/* Find subtype. */
desc = get_subtype_desc(ifmw, ttos);
if (desc == NULL) {
printf("<unknown subtype>");
return;
}
printf("media %s", desc->ifmt_string);
desc = get_mode_desc(ifmw, ttos);
if (desc != NULL)
printf(" mode %s", desc->ifmt_string);
/* Find options. */
for (i = 0; ttos->options[i].desc != NULL; i++) {
if (ttos->options[i].alias)
continue;
for (desc = ttos->options[i].desc;
desc->ifmt_string != NULL; desc++) {
if (ifmw & desc->ifmt_word) {
if (seen_option == 0)
printf(" mediaopt ");
printf("%s%s", seen_option++ ? "," : "",
desc->ifmt_string);
}
}
}
if (IFM_INST(ifmw) != 0)
printf(" instance %d", IFM_INST(ifmw));
}
/**********************************************************************
* ...until here.
**********************************************************************/
diff --git a/sbin/gvinum/gvinum.h b/sbin/gvinum/gvinum.h
index e9c112a5e936..f29dc4c986a4 100644
--- a/sbin/gvinum/gvinum.h
+++ b/sbin/gvinum/gvinum.h
@@ -1,42 +1,41 @@
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1997, 1998
* Nan Yang Computer Services Limited. All rights reserved.
*
* This software is distributed under the so-called ``Berkeley
* License'':
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Nan Yang Computer
* Services Limited.
* 4. Neither the name of the Company nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* This software is provided ``as is'', and any express or implied
* warranties, including, but not limited to, the implied warranties of
* merchantability and fitness for a particular purpose are disclaimed.
* In no event shall the company or contributors be liable for any
* direct, indirect, incidental, special, exemplary, or consequential
* damages (including, but not limited to, procurement of substitute
* goods or services; loss of use, data, or profits; or business
* interruption) however caused and on any theory of liability, whether
* in contract, strict 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 such damage.
*/
-/* $FreeBSD$ */
#define GVINUMMOD "g_vinum"
#define GVINUMKLD "geom_vinum"
diff --git a/sbin/ifconfig/carp.c b/sbin/ifconfig/carp.c
index 5331a1fc969e..134c591cd52c 100644
--- a/sbin/ifconfig/carp.c
+++ b/sbin/ifconfig/carp.c
@@ -1,224 +1,223 @@
-/* $FreeBSD$ */
/* from $OpenBSD: ifconfig.c,v 1.82 2003/10/19 05:43:35 mcbride Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2002 Michael Shalayeff. All rights reserved.
* Copyright (c) 2003 Ryan McBride. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR OR HIS RELATIVES BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF MIND, USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT 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 SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <sys/sockio.h>
#include <stdlib.h>
#include <unistd.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_var.h>
#include <netinet/ip_carp.h>
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <err.h>
#include <errno.h>
#include <libifconfig.h>
#include "ifconfig.h"
static const char *carp_states[] = { CARP_STATES };
static void carp_status(int s);
static void setcarp_vhid(const char *, int, int, const struct afswtch *rafp);
static void setcarp_callback(int, void *);
static void setcarp_advbase(const char *,int, int, const struct afswtch *rafp);
static void setcarp_advskew(const char *, int, int, const struct afswtch *rafp);
static void setcarp_passwd(const char *, int, int, const struct afswtch *rafp);
static int carpr_vhid = -1;
static int carpr_advskew = -1;
static int carpr_advbase = -1;
static int carpr_state = -1;
static unsigned char const *carpr_key;
static void
carp_status(int s)
{
struct carpreq carpr[CARP_MAXVHID];
if (ifconfig_carp_get_info(lifh, name, carpr, CARP_MAXVHID) == -1)
return;
for (size_t i = 0; i < carpr[0].carpr_count; i++) {
printf("\tcarp: %s vhid %d advbase %d advskew %d",
carp_states[carpr[i].carpr_state], carpr[i].carpr_vhid,
carpr[i].carpr_advbase, carpr[i].carpr_advskew);
if (printkeys && carpr[i].carpr_key[0] != '\0')
printf(" key \"%s\"\n", carpr[i].carpr_key);
else
printf("\n");
}
}
static void
setcarp_vhid(const char *val, int d, int s, const struct afswtch *afp)
{
carpr_vhid = atoi(val);
if (carpr_vhid <= 0 || carpr_vhid > CARP_MAXVHID)
errx(1, "vhid must be greater than 0 and less than %u",
CARP_MAXVHID);
switch (afp->af_af) {
#ifdef INET
case AF_INET:
{
struct in_aliasreq *ifra;
ifra = (struct in_aliasreq *)afp->af_addreq;
ifra->ifra_vhid = carpr_vhid;
break;
}
#endif
#ifdef INET6
case AF_INET6:
{
struct in6_aliasreq *ifra;
ifra = (struct in6_aliasreq *)afp->af_addreq;
ifra->ifra_vhid = carpr_vhid;
break;
}
#endif
default:
errx(1, "%s doesn't support carp(4)", afp->af_name);
}
callback_register(setcarp_callback, NULL);
}
static void
setcarp_callback(int s, void *arg __unused)
{
struct carpreq carpr;
bzero(&carpr, sizeof(struct carpreq));
carpr.carpr_vhid = carpr_vhid;
carpr.carpr_count = 1;
ifr.ifr_data = (caddr_t)&carpr;
if (ioctl(s, SIOCGVH, (caddr_t)&ifr) == -1 && errno != ENOENT)
err(1, "SIOCGVH");
if (carpr_key != NULL)
/* XXX Should hash the password into the key here? */
strlcpy(carpr.carpr_key, carpr_key, CARP_KEY_LEN);
if (carpr_advskew > -1)
carpr.carpr_advskew = carpr_advskew;
if (carpr_advbase > -1)
carpr.carpr_advbase = carpr_advbase;
if (carpr_state > -1)
carpr.carpr_state = carpr_state;
if (ioctl(s, SIOCSVH, (caddr_t)&ifr) == -1)
err(1, "SIOCSVH");
}
static void
setcarp_passwd(const char *val, int d, int s, const struct afswtch *afp)
{
if (carpr_vhid == -1)
errx(1, "passwd requires vhid");
carpr_key = val;
}
static void
setcarp_advskew(const char *val, int d, int s, const struct afswtch *afp)
{
if (carpr_vhid == -1)
errx(1, "advskew requires vhid");
carpr_advskew = atoi(val);
}
static void
setcarp_advbase(const char *val, int d, int s, const struct afswtch *afp)
{
if (carpr_vhid == -1)
errx(1, "advbase requires vhid");
carpr_advbase = atoi(val);
}
static void
setcarp_state(const char *val, int d, int s, const struct afswtch *afp)
{
int i;
if (carpr_vhid == -1)
errx(1, "state requires vhid");
for (i = 0; i <= CARP_MAXSTATE; i++)
if (strcasecmp(carp_states[i], val) == 0) {
carpr_state = i;
return;
}
errx(1, "unknown state");
}
static struct cmd carp_cmds[] = {
DEF_CMD_ARG("advbase", setcarp_advbase),
DEF_CMD_ARG("advskew", setcarp_advskew),
DEF_CMD_ARG("pass", setcarp_passwd),
DEF_CMD_ARG("vhid", setcarp_vhid),
DEF_CMD_ARG("state", setcarp_state),
};
static struct afswtch af_carp = {
.af_name = "af_carp",
.af_af = AF_UNSPEC,
.af_other_status = carp_status,
};
static __constructor void
carp_ctor(void)
{
int i;
for (i = 0; i < nitems(carp_cmds); i++)
cmd_register(&carp_cmds[i]);
af_register(&af_carp);
}
diff --git a/sbin/ifconfig/ifmedia.c b/sbin/ifconfig/ifmedia.c
index aacf34a13248..42319c28370a 100644
--- a/sbin/ifconfig/ifmedia.c
+++ b/sbin/ifconfig/ifmedia.c
@@ -1,494 +1,493 @@
/* $NetBSD: ifconfig.c,v 1.34 1997/04/21 01:17:58 lukem Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1997 Jason R. Thorpe.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the NetBSD Project
* by Jason R. Thorpe.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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
* SUCH DAMAGE.
*/
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <sys/time.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/if_types.h>
#include <net/if_media.h>
#include <net/route.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <libifconfig.h>
#include "ifconfig.h"
static void domediaopt(const char *, bool, int);
static ifmedia_t get_media_subtype(ifmedia_t, const char *);
static ifmedia_t get_media_mode(ifmedia_t, const char *);
static ifmedia_t get_media_options(ifmedia_t, const char *);
static void print_media(ifmedia_t, bool);
static void print_media_ifconfig(ifmedia_t);
static void
media_status(int s)
{
struct ifmediareq *ifmr;
if (ifconfig_media_get_mediareq(lifh, name, &ifmr) == -1)
return;
if (ifmr->ifm_count == 0) {
warnx("%s: no media types?", name);
goto free;
}
printf("\tmedia: ");
print_media(ifmr->ifm_current, true);
if (ifmr->ifm_active != ifmr->ifm_current) {
putchar(' ');
putchar('(');
print_media(ifmr->ifm_active, false);
putchar(')');
}
putchar('\n');
if (ifmr->ifm_status & IFM_AVALID) {
struct ifdownreason ifdr;
const char *status;
status = ifconfig_media_get_status(ifmr);
printf("\tstatus: %s", status);
if (strcmp(status, "no carrier") == 0 &&
ifconfig_media_get_downreason(lifh, name, &ifdr) == 0) {
switch (ifdr.ifdr_reason) {
case IFDR_REASON_MSG:
printf(" (%s)", ifdr.ifdr_msg);
break;
case IFDR_REASON_VENDOR:
printf(" (vendor code %d)",
ifdr.ifdr_vendor);
break;
default:
break;
}
}
putchar('\n');
}
if (supmedia) {
printf("\tsupported media:\n");
for (size_t i = 0; i < ifmr->ifm_count; ++i) {
printf("\t\t");
print_media_ifconfig(ifmr->ifm_ulist[i]);
putchar('\n');
}
}
free:
free(ifmr);
}
struct ifmediareq *
ifmedia_getstate(void)
{
static struct ifmediareq *ifmr = NULL;
if (ifmr != NULL)
return (ifmr);
if (ifconfig_media_get_mediareq(lifh, name, &ifmr) == -1)
errc(1, ifconfig_err_errno(lifh),
"%s: ifconfig_media_get_mediareq", name);
if (ifmr->ifm_count == 0)
errx(1, "%s: no media types?", name);
return (ifmr);
}
static void
setifmediacallback(int s, void *arg)
{
struct ifmediareq *ifmr = (struct ifmediareq *)arg;
static bool did_it = false;
if (!did_it) {
ifr.ifr_media = ifmr->ifm_current;
if (ioctl(s, SIOCSIFMEDIA, (caddr_t)&ifr) < 0)
err(1, "SIOCSIFMEDIA (media)");
free(ifmr);
did_it = true;
}
}
static void
setmedia(const char *val, int d, int s, const struct afswtch *afp)
{
struct ifmediareq *ifmr;
int subtype;
ifmr = ifmedia_getstate();
/*
* We are primarily concerned with the top-level type.
* However, "current" may be only IFM_NONE, so we just look
* for the top-level type in the first "supported type"
* entry.
*
* (I'm assuming that all supported media types for a given
* interface will be the same top-level type..)
*/
subtype = get_media_subtype(ifmr->ifm_ulist[0], val);
strlcpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = (ifmr->ifm_current & IFM_IMASK) |
IFM_TYPE(ifmr->ifm_ulist[0]) | subtype;
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static void
setmediaopt(const char *val, int d, int s, const struct afswtch *afp)
{
domediaopt(val, false, s);
}
static void
unsetmediaopt(const char *val, int d, int s, const struct afswtch *afp)
{
domediaopt(val, true, s);
}
static void
domediaopt(const char *val, bool clear, int s)
{
struct ifmediareq *ifmr;
ifmedia_t options;
ifmr = ifmedia_getstate();
options = get_media_options(ifmr->ifm_ulist[0], val);
strlcpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = ifmr->ifm_current;
if (clear)
ifr.ifr_media &= ~options;
else {
if (options & IFM_HDX) {
ifr.ifr_media &= ~IFM_FDX;
options &= ~IFM_HDX;
}
ifr.ifr_media |= options;
}
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static void
setmediainst(const char *val, int d, int s, const struct afswtch *afp)
{
struct ifmediareq *ifmr;
int inst;
ifmr = ifmedia_getstate();
inst = atoi(val);
if (inst < 0 || inst > (int)IFM_INST_MAX)
errx(1, "invalid media instance: %s", val);
strlcpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = (ifmr->ifm_current & ~IFM_IMASK) | inst << IFM_ISHIFT;
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static void
setmediamode(const char *val, int d, int s, const struct afswtch *afp)
{
struct ifmediareq *ifmr;
int mode;
ifmr = ifmedia_getstate();
mode = get_media_mode(ifmr->ifm_ulist[0], val);
strlcpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
ifr.ifr_media = (ifmr->ifm_current & ~IFM_MMASK) | mode;
ifmr->ifm_current = ifr.ifr_media;
callback_register(setifmediacallback, (void *)ifmr);
}
static ifmedia_t
get_media_subtype(ifmedia_t media, const char *val)
{
ifmedia_t subtype;
subtype = ifconfig_media_lookup_subtype(media, val);
if (subtype != INVALID_IFMEDIA)
return (subtype);
switch (errno) {
case EINVAL:
errx(EXIT_FAILURE, "unknown media type 0x%x", media);
case ENOENT:
errx(EXIT_FAILURE, "unknown media subtype: %s", val);
default:
err(EXIT_FAILURE, "ifconfig_media_lookup_subtype");
}
/*NOTREACHED*/
}
static ifmedia_t
get_media_mode(ifmedia_t media, const char *val)
{
ifmedia_t mode;
mode = ifconfig_media_lookup_mode(media, val);
if (mode != INVALID_IFMEDIA)
return (mode);
switch (errno) {
case EINVAL:
errx(EXIT_FAILURE, "unknown media type 0x%x", media);
case ENOENT:
return (INVALID_IFMEDIA);
default:
err(EXIT_FAILURE, "ifconfig_media_lookup_subtype");
}
/*NOTREACHED*/
}
static ifmedia_t
get_media_options(ifmedia_t media, const char *val)
{
ifmedia_t *options;
const char **optnames;
char *opts, *opt;
size_t nopts;
int rval;
/*
* We muck with the string, so copy it.
*/
opts = strdup(val);
if (opts == NULL)
err(EXIT_FAILURE, "strdup");
/*
* Split the comma-delimited list into separate strings.
*/
nopts = 0;
for (opt = opts; (opt = strtok(opt, ",")) != NULL; opt = NULL)
++nopts;
if (nopts == 0) {
free(opts);
return (0);
}
optnames = calloc(nopts, sizeof(*optnames));
if (optnames == NULL)
err(EXIT_FAILURE, "calloc");
opt = opts;
for (size_t i = 0; i < nopts; ++i) {
optnames[i] = opt;
opt = strchr(opt, '\0') + 1;
}
/*
* Look up the options in the user-provided list.
*/
options = ifconfig_media_lookup_options(media, optnames, nopts);
if (options == NULL)
err(EXIT_FAILURE, "ifconfig_media_lookup_options");
rval = 0;
for (size_t i = 0; i < nopts; ++i) {
if (options[i] == INVALID_IFMEDIA)
errx(EXIT_FAILURE, "unknown option: %s", optnames[i]);
rval |= options[i];
}
free(options);
free(optnames);
free(opts);
return (rval);
}
static void
print_media(ifmedia_t media, bool print_toptype)
{
const char *val, **options;
val = ifconfig_media_get_type(media);
if (val == NULL) {
printf("<unknown type>");
return;
} else if (print_toptype) {
printf("%s", val);
}
val = ifconfig_media_get_subtype(media);
if (val == NULL) {
printf("<unknown subtype>");
return;
}
if (print_toptype)
putchar(' ');
printf("%s", val);
if (print_toptype) {
val = ifconfig_media_get_mode(media);
if (val != NULL && strcasecmp("autoselect", val) != 0)
printf(" mode %s", val);
}
options = ifconfig_media_get_options(media);
if (options != NULL && options[0] != NULL) {
printf(" <%s", options[0]);
for (size_t i = 1; options[i] != NULL; ++i)
printf(",%s", options[i]);
printf(">");
}
free(options);
if (print_toptype && IFM_INST(media) != 0)
printf(" instance %d", IFM_INST(media));
}
static void
print_media_ifconfig(ifmedia_t media)
{
const char *val, **options;
val = ifconfig_media_get_type(media);
if (val == NULL) {
printf("<unknown type>");
return;
}
/*
* Don't print the top-level type; it's not like we can
* change it, or anything.
*/
val = ifconfig_media_get_subtype(media);
if (val == NULL) {
printf("<unknown subtype>");
return;
}
printf("media %s", val);
val = ifconfig_media_get_mode(media);
if (val != NULL)
printf(" mode %s", val);
options = ifconfig_media_get_options(media);
if (options != NULL && options[0] != NULL) {
printf(" mediaopt %s", options[0]);
for (size_t i = 1; options[i] != NULL; ++i)
printf(",%s", options[i]);
}
free(options);
if (IFM_INST(media) != 0)
printf(" instance %d", IFM_INST(media));
}
/**********************************************************************
* ...until here.
**********************************************************************/
static struct cmd media_cmds[] = {
DEF_CMD_ARG("media", setmedia),
DEF_CMD_ARG("mode", setmediamode),
DEF_CMD_ARG("mediaopt", setmediaopt),
DEF_CMD_ARG("-mediaopt",unsetmediaopt),
DEF_CMD_ARG("inst", setmediainst),
DEF_CMD_ARG("instance", setmediainst),
};
static struct afswtch af_media = {
.af_name = "af_media",
.af_af = AF_UNSPEC,
.af_other_status = media_status,
};
static __constructor void
ifmedia_ctor(void)
{
size_t i;
for (i = 0; i < nitems(media_cmds); i++)
cmd_register(&media_cmds[i]);
af_register(&af_media);
}
diff --git a/sbin/ipf/common/ipf.h b/sbin/ipf/common/ipf.h
index db4ba91319ad..c672c53cb56d 100644
--- a/sbin/ipf/common/ipf.h
+++ b/sbin/ipf/common/ipf.h
@@ -1,373 +1,372 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* @(#)ipf.h 1.12 6/5/96
* $Id$
*/
#ifndef __IPF_H__
#define __IPF_H__
#include <sys/param.h>
#include <sys/types.h>
#include <sys/file.h>
/*
* This is a workaround for <sys/uio.h> troubles on FreeBSD, HPUX, OpenBSD.
* Needed here because on some systems <sys/uio.h> gets included by things
* like <sys/socket.h>
*/
#ifndef _KERNEL
# define ADD_KERNEL
# define _KERNEL
# define KERNEL
#endif
#include <sys/uio.h>
#ifdef ADD_KERNEL
# undef _KERNEL
# undef KERNEL
#endif
#include <sys/time.h>
#include <sys/socket.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/ip_icmp.h>
# include <netinet/tcp.h>
#include <netinet/udp.h>
#include <arpa/inet.h>
#include <errno.h>
#include <limits.h>
#include <netdb.h>
#include <stdarg.h>
#include <stdlib.h>
#include <stddef.h>
#include <stdio.h>
#if !defined(__SVR4) && !defined(__svr4__) && defined(sun)
# include <strings.h>
#endif
#include <string.h>
#include <unistd.h>
#include "netinet/ip_compat.h"
#include "netinet/ip_fil.h"
#include "netinet/ip_nat.h"
#include "netinet/ip_frag.h"
#include "netinet/ip_state.h"
#include "netinet/ip_proxy.h"
#include "netinet/ip_auth.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_pool.h"
#include "netinet/ip_scan.h"
#include "netinet/ip_htable.h"
#include "netinet/ip_sync.h"
#include "netinet/ip_dstlist.h"
#include "opts.h"
#ifndef __P
# define __P(x) x
#endif
#ifndef U_32_T
# define U_32_T 1
# if defined(__NetBSD__) || defined(__OpenBSD__) || defined(__FreeBSD__) || \
defined(__sgi)
typedef u_int32_t u_32_t;
# else
# if defined(__alpha__) || defined(__alpha) || defined(_LP64)
typedef unsigned int u_32_t;
# else
# if SOLARIS2 >= 6
typedef uint32_t u_32_t;
# else
typedef unsigned int u_32_t;
# endif
# endif
# endif /* __NetBSD__ || __OpenBSD__ || __FreeBSD__ || __sgi */
#endif /* U_32_T */
#ifndef MAXHOSTNAMELEN
# define MAXHOSTNAMELEN 256
#endif
#define MAX_ICMPCODE 16
#define MAX_ICMPTYPE 19
#define PRINTF (void)printf
#define FPRINTF (void)fprintf
#define FORMAT_IF(_a) (_a != NULL ? _a : "(null)")
struct ipopt_names {
int on_value;
int on_bit;
int on_siz;
char *on_name;
};
typedef struct alist_s {
struct alist_s *al_next;
int al_not;
int al_family;
i6addr_t al_i6addr;
i6addr_t al_i6mask;
} alist_t;
#define al_addr al_i6addr.in4_addr
#define al_mask al_i6mask.in4_addr
#define al_1 al_addr
#define al_2 al_mask
typedef struct plist_s {
struct plist_s *pl_next;
int pl_compare;
u_short pl_port1;
u_short pl_port2;
} plist_t;
typedef struct {
u_short fb_c;
u_char fb_t;
u_char fb_f;
u_32_t fb_k;
} fakebpf_t;
typedef struct {
char *it_name;
int it_v4;
int it_v6;
} icmptype_t;
typedef struct wordtab {
char *w_word;
int w_value;
} wordtab_t;
typedef struct namelist {
struct namelist *na_next;
char *na_name;
int na_value;
} namelist_t;
typedef struct proxyrule {
struct proxyrule *pr_next;
char *pr_proxy;
char *pr_conf;
namelist_t *pr_names;
int pr_proto;
} proxyrule_t;
typedef int (* ioctlfunc_t)(int, ioctlcmd_t, ...);
typedef int (* addfunc_t)(int, ioctlfunc_t, void *);
typedef int (* copyfunc_t)(void *, void *, size_t);
extern char thishost[MAXHOSTNAMELEN];
extern char flagset[];
extern u_char flags[];
extern struct ipopt_names ionames[];
extern struct ipopt_names secclass[];
extern char *icmpcodes[MAX_ICMPCODE + 1];
extern char *icmptypes[MAX_ICMPTYPE + 1];
extern int use_inet6;
extern int lineNum;
extern int debuglevel;
extern struct ipopt_names v6ionames[];
extern icmptype_t icmptypelist[];
extern wordtab_t statefields[];
extern wordtab_t natfields[];
extern wordtab_t poolfields[];
extern int addicmp(char ***, struct frentry *, int);
extern int addipopt(char *, struct ipopt_names *, int, char *);
extern int addkeep(char ***, struct frentry *, int);
extern alist_t *alist_new(int, char *);
extern void alist_free(alist_t *);
extern void assigndefined(char *);
extern void binprint(void *, size_t);
extern u_32_t buildopts(char *, char *, int);
extern int checkrev(char *);
extern int connecttcp(char *, int);
extern int count6bits(u_32_t *);
extern int count4bits(u_32_t);
extern char *fac_toname(int);
extern int fac_findname(char *);
extern const char *familyname(const int);
extern void fill6bits(int, u_int *);
extern wordtab_t *findword(wordtab_t *, char *);
extern int ftov(int);
extern char *ipf_geterror(int, ioctlfunc_t *);
extern int genmask(int, char *, i6addr_t *);
extern int gethost(int, char *, i6addr_t *);
extern int geticmptype(int, char *);
extern int getport(struct frentry *, char *, u_short *, char *);
extern int getportproto(char *, int);
extern int getproto(char *);
extern char *getnattype(struct nat *);
extern char *getsumd(u_32_t);
extern u_32_t getoptbyname(char *);
extern u_32_t getoptbyvalue(int);
extern u_32_t getv6optbyname(char *);
extern u_32_t getv6optbyvalue(int);
extern char *icmptypename(int, int);
extern void initparse(void);
extern void ipf_dotuning(int, char *, ioctlfunc_t);
extern int ipf_addrule(int, ioctlfunc_t, void *);
extern void ipf_mutex_clean(void);
extern int ipf_parsefile(int, addfunc_t, ioctlfunc_t *, char *);
extern int ipf_parsesome(int, addfunc_t, ioctlfunc_t *, FILE *);
extern void ipf_perror(int, char *);
extern int ipf_perror_fd( int, ioctlfunc_t, char *);
extern void ipf_rwlock_clean(void);
extern char *ipf_strerror(int);
extern void ipferror(int, char *);
extern int ipmon_parsefile(char *);
extern int ipmon_parsesome(FILE *);
extern int ipnat_addrule(int, ioctlfunc_t, void *);
extern int ipnat_parsefile(int, addfunc_t, ioctlfunc_t, char *);
extern int ipnat_parsesome(int, addfunc_t, ioctlfunc_t, FILE *);
extern int ippool_parsefile(int, char *, ioctlfunc_t);
extern int ippool_parsesome(int, FILE *, ioctlfunc_t);
extern int kmemcpywrap(void *, void *, size_t);
extern char *kvatoname(ipfunc_t, ioctlfunc_t);
extern int load_dstlist(struct ippool_dst *, ioctlfunc_t,
ipf_dstnode_t *);
extern int load_dstlistnode(int, char *, struct ipf_dstnode *,
ioctlfunc_t);
extern alist_t *load_file(char *);
extern int load_hash(struct iphtable_s *, struct iphtent_s *,
ioctlfunc_t);
extern int load_hashnode(int, char *, struct iphtent_s *, int,
ioctlfunc_t);
extern alist_t *load_http(char *);
extern int load_pool(struct ip_pool_s *list, ioctlfunc_t);
extern int load_poolnode(int, char *, ip_pool_node_t *, int, ioctlfunc_t);
extern alist_t *load_url(char *);
extern alist_t *make_range(int, struct in_addr, struct in_addr);
extern void mb_hexdump(mb_t *, FILE *);
extern ipfunc_t nametokva(char *, ioctlfunc_t);
extern void nat_setgroupmap(struct ipnat *);
extern int ntomask(int, int, u_32_t *);
extern u_32_t optname(char ***, u_short *, int);
extern wordtab_t *parsefields(wordtab_t *, char *);
extern int *parseipfexpr(char *, char **);
extern int parsewhoisline(char *, addrfamily_t *, addrfamily_t *);
extern void pool_close(void);
extern int pool_fd(void);
extern int pool_ioctl(ioctlfunc_t, ioctlcmd_t, void *);
extern int pool_open(void);
extern char *portname(int, int);
extern int pri_findname(char *);
extern char *pri_toname(int);
extern void print_toif(int, char *, char *, struct frdest *);
extern void printaps(ap_session_t *, int, int);
extern void printaddr(int, int, char *, int, u_32_t *, u_32_t *);
extern void printbuf(char *, int, int);
extern void printfieldhdr(wordtab_t *, wordtab_t *);
extern void printfr(struct frentry *, ioctlfunc_t);
extern struct iphtable_s *printhash(struct iphtable_s *, copyfunc_t,
char *, int, wordtab_t *);
extern struct iphtable_s *printhash_live(iphtable_t *, int, char *,
int, wordtab_t *);
extern ippool_dst_t *printdstl_live(ippool_dst_t *, int, char *,
int, wordtab_t *);
extern void printhashdata(iphtable_t *, int);
extern struct iphtent_s *printhashnode(struct iphtable_s *,
struct iphtent_s *,
copyfunc_t, int, wordtab_t *);
extern void printhost(int, u_32_t *);
extern void printhostmask(int, u_32_t *, u_32_t *);
extern void printip(int, u_32_t *);
extern void printlog(struct frentry *);
extern void printlookup(char *, i6addr_t *addr, i6addr_t *mask);
extern void printmask(int, u_32_t *);
extern void printnataddr(int, char *, nat_addr_t *, int);
extern void printnatfield(nat_t *, int);
extern void printnatside(char *, nat_stat_side_t *);
extern void printpacket(int, mb_t *);
extern void printpacket6(int, mb_t *);
extern struct ippool_dst *printdstlist(struct ippool_dst *, copyfunc_t,
char *, int, ipf_dstnode_t *,
wordtab_t *);
extern void printdstlistdata(ippool_dst_t *, int);
extern ipf_dstnode_t *printdstlistnode(ipf_dstnode_t *, copyfunc_t,
int, wordtab_t *);
extern void printdstlistpolicy(ippool_policy_t);
extern struct ip_pool_s *printpool(struct ip_pool_s *, copyfunc_t,
char *, int, wordtab_t *);
extern void printpool_live(struct ip_pool_s *, int,
char *, int, wordtab_t *);
extern void printpooldata(ip_pool_t *, int);
extern void printpoolfield(void *, int, int);
extern struct ip_pool_node *printpoolnode(struct ip_pool_node *,
int, wordtab_t *);
extern void printproto(struct protoent *, int, struct ipnat *);
extern void printportcmp(int, struct frpcmp *);
extern void printstatefield(ipstate_t *, int);
extern void printtqtable(ipftq_t *);
extern void printtunable(ipftune_t *);
extern void printunit(int);
extern void optprint(u_short *, u_long, u_long);
#ifdef USE_INET6
extern void optprintv6(u_short *, u_long, u_long);
#endif
extern int remove_hash(struct iphtable_s *, ioctlfunc_t);
extern int remove_hashnode(int, char *, struct iphtent_s *, ioctlfunc_t);
extern int remove_pool(ip_pool_t *, ioctlfunc_t);
extern int remove_poolnode(int, char *, ip_pool_node_t *, ioctlfunc_t);
extern u_char tcpflags(char *);
extern void printc(struct frentry *);
extern void printC(int);
extern void emit(int, int, void *, struct frentry *);
extern u_char secbit(int);
extern u_char seclevel(char *);
extern void printfraginfo(char *, struct ipfr *);
extern void printifname(char *, char *, void *);
extern char *hostname(int, void *);
extern struct ipstate *printstate(struct ipstate *, int, u_long);
extern void printsbuf(char *);
extern void printnat(struct ipnat *, int);
extern void printactiveaddress(int, char *, i6addr_t *, char *);
extern void printactivenat(struct nat *, int, u_long);
extern void printhostmap(struct hostmap *, u_int);
extern void printtcpflags(u_32_t, u_32_t);
extern void printipfexpr(int *);
extern void printstatefield(ipstate_t *, int);
extern void printstatefieldhdr(int);
extern int sendtrap_v1_0(int, char *, char *, int, time_t);
extern int sendtrap_v2_0(int, char *, char *, int);
extern int vtof(int);
extern void set_variable(char *, char *);
extern char *get_variable(char *, char **, int);
extern void resetlexer(void);
extern void debug(int, char *, ...);
extern void verbose(int, char *, ...);
extern void ipfkdebug(char *, ...);
extern void ipfkverbose(char *, ...);
#if SOLARIS
extern int gethostname(char *, int );
extern void sync(void);
#endif
#endif /* __IPF_H__ */
diff --git a/sbin/ipf/common/ipf_y.y b/sbin/ipf/common/ipf_y.y
index ad4200023781..b3f7221672f3 100644
--- a/sbin/ipf/common/ipf_y.y
+++ b/sbin/ipf/common/ipf_y.y
@@ -1,2738 +1,2737 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
%{
#include "ipf.h"
#include <sys/ioctl.h>
#include <syslog.h>
#include <err.h>
#ifdef IPFILTER_BPF
# include <pcap.h>
#endif
#include "netinet/ip_pool.h"
#include "netinet/ip_htable.h"
#include "netinet/ipl.h"
#include "ipf_l.h"
#define YYDEBUG 1
#define DOALL(x) for (fr = frc; fr != NULL; fr = fr->fr_next) { x }
#define DOREM(x) for (; fr != NULL; fr = fr->fr_next) { x }
extern void yyerror(char *);
extern int yyparse(void);
extern int yylex(void);
extern int yydebug;
extern FILE *yyin;
extern int yylineNum;
static int addname(frentry_t **, char *);
static frentry_t *addrule(void);
static frentry_t *allocfr(void);
static void build_dstaddr_af(frentry_t *, void *);
static void build_srcaddr_af(frentry_t *, void *);
static void dobpf(int, char *);
static void doipfexpr(char *);
static void do_tuneint(char *, int);
static void do_tunestr(char *, char *);
static void fillgroup(frentry_t *);
static int lookuphost(char *, i6addr_t *);
static u_int makehash(struct alist_s *);
static int makepool(struct alist_s *);
static struct alist_s *newalist(struct alist_s *);
static void newrule(void);
static void resetaddr(void);
static void setgroup(frentry_t **, char *);
static void setgrhead(frentry_t **, char *);
static void seticmphead(frentry_t **, char *);
static void setifname(frentry_t **, int, char *);
static void setipftype(void);
static void setsyslog(void);
static void unsetsyslog(void);
frentry_t *fr = NULL, *frc = NULL, *frtop = NULL, *frold = NULL;
static int ifpflag = 0;
static int nowith = 0;
static int dynamic = -1;
static int pooled = 0;
static int hashed = 0;
static int nrules = 0;
static int newlist = 0;
static int added = 0;
static int ipffd = -1;
static int *yycont = NULL;
static ioctlfunc_t ipfioctls[IPL_LOGSIZE];
static addfunc_t ipfaddfunc = NULL;
%}
%union {
char *str;
u_32_t num;
frentry_t fr;
frtuc_t *frt;
struct alist_s *alist;
u_short port;
struct in_addr ip4;
struct {
u_short p1;
u_short p2;
int pc;
} pc;
struct ipp_s {
int type;
int ifpos;
int f;
int v;
int lif;
union i6addr a;
union i6addr m;
char *name;
} ipp;
struct {
i6addr_t adr;
int f;
} adr;
i6addr_t ip6;
struct {
char *if1;
char *if2;
} ifs;
char gname[FR_GROUPLEN];
};
%type <port> portnum
%type <num> facility priority icmpcode seclevel secname icmptype
%type <num> opt compare range opttype flagset optlist ipv6hdrlist ipv6hdr
%type <num> portc porteq ipmask maskopts
%type <ip4> ipv4 ipv4_16 ipv4_24
%type <adr> hostname
%type <ipp> addr ipaddr
%type <str> servicename name interfacename groupname
%type <pc> portrange portcomp
%type <alist> addrlist poollist
%type <ifs> onname
%token <num> YY_NUMBER YY_HEX
%token <str> YY_STR
%token YY_COMMENT
%token YY_CMP_EQ YY_CMP_NE YY_CMP_LE YY_CMP_GE YY_CMP_LT YY_CMP_GT
%token YY_RANGE_OUT YY_RANGE_IN
%token <ip6> YY_IPV6
%token IPFY_SET
%token IPFY_PASS IPFY_BLOCK IPFY_COUNT IPFY_CALL IPFY_NOMATCH
%token IPFY_RETICMP IPFY_RETRST IPFY_RETICMPASDST
%token IPFY_IN IPFY_OUT
%token IPFY_QUICK IPFY_ON IPFY_OUTVIA IPFY_INVIA
%token IPFY_DUPTO IPFY_TO IPFY_FROUTE IPFY_REPLY_TO IPFY_ROUTETO
%token IPFY_TOS IPFY_TTL IPFY_PROTO IPFY_INET IPFY_INET6
%token IPFY_HEAD IPFY_GROUP
%token IPFY_AUTH IPFY_PREAUTH
%token IPFY_LOG IPFY_BODY IPFY_FIRST IPFY_LEVEL IPFY_ORBLOCK IPFY_L5AS
%token IPFY_LOGTAG IPFY_MATCHTAG IPFY_SETTAG IPFY_SKIP IPFY_DECAPS
%token IPFY_FROM IPFY_ALL IPFY_ANY IPFY_BPFV4 IPFY_BPFV6 IPFY_POOL IPFY_HASH
%token IPFY_IPFEXPR IPFY_PPS IPFY_FAMILY IPFY_DSTLIST
%token IPFY_ESP IPFY_AH
%token IPFY_WITH IPFY_AND IPFY_NOT IPFY_NO IPFY_OPT
%token IPFY_TCPUDP IPFY_TCP IPFY_UDP
%token IPFY_FLAGS IPFY_MULTICAST
%token IPFY_MASK IPFY_BROADCAST IPFY_NETWORK IPFY_NETMASKED IPFY_PEER
%token IPFY_RPC IPFY_PORT
%token IPFY_NOW IPFY_COMMENT IPFY_RULETTL
%token IPFY_ICMP IPFY_ICMPTYPE IPFY_ICMPCODE
%token IPFY_IPOPTS IPFY_SHORT IPFY_NAT IPFY_BADSRC IPFY_LOWTTL IPFY_FRAG
%token IPFY_MBCAST IPFY_BAD IPFY_BADNAT IPFY_OOW IPFY_NEWISN IPFY_NOICMPERR
%token IPFY_KEEP IPFY_STATE IPFY_FRAGS IPFY_LIMIT IPFY_STRICT IPFY_AGE
%token IPFY_SYNC IPFY_FRAGBODY IPFY_ICMPHEAD IPFY_NOLOG IPFY_LOOSE
%token IPFY_MAX_SRCS IPFY_MAX_PER_SRC
%token IPFY_IPOPT_NOP IPFY_IPOPT_RR IPFY_IPOPT_ZSU IPFY_IPOPT_MTUP
%token IPFY_IPOPT_MTUR IPFY_IPOPT_ENCODE IPFY_IPOPT_TS IPFY_IPOPT_TR
%token IPFY_IPOPT_SEC IPFY_IPOPT_LSRR IPFY_IPOPT_ESEC IPFY_IPOPT_CIPSO
%token IPFY_IPOPT_SATID IPFY_IPOPT_SSRR IPFY_IPOPT_ADDEXT IPFY_IPOPT_VISA
%token IPFY_IPOPT_IMITD IPFY_IPOPT_EIP IPFY_IPOPT_FINN IPFY_IPOPT_DPS
%token IPFY_IPOPT_SDB IPFY_IPOPT_NSAPA IPFY_IPOPT_RTRALRT IPFY_IPOPT_UMP
%token IPFY_SECCLASS IPFY_SEC_UNC IPFY_SEC_CONF IPFY_SEC_RSV1 IPFY_SEC_RSV2
%token IPFY_SEC_RSV4 IPFY_SEC_SEC IPFY_SEC_TS IPFY_SEC_RSV3 IPFY_DOI
%token IPFY_V6HDRS IPFY_IPV6OPT IPFY_IPV6OPT_DSTOPTS IPFY_IPV6OPT_HOPOPTS
%token IPFY_IPV6OPT_IPV6 IPFY_IPV6OPT_NONE IPFY_IPV6OPT_ROUTING IPFY_V6HDR
%token IPFY_IPV6OPT_MOBILITY IPFY_IPV6OPT_ESP IPFY_IPV6OPT_FRAG
%token IPFY_ICMPT_UNR IPFY_ICMPT_ECHO IPFY_ICMPT_ECHOR IPFY_ICMPT_SQUENCH
%token IPFY_ICMPT_REDIR IPFY_ICMPT_TIMEX IPFY_ICMPT_PARAMP IPFY_ICMPT_TIMEST
%token IPFY_ICMPT_TIMESTREP IPFY_ICMPT_INFOREQ IPFY_ICMPT_INFOREP
%token IPFY_ICMPT_MASKREQ IPFY_ICMPT_MASKREP IPFY_ICMPT_ROUTERAD
%token IPFY_ICMPT_ROUTERSOL
%token IPFY_ICMPC_NETUNR IPFY_ICMPC_HSTUNR IPFY_ICMPC_PROUNR IPFY_ICMPC_PORUNR
%token IPFY_ICMPC_NEEDF IPFY_ICMPC_SRCFAIL IPFY_ICMPC_NETUNK IPFY_ICMPC_HSTUNK
%token IPFY_ICMPC_ISOLATE IPFY_ICMPC_NETPRO IPFY_ICMPC_HSTPRO
%token IPFY_ICMPC_NETTOS IPFY_ICMPC_HSTTOS IPFY_ICMPC_FLTPRO IPFY_ICMPC_HSTPRE
%token IPFY_ICMPC_CUTPRE
%token IPFY_FAC_KERN IPFY_FAC_USER IPFY_FAC_MAIL IPFY_FAC_DAEMON IPFY_FAC_AUTH
%token IPFY_FAC_SYSLOG IPFY_FAC_LPR IPFY_FAC_NEWS IPFY_FAC_UUCP IPFY_FAC_CRON
%token IPFY_FAC_LOCAL0 IPFY_FAC_LOCAL1 IPFY_FAC_LOCAL2 IPFY_FAC_LOCAL3
%token IPFY_FAC_LOCAL4 IPFY_FAC_LOCAL5 IPFY_FAC_LOCAL6 IPFY_FAC_LOCAL7
%token IPFY_FAC_SECURITY IPFY_FAC_FTP IPFY_FAC_AUTHPRIV IPFY_FAC_AUDIT
%token IPFY_FAC_LFMT IPFY_FAC_CONSOLE
%token IPFY_PRI_EMERG IPFY_PRI_ALERT IPFY_PRI_CRIT IPFY_PRI_ERR IPFY_PRI_WARN
%token IPFY_PRI_NOTICE IPFY_PRI_INFO IPFY_PRI_DEBUG
%%
file: settings rules
| rules
;
settings:
YY_COMMENT
| setting
| settings setting
;
rules: line
| assign
| rules line
| rules assign
;
setting:
IPFY_SET YY_STR YY_NUMBER ';' { do_tuneint($2, $3); }
| IPFY_SET YY_STR YY_HEX ';' { do_tuneint($2, $3); }
| IPFY_SET YY_STR YY_STR ';' { do_tunestr($2, $3); }
;
line: rule { while ((fr = frtop) != NULL) {
frtop = fr->fr_next;
fr->fr_next = NULL;
if ((fr->fr_type == FR_T_IPF) &&
(fr->fr_ip.fi_v == 0))
fr->fr_mip.fi_v = 0;
/* XXX validate ? */
(*ipfaddfunc)(ipffd, ipfioctls[IPL_LOGIPF], fr);
fr->fr_next = frold;
frold = fr;
}
resetlexer();
}
| YY_COMMENT
;
xx: { newrule(); }
;
assign: YY_STR assigning YY_STR ';' { set_variable($1, $3);
resetlexer();
free($1);
free($3);
yyvarnext = 0;
}
;
assigning:
'=' { yyvarnext = 1; }
;
rule: inrule eol
| outrule eol
;
eol: | ';'
;
inrule:
rulehead markin inopts rulemain ruletail intag ruletail2
;
outrule:
rulehead markout outopts rulemain ruletail outtag ruletail2
;
rulehead:
xx collection action
| xx insert collection action
;
markin: IPFY_IN { fr->fr_flags |= FR_INQUE; }
;
markout:
IPFY_OUT { fr->fr_flags |= FR_OUTQUE; }
;
rulemain:
ipfrule
| bpfrule
| exprrule
;
ipfrule:
family tos ttl proto ip
;
family: | IPFY_FAMILY IPFY_INET { if (use_inet6 == 1) {
YYERROR;
} else {
frc->fr_family = AF_INET;
}
}
| IPFY_INET { if (use_inet6 == 1) {
YYERROR;
} else {
frc->fr_family = AF_INET;
}
}
| IPFY_FAMILY IPFY_INET6 { if (use_inet6 == -1) {
YYERROR;
} else {
frc->fr_family = AF_INET6;
}
}
| IPFY_INET6 { if (use_inet6 == -1) {
YYERROR;
} else {
frc->fr_family = AF_INET6;
}
}
;
bpfrule:
IPFY_BPFV4 '{' YY_STR '}' { dobpf(4, $3); free($3); }
| IPFY_BPFV6 '{' YY_STR '}' { dobpf(6, $3); free($3); }
;
exprrule:
IPFY_IPFEXPR '{' YY_STR '}' { doipfexpr($3); }
;
ruletail:
with keep head group
;
ruletail2:
pps age new rulettl comment
;
intag: settagin matchtagin
;
outtag: settagout matchtagout
;
insert:
'@' YY_NUMBER { fr->fr_hits = (U_QUAD_T)$2 + 1; }
;
collection:
| YY_NUMBER { fr->fr_collect = $1; }
;
action: block
| IPFY_PASS { fr->fr_flags |= FR_PASS; }
| IPFY_NOMATCH { fr->fr_flags |= FR_NOMATCH; }
| log
| IPFY_COUNT { fr->fr_flags |= FR_ACCOUNT; }
| decaps { fr->fr_flags |= FR_DECAPSULATE; }
| auth
| IPFY_SKIP YY_NUMBER { fr->fr_flags |= FR_SKIP;
fr->fr_arg = $2; }
| IPFY_CALL func
| IPFY_CALL IPFY_NOW func { fr->fr_flags |= FR_CALLNOW; }
;
block: blocked
| blocked blockreturn
;
blocked:
IPFY_BLOCK { fr->fr_flags = FR_BLOCK; }
;
blockreturn:
IPFY_RETICMP { fr->fr_flags |= FR_RETICMP; }
| IPFY_RETICMP returncode { fr->fr_flags |= FR_RETICMP; }
| IPFY_RETICMPASDST { fr->fr_flags |= FR_FAKEICMP; }
| IPFY_RETICMPASDST returncode { fr->fr_flags |= FR_FAKEICMP; }
| IPFY_RETRST { fr->fr_flags |= FR_RETRST; }
;
decaps: IPFY_DECAPS
| IPFY_DECAPS IPFY_L5AS '(' YY_STR ')'
{ fr->fr_icode = atoi($4); }
;
log: IPFY_LOG { fr->fr_flags |= FR_LOG; }
| IPFY_LOG logoptions { fr->fr_flags |= FR_LOG; }
;
auth: IPFY_AUTH { fr->fr_flags |= FR_AUTH; }
| IPFY_AUTH blockreturn { fr->fr_flags |= FR_AUTH;}
| IPFY_PREAUTH { fr->fr_flags |= FR_PREAUTH; }
;
func: YY_STR '/' YY_NUMBER
{ fr->fr_func = nametokva($1, ipfioctls[IPL_LOGIPF]);
fr->fr_arg = $3;
free($1);
}
;
inopts:
| inopts inopt
;
inopt:
logopt
| quick
| on
| dup
| froute
| proute
| replyto
;
outopts:
| outopts outopt
;
outopt:
logopt
| quick
| on
| dup
| proute
| froute
| replyto
;
tos: | settos YY_NUMBER { DOALL(fr->fr_tos = $2; fr->fr_mtos = 0xff;) }
| settos YY_HEX { DOALL(fr->fr_tos = $2; fr->fr_mtos = 0xff;) }
| settos lstart toslist lend
;
settos: IPFY_TOS { setipftype(); }
;
toslist:
YY_NUMBER { DOALL(fr->fr_tos = $1; fr->fr_mtos = 0xff;) }
| YY_HEX { DOREM(fr->fr_tos = $1; fr->fr_mtos = 0xff;) }
| toslist lmore YY_NUMBER
{ DOREM(fr->fr_tos = $3; fr->fr_mtos = 0xff;) }
| toslist lmore YY_HEX
{ DOREM(fr->fr_tos = $3; fr->fr_mtos = 0xff;) }
;
ttl: | setttl YY_NUMBER
{ DOALL(fr->fr_ttl = $2; fr->fr_mttl = 0xff;) }
| setttl lstart ttllist lend
;
lstart: '{' { newlist = 1; fr = frc; added = 0; }
;
lend: '}' { nrules += added; }
;
lmore: lanother { if (newlist == 1) {
newlist = 0;
}
fr = addrule();
if (yycont != NULL)
*yycont = 1;
}
;
lanother:
| ','
;
setttl: IPFY_TTL { setipftype(); }
;
ttllist:
YY_NUMBER { DOREM(fr->fr_ttl = $1; fr->fr_mttl = 0xff;) }
| ttllist lmore YY_NUMBER
{ DOREM(fr->fr_ttl = $3; fr->fr_mttl = 0xff;) }
;
proto: | protox protocol { yyresetdict(); }
;
protox: IPFY_PROTO { setipftype();
fr = frc;
yysetdict(NULL); }
;
ip: srcdst flags icmp
;
group: | IPFY_GROUP groupname { DOALL(setgroup(&fr, $2); \
fillgroup(fr););
free($2);
}
;
head: | IPFY_HEAD groupname { DOALL(setgrhead(&fr, $2););
free($2);
}
;
groupname:
YY_STR { $$ = $1;
if (strlen($$) >= FR_GROUPLEN)
$$[FR_GROUPLEN - 1] = '\0';
}
| YY_NUMBER { $$ = malloc(16);
sprintf($$, "%d", $1);
}
;
settagin:
| IPFY_SETTAG '(' taginlist ')'
;
taginlist:
taginspec
| taginlist ',' taginspec
;
taginspec:
logtag
;
nattag: IPFY_NAT '=' YY_STR { DOALL(strncpy(fr->fr_nattag.ipt_tag,\
$3, IPFTAG_LEN););
free($3); }
| IPFY_NAT '=' YY_NUMBER { DOALL(sprintf(fr->fr_nattag.ipt_tag,\
"%d", $3 & 0xffffffff);) }
;
logtag: IPFY_LOG '=' YY_NUMBER { DOALL(fr->fr_logtag = $3;) }
;
settagout:
| IPFY_SETTAG '(' tagoutlist ')'
;
tagoutlist:
tagoutspec
| tagoutlist ',' tagoutspec
;
tagoutspec:
logtag
| nattag
;
matchtagin:
| IPFY_MATCHTAG '(' tagoutlist ')'
;
matchtagout:
| IPFY_MATCHTAG '(' taginlist ')'
;
pps: | IPFY_PPS YY_NUMBER { DOALL(fr->fr_pps = $2;) }
;
new: | savegroup file restoregroup
;
rulettl:
| IPFY_RULETTL YY_NUMBER { DOALL(fr->fr_die = $2;) }
;
comment:
| IPFY_COMMENT YY_STR { DOALL(fr->fr_comment = addname(&fr, \
$2);) }
;
savegroup:
'{'
;
restoregroup:
'}'
;
logopt: log
;
quick: IPFY_QUICK { fr->fr_flags |= FR_QUICK; }
;
on: IPFY_ON onname { setifname(&fr, 0, $2.if1);
free($2.if1);
if ($2.if2 != NULL) {
setifname(&fr, 1,
$2.if2);
free($2.if2);
}
}
| IPFY_ON lstart onlist lend
| IPFY_ON onname IPFY_INVIA vianame { setifname(&fr, 0, $2.if1);
free($2.if1);
if ($2.if2 != NULL) {
setifname(&fr, 1,
$2.if2);
free($2.if2);
}
}
| IPFY_ON onname IPFY_OUTVIA vianame { setifname(&fr, 0, $2.if1);
free($2.if1);
if ($2.if2 != NULL) {
setifname(&fr, 1,
$2.if2);
free($2.if2);
}
}
;
onlist: onname { DOREM(setifname(&fr, 0, $1.if1); \
if ($1.if2 != NULL) \
setifname(&fr, 1, $1.if2); \
)
free($1.if1);
if ($1.if2 != NULL)
free($1.if2);
}
| onlist lmore onname { DOREM(setifname(&fr, 0, $3.if1); \
if ($3.if2 != NULL) \
setifname(&fr, 1, $3.if2); \
)
free($3.if1);
if ($3.if2 != NULL)
free($3.if2);
}
;
onname: interfacename { $$.if1 = $1;
$$.if2 = NULL;
}
| interfacename ',' interfacename
{ $$.if1 = $1;
$$.if2 = $3;
}
;
vianame:
name { setifname(&fr, 2, $1);
free($1);
}
| name ',' name { setifname(&fr, 2, $1);
free($1);
setifname(&fr, 3, $3);
free($3);
}
;
dup: IPFY_DUPTO name
{ int idx = addname(&fr, $2);
fr->fr_dif.fd_name = idx;
free($2);
}
| IPFY_DUPTO IPFY_DSTLIST '/' name
{ int idx = addname(&fr, $4);
fr->fr_dif.fd_name = idx;
fr->fr_dif.fd_type = FRD_DSTLIST;
free($4);
}
| IPFY_DUPTO name duptoseparator hostname
{ int idx = addname(&fr, $2);
fr->fr_dif.fd_name = idx;
fr->fr_dif.fd_ptr = (void *)-1;
fr->fr_dif.fd_ip6 = $4.adr;
if (fr->fr_family == AF_UNSPEC && $4.f != AF_UNSPEC)
fr->fr_family = $4.f;
yyexpectaddr = 0;
free($2);
}
;
duptoseparator:
':' { yyexpectaddr = 1; yycont = &yyexpectaddr; resetaddr(); }
;
froute: IPFY_FROUTE { fr->fr_flags |= FR_FASTROUTE; }
;
proute: routeto name
{ int idx = addname(&fr, $2);
fr->fr_tif.fd_name = idx;
free($2);
}
| routeto IPFY_DSTLIST '/' name
{ int idx = addname(&fr, $4);
fr->fr_tif.fd_name = idx;
fr->fr_tif.fd_type = FRD_DSTLIST;
free($4);
}
| routeto name duptoseparator hostname
{ int idx = addname(&fr, $2);
fr->fr_tif.fd_name = idx;
fr->fr_tif.fd_ptr = (void *)-1;
fr->fr_tif.fd_ip6 = $4.adr;
if (fr->fr_family == AF_UNSPEC && $4.f != AF_UNSPEC)
fr->fr_family = $4.f;
yyexpectaddr = 0;
free($2);
}
;
routeto:
IPFY_TO
| IPFY_ROUTETO
;
replyto:
IPFY_REPLY_TO name
{ int idx = addname(&fr, $2);
fr->fr_rif.fd_name = idx;
free($2);
}
| IPFY_REPLY_TO IPFY_DSTLIST '/' name
{ fr->fr_rif.fd_name = addname(&fr, $4);
fr->fr_rif.fd_type = FRD_DSTLIST;
free($4);
}
| IPFY_REPLY_TO name duptoseparator hostname
{ int idx = addname(&fr, $2);
fr->fr_rif.fd_name = idx;
fr->fr_rif.fd_ptr = (void *)-1;
fr->fr_rif.fd_ip6 = $4.adr;
if (fr->fr_family == AF_UNSPEC && $4.f != AF_UNSPEC)
fr->fr_family = $4.f;
free($2);
}
;
logoptions:
logoption
| logoptions logoption
;
logoption:
IPFY_BODY { fr->fr_flags |= FR_LOGBODY; }
| IPFY_FIRST { fr->fr_flags |= FR_LOGFIRST; }
| IPFY_ORBLOCK { fr->fr_flags |= FR_LOGORBLOCK; }
| level loglevel { unsetsyslog(); }
;
returncode:
starticmpcode icmpcode ')' { fr->fr_icode = $2; yyresetdict(); }
;
starticmpcode:
'(' { yysetdict(icmpcodewords); }
;
srcdst: | IPFY_ALL
| fromto
;
protocol:
YY_NUMBER { DOALL(fr->fr_proto = $1; \
fr->fr_mproto = 0xff;)
}
| YY_STR { if (!strcmp($1, "tcp-udp")) {
DOALL(fr->fr_flx |= FI_TCPUDP; \
fr->fr_mflx |= FI_TCPUDP;)
} else {
int p = getproto($1);
if (p == -1)
yyerror("protocol unknown");
DOALL(fr->fr_proto = p; \
fr->fr_mproto = 0xff;)
}
free($1);
}
| YY_STR nextstring YY_STR
{ if (!strcmp($1, "tcp") &&
!strcmp($3, "udp")) {
DOREM(fr->fr_flx |= FI_TCPUDP; \
fr->fr_mflx |= FI_TCPUDP;)
} else {
YYERROR;
}
free($1);
free($3);
}
;
nextstring:
'/' { yysetdict(NULL); }
;
fromto: from srcobject to dstobject { yyexpectaddr = 0; yycont = NULL; }
| to dstobject { yyexpectaddr = 0; yycont = NULL; }
| from srcobject { yyexpectaddr = 0; yycont = NULL; }
;
from: IPFY_FROM { setipftype();
if (fr == NULL)
fr = frc;
yyexpectaddr = 1;
if (yydebug)
printf("set yyexpectaddr\n");
yycont = &yyexpectaddr;
yysetdict(addrwords);
resetaddr(); }
;
to: IPFY_TO { if (fr == NULL)
fr = frc;
yyexpectaddr = 1;
if (yydebug)
printf("set yyexpectaddr\n");
yycont = &yyexpectaddr;
yysetdict(addrwords);
resetaddr();
}
;
with: | andwith withlist
;
andwith:
IPFY_WITH { nowith = 0; setipftype(); }
| IPFY_AND { nowith = 0; setipftype(); }
;
flags: | startflags flagset
{ DOALL(fr->fr_tcpf = $2; fr->fr_tcpfm = FR_TCPFMAX;) }
| startflags flagset '/' flagset
{ DOALL(fr->fr_tcpf = $2; fr->fr_tcpfm = $4;) }
| startflags '/' flagset
{ DOALL(fr->fr_tcpf = 0; fr->fr_tcpfm = $3;) }
| startflags YY_NUMBER
{ DOALL(fr->fr_tcpf = $2; fr->fr_tcpfm = FR_TCPFMAX;) }
| startflags '/' YY_NUMBER
{ DOALL(fr->fr_tcpf = 0; fr->fr_tcpfm = $3;) }
| startflags YY_NUMBER '/' YY_NUMBER
{ DOALL(fr->fr_tcpf = $2; fr->fr_tcpfm = $4;) }
| startflags flagset '/' YY_NUMBER
{ DOALL(fr->fr_tcpf = $2; fr->fr_tcpfm = $4;) }
| startflags YY_NUMBER '/' flagset
{ DOALL(fr->fr_tcpf = $2; fr->fr_tcpfm = $4;) }
;
startflags:
IPFY_FLAGS { if (frc->fr_type != FR_T_IPF)
yyerror("flags with non-ipf type rule");
if (frc->fr_proto != IPPROTO_TCP)
yyerror("flags with non-TCP rule");
}
;
flagset:
YY_STR { $$ = tcpflags($1); free($1); }
| YY_HEX { $$ = $1; }
;
srcobject:
{ yyresetdict(); } fromport
| srcaddr srcport
| '!' srcaddr srcport
{ DOALL(fr->fr_flags |= FR_NOTSRCIP;) }
;
srcaddr:
addr { build_srcaddr_af(fr, &$1); }
| lstart srcaddrlist lend
;
srcaddrlist:
addr { build_srcaddr_af(fr, &$1); }
| srcaddrlist lmore addr
{ build_srcaddr_af(fr, &$3); }
;
srcport:
| portcomp
{ DOALL(fr->fr_scmp = $1.pc; fr->fr_sport = $1.p1;) }
| portrange
{ DOALL(fr->fr_scmp = $1.pc; fr->fr_sport = $1.p1; \
fr->fr_stop = $1.p2;) }
| porteq lstart srcportlist lend
{ yyresetdict(); }
;
fromport:
portcomp
{ DOALL(fr->fr_scmp = $1.pc; fr->fr_sport = $1.p1;) }
| portrange
{ DOALL(fr->fr_scmp = $1.pc; fr->fr_sport = $1.p1; \
fr->fr_stop = $1.p2;) }
| porteq lstart srcportlist lend
{ yyresetdict(); }
;
srcportlist:
portnum { DOREM(fr->fr_scmp = FR_EQUAL; fr->fr_sport = $1;) }
| portnum ':' portnum
{ DOREM(fr->fr_scmp = FR_INCRANGE; fr->fr_sport = $1; \
fr->fr_stop = $3;) }
| portnum YY_RANGE_IN portnum
{ DOREM(fr->fr_scmp = FR_INRANGE; fr->fr_sport = $1; \
fr->fr_stop = $3;) }
| srcportlist lmore portnum
{ DOREM(fr->fr_scmp = FR_EQUAL; fr->fr_sport = $3;) }
| srcportlist lmore portnum ':' portnum
{ DOREM(fr->fr_scmp = FR_INCRANGE; fr->fr_sport = $3; \
fr->fr_stop = $5;) }
| srcportlist lmore portnum YY_RANGE_IN portnum
{ DOREM(fr->fr_scmp = FR_INRANGE; fr->fr_sport = $3; \
fr->fr_stop = $5;) }
;
dstobject:
{ yyresetdict(); } toport
| dstaddr dstport
| '!' dstaddr dstport
{ DOALL(fr->fr_flags |= FR_NOTDSTIP;) }
;
dstaddr:
addr { if (($1.f != AF_UNSPEC) && (frc->fr_family != AF_UNSPEC) &&
($1.f != frc->fr_family))
yyerror("1.src/dst address family mismatch");
build_dstaddr_af(fr, &$1);
}
| lstart dstaddrlist lend
;
dstaddrlist:
addr { if (($1.f != AF_UNSPEC) && (frc->fr_family != AF_UNSPEC) &&
($1.f != frc->fr_family))
yyerror("2.src/dst address family mismatch");
build_dstaddr_af(fr, &$1);
}
| dstaddrlist lmore addr
{ if (($3.f != AF_UNSPEC) && (frc->fr_family != AF_UNSPEC) &&
($3.f != frc->fr_family))
yyerror("3.src/dst address family mismatch");
build_dstaddr_af(fr, &$3);
}
;
dstport:
| portcomp
{ DOALL(fr->fr_dcmp = $1.pc; fr->fr_dport = $1.p1;) }
| portrange
{ DOALL(fr->fr_dcmp = $1.pc; fr->fr_dport = $1.p1; \
fr->fr_dtop = $1.p2;) }
| porteq lstart dstportlist lend
{ yyresetdict(); }
;
toport:
portcomp
{ DOALL(fr->fr_dcmp = $1.pc; fr->fr_dport = $1.p1;) }
| portrange
{ DOALL(fr->fr_dcmp = $1.pc; fr->fr_dport = $1.p1; \
fr->fr_dtop = $1.p2;) }
| porteq lstart dstportlist lend
{ yyresetdict(); }
;
dstportlist:
portnum { DOREM(fr->fr_dcmp = FR_EQUAL; fr->fr_dport = $1;) }
| portnum ':' portnum
{ DOREM(fr->fr_dcmp = FR_INCRANGE; fr->fr_dport = $1; \
fr->fr_dtop = $3;) }
| portnum YY_RANGE_IN portnum
{ DOREM(fr->fr_dcmp = FR_INRANGE; fr->fr_dport = $1; \
fr->fr_dtop = $3;) }
| dstportlist lmore portnum
{ DOREM(fr->fr_dcmp = FR_EQUAL; fr->fr_dport = $3;) }
| dstportlist lmore portnum ':' portnum
{ DOREM(fr->fr_dcmp = FR_INCRANGE; fr->fr_dport = $3; \
fr->fr_dtop = $5;) }
| dstportlist lmore portnum YY_RANGE_IN portnum
{ DOREM(fr->fr_dcmp = FR_INRANGE; fr->fr_dport = $3; \
fr->fr_dtop = $5;) }
;
addr: pool '/' YY_NUMBER { pooled = 1;
yyexpectaddr = 0;
$$.type = FRI_LOOKUP;
$$.v = 0;
$$.ifpos = -1;
$$.f = AF_UNSPEC;
$$.a.iplookuptype = IPLT_POOL;
$$.a.iplookupsubtype = 0;
$$.a.iplookupnum = $3; }
| pool '/' YY_STR { pooled = 1;
$$.ifpos = -1;
$$.f = AF_UNSPEC;
$$.type = FRI_LOOKUP;
$$.a.iplookuptype = IPLT_POOL;
$$.a.iplookupsubtype = 1;
$$.a.iplookupname = addname(&fr, $3);
}
| pool '=' '(' { yyexpectaddr = 1;
pooled = 1;
}
poollist ')' { yyexpectaddr = 0;
$$.v = 0;
$$.ifpos = -1;
$$.f = AF_UNSPEC;
$$.type = FRI_LOOKUP;
$$.a.iplookuptype = IPLT_POOL;
$$.a.iplookupsubtype = 0;
$$.a.iplookupnum = makepool($5);
}
| hash '/' YY_NUMBER { hashed = 1;
yyexpectaddr = 0;
$$.v = 0;
$$.ifpos = -1;
$$.f = AF_UNSPEC;
$$.type = FRI_LOOKUP;
$$.a.iplookuptype = IPLT_HASH;
$$.a.iplookupsubtype = 0;
$$.a.iplookupnum = $3;
}
| hash '/' YY_STR { hashed = 1;
$$.type = FRI_LOOKUP;
$$.v = 0;
$$.ifpos = -1;
$$.f = AF_UNSPEC;
$$.a.iplookuptype = IPLT_HASH;
$$.a.iplookupsubtype = 1;
$$.a.iplookupname = addname(&fr, $3);
}
| hash '=' '(' { hashed = 1;
yyexpectaddr = 1;
}
addrlist ')' { yyexpectaddr = 0;
$$.v = 0;
$$.ifpos = -1;
$$.f = AF_UNSPEC;
$$.type = FRI_LOOKUP;
$$.a.iplookuptype = IPLT_HASH;
$$.a.iplookupsubtype = 0;
$$.a.iplookupnum = makehash($5);
}
| ipaddr { $$ = $1;
yyexpectaddr = 0; }
;
ipaddr: IPFY_ANY { memset(&($$), 0, sizeof($$));
$$.type = FRI_NORMAL;
$$.ifpos = -1;
yyexpectaddr = 0;
}
| hostname { memset(&($$), 0, sizeof($$));
$$.a = $1.adr;
$$.f = $1.f;
if ($1.f == AF_INET6)
fill6bits(128, $$.m.i6);
else if ($1.f == AF_INET)
fill6bits(32, $$.m.i6);
$$.v = ftov($1.f);
$$.ifpos = dynamic;
$$.type = FRI_NORMAL;
}
| hostname { yyresetdict(); }
maskspace { yysetdict(maskwords);
yyexpectaddr = 2; }
ipmask { memset(&($$), 0, sizeof($$));
ntomask($1.f, $5, $$.m.i6);
$$.a = $1.adr;
$$.a.i6[0] &= $$.m.i6[0];
$$.a.i6[1] &= $$.m.i6[1];
$$.a.i6[2] &= $$.m.i6[2];
$$.a.i6[3] &= $$.m.i6[3];
$$.f = $1.f;
$$.v = ftov($1.f);
$$.type = ifpflag;
$$.ifpos = dynamic;
if (ifpflag != 0 && $$.v == 0) {
if (frc->fr_family == AF_INET6){
$$.v = 6;
$$.f = AF_INET6;
} else {
$$.v = 4;
$$.f = AF_INET;
}
}
yyresetdict();
yyexpectaddr = 0;
}
| '(' YY_STR ')' { memset(&($$), 0, sizeof($$));
$$.type = FRI_DYNAMIC;
ifpflag = FRI_DYNAMIC;
$$.ifpos = addname(&fr, $2);
$$.lif = 0;
}
| '(' YY_STR ')' '/'
{ ifpflag = FRI_DYNAMIC; yysetdict(maskwords); }
maskopts
{ memset(&($$), 0, sizeof($$));
$$.type = ifpflag;
$$.ifpos = addname(&fr, $2);
$$.lif = 0;
if (frc->fr_family == AF_UNSPEC)
frc->fr_family = AF_INET;
if (ifpflag == FRI_DYNAMIC) {
ntomask(frc->fr_family,
$6, $$.m.i6);
}
yyresetdict();
yyexpectaddr = 0;
}
| '(' YY_STR ':' YY_NUMBER ')' '/'
{ ifpflag = FRI_DYNAMIC; yysetdict(maskwords); }
maskopts
{ memset(&($$), 0, sizeof($$));
$$.type = ifpflag;
$$.ifpos = addname(&fr, $2);
$$.lif = $4;
if (frc->fr_family == AF_UNSPEC)
frc->fr_family = AF_INET;
if (ifpflag == FRI_DYNAMIC) {
ntomask(frc->fr_family,
$8, $$.m.i6);
}
yyresetdict();
yyexpectaddr = 0;
}
;
maskspace:
'/'
| IPFY_MASK
;
ipmask: ipv4 { $$ = count4bits($1.s_addr); }
| YY_HEX { $$ = count4bits(htonl($1)); }
| YY_NUMBER { $$ = $1; }
| YY_IPV6 { $$ = count6bits($1.i6); }
| maskopts { $$ = $1; }
;
maskopts:
IPFY_BROADCAST { if (ifpflag == FRI_DYNAMIC) {
ifpflag = FRI_BROADCAST;
} else {
YYERROR;
}
$$ = 0;
}
| IPFY_NETWORK { if (ifpflag == FRI_DYNAMIC) {
ifpflag = FRI_NETWORK;
} else {
YYERROR;
}
$$ = 0;
}
| IPFY_NETMASKED { if (ifpflag == FRI_DYNAMIC) {
ifpflag = FRI_NETMASKED;
} else {
YYERROR;
}
$$ = 0;
}
| IPFY_PEER { if (ifpflag == FRI_DYNAMIC) {
ifpflag = FRI_PEERADDR;
} else {
YYERROR;
}
$$ = 0;
}
| YY_NUMBER { $$ = $1; }
;
hostname:
ipv4 { memset(&($$), 0, sizeof($$));
$$.adr.in4 = $1;
if (frc->fr_family == AF_INET6)
YYERROR;
$$.f = AF_INET;
yyexpectaddr = 2;
}
| YY_NUMBER { memset(&($$), 0, sizeof($$));
if (frc->fr_family == AF_INET6)
YYERROR;
$$.adr.in4_addr = $1;
$$.f = AF_INET;
yyexpectaddr = 2;
}
| YY_HEX { memset(&($$), 0, sizeof($$));
if (frc->fr_family == AF_INET6)
YYERROR;
$$.adr.in4_addr = $1;
$$.f = AF_INET;
yyexpectaddr = 2;
}
| YY_STR { memset(&($$), 0, sizeof($$));
if (lookuphost($1, &$$.adr) == 0)
$$.f = AF_INET;
free($1);
yyexpectaddr = 2;
}
| YY_IPV6 { memset(&($$), 0, sizeof($$));
if (frc->fr_family == AF_INET)
YYERROR;
$$.adr = $1;
$$.f = AF_INET6;
yyexpectaddr = 2;
}
;
addrlist:
ipaddr { $$ = newalist(NULL);
$$->al_family = $1.f;
$$->al_i6addr = $1.a;
$$->al_i6mask = $1.m;
}
| ipaddr ',' { yyexpectaddr = 1; } addrlist
{ $$ = newalist($4);
$$->al_family = $1.f;
$$->al_i6addr = $1.a;
$$->al_i6mask = $1.m;
}
;
pool: IPFY_POOL { yyexpectaddr = 0; yycont = NULL; yyresetdict(); }
;
hash: IPFY_HASH { yyexpectaddr = 0; yycont = NULL; yyresetdict(); }
;
poollist:
ipaddr { $$ = newalist(NULL);
$$->al_family = $1.f;
$$->al_i6addr = $1.a;
$$->al_i6mask = $1.m;
}
| '!' ipaddr { $$ = newalist(NULL);
$$->al_not = 1;
$$->al_family = $2.f;
$$->al_i6addr = $2.a;
$$->al_i6mask = $2.m;
}
| poollist ',' ipaddr
{ $$ = newalist($1);
$$->al_family = $3.f;
$$->al_i6addr = $3.a;
$$->al_i6mask = $3.m;
}
| poollist ',' '!' ipaddr
{ $$ = newalist($1);
$$->al_not = 1;
$$->al_family = $4.f;
$$->al_i6addr = $4.a;
$$->al_i6mask = $4.m;
}
;
port: IPFY_PORT { yyexpectaddr = 0;
yycont = NULL;
if (frc->fr_proto != 0 &&
frc->fr_proto != IPPROTO_UDP &&
frc->fr_proto != IPPROTO_TCP)
yyerror("port use incorrect");
}
;
portc: port compare { $$ = $2;
yysetdict(NULL);
}
| porteq { $$ = $1; }
;
porteq: port '=' { $$ = FR_EQUAL;
yysetdict(NULL);
}
;
portr: IPFY_PORT { yyexpectaddr = 0;
yycont = NULL;
yysetdict(NULL);
}
;
portcomp:
portc portnum { $$.pc = $1;
$$.p1 = $2;
yyresetdict();
}
;
portrange:
portr portnum range portnum { $$.p1 = $2;
$$.pc = $3;
$$.p2 = $4;
yyresetdict();
}
;
icmp: | itype icode
;
itype: seticmptype icmptype
{ DOALL(fr->fr_icmp = htons($2 << 8); fr->fr_icmpm = htons(0xff00););
yyresetdict();
}
| seticmptype lstart typelist lend { yyresetdict(); }
;
seticmptype:
IPFY_ICMPTYPE { if (frc->fr_family == AF_UNSPEC)
frc->fr_family = AF_INET;
if (frc->fr_family == AF_INET &&
frc->fr_type == FR_T_IPF &&
frc->fr_proto != IPPROTO_ICMP) {
yyerror("proto not icmp");
}
if (frc->fr_family == AF_INET6 &&
frc->fr_type == FR_T_IPF &&
frc->fr_proto != IPPROTO_ICMPV6) {
yyerror("proto not ipv6-icmp");
}
setipftype();
DOALL(if (fr->fr_family == AF_INET) { \
fr->fr_ip.fi_v = 4; \
fr->fr_mip.fi_v = 0xf; \
}
if (fr->fr_family == AF_INET6) { \
fr->fr_ip.fi_v = 6; \
fr->fr_mip.fi_v = 0xf; \
}
)
yysetdict(NULL);
}
;
icode: | seticmpcode icmpcode
{ DOALL(fr->fr_icmp |= htons($2); fr->fr_icmpm |= htons(0xff););
yyresetdict();
}
| seticmpcode lstart codelist lend { yyresetdict(); }
;
seticmpcode:
IPFY_ICMPCODE { yysetdict(icmpcodewords); }
;
typelist:
icmptype
{ DOREM(fr->fr_icmp = htons($1 << 8); fr->fr_icmpm = htons(0xff00);) }
| typelist lmore icmptype
{ DOREM(fr->fr_icmp = htons($3 << 8); fr->fr_icmpm = htons(0xff00);) }
;
codelist:
icmpcode
{ DOREM(fr->fr_icmp |= htons($1); fr->fr_icmpm |= htons(0xff);) }
| codelist lmore icmpcode
{ DOREM(fr->fr_icmp &= htons(0xff00); fr->fr_icmp |= htons($3); \
fr->fr_icmpm |= htons(0xff);) }
;
age: | IPFY_AGE YY_NUMBER { DOALL(fr->fr_age[0] = $2; \
fr->fr_age[1] = $2;) }
| IPFY_AGE YY_NUMBER '/' YY_NUMBER
{ DOALL(fr->fr_age[0] = $2; \
fr->fr_age[1] = $4;) }
;
keep: | IPFY_KEEP keepstate keep
| IPFY_KEEP keepfrag keep
;
keepstate:
IPFY_STATE stateoptlist { DOALL(fr->fr_flags |= FR_KEEPSTATE;)}
;
keepfrag:
IPFY_FRAGS fragoptlist { DOALL(fr->fr_flags |= FR_KEEPFRAG;) }
| IPFY_FRAG fragoptlist { DOALL(fr->fr_flags |= FR_KEEPFRAG;) }
;
fragoptlist:
| '(' fragopts ')'
;
fragopts:
fragopt lanother fragopts
| fragopt
;
fragopt:
IPFY_STRICT { DOALL(fr->fr_flags |= FR_FRSTRICT;) }
;
stateoptlist:
| '(' stateopts ')'
;
stateopts:
stateopt lanother stateopts
| stateopt
;
stateopt:
IPFY_LIMIT YY_NUMBER { DOALL(fr->fr_statemax = $2;) }
| IPFY_STRICT { DOALL(if (fr->fr_proto != IPPROTO_TCP) { \
YYERROR; \
} else if (fr->fr_flags & FR_STLOOSE) {\
YYERROR; \
} else \
fr->fr_flags |= FR_STSTRICT;)
}
| IPFY_LOOSE { DOALL(if (fr->fr_proto != IPPROTO_TCP) { \
YYERROR; \
} else if (fr->fr_flags & FR_STSTRICT){\
YYERROR; \
} else \
fr->fr_flags |= FR_STLOOSE;)
}
| IPFY_NEWISN { DOALL(if (fr->fr_proto != IPPROTO_TCP) { \
YYERROR; \
} else \
fr->fr_flags |= FR_NEWISN;)
}
| IPFY_NOICMPERR { DOALL(fr->fr_flags |= FR_NOICMPERR;) }
| IPFY_SYNC { DOALL(fr->fr_flags |= FR_STATESYNC;) }
| IPFY_AGE YY_NUMBER { DOALL(fr->fr_age[0] = $2; \
fr->fr_age[1] = $2;) }
| IPFY_AGE YY_NUMBER '/' YY_NUMBER
{ DOALL(fr->fr_age[0] = $2; \
fr->fr_age[1] = $4;) }
| IPFY_ICMPHEAD groupname
{ DOALL(seticmphead(&fr, $2);)
free($2);
}
| IPFY_NOLOG
{ DOALL(fr->fr_nostatelog = 1;) }
| IPFY_RPC
{ DOALL(fr->fr_rpc = 1;) }
| IPFY_RPC IPFY_IN YY_STR
{ DOALL(fr->fr_rpc = 1;) }
| IPFY_MAX_SRCS YY_NUMBER
{ DOALL(fr->fr_srctrack.ht_max_nodes = $2;) }
| IPFY_MAX_PER_SRC YY_NUMBER
{ DOALL(fr->fr_srctrack.ht_max_per_node = $2; \
fr->fr_srctrack.ht_netmask = \
fr->fr_family == AF_INET ? 32: 128;)
}
| IPFY_MAX_PER_SRC YY_NUMBER '/' YY_NUMBER
{ DOALL(fr->fr_srctrack.ht_max_per_node = $2; \
fr->fr_srctrack.ht_netmask = $4;)
}
;
portnum:
servicename { if (getport(frc, $1,
&($$), NULL) == -1)
yyerror("service unknown");
$$ = ntohs($$);
free($1);
}
| YY_NUMBER { if ($1 > 65535) /* Unsigned */
yyerror("invalid port number");
else
$$ = $1;
}
;
withlist:
withopt { nowith = 0; }
| withlist withopt { nowith = 0; }
| withlist ',' withopt { nowith = 0; }
;
withopt:
opttype { DOALL(fr->fr_flx |= $1; fr->fr_mflx |= $1;) }
| notwith opttype { DOALL(fr->fr_mflx |= $2;) }
| ipopt ipopts { yyresetdict(); }
| notwith ipopt ipopts { yyresetdict(); }
| startv6hdr ipv6hdrs { yyresetdict(); }
;
ipopt: IPFY_OPT { yysetdict(ipv4optwords); }
;
startv6hdr:
IPFY_V6HDR { if (frc->fr_family != AF_INET6)
yyerror("only available with IPv6");
yysetdict(ipv6optwords);
}
;
notwith:
IPFY_NOT { nowith = 1; }
| IPFY_NO { nowith = 1; }
;
opttype:
IPFY_IPOPTS { $$ = FI_OPTIONS; }
| IPFY_SHORT { $$ = FI_SHORT; }
| IPFY_NAT { $$ = FI_NATED; }
| IPFY_BAD { $$ = FI_BAD; }
| IPFY_BADNAT { $$ = FI_BADNAT; }
| IPFY_BADSRC { $$ = FI_BADSRC; }
| IPFY_LOWTTL { $$ = FI_LOWTTL; }
| IPFY_FRAG { $$ = FI_FRAG; }
| IPFY_FRAGBODY { $$ = FI_FRAGBODY; }
| IPFY_FRAGS { $$ = FI_FRAG; }
| IPFY_MBCAST { $$ = FI_MBCAST; }
| IPFY_MULTICAST { $$ = FI_MULTICAST; }
| IPFY_BROADCAST { $$ = FI_BROADCAST; }
| IPFY_STATE { $$ = FI_STATE; }
| IPFY_OOW { $$ = FI_OOW; }
| IPFY_AH { $$ = FI_AH; }
| IPFY_V6HDRS { $$ = FI_V6EXTHDR; }
;
ipopts: optlist { DOALL(fr->fr_mip.fi_optmsk |= $1;
if (fr->fr_family == AF_UNSPEC) {
fr->fr_family = AF_INET;
fr->fr_ip.fi_v = 4;
fr->fr_mip.fi_v = 0xf;
} else if (fr->fr_family != AF_INET) {
YYERROR;
}
if (!nowith)
fr->fr_ip.fi_optmsk |= $1;)
}
;
optlist:
opt { $$ |= $1; }
| optlist ',' opt { $$ |= $1 | $3; }
;
ipv6hdrs:
ipv6hdrlist { DOALL(fr->fr_mip.fi_optmsk |= $1;
if (!nowith)
fr->fr_ip.fi_optmsk |= $1;)
}
;
ipv6hdrlist:
ipv6hdr { $$ |= $1; }
| ipv6hdrlist ',' ipv6hdr { $$ |= $1 | $3; }
;
secname:
seclevel { $$ |= $1; }
| secname ',' seclevel { $$ |= $1 | $3; }
;
seclevel:
IPFY_SEC_UNC { $$ = secbit(IPSO_CLASS_UNCL); }
| IPFY_SEC_CONF { $$ = secbit(IPSO_CLASS_CONF); }
| IPFY_SEC_RSV1 { $$ = secbit(IPSO_CLASS_RES1); }
| IPFY_SEC_RSV2 { $$ = secbit(IPSO_CLASS_RES2); }
| IPFY_SEC_RSV3 { $$ = secbit(IPSO_CLASS_RES3); }
| IPFY_SEC_RSV4 { $$ = secbit(IPSO_CLASS_RES4); }
| IPFY_SEC_SEC { $$ = secbit(IPSO_CLASS_SECR); }
| IPFY_SEC_TS { $$ = secbit(IPSO_CLASS_TOPS); }
;
icmptype:
YY_NUMBER { $$ = $1; }
| YY_STR { $$ = geticmptype(frc->fr_family, $1);
if ($$ == -1)
yyerror("unrecognised icmp type");
}
;
icmpcode:
YY_NUMBER { $$ = $1; }
| IPFY_ICMPC_NETUNR { $$ = ICMP_UNREACH_NET; }
| IPFY_ICMPC_HSTUNR { $$ = ICMP_UNREACH_HOST; }
| IPFY_ICMPC_PROUNR { $$ = ICMP_UNREACH_PROTOCOL; }
| IPFY_ICMPC_PORUNR { $$ = ICMP_UNREACH_PORT; }
| IPFY_ICMPC_NEEDF { $$ = ICMP_UNREACH_NEEDFRAG; }
| IPFY_ICMPC_SRCFAIL { $$ = ICMP_UNREACH_SRCFAIL; }
| IPFY_ICMPC_NETUNK { $$ = ICMP_UNREACH_NET_UNKNOWN; }
| IPFY_ICMPC_HSTUNK { $$ = ICMP_UNREACH_HOST_UNKNOWN; }
| IPFY_ICMPC_ISOLATE { $$ = ICMP_UNREACH_ISOLATED; }
| IPFY_ICMPC_NETPRO { $$ = ICMP_UNREACH_NET_PROHIB; }
| IPFY_ICMPC_HSTPRO { $$ = ICMP_UNREACH_HOST_PROHIB; }
| IPFY_ICMPC_NETTOS { $$ = ICMP_UNREACH_TOSNET; }
| IPFY_ICMPC_HSTTOS { $$ = ICMP_UNREACH_TOSHOST; }
| IPFY_ICMPC_FLTPRO { $$ = ICMP_UNREACH_ADMIN_PROHIBIT; }
| IPFY_ICMPC_HSTPRE { $$ = 14; }
| IPFY_ICMPC_CUTPRE { $$ = 15; }
;
opt:
IPFY_IPOPT_NOP { $$ = getoptbyvalue(IPOPT_NOP); }
| IPFY_IPOPT_RR { $$ = getoptbyvalue(IPOPT_RR); }
| IPFY_IPOPT_ZSU { $$ = getoptbyvalue(IPOPT_ZSU); }
| IPFY_IPOPT_MTUP { $$ = getoptbyvalue(IPOPT_MTUP); }
| IPFY_IPOPT_MTUR { $$ = getoptbyvalue(IPOPT_MTUR); }
| IPFY_IPOPT_ENCODE { $$ = getoptbyvalue(IPOPT_ENCODE); }
| IPFY_IPOPT_TS { $$ = getoptbyvalue(IPOPT_TS); }
| IPFY_IPOPT_TR { $$ = getoptbyvalue(IPOPT_TR); }
| IPFY_IPOPT_SEC { $$ = getoptbyvalue(IPOPT_SECURITY); }
| IPFY_IPOPT_LSRR { $$ = getoptbyvalue(IPOPT_LSRR); }
| IPFY_IPOPT_ESEC { $$ = getoptbyvalue(IPOPT_E_SEC); }
| IPFY_IPOPT_CIPSO { $$ = getoptbyvalue(IPOPT_CIPSO); }
| IPFY_IPOPT_CIPSO doi { $$ = getoptbyvalue(IPOPT_CIPSO); }
| IPFY_IPOPT_SATID { $$ = getoptbyvalue(IPOPT_SATID); }
| IPFY_IPOPT_SSRR { $$ = getoptbyvalue(IPOPT_SSRR); }
| IPFY_IPOPT_ADDEXT { $$ = getoptbyvalue(IPOPT_ADDEXT); }
| IPFY_IPOPT_VISA { $$ = getoptbyvalue(IPOPT_VISA); }
| IPFY_IPOPT_IMITD { $$ = getoptbyvalue(IPOPT_IMITD); }
| IPFY_IPOPT_EIP { $$ = getoptbyvalue(IPOPT_EIP); }
| IPFY_IPOPT_FINN { $$ = getoptbyvalue(IPOPT_FINN); }
| IPFY_IPOPT_DPS { $$ = getoptbyvalue(IPOPT_DPS); }
| IPFY_IPOPT_SDB { $$ = getoptbyvalue(IPOPT_SDB); }
| IPFY_IPOPT_NSAPA { $$ = getoptbyvalue(IPOPT_NSAPA); }
| IPFY_IPOPT_RTRALRT { $$ = getoptbyvalue(IPOPT_RTRALRT); }
| IPFY_IPOPT_UMP { $$ = getoptbyvalue(IPOPT_UMP); }
| setsecclass secname
{ DOALL(fr->fr_mip.fi_secmsk |= $2;
if (fr->fr_family == AF_UNSPEC) {
fr->fr_family = AF_INET;
fr->fr_ip.fi_v = 4;
fr->fr_mip.fi_v = 0xf;
} else if (fr->fr_family != AF_INET) {
YYERROR;
}
if (!nowith)
fr->fr_ip.fi_secmsk |= $2;)
$$ = 0;
yyresetdict();
}
;
setsecclass:
IPFY_SECCLASS { yysetdict(ipv4secwords); }
;
doi: IPFY_DOI YY_NUMBER { DOALL(fr->fr_doimask = 0xffffffff; \
if (!nowith) \
fr->fr_doi = $2;) }
| IPFY_DOI YY_HEX { DOALL(fr->fr_doimask = 0xffffffff; \
if (!nowith) \
fr->fr_doi = $2;) }
;
ipv6hdr:
IPFY_AH { $$ = getv6optbyvalue(IPPROTO_AH); }
| IPFY_IPV6OPT_DSTOPTS { $$ = getv6optbyvalue(IPPROTO_DSTOPTS); }
| IPFY_IPV6OPT_ESP { $$ = getv6optbyvalue(IPPROTO_ESP); }
| IPFY_IPV6OPT_HOPOPTS { $$ = getv6optbyvalue(IPPROTO_HOPOPTS); }
| IPFY_IPV6OPT_IPV6 { $$ = getv6optbyvalue(IPPROTO_IPV6); }
| IPFY_IPV6OPT_NONE { $$ = getv6optbyvalue(IPPROTO_NONE); }
| IPFY_IPV6OPT_ROUTING { $$ = getv6optbyvalue(IPPROTO_ROUTING); }
| IPFY_IPV6OPT_FRAG { $$ = getv6optbyvalue(IPPROTO_FRAGMENT); }
| IPFY_IPV6OPT_MOBILITY { $$ = getv6optbyvalue(IPPROTO_MOBILITY); }
;
level: IPFY_LEVEL { setsyslog(); }
;
loglevel:
priority { fr->fr_loglevel = LOG_LOCAL0|$1; }
| facility '.' priority { fr->fr_loglevel = $1 | $3; }
;
facility:
IPFY_FAC_KERN { $$ = LOG_KERN; }
| IPFY_FAC_USER { $$ = LOG_USER; }
| IPFY_FAC_MAIL { $$ = LOG_MAIL; }
| IPFY_FAC_DAEMON { $$ = LOG_DAEMON; }
| IPFY_FAC_AUTH { $$ = LOG_AUTH; }
| IPFY_FAC_SYSLOG { $$ = LOG_SYSLOG; }
| IPFY_FAC_LPR { $$ = LOG_LPR; }
| IPFY_FAC_NEWS { $$ = LOG_NEWS; }
| IPFY_FAC_UUCP { $$ = LOG_UUCP; }
| IPFY_FAC_CRON { $$ = LOG_CRON; }
| IPFY_FAC_FTP { $$ = LOG_FTP; }
| IPFY_FAC_AUTHPRIV { $$ = LOG_AUTHPRIV; }
| IPFY_FAC_AUDIT { $$ = LOG_AUDIT; }
| IPFY_FAC_LFMT { $$ = LOG_LFMT; }
| IPFY_FAC_LOCAL0 { $$ = LOG_LOCAL0; }
| IPFY_FAC_LOCAL1 { $$ = LOG_LOCAL1; }
| IPFY_FAC_LOCAL2 { $$ = LOG_LOCAL2; }
| IPFY_FAC_LOCAL3 { $$ = LOG_LOCAL3; }
| IPFY_FAC_LOCAL4 { $$ = LOG_LOCAL4; }
| IPFY_FAC_LOCAL5 { $$ = LOG_LOCAL5; }
| IPFY_FAC_LOCAL6 { $$ = LOG_LOCAL6; }
| IPFY_FAC_LOCAL7 { $$ = LOG_LOCAL7; }
| IPFY_FAC_SECURITY { $$ = LOG_SECURITY; }
;
priority:
IPFY_PRI_EMERG { $$ = LOG_EMERG; }
| IPFY_PRI_ALERT { $$ = LOG_ALERT; }
| IPFY_PRI_CRIT { $$ = LOG_CRIT; }
| IPFY_PRI_ERR { $$ = LOG_ERR; }
| IPFY_PRI_WARN { $$ = LOG_WARNING; }
| IPFY_PRI_NOTICE { $$ = LOG_NOTICE; }
| IPFY_PRI_INFO { $$ = LOG_INFO; }
| IPFY_PRI_DEBUG { $$ = LOG_DEBUG; }
;
compare:
YY_CMP_EQ { $$ = FR_EQUAL; }
| YY_CMP_NE { $$ = FR_NEQUAL; }
| YY_CMP_LT { $$ = FR_LESST; }
| YY_CMP_LE { $$ = FR_LESSTE; }
| YY_CMP_GT { $$ = FR_GREATERT; }
| YY_CMP_GE { $$ = FR_GREATERTE; }
;
range: YY_RANGE_IN { $$ = FR_INRANGE; }
| YY_RANGE_OUT { $$ = FR_OUTRANGE; }
| ':' { $$ = FR_INCRANGE; }
;
servicename:
YY_STR { $$ = $1; }
;
interfacename: name { $$ = $1; }
| name ':' YY_NUMBER
{ $$ = $1;
fprintf(stderr, "%d: Logical interface %s:%d unsupported, "
"use the physical interface %s instead.\n",
yylineNum, $1, $3, $1);
}
;
name: YY_STR { $$ = $1; }
| '-' { $$ = strdup("-"); }
;
ipv4_16:
YY_NUMBER '.' YY_NUMBER
{ if ($1 > 255 || $3 > 255) {
yyerror("Invalid octet string for IP address");
return(0);
}
$$.s_addr = ($1 << 24) | ($3 << 16);
$$.s_addr = htonl($$.s_addr);
}
;
ipv4_24:
ipv4_16 '.' YY_NUMBER
{ if ($3 > 255) {
yyerror("Invalid octet string for IP address");
return(0);
}
$$.s_addr |= htonl($3 << 8);
}
;
ipv4: ipv4_24 '.' YY_NUMBER
{ if ($3 > 255) {
yyerror("Invalid octet string for IP address");
return(0);
}
$$.s_addr |= htonl($3);
}
| ipv4_24
| ipv4_16
;
%%
static struct wordtab ipfwords[] = {
{ "age", IPFY_AGE },
{ "ah", IPFY_AH },
{ "all", IPFY_ALL },
{ "and", IPFY_AND },
{ "auth", IPFY_AUTH },
{ "bad", IPFY_BAD },
{ "bad-nat", IPFY_BADNAT },
{ "bad-src", IPFY_BADSRC },
{ "bcast", IPFY_BROADCAST },
{ "block", IPFY_BLOCK },
{ "body", IPFY_BODY },
{ "bpf-v4", IPFY_BPFV4 },
#ifdef USE_INET6
{ "bpf-v6", IPFY_BPFV6 },
#endif
{ "call", IPFY_CALL },
{ "code", IPFY_ICMPCODE },
{ "comment", IPFY_COMMENT },
{ "count", IPFY_COUNT },
{ "decapsulate", IPFY_DECAPS },
{ "dstlist", IPFY_DSTLIST },
{ "doi", IPFY_DOI },
{ "dup-to", IPFY_DUPTO },
{ "eq", YY_CMP_EQ },
{ "esp", IPFY_ESP },
{ "exp", IPFY_IPFEXPR },
{ "family", IPFY_FAMILY },
{ "fastroute", IPFY_FROUTE },
{ "first", IPFY_FIRST },
{ "flags", IPFY_FLAGS },
{ "frag", IPFY_FRAG },
{ "frag-body", IPFY_FRAGBODY },
{ "frags", IPFY_FRAGS },
{ "from", IPFY_FROM },
{ "ge", YY_CMP_GE },
{ "group", IPFY_GROUP },
{ "gt", YY_CMP_GT },
{ "head", IPFY_HEAD },
{ "icmp", IPFY_ICMP },
{ "icmp-head", IPFY_ICMPHEAD },
{ "icmp-type", IPFY_ICMPTYPE },
{ "in", IPFY_IN },
{ "in-via", IPFY_INVIA },
{ "inet", IPFY_INET },
{ "inet6", IPFY_INET6 },
{ "ipopt", IPFY_IPOPTS },
{ "ipopts", IPFY_IPOPTS },
{ "keep", IPFY_KEEP },
{ "l5-as", IPFY_L5AS },
{ "le", YY_CMP_LE },
{ "level", IPFY_LEVEL },
{ "limit", IPFY_LIMIT },
{ "log", IPFY_LOG },
{ "loose", IPFY_LOOSE },
{ "lowttl", IPFY_LOWTTL },
{ "lt", YY_CMP_LT },
{ "mask", IPFY_MASK },
{ "match-tag", IPFY_MATCHTAG },
{ "max-per-src", IPFY_MAX_PER_SRC },
{ "max-srcs", IPFY_MAX_SRCS },
{ "mbcast", IPFY_MBCAST },
{ "mcast", IPFY_MULTICAST },
{ "multicast", IPFY_MULTICAST },
{ "nat", IPFY_NAT },
{ "ne", YY_CMP_NE },
{ "net", IPFY_NETWORK },
{ "newisn", IPFY_NEWISN },
{ "no", IPFY_NO },
{ "no-icmp-err", IPFY_NOICMPERR },
{ "nolog", IPFY_NOLOG },
{ "nomatch", IPFY_NOMATCH },
{ "now", IPFY_NOW },
{ "not", IPFY_NOT },
{ "oow", IPFY_OOW },
{ "on", IPFY_ON },
{ "opt", IPFY_OPT },
{ "or-block", IPFY_ORBLOCK },
{ "out", IPFY_OUT },
{ "out-via", IPFY_OUTVIA },
{ "pass", IPFY_PASS },
{ "port", IPFY_PORT },
{ "pps", IPFY_PPS },
{ "preauth", IPFY_PREAUTH },
{ "proto", IPFY_PROTO },
{ "quick", IPFY_QUICK },
{ "reply-to", IPFY_REPLY_TO },
{ "return-icmp", IPFY_RETICMP },
{ "return-icmp-as-dest", IPFY_RETICMPASDST },
{ "return-rst", IPFY_RETRST },
{ "route-to", IPFY_ROUTETO },
{ "rule-ttl", IPFY_RULETTL },
{ "rpc", IPFY_RPC },
{ "sec-class", IPFY_SECCLASS },
{ "set", IPFY_SET },
{ "set-tag", IPFY_SETTAG },
{ "skip", IPFY_SKIP },
{ "short", IPFY_SHORT },
{ "state", IPFY_STATE },
{ "state-age", IPFY_AGE },
{ "strict", IPFY_STRICT },
{ "sync", IPFY_SYNC },
{ "tcp", IPFY_TCP },
{ "tcp-udp", IPFY_TCPUDP },
{ "tos", IPFY_TOS },
{ "to", IPFY_TO },
{ "ttl", IPFY_TTL },
{ "udp", IPFY_UDP },
{ "v6hdr", IPFY_V6HDR },
{ "v6hdrs", IPFY_V6HDRS },
{ "with", IPFY_WITH },
{ NULL, 0 }
};
static struct wordtab addrwords[] = {
{ "any", IPFY_ANY },
{ "hash", IPFY_HASH },
{ "pool", IPFY_POOL },
{ NULL, 0 }
};
static struct wordtab maskwords[] = {
{ "broadcast", IPFY_BROADCAST },
{ "netmasked", IPFY_NETMASKED },
{ "network", IPFY_NETWORK },
{ "peer", IPFY_PEER },
{ NULL, 0 }
};
static struct wordtab icmpcodewords[] = {
{ "cutoff-preced", IPFY_ICMPC_CUTPRE },
{ "filter-prohib", IPFY_ICMPC_FLTPRO },
{ "isolate", IPFY_ICMPC_ISOLATE },
{ "needfrag", IPFY_ICMPC_NEEDF },
{ "net-prohib", IPFY_ICMPC_NETPRO },
{ "net-tos", IPFY_ICMPC_NETTOS },
{ "host-preced", IPFY_ICMPC_HSTPRE },
{ "host-prohib", IPFY_ICMPC_HSTPRO },
{ "host-tos", IPFY_ICMPC_HSTTOS },
{ "host-unk", IPFY_ICMPC_HSTUNK },
{ "host-unr", IPFY_ICMPC_HSTUNR },
{ "net-unk", IPFY_ICMPC_NETUNK },
{ "net-unr", IPFY_ICMPC_NETUNR },
{ "port-unr", IPFY_ICMPC_PORUNR },
{ "proto-unr", IPFY_ICMPC_PROUNR },
{ "srcfail", IPFY_ICMPC_SRCFAIL },
{ NULL, 0 },
};
static struct wordtab ipv4optwords[] = {
{ "addext", IPFY_IPOPT_ADDEXT },
{ "cipso", IPFY_IPOPT_CIPSO },
{ "dps", IPFY_IPOPT_DPS },
{ "e-sec", IPFY_IPOPT_ESEC },
{ "eip", IPFY_IPOPT_EIP },
{ "encode", IPFY_IPOPT_ENCODE },
{ "finn", IPFY_IPOPT_FINN },
{ "imitd", IPFY_IPOPT_IMITD },
{ "lsrr", IPFY_IPOPT_LSRR },
{ "mtup", IPFY_IPOPT_MTUP },
{ "mtur", IPFY_IPOPT_MTUR },
{ "nop", IPFY_IPOPT_NOP },
{ "nsapa", IPFY_IPOPT_NSAPA },
{ "rr", IPFY_IPOPT_RR },
{ "rtralrt", IPFY_IPOPT_RTRALRT },
{ "satid", IPFY_IPOPT_SATID },
{ "sdb", IPFY_IPOPT_SDB },
{ "sec", IPFY_IPOPT_SEC },
{ "ssrr", IPFY_IPOPT_SSRR },
{ "tr", IPFY_IPOPT_TR },
{ "ts", IPFY_IPOPT_TS },
{ "ump", IPFY_IPOPT_UMP },
{ "visa", IPFY_IPOPT_VISA },
{ "zsu", IPFY_IPOPT_ZSU },
{ NULL, 0 },
};
static struct wordtab ipv4secwords[] = {
{ "confid", IPFY_SEC_CONF },
{ "reserv-1", IPFY_SEC_RSV1 },
{ "reserv-2", IPFY_SEC_RSV2 },
{ "reserv-3", IPFY_SEC_RSV3 },
{ "reserv-4", IPFY_SEC_RSV4 },
{ "secret", IPFY_SEC_SEC },
{ "topsecret", IPFY_SEC_TS },
{ "unclass", IPFY_SEC_UNC },
{ NULL, 0 },
};
static struct wordtab ipv6optwords[] = {
{ "dstopts", IPFY_IPV6OPT_DSTOPTS },
{ "esp", IPFY_IPV6OPT_ESP },
{ "frag", IPFY_IPV6OPT_FRAG },
{ "hopopts", IPFY_IPV6OPT_HOPOPTS },
{ "ipv6", IPFY_IPV6OPT_IPV6 },
{ "mobility", IPFY_IPV6OPT_MOBILITY },
{ "none", IPFY_IPV6OPT_NONE },
{ "routing", IPFY_IPV6OPT_ROUTING },
{ NULL, 0 },
};
static struct wordtab logwords[] = {
{ "kern", IPFY_FAC_KERN },
{ "user", IPFY_FAC_USER },
{ "mail", IPFY_FAC_MAIL },
{ "daemon", IPFY_FAC_DAEMON },
{ "auth", IPFY_FAC_AUTH },
{ "syslog", IPFY_FAC_SYSLOG },
{ "lpr", IPFY_FAC_LPR },
{ "news", IPFY_FAC_NEWS },
{ "uucp", IPFY_FAC_UUCP },
{ "cron", IPFY_FAC_CRON },
{ "ftp", IPFY_FAC_FTP },
{ "authpriv", IPFY_FAC_AUTHPRIV },
{ "audit", IPFY_FAC_AUDIT },
{ "logalert", IPFY_FAC_LFMT },
{ "console", IPFY_FAC_CONSOLE },
{ "security", IPFY_FAC_SECURITY },
{ "local0", IPFY_FAC_LOCAL0 },
{ "local1", IPFY_FAC_LOCAL1 },
{ "local2", IPFY_FAC_LOCAL2 },
{ "local3", IPFY_FAC_LOCAL3 },
{ "local4", IPFY_FAC_LOCAL4 },
{ "local5", IPFY_FAC_LOCAL5 },
{ "local6", IPFY_FAC_LOCAL6 },
{ "local7", IPFY_FAC_LOCAL7 },
{ "emerg", IPFY_PRI_EMERG },
{ "alert", IPFY_PRI_ALERT },
{ "crit", IPFY_PRI_CRIT },
{ "err", IPFY_PRI_ERR },
{ "warn", IPFY_PRI_WARN },
{ "notice", IPFY_PRI_NOTICE },
{ "info", IPFY_PRI_INFO },
{ "debug", IPFY_PRI_DEBUG },
{ NULL, 0 },
};
int
ipf_parsefile(int fd, addfunc_t addfunc, ioctlfunc_t *iocfuncs, char *filename)
{
FILE *fp = NULL;
char *s;
yylineNum = 1;
yysettab(ipfwords);
s = getenv("YYDEBUG");
if (s != NULL)
yydebug = atoi(s);
else
yydebug = 0;
if (strcmp(filename, "-")) {
fp = fopen(filename, "r");
if (fp == NULL) {
fprintf(stderr, "fopen(%s) failed: %s\n", filename,
STRERROR(errno));
return(-1);
}
} else
fp = stdin;
while (ipf_parsesome(fd, addfunc, iocfuncs, fp) == 1)
;
if (fp != NULL)
fclose(fp);
return(0);
}
int
ipf_parsesome(int fd, addfunc_t addfunc, ioctlfunc_t *iocfuncs, FILE *fp)
{
char *s;
int i;
ipffd = fd;
for (i = 0; i <= IPL_LOGMAX; i++)
ipfioctls[i] = iocfuncs[i];
ipfaddfunc = addfunc;
if (feof(fp))
return(0);
i = fgetc(fp);
if (i == EOF)
return(0);
if (ungetc(i, fp) == 0)
return(0);
if (feof(fp))
return(0);
s = getenv("YYDEBUG");
if (s != NULL)
yydebug = atoi(s);
else
yydebug = 0;
yyin = fp;
yyparse();
return(1);
}
static void
newrule(void)
{
frentry_t *frn;
frn = allocfr();
for (fr = frtop; fr != NULL && fr->fr_next != NULL; fr = fr->fr_next)
;
if (fr != NULL) {
fr->fr_next = frn;
frn->fr_pnext = &fr->fr_next;
}
if (frtop == NULL) {
frtop = frn;
frn->fr_pnext = &frtop;
}
fr = frn;
frc = frn;
fr->fr_loglevel = 0xffff;
fr->fr_isc = (void *)-1;
fr->fr_logtag = FR_NOLOGTAG;
fr->fr_type = FR_T_NONE;
fr->fr_flineno = yylineNum;
if (use_inet6 == 1)
fr->fr_family = AF_INET6;
else if (use_inet6 == -1)
fr->fr_family = AF_INET;
nrules = 1;
}
static void
setipftype(void)
{
for (fr = frc; fr != NULL; fr = fr->fr_next) {
if (fr->fr_type == FR_T_NONE) {
fr->fr_type = FR_T_IPF;
fr->fr_data = (void *)calloc(sizeof(fripf_t), 1);
fr->fr_dsize = sizeof(fripf_t);
fr->fr_family = frc->fr_family;
if (fr->fr_family == AF_INET) {
fr->fr_ip.fi_v = 4;
}
else if (fr->fr_family == AF_INET6) {
fr->fr_ip.fi_v = 6;
}
fr->fr_mip.fi_v = 0xf;
fr->fr_ipf->fri_sifpidx = -1;
fr->fr_ipf->fri_difpidx = -1;
}
if (fr->fr_type != FR_T_IPF) {
fprintf(stderr, "IPF Type not set\n");
}
}
}
static frentry_t *
addrule(void)
{
frentry_t *f, *f1, *f2;
int count;
for (f2 = frc; f2->fr_next != NULL; f2 = f2->fr_next)
;
count = nrules;
f = f2;
for (f1 = frc; count > 0; count--, f1 = f1->fr_next) {
f->fr_next = allocfr();
if (f->fr_next == NULL)
return(NULL);
f->fr_next->fr_pnext = &f->fr_next;
added++;
f = f->fr_next;
*f = *f1;
f->fr_next = NULL;
if (f->fr_caddr != NULL) {
f->fr_caddr = malloc(f->fr_dsize);
bcopy(f1->fr_caddr, f->fr_caddr, f->fr_dsize);
}
}
return(f2->fr_next);
}
static int
lookuphost(char *name, i6addr_t *addrp)
{
int i;
hashed = 0;
pooled = 0;
dynamic = -1;
for (i = 0; i < 4; i++) {
if (fr->fr_ifnames[i] == -1)
continue;
if (strcmp(name, fr->fr_names + fr->fr_ifnames[i]) == 0) {
ifpflag = FRI_DYNAMIC;
dynamic = addname(&fr, name);
return(1);
}
}
if (gethost(AF_INET, name, addrp) == -1) {
fprintf(stderr, "unknown name \"%s\"\n", name);
return(-1);
}
return(0);
}
static void
dobpf(int v, char *phrase)
{
#ifdef IPFILTER_BPF
struct bpf_program bpf;
struct pcap *p;
#endif
fakebpf_t *fb;
u_32_t l;
char *s;
int i;
for (fr = frc; fr != NULL; fr = fr->fr_next) {
if (fr->fr_type != FR_T_NONE) {
fprintf(stderr, "cannot mix IPF and BPF matching\n");
return;
}
fr->fr_family = vtof(v);
fr->fr_type = FR_T_BPFOPC;
if (!strncmp(phrase, "0x", 2)) {
fb = malloc(sizeof(fakebpf_t));
for (i = 0, s = strtok(phrase, " \r\n\t"); s != NULL;
s = strtok(NULL, " \r\n\t"), i++) {
fb = reallocarray(fb, i / 4 + 1, sizeof(*fb));
if (fb == NULL) {
warnx("memory allocation error at %d in %s in %s", __LINE__, __FUNCTION__, __FILE__);
abort();
}
l = (u_32_t)strtol(s, NULL, 0);
switch (i & 3)
{
case 0 :
fb[i / 4].fb_c = l & 0xffff;
break;
case 1 :
fb[i / 4].fb_t = l & 0xff;
break;
case 2 :
fb[i / 4].fb_f = l & 0xff;
break;
case 3 :
fb[i / 4].fb_k = l;
break;
}
}
if ((i & 3) != 0) {
fprintf(stderr,
"Odd number of bytes in BPF code\n");
exit(1);
}
i--;
fr->fr_dsize = (i / 4 + 1) * sizeof(*fb);
fr->fr_data = fb;
return;
}
#ifdef IPFILTER_BPF
bzero((char *)&bpf, sizeof(bpf));
p = pcap_open_dead(DLT_RAW, 1);
if (!p) {
fprintf(stderr, "pcap_open_dead failed\n");
return;
}
if (pcap_compile(p, &bpf, phrase, 1, 0xffffffff)) {
pcap_perror(p, "ipf");
pcap_close(p);
fprintf(stderr, "pcap parsing failed (%s)\n", phrase);
return;
}
pcap_close(p);
fr->fr_dsize = bpf.bf_len * sizeof(struct bpf_insn);
fr->fr_data = malloc(fr->fr_dsize);
bcopy((char *)bpf.bf_insns, fr->fr_data, fr->fr_dsize);
if (!bpf_validate(fr->fr_data, bpf.bf_len)) {
fprintf(stderr, "BPF validation failed\n");
return;
}
#endif
}
#ifdef IPFILTER_BPF
if (opts & OPT_DEBUG)
bpf_dump(&bpf, 0);
#else
fprintf(stderr, "BPF filter expressions not supported\n");
exit(1);
#endif
}
static void
resetaddr(void)
{
hashed = 0;
pooled = 0;
dynamic = -1;
}
static alist_t *
newalist(alist_t *ptr)
{
alist_t *al;
al = malloc(sizeof(*al));
if (al == NULL)
return(NULL);
al->al_not = 0;
al->al_next = ptr;
return(al);
}
static int
makepool(alist_t *list)
{
ip_pool_node_t *n, *top;
ip_pool_t pool;
alist_t *a;
int num;
if (list == NULL)
return(0);
top = calloc(1, sizeof(*top));
if (top == NULL)
return(0);
for (n = top, a = list; (n != NULL) && (a != NULL); a = a->al_next) {
if (use_inet6 == 1) {
#ifdef USE_INET6
n->ipn_addr.adf_family = AF_INET6;
n->ipn_addr.adf_addr = a->al_i6addr;
n->ipn_addr.adf_len = offsetof(addrfamily_t,
adf_addr) + 16;
n->ipn_mask.adf_family = AF_INET6;
n->ipn_mask.adf_addr = a->al_i6mask;
n->ipn_mask.adf_len = offsetof(addrfamily_t,
adf_addr) + 16;
#endif
} else {
n->ipn_addr.adf_family = AF_INET;
n->ipn_addr.adf_addr.in4.s_addr = a->al_1;
n->ipn_addr.adf_len = offsetof(addrfamily_t,
adf_addr) + 4;
n->ipn_mask.adf_family = AF_INET;
n->ipn_mask.adf_addr.in4.s_addr = a->al_2;
n->ipn_mask.adf_len = offsetof(addrfamily_t,
adf_addr) + 4;
}
n->ipn_info = a->al_not;
if (a->al_next != NULL) {
n->ipn_next = calloc(1, sizeof(*n));
n = n->ipn_next;
}
}
bzero((char *)&pool, sizeof(pool));
pool.ipo_unit = IPL_LOGIPF;
pool.ipo_list = top;
num = load_pool(&pool, ipfioctls[IPL_LOGLOOKUP]);
while ((n = top) != NULL) {
top = n->ipn_next;
free(n);
}
return(num);
}
static u_int
makehash(alist_t *list)
{
iphtent_t *n, *top;
iphtable_t iph;
alist_t *a;
int num;
if (list == NULL)
return(0);
top = calloc(1, sizeof(*top));
if (top == NULL)
return(0);
for (n = top, a = list; (n != NULL) && (a != NULL); a = a->al_next) {
if (a->al_family == AF_INET6) {
n->ipe_family = AF_INET6;
n->ipe_addr = a->al_i6addr;
n->ipe_mask = a->al_i6mask;
} else {
n->ipe_family = AF_INET;
n->ipe_addr.in4_addr = a->al_1;
n->ipe_mask.in4_addr = a->al_2;
}
n->ipe_value = 0;
if (a->al_next != NULL) {
n->ipe_next = calloc(1, sizeof(*n));
n = n->ipe_next;
}
}
bzero((char *)&iph, sizeof(iph));
iph.iph_unit = IPL_LOGIPF;
iph.iph_type = IPHASH_LOOKUP;
*iph.iph_name = '\0';
if (load_hash(&iph, top, ipfioctls[IPL_LOGLOOKUP]) == 0)
sscanf(iph.iph_name, "%u", &num);
else
num = 0;
while ((n = top) != NULL) {
top = n->ipe_next;
free(n);
}
return(num);
}
int
ipf_addrule(int fd, ioctlfunc_t ioctlfunc, void *ptr)
{
ioctlcmd_t add, del;
frentry_t *fr;
ipfobj_t obj;
if (ptr == NULL)
return(0);
fr = ptr;
add = 0;
del = 0;
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = fr->fr_size;
obj.ipfo_type = IPFOBJ_FRENTRY;
obj.ipfo_ptr = ptr;
if ((opts & OPT_DONOTHING) != 0)
fd = -1;
if (opts & OPT_ZERORULEST) {
add = SIOCZRLST;
} else if (opts & OPT_INACTIVE) {
add = (u_int)fr->fr_hits ? SIOCINIFR :
SIOCADIFR;
del = SIOCRMIFR;
} else {
add = (u_int)fr->fr_hits ? SIOCINAFR :
SIOCADAFR;
del = SIOCRMAFR;
}
if ((opts & OPT_OUTQUE) != 0)
fr->fr_flags |= FR_OUTQUE;
if (fr->fr_hits)
fr->fr_hits--;
if ((opts & OPT_VERBOSE) != 0)
printfr(fr, ioctlfunc);
if ((opts & OPT_DEBUG) != 0) {
binprint(fr, sizeof(*fr));
if (fr->fr_data != NULL)
binprint(fr->fr_data, fr->fr_dsize);
}
if ((opts & OPT_ZERORULEST) != 0) {
if ((*ioctlfunc)(fd, add, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(zero rule)",
fr->fr_flineno);
return(ipf_perror_fd(fd, ioctlfunc, msg));
}
} else {
#ifdef USE_QUAD_T
printf("hits %qd bytes %qd ",
(long long)fr->fr_hits,
(long long)fr->fr_bytes);
#else
printf("hits %ld bytes %ld ",
fr->fr_hits, fr->fr_bytes);
#endif
printfr(fr, ioctlfunc);
}
} else if ((opts & OPT_REMOVE) != 0) {
if ((*ioctlfunc)(fd, del, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(delete rule)",
fr->fr_flineno);
return(ipf_perror_fd(fd, ioctlfunc, msg));
}
}
} else {
if ((*ioctlfunc)(fd, add, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(add/insert rule)",
fr->fr_flineno);
return(ipf_perror_fd(fd, ioctlfunc, msg));
}
}
}
return(0);
}
static void
setsyslog(void)
{
yysetdict(logwords);
yybreakondot = 1;
}
static void
unsetsyslog(void)
{
yyresetdict();
yybreakondot = 0;
}
static void
fillgroup(frentry_t *fr)
{
frentry_t *f;
for (f = frold; f != NULL; f = f->fr_next) {
if (f->fr_grhead == -1 && fr->fr_group == -1)
break;
if (f->fr_grhead == -1 || fr->fr_group == -1)
continue;
if (strcmp(f->fr_names + f->fr_grhead,
fr->fr_names + fr->fr_group) == 0)
break;
}
if (f == NULL)
return;
/*
* Only copy down matching fields if the rules are of the same type
* and are of ipf type. The only fields that are copied are those
* that impact the rule parsing itself, eg. need for knowing what the
* protocol should be for rules with port comparisons in them.
*/
if (f->fr_type != fr->fr_type || f->fr_type != FR_T_IPF)
return;
if (fr->fr_family == 0 && f->fr_family != 0)
fr->fr_family = f->fr_family;
if (fr->fr_mproto == 0 && f->fr_mproto != 0)
fr->fr_mproto = f->fr_mproto;
if (fr->fr_proto == 0 && f->fr_proto != 0)
fr->fr_proto = f->fr_proto;
if ((fr->fr_mproto == 0) && ((fr->fr_flx & FI_TCPUDP) == 0) &&
((f->fr_flx & FI_TCPUDP) != 0)) {
fr->fr_flx |= FI_TCPUDP;
fr->fr_mflx |= FI_TCPUDP;
}
}
static void
doipfexpr(char *line)
{
int *array;
char *error;
array = parseipfexpr(line, &error);
if (array == NULL) {
fprintf(stderr, "%s:", error);
yyerror("error parsing ipf matching expression");
return;
}
fr->fr_type = FR_T_IPFEXPR;
fr->fr_data = array;
fr->fr_dsize = array[0] * sizeof(*array);
}
static void
do_tuneint(char *varname, int value)
{
char buffer[80];
strncpy(buffer, varname, 60);
buffer[59] = '\0';
strcat(buffer, "=");
snprintf(buffer, sizeof(buffer), "%u", value);
ipf_dotuning(ipffd, buffer, ioctl);
}
static void
do_tunestr(char *varname, char *value)
{
if (!strcasecmp(value, "true")) {
do_tuneint(varname, 1);
} else if (!strcasecmp(value, "false")) {
do_tuneint(varname, 0);
} else {
yyerror("did not find true/false where expected");
}
}
static void
setifname(frentry_t **frp, int idx, char *name)
{
int pos;
pos = addname(frp, name);
if (pos == -1)
return;
(*frp)->fr_ifnames[idx] = pos;
}
static int
addname(frentry_t **frp, char *name)
{
frentry_t *f;
int nlen;
int pos;
nlen = strlen(name) + 1;
f = realloc(*frp, (*frp)->fr_size + nlen);
if (*frp == frc)
frc = f;
*frp = f;
if (f == NULL)
return(-1);
if (f->fr_pnext != NULL)
*f->fr_pnext = f;
f->fr_size += nlen;
pos = f->fr_namelen;
f->fr_namelen += nlen;
strcpy(f->fr_names + pos, name);
f->fr_names[f->fr_namelen] = '\0';
return(pos);
}
static frentry_t *
allocfr(void)
{
frentry_t *fr;
fr = calloc(1, sizeof(*fr));
if (fr != NULL) {
fr->fr_size = sizeof(*fr);
fr->fr_comment = -1;
fr->fr_group = -1;
fr->fr_grhead = -1;
fr->fr_icmphead = -1;
fr->fr_ifnames[0] = -1;
fr->fr_ifnames[1] = -1;
fr->fr_ifnames[2] = -1;
fr->fr_ifnames[3] = -1;
fr->fr_tif.fd_name = -1;
fr->fr_rif.fd_name = -1;
fr->fr_dif.fd_name = -1;
}
return(fr);
}
static void
setgroup(frentry_t **frp, char *name)
{
int pos;
pos = addname(frp, name);
if (pos == -1)
return;
(*frp)->fr_group = pos;
}
static void
setgrhead(frentry_t **frp, char *name)
{
int pos;
pos = addname(frp, name);
if (pos == -1)
return;
(*frp)->fr_grhead = pos;
}
static void
seticmphead(frentry_t **frp, char *name)
{
int pos;
pos = addname(frp, name);
if (pos == -1)
return;
(*frp)->fr_icmphead = pos;
}
static void
build_dstaddr_af(frentry_t *fp, void *ptr)
{
struct ipp_s *ipp = ptr;
frentry_t *f = fp;
if (f->fr_family != AF_UNSPEC && ipp->f == AF_UNSPEC) {
ipp->f = f->fr_family;
ipp->v = f->fr_ip.fi_v;
}
if (ipp->f == AF_INET)
ipp->v = 4;
else if (ipp->f == AF_INET6)
ipp->v = 6;
for (; f != NULL; f = f->fr_next) {
f->fr_ip.fi_dst = ipp->a;
f->fr_mip.fi_dst = ipp->m;
f->fr_family = ipp->f;
f->fr_ip.fi_v = ipp->v;
f->fr_mip.fi_v = 0xf;
f->fr_datype = ipp->type;
if (ipp->ifpos != -1)
f->fr_ipf->fri_difpidx = ipp->ifpos;
}
fr = NULL;
}
static void
build_srcaddr_af(frentry_t *fp, void *ptr)
{
struct ipp_s *ipp = ptr;
frentry_t *f = fp;
if (f->fr_family != AF_UNSPEC && ipp->f == AF_UNSPEC) {
ipp->f = f->fr_family;
ipp->v = f->fr_ip.fi_v;
}
if (ipp->f == AF_INET)
ipp->v = 4;
else if (ipp->f == AF_INET6)
ipp->v = 6;
for (; f != NULL; f = f->fr_next) {
f->fr_ip.fi_src = ipp->a;
f->fr_mip.fi_src = ipp->m;
f->fr_family = ipp->f;
f->fr_ip.fi_v = ipp->v;
f->fr_mip.fi_v = 0xf;
f->fr_satype = ipp->type;
f->fr_ipf->fri_sifpidx = ipp->ifpos;
}
fr = NULL;
}
diff --git a/sbin/ipf/common/ipmon.h b/sbin/ipf/common/ipmon.h
index 4807299c49d2..8caf20fdf725 100644
--- a/sbin/ipf/common/ipmon.h
+++ b/sbin/ipf/common/ipmon.h
@@ -1,142 +1,141 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* @(#)ip_fil.h 1.35 6/5/96
* $Id$
*/
typedef struct ipmon_msg_s {
int imm_msglen;
char *imm_msg;
int imm_dsize;
void *imm_data;
time_t imm_when;
int imm_loglevel;
} ipmon_msg_t;
typedef void (*ims_destroy_func_t)(void *);
typedef void *(*ims_dup_func_t)(void *);
typedef int (*ims_match_func_t)(void *, void *);
typedef void *(*ims_parse_func_t)(char **);
typedef void (*ims_print_func_t)(void *);
typedef int (*ims_store_func_t)(void *, ipmon_msg_t *);
typedef struct ipmon_saver_s {
char *ims_name;
ims_destroy_func_t ims_destroy;
ims_dup_func_t ims_dup;
ims_match_func_t ims_match;
ims_parse_func_t ims_parse;
ims_print_func_t ims_print;
ims_store_func_t ims_store;
} ipmon_saver_t;
typedef struct ipmon_saver_int_s {
struct ipmon_saver_int_s *imsi_next;
ipmon_saver_t *imsi_stor;
void *imsi_handle;
} ipmon_saver_int_t;
typedef struct ipmon_doing_s {
struct ipmon_doing_s *ipmd_next;
void *ipmd_token;
ipmon_saver_t *ipmd_saver;
/*
* ipmd_store is "cached" in this structure to avoid a double
* deref when doing saves....
*/
int (*ipmd_store)(void *, ipmon_msg_t *);
} ipmon_doing_t;
typedef struct ipmon_action {
struct ipmon_action *ac_next;
int ac_mflag; /* collection of things to compare */
int ac_dflag; /* flags to compliment the doing fields */
int ac_logpri;
int ac_direction;
char ac_group[FR_GROUPLEN];
char ac_nattag[16];
u_32_t ac_logtag;
int ac_type; /* nat/state/ipf */
int ac_proto;
int ac_rule;
int ac_packet;
int ac_second;
int ac_result;
u_32_t ac_sip;
u_32_t ac_smsk;
u_32_t ac_dip;
u_32_t ac_dmsk;
u_short ac_sport;
u_short ac_dport;
char *ac_iface;
/*
* used with ac_packet/ac_second
*/
struct timeval ac_last;
int ac_pktcnt;
/*
* What to do with matches
*/
ipmon_doing_t *ac_doing;
} ipmon_action_t;
#define ac_lastsec ac_last.tv_sec
#define ac_lastusec ac_last.tv_usec
/*
* Flags indicating what fields to do matching upon (ac_mflag).
*/
#define IPMAC_DIRECTION 0x0001
#define IPMAC_DSTIP 0x0002
#define IPMAC_DSTPORT 0x0004
#define IPMAC_EVERY 0x0008
#define IPMAC_GROUP 0x0010
#define IPMAC_INTERFACE 0x0020
#define IPMAC_LOGTAG 0x0040
#define IPMAC_NATTAG 0x0080
#define IPMAC_PROTOCOL 0x0100
#define IPMAC_RESULT 0x0200
#define IPMAC_RULE 0x0400
#define IPMAC_SRCIP 0x0800
#define IPMAC_SRCPORT 0x1000
#define IPMAC_TYPE 0x2000
#define IPMAC_WITH 0x4000
#define IPMR_BLOCK 1
#define IPMR_PASS 2
#define IPMR_NOMATCH 3
#define IPMR_LOG 4
#define IPMON_SYSLOG 0x001
#define IPMON_RESOLVE 0x002
#define IPMON_HEXBODY 0x004
#define IPMON_HEXHDR 0x010
#define IPMON_TAIL 0x020
#define IPMON_VERBOSE 0x040
#define IPMON_NAT 0x080
#define IPMON_STATE 0x100
#define IPMON_FILTER 0x200
#define IPMON_PORTNUM 0x400
#define IPMON_LOGALL (IPMON_NAT|IPMON_STATE|IPMON_FILTER)
#define IPMON_LOGBODY 0x800
#define HOSTNAME_V4(a,b) hostname((a), 4, (u_32_t *)&(b))
#ifndef LOGFAC
#define LOGFAC LOG_LOCAL0
#endif
extern void dump_config(void);
extern int load_config(char *);
extern void unload_config(void);
extern void dumphex(FILE *, int, char *, int);
extern int check_action(char *, char *, int, int);
extern char *getword(int);
extern void *add_doing(ipmon_saver_t *);
diff --git a/sbin/ipf/common/ipt.h b/sbin/ipf/common/ipt.h
index 9a4d75a85ccb..3ecdabdb61c5 100644
--- a/sbin/ipf/common/ipt.h
+++ b/sbin/ipf/common/ipt.h
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#ifndef __IPT_H__
#define __IPT_H__
#ifndef __P
# define P_DEF
# ifdef __STDC__
# define __P(x) x
# else
# define __P(x) ()
# endif
#endif
#include <fcntl.h>
struct ipread {
int (*r_open)(char *);
int (*r_close)(void);
int (*r_readip)(mb_t *, char **, int *);
int r_flags;
};
#define R_DO_CKSUM 0x01
#ifdef P_DEF
# undef __P
# undef P_DEF
#endif
#endif /* __IPT_H__ */
diff --git a/sbin/ipf/common/kmem.h b/sbin/ipf/common/kmem.h
index c4b65ed63ce9..2adff4363b0b 100644
--- a/sbin/ipf/common/kmem.h
+++ b/sbin/ipf/common/kmem.h
@@ -1,30 +1,29 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
* $Id$
*/
#ifndef __KMEM_H__
#define __KMEM_H__
#ifndef __P
# define __P(x) x
#endif
extern int openkmem(char *, char *);
extern int kmemcpy(char *, long, int);
extern int kstrncpy(char *, long, int);
#if defined(__NetBSD__) || defined(__OpenBSD)
# include <paths.h>
#endif
#ifdef _PATH_KMEM
# define KMEM _PATH_KMEM
#else
# define KMEM "/dev/kmem"
#endif
#endif /* __KMEM_H__ */
diff --git a/sbin/ipf/common/lexer.c b/sbin/ipf/common/lexer.c
index 16fbb2272034..0ea2e25ec396 100644
--- a/sbin/ipf/common/lexer.c
+++ b/sbin/ipf/common/lexer.c
@@ -1,737 +1,736 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include <ctype.h>
#include "ipf.h"
#ifdef IPFILTER_SCAN
# include "netinet/ip_scan.h"
#endif
#include <sys/ioctl.h>
#include <syslog.h>
#ifdef TEST_LEXER
# define NO_YACC
union {
int num;
char *str;
struct in_addr ipa;
i6addr_t ip6;
} yylval;
#endif
#include "lexer.h"
#include "y.tab.h"
FILE *yyin;
#define ishex(c) (ISDIGIT(c) || ((c) >= 'a' && (c) <= 'f') || \
((c) >= 'A' && (c) <= 'F'))
#define TOOLONG -3
extern int string_start;
extern int string_end;
extern char *string_val;
extern int pos;
extern int yydebug;
char *yystr = NULL;
int yytext[YYBUFSIZ+1];
char yychars[YYBUFSIZ+1];
int yylineNum = 1;
int yypos = 0;
int yylast = -1;
int yydictfixed = 0;
int yyexpectaddr = 0;
int yybreakondot = 0;
int yyvarnext = 0;
int yytokentype = 0;
wordtab_t *yywordtab = NULL;
int yysavedepth = 0;
wordtab_t *yysavewords[30];
static wordtab_t *yyfindkey(char *);
static int yygetc(int);
static void yyunputc(int);
static int yyswallow(int);
static char *yytexttostr(int, int);
static void yystrtotext(char *);
static char *yytexttochar(void);
static int
yygetc(int docont)
{
int c;
if (yypos < yylast) {
c = yytext[yypos++];
if (c == '\n')
yylineNum++;
return (c);
}
if (yypos == YYBUFSIZ)
return (TOOLONG);
if (pos >= string_start && pos <= string_end) {
c = string_val[pos - string_start];
yypos++;
} else {
c = fgetc(yyin);
if (docont && (c == '\\')) {
c = fgetc(yyin);
if (c == '\n') {
yylineNum++;
c = fgetc(yyin);
}
}
}
if (c == '\n')
yylineNum++;
yytext[yypos++] = c;
yylast = yypos;
yytext[yypos] = '\0';
return (c);
}
static void
yyunputc(int c)
{
if (c == '\n')
yylineNum--;
yytext[--yypos] = c;
}
static int
yyswallow(int last)
{
int c;
while (((c = yygetc(0)) > '\0') && (c != last))
;
if (c != EOF)
yyunputc(c);
if (c == last)
return (0);
return (-1);
}
static char *
yytexttochar(void)
{
int i;
for (i = 0; i < yypos; i++)
yychars[i] = (char)(yytext[i] & 0xff);
yychars[i] = '\0';
return (yychars);
}
static void
yystrtotext(char *str)
{
int len;
char *s;
len = strlen(str);
if (len > YYBUFSIZ)
len = YYBUFSIZ;
for (s = str; *s != '\0' && len > 0; s++, len--)
yytext[yylast++] = *s;
yytext[yylast] = '\0';
}
static char *
yytexttostr(int offset, int max)
{
char *str;
int i;
if ((yytext[offset] == '\'' || yytext[offset] == '"') &&
(yytext[offset] == yytext[offset + max - 1])) {
offset++;
max--;
}
if (max > yylast)
max = yylast;
str = malloc(max + 1);
if (str != NULL) {
for (i = offset; i < max; i++)
str[i - offset] = (char)(yytext[i] & 0xff);
str[i - offset] = '\0';
}
return (str);
}
int
yylex(void)
{
static int prior = 0;
static int priornum = 0;
int c, n, isbuilding, rval, lnext, nokey = 0;
char *name;
int triedv6 = 0;
isbuilding = 0;
lnext = 0;
rval = 0;
if (yystr != NULL) {
free(yystr);
yystr = NULL;
}
nextchar:
c = yygetc(0);
if (yydebug > 1)
printf("yygetc = (%x) %c [%*.*s]\n",
c, c, yypos, yypos, yytexttochar());
switch (c)
{
case '\n' :
lnext = 0;
nokey = 0;
case '\t' :
case '\r' :
case ' ' :
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
if (yylast > yypos) {
bcopy(yytext + yypos, yytext,
sizeof(yytext[0]) * (yylast - yypos + 1));
}
yylast -= yypos;
if (yyexpectaddr == 2)
yyexpectaddr = 0;
yypos = 0;
lnext = 0;
nokey = 0;
goto nextchar;
case '\\' :
if (lnext == 0) {
lnext = 1;
if (yylast == yypos) {
yylast--;
yypos--;
} else
yypos--;
if (yypos == 0)
nokey = 1;
goto nextchar;
}
break;
}
if (lnext == 1) {
lnext = 0;
if ((isbuilding == 0) && !ISALNUM(c)) {
prior = c;
return (c);
}
goto nextchar;
}
switch (c)
{
case '#' :
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
yyswallow('\n');
rval = YY_COMMENT;
goto done;
case '$' :
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
n = yygetc(0);
if (n == '{') {
if (yyswallow('}') == -1) {
rval = -2;
goto done;
}
(void) yygetc(0);
} else {
if (!ISALPHA(n)) {
yyunputc(n);
break;
}
do {
n = yygetc(1);
} while (ISALPHA(n) || ISDIGIT(n) || n == '_');
yyunputc(n);
}
name = yytexttostr(1, yypos); /* skip $ */
if (name != NULL) {
string_val = get_variable(name, NULL, yylineNum);
free(name);
if (string_val != NULL) {
name = yytexttostr(yypos, yylast);
if (name != NULL) {
yypos = 0;
yylast = 0;
yystrtotext(string_val);
yystrtotext(name);
free(string_val);
free(name);
goto nextchar;
}
free(string_val);
}
}
break;
case '\'':
case '"' :
if (isbuilding == 1) {
goto done;
}
do {
n = yygetc(1);
if (n == EOF || n == TOOLONG) {
rval = -2;
goto done;
}
if (n == '\n') {
yyunputc(' ');
yypos++;
}
} while (n != c);
rval = YY_STR;
goto done;
/* NOTREACHED */
case EOF :
yylineNum = 1;
yypos = 0;
yylast = -1;
yyexpectaddr = 0;
yybreakondot = 0;
yyvarnext = 0;
yytokentype = 0;
if (yydebug)
fprintf(stderr, "reset at EOF\n");
prior = 0;
return (0);
}
if (strchr("=,/;{}()@", c) != NULL) {
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
rval = c;
goto done;
} else if (c == '.') {
if (isbuilding == 0) {
rval = c;
goto done;
}
if (yybreakondot != 0) {
yyunputc(c);
goto done;
}
}
switch (c)
{
case '-' :
n = yygetc(0);
if (n == '>') {
isbuilding = 1;
goto done;
}
yyunputc(n);
if (yyexpectaddr) {
if (isbuilding == 1)
yyunputc(c);
else
rval = '-';
goto done;
}
if (isbuilding == 1)
break;
rval = '-';
goto done;
case '!' :
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
n = yygetc(0);
if (n == '=') {
rval = YY_CMP_NE;
goto done;
}
yyunputc(n);
rval = '!';
goto done;
case '<' :
if (yyexpectaddr)
break;
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
n = yygetc(0);
if (n == '=') {
rval = YY_CMP_LE;
goto done;
}
if (n == '>') {
rval = YY_RANGE_OUT;
goto done;
}
yyunputc(n);
rval = YY_CMP_LT;
goto done;
case '>' :
if (yyexpectaddr)
break;
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
n = yygetc(0);
if (n == '=') {
rval = YY_CMP_GE;
goto done;
}
if (n == '<') {
rval = YY_RANGE_IN;
goto done;
}
yyunputc(n);
rval = YY_CMP_GT;
goto done;
}
/*
* Now for the reason this is here...IPv6 address parsing.
* The longest string we can expect is of this form:
* 0000:0000:0000:0000:0000:0000:000.000.000.000
* not:
* 0000:0000:0000:0000:0000:0000:0000:0000
*/
#ifdef USE_INET6
if (yyexpectaddr != 0 && isbuilding == 0 &&
(ishex(c) || isdigit(c) || c == ':')) {
char ipv6buf[45 + 1], *s, oc;
int start;
buildipv6:
start = yypos;
s = ipv6buf;
oc = c;
if (prior == YY_NUMBER && c == ':') {
snprintf(s, sizeof(s), "%d", priornum);
s += strlen(s);
}
/*
* Perhaps we should implement stricter controls on what we
* swallow up here, but surely it would just be duplicating
* the code in inet_pton() anyway.
*/
do {
*s++ = c;
c = yygetc(1);
} while ((ishex(c) || c == ':' || c == '.') &&
(s - ipv6buf < 46));
yyunputc(c);
*s = '\0';
if (inet_pton(AF_INET6, ipv6buf, &yylval.ip6) == 1) {
rval = YY_IPV6;
yyexpectaddr = 0;
goto done;
}
yypos = start;
c = oc;
}
#endif
if ((c == ':') && (rval != YY_IPV6) && (triedv6 == 0)) {
#ifdef USE_INET6
yystr = yytexttostr(0, yypos - 1);
if (yystr != NULL) {
char *s;
for (s = yystr; *s && ishex(*s); s++)
;
if (!*s && *yystr) {
isbuilding = 0;
c = *yystr;
free(yystr);
triedv6 = 1;
yypos = 1;
goto buildipv6;
}
free(yystr);
}
#endif
if (isbuilding == 1) {
yyunputc(c);
goto done;
}
rval = ':';
goto done;
}
if (isbuilding == 0 && c == '0') {
n = yygetc(0);
if (n == 'x') {
do {
n = yygetc(1);
} while (ishex(n));
yyunputc(n);
rval = YY_HEX;
goto done;
}
yyunputc(n);
}
/*
* No negative numbers with leading - sign..
*/
if (isbuilding == 0 && ISDIGIT(c)) {
do {
n = yygetc(1);
} while (ISDIGIT(n));
yyunputc(n);
rval = YY_NUMBER;
goto done;
}
isbuilding = 1;
goto nextchar;
done:
yystr = yytexttostr(0, yypos);
if (yydebug)
printf("isbuilding %d yyvarnext %d nokey %d fixed %d addr %d\n",
isbuilding, yyvarnext, nokey, yydictfixed, yyexpectaddr);
if (isbuilding == 1) {
wordtab_t *w;
w = NULL;
isbuilding = 0;
if ((yyvarnext == 0) && (nokey == 0)) {
w = yyfindkey(yystr);
if (w == NULL && yywordtab != NULL && !yydictfixed) {
yyresetdict();
w = yyfindkey(yystr);
}
} else
yyvarnext = 0;
if (w != NULL)
rval = w->w_value;
else
rval = YY_STR;
}
if (rval == YY_STR) {
if (yysavedepth > 0 && !yydictfixed)
yyresetdict();
if (yyexpectaddr != 0)
yyexpectaddr = 0;
}
yytokentype = rval;
if (yydebug)
printf("lexed(%s) %d,%d,%d [%d,%d,%d] => %d @%d\n",
yystr, isbuilding, yyexpectaddr, yysavedepth,
string_start, string_end, pos, rval, yysavedepth);
switch (rval)
{
case YY_NUMBER :
sscanf(yystr, "%u", &yylval.num);
break;
case YY_HEX :
sscanf(yystr, "0x%x", (u_int *)&yylval.num);
break;
case YY_STR :
yylval.str = strdup(yystr);
break;
default :
break;
}
if (yylast > 0) {
bcopy(yytext + yypos, yytext,
sizeof(yytext[0]) * (yylast - yypos + 1));
yylast -= yypos;
yypos = 0;
}
if (rval == YY_NUMBER)
priornum = yylval.num;
prior = rval;
return (rval);
}
static wordtab_t *yyfindkey(key)
char *key;
{
wordtab_t *w;
if (yywordtab == NULL)
return (NULL);
for (w = yywordtab; w->w_word != 0; w++)
if (strcasecmp(key, w->w_word) == 0)
return (w);
return (NULL);
}
char *
yykeytostr(int num)
{
wordtab_t *w;
if (yywordtab == NULL)
return ("<unknown>");
for (w = yywordtab; w->w_word; w++)
if (w->w_value == num)
return (w->w_word);
return ("<unknown>");
}
wordtab_t *
yysettab(wordtab_t *words)
{
wordtab_t *save;
save = yywordtab;
yywordtab = words;
return (save);
}
void
yyerror(char *msg)
{
char *txt, letter[2];
int freetxt = 0;
if (yytokentype < 256) {
letter[0] = yytokentype;
letter[1] = '\0';
txt = letter;
} else if (yytokentype == YY_STR || yytokentype == YY_HEX ||
yytokentype == YY_NUMBER) {
if (yystr == NULL) {
txt = yytexttostr(yypos, YYBUFSIZ);
freetxt = 1;
} else
txt = yystr;
} else {
txt = yykeytostr(yytokentype);
}
fprintf(stderr, "%s error at \"%s\", line %d\n", msg, txt, yylineNum);
if (freetxt == 1)
free(txt);
exit(1);
}
void
yysetfixeddict(wordtab_t *newdict)
{
if (yydebug)
printf("yysetfixeddict(%lx)\n", (u_long)newdict);
if (yysavedepth == sizeof(yysavewords)/sizeof(yysavewords[0])) {
fprintf(stderr, "%d: at maximum dictionary depth\n",
yylineNum);
return;
}
yysavewords[yysavedepth++] = yysettab(newdict);
if (yydebug)
printf("yysavedepth++ => %d\n", yysavedepth);
yydictfixed = 1;
}
void
yysetdict(wordtab_t *newdict)
{
if (yydebug)
printf("yysetdict(%lx)\n", (u_long)newdict);
if (yysavedepth == sizeof(yysavewords)/sizeof(yysavewords[0])) {
fprintf(stderr, "%d: at maximum dictionary depth\n",
yylineNum);
return;
}
yysavewords[yysavedepth++] = yysettab(newdict);
if (yydebug)
printf("yysavedepth++ => %d\n", yysavedepth);
}
void
yyresetdict(void)
{
if (yydebug)
printf("yyresetdict(%d)\n", yysavedepth);
if (yysavedepth > 0) {
yysettab(yysavewords[--yysavedepth]);
if (yydebug)
printf("yysavedepth-- => %d\n", yysavedepth);
}
yydictfixed = 0;
}
#ifdef TEST_LEXER
int
main(int argc, char *argv[])
{
int n;
yyin = stdin;
while ((n = yylex()) != 0)
printf("%d.n = %d [%s] %d %d\n",
yylineNum, n, yystr, yypos, yylast);
}
#endif
diff --git a/sbin/ipf/common/lexer.h b/sbin/ipf/common/lexer.h
index cc200f1cad41..c5f9a0c4183e 100644
--- a/sbin/ipf/common/lexer.h
+++ b/sbin/ipf/common/lexer.h
@@ -1,38 +1,37 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#ifdef NO_YACC
#define YY_COMMENT 1000
#define YY_CMP_NE 1001
#define YY_CMP_LE 1002
#define YY_RANGE_OUT 1003
#define YY_CMP_GE 1004
#define YY_RANGE_IN 1005
#define YY_HEX 1006
#define YY_NUMBER 1007
#define YY_IPV6 1008
#define YY_STR 1009
#define YY_IPADDR 1010
#endif
#define YYBUFSIZ 8192
extern wordtab_t *yysettab(wordtab_t *);
extern void yysetdict(wordtab_t *);
extern void yysetfixeddict(wordtab_t *);
extern int yylex(void);
extern void yyerror(char *);
extern char *yykeytostr(int);
extern void yyresetdict(void);
extern FILE *yyin;
extern int yylineNum;
extern int yyexpectaddr;
extern int yybreakondot;
extern int yyvarnext;
diff --git a/sbin/ipf/common/opts.h b/sbin/ipf/common/opts.h
index 17844e89ecfc..1281458c145a 100644
--- a/sbin/ipf/common/opts.h
+++ b/sbin/ipf/common/opts.h
@@ -1,69 +1,68 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#ifndef __OPTS_H__
#define __OPTS_H__
#ifndef SOLARIS
# if defined(sun) && (defined(__svr4__) || defined(__SVR4))
# define SOLARIS 1
# else
# define SOLARIS 0
# endif
#endif
#define OPT_REMOVE 0x000001
#define OPT_DEBUG 0x000002
#define OPT_AUTHSTATS 0x000004
#define OPT_RAW 0x000008
#define OPT_LOG 0x000010
#define OPT_SHOWLIST 0x000020
#define OPT_VERBOSE 0x000040
#define OPT_DONOTHING 0x000080
#define OPT_HITS 0x000100
#define OPT_BRIEF 0x000200
#define OPT_ACCNT 0x000400
#define OPT_FRSTATES 0x000800
#define OPT_SHOWLINENO 0x001000
#define OPT_PRINTFR 0x002000
#define OPT_OUTQUE FR_OUTQUE /* 0x4000 */
#define OPT_INQUE FR_INQUE /* 0x8000 */
#define OPT_ZERORULEST 0x010000
#define OPT_SAVEOUT 0x020000
#define OPT_IPSTATES 0x040000
#define OPT_INACTIVE 0x080000
#define OPT_NAT 0x100000
#define OPT_GROUPS 0x200000
#define OPT_STATETOP 0x400000
#define OPT_FLUSH 0x800000
#define OPT_CLEAR 0x1000000
#define OPT_HEX 0x2000000
#define OPT_ASCII 0x4000000
#define OPT_NORESOLVE 0x8000000
#define OPT_DONTOPEN 0x10000000
#define OPT_PURGE 0x20000000
#define OPT_STAT OPT_FRSTATES
#define OPT_LIST OPT_SHOWLIST
#ifndef __P
# define __P(x) x
#endif
#if defined(sun) && !SOLARIS
# define STRERROR(x) sys_errlist[x]
extern char *sys_errlist[];
#else
# define STRERROR(x) strerror(x)
#endif
extern int opts;
#endif /* __OPTS_H__ */
diff --git a/sbin/ipf/common/pcap-ipf.h b/sbin/ipf/common/pcap-ipf.h
index b856760eaa53..ba596e795efa 100644
--- a/sbin/ipf/common/pcap-ipf.h
+++ b/sbin/ipf/common/pcap-ipf.h
@@ -1,35 +1,34 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
/*
* This header file is constructed to match the version described by
* PCAP_VERSION_MAJ.
*
* The structure largely derives from libpcap which wouldn't include
* nicely without bpf.
*/
typedef struct pcap_filehdr {
u_int pc_id;
u_short pc_v_maj;
u_short pc_v_min;
u_int pc_zone;
u_int pc_sigfigs;
u_int pc_slen;
u_int pc_type;
} pcaphdr_t;
#define TCPDUMP_MAGIC 0xa1b2c3d4
#define PCAP_VERSION_MAJ 2
typedef struct pcap_pkthdr {
struct timeval ph_ts;
u_int ph_clen;
u_int ph_len;
} pcappkt_t;
diff --git a/sbin/ipf/ipf/bpf-ipf.h b/sbin/ipf/ipf/bpf-ipf.h
index 2350e6cf0692..1c3032150377 100644
--- a/sbin/ipf/ipf/bpf-ipf.h
+++ b/sbin/ipf/ipf/bpf-ipf.h
@@ -1,440 +1,439 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
* The Regents of the University of California. All rights reserved.
*
* This code is derived from the Stanford/CMU enet packet filter,
* (net/enet.c) distributed as part of 4.3BSD, and code contributed
* to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
* Berkeley Laboratory.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)bpf.h 7.1 (Berkeley) 5/7/91
*
* @(#) $Header: /devel/CVS/IP-Filter/bpf-ipf.h,v 2.1 2002/10/26 12:14:26 darrenr Exp $ (LBL)
*/
#ifndef BPF_MAJOR_VERSION
#ifdef __cplusplus
extern "C" {
#endif
/* BSD style release date */
#define BPF_RELEASE 199606
typedef int bpf_int32;
typedef u_int bpf_u_int32;
/*
* Alignment macros. BPF_WORDALIGN rounds up to the next
* even multiple of BPF_ALIGNMENT.
*/
#ifndef __NetBSD__
#define BPF_ALIGNMENT sizeof(bpf_int32)
#else
#define BPF_ALIGNMENT sizeof(long)
#endif
#define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1))
#define BPF_MAXINSNS 512
#define BPF_MAXBUFSIZE 0x8000
#define BPF_MINBUFSIZE 32
/*
* Structure for BIOCSETF.
*/
struct bpf_program {
u_int bf_len;
struct bpf_insn *bf_insns;
};
/*
* Struct returned by BIOCGSTATS.
*/
struct bpf_stat {
u_int bs_recv; /* number of packets received */
u_int bs_drop; /* number of packets dropped */
};
/*
* Struct return by BIOCVERSION. This represents the version number of
* the filter language described by the instruction encodings below.
* bpf understands a program iff kernel_major == filter_major &&
* kernel_minor >= filter_minor, that is, if the value returned by the
* running kernel has the same major number and a minor number equal
* equal to or less than the filter being downloaded. Otherwise, the
* results are undefined, meaning an error may be returned or packets
* may be accepted haphazardly.
* It has nothing to do with the source code version.
*/
struct bpf_version {
u_short bv_major;
u_short bv_minor;
};
/* Current version number of filter architecture. */
#define BPF_MAJOR_VERSION 1
#define BPF_MINOR_VERSION 1
/*
* BPF ioctls
*
* The first set is for compatibility with Sun's pcc style
* header files. If your using gcc, we assume that you
* have run fixincludes so the latter set should work.
*/
#if (defined(sun) || defined(ibm032)) && !defined(__GNUC__)
#define BIOCGBLEN _IOR(B,102, u_int)
#define BIOCSBLEN _IOWR(B,102, u_int)
#define BIOCSETF _IOW(B,103, struct bpf_program)
#define BIOCFLUSH _IO(B,104)
#define BIOCPROMISC _IO(B,105)
#define BIOCGDLT _IOR(B,106, u_int)
#define BIOCGETIF _IOR(B,107, struct ifreq)
#define BIOCSETIF _IOW(B,108, struct ifreq)
#define BIOCSRTIMEOUT _IOW(B,109, struct timeval)
#define BIOCGRTIMEOUT _IOR(B,110, struct timeval)
#define BIOCGSTATS _IOR(B,111, struct bpf_stat)
#define BIOCIMMEDIATE _IOW(B,112, u_int)
#define BIOCVERSION _IOR(B,113, struct bpf_version)
#define BIOCSTCPF _IOW(B,114, struct bpf_program)
#define BIOCSUDPF _IOW(B,115, struct bpf_program)
#else
#define BIOCGBLEN _IOR('B',102, u_int)
#define BIOCSBLEN _IOWR('B',102, u_int)
#define BIOCSETF _IOW('B',103, struct bpf_program)
#define BIOCFLUSH _IO('B',104)
#define BIOCPROMISC _IO('B',105)
#define BIOCGDLT _IOR('B',106, u_int)
#define BIOCGETIF _IOR('B',107, struct ifreq)
#define BIOCSETIF _IOW('B',108, struct ifreq)
#define BIOCSRTIMEOUT _IOW('B',109, struct timeval)
#define BIOCGRTIMEOUT _IOR('B',110, struct timeval)
#define BIOCGSTATS _IOR('B',111, struct bpf_stat)
#define BIOCIMMEDIATE _IOW('B',112, u_int)
#define BIOCVERSION _IOR('B',113, struct bpf_version)
#define BIOCSTCPF _IOW('B',114, struct bpf_program)
#define BIOCSUDPF _IOW('B',115, struct bpf_program)
#endif
/*
* Structure prepended to each packet.
*/
struct bpf_hdr {
struct timeval bh_tstamp; /* time stamp */
bpf_u_int32 bh_caplen; /* length of captured portion */
bpf_u_int32 bh_datalen; /* original length of packet */
u_short bh_hdrlen; /* length of bpf header (this struct
plus alignment padding) */
};
/*
* Because the structure above is not a multiple of 4 bytes, some compilers
* will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
* Only the kernel needs to know about it; applications use bh_hdrlen.
*/
#if defined(KERNEL) || defined(_KERNEL)
#define SIZEOF_BPF_HDR 18
#endif
/*
* Data-link level type codes.
*/
/*
* These are the types that are the same on all platforms; on other
* platforms, a <net/bpf.h> should be supplied that defines the additional
* DLT_* codes appropriately for that platform (the BSDs, for example,
* should not just pick up this version of "bpf.h"; they should also define
* the additional DLT_* codes used by their kernels, as well as the values
* defined here - and, if the values they use for particular DLT_ types
* differ from those here, they should use their values, not the ones
* here).
*/
#define DLT_NULL 0 /* no link-layer encapsulation */
#define DLT_EN10MB 1 /* Ethernet (10Mb) */
#define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */
#define DLT_AX25 3 /* Amateur Radio AX.25 */
#define DLT_PRONET 4 /* Proteon ProNET Token Ring */
#define DLT_CHAOS 5 /* Chaos */
#define DLT_IEEE802 6 /* IEEE 802 Networks */
#define DLT_ARCNET 7 /* ARCNET */
#define DLT_SLIP 8 /* Serial Line IP */
#define DLT_PPP 9 /* Point-to-point Protocol */
#define DLT_FDDI 10 /* FDDI */
/*
* These are values from the traditional libpcap "bpf.h".
* Ports of this to particular platforms should replace these definitions
* with the ones appropriate to that platform, if the values are
* different on that platform.
*/
#define DLT_ATM_RFC1483 11 /* LLC/SNAP encapsulated atm */
#define DLT_RAW 12 /* raw IP */
/*
* These are values from BSD/OS's "bpf.h".
* These are not the same as the values from the traditional libpcap
* "bpf.h"; however, these values shouldn't be generated by any
* OS other than BSD/OS, so the correct values to use here are the
* BSD/OS values.
*
* Platforms that have already assigned these values to other
* DLT_ codes, however, should give these codes the values
* from that platform, so that programs that use these codes will
* continue to compile - even though they won't correctly read
* files of these types.
*/
#ifdef __NetBSD__
#ifndef DLT_SLIP_BSDOS
#define DLT_SLIP_BSDOS 13 /* BSD/OS Serial Line IP */
#define DLT_PPP_BSDOS 14 /* BSD/OS Point-to-point Protocol */
#endif
#else
#define DLT_SLIP_BSDOS 15 /* BSD/OS Serial Line IP */
#define DLT_PPP_BSDOS 16 /* BSD/OS Point-to-point Protocol */
#endif
#define DLT_ATM_CLIP 19 /* Linux Classical-IP over ATM */
/*
* These values are defined by NetBSD; other platforms should refrain from
* using them for other purposes, so that NetBSD savefiles with link
* types of 50 or 51 can be read as this type on all platforms.
*/
#define DLT_PPP_SERIAL 50 /* PPP over serial with HDLC encapsulation */
#define DLT_PPP_ETHER 51 /* PPP over Ethernet */
/*
* Values between 100 and 103 are used in capture file headers as
* link-layer types corresponding to DLT_ types that differ
* between platforms; don't use those values for new DLT_ new types.
*/
/*
* This value was defined by libpcap 0.5; platforms that have defined
* it with a different value should define it here with that value -
* a link type of 104 in a save file will be mapped to DLT_C_HDLC,
* whatever value that happens to be, so programs will correctly
* handle files with that link type regardless of the value of
* DLT_C_HDLC.
*
* The name DLT_C_HDLC was used by BSD/OS; we use that name for source
* compatibility with programs written for BSD/OS.
*
* libpcap 0.5 defined it as DLT_CHDLC; we define DLT_CHDLC as well,
* for source compatibility with programs written for libpcap 0.5.
*/
#define DLT_C_HDLC 104 /* Cisco HDLC */
#define DLT_CHDLC DLT_C_HDLC
#define DLT_IEEE802_11 105 /* IEEE 802.11 wireless */
/*
* Values between 106 and 107 are used in capture file headers as
* link-layer types corresponding to DLT_ types that might differ
* between platforms; don't use those values for new DLT_ new types.
*/
/*
* OpenBSD DLT_LOOP, for loopback devices; it's like DLT_NULL, except
* that the AF_ type in the link-layer header is in network byte order.
*
* OpenBSD defines it as 12, but that collides with DLT_RAW, so we
* define it as 108 here. If OpenBSD picks up this file, it should
* define DLT_LOOP as 12 in its version, as per the comment above -
* and should not use 108 as a DLT_ value.
*/
#define DLT_LOOP 108
/*
* Values between 109 and 112 are used in capture file headers as
* link-layer types corresponding to DLT_ types that might differ
* between platforms; don't use those values for new DLT_ types
* other than the corresponding DLT_ types.
*/
/*
* This is for Linux cooked sockets.
*/
#define DLT_LINUX_SLL 113
/*
* Apple LocalTalk hardware.
*/
#define DLT_LTALK 114
/*
* Acorn Econet.
*/
#define DLT_ECONET 115
/*
* Reserved for use with OpenBSD ipfilter.
*/
#define DLT_IPFILTER 116
/*
* Reserved for use in capture-file headers as a link-layer type
* corresponding to OpenBSD DLT_PFLOG; DLT_PFLOG is 17 in OpenBSD,
* but that's DLT_LANE8023 in SuSE 6.3, so we can't use 17 for it
* in capture-file headers.
*/
#define DLT_PFLOG 117
/*
* Registered for Cisco-internal use.
*/
#define DLT_CISCO_IOS 118
/*
* Reserved for 802.11 cards using the Prism II chips, with a link-layer
* header including Prism monitor mode information plus an 802.11
* header.
*/
#define DLT_PRISM_HEADER 119
/*
* Reserved for Aironet 802.11 cards, with an Aironet link-layer header
* (see Doug Ambrisko's FreeBSD patches).
*/
#define DLT_AIRONET_HEADER 120
/*
* Reserved for Siemens HiPath HDLC.
*/
#define DLT_HHDLC 121
/*
* Reserved for RFC 2625 IP-over-Fibre Channel, as per a request from
* Don Lee <donlee@cray.com>.
*
* This is not for use with raw Fibre Channel, where the link-layer
* header starts with a Fibre Channel frame header; it's for IP-over-FC,
* where the link-layer header starts with an RFC 2625 Network_Header
* field.
*/
#define DLT_IP_OVER_FC 122
/*
* The instruction encodings.
*/
/* instruction classes */
#define BPF_CLASS(code) ((code) & 0x07)
#define BPF_LD 0x00
#define BPF_LDX 0x01
#define BPF_ST 0x02
#define BPF_STX 0x03
#define BPF_ALU 0x04
#define BPF_JMP 0x05
#define BPF_RET 0x06
#define BPF_MISC 0x07
/* ld/ldx fields */
#define BPF_SIZE(code) ((code) & 0x18)
#define BPF_W 0x00
#define BPF_H 0x08
#define BPF_B 0x10
#define BPF_MODE(code) ((code) & 0xe0)
#define BPF_IMM 0x00
#define BPF_ABS 0x20
#define BPF_IND 0x40
#define BPF_MEM 0x60
#define BPF_LEN 0x80
#define BPF_MSH 0xa0
/* alu/jmp fields */
#define BPF_OP(code) ((code) & 0xf0)
#define BPF_ADD 0x00
#define BPF_SUB 0x10
#define BPF_MUL 0x20
#define BPF_DIV 0x30
#define BPF_OR 0x40
#define BPF_AND 0x50
#define BPF_LSH 0x60
#define BPF_RSH 0x70
#define BPF_NEG 0x80
#define BPF_JA 0x00
#define BPF_JEQ 0x10
#define BPF_JGT 0x20
#define BPF_JGE 0x30
#define BPF_JSET 0x40
#define BPF_SRC(code) ((code) & 0x08)
#define BPF_K 0x00
#define BPF_X 0x08
/* ret - BPF_K and BPF_X also apply */
#define BPF_RVAL(code) ((code) & 0x18)
#define BPF_A 0x10
/* misc */
#define BPF_MISCOP(code) ((code) & 0xf8)
#define BPF_TAX 0x00
#define BPF_TXA 0x80
/*
* The instruction data structure.
*/
struct bpf_insn {
u_short code;
u_char jt;
u_char jf;
bpf_int32 k;
};
/*
* Macros for insn array initializers.
*/
#define BPF_STMT(code, k) { (u_short)(code), 0, 0, k }
#define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
#if defined(BSD) && (defined(KERNEL) || defined(_KERNEL))
/*
* Systems based on non-BSD kernels don't have ifnet's (or they don't mean
* anything if it is in <net/if.h>) and won't work like this.
*/
extern void bpf_tap(struct ifnet *, u_char *, u_int);
extern void bpf_mtap(struct ifnet *, struct mbuf *);
extern void bpfattach(struct ifnet *, u_int, u_int);
extern void bpfilterattach(int);
#endif /* BSD && (_KERNEL || KERNEL) */
extern int bpf_validate(struct bpf_insn *, int);
extern u_int bpf_filter(struct bpf_insn *, u_char *, u_int, u_int);
/*
* Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
*/
#define BPF_MEMWORDS 16
#ifdef __cplusplus
}
#endif
#endif
diff --git a/sbin/ipf/ipf/bpf_filter.c b/sbin/ipf/ipf/bpf_filter.c
index fbb0138f51d8..74eac25af5b2 100644
--- a/sbin/ipf/ipf/bpf_filter.c
+++ b/sbin/ipf/ipf/bpf_filter.c
@@ -1,595 +1,594 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
* The Regents of the University of California. All rights reserved.
*
* This code is derived from the Stanford/CMU enet packet filter,
* (net/enet.c) distributed as part of 4.3BSD, and code contributed
* to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
* Berkeley Laboratory.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)bpf.c 7.5 (Berkeley) 7/15/91
*/
#if !(defined(lint) || defined(KERNEL) || defined(_KERNEL))
static const char rcsid[] =
"@(#) $Header: /devel/CVS/IP-Filter/bpf_filter.c,v 2.2.2.3 2006/10/03 11:25:56 darrenr Exp $ (LBL)";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <net/if.h>
#include "netinet/ip_compat.h"
#include "bpf-ipf.h"
#if (defined(__hpux) || SOLARIS) && (defined(_KERNEL) || defined(KERNEL))
# include <sys/sysmacros.h>
# include <sys/stream.h>
#endif
#include "pcap-ipf.h"
#if !defined(KERNEL) && !defined(_KERNEL)
#include <stdlib.h>
#endif
#define int32 bpf_int32
#define u_int32 bpf_u_int32
static int m_xword(mb_t *, int, int *);
static int m_xhalf(mb_t *, int, int *);
#ifndef LBL_ALIGN
/*
* XXX - IA-64? If not, this probably won't work on Win64 IA-64
* systems, unless LBL_ALIGN is defined elsewhere for them.
* XXX - SuperH? If not, this probably won't work on WinCE SuperH
* systems, unless LBL_ALIGN is defined elsewhere for them.
*/
#if defined(sparc) || defined(__sparc__) || defined(mips) || \
defined(ibm032) || defined(__alpha) || defined(__hpux) || \
defined(__arm__)
#define LBL_ALIGN
#endif
#endif
#ifndef LBL_ALIGN
#define EXTRACT_SHORT(p) ((u_short)ntohs(*(u_short *)p))
#define EXTRACT_LONG(p) (ntohl(*(u_int32 *)p))
#else
#define EXTRACT_SHORT(p)\
((u_short)\
((u_short)*((u_char *)p+0)<<8|\
(u_short)*((u_char *)p+1)<<0))
#define EXTRACT_LONG(p)\
((u_int32)*((u_char *)p+0)<<24|\
(u_int32)*((u_char *)p+1)<<16|\
(u_int32)*((u_char *)p+2)<<8|\
(u_int32)*((u_char *)p+3)<<0)
#endif
#define MINDEX(len, _m, _k) \
{ \
len = M_LEN(m); \
while ((_k) >= len) { \
(_k) -= len; \
(_m) = (_m)->m_next; \
if ((_m) == 0) \
return (0); \
len = M_LEN(m); \
} \
}
static int
m_xword(m, k, err)
register mb_t *m;
register int k, *err;
{
register int len;
register u_char *cp, *np;
register mb_t *m0;
MINDEX(len, m, k);
cp = MTOD(m, u_char *) + k;
if (len - k >= 4) {
*err = 0;
return (EXTRACT_LONG(cp));
}
m0 = m->m_next;
if (m0 == NULL || M_LEN(m0) + len - k < 4)
goto bad;
*err = 0;
np = MTOD(m0, u_char *);
switch (len - k) {
case 1:
return (cp[0] << 24) | (np[0] << 16) | (np[1] << 8) | np[2];
case 2:
return (cp[0] << 24) | (cp[1] << 16) | (np[0] << 8) | np[1];
default:
return (cp[0] << 24) | (cp[1] << 16) | (cp[2] << 8) | np[0];
}
bad:
*err = 1;
return (0);
}
static int
m_xhalf(m, k, err)
register mb_t *m;
register int k, *err;
{
register int len;
register u_char *cp;
register mb_t *m0;
MINDEX(len, m, k);
cp = MTOD(m, u_char *) + k;
if (len - k >= 2) {
*err = 0;
return (EXTRACT_SHORT(cp));
}
m0 = m->m_next;
if (m0 == NULL)
goto bad;
*err = 0;
return (cp[0] << 8) | MTOD(m0, u_char *)[0];
bad:
*err = 1;
return (0);
}
/*
* Execute the filter program starting at pc on the packet p
* wirelen is the length of the original packet
* buflen is the amount of data present
* For the kernel, p is assumed to be a pointer to an mbuf if buflen is 0,
* in all other cases, p is a pointer to a buffer and buflen is its size.
*/
u_int
bpf_filter(pc, p, wirelen, buflen)
register struct bpf_insn *pc;
register u_char *p;
u_int wirelen;
register u_int buflen;
{
register u_int32 A, X;
register int k;
int32 mem[BPF_MEMWORDS];
mb_t *m, *n;
int merr = 0; /* XXX: GCC */
int len;
if (buflen == 0) {
m = (mb_t *)p;
p = MTOD(m, u_char *);
buflen = M_LEN(m);
} else
m = NULL;
if (pc == NULL)
/*
* No filter means accept all.
*/
return (u_int)-1;
A = 0;
X = 0;
--pc;
while (1) {
++pc;
switch (pc->code) {
default:
return (0);
case BPF_RET|BPF_K:
return (u_int)pc->k;
case BPF_RET|BPF_A:
return (u_int)A;
case BPF_LD|BPF_W|BPF_ABS:
k = pc->k;
if (k + sizeof(int32) > buflen) {
if (m == NULL)
return (0);
A = m_xword(m, k, &merr);
if (merr != 0)
return (0);
continue;
}
A = EXTRACT_LONG(&p[k]);
continue;
case BPF_LD|BPF_H|BPF_ABS:
k = pc->k;
if (k + sizeof(short) > buflen) {
if (m == NULL)
return (0);
A = m_xhalf(m, k, &merr);
if (merr != 0)
return (0);
continue;
}
A = EXTRACT_SHORT(&p[k]);
continue;
case BPF_LD|BPF_B|BPF_ABS:
k = pc->k;
if (k >= buflen) {
if (m == NULL)
return (0);
n = m;
MINDEX(len, n, k);
A = MTOD(n, u_char *)[k];
continue;
}
A = p[k];
continue;
case BPF_LD|BPF_W|BPF_LEN:
A = wirelen;
continue;
case BPF_LDX|BPF_W|BPF_LEN:
X = wirelen;
continue;
case BPF_LD|BPF_W|BPF_IND:
k = X + pc->k;
if (k + sizeof(int32) > buflen) {
if (m == NULL)
return (0);
A = m_xword(m, k, &merr);
if (merr != 0)
return (0);
continue;
}
A = EXTRACT_LONG(&p[k]);
continue;
case BPF_LD|BPF_H|BPF_IND:
k = X + pc->k;
if (k + sizeof(short) > buflen) {
if (m == NULL)
return (0);
A = m_xhalf(m, k, &merr);
if (merr != 0)
return (0);
continue;
}
A = EXTRACT_SHORT(&p[k]);
continue;
case BPF_LD|BPF_B|BPF_IND:
k = X + pc->k;
if (k >= buflen) {
if (m == NULL)
return (0);
n = m;
MINDEX(len, n, k);
A = MTOD(n, u_char *)[k];
continue;
}
A = p[k];
continue;
case BPF_LDX|BPF_MSH|BPF_B:
k = pc->k;
if (k >= buflen) {
if (m == NULL)
return (0);
n = m;
MINDEX(len, n, k);
X = (MTOD(n, char *)[k] & 0xf) << 2;
continue;
}
X = (p[pc->k] & 0xf) << 2;
continue;
case BPF_LD|BPF_IMM:
A = pc->k;
continue;
case BPF_LDX|BPF_IMM:
X = pc->k;
continue;
case BPF_LD|BPF_MEM:
A = mem[pc->k];
continue;
case BPF_LDX|BPF_MEM:
X = mem[pc->k];
continue;
case BPF_ST:
mem[pc->k] = A;
continue;
case BPF_STX:
mem[pc->k] = X;
continue;
case BPF_JMP|BPF_JA:
pc += pc->k;
continue;
case BPF_JMP|BPF_JGT|BPF_K:
pc += (A > pc->k) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JGE|BPF_K:
pc += (A >= pc->k) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JEQ|BPF_K:
pc += (A == pc->k) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JSET|BPF_K:
pc += (A & pc->k) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JGT|BPF_X:
pc += (A > X) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JGE|BPF_X:
pc += (A >= X) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JEQ|BPF_X:
pc += (A == X) ? pc->jt : pc->jf;
continue;
case BPF_JMP|BPF_JSET|BPF_X:
pc += (A & X) ? pc->jt : pc->jf;
continue;
case BPF_ALU|BPF_ADD|BPF_X:
A += X;
continue;
case BPF_ALU|BPF_SUB|BPF_X:
A -= X;
continue;
case BPF_ALU|BPF_MUL|BPF_X:
A *= X;
continue;
case BPF_ALU|BPF_DIV|BPF_X:
if (X == 0)
return (0);
A /= X;
continue;
case BPF_ALU|BPF_AND|BPF_X:
A &= X;
continue;
case BPF_ALU|BPF_OR|BPF_X:
A |= X;
continue;
case BPF_ALU|BPF_LSH|BPF_X:
A <<= X;
continue;
case BPF_ALU|BPF_RSH|BPF_X:
A >>= X;
continue;
case BPF_ALU|BPF_ADD|BPF_K:
A += pc->k;
continue;
case BPF_ALU|BPF_SUB|BPF_K:
A -= pc->k;
continue;
case BPF_ALU|BPF_MUL|BPF_K:
A *= pc->k;
continue;
case BPF_ALU|BPF_DIV|BPF_K:
A /= pc->k;
continue;
case BPF_ALU|BPF_AND|BPF_K:
A &= pc->k;
continue;
case BPF_ALU|BPF_OR|BPF_K:
A |= pc->k;
continue;
case BPF_ALU|BPF_LSH|BPF_K:
A <<= pc->k;
continue;
case BPF_ALU|BPF_RSH|BPF_K:
A >>= pc->k;
continue;
case BPF_ALU|BPF_NEG:
A = -A;
continue;
case BPF_MISC|BPF_TAX:
X = A;
continue;
case BPF_MISC|BPF_TXA:
A = X;
continue;
}
}
}
/*
* Return true if the 'fcode' is a valid filter program.
* The constraints are that each jump be forward and to a valid
* code, that memory accesses are within valid ranges (to the
* extent that this can be checked statically; loads of packet
* data have to be, and are, also checked at run time), and that
* the code terminates with either an accept or reject.
*
* The kernel needs to be able to verify an application's filter code.
* Otherwise, a bogus program could easily crash the system.
*/
int
bpf_validate(f, len)
struct bpf_insn *f;
int len;
{
u_int i, from;
const struct bpf_insn *p;
if (len == 0)
return (1);
if (len < 1 || len > BPF_MAXINSNS)
return (0);
for (i = 0; i < len; ++i) {
p = &f[i];
switch (BPF_CLASS(p->code)) {
/*
* Check that memory operations use valid addresses.
*/
case BPF_LD:
case BPF_LDX:
switch (BPF_MODE(p->code)) {
case BPF_IMM:
break;
case BPF_ABS:
case BPF_IND:
case BPF_MSH:
/*
* More strict check with actual packet length
* is done runtime.
*/
#if 0
if (p->k >= bpf_maxbufsize)
return (0);
#endif
break;
case BPF_MEM:
if (p->k >= BPF_MEMWORDS)
return (0);
break;
case BPF_LEN:
break;
default:
return (0);
}
break;
case BPF_ST:
case BPF_STX:
if (p->k >= BPF_MEMWORDS)
return (0);
break;
case BPF_ALU:
switch (BPF_OP(p->code)) {
case BPF_ADD:
case BPF_SUB:
case BPF_OR:
case BPF_AND:
case BPF_LSH:
case BPF_RSH:
case BPF_NEG:
break;
case BPF_DIV:
/*
* Check for constant division by 0.
*/
if (BPF_RVAL(p->code) == BPF_K && p->k == 0)
return (0);
default:
return (0);
}
break;
case BPF_JMP:
/*
* Check that jumps are within the code block,
* and that unconditional branches don't go
* backwards as a result of an overflow.
* Unconditional branches have a 32-bit offset,
* so they could overflow; we check to make
* sure they don't. Conditional branches have
* an 8-bit offset, and the from address is <=
* BPF_MAXINSNS, and we assume that BPF_MAXINSNS
* is sufficiently small that adding 255 to it
* won't overflow.
*
* We know that len is <= BPF_MAXINSNS, and we
* assume that BPF_MAXINSNS is < the maximum size
* of a u_int, so that i + 1 doesn't overflow.
*/
from = i + 1;
switch (BPF_OP(p->code)) {
case BPF_JA:
if (from + p->k < from || from + p->k >= len)
return (0);
break;
case BPF_JEQ:
case BPF_JGT:
case BPF_JGE:
case BPF_JSET:
if (from + p->jt >= len || from + p->jf >= len)
return (0);
break;
default:
return (0);
}
break;
case BPF_RET:
break;
case BPF_MISC:
break;
default:
return (0);
}
}
return (BPF_CLASS(f[len - 1].code) == BPF_RET);
}
diff --git a/sbin/ipf/ipf/ipf.c b/sbin/ipf/ipf/ipf.c
index de5121d94767..57ce1427812b 100644
--- a/sbin/ipf/ipf/ipf.c
+++ b/sbin/ipf/ipf/ipf.c
@@ -1,578 +1,577 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
#include <fcntl.h>
#include <ctype.h>
#include <sys/ioctl.h>
#include "netinet/ipl.h"
#if !defined(lint)
static const char sccsid[] = "@(#)ipf.c 1.23 6/5/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#if !defined(__SVR4) && defined(__GNUC__)
extern char *index(const char *, int);
#endif
extern char *optarg;
extern int optind;
extern frentry_t *frtop;
void ipf_frsync(void);
void zerostats(void);
int main(int, char *[]);
int opts = 0;
int outputc = 0;
int use_inet6 = 0;
int exitstatus = 0;
static void procfile(char *);
static void flushfilter(char *, int *);
static void set_state(u_int);
static void showstats(friostat_t *);
static void packetlogon(char *);
static void swapactive(void);
static int opendevice(char *, int);
static void closedevice(void);
static char *ipfname = IPL_NAME;
static void usage(void);
static int showversion(void);
static int get_flags(void);
static int ipf_interceptadd(int, ioctlfunc_t, void *);
static int fd = -1;
static ioctlfunc_t iocfunctions[IPL_LOGSIZE] = { ioctl, ioctl, ioctl,
ioctl, ioctl, ioctl,
ioctl, ioctl };
/* XXX The following was added to satisfy a rescue/rescue/ build
XXX requirement. */
int nohdrfields;
static void usage()
{
fprintf(stderr, "usage: ipf [-6AdDEInoPrRsvVyzZ] %s %s %s\n",
"[-l block|pass|nomatch|state|nat]", "[-cc] [-F i|o|a|s|S|u]",
"[-f filename] [-T <tuneopts>]");
exit(1);
}
int
main(int argc, char *argv[])
{
int c, *filter = NULL;
if (argc < 2)
usage();
assigndefined(getenv("IPF_PREDEFINED"));
while ((c = getopt(argc, argv, "46Ac:dDEf:F:Il:m:noPrRsT:vVyzZ")) != -1) {
switch (c)
{
case '?' :
usage();
break;
case '4' :
use_inet6 = -1;
break;
case '6' :
use_inet6 = 1;
break;
case 'A' :
opts &= ~OPT_INACTIVE;
break;
case 'c' :
if (strcmp(optarg, "c") == 0)
outputc = 1;
break;
case 'E' :
set_state((u_int)1);
break;
case 'D' :
set_state((u_int)0);
break;
case 'd' :
opts ^= OPT_DEBUG;
break;
case 'f' :
procfile(optarg);
break;
case 'F' :
flushfilter(optarg, filter);
break;
case 'I' :
opts ^= OPT_INACTIVE;
break;
case 'l' :
packetlogon(optarg);
break;
case 'm' :
filter = parseipfexpr(optarg, NULL);
break;
case 'n' :
opts ^= OPT_DONOTHING|OPT_DONTOPEN;
break;
case 'o' :
break;
case 'P' :
ipfname = IPAUTH_NAME;
break;
case 'R' :
opts ^= OPT_NORESOLVE;
break;
case 'r' :
opts ^= OPT_REMOVE;
break;
case 's' :
swapactive();
break;
case 'T' :
if (opendevice(ipfname, 1) >= 0)
ipf_dotuning(fd, optarg, ioctl);
break;
case 'v' :
opts += OPT_VERBOSE;
break;
case 'V' :
if (showversion())
exit(1);
break;
case 'y' :
ipf_frsync();
break;
case 'z' :
opts ^= OPT_ZERORULEST;
break;
case 'Z' :
zerostats();
break;
}
}
if (optind < 2)
usage();
if (fd != -1)
(void) close(fd);
return (exitstatus);
/* NOTREACHED */
}
static int
opendevice(char *ipfdev, int check)
{
if (opts & OPT_DONOTHING)
return (-2);
if (check && checkrev(ipfname) == -1) {
fprintf(stderr, "User/kernel version check failed\n");
return (-2);
}
if (!ipfdev)
ipfdev = ipfname;
if (fd == -1)
if ((fd = open(ipfdev, O_RDWR)) == -1)
if ((fd = open(ipfdev, O_RDONLY)) == -1)
ipferror(fd, "open device");
return (fd);
}
static void
closedevice(void)
{
close(fd);
fd = -1;
}
static int
get_flags(void)
{
int i = 0;
if ((opendevice(ipfname, 1) != -2) &&
(ioctl(fd, SIOCGETFF, &i) == -1)) {
ipferror(fd, "SIOCGETFF");
return (0);
}
return (i);
}
static void
set_state(u_int enable)
{
if (opendevice(ipfname, 0) != -2) {
if (ioctl(fd, SIOCFRENB, &enable) == -1) {
if (errno == EBUSY) {
fprintf(stderr,
"IP FIlter: already initialized\n");
} else {
ipferror(fd, "SIOCFRENB");
}
}
}
return;
}
static void
procfile(char *file)
{
(void) opendevice(ipfname, 1);
initparse();
ipf_parsefile(fd, ipf_interceptadd, iocfunctions, file);
if (outputc) {
printC(0);
printC(1);
emit(-1, -1, NULL, NULL);
}
}
static int
ipf_interceptadd(int fd, ioctlfunc_t ioctlfunc, void *ptr)
{
if (outputc)
printc(ptr);
if (ipf_addrule(fd, ioctlfunc, ptr) != 0)
exitstatus = 1;
return (0);
}
static void
packetlogon(char *opt)
{
int flag, xfd, logopt, change = 0;
flag = get_flags();
if (flag != 0) {
if ((opts & (OPT_DONOTHING|OPT_VERBOSE)) == OPT_VERBOSE)
printf("log flag is currently %#x\n", flag);
}
flag &= ~(FF_LOGPASS|FF_LOGNOMATCH|FF_LOGBLOCK);
if (strstr(opt, "pass")) {
flag |= FF_LOGPASS;
if (opts & OPT_VERBOSE)
printf("set log flag: pass\n");
change = 1;
}
if (strstr(opt, "nomatch")) {
flag |= FF_LOGNOMATCH;
if (opts & OPT_VERBOSE)
printf("set log flag: nomatch\n");
change = 1;
}
if (strstr(opt, "block") || strchr(opt, 'd')) {
flag |= FF_LOGBLOCK;
if (opts & OPT_VERBOSE)
printf("set log flag: block\n");
change = 1;
}
if (strstr(opt, "none")) {
if (opts & OPT_VERBOSE)
printf("disable all log flags\n");
change = 1;
}
if (change == 1) {
if (opendevice(ipfname, 1) != -2 &&
(ioctl(fd, SIOCSETFF, &flag) != 0))
ipferror(fd, "ioctl(SIOCSETFF)");
}
if ((opts & (OPT_DONOTHING|OPT_VERBOSE)) == OPT_VERBOSE) {
flag = get_flags();
printf("log flags are now %#x\n", flag);
}
if (strstr(opt, "state")) {
if (opts & OPT_VERBOSE)
printf("set state log flag\n");
xfd = open(IPSTATE_NAME, O_RDWR);
if (xfd >= 0) {
logopt = 0;
if (ioctl(xfd, SIOCGETLG, &logopt))
ipferror(fd, "ioctl(SIOCGETLG)");
else {
logopt = 1 - logopt;
if (ioctl(xfd, SIOCSETLG, &logopt))
ipferror(xfd, "ioctl(SIOCSETLG)");
}
close(xfd);
}
}
if (strstr(opt, "nat")) {
if (opts & OPT_VERBOSE)
printf("set nat log flag\n");
xfd = open(IPNAT_NAME, O_RDWR);
if (xfd >= 0) {
logopt = 0;
if (ioctl(xfd, SIOCGETLG, &logopt))
ipferror(xfd, "ioctl(SIOCGETLG)");
else {
logopt = 1 - logopt;
if (ioctl(xfd, SIOCSETLG, &logopt))
ipferror(xfd, "ioctl(SIOCSETLG)");
}
close(xfd);
}
}
}
static void
flushfilter(char *arg, int *filter)
{
int fl = 0, rem;
if (!arg || !*arg)
return;
if (!strcmp(arg, "s") || !strcmp(arg, "S") || ISDIGIT(*arg)) {
if (*arg == 'S')
fl = 0;
else if (*arg == 's')
fl = 1;
else
fl = atoi(arg);
rem = fl;
closedevice();
if (opendevice(IPSTATE_NAME, 1) == -2)
exit(1);
if (!(opts & OPT_DONOTHING)) {
if (use_inet6) {
fprintf(stderr,
"IPv6 rules are no longer seperate\n");
} else if (filter != NULL) {
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = filter[0] * sizeof(int);
obj.ipfo_type = IPFOBJ_IPFEXPR;
obj.ipfo_ptr = filter;
if (ioctl(fd, SIOCMATCHFLUSH, &obj) == -1) {
ipferror(fd, "ioctl(SIOCMATCHFLUSH)");
fl = -1;
} else {
fl = obj.ipfo_retval;
}
} else {
if (ioctl(fd, SIOCIPFFL, &fl) == -1) {
ipferror(fd, "ioctl(SIOCIPFFL)");
exit(1);
}
}
}
if ((opts & (OPT_DONOTHING|OPT_DEBUG)) == OPT_DEBUG) {
printf("remove flags %s (%d)\n", arg, rem);
}
if ((opts & (OPT_DONOTHING|OPT_VERBOSE)) == OPT_VERBOSE) {
printf("%d state entries removed\n", fl);
}
closedevice();
return;
} else if (strchr(arg, 'i') || strchr(arg, 'I'))
fl = FR_INQUE;
else if (strchr(arg, 'o') || strchr(arg, 'O'))
fl = FR_OUTQUE;
else if (strchr(arg, 'a') || strchr(arg, 'A'))
fl = FR_OUTQUE|FR_INQUE;
else {
fprintf(stderr, "Incorrect flush argument: %s\n", arg);
usage();
}
if (opts & OPT_INACTIVE)
fl |= FR_INACTIVE;
rem = fl;
if (opendevice(ipfname, 1) == -2)
exit(1);
if (!(opts & OPT_DONOTHING)) {
if (use_inet6) {
if (ioctl(fd, SIOCIPFL6, &fl) == -1) {
ipferror(fd, "ioctl(SIOCIPFL6)");
exit(1);
}
} else {
if (ioctl(fd, SIOCIPFFL, &fl) == -1) {
ipferror(fd, "ioctl(SIOCIPFFL)");
exit(1);
}
}
}
if ((opts & (OPT_DONOTHING|OPT_DEBUG)) == OPT_DEBUG) {
printf("remove flags %s%s (%d)\n", (rem & FR_INQUE) ? "I" : "",
(rem & FR_OUTQUE) ? "O" : "", rem);
}
if ((opts & (OPT_DONOTHING|OPT_VERBOSE)) == OPT_VERBOSE) {
printf("%d filter rules removed\n", fl);
}
return;
}
static void
swapactive(void)
{
int in = 2;
if (opendevice(ipfname, 1) != -2 && ioctl(fd, SIOCSWAPA, &in) == -1)
ipferror(fd, "ioctl(SIOCSWAPA)");
else
printf("Set %d now inactive\n", in);
}
void
ipf_frsync(void)
{
int frsyn = 0;
if (opendevice(ipfname, 1) != -2 && ioctl(fd, SIOCFRSYN, &frsyn) == -1)
ipferror(fd, "SIOCFRSYN");
else
printf("filter sync'd\n");
}
void
zerostats(void)
{
ipfobj_t obj;
friostat_t fio;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_IPFSTAT;
obj.ipfo_size = sizeof(fio);
obj.ipfo_ptr = &fio;
obj.ipfo_offset = 0;
if (opendevice(ipfname, 1) != -2) {
if (ioctl(fd, SIOCFRZST, &obj) == -1) {
ipferror(fd, "ioctl(SIOCFRZST)");
exit(-1);
}
showstats(&fio);
}
}
/*
* read the kernel stats for packets blocked and passed
*/
static void
showstats(friostat_t *fp)
{
printf("bad packets:\t\tin %lu\tout %lu\n",
fp->f_st[0].fr_bad, fp->f_st[1].fr_bad);
printf(" input packets:\t\tblocked %lu passed %lu nomatch %lu",
fp->f_st[0].fr_block, fp->f_st[0].fr_pass,
fp->f_st[0].fr_nom);
printf(" counted %lu\n", fp->f_st[0].fr_acct);
printf("output packets:\t\tblocked %lu passed %lu nomatch %lu",
fp->f_st[1].fr_block, fp->f_st[1].fr_pass,
fp->f_st[1].fr_nom);
printf(" counted %lu\n", fp->f_st[0].fr_acct);
printf(" input packets logged:\tblocked %lu passed %lu\n",
fp->f_st[0].fr_bpkl, fp->f_st[0].fr_ppkl);
printf("output packets logged:\tblocked %lu passed %lu\n",
fp->f_st[1].fr_bpkl, fp->f_st[1].fr_ppkl);
}
static int
showversion(void)
{
struct friostat fio;
ipfobj_t ipfo;
u_32_t flags;
char *s;
int vfd;
bzero((caddr_t)&ipfo, sizeof(ipfo));
ipfo.ipfo_rev = IPFILTER_VERSION;
ipfo.ipfo_size = sizeof(fio);
ipfo.ipfo_ptr = (void *)&fio;
ipfo.ipfo_type = IPFOBJ_IPFSTAT;
printf("ipf: %s (%d)\n", IPL_VERSION, (int)sizeof(frentry_t));
if ((vfd = open(ipfname, O_RDONLY)) == -1) {
perror("open device");
return (1);
}
if (ioctl(vfd, SIOCGETFS, &ipfo)) {
ipferror(vfd, "ioctl(SIOCGETFS)");
close(vfd);
return (1);
}
close(vfd);
flags = get_flags();
printf("Kernel: %-*.*s\n", (int)sizeof(fio.f_version),
(int)sizeof(fio.f_version), fio.f_version);
printf("Running: %s\n", (fio.f_running > 0) ? "yes" : "no");
printf("Log Flags: %#x = ", flags);
s = "";
if (flags & FF_LOGPASS) {
printf("pass");
s = ", ";
}
if (flags & FF_LOGBLOCK) {
printf("%sblock", s);
s = ", ";
}
if (flags & FF_LOGNOMATCH) {
printf("%snomatch", s);
s = ", ";
}
if (flags & FF_BLOCKNONIP) {
printf("%snonip", s);
s = ", ";
}
if (!*s)
printf("none set");
putchar('\n');
printf("Default: ");
if (FR_ISPASS(fio.f_defpass))
s = "pass";
else if (FR_ISBLOCK(fio.f_defpass))
s = "block";
else
s = "nomatch -> block";
printf("%s all, Logging: %savailable\n", s, fio.f_logging ? "" : "un");
printf("Active list: %d\n", fio.f_active);
printf("Feature mask: %#x\n", fio.f_features);
return (0);
}
diff --git a/sbin/ipf/ipf/ipfcomp.c b/sbin/ipf/ipf/ipfcomp.c
index cf01838d7966..47094e01ab2f 100644
--- a/sbin/ipf/ipf/ipfcomp.c
+++ b/sbin/ipf/ipf/ipfcomp.c
@@ -1,1355 +1,1354 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ip_fil.c 2.41 6/5/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include "ipf.h"
typedef struct {
int c;
int e;
int n;
int p;
int s;
} mc_t;
static char *portcmp[] = { "*", "==", "!=", "<", ">", "<=", ">=", "**", "***" };
static int count = 0;
int intcmp(const void *, const void *);
static void indent(FILE *, int);
static void printeq(FILE *, char *, int, int, int);
static void printipeq(FILE *, char *, int, int, int);
static void addrule(FILE *, frentry_t *);
static void printhooks(FILE *, int, int, frgroup_t *);
static void emitheader(frgroup_t *, u_int, u_int);
static void emitGroup(int, int, void *, frentry_t *, char *,
u_int, u_int);
static void emittail(void);
static void printCgroup(int, frentry_t *, mc_t *, char *);
#define FRC_IFN 0
#define FRC_V 1
#define FRC_P 2
#define FRC_FL 3
#define FRC_TOS 4
#define FRC_TTL 5
#define FRC_SRC 6
#define FRC_DST 7
#define FRC_TCP 8
#define FRC_SP 9
#define FRC_DP 10
#define FRC_OPT 11
#define FRC_SEC 12
#define FRC_ATH 13
#define FRC_ICT 14
#define FRC_ICC 15
#define FRC_MAX 16
static FILE *cfile = NULL;
/*
* This is called once per filter rule being loaded to emit data structures
* required.
*/
void
printc(frentry_t *fr)
{
u_long *ulp;
char *and;
FILE *fp;
int i;
if (fr->fr_family == 6)
return;
if ((fr->fr_type != FR_T_IPF) && (fr->fr_type != FR_T_NONE))
return;
if ((fr->fr_type == FR_T_IPF) &&
((fr->fr_datype != FRI_NORMAL) || (fr->fr_satype != FRI_NORMAL)))
return;
if (cfile == NULL)
cfile = fopen("ip_rules.c", "w");
if (cfile == NULL)
return;
fp = cfile;
if (count == 0) {
fprintf(fp, "/*\n");
fprintf(fp, "* Copyright (C) 2012 by Darren Reed.\n");
fprintf(fp, "*\n");
fprintf(fp, "* Redistribution and use in source and binary forms are permitted\n");
fprintf(fp, "* provided that this notice is preserved and due credit is given\n");
fprintf(fp, "* to the original author and the contributors.\n");
fprintf(fp, "*/\n\n");
fprintf(fp, "#include <sys/param.h>\n");
fprintf(fp, "#include <sys/types.h>\n");
fprintf(fp, "#include <sys/time.h>\n");
fprintf(fp, "#include <sys/socket.h>\n");
fprintf(fp, "#if (__FreeBSD_version >= 40000)\n");
fprintf(fp, "# if defined(_KERNEL)\n");
fprintf(fp, "# include <sys/libkern.h>\n");
fprintf(fp, "# else\n");
fprintf(fp, "# include <sys/unistd.h>\n");
fprintf(fp, "# endif\n");
fprintf(fp, "#endif\n");
fprintf(fp, "#if (__NetBSD_Version__ >= 399000000)\n");
fprintf(fp, "#else\n");
fprintf(fp, "# if !defined(__FreeBSD__) && !defined(__OpenBSD__) && !defined(__sgi)\n");
fprintf(fp, "# include <sys/systm.h>\n");
fprintf(fp, "# endif\n");
fprintf(fp, "#endif\n");
fprintf(fp, "#include <sys/errno.h>\n");
fprintf(fp, "#include <sys/param.h>\n");
fprintf(fp,
"#if !defined(__SVR4) && !defined(__svr4__) && !defined(__hpux)\n");
fprintf(fp, "# include <sys/mbuf.h>\n");
fprintf(fp, "#endif\n");
fprintf(fp,
"#if defined(__FreeBSD__) && (__FreeBSD_version > 220000)\n");
fprintf(fp, "# include <sys/sockio.h>\n");
fprintf(fp, "#else\n");
fprintf(fp, "# include <sys/ioctl.h>\n");
fprintf(fp, "#endif /* FreeBSD */\n");
fprintf(fp, "#include <net/if.h>\n");
fprintf(fp, "#include <netinet/in.h>\n");
fprintf(fp, "#include <netinet/in_systm.h>\n");
fprintf(fp, "#include <netinet/ip.h>\n");
fprintf(fp, "#include <netinet/tcp.h>\n");
fprintf(fp, "#include \"netinet/ip_compat.h\"\n");
fprintf(fp, "#include \"netinet/ip_fil.h\"\n\n");
fprintf(fp, "#include \"netinet/ip_rules.h\"\n\n");
fprintf(fp, "#ifndef _KERNEL\n");
fprintf(fp, "# include <string.h>\n");
fprintf(fp, "#endif /* _KERNEL */\n");
fprintf(fp, "\n");
fprintf(fp, "#ifdef IPFILTER_COMPILED\n");
fprintf(fp, "\n");
fprintf(fp, "extern ipf_main_softc_t ipfmain;\n");
fprintf(fp, "\n");
}
addrule(fp, fr);
fr->fr_type |= FR_T_BUILTIN;
and = "";
fr->fr_ref = 1;
i = sizeof(*fr);
if (i & -(1 - sizeof(*ulp)))
i += sizeof(u_long);
for (i /= sizeof(u_long), ulp = (u_long *)fr; i > 0; i--) {
fprintf(fp, "%s%#lx", and, *ulp++);
and = ", ";
}
fprintf(fp, "\n};\n");
fr->fr_type &= ~FR_T_BUILTIN;
count++;
fflush(fp);
}
static frgroup_t *groups = NULL;
static void
addrule(FILE *fp, frentry_t *fr)
{
frentry_t *f, **fpp;
frgroup_t *g;
u_long *ulp;
char *ghead;
char *gname;
char *and;
int i;
f = (frentry_t *)malloc(sizeof(*f));
bcopy((char *)fr, (char *)f, sizeof(*fr));
if (fr->fr_ipf) {
f->fr_ipf = (fripf_t *)malloc(sizeof(*f->fr_ipf));
bcopy((char *)fr->fr_ipf, (char *)f->fr_ipf,
sizeof(*fr->fr_ipf));
}
f->fr_next = NULL;
gname = FR_NAME(fr, fr_group);
for (g = groups; g != NULL; g = g->fg_next)
if ((strncmp(g->fg_name, gname, FR_GROUPLEN) == 0) &&
(g->fg_flags == (f->fr_flags & FR_INOUT)))
break;
if (g == NULL) {
g = (frgroup_t *)calloc(1, sizeof(*g));
g->fg_next = groups;
groups = g;
g->fg_head = f;
strncpy(g->fg_name, gname, FR_GROUPLEN);
g->fg_ref = 0;
g->fg_flags = f->fr_flags & FR_INOUT;
}
for (fpp = &g->fg_start; *fpp != NULL; )
fpp = &((*fpp)->fr_next);
*fpp = f;
if (fr->fr_dsize > 0) {
fprintf(fp, "\
static u_long ipf%s_rule_data_%s_%u[] = {\n",
f->fr_flags & FR_INQUE ? "in" : "out",
g->fg_name, g->fg_ref);
and = "";
i = fr->fr_dsize;
ulp = fr->fr_data;
for (i /= sizeof(u_long); i > 0; i--) {
fprintf(fp, "%s%#lx", and, *ulp++);
and = ", ";
}
fprintf(fp, "\n};\n");
}
fprintf(fp, "\nstatic u_long %s_rule_%s_%d[] = {\n",
f->fr_flags & FR_INQUE ? "in" : "out", g->fg_name, g->fg_ref);
g->fg_ref++;
if (f->fr_grhead != -1) {
ghead = FR_NAME(f, fr_grhead);
for (g = groups; g != NULL; g = g->fg_next)
if ((strncmp(g->fg_name, ghead, FR_GROUPLEN) == 0) &&
g->fg_flags == (f->fr_flags & FR_INOUT))
break;
if (g == NULL) {
g = (frgroup_t *)calloc(1, sizeof(*g));
g->fg_next = groups;
groups = g;
g->fg_head = f;
strncpy(g->fg_name, ghead, FR_GROUPLEN);
g->fg_ref = 0;
g->fg_flags = f->fr_flags & FR_INOUT;
}
}
}
int
intcmp(const void *c1, const void *c2)
{
const mc_t *i1 = (const mc_t *)c1, *i2 = (const mc_t *)c2;
if (i1->n == i2->n) {
return (i1->c - i2->c);
}
return (i2->n - i1->n);
}
static void
indent(FILE *fp, int in)
{
for (; in; in--)
fputc('\t', fp);
}
static void
printeq(FILE *fp, char *var, int m, int max, int v)
{
if (m == max)
fprintf(fp, "%s == %#x) {\n", var, v);
else
fprintf(fp, "(%s & %#x) == %#x) {\n", var, m, v);
}
/*
* Parameters: var - IP# being compared
* fl - 0 for positive match, 1 for negative match
* m - netmask
* v - required address
*/
static void
printipeq(FILE *fp, char *var, int fl, int m, int v)
{
if (m == 0xffffffff)
fprintf(fp, "%s ", var);
else
fprintf(fp, "(%s & %#x) ", var, m);
fprintf(fp, "%c", fl ? '!' : '=');
fprintf(fp, "= %#x) {\n", v);
}
void
emit(int num, int dir, void *v, frentry_t *fr)
{
u_int incnt, outcnt;
frgroup_t *g;
frentry_t *f;
for (g = groups; g != NULL; g = g->fg_next) {
if (dir == 0 || dir == -1) {
if ((g->fg_flags & FR_INQUE) == 0)
continue;
for (incnt = 0, f = g->fg_start; f != NULL;
f = f->fr_next)
incnt++;
emitGroup(num, dir, v, fr, g->fg_name, incnt, 0);
}
if (dir == 1 || dir == -1) {
if ((g->fg_flags & FR_OUTQUE) == 0)
continue;
for (outcnt = 0, f = g->fg_start; f != NULL;
f = f->fr_next)
outcnt++;
emitGroup(num, dir, v, fr, g->fg_name, 0, outcnt);
}
}
if (num == -1 && dir == -1) {
for (g = groups; g != NULL; g = g->fg_next) {
if ((g->fg_flags & FR_INQUE) != 0) {
for (incnt = 0, f = g->fg_start; f != NULL;
f = f->fr_next)
incnt++;
if (incnt > 0)
emitheader(g, incnt, 0);
}
if ((g->fg_flags & FR_OUTQUE) != 0) {
for (outcnt = 0, f = g->fg_start; f != NULL;
f = f->fr_next)
outcnt++;
if (outcnt > 0)
emitheader(g, 0, outcnt);
}
}
emittail();
fprintf(cfile, "#endif /* IPFILTER_COMPILED */\n");
}
}
static void
emitheader(frgroup_t *grp, u_int incount, u_int outcount)
{
static FILE *fph = NULL;
frgroup_t *g;
if (fph == NULL) {
fph = fopen("ip_rules.h", "w");
if (fph == NULL)
return;
fprintf(fph, "extern int ipfrule_add(void));\n");
fprintf(fph, "extern int ipfrule_remove(void));\n");
}
printhooks(cfile, incount, outcount, grp);
if (incount) {
fprintf(fph, "\n\
extern frentry_t *ipfrule_match_in_%s(fr_info_t *, u_32_t *));\n\
extern frentry_t *ipf_rules_in_%s[%d];\n",
grp->fg_name, grp->fg_name, incount);
for (g = groups; g != grp; g = g->fg_next)
if ((strncmp(g->fg_name, grp->fg_name,
FR_GROUPLEN) == 0) &&
g->fg_flags == grp->fg_flags)
break;
if (g == grp) {
fprintf(fph, "\n\
extern int ipfrule_add_in_%s(void));\n\
extern int ipfrule_remove_in_%s(void));\n", grp->fg_name, grp->fg_name);
}
}
if (outcount) {
fprintf(fph, "\n\
extern frentry_t *ipfrule_match_out_%s(fr_info_t *, u_32_t *));\n\
extern frentry_t *ipf_rules_out_%s[%d];\n",
grp->fg_name, grp->fg_name, outcount);
for (g = groups; g != grp; g = g->fg_next)
if ((strncmp(g->fg_name, grp->fg_name,
FR_GROUPLEN) == 0) &&
g->fg_flags == grp->fg_flags)
break;
if (g == grp) {
fprintf(fph, "\n\
extern int ipfrule_add_out_%s(void));\n\
extern int ipfrule_remove_out_%s(void));\n",
grp->fg_name, grp->fg_name);
}
}
}
static void
emittail(void)
{
frgroup_t *g;
fprintf(cfile, "\n\
int ipfrule_add()\n\
{\n\
int err;\n\
\n");
for (g = groups; g != NULL; g = g->fg_next)
fprintf(cfile, "\
err = ipfrule_add_%s_%s();\n\
if (err != 0)\n\
return (err);\n",
(g->fg_flags & FR_INQUE) ? "in" : "out", g->fg_name);
fprintf(cfile, "\
return (0);\n");
fprintf(cfile, "}\n\
\n");
fprintf(cfile, "\n\
int ipfrule_remove()\n\
{\n\
int err;\n\
\n");
for (g = groups; g != NULL; g = g->fg_next)
fprintf(cfile, "\
err = ipfrule_remove_%s_%s();\n\
if (err != 0)\n\
return (err);\n",
(g->fg_flags & FR_INQUE) ? "in" : "out", g->fg_name);
fprintf(cfile, "\
return (0);\n");
fprintf(cfile, "}\n");
}
static void
emitGroup(int num, int dir, void *v, frentry_t *fr, char *group,
u_int incount, u_int outcount)
{
static FILE *fp = NULL;
static int header[2] = { 0, 0 };
static char egroup[FR_GROUPLEN] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
static int openfunc = 0;
static mc_t *n = NULL;
static int sin = 0;
frentry_t *f;
frgroup_t *g;
fripf_t *ipf;
int i, in, j;
mc_t *m = v;
if (fp == NULL)
fp = cfile;
if (fp == NULL)
return;
if (strncmp(egroup, group, FR_GROUPLEN)) {
for (sin--; sin > 0; sin--) {
indent(fp, sin);
fprintf(fp, "}\n");
}
if (openfunc == 1) {
fprintf(fp, "\treturn (fr);\n}\n");
openfunc = 0;
if (n != NULL) {
free(n);
n = NULL;
}
}
sin = 0;
header[0] = 0;
header[1] = 0;
strncpy(egroup, group, FR_GROUPLEN);
} else if (openfunc == 1 && num < 0) {
if (n != NULL) {
free(n);
n = NULL;
}
for (sin--; sin > 0; sin--) {
indent(fp, sin);
fprintf(fp, "}\n");
}
if (openfunc == 1) {
fprintf(fp, "\treturn (fr);\n}\n");
openfunc = 0;
}
}
if (dir == -1)
return;
for (g = groups; g != NULL; g = g->fg_next) {
if (dir == 0 && (g->fg_flags & FR_INQUE) == 0)
continue;
else if (dir == 1 && (g->fg_flags & FR_OUTQUE) == 0)
continue;
if (strncmp(g->fg_name, group, FR_GROUPLEN) != 0)
continue;
break;
}
/*
* Output the array of pointers to rules for this group.
*/
if (g != NULL && num == -2 && dir == 0 && header[0] == 0 &&
incount != 0) {
fprintf(fp, "\nfrentry_t *ipf_rules_in_%s[%d] = {",
group, incount);
for (f = g->fg_start, i = 0; f != NULL; f = f->fr_next) {
if ((f->fr_flags & FR_INQUE) == 0)
continue;
if ((i & 1) == 0) {
fprintf(fp, "\n\t");
}
fprintf(fp, "(frentry_t *)&in_rule_%s_%d",
FR_NAME(f, fr_group), i);
if (i + 1 < incount)
fprintf(fp, ", ");
i++;
}
fprintf(fp, "\n};\n");
}
if (g != NULL && num == -2 && dir == 1 && header[0] == 0 &&
outcount != 0) {
fprintf(fp, "\nfrentry_t *ipf_rules_out_%s[%d] = {",
group, outcount);
for (f = g->fg_start, i = 0; f != NULL; f = f->fr_next) {
if ((f->fr_flags & FR_OUTQUE) == 0)
continue;
if ((i & 1) == 0) {
fprintf(fp, "\n\t");
}
fprintf(fp, "(frentry_t *)&out_rule_%s_%d",
FR_NAME(f, fr_group), i);
if (i + 1 < outcount)
fprintf(fp, ", ");
i++;
}
fprintf(fp, "\n};\n");
fp = NULL;
}
if (num < 0)
return;
in = 0;
ipf = fr->fr_ipf;
/*
* If the function header has not been printed then print it now.
*/
if (g != NULL && header[dir] == 0) {
int pdst = 0, psrc = 0;
openfunc = 1;
fprintf(fp, "\nfrentry_t *ipfrule_match_%s_%s(fin, passp)\n",
(dir == 0) ? "in" : "out", group);
fprintf(fp, "fr_info_t *fin;\n");
fprintf(fp, "u_32_t *passp;\n");
fprintf(fp, "{\n");
fprintf(fp, "\tfrentry_t *fr = NULL;\n");
/*
* Print out any variables that need to be declared.
*/
for (f = g->fg_start, i = 0; f != NULL; f = f->fr_next) {
if (incount + outcount > m[FRC_SRC].e + 1)
psrc = 1;
if (incount + outcount > m[FRC_DST].e + 1)
pdst = 1;
}
if (psrc == 1)
fprintf(fp, "\tu_32_t src = ntohl(%s);\n",
"fin->fin_fi.fi_saddr");
if (pdst == 1)
fprintf(fp, "\tu_32_t dst = ntohl(%s);\n",
"fin->fin_fi.fi_daddr");
}
for (i = 0; i < FRC_MAX; i++) {
switch(m[i].c)
{
case FRC_IFN :
if (fr->fr_ifnames[0] != -1)
m[i].s = 1;
break;
case FRC_V :
if (ipf != NULL && ipf->fri_mip.fi_v != 0)
m[i].s = 1;
break;
case FRC_FL :
if (ipf != NULL && ipf->fri_mip.fi_flx != 0)
m[i].s = 1;
break;
case FRC_P :
if (ipf != NULL && ipf->fri_mip.fi_p != 0)
m[i].s = 1;
break;
case FRC_TTL :
if (ipf != NULL && ipf->fri_mip.fi_ttl != 0)
m[i].s = 1;
break;
case FRC_TOS :
if (ipf != NULL && ipf->fri_mip.fi_tos != 0)
m[i].s = 1;
break;
case FRC_TCP :
if (ipf == NULL)
break;
if ((ipf->fri_ip.fi_p == IPPROTO_TCP) &&
fr->fr_tcpfm != 0)
m[i].s = 1;
break;
case FRC_SP :
if (ipf == NULL)
break;
if (fr->fr_scmp == FR_INRANGE)
m[i].s = 1;
else if (fr->fr_scmp == FR_OUTRANGE)
m[i].s = 1;
else if (fr->fr_scmp != 0)
m[i].s = 1;
break;
case FRC_DP :
if (ipf == NULL)
break;
if (fr->fr_dcmp == FR_INRANGE)
m[i].s = 1;
else if (fr->fr_dcmp == FR_OUTRANGE)
m[i].s = 1;
else if (fr->fr_dcmp != 0)
m[i].s = 1;
break;
case FRC_SRC :
if (ipf == NULL)
break;
if (fr->fr_satype == FRI_LOOKUP) {
;
} else if ((fr->fr_smask != 0) ||
(fr->fr_flags & FR_NOTSRCIP) != 0)
m[i].s = 1;
break;
case FRC_DST :
if (ipf == NULL)
break;
if (fr->fr_datype == FRI_LOOKUP) {
;
} else if ((fr->fr_dmask != 0) ||
(fr->fr_flags & FR_NOTDSTIP) != 0)
m[i].s = 1;
break;
case FRC_OPT :
if (ipf == NULL)
break;
if (fr->fr_optmask != 0)
m[i].s = 1;
break;
case FRC_SEC :
if (ipf == NULL)
break;
if (fr->fr_secmask != 0)
m[i].s = 1;
break;
case FRC_ATH :
if (ipf == NULL)
break;
if (fr->fr_authmask != 0)
m[i].s = 1;
break;
case FRC_ICT :
if (ipf == NULL)
break;
if ((fr->fr_icmpm & 0xff00) != 0)
m[i].s = 1;
break;
case FRC_ICC :
if (ipf == NULL)
break;
if ((fr->fr_icmpm & 0xff) != 0)
m[i].s = 1;
break;
}
}
if (!header[dir]) {
fprintf(fp, "\n");
header[dir] = 1;
sin = 0;
}
qsort(m, FRC_MAX, sizeof(mc_t), intcmp);
if (n) {
/*
* Calculate the indentation interval upto the last common
* common comparison being made.
*/
for (i = 0, in = 1; i < FRC_MAX; i++) {
if (n[i].c != m[i].c)
break;
if (n[i].s != m[i].s)
break;
if (n[i].s) {
if (n[i].n && (n[i].n > n[i].e)) {
m[i].p++;
in += m[i].p;
break;
}
if (n[i].e > 0) {
in++;
} else
break;
}
}
if (sin != in) {
for (j = sin - 1; j >= in; j--) {
indent(fp, j);
fprintf(fp, "}\n");
}
}
} else {
in = 1;
i = 0;
}
/*
* print out C code that implements a filter rule.
*/
for (; i < FRC_MAX; i++) {
switch(m[i].c)
{
case FRC_IFN :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (fin->fin_ifp == ");
fprintf(fp, "ipf_rules_%s_%s[%d]->fr_ifa) {\n",
dir ? "out" : "in", group, num);
in++;
}
break;
case FRC_V :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (fin->fin_v == %d) {\n",
ipf->fri_ip.fi_v);
in++;
}
break;
case FRC_FL :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_flx",
ipf->fri_mip.fi_flx, 0xf,
ipf->fri_ip.fi_flx);
in++;
}
break;
case FRC_P :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (fin->fin_p == %d) {\n",
ipf->fri_ip.fi_p);
in++;
}
break;
case FRC_TTL :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_ttl",
ipf->fri_mip.fi_ttl, 0xff,
ipf->fri_ip.fi_ttl);
in++;
}
break;
case FRC_TOS :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (fin->fin_tos");
printeq(fp, "fin->fin_tos",
ipf->fri_mip.fi_tos, 0xff,
ipf->fri_ip.fi_tos);
in++;
}
break;
case FRC_TCP :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_tcpf", fr->fr_tcpfm,
0xff, fr->fr_tcpf);
in++;
}
break;
case FRC_SP :
if (!m[i].s)
break;
if (fr->fr_scmp == FR_INRANGE) {
indent(fp, in);
fprintf(fp, "if ((fin->fin_data[0] > %d) && ",
fr->fr_sport);
fprintf(fp, "(fin->fin_data[0] < %d)",
fr->fr_stop);
fprintf(fp, ") {\n");
in++;
} else if (fr->fr_scmp == FR_OUTRANGE) {
indent(fp, in);
fprintf(fp, "if ((fin->fin_data[0] < %d) || ",
fr->fr_sport);
fprintf(fp, "(fin->fin_data[0] > %d)",
fr->fr_stop);
fprintf(fp, ") {\n");
in++;
} else if (fr->fr_scmp) {
indent(fp, in);
fprintf(fp, "if (fin->fin_data[0] %s %d)",
portcmp[fr->fr_scmp], fr->fr_sport);
fprintf(fp, " {\n");
in++;
}
break;
case FRC_DP :
if (!m[i].s)
break;
if (fr->fr_dcmp == FR_INRANGE) {
indent(fp, in);
fprintf(fp, "if ((fin->fin_data[1] > %d) && ",
fr->fr_dport);
fprintf(fp, "(fin->fin_data[1] < %d)",
fr->fr_dtop);
fprintf(fp, ") {\n");
in++;
} else if (fr->fr_dcmp == FR_OUTRANGE) {
indent(fp, in);
fprintf(fp, "if ((fin->fin_data[1] < %d) || ",
fr->fr_dport);
fprintf(fp, "(fin->fin_data[1] > %d)",
fr->fr_dtop);
fprintf(fp, ") {\n");
in++;
} else if (fr->fr_dcmp) {
indent(fp, in);
fprintf(fp, "if (fin->fin_data[1] %s %d)",
portcmp[fr->fr_dcmp], fr->fr_dport);
fprintf(fp, " {\n");
in++;
}
break;
case FRC_SRC :
if (!m[i].s)
break;
if (fr->fr_satype == FRI_LOOKUP) {
;
} else if ((fr->fr_smask != 0) ||
(fr->fr_flags & FR_NOTSRCIP) != 0) {
indent(fp, in);
fprintf(fp, "if (");
printipeq(fp, "src",
fr->fr_flags & FR_NOTSRCIP,
fr->fr_smask, fr->fr_saddr);
in++;
}
break;
case FRC_DST :
if (!m[i].s)
break;
if (fr->fr_datype == FRI_LOOKUP) {
;
} else if ((fr->fr_dmask != 0) ||
(fr->fr_flags & FR_NOTDSTIP) != 0) {
indent(fp, in);
fprintf(fp, "if (");
printipeq(fp, "dst",
fr->fr_flags & FR_NOTDSTIP,
fr->fr_dmask, fr->fr_daddr);
in++;
}
break;
case FRC_OPT :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_fi.fi_optmsk",
fr->fr_optmask, 0xffffffff,
fr->fr_optbits);
in++;
}
break;
case FRC_SEC :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_fi.fi_secmsk",
fr->fr_secmask, 0xffff,
fr->fr_secbits);
in++;
}
break;
case FRC_ATH :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_fi.fi_authmsk",
fr->fr_authmask, 0xffff,
fr->fr_authbits);
in++;
}
break;
case FRC_ICT :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_data[0]",
fr->fr_icmpm & 0xff00, 0xffff,
fr->fr_icmp & 0xff00);
in++;
}
break;
case FRC_ICC :
if (m[i].s) {
indent(fp, in);
fprintf(fp, "if (");
printeq(fp, "fin->fin_data[0]",
fr->fr_icmpm & 0xff, 0xffff,
fr->fr_icmp & 0xff);
in++;
}
break;
}
}
indent(fp, in);
if (fr->fr_flags & FR_QUICK) {
fprintf(fp, "return ((frentry_t *)&%s_rule_%s_%d);\n",
fr->fr_flags & FR_INQUE ? "in" : "out",
FR_NAME(fr, fr_group), num);
} else {
fprintf(fp, "fr = (frentry_t *)&%s_rule_%s_%d;\n",
fr->fr_flags & FR_INQUE ? "in" : "out",
FR_NAME(fr, fr_group), num);
}
if (n == NULL)
n = (mc_t *)malloc(sizeof(*n) * FRC_MAX);
bcopy((char *)m, (char *)n, sizeof(*n) * FRC_MAX);
sin = in;
}
void
printC(int dir)
{
static mc_t *m = NULL;
frgroup_t *g;
if (m == NULL)
m = (mc_t *)calloc(FRC_MAX, sizeof(*m));
for (g = groups; g != NULL; g = g->fg_next) {
if ((dir == 0) && ((g->fg_flags & FR_INQUE) != 0))
printCgroup(dir, g->fg_start, m, g->fg_name);
if ((dir == 1) && ((g->fg_flags & FR_OUTQUE) != 0))
printCgroup(dir, g->fg_start, m, g->fg_name);
}
emit(-1, dir, m, NULL);
}
/*
* Now print out code to implement all of the rules.
*/
static void
printCgroup(int dir, frentry_t *top, mc_t *m, char *group)
{
frentry_t *fr, *fr1;
int i, n, rn;
u_int count;
for (count = 0, fr1 = top; fr1 != NULL; fr1 = fr1->fr_next) {
if ((dir == 0) && ((fr1->fr_flags & FR_INQUE) != 0))
count++;
else if ((dir == 1) && ((fr1->fr_flags & FR_OUTQUE) != 0))
count++;
}
if (dir == 0)
emitGroup(-2, dir, m, fr1, group, count, 0);
else if (dir == 1)
emitGroup(-2, dir, m, fr1, group, 0, count);
/*
* Before printing each rule, check to see how many of its fields are
* matched by subsequent rules.
*/
for (fr1 = top, rn = 0; fr1 != NULL; fr1 = fr1->fr_next, rn++) {
if (!dir && !(fr1->fr_flags & FR_INQUE))
continue;
if (dir && !(fr1->fr_flags & FR_OUTQUE))
continue;
n = 0xfffffff;
for (i = 0; i < FRC_MAX; i++)
m[i].e = 0;
qsort(m, FRC_MAX, sizeof(mc_t), intcmp);
for (i = 0; i < FRC_MAX; i++) {
m[i].c = i;
m[i].e = 0;
m[i].n = 0;
m[i].s = 0;
}
for (fr = fr1->fr_next; fr; fr = fr->fr_next) {
if (!dir && !(fr->fr_flags & FR_INQUE))
continue;
if (dir && !(fr->fr_flags & FR_OUTQUE))
continue;
if ((n & 0x0001) &&
!strcmp(fr1->fr_names + fr1->fr_ifnames[0],
fr->fr_names + fr->fr_ifnames[0])) {
m[FRC_IFN].e++;
m[FRC_IFN].n++;
} else
n &= ~0x0001;
if ((n & 0x0002) && (fr1->fr_family == fr->fr_family)) {
m[FRC_V].e++;
m[FRC_V].n++;
} else
n &= ~0x0002;
if ((n & 0x0004) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_mip.fi_flx == fr->fr_mip.fi_flx) &&
(fr1->fr_ip.fi_flx == fr->fr_ip.fi_flx)) {
m[FRC_FL].e++;
m[FRC_FL].n++;
} else
n &= ~0x0004;
if ((n & 0x0008) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_proto == fr->fr_proto)) {
m[FRC_P].e++;
m[FRC_P].n++;
} else
n &= ~0x0008;
if ((n & 0x0010) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_ttl == fr->fr_ttl)) {
m[FRC_TTL].e++;
m[FRC_TTL].n++;
} else
n &= ~0x0010;
if ((n & 0x0020) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_tos == fr->fr_tos)) {
m[FRC_TOS].e++;
m[FRC_TOS].n++;
} else
n &= ~0x0020;
if ((n & 0x0040) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_tcpfm == fr->fr_tcpfm) &&
(fr1->fr_tcpf == fr->fr_tcpf))) {
m[FRC_TCP].e++;
m[FRC_TCP].n++;
} else
n &= ~0x0040;
if ((n & 0x0080) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_scmp == fr->fr_scmp) &&
(fr1->fr_stop == fr->fr_stop) &&
(fr1->fr_sport == fr->fr_sport))) {
m[FRC_SP].e++;
m[FRC_SP].n++;
} else
n &= ~0x0080;
if ((n & 0x0100) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_dcmp == fr->fr_dcmp) &&
(fr1->fr_dtop == fr->fr_dtop) &&
(fr1->fr_dport == fr->fr_dport))) {
m[FRC_DP].e++;
m[FRC_DP].n++;
} else
n &= ~0x0100;
if ((n & 0x0200) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_satype == FRI_LOOKUP) &&
(fr->fr_satype == FRI_LOOKUP) &&
(fr1->fr_srcnum == fr->fr_srcnum))) {
m[FRC_SRC].e++;
m[FRC_SRC].n++;
} else if ((n & 0x0200) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(((fr1->fr_flags & FR_NOTSRCIP) ==
(fr->fr_flags & FR_NOTSRCIP)))) {
if ((fr1->fr_smask == fr->fr_smask) &&
(fr1->fr_saddr == fr->fr_saddr))
m[FRC_SRC].e++;
else
n &= ~0x0200;
if (fr1->fr_smask &&
(fr1->fr_saddr & fr1->fr_smask) ==
(fr->fr_saddr & fr1->fr_smask)) {
m[FRC_SRC].n++;
n |= 0x0200;
}
} else {
n &= ~0x0200;
}
if ((n & 0x0400) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_datype == FRI_LOOKUP) &&
(fr->fr_datype == FRI_LOOKUP) &&
(fr1->fr_dstnum == fr->fr_dstnum))) {
m[FRC_DST].e++;
m[FRC_DST].n++;
} else if ((n & 0x0400) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(((fr1->fr_flags & FR_NOTDSTIP) ==
(fr->fr_flags & FR_NOTDSTIP)))) {
if ((fr1->fr_dmask == fr->fr_dmask) &&
(fr1->fr_daddr == fr->fr_daddr))
m[FRC_DST].e++;
else
n &= ~0x0400;
if (fr1->fr_dmask &&
(fr1->fr_daddr & fr1->fr_dmask) ==
(fr->fr_daddr & fr1->fr_dmask)) {
m[FRC_DST].n++;
n |= 0x0400;
}
} else {
n &= ~0x0400;
}
if ((n & 0x0800) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_optmask == fr->fr_optmask) &&
(fr1->fr_optbits == fr->fr_optbits)) {
m[FRC_OPT].e++;
m[FRC_OPT].n++;
} else
n &= ~0x0800;
if ((n & 0x1000) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_secmask == fr->fr_secmask) &&
(fr1->fr_secbits == fr->fr_secbits)) {
m[FRC_SEC].e++;
m[FRC_SEC].n++;
} else
n &= ~0x1000;
if ((n & 0x10000) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
(fr1->fr_authmask == fr->fr_authmask) &&
(fr1->fr_authbits == fr->fr_authbits)) {
m[FRC_ATH].e++;
m[FRC_ATH].n++;
} else
n &= ~0x10000;
if ((n & 0x20000) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_icmpm & 0xff00) ==
(fr->fr_icmpm & 0xff00)) &&
((fr1->fr_icmp & 0xff00) ==
(fr->fr_icmp & 0xff00))) {
m[FRC_ICT].e++;
m[FRC_ICT].n++;
} else
n &= ~0x20000;
if ((n & 0x40000) &&
(fr->fr_type == fr1->fr_type) &&
(fr->fr_type == FR_T_IPF) &&
((fr1->fr_icmpm & 0xff) == (fr->fr_icmpm & 0xff)) &&
((fr1->fr_icmp & 0xff) == (fr->fr_icmp & 0xff))) {
m[FRC_ICC].e++;
m[FRC_ICC].n++;
} else
n &= ~0x40000;
}
/*msort(m);*/
if (dir == 0)
emitGroup(rn, dir, m, fr1, group, count, 0);
else if (dir == 1)
emitGroup(rn, dir, m, fr1, group, 0, count);
}
}
static void
printhooks(FILE *fp, int in, int out, frgroup_t *grp)
{
frentry_t *fr;
char *group;
int dogrp, i;
char *instr;
group = grp->fg_name;
dogrp = 0;
if (in && out) {
fprintf(stderr,
"printhooks called with both in and out set\n");
exit(1);
}
if (in) {
instr = "in";
} else if (out) {
instr = "out";
} else {
instr = "???";
}
fprintf(fp, "static frentry_t ipfrule_%s_%s;\n", instr, group);
fprintf(fp, "\
\n\
int ipfrule_add_%s_%s()\n", instr, group);
fprintf(fp, "\
{\n\
int i, j, err = 0, max;\n\
frentry_t *fp;\n");
if (dogrp)
fprintf(fp, "\
frgroup_t *fg;\n");
fprintf(fp, "\n");
for (i = 0, fr = grp->fg_start; fr != NULL; i++, fr = fr->fr_next)
if (fr->fr_dsize > 0) {
fprintf(fp, "\
ipf_rules_%s_%s[%d]->fr_data = &ipf%s_rule_data_%s_%u;\n",
instr, grp->fg_name, i,
instr, grp->fg_name, i);
}
fprintf(fp, "\
max = sizeof(ipf_rules_%s_%s)/sizeof(frentry_t *);\n\
for (i = 0; i < max; i++) {\n\
fp = ipf_rules_%s_%s[i];\n\
fp->fr_next = NULL;\n", instr, group, instr, group);
fprintf(fp, "\
for (j = i + 1; j < max; j++)\n\
if (strncmp(fp->fr_names + fp->fr_group,\n\
ipf_rules_%s_%s[j]->fr_names +\n\
ipf_rules_%s_%s[j]->fr_group,\n\
FR_GROUPLEN) == 0) {\n\
if (ipf_rules_%s_%s[j] != NULL)\n\
ipf_rules_%s_%s[j]->fr_pnext =\n\
&fp->fr_next;\n\
fp->fr_pnext = &ipf_rules_%s_%s[j];\n\
fp->fr_next = ipf_rules_%s_%s[j];\n\
break;\n\
}\n", instr, group, instr, group, instr, group,
instr, group, instr, group, instr, group);
if (dogrp)
fprintf(fp, "\
\n\
if (fp->fr_grhead != -1) {\n\
fg = fr_addgroup(fp->fr_names + fp->fr_grhead,\n\
fp, FR_INQUE, IPL_LOGIPF, 0);\n\
if (fg != NULL)\n\
fp->fr_grp = &fg->fg_start;\n\
}\n");
fprintf(fp, "\
}\n\
\n\
fp = &ipfrule_%s_%s;\n", instr, group);
fprintf(fp, "\
bzero((char *)fp, sizeof(*fp));\n\
fp->fr_type = FR_T_CALLFUNC_BUILTIN;\n\
fp->fr_flags = FR_%sQUE|FR_NOMATCH;\n\
fp->fr_data = (void *)ipf_rules_%s_%s[0];\n",
(in != 0) ? "IN" : "OUT", instr, group);
fprintf(fp, "\
fp->fr_dsize = sizeof(ipf_rules_%s_%s[0]);\n",
instr, group);
fprintf(fp, "\
fp->fr_family = AF_INET;\n\
fp->fr_func = (ipfunc_t)ipfrule_match_%s_%s;\n\
err = frrequest(&ipfmain, IPL_LOGIPF, SIOCADDFR, (caddr_t)fp,\n\
ipfmain.ipf_active, 0);\n",
instr, group);
fprintf(fp, "\treturn (err);\n}\n");
fprintf(fp, "\n\n\
int ipfrule_remove_%s_%s()\n", instr, group);
fprintf(fp, "\
{\n\
int err = 0, i;\n\
frentry_t *fp;\n\
\n\
/*\n\
* Try to remove the %sbound rule.\n", instr);
fprintf(fp, "\
*/\n\
if (ipfrule_%s_%s.fr_ref > 0) {\n", instr, group);
fprintf(fp, "\
err = EBUSY;\n\
} else {\n");
fprintf(fp, "\
i = sizeof(ipf_rules_%s_%s)/sizeof(frentry_t *) - 1;\n\
for (; i >= 0; i--) {\n\
fp = ipf_rules_%s_%s[i];\n\
if (fp->fr_ref > 1) {\n\
err = EBUSY;\n\
break;\n\
}\n\
}\n\
}\n\
if (err == 0)\n\
err = frrequest(&ipfmain, IPL_LOGIPF, SIOCDELFR,\n\
(caddr_t)&ipfrule_%s_%s,\n\
ipfmain.ipf_active, 0);\n",
instr, group, instr, group, instr, group);
fprintf(fp, "\
if (err)\n\
return (err);\n\
\n\n");
fprintf(fp, "\treturn (err);\n}\n");
}
diff --git a/sbin/ipf/ipfs/ipfs.c b/sbin/ipf/ipfs/ipfs.c
index 3f1202894fad..bb342cbb9319 100644
--- a/sbin/ipf/ipfs/ipfs.c
+++ b/sbin/ipf/ipfs/ipfs.c
@@ -1,855 +1,854 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <errno.h>
#if !defined(__SVR4) && !defined(__GNUC__)
#include <strings.h>
#endif
#include <sys/types.h>
#include <sys/param.h>
#include <sys/file.h>
#include <stdlib.h>
#include <stddef.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <sys/time.h>
#include <net/if.h>
#include <netinet/ip.h>
#include <netdb.h>
#include <arpa/nameser.h>
#include <resolv.h>
#include "ipf.h"
#include "netinet/ipl.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
#ifndef IPF_SAVEDIR
# define IPF_SAVEDIR "/var/db/ipf"
#endif
#ifndef IPF_NATFILE
# define IPF_NATFILE "ipnat.ipf"
#endif
#ifndef IPF_STATEFILE
# define IPF_STATEFILE "ipstate.ipf"
#endif
#if !defined(__SVR4) && defined(__GNUC__)
extern char *index(const char *, int);
#endif
extern char *optarg;
extern int optind;
int main(int, char *[]);
void usage(void);
int changestateif(char *, char *);
int changenatif(char *, char *);
int readstate(int, char *);
int readnat(int, char *);
int writestate(int, char *);
int opendevice(char *);
void closedevice(int);
int setlock(int, int);
int writeall(char *);
int readall(char *);
int writenat(int, char *);
int opts = 0;
char *progname;
void usage()
{
fprintf(stderr, "usage: %s [-nv] -l\n", progname);
fprintf(stderr, "usage: %s [-nv] -u\n", progname);
fprintf(stderr, "usage: %s [-nv] [-d <dir>] -R\n", progname);
fprintf(stderr, "usage: %s [-nv] [-d <dir>] -W\n", progname);
fprintf(stderr, "usage: %s [-nNSv] [-f <file>] -r\n", progname);
fprintf(stderr, "usage: %s [-nNSv] [-f <file>] -w\n", progname);
fprintf(stderr, "usage: %s [-nNSv] -f <filename> -i <if1>,<if2>\n",
progname);
exit(1);
}
/*
* Change interface names in state information saved out to disk.
*/
int changestateif(char *ifs, char *fname)
{
int fd, olen, nlen, rw;
ipstate_save_t ips;
off_t pos;
char *s;
s = strchr(ifs, ',');
if (!s)
usage();
*s++ = '\0';
nlen = strlen(s);
olen = strlen(ifs);
if (nlen >= sizeof(ips.ips_is.is_ifname) ||
olen >= sizeof(ips.ips_is.is_ifname))
usage();
fd = open(fname, O_RDWR);
if (fd == -1) {
perror("open");
exit(1);
}
for (pos = 0; read(fd, &ips, sizeof(ips)) == sizeof(ips); ) {
rw = 0;
if (!strncmp(ips.ips_is.is_ifname[0], ifs, olen + 1)) {
strcpy(ips.ips_is.is_ifname[0], s);
rw = 1;
}
if (!strncmp(ips.ips_is.is_ifname[1], ifs, olen + 1)) {
strcpy(ips.ips_is.is_ifname[1], s);
rw = 1;
}
if (!strncmp(ips.ips_is.is_ifname[2], ifs, olen + 1)) {
strcpy(ips.ips_is.is_ifname[2], s);
rw = 1;
}
if (!strncmp(ips.ips_is.is_ifname[3], ifs, olen + 1)) {
strcpy(ips.ips_is.is_ifname[3], s);
rw = 1;
}
if (rw == 1) {
if (lseek(fd, pos, SEEK_SET) != pos) {
perror("lseek");
exit(1);
}
if (write(fd, &ips, sizeof(ips)) != sizeof(ips)) {
perror("write");
exit(1);
}
}
pos = lseek(fd, 0, SEEK_CUR);
}
close(fd);
return (0);
}
/*
* Change interface names in NAT information saved out to disk.
*/
int changenatif(char *ifs, char *fname)
{
int fd, olen, nlen, rw;
nat_save_t ipn;
nat_t *nat;
off_t pos;
char *s;
s = strchr(ifs, ',');
if (!s)
usage();
*s++ = '\0';
nlen = strlen(s);
olen = strlen(ifs);
nat = &ipn.ipn_nat;
if (nlen >= sizeof(nat->nat_ifnames[0]) ||
olen >= sizeof(nat->nat_ifnames[0]))
usage();
fd = open(fname, O_RDWR);
if (fd == -1) {
perror("open");
exit(1);
}
for (pos = 0; read(fd, &ipn, sizeof(ipn)) == sizeof(ipn); ) {
rw = 0;
if (!strncmp(nat->nat_ifnames[0], ifs, olen + 1)) {
strcpy(nat->nat_ifnames[0], s);
rw = 1;
}
if (!strncmp(nat->nat_ifnames[1], ifs, olen + 1)) {
strcpy(nat->nat_ifnames[1], s);
rw = 1;
}
if (rw == 1) {
if (lseek(fd, pos, SEEK_SET) != pos) {
perror("lseek");
exit(1);
}
if (write(fd, &ipn, sizeof(ipn)) != sizeof(ipn)) {
perror("write");
exit(1);
}
}
pos = lseek(fd, 0, SEEK_CUR);
}
close(fd);
return (0);
}
int main(int argc, char *argv[])
{
int c, lock = -1, devfd = -1, err = 0, rw = -1, ns = -1, set = 0;
char *dirname = NULL, *filename = NULL, *ifs = NULL;
progname = argv[0];
while ((c = getopt(argc, argv, "d:f:i:lNnSRruvWw")) != -1)
switch (c)
{
case 'd' :
if ((set == 0) && !dirname && !filename)
dirname = optarg;
else
usage();
break;
case 'f' :
if ((set != 0) && !dirname && !filename)
filename = optarg;
else
usage();
break;
case 'i' :
ifs = optarg;
set = 1;
break;
case 'l' :
if (filename || dirname || set)
usage();
lock = 1;
set = 1;
break;
case 'n' :
opts |= OPT_DONOTHING;
break;
case 'N' :
if ((ns >= 0) || dirname || (rw != -1) || set)
usage();
ns = 0;
set = 1;
break;
case 'r' :
if (dirname || (rw != -1) || (ns == -1))
usage();
rw = 0;
set = 1;
break;
case 'R' :
rw = 2;
set = 1;
break;
case 'S' :
if ((ns >= 0) || dirname || (rw != -1) || set)
usage();
ns = 1;
set = 1;
break;
case 'u' :
if (filename || dirname || set)
usage();
lock = 0;
set = 1;
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
case 'w' :
if (dirname || (rw != -1) || (ns == -1))
usage();
rw = 1;
set = 1;
break;
case 'W' :
rw = 3;
set = 1;
break;
case '?' :
default :
usage();
}
if (ifs) {
if (!filename || ns < 0)
usage();
if (ns == 0)
return (changenatif(ifs, filename));
else
return (changestateif(ifs, filename));
}
if ((ns >= 0) || (lock >= 0)) {
if (lock >= 0)
devfd = opendevice(NULL);
else if (ns >= 0) {
if (ns == 1)
devfd = opendevice(IPSTATE_NAME);
else if (ns == 0)
devfd = opendevice(IPNAT_NAME);
}
if (devfd == -1)
exit(1);
}
if (lock >= 0)
err = setlock(devfd, lock);
else if (rw >= 0) {
if (rw & 1) { /* WRITE */
if (rw & 2)
err = writeall(dirname);
else {
if (ns == 0)
err = writenat(devfd, filename);
else if (ns == 1)
err = writestate(devfd, filename);
}
} else {
if (rw & 2)
err = readall(dirname);
else {
if (ns == 0)
err = readnat(devfd, filename);
else if (ns == 1)
err = readstate(devfd, filename);
}
}
}
return (err);
}
int opendevice(char *ipfdev)
{
int fd = -1;
if (opts & OPT_DONOTHING)
return (-2);
if (!ipfdev)
ipfdev = IPL_NAME;
if ((fd = open(ipfdev, O_RDWR)) == -1)
if ((fd = open(ipfdev, O_RDONLY)) == -1)
perror("open device");
return (fd);
}
void closedevice(int fd)
{
close(fd);
}
int setlock(int fd, int lock)
{
if (opts & OPT_VERBOSE)
printf("Turn lock %s\n", lock ? "on" : "off");
if (!(opts & OPT_DONOTHING)) {
if (ioctl(fd, SIOCSTLCK, &lock) == -1) {
perror("SIOCSTLCK");
return (1);
}
if (opts & OPT_VERBOSE)
printf("Lock now %s\n", lock ? "on" : "off");
}
return (0);
}
int writestate(int fd, char *file)
{
ipstate_save_t ips, *ipsp;
ipfobj_t obj;
int wfd = -1;
if (!file)
file = IPF_STATEFILE;
wfd = open(file, O_WRONLY|O_TRUNC|O_CREAT, 0600);
if (wfd == -1) {
fprintf(stderr, "%s ", file);
perror("state:open");
return (1);
}
ipsp = &ips;
bzero((char *)&obj, sizeof(obj));
bzero((char *)ipsp, sizeof(ips));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(*ipsp);
obj.ipfo_type = IPFOBJ_STATESAVE;
obj.ipfo_ptr = ipsp;
do {
if (opts & OPT_VERBOSE)
printf("Getting state from addr %p\n", ips.ips_next);
if (ioctl(fd, SIOCSTGET, &obj)) {
if (errno == ENOENT)
break;
perror("state:SIOCSTGET");
close(wfd);
return (1);
}
if (opts & OPT_VERBOSE)
printf("Got state next %p\n", ips.ips_next);
if (write(wfd, ipsp, sizeof(ips)) != sizeof(ips)) {
perror("state:write");
close(wfd);
return (1);
}
} while (ips.ips_next != NULL);
close(wfd);
return (0);
}
int readstate(int fd, char *file)
{
ipstate_save_t ips, *is, *ipshead = NULL, *is1, *ipstail = NULL;
int sfd = -1, i;
ipfobj_t obj;
if (!file)
file = IPF_STATEFILE;
sfd = open(file, O_RDONLY, 0600);
if (sfd == -1) {
fprintf(stderr, "%s ", file);
perror("open");
return (1);
}
bzero((char *)&ips, sizeof(ips));
/*
* 1. Read all state information in.
*/
do {
i = read(sfd, &ips, sizeof(ips));
if (i == -1) {
perror("read");
goto freeipshead;
}
if (i == 0)
break;
if (i != sizeof(ips)) {
fprintf(stderr, "state:incomplete read: %d != %d\n",
i, (int)sizeof(ips));
goto freeipshead;
}
is = (ipstate_save_t *)malloc(sizeof(*is));
if (is == NULL) {
fprintf(stderr, "malloc failed\n");
goto freeipshead;
}
bcopy((char *)&ips, (char *)is, sizeof(ips));
/*
* Check to see if this is the first state entry that will
* reference a particular rule and if so, flag it as such
* else just adjust the rule pointer to become a pointer to
* the other. We do this so we have a means later for tracking
* who is referencing us when we get back the real pointer
* in is_rule after doing the ioctl.
*/
for (is1 = ipshead; is1 != NULL; is1 = is1->ips_next)
if (is1->ips_rule == is->ips_rule)
break;
if (is1 == NULL)
is->ips_is.is_flags |= SI_NEWFR;
else
is->ips_rule = (void *)&is1->ips_rule;
/*
* Use a tail-queue type list (add things to the end)..
*/
is->ips_next = NULL;
if (!ipshead)
ipshead = is;
if (ipstail)
ipstail->ips_next = is;
ipstail = is;
} while (1);
close(sfd);
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(*is);
obj.ipfo_type = IPFOBJ_STATESAVE;
while ((is = ipshead) != NULL) {
if (opts & OPT_VERBOSE)
printf("Loading new state table entry\n");
if (is->ips_is.is_flags & SI_NEWFR) {
if (opts & OPT_VERBOSE)
printf("Loading new filter rule\n");
}
obj.ipfo_ptr = is;
if (!(opts & OPT_DONOTHING))
if (ioctl(fd, SIOCSTPUT, &obj)) {
perror("SIOCSTPUT");
goto freeipshead;
}
if (is->ips_is.is_flags & SI_NEWFR) {
if (opts & OPT_VERBOSE)
printf("Real rule addr %p\n", is->ips_rule);
for (is1 = is->ips_next; is1; is1 = is1->ips_next)
if (is1->ips_rule == (frentry_t *)&is->ips_rule)
is1->ips_rule = is->ips_rule;
}
ipshead = is->ips_next;
free(is);
}
return (0);
freeipshead:
while ((is = ipshead) != NULL) {
ipshead = is->ips_next;
free(is);
}
if (sfd != -1)
close(sfd);
return (1);
}
int readnat(int fd, char *file)
{
nat_save_t ipn, *in, *ipnhead = NULL, *in1, *ipntail = NULL;
ipfobj_t obj;
int nfd, i;
nat_t *nat;
char *s;
int n;
nfd = -1;
in = NULL;
ipnhead = NULL;
ipntail = NULL;
if (!file)
file = IPF_NATFILE;
nfd = open(file, O_RDONLY);
if (nfd == -1) {
fprintf(stderr, "%s ", file);
perror("nat:open");
return (1);
}
bzero((char *)&ipn, sizeof(ipn));
/*
* 1. Read all state information in.
*/
do {
i = read(nfd, &ipn, sizeof(ipn));
if (i == -1) {
perror("read");
goto freenathead;
}
if (i == 0)
break;
if (i != sizeof(ipn)) {
fprintf(stderr, "nat:incomplete read: %d != %d\n",
i, (int)sizeof(ipn));
goto freenathead;
}
in = (nat_save_t *)malloc(ipn.ipn_dsize);
if (in == NULL) {
fprintf(stderr, "nat:cannot malloc nat save atruct\n");
goto freenathead;
}
if (ipn.ipn_dsize > sizeof(ipn)) {
n = ipn.ipn_dsize - sizeof(ipn);
if (n > 0) {
s = in->ipn_data + sizeof(in->ipn_data);
i = read(nfd, s, n);
if (i == 0)
break;
if (i != n) {
fprintf(stderr,
"nat:incomplete read: %d != %d\n",
i, n);
goto freenathead;
}
}
}
bcopy((char *)&ipn, (char *)in, sizeof(ipn));
/*
* Check to see if this is the first NAT entry that will
* reference a particular rule and if so, flag it as such
* else just adjust the rule pointer to become a pointer to
* the other. We do this so we have a means later for tracking
* who is referencing us when we get back the real pointer
* in is_rule after doing the ioctl.
*/
nat = &in->ipn_nat;
if (nat->nat_fr != NULL) {
for (in1 = ipnhead; in1 != NULL; in1 = in1->ipn_next)
if (in1->ipn_rule == nat->nat_fr)
break;
if (in1 == NULL)
nat->nat_flags |= SI_NEWFR;
else
nat->nat_fr = &in1->ipn_fr;
}
/*
* Use a tail-queue type list (add things to the end)..
*/
in->ipn_next = NULL;
if (!ipnhead)
ipnhead = in;
if (ipntail)
ipntail->ipn_next = in;
ipntail = in;
} while (1);
close(nfd);
nfd = -1;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_NATSAVE;
while ((in = ipnhead) != NULL) {
if (opts & OPT_VERBOSE)
printf("Loading new NAT table entry\n");
nat = &in->ipn_nat;
if (nat->nat_flags & SI_NEWFR) {
if (opts & OPT_VERBOSE)
printf("Loading new filter rule\n");
}
obj.ipfo_ptr = in;
obj.ipfo_size = in->ipn_dsize;
if (!(opts & OPT_DONOTHING))
if (ioctl(fd, SIOCSTPUT, &obj)) {
fprintf(stderr, "in=%p:", in);
perror("SIOCSTPUT");
return (1);
}
if (nat->nat_flags & SI_NEWFR) {
if (opts & OPT_VERBOSE)
printf("Real rule addr %p\n", nat->nat_fr);
for (in1 = in->ipn_next; in1; in1 = in1->ipn_next)
if (in1->ipn_rule == &in->ipn_fr)
in1->ipn_rule = nat->nat_fr;
}
ipnhead = in->ipn_next;
free(in);
}
return (0);
freenathead:
while ((in = ipnhead) != NULL) {
ipnhead = in->ipn_next;
free(in);
}
if (nfd != -1)
close(nfd);
return (1);
}
int writenat(int fd, char *file)
{
nat_save_t *ipnp = NULL, *next = NULL;
ipfobj_t obj;
int nfd = -1;
natget_t ng;
if (!file)
file = IPF_NATFILE;
nfd = open(file, O_WRONLY|O_TRUNC|O_CREAT, 0600);
if (nfd == -1) {
fprintf(stderr, "%s ", file);
perror("nat:open");
return (1);
}
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_NATSAVE;
do {
if (opts & OPT_VERBOSE)
printf("Getting nat from addr %p\n", ipnp);
ng.ng_ptr = next;
ng.ng_sz = 0;
if (ioctl(fd, SIOCSTGSZ, &ng)) {
perror("nat:SIOCSTGSZ");
close(nfd);
if (ipnp != NULL)
free(ipnp);
return (1);
}
if (opts & OPT_VERBOSE)
printf("NAT size %d from %p\n", ng.ng_sz, ng.ng_ptr);
if (ng.ng_sz == 0)
break;
if (!ipnp)
ipnp = malloc(ng.ng_sz);
else
ipnp = realloc((char *)ipnp, ng.ng_sz);
if (!ipnp) {
fprintf(stderr,
"malloc for %d bytes failed\n", ng.ng_sz);
break;
}
bzero((char *)ipnp, ng.ng_sz);
obj.ipfo_size = ng.ng_sz;
obj.ipfo_ptr = ipnp;
ipnp->ipn_dsize = ng.ng_sz;
ipnp->ipn_next = next;
if (ioctl(fd, SIOCSTGET, &obj)) {
if (errno == ENOENT)
break;
perror("nat:SIOCSTGET");
close(nfd);
free(ipnp);
return (1);
}
if (opts & OPT_VERBOSE)
printf("Got nat next %p ipn_dsize %d ng_sz %d\n",
ipnp->ipn_next, ipnp->ipn_dsize, ng.ng_sz);
if (write(nfd, ipnp, ipnp->ipn_dsize) != ipnp->ipn_dsize) {
perror("nat:write");
close(nfd);
free(ipnp);
return (1);
}
next = ipnp->ipn_next;
} while (ipnp && next);
if (ipnp != NULL)
free(ipnp);
close(nfd);
return (0);
}
int writeall(char *dirname)
{
int fd, devfd;
if (!dirname)
dirname = IPF_SAVEDIR;
if (chdir(dirname)) {
fprintf(stderr, "IPF_SAVEDIR=%s: ", dirname);
perror("chdir(IPF_SAVEDIR)");
return (1);
}
fd = opendevice(NULL);
if (fd == -1)
return (1);
if (setlock(fd, 1)) {
close(fd);
return (1);
}
devfd = opendevice(IPSTATE_NAME);
if (devfd == -1)
goto bad;
if (writestate(devfd, NULL))
goto bad;
close(devfd);
devfd = opendevice(IPNAT_NAME);
if (devfd == -1)
goto bad;
if (writenat(devfd, NULL))
goto bad;
close(devfd);
if (setlock(fd, 0)) {
close(fd);
return (1);
}
close(fd);
return (0);
bad:
setlock(fd, 0);
close(fd);
return (1);
}
int readall(char *dirname)
{
int fd, devfd;
if (!dirname)
dirname = IPF_SAVEDIR;
if (chdir(dirname)) {
perror("chdir(IPF_SAVEDIR)");
return (1);
}
fd = opendevice(NULL);
if (fd == -1)
return (1);
if (setlock(fd, 1)) {
close(fd);
return (1);
}
devfd = opendevice(IPSTATE_NAME);
if (devfd == -1)
return (1);
if (readstate(devfd, NULL))
return (1);
close(devfd);
devfd = opendevice(IPNAT_NAME);
if (devfd == -1)
return (1);
if (readnat(devfd, NULL))
return (1);
close(devfd);
if (setlock(fd, 0)) {
close(fd);
return (1);
}
return (0);
}
diff --git a/sbin/ipf/ipfstat/ipfstat.c b/sbin/ipf/ipfstat/ipfstat.c
index 11b3043f919c..4f3dabed9ff2 100644
--- a/sbin/ipf/ipfstat/ipfstat.c
+++ b/sbin/ipf/ipfstat/ipfstat.c
@@ -1,2316 +1,2315 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include <sys/ioctl.h>
#include <ctype.h>
#include <fcntl.h>
# include <nlist.h>
#include <ctype.h>
#if defined(sun) && defined(__SVR4)
# include <stddef.h>
#endif
#include "ipf.h"
#include "netinet/ipl.h"
#if defined(STATETOP)
# if defined(sun) && defined(__SVR4)
# include <sys/select.h>
# endif
# include <netinet/ip_var.h>
# include <netinet/tcp_fsm.h>
# include <ctype.h>
# include <signal.h>
# include <time.h>
# if SOLARIS || defined(__NetBSD__)
# ifdef ERR
# undef ERR
# endif
# include <curses.h>
# else /* SOLARIS */
# include <ncurses.h>
# endif /* SOLARIS */
#endif /* STATETOP */
#include "kmem.h"
#if defined(__NetBSD__)
# include <paths.h>
#endif
#if !defined(lint)
static const char sccsid[] = "@(#)fils.c 1.21 4/20/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
extern char *optarg;
extern int optind;
extern int opterr;
#define PRINTF (void)printf
#define FPRINTF (void)fprintf
static char *filters[4] = { "ipfilter(in)", "ipfilter(out)",
"ipacct(in)", "ipacct(out)" };
static int state_logging = -1;
static wordtab_t *state_fields = NULL;
int nohdrfields = 0;
int opts = 0;
#ifdef USE_INET6
int use_inet4 = 0;
int use_inet6 = 0;
#endif
int live_kernel = 1;
int state_fd = -1;
int ipf_fd = -1;
int auth_fd = -1;
int nat_fd = -1;
frgroup_t *grtop = NULL;
frgroup_t *grtail = NULL;
char *blockreasons[FRB_MAX_VALUE + 1] = {
"packet blocked",
"log rule failure",
"pps rate exceeded",
"jumbogram",
"makefrip failed",
"cannot add state",
"IP ID update failed",
"log-or-block failed",
"decapsulate failure",
"cannot create new auth entry",
"packet queued for auth",
"buffer coalesce failure",
"buffer pullup failure",
"auth feedback",
"bad fragment",
"IPv4 NAT failure",
"IPv6 NAT failure"
};
#ifdef STATETOP
#define STSTRSIZE 80
#define STGROWSIZE 16
#define HOSTNMLEN 40
#define STSORT_PR 0
#define STSORT_PKTS 1
#define STSORT_BYTES 2
#define STSORT_TTL 3
#define STSORT_SRCIP 4
#define STSORT_SRCPT 5
#define STSORT_DSTIP 6
#define STSORT_DSTPT 7
#define STSORT_MAX STSORT_DSTPT
#define STSORT_DEFAULT STSORT_BYTES
typedef struct statetop {
i6addr_t st_src;
i6addr_t st_dst;
u_short st_sport;
u_short st_dport;
u_char st_p;
u_char st_v;
u_char st_state[2];
U_QUAD_T st_pkts;
U_QUAD_T st_bytes;
u_long st_age;
} statetop_t;
#endif
int main(int, char *[]);
static int fetchfrag(int, int, ipfr_t *);
static void showstats(friostat_t *, u_32_t);
static void showfrstates(ipfrstat_t *, u_long);
static void showlist(friostat_t *);
static void showstatestats(ips_stat_t *);
static void showipstates(ips_stat_t *, int *);
static void showauthstates(ipf_authstat_t *);
static void showtqtable_live(int);
static void showgroups(friostat_t *);
static void usage(char *);
static int state_matcharray(ipstate_t *, int *);
static int printlivelist(friostat_t *, int, int, frentry_t *,
char *, char *);
static void printdeadlist(friostat_t *, int, int, frentry_t *,
char *, char *);
static void printside(char *, ipf_statistics_t *);
static void parse_ipportstr(const char *, i6addr_t *, int *);
static void ipfstate_live(char *, friostat_t **, ips_stat_t **,
ipfrstat_t **, ipf_authstat_t **, u_32_t *);
static void ipfstate_dead(char *, friostat_t **, ips_stat_t **,
ipfrstat_t **, ipf_authstat_t **, u_32_t *);
static ipstate_t *fetchstate(ipstate_t *, ipstate_t *);
#ifdef STATETOP
static void topipstates(i6addr_t, i6addr_t, int, int, int,
int, int, int, int *);
static void sig_break(int);
static void sig_resize(int);
static char *getip(int, i6addr_t *);
static char *ttl_to_string(long);
static int sort_p(const void *, const void *);
static int sort_pkts(const void *, const void *);
static int sort_bytes(const void *, const void *);
static int sort_ttl(const void *, const void *);
static int sort_srcip(const void *, const void *);
static int sort_srcpt(const void *, const void *);
static int sort_dstip(const void *, const void *);
static int sort_dstpt(const void *, const void *);
#endif
static void usage(name)
char *name;
{
#ifdef USE_INET6
fprintf(stderr, "Usage: %s [-46aAdfghIilnoRsv]\n", name);
#else
fprintf(stderr, "Usage: %s [-4aAdfghIilnoRsv]\n", name);
#endif
fprintf(stderr, " %s [-M corefile] [-N symbol-list]\n", name);
#ifdef STATETOP
#ifdef USE_INET6
fprintf(stderr, " %s -t [-46C] ", name);
#else
fprintf(stderr, " %s -t [-4C] ", name);
#endif
#endif
fprintf(stderr, "[-D destination address] [-P protocol] [-S source address] [-T refresh time]\n");
exit(1);
}
int main(int argc, char *argv[])
{
ipf_authstat_t frauthst;
ipf_authstat_t *frauthstp = &frauthst;
friostat_t fio;
friostat_t *fiop = &fio;
ips_stat_t ipsst;
ips_stat_t *ipsstp = &ipsst;
ipfrstat_t ifrst;
ipfrstat_t *ifrstp = &ifrst;
char *options;
char *kern = NULL;
char *memf = NULL;
int c;
int myoptind;
int *filter = NULL;
int protocol = -1; /* -1 = wild card for any protocol */
int refreshtime = 1; /* default update time */
int sport = -1; /* -1 = wild card for any source port */
int dport = -1; /* -1 = wild card for any dest port */
int topclosed = 0; /* do not show closed tcp sessions */
i6addr_t saddr, daddr;
u_32_t frf;
#ifdef USE_INET6
options = "46aACdfghIilnostvD:m:M:N:O:P:RS:T:";
#else
options = "4aACdfghIilnostvD:m:M:N:O:P:RS:T:";
#endif
saddr.in4.s_addr = INADDR_ANY; /* default any v4 source addr */
daddr.in4.s_addr = INADDR_ANY; /* default any v4 dest addr */
#ifdef USE_INET6
saddr.in6 = in6addr_any; /* default any v6 source addr */
daddr.in6 = in6addr_any; /* default any v6 dest addr */
#endif
/* Don't warn about invalid flags when we run getopt for the 1st time */
opterr = 0;
/*
* Parse these two arguments now lest there be any buffer overflows
* in the parsing of the rest.
*/
myoptind = optind;
while ((c = getopt(argc, argv, options)) != -1) {
switch (c)
{
case 'M' :
memf = optarg;
live_kernel = 0;
break;
case 'N' :
kern = optarg;
live_kernel = 0;
break;
}
}
optind = myoptind;
if (live_kernel == 1) {
if ((state_fd = open(IPSTATE_NAME, O_RDONLY)) == -1) {
perror("open(IPSTATE_NAME)");
exit(-1);
}
if ((auth_fd = open(IPAUTH_NAME, O_RDONLY)) == -1) {
perror("open(IPAUTH_NAME)");
exit(-1);
}
if ((nat_fd = open(IPNAT_NAME, O_RDONLY)) == -1) {
perror("open(IPAUTH_NAME)");
exit(-1);
}
if ((ipf_fd = open(IPL_NAME, O_RDONLY)) == -1) {
fprintf(stderr, "open(%s)", IPL_NAME);
perror("");
exit(-1);
}
}
if (kern != NULL || memf != NULL) {
(void)setgid(getgid());
(void)setuid(getuid());
}
if (live_kernel == 1) {
(void) checkrev(IPL_NAME);
} else {
if (openkmem(kern, memf) == -1)
exit(-1);
}
(void)setgid(getgid());
(void)setuid(getuid());
opterr = 1;
while ((c = getopt(argc, argv, options)) != -1)
{
switch (c)
{
#ifdef USE_INET6
case '4' :
use_inet4 = 1;
break;
case '6' :
use_inet6 = 1;
break;
#endif
case 'a' :
opts |= OPT_ACCNT|OPT_SHOWLIST;
break;
case 'A' :
opts |= OPT_AUTHSTATS;
break;
case 'C' :
topclosed = 1;
break;
case 'd' :
opts |= OPT_DEBUG;
break;
case 'D' :
parse_ipportstr(optarg, &daddr, &dport);
break;
case 'f' :
opts |= OPT_FRSTATES;
break;
case 'g' :
opts |= OPT_GROUPS;
break;
case 'h' :
opts |= OPT_HITS;
break;
case 'i' :
opts |= OPT_INQUE|OPT_SHOWLIST;
break;
case 'I' :
opts |= OPT_INACTIVE;
break;
case 'l' :
opts |= OPT_SHOWLIST;
break;
case 'm' :
filter = parseipfexpr(optarg, NULL);
if (filter == NULL) {
fprintf(stderr, "Error parseing '%s'\n",
optarg);
exit(1);
}
break;
case 'M' :
break;
case 'N' :
break;
case 'n' :
opts |= OPT_SHOWLINENO;
break;
case 'o' :
opts |= OPT_OUTQUE|OPT_SHOWLIST;
break;
case 'O' :
state_fields = parsefields(statefields, optarg);
break;
case 'P' :
protocol = getproto(optarg);
if (protocol == -1) {
fprintf(stderr, "%s: Invalid protocol: %s\n",
argv[0], optarg);
exit(-2);
}
break;
case 'R' :
opts |= OPT_NORESOLVE;
break;
case 's' :
opts |= OPT_IPSTATES;
break;
case 'S' :
parse_ipportstr(optarg, &saddr, &sport);
break;
case 't' :
#ifdef STATETOP
opts |= OPT_STATETOP;
break;
#else
fprintf(stderr,
"%s: state top facility not compiled in\n",
argv[0]);
exit(-2);
#endif
case 'T' :
if (!sscanf(optarg, "%d", &refreshtime) ||
(refreshtime <= 0)) {
fprintf(stderr,
"%s: Invalid refreshtime < 1 : %s\n",
argv[0], optarg);
exit(-2);
}
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break;
}
}
#ifdef USE_INET6
if ((use_inet4 || use_inet6) &&
!(opts & (OPT_INQUE | OPT_OUTQUE | OPT_STATETOP))) {
#ifdef STATETOP
FPRINTF(stderr, "No -i, -o, or -t given with -4 or -6\n");
#else
FPRINTF(stderr, "No -i or -o given with -4 or -6\n");
#endif
exit(-2);
}
if (use_inet4 == 0 && use_inet6 == 0)
use_inet4 = use_inet6 = 1;
#endif
if (live_kernel == 1) {
bzero((char *)&fio, sizeof(fio));
bzero((char *)&ipsst, sizeof(ipsst));
bzero((char *)&ifrst, sizeof(ifrst));
ipfstate_live(IPL_NAME, &fiop, &ipsstp, &ifrstp,
&frauthstp, &frf);
} else {
ipfstate_dead(kern, &fiop, &ipsstp, &ifrstp, &frauthstp, &frf);
}
if (opts & OPT_IPSTATES) {
showipstates(ipsstp, filter);
} else if (opts & OPT_SHOWLIST) {
showlist(fiop);
if ((opts & OPT_OUTQUE) && (opts & OPT_INQUE)){
opts &= ~OPT_OUTQUE;
showlist(fiop);
}
} else if (opts & OPT_FRSTATES)
showfrstates(ifrstp, fiop->f_ticks);
#ifdef STATETOP
else if (opts & OPT_STATETOP)
topipstates(saddr, daddr, sport, dport, protocol,
#ifdef USE_INET6
use_inet6 && use_inet4 ? 0 : use_inet6 && !use_inet4 ? 6 : 4,
#else
4,
#endif
#endif
refreshtime, topclosed, filter);
else if (opts & OPT_AUTHSTATS)
showauthstates(frauthstp);
else if (opts & OPT_GROUPS)
showgroups(fiop);
else
showstats(fiop, frf);
return (0);
}
/*
* Fill in the stats structures from the live kernel, using a combination
* of ioctl's and copying directly from kernel memory.
*/
static void ipfstate_live(char *device, friostat_t **fiopp,
ips_stat_t **ipsstpp, ipfrstat_t **ifrstpp,
ipf_authstat_t **frauthstpp, u_32_t *frfp)
{
ipfobj_t ipfo;
if (checkrev(device) == -1) {
fprintf(stderr, "User/kernel version check failed\n");
exit(1);
}
if ((opts & OPT_AUTHSTATS) == 0) {
bzero((caddr_t)&ipfo, sizeof(ipfo));
ipfo.ipfo_rev = IPFILTER_VERSION;
ipfo.ipfo_type = IPFOBJ_IPFSTAT;
ipfo.ipfo_size = sizeof(friostat_t);
ipfo.ipfo_ptr = (void *)*fiopp;
if (ioctl(ipf_fd, SIOCGETFS, &ipfo) == -1) {
ipferror(ipf_fd, "ioctl(ipf:SIOCGETFS)");
exit(-1);
}
if (ioctl(ipf_fd, SIOCGETFF, frfp) == -1)
ipferror(ipf_fd, "ioctl(SIOCGETFF)");
}
if ((opts & OPT_IPSTATES) != 0) {
bzero((caddr_t)&ipfo, sizeof(ipfo));
ipfo.ipfo_rev = IPFILTER_VERSION;
ipfo.ipfo_type = IPFOBJ_STATESTAT;
ipfo.ipfo_size = sizeof(ips_stat_t);
ipfo.ipfo_ptr = (void *)*ipsstpp;
if ((ioctl(state_fd, SIOCGETFS, &ipfo) == -1)) {
ipferror(state_fd, "ioctl(state:SIOCGETFS)");
exit(-1);
}
if (ioctl(state_fd, SIOCGETLG, &state_logging) == -1) {
ipferror(state_fd, "ioctl(state:SIOCGETLG)");
exit(-1);
}
}
if ((opts & OPT_FRSTATES) != 0) {
bzero((caddr_t)&ipfo, sizeof(ipfo));
ipfo.ipfo_rev = IPFILTER_VERSION;
ipfo.ipfo_type = IPFOBJ_FRAGSTAT;
ipfo.ipfo_size = sizeof(ipfrstat_t);
ipfo.ipfo_ptr = (void *)*ifrstpp;
if (ioctl(ipf_fd, SIOCGFRST, &ipfo) == -1) {
ipferror(ipf_fd, "ioctl(SIOCGFRST)");
exit(-1);
}
}
if (opts & OPT_DEBUG)
PRINTF("opts %#x name %s\n", opts, device);
if ((opts & OPT_AUTHSTATS) != 0) {
bzero((caddr_t)&ipfo, sizeof(ipfo));
ipfo.ipfo_rev = IPFILTER_VERSION;
ipfo.ipfo_type = IPFOBJ_AUTHSTAT;
ipfo.ipfo_size = sizeof(ipf_authstat_t);
ipfo.ipfo_ptr = (void *)*frauthstpp;
if (ioctl(auth_fd, SIOCATHST, &ipfo) == -1) {
ipferror(auth_fd, "ioctl(SIOCATHST)");
exit(-1);
}
}
}
/*
* Build up the stats structures from data held in the "core" memory.
* This is mainly useful when looking at data in crash dumps and ioctl's
* just won't work any more.
*/
static void ipfstate_dead( char *kernel, friostat_t **fiopp,
ips_stat_t **ipsstpp, ipfrstat_t **ifrstpp,
ipf_authstat_t **frauthstpp, u_32_t *frfp)
{
static ipf_authstat_t frauthst, *frauthstp;
static ipftq_t ipstcptab[IPF_TCP_NSTATES];
static ips_stat_t ipsst, *ipsstp;
static ipfrstat_t ifrst, *ifrstp;
static friostat_t fio, *fiop;
int temp;
void *rules[2][2];
struct nlist deadlist[44] = {
{ "ipf_auth_stats", 0, 0, 0, 0 }, /* 0 */
{ "fae_list", 0, 0, 0, 0 },
{ "ipauth", 0, 0, 0, 0 },
{ "ipf_auth_list", 0, 0, 0, 0 },
{ "ipf_auth_start", 0, 0, 0, 0 },
{ "ipf_auth_end", 0, 0, 0, 0 }, /* 5 */
{ "ipf_auth_next", 0, 0, 0, 0 },
{ "ipf_auth", 0, 0, 0, 0 },
{ "ipf_auth_used", 0, 0, 0, 0 },
{ "ipf_auth_size", 0, 0, 0, 0 },
{ "ipf_auth_defaultage", 0, 0, 0, 0 }, /* 10 */
{ "ipf_auth_pkts", 0, 0, 0, 0 },
{ "ipf_auth_lock", 0, 0, 0, 0 },
{ "frstats", 0, 0, 0, 0 },
{ "ips_stats", 0, 0, 0, 0 },
{ "ips_num", 0, 0, 0, 0 }, /* 15 */
{ "ips_wild", 0, 0, 0, 0 },
{ "ips_list", 0, 0, 0, 0 },
{ "ips_table", 0, 0, 0, 0 },
{ "ipf_state_max", 0, 0, 0, 0 },
{ "ipf_state_size", 0, 0, 0, 0 }, /* 20 */
{ "ipf_state_doflush", 0, 0, 0, 0 },
{ "ipf_state_lock", 0, 0, 0, 0 },
{ "ipfr_heads", 0, 0, 0, 0 },
{ "ipfr_nattab", 0, 0, 0, 0 },
{ "ipfr_stats", 0, 0, 0, 0 }, /* 25 */
{ "ipfr_inuse", 0, 0, 0, 0 },
{ "ipf_ipfrttl", 0, 0, 0, 0 },
{ "ipf_frag_lock", 0, 0, 0, 0 },
{ "ipfr_timer_id", 0, 0, 0, 0 },
{ "ipf_nat_lock", 0, 0, 0, 0 }, /* 30 */
{ "ipf_rules", 0, 0, 0, 0 },
{ "ipf_acct", 0, 0, 0, 0 },
{ "ipl_frouteok", 0, 0, 0, 0 },
{ "ipf_running", 0, 0, 0, 0 },
{ "ipf_groups", 0, 0, 0, 0 }, /* 35 */
{ "ipf_active", 0, 0, 0, 0 },
{ "ipf_pass", 0, 0, 0, 0 },
{ "ipf_flags", 0, 0, 0, 0 },
{ "ipf_state_logging", 0, 0, 0, 0 },
{ "ips_tqtqb", 0, 0, 0, 0 }, /* 40 */
{ NULL, 0, 0, 0, 0 }
};
frauthstp = &frauthst;
ipsstp = &ipsst;
ifrstp = &ifrst;
fiop = &fio;
*frfp = 0;
*fiopp = fiop;
*ipsstpp = ipsstp;
*ifrstpp = ifrstp;
*frauthstpp = frauthstp;
bzero((char *)fiop, sizeof(*fiop));
bzero((char *)ipsstp, sizeof(*ipsstp));
bzero((char *)ifrstp, sizeof(*ifrstp));
bzero((char *)frauthstp, sizeof(*frauthstp));
if (nlist(kernel, deadlist) == -1) {
fprintf(stderr, "nlist error\n");
return;
}
/*
* This is for SIOCGETFF.
*/
kmemcpy((char *)frfp, (u_long)deadlist[40].n_value, sizeof(*frfp));
/*
* f_locks is a combination of the lock variable from each part of
* ipfilter (state, auth, nat, fragments).
*/
kmemcpy((char *)fiop, (u_long)deadlist[13].n_value, sizeof(*fiop));
kmemcpy((char *)&fiop->f_locks[0], (u_long)deadlist[22].n_value,
sizeof(fiop->f_locks[0]));
kmemcpy((char *)&fiop->f_locks[0], (u_long)deadlist[30].n_value,
sizeof(fiop->f_locks[1]));
kmemcpy((char *)&fiop->f_locks[2], (u_long)deadlist[28].n_value,
sizeof(fiop->f_locks[2]));
kmemcpy((char *)&fiop->f_locks[3], (u_long)deadlist[12].n_value,
sizeof(fiop->f_locks[3]));
/*
* Get pointers to each list of rules (active, inactive, in, out)
*/
kmemcpy((char *)&rules, (u_long)deadlist[31].n_value, sizeof(rules));
fiop->f_fin[0] = rules[0][0];
fiop->f_fin[1] = rules[0][1];
fiop->f_fout[0] = rules[1][0];
fiop->f_fout[1] = rules[1][1];
/*
* Now get accounting rules pointers.
*/
kmemcpy((char *)&rules, (u_long)deadlist[33].n_value, sizeof(rules));
fiop->f_acctin[0] = rules[0][0];
fiop->f_acctin[1] = rules[0][1];
fiop->f_acctout[0] = rules[1][0];
fiop->f_acctout[1] = rules[1][1];
/*
* A collection of "global" variables used inside the kernel which
* are all collected in friostat_t via ioctl.
*/
kmemcpy((char *)&fiop->f_froute, (u_long)deadlist[33].n_value,
sizeof(fiop->f_froute));
kmemcpy((char *)&fiop->f_running, (u_long)deadlist[34].n_value,
sizeof(fiop->f_running));
kmemcpy((char *)&fiop->f_groups, (u_long)deadlist[35].n_value,
sizeof(fiop->f_groups));
kmemcpy((char *)&fiop->f_active, (u_long)deadlist[36].n_value,
sizeof(fiop->f_active));
kmemcpy((char *)&fiop->f_defpass, (u_long)deadlist[37].n_value,
sizeof(fiop->f_defpass));
/*
* Build up the state information stats structure.
*/
kmemcpy((char *)ipsstp, (u_long)deadlist[14].n_value, sizeof(*ipsstp));
kmemcpy((char *)&temp, (u_long)deadlist[15].n_value, sizeof(temp));
kmemcpy((char *)ipstcptab, (u_long)deadlist[40].n_value,
sizeof(ipstcptab));
ipsstp->iss_active = temp;
ipsstp->iss_table = (void *)deadlist[18].n_value;
ipsstp->iss_list = (void *)deadlist[17].n_value;
ipsstp->iss_tcptab = ipstcptab;
/*
* Build up the authentiation information stats structure.
*/
kmemcpy((char *)frauthstp, (u_long)deadlist[0].n_value,
sizeof(*frauthstp));
frauthstp->fas_faelist = (void *)deadlist[1].n_value;
/*
* Build up the fragment information stats structure.
*/
kmemcpy((char *)ifrstp, (u_long)deadlist[25].n_value,
sizeof(*ifrstp));
ifrstp->ifs_table = (void *)deadlist[23].n_value;
ifrstp->ifs_nattab = (void *)deadlist[24].n_value;
kmemcpy((char *)&ifrstp->ifs_inuse, (u_long)deadlist[26].n_value,
sizeof(ifrstp->ifs_inuse));
/*
* Get logging on/off switches
*/
kmemcpy((char *)&state_logging, (u_long)deadlist[41].n_value,
sizeof(state_logging));
}
static void printside(char *side, ipf_statistics_t *frs)
{
int i;
PRINTF("%lu\t%s bad packets\n", frs->fr_bad, side);
#ifdef USE_INET6
PRINTF("%lu\t%s IPv6 packets\n", frs->fr_ipv6, side);
#endif
PRINTF("%lu\t%s packets blocked\n", frs->fr_block, side);
PRINTF("%lu\t%s packets passed\n", frs->fr_pass, side);
PRINTF("%lu\t%s packets not matched\n", frs->fr_nom, side);
PRINTF("%lu\t%s packets counted\n", frs->fr_acct, side);
PRINTF("%lu\t%s packets short\n", frs->fr_short, side);
PRINTF("%lu\t%s packets logged and blocked\n", frs->fr_bpkl, side);
PRINTF("%lu\t%s packets logged and passed\n", frs->fr_ppkl, side);
PRINTF("%lu\t%s fragment state kept\n", frs->fr_nfr, side);
PRINTF("%lu\t%s fragment state lost\n", frs->fr_bnfr, side);
PRINTF("%lu\t%s packet state kept\n", frs->fr_ads, side);
PRINTF("%lu\t%s packet state lost\n", frs->fr_bads, side);
PRINTF("%lu\t%s invalid source\n", frs->fr_v4_badsrc, side);
PRINTF("%lu\t%s cache hits\n", frs->fr_chit, side);
PRINTF("%lu\t%s cache misses\n", frs->fr_cmiss, side);
PRINTF("%lu\t%s bad coalesces\n", frs->fr_badcoalesces, side);
PRINTF("%lu\t%s pullups succeeded\n", frs->fr_pull[0], side);
PRINTF("%lu\t%s pullups failed\n", frs->fr_pull[1], side);
PRINTF("%lu\t%s TCP checksum failures\n", frs->fr_tcpbad, side);
for (i = 0; i <= FRB_MAX_VALUE; i++)
PRINTF("%lu\t%s block reason %s\n",
frs->fr_blocked[i], side, blockreasons[i]);
}
/*
* Display the kernel stats for packets blocked and passed and other
* associated running totals which are kept.
*/
static void showstats( struct friostat *fp, u_32_t frf)
{
printside("input", &fp->f_st[0]);
printside("output", &fp->f_st[1]);
PRINTF("%lu\tpackets logged\n", fp->f_log_ok);
PRINTF("%lu\tlog failures\n", fp->f_log_fail);
PRINTF("%lu\tred-black no memory\n", fp->f_rb_no_mem);
PRINTF("%lu\tred-black node maximum\n", fp->f_rb_node_max);
PRINTF("%lu\tICMP replies sent\n", fp->f_st[0].fr_ret);
PRINTF("%lu\tTCP RSTs sent\n", fp->f_st[1].fr_ret);
PRINTF("%lu\tfastroute successes\n", fp->f_froute[0]);
PRINTF("%lu\tfastroute failures\n", fp->f_froute[1]);
PRINTF("%u\tIPF Ticks\n", fp->f_ticks);
PRINTF("%x\tPacket log flags set:\n", frf);
if (frf & FF_LOGPASS)
PRINTF("\tpackets passed through filter\n");
if (frf & FF_LOGBLOCK)
PRINTF("\tpackets blocked by filter\n");
if (frf & FF_LOGNOMATCH)
PRINTF("\tpackets not matched by filter\n");
if (!frf)
PRINTF("\tnone\n");
}
/*
* Print out a list of rules from the kernel, starting at the one passed.
*/
static int
printlivelist( struct friostat *fiop, int out, int set, frentry_t *fp,
char *group, char *comment)
{
struct frentry fb;
ipfruleiter_t rule;
frentry_t zero;
frgroup_t *g;
ipfobj_t obj;
int rules;
int num;
rules = 0;
rule.iri_inout = out;
rule.iri_active = set;
rule.iri_rule = &fb;
rule.iri_nrules = 1;
if (group != NULL)
strncpy(rule.iri_group, group, FR_GROUPLEN);
else
rule.iri_group[0] = '\0';
bzero((char *)&zero, sizeof(zero));
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_IPFITER;
obj.ipfo_size = sizeof(rule);
obj.ipfo_ptr = &rule;
while (rule.iri_rule != NULL) {
u_long array[1000];
memset(array, 0xff, sizeof(array));
fp = (frentry_t *)array;
rule.iri_rule = fp;
if (ioctl(ipf_fd, SIOCIPFITER, &obj) == -1) {
ipferror(ipf_fd, "ioctl(SIOCIPFITER)");
num = IPFGENITER_IPF;
(void) ioctl(ipf_fd,SIOCIPFDELTOK, &num);
return (rules);
}
if (bcmp(fp, &zero, sizeof(zero)) == 0)
break;
if (rule.iri_rule == NULL)
break;
#ifdef USE_INET6
if (use_inet6 != 0 && use_inet4 == 0) {
if (fp->fr_family != 0 && fp->fr_family != AF_INET6)
continue;
} else if (use_inet4 != 0 && use_inet6 == 0) {
#endif
if (fp->fr_family != 0 && fp->fr_family != AF_INET)
continue;
#ifdef USE_INET6
} else {
if (fp->fr_family != 0 &&
fp->fr_family != AF_INET && fp->fr_family != AF_INET6)
continue;
}
#endif
if (fp->fr_data != NULL)
fp->fr_data = (char *)fp + fp->fr_size;
rules++;
if (opts & (OPT_HITS|OPT_DEBUG))
#ifdef USE_QUAD_T
PRINTF("%"PRIu64" ", (unsigned long long) fp->fr_hits);
#else
PRINTF("%lu ", fp->fr_hits);
#endif
if (opts & (OPT_ACCNT|OPT_DEBUG))
#ifdef USE_QUAD_T
PRINTF("%"PRIu64" ", (unsigned long long) fp->fr_bytes);
#else
PRINTF("%lu ", fp->fr_bytes);
#endif
if (opts & OPT_SHOWLINENO)
PRINTF("@%d ", rules);
if (fp->fr_die != 0)
fp->fr_die -= fiop->f_ticks;
printfr(fp, ioctl);
if (opts & OPT_DEBUG) {
binprint(fp, fp->fr_size);
if (fp->fr_data != NULL && fp->fr_dsize > 0)
binprint(fp->fr_data, fp->fr_dsize);
}
if (fp->fr_grhead != -1) {
for (g = grtop; g != NULL; g = g->fg_next) {
if (!strncmp(fp->fr_names + fp->fr_grhead,
g->fg_name,
FR_GROUPLEN))
break;
}
if (g == NULL) {
g = calloc(1, sizeof(*g));
if (g != NULL) {
strncpy(g->fg_name,
fp->fr_names + fp->fr_grhead,
FR_GROUPLEN);
if (grtop == NULL) {
grtop = g;
grtail = g;
} else {
grtail->fg_next = g;
grtail = g;
}
}
}
}
if (fp->fr_type == FR_T_CALLFUNC) {
rules += printlivelist(fiop, out, set, fp->fr_data,
group, "# callfunc: ");
}
}
num = IPFGENITER_IPF;
(void) ioctl(ipf_fd,SIOCIPFDELTOK, &num);
return (rules);
}
static void printdeadlist(friostat_t *fiop, int out, int set, frentry_t *fp,
char *group, char *comment)
{
frgroup_t *grtop, *grtail, *g;
struct frentry fb;
char *data;
u_32_t type;
int n;
fb.fr_next = fp;
n = 0;
grtop = NULL;
grtail = NULL;
for (n = 1; fp; fp = fb.fr_next, n++) {
if (kmemcpy((char *)&fb, (u_long)fb.fr_next,
fb.fr_size) == -1) {
perror("kmemcpy");
return;
}
fp = &fb;
#ifdef USE_INET6
if (use_inet6 != 0 && use_inet4 == 0) {
if (fp->fr_family != 0 && fp->fr_family != AF_INET6)
continue;
} else if (use_inet4 != 0 && use_inet6 == 0) {
#endif
if (fp->fr_family != 0 && fp->fr_family != AF_INET)
continue;
#ifdef USE_INET6
} else {
if (fp->fr_family != 0 &&
fp->fr_family != AF_INET && fp->fr_family != AF_INET6)
continue;
}
#endif
data = NULL;
type = fb.fr_type & ~FR_T_BUILTIN;
if (type == FR_T_IPF || type == FR_T_BPFOPC) {
if (fb.fr_dsize) {
data = malloc(fb.fr_dsize);
if (kmemcpy(data, (u_long)fb.fr_data,
fb.fr_dsize) == -1) {
perror("kmemcpy");
return;
}
fb.fr_data = data;
}
}
if (opts & OPT_HITS)
#ifdef USE_QUAD_T
PRINTF("%"PRIu64" ", (unsigned long long) fb.fr_hits);
#else
PRINTF("%lu ", fb.fr_hits);
#endif
if (opts & OPT_ACCNT)
#ifdef USE_QUAD_T
PRINTF("%"PRIu64" ", (unsigned long long) fb.fr_bytes);
#else
PRINTF("%lu ", fb.fr_bytes);
#endif
if (opts & OPT_SHOWLINENO)
PRINTF("@%d ", n);
printfr(fp, ioctl);
if (opts & OPT_DEBUG) {
binprint(fp, fp->fr_size);
if (fb.fr_data != NULL && fb.fr_dsize > 0)
binprint(fb.fr_data, fb.fr_dsize);
}
if (data != NULL)
free(data);
if (fb.fr_grhead != -1) {
g = calloc(1, sizeof(*g));
if (g != NULL) {
strncpy(g->fg_name, fb.fr_names + fb.fr_grhead,
FR_GROUPLEN);
if (grtop == NULL) {
grtop = g;
grtail = g;
} else {
grtail->fg_next = g;
grtail = g;
}
}
}
if (type == FR_T_CALLFUNC) {
printdeadlist(fiop, out, set, fb.fr_data, group,
"# callfunc: ");
}
}
while ((g = grtop) != NULL) {
printdeadlist(fiop, out, set, NULL, g->fg_name, comment);
grtop = g->fg_next;
free(g);
}
}
/*
* print out all of the asked for rule sets, using the stats struct as
* the base from which to get the pointers.
*/
static void showlist(struct friostat *fiop)
{
struct frentry *fp = NULL;
int i, set;
set = fiop->f_active;
if (opts & OPT_INACTIVE)
set = 1 - set;
if (opts & OPT_ACCNT) {
if (opts & OPT_OUTQUE) {
i = F_ACOUT;
fp = (struct frentry *)fiop->f_acctout[set];
} else if (opts & OPT_INQUE) {
i = F_ACIN;
fp = (struct frentry *)fiop->f_acctin[set];
} else {
FPRINTF(stderr, "No -i or -o given with -a\n");
return;
}
} else {
if (opts & OPT_OUTQUE) {
i = F_OUT;
fp = (struct frentry *)fiop->f_fout[set];
} else if (opts & OPT_INQUE) {
i = F_IN;
fp = (struct frentry *)fiop->f_fin[set];
} else
return;
}
if (opts & OPT_DEBUG)
FPRINTF(stderr, "showlist:opts %#x i %d\n", opts, i);
if (opts & OPT_DEBUG)
PRINTF("fp %p set %d\n", fp, set);
if (live_kernel == 1) {
int printed;
printed = printlivelist(fiop, i, set, fp, NULL, NULL);
if (printed == 0) {
FPRINTF(stderr, "# empty list for %s%s\n",
(opts & OPT_INACTIVE) ? "inactive " : "",
filters[i]);
}
} else {
if (!fp) {
FPRINTF(stderr, "# empty list for %s%s\n",
(opts & OPT_INACTIVE) ? "inactive " : "",
filters[i]);
} else {
printdeadlist(fiop, i, set, fp, NULL, NULL);
}
}
}
/*
* Display ipfilter stateful filtering information
*/
static void showipstates(ips_stat_t *ipsp, int *filter)
{
ipstate_t *is;
int i;
/*
* If a list of states hasn't been asked for, only print out stats
*/
if (!(opts & OPT_SHOWLIST)) {
showstatestats(ipsp);
return;
}
if ((state_fields != NULL) && (nohdrfields == 0)) {
for (i = 0; state_fields[i].w_value != 0; i++) {
printfieldhdr(statefields, state_fields + i);
if (state_fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
}
/*
* Print out all the state information currently held in the kernel.
*/
for (is = ipsp->iss_list; is != NULL; ) {
ipstate_t ips;
is = fetchstate(is, &ips);
if (is == NULL)
break;
is = ips.is_next;
if ((filter != NULL) &&
(state_matcharray(&ips, filter) == 0)) {
continue;
}
if (state_fields != NULL) {
for (i = 0; state_fields[i].w_value != 0; i++) {
printstatefield(&ips, state_fields[i].w_value);
if (state_fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
} else {
printstate(&ips, opts, ipsp->iss_ticks);
}
}
}
static void showstatestats(ips_stat_t *ipsp)
{
int minlen, maxlen, totallen;
ipftable_t table;
u_int *buckets;
ipfobj_t obj;
int i, sz;
/*
* If a list of states hasn't been asked for, only print out stats
*/
sz = sizeof(*buckets) * ipsp->iss_state_size;
buckets = (u_int *)malloc(sz);
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GTABLE;
obj.ipfo_size = sizeof(table);
obj.ipfo_ptr = &table;
table.ita_type = IPFTABLE_BUCKETS;
table.ita_table = buckets;
if (live_kernel == 1) {
if (ioctl(state_fd, SIOCGTABL, &obj) != 0) {
free(buckets);
return;
}
} else {
if (kmemcpy((char *)buckets,
(u_long)ipsp->iss_bucketlen, sz)) {
free(buckets);
return;
}
}
PRINTF("%u\tactive state table entries\n",ipsp->iss_active);
PRINTF("%lu\tadd bad\n", ipsp->iss_add_bad);
PRINTF("%lu\tadd duplicate\n", ipsp->iss_add_dup);
PRINTF("%lu\tadd locked\n", ipsp->iss_add_locked);
PRINTF("%lu\tadd oow\n", ipsp->iss_add_oow);
PRINTF("%lu\tbucket full\n", ipsp->iss_bucket_full);
PRINTF("%lu\tcheck bad\n", ipsp->iss_check_bad);
PRINTF("%lu\tcheck miss\n", ipsp->iss_check_miss);
PRINTF("%lu\tcheck nattag\n", ipsp->iss_check_nattag);
PRINTF("%lu\tclone nomem\n", ipsp->iss_clone_nomem);
PRINTF("%lu\tcheck notag\n", ipsp->iss_check_notag);
PRINTF("%lu\tcheck success\n", ipsp->iss_hits);
PRINTF("%lu\tcloned\n", ipsp->iss_cloned);
PRINTF("%lu\texpired\n", ipsp->iss_expire);
PRINTF("%lu\tflush all\n", ipsp->iss_flush_all);
PRINTF("%lu\tflush closing\n", ipsp->iss_flush_closing);
PRINTF("%lu\tflush queue\n", ipsp->iss_flush_queue);
PRINTF("%lu\tflush state\n", ipsp->iss_flush_state);
PRINTF("%lu\tflush timeout\n", ipsp->iss_flush_timeout);
PRINTF("%u\thash buckets in use\n", ipsp->iss_inuse);
PRINTF("%lu\tICMP bad\n", ipsp->iss_icmp_bad);
PRINTF("%lu\tICMP banned\n", ipsp->iss_icmp_banned);
PRINTF("%lu\tICMP errors\n", ipsp->iss_icmp_icmperr);
PRINTF("%lu\tICMP head block\n", ipsp->iss_icmp_headblock);
PRINTF("%lu\tICMP hits\n", ipsp->iss_icmp_hits);
PRINTF("%lu\tICMP not query\n", ipsp->iss_icmp_notquery);
PRINTF("%lu\tICMP short\n", ipsp->iss_icmp_short);
PRINTF("%lu\tICMP too many\n", ipsp->iss_icmp_toomany);
PRINTF("%lu\tICMPv6 errors\n", ipsp->iss_icmp6_icmperr);
PRINTF("%lu\tICMPv6 miss\n", ipsp->iss_icmp6_miss);
PRINTF("%lu\tICMPv6 not info\n", ipsp->iss_icmp6_notinfo);
PRINTF("%lu\tICMPv6 not query\n", ipsp->iss_icmp6_notquery);
PRINTF("%lu\tlog fail\n", ipsp->iss_log_fail);
PRINTF("%lu\tlog ok\n", ipsp->iss_log_ok);
PRINTF("%lu\tlookup interface mismatch\n", ipsp->iss_lookup_badifp);
PRINTF("%lu\tlookup mask mismatch\n", ipsp->iss_miss_mask);
PRINTF("%lu\tlookup port mismatch\n", ipsp->iss_lookup_badport);
PRINTF("%lu\tlookup miss\n", ipsp->iss_lookup_miss);
PRINTF("%lu\tmaximum rule references\n", ipsp->iss_max_ref);
PRINTF("%lu\tmaximum hosts per rule\n", ipsp->iss_max_track);
PRINTF("%lu\tno memory\n", ipsp->iss_nomem);
PRINTF("%lu\tout of window\n", ipsp->iss_oow);
PRINTF("%lu\torphans\n", ipsp->iss_orphan);
PRINTF("%lu\tscan block\n", ipsp->iss_scan_block);
PRINTF("%lu\tstate table maximum reached\n", ipsp->iss_max);
PRINTF("%lu\tTCP closing\n", ipsp->iss_tcp_closing);
PRINTF("%lu\tTCP OOW\n", ipsp->iss_tcp_oow);
PRINTF("%lu\tTCP RST add\n", ipsp->iss_tcp_rstadd);
PRINTF("%lu\tTCP too small\n", ipsp->iss_tcp_toosmall);
PRINTF("%lu\tTCP bad options\n", ipsp->iss_tcp_badopt);
PRINTF("%lu\tTCP removed\n", ipsp->iss_fin);
PRINTF("%lu\tTCP FSM\n", ipsp->iss_tcp_fsm);
PRINTF("%lu\tTCP strict\n", ipsp->iss_tcp_strict);
PRINTF("%lu\tTCP wild\n", ipsp->iss_wild);
PRINTF("%lu\tMicrosoft Windows SACK\n", ipsp->iss_winsack);
PRINTF("State logging %sabled\n", state_logging ? "en" : "dis");
PRINTF("IP states added:\n");
for (i = 0; i < 256; i++) {
if (ipsp->iss_proto[i] != 0) {
struct protoent *proto;
proto = getprotobynumber(i);
PRINTF("%lu", ipsp->iss_proto[i]);
if (proto != NULL)
PRINTF("\t%s\n", proto->p_name);
else
PRINTF("\t%d\n", i);
}
}
PRINTF("\nState table bucket statistics:\n");
PRINTF("%u\tin use\n", ipsp->iss_inuse);
minlen = ipsp->iss_max;
totallen = 0;
maxlen = 0;
for (i = 0; i < ipsp->iss_state_size; i++) {
if (buckets[i] > maxlen)
maxlen = buckets[i];
if (buckets[i] < minlen)
minlen = buckets[i];
totallen += buckets[i];
}
PRINTF("%d\thash efficiency\n",
totallen ? ipsp->iss_inuse * 100 / totallen : 0);
PRINTF("%2.2f%%\tbucket usage\n%u\tminimal length\n",
((float)ipsp->iss_inuse / ipsp->iss_state_size) * 100.0,
minlen);
PRINTF("%u\tmaximal length\n%.3f\taverage length\n",
maxlen,
ipsp->iss_inuse ? (float) totallen/ ipsp->iss_inuse :
0.0);
#define ENTRIES_PER_LINE 5
if (opts & OPT_VERBOSE) {
PRINTF("\nCurrent bucket sizes :\n");
for (i = 0; i < ipsp->iss_state_size; i++) {
if ((i % ENTRIES_PER_LINE) == 0)
PRINTF("\t");
PRINTF("%4d -> %4u", i, buckets[i]);
if ((i % ENTRIES_PER_LINE) ==
(ENTRIES_PER_LINE - 1))
PRINTF("\n");
else
PRINTF(" ");
}
PRINTF("\n");
}
PRINTF("\n");
free(buckets);
if (live_kernel == 1) {
showtqtable_live(state_fd);
} else {
printtqtable(ipsp->iss_tcptab);
}
}
#ifdef STATETOP
static int handle_resize = 0, handle_break = 0;
static void topipstates(i6addr_t saddr, i6addr_t daddr, int sport, int dport,
int protocol, int ver, int refreshtime, int topclosed, int *filter)
{
char str1[STSTRSIZE], str2[STSTRSIZE], str3[STSTRSIZE], str4[STSTRSIZE];
int maxtsentries = 0, reverse = 0, sorting = STSORT_DEFAULT;
int i, j, winy, tsentry, maxx, maxy, redraw = 0, ret = 0;
int len, srclen, dstlen, forward = 1, c = 0;
ips_stat_t ipsst, *ipsstp = &ipsst;
int token_type = IPFGENITER_STATE;
statetop_t *tstable = NULL, *tp;
const char *errstr = "";
ipstate_t ips;
ipfobj_t ipfo;
struct timeval selecttimeout;
char hostnm[HOSTNMLEN];
struct protoent *proto;
fd_set readfd;
time_t t;
/* install signal handlers */
signal(SIGINT, sig_break);
signal(SIGQUIT, sig_break);
signal(SIGTERM, sig_break);
signal(SIGWINCH, sig_resize);
/* init ncurses stuff */
initscr();
cbreak();
noecho();
curs_set(0);
timeout(0);
getmaxyx(stdscr, maxy, maxx);
/* init hostname */
gethostname(hostnm, sizeof(hostnm) - 1);
hostnm[sizeof(hostnm) - 1] = '\0';
/* init ipfobj_t stuff */
bzero((caddr_t)&ipfo, sizeof(ipfo));
ipfo.ipfo_rev = IPFILTER_VERSION;
ipfo.ipfo_type = IPFOBJ_STATESTAT;
ipfo.ipfo_size = sizeof(*ipsstp);
ipfo.ipfo_ptr = (void *)ipsstp;
/* repeat until user aborts */
while ( 1 ) {
/* get state table */
bzero((char *)&ipsst, sizeof(ipsst));
if ((ioctl(state_fd, SIOCGETFS, &ipfo) == -1)) {
errstr = "ioctl(SIOCGETFS)";
ret = -1;
goto out;
}
/* clear the history */
tsentry = -1;
/* reset max str len */
srclen = dstlen = 0;
/* read the state table and store in tstable */
for (; ipsstp->iss_list; ipsstp->iss_list = ips.is_next) {
ipsstp->iss_list = fetchstate(ipsstp->iss_list, &ips);
if (ipsstp->iss_list == NULL)
break;
if (ver != 0 && ips.is_v != ver)
continue;
if ((filter != NULL) &&
(state_matcharray(&ips, filter) == 0))
continue;
/* check v4 src/dest addresses */
if (ips.is_v == 4) {
if ((saddr.in4.s_addr != INADDR_ANY &&
saddr.in4.s_addr != ips.is_saddr) ||
(daddr.in4.s_addr != INADDR_ANY &&
daddr.in4.s_addr != ips.is_daddr))
continue;
}
#ifdef USE_INET6
/* check v6 src/dest addresses */
if (ips.is_v == 6) {
if ((IP6_NEQ(&saddr, &in6addr_any) &&
IP6_NEQ(&saddr, &ips.is_src)) ||
(IP6_NEQ(&daddr, &in6addr_any) &&
IP6_NEQ(&daddr, &ips.is_dst)))
continue;
}
#endif
/* check protocol */
if (protocol > 0 && protocol != ips.is_p)
continue;
/* check ports if protocol is TCP or UDP */
if (((ips.is_p == IPPROTO_TCP) ||
(ips.is_p == IPPROTO_UDP)) &&
(((sport > 0) && (htons(sport) != ips.is_sport)) ||
((dport > 0) && (htons(dport) != ips.is_dport))))
continue;
/* show closed TCP sessions ? */
if ((topclosed == 0) && (ips.is_p == IPPROTO_TCP) &&
(ips.is_state[0] >= IPF_TCPS_LAST_ACK) &&
(ips.is_state[1] >= IPF_TCPS_LAST_ACK))
continue;
/*
* if necessary make room for this state
* entry
*/
tsentry++;
if (!maxtsentries || tsentry == maxtsentries) {
maxtsentries += STGROWSIZE;
tstable = reallocarray(tstable, maxtsentries,
sizeof(statetop_t));
if (tstable == NULL) {
perror("realloc");
exit(-1);
}
}
/* get max src/dest address string length */
len = strlen(getip(ips.is_v, &ips.is_src));
if (srclen < len)
srclen = len;
len = strlen(getip(ips.is_v, &ips.is_dst));
if (dstlen < len)
dstlen = len;
/* fill structure */
tp = tstable + tsentry;
tp->st_src = ips.is_src;
tp->st_dst = ips.is_dst;
tp->st_p = ips.is_p;
tp->st_v = ips.is_v;
tp->st_state[0] = ips.is_state[0];
tp->st_state[1] = ips.is_state[1];
if (forward) {
tp->st_pkts = ips.is_pkts[0]+ips.is_pkts[1];
tp->st_bytes = ips.is_bytes[0]+ips.is_bytes[1];
} else {
tp->st_pkts = ips.is_pkts[2]+ips.is_pkts[3];
tp->st_bytes = ips.is_bytes[2]+ips.is_bytes[3];
}
tp->st_age = ips.is_die - ipsstp->iss_ticks;
if ((ips.is_p == IPPROTO_TCP) ||
(ips.is_p == IPPROTO_UDP)) {
tp->st_sport = ips.is_sport;
tp->st_dport = ips.is_dport;
}
}
(void) ioctl(state_fd, SIOCIPFDELTOK, &token_type);
/* sort the array */
if (tsentry != -1) {
switch (sorting)
{
case STSORT_PR:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_p);
break;
case STSORT_PKTS:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_pkts);
break;
case STSORT_BYTES:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_bytes);
break;
case STSORT_TTL:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_ttl);
break;
case STSORT_SRCIP:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_srcip);
break;
case STSORT_SRCPT:
qsort(tstable, tsentry +1,
sizeof(statetop_t), sort_srcpt);
break;
case STSORT_DSTIP:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_dstip);
break;
case STSORT_DSTPT:
qsort(tstable, tsentry + 1,
sizeof(statetop_t), sort_dstpt);
break;
default:
break;
}
}
/* handle window resizes */
if (handle_resize) {
endwin();
initscr();
cbreak();
noecho();
curs_set(0);
timeout(0);
getmaxyx(stdscr, maxy, maxx);
redraw = 1;
handle_resize = 0;
}
/* stop program? */
if (handle_break)
break;
/* print title */
erase();
attron(A_BOLD);
winy = 0;
move(winy,0);
snprintf(str1, sizeof(str1), "%s - %s - state top", hostnm, IPL_VERSION);
for (j = 0 ; j < (maxx - 8 - strlen(str1)) / 2; j++)
printw(" ");
printw("%s", str1);
attroff(A_BOLD);
/* just for fun add a clock */
move(winy, maxx - 8);
t = time(NULL);
strftime(str1, 80, "%T", localtime(&t));
printw("%s\n", str1);
/*
* print the display filters, this is placed in the loop,
* because someday I might add code for changing these
* while the programming is running :-)
*/
if (sport >= 0)
snprintf(str1, sizeof(str1), "%s,%d", getip(ver, &saddr), sport);
else
snprintf(str1, sizeof(str1), "%s", getip(ver, &saddr));
if (dport >= 0)
snprintf(str2, sizeof(str2), "%s,%d", getip(ver, &daddr), dport);
else
snprintf(str2, sizeof(str2), "%s", getip(ver, &daddr));
if (protocol < 0)
strcpy(str3, "any");
else if ((proto = getprotobynumber(protocol)) != NULL)
snprintf(str3, sizeof(str3), "%s", proto->p_name);
else
snprintf(str3, sizeof(str3), "%d", protocol);
switch (sorting)
{
case STSORT_PR:
snprintf(str4, sizeof(str4), "proto");
break;
case STSORT_PKTS:
snprintf(str4, sizeof(str4), "# pkts");
break;
case STSORT_BYTES:
snprintf(str4, sizeof(str4), "# bytes");
break;
case STSORT_TTL:
snprintf(str4, sizeof(str4), "ttl");
break;
case STSORT_SRCIP:
snprintf(str4, sizeof(str4), "src ip");
break;
case STSORT_SRCPT:
snprintf(str4, sizeof(str4), "src port");
break;
case STSORT_DSTIP:
snprintf(str4, sizeof(str4), "dest ip");
break;
case STSORT_DSTPT:
snprintf(str4, sizeof(str4), "dest port");
break;
default:
snprintf(str4, sizeof(str4), "unknown");
break;
}
if (reverse)
strcat(str4, " (reverse)");
winy += 2;
move(winy,0);
printw("Src: %s, Dest: %s, Proto: %s, Sorted by: %s\n\n",
str1, str2, str3, str4);
/*
* For an IPv4 IP address we need at most 15 characters,
* 4 tuples of 3 digits, separated by 3 dots. Enforce this
* length, so the colums do not change positions based
* on the size of the IP address. This length makes the
* output fit in a 80 column terminal.
* We are lacking a good solution for IPv6 addresses (that
* can be longer that 15 characters), so we do not enforce
* a maximum on the IP field size.
*/
if (srclen < 15)
srclen = 15;
if (dstlen < 15)
dstlen = 15;
/* print column description */
winy += 2;
move(winy,0);
attron(A_BOLD);
printw("%-*s %-*s %3s %4s %7s %9s %9s\n",
srclen + 6, "Source IP", dstlen + 6, "Destination IP",
"ST", "PR", "#pkts", "#bytes", "ttl");
attroff(A_BOLD);
/* print all the entries */
tp = tstable;
if (reverse)
tp += tsentry;
if (tsentry > maxy - 6)
tsentry = maxy - 6;
for (i = 0; i <= tsentry; i++) {
/* print src/dest and port */
if ((tp->st_p == IPPROTO_TCP) ||
(tp->st_p == IPPROTO_UDP)) {
snprintf(str1, sizeof(str1), "%s,%hu",
getip(tp->st_v, &tp->st_src),
ntohs(tp->st_sport));
snprintf(str2, sizeof(str2), "%s,%hu",
getip(tp->st_v, &tp->st_dst),
ntohs(tp->st_dport));
} else {
snprintf(str1, sizeof(str1), "%s", getip(tp->st_v,
&tp->st_src));
snprintf(str2, sizeof(str2), "%s", getip(tp->st_v,
&tp->st_dst));
}
winy++;
move(winy, 0);
printw("%-*s %-*s", srclen + 6, str1, dstlen + 6, str2);
/* print state */
snprintf(str1, sizeof(str1), "%X/%X", tp->st_state[0],
tp->st_state[1]);
printw(" %3s", str1);
/* print protocol */
proto = getprotobynumber(tp->st_p);
if (proto) {
strncpy(str1, proto->p_name, 4);
str1[4] = '\0';
} else {
snprintf(str1, sizeof(str1), "%d", tp->st_p);
}
/* just print icmp for IPv6-ICMP */
if (tp->st_p == IPPROTO_ICMPV6)
strcpy(str1, "icmp");
printw(" %4s", str1);
/* print #pkt/#bytes */
#ifdef USE_QUAD_T
printw(" %7qu %9qu", (unsigned long long) tp->st_pkts,
(unsigned long long) tp->st_bytes);
#else
printw(" %7lu %9lu", tp->st_pkts, tp->st_bytes);
#endif
printw(" %9s", ttl_to_string(tp->st_age));
if (reverse)
tp--;
else
tp++;
}
/* screen data structure is filled, now update the screen */
if (redraw)
clearok(stdscr,1);
if (refresh() == ERR)
break;
if (redraw) {
clearok(stdscr,0);
redraw = 0;
}
/* wait for key press or a 1 second time out period */
selecttimeout.tv_sec = refreshtime;
selecttimeout.tv_usec = 0;
FD_ZERO(&readfd);
FD_SET(0, &readfd);
select(1, &readfd, NULL, NULL, &selecttimeout);
/* if key pressed, read all waiting keys */
if (FD_ISSET(0, &readfd)) {
c = wgetch(stdscr);
if (c == ERR)
continue;
if (ISALPHA(c) && ISUPPER(c))
c = TOLOWER(c);
if (c == 'l') {
redraw = 1;
} else if (c == 'q') {
break;
} else if (c == 'r') {
reverse = !reverse;
} else if (c == 'b') {
forward = 0;
} else if (c == 'f') {
forward = 1;
} else if (c == 's') {
if (++sorting > STSORT_MAX)
sorting = 0;
}
}
} /* while */
out:
printw("\n");
curs_set(1);
/* nocbreak(); XXX - endwin() should make this redundant */
endwin();
free(tstable);
if (ret != 0)
perror(errstr);
}
#endif
/*
* Show fragment cache information that's held in the kernel.
*/
static void showfrstates(ipfrstat_t *ifsp, u_long ticks)
{
struct ipfr *ipfrtab[IPFT_SIZE], ifr;
int i;
/*
* print out the numeric statistics
*/
PRINTF("IP fragment states:\n%lu\tnew\n%lu\texpired\n%lu\thits\n",
ifsp->ifs_new, ifsp->ifs_expire, ifsp->ifs_hits);
PRINTF("%lu\tretrans\n%lu\ttoo short\n",
ifsp->ifs_retrans0, ifsp->ifs_short);
PRINTF("%lu\tno memory\n%lu\talready exist\n",
ifsp->ifs_nomem, ifsp->ifs_exists);
PRINTF("%lu\tinuse\n", ifsp->ifs_inuse);
PRINTF("\n");
if (live_kernel == 0) {
if (kmemcpy((char *)ipfrtab, (u_long)ifsp->ifs_table,
sizeof(ipfrtab)))
return;
}
/*
* Print out the contents (if any) of the fragment cache table.
*/
if (live_kernel == 1) {
do {
if (fetchfrag(ipf_fd, IPFGENITER_FRAG, &ifr) != 0)
break;
if (ifr.ipfr_ifp == NULL)
break;
ifr.ipfr_ttl -= ticks;
printfraginfo("", &ifr);
} while (ifr.ipfr_next != NULL);
} else {
for (i = 0; i < IPFT_SIZE; i++)
while (ipfrtab[i] != NULL) {
if (kmemcpy((char *)&ifr, (u_long)ipfrtab[i],
sizeof(ifr)) == -1)
break;
printfraginfo("", &ifr);
ipfrtab[i] = ifr.ipfr_next;
}
}
/*
* Print out the contents (if any) of the NAT fragment cache table.
*/
if (live_kernel == 0) {
if (kmemcpy((char *)ipfrtab, (u_long)ifsp->ifs_nattab,
sizeof(ipfrtab)))
return;
}
if (live_kernel == 1) {
do {
if (fetchfrag(nat_fd, IPFGENITER_NATFRAG, &ifr) != 0)
break;
if (ifr.ipfr_ifp == NULL)
break;
ifr.ipfr_ttl -= ticks;
printfraginfo("NAT: ", &ifr);
} while (ifr.ipfr_next != NULL);
} else {
for (i = 0; i < IPFT_SIZE; i++)
while (ipfrtab[i] != NULL) {
if (kmemcpy((char *)&ifr, (u_long)ipfrtab[i],
sizeof(ifr)) == -1)
break;
printfraginfo("NAT: ", &ifr);
ipfrtab[i] = ifr.ipfr_next;
}
}
}
/*
* Show stats on how auth within IPFilter has been used
*/
static void showauthstates(ipf_authstat_t *asp)
{
frauthent_t *frap, fra;
ipfgeniter_t auth;
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GENITER;
obj.ipfo_size = sizeof(auth);
obj.ipfo_ptr = &auth;
auth.igi_type = IPFGENITER_AUTH;
auth.igi_nitems = 1;
auth.igi_data = &fra;
#ifdef USE_QUAD_T
printf("Authorisation hits: %"PRIu64"\tmisses %"PRIu64"\n",
(unsigned long long) asp->fas_hits,
(unsigned long long) asp->fas_miss);
#else
printf("Authorisation hits: %ld\tmisses %ld\n", asp->fas_hits,
asp->fas_miss);
#endif
printf("nospace %ld\nadded %ld\nsendfail %ld\nsendok %ld\n",
asp->fas_nospace, asp->fas_added, asp->fas_sendfail,
asp->fas_sendok);
printf("queok %ld\nquefail %ld\nexpire %ld\n",
asp->fas_queok, asp->fas_quefail, asp->fas_expire);
frap = asp->fas_faelist;
while (frap) {
if (live_kernel == 1) {
if (ioctl(auth_fd, SIOCGENITER, &obj))
break;
} else {
if (kmemcpy((char *)&fra, (u_long)frap,
sizeof(fra)) == -1)
break;
}
printf("age %ld\t", fra.fae_age);
printfr(&fra.fae_fr, ioctl);
frap = fra.fae_next;
}
}
/*
* Display groups used for each of filter rules, accounting rules and
* authentication, separately.
*/
static void showgroups(struct friostat *fiop)
{
static char *gnames[3] = { "Filter", "Accounting", "Authentication" };
static int gnums[3] = { IPL_LOGIPF, IPL_LOGCOUNT, IPL_LOGAUTH };
frgroup_t *fp, grp;
int on, off, i;
on = fiop->f_active;
off = 1 - on;
for (i = 0; i < 3; i++) {
printf("%s groups (active):\n", gnames[i]);
for (fp = fiop->f_groups[gnums[i]][on]; fp != NULL;
fp = grp.fg_next)
if (kmemcpy((char *)&grp, (u_long)fp, sizeof(grp)))
break;
else
printf("%s\n", grp.fg_name);
printf("%s groups (inactive):\n", gnames[i]);
for (fp = fiop->f_groups[gnums[i]][off]; fp != NULL;
fp = grp.fg_next)
if (kmemcpy((char *)&grp, (u_long)fp, sizeof(grp)))
break;
else
printf("%s\n", grp.fg_name);
}
}
static void parse_ipportstr(const char *argument, i6addr_t *ip, int *port)
{
char *s, *comma;
int ok = 0;
/* make working copy of argument, Theoretically you must be able
* to write to optarg, but that seems very ugly to me....
*/
s = strdup(argument);
if (s == NULL)
return;
/* get port */
if ((comma = strchr(s, ',')) != NULL) {
if (!strcasecmp(comma + 1, "any")) {
*port = -1;
} else if (!sscanf(comma + 1, "%d", port) ||
(*port < 0) || (*port > 65535)) {
fprintf(stderr, "Invalid port specification in %s\n",
argument);
free(s);
exit(-2);
}
*comma = '\0';
}
/* get ip address */
if (!strcasecmp(s, "any")) {
ip->in4.s_addr = INADDR_ANY;
ok = 1;
#ifdef USE_INET6
ip->in6 = in6addr_any;
} else if (use_inet6 && !use_inet4 && inet_pton(AF_INET6, s, &ip->in6)) {
ok = 1;
#endif
} else if (inet_aton(s, &ip->in4))
ok = 1;
if (ok == 0) {
fprintf(stderr, "Invalid IP address: %s\n", s);
free(s);
exit(-2);
}
/* free allocated memory */
free(s);
}
#ifdef STATETOP
static void sig_resize(int s)
{
handle_resize = 1;
}
static void sig_break(int s)
{
handle_break = 1;
}
static char *getip(int v, i6addr_t *addr)
{
#ifdef USE_INET6
static char hostbuf[MAXHOSTNAMELEN+1];
#endif
if (v == 0)
return ("any");
if (v == 4)
return (inet_ntoa(addr->in4));
#ifdef USE_INET6
(void) inet_ntop(AF_INET6, &addr->in6, hostbuf, sizeof(hostbuf) - 1);
hostbuf[MAXHOSTNAMELEN] = '\0';
return (hostbuf);
#else
return ("IPv6");
#endif
}
static char *ttl_to_string(long int ttl)
{
static char ttlbuf[STSTRSIZE];
int hours, minutes, seconds;
/* ttl is in half seconds */
ttl /= 2;
hours = ttl / 3600;
ttl = ttl % 3600;
minutes = ttl / 60;
seconds = ttl % 60;
if (hours > 0)
snprintf(ttlbuf, sizeof(ttlbuf), "%2d:%02d:%02d", hours, minutes, seconds);
else
snprintf(ttlbuf, sizeof(ttlbuf), "%2d:%02d", minutes, seconds);
return (ttlbuf);
}
static int sort_pkts(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
if (ap->st_pkts == bp->st_pkts)
return (0);
else if (ap->st_pkts < bp->st_pkts)
return (1);
return (-1);
}
static int sort_bytes(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
if (ap->st_bytes == bp->st_bytes)
return (0);
else if (ap->st_bytes < bp->st_bytes)
return (1);
return (-1);
}
static int sort_p(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
if (ap->st_p == bp->st_p)
return (0);
else if (ap->st_p < bp->st_p)
return (1);
return (-1);
}
static int sort_ttl(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
if (ap->st_age == bp->st_age)
return (0);
else if (ap->st_age < bp->st_age)
return (1);
return (-1);
}
static int sort_srcip(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
#ifdef USE_INET6
if (use_inet6 && !use_inet4) {
if (IP6_EQ(&ap->st_src, &bp->st_src))
return (0);
else if (IP6_GT(&ap->st_src, &bp->st_src))
return (1);
} else
#endif
{
if (ntohl(ap->st_src.in4.s_addr) ==
ntohl(bp->st_src.in4.s_addr))
return (0);
else if (ntohl(ap->st_src.in4.s_addr) >
ntohl(bp->st_src.in4.s_addr))
return (1);
}
return (-1);
}
static int sort_srcpt(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
if (htons(ap->st_sport) == htons(bp->st_sport))
return (0);
else if (htons(ap->st_sport) > htons(bp->st_sport))
return (1);
return (-1);
}
static int sort_dstip(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
#ifdef USE_INET6
if (use_inet6 && !use_inet4) {
if (IP6_EQ(&ap->st_dst, &bp->st_dst))
return (0);
else if (IP6_GT(&ap->st_dst, &bp->st_dst))
return (1);
} else
#endif
{
if (ntohl(ap->st_dst.in4.s_addr) ==
ntohl(bp->st_dst.in4.s_addr))
return (0);
else if (ntohl(ap->st_dst.in4.s_addr) >
ntohl(bp->st_dst.in4.s_addr))
return (1);
}
return (-1);
}
static int sort_dstpt(const void *a, const void *b)
{
register const statetop_t *ap = a;
register const statetop_t *bp = b;
if (htons(ap->st_dport) == htons(bp->st_dport))
return (0);
else if (htons(ap->st_dport) > htons(bp->st_dport))
return (1);
return (-1);
}
#endif
ipstate_t *fetchstate(ipstate_t *src, ipstate_t *dst)
{
if (live_kernel == 1) {
ipfgeniter_t state;
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GENITER;
obj.ipfo_size = sizeof(state);
obj.ipfo_ptr = &state;
state.igi_type = IPFGENITER_STATE;
state.igi_nitems = 1;
state.igi_data = dst;
if (ioctl(state_fd, SIOCGENITER, &obj) != 0)
return (NULL);
if (dst->is_next == NULL) {
int n = IPFGENITER_STATE;
(void) ioctl(ipf_fd,SIOCIPFDELTOK, &n);
}
} else {
if (kmemcpy((char *)dst, (u_long)src, sizeof(*dst)))
return (NULL);
}
return (dst);
}
static int fetchfrag( int fd, int type, ipfr_t *frp)
{
ipfgeniter_t frag;
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GENITER;
obj.ipfo_size = sizeof(frag);
obj.ipfo_ptr = &frag;
frag.igi_type = type;
frag.igi_nitems = 1;
frag.igi_data = frp;
if (ioctl(fd, SIOCGENITER, &obj))
return (EFAULT);
return (0);
}
static int state_matcharray(ipstate_t *stp, int *array)
{
int i, n, *x, rv, p;
ipfexp_t *e;
rv = 0;
for (n = array[0], x = array + 1; n > 0; x += e->ipfe_size) {
e = (ipfexp_t *)x;
if (e->ipfe_cmd == IPF_EXP_END)
break;
n -= e->ipfe_size;
rv = 0;
/*
* The upper 16 bits currently store the protocol value.
* This is currently used with TCP and UDP port compares and
* allows "tcp.port = 80" without requiring an explicit
" "ip.pr = tcp" first.
*/
p = e->ipfe_cmd >> 16;
if ((p != 0) && (p != stp->is_p))
break;
switch (e->ipfe_cmd)
{
case IPF_EXP_IP_PR :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (stp->is_p == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_IP_SRCADDR :
if (stp->is_v != 4)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= ((stp->is_saddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]);
}
break;
case IPF_EXP_IP_DSTADDR :
if (stp->is_v != 4)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= ((stp->is_daddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]);
}
break;
case IPF_EXP_IP_ADDR :
if (stp->is_v != 4)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= ((stp->is_saddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]) ||
((stp->is_daddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]);
}
break;
#ifdef USE_INET6
case IPF_EXP_IP6_SRCADDR :
if (stp->is_v != 6)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= IP6_MASKEQ(&stp->is_src,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]);
}
break;
case IPF_EXP_IP6_DSTADDR :
if (stp->is_v != 6)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= IP6_MASKEQ(&stp->is_dst,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]);
}
break;
case IPF_EXP_IP6_ADDR :
if (stp->is_v != 6)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= IP6_MASKEQ(&stp->is_src,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]) ||
IP6_MASKEQ(&stp->is_dst,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]);
}
break;
#endif
case IPF_EXP_UDP_PORT :
case IPF_EXP_TCP_PORT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (stp->is_sport == e->ipfe_arg0[i]) ||
(stp->is_dport == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_UDP_SPORT :
case IPF_EXP_TCP_SPORT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (stp->is_sport == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_UDP_DPORT :
case IPF_EXP_TCP_DPORT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (stp->is_dport == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_IDLE_GT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (stp->is_die < e->ipfe_arg0[i]);
}
break;
case IPF_EXP_TCP_STATE :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (stp->is_state[0] == e->ipfe_arg0[i]) ||
(stp->is_state[1] == e->ipfe_arg0[i]);
}
break;
}
rv ^= e->ipfe_not;
if (rv == 0)
break;
}
return (rv);
}
static void showtqtable_live(int fd)
{
ipftq_t table[IPF_TCP_NSTATES];
ipfobj_t obj;
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(table);
obj.ipfo_ptr = (void *)table;
obj.ipfo_type = IPFOBJ_STATETQTAB;
if (ioctl(fd, SIOCGTQTAB, &obj) == 0) {
printtqtable(table);
}
}
diff --git a/sbin/ipf/ipfsync/ipsyncm.c b/sbin/ipf/ipfsync/ipsyncm.c
index d57196379210..a9484a339c82 100644
--- a/sbin/ipf/ipfsync/ipsyncm.c
+++ b/sbin/ipf/ipfsync/ipsyncm.c
@@ -1,256 +1,255 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ip_fil.c 2.41 6/5/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <net/if.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <unistd.h>
#include <string.h>
#include <syslog.h>
#include <signal.h>
#include "netinet/ip_compat.h"
#include "netinet/ip_fil.h"
#include "netinet/ip_nat.h"
#include "netinet/ip_state.h"
#include "netinet/ip_sync.h"
int main(int, char *[]);
void usage(const char *);
int terminate = 0;
void usage(const char *progname) {
fprintf(stderr, "Usage: %s <destination IP> <destination port>\n", progname);
}
#if 0
static void handleterm(int sig)
{
terminate = sig;
}
#endif
/* should be large enough to hold header + any datatype */
#define BUFFERLEN 1400
int main(argc, argv)
int argc;
char *argv[];
{
struct sockaddr_in sin;
char buff[BUFFERLEN];
synclogent_t *sl;
syncupdent_t *su;
int nfd = -1, lfd = -1, n1, n2, n3, len;
int inbuf;
u_32_t magic;
synchdr_t *sh;
char *progname;
progname = strrchr(argv[0], '/');
if (progname) {
progname++;
} else {
progname = argv[0];
}
if (argc < 2) {
usage(progname);
exit(1);
}
#if 0
signal(SIGHUP, handleterm);
signal(SIGINT, handleterm);
signal(SIGTERM, handleterm);
#endif
openlog(progname, LOG_PID, LOG_SECURITY);
bzero((char *)&sin, sizeof(sin));
sin.sin_family = AF_INET;
sin.sin_addr.s_addr = inet_addr(argv[1]);
if (argc > 2)
sin.sin_port = htons(atoi(argv[2]));
else
sin.sin_port = htons(43434);
while (1) {
if (lfd != -1)
close(lfd);
if (nfd != -1)
close(nfd);
lfd = open(IPSYNC_NAME, O_RDONLY);
if (lfd == -1) {
syslog(LOG_ERR, "Opening %s :%m", IPSYNC_NAME);
goto tryagain;
}
nfd = socket(AF_INET, SOCK_DGRAM, 0);
if (nfd == -1) {
syslog(LOG_ERR, "Socket :%m");
goto tryagain;
}
if (connect(nfd, (struct sockaddr *)&sin, sizeof(sin)) == -1) {
syslog(LOG_ERR, "Connect: %m");
goto tryagain;
}
syslog(LOG_INFO, "Sending data to %s",
inet_ntoa(sin.sin_addr));
inbuf = 0;
while (1) {
n1 = read(lfd, buff+inbuf, BUFFERLEN-inbuf);
printf("header : %d bytes read (header = %d bytes)\n",
n1, (int) sizeof(*sh));
if (n1 < 0) {
syslog(LOG_ERR, "Read error (header): %m");
goto tryagain;
}
if (n1 == 0) {
/* XXX can this happen??? */
syslog(LOG_ERR,
"Read error (header) : No data");
sleep(1);
continue;
}
inbuf += n1;
moreinbuf:
if (inbuf < sizeof(*sh)) {
continue; /* need more data */
}
sh = (synchdr_t *)buff;
len = ntohl(sh->sm_len);
magic = ntohl(sh->sm_magic);
if (magic != SYNHDRMAGIC) {
syslog(LOG_ERR,
"Invalid header magic %x", magic);
goto tryagain;
}
#define IPSYNC_DEBUG
#ifdef IPSYNC_DEBUG
printf("v:%d p:%d len:%d magic:%x", sh->sm_v,
sh->sm_p, len, magic);
if (sh->sm_cmd == SMC_CREATE)
printf(" cmd:CREATE");
else if (sh->sm_cmd == SMC_UPDATE)
printf(" cmd:UPDATE");
else
printf(" cmd:Unknown(%d)", sh->sm_cmd);
if (sh->sm_table == SMC_NAT)
printf(" table:NAT");
else if (sh->sm_table == SMC_STATE)
printf(" table:STATE");
else
printf(" table:Unknown(%d)", sh->sm_table);
printf(" num:%d\n", (u_32_t)ntohl(sh->sm_num));
#endif
if (inbuf < sizeof(*sh) + len) {
continue; /* need more data */
goto tryagain;
}
#ifdef IPSYNC_DEBUG
if (sh->sm_cmd == SMC_CREATE) {
sl = (synclogent_t *)buff;
} else if (sh->sm_cmd == SMC_UPDATE) {
su = (syncupdent_t *)buff;
if (sh->sm_p == IPPROTO_TCP) {
printf(" TCP Update: age %lu state %d/%d\n",
su->sup_tcp.stu_age,
su->sup_tcp.stu_state[0],
su->sup_tcp.stu_state[1]);
}
} else {
printf("Unknown command\n");
}
#endif
n2 = sizeof(*sh) + len;
n3 = write(nfd, buff, n2);
if (n3 <= 0) {
syslog(LOG_ERR, "Write error: %m");
goto tryagain;
}
if (n3 != n2) {
syslog(LOG_ERR, "Incomplete write (%d/%d)",
n3, n2);
goto tryagain;
}
/* signal received? */
if (terminate)
break;
/* move buffer to the front,we might need to make
* this more efficient, by using a rolling pointer
* over the buffer and only copying it, when
* we are reaching the end
*/
inbuf -= n2;
if (inbuf) {
bcopy(buff+n2, buff, inbuf);
printf("More data in buffer\n");
goto moreinbuf;
}
}
if (terminate)
break;
tryagain:
sleep(1);
}
/* terminate */
if (lfd != -1)
close(lfd);
if (nfd != -1)
close(nfd);
syslog(LOG_ERR, "signal %d received, exiting...", terminate);
exit(1);
}
diff --git a/sbin/ipf/ipfsync/ipsyncs.c b/sbin/ipf/ipfsync/ipsyncs.c
index a53cfb8c9508..ee9ecfd4f886 100644
--- a/sbin/ipf/ipfsync/ipsyncs.c
+++ b/sbin/ipf/ipfsync/ipsyncs.c
@@ -1,274 +1,273 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ip_fil.c 2.41 6/5/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <net/if.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <string.h>
#include <unistd.h>
#include <syslog.h>
#include <errno.h>
#include <signal.h>
#include "netinet/ip_compat.h"
#include "netinet/ip_fil.h"
#include "netinet/ip_state.h"
#include "netinet/ip_nat.h"
#include "netinet/ip_sync.h"
int main(int, char *[]);
void usage(const char *progname);
int terminate = 0;
void usage(const char *progname) {
fprintf(stderr,
"Usage: %s <destination IP> <destination port> [remote IP]\n",
progname);
}
#if 0
static void handleterm(int sig)
{
terminate = sig;
}
#endif
#define BUFFERLEN 1400
int main(argc, argv)
int argc;
char *argv[];
{
int nfd = -1 , lfd = -1;
int n1, n2, n3, magic, len, inbuf;
struct sockaddr_in sin;
struct sockaddr_in in;
char buff[BUFFERLEN];
synclogent_t *sl;
syncupdent_t *su;
synchdr_t *sh;
char *progname;
progname = strrchr(argv[0], '/');
if (progname) {
progname++;
} else {
progname = argv[0];
}
if (argc < 2) {
usage(progname);
exit(1);
}
#if 0
signal(SIGHUP, handleterm);
signal(SIGINT, handleterm);
signal(SIGTERM, handleterm);
#endif
openlog(progname, LOG_PID, LOG_SECURITY);
lfd = open(IPSYNC_NAME, O_WRONLY);
if (lfd == -1) {
syslog(LOG_ERR, "Opening %s :%m", IPSYNC_NAME);
exit(1);
}
bzero((char *)&sin, sizeof(sin));
sin.sin_family = AF_INET;
if (argc > 1)
sin.sin_addr.s_addr = inet_addr(argv[1]);
if (argc > 2)
sin.sin_port = htons(atoi(argv[2]));
else
sin.sin_port = htons(43434);
if (argc > 3)
in.sin_addr.s_addr = inet_addr(argv[3]);
else
in.sin_addr.s_addr = 0;
in.sin_port = 0;
while(1) {
if (lfd != -1)
close(lfd);
if (nfd != -1)
close(nfd);
lfd = open(IPSYNC_NAME, O_WRONLY);
if (lfd == -1) {
syslog(LOG_ERR, "Opening %s :%m", IPSYNC_NAME);
goto tryagain;
}
nfd = socket(AF_INET, SOCK_DGRAM, 0);
if (nfd == -1) {
syslog(LOG_ERR, "Socket :%m");
goto tryagain;
}
n1 = 1;
setsockopt(nfd, SOL_SOCKET, SO_REUSEADDR, &n1, sizeof(n1));
if (bind(nfd, (struct sockaddr *)&sin, sizeof(sin)) == -1) {
syslog(LOG_ERR, "Bind: %m");
goto tryagain;
}
syslog(LOG_INFO, "Listening to %s", inet_ntoa(sin.sin_addr));
inbuf = 0;
while (1) {
/*
* XXX currently we do not check the source address
* of a datagram, this can be a security risk
*/
n1 = read(nfd, buff+inbuf, BUFFERLEN-inbuf);
printf("header : %d bytes read (header = %d bytes)\n",
n1, (int) sizeof(*sh));
if (n1 < 0) {
syslog(LOG_ERR, "Read error (header): %m");
goto tryagain;
}
if (n1 == 0) {
/* XXX can this happen??? */
syslog(LOG_ERR,
"Read error (header) : No data");
sleep(1);
continue;
}
inbuf += n1;
moreinbuf:
if (inbuf < sizeof(*sh)) {
continue; /* need more data */
}
sh = (synchdr_t *)buff;
len = ntohl(sh->sm_len);
magic = ntohl(sh->sm_magic);
if (magic != SYNHDRMAGIC) {
syslog(LOG_ERR, "Invalid header magic %x",
magic);
goto tryagain;
}
#define IPSYNC_DEBUG
#ifdef IPSYNC_DEBUG
printf("v:%d p:%d len:%d magic:%x", sh->sm_v,
sh->sm_p, len, magic);
if (sh->sm_cmd == SMC_CREATE)
printf(" cmd:CREATE");
else if (sh->sm_cmd == SMC_UPDATE)
printf(" cmd:UPDATE");
else
printf(" cmd:Unknown(%d)", sh->sm_cmd);
if (sh->sm_table == SMC_NAT)
printf(" table:NAT");
else if (sh->sm_table == SMC_STATE)
printf(" table:STATE");
else
printf(" table:Unknown(%d)", sh->sm_table);
printf(" num:%d\n", (u_32_t)ntohl(sh->sm_num));
#endif
if (inbuf < sizeof(*sh) + len) {
continue; /* need more data */
goto tryagain;
}
#ifdef IPSYNC_DEBUG
if (sh->sm_cmd == SMC_CREATE) {
sl = (synclogent_t *)buff;
} else if (sh->sm_cmd == SMC_UPDATE) {
su = (syncupdent_t *)buff;
if (sh->sm_p == IPPROTO_TCP) {
printf(" TCP Update: age %lu state %d/%d\n",
su->sup_tcp.stu_age,
su->sup_tcp.stu_state[0],
su->sup_tcp.stu_state[1]);
}
} else {
printf("Unknown command\n");
}
#endif
n2 = sizeof(*sh) + len;
n3 = write(lfd, buff, n2);
if (n3 <= 0) {
syslog(LOG_ERR, "%s: Write error: %m",
IPSYNC_NAME);
goto tryagain;
}
if (n3 != n2) {
syslog(LOG_ERR, "%s: Incomplete write (%d/%d)",
IPSYNC_NAME, n3, n2);
goto tryagain;
}
/* signal received? */
if (terminate)
break;
/* move buffer to the front,we might need to make
* this more efficient, by using a rolling pointer
* over the buffer and only copying it, when
* we are reaching the end
*/
inbuf -= n2;
if (inbuf) {
bcopy(buff+n2, buff, inbuf);
printf("More data in buffer\n");
goto moreinbuf;
}
}
if (terminate)
break;
tryagain:
sleep(1);
}
/* terminate */
if (lfd != -1)
close(lfd);
if (nfd != -1)
close(nfd);
syslog(LOG_ERR, "signal %d received, exiting...", terminate);
exit(1);
}
diff --git a/sbin/ipf/ipftest/ip_fil.c b/sbin/ipf/ipftest/ip_fil.c
index f5955ddffdfe..6222015f164d 100644
--- a/sbin/ipf/ipftest/ip_fil.c
+++ b/sbin/ipf/ipftest/ip_fil.c
@@ -1,812 +1,811 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ip_fil.c 2.41 6/5/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include "ipf.h"
#include "md5.h"
#include "ipt.h"
ipf_main_softc_t ipfmain;
static struct ifnet **ifneta = NULL;
static int nifs = 0;
struct rtentry;
static void ipf_setifpaddr(struct ifnet *, char *);
void init_ifp(void);
static int no_output(struct ifnet *, struct mbuf *,
struct sockaddr *, struct rtentry *);
static int write_output(struct ifnet *, struct mbuf *,
struct sockaddr *, struct rtentry *);
struct ifaddr {
struct sockaddr_storage ifa_addr;
};
int
ipfattach(softc)
ipf_main_softc_t *softc;
{
return (0);
}
int
ipfdetach(softc)
ipf_main_softc_t *softc;
{
return (0);
}
/*
* Filter ioctl interface.
*/
int
ipfioctl(softc, dev, cmd, data, mode)
ipf_main_softc_t *softc;
int dev;
ioctlcmd_t cmd;
caddr_t data;
int mode;
{
int error = 0, unit = 0, uid;
uid = getuid();
unit = dev;
SPL_NET(s);
error = ipf_ioctlswitch(softc, unit, data, cmd, mode, uid, NULL);
if (error != -1) {
SPL_X(s);
return (error);
}
SPL_X(s);
return (error);
}
void
ipf_forgetifp(softc, ifp)
ipf_main_softc_t *softc;
void *ifp;
{
register frentry_t *f;
WRITE_ENTER(&softc->ipf_mutex);
for (f = softc->ipf_acct[0][softc->ipf_active]; (f != NULL);
f = f->fr_next)
if (f->fr_ifa == ifp)
f->fr_ifa = (void *)-1;
for (f = softc->ipf_acct[1][softc->ipf_active]; (f != NULL);
f = f->fr_next)
if (f->fr_ifa == ifp)
f->fr_ifa = (void *)-1;
for (f = softc->ipf_rules[0][softc->ipf_active]; (f != NULL);
f = f->fr_next)
if (f->fr_ifa == ifp)
f->fr_ifa = (void *)-1;
for (f = softc->ipf_rules[1][softc->ipf_active]; (f != NULL);
f = f->fr_next)
if (f->fr_ifa == ifp)
f->fr_ifa = (void *)-1;
RWLOCK_EXIT(&softc->ipf_mutex);
ipf_nat_sync(softc, ifp);
ipf_lookup_sync(softc, ifp);
}
static int
no_output(ifp, m, s, rt)
struct rtentry *rt;
struct ifnet *ifp;
struct mbuf *m;
struct sockaddr *s;
{
return (0);
}
static int
write_output(ifp, m, s, rt)
struct rtentry *rt;
struct ifnet *ifp;
struct mbuf *m;
struct sockaddr *s;
{
char fname[32];
mb_t *mb;
ip_t *ip;
int fd;
mb = (mb_t *)m;
ip = MTOD(mb, ip_t *);
#if (defined(NetBSD) && (NetBSD <= 1991011) && (NetBSD >= 199606)) || \
defined(__FreeBSD__)
sprintf(fname, "/tmp/%s", ifp->if_xname);
#else
sprintf(fname, "/tmp/%s%d", ifp->if_name, ifp->if_unit);
#endif
fd = open(fname, O_WRONLY|O_APPEND);
if (fd == -1) {
perror("open");
return (-1);
}
write(fd, (char *)ip, ntohs(ip->ip_len));
close(fd);
return (0);
}
static void
ipf_setifpaddr(ifp, addr)
struct ifnet *ifp;
char *addr;
{
struct ifaddr *ifa;
#if defined(__NetBSD__) || defined(__FreeBSD__)
if (ifp->if_addrlist.tqh_first != NULL)
#else
if (ifp->if_addrlist != NULL)
#endif
return;
ifa = (struct ifaddr *)malloc(sizeof(*ifa));
#if defined(__NetBSD__) || defined(__FreeBSD__)
ifp->if_addrlist.tqh_first = ifa;
#else
ifp->if_addrlist = ifa;
#endif
if (ifa != NULL) {
struct sockaddr_in *sin;
sin = (struct sockaddr_in *)&ifa->ifa_addr;
#ifdef USE_INET6
if (index(addr, ':') != NULL) {
struct sockaddr_in6 *sin6;
sin6 = (struct sockaddr_in6 *)&ifa->ifa_addr;
sin6->sin6_family = AF_INET6;
/* Abort if bad address. */
switch (inet_pton(AF_INET6, addr, &sin6->sin6_addr))
{
case 1:
break;
case -1:
perror("inet_pton");
abort();
break;
default:
abort();
break;
}
} else
#endif
{
sin->sin_family = AF_INET;
sin->sin_addr.s_addr = inet_addr(addr);
if (sin->sin_addr.s_addr == 0)
abort();
}
}
}
struct ifnet *
get_unit(name, family)
char *name;
int family;
{
struct ifnet *ifp, **ifpp, **old_ifneta;
char *addr;
#if (defined(NetBSD) && (NetBSD <= 1991011) && (NetBSD >= 199606)) || \
defined(__FreeBSD__)
if (!*name)
return (NULL);
if (name == NULL)
name = "anon0";
addr = strchr(name, '=');
if (addr != NULL)
*addr++ = '\0';
for (ifpp = ifneta; ifpp && (ifp = *ifpp); ifpp++) {
if (!strcmp(name, ifp->if_xname)) {
if (addr != NULL)
ipf_setifpaddr(ifp, addr);
return (ifp);
}
}
#else
char *s, ifname[LIFNAMSIZ+1];
if (name == NULL)
name = "anon0";
addr = strchr(name, '=');
if (addr != NULL)
*addr++ = '\0';
for (ifpp = ifneta; ifpp && (ifp = *ifpp); ifpp++) {
COPYIFNAME(family, ifp, ifname);
if (!strcmp(name, ifname)) {
if (addr != NULL)
ipf_setifpaddr(ifp, addr);
return (ifp);
}
}
#endif
if (!ifneta) {
ifneta = (struct ifnet **)malloc(sizeof(ifp) * 2);
if (!ifneta)
return (NULL);
ifneta[1] = NULL;
ifneta[0] = (struct ifnet *)calloc(1, sizeof(*ifp));
if (!ifneta[0]) {
free(ifneta);
return (NULL);
}
nifs = 1;
} else {
old_ifneta = ifneta;
nifs++;
ifneta = (struct ifnet **)reallocarray(ifneta, nifs + 1,
sizeof(ifp));
if (!ifneta) {
free(old_ifneta);
nifs = 0;
return (NULL);
}
ifneta[nifs] = NULL;
ifneta[nifs - 1] = (struct ifnet *)malloc(sizeof(*ifp));
if (!ifneta[nifs - 1]) {
nifs--;
return (NULL);
}
}
ifp = ifneta[nifs - 1];
#if defined(__NetBSD__) || defined(__FreeBSD__)
TAILQ_INIT(&ifp->if_addrlist);
#endif
#if (defined(NetBSD) && (NetBSD <= 1991011) && (NetBSD >= 199606)) || \
defined(__FreeBSD__)
(void) strncpy(ifp->if_xname, name, sizeof(ifp->if_xname));
#else
s = name + strlen(name) - 1;
for (; s > name; s--) {
if (!ISDIGIT(*s)) {
s++;
break;
}
}
if ((s > name) && (*s != 0) && ISDIGIT(*s)) {
ifp->if_unit = atoi(s);
ifp->if_name = (char *)malloc(s - name + 1);
(void) strncpy(ifp->if_name, name, s - name);
ifp->if_name[s - name] = '\0';
} else {
ifp->if_name = strdup(name);
ifp->if_unit = -1;
}
#endif
ifp->if_output = (void *)no_output;
if (addr != NULL) {
ipf_setifpaddr(ifp, addr);
}
return (ifp);
}
char *
get_ifname(ifp)
struct ifnet *ifp;
{
static char ifname[LIFNAMSIZ];
#if defined(__NetBSD__) || defined(__FreeBSD__)
sprintf(ifname, "%s", ifp->if_xname);
#else
if (ifp->if_unit != -1)
sprintf(ifname, "%s%d", ifp->if_name, ifp->if_unit);
else
strcpy(ifname, ifp->if_name);
#endif
return (ifname);
}
void
init_ifp()
{
struct ifnet *ifp, **ifpp;
char fname[32];
int fd;
#if (defined(NetBSD) && (NetBSD <= 1991011) && (NetBSD >= 199606)) || \
defined(__FreeBSD__)
for (ifpp = ifneta; ifpp && (ifp = *ifpp); ifpp++) {
ifp->if_output = (void *)write_output;
sprintf(fname, "/tmp/%s", ifp->if_xname);
fd = open(fname, O_WRONLY|O_CREAT|O_EXCL|O_TRUNC, 0600);
if (fd == -1)
perror("open");
else
close(fd);
}
#else
for (ifpp = ifneta; ifpp && (ifp = *ifpp); ifpp++) {
ifp->if_output = (void *)write_output;
sprintf(fname, "/tmp/%s%d", ifp->if_name, ifp->if_unit);
fd = open(fname, O_WRONLY|O_CREAT|O_EXCL|O_TRUNC, 0600);
if (fd == -1)
perror("open");
else
close(fd);
}
#endif
}
int
ipf_fastroute(m, mpp, fin, fdp)
mb_t *m, **mpp;
fr_info_t *fin;
frdest_t *fdp;
{
struct ifnet *ifp;
ip_t *ip = fin->fin_ip;
frdest_t node;
int error = 0;
frentry_t *fr;
void *sifp;
int sout;
sifp = fin->fin_ifp;
sout = fin->fin_out;
fr = fin->fin_fr;
ip->ip_sum = 0;
if (!(fr->fr_flags & FR_KEEPSTATE) && (fdp != NULL) &&
(fdp->fd_type == FRD_DSTLIST)) {
bzero(&node, sizeof(node));
ipf_dstlist_select_node(fin, fdp->fd_ptr, NULL, &node);
fdp = &node;
}
ifp = fdp->fd_ptr;
if (ifp == NULL)
return (0; /* no routing table out here */);
if (fin->fin_out == 0) {
fin->fin_ifp = ifp;
fin->fin_out = 1;
(void) ipf_acctpkt(fin, NULL);
fin->fin_fr = NULL;
if (!fr || !(fr->fr_flags & FR_RETMASK)) {
u_32_t pass;
(void) ipf_state_check(fin, &pass);
}
switch (ipf_nat_checkout(fin, NULL))
{
case 0 :
break;
case 1 :
ip->ip_sum = 0;
break;
case -1 :
error = -1;
goto done;
break;
}
}
m->mb_ifp = ifp;
printpacket(fin->fin_out, m);
(*ifp->if_output)(ifp, (void *)m, NULL, 0);
done:
fin->fin_ifp = sifp;
fin->fin_out = sout;
return (error);
}
int
ipf_send_reset(fin)
fr_info_t *fin;
{
ipfkverbose("- TCP RST sent\n");
return (0);
}
int
ipf_send_icmp_err(type, fin, dst)
int type;
fr_info_t *fin;
int dst;
{
ipfkverbose("- ICMP unreachable sent\n");
return (0);
}
void
m_freem(m)
mb_t *m;
{
return;
}
void
m_copydata(m, off, len, cp)
mb_t *m;
int off, len;
caddr_t cp;
{
bcopy((char *)m + off, cp, len);
}
int
ipfuiomove(buf, len, rwflag, uio)
caddr_t buf;
int len, rwflag;
struct uio *uio;
{
int left, ioc, num, offset;
struct iovec *io;
char *start;
if (rwflag == UIO_READ) {
left = len;
ioc = 0;
offset = uio->uio_offset;
while ((left > 0) && (ioc < uio->uio_iovcnt)) {
io = uio->uio_iov + ioc;
num = io->iov_len;
if (num > left)
num = left;
start = (char *)io->iov_base + offset;
if (start > (char *)io->iov_base + io->iov_len) {
offset -= io->iov_len;
ioc++;
continue;
}
bcopy(buf, start, num);
uio->uio_resid -= num;
uio->uio_offset += num;
left -= num;
if (left > 0)
ioc++;
}
if (left > 0)
return (EFAULT);
}
return (0);
}
u_32_t
ipf_newisn(fin)
fr_info_t *fin;
{
static int iss_seq_off = 0;
u_char hash[16];
u_32_t newiss;
MD5_CTX ctx;
/*
* Compute the base value of the ISS. It is a hash
* of (saddr, sport, daddr, dport, secret).
*/
MD5Init(&ctx);
MD5Update(&ctx, (u_char *) &fin->fin_fi.fi_src,
sizeof(fin->fin_fi.fi_src));
MD5Update(&ctx, (u_char *) &fin->fin_fi.fi_dst,
sizeof(fin->fin_fi.fi_dst));
MD5Update(&ctx, (u_char *) &fin->fin_dat, sizeof(fin->fin_dat));
/* MD5Update(&ctx, ipf_iss_secret, sizeof(ipf_iss_secret)); */
MD5Final(hash, &ctx);
memcpy(&newiss, hash, sizeof(newiss));
/*
* Now increment our "timer", and add it in to
* the computed value.
*
* XXX Use `addin'?
* XXX TCP_ISSINCR too large to use?
*/
iss_seq_off += 0x00010000;
newiss += iss_seq_off;
return (newiss);
}
/* ------------------------------------------------------------------------ */
/* Function: ipf_nextipid */
/* Returns: int - 0 == success, -1 == error (packet should be droppped) */
/* Parameters: fin(I) - pointer to packet information */
/* */
/* Returns the next IPv4 ID to use for this packet. */
/* ------------------------------------------------------------------------ */
inline u_short
ipf_nextipid(fin)
fr_info_t *fin;
{
static u_short ipid = 0;
ipf_main_softc_t *softc = fin->fin_main_soft;
u_short id;
MUTEX_ENTER(&softc->ipf_rw);
if (fin->fin_pktnum != 0) {
/*
* The -1 is for aligned test results.
*/
id = (fin->fin_pktnum - 1) & 0xffff;
} else {
}
id = ipid++;
MUTEX_EXIT(&softc->ipf_rw);
return (id);
}
inline int
ipf_checkv4sum(fin)
fr_info_t *fin;
{
if (fin->fin_flx & FI_SHORT)
return (1);
if (ipf_checkl4sum(fin) == -1) {
fin->fin_flx |= FI_BAD;
return (-1);
}
return (0);
}
#ifdef USE_INET6
inline int
ipf_checkv6sum(fin)
fr_info_t *fin;
{
if (fin->fin_flx & FI_SHORT)
return (1);
if (ipf_checkl4sum(fin) == -1) {
fin->fin_flx |= FI_BAD;
return (-1);
}
return (0);
}
#endif
#if 0
/*
* See above for description, except that all addressing is in user space.
*/
int
copyoutptr(softc, src, dst, size)
void *src, *dst;
size_t size;
{
caddr_t ca;
bcopy(dst, (char *)&ca, sizeof(ca));
bcopy(src, ca, size);
return (0);
}
/*
* See above for description, except that all addressing is in user space.
*/
int
copyinptr(src, dst, size)
void *src, *dst;
size_t size;
{
caddr_t ca;
bcopy(src, (char *)&ca, sizeof(ca));
bcopy(ca, dst, size);
return (0);
}
#endif
/*
* return the first IP Address associated with an interface
*/
int
ipf_ifpaddr(softc, v, atype, ifptr, inp, inpmask)
ipf_main_softc_t *softc;
int v, atype;
void *ifptr;
i6addr_t *inp, *inpmask;
{
struct ifnet *ifp = ifptr;
struct ifaddr *ifa;
#if defined(__NetBSD__) || defined(__FreeBSD__)
ifa = ifp->if_addrlist.tqh_first;
#else
ifa = ifp->if_addrlist;
#endif
if (ifa != NULL) {
if (v == 4) {
struct sockaddr_in *sin, mask;
mask.sin_addr.s_addr = 0xffffffff;
sin = (struct sockaddr_in *)&ifa->ifa_addr;
return (ipf_ifpfillv4addr(atype, sin, &mask,
&inp->in4, &inpmask->in4));
}
#ifdef USE_INET6
if (v == 6) {
struct sockaddr_in6 *sin6, mask;
sin6 = (struct sockaddr_in6 *)&ifa->ifa_addr;
((i6addr_t *)&mask.sin6_addr)->i6[0] = 0xffffffff;
((i6addr_t *)&mask.sin6_addr)->i6[1] = 0xffffffff;
((i6addr_t *)&mask.sin6_addr)->i6[2] = 0xffffffff;
((i6addr_t *)&mask.sin6_addr)->i6[3] = 0xffffffff;
return (ipf_ifpfillv6addr(atype, sin6, &mask,
inp, inpmask));
}
#endif
}
return (0);
}
/*
* This function is not meant to be random, rather just produce a
* sequence of numbers that isn't linear to show "randomness".
*/
u_32_t
ipf_random()
{
static unsigned int last = 0xa5a5a5a5;
static int calls = 0;
int number;
calls++;
/*
* These are deliberately chosen to ensure that there is some
* attempt to test whether the output covers the range in test n18.
*/
switch (calls)
{
case 1 :
number = 0;
break;
case 2 :
number = 4;
break;
case 3 :
number = 3999;
break;
case 4 :
number = 4000;
break;
case 5 :
number = 48999;
break;
case 6 :
number = 49000;
break;
default :
number = last;
last *= calls;
last++;
number ^= last;
break;
}
return (number);
}
int
ipf_verifysrc(fin)
fr_info_t *fin;
{
return (1);
}
int
ipf_inject(fin, m)
fr_info_t *fin;
mb_t *m;
{
FREE_MB_T(m);
return (0);
}
u_int
ipf_pcksum(fin, hlen, sum)
fr_info_t *fin;
int hlen;
u_int sum;
{
u_short *sp;
u_int sum2;
int slen;
slen = fin->fin_plen - hlen;
sp = (u_short *)((u_char *)fin->fin_ip + hlen);
for (; slen > 1; slen -= 2)
sum += *sp++;
if (slen)
sum += ntohs(*(u_char *)sp << 8);
while (sum > 0xffff)
sum = (sum & 0xffff) + (sum >> 16);
sum2 = (u_short)(~sum & 0xffff);
return (sum2);
}
void *
ipf_pullup(m, fin, plen)
mb_t *m;
fr_info_t *fin;
int plen;
{
if (M_LEN(m) >= plen)
return (fin->fin_ip);
/*
* Fake ipf_pullup failing
*/
fin->fin_reason = FRB_PULLUP;
*fin->fin_mp = NULL;
fin->fin_m = NULL;
fin->fin_ip = NULL;
return (NULL);
}
diff --git a/sbin/ipf/ipftest/ipftest.c b/sbin/ipf/ipftest/ipftest.c
index e7a0d71fffca..d83d47884089 100644
--- a/sbin/ipf/ipftest/ipftest.c
+++ b/sbin/ipf/ipftest/ipftest.c
@@ -1,715 +1,714 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
#include "ipt.h"
#include <sys/ioctl.h>
#include <sys/file.h>
#if !defined(lint)
static const char sccsid[] = "@(#)ipt.c 1.19 6/3/96 (C) 1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
extern char *optarg;
extern struct ipread pcap, iptext, iphex;
extern struct ifnet *get_unit(char *, int);
extern void init_ifp(void);
extern ipnat_t *natparse(char *, int);
extern hostmap_t **ipf_hm_maptable;
extern hostmap_t *ipf_hm_maplist;
ipfmutex_t ipl_mutex, ipf_auth_mx, ipf_rw, ipf_stinsert;
ipfmutex_t ipf_nat_new, ipf_natio, ipf_timeoutlock;
ipfrwlock_t ipf_mutex, ipf_global, ipf_ipidfrag, ip_poolrw, ipf_frcache;
ipfrwlock_t ipf_frag, ipf_state, ipf_nat, ipf_natfrag, ipf_authlk;
ipfrwlock_t ipf_tokens;
int opts = OPT_DONTOPEN;
int use_inet6 = 0;
int docksum = 0;
int pfil_delayed_copy = 0;
int main(int, char *[]);
int loadrules(char *, int);
int kmemcpy(char *, long, int);
int kstrncpy(char *, long, int n);
int blockreason;
void dumpnat(void *);
void dumpgroups(ipf_main_softc_t *);
void dumprules(frentry_t *);
void drain_log(char *);
void fixv4sums(mb_t *, ip_t *);
int ipftestioctl(int, ioctlcmd_t, ...);
int ipnattestioctl(int, ioctlcmd_t, ...);
int ipstatetestioctl(int, ioctlcmd_t, ...);
int ipauthtestioctl(int, ioctlcmd_t, ...);
int ipscantestioctl(int, ioctlcmd_t, ...);
int ipsynctestioctl(int, ioctlcmd_t, ...);
int ipooltestioctl(int, ioctlcmd_t, ...);
static ioctlfunc_t iocfunctions[IPL_LOGSIZE] = { ipftestioctl,
ipnattestioctl,
ipstatetestioctl,
ipauthtestioctl,
ipsynctestioctl,
ipscantestioctl,
ipooltestioctl,
NULL };
static ipf_main_softc_t *softc = NULL;
int
main(int argc, char *argv[])
{
char *datain, *iface, *ifname, *logout;
int fd, i, dir, c, loaded, dump, hlen;
struct in_addr sip;
struct ifnet *ifp;
struct ipread *r;
mb_t mb, *m, *n;
ip_t *ip;
m = &mb;
dir = 0;
dump = 0;
hlen = 0;
loaded = 0;
r = &iptext;
iface = NULL;
logout = NULL;
datain = NULL;
sip.s_addr = 0;
ifname = "anon0";
initparse();
ipf_load_all();
softc = ipf_create_all(NULL);
if (softc == NULL)
exit(1);
if (ipf_init_all(softc) == -1)
exit(1);
i = 1;
if (ipftestioctl(IPL_LOGIPF, SIOCFRENB, &i) != 0)
exit(1);
while ((c = getopt(argc, argv, "6bCdDF:i:I:l:N:P:or:RS:T:vxX")) != -1)
switch (c)
{
case '6' :
#ifdef USE_INET6
use_inet6 = 1;
#else
fprintf(stderr, "IPv6 not supported\n");
exit(1);
#endif
break;
case 'b' :
opts |= OPT_BRIEF;
break;
case 'd' :
opts |= OPT_DEBUG;
break;
case 'C' :
docksum = 1;
break;
case 'D' :
dump = 1;
break;
case 'F' :
if (strcasecmp(optarg, "pcap") == 0)
r = &pcap;
else if (strcasecmp(optarg, "hex") == 0)
r = &iphex;
else if (strcasecmp(optarg, "text") == 0)
r = &iptext;
break;
case 'i' :
datain = optarg;
break;
case 'I' :
ifname = optarg;
break;
case 'l' :
logout = optarg;
break;
case 'N' :
if (ipnat_parsefile(-1, ipnat_addrule, ipnattestioctl,
optarg) == -1)
return (-1);
loaded = 1;
opts |= OPT_NAT;
break;
case 'o' :
opts |= OPT_SAVEOUT;
break;
case 'P' :
if (ippool_parsefile(-1, optarg, ipooltestioctl) == -1)
return (-1);
loaded = 1;
break;
case 'r' :
if (ipf_parsefile(-1, ipf_addrule, iocfunctions,
optarg) == -1)
return (-1);
loaded = 1;
break;
case 'S' :
sip.s_addr = inet_addr(optarg);
break;
case 'R' :
opts |= OPT_NORESOLVE;
break;
case 'T' :
ipf_dotuning(-1, optarg, ipftestioctl);
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
case 'x' :
opts |= OPT_HEX;
break;
}
if (loaded == 0) {
(void)fprintf(stderr,"no rules loaded\n");
exit(-1);
}
if (opts & OPT_SAVEOUT)
init_ifp();
if (datain)
fd = (*r->r_open)(datain);
else
fd = (*r->r_open)("-");
if (fd < 0) {
perror("error opening input");
exit(-1);
}
m->m_data = (char *)m->mb_buf;
while ((i = (*r->r_readip)(m, &iface, &dir)) > 0) {
if ((iface == NULL) || (*iface == '\0'))
iface = ifname;
ip = MTOD(m, ip_t *);
ifp = get_unit(iface, IP_V(ip));
if (IP_V(ip) == 4) {
if ((r->r_flags & R_DO_CKSUM) || docksum)
fixv4sums(m, ip);
hlen = IP_HL(ip) << 2;
if (sip.s_addr)
dir = !(sip.s_addr == ip->ip_src.s_addr);
}
#ifdef USE_INET6
else
hlen = sizeof(ip6_t);
#endif
/* ipfr_slowtimer(); */
blockreason = 0;
m = &mb;
m->mb_ifp = ifp;
m->mb_len = i;
i = ipf_check(softc, ip, hlen, ifp, dir, &m);
if ((opts & OPT_NAT) == 0)
switch (i)
{
case -4 :
(void)printf("preauth");
break;
case -3 :
(void)printf("account");
break;
case -2 :
(void)printf("auth");
break;
case -1 :
(void)printf("block");
break;
case 0 :
(void)printf("pass");
break;
case 1 :
if (m == NULL)
(void)printf("bad-packet");
else
(void)printf("nomatch");
break;
case 3 :
(void)printf("block return-rst");
break;
case 4 :
(void)printf("block return-icmp");
break;
case 5 :
(void)printf("block return-icmp-as-dest");
break;
default :
(void)printf("recognised( return %#x\n", i));
break;
}
if (!(opts & OPT_BRIEF)) {
putchar(' ');
if (m != NULL)
printpacket(dir, m);
else
printpacket(dir, &mb);
printf("--------------");
} else if ((opts & (OPT_BRIEF|OPT_NAT)) ==
(OPT_NAT|OPT_BRIEF)) {
if (m != NULL)
printpacket(dir, m);
else
PRINTF("%d\n", blockreason);
}
ipf_state_flush(softc, 1, 0);
if (dir && (ifp != NULL) && IP_V(ip) && (m != NULL))
(*ifp->if_output)(ifp, (void *)m, NULL, 0);
while ((m != NULL) && (m != &mb)) {
n = m->mb_next;
freembt(m);
m = n;
}
if ((opts & (OPT_BRIEF|OPT_NAT)) != (OPT_NAT|OPT_BRIEF))
putchar('\n');
dir = 0;
if (iface != ifname) {
free(iface);
iface = ifname;
}
m = &mb;
m->mb_data = (char *)m->mb_buf;
}
if (i != 0)
fprintf(stderr, "readip failed: %d\n", i);
(*r->r_close)();
if (logout != NULL) {
drain_log(logout);
}
if (dump == 1) {
dumpnat(softc->ipf_nat_soft);
ipf_state_dump(softc, softc->ipf_state_soft);
ipf_lookup_dump(softc, softc->ipf_state_soft);
dumpgroups(softc);
}
ipf_fini_all(softc);
ipf_destroy_all(softc);
ipf_unload_all();
ipf_mutex_clean();
ipf_rwlock_clean();
if (getenv("FINDLEAKS")) {
fflush(stdout);
abort();
}
return (0);
}
int ipftestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGIPF, cmd, data, FWRITE|FREAD);
if (opts & OPT_DEBUG)
fprintf(stderr, "ipfioctl(IPF,%#x,%p) = %d (%d)\n",
(u_int)cmd, data, i, softc->ipf_interror);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
ipnattestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGNAT, cmd, data, FWRITE|FREAD);
if (opts & OPT_DEBUG)
fprintf(stderr, "ipfioctl(NAT,%#x,%p) = %d\n",
(u_int)cmd, data, i);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
ipstatetestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGSTATE, cmd, data, FWRITE|FREAD);
if ((opts & OPT_DEBUG) || (i != 0))
fprintf(stderr, "ipfioctl(STATE,%#x,%p) = %d\n",
(u_int)cmd, data, i);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
ipauthtestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGAUTH, cmd, data, FWRITE|FREAD);
if ((opts & OPT_DEBUG) || (i != 0))
fprintf(stderr, "ipfioctl(AUTH,%#x,%p) = %d\n",
(u_int)cmd, data, i);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
ipscantestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGSCAN, cmd, data, FWRITE|FREAD);
if ((opts & OPT_DEBUG) || (i != 0))
fprintf(stderr, "ipfioctl(SCAN,%#x,%p) = %d\n",
(u_int)cmd, data, i);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
ipsynctestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGSYNC, cmd, data, FWRITE|FREAD);
if ((opts & OPT_DEBUG) || (i != 0))
fprintf(stderr, "ipfioctl(SYNC,%#x,%p) = %d\n",
(u_int)cmd, data, i);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
ipooltestioctl(int dev, ioctlcmd_t cmd, ...)
{
caddr_t data;
va_list ap;
int i;
dev = dev; /* gcc -Wextra */
va_start(ap, cmd);
data = va_arg(ap, caddr_t);
va_end(ap);
i = ipfioctl(softc, IPL_LOGLOOKUP, cmd, data, FWRITE|FREAD);
if ((opts & OPT_DEBUG) || (i != 0))
fprintf(stderr, "ipfioctl(POOL,%#x,%p) = %d (%d)\n",
(u_int)cmd, data, i, softc->ipf_interror);
if (i != 0) {
errno = i;
return (-1);
}
return (0);
}
int
kmemcpy(char *addr, long offset, int size)
{
bcopy((char *)offset, addr, size);
return (0);
}
int
kstrncpy(char *buf, long pos, int n)
{
char *ptr;
ptr = (char *)pos;
while ((n > 0) && (*buf++ = *ptr++))
;
return (0);
}
/*
* Display the built up NAT table rules and mapping entries.
*/
void
dumpnat(void *arg)
{
ipf_nat_softc_t *softn = arg;
hostmap_t *hm;
ipnat_t *ipn;
nat_t *nat;
printf("List of active MAP/Redirect filters:\n");
for (ipn = softn->ipf_nat_list; ipn != NULL; ipn = ipn->in_next)
printnat(ipn, opts & (OPT_DEBUG|OPT_VERBOSE));
printf("\nList of active sessions:\n");
for (nat = softn->ipf_nat_instances; nat; nat = nat->nat_next) {
printactivenat(nat, opts, 0);
if (nat->nat_aps)
printf("\tproxy active\n");
}
printf("\nHostmap table:\n");
for (hm = softn->ipf_hm_maplist; hm != NULL; hm = hm->hm_next)
printhostmap(hm, hm->hm_hv);
}
void
dumpgroups(ipf_main_softc_t *softc)
{
frgroup_t *fg;
int i;
printf("List of groups configured (set 0)\n");
for (i = 0; i < IPL_LOGSIZE; i++)
for (fg = softc->ipf_groups[i][0]; fg != NULL;
fg = fg->fg_next) {
printf("Dev.%d. Group %s Ref %d Flags %#x\n",
i, fg->fg_name, fg->fg_ref, fg->fg_flags);
dumprules(fg->fg_start);
}
printf("List of groups configured (set 1)\n");
for (i = 0; i < IPL_LOGSIZE; i++)
for (fg = softc->ipf_groups[i][1]; fg != NULL;
fg = fg->fg_next) {
printf("Dev.%d. Group %s Ref %d Flags %#x\n",
i, fg->fg_name, fg->fg_ref, fg->fg_flags);
dumprules(fg->fg_start);
}
printf("Rules configured (set 0, in)\n");
dumprules(softc->ipf_rules[0][0]);
printf("Rules configured (set 0, out)\n");
dumprules(softc->ipf_rules[1][0]);
printf("Rules configured (set 1, in)\n");
dumprules(softc->ipf_rules[0][1]);
printf("Rules configured (set 1, out)\n");
dumprules(softc->ipf_rules[1][1]);
printf("Accounting rules configured (set 0, in)\n");
dumprules(softc->ipf_acct[0][0]);
printf("Accounting rules configured (set 0, out)\n");
dumprules(softc->ipf_acct[0][1]);
printf("Accounting rules configured (set 1, in)\n");
dumprules(softc->ipf_acct[1][0]);
printf("Accounting rules configured (set 1, out)\n");
dumprules(softc->ipf_acct[1][1]);
}
void
dumprules(frentry_t *rulehead)
{
frentry_t *fr;
for (fr = rulehead; fr != NULL; fr = fr->fr_next) {
#ifdef USE_QUAD_T
printf("%"PRIu64" ",(unsigned long long)fr->fr_hits);
#else
printf("%ld ", fr->fr_hits);
#endif
printfr(fr, ipftestioctl);
}
}
void
drain_log(char *filename)
{
char buffer[DEFAULT_IPFLOGSIZE];
struct iovec iov;
struct uio uio;
size_t resid;
int fd, i;
fd = open(filename, O_CREAT|O_TRUNC|O_WRONLY, 0644);
if (fd == -1) {
perror("drain_log:open");
return;
}
for (i = 0; i <= IPL_LOGMAX; i++)
while (1) {
bzero((char *)&iov, sizeof(iov));
iov.iov_base = buffer;
iov.iov_len = sizeof(buffer);
bzero((char *)&uio, sizeof(uio));
uio.uio_iov = &iov;
uio.uio_iovcnt = 1;
uio.uio_resid = iov.iov_len;
resid = uio.uio_resid;
if (ipf_log_read(softc, i, &uio) == 0) {
/*
* If nothing was read then break out.
*/
if (uio.uio_resid == resid)
break;
write(fd, buffer, resid - uio.uio_resid);
} else
break;
}
close(fd);
}
void
fixv4sums(mb_t *m, ip_t *ip)
{
u_char *csump, *hdr, p;
fr_info_t tmp;
int len;
p = 0;
len = 0;
bzero((char *)&tmp, sizeof(tmp));
csump = (u_char *)ip;
if (IP_V(ip) == 4) {
ip->ip_sum = 0;
ip->ip_sum = ipf_cksum((u_short *)ip, IP_HL(ip) << 2);
tmp.fin_hlen = IP_HL(ip) << 2;
csump += IP_HL(ip) << 2;
p = ip->ip_p;
len = ntohs(ip->ip_len);
#ifdef USE_INET6
} else if (IP_V(ip) == 6) {
tmp.fin_hlen = sizeof(ip6_t);
csump += sizeof(ip6_t);
p = ((ip6_t *)ip)->ip6_nxt;
len = ntohs(((ip6_t *)ip)->ip6_plen);
len += sizeof(ip6_t);
#endif
}
tmp.fin_plen = len;
tmp.fin_dlen = len - tmp.fin_hlen;
switch (p)
{
case IPPROTO_TCP :
hdr = csump;
csump += offsetof(tcphdr_t, th_sum);
break;
case IPPROTO_UDP :
hdr = csump;
csump += offsetof(udphdr_t, uh_sum);
break;
case IPPROTO_ICMP :
hdr = csump;
csump += offsetof(icmphdr_t, icmp_cksum);
break;
default :
csump = NULL;
hdr = NULL;
break;
}
if (hdr != NULL) {
tmp.fin_m = m;
tmp.fin_mp = &m;
tmp.fin_dp = hdr;
tmp.fin_ip = ip;
tmp.fin_plen = len;
*csump = 0;
*(u_short *)csump = fr_cksum(&tmp, ip, p, hdr);
}
}
void
ip_fillid(struct ip *ip)
{
static uint16_t ip_id;
ip->ip_id = ip_id++;
}
diff --git a/sbin/ipf/ipftest/md5.c b/sbin/ipf/ipftest/md5.c
index d27430b1f212..54c0ac1ed5b0 100644
--- a/sbin/ipf/ipftest/md5.c
+++ b/sbin/ipf/ipftest/md5.c
@@ -1,302 +1,301 @@
-/* $FreeBSD$ */
/*
***********************************************************************
** md5.c -- the source code for MD5 routines **
** RSA Data Security, Inc. MD5 Message-Digest Algorithm **
** Created: 2/17/90 RLR **
** Revised: 1/91 SRD,AJ,BSK,JT Reference C ver., 7/10 constant corr. **
***********************************************************************
*/
/*
***********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** License to copy and use this software is granted provided that **
** it is identified as the "RSA Data Security, Inc. MD5 Message- **
** Digest Algorithm" in all material mentioning or referencing this **
** software or this function. **
** **
** License is also granted to make and use derivative works **
** provided that such works are identified as "derived from the RSA **
** Data Security, Inc. MD5 Message-Digest Algorithm" in all **
** material mentioning or referencing the derived work. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
***********************************************************************
*/
# if defined(_KERNEL)
# include <sys/systm.h>
# else
# include <string.h>
# endif
#include "md5.h"
/*
***********************************************************************
** Message-digest routines: **
** To form the message digest for a message M **
** (1) Initialize a context buffer mdContext using MD5Init **
** (2) Call MD5Update on mdContext and M **
** (3) Call MD5Final on mdContext **
** The message digest is now in mdContext->digest[0...15] **
***********************************************************************
*/
/* forward declaration */
static void Transform(UINT4 *, UINT4 *);
static unsigned char PADDING[64] = {
0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
/* F, G, H and I are basic MD5 functions */
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))
/* ROTATE_LEFT rotates x left n bits */
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
/* Rotation is separate from addition to prevent recomputation */
#define FF(a, b, c, d, x, s, ac) \
{(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define GG(a, b, c, d, x, s, ac) \
{(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define HH(a, b, c, d, x, s, ac) \
{(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define II(a, b, c, d, x, s, ac) \
{(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define UL(x) x##U
/* The routine MD5Init initializes the message-digest context
mdContext. All fields are set to zero.
*/
void MD5Init (MD5_CTX *mdContext)
{
mdContext->i[0] = mdContext->i[1] = (UINT4)0;
/* Load magic initialization constants.
*/
mdContext->buf[0] = (UINT4)0x67452301;
mdContext->buf[1] = (UINT4)0xefcdab89;
mdContext->buf[2] = (UINT4)0x98badcfe;
mdContext->buf[3] = (UINT4)0x10325476;
}
/* The routine MD5Update updates the message-digest context to
account for the presence of each of the characters inBuf[0..inLen-1]
in the message whose digest is being computed.
*/
void MD5Update (MD5_CTX *mdContext, unsigned char *inBuf, unsigned int inLen)
{
UINT4 in[16];
int mdi;
unsigned int i, ii;
/* compute number of bytes mod 64 */
mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
/* update number of bits */
if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
mdContext->i[1]++;
mdContext->i[0] += ((UINT4)inLen << 3);
mdContext->i[1] += ((UINT4)inLen >> 29);
while (inLen--) {
/* add new character to buffer, increment mdi */
mdContext->in[mdi++] = *inBuf++;
/* transform if necessary */
if (mdi == 0x40) {
for (i = 0, ii = 0; i < 16; i++, ii += 4)
in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
(((UINT4)mdContext->in[ii+2]) << 16) |
(((UINT4)mdContext->in[ii+1]) << 8) |
((UINT4)mdContext->in[ii]);
Transform (mdContext->buf, in);
mdi = 0;
}
}
}
/* The routine MD5Final terminates the message-digest computation and
ends with the desired message digest in mdContext->digest[0...15].
*/
void MD5Final (unsigned char hash[], MD5_CTX *mdContext)
{
UINT4 in[16];
int mdi;
unsigned int i, ii;
unsigned int padLen;
/* save number of bits */
in[14] = mdContext->i[0];
in[15] = mdContext->i[1];
/* compute number of bytes mod 64 */
mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
/* pad out to 56 mod 64 */
padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
MD5Update (mdContext, PADDING, padLen);
/* append length in bits and transform */
for (i = 0, ii = 0; i < 14; i++, ii += 4)
in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
(((UINT4)mdContext->in[ii+2]) << 16) |
(((UINT4)mdContext->in[ii+1]) << 8) |
((UINT4)mdContext->in[ii]);
Transform (mdContext->buf, in);
/* store buffer in digest */
for (i = 0, ii = 0; i < 4; i++, ii += 4) {
mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
mdContext->digest[ii+1] =
(unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
mdContext->digest[ii+2] =
(unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
mdContext->digest[ii+3] =
(unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
}
bcopy((char *)mdContext->digest, (char *)hash, 16);
}
/* Basic MD5 step. Transforms buf based on in.
*/
static void Transform (UINT4 *buf, UINT4 *in)
{
UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
/* Round 1 */
#define S11 7
#define S12 12
#define S13 17
#define S14 22
FF ( a, b, c, d, in[ 0], S11, UL(3614090360)); /* 1 */
FF ( d, a, b, c, in[ 1], S12, UL(3905402710)); /* 2 */
FF ( c, d, a, b, in[ 2], S13, UL( 606105819)); /* 3 */
FF ( b, c, d, a, in[ 3], S14, UL(3250441966)); /* 4 */
FF ( a, b, c, d, in[ 4], S11, UL(4118548399)); /* 5 */
FF ( d, a, b, c, in[ 5], S12, UL(1200080426)); /* 6 */
FF ( c, d, a, b, in[ 6], S13, UL(2821735955)); /* 7 */
FF ( b, c, d, a, in[ 7], S14, UL(4249261313)); /* 8 */
FF ( a, b, c, d, in[ 8], S11, UL(1770035416)); /* 9 */
FF ( d, a, b, c, in[ 9], S12, UL(2336552879)); /* 10 */
FF ( c, d, a, b, in[10], S13, UL(4294925233)); /* 11 */
FF ( b, c, d, a, in[11], S14, UL(2304563134)); /* 12 */
FF ( a, b, c, d, in[12], S11, UL(1804603682)); /* 13 */
FF ( d, a, b, c, in[13], S12, UL(4254626195)); /* 14 */
FF ( c, d, a, b, in[14], S13, UL(2792965006)); /* 15 */
FF ( b, c, d, a, in[15], S14, UL(1236535329)); /* 16 */
/* Round 2 */
#define S21 5
#define S22 9
#define S23 14
#define S24 20
GG ( a, b, c, d, in[ 1], S21, UL(4129170786)); /* 17 */
GG ( d, a, b, c, in[ 6], S22, UL(3225465664)); /* 18 */
GG ( c, d, a, b, in[11], S23, UL( 643717713)); /* 19 */
GG ( b, c, d, a, in[ 0], S24, UL(3921069994)); /* 20 */
GG ( a, b, c, d, in[ 5], S21, UL(3593408605)); /* 21 */
GG ( d, a, b, c, in[10], S22, UL( 38016083)); /* 22 */
GG ( c, d, a, b, in[15], S23, UL(3634488961)); /* 23 */
GG ( b, c, d, a, in[ 4], S24, UL(3889429448)); /* 24 */
GG ( a, b, c, d, in[ 9], S21, UL( 568446438)); /* 25 */
GG ( d, a, b, c, in[14], S22, UL(3275163606)); /* 26 */
GG ( c, d, a, b, in[ 3], S23, UL(4107603335)); /* 27 */
GG ( b, c, d, a, in[ 8], S24, UL(1163531501)); /* 28 */
GG ( a, b, c, d, in[13], S21, UL(2850285829)); /* 29 */
GG ( d, a, b, c, in[ 2], S22, UL(4243563512)); /* 30 */
GG ( c, d, a, b, in[ 7], S23, UL(1735328473)); /* 31 */
GG ( b, c, d, a, in[12], S24, UL(2368359562)); /* 32 */
/* Round 3 */
#define S31 4
#define S32 11
#define S33 16
#define S34 23
HH ( a, b, c, d, in[ 5], S31, UL(4294588738)); /* 33 */
HH ( d, a, b, c, in[ 8], S32, UL(2272392833)); /* 34 */
HH ( c, d, a, b, in[11], S33, UL(1839030562)); /* 35 */
HH ( b, c, d, a, in[14], S34, UL(4259657740)); /* 36 */
HH ( a, b, c, d, in[ 1], S31, UL(2763975236)); /* 37 */
HH ( d, a, b, c, in[ 4], S32, UL(1272893353)); /* 38 */
HH ( c, d, a, b, in[ 7], S33, UL(4139469664)); /* 39 */
HH ( b, c, d, a, in[10], S34, UL(3200236656)); /* 40 */
HH ( a, b, c, d, in[13], S31, UL( 681279174)); /* 41 */
HH ( d, a, b, c, in[ 0], S32, UL(3936430074)); /* 42 */
HH ( c, d, a, b, in[ 3], S33, UL(3572445317)); /* 43 */
HH ( b, c, d, a, in[ 6], S34, UL( 76029189)); /* 44 */
HH ( a, b, c, d, in[ 9], S31, UL(3654602809)); /* 45 */
HH ( d, a, b, c, in[12], S32, UL(3873151461)); /* 46 */
HH ( c, d, a, b, in[15], S33, UL( 530742520)); /* 47 */
HH ( b, c, d, a, in[ 2], S34, UL(3299628645)); /* 48 */
/* Round 4 */
#define S41 6
#define S42 10
#define S43 15
#define S44 21
II ( a, b, c, d, in[ 0], S41, UL(4096336452)); /* 49 */
II ( d, a, b, c, in[ 7], S42, UL(1126891415)); /* 50 */
II ( c, d, a, b, in[14], S43, UL(2878612391)); /* 51 */
II ( b, c, d, a, in[ 5], S44, UL(4237533241)); /* 52 */
II ( a, b, c, d, in[12], S41, UL(1700485571)); /* 53 */
II ( d, a, b, c, in[ 3], S42, UL(2399980690)); /* 54 */
II ( c, d, a, b, in[10], S43, UL(4293915773)); /* 55 */
II ( b, c, d, a, in[ 1], S44, UL(2240044497)); /* 56 */
II ( a, b, c, d, in[ 8], S41, UL(1873313359)); /* 57 */
II ( d, a, b, c, in[15], S42, UL(4264355552)); /* 58 */
II ( c, d, a, b, in[ 6], S43, UL(2734768916)); /* 59 */
II ( b, c, d, a, in[13], S44, UL(1309151649)); /* 60 */
II ( a, b, c, d, in[ 4], S41, UL(4149444226)); /* 61 */
II ( d, a, b, c, in[11], S42, UL(3174756917)); /* 62 */
II ( c, d, a, b, in[ 2], S43, UL( 718787259)); /* 63 */
II ( b, c, d, a, in[ 9], S44, UL(3951481745)); /* 64 */
buf[0] += a;
buf[1] += b;
buf[2] += c;
buf[3] += d;
}
/*
***********************************************************************
** End of md5.c **
******************************** (cut) ********************************
*/
diff --git a/sbin/ipf/ipftest/md5.h b/sbin/ipf/ipftest/md5.h
index 6f59500daf19..ab94cd21eac7 100644
--- a/sbin/ipf/ipftest/md5.h
+++ b/sbin/ipf/ipftest/md5.h
@@ -1,64 +1,63 @@
-/* $FreeBSD$ */
/*
***********************************************************************
** md5.h -- header file for implementation of MD5 **
** RSA Data Security, Inc. MD5 Message-Digest Algorithm **
** Created: 2/17/90 RLR **
** Revised: 12/27/90 SRD,AJ,BSK,JT Reference C version **
** Revised (for MD5): RLR 4/27/91 **
** -- G modified to have y&~z instead of y&z **
** -- FF, GG, HH modified to add in last register done **
** -- Access pattern: round 2 works mod 5, round 3 works mod 3 **
** -- distinct additive constant for each step **
** -- round 4 added, working mod 7 **
***********************************************************************
*/
/*
***********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** License to copy and use this software is granted provided that **
** it is identified as the "RSA Data Security, Inc. MD5 Message- **
** Digest Algorithm" in all material mentioning or referencing this **
** software or this function. **
** **
** License is also granted to make and use derivative works **
** provided that such works are identified as "derived from the RSA **
** Data Security, Inc. MD5 Message-Digest Algorithm" in all **
** material mentioning or referencing the derived work. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
***********************************************************************
*/
#if !defined(__MD5_INCLUDE__) && !defined(_SYS_MD5_H)
#ifndef __P
# define __P(x) x
#endif
/* typedef a 32-bit type */
typedef unsigned int UINT4;
/* Data structure for MD5 (Message-Digest) computation */
typedef struct {
UINT4 i[2]; /* number of _bits_ handled mod 2^64 */
UINT4 buf[4]; /* scratch buffer */
unsigned char in[64]; /* input buffer */
unsigned char digest[16]; /* actual digest after MD5Final call */
} MD5_CTX;
extern void MD5Init(MD5_CTX *);
extern void MD5Update(MD5_CTX *, unsigned char *, unsigned int);
extern void MD5Final(unsigned char *, MD5_CTX *);
#define __MD5_INCLUDE__
#endif /* __MD5_INCLUDE__ */
diff --git a/sbin/ipf/iplang/iplang.h b/sbin/ipf/iplang/iplang.h
index f38ef9671701..acf8369afb15 100644
--- a/sbin/ipf/iplang/iplang.h
+++ b/sbin/ipf/iplang/iplang.h
@@ -1,54 +1,53 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
typedef struct iface {
int if_MTU;
char *if_name;
struct in_addr if_addr;
struct ether_addr if_eaddr;
struct iface *if_next;
int if_fd;
} iface_t;
typedef struct send {
struct iface *snd_if;
struct in_addr snd_gw;
} send_t;
typedef struct arp {
struct in_addr arp_addr;
struct ether_addr arp_eaddr;
struct arp *arp_next;
} arp_t;
typedef struct aniphdr {
union {
ip_t *ahu_ip;
char *ahu_data;
tcphdr_t *ahu_tcp;
udphdr_t *ahu_udp;
icmphdr_t *ahu_icmp;
} ah_un;
int ah_optlen;
int ah_lastopt;
int ah_p;
size_t ah_len;
struct aniphdr *ah_next;
struct aniphdr *ah_prev;
} aniphdr_t;
#define ah_ip ah_un.ahu_ip
#define ah_data ah_un.ahu_data
#define ah_tcp ah_un.ahu_tcp
#define ah_udp ah_un.ahu_udp
#define ah_icmp ah_un.ahu_icmp
extern int get_arpipv4(char *, char *);
diff --git a/sbin/ipf/iplang/iplang_l.l b/sbin/ipf/iplang/iplang_l.l
index 58538d8e4d1c..ce1ae2031454 100644
--- a/sbin/ipf/iplang/iplang_l.l
+++ b/sbin/ipf/iplang/iplang_l.l
@@ -1,317 +1,316 @@
-/* $FreeBSD$ */
%{
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <stdio.h>
#include <string.h>
#include <sys/param.h>
#if defined(__SVR4) || defined(__sysv__)
#include <sys/stream.h>
#endif
#include <sys/types.h>
#include <netinet/in_systm.h>
#include <netinet/in.h>
#include "iplang_y.h"
#include "ipf.h"
#ifndef __P
# define __P(x) x
#endif
extern int opts;
int lineNum = 0, ipproto = 0, oldipproto = 0, next = -1, laststate = 0;
int *prstack = NULL, numpr = 0, state = 0, token = 0;
void yyerror(char *);
void push_proto(void);
void pop_proto(void);
int next_state(int, int);
int next_item(int);
int save_token(void);
void swallow(void);
int yylex(void);
struct lwordtab {
char *word;
int state;
int next;
};
struct lwordtab words[] = {
{ "interface", IL_INTERFACE, -1 },
{ "iface", IL_INTERFACE, -1 },
{ "name", IL_IFNAME, IL_TOKEN },
{ "ifname", IL_IFNAME, IL_TOKEN },
{ "router", IL_DEFROUTER, IL_TOKEN },
{ "mtu", IL_MTU, IL_NUMBER },
{ "eaddr", IL_EADDR, IL_TOKEN },
{ "v4addr", IL_V4ADDR, IL_TOKEN },
{ "ipv4", IL_IPV4, -1 },
{ "v", IL_V4V, IL_TOKEN },
{ "proto", IL_V4PROTO, IL_TOKEN },
{ "hl", IL_V4HL, IL_TOKEN },
{ "id", IL_V4ID, IL_TOKEN },
{ "ttl", IL_V4TTL, IL_TOKEN },
{ "tos", IL_V4TOS, IL_TOKEN },
{ "src", IL_V4SRC, IL_TOKEN },
{ "dst", IL_V4DST, IL_TOKEN },
{ "opt", IL_OPT, -1 },
{ "len", IL_LEN, IL_TOKEN },
{ "off", IL_OFF, IL_TOKEN },
{ "sum", IL_SUM, IL_TOKEN },
{ "tcp", IL_TCP, -1 },
{ "sport", IL_SPORT, IL_TOKEN },
{ "dport", IL_DPORT, IL_TOKEN },
{ "seq", IL_TCPSEQ, IL_TOKEN },
{ "ack", IL_TCPACK, IL_TOKEN },
{ "flags", IL_TCPFL, IL_TOKEN },
{ "urp", IL_TCPURP, IL_TOKEN },
{ "win", IL_TCPWIN, IL_TOKEN },
{ "udp", IL_UDP, -1 },
{ "send", IL_SEND, -1 },
{ "via", IL_VIA, IL_TOKEN },
{ "arp", IL_ARP, -1 },
{ "data", IL_DATA, -1 },
{ "value", IL_DVALUE, IL_TOKEN },
{ "file", IL_DFILE, IL_TOKEN },
{ "nop", IL_IPO_NOP, -1 },
{ "eol", IL_IPO_EOL, -1 },
{ "rr", IL_IPO_RR, -1 },
{ "zsu", IL_IPO_ZSU, -1 },
{ "mtup", IL_IPO_MTUP, -1 },
{ "mtur", IL_IPO_MTUR, -1 },
{ "encode", IL_IPO_ENCODE, -1 },
{ "ts", IL_IPO_TS, -1 },
{ "tr", IL_IPO_TR, -1 },
{ "sec", IL_IPO_SEC, -1 },
{ "secclass", IL_IPO_SECCLASS, IL_TOKEN },
{ "lsrr", IL_IPO_LSRR, -1 },
{ "esec", IL_IPO_ESEC, -1 },
{ "cipso", IL_IPO_CIPSO, -1 },
{ "satid", IL_IPO_SATID, -1 },
{ "ssrr", IL_IPO_SSRR, -1 },
{ "addext", IL_IPO_ADDEXT, -1 },
{ "visa", IL_IPO_VISA, -1 },
{ "imitd", IL_IPO_IMITD, -1 },
{ "eip", IL_IPO_EIP, -1 },
{ "finn", IL_IPO_FINN, -1 },
{ "mss", IL_TCPO_MSS, IL_TOKEN },
{ "wscale", IL_TCPO_WSCALE, IL_TOKEN },
{ "reserv-4", IL_IPS_RESERV4, -1 },
{ "topsecret", IL_IPS_TOPSECRET, -1 },
{ "secret", IL_IPS_SECRET, -1 },
{ "reserv-3", IL_IPS_RESERV3, -1 },
{ "confid", IL_IPS_CONFID, -1 },
{ "unclass", IL_IPS_UNCLASS, -1 },
{ "reserv-2", IL_IPS_RESERV2, -1 },
{ "reserv-1", IL_IPS_RESERV1, -1 },
{ "icmp", IL_ICMP, -1 },
{ "type", IL_ICMPTYPE, -1 },
{ "code", IL_ICMPCODE, -1 },
{ "echorep", IL_ICMP_ECHOREPLY, -1 },
{ "unreach", IL_ICMP_UNREACH, -1 },
{ "squench", IL_ICMP_SOURCEQUENCH, -1 },
{ "redir", IL_ICMP_REDIRECT, -1 },
{ "echo", IL_ICMP_ECHO, -1 },
{ "routerad", IL_ICMP_ROUTERADVERT, -1 },
{ "routersol", IL_ICMP_ROUTERSOLICIT, -1 },
{ "timex", IL_ICMP_TIMXCEED, -1 },
{ "paramprob", IL_ICMP_PARAMPROB, -1 },
{ "timest", IL_ICMP_TSTAMP, -1 },
{ "timestrep", IL_ICMP_TSTAMPREPLY, -1 },
{ "inforeq", IL_ICMP_IREQ, -1 },
{ "inforep", IL_ICMP_IREQREPLY, -1 },
{ "maskreq", IL_ICMP_MASKREQ, -1 },
{ "maskrep", IL_ICMP_MASKREPLY, -1 },
{ "net-unr", IL_ICMP_UNREACH_NET, -1 },
{ "host-unr", IL_ICMP_UNREACH_HOST, -1 },
{ "proto-unr", IL_ICMP_UNREACH_PROTOCOL, -1 },
{ "port-unr", IL_ICMP_UNREACH_PORT, -1 },
{ "needfrag", IL_ICMP_UNREACH_NEEDFRAG, -1 },
{ "srcfail", IL_ICMP_UNREACH_SRCFAIL, -1 },
{ "net-unk", IL_ICMP_UNREACH_NET_UNKNOWN, -1 },
{ "host-unk", IL_ICMP_UNREACH_HOST_UNKNOWN, -1 },
{ "isolate", IL_ICMP_UNREACH_ISOLATED, -1 },
{ "net-prohib", IL_ICMP_UNREACH_NET_PROHIB, -1 },
{ "host-prohib", IL_ICMP_UNREACH_HOST_PROHIB, -1 },
{ "net-tos", IL_ICMP_UNREACH_TOSNET, -1 },
{ "host-tos", IL_ICMP_UNREACH_TOSHOST, -1 },
{ "filter-prohib", IL_ICMP_UNREACH_FILTER_PROHIB, -1 },
{ "host-preced", IL_ICMP_UNREACH_HOST_PRECEDENCE, -1 },
{ "cutoff-preced", IL_ICMP_UNREACH_PRECEDENCE_CUTOFF, -1 },
{ "net-redir", IL_ICMP_REDIRECT_NET, -1 },
{ "host-redir", IL_ICMP_REDIRECT_HOST, -1 },
{ "tos-net-redir", IL_ICMP_REDIRECT_TOSNET, -1 },
{ "tos-host-redir", IL_ICMP_REDIRECT_TOSHOST, -1 },
{ "intrans", IL_ICMP_TIMXCEED_INTRANS, -1 },
{ "reass", IL_ICMP_TIMXCEED_REASS, -1 },
{ "optabsent", IL_ICMP_PARAMPROB_OPTABSENT, -1 },
{ "otime", IL_ICMP_OTIME, -1 },
{ "rtime", IL_ICMP_RTIME, -1 },
{ "ttime", IL_ICMP_TTIME, -1 },
{ "icmpseq", IL_ICMP_SEQ, -1 },
{ "icmpid", IL_ICMP_SEQ, -1 },
{ ".", IL_DOT, -1 },
{ NULL, 0, 0 }
};
%}
white [ \t\r]+
%%
{white} ;
\n { lineNum++; swallow(); }
\{ {( push_proto(); return next_item('{'); });
\} {( pop_proto(); return next_item('}'); });
; {( return next_item(';'); });
[0-9]+ {( return next_item(IL_NUMBER); });
[0-9a-fA-F] {( return next_item(IL_HEXDIGIT); });
: {( return next_item(IL_COLON); });
#[^\n]* {( return next_item(IL_COMMENT); });
[^( \{\}\n\t;:{}]* { return next_item(IL_TOKEN); });
\"[^\"]*\" {( return next_item(IL_TOKEN); });
%%
void yyerror(msg)
char *msg;
{
fprintf(stderr, "%s error at \"%s\", line %d\n", msg, yytext,
lineNum + 1);
exit(1);
}
void push_proto(void)
{
numpr++;
if (!prstack)
prstack = (int *)malloc(sizeof(int));
else
prstack = (int *)reallocarray((char *)prstack, numpr,
sizeof(int));
prstack[numpr - 1] = oldipproto;
}
void pop_proto(void)
{
numpr--;
ipproto = prstack[numpr];
if (!numpr) {
free(prstack);
prstack = NULL;
return;
}
prstack = (int *)realloc((char *)prstack, numpr * sizeof(int));
}
int save_token(void)
{
yylval.str = strdup((char *)yytext);
return(IL_TOKEN);
}
int next_item(int nstate)
{
struct lwordtab *wt;
if (opts & OPT_DEBUG)
printf("text=[%s] id=%d next=%d\n", yytext, nstate, next);
if (next == IL_TOKEN) {
next = -1;
return(save_token());
}
token++;
for (wt = words; wt->word; wt++)
if (!strcasecmp(wt->word, (char *)yytext))
return(next_state(wt->state, wt->next));
if (opts & OPT_DEBUG)
printf("unknown keyword=[%s]\n", yytext);
next = -1;
if (nstate == IL_NUMBER)
yylval.num = atoi((char *)yytext);
token++;
return(nstate);
}
int next_state(int nstate, int fornext)
{
next = fornext;
switch (nstate)
{
case IL_IPV4 :
case IL_TCP :
case IL_UDP :
case IL_ICMP :
case IL_DATA :
case IL_INTERFACE :
case IL_ARP :
oldipproto = ipproto;
ipproto = nstate;
break;
case IL_SUM :
if (ipproto == IL_IPV4)
nstate = IL_V4SUM;
else if (ipproto == IL_TCP)
nstate = IL_TCPSUM;
else if (ipproto == IL_UDP)
nstate = IL_UDPSUM;
break;
case IL_OPT :
if (ipproto == IL_IPV4)
nstate = IL_V4OPT;
else if (ipproto == IL_TCP)
nstate = IL_TCPOPT;
break;
case IL_IPO_NOP :
if (ipproto == IL_TCP)
nstate = IL_TCPO_NOP;
break;
case IL_IPO_EOL :
if (ipproto == IL_TCP)
nstate = IL_TCPO_EOL;
break;
case IL_IPO_TS :
if (ipproto == IL_TCP)
nstate = IL_TCPO_TS;
break;
case IL_OFF :
if (ipproto == IL_IPV4)
nstate = IL_V4OFF;
else if (ipproto == IL_TCP)
nstate = IL_TCPOFF;
break;
case IL_LEN :
if (ipproto == IL_IPV4)
nstate = IL_V4LEN;
else if (ipproto == IL_UDP)
nstate = IL_UDPLEN;
break;
}
return(nstate);
}
void swallow(void)
{
int c;
c = input();
if (c == '#') {
while ((c != '\n') && (c != EOF))
c = input();
}
if (c != EOF)
unput(c);
}
diff --git a/sbin/ipf/iplang/iplang_y.y b/sbin/ipf/iplang/iplang_y.y
index efddeacbf9c6..c5c7c729e0a9 100644
--- a/sbin/ipf/iplang/iplang_y.y
+++ b/sbin/ipf/iplang/iplang_y.y
@@ -1,1756 +1,1755 @@
-/* $FreeBSD$ */
%{
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* Id: iplang_y.y,v 2.9.2.4 2006/03/17 12:11:29 darrenr Exp $
*/
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#if !defined(__SVR4) && !defined(__svr4__)
# include <strings.h>
#else
# include <sys/byteorder.h>
#endif
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/param.h>
#include <sys/time.h>
#include <stdlib.h>
#include <unistd.h>
#include <stddef.h>
#include <sys/socket.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
# include <netinet/ip_var.h>
# include <net/route.h>
# include <netinet/if_ether.h>
#include <netdb.h>
#include <arpa/nameser.h>
#include <arpa/inet.h>
#include <resolv.h>
#include <ctype.h>
#include "ipsend.h"
#include "ip_compat.h"
#include "ipf.h"
#include "iplang.h"
extern int opts;
extern struct ipopt_names ionames[];
extern int state, state, lineNum, token;
extern int yylineno;
extern char yytext[];
extern FILE *yyin;
int yylex __P((void));
#define YYDEBUG 1
int yydebug = 1;
iface_t *iflist = NULL, **iftail = &iflist;
iface_t *cifp = NULL;
arp_t *arplist = NULL, **arptail = &arplist, *carp = NULL;
struct in_addr defrouter;
send_t sending;
char *sclass = NULL;
u_short c_chksum(u_short *, u_int, u_long);
u_long p_chksum(u_short *, u_int);
u_long ipbuffer[67584/sizeof(u_long)]; /* 66K */
aniphdr_t *aniphead = NULL, *canip = NULL, **aniptail = &aniphead;
ip_t *ip = NULL;
udphdr_t *udp = NULL;
tcphdr_t *tcp = NULL;
icmphdr_t *icmp = NULL;
struct statetoopt {
int sto_st;
int sto_op;
};
struct in_addr getipv4addr(char *arg);
u_short getportnum(char *, char *);
struct ether_addr *geteaddr(char *, struct ether_addr *);
void *new_header(int);
void free_aniplist(void);
void inc_anipheaders(int);
void new_data(void);
void set_datalen(char **);
void set_datafile(char **);
void set_data(char **);
void new_packet(void);
void set_ipv4proto(char **);
void set_ipv4src(char **);
void set_ipv4dst(char **);
void set_ipv4off(char **);
void set_ipv4v(char **);
void set_ipv4hl(char **);
void set_ipv4ttl(char **);
void set_ipv4tos(char **);
void set_ipv4id(char **);
void set_ipv4sum(char **);
void set_ipv4len(char **);
void new_tcpheader(void);
void set_tcpsport(char **);
void set_tcpdport(char **);
void set_tcpseq(char **);
void set_tcpack(char **);
void set_tcpoff(char **);
void set_tcpurp(char **);
void set_tcpwin(char **);
void set_tcpsum(char **);
void set_tcpflags(char **);
void set_tcpopt(int, char **);
void end_tcpopt(void);
void new_udpheader(void);
void set_udplen(char **);
void set_udpsum(char **);
void prep_packet(void);
void packet_done(void);
void new_interface(void);
void check_interface(void);
void set_ifname(char **);
void set_ifmtu(int);
void set_ifv4addr(char **);
void set_ifeaddr(char **);
void new_arp(void);
void set_arpeaddr(char **);
void set_arpv4addr(char **);
void reset_send(void);
void set_sendif(char **);
void set_sendvia(char **);
void set_defaultrouter(char **);
void new_icmpheader(void);
void set_icmpcode(int);
void set_icmptype(int);
void set_icmpcodetok(char **);
void set_icmptypetok(char **);
void set_icmpid(int);
void set_icmpseq(int);
void set_icmpotime(int);
void set_icmprtime(int);
void set_icmpttime(int);
void set_icmpmtu(int);
void set_redir(int, char **);
void new_ipv4opt(void);
void set_icmppprob(int);
void add_ipopt(int, void *);
void end_ipopt(void);
void set_secclass(char **);
void free_anipheader(void);
void end_ipv4(void);
void end_icmp(void);
void end_udp(void);
void end_tcp(void);
void end_data(void);
void yyerror(char *);
void iplang(FILE *);
int arp_getipv4(char *, char *);
int yyparse(void);
%}
%union {
char *str;
int num;
}
%token <num> IL_NUMBER
%type <num> number digits optnumber
%token <str> IL_TOKEN
%type <str> token optoken
%token IL_HEXDIGIT IL_COLON IL_DOT IL_EOF IL_COMMENT
%token IL_INTERFACE IL_IFNAME IL_MTU IL_EADDR
%token IL_IPV4 IL_V4PROTO IL_V4SRC IL_V4DST IL_V4OFF IL_V4V IL_V4HL IL_V4TTL
%token IL_V4TOS IL_V4SUM IL_V4LEN IL_V4OPT IL_V4ID
%token IL_TCP IL_SPORT IL_DPORT IL_TCPFL IL_TCPSEQ IL_TCPACK IL_TCPOFF
%token IL_TCPWIN IL_TCPSUM IL_TCPURP IL_TCPOPT IL_TCPO_NOP IL_TCPO_EOL
%token IL_TCPO_MSS IL_TCPO_WSCALE IL_TCPO_TS
%token IL_UDP IL_UDPLEN IL_UDPSUM
%token IL_ICMP IL_ICMPTYPE IL_ICMPCODE
%token IL_SEND IL_VIA
%token IL_ARP
%token IL_DEFROUTER
%token IL_SUM IL_OFF IL_LEN IL_V4ADDR IL_OPT
%token IL_DATA IL_DLEN IL_DVALUE IL_DFILE
%token IL_IPO_NOP IL_IPO_RR IL_IPO_ZSU IL_IPO_MTUP IL_IPO_MTUR IL_IPO_EOL
%token IL_IPO_TS IL_IPO_TR IL_IPO_SEC IL_IPO_LSRR IL_IPO_ESEC
%token IL_IPO_SATID IL_IPO_SSRR IL_IPO_ADDEXT IL_IPO_VISA IL_IPO_IMITD
%token IL_IPO_EIP IL_IPO_FINN IL_IPO_SECCLASS IL_IPO_CIPSO IL_IPO_ENCODE
%token <str> IL_IPS_RESERV4 IL_IPS_TOPSECRET IL_IPS_SECRET IL_IPS_RESERV3
%token <str> IL_IPS_CONFID IL_IPS_UNCLASS IL_IPS_RESERV2 IL_IPS_RESERV1
%token IL_ICMP_ECHOREPLY IL_ICMP_UNREACH IL_ICMP_UNREACH_NET
%token IL_ICMP_UNREACH_HOST IL_ICMP_UNREACH_PROTOCOL IL_ICMP_UNREACH_PORT
%token IL_ICMP_UNREACH_NEEDFRAG IL_ICMP_UNREACH_SRCFAIL
%token IL_ICMP_UNREACH_NET_UNKNOWN IL_ICMP_UNREACH_HOST_UNKNOWN
%token IL_ICMP_UNREACH_ISOLATED IL_ICMP_UNREACH_NET_PROHIB
%token IL_ICMP_UNREACH_HOST_PROHIB IL_ICMP_UNREACH_TOSNET
%token IL_ICMP_UNREACH_TOSHOST IL_ICMP_UNREACH_FILTER_PROHIB
%token IL_ICMP_UNREACH_HOST_PRECEDENCE IL_ICMP_UNREACH_PRECEDENCE_CUTOFF
%token IL_ICMP_SOURCEQUENCH IL_ICMP_REDIRECT IL_ICMP_REDIRECT_NET
%token IL_ICMP_REDIRECT_HOST IL_ICMP_REDIRECT_TOSNET
%token IL_ICMP_REDIRECT_TOSHOST IL_ICMP_ECHO IL_ICMP_ROUTERADVERT
%token IL_ICMP_ROUTERSOLICIT IL_ICMP_TIMXCEED IL_ICMP_TIMXCEED_INTRANS
%token IL_ICMP_TIMXCEED_REASS IL_ICMP_PARAMPROB IL_ICMP_PARAMPROB_OPTABSENT
%token IL_ICMP_TSTAMP IL_ICMP_TSTAMPREPLY IL_ICMP_IREQ IL_ICMP_IREQREPLY
%token IL_ICMP_MASKREQ IL_ICMP_MASKREPLY IL_ICMP_SEQ IL_ICMP_ID
%token IL_ICMP_OTIME IL_ICMP_RTIME IL_ICMP_TTIME
%%
file: line
| line file
| IL_COMMENT
| IL_COMMENT file
;
line: iface
| arp
| send
| defrouter
| ipline
;
iface: ifhdr '{' ifaceopts '}' ';' { check_interface(); }
;
ifhdr: IL_INTERFACE { new_interface(); }
;
ifaceopts:
ifaceopt
| ifaceopt ifaceopts
;
ifaceopt:
IL_IFNAME token { set_ifname(&$2); }
| IL_MTU number { set_ifmtu($2); }
| IL_V4ADDR token { set_ifv4addr(&$2); }
| IL_EADDR token { set_ifeaddr(&$2); }
;
send: sendhdr '{' sendbody '}' ';' { packet_done(); }
| sendhdr ';' { packet_done(); }
;
sendhdr:
IL_SEND { reset_send(); }
;
sendbody:
sendopt
| sendbody sendopt
;
sendopt:
IL_IFNAME token { set_sendif(&$2); }
| IL_VIA token { set_sendvia(&$2); }
;
arp: arphdr '{' arpbody '}' ';'
;
arphdr: IL_ARP { new_arp(); }
;
arpbody:
arpopt
| arpbody arpopt
;
arpopt: IL_V4ADDR token { set_arpv4addr(&$2); }
| IL_EADDR token { set_arpeaddr(&$2); }
;
defrouter:
IL_DEFROUTER token { set_defaultrouter(&$2); }
;
bodyline:
ipline
| tcp tcpline
| udp udpline
| icmp icmpline
| data dataline
;
ipline: ipv4 '{' ipv4body '}' ';' { end_ipv4(); }
;
ipv4: IL_IPV4 { new_packet(); }
ipv4body:
ipv4type
| ipv4type ipv4body
| bodyline
;
ipv4type:
IL_V4PROTO token { set_ipv4proto(&$2); }
| IL_V4SRC token { set_ipv4src(&$2); }
| IL_V4DST token { set_ipv4dst(&$2); }
| IL_V4OFF token { set_ipv4off(&$2); }
| IL_V4V token { set_ipv4v(&$2); }
| IL_V4HL token { set_ipv4hl(&$2); }
| IL_V4ID token { set_ipv4id(&$2); }
| IL_V4TTL token { set_ipv4ttl(&$2); }
| IL_V4TOS token { set_ipv4tos(&$2); }
| IL_V4SUM token { set_ipv4sum(&$2); }
| IL_V4LEN token { set_ipv4len(&$2); }
| ipv4opt '{' ipv4optlist '}' ';' { end_ipopt(); }
;
tcp: IL_TCP { new_tcpheader(); }
;
tcpline:
'{' tcpheader '}' ';' { end_tcp(); }
;
tcpheader:
tcpbody
| tcpbody tcpheader
| bodyline
;
tcpbody:
IL_SPORT token { set_tcpsport(&$2); }
| IL_DPORT token { set_tcpdport(&$2); }
| IL_TCPSEQ token { set_tcpseq(&$2); }
| IL_TCPACK token { set_tcpack(&$2); }
| IL_TCPOFF token { set_tcpoff(&$2); }
| IL_TCPURP token { set_tcpurp(&$2); }
| IL_TCPWIN token { set_tcpwin(&$2); }
| IL_TCPSUM token { set_tcpsum(&$2); }
| IL_TCPFL token { set_tcpflags(&$2); }
| IL_TCPOPT '{' tcpopts '}' ';' { end_tcpopt(); }
;
tcpopts:
| tcpopt tcpopts
;
tcpopt: IL_TCPO_NOP ';' { set_tcpopt(IL_TCPO_NOP, NULL); }
| IL_TCPO_EOL ';' { set_tcpopt(IL_TCPO_EOL, NULL); }
| IL_TCPO_MSS optoken { set_tcpopt(IL_TCPO_MSS,&$2);}
| IL_TCPO_WSCALE optoken { set_tcpopt(IL_TCPO_WSCALE,&$2);}
| IL_TCPO_TS optoken { set_tcpopt(IL_TCPO_TS, &$2);}
;
udp: IL_UDP { new_udpheader(); }
;
udpline:
'{' udpheader '}' ';' { end_udp(); }
;
udpheader:
udpbody
| udpbody udpheader
| bodyline
;
udpbody:
IL_SPORT token { set_tcpsport(&$2); }
| IL_DPORT token { set_tcpdport(&$2); }
| IL_UDPLEN token { set_udplen(&$2); }
| IL_UDPSUM token { set_udpsum(&$2); }
;
icmp: IL_ICMP { new_icmpheader(); }
;
icmpline:
'{' icmpbody '}' ';' { end_icmp(); }
;
icmpbody:
icmpheader
| icmpheader bodyline
;
icmpheader:
IL_ICMPTYPE icmptype
| IL_ICMPTYPE icmptype icmpcode
;
icmpcode:
IL_ICMPCODE token { set_icmpcodetok(&$2); }
;
icmptype:
IL_ICMP_ECHOREPLY ';' { set_icmptype(ICMP_ECHOREPLY); }
| IL_ICMP_ECHOREPLY '{' icmpechoopts '}' ';'
| unreach
| IL_ICMP_SOURCEQUENCH ';' { set_icmptype(ICMP_SOURCEQUENCH); }
| redirect
| IL_ICMP_ROUTERADVERT ';' { set_icmptype(ICMP_ROUTERADVERT); }
| IL_ICMP_ROUTERSOLICIT ';' { set_icmptype(ICMP_ROUTERSOLICIT); }
| IL_ICMP_ECHO ';' { set_icmptype(ICMP_ECHO); }
| IL_ICMP_ECHO '{' icmpechoopts '}' ';'
| IL_ICMP_TIMXCEED ';' { set_icmptype(ICMP_TIMXCEED); }
| IL_ICMP_TIMXCEED '{' exceed '}' ';'
| IL_ICMP_TSTAMP ';' { set_icmptype(ICMP_TSTAMP); }
| IL_ICMP_TSTAMPREPLY ';' { set_icmptype(ICMP_TSTAMPREPLY); }
| IL_ICMP_TSTAMPREPLY '{' icmptsopts '}' ';'
| IL_ICMP_IREQ ';' { set_icmptype(ICMP_IREQ); }
| IL_ICMP_IREQREPLY ';' { set_icmptype(ICMP_IREQREPLY); }
| IL_ICMP_IREQREPLY '{' data dataline '}' ';'
| IL_ICMP_MASKREQ ';' { set_icmptype(ICMP_MASKREQ); }
| IL_ICMP_MASKREPLY ';' { set_icmptype(ICMP_MASKREPLY); }
| IL_ICMP_MASKREPLY '{' token '}' ';'
| IL_ICMP_PARAMPROB ';' { set_icmptype(ICMP_PARAMPROB); }
| IL_ICMP_PARAMPROB '{' paramprob '}' ';'
| IL_TOKEN ';' { set_icmptypetok(&$1); }
;
icmpechoopts:
| icmpechoopts icmpecho
;
icmpecho:
IL_ICMP_SEQ number { set_icmpseq($2); }
| IL_ICMP_ID number { set_icmpid($2); }
;
icmptsopts:
| icmptsopts icmpts ';'
;
icmpts: IL_ICMP_OTIME number { set_icmpotime($2); }
| IL_ICMP_RTIME number { set_icmprtime($2); }
| IL_ICMP_TTIME number { set_icmpttime($2); }
;
unreach:
IL_ICMP_UNREACH
| IL_ICMP_UNREACH '{' unreachopts '}' ';'
;
unreachopts:
IL_ICMP_UNREACH_NET line
| IL_ICMP_UNREACH_HOST line
| IL_ICMP_UNREACH_PROTOCOL line
| IL_ICMP_UNREACH_PORT line
| IL_ICMP_UNREACH_NEEDFRAG number ';' { set_icmpmtu($2); }
| IL_ICMP_UNREACH_SRCFAIL line
| IL_ICMP_UNREACH_NET_UNKNOWN line
| IL_ICMP_UNREACH_HOST_UNKNOWN line
| IL_ICMP_UNREACH_ISOLATED line
| IL_ICMP_UNREACH_NET_PROHIB line
| IL_ICMP_UNREACH_HOST_PROHIB line
| IL_ICMP_UNREACH_TOSNET line
| IL_ICMP_UNREACH_TOSHOST line
| IL_ICMP_UNREACH_FILTER_PROHIB line
| IL_ICMP_UNREACH_HOST_PRECEDENCE line
| IL_ICMP_UNREACH_PRECEDENCE_CUTOFF line
;
redirect:
IL_ICMP_REDIRECT
| IL_ICMP_REDIRECT '{' redirectopts '}' ';'
;
redirectopts:
| IL_ICMP_REDIRECT_NET token { set_redir(0, &$2); }
| IL_ICMP_REDIRECT_HOST token { set_redir(1, &$2); }
| IL_ICMP_REDIRECT_TOSNET token { set_redir(2, &$2); }
| IL_ICMP_REDIRECT_TOSHOST token { set_redir(3, &$2); }
;
exceed:
IL_ICMP_TIMXCEED_INTRANS line
| IL_ICMP_TIMXCEED_REASS line
;
paramprob:
IL_ICMP_PARAMPROB_OPTABSENT
| IL_ICMP_PARAMPROB_OPTABSENT paraprobarg
paraprobarg:
'{' number '}' ';' { set_icmppprob($2); }
;
ipv4opt: IL_V4OPT { new_ipv4opt(); }
;
ipv4optlist:
| ipv4opts ipv4optlist
;
ipv4opts:
IL_IPO_NOP ';' { add_ipopt(IL_IPO_NOP, NULL); }
| IL_IPO_RR optnumber { add_ipopt(IL_IPO_RR, &$2); }
| IL_IPO_ZSU ';' { add_ipopt(IL_IPO_ZSU, NULL); }
| IL_IPO_MTUP ';' { add_ipopt(IL_IPO_MTUP, NULL); }
| IL_IPO_MTUR ';' { add_ipopt(IL_IPO_MTUR, NULL); }
| IL_IPO_ENCODE ';' { add_ipopt(IL_IPO_ENCODE, NULL); }
| IL_IPO_TS ';' { add_ipopt(IL_IPO_TS, NULL); }
| IL_IPO_TR ';' { add_ipopt(IL_IPO_TR, NULL); }
| IL_IPO_SEC ';' { add_ipopt(IL_IPO_SEC, NULL); }
| IL_IPO_SECCLASS secclass { add_ipopt(IL_IPO_SECCLASS, sclass); }
| IL_IPO_LSRR token { add_ipopt(IL_IPO_LSRR,&$2); }
| IL_IPO_ESEC ';' { add_ipopt(IL_IPO_ESEC, NULL); }
| IL_IPO_CIPSO ';' { add_ipopt(IL_IPO_CIPSO, NULL); }
| IL_IPO_SATID optnumber { add_ipopt(IL_IPO_SATID,&$2);}
| IL_IPO_SSRR token { add_ipopt(IL_IPO_SSRR,&$2); }
| IL_IPO_ADDEXT ';' { add_ipopt(IL_IPO_ADDEXT, NULL); }
| IL_IPO_VISA ';' { add_ipopt(IL_IPO_VISA, NULL); }
| IL_IPO_IMITD ';' { add_ipopt(IL_IPO_IMITD, NULL); }
| IL_IPO_EIP ';' { add_ipopt(IL_IPO_EIP, NULL); }
| IL_IPO_FINN ';' { add_ipopt(IL_IPO_FINN, NULL); }
;
secclass:
IL_IPS_RESERV4 ';' { set_secclass(&$1); }
| IL_IPS_TOPSECRET ';' { set_secclass(&$1); }
| IL_IPS_SECRET ';' { set_secclass(&$1); }
| IL_IPS_RESERV3 ';' { set_secclass(&$1); }
| IL_IPS_CONFID ';' { set_secclass(&$1); }
| IL_IPS_UNCLASS ';' { set_secclass(&$1); }
| IL_IPS_RESERV2 ';' { set_secclass(&$1); }
| IL_IPS_RESERV1 ';' { set_secclass(&$1); }
;
data: IL_DATA { new_data(); }
;
dataline:
'{' databody '}' ';' { end_data(); }
;
databody: dataopts
| dataopts databody
;
dataopts:
IL_DLEN token { set_datalen(&$2); }
| IL_DVALUE token { set_data(&$2); }
| IL_DFILE token { set_datafile(&$2); }
;
token: IL_TOKEN ';'
;
optoken: ';' { $$ = ""; }
| token
;
number: digits ';'
;
optnumber: ';' { $$ = 0; }
| number
;
digits: IL_NUMBER
| digits IL_NUMBER
;
%%
struct statetoopt toipopts[] = {
{ IL_IPO_NOP, IPOPT_NOP },
{ IL_IPO_RR, IPOPT_RR },
{ IL_IPO_ZSU, IPOPT_ZSU },
{ IL_IPO_MTUP, IPOPT_MTUP },
{ IL_IPO_MTUR, IPOPT_MTUR },
{ IL_IPO_ENCODE, IPOPT_ENCODE },
{ IL_IPO_TS, IPOPT_TS },
{ IL_IPO_TR, IPOPT_TR },
{ IL_IPO_SEC, IPOPT_SECURITY },
{ IL_IPO_SECCLASS, IPOPT_SECURITY },
{ IL_IPO_LSRR, IPOPT_LSRR },
{ IL_IPO_ESEC, IPOPT_E_SEC },
{ IL_IPO_CIPSO, IPOPT_CIPSO },
{ IL_IPO_SATID, IPOPT_SATID },
{ IL_IPO_SSRR, IPOPT_SSRR },
{ IL_IPO_ADDEXT, IPOPT_ADDEXT },
{ IL_IPO_VISA, IPOPT_VISA },
{ IL_IPO_IMITD, IPOPT_IMITD },
{ IL_IPO_EIP, IPOPT_EIP },
{ IL_IPO_FINN, IPOPT_FINN },
{ 0, 0 }
};
struct statetoopt tosecopts[] = {
{ IL_IPS_RESERV4, IPSO_CLASS_RES4 },
{ IL_IPS_TOPSECRET, IPSO_CLASS_TOPS },
{ IL_IPS_SECRET, IPSO_CLASS_SECR },
{ IL_IPS_RESERV3, IPSO_CLASS_RES3 },
{ IL_IPS_CONFID, IPSO_CLASS_CONF },
{ IL_IPS_UNCLASS, IPSO_CLASS_UNCL },
{ IL_IPS_RESERV2, IPSO_CLASS_RES2 },
{ IL_IPS_RESERV1, IPSO_CLASS_RES1 },
{ 0, 0 }
};
struct in_addr getipv4addr(arg)
char *arg;
{
struct hostent *hp;
struct in_addr in;
in.s_addr = 0xffffffff;
if ((hp = gethostbyname(arg)))
bcopy(hp->h_addr, &in.s_addr, sizeof(struct in_addr));
else
in.s_addr = inet_addr(arg);
return(in);
}
u_short getportnum(pr, name)
char *pr, *name;
{
struct servent *sp;
if (!(sp = getservbyname(name, pr)))
return(htons(atoi(name)));
return(sp->s_port);
}
struct ether_addr *geteaddr(char *arg, struct ether_addr *buf)
{
struct ether_addr *e;
e = ether_aton(arg);
if (!e)
fprintf(stderr, "Invalid ethernet address: %s\n", arg);
else
# ifdef __FreeBSD__
bcopy(e->octet, buf->octet, sizeof(e->octet));
# else
bcopy(e->ether_addr_octet, buf->ether_addr_octet,
sizeof(e->ether_addr_octet));
# endif
return(e);
}
void *new_header(int type)
{
aniphdr_t *aip, *oip = canip;
int sz = 0;
aip = (aniphdr_t *)calloc(1, sizeof(*aip));
*aniptail = aip;
aniptail = &aip->ah_next;
aip->ah_p = type;
aip->ah_prev = oip;
canip = aip;
if (type == IPPROTO_UDP)
sz = sizeof(udphdr_t);
else if (type == IPPROTO_TCP)
sz = sizeof(tcphdr_t);
else if (type == IPPROTO_ICMP)
sz = sizeof(icmphdr_t);
else if (type == IPPROTO_IP)
sz = sizeof(ip_t);
if (oip)
canip->ah_data = oip->ah_data + oip->ah_len;
else
canip->ah_data = (char *)ipbuffer;
/*
* Increase the size fields in all wrapping headers.
*/
for (aip = aniphead; aip; aip = aip->ah_next) {
aip->ah_len += sz;
if (aip->ah_p == IPPROTO_IP)
aip->ah_ip->ip_len += sz;
else if (aip->ah_p == IPPROTO_UDP)
aip->ah_udp->uh_ulen += sz;
}
return(void *)canip->ah_data;
}
void free_aniplist(void)
{
aniphdr_t *aip, **aipp = &aniphead;
while ((aip = *aipp)) {
*aipp = aip->ah_next;
free(aip);
}
aniptail = &aniphead;
}
void inc_anipheaders(int inc)
{
aniphdr_t *aip;
for (aip = aniphead; aip; aip = aip->ah_next) {
aip->ah_len += inc;
if (aip->ah_p == IPPROTO_IP)
aip->ah_ip->ip_len += inc;
else if (aip->ah_p == IPPROTO_UDP)
aip->ah_udp->uh_ulen += inc;
}
}
void new_data(void)
{
(void) new_header(-1);
canip->ah_len = 0;
}
void set_datalen(char **arg)
{
int len;
len = strtol(*arg, NULL, 0);
inc_anipheaders(len);
free(*arg);
*arg = NULL;
}
void set_data(char **arg)
{
u_char *s = (u_char *)*arg, *t = (u_char *)canip->ah_data, c;
int len = 0, todo = 0, quote = 0, val = 0;
while ((c = *s++)) {
if (todo) {
if (ISDIGIT(c)) {
todo--;
if (c > '7') {
fprintf(stderr, "octal with %c!\n", c);
break;
}
val <<= 3;
val |= (c - '0');
}
if (!ISDIGIT(c) || !todo) {
*t++ = (u_char)(val & 0xff);
todo = 0;
}
if (todo)
continue;
}
if (quote) {
if (ISDIGIT(c)) {
todo = 2;
if (c > '7') {
fprintf(stderr, "octal with %c!\n", c);
break;
}
val = (c - '0');
} else {
switch (c)
{
case '\"' :
*t++ = '\"';
break;
case '\\' :
*t++ = '\\';
break;
case 'n' :
*t++ = '\n';
break;
case 'r' :
*t++ = '\r';
break;
case 't' :
*t++ = '\t';
break;
}
}
quote = 0;
continue;
}
if (c == '\\')
quote = 1;
else
*t++ = c;
}
if (todo)
*t++ = (u_char)(val & 0xff);
if (quote)
*t++ = '\\';
len = t - (u_char *)canip->ah_data;
inc_anipheaders(len - canip->ah_len);
canip->ah_len = len;
}
void set_datafile(char **arg)
{
struct stat sb;
char *file = *arg;
int fd, len;
if ((fd = open(file, O_RDONLY)) == -1) {
perror("open");
exit(-1);
}
if (fstat(fd, &sb) == -1) {
perror("fstat");
exit(-1);
}
if ((sb.st_size + aniphead->ah_len ) > 65535) {
fprintf(stderr, "data file %s too big to include.\n", file);
close(fd);
return;
}
if ((len = read(fd, canip->ah_data, sb.st_size)) == -1) {
perror("read");
close(fd);
return;
}
inc_anipheaders(len);
canip->ah_len += len;
close(fd);
}
void new_packet(void)
{
static u_short id = 0;
if (!aniphead)
bzero((char *)ipbuffer, sizeof(ipbuffer));
ip = (ip_t *)new_header(IPPROTO_IP);
ip->ip_v = IPVERSION;
ip->ip_hl = sizeof(ip_t) >> 2;
ip->ip_len = sizeof(ip_t);
ip->ip_ttl = 63;
ip->ip_id = htons(id++);
}
void set_ipv4proto(arg)
char **arg;
{
struct protoent *pr;
if ((pr = getprotobyname(*arg)))
ip->ip_p = pr->p_proto;
else
if (!(ip->ip_p = atoi(*arg)))
fprintf(stderr, "unknown protocol %s\n", *arg);
free(*arg);
*arg = NULL;
}
void set_ipv4src(char **arg)
{
ip->ip_src = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
void set_ipv4dst(char **arg)
{
ip->ip_dst = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
void set_ipv4off(char **arg)
{
ip->ip_off = htons(strtol(*arg, NULL, 0));
free(*arg);
*arg = NULL;
}
void set_ipv4v(char **arg)
{
ip->ip_v = strtol(*arg, NULL, 0);
free(*arg);
*arg = NULL;
}
void set_ipv4hl(char **arg)
{
int newhl, inc;
newhl = strtol(*arg, NULL, 0);
inc = (newhl - ip->ip_hl) << 2;
ip->ip_len += inc;
ip->ip_hl = newhl;
canip->ah_len += inc;
free(*arg);
*arg = NULL;
}
void set_ipv4ttl(char **arg)
{
ip->ip_ttl = strtol(*arg, NULL, 0);
free(*arg);
*arg = NULL;
}
void set_ipv4tos(char **arg)
{
ip->ip_tos = strtol(*arg, NULL, 0);
free(*arg);
*arg = NULL;
}
void set_ipv4id(char **arg)
{
ip->ip_id = htons(strtol(*arg, NULL, 0));
free(*arg);
*arg = NULL;
}
void set_ipv4sum(char **arg)
{
ip->ip_sum = strtol(*arg, NULL, 0);
free(*arg);
*arg = NULL;
}
void set_ipv4len(char **arg)
{
int len;
len = strtol(*arg, NULL, 0);
inc_anipheaders(len - ip->ip_len);
ip->ip_len = len;
free(*arg);
*arg = NULL;
}
void new_tcpheader(void)
{
if ((ip->ip_p) && (ip->ip_p != IPPROTO_TCP)) {
fprintf(stderr, "protocol %d specified with TCP!\n", ip->ip_p);
return;
}
ip->ip_p = IPPROTO_TCP;
tcp = (tcphdr_t *)new_header(IPPROTO_TCP);
tcp->th_win = htons(4096);
tcp->th_off = sizeof(*tcp) >> 2;
}
void set_tcpsport(char **arg)
{
u_short *port;
char *pr;
if (ip->ip_p == IPPROTO_UDP) {
port = &udp->uh_sport;
pr = "udp";
} else {
port = &tcp->th_sport;
pr = "udp";
}
*port = getportnum(pr, *arg);
free(*arg);
*arg = NULL;
}
void set_tcpdport(char **arg)
{
u_short *port;
char *pr;
if (ip->ip_p == IPPROTO_UDP) {
port = &udp->uh_dport;
pr = "udp";
} else {
port = &tcp->th_dport;
pr = "udp";
}
*port = getportnum(pr, *arg);
free(*arg);
*arg = NULL;
}
void set_tcpseq(char **arg)
{
tcp->th_seq = htonl(strtol(*arg, NULL, 0));
free(*arg);
*arg = NULL;
}
void set_tcpack(char **arg)
{
tcp->th_ack = htonl(strtol(*arg, NULL, 0));
free(*arg);
*arg = NULL;
}
void set_tcpoff(char **arg)
{
int off;
off = strtol(*arg, NULL, 0);
inc_anipheaders((off - tcp->th_off) << 2);
tcp->th_off = off;
free(*arg);
*arg = NULL;
}
void set_tcpurp(char **arg)
{
tcp->th_urp = htons(strtol(*arg, NULL, 0));
free(*arg);
*arg = NULL;
}
void set_tcpwin(char **arg)
{
tcp->th_win = htons(strtol(*arg, NULL, 0));
free(*arg);
*arg = NULL;
}
void set_tcpsum(char **arg)
{
tcp->th_sum = strtol(*arg, NULL, 0);
free(*arg);
*arg = NULL;
}
void set_tcpflags(char **arg)
{
static char flags[] = "ASURPF";
static int flagv[] = { TH_ACK, TH_SYN, TH_URG, TH_RST, TH_PUSH,
TH_FIN } ;
char *s, *t;
for (s = *arg; *s; s++)
if (!(t = strchr(flags, *s))) {
if (s - *arg) {
fprintf(stderr, "unknown TCP flag %c\n", *s);
break;
}
tcp->th_flags = strtol(*arg, NULL, 0);
break;
} else
tcp->th_flags |= flagv[t - flags];
free(*arg);
*arg = NULL;
}
void set_tcpopt(int state, char **arg)
{
u_char *s;
int val, len, val2, pad, optval;
if (arg && *arg)
val = atoi(*arg);
else
val = 0;
s = (u_char *)tcp + sizeof(*tcp) + canip->ah_optlen;
switch (state)
{
case IL_TCPO_EOL :
optval = 0;
len = 1;
break;
case IL_TCPO_NOP :
optval = 1;
len = 1;
break;
case IL_TCPO_MSS :
optval = 2;
len = 4;
break;
case IL_TCPO_WSCALE :
optval = 3;
len = 3;
break;
case IL_TCPO_TS :
optval = 8;
len = 10;
break;
default :
optval = 0;
len = 0;
break;
}
if (len > 1) {
/*
* prepend padding - if required.
*/
if (len & 3)
for (pad = 4 - (len & 3); pad; pad--) {
*s++ = 1;
canip->ah_optlen++;
}
/*
* build tcp option
*/
*s++ = (u_char)optval;
*s++ = (u_char)len;
if (len > 2) {
if (len == 3) { /* 1 byte - char */
*s++ = (u_char)val;
} else if (len == 4) { /* 2 bytes - short */
*s++ = (u_char)((val >> 8) & 0xff);
*s++ = (u_char)(val & 0xff);
} else if (len >= 6) { /* 4 bytes - long */
val2 = htonl(val);
bcopy((char *)&val2, s, 4);
}
s += (len - 2);
}
} else
*s++ = (u_char)optval;
canip->ah_lastopt = optval;
canip->ah_optlen += len;
if (arg && *arg) {
free(*arg);
*arg = NULL;
}
}
void end_tcpopt(void)
{
int pad;
char *s = (char *)tcp;
s += sizeof(*tcp) + canip->ah_optlen;
/*
* pad out so that we have a multiple of 4 bytes in size fo the
* options. make sure last byte is EOL.
*/
if (canip->ah_optlen & 3) {
if (canip->ah_lastopt != 1) {
for (pad = 3 - (canip->ah_optlen & 3); pad; pad--) {
*s++ = 1;
canip->ah_optlen++;
}
canip->ah_optlen++;
} else {
s -= 1;
for (pad = 3 - (canip->ah_optlen & 3); pad; pad--) {
*s++ = 1;
canip->ah_optlen++;
}
}
*s++ = 0;
}
tcp->th_off = (sizeof(*tcp) + canip->ah_optlen) >> 2;
inc_anipheaders(canip->ah_optlen);
}
void new_udpheader(void)
{
if ((ip->ip_p) && (ip->ip_p != IPPROTO_UDP)) {
fprintf(stderr, "protocol %d specified with UDP!\n", ip->ip_p);
return;
}
ip->ip_p = IPPROTO_UDP;
udp = (udphdr_t *)new_header(IPPROTO_UDP);
udp->uh_ulen = sizeof(*udp);
}
void set_udplen(arg)
char **arg;
{
int len;
len = strtol(*arg, NULL, 0);
inc_anipheaders(len - udp->uh_ulen);
udp->uh_ulen = len;
free(*arg);
*arg = NULL;
}
void set_udpsum(char **arg)
{
udp->uh_sum = strtol(*arg, NULL, 0);
free(*arg);
*arg = NULL;
}
void prep_packet(void)
{
iface_t *ifp;
struct in_addr gwip;
ifp = sending.snd_if;
if (!ifp) {
fprintf(stderr, "no interface defined for sending!\n");
return;
}
if (ifp->if_fd == -1)
ifp->if_fd = initdevice(ifp->if_name, 5);
gwip = sending.snd_gw;
if (!gwip.s_addr) {
if (aniphead == NULL) {
fprintf(stderr,
"no destination address defined for sending\n");
return;
}
gwip = aniphead->ah_ip->ip_dst;
}
(void) send_ip(ifp->if_fd, ifp->if_MTU, (ip_t *)ipbuffer, gwip, 2);
}
void packet_done(void)
{
char outline[80];
int i, j, k;
u_char *s = (u_char *)ipbuffer, *t = (u_char *)outline;
if (opts & OPT_VERBOSE) {
ip->ip_len = htons(ip->ip_len);
for (i = ntohs(ip->ip_len), j = 0; i; i--, j++, s++) {
if (j && !(j & 0xf)) {
*t++ = '\n';
*t = '\0';
fputs(outline, stdout);
fflush(stdout);
t = (u_char *)outline;
*t = '\0';
}
sprintf((char *)t, "%02x", *s & 0xff);
t += 2;
if (!((j + 1) & 0xf)) {
s -= 15;
sprintf((char *)t, " ");
t += 8;
for (k = 16; k; k--, s++)
*t++ = (isprint(*s) ? *s : '.');
s--;
}
if ((j + 1) & 0xf)
*t++ = ' ';;
}
if (j & 0xf) {
for (k = 16 - (j & 0xf); k; k--) {
*t++ = ' ';
*t++ = ' ';
*t++ = ' ';
}
sprintf((char *)t, " ");
t += 7;
s -= j & 0xf;
for (k = j & 0xf; k; k--, s++)
*t++ = (isprint(*s) ? *s : '.');
*t++ = '\n';
*t = '\0';
}
fputs(outline, stdout);
fflush(stdout);
ip->ip_len = ntohs(ip->ip_len);
}
prep_packet();
free_aniplist();
}
void new_interface(void)
{
cifp = (iface_t *)calloc(1, sizeof(iface_t));
*iftail = cifp;
iftail = &cifp->if_next;
cifp->if_fd = -1;
}
void check_interface(void)
{
if (!cifp->if_name || !*cifp->if_name)
fprintf(stderr, "No interface name given!\n");
if (!cifp->if_MTU || !*cifp->if_name)
fprintf(stderr, "Interface %s has an MTU of 0!\n",
cifp->if_name);
}
void set_ifname(char **arg)
{
cifp->if_name = *arg;
*arg = NULL;
}
void set_ifmtu(int arg)
{
cifp->if_MTU = arg;
}
void set_ifv4addr(char **arg)
{
cifp->if_addr = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
void set_ifeaddr(char **arg)
{
(void) geteaddr(*arg, &cifp->if_eaddr);
free(*arg);
*arg = NULL;
}
void new_arp(void)
{
carp = (arp_t *)calloc(1, sizeof(arp_t));
*arptail = carp;
arptail = &carp->arp_next;
}
void set_arpeaddr(char **arg)
{
(void) geteaddr(*arg, &carp->arp_eaddr);
free(*arg);
*arg = NULL;
}
void set_arpv4addr(char **arg)
{
carp->arp_addr = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
int arp_getipv4(char *ip, char *addr)
{
arp_t *a;
for (a = arplist; a; a = a->arp_next)
if (!bcmp(ip, (char *)&a->arp_addr, 4)) {
bcopy((char *)&a->arp_eaddr, addr, 6);
return(0);
}
return(-1);
}
void reset_send(void)
{
sending.snd_if = iflist;
sending.snd_gw = defrouter;
}
void set_sendif(char **arg)
{
iface_t *ifp;
for (ifp = iflist; ifp; ifp = ifp->if_next)
if (ifp->if_name && !strcmp(ifp->if_name, *arg))
break;
sending.snd_if = ifp;
if (!ifp)
fprintf(stderr, "couldn't find interface %s\n", *arg);
free(*arg);
*arg = NULL;
}
void set_sendvia(char **arg)
{
sending.snd_gw = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
void set_defaultrouter(char **arg)
{
defrouter = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
void new_icmpheader(void)
{
if ((ip->ip_p) && (ip->ip_p != IPPROTO_ICMP)) {
fprintf(stderr, "protocol %d specified with ICMP!\n",
ip->ip_p);
return;
}
ip->ip_p = IPPROTO_ICMP;
icmp = (icmphdr_t *)new_header(IPPROTO_ICMP);
}
void set_icmpcode(int code)
{
icmp->icmp_code = code;
}
void set_icmptype(int type)
{
icmp->icmp_type = type;
}
void set_icmpcodetok(char **code)
{
char *s;
int i;
for (i = 0; (s = icmpcodes[i]); i++)
if (!strcmp(s, *code)) {
icmp->icmp_code = i;
break;
}
if (!s)
fprintf(stderr, "unknown ICMP code %s\n", *code);
free(*code);
*code = NULL;
}
void set_icmptypetok(char **type)
{
char *s;
int i, done = 0;
for (i = 0; !(s = icmptypes[i]) || strcmp(s, "END"); i++)
if (s && !strcmp(s, *type)) {
icmp->icmp_type = i;
done = 1;
break;
}
if (!done)
fprintf(stderr, "unknown ICMP type %s\n", *type);
free(*type);
*type = NULL;
}
void set_icmpid(int arg)
{
icmp->icmp_id = htons(arg);
}
void set_icmpseq(int arg)
{
icmp->icmp_seq = htons(arg);
}
void set_icmpotime(int arg)
{
icmp->icmp_otime = htonl(arg);
}
void set_icmprtime(int arg)
{
icmp->icmp_rtime = htonl(arg);
}
void set_icmpttime(int arg)
{
icmp->icmp_ttime = htonl(arg);
}
void set_icmpmtu(int arg)
{
icmp->icmp_nextmtu = htons(arg);
}
void set_redir(int redir, char **arg)
{
icmp->icmp_code = redir;
icmp->icmp_gwaddr = getipv4addr(*arg);
free(*arg);
*arg = NULL;
}
void set_icmppprob(int num)
{
icmp->icmp_pptr = num;
}
void new_ipv4opt(void)
{
new_header(-2);
}
void add_ipopt(int state, void *ptr)
{
struct ipopt_names *io;
struct statetoopt *sto;
char numbuf[16], *arg, **param = ptr;
int inc, hlen;
if (state == IL_IPO_RR || state == IL_IPO_SATID) {
if (param)
snprintf(numbuf, sizeof(numbuf), "%d", *(int *)param);
else
strcpy(numbuf, "0");
arg = numbuf;
} else
arg = param ? *param : NULL;
if (canip->ah_next) {
fprintf(stderr, "cannot specify options after data body\n");
return;
}
for (sto = toipopts; sto->sto_st; sto++)
if (sto->sto_st == state)
break;
if (!sto->sto_st) {
fprintf(stderr, "No mapping for state %d to IP option\n",
state);
return;
}
hlen = sizeof(ip_t) + canip->ah_optlen;
for (io = ionames; io->on_name; io++)
if (io->on_value == sto->sto_op)
break;
canip->ah_lastopt = io->on_value;
if (io->on_name) {
inc = addipopt((char *)ip + hlen, io, hlen - sizeof(ip_t),arg);
if (inc > 0) {
while (inc & 3) {
((char *)ip)[sizeof(*ip) + inc] = IPOPT_NOP;
canip->ah_lastopt = IPOPT_NOP;
inc++;
}
hlen += inc;
}
}
canip->ah_optlen = hlen - sizeof(ip_t);
if (state != IL_IPO_RR && state != IL_IPO_SATID)
if (param && *param) {
free(*param);
*param = NULL;
}
sclass = NULL;
}
void end_ipopt(void)
{
int pad;
char *s, *buf = (char *)ip;
/*
* pad out so that we have a multiple of 4 bytes in size fo the
* options. make sure last byte is EOL.
*/
if (canip->ah_lastopt == IPOPT_NOP) {
buf[sizeof(*ip) + canip->ah_optlen - 1] = IPOPT_EOL;
} else if (canip->ah_lastopt != IPOPT_EOL) {
s = buf + sizeof(*ip) + canip->ah_optlen;
for (pad = 3 - (canip->ah_optlen & 3); pad; pad--) {
*s++ = IPOPT_NOP;
*s = IPOPT_EOL;
canip->ah_optlen++;
}
canip->ah_optlen++;
} else {
s = buf + sizeof(*ip) + canip->ah_optlen - 1;
for (pad = 3 - (canip->ah_optlen & 3); pad; pad--) {
*s++ = IPOPT_NOP;
*s = IPOPT_EOL;
canip->ah_optlen++;
}
}
ip->ip_hl = (sizeof(*ip) + canip->ah_optlen) >> 2;
inc_anipheaders(canip->ah_optlen);
free_anipheader();
}
void set_secclass(char **arg)
{
sclass = *arg;
*arg = NULL;
}
void free_anipheader(void)
{
aniphdr_t *aip;
aip = canip;
if ((canip = aip->ah_prev)) {
canip->ah_next = NULL;
aniptail = &canip->ah_next;
}
if (canip)
free(aip);
}
void end_ipv4(void)
{
aniphdr_t *aip;
ip->ip_sum = 0;
ip->ip_len = htons(ip->ip_len);
ip->ip_sum = chksum((u_short *)ip, ip->ip_hl << 2);
ip->ip_len = ntohs(ip->ip_len);
free_anipheader();
for (aip = aniphead, ip = NULL; aip; aip = aip->ah_next)
if (aip->ah_p == IPPROTO_IP)
ip = aip->ah_ip;
}
void end_icmp(void)
{
aniphdr_t *aip;
icmp->icmp_cksum = 0;
icmp->icmp_cksum = chksum((u_short *)icmp, canip->ah_len);
free_anipheader();
for (aip = aniphead, icmp = NULL; aip; aip = aip->ah_next)
if (aip->ah_p == IPPROTO_ICMP)
icmp = aip->ah_icmp;
}
void end_udp(void)
{
u_long sum;
aniphdr_t *aip;
ip_t iptmp;
bzero((char *)&iptmp, sizeof(iptmp));
iptmp.ip_p = ip->ip_p;
iptmp.ip_src = ip->ip_src;
iptmp.ip_dst = ip->ip_dst;
iptmp.ip_len = htons(ip->ip_len - (ip->ip_hl << 2));
sum = p_chksum((u_short *)&iptmp, (u_int)sizeof(iptmp));
udp->uh_ulen = htons(udp->uh_ulen);
udp->uh_sum = c_chksum((u_short *)udp, (u_int)ntohs(iptmp.ip_len), sum);
free_anipheader();
for (aip = aniphead, udp = NULL; aip; aip = aip->ah_next)
if (aip->ah_p == IPPROTO_UDP)
udp = aip->ah_udp;
}
void end_tcp(void)
{
u_long sum;
aniphdr_t *aip;
ip_t iptmp;
bzero((char *)&iptmp, sizeof(iptmp));
iptmp.ip_p = ip->ip_p;
iptmp.ip_src = ip->ip_src;
iptmp.ip_dst = ip->ip_dst;
iptmp.ip_len = htons(ip->ip_len - (ip->ip_hl << 2));
sum = p_chksum((u_short *)&iptmp, (u_int)sizeof(iptmp));
tcp->th_sum = 0;
tcp->th_sum = c_chksum((u_short *)tcp, (u_int)ntohs(iptmp.ip_len), sum);
free_anipheader();
for (aip = aniphead, tcp = NULL; aip; aip = aip->ah_next)
if (aip->ah_p == IPPROTO_TCP)
tcp = aip->ah_tcp;
}
void end_data(void)
{
free_anipheader();
}
void iplang(FILE *fp)
{
yyin = fp;
yydebug = (opts & OPT_DEBUG) ? 1 : 0;
while (!feof(fp))
yyparse();
}
u_short c_chksum(u_short *buf, u_int len, u_long init)
{
u_long sum = init;
int nwords = len >> 1;
for(; nwords > 0; nwords--)
sum += *buf++;
sum = (sum>>16) + (sum & 0xffff);
sum += (sum >>16);
return(~sum);
}
u_long p_chksum(u_short *buf, u_int len)
{
u_long sum = 0;
int nwords = len >> 1;
for(; nwords > 0; nwords--)
sum += *buf++;
return(sum);
}
diff --git a/sbin/ipf/ipmon/ipmon.c b/sbin/ipf/ipmon/ipmon.c
index f71a33b1034e..00ad4acc47f3 100644
--- a/sbin/ipf/ipmon/ipmon.c
+++ b/sbin/ipf/ipmon/ipmon.c
@@ -1,1855 +1,1854 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
#include "ipmon.h"
#include <sys/ioctl.h>
#include <sys/stat.h>
#include <syslog.h>
#include <ctype.h>
#include <fcntl.h>
#include <signal.h>
#if !defined(lint)
static const char sccsid[] = "@(#)ipmon.c 1.21 6/5/96 (C)1993-2000 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#define STRERROR(x) strerror(x)
extern int optind;
extern char *optarg;
extern ipmon_saver_t executesaver;
extern ipmon_saver_t filesaver;
extern ipmon_saver_t nothingsaver;
extern ipmon_saver_t snmpv1saver;
extern ipmon_saver_t snmpv2saver;
extern ipmon_saver_t syslogsaver;
struct flags {
int value;
char flag;
};
typedef struct logsource {
int fd;
int logtype;
char *file;
int regular;
size_t size;
} logsource_t;
typedef struct config {
int opts;
int maxfd;
logsource_t logsrc[3];
fd_set fdmr;
FILE *blog;
char *bfile;
FILE *log;
char *file;
char *cfile;
} config_t;
typedef struct icmp_subtype {
int ist_val;
char *ist_name;
} icmp_subtype_t;
typedef struct icmp_type {
int it_val;
struct icmp_subtype *it_subtable;
size_t it_stsize;
char *it_name;
} icmp_type_t;
#define IST_SZ(x) (sizeof(x)/sizeof(icmp_subtype_t))
struct flags tcpfl[] = {
{ TH_ACK, 'A' },
{ TH_RST, 'R' },
{ TH_SYN, 'S' },
{ TH_FIN, 'F' },
{ TH_URG, 'U' },
{ TH_PUSH,'P' },
{ TH_ECN, 'E' },
{ TH_CWR, 'C' },
{ 0, '\0' }
};
char *reasons[] = {
"filter-rule",
"log-or-block_1",
"pps-rate",
"jumbogram",
"makefrip-fail",
"state_add-fail",
"updateipid-fail",
"log-or-block_2",
"decap-fail",
"auth_new-fail",
"auth_captured",
"coalesce-fail",
"pullup-fail",
"auth-feedback",
"bad-frag",
"natv4_out-fail",
"natv4_in-fail",
"natv6_out-fail",
"natv6_in-fail",
};
#if SOLARIS
static char *pidfile = "/etc/opt/ipf/ipmon.pid";
#else
static char *pidfile = "/var/run/ipmon.pid";
#endif
static char line[2048];
static int donehup = 0;
static void usage(char *);
static void handlehup(int);
static void flushlogs(char *, FILE *);
static void print_log(config_t *, logsource_t *, char *, int);
static void print_ipflog(config_t *, char *, int);
static void print_natlog(config_t *, char *, int);
static void print_statelog(config_t *, char *, int);
static int read_log(int, int *, char *, int);
static void write_pid(char *);
static char *icmpname(u_int, u_int);
static char *icmpname6(u_int, u_int);
static icmp_type_t *find_icmptype(int, icmp_type_t *, size_t);
static icmp_subtype_t *find_icmpsubtype(int, icmp_subtype_t *, size_t);
static struct tm *get_tm(time_t);
char *portlocalname(int, char *, u_int);
int main(int, char *[]);
static void logopts(int, char *);
static void init_tabs(void);
static char *getlocalproto(u_int);
static void openlogs(config_t *conf);
static int read_loginfo(config_t *conf);
static void initconfig(config_t *conf);
static char **protocols = NULL;
static char **udp_ports = NULL;
static char **tcp_ports = NULL;
#define HOSTNAMEV4(b) hostname(AF_INET, (u_32_t *)&(b))
#ifndef LOGFAC
#define LOGFAC LOG_LOCAL0
#endif
int logfac = LOGFAC;
int ipmonopts = 0;
int opts = OPT_NORESOLVE;
int use_inet6 = 0;
static icmp_subtype_t icmpunreachnames[] = {
{ ICMP_UNREACH_NET, "net" },
{ ICMP_UNREACH_HOST, "host" },
{ ICMP_UNREACH_PROTOCOL, "protocol" },
{ ICMP_UNREACH_PORT, "port" },
{ ICMP_UNREACH_NEEDFRAG, "needfrag" },
{ ICMP_UNREACH_SRCFAIL, "srcfail" },
{ ICMP_UNREACH_NET_UNKNOWN, "net_unknown" },
{ ICMP_UNREACH_HOST_UNKNOWN, "host_unknown" },
{ ICMP_UNREACH_NET, "isolated" },
{ ICMP_UNREACH_NET_PROHIB, "net_prohib" },
{ ICMP_UNREACH_NET_PROHIB, "host_prohib" },
{ ICMP_UNREACH_TOSNET, "tosnet" },
{ ICMP_UNREACH_TOSHOST, "toshost" },
{ ICMP_UNREACH_ADMIN_PROHIBIT, "admin_prohibit" },
{ -2, NULL }
};
static icmp_subtype_t redirectnames[] = {
{ ICMP_REDIRECT_NET, "net" },
{ ICMP_REDIRECT_HOST, "host" },
{ ICMP_REDIRECT_TOSNET, "tosnet" },
{ ICMP_REDIRECT_TOSHOST, "toshost" },
{ -2, NULL }
};
static icmp_subtype_t timxceednames[] = {
{ ICMP_TIMXCEED_INTRANS, "transit" },
{ ICMP_TIMXCEED_REASS, "reassem" },
{ -2, NULL }
};
static icmp_subtype_t paramnames[] = {
{ ICMP_PARAMPROB_ERRATPTR, "errata_pointer" },
{ ICMP_PARAMPROB_OPTABSENT, "optmissing" },
{ ICMP_PARAMPROB_LENGTH, "length" },
{ -2, NULL }
};
static icmp_type_t icmptypes4[] = {
{ ICMP_ECHOREPLY, NULL, 0, "echoreply" },
{ -1, NULL, 0, NULL },
{ -1, NULL, 0, NULL },
{ ICMP_UNREACH, icmpunreachnames,
IST_SZ(icmpunreachnames),"unreach" },
{ ICMP_SOURCEQUENCH, NULL, 0, "sourcequench" },
{ ICMP_REDIRECT, redirectnames,
IST_SZ(redirectnames), "redirect" },
{ -1, NULL, 0, NULL },
{ -1, NULL, 0, NULL },
{ ICMP_ECHO, NULL, 0, "echo" },
{ ICMP_ROUTERADVERT, NULL, 0, "routeradvert" },
{ ICMP_ROUTERSOLICIT, NULL, 0, "routersolicit" },
{ ICMP_TIMXCEED, timxceednames,
IST_SZ(timxceednames), "timxceed" },
{ ICMP_PARAMPROB, paramnames,
IST_SZ(paramnames), "paramprob" },
{ ICMP_TSTAMP, NULL, 0, "timestamp" },
{ ICMP_TSTAMPREPLY, NULL, 0, "timestampreply" },
{ ICMP_IREQ, NULL, 0, "inforeq" },
{ ICMP_IREQREPLY, NULL, 0, "inforeply" },
{ ICMP_MASKREQ, NULL, 0, "maskreq" },
{ ICMP_MASKREPLY, NULL, 0, "maskreply" },
{ -2, NULL, 0, NULL }
};
static icmp_subtype_t icmpredirect6[] = {
{ ICMP6_DST_UNREACH_NOROUTE, "noroute" },
{ ICMP6_DST_UNREACH_ADMIN, "admin" },
{ ICMP6_DST_UNREACH_NOTNEIGHBOR, "neighbour" },
{ ICMP6_DST_UNREACH_ADDR, "address" },
{ ICMP6_DST_UNREACH_NOPORT, "noport" },
{ -2, NULL }
};
static icmp_subtype_t icmptimexceed6[] = {
{ ICMP6_TIME_EXCEED_TRANSIT, "intransit" },
{ ICMP6_TIME_EXCEED_REASSEMBLY, "reassem" },
{ -2, NULL }
};
static icmp_subtype_t icmpparamprob6[] = {
{ ICMP6_PARAMPROB_HEADER, "header" },
{ ICMP6_PARAMPROB_NEXTHEADER, "nextheader" },
{ ICMP6_PARAMPROB_OPTION, "option" },
{ -2, NULL }
};
static icmp_subtype_t icmpquerysubject6[] = {
{ ICMP6_NI_SUBJ_IPV6, "ipv6" },
{ ICMP6_NI_SUBJ_FQDN, "fqdn" },
{ ICMP6_NI_SUBJ_IPV4, "ipv4" },
{ -2, NULL },
};
static icmp_subtype_t icmpnodeinfo6[] = {
{ ICMP6_NI_SUCCESS, "success" },
{ ICMP6_NI_REFUSED, "refused" },
{ ICMP6_NI_UNKNOWN, "unknown" },
{ -2, NULL }
};
static icmp_subtype_t icmprenumber6[] = {
{ ICMP6_ROUTER_RENUMBERING_COMMAND, "command" },
{ ICMP6_ROUTER_RENUMBERING_RESULT, "result" },
{ ICMP6_ROUTER_RENUMBERING_SEQNUM_RESET, "seqnum_reset" },
{ -2, NULL }
};
static icmp_type_t icmptypes6[] = {
{ 0, NULL, 0, NULL },
{ ICMP6_DST_UNREACH, icmpredirect6,
IST_SZ(icmpredirect6), "unreach" },
{ ICMP6_PACKET_TOO_BIG, NULL, 0, "toobig" },
{ ICMP6_TIME_EXCEEDED, icmptimexceed6,
IST_SZ(icmptimexceed6), "timxceed" },
{ ICMP6_PARAM_PROB, icmpparamprob6,
IST_SZ(icmpparamprob6), "paramprob" },
{ ICMP6_ECHO_REQUEST, NULL, 0, "echo" },
{ ICMP6_ECHO_REPLY, NULL, 0, "echoreply" },
{ ICMP6_MEMBERSHIP_QUERY, icmpquerysubject6,
IST_SZ(icmpquerysubject6), "groupmemberquery" },
{ ICMP6_MEMBERSHIP_REPORT,NULL, 0, "groupmemberreport" },
{ ICMP6_MEMBERSHIP_REDUCTION,NULL, 0, "groupmemberterm" },
{ ND_ROUTER_SOLICIT, NULL, 0, "routersolicit" },
{ ND_ROUTER_ADVERT, NULL, 0, "routeradvert" },
{ ND_NEIGHBOR_SOLICIT, NULL, 0, "neighborsolicit" },
{ ND_NEIGHBOR_ADVERT, NULL, 0, "neighboradvert" },
{ ND_REDIRECT, NULL, 0, "redirect" },
{ ICMP6_ROUTER_RENUMBERING, icmprenumber6,
IST_SZ(icmprenumber6), "routerrenumber" },
{ ICMP6_WRUREQUEST, NULL, 0, "whoareyourequest" },
{ ICMP6_WRUREPLY, NULL, 0, "whoareyoureply" },
{ ICMP6_FQDN_QUERY, NULL, 0, "fqdnquery" },
{ ICMP6_FQDN_REPLY, NULL, 0, "fqdnreply" },
{ ICMP6_NI_QUERY, icmpnodeinfo6,
IST_SZ(icmpnodeinfo6), "nodeinforequest" },
{ ICMP6_NI_REPLY, NULL, 0, "nodeinforeply" },
{ MLD6_MTRACE_RESP, NULL, 0, "mtraceresponse" },
{ MLD6_MTRACE, NULL, 0, "mtracerequest" },
{ -2, NULL, 0, NULL }
};
static icmp_subtype_t *
find_icmpsubtype(int type, icmp_subtype_t *table, size_t tablesz)
{
icmp_subtype_t *ist;
int i;
if (tablesz < 2)
return (NULL);
if ((type < 0) || (type > table[tablesz - 2].ist_val))
return (NULL);
i = type;
if (table[type].ist_val == type)
return (table + type);
for (i = 0, ist = table; ist->ist_val != -2; i++, ist++)
if (ist->ist_val == type)
return (ist);
return (NULL);
}
static icmp_type_t *
find_icmptype(int type, icmp_type_t *table, size_t tablesz)
{
icmp_type_t *it;
int i;
if (tablesz < 2)
return (NULL);
if ((type < 0) || (type > table[tablesz - 2].it_val))
return (NULL);
i = type;
if (table[type].it_val == type)
return (table + type);
for (i = 0, it = table; it->it_val != -2; i++, it++)
if (it->it_val == type)
return (it);
return (NULL);
}
static void
handlehup(int sig)
{
signal(SIGHUP, handlehup);
donehup = 1;
}
static void
init_tabs(void)
{
struct protoent *p;
struct servent *s;
char *name, **tab;
int port, i;
if (protocols != NULL) {
for (i = 0; i < 256; i++)
if (protocols[i] != NULL) {
free(protocols[i]);
protocols[i] = NULL;
}
free(protocols);
protocols = NULL;
}
protocols = (char **)malloc(256 * sizeof(*protocols));
if (protocols != NULL) {
bzero((char *)protocols, 256 * sizeof(*protocols));
setprotoent(1);
while ((p = getprotoent()) != NULL)
if (p->p_proto >= 0 && p->p_proto <= 255 &&
p->p_name != NULL && protocols[p->p_proto] == NULL)
protocols[p->p_proto] = strdup(p->p_name);
endprotoent();
if (protocols[0])
free(protocols[0]);
protocols[0] = strdup("ip");
}
if (udp_ports != NULL) {
for (i = 0; i < 65536; i++)
if (udp_ports[i] != NULL) {
free(udp_ports[i]);
udp_ports[i] = NULL;
}
free(udp_ports);
udp_ports = NULL;
}
udp_ports = (char **)malloc(65536 * sizeof(*udp_ports));
if (udp_ports != NULL)
bzero((char *)udp_ports, 65536 * sizeof(*udp_ports));
if (tcp_ports != NULL) {
for (i = 0; i < 65536; i++)
if (tcp_ports[i] != NULL) {
free(tcp_ports[i]);
tcp_ports[i] = NULL;
}
free(tcp_ports);
tcp_ports = NULL;
}
tcp_ports = (char **)malloc(65536 * sizeof(*tcp_ports));
if (tcp_ports != NULL)
bzero((char *)tcp_ports, 65536 * sizeof(*tcp_ports));
setservent(1);
while ((s = getservent()) != NULL) {
if (s->s_proto == NULL)
continue;
else if (!strcmp(s->s_proto, "tcp")) {
port = ntohs(s->s_port);
name = s->s_name;
tab = tcp_ports;
} else if (!strcmp(s->s_proto, "udp")) {
port = ntohs(s->s_port);
name = s->s_name;
tab = udp_ports;
} else
continue;
if ((port < 0 || port > 65535) || (name == NULL))
continue;
if (tab != NULL)
tab[port] = strdup(name);
}
endservent();
}
static char *
getlocalproto(u_int p)
{
static char pnum[4];
char *s;
p &= 0xff;
s = protocols ? protocols[p] : NULL;
if (s == NULL) {
sprintf(pnum, "%u", p);
s = pnum;
}
return (s);
}
static int
read_log(int fd, int *lenp, char *buf, int bufsize)
{
int nr;
if (bufsize > IPFILTER_LOGSIZE)
bufsize = IPFILTER_LOGSIZE;
nr = read(fd, buf, bufsize);
if (!nr)
return (2);
if ((nr < 0) && (errno != EINTR))
return (-1);
*lenp = nr;
return (0);
}
char *
portlocalname(res, proto, port)
int res;
char *proto;
u_int port;
{
static char pname[8];
char *s;
port = ntohs(port);
port &= 0xffff;
sprintf(pname, "%u", port);
if (!res || (ipmonopts & IPMON_PORTNUM))
return (pname);
s = NULL;
if (!strcmp(proto, "tcp"))
s = tcp_ports[port];
else if (!strcmp(proto, "udp"))
s = udp_ports[port];
if (s == NULL)
s = pname;
return (s);
}
static char *
icmpname(u_int type, u_int code)
{
static char name[80];
icmp_subtype_t *ist;
icmp_type_t *it;
char *s;
s = NULL;
it = find_icmptype(type, icmptypes4, sizeof(icmptypes4) / sizeof(*it));
if (it != NULL)
s = it->it_name;
if (s == NULL)
sprintf(name, "icmptype(%d)/", type);
else
sprintf(name, "%s/", s);
ist = NULL;
if (it != NULL && it->it_subtable != NULL)
ist = find_icmpsubtype(code, it->it_subtable, it->it_stsize);
if (ist != NULL && ist->ist_name != NULL)
strcat(name, ist->ist_name);
else
sprintf(name + strlen(name), "%d", code);
return (name);
}
static char *
icmpname6(u_int type, u_int code)
{
static char name[80];
icmp_subtype_t *ist;
icmp_type_t *it;
char *s;
s = NULL;
it = find_icmptype(type, icmptypes6, sizeof(icmptypes6) / sizeof(*it));
if (it != NULL)
s = it->it_name;
if (s == NULL)
sprintf(name, "icmpv6type(%d)/", type);
else
sprintf(name, "%s/", s);
ist = NULL;
if (it != NULL && it->it_subtable != NULL)
ist = find_icmpsubtype(code, it->it_subtable, it->it_stsize);
if (ist != NULL && ist->ist_name != NULL)
strcat(name, ist->ist_name);
else
sprintf(name + strlen(name), "%d", code);
return (name);
}
void
dumphex(FILE *log, int dopts, char *buf, int len)
{
char hline[80];
int i, j, k;
u_char *s = (u_char *)buf, *t = (u_char *)hline;
if (buf == NULL || len == 0)
return;
*hline = '\0';
for (i = len, j = 0; i; i--, j++, s++) {
if (j && !(j & 0xf)) {
*t++ = '\n';
*t = '\0';
if ((dopts & IPMON_SYSLOG))
syslog(LOG_INFO, "%s", hline);
else if (log != NULL)
fputs(hline, log);
t = (u_char *)hline;
*t = '\0';
}
sprintf((char *)t, "%02x", *s & 0xff);
t += 2;
if (!((j + 1) & 0xf)) {
s -= 15;
sprintf((char *)t, " ");
t += 8;
for (k = 16; k; k--, s++)
*t++ = (isprint(*s) ? *s : '.');
s--;
}
if ((j + 1) & 0xf)
*t++ = ' ';;
}
if (j & 0xf) {
for (k = 16 - (j & 0xf); k; k--) {
*t++ = ' ';
*t++ = ' ';
*t++ = ' ';
}
sprintf((char *)t, " ");
t += 7;
s -= j & 0xf;
for (k = j & 0xf; k; k--, s++)
*t++ = (isprint(*s) ? *s : '.');
*t++ = '\n';
*t = '\0';
}
if ((dopts & IPMON_SYSLOG) != 0)
syslog(LOG_INFO, "%s", hline);
else if (log != NULL) {
fputs(hline, log);
fflush(log);
}
}
static struct tm *
get_tm(time_t sec)
{
struct tm *tm;
time_t t;
t = sec;
tm = localtime(&t);
return (tm);
}
static void
print_natlog(config_t *conf, char *buf, int blen)
{
static u_32_t seqnum = 0;
int res, i, len, family;
struct natlog *nl;
struct tm *tm;
iplog_t *ipl;
char *proto;
int simple;
char *t;
t = line;
simple = 0;
ipl = (iplog_t *)buf;
if (ipl->ipl_seqnum != seqnum) {
if ((ipmonopts & IPMON_SYSLOG) != 0) {
syslog(LOG_WARNING,
"missed %u NAT log entries: %u %u",
ipl->ipl_seqnum - seqnum, seqnum,
ipl->ipl_seqnum);
} else {
(void) fprintf(conf->log,
"missed %u NAT log entries: %u %u\n",
ipl->ipl_seqnum - seqnum, seqnum,
ipl->ipl_seqnum);
}
}
seqnum = ipl->ipl_seqnum + ipl->ipl_count;
nl = (struct natlog *)((char *)ipl + sizeof(*ipl));
res = (ipmonopts & IPMON_RESOLVE) ? 1 : 0;
tm = get_tm(ipl->ipl_sec);
len = sizeof(line);
if (!(ipmonopts & IPMON_SYSLOG)) {
(void) strftime(t, len, "%d/%m/%Y ", tm);
i = strlen(t);
len -= i;
t += i;
}
(void) strftime(t, len, "%T", tm);
t += strlen(t);
sprintf(t, ".%-.6ld @%hd ", (long)ipl->ipl_usec, nl->nl_rule + 1);
t += strlen(t);
switch (nl->nl_action)
{
case NL_NEW :
strcpy(t, "NAT:NEW");
break;
case NL_FLUSH :
strcpy(t, "NAT:FLUSH");
break;
case NL_CLONE :
strcpy(t, "NAT:CLONE");
break;
case NL_EXPIRE :
strcpy(t, "NAT:EXPIRE");
break;
case NL_DESTROY :
strcpy(t, "NAT:DESTROY");
break;
case NL_PURGE :
strcpy(t, "NAT:PURGE");
break;
default :
sprintf(t, "NAT:Action(%d)", nl->nl_action);
break;
}
t += strlen(t);
switch (nl->nl_type)
{
case NAT_MAP :
strcpy(t, "-MAP ");
simple = 1;
break;
case NAT_REDIRECT :
strcpy(t, "-RDR ");
simple = 1;
break;
case NAT_BIMAP :
strcpy(t, "-BIMAP ");
simple = 1;
break;
case NAT_MAPBLK :
strcpy(t, "-MAPBLOCK ");
simple = 1;
break;
case NAT_REWRITE|NAT_MAP :
strcpy(t, "-RWR_MAP ");
break;
case NAT_REWRITE|NAT_REDIRECT :
strcpy(t, "-RWR_RDR ");
break;
case NAT_ENCAP|NAT_MAP :
strcpy(t, "-ENC_MAP ");
break;
case NAT_ENCAP|NAT_REDIRECT :
strcpy(t, "-ENC_RDR ");
break;
case NAT_DIVERTUDP|NAT_MAP :
strcpy(t, "-DIV_MAP ");
break;
case NAT_DIVERTUDP|NAT_REDIRECT :
strcpy(t, "-DIV_RDR ");
break;
default :
sprintf(t, "-Type(%d) ", nl->nl_type);
break;
}
t += strlen(t);
proto = getlocalproto(nl->nl_p[0]);
family = vtof(nl->nl_v[0]);
if (simple == 1) {
sprintf(t, "%s,%s <- -> ", hostname(family, nl->nl_osrcip.i6),
portlocalname(res, proto, (u_int)nl->nl_osrcport));
t += strlen(t);
sprintf(t, "%s,%s ", hostname(family, nl->nl_nsrcip.i6),
portlocalname(res, proto, (u_int)nl->nl_nsrcport));
t += strlen(t);
sprintf(t, "[%s,%s] ", hostname(family, nl->nl_odstip.i6),
portlocalname(res, proto, (u_int)nl->nl_odstport));
} else {
sprintf(t, "%s,%s ", hostname(family, nl->nl_osrcip.i6),
portlocalname(res, proto, (u_int)nl->nl_osrcport));
t += strlen(t);
sprintf(t, "%s,%s <- -> ", hostname(family, nl->nl_odstip.i6),
portlocalname(res, proto, (u_int)nl->nl_odstport));
t += strlen(t);
sprintf(t, "%s,%s ", hostname(family, nl->nl_nsrcip.i6),
portlocalname(res, proto, (u_int)nl->nl_nsrcport));
t += strlen(t);
sprintf(t, "%s,%s ", hostname(family, nl->nl_ndstip.i6),
portlocalname(res, proto, (u_int)nl->nl_ndstport));
}
t += strlen(t);
strcpy(t, getlocalproto(nl->nl_p[0]));
t += strlen(t);
if (nl->nl_action == NL_EXPIRE || nl->nl_action == NL_FLUSH) {
#ifdef USE_QUAD_T
# ifdef PRId64
sprintf(t, " Pkts %" PRId64 "/%" PRId64 " Bytes %" PRId64 "/%"
PRId64,
# else
sprintf(t, " Pkts %qd/%qd Bytes %qd/%qd",
# endif
#else
sprintf(t, " Pkts %ld/%ld Bytes %ld/%ld",
#endif
nl->nl_pkts[0], nl->nl_pkts[1],
nl->nl_bytes[0], nl->nl_bytes[1]);
t += strlen(t);
}
*t++ = '\n';
*t++ = '\0';
if (ipmonopts & IPMON_SYSLOG)
syslog(LOG_INFO, "%s", line);
else if (conf->log != NULL)
(void) fprintf(conf->log, "%s", line);
}
static void
print_statelog(config_t *conf, char *buf, int blen)
{
static u_32_t seqnum = 0;
int res, i, len, family;
struct ipslog *sl;
char *t, *proto;
struct tm *tm;
iplog_t *ipl;
t = line;
ipl = (iplog_t *)buf;
if (ipl->ipl_seqnum != seqnum) {
if ((ipmonopts & IPMON_SYSLOG) != 0) {
syslog(LOG_WARNING,
"missed %u state log entries: %u %u",
ipl->ipl_seqnum - seqnum, seqnum,
ipl->ipl_seqnum);
} else {
(void) fprintf(conf->log,
"missed %u state log entries: %u %u\n",
ipl->ipl_seqnum - seqnum, seqnum,
ipl->ipl_seqnum);
}
}
seqnum = ipl->ipl_seqnum + ipl->ipl_count;
sl = (struct ipslog *)((char *)ipl + sizeof(*ipl));
res = (ipmonopts & IPMON_RESOLVE) ? 1 : 0;
tm = get_tm(ipl->ipl_sec);
len = sizeof(line);
if (!(ipmonopts & IPMON_SYSLOG)) {
(void) strftime(t, len, "%d/%m/%Y ", tm);
i = strlen(t);
len -= i;
t += i;
}
(void) strftime(t, len, "%T", tm);
t += strlen(t);
sprintf(t, ".%-.6ld ", (long)ipl->ipl_usec);
t += strlen(t);
family = vtof(sl->isl_v);
switch (sl->isl_type)
{
case ISL_NEW :
strcpy(t, "STATE:NEW ");
break;
case ISL_CLONE :
strcpy(t, "STATE:CLONED ");
break;
case ISL_EXPIRE :
if ((sl->isl_p == IPPROTO_TCP) &&
(sl->isl_state[0] > IPF_TCPS_ESTABLISHED ||
sl->isl_state[1] > IPF_TCPS_ESTABLISHED))
strcpy(t, "STATE:CLOSE ");
else
strcpy(t, "STATE:EXPIRE ");
break;
case ISL_FLUSH :
strcpy(t, "STATE:FLUSH ");
break;
case ISL_INTERMEDIATE :
strcpy(t, "STATE:INTERMEDIATE ");
break;
case ISL_REMOVE :
strcpy(t, "STATE:REMOVE ");
break;
case ISL_KILLED :
strcpy(t, "STATE:KILLED ");
break;
case ISL_UNLOAD :
strcpy(t, "STATE:UNLOAD ");
break;
default :
sprintf(t, "Type: %d ", sl->isl_type);
break;
}
t += strlen(t);
proto = getlocalproto(sl->isl_p);
if (sl->isl_p == IPPROTO_TCP || sl->isl_p == IPPROTO_UDP) {
sprintf(t, "%s,%s -> ",
hostname(family, (u_32_t *)&sl->isl_src),
portlocalname(res, proto, (u_int)sl->isl_sport));
t += strlen(t);
sprintf(t, "%s,%s PR %s",
hostname(family, (u_32_t *)&sl->isl_dst),
portlocalname(res, proto, (u_int)sl->isl_dport), proto);
} else if (sl->isl_p == IPPROTO_ICMP) {
sprintf(t, "%s -> ", hostname(family, (u_32_t *)&sl->isl_src));
t += strlen(t);
sprintf(t, "%s PR icmp %d",
hostname(family, (u_32_t *)&sl->isl_dst),
sl->isl_itype);
} else if (sl->isl_p == IPPROTO_ICMPV6) {
sprintf(t, "%s -> ", hostname(family, (u_32_t *)&sl->isl_src));
t += strlen(t);
sprintf(t, "%s PR icmpv6 %d",
hostname(family, (u_32_t *)&sl->isl_dst),
sl->isl_itype);
} else {
sprintf(t, "%s -> ", hostname(family, (u_32_t *)&sl->isl_src));
t += strlen(t);
sprintf(t, "%s PR %s",
hostname(family, (u_32_t *)&sl->isl_dst), proto);
}
t += strlen(t);
if (sl->isl_tag != FR_NOLOGTAG) {
sprintf(t, " tag %u", sl->isl_tag);
t += strlen(t);
}
if (sl->isl_type != ISL_NEW) {
sprintf(t,
#ifdef USE_QUAD_T
#ifdef PRId64
" Forward: Pkts in %" PRId64 " Bytes in %" PRId64
" Pkts out %" PRId64 " Bytes out %" PRId64
" Backward: Pkts in %" PRId64 " Bytes in %" PRId64
" Pkts out %" PRId64 " Bytes out %" PRId64,
#else
" Forward: Pkts in %qd Bytes in %qd Pkts out %qd Bytes out %qd Backward: Pkts in %qd Bytes in %qd Pkts out %qd Bytes out %qd",
#endif /* PRId64 */
#else
" Forward: Pkts in %ld Bytes in %ld Pkts out %ld Bytes out %ld Backward: Pkts in %ld Bytes in %ld Pkts out %ld Bytes out %ld",
#endif
sl->isl_pkts[0], sl->isl_bytes[0],
sl->isl_pkts[1], sl->isl_bytes[1],
sl->isl_pkts[2], sl->isl_bytes[2],
sl->isl_pkts[3], sl->isl_bytes[3]);
t += strlen(t);
}
*t++ = '\n';
*t++ = '\0';
if (ipmonopts & IPMON_SYSLOG)
syslog(LOG_INFO, "%s", line);
else if (conf->log != NULL)
(void) fprintf(conf->log, "%s", line);
}
static void
print_log(config_t *conf, logsource_t *log, char *buf, int blen)
{
char *bp, *bpo;
iplog_t *ipl;
int psize;
bp = NULL;
bpo = NULL;
while (blen > 0) {
ipl = (iplog_t *)buf;
if ((u_long)ipl & (sizeof(long)-1)) {
if (bp)
bpo = bp;
bp = (char *)malloc(blen);
bcopy((char *)ipl, bp, blen);
if (bpo) {
free(bpo);
bpo = NULL;
}
buf = bp;
continue;
}
psize = ipl->ipl_dsize;
if (psize > blen)
break;
if (conf->blog != NULL) {
fwrite(buf, psize, 1, conf->blog);
fflush(conf->blog);
}
if (log->logtype == IPL_LOGIPF) {
if (ipl->ipl_magic == IPL_MAGIC)
print_ipflog(conf, buf, psize);
} else if (log->logtype == IPL_LOGNAT) {
if (ipl->ipl_magic == IPL_MAGIC_NAT)
print_natlog(conf, buf, psize);
} else if (log->logtype == IPL_LOGSTATE) {
if (ipl->ipl_magic == IPL_MAGIC_STATE)
print_statelog(conf, buf, psize);
}
blen -= psize;
buf += psize;
}
if (bp)
free(bp);
return;
}
static void
print_ipflog(config_t *conf, char *buf, int blen)
{
static u_32_t seqnum = 0;
int i, f, lvl, res, len, off, plen, ipoff, defaction;
struct icmp *icmp;
struct icmp *ic;
char *t, *proto;
ip_t *ipc, *ip;
struct tm *tm;
u_32_t *s, *d;
u_short hl, p;
ipflog_t *ipf;
iplog_t *ipl;
tcphdr_t *tp;
#ifdef USE_INET6
struct ip6_ext *ehp;
u_short ehl;
ip6_t *ip6;
int go;
#endif
ipl = (iplog_t *)buf;
if (ipl->ipl_seqnum != seqnum) {
if ((ipmonopts & IPMON_SYSLOG) != 0) {
syslog(LOG_WARNING,
"missed %u ipf log entries: %u %u",
ipl->ipl_seqnum - seqnum, seqnum,
ipl->ipl_seqnum);
} else {
(void) fprintf(conf->log,
"missed %u ipf log entries: %u %u\n",
ipl->ipl_seqnum - seqnum, seqnum,
ipl->ipl_seqnum);
}
}
seqnum = ipl->ipl_seqnum + ipl->ipl_count;
ipf = (ipflog_t *)((char *)buf + sizeof(*ipl));
ip = (ip_t *)((char *)ipf + sizeof(*ipf));
f = ipf->fl_family;
res = (ipmonopts & IPMON_RESOLVE) ? 1 : 0;
t = line;
*t = '\0';
tm = get_tm(ipl->ipl_sec);
len = sizeof(line);
if (!(ipmonopts & IPMON_SYSLOG)) {
(void) strftime(t, len, "%d/%m/%Y ", tm);
i = strlen(t);
len -= i;
t += i;
}
(void) strftime(t, len, "%T", tm);
t += strlen(t);
sprintf(t, ".%-.6ld ", (long)ipl->ipl_usec);
t += strlen(t);
if (ipl->ipl_count > 1) {
sprintf(t, "%dx ", ipl->ipl_count);
t += strlen(t);
}
{
char ifname[sizeof(ipf->fl_ifname) + 1];
strncpy(ifname, ipf->fl_ifname, sizeof(ipf->fl_ifname));
ifname[sizeof(ipf->fl_ifname)] = '\0';
sprintf(t, "%s", ifname);
t += strlen(t);
# if SOLARIS
if (ISALPHA(*(t - 1))) {
sprintf(t, "%d", ipf->fl_unit);
t += strlen(t);
}
# endif
}
if ((ipf->fl_group[0] == (char)~0) && (ipf->fl_group[1] == '\0'))
strcat(t, " @-1:");
else if (ipf->fl_group[0] == '\0')
(void) strcpy(t, " @0:");
else
sprintf(t, " @%s:", ipf->fl_group);
t += strlen(t);
if (ipf->fl_rule == 0xffffffff)
strcat(t, "-1 ");
else
sprintf(t, "%u ", ipf->fl_rule + 1);
t += strlen(t);
lvl = LOG_NOTICE;
if (ipf->fl_lflags & FI_SHORT) {
*t++ = 'S';
lvl = LOG_ERR;
}
if (FR_ISPASS(ipf->fl_flags)) {
if (ipf->fl_flags & FR_LOGP)
*t++ = 'p';
else
*t++ = 'P';
} else if (FR_ISBLOCK(ipf->fl_flags)) {
if (ipf->fl_flags & FR_LOGB)
*t++ = 'b';
else
*t++ = 'B';
lvl = LOG_WARNING;
} else if ((ipf->fl_flags & FR_LOGMASK) == FR_LOG) {
*t++ = 'L';
lvl = LOG_INFO;
} else if (ipf->fl_flags & FF_LOGNOMATCH) {
*t++ = 'n';
} else {
*t++ = '?';
lvl = LOG_EMERG;
}
if (ipf->fl_loglevel != 0xffff)
lvl = ipf->fl_loglevel;
*t++ = ' ';
*t = '\0';
if (f == AF_INET) {
hl = IP_HL(ip) << 2;
ipoff = ntohs(ip->ip_off);
off = ipoff & IP_OFFMASK;
p = (u_short)ip->ip_p;
s = (u_32_t *)&ip->ip_src;
d = (u_32_t *)&ip->ip_dst;
plen = ntohs(ip->ip_len);
} else
#ifdef USE_INET6
if (f == AF_INET6) {
off = 0;
ipoff = 0;
hl = sizeof(ip6_t);
ip6 = (ip6_t *)ip;
p = (u_short)ip6->ip6_nxt;
s = (u_32_t *)&ip6->ip6_src;
d = (u_32_t *)&ip6->ip6_dst;
plen = hl + ntohs(ip6->ip6_plen);
go = 1;
ehp = (struct ip6_ext *)((char *)ip6 + hl);
while (go == 1) {
switch (p)
{
case IPPROTO_HOPOPTS :
case IPPROTO_MOBILITY :
case IPPROTO_DSTOPTS :
case IPPROTO_ROUTING :
case IPPROTO_AH :
p = ehp->ip6e_nxt;
ehl = 8 + (ehp->ip6e_len << 3);
hl += ehl;
ehp = (struct ip6_ext *)((char *)ehp + ehl);
break;
case IPPROTO_FRAGMENT :
hl += sizeof(struct ip6_frag);
/* FALLTHROUGH */
default :
go = 0;
break;
}
}
} else
#endif
{
goto printipflog;
}
proto = getlocalproto(p);
if ((p == IPPROTO_TCP || p == IPPROTO_UDP) && !off) {
tp = (tcphdr_t *)((char *)ip + hl);
if (!(ipf->fl_lflags & FI_SHORT)) {
sprintf(t, "%s,%s -> ", hostname(f, s),
portlocalname(res, proto, (u_int)tp->th_sport));
t += strlen(t);
sprintf(t, "%s,%s PR %s len %hu %hu",
hostname(f, d),
portlocalname(res, proto, (u_int)tp->th_dport),
proto, hl, plen);
t += strlen(t);
if (p == IPPROTO_TCP) {
*t++ = ' ';
*t++ = '-';
for (i = 0; tcpfl[i].value; i++)
if (tp->th_flags & tcpfl[i].value)
*t++ = tcpfl[i].flag;
if (ipmonopts & IPMON_VERBOSE) {
sprintf(t, " %lu %lu %hu",
(u_long)(ntohl(tp->th_seq)),
(u_long)(ntohl(tp->th_ack)),
ntohs(tp->th_win));
t += strlen(t);
}
}
*t = '\0';
} else {
sprintf(t, "%s -> ", hostname(f, s));
t += strlen(t);
sprintf(t, "%s PR %s len %hu %hu",
hostname(f, d), proto, hl, plen);
}
#if defined(AF_INET6) && defined(IPPROTO_ICMPV6)
} else if ((p == IPPROTO_ICMPV6) && !off && (f == AF_INET6)) {
ic = (struct icmp *)((char *)ip + hl);
sprintf(t, "%s -> ", hostname(f, s));
t += strlen(t);
sprintf(t, "%s PR icmpv6 len %hu %hu icmpv6 %s",
hostname(f, d), hl, plen,
icmpname6(ic->icmp_type, ic->icmp_code));
#endif
} else if ((p == IPPROTO_ICMP) && !off && (f == AF_INET)) {
ic = (struct icmp *)((char *)ip + hl);
sprintf(t, "%s -> ", hostname(f, s));
t += strlen(t);
sprintf(t, "%s PR icmp len %hu %hu icmp %s",
hostname(f, d), hl, plen,
icmpname(ic->icmp_type, ic->icmp_code));
if (ic->icmp_type == ICMP_UNREACH ||
ic->icmp_type == ICMP_SOURCEQUENCH ||
ic->icmp_type == ICMP_PARAMPROB ||
ic->icmp_type == ICMP_REDIRECT ||
ic->icmp_type == ICMP_TIMXCEED) {
ipc = &ic->icmp_ip;
i = ntohs(ipc->ip_len);
/*
* XXX - try to guess endian of ip_len in ICMP
* returned data.
*/
if (i > 1500)
i = ipc->ip_len;
ipoff = ntohs(ipc->ip_off);
proto = getlocalproto(ipc->ip_p);
if (!(ipoff & IP_OFFMASK) &&
((ipc->ip_p == IPPROTO_TCP) ||
(ipc->ip_p == IPPROTO_UDP))) {
tp = (tcphdr_t *)((char *)ipc + hl);
t += strlen(t);
sprintf(t, " for %s,%s -",
HOSTNAMEV4(ipc->ip_src),
portlocalname(res, proto,
(u_int)tp->th_sport));
t += strlen(t);
sprintf(t, " %s,%s PR %s len %hu %hu",
HOSTNAMEV4(ipc->ip_dst),
portlocalname(res, proto,
(u_int)tp->th_dport),
proto, IP_HL(ipc) << 2, i);
} else if (!(ipoff & IP_OFFMASK) &&
(ipc->ip_p == IPPROTO_ICMP)) {
icmp = (icmphdr_t *)((char *)ipc + hl);
t += strlen(t);
sprintf(t, " for %s -",
HOSTNAMEV4(ipc->ip_src));
t += strlen(t);
sprintf(t,
" %s PR icmp len %hu %hu icmp %d/%d",
HOSTNAMEV4(ipc->ip_dst),
IP_HL(ipc) << 2, i,
icmp->icmp_type, icmp->icmp_code);
} else {
t += strlen(t);
sprintf(t, " for %s -",
HOSTNAMEV4(ipc->ip_src));
t += strlen(t);
sprintf(t, " %s PR %s len %hu (%hu)",
HOSTNAMEV4(ipc->ip_dst), proto,
IP_HL(ipc) << 2, i);
t += strlen(t);
if (ipoff & IP_OFFMASK) {
sprintf(t, "(frag %d:%hu@%hu%s%s)",
ntohs(ipc->ip_id),
i - (IP_HL(ipc) << 2),
(ipoff & IP_OFFMASK) << 3,
ipoff & IP_MF ? "+" : "",
ipoff & IP_DF ? "-" : "");
}
}
}
} else {
sprintf(t, "%s -> ", hostname(f, s));
t += strlen(t);
sprintf(t, "%s PR %s len %hu (%hu)",
hostname(f, d), proto, hl, plen);
t += strlen(t);
if (off & IP_OFFMASK)
sprintf(t, " (frag %d:%hu@%hu%s%s)",
ntohs(ip->ip_id),
plen - hl, (off & IP_OFFMASK) << 3,
ipoff & IP_MF ? "+" : "",
ipoff & IP_DF ? "-" : "");
}
t += strlen(t);
printipflog:
if (ipf->fl_flags & FR_KEEPSTATE) {
(void) strcpy(t, " K-S");
t += strlen(t);
}
if (ipf->fl_flags & FR_KEEPFRAG) {
(void) strcpy(t, " K-F");
t += strlen(t);
}
if (ipf->fl_dir == 0)
strcpy(t, " IN");
else if (ipf->fl_dir == 1)
strcpy(t, " OUT");
t += strlen(t);
if (ipf->fl_logtag != 0) {
sprintf(t, " log-tag %d", ipf->fl_logtag);
t += strlen(t);
}
if (ipf->fl_nattag.ipt_num[0] != 0) {
strcpy(t, " nat-tag ");
t += strlen(t);
strncpy(t, ipf->fl_nattag.ipt_tag, sizeof(ipf->fl_nattag));
t += strlen(t);
}
if ((ipf->fl_lflags & FI_LOWTTL) != 0) {
strcpy(t, " low-ttl");
t += 8;
}
if ((ipf->fl_lflags & FI_OOW) != 0) {
strcpy(t, " OOW");
t += 4;
}
if ((ipf->fl_lflags & FI_BAD) != 0) {
strcpy(t, " bad");
t += 4;
}
if ((ipf->fl_lflags & FI_NATED) != 0) {
strcpy(t, " NAT");
t += 4;
}
if ((ipf->fl_lflags & FI_BADNAT) != 0) {
strcpy(t, " bad-NAT");
t += 8;
}
if ((ipf->fl_lflags & FI_BADSRC) != 0) {
strcpy(t, " bad-src");
t += 8;
}
if ((ipf->fl_lflags & FI_MULTICAST) != 0) {
strcpy(t, " multicast");
t += 10;
}
if ((ipf->fl_lflags & FI_BROADCAST) != 0) {
strcpy(t, " broadcast");
t += 10;
}
if ((ipf->fl_lflags & (FI_MULTICAST|FI_BROADCAST|FI_MBCAST)) ==
FI_MBCAST) {
strcpy(t, " mbcast");
t += 7;
}
if (ipf->fl_breason != 0) {
strcpy(t, " reason:");
t += 8;
strcpy(t, reasons[ipf->fl_breason]);
t += strlen(reasons[ipf->fl_breason]);
}
*t++ = '\n';
*t++ = '\0';
defaction = 0;
if (conf->cfile != NULL)
defaction = check_action(buf, line, ipmonopts, lvl);
if (defaction == 0) {
if (ipmonopts & IPMON_SYSLOG) {
syslog(lvl, "%s", line);
} else if (conf->log != NULL) {
(void) fprintf(conf->log, "%s", line);
}
if (ipmonopts & IPMON_HEXHDR) {
dumphex(conf->log, ipmonopts, buf,
sizeof(iplog_t) + sizeof(*ipf));
}
if (ipmonopts & IPMON_HEXBODY) {
dumphex(conf->log, ipmonopts, (char *)ip,
ipf->fl_plen + ipf->fl_hlen);
} else if ((ipmonopts & IPMON_LOGBODY) &&
(ipf->fl_flags & FR_LOGBODY)) {
dumphex(conf->log, ipmonopts, (char *)ip + ipf->fl_hlen,
ipf->fl_plen);
}
}
}
static void
usage(char *prog)
{
fprintf(stderr, "Usage: %s [ -abDFhnpstvxX ] [ -B <binary-logfile> ] [ -C <config-file> ]\n"
"\t[ -f <device> ] [ -L <facility> ] [ -N <device> ]\n"
"\t[ -o [NSI] ] [ -O [NSI] ] [ -P <pidfile> ] [ -S <device> ]\n"
"\t[ <filename> ]\n", prog);
exit(1);
}
static void
write_pid(char *file)
{
FILE *fp = NULL;
int fd;
if ((fd = open(file, O_CREAT|O_TRUNC|O_WRONLY, 0644)) >= 0) {
fp = fdopen(fd, "w");
if (fp == NULL) {
close(fd);
fprintf(stderr,
"unable to open/create pid file: %s\n", file);
return;
}
fprintf(fp, "%d", getpid());
fclose(fp);
}
}
static void
flushlogs(char *file, FILE *log)
{
int fd, flushed = 0;
if ((fd = open(file, O_RDWR)) == -1) {
(void) fprintf(stderr, "%s: open: %s\n",
file, STRERROR(errno));
exit(1);
}
if (ioctl(fd, SIOCIPFFB, &flushed) == 0) {
printf("%d bytes flushed from log buffer\n",
flushed);
fflush(stdout);
} else
ipferror(fd, "SIOCIPFFB");
(void) close(fd);
if (flushed) {
if (ipmonopts & IPMON_SYSLOG) {
syslog(LOG_INFO, "%d bytes flushed from log\n",
flushed);
} else if ((log != stdout) && (log != NULL)) {
fprintf(log, "%d bytes flushed from log\n", flushed);
}
}
}
static void
logopts(int turnon, char *options)
{
int flags = 0;
char *s;
for (s = options; *s; s++)
{
switch (*s)
{
case 'N' :
flags |= IPMON_NAT;
break;
case 'S' :
flags |= IPMON_STATE;
break;
case 'I' :
flags |= IPMON_FILTER;
break;
default :
fprintf(stderr, "Unknown log option %c\n", *s);
exit(1);
}
}
if (turnon)
ipmonopts |= flags;
else
ipmonopts &= ~(flags);
}
static void
initconfig(config_t *conf)
{
int i;
memset(conf, 0, sizeof(*conf));
conf->log = stdout;
conf->maxfd = -1;
for (i = 0; i < 3; i++) {
conf->logsrc[i].fd = -1;
conf->logsrc[i].logtype = -1;
conf->logsrc[i].regular = -1;
}
conf->logsrc[0].file = IPL_NAME;
conf->logsrc[1].file = IPNAT_NAME;
conf->logsrc[2].file = IPSTATE_NAME;
add_doing(&executesaver);
add_doing(&snmpv1saver);
add_doing(&snmpv2saver);
add_doing(&syslogsaver);
add_doing(&filesaver);
add_doing(&nothingsaver);
}
int
main(int argc, char *argv[])
{
int doread, c, make_daemon = 0;
char *prog;
config_t config;
prog = strrchr(argv[0], '/');
if (prog == NULL)
prog = argv[0];
else
prog++;
initconfig(&config);
while ((c = getopt(argc, argv,
"?abB:C:Df:FhL:nN:o:O:pP:sS:tvxX")) != -1)
switch (c)
{
case 'a' :
ipmonopts |= IPMON_LOGALL;
config.logsrc[0].logtype = IPL_LOGIPF;
config.logsrc[1].logtype = IPL_LOGNAT;
config.logsrc[2].logtype = IPL_LOGSTATE;
break;
case 'b' :
ipmonopts |= IPMON_LOGBODY;
break;
case 'B' :
config.bfile = optarg;
config.blog = fopen(optarg, "a");
break;
case 'C' :
config.cfile = optarg;
break;
case 'D' :
make_daemon = 1;
break;
case 'f' : case 'I' :
ipmonopts |= IPMON_FILTER;
config.logsrc[0].logtype = IPL_LOGIPF;
config.logsrc[0].file = optarg;
break;
case 'F' :
flushlogs(config.logsrc[0].file, config.log);
flushlogs(config.logsrc[1].file, config.log);
flushlogs(config.logsrc[2].file, config.log);
break;
case 'L' :
logfac = fac_findname(optarg);
if (logfac == -1) {
fprintf(stderr,
"Unknown syslog facility '%s'\n",
optarg);
exit(1);
}
break;
case 'n' :
ipmonopts |= IPMON_RESOLVE;
opts &= ~OPT_NORESOLVE;
break;
case 'N' :
ipmonopts |= IPMON_NAT;
config.logsrc[1].logtype = IPL_LOGNAT;
config.logsrc[1].file = optarg;
break;
case 'o' : case 'O' :
logopts(c == 'o', optarg);
if (ipmonopts & IPMON_FILTER)
config.logsrc[0].logtype = IPL_LOGIPF;
if (ipmonopts & IPMON_NAT)
config.logsrc[1].logtype = IPL_LOGNAT;
if (ipmonopts & IPMON_STATE)
config.logsrc[2].logtype = IPL_LOGSTATE;
break;
case 'p' :
ipmonopts |= IPMON_PORTNUM;
break;
case 'P' :
pidfile = optarg;
break;
case 's' :
ipmonopts |= IPMON_SYSLOG;
config.log = NULL;
break;
case 'S' :
ipmonopts |= IPMON_STATE;
config.logsrc[2].logtype = IPL_LOGSTATE;
config.logsrc[2].file = optarg;
break;
case 't' :
ipmonopts |= IPMON_TAIL;
break;
case 'v' :
ipmonopts |= IPMON_VERBOSE;
break;
case 'x' :
ipmonopts |= IPMON_HEXBODY;
break;
case 'X' :
ipmonopts |= IPMON_HEXHDR;
break;
default :
case 'h' :
case '?' :
usage(argv[0]);
}
if (ipmonopts & IPMON_SYSLOG)
openlog(prog, LOG_NDELAY|LOG_PID, logfac);
init_tabs();
if (config.cfile)
if (load_config(config.cfile) == -1) {
unload_config();
exit(1);
}
/*
* Default action is to only open the filter log file.
*/
if ((config.logsrc[0].logtype == -1) &&
(config.logsrc[0].logtype == -1) &&
(config.logsrc[0].logtype == -1))
config.logsrc[0].logtype = IPL_LOGIPF;
openlogs(&config);
if (!(ipmonopts & IPMON_SYSLOG)) {
config.file = argv[optind];
config.log = config.file ? fopen(config.file, "a") : stdout;
if (config.log == NULL) {
(void) fprintf(stderr, "%s: fopen: %s\n",
argv[optind], STRERROR(errno));
exit(1);
/* NOTREACHED */
}
setvbuf(config.log, NULL, _IONBF, 0);
} else {
config.log = NULL;
}
if (make_daemon &&
((config.log != stdout) || (ipmonopts & IPMON_SYSLOG))) {
#ifdef BSD
daemon(0, !(ipmonopts & IPMON_SYSLOG));
#else
int pid;
switch (fork())
{
case -1 :
(void) fprintf(stderr, "%s: fork() failed: %s\n",
argv[0], STRERROR(errno));
exit(1);
/* NOTREACHED */
case 0 :
break;
default :
exit(0);
}
setsid();
if ((ipmonopts & IPMON_SYSLOG))
close(2);
#endif /* !BSD */
close(0);
close(1);
write_pid(pidfile);
}
signal(SIGHUP, handlehup);
for (doread = 1; doread; )
doread = read_loginfo(&config);
unload_config();
return (0);
/* NOTREACHED */
}
static void
openlogs(config_t *conf)
{
logsource_t *l;
struct stat sb;
int i;
for (i = 0; i < 3; i++) {
l = &conf->logsrc[i];
if (l->logtype == -1)
continue;
if (!strcmp(l->file, "-"))
l->fd = 0;
else {
if ((l->fd= open(l->file, O_RDONLY)) == -1) {
(void) fprintf(stderr,
"%s: open: %s\n", l->file,
STRERROR(errno));
exit(1);
/* NOTREACHED */
}
if (fstat(l->fd, &sb) == -1) {
(void) fprintf(stderr, "%d: fstat: %s\n",
l->fd, STRERROR(errno));
exit(1);
/* NOTREACHED */
}
l->regular = !S_ISCHR(sb.st_mode);
if (l->regular)
l->size = sb.st_size;
FD_SET(l->fd, &conf->fdmr);
if (l->fd > conf->maxfd)
conf->maxfd = l->fd;
}
}
}
static int
read_loginfo(config_t *conf)
{
iplog_t buf[DEFAULT_IPFLOGSIZE/sizeof(iplog_t)+1];
int n, tr, nr, i;
logsource_t *l;
fd_set fdr;
fdr = conf->fdmr;
n = select(conf->maxfd + 1, &fdr, NULL, NULL, NULL);
if (n == 0)
return (1);
if (n == -1) {
if (errno == EINTR)
return (1);
return (-1);
}
for (i = 0, nr = 0; i < 3; i++) {
l = &conf->logsrc[i];
if ((l->logtype == -1) || !FD_ISSET(l->fd, &fdr))
continue;
tr = 0;
if (l->regular) {
tr = (lseek(l->fd, 0, SEEK_CUR) < l->size);
if (!tr && !(ipmonopts & IPMON_TAIL))
return (0);
}
n = 0;
tr = read_log(l->fd, &n, (char *)buf, sizeof(buf));
if (donehup) {
if (conf->file != NULL) {
if (conf->log != NULL) {
fclose(conf->log);
conf->log = NULL;
}
conf->log = fopen(conf->file, "a");
}
if (conf->bfile != NULL) {
if (conf->blog != NULL) {
fclose(conf->blog);
conf->blog = NULL;
}
conf->blog = fopen(conf->bfile, "a");
}
init_tabs();
if (conf->cfile != NULL)
load_config(conf->cfile);
donehup = 0;
}
switch (tr)
{
case -1 :
if (ipmonopts & IPMON_SYSLOG)
syslog(LOG_CRIT, "read: %m\n");
else {
ipferror(l->fd, "read");
}
return (0);
case 1 :
if (ipmonopts & IPMON_SYSLOG)
syslog(LOG_CRIT, "aborting logging\n");
else if (conf->log != NULL)
fprintf(conf->log, "aborting logging\n");
return (0);
case 2 :
break;
case 0 :
nr += tr;
if (n > 0) {
print_log(conf, l, (char *)buf, n);
if (!(ipmonopts & IPMON_SYSLOG))
fflush(conf->log);
}
break;
}
}
if (!nr && (ipmonopts & IPMON_TAIL))
sleep(1);
return (1);
}
diff --git a/sbin/ipf/ipmon/ipmon_y.y b/sbin/ipf/ipmon/ipmon_y.y
index c70e17adcec0..9d3a7ff30c93 100644
--- a/sbin/ipf/ipmon/ipmon_y.y
+++ b/sbin/ipf/ipmon/ipmon_y.y
@@ -1,1038 +1,1037 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
%{
#include "ipf.h"
#include <syslog.h>
#undef OPT_NAT
#undef OPT_VERBOSE
#include "ipmon_l.h"
#include "ipmon.h"
#include <dlfcn.h>
#define YYDEBUG 1
extern void yyerror(char *);
extern int yyparse(void);
extern int yylex(void);
extern int yydebug;
extern FILE *yyin;
extern int yylineNum;
extern int ipmonopts;
typedef struct opt_s {
struct opt_s *o_next;
int o_line;
int o_type;
int o_num;
char *o_str;
struct in_addr o_ip;
int o_logfac;
int o_logpri;
} opt_t;
static void build_action(opt_t *, ipmon_doing_t *);
static opt_t *new_opt(int);
static void free_action(ipmon_action_t *);
static void print_action(ipmon_action_t *);
static int find_doing(char *);
static ipmon_doing_t *build_doing(char *, char *);
static void print_match(ipmon_action_t *);
static int install_saver(char *, char *);
static ipmon_action_t *alist = NULL;
ipmon_saver_int_t *saverlist = NULL;
%}
%union {
char *str;
u_32_t num;
struct in_addr addr;
struct opt_s *opt;
union i6addr ip6;
struct ipmon_doing_s *ipmd;
}
%token <num> YY_NUMBER YY_HEX
%token <str> YY_STR
%token <ip6> YY_IPV6
%token YY_COMMENT
%token YY_CMP_EQ YY_CMP_NE YY_CMP_LE YY_CMP_GE YY_CMP_LT YY_CMP_GT
%token YY_RANGE_OUT YY_RANGE_IN
%token IPM_MATCH IPM_BODY IPM_COMMENT IPM_DIRECTION IPM_DSTIP IPM_DSTPORT
%token IPM_EVERY IPM_GROUP IPM_INTERFACE IPM_IN IPM_NO IPM_OUT IPM_LOADACTION
%token IPM_PACKET IPM_PACKETS IPM_POOL IPM_PROTOCOL IPM_RESULT IPM_RULE
%token IPM_SECOND IPM_SECONDS IPM_SRCIP IPM_SRCPORT IPM_LOGTAG IPM_WITH
%token IPM_DO IPM_DOING IPM_TYPE IPM_NAT
%token IPM_STATE IPM_NATTAG IPM_IPF
%type <addr> ipv4
%type <opt> direction dstip dstport every group interface
%type <opt> protocol result rule srcip srcport logtag matching
%type <opt> matchopt nattag type
%type <num> typeopt
%type <ipmd> doopt doing
%%
file: action
| file action
;
action: line ';'
| assign ';'
| IPM_COMMENT
| YY_COMMENT
;
line: IPM_MATCH '{' matching ';' '}' IPM_DO '{' doing ';' '}'
{ build_action($3, $8);
resetlexer();
}
| IPM_LOADACTION YY_STR YY_STR { if (install_saver($2, $3))
yyerror("install saver");
}
;
assign: YY_STR assigning YY_STR { set_variable($1, $3);
resetlexer();
free($1);
free($3);
yyvarnext = 0;
}
;
assigning:
'=' { yyvarnext = 1; }
;
matching:
matchopt { $$ = $1; }
| matchopt ',' matching { $1->o_next = $3; $$ = $1; }
;
matchopt:
direction { $$ = $1; }
| dstip { $$ = $1; }
| dstport { $$ = $1; }
| every { $$ = $1; }
| group { $$ = $1; }
| interface { $$ = $1; }
| protocol { $$ = $1; }
| result { $$ = $1; }
| rule { $$ = $1; }
| srcip { $$ = $1; }
| srcport { $$ = $1; }
| logtag { $$ = $1; }
| nattag { $$ = $1; }
| type { $$ = $1; }
;
doing:
doopt { $$ = $1; }
| doopt ',' doing { $1->ipmd_next = $3; $$ = $1; }
;
doopt:
YY_STR { if (find_doing($1) != IPM_DOING)
yyerror("unknown action");
}
'(' YY_STR ')' { $$ = build_doing($1, $4);
if ($$ == NULL)
yyerror("action building");
}
| YY_STR { if (find_doing($1) == IPM_DOING)
$$ = build_doing($1, NULL);
}
;
direction:
IPM_DIRECTION '=' IPM_IN { $$ = new_opt(IPM_DIRECTION);
$$->o_num = IPM_IN; }
| IPM_DIRECTION '=' IPM_OUT { $$ = new_opt(IPM_DIRECTION);
$$->o_num = IPM_OUT; }
;
dstip: IPM_DSTIP '=' ipv4 '/' YY_NUMBER { $$ = new_opt(IPM_DSTIP);
$$->o_ip = $3;
$$->o_num = $5; }
;
dstport:
IPM_DSTPORT '=' YY_NUMBER { $$ = new_opt(IPM_DSTPORT);
$$->o_num = $3; }
| IPM_DSTPORT '=' YY_STR { $$ = new_opt(IPM_DSTPORT);
$$->o_str = $3; }
;
every: IPM_EVERY IPM_SECOND { $$ = new_opt(IPM_SECOND);
$$->o_num = 1; }
| IPM_EVERY YY_NUMBER IPM_SECONDS { $$ = new_opt(IPM_SECOND);
$$->o_num = $2; }
| IPM_EVERY IPM_PACKET { $$ = new_opt(IPM_PACKET);
$$->o_num = 1; }
| IPM_EVERY YY_NUMBER IPM_PACKETS { $$ = new_opt(IPM_PACKET);
$$->o_num = $2; }
;
group: IPM_GROUP '=' YY_NUMBER { $$ = new_opt(IPM_GROUP);
$$->o_num = $3; }
| IPM_GROUP '=' YY_STR { $$ = new_opt(IPM_GROUP);
$$->o_str = $3; }
;
interface:
IPM_INTERFACE '=' YY_STR { $$ = new_opt(IPM_INTERFACE);
$$->o_str = $3; }
;
logtag: IPM_LOGTAG '=' YY_NUMBER { $$ = new_opt(IPM_LOGTAG);
$$->o_num = $3; }
;
nattag: IPM_NATTAG '=' YY_STR { $$ = new_opt(IPM_NATTAG);
$$->o_str = $3; }
;
protocol:
IPM_PROTOCOL '=' YY_NUMBER { $$ = new_opt(IPM_PROTOCOL);
$$->o_num = $3; }
| IPM_PROTOCOL '=' YY_STR { $$ = new_opt(IPM_PROTOCOL);
$$->o_num = getproto($3);
free($3);
}
;
result: IPM_RESULT '=' YY_STR { $$ = new_opt(IPM_RESULT);
$$->o_str = $3; }
;
rule: IPM_RULE '=' YY_NUMBER { $$ = new_opt(IPM_RULE);
$$->o_num = YY_NUMBER; }
;
srcip: IPM_SRCIP '=' ipv4 '/' YY_NUMBER { $$ = new_opt(IPM_SRCIP);
$$->o_ip = $3;
$$->o_num = $5; }
;
srcport:
IPM_SRCPORT '=' YY_NUMBER { $$ = new_opt(IPM_SRCPORT);
$$->o_num = $3; }
| IPM_SRCPORT '=' YY_STR { $$ = new_opt(IPM_SRCPORT);
$$->o_str = $3; }
;
type: IPM_TYPE '=' typeopt { $$ = new_opt(IPM_TYPE);
$$->o_num = $3; }
;
typeopt:
IPM_IPF { $$ = IPL_MAGIC; }
| IPM_NAT { $$ = IPL_MAGIC_NAT; }
| IPM_STATE { $$ = IPL_MAGIC_STATE; }
;
ipv4: YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER
{ if ($1 > 255 || $3 > 255 || $5 > 255 || $7 > 255) {
yyerror("Invalid octet string for IP address");
return(0);
}
$$.s_addr = ($1 << 24) | ($3 << 16) | ($5 << 8) | $7;
$$.s_addr = htonl($$.s_addr);
}
%%
static struct wordtab yywords[] = {
{ "body", IPM_BODY },
{ "direction", IPM_DIRECTION },
{ "do", IPM_DO },
{ "dstip", IPM_DSTIP },
{ "dstport", IPM_DSTPORT },
{ "every", IPM_EVERY },
{ "group", IPM_GROUP },
{ "in", IPM_IN },
{ "interface", IPM_INTERFACE },
{ "ipf", IPM_IPF },
{ "load_action",IPM_LOADACTION },
{ "logtag", IPM_LOGTAG },
{ "match", IPM_MATCH },
{ "nat", IPM_NAT },
{ "nattag", IPM_NATTAG },
{ "no", IPM_NO },
{ "out", IPM_OUT },
{ "packet", IPM_PACKET },
{ "packets", IPM_PACKETS },
{ "protocol", IPM_PROTOCOL },
{ "result", IPM_RESULT },
{ "rule", IPM_RULE },
{ "second", IPM_SECOND },
{ "seconds", IPM_SECONDS },
{ "srcip", IPM_SRCIP },
{ "srcport", IPM_SRCPORT },
{ "state", IPM_STATE },
{ "with", IPM_WITH },
{ NULL, 0 }
};
static int macflags[17][2] = {
{ IPM_DIRECTION, IPMAC_DIRECTION },
{ IPM_DSTIP, IPMAC_DSTIP },
{ IPM_DSTPORT, IPMAC_DSTPORT },
{ IPM_GROUP, IPMAC_GROUP },
{ IPM_INTERFACE, IPMAC_INTERFACE },
{ IPM_LOGTAG, IPMAC_LOGTAG },
{ IPM_NATTAG, IPMAC_NATTAG },
{ IPM_PACKET, IPMAC_EVERY },
{ IPM_PROTOCOL, IPMAC_PROTOCOL },
{ IPM_RESULT, IPMAC_RESULT },
{ IPM_RULE, IPMAC_RULE },
{ IPM_SECOND, IPMAC_EVERY },
{ IPM_SRCIP, IPMAC_SRCIP },
{ IPM_SRCPORT, IPMAC_SRCPORT },
{ IPM_TYPE, IPMAC_TYPE },
{ IPM_WITH, IPMAC_WITH },
{ 0, 0 }
};
static opt_t *
new_opt(int type)
{
opt_t *o;
o = (opt_t *)calloc(1, sizeof(*o));
o->o_type = type;
o->o_line = yylineNum;
o->o_logfac = -1;
o->o_logpri = -1;
return(o);
}
static void
build_action(opt_t *olist, ipmon_doing_t *todo)
{
ipmon_action_t *a;
opt_t *o;
int i;
a = (ipmon_action_t *)calloc(1, sizeof(*a));
if (a == NULL)
return;
while ((o = olist) != NULL) {
/*
* Check to see if the same comparator is being used more than
* once per matching statement.
*/
for (i = 0; macflags[i][0]; i++)
if (macflags[i][0] == o->o_type)
break;
if (macflags[i][1] & a->ac_mflag) {
fprintf(stderr, "%s redfined on line %d\n",
yykeytostr(o->o_type), yylineNum);
if (o->o_str != NULL)
free(o->o_str);
olist = o->o_next;
free(o);
continue;
}
a->ac_mflag |= macflags[i][1];
switch (o->o_type)
{
case IPM_DIRECTION :
a->ac_direction = o->o_num;
break;
case IPM_DSTIP :
a->ac_dip = o->o_ip.s_addr;
a->ac_dmsk = htonl(0xffffffff << (32 - o->o_num));
break;
case IPM_DSTPORT :
a->ac_dport = htons(o->o_num);
break;
case IPM_INTERFACE :
a->ac_iface = o->o_str;
o->o_str = NULL;
break;
case IPM_GROUP :
if (o->o_str != NULL)
strncpy(a->ac_group, o->o_str, FR_GROUPLEN);
else
sprintf(a->ac_group, "%d", o->o_num);
break;
case IPM_LOGTAG :
a->ac_logtag = o->o_num;
break;
case IPM_NATTAG :
strncpy(a->ac_nattag, o->o_str, sizeof(a->ac_nattag));
break;
case IPM_PACKET :
a->ac_packet = o->o_num;
break;
case IPM_PROTOCOL :
a->ac_proto = o->o_num;
break;
case IPM_RULE :
a->ac_rule = o->o_num;
break;
case IPM_RESULT :
if (!strcasecmp(o->o_str, "pass"))
a->ac_result = IPMR_PASS;
else if (!strcasecmp(o->o_str, "block"))
a->ac_result = IPMR_BLOCK;
else if (!strcasecmp(o->o_str, "nomatch"))
a->ac_result = IPMR_NOMATCH;
else if (!strcasecmp(o->o_str, "log"))
a->ac_result = IPMR_LOG;
break;
case IPM_SECOND :
a->ac_second = o->o_num;
break;
case IPM_SRCIP :
a->ac_sip = o->o_ip.s_addr;
a->ac_smsk = htonl(0xffffffff << (32 - o->o_num));
break;
case IPM_SRCPORT :
a->ac_sport = htons(o->o_num);
break;
case IPM_TYPE :
a->ac_type = o->o_num;
break;
case IPM_WITH :
break;
default :
break;
}
olist = o->o_next;
if (o->o_str != NULL)
free(o->o_str);
free(o);
}
a->ac_doing = todo;
a->ac_next = alist;
alist = a;
if (ipmonopts & IPMON_VERBOSE)
print_action(a);
}
int
check_action(char *buf, char *log, int opts, int lvl)
{
ipmon_action_t *a;
struct timeval tv;
ipmon_doing_t *d;
ipmon_msg_t msg;
ipflog_t *ipf;
tcphdr_t *tcp;
iplog_t *ipl;
int matched;
u_long t1;
ip_t *ip;
matched = 0;
ipl = (iplog_t *)buf;
ipf = (ipflog_t *)(ipl +1);
ip = (ip_t *)(ipf + 1);
tcp = (tcphdr_t *)((char *)ip + (IP_HL(ip) << 2));
msg.imm_data = ipl;
msg.imm_dsize = ipl->ipl_dsize;
msg.imm_when = ipl->ipl_time.tv_sec;
msg.imm_msg = log;
msg.imm_msglen = strlen(log);
msg.imm_loglevel = lvl;
for (a = alist; a != NULL; a = a->ac_next) {
verbose(0, "== checking config rule\n");
if ((a->ac_mflag & IPMAC_DIRECTION) != 0) {
if (a->ac_direction == IPM_IN) {
if ((ipf->fl_flags & FR_INQUE) == 0) {
verbose(8, "-- direction not in\n");
continue;
}
} else if (a->ac_direction == IPM_OUT) {
if ((ipf->fl_flags & FR_OUTQUE) == 0) {
verbose(8, "-- direction not out\n");
continue;
}
}
}
if ((a->ac_type != 0) && (a->ac_type != ipl->ipl_magic)) {
verbose(8, "-- type mismatch\n");
continue;
}
if ((a->ac_mflag & IPMAC_EVERY) != 0) {
gettimeofday(&tv, NULL);
t1 = tv.tv_sec - a->ac_lastsec;
if (tv.tv_usec <= a->ac_lastusec)
t1--;
if (a->ac_second != 0) {
if (t1 < a->ac_second) {
verbose(8, "-- too soon\n");
continue;
}
a->ac_lastsec = tv.tv_sec;
a->ac_lastusec = tv.tv_usec;
}
if (a->ac_packet != 0) {
if (a->ac_pktcnt == 0)
a->ac_pktcnt++;
else if (a->ac_pktcnt == a->ac_packet) {
a->ac_pktcnt = 0;
verbose(8, "-- packet count\n");
continue;
} else {
a->ac_pktcnt++;
verbose(8, "-- packet count\n");
continue;
}
}
}
if ((a->ac_mflag & IPMAC_DSTIP) != 0) {
if ((ip->ip_dst.s_addr & a->ac_dmsk) != a->ac_dip) {
verbose(8, "-- dstip wrong\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_DSTPORT) != 0) {
if (ip->ip_p != IPPROTO_UDP &&
ip->ip_p != IPPROTO_TCP) {
verbose(8, "-- not port protocol\n");
continue;
}
if (tcp->th_dport != a->ac_dport) {
verbose(8, "-- dport mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_GROUP) != 0) {
if (strncmp(a->ac_group, ipf->fl_group,
FR_GROUPLEN) != 0) {
verbose(8, "-- group mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_INTERFACE) != 0) {
if (strcmp(a->ac_iface, ipf->fl_ifname)) {
verbose(8, "-- ifname mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_PROTOCOL) != 0) {
if (a->ac_proto != ip->ip_p) {
verbose(8, "-- protocol mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_RESULT) != 0) {
if ((ipf->fl_flags & FF_LOGNOMATCH) != 0) {
if (a->ac_result != IPMR_NOMATCH) {
verbose(8, "-- ff-flags mismatch\n");
continue;
}
} else if (FR_ISPASS(ipf->fl_flags)) {
if (a->ac_result != IPMR_PASS) {
verbose(8, "-- pass mismatch\n");
continue;
}
} else if (FR_ISBLOCK(ipf->fl_flags)) {
if (a->ac_result != IPMR_BLOCK) {
verbose(8, "-- block mismatch\n");
continue;
}
} else { /* Log only */
if (a->ac_result != IPMR_LOG) {
verbose(8, "-- log mismatch\n");
continue;
}
}
}
if ((a->ac_mflag & IPMAC_RULE) != 0) {
if (a->ac_rule != ipf->fl_rule) {
verbose(8, "-- rule mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_SRCIP) != 0) {
if ((ip->ip_src.s_addr & a->ac_smsk) != a->ac_sip) {
verbose(8, "-- srcip mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_SRCPORT) != 0) {
if (ip->ip_p != IPPROTO_UDP &&
ip->ip_p != IPPROTO_TCP) {
verbose(8, "-- port protocol mismatch\n");
continue;
}
if (tcp->th_sport != a->ac_sport) {
verbose(8, "-- sport mismatch\n");
continue;
}
}
if ((a->ac_mflag & IPMAC_LOGTAG) != 0) {
if (a->ac_logtag != ipf->fl_logtag) {
verbose(8, "-- logtag %d != %d\n",
a->ac_logtag, ipf->fl_logtag);
continue;
}
}
if ((a->ac_mflag & IPMAC_NATTAG) != 0) {
if (strncmp(a->ac_nattag, ipf->fl_nattag.ipt_tag,
IPFTAG_LEN) != 0) {
verbose(8, "-- nattag mismatch\n");
continue;
}
}
matched = 1;
verbose(8, "++ matched\n");
/*
* It matched so now perform the saves
*/
for (d = a->ac_doing; d != NULL; d = d->ipmd_next)
(*d->ipmd_store)(d->ipmd_token, &msg);
}
return(matched);
}
static void
free_action(ipmon_action_t *a)
{
ipmon_doing_t *d;
while ((d = a->ac_doing) != NULL) {
a->ac_doing = d->ipmd_next;
(*d->ipmd_saver->ims_destroy)(d->ipmd_token);
free(d);
}
if (a->ac_iface != NULL) {
free(a->ac_iface);
a->ac_iface = NULL;
}
a->ac_next = NULL;
free(a);
}
int
load_config(char *file)
{
FILE *fp;
char *s;
unload_config();
s = getenv("YYDEBUG");
if (s != NULL)
yydebug = atoi(s);
else
yydebug = 0;
yylineNum = 1;
(void) yysettab(yywords);
fp = fopen(file, "r");
if (!fp) {
perror("load_config:fopen:");
return(-1);
}
yyin = fp;
while (!feof(fp))
yyparse();
fclose(fp);
return(0);
}
void
unload_config(void)
{
ipmon_saver_int_t *sav, **imsip;
ipmon_saver_t *is;
ipmon_action_t *a;
while ((a = alist) != NULL) {
alist = a->ac_next;
free_action(a);
}
/*
* Look for savers that have been added in dynamically from the
* configuration file.
*/
for (imsip = &saverlist; (sav = *imsip) != NULL; ) {
if (sav->imsi_handle == NULL)
imsip = &sav->imsi_next;
else {
dlclose(sav->imsi_handle);
*imsip = sav->imsi_next;
is = sav->imsi_stor;
free(sav);
free(is->ims_name);
free(is);
}
}
}
void
dump_config(void)
{
ipmon_action_t *a;
for (a = alist; a != NULL; a = a->ac_next) {
print_action(a);
printf("#\n");
}
}
static void
print_action(ipmon_action_t *a)
{
ipmon_doing_t *d;
printf("match { ");
print_match(a);
printf("; }\n");
printf("do {");
for (d = a->ac_doing; d != NULL; d = d->ipmd_next) {
printf("%s", d->ipmd_saver->ims_name);
if (d->ipmd_saver->ims_print != NULL) {
printf("(\"");
(*d->ipmd_saver->ims_print)(d->ipmd_token);
printf("\")");
}
printf(";");
}
printf("};\n");
}
void *
add_doing(ipmon_saver_t *saver)
{
ipmon_saver_int_t *it;
if (find_doing(saver->ims_name) == IPM_DOING)
return(NULL);
it = calloc(1, sizeof(*it));
if (it == NULL)
return(NULL);
it->imsi_stor = saver;
it->imsi_next = saverlist;
saverlist = it;
return(it);
}
static int
find_doing(char *string)
{
ipmon_saver_int_t *it;
for (it = saverlist; it != NULL; it = it->imsi_next) {
if (!strcmp(it->imsi_stor->ims_name, string))
return(IPM_DOING);
}
return(0);
}
static ipmon_doing_t *
build_doing(char *target, char *options)
{
ipmon_saver_int_t *it;
char *strarray[2];
ipmon_doing_t *d, *d1;
ipmon_action_t *a;
ipmon_saver_t *save;
d = calloc(1, sizeof(*d));
if (d == NULL)
return(NULL);
for (it = saverlist; it != NULL; it = it->imsi_next) {
if (!strcmp(it->imsi_stor->ims_name, target))
break;
}
if (it == NULL) {
free(d);
return(NULL);
}
strarray[0] = options;
strarray[1] = NULL;
d->ipmd_token = (*it->imsi_stor->ims_parse)(strarray);
if (d->ipmd_token == NULL) {
free(d);
return(NULL);
}
save = it->imsi_stor;
d->ipmd_saver = save;
d->ipmd_store = it->imsi_stor->ims_store;
/*
* Look for duplicate do-things that need to be dup'd
*/
for (a = alist; a != NULL; a = a->ac_next) {
for (d1 = a->ac_doing; d1 != NULL; d1 = d1->ipmd_next) {
if (save != d1->ipmd_saver)
continue;
if (save->ims_match == NULL || save->ims_dup == NULL)
continue;
if ((*save->ims_match)(d->ipmd_token, d1->ipmd_token))
continue;
(*d->ipmd_saver->ims_destroy)(d->ipmd_token);
d->ipmd_token = (*save->ims_dup)(d1->ipmd_token);
break;
}
}
return(d);
}
static void
print_match(ipmon_action_t *a)
{
char *coma = "";
if ((a->ac_mflag & IPMAC_DIRECTION) != 0) {
printf("direction = ");
if (a->ac_direction == IPM_IN)
printf("in");
else if (a->ac_direction == IPM_OUT)
printf("out");
coma = ", ";
}
if ((a->ac_mflag & IPMAC_DSTIP) != 0) {
printf("%sdstip = ", coma);
printhostmask(AF_INET, &a->ac_dip, &a->ac_dmsk);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_DSTPORT) != 0) {
printf("%sdstport = %hu", coma, ntohs(a->ac_dport));
coma = ", ";
}
if ((a->ac_mflag & IPMAC_GROUP) != 0) {
char group[FR_GROUPLEN+1];
strncpy(group, a->ac_group, FR_GROUPLEN);
group[FR_GROUPLEN] = '\0';
printf("%sgroup = %s", coma, group);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_INTERFACE) != 0) {
printf("%siface = %s", coma, a->ac_iface);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_LOGTAG) != 0) {
printf("%slogtag = %u", coma, a->ac_logtag);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_NATTAG) != 0) {
char tag[17];
strncpy(tag, a->ac_nattag, 16);
tag[16] = '\0';
printf("%snattag = %s", coma, tag);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_PROTOCOL) != 0) {
printf("%sprotocol = %u", coma, a->ac_proto);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_RESULT) != 0) {
printf("%sresult = ", coma);
switch (a->ac_result)
{
case IPMR_LOG :
printf("log");
break;
case IPMR_PASS :
printf("pass");
break;
case IPMR_BLOCK :
printf("block");
break;
case IPMR_NOMATCH :
printf("nomatch");
break;
}
coma = ", ";
}
if ((a->ac_mflag & IPMAC_RULE) != 0) {
printf("%srule = %u", coma, a->ac_rule);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_EVERY) != 0) {
if (a->ac_packet > 1) {
printf("%severy %d packets", coma, a->ac_packet);
coma = ", ";
} else if (a->ac_packet == 1) {
printf("%severy packet", coma);
coma = ", ";
}
if (a->ac_second > 1) {
printf("%severy %d seconds", coma, a->ac_second);
coma = ", ";
} else if (a->ac_second == 1) {
printf("%severy second", coma);
coma = ", ";
}
}
if ((a->ac_mflag & IPMAC_SRCIP) != 0) {
printf("%ssrcip = ", coma);
printhostmask(AF_INET, &a->ac_sip, &a->ac_smsk);
coma = ", ";
}
if ((a->ac_mflag & IPMAC_SRCPORT) != 0) {
printf("%ssrcport = %hu", coma, ntohs(a->ac_sport));
coma = ", ";
}
if ((a->ac_mflag & IPMAC_TYPE) != 0) {
printf("%stype = ", coma);
switch (a->ac_type)
{
case IPL_LOGIPF :
printf("ipf");
break;
case IPL_LOGSTATE :
printf("state");
break;
case IPL_LOGNAT :
printf("nat");
break;
}
coma = ", ";
}
if ((a->ac_mflag & IPMAC_WITH) != 0) {
printf("%swith ", coma);
coma = ", ";
}
}
static int
install_saver(char *name, char *path)
{
ipmon_saver_int_t *isi;
ipmon_saver_t *is;
char nbuf[80];
if (find_doing(name) == IPM_DOING)
return(-1);
isi = calloc(1, sizeof(*isi));
if (isi == NULL)
return(-1);
is = calloc(1, sizeof(*is));
if (is == NULL)
goto loaderror;
is->ims_name = name;
#ifdef RTLD_LAZY
isi->imsi_handle = dlopen(path, RTLD_LAZY);
#endif
#ifdef DL_LAZY
isi->imsi_handle = dlopen(path, DL_LAZY);
#endif
if (isi->imsi_handle == NULL)
goto loaderror;
snprintf(nbuf, sizeof(nbuf), "%sdup", name);
is->ims_dup = (ims_dup_func_t)dlsym(isi->imsi_handle, nbuf);
snprintf(nbuf, sizeof(nbuf), "%sdestroy", name);
is->ims_destroy = (ims_destroy_func_t)dlsym(isi->imsi_handle, nbuf);
if (is->ims_destroy == NULL)
goto loaderror;
snprintf(nbuf, sizeof(nbuf), "%smatch", name);
is->ims_match = (ims_match_func_t)dlsym(isi->imsi_handle, nbuf);
snprintf(nbuf, sizeof(nbuf), "%sparse", name);
is->ims_parse = (ims_parse_func_t)dlsym(isi->imsi_handle, nbuf);
if (is->ims_parse == NULL)
goto loaderror;
snprintf(nbuf, sizeof(nbuf), "%sprint", name);
is->ims_print = (ims_print_func_t)dlsym(isi->imsi_handle, nbuf);
if (is->ims_print == NULL)
goto loaderror;
snprintf(nbuf, sizeof(nbuf), "%sstore", name);
is->ims_store = (ims_store_func_t)dlsym(isi->imsi_handle, nbuf);
if (is->ims_store == NULL)
goto loaderror;
isi->imsi_stor = is;
isi->imsi_next = saverlist;
saverlist = isi;
return(0);
loaderror:
if (isi->imsi_handle != NULL)
dlclose(isi->imsi_handle);
free(isi);
if (is != NULL)
free(is);
return(-1);
}
diff --git a/sbin/ipf/ipnat/ipnat.c b/sbin/ipf/ipnat/ipnat.c
index 5558ef8693d0..07d11fc535ee 100644
--- a/sbin/ipf/ipnat/ipnat.c
+++ b/sbin/ipf/ipnat/ipnat.c
@@ -1,833 +1,832 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* Added redirect stuff and a variety of bug fixes. (mcn@EnGarde.com)
*/
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <errno.h>
#include <sys/types.h>
#if !defined(__SVR4)
#include <strings.h>
#else
#include <sys/byteorder.h>
#endif
#include <sys/time.h>
#include <sys/param.h>
#include <stdlib.h>
#include <unistd.h>
#include <stddef.h>
#include <sys/file.h>
#define _KERNEL
#include <sys/uio.h>
#undef _KERNEL
#include <sys/socket.h>
#include <sys/ioctl.h>
#if defined(sun) && defined(__SVR4)
# include <sys/ioccom.h>
# include <sys/sysmacros.h>
#endif
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/tcp.h>
#include <net/if.h>
#include <netdb.h>
#include <arpa/nameser.h>
#include <arpa/inet.h>
#include <resolv.h>
#include <ctype.h>
# include <nlist.h>
#include "ipf.h"
#include "netinet/ipl.h"
#include "kmem.h"
# define STRERROR(x) strerror(x)
#if !defined(lint)
static const char sccsid[] ="@(#)ipnat.c 1.9 6/5/96 (C) 1993 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#if SOLARIS
#define bzero(a,b) memset(a,0,b)
#endif
int use_inet6 = 0;
extern char *optarg;
void dostats(int, natstat_t *, int, int, int *);
void dotable(natstat_t *, int, int, int, char *);
void flushtable(int, int, int *);
void usage(char *);
int main(int, char*[]);
void showhostmap(natstat_t *nsp);
void natstat_dead(natstat_t *, char *);
void dostats_live(int, natstat_t *, int, int *);
void showhostmap_dead(natstat_t *);
void showhostmap_live(int, natstat_t *);
void dostats_dead(natstat_t *, int, int *);
int nat_matcharray(nat_t *, int *);
int opts;
int nohdrfields = 0;
wordtab_t *nat_fields = NULL;
void
usage(char *name)
{
fprintf(stderr, "Usage: %s [-CFhlnrRsv] [-f filename]\n", name);
exit(1);
}
int
main(int argc, char *argv[])
{
int fd, c, mode, *natfilter;
char *file, *core, *kernel;
natstat_t ns, *nsp;
ipfobj_t obj;
fd = -1;
opts = 0;
nsp = &ns;
file = NULL;
core = NULL;
kernel = NULL;
mode = O_RDWR;
natfilter = NULL;
assigndefined(getenv("IPNAT_PREDEFINED"));
while ((c = getopt(argc, argv, "CdFf:hlm:M:N:nO:prRsv")) != -1)
switch (c)
{
case 'C' :
opts |= OPT_CLEAR;
break;
case 'd' :
opts |= OPT_DEBUG;
break;
case 'f' :
file = optarg;
break;
case 'F' :
opts |= OPT_FLUSH;
break;
case 'h' :
opts |=OPT_HITS;
break;
case 'l' :
opts |= OPT_LIST;
mode = O_RDONLY;
break;
case 'm' :
natfilter = parseipfexpr(optarg, NULL);
break;
case 'M' :
core = optarg;
break;
case 'N' :
kernel = optarg;
break;
case 'n' :
opts |= OPT_DONOTHING|OPT_DONTOPEN;
mode = O_RDONLY;
break;
case 'O' :
nat_fields = parsefields(natfields, optarg);
break;
case 'p' :
opts |= OPT_PURGE;
break;
case 'R' :
opts |= OPT_NORESOLVE;
break;
case 'r' :
opts |= OPT_REMOVE;
break;
case 's' :
opts |= OPT_STAT;
mode = O_RDONLY;
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
}
if (((opts & OPT_PURGE) != 0) && ((opts & OPT_REMOVE) == 0)) {
(void) fprintf(stderr, "%s: -p must be used with -r\n",
argv[0]);
exit(1);
}
initparse();
if ((kernel != NULL) || (core != NULL)) {
(void) setgid(getgid());
(void) setuid(getuid());
}
if (!(opts & OPT_DONOTHING)) {
if (((fd = open(IPNAT_NAME, mode)) == -1) &&
((fd = open(IPNAT_NAME, O_RDONLY)) == -1)) {
(void) fprintf(stderr, "%s: open: %s\n", IPNAT_NAME,
STRERROR(errno));
exit(1);
}
}
bzero((char *)&ns, sizeof(ns));
if ((opts & OPT_DONOTHING) == 0) {
if (checkrev(IPL_NAME) == -1) {
fprintf(stderr, "User/kernel version check failed\n");
exit(1);
}
}
if (!(opts & OPT_DONOTHING) && (kernel == NULL) && (core == NULL)) {
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_NATSTAT;
obj.ipfo_size = sizeof(*nsp);
obj.ipfo_ptr = (void *)nsp;
if (ioctl(fd, SIOCGNATS, &obj) == -1) {
ipferror(fd, "ioctl(SIOCGNATS)");
exit(1);
}
(void) setgid(getgid());
(void) setuid(getuid());
} else if ((kernel != NULL) || (core != NULL)) {
if (openkmem(kernel, core) == -1)
exit(1);
natstat_dead(nsp, kernel);
if (opts & (OPT_LIST|OPT_STAT))
dostats(fd, nsp, opts, 0, natfilter);
exit(0);
}
if (opts & (OPT_FLUSH|OPT_CLEAR))
flushtable(fd, opts, natfilter);
if (file) {
return (ipnat_parsefile(fd, ipnat_addrule, ioctl, file));
}
if (opts & (OPT_LIST|OPT_STAT))
dostats(fd, nsp, opts, 1, natfilter);
return (0);
}
/*
* Read NAT statistic information in using a symbol table and memory file
* rather than doing ioctl's.
*/
void
natstat_dead(natstat_t *nsp, char *kernel)
{
struct nlist nat_nlist[10] = {
{ "nat_table" }, /* 0 */
{ "nat_list" },
{ "maptable" },
{ "ipf_nattable_sz" },
{ "ipf_natrules_sz" },
{ "ipf_rdrrules_sz" }, /* 5 */
{ "ipf_hostmap_sz" },
{ "nat_instances" },
{ NULL }
};
void *tables[2];
if (nlist(kernel, nat_nlist) == -1) {
fprintf(stderr, "nlist error\n");
return;
}
/*
* Normally the ioctl copies all of these values into the structure
* for us, before returning it to userland, so here we must copy each
* one in individually.
*/
kmemcpy((char *)&tables, nat_nlist[0].n_value, sizeof(tables));
nsp->ns_side[0].ns_table = tables[0];
nsp->ns_side[1].ns_table = tables[1];
kmemcpy((char *)&nsp->ns_list, nat_nlist[1].n_value,
sizeof(nsp->ns_list));
kmemcpy((char *)&nsp->ns_maptable, nat_nlist[2].n_value,
sizeof(nsp->ns_maptable));
kmemcpy((char *)&nsp->ns_nattab_sz, nat_nlist[3].n_value,
sizeof(nsp->ns_nattab_sz));
kmemcpy((char *)&nsp->ns_rultab_sz, nat_nlist[4].n_value,
sizeof(nsp->ns_rultab_sz));
kmemcpy((char *)&nsp->ns_rdrtab_sz, nat_nlist[5].n_value,
sizeof(nsp->ns_rdrtab_sz));
kmemcpy((char *)&nsp->ns_hostmap_sz, nat_nlist[6].n_value,
sizeof(nsp->ns_hostmap_sz));
kmemcpy((char *)&nsp->ns_instances, nat_nlist[7].n_value,
sizeof(nsp->ns_instances));
}
/*
* Issue an ioctl to flush either the NAT rules table or the active mapping
* table or both.
*/
void
flushtable(int fd, int opts, int *match)
{
int n = 0;
if (opts & OPT_FLUSH) {
n = 0;
if (!(opts & OPT_DONOTHING)) {
if (match != NULL) {
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = match[0] * sizeof(int);
obj.ipfo_type = IPFOBJ_IPFEXPR;
obj.ipfo_ptr = match;
if (ioctl(fd, SIOCMATCHFLUSH, &obj) == -1) {
ipferror(fd, "ioctl(SIOCMATCHFLUSH)");
n = -1;
} else {
n = obj.ipfo_retval;
}
} else if (ioctl(fd, SIOCIPFFL, &n) == -1) {
ipferror(fd, "ioctl(SIOCIPFFL)");
n = -1;
}
}
if (n >= 0)
printf("%d entries flushed from NAT table\n", n);
}
if (opts & OPT_CLEAR) {
n = 1;
if (!(opts & OPT_DONOTHING) && ioctl(fd, SIOCIPFFL, &n) == -1)
ipferror(fd, "ioctl(SIOCCNATL)");
else
printf("%d entries flushed from NAT list\n", n);
}
}
/*
* Display NAT statistics.
*/
void
dostats_dead(natstat_t *nsp, int opts, int *filter)
{
nat_t *np, nat;
ipnat_t ipn;
int i;
if (nat_fields == NULL) {
printf("List of active MAP/Redirect filters:\n");
while (nsp->ns_list) {
if (kmemcpy((char *)&ipn, (long)nsp->ns_list,
sizeof(ipn))) {
perror("kmemcpy");
break;
}
if (opts & OPT_HITS)
printf("%lu ", ipn.in_hits);
printnat(&ipn, opts & (OPT_DEBUG|OPT_VERBOSE));
nsp->ns_list = ipn.in_next;
}
}
if (nat_fields == NULL) {
printf("\nList of active sessions:\n");
} else if (nohdrfields == 0) {
for (i = 0; nat_fields[i].w_value != 0; i++) {
printfieldhdr(natfields, nat_fields + i);
if (nat_fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
}
for (np = nsp->ns_instances; np; np = nat.nat_next) {
if (kmemcpy((char *)&nat, (long)np, sizeof(nat)))
break;
if ((filter != NULL) && (nat_matcharray(&nat, filter) == 0))
continue;
if (nat_fields != NULL) {
for (i = 0; nat_fields[i].w_value != 0; i++) {
printnatfield(&nat, nat_fields[i].w_value);
if (nat_fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
} else {
printactivenat(&nat, opts, nsp->ns_ticks);
if (nat.nat_aps) {
int proto;
if (nat.nat_dir & NAT_OUTBOUND)
proto = nat.nat_pr[1];
else
proto = nat.nat_pr[0];
printaps(nat.nat_aps, opts, proto);
}
}
}
if (opts & OPT_VERBOSE)
showhostmap_dead(nsp);
}
void
dotable(natstat_t *nsp, int fd, int alive, int which, char *side)
{
int sz, i, used, maxlen, minlen, totallen;
ipftable_t table;
u_int *buckets;
ipfobj_t obj;
sz = sizeof(*buckets) * nsp->ns_nattab_sz;
buckets = (u_int *)malloc(sz);
if (buckets == NULL) {
fprintf(stderr,
"cannot allocate memory (%d) for buckets\n", sz);
return;
}
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GTABLE;
obj.ipfo_size = sizeof(table);
obj.ipfo_ptr = &table;
if (which == 0) {
table.ita_type = IPFTABLE_BUCKETS_NATIN;
} else if (which == 1) {
table.ita_type = IPFTABLE_BUCKETS_NATOUT;
}
table.ita_table = buckets;
if (alive) {
if (ioctl(fd, SIOCGTABL, &obj) != 0) {
ipferror(fd, "SIOCFTABL");
free(buckets);
return;
}
} else {
if (kmemcpy((char *)buckets, (u_long)nsp->ns_nattab_sz, sz)) {
free(buckets);
return;
}
}
minlen = nsp->ns_side[which].ns_inuse;
totallen = 0;
maxlen = 0;
used = 0;
for (i = 0; i < nsp->ns_nattab_sz; i++) {
if (buckets[i] > maxlen)
maxlen = buckets[i];
if (buckets[i] < minlen)
minlen = buckets[i];
if (buckets[i] != 0)
used++;
totallen += buckets[i];
}
printf("%d%%\thash efficiency %s\n",
totallen ? used * 100 / totallen : 0, side);
printf("%2.2f%%\tbucket usage %s\n",
((float)used / nsp->ns_nattab_sz) * 100.0, side);
printf("%d\tminimal length %s\n", minlen, side);
printf("%d\tmaximal length %s\n", maxlen, side);
printf("%.3f\taverage length %s\n",
used ? ((float)totallen / used) : 0.0, side);
free(buckets);
}
void
dostats(int fd, natstat_t *nsp, int opts, int alive, int *filter)
{
/*
* Show statistics ?
*/
if (opts & OPT_STAT) {
printnatside("in", &nsp->ns_side[0]);
dotable(nsp, fd, alive, 0, "in");
printnatside("out", &nsp->ns_side[1]);
dotable(nsp, fd, alive, 1, "out");
printf("%lu\tlog successes\n", nsp->ns_side[0].ns_log);
printf("%lu\tlog failures\n", nsp->ns_side[1].ns_log);
printf("%lu\tadded in\n%lu\tadded out\n",
nsp->ns_side[0].ns_added,
nsp->ns_side[1].ns_added);
printf("%u\tactive\n", nsp->ns_active);
printf("%lu\ttransparent adds\n", nsp->ns_addtrpnt);
printf("%lu\tdivert build\n", nsp->ns_divert_build);
printf("%lu\texpired\n", nsp->ns_expire);
printf("%lu\tflush all\n", nsp->ns_flush_all);
printf("%lu\tflush closing\n", nsp->ns_flush_closing);
printf("%lu\tflush queue\n", nsp->ns_flush_queue);
printf("%lu\tflush state\n", nsp->ns_flush_state);
printf("%lu\tflush timeout\n", nsp->ns_flush_timeout);
printf("%lu\thostmap new\n", nsp->ns_hm_new);
printf("%lu\thostmap fails\n", nsp->ns_hm_newfail);
printf("%lu\thostmap add\n", nsp->ns_hm_addref);
printf("%lu\thostmap NULL rule\n", nsp->ns_hm_nullnp);
printf("%lu\tlog ok\n", nsp->ns_log_ok);
printf("%lu\tlog fail\n", nsp->ns_log_fail);
printf("%u\torphan count\n", nsp->ns_orphans);
printf("%u\trule count\n", nsp->ns_rules);
printf("%u\tmap rules\n", nsp->ns_rules_map);
printf("%u\trdr rules\n", nsp->ns_rules_rdr);
printf("%u\twilds\n", nsp->ns_wilds);
if (opts & OPT_VERBOSE)
printf("list %p\n", nsp->ns_list);
}
if (opts & OPT_LIST) {
if (alive)
dostats_live(fd, nsp, opts, filter);
else
dostats_dead(nsp, opts, filter);
}
}
/*
* Display NAT statistics.
*/
void
dostats_live(int fd, natstat_t *nsp, int opts, int *filter)
{
ipfgeniter_t iter;
char buffer[2000];
ipfobj_t obj;
ipnat_t *ipn;
nat_t nat;
int i;
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GENITER;
obj.ipfo_size = sizeof(iter);
obj.ipfo_ptr = &iter;
iter.igi_type = IPFGENITER_IPNAT;
iter.igi_nitems = 1;
iter.igi_data = buffer;
ipn = (ipnat_t *)buffer;
/*
* Show list of NAT rules and NAT sessions ?
*/
if (nat_fields == NULL) {
printf("List of active MAP/Redirect filters:\n");
while (nsp->ns_list) {
if (ioctl(fd, SIOCGENITER, &obj) == -1)
break;
if (opts & OPT_HITS)
printf("%lu ", ipn->in_hits);
printnat(ipn, opts & (OPT_DEBUG|OPT_VERBOSE));
nsp->ns_list = ipn->in_next;
}
}
if (nat_fields == NULL) {
printf("\nList of active sessions:\n");
} else if (nohdrfields == 0) {
for (i = 0; nat_fields[i].w_value != 0; i++) {
printfieldhdr(natfields, nat_fields + i);
if (nat_fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
}
i = IPFGENITER_IPNAT;
(void) ioctl(fd,SIOCIPFDELTOK, &i);
iter.igi_type = IPFGENITER_NAT;
iter.igi_nitems = 1;
iter.igi_data = &nat;
while (nsp->ns_instances != NULL) {
if (ioctl(fd, SIOCGENITER, &obj) == -1)
break;
if ((filter != NULL) && (nat_matcharray(&nat, filter) == 0))
continue;
if (nat_fields != NULL) {
for (i = 0; nat_fields[i].w_value != 0; i++) {
printnatfield(&nat, nat_fields[i].w_value);
if (nat_fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
} else {
printactivenat(&nat, opts, nsp->ns_ticks);
if (nat.nat_aps) {
int proto;
if (nat.nat_dir & NAT_OUTBOUND)
proto = nat.nat_pr[1];
else
proto = nat.nat_pr[0];
printaps(nat.nat_aps, opts, proto);
}
}
nsp->ns_instances = nat.nat_next;
}
if (opts & OPT_VERBOSE)
showhostmap_live(fd, nsp);
i = IPFGENITER_NAT;
(void) ioctl(fd,SIOCIPFDELTOK, &i);
}
/*
* Display the active host mapping table.
*/
void
showhostmap_dead(natstat_t *nsp)
{
hostmap_t hm, *hmp, **maptable;
u_int hv;
printf("\nList of active host mappings:\n");
maptable = (hostmap_t **)malloc(sizeof(hostmap_t *) *
nsp->ns_hostmap_sz);
if (kmemcpy((char *)maptable, (u_long)nsp->ns_maptable,
sizeof(hostmap_t *) * nsp->ns_hostmap_sz)) {
perror("kmemcpy (maptable)");
return;
}
for (hv = 0; hv < nsp->ns_hostmap_sz; hv++) {
hmp = maptable[hv];
while (hmp) {
if (kmemcpy((char *)&hm, (u_long)hmp, sizeof(hm))) {
perror("kmemcpy (hostmap)");
return;
}
printhostmap(&hm, hv);
hmp = hm.hm_next;
}
}
free(maptable);
}
/*
* Display the active host mapping table.
*/
void
showhostmap_live(int fd, natstat_t *nsp)
{
ipfgeniter_t iter;
hostmap_t hm;
ipfobj_t obj;
int i;
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_GENITER;
obj.ipfo_size = sizeof(iter);
obj.ipfo_ptr = &iter;
iter.igi_type = IPFGENITER_HOSTMAP;
iter.igi_nitems = 1;
iter.igi_data = &hm;
printf("\nList of active host mappings:\n");
while (nsp->ns_maplist != NULL) {
if (ioctl(fd, SIOCGENITER, &obj) == -1)
break;
printhostmap(&hm, hm.hm_hv);
nsp->ns_maplist = hm.hm_next;
}
i = IPFGENITER_HOSTMAP;
(void) ioctl(fd,SIOCIPFDELTOK, &i);
}
int
nat_matcharray(nat_t *nat, int *array)
{
int i, n, *x, rv, p;
ipfexp_t *e;
rv = 0;
n = array[0];
x = array + 1;
for (; n > 0; x += 3 + x[3], rv = 0) {
e = (ipfexp_t *)x;
if (e->ipfe_cmd == IPF_EXP_END)
break;
n -= e->ipfe_size;
p = e->ipfe_cmd >> 16;
if ((p != 0) && (p != nat->nat_pr[1]))
break;
switch (e->ipfe_cmd)
{
case IPF_EXP_IP_PR :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (nat->nat_pr[1] == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_IP_SRCADDR :
if (nat->nat_v[0] != 4)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= ((nat->nat_osrcaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]) ||
((nat->nat_nsrcaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]);
}
break;
case IPF_EXP_IP_DSTADDR :
if (nat->nat_v[0] != 4)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= ((nat->nat_odstaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]) ||
((nat->nat_ndstaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]);
}
break;
case IPF_EXP_IP_ADDR :
if (nat->nat_v[0] != 4)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= ((nat->nat_osrcaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]) ||
((nat->nat_nsrcaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]) ||
((nat->nat_odstaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]) ||
((nat->nat_ndstaddr &
e->ipfe_arg0[i * 2 + 1]) ==
e->ipfe_arg0[i * 2]);
}
break;
#ifdef USE_INET6
case IPF_EXP_IP6_SRCADDR :
if (nat->nat_v[0] != 6)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= IP6_MASKEQ(&nat->nat_osrc6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]) ||
IP6_MASKEQ(&nat->nat_nsrc6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]);
}
break;
case IPF_EXP_IP6_DSTADDR :
if (nat->nat_v[0] != 6)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= IP6_MASKEQ(&nat->nat_odst6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]) ||
IP6_MASKEQ(&nat->nat_ndst6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]);
}
break;
case IPF_EXP_IP6_ADDR :
if (nat->nat_v[0] != 6)
break;
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= IP6_MASKEQ(&nat->nat_osrc6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]) ||
IP6_MASKEQ(&nat->nat_nsrc6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]) ||
IP6_MASKEQ(&nat->nat_odst6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]) ||
IP6_MASKEQ(&nat->nat_ndst6,
&e->ipfe_arg0[i * 8 + 4],
&e->ipfe_arg0[i * 8]);
}
break;
#endif
case IPF_EXP_UDP_PORT :
case IPF_EXP_TCP_PORT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (nat->nat_osport == e->ipfe_arg0[i]) ||
(nat->nat_nsport == e->ipfe_arg0[i]) ||
(nat->nat_odport == e->ipfe_arg0[i]) ||
(nat->nat_ndport == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_UDP_SPORT :
case IPF_EXP_TCP_SPORT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (nat->nat_osport == e->ipfe_arg0[i]) ||
(nat->nat_nsport == e->ipfe_arg0[i]);
}
break;
case IPF_EXP_UDP_DPORT :
case IPF_EXP_TCP_DPORT :
for (i = 0; !rv && i < e->ipfe_narg; i++) {
rv |= (nat->nat_odport == e->ipfe_arg0[i]) ||
(nat->nat_ndport == e->ipfe_arg0[i]);
}
break;
}
rv ^= e->ipfe_not;
if (rv == 0)
break;
}
return (rv);
}
diff --git a/sbin/ipf/ipnat/ipnat_y.y b/sbin/ipf/ipnat/ipnat_y.y
index 175026b4083e..11f62c98aa8c 100644
--- a/sbin/ipf/ipnat/ipnat_y.y
+++ b/sbin/ipf/ipnat/ipnat_y.y
@@ -1,1746 +1,1745 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
%{
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <errno.h>
#if !defined(__SVR4) && !defined(__GNUC__)
#include <strings.h>
#endif
#include <sys/types.h>
#include <sys/param.h>
#include <sys/file.h>
#include <stdlib.h>
#include <stddef.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <sys/time.h>
#include <syslog.h>
#include <net/if.h>
#include <netdb.h>
#include <arpa/nameser.h>
#include <resolv.h>
#include "ipf.h"
#include "netinet/ipl.h"
#include "ipnat_l.h"
#define YYDEBUG 1
extern void yyerror(char *);
extern int yyparse(void);
extern int yylex(void);
extern int yydebug;
extern FILE *yyin;
extern int yylineNum;
static ipnat_t *nattop = NULL;
static ipnat_t *nat = NULL;
static int natfd = -1;
static ioctlfunc_t natioctlfunc = NULL;
static addfunc_t nataddfunc = NULL;
static int suggest_port = 0;
static proxyrule_t *prules = NULL;
static int parser_error = 0;
static void newnatrule(void);
static void setnatproto(int);
static void setmapifnames(void);
static void setrdrifnames(void);
static void proxy_setconfig(int);
static void proxy_unsetconfig(void);
static namelist_t *proxy_dns_add_pass(char *, char *);
static namelist_t *proxy_dns_add_block(char *, char *);
static void proxy_addconfig(char *, int, char *, namelist_t *);
static void proxy_loadconfig(int, ioctlfunc_t, char *, int,
char *, namelist_t *);
static void proxy_loadrules(int, ioctlfunc_t, proxyrule_t *);
static void setmapifnames(void);
static void setrdrifnames(void);
static void setifname(ipnat_t **, int, char *);
static int addname(ipnat_t **, char *);
%}
%union {
char *str;
u_32_t num;
struct {
i6addr_t a;
int f;
} ipa;
frentry_t fr;
frtuc_t *frt;
u_short port;
struct {
int p1;
int p2;
int pc;
} pc;
struct {
i6addr_t a;
i6addr_t m;
int t; /* Address type */
int u;
int f; /* Family */
int v; /* IP version */
int s; /* 0 = number, 1 = text */
int n; /* number */
} ipp;
union i6addr ip6;
namelist_t *names;
};
%token <num> YY_NUMBER YY_HEX
%token <str> YY_STR
%token YY_COMMENT
%token YY_CMP_EQ YY_CMP_NE YY_CMP_LE YY_CMP_GE YY_CMP_LT YY_CMP_GT
%token YY_RANGE_OUT YY_RANGE_IN
%token <ip6> YY_IPV6
%token IPNY_MAPBLOCK IPNY_RDR IPNY_PORT IPNY_PORTS IPNY_AUTO IPNY_RANGE
%token IPNY_MAP IPNY_BIMAP IPNY_FROM IPNY_TO IPNY_MASK IPNY_PORTMAP IPNY_ANY
%token IPNY_ROUNDROBIN IPNY_FRAG IPNY_AGE IPNY_ICMPIDMAP IPNY_PROXY
%token IPNY_TCP IPNY_UDP IPNY_TCPUDP IPNY_STICKY IPNY_MSSCLAMP IPNY_TAG
%token IPNY_TLATE IPNY_POOL IPNY_HASH IPNY_NO IPNY_REWRITE IPNY_PROTO
%token IPNY_ON IPNY_SRC IPNY_DST IPNY_IN IPNY_OUT IPNY_DIVERT
%token IPNY_CONFIG IPNY_ALLOW IPNY_DENY IPNY_DNS IPNY_INET IPNY_INET6
%token IPNY_SEQUENTIAL IPNY_DSTLIST IPNY_PURGE
%type <port> portspec
%type <num> hexnumber compare range proto
%type <num> saddr daddr sobject dobject mapfrom rdrfrom dip
%type <ipa> hostname ipv4 ipaddr
%type <ipp> addr rhsaddr rhdaddr erhdaddr
%type <pc> portstuff portpair comaports srcports dstports
%type <names> dnslines dnsline
%%
file: line
| assign
| file line
| file assign
| file pconf ';'
;
line: xx rule { int err;
while ((nat = nattop) != NULL) {
if (nat->in_v[0] == 0)
nat->in_v[0] = 4;
if (nat->in_v[1] == 0)
nat->in_v[1] = nat->in_v[0];
nattop = nat->in_next;
err = (*nataddfunc)(natfd, natioctlfunc, nat);
free(nat);
if (err != 0) {
parser_error = err;
break;
}
}
if (parser_error == 0 && prules != NULL) {
proxy_loadrules(natfd, natioctlfunc, prules);
prules = NULL;
}
resetlexer();
}
| YY_COMMENT
;
assign: YY_STR assigning YY_STR ';' { set_variable($1, $3);
resetlexer();
free($1);
free($3);
yyvarnext = 0;
}
;
assigning:
'=' { yyvarnext = 1; }
;
xx: { newnatrule(); }
;
rule: map eol
| mapblock eol
| redir eol
| rewrite ';'
| divert ';'
;
no: IPNY_NO { nat->in_flags |= IPN_NO; }
;
eol: | ';'
;
map: mapit ifnames addr tlate rhsaddr proxy mapoptions
{ if ($3.f != 0 && $3.f != $5.f && $5.f != 0)
yyerror("3.address family mismatch");
if (nat->in_v[0] == 0 && $5.v != 0)
nat->in_v[0] = $5.v;
else if (nat->in_v[0] == 0 && $3.v != 0)
nat->in_v[0] = $3.v;
if (nat->in_v[1] == 0 && $5.v != 0)
nat->in_v[1] = $5.v;
else if (nat->in_v[1] == 0 && $3.v != 0)
nat->in_v[1] = $3.v;
nat->in_osrcatype = $3.t;
bcopy(&$3.a, &nat->in_osrc.na_addr[0],
sizeof($3.a));
bcopy(&$3.m, &nat->in_osrc.na_addr[1],
sizeof($3.a));
nat->in_nsrcatype = $5.t;
nat->in_nsrcafunc = $5.u;
bcopy(&$5.a, &nat->in_nsrc.na_addr[0],
sizeof($5.a));
bcopy(&$5.m, &nat->in_nsrc.na_addr[1],
sizeof($5.a));
setmapifnames();
}
| mapit ifnames addr tlate rhsaddr mapport mapoptions
{ if ($3.f != $5.f && $3.f != 0 && $5.f != 0)
yyerror("4.address family mismatch");
if (nat->in_v[1] == 0 && $5.v != 0)
nat->in_v[1] = $5.v;
else if (nat->in_v[0] == 0 && $3.v != 0)
nat->in_v[0] = $3.v;
if (nat->in_v[0] == 0 && $5.v != 0)
nat->in_v[0] = $5.v;
else if (nat->in_v[1] == 0 && $3.v != 0)
nat->in_v[1] = $3.v;
nat->in_osrcatype = $3.t;
bcopy(&$3.a, &nat->in_osrc.na_addr[0],
sizeof($3.a));
bcopy(&$3.m, &nat->in_osrc.na_addr[1],
sizeof($3.a));
nat->in_nsrcatype = $5.t;
nat->in_nsrcafunc = $5.u;
bcopy(&$5.a, &nat->in_nsrc.na_addr[0],
sizeof($5.a));
bcopy(&$5.m, &nat->in_nsrc.na_addr[1],
sizeof($5.a));
setmapifnames();
}
| no mapit ifnames addr setproto ';'
{ if (nat->in_v[0] == 0)
nat->in_v[0] = $4.v;
nat->in_osrcatype = $4.t;
bcopy(&$4.a, &nat->in_osrc.na_addr[0],
sizeof($4.a));
bcopy(&$4.m, &nat->in_osrc.na_addr[1],
sizeof($4.a));
setmapifnames();
}
| mapit ifnames mapfrom tlate rhsaddr proxy mapoptions
{ if ($3 != 0 && $5.f != 0 && $3 != $5.f)
yyerror("5.address family mismatch");
if (nat->in_v[0] == 0 && $5.v != 0)
nat->in_v[0] = $5.v;
else if (nat->in_v[0] == 0 && $3 != 0)
nat->in_v[0] = ftov($3);
if (nat->in_v[1] == 0 && $5.v != 0)
nat->in_v[1] = $5.v;
else if (nat->in_v[1] == 0 && $3 != 0)
nat->in_v[1] = ftov($3);
nat->in_nsrcatype = $5.t;
nat->in_nsrcafunc = $5.u;
bcopy(&$5.a, &nat->in_nsrc.na_addr[0],
sizeof($5.a));
bcopy(&$5.m, &nat->in_nsrc.na_addr[1],
sizeof($5.a));
setmapifnames();
}
| no mapit ifnames mapfrom setproto ';'
{ nat->in_v[0] = ftov($4);
setmapifnames();
}
| mapit ifnames mapfrom tlate rhsaddr mapport mapoptions
{ if ($3 != 0 && $5.f != 0 && $3 != $5.f)
yyerror("6.address family mismatch");
if (nat->in_v[0] == 0 && $5.v != 0)
nat->in_v[0] = $5.v;
else if (nat->in_v[0] == 0 && $3 != 0)
nat->in_v[0] = ftov($3);
if (nat->in_v[1] == 0 && $5.v != 0)
nat->in_v[1] = $5.v;
else if (nat->in_v[1] == 0 && $3 != 0)
nat->in_v[1] = ftov($3);
nat->in_nsrcatype = $5.t;
nat->in_nsrcafunc = $5.u;
bcopy(&$5.a, &nat->in_nsrc.na_addr[0],
sizeof($5.a));
bcopy(&$5.m, &nat->in_nsrc.na_addr[1],
sizeof($5.a));
setmapifnames();
}
;
mapblock:
mapblockit ifnames addr tlate addr ports mapoptions
{ if ($3.f != 0 && $5.f != 0 && $3.f != $5.f)
yyerror("7.address family mismatch");
if (nat->in_v[0] == 0 && $5.v != 0)
nat->in_v[0] = $5.v;
else if (nat->in_v[0] == 0 && $3.v != 0)
nat->in_v[0] = $3.v;
if (nat->in_v[1] == 0 && $5.v != 0)
nat->in_v[1] = $5.v;
else if (nat->in_v[1] == 0 && $3.v != 0)
nat->in_v[1] = $3.v;
nat->in_osrcatype = $3.t;
bcopy(&$3.a, &nat->in_osrc.na_addr[0],
sizeof($3.a));
bcopy(&$3.m, &nat->in_osrc.na_addr[1],
sizeof($3.a));
nat->in_nsrcatype = $5.t;
nat->in_nsrcafunc = $5.u;
bcopy(&$5.a, &nat->in_nsrc.na_addr[0],
sizeof($5.a));
bcopy(&$5.m, &nat->in_nsrc.na_addr[1],
sizeof($5.a));
setmapifnames();
}
| no mapblockit ifnames { yyexpectaddr = 1; } addr setproto ';'
{ if (nat->in_v[0] == 0)
nat->in_v[0] = $5.v;
if (nat->in_v[1] == 0)
nat->in_v[1] = $5.v;
nat->in_osrcatype = $5.t;
bcopy(&$5.a, &nat->in_osrc.na_addr[0],
sizeof($5.a));
bcopy(&$5.m, &nat->in_osrc.na_addr[1],
sizeof($5.a));
setmapifnames();
}
;
redir: rdrit ifnames addr dport tlate dip nport setproto rdroptions
{ if ($6 != 0 && $3.f != 0 && $6 != $3.f)
yyerror("21.address family mismatch");
if (nat->in_v[0] == 0) {
if ($3.v != AF_UNSPEC)
nat->in_v[0] = ftov($3.f);
else
nat->in_v[0] = ftov($6);
}
nat->in_odstatype = $3.t;
bcopy(&$3.a, &nat->in_odst.na_addr[0],
sizeof($3.a));
bcopy(&$3.m, &nat->in_odst.na_addr[1],
sizeof($3.a));
setrdrifnames();
}
| no rdrit ifnames addr dport setproto ';'
{ if (nat->in_v[0] == 0)
nat->in_v[0] = ftov($4.f);
nat->in_odstatype = $4.t;
bcopy(&$4.a, &nat->in_odst.na_addr[0],
sizeof($4.a));
bcopy(&$4.m, &nat->in_odst.na_addr[1],
sizeof($4.a));
setrdrifnames();
}
| rdrit ifnames rdrfrom tlate dip nport setproto rdroptions
{ if ($5 != 0 && $3 != 0 && $5 != $3)
yyerror("20.address family mismatch");
if (nat->in_v[0] == 0) {
if ($3 != AF_UNSPEC)
nat->in_v[0] = ftov($3);
else
nat->in_v[0] = ftov($5);
}
setrdrifnames();
}
| no rdrit ifnames rdrfrom setproto ';'
{ nat->in_v[0] = ftov($4);
setrdrifnames();
}
;
rewrite:
IPNY_REWRITE oninout rwrproto mapfrom tlate newdst newopts
{ if (nat->in_v[0] == 0)
nat->in_v[0] = ftov($4);
if (nat->in_redir & NAT_MAP)
setmapifnames();
else
setrdrifnames();
nat->in_redir |= NAT_REWRITE;
}
;
divert: IPNY_DIVERT oninout rwrproto mapfrom tlate divdst newopts
{ if (nat->in_v[0] == 0)
nat->in_v[0] = ftov($4);
if (nat->in_redir & NAT_MAP) {
setmapifnames();
nat->in_pr[0] = IPPROTO_UDP;
} else {
setrdrifnames();
nat->in_pr[1] = IPPROTO_UDP;
}
nat->in_flags &= ~IPN_TCP;
}
;
tlate: IPNY_TLATE { yyexpectaddr = 1; }
;
pconf: IPNY_PROXY { yysetdict(proxies); }
IPNY_DNS '/' proto IPNY_CONFIG YY_STR '{'
{ proxy_setconfig(IPNY_DNS); }
dnslines ';' '}'
{ proxy_addconfig("dns", $5, $7, $10);
proxy_unsetconfig();
}
;
dnslines:
dnsline { $$ = $1; }
| dnslines ';' dnsline { $$ = $1; $1->na_next = $3; }
;
dnsline:
IPNY_ALLOW YY_STR { $$ = proxy_dns_add_pass(NULL, $2); }
| IPNY_DENY YY_STR { $$ = proxy_dns_add_block(NULL, $2); }
| IPNY_ALLOW '.' YY_STR { $$ = proxy_dns_add_pass(".", $3); }
| IPNY_DENY '.' YY_STR { $$ = proxy_dns_add_block(".", $3); }
;
oninout:
inout IPNY_ON ifnames { ; }
;
inout: IPNY_IN { nat->in_redir = NAT_REDIRECT; }
| IPNY_OUT { nat->in_redir = NAT_MAP; }
;
rwrproto:
| IPNY_PROTO setproto
;
newdst: src rhsaddr srcports dst erhdaddr dstports
{ nat->in_nsrc.na_addr[0] = $2.a;
nat->in_nsrc.na_addr[1] = $2.m;
nat->in_nsrc.na_atype = $2.t;
if ($2.t == FRI_LOOKUP) {
nat->in_nsrc.na_type = $2.u;
nat->in_nsrc.na_subtype = $2.s;
nat->in_nsrc.na_num = $2.n;
}
nat->in_nsports[0] = $3.p1;
nat->in_nsports[1] = $3.p2;
nat->in_ndst.na_addr[0] = $5.a;
nat->in_ndst.na_addr[1] = $5.m;
nat->in_ndst.na_atype = $5.t;
if ($5.t == FRI_LOOKUP) {
nat->in_ndst.na_type = $5.u;
nat->in_ndst.na_subtype = $5.s;
nat->in_ndst.na_num = $5.n;
}
nat->in_ndports[0] = $6.p1;
nat->in_ndports[1] = $6.p2;
}
;
divdst: src addr ',' portspec dst addr ',' portspec IPNY_UDP
{ nat->in_nsrc.na_addr[0] = $2.a;
if ($2.m.in4.s_addr != 0xffffffff)
yyerror("divert must have /32 dest");
nat->in_nsrc.na_addr[1] = $2.m;
nat->in_nsports[0] = $4;
nat->in_nsports[1] = $4;
nat->in_ndst.na_addr[0] = $6.a;
nat->in_ndst.na_addr[1] = $6.m;
if ($6.m.in4.s_addr != 0xffffffff)
yyerror("divert must have /32 dest");
nat->in_ndports[0] = $8;
nat->in_ndports[1] = $8;
nat->in_redir |= NAT_DIVERTUDP;
}
;
src: IPNY_SRC { yyexpectaddr = 1; }
;
dst: IPNY_DST { yyexpectaddr = 1; }
;
srcports:
comaports { $$.p1 = $1.p1;
$$.p2 = $1.p2;
}
| IPNY_PORT '=' portspec
{ $$.p1 = $3;
$$.p2 = $3;
nat->in_flags |= IPN_FIXEDSPORT;
}
;
dstports:
comaports { $$.p1 = $1.p1;
$$.p2 = $1.p2;
}
| IPNY_PORT '=' portspec
{ $$.p1 = $3;
$$.p2 = $3;
nat->in_flags |= IPN_FIXEDDPORT;
}
;
comaports:
{ $$.p1 = 0;
$$.p2 = 0;
}
| ',' { if (!(nat->in_flags & IPN_TCPUDP))
yyerror("must be TCP/UDP for ports");
}
portpair { $$.p1 = $3.p1;
$$.p2 = $3.p2;
}
;
proxy: | IPNY_PROXY port portspec YY_STR '/' proto
{ int pos;
pos = addname(&nat, $4);
nat->in_plabel = pos;
if (nat->in_dcmp == 0) {
nat->in_odport = $3;
} else if ($3 != nat->in_odport) {
yyerror("proxy port numbers not consistant");
}
nat->in_ndport = $3;
setnatproto($6);
free($4);
}
| IPNY_PROXY port YY_STR YY_STR '/' proto
{ int pnum, pos;
pos = addname(&nat, $4);
nat->in_plabel = pos;
pnum = getportproto($3, $6);
if (pnum == -1)
yyerror("invalid port number");
nat->in_odport = ntohs(pnum);
nat->in_ndport = ntohs(pnum);
setnatproto($6);
free($3);
free($4);
}
| IPNY_PROXY port portspec YY_STR '/' proto IPNY_CONFIG YY_STR
{ int pos;
pos = addname(&nat, $4);
nat->in_plabel = pos;
if (nat->in_dcmp == 0) {
nat->in_odport = $3;
} else if ($3 != nat->in_odport) {
yyerror("proxy port numbers not consistant");
}
nat->in_ndport = $3;
setnatproto($6);
nat->in_pconfig = addname(&nat, $8);
free($4);
free($8);
}
| IPNY_PROXY port YY_STR YY_STR '/' proto IPNY_CONFIG YY_STR
{ int pnum, pos;
pos = addname(&nat, $4);
nat->in_plabel = pos;
pnum = getportproto($3, $6);
if (pnum == -1)
yyerror("invalid port number");
nat->in_odport = ntohs(pnum);
nat->in_ndport = ntohs(pnum);
setnatproto($6);
pos = addname(&nat, $8);
nat->in_pconfig = pos;
free($3);
free($4);
free($8);
}
;
setproto:
| proto { if (nat->in_pr[0] != 0 ||
nat->in_pr[1] != 0 ||
nat->in_flags & IPN_TCPUDP)
yyerror("protocol set twice");
setnatproto($1);
}
| IPNY_TCPUDP { if (nat->in_pr[0] != 0 ||
nat->in_pr[1] != 0 ||
nat->in_flags & IPN_TCPUDP)
yyerror("protocol set twice");
nat->in_flags |= IPN_TCPUDP;
nat->in_pr[0] = 0;
nat->in_pr[1] = 0;
}
| IPNY_TCP '/' IPNY_UDP { if (nat->in_pr[0] != 0 ||
nat->in_pr[1] != 0 ||
nat->in_flags & IPN_TCPUDP)
yyerror("protocol set twice");
nat->in_flags |= IPN_TCPUDP;
nat->in_pr[0] = 0;
nat->in_pr[1] = 0;
}
;
rhsaddr:
addr { $$ = $1;
yyexpectaddr = 0;
}
| hostname '-' { yyexpectaddr = 1; } hostname
{ $$.t = FRI_RANGE;
if ($1.f != $4.f)
yyerror("8.address family "
"mismatch");
$$.f = $1.f;
$$.v = ftov($1.f);
$$.a = $1.a;
$$.m = $4.a;
nat->in_flags |= IPN_SIPRANGE;
yyexpectaddr = 0;
}
| IPNY_RANGE hostname '-' { yyexpectaddr = 1; } hostname
{ $$.t = FRI_RANGE;
if ($2.f != $5.f)
yyerror("9.address family "
"mismatch");
$$.f = $2.f;
$$.v = ftov($2.f);
$$.a = $2.a;
$$.m = $5.a;
nat->in_flags |= IPN_SIPRANGE;
yyexpectaddr = 0;
}
;
dip:
hostname ',' { yyexpectaddr = 1; } hostname
{ nat->in_flags |= IPN_SPLIT;
if ($1.f != $4.f)
yyerror("10.address family "
"mismatch");
$$ = $1.f;
nat->in_ndstip6 = $1.a;
nat->in_ndstmsk6 = $4.a;
nat->in_ndstatype = FRI_SPLIT;
yyexpectaddr = 0;
}
| rhdaddr { int bits;
nat->in_ndstip6 = $1.a;
nat->in_ndstmsk6 = $1.m;
nat->in_ndst.na_atype = $1.t;
yyexpectaddr = 0;
if ($1.f == AF_INET)
bits = count4bits($1.m.in4.s_addr);
else
bits = count6bits($1.m.i6);
if (($1.f == AF_INET) && (bits != 0) &&
(bits != 32)) {
yyerror("dest ip bitmask not /32");
} else if (($1.f == AF_INET6) &&
(bits != 0) && (bits != 128)) {
yyerror("dest ip bitmask not /128");
}
$$ = $1.f;
}
;
rhdaddr:
addr { $$ = $1;
yyexpectaddr = 0;
}
| hostname '-' hostname { bzero(&$$, sizeof($$));
$$.t = FRI_RANGE;
if ($1.f != 0 && $3.f != 0 &&
$1.f != $3.f)
yyerror("11.address family "
"mismatch");
$$.a = $1.a;
$$.m = $3.a;
nat->in_flags |= IPN_DIPRANGE;
yyexpectaddr = 0;
}
| IPNY_RANGE hostname '-' hostname
{ bzero(&$$, sizeof($$));
$$.t = FRI_RANGE;
if ($2.f != 0 && $4.f != 0 &&
$2.f != $4.f)
yyerror("12.address family "
"mismatch");
$$.a = $2.a;
$$.m = $4.a;
nat->in_flags |= IPN_DIPRANGE;
yyexpectaddr = 0;
}
;
erhdaddr:
rhdaddr { $$ = $1; }
| IPNY_DSTLIST '/' YY_NUMBER { $$.t = FRI_LOOKUP;
$$.u = IPLT_DSTLIST;
$$.s = 0;
$$.n = $3;
}
| IPNY_DSTLIST '/' YY_STR { $$.t = FRI_LOOKUP;
$$.u = IPLT_DSTLIST;
$$.s = 1;
$$.n = addname(&nat, $3);
}
;
port: IPNY_PORT { suggest_port = 1; }
;
portspec:
YY_NUMBER { if ($1 > 65535) /* Unsigned */
yyerror("invalid port number");
else
$$ = $1;
}
| YY_STR { if (getport(NULL, $1,
&($$), NULL) == -1)
yyerror("invalid port number");
$$ = ntohs($$);
}
;
portpair:
portspec { $$.p1 = $1; $$.p2 = $1; }
| portspec '-' portspec { $$.p1 = $1; $$.p2 = $3; }
| portspec ':' portspec { $$.p1 = $1; $$.p2 = $3; }
;
dport: | port portpair { nat->in_odport = $2.p1;
if ($2.p2 == 0)
nat->in_dtop = $2.p1;
else
nat->in_dtop = $2.p2;
}
;
nport: | port portpair { nat->in_dpmin = $2.p1;
nat->in_dpnext = $2.p1;
nat->in_dpmax = $2.p2;
nat->in_ndport = $2.p1;
if (nat->in_dtop == 0)
nat->in_dtop = $2.p2;
}
| port '=' portspec { nat->in_dpmin = $3;
nat->in_dpnext = $3;
nat->in_ndport = $3;
if (nat->in_dtop == 0)
nat->in_dtop = nat->in_odport;
nat->in_flags |= IPN_FIXEDDPORT;
}
;
ports: | IPNY_PORTS YY_NUMBER { nat->in_spmin = $2; }
| IPNY_PORTS IPNY_AUTO { nat->in_flags |= IPN_AUTOPORTMAP; }
;
mapit: IPNY_MAP { nat->in_redir = NAT_MAP; }
| IPNY_BIMAP { nat->in_redir = NAT_BIMAP; }
;
rdrit: IPNY_RDR { nat->in_redir = NAT_REDIRECT; }
;
mapblockit:
IPNY_MAPBLOCK { nat->in_redir = NAT_MAPBLK; }
;
mapfrom:
from sobject to dobject { if ($2 != 0 && $4 != 0 && $2 != $4)
yyerror("13.address family "
"mismatch");
$$ = $2;
}
| from sobject '!' to dobject
{ if ($2 != 0 && $5 != 0 && $2 != $5)
yyerror("14.address family "
"mismatch");
nat->in_flags |= IPN_NOTDST;
$$ = $2;
}
| from sobject to '!' dobject
{ if ($2 != 0 && $5 != 0 && $2 != $5)
yyerror("15.address family "
"mismatch");
nat->in_flags |= IPN_NOTDST;
$$ = $2;
}
;
rdrfrom:
from sobject to dobject { if ($2 != 0 && $4 != 0 && $2 != $4)
yyerror("16.address family "
"mismatch");
$$ = $2;
}
| '!' from sobject to dobject
{ if ($3 != 0 && $5 != 0 && $3 != $5)
yyerror("17.address family "
"mismatch");
nat->in_flags |= IPN_NOTSRC;
$$ = $3;
}
| from '!' sobject to dobject
{ if ($3 != 0 && $5 != 0 && $3 != $5)
yyerror("18.address family "
"mismatch");
nat->in_flags |= IPN_NOTSRC;
$$ = $3;
}
;
from: IPNY_FROM { nat->in_flags |= IPN_FILTER;
yyexpectaddr = 1;
}
;
to: IPNY_TO { yyexpectaddr = 1; }
;
ifnames:
ifname family { yyexpectaddr = 1; }
| ifname ',' otherifname family { yyexpectaddr = 1; }
;
ifname: YY_STR { setifname(&nat, 0, $1);
free($1);
}
;
family: | IPNY_INET { nat->in_v[0] = 4; nat->in_v[1] = 4; }
| IPNY_INET6 { nat->in_v[0] = 6; nat->in_v[1] = 6; }
;
otherifname:
YY_STR { setifname(&nat, 1, $1);
free($1);
}
;
mapport:
IPNY_PORTMAP tcpudp portpair sequential
{ nat->in_spmin = $3.p1;
nat->in_spmax = $3.p2;
}
| IPNY_PORTMAP portpair tcpudp sequential
{ nat->in_spmin = $2.p1;
nat->in_spmax = $2.p2;
}
| IPNY_PORTMAP tcpudp IPNY_AUTO sequential
{ nat->in_flags |= IPN_AUTOPORTMAP;
nat->in_spmin = 1024;
nat->in_spmax = 65535;
}
| IPNY_ICMPIDMAP YY_STR portpair sequential
{ if (strcmp($2, "icmp") != 0 &&
strcmp($2, "ipv6-icmp") != 0) {
yyerror("icmpidmap not followed by icmp");
}
free($2);
if ($3.p1 < 0 || $3.p1 > 65535)
yyerror("invalid 1st ICMP Id number");
if ($3.p2 < 0 || $3.p2 > 65535)
yyerror("invalid 2nd ICMP Id number");
if (strcmp($2, "ipv6-icmp") == 0) {
nat->in_pr[0] = IPPROTO_ICMPV6;
nat->in_pr[1] = IPPROTO_ICMPV6;
} else {
nat->in_pr[0] = IPPROTO_ICMP;
nat->in_pr[1] = IPPROTO_ICMP;
}
nat->in_flags = IPN_ICMPQUERY;
nat->in_spmin = $3.p1;
nat->in_spmax = $3.p2;
}
;
sobject:
saddr { $$ = $1; }
| saddr port portstuff { nat->in_osport = $3.p1;
nat->in_stop = $3.p2;
nat->in_scmp = $3.pc;
$$ = $1;
}
;
saddr: addr { nat->in_osrcatype = $1.t;
bcopy(&$1.a,
&nat->in_osrc.na_addr[0],
sizeof($1.a));
bcopy(&$1.m,
&nat->in_osrc.na_addr[1],
sizeof($1.m));
$$ = $1.f;
}
;
dobject:
daddr { $$ = $1; }
| daddr port portstuff { nat->in_odport = $3.p1;
nat->in_dtop = $3.p2;
nat->in_dcmp = $3.pc;
$$ = $1;
}
;
daddr: addr { nat->in_odstatype = $1.t;
bcopy(&$1.a,
&nat->in_odst.na_addr[0],
sizeof($1.a));
bcopy(&$1.m,
&nat->in_odst.na_addr[1],
sizeof($1.m));
$$ = $1.f;
}
;
addr: IPNY_ANY { yyexpectaddr = 0;
bzero(&$$, sizeof($$));
$$.t = FRI_NORMAL;
}
| hostname { bzero(&$$, sizeof($$));
$$.a = $1.a;
$$.t = FRI_NORMAL;
$$.v = ftov($1.f);
$$.f = $1.f;
if ($$.f == AF_INET) {
$$.m.in4.s_addr = 0xffffffff;
} else if ($$.f == AF_INET6) {
$$.m.i6[0] = 0xffffffff;
$$.m.i6[1] = 0xffffffff;
$$.m.i6[2] = 0xffffffff;
$$.m.i6[3] = 0xffffffff;
}
yyexpectaddr = 0;
}
| hostname slash YY_NUMBER
{ bzero(&$$, sizeof($$));
$$.a = $1.a;
$$.f = $1.f;
$$.v = ftov($1.f);
$$.t = FRI_NORMAL;
ntomask($$.f, $3, (u_32_t *)&$$.m);
$$.a.i6[0] &= $$.m.i6[0];
$$.a.i6[1] &= $$.m.i6[1];
$$.a.i6[2] &= $$.m.i6[2];
$$.a.i6[3] &= $$.m.i6[3];
yyexpectaddr = 0;
}
| hostname slash ipaddr { bzero(&$$, sizeof($$));
if ($1.f != $3.f) {
yyerror("1.address family "
"mismatch");
}
$$.a = $1.a;
$$.m = $3.a;
$$.t = FRI_NORMAL;
$$.a.i6[0] &= $$.m.i6[0];
$$.a.i6[1] &= $$.m.i6[1];
$$.a.i6[2] &= $$.m.i6[2];
$$.a.i6[3] &= $$.m.i6[3];
$$.f = $1.f;
$$.v = ftov($1.f);
yyexpectaddr = 0;
}
| hostname slash hexnumber { bzero(&$$, sizeof($$));
$$.a = $1.a;
$$.m.in4.s_addr = htonl($3);
$$.t = FRI_NORMAL;
$$.a.in4.s_addr &= $$.m.in4.s_addr;
$$.f = $1.f;
$$.v = ftov($1.f);
if ($$.f == AF_INET6)
yyerror("incorrect inet6 mask");
}
| hostname mask ipaddr { bzero(&$$, sizeof($$));
if ($1.f != $3.f) {
yyerror("2.address family "
"mismatch");
}
$$.a = $1.a;
$$.m = $3.a;
$$.t = FRI_NORMAL;
$$.a.i6[0] &= $$.m.i6[0];
$$.a.i6[1] &= $$.m.i6[1];
$$.a.i6[2] &= $$.m.i6[2];
$$.a.i6[3] &= $$.m.i6[3];
$$.f = $1.f;
$$.v = ftov($1.f);
yyexpectaddr = 0;
}
| hostname mask hexnumber { bzero(&$$, sizeof($$));
$$.a = $1.a;
$$.m.in4.s_addr = htonl($3);
$$.t = FRI_NORMAL;
$$.a.in4.s_addr &= $$.m.in4.s_addr;
$$.f = AF_INET;
$$.v = 4;
}
| pool slash YY_NUMBER { bzero(&$$, sizeof($$));
$$.a.iplookupnum = $3;
$$.a.iplookuptype = IPLT_POOL;
$$.a.iplookupsubtype = 0;
$$.t = FRI_LOOKUP;
}
| pool slash YY_STR { bzero(&$$, sizeof($$));
$$.a.iplookupname = addname(&nat,$3);
$$.a.iplookuptype = IPLT_POOL;
$$.a.iplookupsubtype = 1;
$$.t = FRI_LOOKUP;
}
| hash slash YY_NUMBER { bzero(&$$, sizeof($$));
$$.a.iplookupnum = $3;
$$.a.iplookuptype = IPLT_HASH;
$$.a.iplookupsubtype = 0;
$$.t = FRI_LOOKUP;
}
| hash slash YY_STR { bzero(&$$, sizeof($$));
$$.a.iplookupname = addname(&nat,$3);
$$.a.iplookuptype = IPLT_HASH;
$$.a.iplookupsubtype = 1;
$$.t = FRI_LOOKUP;
}
;
slash: '/' { yyexpectaddr = 0; }
;
mask: IPNY_MASK { yyexpectaddr = 0; }
;
pool: IPNY_POOL { if (!(nat->in_flags & IPN_FILTER)) {
yyerror("Can only use pool with from/to rules\n");
}
yyexpectaddr = 0;
yyresetdict();
}
;
hash: IPNY_HASH { if (!(nat->in_flags & IPN_FILTER)) {
yyerror("Can only use hash with from/to rules\n");
}
yyexpectaddr = 0;
yyresetdict();
}
;
portstuff:
compare portspec { $$.pc = $1; $$.p1 = $2; $$.p2 = 0; }
| portspec range portspec { $$.pc = $2; $$.p1 = $1; $$.p2 = $3; }
;
mapoptions:
rr frag age mssclamp nattag setproto purge
;
rdroptions:
rr frag age sticky mssclamp rdrproxy nattag purge
;
nattag: | IPNY_TAG YY_STR { strncpy(nat->in_tag.ipt_tag, $2,
sizeof(nat->in_tag.ipt_tag));
}
rr: | IPNY_ROUNDROBIN { nat->in_flags |= IPN_ROUNDR; }
;
frag: | IPNY_FRAG { nat->in_flags |= IPN_FRAG; }
;
age: | IPNY_AGE YY_NUMBER { nat->in_age[0] = $2;
nat->in_age[1] = $2; }
| IPNY_AGE YY_NUMBER '/' YY_NUMBER { nat->in_age[0] = $2;
nat->in_age[1] = $4; }
;
sticky: | IPNY_STICKY { if (!(nat->in_flags & IPN_ROUNDR) &&
!(nat->in_flags & IPN_SPLIT)) {
FPRINTF(stderr,
"'sticky' for use with round-robin/IP splitting only\n");
} else
nat->in_flags |= IPN_STICKY;
}
;
mssclamp:
| IPNY_MSSCLAMP YY_NUMBER { nat->in_mssclamp = $2; }
;
tcpudp: IPNY_TCP { setnatproto(IPPROTO_TCP); }
| IPNY_UDP { setnatproto(IPPROTO_UDP); }
| IPNY_TCPUDP { nat->in_flags |= IPN_TCPUDP;
nat->in_pr[0] = 0;
nat->in_pr[1] = 0;
}
| IPNY_TCP '/' IPNY_UDP { nat->in_flags |= IPN_TCPUDP;
nat->in_pr[0] = 0;
nat->in_pr[1] = 0;
}
;
sequential:
| IPNY_SEQUENTIAL { nat->in_flags |= IPN_SEQUENTIAL; }
;
purge:
| IPNY_PURGE { nat->in_flags |= IPN_PURGE; }
;
rdrproxy:
IPNY_PROXY YY_STR
{ int pos;
pos = addname(&nat, $2);
nat->in_plabel = pos;
nat->in_odport = nat->in_dpnext;
nat->in_dtop = nat->in_odport;
free($2);
}
| proxy { if (nat->in_plabel != -1) {
nat->in_ndport = nat->in_odport;
nat->in_dpmin = nat->in_odport;
nat->in_dpmax = nat->in_dpmin;
nat->in_dtop = nat->in_dpmin;
nat->in_dpnext = nat->in_dpmin;
}
}
;
newopts:
| IPNY_PURGE { nat->in_flags |= IPN_PURGE; }
;
proto: YY_NUMBER { $$ = $1;
if ($$ != IPPROTO_TCP &&
$$ != IPPROTO_UDP)
suggest_port = 0;
}
| IPNY_TCP { $$ = IPPROTO_TCP; }
| IPNY_UDP { $$ = IPPROTO_UDP; }
| YY_STR { $$ = getproto($1);
free($1);
if ($$ == -1)
yyerror("unknown protocol");
if ($$ != IPPROTO_TCP &&
$$ != IPPROTO_UDP)
suggest_port = 0;
}
;
hexnumber:
YY_HEX { $$ = $1; }
;
hostname:
YY_STR { i6addr_t addr;
int family;
#ifdef USE_INET6
if (nat->in_v[0] == 6)
family = AF_INET6;
else
#endif
family = AF_INET;
memset(&($$), 0, sizeof($$));
memset(&addr, 0, sizeof(addr));
$$.f = family;
if (gethost(family, $1,
&addr) == 0) {
$$.a = addr;
} else {
FPRINTF(stderr,
"Unknown host '%s'\n",
$1);
}
free($1);
}
| YY_NUMBER { memset(&($$), 0, sizeof($$));
$$.a.in4.s_addr = htonl($1);
if ($$.a.in4.s_addr != 0)
$$.f = AF_INET;
}
| ipv4 { $$ = $1; }
| YY_IPV6 { memset(&($$), 0, sizeof($$));
$$.a = $1;
$$.f = AF_INET6;
}
| YY_NUMBER YY_IPV6 { memset(&($$), 0, sizeof($$));
$$.a = $2;
$$.f = AF_INET6;
}
;
compare:
'=' { $$ = FR_EQUAL; }
| YY_CMP_EQ { $$ = FR_EQUAL; }
| YY_CMP_NE { $$ = FR_NEQUAL; }
| YY_CMP_LT { $$ = FR_LESST; }
| YY_CMP_LE { $$ = FR_LESSTE; }
| YY_CMP_GT { $$ = FR_GREATERT; }
| YY_CMP_GE { $$ = FR_GREATERTE; }
range:
YY_RANGE_OUT { $$ = FR_OUTRANGE; }
| YY_RANGE_IN { $$ = FR_INRANGE; }
| ':' { $$ = FR_INCRANGE; }
;
ipaddr: ipv4 { $$ = $1; }
| YY_IPV6 { $$.a = $1;
$$.f = AF_INET6;
}
;
ipv4: YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER
{ if ($1 > 255 || $3 > 255 || $5 > 255 || $7 > 255) {
yyerror("Invalid octet string for IP address");
return(0);
}
bzero((char *)&$$, sizeof($$));
$$.a.in4.s_addr = ($1 << 24) | ($3 << 16) | ($5 << 8) | $7;
$$.a.in4.s_addr = htonl($$.a.in4.s_addr);
$$.f = AF_INET;
}
;
%%
static wordtab_t proxies[] = {
{ "dns", IPNY_DNS }
};
static wordtab_t dnswords[] = {
{ "allow", IPNY_ALLOW },
{ "block", IPNY_DENY },
{ "deny", IPNY_DENY },
{ "drop", IPNY_DENY },
{ "pass", IPNY_ALLOW },
};
static wordtab_t yywords[] = {
{ "age", IPNY_AGE },
{ "any", IPNY_ANY },
{ "auto", IPNY_AUTO },
{ "bimap", IPNY_BIMAP },
{ "config", IPNY_CONFIG },
{ "divert", IPNY_DIVERT },
{ "dst", IPNY_DST },
{ "dstlist", IPNY_DSTLIST },
{ "frag", IPNY_FRAG },
{ "from", IPNY_FROM },
{ "hash", IPNY_HASH },
{ "icmpidmap", IPNY_ICMPIDMAP },
{ "in", IPNY_IN },
{ "inet", IPNY_INET },
{ "inet6", IPNY_INET6 },
{ "mask", IPNY_MASK },
{ "map", IPNY_MAP },
{ "map-block", IPNY_MAPBLOCK },
{ "mssclamp", IPNY_MSSCLAMP },
{ "netmask", IPNY_MASK },
{ "no", IPNY_NO },
{ "on", IPNY_ON },
{ "out", IPNY_OUT },
{ "pool", IPNY_POOL },
{ "port", IPNY_PORT },
{ "portmap", IPNY_PORTMAP },
{ "ports", IPNY_PORTS },
{ "proto", IPNY_PROTO },
{ "proxy", IPNY_PROXY },
{ "purge", IPNY_PURGE },
{ "range", IPNY_RANGE },
{ "rewrite", IPNY_REWRITE },
{ "rdr", IPNY_RDR },
{ "round-robin",IPNY_ROUNDROBIN },
{ "sequential", IPNY_SEQUENTIAL },
{ "src", IPNY_SRC },
{ "sticky", IPNY_STICKY },
{ "tag", IPNY_TAG },
{ "tcp", IPNY_TCP },
{ "tcpudp", IPNY_TCPUDP },
{ "to", IPNY_TO },
{ "udp", IPNY_UDP },
{ "-", '-' },
{ "->", IPNY_TLATE },
{ "eq", YY_CMP_EQ },
{ "ne", YY_CMP_NE },
{ "lt", YY_CMP_LT },
{ "gt", YY_CMP_GT },
{ "le", YY_CMP_LE },
{ "ge", YY_CMP_GE },
{ NULL, 0 }
};
int
ipnat_parsefile(int fd, addfunc_t addfunc, ioctlfunc_t ioctlfunc,
char *filename)
{
FILE *fp = NULL;
int rval;
char *s;
yylineNum = 1;
(void) yysettab(yywords);
s = getenv("YYDEBUG");
if (s)
yydebug = atoi(s);
else
yydebug = 0;
if (strcmp(filename, "-")) {
fp = fopen(filename, "r");
if (!fp) {
FPRINTF(stderr, "fopen(%s) failed: %s\n", filename,
STRERROR(errno));
return(-1);
}
} else
fp = stdin;
while ((rval = ipnat_parsesome(fd, addfunc, ioctlfunc, fp)) == 0)
;
if (fp != NULL)
fclose(fp);
if (rval == -1)
rval = 0;
else if (rval != 0)
rval = 1;
return(rval);
}
int
ipnat_parsesome(int fd, addfunc_t addfunc, ioctlfunc_t ioctlfunc,
FILE *fp)
{
char *s;
int i;
natfd = fd;
parser_error = 0;
nataddfunc = addfunc;
natioctlfunc = ioctlfunc;
if (feof(fp))
return(-1);
i = fgetc(fp);
if (i == EOF)
return(-1);
if (ungetc(i, fp) == EOF)
return(-1);
if (feof(fp))
return(-1);
s = getenv("YYDEBUG");
if (s)
yydebug = atoi(s);
else
yydebug = 0;
yyin = fp;
yyparse();
return(parser_error);
}
static void
newnatrule(void)
{
ipnat_t *n;
n = calloc(1, sizeof(*n));
if (n == NULL)
return;
if (nat == NULL) {
nattop = nat = n;
n->in_pnext = &nattop;
} else {
nat->in_next = n;
n->in_pnext = &nat->in_next;
nat = n;
}
n->in_flineno = yylineNum;
n->in_ifnames[0] = -1;
n->in_ifnames[1] = -1;
n->in_plabel = -1;
n->in_pconfig = -1;
n->in_size = sizeof(*n);
suggest_port = 0;
}
static void
setnatproto(int p)
{
nat->in_pr[0] = p;
nat->in_pr[1] = p;
switch (p)
{
case IPPROTO_TCP :
nat->in_flags |= IPN_TCP;
nat->in_flags &= ~IPN_UDP;
break;
case IPPROTO_UDP :
nat->in_flags |= IPN_UDP;
nat->in_flags &= ~IPN_TCP;
break;
#ifdef USE_INET6
case IPPROTO_ICMPV6 :
#endif
case IPPROTO_ICMP :
nat->in_flags &= ~IPN_TCPUDP;
if (!(nat->in_flags & IPN_ICMPQUERY) &&
!(nat->in_redir & NAT_DIVERTUDP)) {
nat->in_dcmp = 0;
nat->in_scmp = 0;
nat->in_dpmin = 0;
nat->in_dpmax = 0;
nat->in_dpnext = 0;
nat->in_spmin = 0;
nat->in_spmax = 0;
nat->in_spnext = 0;
}
break;
default :
if ((nat->in_redir & NAT_MAPBLK) == 0) {
nat->in_flags &= ~IPN_TCPUDP;
nat->in_dcmp = 0;
nat->in_scmp = 0;
nat->in_dpmin = 0;
nat->in_dpmax = 0;
nat->in_dpnext = 0;
nat->in_spmin = 0;
nat->in_spmax = 0;
nat->in_spnext = 0;
}
break;
}
if ((nat->in_flags & (IPN_TCP|IPN_UDP)) == 0) {
nat->in_stop = 0;
nat->in_dtop = 0;
nat->in_osport = 0;
nat->in_odport = 0;
nat->in_stop = 0;
nat->in_osport = 0;
nat->in_dtop = 0;
nat->in_odport = 0;
}
if ((nat->in_flags & (IPN_TCPUDP|IPN_FIXEDDPORT)) == IPN_FIXEDDPORT)
nat->in_flags &= ~IPN_FIXEDDPORT;
}
int
ipnat_addrule(int fd, ioctlfunc_t ioctlfunc, void *ptr)
{
ioctlcmd_t add, del;
ipfobj_t obj;
ipnat_t *ipn;
ipn = ptr;
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = ipn->in_size;
obj.ipfo_type = IPFOBJ_IPNAT;
obj.ipfo_ptr = ptr;
if ((opts & OPT_DONOTHING) != 0)
fd = -1;
if (opts & OPT_ZERORULEST) {
add = SIOCZRLST;
del = 0;
} else if (opts & OPT_PURGE) {
add = 0;
del = SIOCPURGENAT;
} else {
add = SIOCADNAT;
del = SIOCRMNAT;
}
if ((opts & OPT_VERBOSE) != 0)
printnat(ipn, opts);
if (opts & OPT_DEBUG)
binprint(ipn, ipn->in_size);
if ((opts & OPT_ZERORULEST) != 0) {
if ((*ioctlfunc)(fd, add, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(zero nat rule)",
ipn->in_flineno);
return(ipf_perror_fd(fd, ioctlfunc, msg));
}
} else {
PRINTF("hits %lu ", ipn->in_hits);
#ifdef USE_QUAD_T
PRINTF("bytes %"PRIu64" ",
ipn->in_bytes[0] + ipn->in_bytes[1]);
#else
PRINTF("bytes %lu ",
ipn->in_bytes[0] + ipn->in_bytes[1]);
#endif
printnat(ipn, opts);
}
} else if ((opts & OPT_REMOVE) != 0) {
if ((*ioctlfunc)(fd, del, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(delete nat rule)",
ipn->in_flineno);
return(ipf_perror_fd(fd, ioctlfunc, msg));
}
}
} else {
if ((*ioctlfunc)(fd, add, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(add/insert nat rule)",
ipn->in_flineno);
if (errno == EEXIST) {
int strlen_msg = strlen(msg);
snprintf(msg + strlen_msg, sizeof(msg) -strlen_msg, "(line %d)",
ipn->in_flineno);
}
return(ipf_perror_fd(fd, ioctlfunc, msg));
}
}
}
return(0);
}
static void
setmapifnames()
{
if (nat->in_ifnames[1] == -1)
nat->in_ifnames[1] = nat->in_ifnames[0];
if ((suggest_port == 1) && (nat->in_flags & IPN_TCPUDP) == 0)
nat->in_flags |= IPN_TCPUDP;
if ((nat->in_flags & IPN_TCPUDP) == 0)
setnatproto(nat->in_pr[1]);
if (((nat->in_redir & NAT_MAPBLK) != 0) ||
((nat->in_flags & IPN_AUTOPORTMAP) != 0))
nat_setgroupmap(nat);
}
static void
setrdrifnames(void)
{
if ((suggest_port == 1) && (nat->in_flags & IPN_TCPUDP) == 0)
nat->in_flags |= IPN_TCPUDP;
if ((nat->in_pr[0] == 0) && ((nat->in_flags & IPN_TCPUDP) == 0) &&
(nat->in_dpmin != 0 || nat->in_dpmax != 0 || nat->in_dpnext != 0))
setnatproto(IPPROTO_TCP);
if (nat->in_ifnames[1] == -1)
nat->in_ifnames[1] = nat->in_ifnames[0];
}
static void
proxy_setconfig(int proxy)
{
if (proxy == IPNY_DNS) {
yysetfixeddict(dnswords);
}
}
static void
proxy_unsetconfig(void)
{
yyresetdict();
}
static namelist_t *
proxy_dns_add_pass(char *prefix, char *name)
{
namelist_t *n;
n = calloc(1, sizeof(*n));
if (n != NULL) {
if (prefix == NULL || *prefix == '\0') {
n->na_name = strdup(name);
} else {
n->na_name = malloc(strlen(name) + strlen(prefix) + 1);
strcpy(n->na_name, prefix);
strcat(n->na_name, name);
}
}
return(n);
}
static namelist_t *
proxy_dns_add_block(char *prefix, char *name)
{
namelist_t *n;
n = calloc(1, sizeof(*n));
if (n != NULL) {
if (prefix == NULL || *prefix == '\0') {
n->na_name = strdup(name);
} else {
n->na_name = malloc(strlen(name) + strlen(prefix) + 1);
strcpy(n->na_name, prefix);
strcat(n->na_name, name);
}
n->na_value = 1;
}
return(n);
}
static void
proxy_addconfig(char *proxy, int proto, char *conf, namelist_t *list)
{
proxyrule_t *pr;
pr = calloc(1, sizeof(*pr));
if (pr != NULL) {
pr->pr_proto = proto;
pr->pr_proxy = proxy;
pr->pr_conf = conf;
pr->pr_names = list;
pr->pr_next = prules;
prules = pr;
}
}
static void
proxy_loadrules(int fd, ioctlfunc_t ioctlfunc, proxyrule_t *rules)
{
proxyrule_t *pr;
while ((pr = rules) != NULL) {
proxy_loadconfig(fd, ioctlfunc, pr->pr_proxy, pr->pr_proto,
pr->pr_conf, pr->pr_names);
rules = pr->pr_next;
free(pr->pr_conf);
free(pr);
}
}
static void
proxy_loadconfig(int fd, ioctlfunc_t ioctlfunc, char *proxy, int proto,
char *conf, namelist_t *list)
{
namelist_t *na;
ipfobj_t obj;
ap_ctl_t pcmd;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_PROXYCTL;
obj.ipfo_size = sizeof(pcmd);
obj.ipfo_ptr = &pcmd;
while ((na = list) != NULL) {
if ((opts & OPT_REMOVE) != 0)
pcmd.apc_cmd = APC_CMD_DEL;
else
pcmd.apc_cmd = APC_CMD_ADD;
pcmd.apc_dsize = strlen(na->na_name) + 1;
pcmd.apc_data = na->na_name;
pcmd.apc_arg = na->na_value;
pcmd.apc_p = proto;
strncpy(pcmd.apc_label, proxy, APR_LABELLEN);
pcmd.apc_label[APR_LABELLEN - 1] = '\0';
strncpy(pcmd.apc_config, conf, APR_LABELLEN);
pcmd.apc_config[APR_LABELLEN - 1] = '\0';
if ((*ioctlfunc)(fd, SIOCPROXY, (void *)&obj) == -1) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%d:ioctl(add/remove proxy rule)",
yylineNum);
ipf_perror_fd(fd, ioctlfunc, msg);
return;
}
}
list = na->na_next;
free(na->na_name);
free(na);
}
}
static void
setifname(ipnat_t **np, int idx, char *name)
{
int pos;
pos = addname(np, name);
if (pos == -1)
return;
(*np)->in_ifnames[idx] = pos;
}
static int
addname(ipnat_t **np, char *name)
{
ipnat_t *n;
int nlen;
int pos;
nlen = strlen(name) + 1;
n = realloc(*np, (*np)->in_size + nlen);
if (*np == nattop)
nattop = n;
*np = n;
if (n == NULL)
return(-1);
if (n->in_pnext != NULL)
*n->in_pnext = n;
n->in_size += nlen;
pos = n->in_namelen;
n->in_namelen += nlen;
strcpy(n->in_names + pos, name);
n->in_names[n->in_namelen] = '\0';
return(pos);
}
diff --git a/sbin/ipf/ippool/ippool.c b/sbin/ipf/ippool/ippool.c
index 53e1f19c6f90..797f83af1419 100644
--- a/sbin/ipf/ippool/ippool.c
+++ b/sbin/ipf/ippool/ippool.c
@@ -1,1128 +1,1127 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include <sys/types.h>
#include <sys/time.h>
#include <sys/param.h>
#include <sys/socket.h>
# include <sys/cdefs.h>
#include <sys/ioctl.h>
#include <net/if.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <netdb.h>
#include <ctype.h>
#include <unistd.h>
# include <nlist.h>
#include "ipf.h"
#include "netinet/ipl.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_pool.h"
#include "netinet/ip_htable.h"
#include "kmem.h"
extern int ippool_yyparse(void);
extern int ippool_yydebug;
extern FILE *ippool_yyin;
extern char *optarg;
extern int lineNum;
void usage(char *);
int main(int, char **);
int poolcommand(int, int, char *[]);
int poolnodecommand(int, int, char *[]);
int loadpoolfile(int, char *[], char *);
int poollist(int, char *[]);
void poollist_dead(int, char *, int, char *, char *);
int poollist_live(int, char *, int, int);
int poolflush(int, char *[]);
int poolstats(int, char *[]);
int gettype(char *, u_int *);
int getrole(char *);
int setnodeaddr(int, int, void *ptr, char *arg);
int showpools_live(int, int, ipf_pool_stat_t *, char *);
int showhashs_live(int, int, iphtstat_t *, char *);
int showdstls_live(int, int, ipf_dstl_stat_t *, char *);
int opts = 0;
int fd = -1;
int use_inet6 = 0;
wordtab_t *pool_fields = NULL;
int nohdrfields = 0;
void
usage(char *prog)
{
fprintf(stderr, "Usage:\t%s\n", prog);
fprintf(stderr, "\t-a [-dnv] -m <name> [-o <role>] [-t type] [-T ttl] -i <ipaddr>[/netmask]\n");
fprintf(stderr, "\t-A [-dnv] [-m <name>] [-o <role>] [-S <seed>] [-t <type>]\n");
fprintf(stderr, "\t-f <file> [-dnuvR]\n");
fprintf(stderr, "\t-F [-dv] [-o <role>] [-t <type>]\n");
fprintf(stderr, "\t-l [-dv] [-m <name>] [-t <type>] [-o <role>] [-M <core>] [-N <namelist>]\n");
fprintf(stderr, "\t-r [-dnv] [-m <name>] [-o <role>] [-t type] -i <ipaddr>[/netmask]\n");
fprintf(stderr, "\t-R [-dnv] [-m <name>] [-o <role>] [-t <type>]\n");
fprintf(stderr, "\t-s [-dtv]\n");
exit(1);
}
int
main(int argc, char *argv[])
{
int err = 1;
if (argc < 2)
usage(argv[0]);
assigndefined(getenv("IPPOOL_PREDEFINED"));
switch (getopt(argc, argv, "aAf:FlrRs"))
{
case 'a' :
err = poolnodecommand(0, argc, argv);
break;
case 'A' :
err = poolcommand(0, argc, argv);
break;
case 'f' :
err = loadpoolfile(argc, argv, optarg);
break;
case 'F' :
err = poolflush(argc, argv);
break;
case 'l' :
err = poollist(argc, argv);
break;
case 'r' :
err = poolnodecommand(1, argc, argv);
break;
case 'R' :
err = poolcommand(1, argc, argv);
break;
case 's' :
err = poolstats(argc, argv);
break;
default :
exit(1);
}
if (err != 0)
exit(1);
return (0);
}
int
poolnodecommand(int remove, int argc, char *argv[])
{
int err = 0, c, ipset, role, type = IPLT_POOL, ttl = 0;
char *poolname = NULL;
ip_pool_node_t pnode;
iphtent_t hnode;
void *ptr = &pnode;
ipset = 0;
role = IPL_LOGIPF;
bzero((char *)&pnode, sizeof(pnode));
bzero((char *)&hnode, sizeof(hnode));
while ((c = getopt(argc, argv, "di:m:no:t:T:v")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
ippool_yydebug++;
break;
case 'i' :
if (setnodeaddr(type, role, ptr, optarg) == 0)
ipset = 1;
break;
case 'm' :
poolname = optarg;
break;
case 'n' :
opts |= OPT_DONOTHING|OPT_DONTOPEN;
break;
case 'o' :
if (ipset == 1) {
fprintf(stderr,
"cannot set role after ip address\n");
return (-1);
}
role = getrole(optarg);
if (role == IPL_LOGNONE)
return (-1);
break;
case 't' :
if (ipset == 1) {
fprintf(stderr,
"cannot set type after ip address\n");
return (-1);
}
type = gettype(optarg, NULL);
switch (type) {
case IPLT_NONE :
fprintf(stderr, "unknown type '%s'\n", optarg);
return (-1);
case IPLT_HASH :
ptr = &hnode;
break;
case IPLT_POOL :
default :
break;
}
break;
case 'T' :
if (remove == 0) {
ttl = atoi(optarg);
if (ttl < 0) {
fprintf(stderr, "cannot set negative ttl\n");
return (-1);
}
} else {
usage(argv[0]);
}
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break; /* keep compiler happy */
}
if (argc - 1 - optind > 0)
usage(argv[0]);
if (argv[optind] != NULL && ipset == 0) {
if (setnodeaddr(type, role, ptr, argv[optind]) == 0)
ipset = 1;
}
if (opts & OPT_DEBUG)
fprintf(stderr, "poolnodecommand: opts = %#x\n", opts);
if (ipset == 0) {
fprintf(stderr, "no IP address given with -i\n");
return (-1);
}
if (poolname == NULL) {
fprintf(stderr, "poolname not given with add/remove node\n");
return (-1);
}
switch (type) {
case IPLT_POOL :
if (remove == 0)
err = load_poolnode(role, poolname, &pnode, ttl, ioctl);
else
err = remove_poolnode(role, poolname, &pnode, ioctl);
break;
case IPLT_HASH :
if (remove == 0)
err = load_hashnode(role, poolname, &hnode, ttl, ioctl);
else
err = remove_hashnode(role, poolname, &hnode, ioctl);
break;
default :
break;
}
return (err);
}
int
poolcommand(int remove, int argc, char *argv[])
{
int type, role, c, err;
char *poolname, *typearg = NULL;
iphtable_t iph;
ip_pool_t pool;
err = 1;
role = 0;
type = 0;
poolname = NULL;
role = IPL_LOGIPF;
bzero((char *)&iph, sizeof(iph));
bzero((char *)&pool, sizeof(pool));
while ((c = getopt(argc, argv, "dm:no:S:vt:")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
ippool_yydebug++;
break;
case 'm' :
poolname = optarg;
break;
case 'n' :
opts |= OPT_DONOTHING|OPT_DONTOPEN;
break;
case 'o' :
role = getrole(optarg);
if (role == IPL_LOGNONE) {
fprintf(stderr, "unknown role '%s'\n", optarg);
return (-1);
}
break;
case 'S' :
if (remove == 0)
iph.iph_seed = atoi(optarg);
else
usage(argv[0]);
break;
case 't' :
type = gettype(optarg, &iph.iph_type);
typearg = optarg;
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break; /* keep compiler happy */
}
if (argc - 1 - optind > 0)
usage(argv[0]);
if (opts & OPT_DEBUG)
fprintf(stderr, "poolcommand: opts = %#x\n", opts);
if (poolname == NULL) {
fprintf(stderr, "poolname not given with add/remove pool\n");
return (-1);
}
if (type == IPLT_NONE && remove == 0) {
if (typearg == NULL) {
fprintf(stderr, "type must be specified\n");
usage(argv[0]);
} else {
fprintf(stderr, "unknown type '%s'\n", typearg);
}
return (-1);
}
if (type == IPLT_HASH || (type == IPLT_NONE && remove == 1)) {
strncpy(iph.iph_name, poolname, sizeof(iph.iph_name));
iph.iph_name[sizeof(iph.iph_name) - 1] = '\0';
iph.iph_unit = role;
}
if (type == IPLT_POOL || (type == IPLT_NONE && remove == 1)) {
strncpy(pool.ipo_name, poolname, sizeof(pool.ipo_name));
pool.ipo_name[sizeof(pool.ipo_name) - 1] = '\0';
pool.ipo_unit = role;
}
if (remove == 0) {
switch (type)
{
case IPLT_HASH :
err = load_hash(&iph, NULL, ioctl);
break;
case IPLT_POOL :
err = load_pool(&pool, ioctl);
break;
}
} else {
switch (type)
{
case IPLT_HASH :
err = remove_hash(&iph, ioctl);
break;
case IPLT_POOL :
err = remove_pool(&pool, ioctl);
break;
case IPLT_NONE :
err = 1;
{
int err_h, err_p;
err_h = remove_hash(&iph, ioctl);
err_p = remove_pool(&pool, ioctl);
if (err_h == 0 || err_p == 0)
err = 0;
}
break;
}
}
return (err);
}
int
loadpoolfile(int argc, char *argv[], char *infile)
{
int c;
while ((c = getopt(argc, argv, "dnuvf:")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
ippool_yydebug++;
break;
case 'f' :
if (loadpoolfile(argc, argv, optarg) != 0)
return (-1);
break;
case 'n' :
opts |= OPT_DONOTHING|OPT_DONTOPEN;
break;
case 'u' :
opts |= OPT_REMOVE;
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break; /* keep compiler happy */
}
if (argc - 1 - optind > 0)
usage(argv[0]);
if (opts & OPT_DEBUG)
fprintf(stderr, "loadpoolfile: opts = %#x\n", opts);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN)) && (fd == -1)) {
fd = open(IPLOOKUP_NAME, O_RDWR);
if (fd == -1) {
perror("open(IPLOOKUP_NAME)");
exit(1);
}
}
if (ippool_parsefile(fd, infile, ioctl) != 0)
return (-1);
return (0);
}
int
poolstats(int argc, char *argv[])
{
int c, type, role;
ipf_pool_stat_t plstat;
ipf_dstl_stat_t dlstat;
iphtstat_t htstat;
iplookupop_t op;
type = IPLT_ALL;
role = IPL_LOGALL;
bzero((char *)&op, sizeof(op));
while ((c = getopt(argc, argv, "dM:N:o:t:v")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
break;
case 'o' :
role = getrole(optarg);
if (role == IPL_LOGNONE) {
fprintf(stderr, "unknown role '%s'\n", optarg);
return (-1);
}
break;
case 't' :
type = gettype(optarg, NULL);
if (type != IPLT_POOL) {
fprintf(stderr,
"-s not supported for this type yet\n");
return (-1);
}
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break; /* keep compiler happy */
}
if (argc - 1 - optind > 0)
usage(argv[0]);
if (opts & OPT_DEBUG)
fprintf(stderr, "poolstats: opts = %#x\n", opts);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN)) && (fd == -1)) {
fd = open(IPLOOKUP_NAME, O_RDWR);
if (fd == -1) {
perror("open(IPLOOKUP_NAME)");
exit(1);
}
}
if (type == IPLT_ALL || type == IPLT_POOL) {
op.iplo_type = IPLT_POOL;
op.iplo_struct = &plstat;
op.iplo_size = sizeof(plstat);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN))) {
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(S0IOCLOOKUPSTAT)");
return (-1);
}
printf("%lu\taddress pools\n", plstat.ipls_pools);
printf("%lu\taddress pool nodes\n", plstat.ipls_nodes);
}
}
if (type == IPLT_ALL || type == IPLT_HASH) {
op.iplo_type = IPLT_HASH;
op.iplo_struct = &htstat;
op.iplo_size = sizeof(htstat);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN))) {
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (-1);
}
printf("%lu\thash tables\n", htstat.iphs_numtables);
printf("%lu\thash table nodes\n", htstat.iphs_numnodes);
printf("%lu\thash table no memory \n",
htstat.iphs_nomem);
}
}
if (type == IPLT_ALL || type == IPLT_DSTLIST) {
op.iplo_type = IPLT_DSTLIST;
op.iplo_struct = &dlstat;
op.iplo_size = sizeof(dlstat);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN))) {
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (-1);
}
printf("%u\tdestination lists\n",
dlstat.ipls_numlists);
printf("%u\tdestination list nodes\n",
dlstat.ipls_numnodes);
printf("%lu\tdestination list no memory\n",
dlstat.ipls_nomem);
printf("%u\tdestination list zombies\n",
dlstat.ipls_numdereflists);
printf("%u\tdesetination list node zombies\n",
dlstat.ipls_numderefnodes);
}
}
return (0);
}
int
poolflush(int argc, char *argv[])
{
int c, role, type, arg;
iplookupflush_t flush;
arg = IPLT_ALL;
type = IPLT_ALL;
role = IPL_LOGALL;
while ((c = getopt(argc, argv, "do:t:v")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
break;
case 'o' :
role = getrole(optarg);
if (role == IPL_LOGNONE) {
fprintf(stderr, "unknown role '%s'\n", optarg);
return (-1);
}
break;
case 't' :
type = gettype(optarg, NULL);
if (type == IPLT_NONE) {
fprintf(stderr, "unknown type '%s'\n", optarg);
return (-1);
}
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break; /* keep compiler happy */
}
if (argc - optind > 0)
usage(argv[0]);
if (opts & OPT_DEBUG)
fprintf(stderr, "poolflush: opts = %#x\n", opts);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN)) && (fd == -1)) {
fd = open(IPLOOKUP_NAME, O_RDWR);
if (fd == -1) {
perror("open(IPLOOKUP_NAME)");
exit(1);
}
}
bzero((char *)&flush, sizeof(flush));
flush.iplf_type = type;
flush.iplf_unit = role;
flush.iplf_arg = arg;
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN))) {
if (ioctl(fd, SIOCLOOKUPFLUSH, &flush) == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPFLUSH)");
exit(1);
}
}
printf("%u object%s flushed\n", flush.iplf_count,
(flush.iplf_count == 1) ? "" : "s");
return (0);
}
int
getrole(char *rolename)
{
int role;
if (!strcasecmp(rolename, "ipf")) {
role = IPL_LOGIPF;
#if 0
} else if (!strcasecmp(rolename, "nat")) {
role = IPL_LOGNAT;
} else if (!strcasecmp(rolename, "state")) {
role = IPL_LOGSTATE;
} else if (!strcasecmp(rolename, "auth")) {
role = IPL_LOGAUTH;
} else if (!strcasecmp(rolename, "sync")) {
role = IPL_LOGSYNC;
} else if (!strcasecmp(rolename, "scan")) {
role = IPL_LOGSCAN;
} else if (!strcasecmp(rolename, "pool")) {
role = IPL_LOGLOOKUP;
} else if (!strcasecmp(rolename, "count")) {
role = IPL_LOGCOUNT;
#endif
} else {
role = IPL_LOGNONE;
}
return (role);
}
int
gettype(char *typename, u_int *minor)
{
int type;
if (!strcasecmp(typename, "tree") || !strcasecmp(typename, "pool")) {
type = IPLT_POOL;
} else if (!strcasecmp(typename, "hash")) {
type = IPLT_HASH;
if (minor != NULL)
*minor = IPHASH_LOOKUP;
} else if (!strcasecmp(typename, "group-map")) {
type = IPLT_HASH;
if (minor != NULL)
*minor = IPHASH_GROUPMAP;
} else {
type = IPLT_NONE;
}
return (type);
}
int
poollist(int argc, char *argv[])
{
char *kernel, *core, *poolname;
int c, role, type, live_kernel;
iplookupop_t op;
core = NULL;
kernel = NULL;
live_kernel = 1;
type = IPLT_ALL;
poolname = NULL;
role = IPL_LOGALL;
while ((c = getopt(argc, argv, "dDm:M:N:o:t:v")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
break;
case 'D' :
opts |= OPT_SAVEOUT;
break;
case 'm' :
poolname = optarg;
break;
case 'M' :
live_kernel = 0;
core = optarg;
break;
case 'N' :
live_kernel = 0;
kernel = optarg;
break;
case 'o' :
role = getrole(optarg);
if (role == IPL_LOGNONE) {
fprintf(stderr, "unknown role '%s'\n", optarg);
return (-1);
}
break;
#if 0
case 'O' :
/* XXX This option does not work. This function as */
/* XXX used by state and nat can be used to format */
/* XXX output especially useful for scripting. It */
/* XXX is left here with the intention of making */
/* XXX it work for the same purpose at some point. */
pool_fields = parsefields(poolfields, optarg);
break;
#endif
case 't' :
type = gettype(optarg, NULL);
if (type == IPLT_NONE) {
fprintf(stderr, "unknown type '%s'\n", optarg);
return (-1);
}
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
default :
usage(argv[0]);
break; /* keep compiler happy */
}
if (argc - optind > 0)
usage(argv[0]);
if (opts & OPT_DEBUG)
fprintf(stderr, "poollist: opts = %#x\n", opts);
if (!(opts & (OPT_DONOTHING|OPT_DONTOPEN)) && (fd == -1)) {
fd = open(IPLOOKUP_NAME, O_RDWR);
if (fd == -1) {
perror("open(IPLOOKUP_NAME)");
exit(1);
}
}
bzero((char *)&op, sizeof(op));
if (poolname != NULL) {
strncpy(op.iplo_name, poolname, sizeof(op.iplo_name));
op.iplo_name[sizeof(op.iplo_name) - 1] = '\0';
}
op.iplo_unit = role;
if (live_kernel) {
if (poollist_live(role, poolname, type, fd) != 0)
return (1);
} else
poollist_dead(role, poolname, type, kernel, core);
return (0);
}
void
poollist_dead(int role, char *poolname, int type, char *kernel, char *core)
{
iphtable_t *hptr;
ip_pool_t *ptr;
if (openkmem(kernel, core) == -1)
exit(-1);
if (type == IPLT_ALL || type == IPLT_POOL) {
ip_pool_t *pools[IPL_LOGSIZE];
struct nlist names[2] = { { "ip_pool_list" } , { "" } };
if (nlist(kernel, names) != 1)
return;
bzero(&pools, sizeof(pools));
if (kmemcpy((char *)&pools, names[0].n_value, sizeof(pools)))
return;
if (role != IPL_LOGALL) {
ptr = pools[role];
while (ptr != NULL) {
ptr = printpool(ptr, kmemcpywrap, poolname,
opts, pool_fields);
}
} else {
for (role = 0; role <= IPL_LOGMAX; role++) {
ptr = pools[role];
while (ptr != NULL) {
ptr = printpool(ptr, kmemcpywrap,
poolname, opts,
pool_fields);
}
}
role = IPL_LOGALL;
}
}
if (type == IPLT_ALL || type == IPLT_HASH) {
iphtable_t *tables[IPL_LOGSIZE];
struct nlist names[2] = { { "ipf_htables" } , { "" } };
if (nlist(kernel, names) != 1)
return;
bzero(&tables, sizeof(tables));
if (kmemcpy((char *)&tables, names[0].n_value, sizeof(tables)))
return;
if (role != IPL_LOGALL) {
hptr = tables[role];
while (hptr != NULL) {
hptr = printhash(hptr, kmemcpywrap,
poolname, opts, pool_fields);
}
} else {
for (role = 0; role <= IPL_LOGMAX; role++) {
hptr = tables[role];
while (hptr != NULL) {
hptr = printhash(hptr, kmemcpywrap,
poolname, opts,
pool_fields);
}
}
}
}
}
int
poollist_live(int role, char *poolname, int type, int fd)
{
ipf_pool_stat_t plstat;
iplookupop_t op;
int c;
if (type == IPLT_ALL || type == IPLT_POOL) {
op.iplo_type = IPLT_POOL;
op.iplo_size = sizeof(plstat);
op.iplo_struct = &plstat;
op.iplo_name[0] = '\0';
op.iplo_arg = 0;
if (role != IPL_LOGALL) {
op.iplo_unit = role;
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (1);
}
if (showpools_live(fd, role, &plstat, poolname))
return (1);
} else {
for (role = -1; role <= IPL_LOGMAX; role++) {
op.iplo_unit = role;
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (1);
}
if (showpools_live(fd, role, &plstat, poolname))
return (1);
}
role = IPL_LOGALL;
}
}
if (type == IPLT_ALL || type == IPLT_HASH) {
iphtstat_t htstat;
op.iplo_type = IPLT_HASH;
op.iplo_size = sizeof(htstat);
op.iplo_struct = &htstat;
op.iplo_name[0] = '\0';
op.iplo_arg = 0;
if (role != IPL_LOGALL) {
op.iplo_unit = role;
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (1);
}
if (showhashs_live(fd, role, &htstat, poolname))
return (1);
} else {
for (role = 0; role <= IPL_LOGMAX; role++) {
op.iplo_unit = role;
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (1);
}
if (showhashs_live(fd, role, &htstat, poolname))
return(1);
}
role = IPL_LOGALL;
}
}
if (type == IPLT_ALL || type == IPLT_DSTLIST) {
ipf_dstl_stat_t dlstat;
op.iplo_type = IPLT_DSTLIST;
op.iplo_size = sizeof(dlstat);
op.iplo_struct = &dlstat;
op.iplo_name[0] = '\0';
op.iplo_arg = 0;
if (role != IPL_LOGALL) {
op.iplo_unit = role;
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (1);
}
if (showdstls_live(fd, role, &dlstat, poolname))
return (1);
} else {
for (role = 0; role <= IPL_LOGMAX; role++) {
op.iplo_unit = role;
c = ioctl(fd, SIOCLOOKUPSTAT, &op);
if (c == -1) {
ipferror(fd, "ioctl(SIOCLOOKUPSTAT)");
return (1);
}
if (showdstls_live(fd, role, &dlstat, poolname))
return (1);
}
role = IPL_LOGALL;
}
}
return (0);
}
int
showpools_live(int fd, int role, ipf_pool_stat_t *plstp, char *poolname)
{
ipflookupiter_t iter;
ip_pool_t pool;
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_LOOKUPITER;
obj.ipfo_size = sizeof(iter);
obj.ipfo_ptr = &iter;
iter.ili_type = IPLT_POOL;
iter.ili_otype = IPFLOOKUPITER_LIST;
iter.ili_ival = IPFGENITER_LOOKUP;
iter.ili_nitems = 1;
iter.ili_data = &pool;
iter.ili_unit = role;
*iter.ili_name = '\0';
bzero((char *)&pool, sizeof(pool));
while (plstp->ipls_list[role + 1] != NULL) {
if (ioctl(fd, SIOCLOOKUPITER, &obj)) {
ipferror(fd, "ioctl(SIOCLOOKUPITER)");
return (1);
}
if (((pool.ipo_flags & IPOOL_DELETE) == 0) ||
((opts & OPT_DEBUG) != 0))
printpool_live(&pool, fd, poolname, opts, pool_fields);
plstp->ipls_list[role + 1] = pool.ipo_next;
}
return (0);
}
int
showhashs_live(int fd, int role, iphtstat_t *htstp, char *poolname)
{
ipflookupiter_t iter;
iphtable_t table;
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_LOOKUPITER;
obj.ipfo_size = sizeof(iter);
obj.ipfo_ptr = &iter;
iter.ili_type = IPLT_HASH;
iter.ili_otype = IPFLOOKUPITER_LIST;
iter.ili_ival = IPFGENITER_LOOKUP;
iter.ili_nitems = 1;
iter.ili_data = &table;
iter.ili_unit = role;
*iter.ili_name = '\0';
while (htstp->iphs_tables != NULL) {
if (ioctl(fd, SIOCLOOKUPITER, &obj)) {
ipferror(fd, "ioctl(SIOCLOOKUPITER)");
return (1);
}
printhash_live(&table, fd, poolname, opts, pool_fields);
htstp->iphs_tables = table.iph_next;
}
return (0);
}
int
showdstls_live(int fd, int role, ipf_dstl_stat_t *dlstp, char *poolname)
{
ipflookupiter_t iter;
ippool_dst_t table;
ipfobj_t obj;
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_type = IPFOBJ_LOOKUPITER;
obj.ipfo_size = sizeof(iter);
obj.ipfo_ptr = &iter;
iter.ili_type = IPLT_DSTLIST;
iter.ili_otype = IPFLOOKUPITER_LIST;
iter.ili_ival = IPFGENITER_LOOKUP;
iter.ili_nitems = 1;
iter.ili_data = &table;
iter.ili_unit = role;
*iter.ili_name = '\0';
while (dlstp->ipls_list[role] != NULL) {
if (ioctl(fd, SIOCLOOKUPITER, &obj)) {
ipferror(fd, "ioctl(SIOCLOOKUPITER)");
return (1);
}
printdstl_live(&table, fd, poolname, opts, pool_fields);
dlstp->ipls_list[role] = table.ipld_next;
}
return (0);
}
int
setnodeaddr(int type, int role, void *ptr, char *arg)
{
struct in_addr mask;
sa_family_t family;
char *s;
if (strchr(arg, ':') == NULL) {
family = AF_INET;
s = strchr(arg, '/');
if (s == NULL)
mask.s_addr = 0xffffffff;
else if (strchr(s, '.') == NULL) {
if (ntomask(AF_INET, atoi(s + 1), &mask.s_addr) != 0)
return (-1);
} else {
mask.s_addr = inet_addr(s + 1);
}
if (s != NULL)
*s = '\0';
} else {
family = AF_INET6;
/* XXX for now we use mask for IPv6 prefix length */
/* XXX mask should be a union with prefix */
/* XXX Currently address handling is sloppy. */
if ((s = strchr(arg, '/')) == NULL)
mask.s_addr = 128;
else
mask.s_addr = atoi(s + 1);
}
if (type == IPLT_POOL) {
ip_pool_node_t *node = ptr;
node->ipn_addr.adf_family = family;
#ifdef USE_INET6
if (node->ipn_addr.adf_family == AF_INET) {
#endif
node->ipn_addr.adf_len = offsetof(addrfamily_t,
adf_addr) +
sizeof(struct in_addr);
node->ipn_addr.adf_addr.in4.s_addr = inet_addr(arg);
#ifdef USE_INET6
} else {
node->ipn_addr.adf_len = offsetof(addrfamily_t,
adf_addr) +
sizeof(struct in6_addr);
inet_pton(AF_INET6, arg,
&node->ipn_addr.adf_addr.in6.s6_addr);
}
#endif
node->ipn_mask.adf_len = node->ipn_addr.adf_len;
node->ipn_mask.adf_addr.in4.s_addr = mask.s_addr;
} else if (type == IPLT_HASH) {
iphtent_t *node = ptr;
node->ipe_family = family;
node->ipe_unit = role;
#ifdef USE_INET6
if (node->ipe_family == AF_INET) {
#endif
node->ipe_addr.in4.s_addr = inet_addr(arg);
node->ipe_mask.in4.s_addr = mask.s_addr;
#ifdef USE_INET6
} else {
inet_pton(AF_INET6, arg,
&node->ipe_addr.in6.__u6_addr.__u6_addr32);
node->ipe_mask.in6.__u6_addr.__u6_addr32[0] =
mask.s_addr;
node->ipe_mask.in6.__u6_addr.__u6_addr32[1] =
node->ipe_mask.in6.__u6_addr.__u6_addr32[2] =
node->ipe_mask.in6.__u6_addr.__u6_addr32[3] = 0;
}
#endif
}
return (0);
}
diff --git a/sbin/ipf/ippool/ippool_y.y b/sbin/ipf/ippool/ippool_y.y
index c798ff50596b..6baa48dfa01c 100644
--- a/sbin/ipf/ippool/ippool_y.y
+++ b/sbin/ipf/ippool/ippool_y.y
@@ -1,824 +1,823 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
%{
#include <sys/types.h>
#include <sys/time.h>
#include <sys/param.h>
#include <sys/socket.h>
# include <sys/cdefs.h>
#include <sys/ioctl.h>
#include <net/if.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <netdb.h>
#include <ctype.h>
#include <unistd.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_pool.h"
#include "netinet/ip_htable.h"
#include "netinet/ip_dstlist.h"
#include "ippool_l.h"
#include "kmem.h"
#define YYDEBUG 1
#define YYSTACKSIZE 0x00ffffff
extern int yyparse(void);
extern int yydebug;
extern FILE *yyin;
static iphtable_t ipht;
static iphtent_t iphte;
static ip_pool_t iplo;
static ippool_dst_t ipld;
static ioctlfunc_t poolioctl = NULL;
static char poolname[FR_GROUPLEN];
static iphtent_t *add_htablehosts(char *);
static ip_pool_node_t *add_poolhosts(char *);
static ip_pool_node_t *read_whoisfile(char *);
static void setadflen(addrfamily_t *);
%}
%union {
char *str;
u_32_t num;
struct in_addr ip4;
struct alist_s *alist;
addrfamily_t adrmsk[2];
iphtent_t *ipe;
ip_pool_node_t *ipp;
ipf_dstnode_t *ipd;
addrfamily_t ipa;
i6addr_t ip6;
}
%token <num> YY_NUMBER YY_HEX
%token <str> YY_STR
%token <ip6> YY_IPV6
%token YY_COMMENT
%token YY_CMP_EQ YY_CMP_NE YY_CMP_LE YY_CMP_GE YY_CMP_LT YY_CMP_GT
%token YY_RANGE_OUT YY_RANGE_IN
%token IPT_IPF IPT_NAT IPT_COUNT IPT_AUTH IPT_IN IPT_OUT IPT_ALL
%token IPT_TABLE IPT_GROUPMAP IPT_HASH IPT_SRCHASH IPT_DSTHASH
%token IPT_ROLE IPT_TYPE IPT_TREE
%token IPT_GROUP IPT_SIZE IPT_SEED IPT_NUM IPT_NAME IPT_POLICY
%token IPT_POOL IPT_DSTLIST IPT_ROUNDROBIN
%token IPT_WEIGHTED IPT_RANDOM IPT_CONNECTION
%token IPT_WHOIS IPT_FILE
%type <num> role table inout unit dstopts weighting
%type <ipp> ipftree range addrlist
%type <adrmsk> addrmask
%type <ipe> ipfgroup ipfhash hashlist hashentry
%type <ipe> groupentry setgrouplist grouplist
%type <ipa> ipaddr mask
%type <ip4> ipv4
%type <str> number setgroup name
%type <ipd> dstentry dstentries dstlist
%%
file: line
| assign
| file line
| file assign
;
line: table role ipftree eol { ip_pool_node_t *n;
iplo.ipo_unit = $2;
iplo.ipo_list = $3;
load_pool(&iplo, poolioctl);
while ((n = $3) != NULL) {
$3 = n->ipn_next;
free(n);
}
resetlexer();
use_inet6 = 0;
}
| table role ipfhash eol { iphtent_t *h;
ipht.iph_unit = $2;
ipht.iph_type = IPHASH_LOOKUP;
load_hash(&ipht, $3, poolioctl);
while ((h = $3) != NULL) {
$3 = h->ipe_next;
free(h);
}
resetlexer();
use_inet6 = 0;
}
| groupmap role number ipfgroup eol
{ iphtent_t *h;
ipht.iph_unit = $2;
strncpy(ipht.iph_name, $3,
sizeof(ipht.iph_name));
ipht.iph_type = IPHASH_GROUPMAP;
load_hash(&ipht, $4, poolioctl);
while ((h = $4) != NULL) {
$4 = h->ipe_next;
free(h);
}
resetlexer();
use_inet6 = 0;
}
| YY_COMMENT
| poolline eol
;
eol: ';'
;
assign: YY_STR assigning YY_STR ';' { set_variable($1, $3);
resetlexer();
free($1);
free($3);
yyvarnext = 0;
}
;
assigning:
'=' { yyvarnext = 1; }
;
table: IPT_TABLE { bzero((char *)&ipht, sizeof(ipht));
bzero((char *)&iphte, sizeof(iphte));
bzero((char *)&iplo, sizeof(iplo));
bzero((char *)&ipld, sizeof(ipld));
*ipht.iph_name = '\0';
iplo.ipo_flags = IPHASH_ANON;
iplo.ipo_name[0] = '\0';
}
;
groupmap:
IPT_GROUPMAP inout { bzero((char *)&ipht, sizeof(ipht));
bzero((char *)&iphte, sizeof(iphte));
*ipht.iph_name = '\0';
ipht.iph_unit = IPHASH_GROUPMAP;
ipht.iph_flags = $2;
}
;
inout: IPT_IN { $$ = FR_INQUE; }
| IPT_OUT { $$ = FR_OUTQUE; }
;
role: IPT_ROLE '=' unit { $$ = $3; }
;
unit: IPT_IPF { $$ = IPL_LOGIPF; }
| IPT_NAT { $$ = IPL_LOGNAT; }
| IPT_AUTH { $$ = IPL_LOGAUTH; }
| IPT_COUNT { $$ = IPL_LOGCOUNT; }
| IPT_ALL { $$ = IPL_LOGALL; }
;
ipftree:
IPT_TYPE '=' IPT_TREE number start addrlist end
{ strncpy(iplo.ipo_name, $4,
sizeof(iplo.ipo_name));
$$ = $6;
}
;
ipfhash:
IPT_TYPE '=' IPT_HASH number hashopts start hashlist end
{ strncpy(ipht.iph_name, $4,
sizeof(ipht.iph_name));
$$ = $7;
}
;
ipfgroup:
setgroup hashopts start grouplist end
{ iphtent_t *e;
for (e = $4; e != NULL;
e = e->ipe_next)
if (e->ipe_group[0] == '\0')
strncpy(e->ipe_group,
$1,
FR_GROUPLEN);
$$ = $4;
free($1);
}
| hashopts start setgrouplist end
{ $$ = $3; }
;
number: IPT_NUM '=' YY_NUMBER { snprintf(poolname, sizeof(poolname), "%u", $3);
$$ = poolname;
}
| IPT_NAME '=' YY_STR { strncpy(poolname, $3,
FR_GROUPLEN);
poolname[FR_GROUPLEN-1]='\0';
free($3);
$$ = poolname;
}
| { $$ = ""; }
;
setgroup:
IPT_GROUP '=' YY_STR { char tmp[FR_GROUPLEN+1];
strncpy(tmp, $3, FR_GROUPLEN);
$$ = strdup(tmp);
free($3);
}
| IPT_GROUP '=' YY_NUMBER { char tmp[FR_GROUPLEN+1];
snprintf(tmp, sizeof(tmp), "%u", $3);
$$ = strdup(tmp);
}
;
hashopts:
| size
| seed
| size seed
;
addrlist:
';' { $$ = NULL; }
| range next addrlist { $$ = $1;
while ($1->ipn_next != NULL)
$1 = $1->ipn_next;
$1->ipn_next = $3;
}
| range next { $$ = $1; }
;
grouplist:
';' { $$ = NULL; }
| groupentry next grouplist { $$ = $1; $1->ipe_next = $3; }
| addrmask next grouplist { $$ = calloc(1, sizeof(iphtent_t));
$$->ipe_addr = $1[0].adf_addr;
$$->ipe_mask = $1[1].adf_addr;
$$->ipe_family = $1[0].adf_family;
$$->ipe_next = $3;
}
| groupentry next { $$ = $1; }
| addrmask next { $$ = calloc(1, sizeof(iphtent_t));
$$->ipe_addr = $1[0].adf_addr;
$$->ipe_mask = $1[1].adf_addr;
#ifdef USE_INET6
if (use_inet6)
$$->ipe_family = AF_INET6;
else
#endif
$$->ipe_family = AF_INET;
}
| YY_STR { $$ = add_htablehosts($1);
free($1);
}
;
setgrouplist:
';' { $$ = NULL; }
| groupentry next { $$ = $1; }
| groupentry next setgrouplist { $1->ipe_next = $3; $$ = $1; }
;
groupentry:
addrmask ',' setgroup { $$ = calloc(1, sizeof(iphtent_t));
$$->ipe_addr = $1[0].adf_addr;
$$->ipe_mask = $1[1].adf_addr;
strncpy($$->ipe_group, $3,
FR_GROUPLEN);
#ifdef USE_INET6
if (use_inet6)
$$->ipe_family = AF_INET6;
else
#endif
$$->ipe_family = AF_INET;
free($3);
}
;
range: addrmask { $$ = calloc(1, sizeof(*$$));
$$->ipn_info = 0;
$$->ipn_addr = $1[0];
$$->ipn_mask = $1[1];
#ifdef USE_INET6
if (use_inet6)
$$->ipn_addr.adf_family =
AF_INET6;
else
#endif
$$->ipn_addr.adf_family =
AF_INET;
}
| '!' addrmask { $$ = calloc(1, sizeof(*$$));
$$->ipn_info = 1;
$$->ipn_addr = $2[0];
$$->ipn_mask = $2[1];
#ifdef USE_INET6
if (use_inet6)
$$->ipn_addr.adf_family =
AF_INET6;
else
#endif
$$->ipn_addr.adf_family =
AF_INET;
}
| YY_STR { $$ = add_poolhosts($1);
free($1);
}
| IPT_WHOIS IPT_FILE YY_STR { $$ = read_whoisfile($3);
free($3);
}
;
hashlist:
';' { $$ = NULL; }
| hashentry next { $$ = $1; }
| hashentry next hashlist { $1->ipe_next = $3; $$ = $1; }
;
hashentry:
addrmask { $$ = calloc(1, sizeof(iphtent_t));
$$->ipe_addr = $1[0].adf_addr;
$$->ipe_mask = $1[1].adf_addr;
#ifdef USE_INET6
if (use_inet6)
$$->ipe_family = AF_INET6;
else
#endif
$$->ipe_family = AF_INET;
}
| YY_STR { $$ = add_htablehosts($1);
free($1);
}
;
addrmask:
ipaddr '/' mask { $$[0] = $1;
setadflen(&$$[0]);
$$[1] = $3;
$$[1].adf_len = $$[0].adf_len;
}
| ipaddr { $$[0] = $1;
setadflen(&$$[1]);
$$[1].adf_len = $$[0].adf_len;
#ifdef USE_INET6
if (use_inet6)
memset(&$$[1].adf_addr, 0xff,
sizeof($$[1].adf_addr.in6));
else
#endif
memset(&$$[1].adf_addr, 0xff,
sizeof($$[1].adf_addr.in4));
}
;
ipaddr: ipv4 { $$.adf_addr.in4 = $1;
$$.adf_family = AF_INET;
setadflen(&$$);
use_inet6 = 0;
}
| YY_NUMBER { $$.adf_addr.in4.s_addr = htonl($1);
$$.adf_family = AF_INET;
setadflen(&$$);
use_inet6 = 0;
}
| YY_IPV6 { $$.adf_addr = $1;
$$.adf_family = AF_INET6;
setadflen(&$$);
use_inet6 = 1;
}
;
mask: YY_NUMBER { bzero(&$$, sizeof($$));
if (use_inet6) {
if (ntomask(AF_INET6, $1,
(u_32_t *)&$$.adf_addr) == -1)
yyerror("bad bitmask");
} else {
if (ntomask(AF_INET, $1,
(u_32_t *)&$$.adf_addr.in4) == -1)
yyerror("bad bitmask");
}
}
| ipv4 { bzero(&$$, sizeof($$));
$$.adf_addr.in4 = $1;
}
| YY_IPV6 { bzero(&$$, sizeof($$));
$$.adf_addr = $1;
}
;
size: IPT_SIZE '=' YY_NUMBER { ipht.iph_size = $3; }
;
seed: IPT_SEED '=' YY_NUMBER { ipht.iph_seed = $3; }
;
ipv4: YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER
{ if ($1 > 255 || $3 > 255 || $5 > 255 || $7 > 255) {
yyerror("Invalid octet string for IP address");
return(0);
}
$$.s_addr = ($1 << 24) | ($3 << 16) | ($5 << 8) | $7;
$$.s_addr = htonl($$.s_addr);
}
;
next: ';' { yyexpectaddr = 1; }
;
start: '{' { yyexpectaddr = 1; }
;
end: '}' { yyexpectaddr = 0; }
;
poolline:
IPT_POOL unit '/' IPT_DSTLIST '(' name ';' dstopts ')'
start dstlist end
{ bzero((char *)&ipld, sizeof(ipld));
strncpy(ipld.ipld_name, $6,
sizeof(ipld.ipld_name));
ipld.ipld_unit = $2;
ipld.ipld_policy = $8;
load_dstlist(&ipld, poolioctl, $11);
resetlexer();
use_inet6 = 0;
free($6);
}
| IPT_POOL unit '/' IPT_TREE '(' name ';' ')'
start addrlist end
{ bzero((char *)&iplo, sizeof(iplo));
strncpy(iplo.ipo_name, $6,
sizeof(iplo.ipo_name));
iplo.ipo_list = $10;
iplo.ipo_unit = $2;
load_pool(&iplo, poolioctl);
resetlexer();
use_inet6 = 0;
free($6);
}
| IPT_POOL '(' name ';' ')' start addrlist end
{ bzero((char *)&iplo, sizeof(iplo));
strncpy(iplo.ipo_name, $3,
sizeof(iplo.ipo_name));
iplo.ipo_list = $7;
iplo.ipo_unit = IPL_LOGALL;
load_pool(&iplo, poolioctl);
resetlexer();
use_inet6 = 0;
free($3);
}
| IPT_POOL unit '/' IPT_HASH '(' name ';' hashoptlist ')'
start hashlist end
{ iphtent_t *h;
bzero((char *)&ipht, sizeof(ipht));
strncpy(ipht.iph_name, $6,
sizeof(ipht.iph_name));
ipht.iph_unit = $2;
load_hash(&ipht, $11, poolioctl);
while ((h = ipht.iph_list) != NULL) {
ipht.iph_list = h->ipe_next;
free(h);
}
resetlexer();
use_inet6 = 0;
free($6);
}
| IPT_GROUPMAP '(' name ';' inout ';' ')'
start setgrouplist end
{ iphtent_t *h;
bzero((char *)&ipht, sizeof(ipht));
strncpy(ipht.iph_name, $3,
sizeof(ipht.iph_name));
ipht.iph_type = IPHASH_GROUPMAP;
ipht.iph_unit = IPL_LOGIPF;
ipht.iph_flags = $5;
load_hash(&ipht, $9, poolioctl);
while ((h = ipht.iph_list) != NULL) {
ipht.iph_list = h->ipe_next;
free(h);
}
resetlexer();
use_inet6 = 0;
free($3);
}
;
name: IPT_NAME YY_STR { $$ = $2; }
| IPT_NUM YY_NUMBER { char name[80];
snprintf(name, sizeof(name), "%d", $2);
$$ = strdup(name);
}
;
hashoptlist:
| hashopt ';'
| hashoptlist ';' hashopt ';'
;
hashopt:
IPT_SIZE YY_NUMBER
| IPT_SEED YY_NUMBER
;
dstlist:
dstentries { $$ = $1; }
| ';' { $$ = NULL; }
;
dstentries:
dstentry next { $$ = $1; }
| dstentry next dstentries { $1->ipfd_next = $3; $$ = $1; }
;
dstentry:
YY_STR ':' ipaddr { int size = sizeof(*$$) + strlen($1) + 1;
$$ = calloc(1, size);
if ($$ != NULL) {
$$->ipfd_dest.fd_name = strlen($1) + 1;
bcopy($1, $$->ipfd_names,
$$->ipfd_dest.fd_name);
$$->ipfd_dest.fd_addr = $3;
$$->ipfd_size = size;
}
free($1);
}
| ipaddr { $$ = calloc(1, sizeof(*$$));
if ($$ != NULL) {
$$->ipfd_dest.fd_name = -1;
$$->ipfd_dest.fd_addr = $1;
$$->ipfd_size = sizeof(*$$);
}
}
;
dstopts:
{ $$ = IPLDP_NONE; }
| IPT_POLICY IPT_ROUNDROBIN ';' { $$ = IPLDP_ROUNDROBIN; }
| IPT_POLICY IPT_WEIGHTED weighting ';' { $$ = $3; }
| IPT_POLICY IPT_RANDOM ';' { $$ = IPLDP_RANDOM; }
| IPT_POLICY IPT_HASH ';' { $$ = IPLDP_HASHED; }
| IPT_POLICY IPT_SRCHASH ';' { $$ = IPLDP_SRCHASH; }
| IPT_POLICY IPT_DSTHASH ';' { $$ = IPLDP_DSTHASH; }
;
weighting:
IPT_CONNECTION { $$ = IPLDP_CONNECTION; }
;
%%
static wordtab_t yywords[] = {
{ "all", IPT_ALL },
{ "auth", IPT_AUTH },
{ "connection", IPT_CONNECTION },
{ "count", IPT_COUNT },
{ "dst-hash", IPT_DSTHASH },
{ "dstlist", IPT_DSTLIST },
{ "file", IPT_FILE },
{ "group", IPT_GROUP },
{ "group-map", IPT_GROUPMAP },
{ "hash", IPT_HASH },
{ "in", IPT_IN },
{ "ipf", IPT_IPF },
{ "name", IPT_NAME },
{ "nat", IPT_NAT },
{ "number", IPT_NUM },
{ "out", IPT_OUT },
{ "policy", IPT_POLICY },
{ "pool", IPT_POOL },
{ "random", IPT_RANDOM },
{ "round-robin", IPT_ROUNDROBIN },
{ "role", IPT_ROLE },
{ "seed", IPT_SEED },
{ "size", IPT_SIZE },
{ "src-hash", IPT_SRCHASH },
{ "table", IPT_TABLE },
{ "tree", IPT_TREE },
{ "type", IPT_TYPE },
{ "weighted", IPT_WEIGHTED },
{ "whois", IPT_WHOIS },
{ NULL, 0 }
};
int
ippool_parsefile(int fd, char *filename, ioctlfunc_t iocfunc)
{
FILE *fp = NULL;
char *s;
yylineNum = 1;
(void) yysettab(yywords);
s = getenv("YYDEBUG");
if (s)
yydebug = atoi(s);
else
yydebug = 0;
if (strcmp(filename, "-")) {
fp = fopen(filename, "r");
if (!fp) {
fprintf(stderr, "fopen(%s) failed: %s\n", filename,
STRERROR(errno));
return(-1);
}
} else
fp = stdin;
while (ippool_parsesome(fd, fp, iocfunc) == 1)
;
if (fp != NULL)
fclose(fp);
return(0);
}
int
ippool_parsesome(int fd, FILE *fp, ioctlfunc_t iocfunc)
{
char *s;
int i;
poolioctl = iocfunc;
if (feof(fp))
return(0);
i = fgetc(fp);
if (i == EOF)
return(0);
if (ungetc(i, fp) == EOF)
return(0);
if (feof(fp))
return(0);
s = getenv("YYDEBUG");
if (s)
yydebug = atoi(s);
else
yydebug = 0;
yyin = fp;
yyparse();
return(1);
}
static iphtent_t *
add_htablehosts(char *url)
{
iphtent_t *htop, *hbot, *h;
alist_t *a, *hlist;
if (!strncmp(url, "file://", 7) || !strncmp(url, "http://", 7)) {
hlist = load_url(url);
} else {
use_inet6 = 0;
hlist = calloc(1, sizeof(*hlist));
if (hlist == NULL)
return(NULL);
if (gethost(hlist->al_family, url, &hlist->al_i6addr) == -1) {
yyerror("Unknown hostname");
}
}
hbot = NULL;
htop = NULL;
for (a = hlist; a != NULL; a = a->al_next) {
h = calloc(1, sizeof(*h));
if (h == NULL)
break;
h->ipe_family = a->al_family;
h->ipe_addr = a->al_i6addr;
h->ipe_mask = a->al_i6mask;
if (hbot != NULL)
hbot->ipe_next = h;
else
htop = h;
hbot = h;
}
alist_free(hlist);
return(htop);
}
static ip_pool_node_t *
add_poolhosts(char *url)
{
ip_pool_node_t *ptop, *pbot, *p;
alist_t *a, *hlist;
if (!strncmp(url, "file://", 7) || !strncmp(url, "http://", 7)) {
hlist = load_url(url);
} else {
use_inet6 = 0;
hlist = calloc(1, sizeof(*hlist));
if (hlist == NULL)
return(NULL);
if (gethost(hlist->al_family, url, &hlist->al_i6addr) == -1) {
yyerror("Unknown hostname");
}
}
pbot = NULL;
ptop = NULL;
for (a = hlist; a != NULL; a = a->al_next) {
p = calloc(1, sizeof(*p));
if (p == NULL)
break;
p->ipn_mask.adf_addr = a->al_i6mask;
if (a->al_family == AF_INET) {
p->ipn_addr.adf_family = AF_INET;
#ifdef USE_INET6
} else if (a->al_family == AF_INET6) {
p->ipn_addr.adf_family = AF_INET6;
#endif
}
setadflen(&p->ipn_addr);
p->ipn_addr.adf_addr = a->al_i6addr;
p->ipn_info = a->al_not;
p->ipn_mask.adf_len = p->ipn_addr.adf_len;
if (pbot != NULL)
pbot->ipn_next = p;
else
ptop = p;
pbot = p;
}
alist_free(hlist);
return(ptop);
}
ip_pool_node_t *
read_whoisfile(char *file)
{
ip_pool_node_t *ntop, *ipn, node, *last;
char line[1024];
FILE *fp;
fp = fopen(file, "r");
if (fp == NULL)
return(NULL);
last = NULL;
ntop = NULL;
while (fgets(line, sizeof(line) - 1, fp) != NULL) {
line[sizeof(line) - 1] = '\0';
if (parsewhoisline(line, &node.ipn_addr, &node.ipn_mask))
continue;
ipn = calloc(1, sizeof(*ipn));
if (ipn == NULL)
continue;
ipn->ipn_addr = node.ipn_addr;
ipn->ipn_mask = node.ipn_mask;
if (last == NULL)
ntop = ipn;
else
last->ipn_next = ipn;
last = ipn;
}
fclose(fp);
return(ntop);
}
static void
setadflen(addrfamily_t *afp)
{
afp->adf_len = offsetof(addrfamily_t, adf_addr);
switch (afp->adf_family)
{
case AF_INET :
afp->adf_len += sizeof(struct in_addr);
break;
#ifdef USE_INET6
case AF_INET6 :
afp->adf_len += sizeof(struct in6_addr);
break;
#endif
default :
break;
}
}
diff --git a/sbin/ipf/ipscan/ipscan_y.y b/sbin/ipf/ipscan/ipscan_y.y
index 21d1b15aed70..b6693e294dae 100644
--- a/sbin/ipf/ipscan/ipscan_y.y
+++ b/sbin/ipf/ipscan/ipscan_y.y
@@ -1,569 +1,568 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
%{
#include <sys/types.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "opts.h"
#include "kmem.h"
#include "ipscan_l.h"
#include "netinet/ip_scan.h"
#include <ctype.h>
#define YYDEBUG 1
extern char *optarg;
extern void yyerror(char *);
extern int yyparse(void);
extern int yylex(void);
extern int yydebug;
extern FILE *yyin;
extern int yylineNum;
extern void printbuf(char *, int, int);
void printent(ipscan_t *);
void showlist(void);
int getportnum(char *);
struct in_addr gethostip(char *);
struct in_addr combine(int, int, int, int);
char **makepair(char *, char *);
void addtag(char *, char **, char **, struct action *);
int cram(char *, char *);
void usage(char *);
int main(int, char **);
int opts = 0;
int fd = -1;
%}
%union {
char *str;
char **astr;
u_32_t num;
struct in_addr ipa;
struct action act;
union i6addr ip6;
}
%type <str> tag
%type <act> action redirect result
%type <ipa> ipaddr
%type <num> portnum
%type <astr> matchup onehalf twohalves
%token <num> YY_NUMBER YY_HEX
%token <str> YY_STR
%token YY_COMMENT
%token YY_CMP_EQ YY_CMP_NE YY_CMP_LE YY_CMP_GE YY_CMP_LT YY_CMP_GT
%token YY_RANGE_OUT YY_RANGE_IN
%token <ip6> YY_IPV6
%token IPSL_START IPSL_STARTGROUP IPSL_CONTENT
%token IPSL_CLOSE IPSL_TRACK IPSL_EOF IPSL_REDIRECT IPSL_ELSE
%%
file: line ';'
| assign ';'
| file line ';'
| file assign ';'
| YY_COMMENT
;
line: IPSL_START dline
| IPSL_STARTGROUP gline
| IPSL_CONTENT oline
;
dline: cline { resetlexer(); }
| sline { resetlexer(); }
| csline { resetlexer(); }
;
gline: YY_STR ':' glist '=' action
;
oline: cline
| sline
| csline
;
assign: YY_STR assigning YY_STR
{ set_variable($1, $3);
resetlexer();
free($1);
free($3);
yyvarnext = 0;
}
;
assigning:
'=' { yyvarnext = 1; }
;
cline: tag ':' matchup '=' action { addtag($1, $3, NULL, &$5); }
;
sline: tag ':' '(' ')' ',' matchup '=' action { addtag($1, NULL, $6, &$8); }
;
csline: tag ':' matchup ',' matchup '=' action { addtag($1, $3, $5, &$7); }
;
glist: YY_STR
| glist ',' YY_STR
;
tag: YY_STR { $$ = $1; }
;
matchup:
onehalf { $$ = $1; }
| twohalves { $$ = $1; }
;
action: result { $$.act_val = $1.act_val;
$$.act_ip = $1.act_ip;
$$.act_port = $1.act_port; }
| result IPSL_ELSE result { $$.act_val = $1.act_val;
$$.act_else = $3.act_val;
if ($1.act_val == IPSL_REDIRECT) {
$$.act_ip = $1.act_ip;
$$.act_port = $1.act_port;
}
if ($3.act_val == IPSL_REDIRECT) {
$$.act_eip = $3.act_eip;
$$.act_eport = $3.act_eport;
}
}
result: IPSL_CLOSE { $$.act_val = IPSL_CLOSE; }
| IPSL_TRACK { $$.act_val = IPSL_TRACK; }
| redirect { $$.act_val = IPSL_REDIRECT;
$$.act_ip = $1.act_ip;
$$.act_port = $1.act_port; }
;
onehalf:
'(' YY_STR ')' { $$ = makepair($2, NULL); }
;
twohalves:
'(' YY_STR ',' YY_STR ')' { $$ = makepair($2, $4); }
;
redirect:
IPSL_REDIRECT '(' ipaddr ')' { $$.act_ip = $3;
$$.act_port = 0; }
| IPSL_REDIRECT '(' ipaddr ',' portnum ')'
{ $$.act_ip = $3;
$$.act_port = $5; }
;
ipaddr: YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER '.' YY_NUMBER
{ $$ = combine($1,$3,$5,$7); }
| YY_STR { $$ = gethostip($1);
free($1);
}
;
portnum:
YY_NUMBER { $$ = htons($1); }
| YY_STR { $$ = getportnum($1);
free($1);
}
;
%%
static struct wordtab yywords[] = {
{ "close", IPSL_CLOSE },
{ "content", IPSL_CONTENT },
{ "else", IPSL_ELSE },
{ "start-group", IPSL_STARTGROUP },
{ "redirect", IPSL_REDIRECT },
{ "start", IPSL_START },
{ "track", IPSL_TRACK },
{ NULL, 0 }
};
int
cram(char *dst, char *src)
{
char c, *s, *t, *u;
int i, j, k;
c = *src;
s = src + 1;
t = strchr(s, c);
*t = '\0';
for (u = dst, i = 0; (i <= ISC_TLEN) && (s < t); ) {
c = *s++;
if (c == '\\') {
if (s >= t)
break;
j = k = 0;
do {
c = *s++;
if (j && (!ISDIGIT(c) || (c > '7') ||
(k >= 248))) {
*u++ = k, i++;
j = k = 0;
s--;
break;
}
i++;
if (ISALPHA(c) || (c > '7')) {
switch (c)
{
case 'n' :
*u++ = '\n';
break;
case 'r' :
*u++ = '\r';
break;
case 't' :
*u++ = '\t';
break;
default :
*u++ = c;
break;
}
} else if (ISDIGIT(c)) {
j = 1;
k <<= 3;
k |= (c - '0');
i--;
} else
*u++ = c;
} while ((i <= ISC_TLEN) && (s <= t) && (j > 0));
} else
*u++ = c, i++;
}
return(i);
}
void
printent(ipscan_t *isc)
{
char buf[ISC_TLEN+1];
u_char *u;
int i, j;
buf[ISC_TLEN] = '\0';
bcopy(isc->ipsc_ctxt, buf, ISC_TLEN);
printf("%s : (\"", isc->ipsc_tag);
printbuf(isc->ipsc_ctxt, isc->ipsc_clen, 0);
bcopy(isc->ipsc_cmsk, buf, ISC_TLEN);
printf("\", \"%s\"), (\"", buf);
printbuf(isc->ipsc_stxt, isc->ipsc_slen, 0);
bcopy(isc->ipsc_smsk, buf, ISC_TLEN);
printf("\", \"%s\") = ", buf);
switch (isc->ipsc_action)
{
case ISC_A_TRACK :
printf("track");
break;
case ISC_A_REDIRECT :
printf("redirect");
printf("(%s", inet_ntoa(isc->ipsc_ip));
if (isc->ipsc_port)
printf(",%d", isc->ipsc_port);
printf(")");
break;
case ISC_A_CLOSE :
printf("close");
break;
default :
break;
}
if (isc->ipsc_else != ISC_A_NONE) {
printf(" else ");
switch (isc->ipsc_else)
{
case ISC_A_TRACK :
printf("track");
break;
case ISC_A_REDIRECT :
printf("redirect");
printf("(%s", inet_ntoa(isc->ipsc_eip));
if (isc->ipsc_eport)
printf(",%d", isc->ipsc_eport);
printf(")");
break;
case ISC_A_CLOSE :
printf("close");
break;
default :
break;
}
}
printf("\n");
if (opts & OPT_DEBUG) {
for (u = (u_char *)isc, i = sizeof(*isc); i; ) {
printf("#");
for (j = 32; (j > 0) && (i > 0); j--, i--)
printf("%s%02x", (j & 7) ? "" : " ", *u++);
printf("\n");
}
}
if (opts & OPT_VERBOSE) {
printf("# hits %d active %d fref %d sref %d\n",
isc->ipsc_hits, isc->ipsc_active, isc->ipsc_fref,
isc->ipsc_sref);
}
}
void
addtag(char *tstr, char **cp, char **sp, struct action *act)
{
ipscan_t isc, *iscp;
bzero((char *)&isc, sizeof(isc));
strncpy(isc.ipsc_tag, tstr, sizeof(isc.ipsc_tag));
isc.ipsc_tag[sizeof(isc.ipsc_tag) - 1] = '\0';
if (cp) {
isc.ipsc_clen = cram(isc.ipsc_ctxt, cp[0]);
if (cp[1]) {
if (cram(isc.ipsc_cmsk, cp[1]) != isc.ipsc_clen) {
fprintf(stderr,
"client text/mask strings different length\n");
return;
}
}
}
if (sp) {
isc.ipsc_slen = cram(isc.ipsc_stxt, sp[0]);
if (sp[1]) {
if (cram(isc.ipsc_smsk, sp[1]) != isc.ipsc_slen) {
fprintf(stderr,
"server text/mask strings different length\n");
return;
}
}
}
if (act->act_val == IPSL_CLOSE) {
isc.ipsc_action = ISC_A_CLOSE;
} else if (act->act_val == IPSL_TRACK) {
isc.ipsc_action = ISC_A_TRACK;
} else if (act->act_val == IPSL_REDIRECT) {
isc.ipsc_action = ISC_A_REDIRECT;
isc.ipsc_ip = act->act_ip;
isc.ipsc_port = act->act_port;
fprintf(stderr, "%d: redirect unsupported\n", yylineNum + 1);
}
if (act->act_else == IPSL_CLOSE) {
isc.ipsc_else = ISC_A_CLOSE;
} else if (act->act_else == IPSL_TRACK) {
isc.ipsc_else = ISC_A_TRACK;
} else if (act->act_else == IPSL_REDIRECT) {
isc.ipsc_else = ISC_A_REDIRECT;
isc.ipsc_eip = act->act_eip;
isc.ipsc_eport = act->act_eport;
fprintf(stderr, "%d: redirect unsupported\n", yylineNum + 1);
}
if (!(opts & OPT_DONOTHING)) {
iscp = &isc;
if (opts & OPT_REMOVE) {
if (ioctl(fd, SIOCRMSCA, &iscp) == -1)
perror("SIOCADSCA");
} else {
if (ioctl(fd, SIOCADSCA, &iscp) == -1)
perror("SIOCADSCA");
}
}
if (opts & OPT_VERBOSE)
printent(&isc);
}
char **
makepair(char *s1, char *s2)
{
char **a;
a = malloc(sizeof(char *) * 2);
a[0] = s1;
a[1] = s2;
return(a);
}
struct in_addr
combine(int a1, int a2, int a3, int a4)
{
struct in_addr in;
a1 &= 0xff;
in.s_addr = a1 << 24;
a2 &= 0xff;
in.s_addr |= (a2 << 16);
a3 &= 0xff;
in.s_addr |= (a3 << 8);
a4 &= 0xff;
in.s_addr |= a4;
in.s_addr = htonl(in.s_addr);
return(in);
}
struct in_addr
gethostip(char *host)
{
struct hostent *hp;
struct in_addr in;
in.s_addr = 0;
hp = gethostbyname(host);
if (!hp)
return(in);
bcopy(hp->h_addr, (char *)&in, sizeof(in));
return(in);
}
int
getportnum(char *port)
{
struct servent *s;
s = getservbyname(port, "tcp");
if (s == NULL)
return(-1);
return(s->s_port);
}
void
showlist(void)
{
ipscanstat_t ipsc, *ipscp = &ipsc;
ipscan_t isc;
if (ioctl(fd, SIOCGSCST, &ipscp) == -1)
perror("ioctl(SIOCGSCST)");
else if (opts & OPT_SHOWLIST) {
while (ipsc.iscs_list != NULL) {
if (kmemcpy((char *)&isc, (u_long)ipsc.iscs_list,
sizeof(isc)) == -1) {
perror("kmemcpy");
break;
} else {
printent(&isc);
ipsc.iscs_list = isc.ipsc_next;
}
}
} else {
printf("scan entries loaded\t%d\n", ipsc.iscs_entries);
printf("scan entries matches\t%ld\n", ipsc.iscs_acted);
printf("negative matches\t%ld\n", ipsc.iscs_else);
}
}
void
usage(char *prog)
{
fprintf(stderr, "Usage:\t%s [-dnrv] -f <filename>\n", prog);
fprintf(stderr, "\t%s [-dlv]\n", prog);
exit(1);
}
int
main(int argc, char *argv[])
{
FILE *fp = NULL;
int c;
(void) yysettab(yywords);
if (argc < 2)
usage(argv[0]);
while ((c = getopt(argc, argv, "df:lnrsv")) != -1)
switch (c)
{
case 'd' :
opts |= OPT_DEBUG;
yydebug++;
break;
case 'f' :
if (!strcmp(optarg, "-"))
fp = stdin;
else {
fp = fopen(optarg, "r");
if (!fp) {
perror("open");
exit(1);
}
}
yyin = fp;
break;
case 'l' :
opts |= OPT_SHOWLIST;
break;
case 'n' :
opts |= OPT_DONOTHING;
break;
case 'r' :
opts |= OPT_REMOVE;
break;
case 's' :
opts |= OPT_STAT;
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
}
if (!(opts & OPT_DONOTHING)) {
fd = open(IPL_SCAN, O_RDWR);
if (fd == -1) {
perror("open(IPL_SCAN)");
exit(1);
}
}
if (fp != NULL) {
yylineNum = 1;
while (!feof(fp))
yyparse();
fclose(fp);
exit(0);
}
if (opts & (OPT_SHOWLIST|OPT_STAT)) {
showlist();
exit(0);
}
exit(1);
}
diff --git a/sbin/ipf/ipsend/44arp.c b/sbin/ipf/ipsend/44arp.c
index e7a15b5d5cad..0a11c8732a12 100644
--- a/sbin/ipf/ipsend/44arp.c
+++ b/sbin/ipf/ipsend/44arp.c
@@ -1,116 +1,115 @@
-/* $FreeBSD$ */
/*
* Based upon 4.4BSD's /usr/sbin/arp
*/
#include <sys/param.h>
#include <sys/file.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/if_types.h>
# include <net/route.h>
#include <netinet/in.h>
#include <netinet/if_ether.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/ip_var.h>
#include <netinet/tcp.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <netdb.h>
#include <errno.h>
#include <nlist.h>
#include <stdio.h>
#include "ipsend.h"
#include "iplang/iplang.h"
/*
* lookup host and return
* its IP address in address
* (4 bytes)
*/
int resolve(char *host, char *address)
{
struct hostent *hp;
u_long add;
add = inet_addr(host);
if (add == -1)
{
if (!(hp = gethostbyname(host)))
{
fprintf(stderr, "unknown host: %s\n", host);
return (-1);
}
bcopy((char *)hp->h_addr, (char *)address, 4);
return (0);
}
bcopy((char*)&add, address, 4);
return (0);
}
int arp(char *addr, char *eaddr)
{
int mib[6];
size_t needed;
char *lim, *buf, *next;
struct rt_msghdr *rtm;
struct sockaddr_in *sin;
struct sockaddr_dl *sdl;
#ifdef IPSEND
if (arp_getipv4(addr, ether) == 0)
return (0);
#endif
if (!addr)
return (-1);
mib[0] = CTL_NET;
mib[1] = PF_ROUTE;
mib[2] = 0;
mib[3] = AF_INET;
mib[4] = NET_RT_FLAGS;
#ifdef RTF_LLINFO
mib[5] = RTF_LLINFO;
#else
mib[5] = 0;
#endif
if (sysctl(mib, 6, NULL, &needed, NULL, 0) == -1)
{
perror("route-sysctl-estimate");
exit(-1);
}
if ((buf = malloc(needed)) == NULL)
{
perror("malloc");
exit(-1);
}
if (sysctl(mib, 6, buf, &needed, NULL, 0) == -1)
{
perror("actual retrieval of routing table");
exit(-1);
}
lim = buf + needed;
for (next = buf; next < lim; next += rtm->rtm_msglen)
{
rtm = (struct rt_msghdr *)next;
sin = (struct sockaddr_in *)(rtm + 1);
sdl = (struct sockaddr_dl *)(sin + 1);
if (!bcmp(addr, (char *)&sin->sin_addr,
sizeof(struct in_addr)))
{
bcopy(LLADDR(sdl), eaddr, sdl->sdl_alen);
return (0);
}
}
return (-1);
}
diff --git a/sbin/ipf/ipsend/arp.c b/sbin/ipf/ipsend/arp.c
index 1d8f4213f246..1aed79aa500f 100644
--- a/sbin/ipf/ipsend/arp.c
+++ b/sbin/ipf/ipsend/arp.c
@@ -1,134 +1,133 @@
-/* $FreeBSD$ */
/*
* arp.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "@(#)arp.c 1.4 1/11/96 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/types.h>
#include <sys/socket.h>
# include <sys/sockio.h>
#include <sys/ioctl.h>
#include <netinet/in_systm.h>
#include <netinet/in.h>
#include <net/if.h>
#include <netinet/if_ether.h>
# include <net/if_arp.h>
#include <netinet/in.h>
#include <netinet/ip.h>
#include <netinet/ip_var.h>
#include <netinet/tcp.h>
#include <stdio.h>
#include <errno.h>
#include <netdb.h>
#include "ipsend.h"
#include "iplang/iplang.h"
/*
* lookup host and return
* its IP address in address
* (4 bytes)
*/
int resolve(char *host, char *address)
{
struct hostent *hp;
u_long add;
add = inet_addr(host);
if (add == -1)
{
if (!(hp = gethostbyname(host)))
{
fprintf(stderr, "unknown host: %s\n", host);
return (-1);
}
bcopy((char *)hp->h_addr, (char *)address, 4);
return (0);
}
bcopy((char*)&add, address, 4);
return (0);
}
/*
* ARP for the MAC address corresponding
* to the IP address. This taken from
* some BSD program, I cant remember which.
*/
int arp(ip, ether)
char *ip;
char *ether;
{
static int sfd = -1;
static char ethersave[6], ipsave[4];
struct arpreq ar;
struct sockaddr_in *sin, san;
struct hostent *hp;
int fd;
#ifdef IPSEND
if (arp_getipv4(ip, ether) == 0)
return (0);
#endif
if (!bcmp(ipsave, ip, 4)) {
bcopy(ethersave, ether, 6);
return (0);
}
fd = -1;
bzero((char *)&ar, sizeof(ar));
sin = (struct sockaddr_in *)&ar.arp_pa;
sin->sin_family = AF_INET;
bcopy(ip, (char *)&sin->sin_addr.s_addr, 4);
if ((hp = gethostbyaddr(ip, 4, AF_INET)))
# if SOLARIS && (SOLARIS2 >= 10)
if (!(ether_hostton(hp->h_name, (struct ether_addr *)ether)))
# else
if (!(ether_hostton(hp->h_name, ether)))
# endif
goto savearp;
if (sfd == -1)
if ((sfd = socket(AF_INET, SOCK_DGRAM, 0)) == -1)
{
perror("arp: socket");
return (-1);
}
tryagain:
if (ioctl(sfd, SIOCGARP, (caddr_t)&ar) == -1)
{
if (fd == -1)
{
bzero((char *)&san, sizeof(san));
san.sin_family = AF_INET;
san.sin_port = htons(1);
bcopy(ip, &san.sin_addr.s_addr, 4);
fd = socket(AF_INET, SOCK_DGRAM, 0);
(void) sendto(fd, ip, 4, 0,
(struct sockaddr *)&san, sizeof(san));
sleep(1);
(void) close(fd);
goto tryagain;
}
fprintf(stderr, "(%s):", inet_ntoa(sin->sin_addr));
if (errno != ENXIO)
perror("SIOCGARP");
return (-1);
}
if ((ar.arp_ha.sa_data[0] == 0) && (ar.arp_ha.sa_data[1] == 0) &&
(ar.arp_ha.sa_data[2] == 0) && (ar.arp_ha.sa_data[3] == 0) &&
(ar.arp_ha.sa_data[4] == 0) && (ar.arp_ha.sa_data[5] == 0)) {
fprintf(stderr, "(%s):", inet_ntoa(sin->sin_addr));
return (-1);
}
bcopy(ar.arp_ha.sa_data, ether, 6);
savearp:
bcopy(ether, ethersave, 6);
bcopy(ip, ipsave, 4);
return (0);
}
diff --git a/sbin/ipf/ipsend/dlcommon.c b/sbin/ipf/ipsend/dlcommon.c
index 86554660240d..a73f7df96d54 100644
--- a/sbin/ipf/ipsend/dlcommon.c
+++ b/sbin/ipf/ipsend/dlcommon.c
@@ -1,1283 +1,1282 @@
-/* $FreeBSD$ */
/*
* Common (shared) DLPI test routines.
* Mostly pretty boring boilerplate sorta stuff.
* These can be split into individual library routines later
* but it's just convenient to keep them in a single file
* while they're being developed.
*
* Not supported:
* Connection Oriented stuff
* QOS stuff
*/
/*
typedef unsigned long ulong;
*/
#include <sys/types.h>
#include <sys/stream.h>
#include <sys/stropts.h>
# include <sys/dlpi.h>
#include <sys/signal.h>
#include <stdio.h>
#include <string.h>
#include "dltest.h"
#define CASERET(s) case s: return ("s")
char *dlprim();
char *dlstate();
char *dlerrno();
char *dlpromisclevel();
char *dlservicemode();
char *dlstyle();
char *dlmactype();
void
dlinforeq(int fd)
{
dl_info_req_t info_req;
struct strbuf ctl;
int flags;
info_req.dl_primitive = DL_INFO_REQ;
ctl.maxlen = 0;
ctl.len = sizeof (info_req);
ctl.buf = (char *) &info_req;
flags = RS_HIPRI;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlinforeq: putmsg");
}
void
dlinfoack(int fd, char *bufp)
{
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
ctl.maxlen = MAXDLBUF;
ctl.len = 0;
ctl.buf = bufp;
strgetmsg(fd, &ctl, (struct strbuf*)NULL, &flags, "dlinfoack");
dlp = (union DL_primitives *) ctl.buf;
expecting(DL_INFO_ACK, dlp);
if (ctl.len < sizeof (dl_info_ack_t))
err("dlinfoack: response ctl.len too short: %d", ctl.len);
if (flags != RS_HIPRI)
err("dlinfoack: DL_INFO_ACK was not M_PCPROTO");
if (ctl.len < sizeof (dl_info_ack_t))
err("dlinfoack: short response ctl.len: %d", ctl.len);
}
void
dlattachreq(int fd, u_long ppa)
{
dl_attach_req_t attach_req;
struct strbuf ctl;
int flags;
attach_req.dl_primitive = DL_ATTACH_REQ;
attach_req.dl_ppa = ppa;
ctl.maxlen = 0;
ctl.len = sizeof (attach_req);
ctl.buf = (char *) &attach_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlattachreq: putmsg");
}
void
dlenabmultireq(int fd, char *addr, int length)
{
long buf[MAXDLBUF];
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
dlp = (union DL_primitives*) buf;
dlp->enabmulti_req.dl_primitive = DL_ENABMULTI_REQ;
dlp->enabmulti_req.dl_addr_length = length;
dlp->enabmulti_req.dl_addr_offset = sizeof (dl_enabmulti_req_t);
(void) memcpy((char*)OFFADDR(buf, sizeof (dl_enabmulti_req_t)), addr, length);
ctl.maxlen = 0;
ctl.len = sizeof (dl_enabmulti_req_t) + length;
ctl.buf = (char*) buf;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlenabmultireq: putmsg");
}
void
dldisabmultireq(int fd, char *addr, int length)
{
long buf[MAXDLBUF];
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
dlp = (union DL_primitives*) buf;
dlp->disabmulti_req.dl_primitive = DL_ENABMULTI_REQ;
dlp->disabmulti_req.dl_addr_length = length;
dlp->disabmulti_req.dl_addr_offset = sizeof (dl_disabmulti_req_t);
(void) memcpy((char*)OFFADDR(buf, sizeof (dl_disabmulti_req_t)), addr, length);
ctl.maxlen = 0;
ctl.len = sizeof (dl_disabmulti_req_t) + length;
ctl.buf = (char*) buf;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dldisabmultireq: putmsg");
}
void
dlpromisconreq(int fd, u_long level)
{
dl_promiscon_req_t promiscon_req;
struct strbuf ctl;
int flags;
promiscon_req.dl_primitive = DL_PROMISCON_REQ;
promiscon_req.dl_level = level;
ctl.maxlen = 0;
ctl.len = sizeof (promiscon_req);
ctl.buf = (char *) &promiscon_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlpromiscon: putmsg");
}
void
dlpromiscoff(int fd, u_long level)
{
dl_promiscoff_req_t promiscoff_req;
struct strbuf ctl;
int flags;
promiscoff_req.dl_primitive = DL_PROMISCOFF_REQ;
promiscoff_req.dl_level = level;
ctl.maxlen = 0;
ctl.len = sizeof (promiscoff_req);
ctl.buf = (char *) &promiscoff_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlpromiscoff: putmsg");
}
void
dlphysaddrreq(int fd, u_long addrtype)
{
dl_phys_addr_req_t phys_addr_req;
struct strbuf ctl;
int flags;
phys_addr_req.dl_primitive = DL_PHYS_ADDR_REQ;
phys_addr_req.dl_addr_type = addrtype;
ctl.maxlen = 0;
ctl.len = sizeof (phys_addr_req);
ctl.buf = (char *) &phys_addr_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlphysaddrreq: putmsg");
}
void
dlsetphysaddrreq(int fd, char *addr, int length)
{
long buf[MAXDLBUF];
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
dlp = (union DL_primitives*) buf;
dlp->set_physaddr_req.dl_primitive = DL_ENABMULTI_REQ;
dlp->set_physaddr_req.dl_addr_length = length;
dlp->set_physaddr_req.dl_addr_offset = sizeof (dl_set_phys_addr_req_t);
(void) memcpy((char*)OFFADDR(buf, sizeof (dl_set_phys_addr_req_t)), addr, length);
ctl.maxlen = 0;
ctl.len = sizeof (dl_set_phys_addr_req_t) + length;
ctl.buf = (char*) buf;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlsetphysaddrreq: putmsg");
}
void
dldetachreq(int fd)
{
dl_detach_req_t detach_req;
struct strbuf ctl;
int flags;
detach_req.dl_primitive = DL_DETACH_REQ;
ctl.maxlen = 0;
ctl.len = sizeof (detach_req);
ctl.buf = (char *) &detach_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dldetachreq: putmsg");
}
void
dlbindreq(int fd, u_long sap, u_long max_conind, u_long service_mode,
u_long conn_mgmt, u_long xidtest)
{
dl_bind_req_t bind_req;
struct strbuf ctl;
int flags;
bind_req.dl_primitive = DL_BIND_REQ;
bind_req.dl_sap = sap;
bind_req.dl_max_conind = max_conind;
bind_req.dl_service_mode = service_mode;
bind_req.dl_conn_mgmt = conn_mgmt;
bind_req.dl_xidtest_flg = xidtest;
ctl.maxlen = 0;
ctl.len = sizeof (bind_req);
ctl.buf = (char *) &bind_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlbindreq: putmsg");
}
void
dlunitdatareq(int fd, u_char *addrp, int addrlen, u_long minpri,
u_long maxpri, u_char *datap, int datalen)
{
long buf[MAXDLBUF];
union DL_primitives *dlp;
struct strbuf data, ctl;
dlp = (union DL_primitives*) buf;
dlp->unitdata_req.dl_primitive = DL_UNITDATA_REQ;
dlp->unitdata_req.dl_dest_addr_length = addrlen;
dlp->unitdata_req.dl_dest_addr_offset = sizeof (dl_unitdata_req_t);
dlp->unitdata_req.dl_priority.dl_min = minpri;
dlp->unitdata_req.dl_priority.dl_max = maxpri;
(void) memcpy(OFFADDR(dlp, sizeof (dl_unitdata_req_t)), addrp, addrlen);
ctl.maxlen = 0;
ctl.len = sizeof (dl_unitdata_req_t) + addrlen;
ctl.buf = (char *) buf;
data.maxlen = 0;
data.len = datalen;
data.buf = (char *) datap;
if (putmsg(fd, &ctl, &data, 0) < 0)
syserr("dlunitdatareq: putmsg");
}
void
dlunbindreq(int fd)
{
dl_unbind_req_t unbind_req;
struct strbuf ctl;
int flags;
unbind_req.dl_primitive = DL_UNBIND_REQ;
ctl.maxlen = 0;
ctl.len = sizeof (unbind_req);
ctl.buf = (char *) &unbind_req;
flags = 0;
if (putmsg(fd, &ctl, (struct strbuf*) NULL, flags) < 0)
syserr("dlunbindreq: putmsg");
}
void
dlokack(int fd, char *bufp)
{
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
ctl.maxlen = MAXDLBUF;
ctl.len = 0;
ctl.buf = bufp;
strgetmsg(fd, &ctl, (struct strbuf*)NULL, &flags, "dlokack");
dlp = (union DL_primitives *) ctl.buf;
expecting(DL_OK_ACK, dlp);
if (ctl.len < sizeof (dl_ok_ack_t))
err("dlokack: response ctl.len too short: %d", ctl.len);
if (flags != RS_HIPRI)
err("dlokack: DL_OK_ACK was not M_PCPROTO");
if (ctl.len < sizeof (dl_ok_ack_t))
err("dlokack: short response ctl.len: %d", ctl.len);
}
void
dlerrorack(int fd, char *bufp)
{
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
ctl.maxlen = MAXDLBUF;
ctl.len = 0;
ctl.buf = bufp;
strgetmsg(fd, &ctl, (struct strbuf*)NULL, &flags, "dlerrorack");
dlp = (union DL_primitives *) ctl.buf;
expecting(DL_ERROR_ACK, dlp);
if (ctl.len < sizeof (dl_error_ack_t))
err("dlerrorack: response ctl.len too short: %d", ctl.len);
if (flags != RS_HIPRI)
err("dlerrorack: DL_OK_ACK was not M_PCPROTO");
if (ctl.len < sizeof (dl_error_ack_t))
err("dlerrorack: short response ctl.len: %d", ctl.len);
}
void
dlbindack(int fd, char *bufp)
{
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
ctl.maxlen = MAXDLBUF;
ctl.len = 0;
ctl.buf = bufp;
strgetmsg(fd, &ctl, (struct strbuf*)NULL, &flags, "dlbindack");
dlp = (union DL_primitives *) ctl.buf;
expecting(DL_BIND_ACK, dlp);
if (flags != RS_HIPRI)
err("dlbindack: DL_OK_ACK was not M_PCPROTO");
if (ctl.len < sizeof (dl_bind_ack_t))
err("dlbindack: short response ctl.len: %d", ctl.len);
}
void
dlphysaddrack(int fd, char *bufp)
{
union DL_primitives *dlp;
struct strbuf ctl;
int flags;
ctl.maxlen = MAXDLBUF;
ctl.len = 0;
ctl.buf = bufp;
strgetmsg(fd, &ctl, (struct strbuf*)NULL, &flags, "dlphysaddrack");
dlp = (union DL_primitives *) ctl.buf;
expecting(DL_PHYS_ADDR_ACK, dlp);
if (flags != RS_HIPRI)
err("dlbindack: DL_OK_ACK was not M_PCPROTO");
if (ctl.len < sizeof (dl_phys_addr_ack_t))
err("dlphysaddrack: short response ctl.len: %d", ctl.len);
}
void
sigalrm(void)
{
(void) err("sigalrm: TIMEOUT");
}
strgetmsg(int fd, struct strbuf *ctlp, struct strbuf *datap, int *flagsp,
char *caller)
{
int rc;
static char errmsg[80];
/*
* Start timer.
*/
(void) signal(SIGALRM, sigalrm);
if (alarm(MAXWAIT) < 0) {
(void) snprintf(errmsg, sizeof(errmsg), "%s: alarm", caller);
syserr(errmsg);
}
/*
* Set flags argument and issue getmsg().
*/
*flagsp = 0;
if ((rc = getmsg(fd, ctlp, datap, flagsp)) < 0) {
(void) snprintf(errmsg, sizeof(errmsg), "%s: getmsg", caller);
syserr(errmsg);
}
/*
* Stop timer.
*/
if (alarm(0) < 0) {
(void) snprintf(errmsg, sizeof(errmsg), "%s: alarm", caller);
syserr(errmsg);
}
/*
* Check for MOREDATA and/or MORECTL.
*/
if ((rc & (MORECTL | MOREDATA)) == (MORECTL | MOREDATA))
err("%s: MORECTL|MOREDATA", caller);
if (rc & MORECTL)
err("%s: MORECTL", caller);
if (rc & MOREDATA)
err("%s: MOREDATA", caller);
/*
* Check for at least sizeof (long) control data portion.
*/
if (ctlp->len < sizeof (long))
err("getmsg: control portion length < sizeof (long): %d", ctlp->len);
}
expecting(int prim, union DL_primitives *dlp)
{
if (dlp->dl_primitive != (u_long)prim) {
printdlprim(dlp);
err("expected %s got %s", dlprim(prim),
dlprim(dlp->dl_primitive));
exit(1);
}
}
/*
* Print any DLPI msg in human readable format.
*/
printdlprim(union DL_primitives *dlp)
{
switch (dlp->dl_primitive) {
case DL_INFO_REQ:
printdlinforeq(dlp);
break;
case DL_INFO_ACK:
printdlinfoack(dlp);
break;
case DL_ATTACH_REQ:
printdlattachreq(dlp);
break;
case DL_OK_ACK:
printdlokack(dlp);
break;
case DL_ERROR_ACK:
printdlerrorack(dlp);
break;
case DL_DETACH_REQ:
printdldetachreq(dlp);
break;
case DL_BIND_REQ:
printdlbindreq(dlp);
break;
case DL_BIND_ACK:
printdlbindack(dlp);
break;
case DL_UNBIND_REQ:
printdlunbindreq(dlp);
break;
case DL_SUBS_BIND_REQ:
printdlsubsbindreq(dlp);
break;
case DL_SUBS_BIND_ACK:
printdlsubsbindack(dlp);
break;
case DL_SUBS_UNBIND_REQ:
printdlsubsunbindreq(dlp);
break;
case DL_ENABMULTI_REQ:
printdlenabmultireq(dlp);
break;
case DL_DISABMULTI_REQ:
printdldisabmultireq(dlp);
break;
case DL_PROMISCON_REQ:
printdlpromisconreq(dlp);
break;
case DL_PROMISCOFF_REQ:
printdlpromiscoffreq(dlp);
break;
case DL_UNITDATA_REQ:
printdlunitdatareq(dlp);
break;
case DL_UNITDATA_IND:
printdlunitdataind(dlp);
break;
case DL_UDERROR_IND:
printdluderrorind(dlp);
break;
case DL_UDQOS_REQ:
printdludqosreq(dlp);
break;
case DL_PHYS_ADDR_REQ:
printdlphysaddrreq(dlp);
break;
case DL_PHYS_ADDR_ACK:
printdlphysaddrack(dlp);
break;
case DL_SET_PHYS_ADDR_REQ:
printdlsetphysaddrreq(dlp);
break;
default:
err("printdlprim: unknown primitive type 0x%x",
dlp->dl_primitive);
break;
}
}
/* ARGSUSED */
printdlinforeq(union DL_primitives *dlp)
{
(void) printf("DL_INFO_REQ\n");
}
printdlinfoack(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
u_char brdcst[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->info_ack.dl_addr_offset),
dlp->info_ack.dl_addr_length, addr);
addrtostring(OFFADDR(dlp, dlp->info_ack.dl_brdcst_addr_offset),
dlp->info_ack.dl_brdcst_addr_length, brdcst);
(void) printf("DL_INFO_ACK: max_sdu %d min_sdu %d\n",
dlp->info_ack.dl_max_sdu,
dlp->info_ack.dl_min_sdu);
(void) printf("addr_length %d mac_type %s current_state %s\n",
dlp->info_ack.dl_addr_length,
dlmactype(dlp->info_ack.dl_mac_type),
dlstate(dlp->info_ack.dl_current_state));
(void) printf("sap_length %d service_mode %s qos_length %d\n",
dlp->info_ack.dl_sap_length,
dlservicemode(dlp->info_ack.dl_service_mode),
dlp->info_ack.dl_qos_length);
(void) printf("qos_offset %d qos_range_length %d qos_range_offset %d\n",
dlp->info_ack.dl_qos_offset,
dlp->info_ack.dl_qos_range_length,
dlp->info_ack.dl_qos_range_offset);
(void) printf("provider_style %s addr_offset %d version %d\n",
dlstyle(dlp->info_ack.dl_provider_style),
dlp->info_ack.dl_addr_offset,
dlp->info_ack.dl_version);
(void) printf("brdcst_addr_length %d brdcst_addr_offset %d\n",
dlp->info_ack.dl_brdcst_addr_length,
dlp->info_ack.dl_brdcst_addr_offset);
(void) printf("addr %s\n", addr);
(void) printf("brdcst_addr %s\n", brdcst);
}
printdlattachreq(union DL_primitives *dlp)
{
(void) printf("DL_ATTACH_REQ: ppa %d\n",
dlp->attach_req.dl_ppa);
}
printdlokack(union DL_primitives* dlp)
union DL_primitives *dlp;
{
(void) printf("DL_OK_ACK: correct_primitive %s\n",
dlprim(dlp->ok_ack.dl_correct_primitive));
}
printdlerrorack(union DL_primitives *dlp)
{
(void) printf("DL_ERROR_ACK: error_primitive %s errno %s unix_errno %d: %s\n",
dlprim(dlp->error_ack.dl_error_primitive),
dlerrno(dlp->error_ack.dl_errno),
dlp->error_ack.dl_unix_errno,
strerror(dlp->error_ack.dl_unix_errno));
}
printdlenabmultireq(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->enabmulti_req.dl_addr_offset),
dlp->enabmulti_req.dl_addr_length, addr);
(void) printf("DL_ENABMULTI_REQ: addr_length %d addr_offset %d\n",
dlp->enabmulti_req.dl_addr_length,
dlp->enabmulti_req.dl_addr_offset);
(void) printf("addr %s\n", addr);
}
printdldisabmultireq(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->disabmulti_req.dl_addr_offset),
dlp->disabmulti_req.dl_addr_length, addr);
(void) printf("DL_DISABMULTI_REQ: addr_length %d addr_offset %d\n",
dlp->disabmulti_req.dl_addr_length,
dlp->disabmulti_req.dl_addr_offset);
(void) printf("addr %s\n", addr);
}
printdlpromisconreq(union DL_primitives *dlp)
{
(void) printf("DL_PROMISCON_REQ: level %s\n",
dlpromisclevel(dlp->promiscon_req.dl_level));
}
printdlpromiscoffreq(union DL_primitives *dlp)
{
(void) printf("DL_PROMISCOFF_REQ: level %s\n",
dlpromisclevel(dlp->promiscoff_req.dl_level));
}
printdlphysaddrreq(union DL_primitives *dlp)
{
(void) printf("DL_PHYS_ADDR_REQ: addr_type 0x%x\n",
dlp->physaddr_req.dl_addr_type);
}
printdlphysaddrack(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->physaddr_ack.dl_addr_offset),
dlp->physaddr_ack.dl_addr_length, addr);
(void) printf("DL_PHYS_ADDR_ACK: addr_length %d addr_offset %d\n",
dlp->physaddr_ack.dl_addr_length,
dlp->physaddr_ack.dl_addr_offset);
(void) printf("addr %s\n", addr);
}
printdlsetphysaddrreq(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->set_physaddr_req.dl_addr_offset),
dlp->set_physaddr_req.dl_addr_length, addr);
(void) printf("DL_SET_PHYS_ADDR_REQ: addr_length %d addr_offset %d\n",
dlp->set_physaddr_req.dl_addr_length,
dlp->set_physaddr_req.dl_addr_offset);
(void) printf("addr %s\n", addr);
}
/* ARGSUSED */
printdldetachreq(union DL_primitives *dlp)
{
(void) printf("DL_DETACH_REQ\n");
}
printdlbindreq(union DL_primitives *dlp)
{
(void) printf("DL_BIND_REQ: sap %d max_conind %d\n",
dlp->bind_req.dl_sap,
dlp->bind_req.dl_max_conind);
(void) printf("service_mode %s conn_mgmt %d xidtest_flg 0x%x\n",
dlservicemode(dlp->bind_req.dl_service_mode),
dlp->bind_req.dl_conn_mgmt,
dlp->bind_req.dl_xidtest_flg);
}
printdlbindack(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->bind_ack.dl_addr_offset),
dlp->bind_ack.dl_addr_length, addr);
(void) printf("DL_BIND_ACK: sap %d addr_length %d addr_offset %d\n",
dlp->bind_ack.dl_sap,
dlp->bind_ack.dl_addr_length,
dlp->bind_ack.dl_addr_offset);
(void) printf("max_conind %d xidtest_flg 0x%x\n",
dlp->bind_ack.dl_max_conind,
dlp->bind_ack.dl_xidtest_flg);
(void) printf("addr %s\n", addr);
}
/* ARGSUSED */
printdlunbindreq(union DL_primitives *dlp)
{
(void) printf("DL_UNBIND_REQ\n");
}
printdlsubsbindreq(union DL_primitives *dlp)
{
u_char sap[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->subs_bind_req.dl_subs_sap_offset),
dlp->subs_bind_req.dl_subs_sap_length, sap);
(void) printf("DL_SUBS_BIND_REQ: subs_sap_offset %d sub_sap_len %d\n",
dlp->subs_bind_req.dl_subs_sap_offset,
dlp->subs_bind_req.dl_subs_sap_length);
(void) printf("sap %s\n", sap);
}
printdlsubsbindack(union DL_primitives *dlp)
{
u_char sap[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->subs_bind_ack.dl_subs_sap_offset),
dlp->subs_bind_ack.dl_subs_sap_length, sap);
(void) printf("DL_SUBS_BIND_ACK: subs_sap_offset %d sub_sap_length %d\n",
dlp->subs_bind_ack.dl_subs_sap_offset,
dlp->subs_bind_ack.dl_subs_sap_length);
(void) printf("sap %s\n", sap);
}
printdlsubsunbindreq(union DL_primitives *dlp)
{
u_char sap[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->subs_unbind_req.dl_subs_sap_offset),
dlp->subs_unbind_req.dl_subs_sap_length, sap);
(void) printf("DL_SUBS_UNBIND_REQ: subs_sap_offset %d sub_sap_length %d\n",
dlp->subs_unbind_req.dl_subs_sap_offset,
dlp->subs_unbind_req.dl_subs_sap_length);
(void) printf("sap %s\n", sap);
}
printdlunitdatareq(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->unitdata_req.dl_dest_addr_offset),
dlp->unitdata_req.dl_dest_addr_length, addr);
(void) printf("DL_UNITDATA_REQ: dest_addr_length %d dest_addr_offset %d\n",
dlp->unitdata_req.dl_dest_addr_length,
dlp->unitdata_req.dl_dest_addr_offset);
(void) printf("dl_priority.min %d dl_priority.max %d\n",
dlp->unitdata_req.dl_priority.dl_min,
dlp->unitdata_req.dl_priority.dl_max);
(void) printf("addr %s\n", addr);
}
printdlunitdataind(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
u_char src[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->unitdata_ind.dl_dest_addr_offset),
dlp->unitdata_ind.dl_dest_addr_length, dest);
addrtostring(OFFADDR(dlp, dlp->unitdata_ind.dl_src_addr_offset),
dlp->unitdata_ind.dl_src_addr_length, src);
(void) printf("DL_UNITDATA_IND: dest_addr_length %d dest_addr_offset %d\n",
dlp->unitdata_ind.dl_dest_addr_length,
dlp->unitdata_ind.dl_dest_addr_offset);
(void) printf("src_addr_length %d src_addr_offset %d\n",
dlp->unitdata_ind.dl_src_addr_length,
dlp->unitdata_ind.dl_src_addr_offset);
(void) printf("group_address 0x%x\n",
dlp->unitdata_ind.dl_group_address);
(void) printf("dest %s\n", dest);
(void) printf("src %s\n", src);
}
printdluderrorind(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->uderror_ind.dl_dest_addr_offset),
dlp->uderror_ind.dl_dest_addr_length, addr);
(void) printf("DL_UDERROR_IND: dest_addr_length %d dest_addr_offset %d\n",
dlp->uderror_ind.dl_dest_addr_length,
dlp->uderror_ind.dl_dest_addr_offset);
(void) printf("unix_errno %d errno %s\n",
dlp->uderror_ind.dl_unix_errno,
dlerrno(dlp->uderror_ind.dl_errno));
(void) printf("addr %s\n", addr);
}
printdltestreq(union DL_primitives *dlp)
{
u_char addr[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->test_req.dl_dest_addr_offset),
dlp->test_req.dl_dest_addr_length, addr);
(void) printf("DL_TEST_REQ: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->test_req.dl_flag,
dlp->test_req.dl_dest_addr_length,
dlp->test_req.dl_dest_addr_offset);
(void) printf("dest_addr %s\n", addr);
}
printdltestind(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
u_char src[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->test_ind.dl_dest_addr_offset),
dlp->test_ind.dl_dest_addr_length, dest);
addrtostring(OFFADDR(dlp, dlp->test_ind.dl_src_addr_offset),
dlp->test_ind.dl_src_addr_length, src);
(void) printf("DL_TEST_IND: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->test_ind.dl_flag,
dlp->test_ind.dl_dest_addr_length,
dlp->test_ind.dl_dest_addr_offset);
(void) printf("src_addr_length %d src_addr_offset %d\n",
dlp->test_ind.dl_src_addr_length,
dlp->test_ind.dl_src_addr_offset);
(void) printf("dest_addr %s\n", dest);
(void) printf("src_addr %s\n", src);
}
printdltestres(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->test_res.dl_dest_addr_offset),
dlp->test_res.dl_dest_addr_length, dest);
(void) printf("DL_TEST_RES: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->test_res.dl_flag,
dlp->test_res.dl_dest_addr_length,
dlp->test_res.dl_dest_addr_offset);
(void) printf("dest_addr %s\n", dest);
}
printdltestcon(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
u_char src[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->test_con.dl_dest_addr_offset),
dlp->test_con.dl_dest_addr_length, dest);
addrtostring(OFFADDR(dlp, dlp->test_con.dl_src_addr_offset),
dlp->test_con.dl_src_addr_length, src);
(void) printf("DL_TEST_CON: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->test_con.dl_flag,
dlp->test_con.dl_dest_addr_length,
dlp->test_con.dl_dest_addr_offset);
(void) printf("src_addr_length %d src_addr_offset %d\n",
dlp->test_con.dl_src_addr_length,
dlp->test_con.dl_src_addr_offset);
(void) printf("dest_addr %s\n", dest);
(void) printf("src_addr %s\n", src);
}
printdlxidreq(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->xid_req.dl_dest_addr_offset),
dlp->xid_req.dl_dest_addr_length, dest);
(void) printf("DL_XID_REQ: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->xid_req.dl_flag,
dlp->xid_req.dl_dest_addr_length,
dlp->xid_req.dl_dest_addr_offset);
(void) printf("dest_addr %s\n", dest);
}
printdlxidind(dlpunion DL_primitives *)
{
u_char dest[MAXDLADDR];
u_char src[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->xid_ind.dl_dest_addr_offset),
dlp->xid_ind.dl_dest_addr_length, dest);
addrtostring(OFFADDR(dlp, dlp->xid_ind.dl_src_addr_offset),
dlp->xid_ind.dl_src_addr_length, src);
(void) printf("DL_XID_IND: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->xid_ind.dl_flag,
dlp->xid_ind.dl_dest_addr_length,
dlp->xid_ind.dl_dest_addr_offset);
(void) printf("src_addr_length %d src_addr_offset %d\n",
dlp->xid_ind.dl_src_addr_length,
dlp->xid_ind.dl_src_addr_offset);
(void) printf("dest_addr %s\n", dest);
(void) printf("src_addr %s\n", src);
}
printdlxidres(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->xid_res.dl_dest_addr_offset),
dlp->xid_res.dl_dest_addr_length, dest);
(void) printf("DL_XID_RES: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->xid_res.dl_flag,
dlp->xid_res.dl_dest_addr_length,
dlp->xid_res.dl_dest_addr_offset);
(void) printf("dest_addr %s\n", dest);
}
printdlxidcon(union DL_primitives *dlp)
{
u_char dest[MAXDLADDR];
u_char src[MAXDLADDR];
addrtostring(OFFADDR(dlp, dlp->xid_con.dl_dest_addr_offset),
dlp->xid_con.dl_dest_addr_length, dest);
addrtostring(OFFADDR(dlp, dlp->xid_con.dl_src_addr_offset),
dlp->xid_con.dl_src_addr_length, src);
(void) printf("DL_XID_CON: flag 0x%x dest_addr_length %d dest_addr_offset %d\n",
dlp->xid_con.dl_flag,
dlp->xid_con.dl_dest_addr_length,
dlp->xid_con.dl_dest_addr_offset);
(void) printf("src_addr_length %d src_addr_offset %d\n",
dlp->xid_con.dl_src_addr_length,
dlp->xid_con.dl_src_addr_offset);
(void) printf("dest_addr %s\n", dest);
(void) printf("src_addr %s\n", src);
}
printdludqosreq(union DL_primitives *dlp)
{
(void) printf("DL_UDQOS_REQ: qos_length %d qos_offset %d\n",
dlp->udqos_req.dl_qos_length,
dlp->udqos_req.dl_qos_offset);
}
/*
* Return string.
*/
addrtostring(u_char *addr, u_long length, u_char *s)
{
int i;
for (i = 0; i < length; i++) {
(void) sprintf((char*) s, "%x:", addr[i] & 0xff);
s = s + strlen((char*)s);
}
if (length)
*(--s) = '\0';
}
/*
* Return length
*/
stringtoaddr(char *sp, char *addr)
{
int n = 0;
char *p;
int val;
p = sp;
while (p = strtok(p, ":")) {
if (sscanf(p, "%x", &val) != 1)
err("stringtoaddr: invalid input string: %s", sp);
if (val > 0xff)
err("stringtoaddr: invalid input string: %s", sp);
*addr++ = val;
n++;
p = NULL;
}
return (n);
}
static char
hexnibble(char c)
{
static char hextab[] = {
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
'a', 'b', 'c', 'd', 'e', 'f'
};
return (hextab[c & 0x0f]);
}
char*
dlprim(u_long prim)
{
static char primbuf[80];
switch ((int)prim) {
CASERET(DL_INFO_REQ);
CASERET(DL_INFO_ACK);
CASERET(DL_ATTACH_REQ);
CASERET(DL_DETACH_REQ);
CASERET(DL_BIND_REQ);
CASERET(DL_BIND_ACK);
CASERET(DL_UNBIND_REQ);
CASERET(DL_OK_ACK);
CASERET(DL_ERROR_ACK);
CASERET(DL_SUBS_BIND_REQ);
CASERET(DL_SUBS_BIND_ACK);
CASERET(DL_UNITDATA_REQ);
CASERET(DL_UNITDATA_IND);
CASERET(DL_UDERROR_IND);
CASERET(DL_UDQOS_REQ);
CASERET(DL_CONNECT_REQ);
CASERET(DL_CONNECT_IND);
CASERET(DL_CONNECT_RES);
CASERET(DL_CONNECT_CON);
CASERET(DL_TOKEN_REQ);
CASERET(DL_TOKEN_ACK);
CASERET(DL_DISCONNECT_REQ);
CASERET(DL_DISCONNECT_IND);
CASERET(DL_RESET_REQ);
CASERET(DL_RESET_IND);
CASERET(DL_RESET_RES);
CASERET(DL_RESET_CON);
default:
(void) snprintf(primbuf, sizeof(primbuf), "unknown primitive 0x%x", prim);
return (primbuf);
}
}
char*
dlstate(u_long state)
{
static char statebuf[80];
switch (state) {
CASERET(DL_UNATTACHED);
CASERET(DL_ATTACH_PENDING);
CASERET(DL_DETACH_PENDING);
CASERET(DL_UNBOUND);
CASERET(DL_BIND_PENDING);
CASERET(DL_UNBIND_PENDING);
CASERET(DL_IDLE);
CASERET(DL_UDQOS_PENDING);
CASERET(DL_OUTCON_PENDING);
CASERET(DL_INCON_PENDING);
CASERET(DL_CONN_RES_PENDING);
CASERET(DL_DATAXFER);
CASERET(DL_USER_RESET_PENDING);
CASERET(DL_PROV_RESET_PENDING);
CASERET(DL_RESET_RES_PENDING);
CASERET(DL_DISCON8_PENDING);
CASERET(DL_DISCON9_PENDING);
CASERET(DL_DISCON11_PENDING);
CASERET(DL_DISCON12_PENDING);
CASERET(DL_DISCON13_PENDING);
CASERET(DL_SUBS_BIND_PND);
default:
(void) snprintf(statebuf, sizeof(statebuf), "unknown state 0x%x", state);
return (statebuf);
}
}
char*
dlerrno(u_long errno)
{
static char errnobuf[80];
switch (errno) {
CASERET(DL_ACCESS);
CASERET(DL_BADADDR);
CASERET(DL_BADCORR);
CASERET(DL_BADDATA);
CASERET(DL_BADPPA);
CASERET(DL_BADPRIM);
CASERET(DL_BADQOSPARAM);
CASERET(DL_BADQOSTYPE);
CASERET(DL_BADSAP);
CASERET(DL_BADTOKEN);
CASERET(DL_BOUND);
CASERET(DL_INITFAILED);
CASERET(DL_NOADDR);
CASERET(DL_NOTINIT);
CASERET(DL_OUTSTATE);
CASERET(DL_SYSERR);
CASERET(DL_UNSUPPORTED);
CASERET(DL_UNDELIVERABLE);
CASERET(DL_NOTSUPPORTED);
CASERET(DL_TOOMANY);
CASERET(DL_NOTENAB);
CASERET(DL_BUSY);
CASERET(DL_NOAUTO);
CASERET(DL_NOXIDAUTO);
CASERET(DL_NOTESTAUTO);
CASERET(DL_XIDAUTO);
CASERET(DL_TESTAUTO);
CASERET(DL_PENDING);
default:
(void) snprintf(errnobuf, sizeof(errnobuf), "unknown dlpi errno 0x%x", errno);
return (errnobuf);
}
}
char*
dlpromisclevel(u_long level)
{
static char levelbuf[80];
switch (level) {
CASERET(DL_PROMISC_PHYS);
CASERET(DL_PROMISC_SAP);
CASERET(DL_PROMISC_MULTI);
default:
(void) snprintf(levelbuf, sizeof(levelbuf), "unknown promisc level 0x%x", level);
return (levelbuf);
}
}
char*
dlservicemode(u_long servicemode)
{
static char servicemodebuf[80];
switch (servicemode) {
CASERET(DL_CODLS);
CASERET(DL_CLDLS);
CASERET(DL_CODLS|DL_CLDLS);
default:
(void) snprintf(servicemodebuf, sizeof(servicemodebuf),
"unknown provider service mode 0x%x", servicemode);
return (servicemodebuf);
}
}
char*
dlstyle(long style)
{
static char stylebuf[80];
switch (style) {
CASERET(DL_STYLE1);
CASERET(DL_STYLE2);
default:
(void) snprintf(stylebuf, sizeof(stylebuf), "unknown provider style 0x%x", style);
return (stylebuf);
}
}
char*
dlmactype(u_long media)
{
static char mediabuf[80];
switch (media) {
CASERET(DL_CSMACD);
CASERET(DL_TPB);
CASERET(DL_TPR);
CASERET(DL_METRO);
CASERET(DL_ETHER);
CASERET(DL_HDLC);
CASERET(DL_CHAR);
CASERET(DL_CTCA);
default:
(void) snprintf(mediabuf, sizeof(mediabuf), "unknown media type 0x%x", media);
return (mediabuf);
}
}
/*VARARGS1*/
err(char *fmt, char *a1, char *a2, char *a3, char *a4)
{
(void) fprintf(stderr, fmt, a1, a2, a3, a4);
(void) fprintf(stderr, "\n");
(void) exit(1);
}
syserr(char *s)
char *s;
{
(void) perror(s);
exit(1);
}
strioctl(int fd, int cmd, int timout, int len, char *dp)
{
struct strioctl sioc;
int rc;
sioc.ic_cmd = cmd;
sioc.ic_timout = timout;
sioc.ic_len = len;
sioc.ic_dp = dp;
rc = ioctl(fd, I_STR, &sioc);
if (rc < 0)
return (rc);
else
return (sioc.ic_len);
}
diff --git a/sbin/ipf/ipsend/dltest.h b/sbin/ipf/ipsend/dltest.h
index 086782c1fbb7..fe6e33735849 100644
--- a/sbin/ipf/ipsend/dltest.h
+++ b/sbin/ipf/ipsend/dltest.h
@@ -1,34 +1,33 @@
-/* $FreeBSD$ */
/*
* Common DLPI Test Suite header file
*
*/
/*
* Maximum control/data buffer size (in long's !!) for getmsg().
*/
#define MAXDLBUF 8192
/*
* Maximum number of seconds we'll wait for any
* particular DLPI acknowledgment from the provider
* after issuing a request.
*/
#define MAXWAIT 15
/*
* Maximum address buffer length.
*/
#define MAXDLADDR 1024
/*
* Handy macro.
*/
#define OFFADDR(s, n) (u_char*)((char*)(s) + (int)(n))
/*
* externs go here
*/
extern void sigalrm();
diff --git a/sbin/ipf/ipsend/ip.c b/sbin/ipf/ipsend/ip.c
index 7c623103b901..14197c382260 100644
--- a/sbin/ipf/ipsend/ip.c
+++ b/sbin/ipf/ipsend/ip.c
@@ -1,351 +1,350 @@
-/* $FreeBSD$ */
/*
* ip.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "%W% %G% (C)1995";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <netinet/in_systm.h>
#include <sys/socket.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/ip.h>
#include <sys/param.h>
# include <net/route.h>
# include <netinet/if_ether.h>
# include <netinet/ip_var.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include "ipsend.h"
static char *ipbuf = NULL, *ethbuf = NULL;
u_short
chksum(u_short *buf, int len)
{
u_long sum = 0;
int nwords = len >> 1;
for(; nwords > 0; nwords--)
sum += *buf++;
sum = (sum>>16) + (sum & 0xffff);
sum += (sum >>16);
return (~sum);
}
int
send_ether(int nfd, char *buf, int len, struct in_addr gwip)
{
static struct in_addr last_gw;
static char last_arp[6] = { 0, 0, 0, 0, 0, 0};
ether_header_t *eh;
char *s;
int err;
if (!ethbuf)
ethbuf = (char *)calloc(1, 65536+1024);
s = ethbuf;
eh = (ether_header_t *)s;
bcopy((char *)buf, s + sizeof(*eh), len);
if (gwip.s_addr == last_gw.s_addr)
{
bcopy(last_arp, (char *) &eh->ether_dhost, 6);
}
else if (arp((char *)&gwip, (char *) &eh->ether_dhost) == -1)
{
perror("arp");
return (-2);
}
eh->ether_type = htons(ETHERTYPE_IP);
last_gw.s_addr = gwip.s_addr;
err = sendip(nfd, s, sizeof(*eh) + len);
return (err);
}
/*
*/
int
send_ip(int nfd, int mtu, ip_t *ip, struct in_addr gwip, int frag)
{
static struct in_addr last_gw, local_ip;
static char local_arp[6] = { 0, 0, 0, 0, 0, 0};
static char last_arp[6] = { 0, 0, 0, 0, 0, 0};
static u_short id = 0;
ether_header_t *eh;
ip_t ipsv;
int err, iplen;
if (!ipbuf)
{
ipbuf = (char *)malloc(65536);
if (!ipbuf)
{
perror("malloc failed");
return (-2);
}
}
eh = (ether_header_t *)ipbuf;
bzero((char *) &eh->ether_shost, sizeof(eh->ether_shost));
if (last_gw.s_addr && (gwip.s_addr == last_gw.s_addr))
{
bcopy(last_arp, (char *) &eh->ether_dhost, 6);
}
else if (arp((char *)&gwip, (char *) &eh->ether_dhost) == -1)
{
perror("arp");
return (-2);
}
bcopy((char *) &eh->ether_dhost, last_arp, sizeof(last_arp));
eh->ether_type = htons(ETHERTYPE_IP);
bcopy((char *)ip, (char *)&ipsv, sizeof(*ip));
last_gw.s_addr = gwip.s_addr;
iplen = ip->ip_len;
ip->ip_len = htons(iplen);
if (!(frag & 2)) {
if (!IP_V(ip))
IP_V_A(ip, IPVERSION);
if (!ip->ip_id)
ip->ip_id = htons(id++);
if (!ip->ip_ttl)
ip->ip_ttl = 60;
}
if (ip->ip_src.s_addr != local_ip.s_addr) {
(void) arp((char *)&ip->ip_src, (char *) &local_arp);
bcopy(local_arp, (char *) &eh->ether_shost,sizeof(last_arp));
local_ip = ip->ip_src;
} else
bcopy(local_arp, (char *) &eh->ether_shost, 6);
if (!frag || (sizeof(*eh) + iplen < mtu))
{
ip->ip_sum = 0;
ip->ip_sum = chksum((u_short *)ip, IP_HL(ip) << 2);
bcopy((char *)ip, ipbuf + sizeof(*eh), iplen);
err = sendip(nfd, ipbuf, sizeof(*eh) + iplen);
}
else
{
/*
* Actually, this is bogus because we're putting all IP
* options in every packet, which isn't always what should be
* done. Will do for now.
*/
ether_header_t eth;
char optcpy[48], ol;
char *s;
int i, sent = 0, ts, hlen, olen;
hlen = IP_HL(ip) << 2;
if (mtu < (hlen + 8)) {
fprintf(stderr, "mtu (%d) < ip header size (%d) + 8\n",
mtu, hlen);
fprintf(stderr, "can't fragment data\n");
return (-2);
}
ol = (IP_HL(ip) << 2) - sizeof(*ip);
for (i = 0, s = (char*)(ip + 1); ol > 0; )
if (*s == IPOPT_EOL) {
optcpy[i++] = *s;
break;
} else if (*s == IPOPT_NOP) {
s++;
ol--;
} else
{
olen = (int)(*(u_char *)(s + 1));
ol -= olen;
if (IPOPT_COPIED(*s))
{
bcopy(s, optcpy + i, olen);
i += olen;
s += olen;
}
}
if (i)
{
/*
* pad out
*/
while ((i & 3) && (i & 3) != 3)
optcpy[i++] = IPOPT_NOP;
if ((i & 3) == 3)
optcpy[i++] = IPOPT_EOL;
}
bcopy((char *)eh, (char *)&eth, sizeof(eth));
s = (char *)ip + hlen;
iplen = ntohs(ip->ip_len) - hlen;
ip->ip_off |= htons(IP_MF);
while (1)
{
if ((sent + (mtu - hlen)) >= iplen)
{
ip->ip_off ^= htons(IP_MF);
ts = iplen - sent;
}
else
ts = (mtu - hlen);
ip->ip_off &= htons(0xe000);
ip->ip_off |= htons(sent >> 3);
ts += hlen;
ip->ip_len = htons(ts);
ip->ip_sum = 0;
ip->ip_sum = chksum((u_short *)ip, hlen);
bcopy((char *)ip, ipbuf + sizeof(*eh), hlen);
bcopy(s + sent, ipbuf + sizeof(*eh) + hlen, ts - hlen);
err = sendip(nfd, ipbuf, sizeof(*eh) + ts);
bcopy((char *)&eth, ipbuf, sizeof(eth));
sent += (ts - hlen);
if (!(ntohs(ip->ip_off) & IP_MF))
break;
else if (!(ip->ip_off & htons(0x1fff)))
{
hlen = i + sizeof(*ip);
IP_HL_A(ip, (sizeof(*ip) + i) >> 2);
bcopy(optcpy, (char *)(ip + 1), i);
}
}
}
bcopy((char *)&ipsv, (char *)ip, sizeof(*ip));
return (err);
}
/*
* send a tcp packet.
*/
int
send_tcp(int nfd, int mtu, ip_t *ip, struct in_addr gwip)
{
static tcp_seq iss = 2;
tcphdr_t *t, *t2;
int thlen, i, iplen, hlen;
u_32_t lbuf[20];
ip_t *ip2;
iplen = ip->ip_len;
hlen = IP_HL(ip) << 2;
t = (tcphdr_t *)((char *)ip + hlen);
ip2 = (struct ip *)lbuf;
t2 = (tcphdr_t *)((char *)ip2 + hlen);
thlen = TCP_OFF(t) << 2;
if (!thlen)
thlen = sizeof(tcphdr_t);
bzero((char *)ip2, sizeof(*ip2) + sizeof(*t2));
ip->ip_p = IPPROTO_TCP;
ip2->ip_p = ip->ip_p;
ip2->ip_src = ip->ip_src;
ip2->ip_dst = ip->ip_dst;
bcopy((char *)ip + hlen, (char *)t2, thlen);
if (!t2->th_win)
t2->th_win = htons(4096);
iss += 63;
i = sizeof(struct tcpiphdr) / sizeof(long);
if ((t2->th_flags == TH_SYN) && !ntohs(ip->ip_off) &&
(lbuf[i] != htonl(0x020405b4))) {
lbuf[i] = htonl(0x020405b4);
bcopy((char *)ip + hlen + thlen, (char *)ip + hlen + thlen + 4,
iplen - thlen - hlen);
thlen += 4;
}
TCP_OFF_A(t2, thlen >> 2);
ip2->ip_len = htons(thlen);
ip->ip_len = hlen + thlen;
t2->th_sum = 0;
t2->th_sum = chksum((u_short *)ip2, thlen + sizeof(ip_t));
bcopy((char *)t2, (char *)ip + hlen, thlen);
return (send_ip(nfd, mtu, ip, gwip, 1));
}
/*
* send a udp packet.
*/
int
send_udp(int nfd, int mtu, ip_t *ip, struct in_addr gwip)
{
struct tcpiphdr *ti;
int thlen;
u_long lbuf[20];
ti = (struct tcpiphdr *)lbuf;
bzero((char *)ti, sizeof(*ti));
thlen = sizeof(udphdr_t);
ti->ti_pr = ip->ip_p;
ti->ti_src = ip->ip_src;
ti->ti_dst = ip->ip_dst;
bcopy((char *)ip + (IP_HL(ip) << 2),
(char *)&ti->ti_sport, sizeof(udphdr_t));
ti->ti_len = htons(thlen);
ip->ip_len = (IP_HL(ip) << 2) + thlen;
ti->ti_sum = 0;
ti->ti_sum = chksum((u_short *)ti, thlen + sizeof(ip_t));
bcopy((char *)&ti->ti_sport,
(char *)ip + (IP_HL(ip) << 2), sizeof(udphdr_t));
return (send_ip(nfd, mtu, ip, gwip, 1));
}
/*
* send an icmp packet.
*/
int
send_icmp(int nfd, int mtu, ip_t *ip, in_addr gwip)
{
struct icmp *ic;
ic = (struct icmp *)((char *)ip + (IP_HL(ip) << 2));
ic->icmp_cksum = 0;
ic->icmp_cksum = chksum((u_short *)ic, sizeof(struct icmp));
return (send_ip(nfd, mtu, ip, gwip, 1));
}
int
send_packet(int nfd, int mtu, ip_t *ip, struct in_addr gwip)
int nfd, mtu;
ip_t *ip;
struct in_addr gwip;
{
switch (ip->ip_p)
{
case IPPROTO_TCP :
( return send_tcp(nfd, mtu, ip, gwip));
case IPPROTO_UDP :
( return send_udp(nfd, mtu, ip, gwip));
case IPPROTO_ICMP :
( return send_icmp(nfd, mtu, ip, gwip));
default :
( return send_ip(nfd, mtu, ip, gwip, 1));
}
}
diff --git a/sbin/ipf/ipsend/ipresend.c b/sbin/ipf/ipsend/ipresend.c
index c9e625f02e2a..be7b5bc1943a 100644
--- a/sbin/ipf/ipsend/ipresend.c
+++ b/sbin/ipf/ipsend/ipresend.c
@@ -1,132 +1,131 @@
-/* $FreeBSD$ */
/*
* ipresend.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#if !defined(lint)
static const char sccsid[] = "%W% %G% (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/ip_var.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <netdb.h>
#include <string.h>
#include "ipsend.h"
extern char *optarg;
extern int optind;
#ifndef NO_IPF
extern struct ipread pcap, iphex, iptext;
#endif
int opts = 0;
#ifndef DEFAULT_DEVICE
# ifdef sun
char default_device[] = "le0";
# else
char default_device[] = "lan0";
# endif
#else
char default_device[] = DEFAULT_DEVICE;
#endif
static void usage(char *);
int main(int, char **);
static void usage(prog)
char *prog;
{
fprintf(stderr, "Usage: %s [options] <-r filename|-R filename>\n\
\t\t-r filename\tsnoop data file to resend\n\
\t\t-R filename\tlibpcap data file to resend\n\
\toptions:\n\
\t\t-d device\tSend out on this device\n\
\t\t-g gateway\tIP gateway to use if non-local dest.\n\
\t\t-m mtu\t\tfake MTU to use when sending out\n\
", prog);
exit(1);
}
int
main(int argc, char **argv)
{
struct in_addr gwip;
struct ipread *ipr = NULL;
char *name = argv[0], *gateway = NULL, *dev = NULL;
char *resend = NULL;
int mtu = 1500, c;
while ((c = getopt(argc, argv, "EHPRSTXd:g:m:r:")) != -1)
switch (c)
{
case 'd' :
dev = optarg;
break;
case 'g' :
gateway = optarg;
break;
case 'm' :
mtu = atoi(optarg);
if (mtu < 28)
{
fprintf(stderr, "mtu must be > 28\n");
exit(1);
}
case 'r' :
resend = optarg;
break;
case 'R' :
opts |= OPT_RAW;
break;
#ifndef NO_IPF
case 'H' :
ipr = &iphex;
break;
case 'P' :
ipr = &pcap;
break;
case 'X' :
ipr = &iptext;
break;
#endif
default :
fprintf(stderr, "Unknown option \"%c\"\n", c);
usage(name);
}
if (!ipr || !resend)
usage(name);
gwip.s_addr = 0;
if (gateway && resolve(gateway, (char *)&gwip) == -1)
{
fprintf(stderr,"Cant resolve %s\n", gateway);
exit(2);
}
if (!dev)
dev = default_device;
printf("Device: %s\n", dev);
printf("Gateway: %s\n", inet_ntoa(gwip));
printf("mtu: %d\n", mtu);
return (ip_resend(dev, mtu, ipr, gwip, resend));
}
diff --git a/sbin/ipf/ipsend/ipsend.c b/sbin/ipf/ipsend/ipsend.c
index 1996c01dec6c..22218b07c40e 100644
--- a/sbin/ipf/ipsend/ipsend.c
+++ b/sbin/ipf/ipsend/ipsend.c
@@ -1,411 +1,410 @@
-/* $FreeBSD$ */
/*
* ipsend.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ipsend.c 1.5 12/10/95 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/in_systm.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <netdb.h>
#include <string.h>
#include <netinet/ip.h>
# include <netinet/ip_var.h>
#include "ipsend.h"
#include "ipf.h"
# include <netinet/udp_var.h>
extern char *optarg;
extern int optind;
extern void iplang(FILE *);
char options[68];
int opts;
char default_device[] = "le0";
static void usage(char *);
static void do_icmp(ip_t *, char *);
void udpcksum(ip_t *, struct udphdr *, int);
int main(int, char **);
static void usage(prog)
char *prog;
{
fprintf(stderr, "Usage: %s [options] dest [flags]\n\
\toptions:\n\
\t\t-d\tdebug mode\n\
\t\t-i device\tSend out on this device\n\
\t\t-f fragflags\tcan set IP_MF or IP_DF\n\
\t\t-g gateway\tIP gateway to use if non-local dest.\n\
\t\t-I code,type[,gw[,dst[,src]]]\tSet ICMP protocol\n\
\t\t-m mtu\t\tfake MTU to use when sending out\n\
\t\t-P protocol\tSet protocol by name\n\
\t\t-s src\t\tsource address for IP packet\n\
\t\t-T\t\tSet TCP protocol\n\
\t\t-t port\t\tdestination port\n\
\t\t-U\t\tSet UDP protocol\n\
\t\t-v\tverbose mode\n\
\t\t-w <window>\tSet the TCP window size\n\
", prog);
fprintf(stderr, "Usage: %s [-dv] -L <filename>\n\
\toptions:\n\
\t\t-d\tdebug mode\n\
\t\t-L filename\tUse IP language for sending packets\n\
\t\t-v\tverbose mode\n\
", prog);
exit(1);
}
static
void do_icmp(ip_t *ip, char *args)
{
struct icmp *ic;
char *s;
ip->ip_p = IPPROTO_ICMP;
ip->ip_len += sizeof(*ic);
ic = (struct icmp *)(ip + 1);
bzero((char *)ic, sizeof(*ic));
if (!(s = strchr(args, ',')))
{
fprintf(stderr, "ICMP args missing: ,\n");
return;
}
*s++ = '\0';
ic->icmp_type = atoi(args);
ic->icmp_code = atoi(s);
if (ic->icmp_type == ICMP_REDIRECT && strchr(s, ','))
{
char *t;
t = strtok(s, ",");
t = strtok(NULL, ",");
if (resolve(t, (char *)&ic->icmp_gwaddr) == -1)
{
fprintf(stderr,"Cant resolve %s\n", t);
exit(2);
}
if ((t = strtok(NULL, ",")))
{
if (resolve(t, (char *)&ic->icmp_ip.ip_dst) == -1)
{
fprintf(stderr,"Cant resolve %s\n", t);
exit(2);
}
if ((t = strtok(NULL, ",")))
{
if (resolve(t,
(char *)&ic->icmp_ip.ip_src) == -1)
{
fprintf(stderr,"Cant resolve %s\n", t);
exit(2);
}
}
}
}
}
int
send_packets(char *dev, int mtu, ip_t *ip, struct in_addr gwip)
{
int wfd;
wfd = initdevice(dev, 5);
if (wfd == -1)
return (-1);
return (send_packet(wfd, mtu, ip, gwip));
}
void
udpcksum(ip_t *ip, struct udphdr *udp, int len)
{
union pseudoh {
struct hdr {
u_short len;
u_char ttl;
u_char proto;
u_32_t src;
u_32_t dst;
} h;
u_short w[6];
} ph;
u_32_t temp32;
u_short *opts;
ph.h.len = htons(len);
ph.h.ttl = 0;
ph.h.proto = IPPROTO_UDP;
ph.h.src = ip->ip_src.s_addr;
ph.h.dst = ip->ip_dst.s_addr;
temp32 = 0;
opts = &ph.w[0];
temp32 += opts[0] + opts[1] + opts[2] + opts[3] + opts[4] + opts[5];
temp32 = (temp32 >> 16) + (temp32 & 65535);
temp32 += (temp32 >> 16);
udp->uh_sum = temp32 & 65535;
udp->uh_sum = chksum((u_short *)udp, len);
if (udp->uh_sum == 0)
udp->uh_sum = 0xffff;
}
int
main(int argc, char **argv)
{
FILE *langfile = NULL;
struct in_addr gwip;
tcphdr_t *tcp;
udphdr_t *udp;
ip_t *ip;
char *name = argv[0], host[MAXHOSTNAMELEN + 1];
char *gateway = NULL, *dev = NULL;
char *src = NULL, *dst, *s;
int mtu = 1500, olen = 0, c, nonl = 0;
/*
* 65535 is maximum packet size...you never know...
*/
ip = (ip_t *)calloc(1, 65536);
tcp = (tcphdr_t *)(ip + 1);
udp = (udphdr_t *)tcp;
ip->ip_len = sizeof(*ip);
IP_HL_A(ip, sizeof(*ip) >> 2);
while ((c = getopt(argc, argv, "I:L:P:TUdf:i:g:m:o:s:t:vw:")) != -1) {
switch (c)
{
case 'I' :
nonl++;
if (ip->ip_p)
{
fprintf(stderr, "Protocol already set: %d\n",
ip->ip_p);
break;
}
do_icmp(ip, optarg);
break;
case 'L' :
if (nonl) {
fprintf(stderr,
"Incorrect usage of -L option.\n");
usage(name);
}
if (!strcmp(optarg, "-"))
langfile = stdin;
else if (!(langfile = fopen(optarg, "r"))) {
fprintf(stderr, "can't open file %s\n",
optarg);
exit(1);
}
iplang(langfile);
return (0);
case 'P' :
{
struct protoent *p;
nonl++;
if (ip->ip_p)
{
fprintf(stderr, "Protocol already set: %d\n",
ip->ip_p);
break;
}
if ((p = getprotobyname(optarg)))
ip->ip_p = p->p_proto;
else
fprintf(stderr, "Unknown protocol: %s\n",
optarg);
break;
}
case 'T' :
nonl++;
if (ip->ip_p)
{
fprintf(stderr, "Protocol already set: %d\n",
ip->ip_p);
break;
}
ip->ip_p = IPPROTO_TCP;
ip->ip_len += sizeof(tcphdr_t);
break;
case 'U' :
nonl++;
if (ip->ip_p)
{
fprintf(stderr, "Protocol already set: %d\n",
ip->ip_p);
break;
}
ip->ip_p = IPPROTO_UDP;
ip->ip_len += sizeof(udphdr_t);
break;
case 'd' :
opts |= OPT_DEBUG;
break;
case 'f' :
nonl++;
ip->ip_off = strtol(optarg, NULL, 0);
break;
case 'g' :
nonl++;
gateway = optarg;
break;
case 'i' :
nonl++;
dev = optarg;
break;
case 'm' :
nonl++;
mtu = atoi(optarg);
if (mtu < 28)
{
fprintf(stderr, "mtu must be > 28\n");
exit(1);
}
break;
case 'o' :
nonl++;
olen = buildopts(optarg, options, (IP_HL(ip) - 5) << 2);
break;
case 's' :
nonl++;
src = optarg;
break;
case 't' :
nonl++;
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP)
tcp->th_dport = htons(atoi(optarg));
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
case 'w' :
nonl++;
if (ip->ip_p == IPPROTO_TCP)
tcp->th_win = atoi(optarg);
else
fprintf(stderr, "set protocol to TCP first\n");
break;
default :
fprintf(stderr, "Unknown option \"%c\"\n", c);
usage(name);
}
}
if (argc - optind < 1)
usage(name);
dst = argv[optind++];
if (!src)
{
gethostname(host, sizeof(host));
src = host;
}
if (resolve(src, (char *)&ip->ip_src) == -1)
{
fprintf(stderr,"Cant resolve %s\n", src);
exit(2);
}
if (resolve(dst, (char *)&ip->ip_dst) == -1)
{
fprintf(stderr,"Cant resolve %s\n", dst);
exit(2);
}
if (!gateway)
gwip = ip->ip_dst;
else if (resolve(gateway, (char *)&gwip) == -1)
{
fprintf(stderr,"Cant resolve %s\n", gateway);
exit(2);
}
if (olen)
{
int hlen;
char *p;
printf("Options: %d\n", olen);
hlen = sizeof(*ip) + olen;
IP_HL_A(ip, hlen >> 2);
ip->ip_len += olen;
p = (char *)malloc(65536);
if (p == NULL)
{
fprintf(stderr, "malloc failed\n");
exit(2);
}
bcopy(ip, p, sizeof(*ip));
bcopy(options, p + sizeof(*ip), olen);
bcopy(ip + 1, p + hlen, ip->ip_len - hlen);
ip = (ip_t *)p;
if (ip->ip_p == IPPROTO_TCP) {
tcp = (tcphdr_t *)(p + hlen);
} else if (ip->ip_p == IPPROTO_UDP) {
udp = (udphdr_t *)(p + hlen);
}
}
if (ip->ip_p == IPPROTO_TCP)
for (s = argv[optind]; s && (c = *s); s++)
switch(c)
{
case 'S' : case 's' :
tcp->th_flags |= TH_SYN;
break;
case 'A' : case 'a' :
tcp->th_flags |= TH_ACK;
break;
case 'F' : case 'f' :
tcp->th_flags |= TH_FIN;
break;
case 'R' : case 'r' :
tcp->th_flags |= TH_RST;
break;
case 'P' : case 'p' :
tcp->th_flags |= TH_PUSH;
break;
case 'U' : case 'u' :
tcp->th_flags |= TH_URG;
break;
}
if (!dev)
dev = default_device;
printf("Device: %s\n", dev);
printf("Source: %s\n", inet_ntoa(ip->ip_src));
printf("Dest: %s\n", inet_ntoa(ip->ip_dst));
printf("Gateway: %s\n", inet_ntoa(gwip));
if (ip->ip_p == IPPROTO_TCP && tcp->th_flags)
printf("Flags: %#x\n", tcp->th_flags);
printf("mtu: %d\n", mtu);
if (ip->ip_p == IPPROTO_UDP) {
udp->uh_sum = 0;
udpcksum(ip, udp, ip->ip_len - (IP_HL(ip) << 2));
}
#ifdef DOSOCKET
if (ip->ip_p == IPPROTO_TCP && tcp->th_dport)
return (do_socket(dev, mtu, ip, gwip));
#endif
return (send_packets(dev, mtu, ip, gwip));
}
diff --git a/sbin/ipf/ipsend/ipsend.h b/sbin/ipf/ipsend/ipsend.h
index bfec90f1c5b3..31e977a4dcaa 100644
--- a/sbin/ipf/ipsend/ipsend.h
+++ b/sbin/ipf/ipsend/ipsend.h
@@ -1,62 +1,61 @@
-/* $FreeBSD$ */
/*
* ipsend.h (C) 1997-1998 Darren Reed
*
* This was written to test what size TCP fragments would get through
* various TCP/IP packet filters, as used in IP firewalls. In certain
* conditions, enough of the TCP header is missing for unpredictable
* results unless the filter is aware that this can happen.
*
* The author provides this program as-is, with no gaurantee for its
* suitability for any specific purpose. The author takes no responsibility
* for the misuse/abuse of this program and provides it for the sole purpose
* of testing packet filter policies. This file maybe distributed freely
* providing it is not modified and that this notice remains in tact.
*
*/
#ifndef __P
# define __P(x) x
#endif
#include <net/if.h>
#include "ipf.h"
/* XXX: The following is needed by tcpip.h */
#include <netinet/ip_var.h>
#include "netinet/tcpip.h"
#include "ipt.h"
extern int resolve(char *, char *);
extern int arp(char *, char *);
extern u_short chksum(u_short *, int);
extern int send_ether(int, char *, int, struct in_addr);
extern int send_ip(int, int, ip_t *, struct in_addr, int);
extern int send_tcp(int, int, ip_t *, struct in_addr);
extern int send_udp(int, int, ip_t *, struct in_addr);
extern int send_icmp(int, int, ip_t *, struct in_addr);
extern int send_packet(int, int, ip_t *, struct in_addr);
extern int send_packets(char *, int, ip_t *, struct in_addr);
extern u_short ipseclevel(char *);
extern u_32_t buildopts(char *, char *, int);
extern int addipopt(char *, struct ipopt_names *, int, char *);
extern int initdevice(char *, int);
extern int sendip(int, char *, int);
extern struct tcpcb *find_tcp(int, struct tcpiphdr *);
extern int ip_resend(char *, int, struct ipread *, struct in_addr, char *);
extern void ip_test1(char *, int, ip_t *, struct in_addr, int);
extern void ip_test2(char *, int, ip_t *, struct in_addr, int);
extern void ip_test3(char *, int, ip_t *, struct in_addr, int);
extern void ip_test4(char *, int, ip_t *, struct in_addr, int);
extern void ip_test5(char *, int, ip_t *, struct in_addr, int);
extern void ip_test6(char *, int, ip_t *, struct in_addr, int);
extern void ip_test7(char *, int, ip_t *, struct in_addr, int);
extern int do_socket(char *, int, struct tcpiphdr *, struct in_addr);
extern int kmemcpy(char *, void *, int);
#define KMCPY(a,b,c) kmemcpy((char *)(a), (void *)(b), (int)(c))
#ifndef OPT_RAW
#define OPT_RAW 0x80000
#endif
diff --git a/sbin/ipf/ipsend/ipsopt.c b/sbin/ipf/ipsend/ipsopt.c
index 0e053e2c75bb..6efbea16bc26 100644
--- a/sbin/ipf/ipsend/ipsopt.c
+++ b/sbin/ipf/ipsend/ipsopt.c
@@ -1,192 +1,191 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ipsopt.c 1.2 1/11/96 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <netinet/ip_var.h>
#include <netinet/tcp.h>
#include <arpa/inet.h>
#include "ipsend.h"
#ifndef __P
# define __P(x) x
#endif
struct ipopt_names ionames[] = {
{ IPOPT_EOL, 0x01, 1, "eol" },
{ IPOPT_NOP, 0x02, 1, "nop" },
{ IPOPT_RR, 0x04, 3, "rr" }, /* 1 route */
{ IPOPT_TS, 0x08, 8, "ts" }, /* 1 TS */
{ IPOPT_SECURITY, 0x08, 11, "sec-level" },
{ IPOPT_LSRR, 0x10, 7, "lsrr" }, /* 1 route */
{ IPOPT_SATID, 0x20, 4, "satid" },
{ IPOPT_SSRR, 0x40, 7, "ssrr" }, /* 1 route */
{ 0, 0, 0, NULL } /* must be last */
};
struct ipopt_names secnames[] = {
{ IPOPT_SECUR_UNCLASS, 0x0100, 0, "unclass" },
{ IPOPT_SECUR_CONFID, 0x0200, 0, "confid" },
{ IPOPT_SECUR_EFTO, 0x0400, 0, "efto" },
{ IPOPT_SECUR_MMMM, 0x0800, 0, "mmmm" },
{ IPOPT_SECUR_RESTR, 0x1000, 0, "restr" },
{ IPOPT_SECUR_SECRET, 0x2000, 0, "secret" },
{ IPOPT_SECUR_TOPSECRET, 0x4000,0, "topsecret" },
{ 0, 0, 0, NULL } /* must be last */
};
u_short ipseclevel(slevel)
char *slevel;
{
struct ipopt_names *so;
for (so = secnames; so->on_name; so++)
if (!strcasecmp(slevel, so->on_name))
break;
if (!so->on_name) {
fprintf(stderr, "no such security level: %s\n", slevel);
return (0);
}
return (so->on_value);
}
int
addipopt(char *op, struct ipopt_names *io, int len, char *class)
{
struct in_addr ipadr;
int olen = len, srr = 0;
u_short val;
u_char lvl;
char *s = op, *t;
if ((len + io->on_siz) > 48) {
fprintf(stderr, "options too long\n");
return (0);
}
len += io->on_siz;
*op++ = io->on_value;
if (io->on_siz > 1) {
/*
* Allow option to specify RR buffer length in bytes.
*/
if (io->on_value == IPOPT_RR) {
val = (class && *class) ? atoi(class) : 4;
*op++ = val + io->on_siz;
len += val;
} else
*op++ = io->on_siz;
if (io->on_value == IPOPT_TS)
*op++ = IPOPT_MINOFF + 1;
else
*op++ = IPOPT_MINOFF;
while (class && *class) {
t = NULL;
switch (io->on_value)
{
case IPOPT_SECURITY :
lvl = ipseclevel(class);
*(op - 1) = lvl;
break;
case IPOPT_LSRR :
case IPOPT_SSRR :
if ((t = strchr(class, ',')))
*t = '\0';
ipadr.s_addr = inet_addr(class);
srr++;
bcopy((char *)&ipadr, op, sizeof(ipadr));
op += sizeof(ipadr);
break;
case IPOPT_SATID :
val = atoi(class);
bcopy((char *)&val, op, 2);
break;
}
if (t)
*t++ = ',';
class = t;
}
if (srr)
s[IPOPT_OLEN] = IPOPT_MINOFF - 1 + 4 * srr;
if (io->on_value == IPOPT_RR)
op += val;
else
op += io->on_siz - 3;
}
return (len - olen);
}
u_32_t
buildopts(char *cp, char *op, int len)
char *cp, *op;
int len;
{
struct ipopt_names *io;
u_32_t msk = 0;
char *s, *t;
int inc, lastop = -1;
for (s = strtok(cp, ","); s; s = strtok(NULL, ",")) {
if ((t = strchr(s, '=')))
*t++ = '\0';
for (io = ionames; io->on_name; io++) {
if (strcasecmp(s, io->on_name) || (msk & io->on_bit))
continue;
lastop = io->on_value;
if ((inc = addipopt(op, io, len, t))) {
op += inc;
len += inc;
}
msk |= io->on_bit;
break;
}
if (!io->on_name) {
fprintf(stderr, "unknown IP option name %s\n", s);
return (0);
}
}
if (len & 3) {
while (len & 3) {
*op++ = ((len & 3) == 3) ? IPOPT_EOL : IPOPT_NOP;
len++;
}
} else {
if (lastop != IPOPT_EOL) {
if (lastop == IPOPT_NOP)
*(op - 1) = IPOPT_EOL;
else {
*op++ = IPOPT_NOP;
*op++ = IPOPT_NOP;
*op++ = IPOPT_NOP;
*op = IPOPT_EOL;
len += 4;
}
}
}
return (len);
}
diff --git a/sbin/ipf/ipsend/iptest.c b/sbin/ipf/ipsend/iptest.c
index ed92ab9306ea..16b97c221f41 100644
--- a/sbin/ipf/ipsend/iptest.c
+++ b/sbin/ipf/ipsend/iptest.c
@@ -1,196 +1,195 @@
-/* $FreeBSD$ */
/*
* ipsend.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#if !defined(lint)
static const char sccsid[] = "%W% %G% (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/ip_var.h>
#include <stdio.h>
#include <netdb.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include "ipsend.h"
extern char *optarg;
extern int optind;
char options[68];
# ifdef sun
char default_device[] = "le0";
# else
char default_device[] = "lan0";
# endif
static void usage(char *);
int main(int, char **);
static void usage(prog)
char *prog;
{
fprintf(stderr, "Usage: %s [options] dest\n\
\toptions:\n\
\t\t-d device\tSend out on this device\n\
\t\t-g gateway\tIP gateway to use if non-local dest.\n\
\t\t-m mtu\t\tfake MTU to use when sending out\n\
\t\t-p pointtest\t\n\
\t\t-s src\t\tsource address for IP packet\n\
\t\t-1 \t\tPerform test 1 (IP header)\n\
\t\t-2 \t\tPerform test 2 (IP options)\n\
\t\t-3 \t\tPerform test 3 (ICMP)\n\
\t\t-4 \t\tPerform test 4 (UDP)\n\
\t\t-5 \t\tPerform test 5 (TCP)\n\
\t\t-6 \t\tPerform test 6 (overlapping fragments)\n\
\t\t-7 \t\tPerform test 7 (random packets)\n\
", prog);
exit(1);
}
int
main(int argc, char **argv)
{
struct tcpiphdr *ti;
struct in_addr gwip;
ip_t *ip;
char *name = argv[0], host[MAXHOSTNAMELEN + 1];
char *gateway = NULL, *dev = NULL;
char *src = NULL, *dst;
int mtu = 1500, tests = 0, pointtest = 0, c;
/*
* 65535 is maximum packet size...you never know...
*/
ip = (ip_t *)calloc(1, 65536);
ti = (struct tcpiphdr *)ip;
ip->ip_len = sizeof(*ip);
IP_HL_A(ip, sizeof(*ip) >> 2);
while ((c = getopt(argc, argv, "1234567d:g:m:p:s:")) != -1)
switch (c)
{
case '1' :
case '2' :
case '3' :
case '4' :
case '5' :
case '6' :
case '7' :
tests = c - '0';
break;
case 'd' :
dev = optarg;
break;
case 'g' :
gateway = optarg;
break;
case 'm' :
mtu = atoi(optarg);
if (mtu < 28)
{
fprintf(stderr, "mtu must be > 28\n");
exit(1);
}
break;
case 'p' :
pointtest = atoi(optarg);
break;
case 's' :
src = optarg;
break;
default :
fprintf(stderr, "Unknown option \"%c\"\n", c);
usage(name);
}
if ((argc <= optind) || !argv[optind])
usage(name);
dst = argv[optind++];
if (!src)
{
gethostname(host, sizeof(host));
host[sizeof(host) - 1] = '\0';
src = host;
}
if (resolve(dst, (char *)&ip->ip_dst) == -1)
{
fprintf(stderr,"Cant resolve %s\n", dst);
exit(2);
}
if (resolve(src, (char *)&ip->ip_src) == -1)
{
fprintf(stderr,"Cant resolve %s\n", src);
exit(2);
}
if (!gateway)
gwip = ip->ip_dst;
else if (resolve(gateway, (char *)&gwip) == -1)
{
fprintf(stderr,"Cant resolve %s\n", gateway);
exit(2);
}
if (!dev)
dev = default_device;
printf("Device: %s\n", dev);
printf("Source: %s\n", inet_ntoa(ip->ip_src));
printf("Dest: %s\n", inet_ntoa(ip->ip_dst));
printf("Gateway: %s\n", inet_ntoa(gwip));
printf("mtu: %d\n", mtu);
switch (tests)
{
case 1 :
ip_test1(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
case 2 :
ip_test2(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
case 3 :
ip_test3(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
case 4 :
ip_test4(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
case 5 :
ip_test5(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
case 6 :
ip_test6(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
case 7 :
ip_test7(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
default :
ip_test1(dev, mtu, (ip_t *)ti, gwip, pointtest);
ip_test2(dev, mtu, (ip_t *)ti, gwip, pointtest);
ip_test3(dev, mtu, (ip_t *)ti, gwip, pointtest);
ip_test4(dev, mtu, (ip_t *)ti, gwip, pointtest);
ip_test5(dev, mtu, (ip_t *)ti, gwip, pointtest);
ip_test6(dev, mtu, (ip_t *)ti, gwip, pointtest);
ip_test7(dev, mtu, (ip_t *)ti, gwip, pointtest);
break;
}
return (0);
}
diff --git a/sbin/ipf/ipsend/iptests.c b/sbin/ipf/ipsend/iptests.c
index cbda02893162..3fccf1389f6c 100644
--- a/sbin/ipf/ipsend/iptests.c
+++ b/sbin/ipf/ipsend/iptests.c
@@ -1,1373 +1,1372 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#if !defined(lint)
static const char sccsid[] = "%W% %G% (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#if defined(__NetBSD__) && defined(__vax__)
/*
* XXX need to declare boolean_t for _KERNEL <sys/files.h>
* which ends up including <sys/device.h> for vax. See PR#32907
* for further details.
*/
typedef int boolean_t;
#endif
#include <sys/time.h>
# ifdef __NetBSD__
# include <machine/lock.h>
# include <machine/mutex.h>
# endif
# define _KERNEL
# define KERNEL
# if !defined(solaris)
# include <sys/file.h>
# else
# ifdef solaris
# include <sys/dditypes.h>
# endif
# endif
# undef _KERNEL
# undef KERNEL
#if !defined(solaris)
# include <nlist.h>
# include <sys/user.h>
# include <sys/proc.h>
#endif
# include <kvm.h>
# include <sys/socket.h>
#if defined(solaris)
# include <sys/stream.h>
#else
# include <sys/socketvar.h>
#endif
#ifdef sun
#include <sys/systm.h>
#include <sys/session.h>
#endif
# include <sys/sysctl.h>
# include <sys/filedesc.h>
# include <paths.h>
#include <netinet/in_systm.h>
#include <sys/socket.h>
#include <net/if.h>
# if defined(__FreeBSD__)
# include "radix_ipf.h"
# endif
# if !defined(solaris)
# include <net/route.h>
# endif
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/ip.h>
#if defined(__SVR4) || defined(__svr4__)
# include <sys/sysmacros.h>
#endif
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
# include <netinet/ip_var.h>
# if !defined(solaris)
# include <netinet/in_pcb.h>
# endif
#include "ipsend.h"
# include <netinet/tcp_timer.h>
# include <netinet/tcp_var.h>
#if defined(__NetBSD_Version__) && (__NetBSD_Version__ >= 106000000)
# define USE_NANOSLEEP
#endif
#ifdef USE_NANOSLEEP
# define PAUSE() ts.tv_sec = 0; ts.tv_nsec = 10000000; \
(void) nanosleep(&ts, NULL)
#else
# define PAUSE() tv.tv_sec = 0; tv.tv_usec = 10000; \
(void) select(0, NULL, NULL, NULL, &tv)
#endif
void
ip_test1(char *dev, int mtu, ip_t *ip, struct in_addr gwip, int ptest)
{
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
udphdr_t *u;
int nfd, i = 0, len, id = getpid();
IP_HL_A(ip, sizeof(*ip) >> 2);
IP_V_A(ip, IPVERSION);
ip->ip_tos = 0;
ip->ip_off = 0;
ip->ip_ttl = 60;
ip->ip_p = IPPROTO_UDP;
ip->ip_sum = 0;
u = (udphdr_t *)(ip + 1);
u->uh_sport = htons(1);
u->uh_dport = htons(9);
u->uh_sum = 0;
u->uh_ulen = htons(sizeof(*u) + 4);
ip->ip_len = sizeof(*ip) + ntohs(u->uh_ulen);
len = ip->ip_len;
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
if (!ptest || (ptest == 1)) {
/*
* Part1: hl < len
*/
ip->ip_id = 0;
printf("1.1. sending packets with ip_hl < ip_len\n");
for (i = 0; i < ((sizeof(*ip) + ntohs(u->uh_ulen)) >> 2); i++) {
IP_HL_A(ip, i >> 2);
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 2)) {
/*
* Part2: hl > len
*/
ip->ip_id = 0;
printf("1.2. sending packets with ip_hl > ip_len\n");
for (; i < ((sizeof(*ip) * 2 + ntohs(u->uh_ulen)) >> 2); i++) {
IP_HL_A(ip, i >> 2);
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 3)) {
/*
* Part3: v < 4
*/
ip->ip_id = 0;
printf("1.3. ip_v < 4\n");
IP_HL_A(ip, sizeof(*ip) >> 2);
for (i = 0; i < 4; i++) {
IP_V_A(ip, i);
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 4)) {
/*
* Part4: v > 4
*/
ip->ip_id = 0;
printf("1.4. ip_v > 4\n");
for (i = 5; i < 16; i++) {
IP_V_A(ip, i);
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 5)) {
/*
* Part5: len < packet
*/
ip->ip_id = 0;
IP_V_A(ip, IPVERSION);
i = ip->ip_len + 1;
printf("1.5.0 ip_len < packet size (size++, long packets)\n");
for (; i < (ip->ip_len * 2); i++) {
ip->ip_id = htons(id++);
ip->ip_sum = 0;
ip->ip_sum = chksum((u_short *)ip, IP_HL(ip) << 2);
(void) send_ether(nfd, (char *)ip, i, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
printf("1.5.1 ip_len < packet size (ip_len-, short packets)\n");
for (i = len; i > 0; i--) {
ip->ip_id = htons(id++);
ip->ip_len = i;
ip->ip_sum = 0;
ip->ip_sum = chksum((u_short *)ip, IP_HL(ip) << 2);
(void) send_ether(nfd, (char *)ip, len, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 6)) {
/*
* Part6: len > packet
*/
ip->ip_id = 0;
printf("1.6.0 ip_len > packet size (increase ip_len)\n");
for (i = len + 1; i < (len * 2); i++) {
ip->ip_id = htons(id++);
ip->ip_len = i;
ip->ip_sum = 0;
ip->ip_sum = chksum((u_short *)ip, IP_HL(ip) << 2);
(void) send_ether(nfd, (char *)ip, len, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
ip->ip_len = len;
printf("1.6.1 ip_len > packet size (size--, short packets)\n");
for (i = len; i > 0; i--) {
ip->ip_id = htons(id++);
ip->ip_sum = 0;
ip->ip_sum = chksum((u_short *)ip, IP_HL(ip) << 2);
(void) send_ether(nfd, (char *)ip, i, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 7)) {
/*
* Part7: 0 length fragment
*/
printf("1.7.0 Zero length fragments (ip_off = 0x2000)\n");
ip->ip_id = 0;
ip->ip_len = sizeof(*ip);
ip->ip_off = htons(IP_MF);
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("1.7.1 Zero length fragments (ip_off = 0x3000)\n");
ip->ip_id = 0;
ip->ip_len = sizeof(*ip);
ip->ip_off = htons(IP_MF);
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("1.7.2 Zero length fragments (ip_off = 0xa000)\n");
ip->ip_id = 0;
ip->ip_len = sizeof(*ip);
ip->ip_off = htons(0xa000);
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("1.7.3 Zero length fragments (ip_off = 0x0100)\n");
ip->ip_id = 0;
ip->ip_len = sizeof(*ip);
ip->ip_off = htons(0x0100);
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
}
if (!ptest || (ptest == 8)) {
struct timeval tv;
gettimeofday(&tv, NULL);
srand(tv.tv_sec ^ getpid() ^ tv.tv_usec);
/*
* Part8.1: 63k packet + 1k fragment at offset 0x1ffe
* Mark it as being ICMP (so it doesn't get junked), but
* don't bother about the ICMP header, we're not worrying
* about that here.
*/
ip->ip_p = IPPROTO_ICMP;
ip->ip_off = htons(IP_MF);
u->uh_dport = htons(9);
ip->ip_id = htons(id++);
printf("1.8.1 63k packet + 1k fragment at offset 0x1ffe\n");
ip->ip_len = 768 + 20 + 8;
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
ip->ip_len = MIN(768 + 20, mtu - 68);
i = 512;
for (; i < (63 * 1024 + 768); i += 768) {
ip->ip_off = htons(IP_MF | (i >> 3));
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
ip->ip_len = 896 + 20;
ip->ip_off = htons(i >> 3);
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
putchar('\n');
fflush(stdout);
/*
* Part8.2: 63k packet + 1k fragment at offset 0x1ffe
* Mark it as being ICMP (so it doesn't get junked), but
* don't bother about the ICMP header, we're not worrying
* about that here. (Lossage here)
*/
ip->ip_p = IPPROTO_ICMP;
ip->ip_off = htons(IP_MF);
u->uh_dport = htons(9);
ip->ip_id = htons(id++);
printf("1.8.2 63k packet + 1k fragment at offset 0x1ffe\n");
ip->ip_len = 768 + 20 + 8;
if ((rand() & 0x1f) != 0) {
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
} else
printf("skip 0\n");
ip->ip_len = MIN(768 + 20, mtu - 68);
i = 512;
for (; i < (63 * 1024 + 768); i += 768) {
ip->ip_off = htons(IP_MF | (i >> 3));
if ((rand() & 0x1f) != 0) {
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
} else
printf("skip %d\n", i);
fflush(stdout);
PAUSE();
}
ip->ip_len = 896 + 20;
ip->ip_off = htons(i >> 3);
if ((rand() & 0x1f) != 0) {
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
} else
printf("skip\n");
putchar('\n');
fflush(stdout);
/*
* Part8.3: 33k packet - test for not dealing with -ve length
* Mark it as being ICMP (so it doesn't get junked), but
* don't bother about the ICMP header, we're not worrying
* about that here.
*/
ip->ip_p = IPPROTO_ICMP;
ip->ip_off = htons(IP_MF);
u->uh_dport = htons(9);
ip->ip_id = htons(id++);
printf("1.8.3 33k packet\n");
ip->ip_len = 768 + 20 + 8;
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
ip->ip_len = MIN(768 + 20, mtu - 68);
i = 512;
for (; i < (32 * 1024 + 768); i += 768) {
ip->ip_off = htons(IP_MF | (i >> 3));
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
ip->ip_len = 896 + 20;
ip->ip_off = htons(i >> 3);
(void) send_ip(nfd, mtu, ip, gwip, 1);
printf("%d\r", i);
putchar('\n');
fflush(stdout);
}
ip->ip_len = len;
ip->ip_off = 0;
if (!ptest || (ptest == 9)) {
/*
* Part9: off & 0x8000 == 0x8000
*/
ip->ip_id = 0;
ip->ip_off = htons(0x8000);
printf("1.9. ip_off & 0x8000 == 0x8000\n");
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
}
ip->ip_off = 0;
if (!ptest || (ptest == 10)) {
/*
* Part10: ttl = 255
*/
ip->ip_id = 0;
ip->ip_ttl = 255;
printf("1.10.0 ip_ttl = 255\n");
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
ip->ip_ttl = 128;
printf("1.10.1 ip_ttl = 128\n");
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
ip->ip_ttl = 0;
printf("1.10.2 ip_ttl = 0\n");
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
}
(void) close(nfd);
}
void ip_test2(dev, mtu, ip, gwip, ptest)
char *dev;
int mtu;
ip_t *ip;
struct in_addr gwip;
int ptest;
{
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
int nfd;
u_char *s;
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
IP_HL_A(ip, 6);
ip->ip_len = IP_HL(ip) << 2;
s = (u_char *)(ip + 1);
s[IPOPT_OPTVAL] = IPOPT_NOP;
s++;
if (!ptest || (ptest == 1)) {
/*
* Test 1: option length > packet length,
* header length == packet length
*/
s[IPOPT_OPTVAL] = IPOPT_TS;
s[IPOPT_OLEN] = 4;
s[IPOPT_OFFSET] = IPOPT_MINOFF;
ip->ip_p = IPPROTO_IP;
printf("2.1 option length > packet length\n");
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
}
IP_HL_A(ip, 7);
ip->ip_len = IP_HL(ip) << 2;
if (!ptest || (ptest == 1)) {
/*
* Test 2: options have length = 0
*/
printf("2.2.1 option length = 0, RR\n");
s[IPOPT_OPTVAL] = IPOPT_RR;
s[IPOPT_OLEN] = 0;
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("2.2.2 option length = 0, TS\n");
s[IPOPT_OPTVAL] = IPOPT_TS;
s[IPOPT_OLEN] = 0;
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("2.2.3 option length = 0, SECURITY\n");
s[IPOPT_OPTVAL] = IPOPT_SECURITY;
s[IPOPT_OLEN] = 0;
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("2.2.4 option length = 0, LSRR\n");
s[IPOPT_OPTVAL] = IPOPT_LSRR;
s[IPOPT_OLEN] = 0;
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("2.2.5 option length = 0, SATID\n");
s[IPOPT_OPTVAL] = IPOPT_SATID;
s[IPOPT_OLEN] = 0;
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
printf("2.2.6 option length = 0, SSRR\n");
s[IPOPT_OPTVAL] = IPOPT_SSRR;
s[IPOPT_OLEN] = 0;
(void) send_ip(nfd, mtu, ip, gwip, 1);
fflush(stdout);
PAUSE();
}
(void) close(nfd);
}
/*
* test 3 (ICMP)
*/
void
ip_test3(char *dev, int mtu, ip_t *ip, struct in_addr gwip, int ptest)
{
static int ict1[10] = { 8, 9, 10, 13, 14, 15, 16, 17, 18, 0 };
static int ict2[8] = { 3, 9, 10, 13, 14, 17, 18, 0 };
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
struct icmp *icp;
int nfd, i;
IP_HL_A(ip, sizeof(*ip) >> 2);
IP_V_A(ip, IPVERSION);
ip->ip_tos = 0;
ip->ip_off = 0;
ip->ip_ttl = 60;
ip->ip_p = IPPROTO_ICMP;
ip->ip_sum = 0;
ip->ip_len = sizeof(*ip) + sizeof(*icp);
icp = (struct icmp *)((char *)ip + (IP_HL(ip) << 2));
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
if (!ptest || (ptest == 1)) {
/*
* Type 0 - 31, 255, code = 0
*/
bzero((char *)icp, sizeof(*icp));
for (i = 0; i < 32; i++) {
icp->icmp_type = i;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.1.%d ICMP type %d code 0 (all 0's)\r", i, i);
}
icp->icmp_type = 255;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.1.%d ICMP type %d code 0 (all 0's)\r", i, 255);
putchar('\n');
}
if (!ptest || (ptest == 2)) {
/*
* Type 3, code = 0 - 31
*/
icp->icmp_type = 3;
for (i = 0; i < 32; i++) {
icp->icmp_code = i;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.2.%d ICMP type 3 code %d (all 0's)\r", i, i);
}
}
if (!ptest || (ptest == 3)) {
/*
* Type 4, code = 0,127,128,255
*/
icp->icmp_type = 4;
icp->icmp_code = 0;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.3.1 ICMP type 4 code 0 (all 0's)\r");
icp->icmp_code = 127;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.3.2 ICMP type 4 code 127 (all 0's)\r");
icp->icmp_code = 128;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.3.3 ICMP type 4 code 128 (all 0's)\r");
icp->icmp_code = 255;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.3.4 ICMP type 4 code 255 (all 0's)\r");
}
if (!ptest || (ptest == 4)) {
/*
* Type 5, code = 0,127,128,255
*/
icp->icmp_type = 5;
icp->icmp_code = 0;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.4.1 ICMP type 5 code 0 (all 0's)\r");
icp->icmp_code = 127;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.4.2 ICMP type 5 code 127 (all 0's)\r");
icp->icmp_code = 128;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.4.3 ICMP type 5 code 128 (all 0's)\r");
icp->icmp_code = 255;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.4.4 ICMP type 5 code 255 (all 0's)\r");
}
if (!ptest || (ptest == 5)) {
/*
* Type 8-10;13-18, code - 0,127,128,255
*/
for (i = 0; ict1[i]; i++) {
icp->icmp_type = ict1[i];
icp->icmp_code = 0;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type 5 code 0 (all 0's)\r",
i * 4);
icp->icmp_code = 127;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type 5 code 127 (all 0's)\r",
i * 4 + 1);
icp->icmp_code = 128;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type 5 code 128 (all 0's)\r",
i * 4 + 2);
icp->icmp_code = 255;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type 5 code 255 (all 0's)\r",
i * 4 + 3);
}
putchar('\n');
}
if (!ptest || (ptest == 6)) {
/*
* Type 12, code - 0,127,128,129,255
*/
icp->icmp_type = 12;
icp->icmp_code = 0;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.6.1 ICMP type 12 code 0 (all 0's)\r");
icp->icmp_code = 127;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.6.2 ICMP type 12 code 127 (all 0's)\r");
icp->icmp_code = 128;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.6.3 ICMP type 12 code 128 (all 0's)\r");
icp->icmp_code = 129;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.6.4 ICMP type 12 code 129 (all 0's)\r");
icp->icmp_code = 255;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.6.5 ICMP type 12 code 255 (all 0's)\r");
putchar('\n');
}
if (!ptest || (ptest == 7)) {
/*
* Type 3;9-10;13-14;17-18 - shorter packets
*/
ip->ip_len = sizeof(*ip) + sizeof(*icp) / 2;
for (i = 0; ict2[i]; i++) {
icp->icmp_type = ict1[i];
icp->icmp_code = 0;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type %d code 0 (all 0's)\r",
i * 4, icp->icmp_type);
icp->icmp_code = 127;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type %d code 127 (all 0's)\r",
i * 4 + 1, icp->icmp_type);
icp->icmp_code = 128;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type %d code 128 (all 0's)\r",
i * 4 + 2, icp->icmp_type);
icp->icmp_code = 255;
(void) send_icmp(nfd, mtu, ip, gwip);
PAUSE();
printf("3.5.%d ICMP type %d code 127 (all 0's)\r",
i * 4 + 3, icp->icmp_type);
}
putchar('\n');
}
}
/* Perform test 4 (UDP) */
void
ip_test4(char *dev, int mtu, ip_t *ip, struct in_addr gwip, int ptest)
{
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
udphdr_t *u;
int nfd, i;
IP_HL_A(ip, sizeof(*ip) >> 2);
IP_V_A(ip, IPVERSION);
ip->ip_tos = 0;
ip->ip_off = 0;
ip->ip_ttl = 60;
ip->ip_p = IPPROTO_UDP;
ip->ip_sum = 0;
u = (udphdr_t *)((char *)ip + (IP_HL(ip) << 2));
u->uh_sport = htons(1);
u->uh_dport = htons(1);
u->uh_ulen = htons(sizeof(*u) + 4);
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
if (!ptest || (ptest == 1)) {
/*
* Test 1. ulen > packet
*/
u->uh_ulen = htons(sizeof(*u) + 4);
ip->ip_len = (IP_HL(ip) << 2) + ntohs(u->uh_ulen);
printf("4.1 UDP uh_ulen > packet size - short packets\n");
for (i = ntohs(u->uh_ulen) * 2; i > sizeof(*u) + 4; i--) {
u->uh_ulen = htons(i);
(void) send_udp(nfd, 1500, ip, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 2)) {
/*
* Test 2. ulen < packet
*/
u->uh_ulen = htons(sizeof(*u) + 4);
ip->ip_len = (IP_HL(ip) << 2) + ntohs(u->uh_ulen);
printf("4.2 UDP uh_ulen < packet size - short packets\n");
for (i = ntohs(u->uh_ulen) * 2; i > sizeof(*u) + 4; i--) {
ip->ip_len = i;
(void) send_udp(nfd, 1500, ip, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 3)) {
/*
* Test 3: sport = 0, sport = 1, sport = 32767
* sport = 32768, sport = 65535
*/
u->uh_ulen = sizeof(*u) + 4;
ip->ip_len = (IP_HL(ip) << 2) + ntohs(u->uh_ulen);
printf("4.3.1 UDP sport = 0\n");
u->uh_sport = 0;
(void) send_udp(nfd, 1500, ip, gwip);
printf("0\n");
fflush(stdout);
PAUSE();
printf("4.3.2 UDP sport = 1\n");
u->uh_sport = htons(1);
(void) send_udp(nfd, 1500, ip, gwip);
printf("1\n");
fflush(stdout);
PAUSE();
printf("4.3.3 UDP sport = 32767\n");
u->uh_sport = htons(32767);
(void) send_udp(nfd, 1500, ip, gwip);
printf("32767\n");
fflush(stdout);
PAUSE();
printf("4.3.4 UDP sport = 32768\n");
u->uh_sport = htons(32768);
(void) send_udp(nfd, 1500, ip, gwip);
printf("32768\n");
putchar('\n');
fflush(stdout);
PAUSE();
printf("4.3.5 UDP sport = 65535\n");
u->uh_sport = htons(65535);
(void) send_udp(nfd, 1500, ip, gwip);
printf("65535\n");
fflush(stdout);
PAUSE();
}
if (!ptest || (ptest == 4)) {
/*
* Test 4: dport = 0, dport = 1, dport = 32767
* dport = 32768, dport = 65535
*/
u->uh_ulen = ntohs(sizeof(*u) + 4);
u->uh_sport = htons(1);
ip->ip_len = (IP_HL(ip) << 2) + ntohs(u->uh_ulen);
printf("4.4.1 UDP dport = 0\n");
u->uh_dport = 0;
(void) send_udp(nfd, 1500, ip, gwip);
printf("0\n");
fflush(stdout);
PAUSE();
printf("4.4.2 UDP dport = 1\n");
u->uh_dport = htons(1);
(void) send_udp(nfd, 1500, ip, gwip);
printf("1\n");
fflush(stdout);
PAUSE();
printf("4.4.3 UDP dport = 32767\n");
u->uh_dport = htons(32767);
(void) send_udp(nfd, 1500, ip, gwip);
printf("32767\n");
fflush(stdout);
PAUSE();
printf("4.4.4 UDP dport = 32768\n");
u->uh_dport = htons(32768);
(void) send_udp(nfd, 1500, ip, gwip);
printf("32768\n");
fflush(stdout);
PAUSE();
printf("4.4.5 UDP dport = 65535\n");
u->uh_dport = htons(65535);
(void) send_udp(nfd, 1500, ip, gwip);
printf("65535\n");
fflush(stdout);
PAUSE();
}
if (!ptest || (ptest == 5)) {
/*
* Test 5: sizeof(ip_t) <= MTU <= sizeof(udphdr_t) +
* sizeof(ip_t)
*/
printf("4.5 UDP 20 <= MTU <= 32\n");
for (i = sizeof(*ip); i <= ntohs(u->uh_ulen); i++) {
(void) send_udp(nfd, i, ip, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
}
/* Perform test 5 (TCP) */
void
ip_test5(char *dev, int mtu, ip_t *ip, struct in_addr gwip, int ptest)
{
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
tcphdr_t *t;
int nfd, i;
t = (tcphdr_t *)((char *)ip + (IP_HL(ip) << 2));
t->th_x2 = 0;
TCP_OFF_A(t, 0);
t->th_sport = htons(1);
t->th_dport = htons(1);
t->th_win = htons(4096);
t->th_urp = 0;
t->th_sum = 0;
t->th_seq = htonl(1);
t->th_ack = 0;
ip->ip_len = sizeof(ip_t) + sizeof(tcphdr_t);
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
if (!ptest || (ptest == 1)) {
/*
* Test 1: flags variations, 0 - 3f
*/
TCP_OFF_A(t, sizeof(*t) >> 2);
printf("5.1 Test TCP flag combinations\n");
for (i = 0; i <= (TH_URG|TH_ACK|TH_PUSH|TH_RST|TH_SYN|TH_FIN);
i++) {
t->th_flags = i;
(void) send_tcp(nfd, mtu, ip, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
if (!ptest || (ptest == 2)) {
t->th_flags = TH_SYN;
/*
* Test 2: seq = 0, seq = 1, seq = 0x7fffffff, seq=0x80000000,
* seq = 0xa000000, seq = 0xffffffff
*/
printf("5.2.1 TCP seq = 0\n");
t->th_seq = htonl(0);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.2.2 TCP seq = 1\n");
t->th_seq = htonl(1);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.2.3 TCP seq = 0x7fffffff\n");
t->th_seq = htonl(0x7fffffff);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.2.4 TCP seq = 0x80000000\n");
t->th_seq = htonl(0x80000000);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.2.5 TCP seq = 0xc0000000\n");
t->th_seq = htonl(0xc0000000);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.2.6 TCP seq = 0xffffffff\n");
t->th_seq = htonl(0xffffffff);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
}
if (!ptest || (ptest == 3)) {
t->th_flags = TH_ACK;
/*
* Test 3: ack = 0, ack = 1, ack = 0x7fffffff, ack = 0x8000000
* ack = 0xa000000, ack = 0xffffffff
*/
printf("5.3.1 TCP ack = 0\n");
t->th_ack = 0;
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.3.2 TCP ack = 1\n");
t->th_ack = htonl(1);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.3.3 TCP ack = 0x7fffffff\n");
t->th_ack = htonl(0x7fffffff);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.3.4 TCP ack = 0x80000000\n");
t->th_ack = htonl(0x80000000);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.3.5 TCP ack = 0xc0000000\n");
t->th_ack = htonl(0xc0000000);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.3.6 TCP ack = 0xffffffff\n");
t->th_ack = htonl(0xffffffff);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
}
if (!ptest || (ptest == 4)) {
t->th_flags = TH_SYN;
/*
* Test 4: win = 0, win = 32768, win = 65535
*/
printf("5.4.1 TCP win = 0\n");
t->th_seq = htonl(0);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.4.2 TCP win = 32768\n");
t->th_seq = htonl(0x7fff);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.4.3 TCP win = 65535\n");
t->th_win = htons(0xffff);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
}
#if !defined(linux) && !defined(__SVR4) && !defined(__svr4__) && \
!defined(__sgi) && !defined(__hpux) && !defined(__osf__)
{
struct tcpcb *tcbp, tcb;
struct tcpiphdr ti;
struct sockaddr_in sin;
int fd;
socklen_t slen;
bzero((char *)&sin, sizeof(sin));
for (i = 1; i < 63; i++) {
fd = socket(AF_INET, SOCK_STREAM, 0);
bzero((char *)&sin, sizeof(sin));
sin.sin_addr.s_addr = ip->ip_dst.s_addr;
sin.sin_port = htons(i);
sin.sin_family = AF_INET;
if (!connect(fd, (struct sockaddr *)&sin, sizeof(sin)))
break;
close(fd);
}
if (i == 63) {
printf("Couldn't open a TCP socket between ports 1 and 63\n");
printf("to host %s for test 5 and 6 - skipping.\n",
inet_ntoa(ip->ip_dst));
goto skip_five_and_six;
}
bcopy((char *)ip, (char *)&ti, sizeof(*ip));
t->th_dport = htons(i);
slen = sizeof(sin);
if (!getsockname(fd, (struct sockaddr *)&sin, &slen))
t->th_sport = sin.sin_port;
if (!(tcbp = find_tcp(fd, &ti))) {
printf("Can't find PCB\n");
goto skip_five_and_six;
}
KMCPY(&tcb, tcbp, sizeof(tcb));
ti.ti_win = tcb.rcv_adv;
ti.ti_seq = htonl(tcb.snd_nxt - 1);
ti.ti_ack = tcb.rcv_nxt;
if (!ptest || (ptest == 5)) {
/*
* Test 5: urp
*/
t->th_flags = TH_ACK|TH_URG;
printf("5.5.1 TCP Urgent pointer, sport %hu dport %hu\n",
ntohs(t->th_sport), ntohs(t->th_dport));
t->th_urp = htons(1);
(void) send_tcp(nfd, mtu, ip, gwip);
PAUSE();
t->th_seq = htonl(tcb.snd_nxt);
ip->ip_len = sizeof(ip_t) + sizeof(tcphdr_t) + 1;
t->th_urp = htons(0x7fff);
(void) send_tcp(nfd, mtu, ip, gwip);
PAUSE();
t->th_urp = htons(0x8000);
(void) send_tcp(nfd, mtu, ip, gwip);
PAUSE();
t->th_urp = htons(0xffff);
(void) send_tcp(nfd, mtu, ip, gwip);
PAUSE();
t->th_urp = 0;
t->th_flags &= ~TH_URG;
ip->ip_len = sizeof(ip_t) + sizeof(tcphdr_t);
}
if (!ptest || (ptest == 6)) {
/*
* Test 6: data offset, off = 0, off is inside, off is outside
*/
t->th_flags = TH_ACK;
printf("5.6.1 TCP off = 1-15, len = 40\n");
for (i = 1; i < 16; i++) {
TCP_OFF_A(t, ntohs(i));
(void) send_tcp(nfd, mtu, ip, gwip);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
ip->ip_len = sizeof(ip_t) + sizeof(tcphdr_t);
}
(void) close(fd);
}
skip_five_and_six:
#endif
t->th_seq = htonl(1);
t->th_ack = htonl(1);
TCP_OFF_A(t, 0);
if (!ptest || (ptest == 7)) {
t->th_flags = TH_SYN;
/*
* Test 7: sport = 0, sport = 1, sport = 32767
* sport = 32768, sport = 65535
*/
printf("5.7.1 TCP sport = 0\n");
t->th_sport = 0;
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.7.2 TCP sport = 1\n");
t->th_sport = htons(1);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.7.3 TCP sport = 32767\n");
t->th_sport = htons(32767);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.7.4 TCP sport = 32768\n");
t->th_sport = htons(32768);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.7.5 TCP sport = 65535\n");
t->th_sport = htons(65535);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
}
if (!ptest || (ptest == 8)) {
t->th_sport = htons(1);
t->th_flags = TH_SYN;
/*
* Test 8: dport = 0, dport = 1, dport = 32767
* dport = 32768, dport = 65535
*/
printf("5.8.1 TCP dport = 0\n");
t->th_dport = 0;
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.8.2 TCP dport = 1\n");
t->th_dport = htons(1);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.8.3 TCP dport = 32767\n");
t->th_dport = htons(32767);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.8.4 TCP dport = 32768\n");
t->th_dport = htons(32768);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
printf("5.8.5 TCP dport = 65535\n");
t->th_dport = htons(65535);
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
}
/* LAND attack - self connect, so make src & dst ip/port the same */
if (!ptest || (ptest == 9)) {
printf("5.9 TCP LAND attack. sport = 25, dport = 25\n");
/* chose SMTP port 25 */
t->th_sport = htons(25);
t->th_dport = htons(25);
t->th_flags = TH_SYN;
ip->ip_src = ip->ip_dst;
(void) send_tcp(nfd, mtu, ip, gwip);
fflush(stdout);
PAUSE();
}
/* TCP options header checking */
/* 0 length options, etc */
}
/* Perform test 6 (exhaust mbuf test) */
void
ip_test6(char *dev, int mtu, ip_t *ip, struct in_addr gwip, int ptest)
{
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
udphdr_t *u;
int nfd, i, j, k;
IP_V_A(ip, IPVERSION);
ip->ip_tos = 0;
ip->ip_off = 0;
ip->ip_ttl = 60;
ip->ip_p = IPPROTO_UDP;
ip->ip_sum = 0;
u = (udphdr_t *)(ip + 1);
u->uh_sport = htons(1);
u->uh_dport = htons(9);
u->uh_sum = 0;
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
u->uh_ulen = htons(7168);
printf("6. Exhaustive mbuf test.\n");
printf(" Send 7k packet in 768 & 128 byte fragments, 128 times.\n");
printf(" Total of around 8,900 packets\n");
for (i = 0; i < 128; i++) {
/*
* First send the entire packet in 768 byte chunks.
*/
ip->ip_len = sizeof(*ip) + 768 + sizeof(*u);
IP_HL_A(ip, sizeof(*ip) >> 2);
ip->ip_off = htons(IP_MF);
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d %d\r", i, 0);
fflush(stdout);
PAUSE();
/*
* And again using 128 byte chunks.
*/
ip->ip_len = sizeof(*ip) + 128 + sizeof(*u);
ip->ip_off = htons(IP_MF);
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d %d\r", i, 0);
fflush(stdout);
PAUSE();
for (j = 768; j < 3584; j += 768) {
ip->ip_len = sizeof(*ip) + 768;
ip->ip_off = htons(IP_MF|(j>>3));
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d %d\r", i, j);
fflush(stdout);
PAUSE();
ip->ip_len = sizeof(*ip) + 128;
for (k = j - 768; k < j; k += 128) {
ip->ip_off = htons(IP_MF|(k>>3));
(void) send_ip(nfd, 1500, ip, gwip, 1);
printf("%d %d\r", i, k);
fflush(stdout);
PAUSE();
}
}
}
putchar('\n');
}
/* Perform test 7 (random packets) */
static u_long tbuf[64];
void
ip_test7(char *dev, int mtu, ip_t *ip, struct in_addr gwip, int ptest)
{
ip_t *pip;
#ifdef USE_NANOSLEEP
struct timespec ts;
#else
struct timeval tv;
#endif
int nfd, i, j;
u_char *s;
nfd = initdevice(dev, 1);
if (nfd == -1)
return;
pip = (ip_t *)tbuf;
srand(time(NULL) ^ (getpid() * getppid()));
printf("7. send 1024 random IP packets.\n");
for (i = 0; i < 512; i++) {
for (s = (u_char *)pip, j = 0; j < sizeof(tbuf); j++, s++)
*s = (rand() >> 13) & 0xff;
IP_V_A(pip, IPVERSION);
bcopy((char *)&ip->ip_dst, (char *)&pip->ip_dst,
sizeof(struct in_addr));
pip->ip_sum = 0;
pip->ip_len &= 0xff;
(void) send_ip(nfd, mtu, pip, gwip, 0);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
for (i = 0; i < 512; i++) {
for (s = (u_char *)pip, j = 0; j < sizeof(tbuf); j++, s++)
*s = (rand() >> 13) & 0xff;
IP_V_A(pip, IPVERSION);
pip->ip_off &= htons(0xc000);
bcopy((char *)&ip->ip_dst, (char *)&pip->ip_dst,
sizeof(struct in_addr));
pip->ip_sum = 0;
pip->ip_len &= 0xff;
(void) send_ip(nfd, mtu, pip, gwip, 0);
printf("%d\r", i);
fflush(stdout);
PAUSE();
}
putchar('\n');
}
diff --git a/sbin/ipf/ipsend/resend.c b/sbin/ipf/ipsend/resend.c
index c3f86baaadc3..484709e89c53 100644
--- a/sbin/ipf/ipsend/resend.c
+++ b/sbin/ipf/ipsend/resend.c
@@ -1,138 +1,137 @@
-/* $FreeBSD$ */
/*
* resend.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#if !defined(lint)
static const char sccsid[] = "@(#)resend.c 1.3 1/11/96 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <net/if.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
# include <netinet/ip_var.h>
# include <netinet/if_ether.h>
#include <stdio.h>
#include <netdb.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include "ipsend.h"
extern int opts;
void dumppacket(ip_t *);
void
dumppacket(ip_t *ip)
{
tcphdr_t *t;
int i, j;
t = (tcphdr_t *)((char *)ip + (IP_HL(ip) << 2));
if (ip->ip_tos)
printf("tos %#x ", ip->ip_tos);
if (ip->ip_off & 0x3fff)
printf("frag @%#x ", (ip->ip_off & 0x1fff) << 3);
printf("len %d id %d ", ip->ip_len, ip->ip_id);
printf("ttl %d p %d src %s", ip->ip_ttl, ip->ip_p,
inet_ntoa(ip->ip_src));
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP)
printf(",%d", t->th_sport);
printf(" dst %s", inet_ntoa(ip->ip_dst));
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP)
printf(",%d", t->th_dport);
if (ip->ip_p == IPPROTO_TCP) {
printf(" seq %lu:%lu flags ",
(u_long)t->th_seq, (u_long)t->th_ack);
for (j = 0, i = 1; i < 256; i *= 2, j++)
if (t->th_flags & i)
printf("%c", "FSRPAU--"[j]);
}
putchar('\n');
}
int
ip_resend(char *dev, int mtu, struct ipread *r, struct in_addr gwip,
char *datain)
{
ether_header_t *eh;
char dhost[6];
ip_t *ip;
int fd, wfd = initdevice(dev, 5), len, i;
mb_t mb;
if (wfd == -1)
return (-1);
if (datain)
fd = (*r->r_open)(datain);
else
fd = (*r->r_open)("-");
if (fd < 0)
exit(-1);
ip = (struct ip *)mb.mb_buf;
eh = (ether_header_t *)malloc(sizeof(*eh));
if(!eh)
{
perror("malloc failed");
return (-2);
}
bzero((char *) &eh->ether_shost, sizeof(eh->ether_shost));
if (gwip.s_addr && (arp((char *)&gwip, dhost) == -1))
{
perror("arp");
free(eh);
return (-2);
}
while ((i = (*r->r_readip)(&mb, NULL, NULL)) > 0)
{
if (!(opts & OPT_RAW)) {
len = ntohs(ip->ip_len);
eh = (ether_header_t *)realloc((char *)eh, sizeof(*eh) + len);
eh->ether_type = htons((u_short)ETHERTYPE_IP);
if (!gwip.s_addr) {
if (arp((char *)&gwip,
(char *) &eh->ether_dhost) == -1) {
perror("arp");
continue;
}
} else
bcopy(dhost, (char *) &eh->ether_dhost,
sizeof(dhost));
if (!ip->ip_sum)
ip->ip_sum = chksum((u_short *)ip,
IP_HL(ip) << 2);
bcopy(ip, (char *)(eh + 1), len);
len += sizeof(*eh);
dumppacket(ip);
} else {
eh = (ether_header_t *)mb.mb_buf;
len = i;
}
if (sendip(wfd, (char *)eh, len) == -1)
{
perror("send_packet");
break;
}
}
(*r->r_close)();
free(eh);
return (0);
}
diff --git a/sbin/ipf/ipsend/sbpf.c b/sbin/ipf/ipsend/sbpf.c
index b46585f1f340..d2efc4a19f6b 100644
--- a/sbin/ipf/ipsend/sbpf.c
+++ b/sbin/ipf/ipsend/sbpf.c
@@ -1,148 +1,147 @@
-/* $FreeBSD$ */
/*
* (C)opyright 1995-1998 Darren Reed. (from tcplog)
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#include <sys/param.h>
#include <sys/types.h>
#include <sys/mbuf.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <sys/file.h>
#include <sys/ioctl.h>
#ifdef __FreeBSD__
# include <sys/dirent.h>
#else
# include <sys/dir.h>
#endif
#include <net/bpf.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/udp.h>
#include <netinet/tcp.h>
#include <stdio.h>
#include <netdb.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#ifdef __NetBSD__
# include <paths.h>
#endif
#include <ctype.h>
#include <signal.h>
#include <errno.h>
#include "ipsend.h"
#if !defined(lint)
static const char sccsid[] = "@(#)sbpf.c 1.3 8/25/95 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
/*
* the code herein is dervied from libpcap.
*/
static u_char *buf = NULL;
static int bufsize = 0, timeout = 1;
int
initdevice(char *device, int tout)
{
struct bpf_version bv;
struct timeval to;
struct ifreq ifr;
#ifdef _PATH_BPF
char *bpfname = _PATH_BPF;
int fd;
if ((fd = open(bpfname, O_RDWR)) < 0)
{
fprintf(stderr, "no bpf devices available as /dev/bpfxx\n");
return (-1);
}
#else
char bpfname[16];
int fd = 0, i;
for (i = 0; i < 16; i++)
{
(void) snprintf(bpfname, sizeof(bpfname), "/dev/bpf%d", i);
if ((fd = open(bpfname, O_RDWR)) >= 0)
break;
}
if (i == 16)
{
fprintf(stderr, "no bpf devices available as /dev/bpfxx\n");
return (-1);
}
#endif
if (ioctl(fd, BIOCVERSION, (caddr_t)&bv) < 0)
{
perror("BIOCVERSION");
return (-1);
}
if (bv.bv_major != BPF_MAJOR_VERSION ||
bv.bv_minor < BPF_MINOR_VERSION)
{
fprintf(stderr, "kernel bpf (v%d.%d) filter out of date:\n",
bv.bv_major, bv.bv_minor);
fprintf(stderr, "current version: %d.%d\n",
BPF_MAJOR_VERSION, BPF_MINOR_VERSION);
return (-1);
}
(void) strncpy(ifr.ifr_name, device, sizeof(ifr.ifr_name));
if (ioctl(fd, BIOCSETIF, &ifr) == -1)
{
fprintf(stderr, "%s(%d):", ifr.ifr_name, fd);
perror("BIOCSETIF");
exit(1);
}
/*
* get kernel buffer size
*/
if (ioctl(fd, BIOCGBLEN, &bufsize) == -1)
{
perror("BIOCSBLEN");
exit(-1);
}
buf = (u_char*)malloc(bufsize);
/*
* set the timeout
*/
timeout = tout;
to.tv_sec = 1;
to.tv_usec = 0;
if (ioctl(fd, BIOCSRTIMEOUT, (caddr_t)&to) == -1)
{
perror("BIOCSRTIMEOUT");
exit(-1);
}
(void) ioctl(fd, BIOCFLUSH, 0);
return (fd);
}
/*
* output an IP packet onto a fd opened for /dev/bpf
*/
int
sendip(int fd, char *pkt, int len)
{
if (write(fd, pkt, len) == -1)
{
perror("send");
return (-1);
}
return (len);
}
diff --git a/sbin/ipf/ipsend/sdlpi.c b/sbin/ipf/ipsend/sdlpi.c
index 5570495dd2d7..a8ccd2d41df4 100644
--- a/sbin/ipf/ipsend/sdlpi.c
+++ b/sbin/ipf/ipsend/sdlpi.c
@@ -1,166 +1,165 @@
-/* $FreeBSD$ */
/*
* (C)opyright 1992-1998 Darren Reed. (from tcplog)
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#include <stdio.h>
#include <netdb.h>
#include <ctype.h>
#include <fcntl.h>
#include <signal.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/timeb.h>
#include <sys/socket.h>
#include <sys/file.h>
#include <sys/ioctl.h>
#include <sys/stropts.h>
#ifdef sun
# include <sys/pfmod.h>
# include <sys/bufmod.h>
#endif
# include <sys/dlpi.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/if_ether.h>
#include <netinet/ip_var.h>
#include <netinet/udp.h>
#include <netinet/udp_var.h>
#include <netinet/tcp.h>
#include "ipsend.h"
#if !defined(lint)
static const char sccsid[] = "@(#)sdlpi.c 1.3 10/30/95 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#define CHUNKSIZE 8192
#define BUFSPACE (4*CHUNKSIZE)
/*
* Be careful to only include those defined in the flags option for the
* interface are included in the header size.
*/
int
initdevice(char *device, int tout)
{
char devname[16], *s, buf[256];
int i, fd;
(void) strcpy(devname, "/dev/");
(void) strncat(devname, device, sizeof(devname) - strlen(devname));
s = devname + 5;
while (*s && !ISDIGIT(*s))
s++;
if (!*s)
{
fprintf(stderr, "bad device name %s\n", devname);
exit(-1);
}
i = atoi(s);
*s = '\0';
/*
* For writing
*/
if ((fd = open(devname, O_RDWR)) < 0)
{
fprintf(stderr, "O_RDWR(1) ");
perror(devname);
exit(-1);
}
if (dlattachreq(fd, i) == -1)
{
fprintf(stderr, "dlattachreq: DLPI error\n");
exit(-1);
}
else if (dlokack(fd, buf) == -1)
{
fprintf(stderr, "dlokack(attach): DLPI error\n");
exit(-1);
}
#ifdef DL_HP_RAWDLS
if (dlpromisconreq(fd, DL_PROMISC_SAP) < 0)
{
fprintf(stderr, "dlpromisconreq: DL_PROMISC_PHYS error\n");
exit(-1);
}
else if (dlokack(fd, buf) < 0)
{
fprintf(stderr, "dlokack(promisc): DLPI error\n");
exit(-1);
}
/* 22 is INSAP as per the HP-UX DLPI Programmer's Guide */
dlbindreq(fd, 22, 1, DL_HP_RAWDLS, 0, 0);
#else
dlbindreq(fd, ETHERTYPE_IP, 0, DL_CLDLS, 0, 0);
#endif
dlbindack(fd, buf);
/*
* write full headers
*/
#ifdef DLIOCRAW /* we require RAW DLPI mode, which is a Sun extension */
if (strioctl(fd, DLIOCRAW, -1, 0, NULL) == -1)
{
fprintf(stderr, "DLIOCRAW error\n");
exit(-1);
}
#endif
return (fd);
}
/*
* output an IP packet onto a fd opened for /dev/nit
*/
int
sendip(int fd, char *pkt, int len)
int fd, len;
char *pkt;
{
struct strbuf dbuf, *dp = &dbuf, *cp = NULL;
int pri = 0;
#ifdef DL_HP_RAWDLS
struct strbuf cbuf;
dl_hp_rawdata_req_t raw;
cp = &cbuf;
raw.dl_primitive = DL_HP_RAWDATA_REQ;
cp->len = sizeof(raw);
cp->buf = (char *)&raw;
cp->maxlen = cp->len;
pri = MSG_HIPRI;
#endif
/*
* construct NIT STREAMS messages, first control then data.
*/
dp->buf = pkt;
dp->len = len;
dp->maxlen = dp->len;
if (putmsg(fd, cp, dp, pri) == -1)
{
perror("putmsg");
return (-1);
}
if (ioctl(fd, I_FLUSH, FLUSHW) == -1)
{
perror("I_FLUSHW");
return (-1);
}
return (len);
}
diff --git a/sbin/ipf/ipsend/snit.c b/sbin/ipf/ipsend/snit.c
index 187299436d2d..e7fb51b72546 100644
--- a/sbin/ipf/ipsend/snit.c
+++ b/sbin/ipf/ipsend/snit.c
@@ -1,160 +1,159 @@
-/* $FreeBSD$ */
/*
* (C)opyright 1992-1998 Darren Reed. (from tcplog)
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#include <stdio.h>
#include <netdb.h>
#include <ctype.h>
#include <signal.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/timeb.h>
#include <sys/socket.h>
#include <sys/file.h>
#include <sys/ioctl.h>
#include <net/nit.h>
#include <sys/fcntlcom.h>
#include <sys/dir.h>
#include <net/nit_if.h>
#include <net/nit_pf.h>
#include <net/nit_buf.h>
#include <net/packetfilt.h>
#include <sys/stropts.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/if_ether.h>
#include <netinet/ip_var.h>
#include <netinet/udp.h>
#include <netinet/udp_var.h>
#include <netinet/tcp.h>
#include "ipsend.h"
#if !defined(lint)
static const char sccsid[] = "@(#)snit.c 1.5 1/11/96 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#define CHUNKSIZE 8192
#define BUFSPACE (4*CHUNKSIZE)
/*
* Be careful to only include those defined in the flags option for the
* interface are included in the header size.
*/
#define BUFHDR_SIZE (sizeof(struct nit_bufhdr))
#define NIT_HDRSIZE (BUFHDR_SIZE)
static int timeout;
int
initdevice(char *device, int tout)
{
struct strioctl si;
struct timeval to;
struct ifreq ifr;
int fd;
if ((fd = open("/dev/nit", O_RDWR)) < 0)
{
perror("/dev/nit");
exit(-1);
}
/*
* arrange to get messages from the NIT STREAM and use NIT_BUF option
*/
ioctl(fd, I_SRDOPT, (char*)RMSGD);
ioctl(fd, I_PUSH, "nbuf");
/*
* set the timeout
*/
timeout = tout;
si.ic_timout = 1;
to.tv_sec = 1;
to.tv_usec = 0;
si.ic_cmd = NIOCSTIME;
si.ic_len = sizeof(to);
si.ic_dp = (char*)&to;
if (ioctl(fd, I_STR, (char*)&si) == -1)
{
perror("ioctl: NIT timeout");
exit(-1);
}
/*
* request the interface
*/
strncpy(ifr.ifr_name, device, sizeof(ifr.ifr_name));
ifr.ifr_name[sizeof(ifr.ifr_name) - 1] = ' ';
si.ic_cmd = NIOCBIND;
si.ic_len = sizeof(ifr);
si.ic_dp = (char*)&ifr;
if (ioctl(fd, I_STR, (char*)&si) == -1)
{
perror(ifr.ifr_name);
exit(1);
}
return (fd);
}
/*
* output an IP packet onto a fd opened for /dev/nit
*/
int
sendip(int fd, char *pkt, int len)
int fd, len;
char *pkt;
{
struct sockaddr sk, *sa = &sk;
struct strbuf cbuf, *cp = &cbuf, dbuf, *dp = &dbuf;
/*
* For ethernet, need at least 802.3 header and IP header.
*/
if (len < (sizeof(sa->sa_data) + sizeof(struct ip)))
return (-1);
/*
* to avoid any output processing for IP, say we're not.
*/
sa->sa_family = AF_UNSPEC;
bcopy(pkt, sa->sa_data, sizeof(sa->sa_data));
pkt += sizeof(sa->sa_data);
len -= sizeof(sa->sa_data);
/*
* construct NIT STREAMS messages, first control then data.
*/
cp->len = sizeof(*sa);
cp->maxlen = sizeof(*sa);
cp->buf = (char *)sa;
dp->buf = pkt;
dp->len = len;
dp->maxlen = dp->len;
if (putmsg(fd, cp, dp, 0) == -1)
{
perror("putmsg");
return (-1);
}
if (ioctl(fd, I_FLUSH, FLUSHW) == -1)
{
perror("I_FLUSH");
return (-1);
}
return (len);
}
diff --git a/sbin/ipf/ipsend/sock.c b/sbin/ipf/ipsend/sock.c
index bab36182a9e7..ab59f815a37c 100644
--- a/sbin/ipf/ipsend/sock.c
+++ b/sbin/ipf/ipsend/sock.c
@@ -1,313 +1,312 @@
-/* $FreeBSD$ */
/*
* sock.c (C) 1995-1998 Darren Reed
*
* See the IPFILTER.LICENCE file for details on licencing.
*
*/
#if !defined(lint)
static const char sccsid[] = "@(#)sock.c 1.2 1/11/96 (C)1995 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <sys/param.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/stat.h>
#if defined(__NetBSD__) && defined(__vax__)
/*
* XXX need to declare boolean_t for _KERNEL <sys/files.h>
* which ends up including <sys/device.h> for vax. See PR#32907
* for further details.
*/
typedef int boolean_t;
#endif
#include <fcntl.h>
# include <sys/dirent.h>
# ifdef __NetBSD__
# include <machine/lock.h>
# endif
# ifdef __FreeBSD__
# define _WANT_FILE
# else
# define _KERNEL
# define KERNEL
# endif
# include <sys/file.h>
# ifdef __FreeBSD__
# undef _WANT_FILE
# else
# undef _KERNEL
# undef KERNEL
# endif
#include <nlist.h>
#include <sys/user.h>
#include <sys/socket.h>
#include <sys/socketvar.h>
#include <sys/proc.h>
# include <kvm.h>
#ifdef sun
#include <sys/systm.h>
#include <sys/session.h>
#endif
#include <sys/sysctl.h>
#include <sys/filedesc.h>
#include <paths.h>
#include <math.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/tcp.h>
#include <net/if.h>
# include <net/route.h>
#include <netinet/ip_var.h>
#define _WANT_INPCB
#include <netinet/in_pcb.h>
#include <netinet/tcp_timer.h>
#define _WANT_TCPCB
#include <netinet/tcp_var.h>
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <stddef.h>
#include <pwd.h>
#include "ipsend.h"
int nproc;
struct proc *proc;
#ifndef KMEM
# ifdef _PATH_KMEM
# define KMEM _PATH_KMEM
# endif
#endif
#ifndef KERNEL
# ifdef _PATH_UNIX
# define KERNEL _PATH_UNIX
# endif
#endif
#ifndef KMEM
# define KMEM "/dev/kmem"
#endif
#ifndef KERNEL
# define KERNEL "/vmunix"
#endif
static struct kinfo_proc *getproc(void);
int
kmemcpy(char *buf, void *pos, int n)
{
static int kfd = -1;
off_t offset = (u_long)pos;
if (kfd == -1)
kfd = open(KMEM, O_RDONLY);
if (lseek(kfd, offset, SEEK_SET) == -1)
{
perror("lseek");
return (-1);
}
if (read(kfd, buf, n) == -1)
{
perror("read");
return (-1);
}
return (n);
}
struct nlist names[4] = {
{ "_proc" },
{ "_nproc" },
{ NULL },
{ NULL }
};
static struct
kinfo_proc *getproc(void)
{
static struct kinfo_proc kp;
pid_t pid = getpid();
int mib[4];
size_t n;
mib[0] = CTL_KERN;
mib[1] = KERN_PROC;
mib[2] = KERN_PROC_PID;
mib[3] = pid;
n = sizeof(kp);
if (sysctl(mib, 4, &kp, &n, NULL, 0) == -1)
{
perror("sysctl");
return (NULL);
}
return (&kp);
}
struct tcpcb *
find_tcp(int tfd, struct tcpiphdr *ti)
{
struct tcpcb *t;
struct inpcb *i;
struct socket *s;
struct filedesc *fd;
struct kinfo_proc *p;
struct file *f, **o;
if (!(p = getproc()))
return (NULL);
fd = (struct filedesc *)malloc(sizeof(*fd));
if (fd == NULL)
return (NULL);
#if defined( __FreeBSD__)
if (KMCPY(fd, p->ki_fd, sizeof(*fd)) == -1)
{
fprintf(stderr, "read(%#lx,%#lx) failed\n",
(u_long)p, (u_long)p->ki_fd);
free(fd);
return (NULL);
}
#else
if (KMCPY(fd, p->kp_proc.p_fd, sizeof(*fd)) == -1)
{
fprintf(stderr, "read(%#lx,%#lx) failed\n",
(u_long)p, (u_long)p->kp_proc.p_fd);
free(fd);
return (NULL);
}
#endif
o = NULL;
f = NULL;
s = NULL;
i = NULL;
t = NULL;
o = (struct file **)calloc(fd->fd_lastfile + 1, sizeof(*o));
if (KMCPY(o, fd->fd_ofiles, (fd->fd_lastfile + 1) * sizeof(*o)) == -1)
{
fprintf(stderr, "read(%#lx,%#lx,%lu) - u_ofile - failed\n",
(u_long)fd->fd_ofiles, (u_long)o, (u_long)sizeof(*o));
goto finderror;
}
f = (struct file *)calloc(1, sizeof(*f));
if (KMCPY(f, o[tfd], sizeof(*f)) == -1)
{
fprintf(stderr, "read(%#lx,%#lx,%lu) - o[tfd] - failed\n",
(u_long)o[tfd], (u_long)f, (u_long)sizeof(*f));
goto finderror;
}
s = (struct socket *)calloc(1, sizeof(*s));
if (KMCPY(s, f->f_data, sizeof(*s)) == -1)
{
fprintf(stderr, "read(%#lx,%#lx,%lu) - f_data - failed\n",
(u_long)f->f_data, (u_long)s, (u_long)sizeof(*s));
goto finderror;
}
i = (struct inpcb *)calloc(1, sizeof(*i));
if (KMCPY(i, s->so_pcb, sizeof(*i)) == -1)
{
fprintf(stderr, "kvm_read(%#lx,%#lx,%lu) - so_pcb - failed\n",
(u_long)s->so_pcb, (u_long)i, (u_long)sizeof(*i));
goto finderror;
}
t = (struct tcpcb *)calloc(1, sizeof(*t));
if (KMCPY(t, i->inp_ppcb, sizeof(*t)) == -1)
{
fprintf(stderr, "read(%#lx,%#lx,%lu) - inp_ppcb - failed\n",
(u_long)i->inp_ppcb, (u_long)t, (u_long)sizeof(*t));
goto finderror;
}
return (struct tcpcb *)i->inp_ppcb;
finderror:
if (o != NULL)
free(o);
if (f != NULL)
free(f);
if (s != NULL)
free(s);
if (i != NULL)
free(i);
if (t != NULL)
free(t);
return (NULL);
}
int
do_socket(char *dev, int mtu, struct tcpiphdr *ti, struct in_addr gwip)
{
struct sockaddr_in rsin, lsin;
struct tcpcb *t, tcb;
int fd, nfd;
socklen_t len;
printf("Dest. Port: %d\n", ti->ti_dport);
fd = socket(AF_INET, SOCK_STREAM, 0);
if (fd == -1)
{
perror("socket");
return (-1);
}
if (fcntl(fd, F_SETFL, FNDELAY) == -1)
{
perror("fcntl");
return (-1);
}
bzero((char *)&lsin, sizeof(lsin));
lsin.sin_family = AF_INET;
bcopy((char *)&ti->ti_src, (char *)&lsin.sin_addr,
sizeof(struct in_addr));
if (bind(fd, (struct sockaddr *)&lsin, sizeof(lsin)) == -1)
{
perror("bind");
return (-1);
}
len = sizeof(lsin);
(void) getsockname(fd, (struct sockaddr *)&lsin, &len);
ti->ti_sport = lsin.sin_port;
printf("sport %d\n", ntohs(lsin.sin_port));
nfd = initdevice(dev, 1);
if (nfd == -1)
return (-1);
if (!(t = find_tcp(fd, ti)))
return (-1);
bzero((char *)&rsin, sizeof(rsin));
rsin.sin_family = AF_INET;
bcopy((char *)&ti->ti_dst, (char *)&rsin.sin_addr,
sizeof(struct in_addr));
rsin.sin_port = ti->ti_dport;
if (connect(fd, (struct sockaddr *)&rsin, sizeof(rsin)) == -1 &&
errno != EINPROGRESS)
{
perror("connect");
return (-1);
}
KMCPY(&tcb, t, sizeof(tcb));
ti->ti_win = tcb.rcv_adv;
ti->ti_seq = tcb.snd_nxt - 1;
ti->ti_ack = tcb.rcv_nxt;
if (send_tcp(nfd, mtu, (ip_t *)ti, gwip) == -1)
return (-1);
(void)write(fd, "Hello World\n", 12);
sleep(2);
close(fd);
return (0);
}
diff --git a/sbin/ipf/ipsend/sockraw.c b/sbin/ipf/ipsend/sockraw.c
index 16384230f543..56fcb7174532 100644
--- a/sbin/ipf/ipsend/sockraw.c
+++ b/sbin/ipf/ipsend/sockraw.c
@@ -1,90 +1,89 @@
-/* $FreeBSD$ */
/*
* (C)opyright 2000 Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* WARNING: Attempting to use this .c file on HP-UX 11.00 will cause the
* system to crash.
*/
#include <sys/param.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/if_ether.h>
#include <netinet/ip_var.h>
#include <netinet/udp.h>
#include <netinet/udp_var.h>
#include <netinet/tcp.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <errno.h>
#include "ipsend.h"
#if !defined(lint) && defined(LIBC_SCCS)
static char sirix[] = "@(#)sirix.c 1.0 10/9/97 (C)1997 Marc Boucher";
#endif
int
initdevice(char *device, int tout)
{
struct sockaddr s;
struct ifreq ifr;
int fd;
memset(&ifr, 0, sizeof(ifr));
strncpy(ifr.ifr_name, device, sizeof ifr.ifr_name);
if ((fd = socket(AF_INET, SOCK_RAW, IPPROTO_RAW)) < 0)
{
perror("socket(AF_INET, SOCK_RAW, IPPROTO_RAW)");
return (-1);
}
if (ioctl(fd, SIOCGIFADDR, &ifr) == -1)
{
perror("ioctl SIOCGIFADDR");
return (-1);
}
bzero((char *)&s, sizeof(s));
s.sa_family = AF_INET;
bcopy(&ifr.ifr_addr, s.sa_data, 4);
if (bind(fd, &s, sizeof(s)) == -1)
perror("bind");
return (fd);
}
/*
* output an IP packet
*/
int sendip(int fd, char *pkt, int len)
{
struct ether_header *eh;
struct sockaddr_in sin;
eh = (struct ether_header *)pkt;
bzero((char *)&sin, sizeof(sin));
sin.sin_family = AF_INET;
pkt += 14;
len -= 14;
bcopy(pkt + 12, (char *)&sin.sin_addr, 4);
if (sendto(fd, pkt, len, 0, &sin, sizeof(sin)) == -1)
{
perror("send");
return (-1);
}
return (len);
}
diff --git a/sbin/ipf/libipf/addicmp.c b/sbin/ipf/libipf/addicmp.c
index da52f1caacfe..f84cae01644e 100644
--- a/sbin/ipf/libipf/addicmp.c
+++ b/sbin/ipf/libipf/addicmp.c
@@ -1,21 +1,20 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <ctype.h>
#include "ipf.h"
char *icmptypes[MAX_ICMPTYPE + 1] = {
"echorep", (char *)NULL, (char *)NULL, "unreach", "squench",
"redir", (char *)NULL, (char *)NULL, "echo", "routerad",
"routersol", "timex", "paramprob", "timest", "timestrep",
"inforeq", "inforep", "maskreq", "maskrep", "END"
};
diff --git a/sbin/ipf/libipf/addipopt.c b/sbin/ipf/libipf/addipopt.c
index a6c699ddc701..ab0579d00063 100644
--- a/sbin/ipf/libipf/addipopt.c
+++ b/sbin/ipf/libipf/addipopt.c
@@ -1,62 +1,61 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
int
addipopt(char *op, struct ipopt_names *io, int len, char *class)
{
int olen = len;
struct in_addr ipadr;
u_short val;
u_char lvl;
char *s;
if ((len + io->on_siz) > 48) {
fprintf(stderr, "options too long\n");
return (0);
}
len += io->on_siz;
*op++ = io->on_value;
if (io->on_siz > 1) {
s = op;
*op++ = io->on_siz;
*op++ = IPOPT_MINOFF;
if (class) {
switch (io->on_value)
{
case IPOPT_SECURITY :
lvl = seclevel(class);
*(op - 1) = lvl;
break;
case IPOPT_RR :
case IPOPT_TS :
s[IPOPT_OLEN] = IPOPT_MINOFF - 1 + 4;
break;
case IPOPT_LSRR :
case IPOPT_SSRR :
ipadr.s_addr = inet_addr(class);
s[IPOPT_OLEN] = IPOPT_MINOFF - 1 + 4;
bcopy((char *)&ipadr, op, sizeof(ipadr));
break;
case IPOPT_SATID :
val = atoi(class);
bcopy((char *)&val, op, 2);
break;
}
}
}
if (opts & OPT_DEBUG)
fprintf(stderr, "bo: %s %d %#x: %d\n",
io->on_name, io->on_value, io->on_bit, len);
return (len - olen);
}
diff --git a/sbin/ipf/libipf/bcopywrap.c b/sbin/ipf/libipf/bcopywrap.c
index 9eec27f4538c..e20462ea9b04 100644
--- a/sbin/ipf/libipf/bcopywrap.c
+++ b/sbin/ipf/libipf/bcopywrap.c
@@ -1,19 +1,18 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
int
bcopywrap(void *from, void *to, size_t size)
{
bcopy((caddr_t)from, (caddr_t)to, size);
return (0);
}
diff --git a/sbin/ipf/libipf/binprint.c b/sbin/ipf/libipf/binprint.c
index 131e3f62d481..8d09b347db2c 100644
--- a/sbin/ipf/libipf/binprint.c
+++ b/sbin/ipf/libipf/binprint.c
@@ -1,30 +1,29 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
binprint(void *ptr, size_t size)
{
u_char *s;
int i, j;
for (i = size, j = 0, s = (u_char *)ptr; i; i--, s++) {
j++;
printf("%02x ", *s);
if (j == 16) {
printf("\n");
j = 0;
}
}
putchar('\n');
(void)fflush(stdout);
}
diff --git a/sbin/ipf/libipf/buildopts.c b/sbin/ipf/libipf/buildopts.c
index 7f2397bf7c95..27eb1b7323f0 100644
--- a/sbin/ipf/libipf/buildopts.c
+++ b/sbin/ipf/libipf/buildopts.c
@@ -1,49 +1,48 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
u_32_t
buildopts(char *cp, char *op, int len)
{
struct ipopt_names *io;
u_32_t msk = 0;
char *s, *t;
int inc;
for (s = strtok(cp, ","); s; s = strtok(NULL, ",")) {
if ((t = strchr(s, '=')))
*t++ = '\0';
else
t = "";
for (io = ionames; io->on_name; io++) {
if (strcasecmp(s, io->on_name) || (msk & io->on_bit))
continue;
if ((inc = addipopt(op, io, len, t))) {
op += inc;
len += inc;
}
msk |= io->on_bit;
break;
}
if (!io->on_name) {
fprintf(stderr, "unknown IP option name %s\n", s);
return (0);
}
}
while ((len & 3) != 3) {
*op++ = IPOPT_NOP;
len++;
}
*op++ = IPOPT_EOL;
len++;
return (len);
}
diff --git a/sbin/ipf/libipf/checkrev.c b/sbin/ipf/libipf/checkrev.c
index 148acaff571b..ded9ce04d500 100644
--- a/sbin/ipf/libipf/checkrev.c
+++ b/sbin/ipf/libipf/checkrev.c
@@ -1,46 +1,45 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <sys/ioctl.h>
#include <fcntl.h>
#include "ipf.h"
#include "netinet/ipl.h"
int
checkrev(char *ipfname)
{
static int vfd = -1;
struct friostat fio;
ipfobj_t obj;
bzero((caddr_t)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(fio);
obj.ipfo_ptr = (void *)&fio;
obj.ipfo_type = IPFOBJ_IPFSTAT;
if ((vfd == -1) && ((vfd = open(ipfname, O_RDONLY)) == -1)) {
perror("open device");
return (-1);
}
if (ioctl(vfd, SIOCGETFS, &obj)) {
ipferror(vfd, "ioctl(SIOCGETFS)");
close(vfd);
vfd = -1;
return (-1);
}
if (strncmp(IPL_VERSION, fio.f_version, sizeof(fio.f_version))) {
return (-1);
}
return (0);
}
diff --git a/sbin/ipf/libipf/count4bits.c b/sbin/ipf/libipf/count4bits.c
index 52942771f800..10e9d6bb2207 100644
--- a/sbin/ipf/libipf/count4bits.c
+++ b/sbin/ipf/libipf/count4bits.c
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
/*
* count consecutive 1's in bit mask. If the mask generated by counting
* consecutive 1's is different to that passed, return -1, else return #
* of bits.
*/
int
count4bits(u_int ip)
{
int cnt = 0, i, j;
u_int ipn;
ip = ipn = ntohl(ip);
for (i = 32; i; i--, ipn *= 2)
if (ipn & 0x80000000)
cnt++;
else
break;
ipn = 0;
for (i = 32, j = cnt; i; i--, j--) {
ipn *= 2;
if (j > 0)
ipn++;
}
if (ipn == ip)
return (cnt);
return (-1);
}
diff --git a/sbin/ipf/libipf/count6bits.c b/sbin/ipf/libipf/count6bits.c
index fd4f11226c0b..ff013046613c 100644
--- a/sbin/ipf/libipf/count6bits.c
+++ b/sbin/ipf/libipf/count6bits.c
@@ -1,29 +1,28 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
int
count6bits(u_32_t *msk)
{
int i = 0, k;
u_32_t j;
for (k = 3; k >= 0; k--)
if (msk[k] == 0xffffffff)
i += 32;
else {
for (j = msk[k]; j; j <<= 1)
if (j & 0x80000000)
i++;
}
return (i);
}
diff --git a/sbin/ipf/libipf/debug.c b/sbin/ipf/libipf/debug.c
index 0e3276e21705..9fcdf98317bd 100644
--- a/sbin/ipf/libipf/debug.c
+++ b/sbin/ipf/libipf/debug.c
@@ -1,43 +1,42 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
# include <stdarg.h>
#include <stdio.h>
#include "ipf.h"
#include "opts.h"
int debuglevel = 0;
void
debug(int level, char *fmt, ...)
{
va_list pvar;
va_start(pvar, fmt);
if ((debuglevel > 0) && (level <= debuglevel))
vfprintf(stderr, fmt, pvar);
va_end(pvar);
}
void
ipfkdebug(char *fmt, ...)
{
va_list pvar;
va_start(pvar, fmt);
if (opts & OPT_DEBUG)
debug(0x1fffffff, fmt, pvar);
va_end(pvar);
}
diff --git a/sbin/ipf/libipf/facpri.c b/sbin/ipf/libipf/facpri.c
index 3286248d3205..eac41abcfea5 100644
--- a/sbin/ipf/libipf/facpri.c
+++ b/sbin/ipf/libipf/facpri.c
@@ -1,149 +1,148 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <sys/types.h>
#if !defined(__SVR4) && !defined(__svr4__)
#include <strings.h>
#endif
#include <stdlib.h>
#include <unistd.h>
#include <stddef.h>
#include <syslog.h>
#include "facpri.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
typedef struct table {
char *name;
int value;
} table_t;
table_t facs[] = {
{ "kern", LOG_KERN }, { "user", LOG_USER },
{ "mail", LOG_MAIL }, { "daemon", LOG_DAEMON },
{ "auth", LOG_AUTH }, { "syslog", LOG_SYSLOG },
{ "lpr", LOG_LPR }, { "news", LOG_NEWS },
{ "uucp", LOG_UUCP },
#if LOG_CRON == LOG_CRON2
{ "cron2", LOG_CRON1 },
#else
{ "cron", LOG_CRON1 },
#endif
#ifdef LOG_FTP
{ "ftp", LOG_FTP },
#endif
#ifdef LOG_AUTHPRIV
{ "authpriv", LOG_AUTHPRIV },
#endif
#ifdef LOG_AUDIT
{ "audit", LOG_AUDIT },
#endif
#ifdef LOG_LFMT
{ "logalert", LOG_LFMT },
#endif
#if LOG_CRON == LOG_CRON1
{ "cron", LOG_CRON2 },
#else
{ "cron2", LOG_CRON2 },
#endif
#ifdef LOG_SECURITY
{ "security", LOG_SECURITY },
#endif
{ "local0", LOG_LOCAL0 }, { "local1", LOG_LOCAL1 },
{ "local2", LOG_LOCAL2 }, { "local3", LOG_LOCAL3 },
{ "local4", LOG_LOCAL4 }, { "local5", LOG_LOCAL5 },
{ "local6", LOG_LOCAL6 }, { "local7", LOG_LOCAL7 },
{ NULL, 0 }
};
/*
* map a facility number to its name
*/
char *
fac_toname(int facpri)
{
int i, j, fac;
fac = facpri & LOG_FACMASK;
j = fac >> 3;
if (j < (sizeof(facs)/sizeof(facs[0]))) {
if (facs[j].value == fac)
return (facs[j].name);
}
for (i = 0; facs[i].name; i++)
if (fac == facs[i].value)
return (facs[i].name);
return (NULL);
}
/*
* map a facility name to its number
*/
int
fac_findname(char *name)
{
int i;
for (i = 0; facs[i].name; i++)
if (!strcmp(facs[i].name, name))
return (facs[i].value);
return (-1);
}
table_t pris[] = {
{ "emerg", LOG_EMERG }, { "alert", LOG_ALERT },
{ "crit", LOG_CRIT }, { "err", LOG_ERR },
{ "warn", LOG_WARNING }, { "notice", LOG_NOTICE },
{ "info", LOG_INFO }, { "debug", LOG_DEBUG },
{ NULL, 0 }
};
/*
* map a facility name to its number
*/
int
pri_findname(char *name)
{
int i;
for (i = 0; pris[i].name; i++)
if (!strcmp(pris[i].name, name))
return (pris[i].value);
return (-1);
}
/*
* map a priority number to its name
*/
char *
pri_toname(int facpri)
{
int i, pri;
pri = facpri & LOG_PRIMASK;
if (pris[pri].value == pri)
return (pris[pri].name);
for (i = 0; pris[i].name; i++)
if (pri == pris[i].value)
return (pris[i].name);
return (NULL);
}
diff --git a/sbin/ipf/libipf/facpri.h b/sbin/ipf/libipf/facpri.h
index 5698c0ebe047..dac5c591410c 100644
--- a/sbin/ipf/libipf/facpri.h
+++ b/sbin/ipf/libipf/facpri.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#ifndef __FACPRI_H__
#define __FACPRI_H__
#ifndef __P
# define P_DEF
# define __P(x) x
#endif
extern char *fac_toname(int);
extern int fac_findname(char *);
extern char *pri_toname(int);
extern int pri_findname(char *);
#ifdef P_DEF
# undef __P
# undef P_DEF
#endif
#if LOG_CRON == (9<<3)
# define LOG_CRON1 LOG_CRON
# define LOG_CRON2 (15<<3)
#endif
#if LOG_CRON == (15<<3)
# define LOG_CRON1 (9<<3)
# define LOG_CRON2 LOG_CRON
#endif
#endif /* __FACPRI_H__ */
diff --git a/sbin/ipf/libipf/fill6bits.c b/sbin/ipf/libipf/fill6bits.c
index b8f5914ef426..e9e8b7fe7099 100644
--- a/sbin/ipf/libipf/fill6bits.c
+++ b/sbin/ipf/libipf/fill6bits.c
@@ -1,47 +1,46 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
fill6bits(int bits, u_int *msk)
{
if (bits == 0) {
msk[0] = 0;
msk[1] = 0;
msk[2] = 0;
msk[3] = 0;
return;
}
msk[0] = 0xffffffff;
msk[1] = 0xffffffff;
msk[2] = 0xffffffff;
msk[3] = 0xffffffff;
if (bits == 128)
return;
if (bits > 96) {
msk[3] = htonl(msk[3] << (128 - bits));
} else if (bits > 64) {
msk[3] = 0;
msk[2] = htonl(msk[2] << (96 - bits));
} else if (bits > 32) {
msk[3] = 0;
msk[2] = 0;
msk[1] = htonl(msk[1] << (64 - bits));
} else {
msk[3] = 0;
msk[2] = 0;
msk[1] = 0;
msk[0] = htonl(msk[0] << (32 - bits));
}
}
diff --git a/sbin/ipf/libipf/flags.c b/sbin/ipf/libipf/flags.c
index 05fcc9874866..f16624b97d4f 100644
--- a/sbin/ipf/libipf/flags.c
+++ b/sbin/ipf/libipf/flags.c
@@ -1,25 +1,24 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
/*
* ECN is a new addition to TCP - RFC 2481
*/
#ifndef TH_ECN
# define TH_ECN 0x40
#endif
#ifndef TH_CWR
# define TH_CWR 0x80
#endif
char flagset[] = "FSRPAUEC";
u_char flags[] = { TH_FIN, TH_SYN, TH_RST, TH_PUSH, TH_ACK, TH_URG,
TH_ECN, TH_CWR };
diff --git a/sbin/ipf/libipf/gethost.c b/sbin/ipf/libipf/gethost.c
index aefdbbae9fb3..6ae34a577519 100644
--- a/sbin/ipf/libipf/gethost.c
+++ b/sbin/ipf/libipf/gethost.c
@@ -1,74 +1,73 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
int
gethost(int family, char *name, i6addr_t *hostp)
{
struct hostent *h;
struct netent *n;
u_32_t addr;
bzero(hostp, sizeof(*hostp));
if (!strcmp(name, "test.host.dots")) {
if (family == AF_INET) {
hostp->in4.s_addr = htonl(0xfedcba98);
}
#ifdef USE_INET6
if (family == AF_INET6) {
hostp->i6[0] = htonl(0xfe80aa55);
hostp->i6[1] = htonl(0x12345678);
hostp->i6[2] = htonl(0x5a5aa5a5);
hostp->i6[3] = htonl(0xfedcba98);
}
#endif
return (0);
}
if (!strcmp(name, "<thishost>"))
name = thishost;
if (family == AF_INET) {
h = gethostbyname(name);
if (h != NULL) {
if ((h->h_addr != NULL) &&
(h->h_length == sizeof(addr))) {
bcopy(h->h_addr, (char *)&addr, sizeof(addr));
hostp->in4.s_addr = addr;
return (0);
}
}
n = getnetbyname(name);
if (n != NULL) {
hostp->in4.s_addr = htonl(n->n_net & 0xffffffff);
return (0);
}
}
#ifdef USE_INET6
if (family == AF_INET6) {
struct addrinfo hints, *res;
struct sockaddr_in6 *sin6;
bzero((char *)&hints, sizeof(hints));
hints.ai_family = PF_INET6;
getaddrinfo(name, NULL, &hints, &res);
if (res != NULL) {
sin6 = (struct sockaddr_in6 *)res->ai_addr;
hostp->in6 = sin6->sin6_addr;
freeaddrinfo(res);
return (0);
}
}
#endif
return (-1);
}
diff --git a/sbin/ipf/libipf/getifname.c b/sbin/ipf/libipf/getifname.c
index a2d9ef6885d1..970f2a6707bb 100644
--- a/sbin/ipf/libipf/getifname.c
+++ b/sbin/ipf/libipf/getifname.c
@@ -1,54 +1,53 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include "kmem.h"
/*
* Given a pointer to an interface in the kernel, return a pointer to a
* string which is the interface name.
*/
char *
getifname(struct ifnet *ptr)
{
#if SOLARIS
# include <sys/mutex.h>
# include <sys/condvar.h>
# include "../pfil/qif.h"
char *ifname;
qif_t qif;
if ((void *)ptr == (void *)-1)
return ("!");
if (ptr == NULL)
return ("-");
if (kmemcpy((char *)&qif, (u_long)ptr, sizeof(qif)) == -1)
return ("X");
ifname = strdup(qif.qf_name);
if ((ifname != NULL) && (*ifname == '\0')) {
free(ifname);
return ("!");
}
return (ifname);
#else
struct ifnet netif;
if ((void *)ptr == (void *)-1)
return ("!");
if (ptr == NULL)
return ("-");
if (kmemcpy((char *)&netif, (u_long)ptr, sizeof(netif)) == -1)
return ("X");
return (strdup(netif.if_xname));
#endif
}
diff --git a/sbin/ipf/libipf/getnattype.c b/sbin/ipf/libipf/getnattype.c
index 3e3853208dc1..60ab7793a325 100644
--- a/sbin/ipf/libipf/getnattype.c
+++ b/sbin/ipf/libipf/getnattype.c
@@ -1,69 +1,68 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* Added redirect stuff and a variety of bug fixes. (mcn@EnGarde.com)
*/
#include "ipf.h"
#include "kmem.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
/*
* Get a nat filter type given its kernel address.
*/
char *
getnattype(nat_t *nat)
{
static char unknownbuf[20];
char *which;
if (!nat)
return ("???");
switch (nat->nat_redir)
{
case NAT_MAP :
which = "MAP";
break;
case NAT_MAPBLK :
which = "MAP-BLOCK";
break;
case NAT_REDIRECT :
which = "RDR";
break;
case NAT_MAP|NAT_REWRITE :
which = "RWR-MAP";
break;
case NAT_REDIRECT|NAT_REWRITE :
which = "RWR-RDR";
break;
case NAT_BIMAP :
which = "BIMAP";
break;
case NAT_REDIRECT|NAT_DIVERTUDP :
which = "DIV-RDR";
break;
case NAT_MAP|NAT_DIVERTUDP :
which = "DIV-MAP";
break;
case NAT_REDIRECT|NAT_ENCAP :
which = "ENC-RDR";
break;
case NAT_MAP|NAT_ENCAP :
which = "ENC-MAP";
break;
default :
snprintf(unknownbuf, sizeof(unknownbuf), "unknown(%04x)",
nat->nat_redir & 0xffffffff);
which = unknownbuf;
break;
}
return (which);
}
diff --git a/sbin/ipf/libipf/getport.c b/sbin/ipf/libipf/getport.c
index ea52fad3234c..8b659b2761b3 100644
--- a/sbin/ipf/libipf/getport.c
+++ b/sbin/ipf/libipf/getport.c
@@ -1,88 +1,87 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include <ctype.h>
int
getport(frentry_t *fr, char *name, u_short *port, char *proto)
{
struct protoent *p;
struct servent *s;
u_short p1;
if (fr == NULL || fr->fr_type != FR_T_IPF) {
s = getservbyname(name, proto);
if (s != NULL) {
*port = s->s_port;
return (0);
}
if (ISDIGIT(*name)) {
int portval = atoi(name);
if (portval < 0 || portval > 65535)
return (-1);
*port = htons((u_short)portval);
return (0);
}
return (-1);
}
/*
* Some people will use port names in rules without specifying
* either TCP or UDP because it is implied by the group head.
* If we don't know the protocol, then the best we can do here is
* to take either only the TCP or UDP mapping (if one or the other
* is missing) or make sure both of them agree.
*/
if (fr->fr_proto == 0) {
s = getservbyname(name, "tcp");
if (s != NULL)
p1 = s->s_port;
else
p1 = 0;
s = getservbyname(name, "udp");
if (s != NULL) {
if (p1 != s->s_port)
return (-1);
}
if ((p1 == 0) && (s == NULL))
return (-1);
if (p1)
*port = p1;
else
*port = s->s_port;
return (0);
}
if ((fr->fr_flx & FI_TCPUDP) != 0) {
/*
* If a rule is "tcp/udp" then check that both TCP and UDP
* mappings for this protocol name match ports.
*/
s = getservbyname(name, "tcp");
if (s == NULL)
return (-1);
p1 = s->s_port;
s = getservbyname(name, "udp");
if (s == NULL || s->s_port != p1)
return (-1);
*port = p1;
return (0);
}
p = getprotobynumber(fr->fr_proto);
s = getservbyname(name, p ? p->p_name : NULL);
if (s != NULL) {
*port = s->s_port;
return (0);
}
return (-1);
}
diff --git a/sbin/ipf/libipf/getportproto.c b/sbin/ipf/libipf/getportproto.c
index 9f84ab21c476..637b000d8d51 100644
--- a/sbin/ipf/libipf/getportproto.c
+++ b/sbin/ipf/libipf/getportproto.c
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <ctype.h>
#include "ipf.h"
int
getportproto(char *name, int proto)
{
struct servent *s;
struct protoent *p;
if (ISDIGIT(*name)) {
int number;
char *s;
for (s = name; *s != '\0'; s++)
if (!ISDIGIT(*s))
return (-1);
number = atoi(name);
if (number < 0 || number > 65535)
return (-1);
return (htons(number));
}
p = getprotobynumber(proto);
s = getservbyname(name, p ? p->p_name : NULL);
if (s != NULL)
return (s->s_port);
return (-1);
}
diff --git a/sbin/ipf/libipf/getproto.c b/sbin/ipf/libipf/getproto.c
index 4d3f2d9e1ea2..139bfd3ee41a 100644
--- a/sbin/ipf/libipf/getproto.c
+++ b/sbin/ipf/libipf/getproto.c
@@ -1,35 +1,34 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include <ctype.h>
int getproto(char *name);
int
getproto(char *name)
{
struct protoent *p;
char *s;
for (s = name; *s != '\0'; s++)
if (!ISDIGIT(*s))
break;
if (*s == '\0')
return (atoi(name));
if (!strcasecmp(name, "ip"))
return (0);
p = getprotobyname(name);
if (p != NULL)
return (p->p_proto);
return (-1);
}
diff --git a/sbin/ipf/libipf/getsumd.c b/sbin/ipf/libipf/getsumd.c
index 3d66d273f843..ede6f7ea134d 100644
--- a/sbin/ipf/libipf/getsumd.c
+++ b/sbin/ipf/libipf/getsumd.c
@@ -1,23 +1,22 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
char *
getsumd(u_32_t sum)
{
static char sumdbuf[17];
if (sum & NAT_HW_CKSUM)
snprintf(sumdbuf, sizeof(sumdbuf), "hw(%#0x)", sum & 0xffff);
else
snprintf(sumdbuf, sizeof(sumdbuf), "%#0x", sum);
return (sumdbuf);
}
diff --git a/sbin/ipf/libipf/hostname.c b/sbin/ipf/libipf/hostname.c
index 3b179954bbff..1c3d3451b487 100644
--- a/sbin/ipf/libipf/hostname.c
+++ b/sbin/ipf/libipf/hostname.c
@@ -1,59 +1,58 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
char *
hostname(int family, void *ip)
{
static char hostbuf[MAXHOSTNAMELEN+1];
struct hostent *hp;
struct in_addr ipa;
struct netent *np;
memset(&ipa, 0, sizeof(ipa)); /* XXX gcc */
if (family == AF_INET) {
ipa.s_addr = *(u_32_t *)ip;
if (ipa.s_addr == htonl(0xfedcba98))
return ("test.host.dots");
}
if ((opts & OPT_NORESOLVE) == 0) {
if (family == AF_INET) {
hp = gethostbyaddr(ip, 4, AF_INET);
if (hp != NULL && hp->h_name != NULL &&
*hp->h_name != '\0') {
strncpy(hostbuf, hp->h_name, sizeof(hostbuf));
hostbuf[sizeof(hostbuf) - 1] = '\0';
return (hostbuf);
}
np = getnetbyaddr(ipa.s_addr, AF_INET);
if (np != NULL && np->n_name != NULL &&
*np->n_name != '\0') {
strncpy(hostbuf, np->n_name, sizeof(hostbuf));
hostbuf[sizeof(hostbuf) - 1] = '\0';
return (hostbuf);
}
}
}
if (family == AF_INET) {
return (inet_ntoa(ipa));
}
#ifdef USE_INET6
(void) inet_ntop(AF_INET6, ip, hostbuf, sizeof(hostbuf) - 1);
hostbuf[MAXHOSTNAMELEN] = '\0';
return (hostbuf);
#else
return ("IPv6");
#endif
}
diff --git a/sbin/ipf/libipf/icmpcode.c b/sbin/ipf/libipf/icmpcode.c
index e898ebfa39a5..b7fc15451e08 100644
--- a/sbin/ipf/libipf/icmpcode.c
+++ b/sbin/ipf/libipf/icmpcode.c
@@ -1,24 +1,23 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <ctype.h>
#include "ipf.h"
#ifndef MIN
# define MIN(a,b) ((a) > (b) ? (b) : (a))
#endif
char *icmpcodes[MAX_ICMPCODE + 1] = {
"net-unr", "host-unr", "proto-unr", "port-unr", "needfrag", "srcfail",
"net-unk", "host-unk", "isolate", "net-prohib", "host-prohib",
"net-tos", "host-tos", "filter-prohib", "host-preced", "preced-cutoff",
NULL };
diff --git a/sbin/ipf/libipf/inet_addr.c b/sbin/ipf/libipf/inet_addr.c
index 367c25f44d51..11e468eb09f7 100644
--- a/sbin/ipf/libipf/inet_addr.c
+++ b/sbin/ipf/libipf/inet_addr.c
@@ -1,201 +1,200 @@
-/* $FreeBSD$ */
/*
* ++Copyright++ 1983, 1990, 1993
* -
* Copyright (c) 1983, 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
* -
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies, and that
* the name of Digital Equipment Corporation not be used in advertising or
* publicity pertaining to distribution of the document or software without
* specific, written prior permission.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
* -
* --Copyright--
*/
#if !defined(lint)
static const char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93";
static const char rcsid[] = "@(#)$Id: inet_addr.c,v 1.8.2.3 2004/12/09 19:41:20 darrenr Exp $";
#endif /* LIBC_SCCS and not lint */
#include <sys/param.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <ctype.h>
#ifndef __P
# define __P(x) x
#endif
int inet_aton(const char *, struct in_addr *);
/*
* Because the ctype(3) posix definition, if used "safely" in code everywhere,
* would mean all normal code that walks through strings needed casts. Yuck.
*/
#define ISALNUM(x) isalnum((u_char)(x))
#define ISALPHA(x) isalpha((u_char)(x))
#define ISASCII(x) isascii((u_char)(x))
#define ISDIGIT(x) isdigit((u_char)(x))
#define ISPRINT(x) isprint((u_char)(x))
#define ISSPACE(x) isspace((u_char)(x))
#define ISUPPER(x) isupper((u_char)(x))
#define ISXDIGIT(x) isxdigit((u_char)(x))
#define ISLOWER(x) islower((u_char)(x))
/*
* Check whether "cp" is a valid ascii representation
* of an Internet address and convert to a binary address.
* Returns 1 if the address is valid, 0 if not.
* This replaces inet_addr, the return value from which
* cannot distinguish between failure and a local broadcast address.
*/
int
inet_aton(register const char *cp, struct in_addr *addr)
{
register u_long val;
register int base, n;
register char c;
u_int parts[4];
register u_int *pp = parts;
c = *cp;
for (;;) {
/*
* Collect number up to ``.''.
* Values are specified as for C:
* 0x=hex, 0=octal, isdigit=decimal.
*/
if (!ISDIGIT(c))
return (0);
val = 0; base = 10;
if (c == '0') {
c = *++cp;
if (c == 'x' || c == 'X')
base = 16, c = *++cp;
else
base = 8;
}
for (;;) {
if (ISASCII(c) && ISDIGIT(c)) {
val = (val * base) + (c - '0');
c = *++cp;
} else if (base == 16 && ISASCII(c) && ISXDIGIT(c)) {
val = (val << 4) |
(c + 10 - (ISLOWER(c) ? 'a' : 'A'));
c = *++cp;
} else
break;
}
if (c == '.') {
/*
* Internet format:
* a.b.c.d
* a.b.c (with c treated as 16 bits)
* a.b (with b treated as 24 bits)
*/
if (pp >= parts + 3)
return (0);
*pp++ = val;
c = *++cp;
} else
break;
}
/*
* Check for trailing characters.
*/
if (c != '\0' && (!ISASCII(c) || !ISSPACE(c)))
return (0);
/*
* Concoct the address according to
* the number of parts specified.
*/
n = pp - parts + 1;
switch (n) {
case 0:
return (0); /* initial nondigit */
case 1: /* a -- 32 bits */
break;
case 2: /* a.b -- 8.24 bits */
if (val > 0xffffff)
return (0);
val |= parts[0] << 24;
break;
case 3: /* a.b.c -- 8.8.16 bits */
if (val > 0xffff)
return (0);
val |= (parts[0] << 24) | (parts[1] << 16);
break;
case 4: /* a.b.c.d -- 8.8.8.8 bits */
if (val > 0xff)
return (0);
val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
break;
}
if (addr)
addr->s_addr = htonl(val);
return (1);
}
/* these are compatibility routines, not needed on recent BSD releases */
/*
* Ascii internet address interpretation routine.
* The value returned is in network order.
*/
#if 0
inet_addr(const char *cp)
{
struct in_addr val;
if (inet_aton(cp, &val))
return (val.s_addr);
return (0xffffffff);
}
#endif
diff --git a/sbin/ipf/libipf/initparse.c b/sbin/ipf/libipf/initparse.c
index c85d6d3ed69d..2cb8906555dd 100644
--- a/sbin/ipf/libipf/initparse.c
+++ b/sbin/ipf/libipf/initparse.c
@@ -1,20 +1,19 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
char thishost[MAXHOSTNAMELEN];
void initparse(void)
{
gethostname(thishost, sizeof(thishost));
thishost[sizeof(thishost) - 1] = '\0';
}
diff --git a/sbin/ipf/libipf/ionames.c b/sbin/ipf/libipf/ionames.c
index 9b586422a392..9b2442f4e6e3 100644
--- a/sbin/ipf/libipf/ionames.c
+++ b/sbin/ipf/libipf/ionames.c
@@ -1,41 +1,40 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
struct ipopt_names ionames[] ={
{ IPOPT_NOP, 0x000001, 1, "nop" }, /* RFC791 */
{ IPOPT_RR, 0x000002, 8, "rr" }, /* 1 route */
{ IPOPT_ZSU, 0x000004, 4, "zsu" }, /* size ?? */
{ IPOPT_MTUP, 0x000008, 4, "mtup" }, /* RFC1191 */
{ IPOPT_MTUR, 0x000010, 4, "mtur" }, /* RFC1191 */
{ IPOPT_ENCODE, 0x000020, 4, "encode" }, /* size ?? */
{ IPOPT_TS, 0x000040, 8, "ts" }, /* 1 TS */
{ IPOPT_TR, 0x000080, 4, "tr" }, /* RFC1393 */
{ IPOPT_SECURITY,0x000100, 12, "sec" }, /* RFC1108 */
{ IPOPT_SECURITY,0x000100, 12, "sec-class" }, /* RFC1108 */
{ IPOPT_LSRR, 0x000200, 8, "lsrr" }, /* 1 route */
{ IPOPT_E_SEC, 0x000400, 8, "e-sec" }, /* RFC1108 */
{ IPOPT_CIPSO, 0x000800, 8, "cipso" }, /* size ?? */
{ IPOPT_SATID, 0x001000, 4, "satid" }, /* RFC791 */
{ IPOPT_SSRR, 0x002000, 8, "ssrr" }, /* 1 route */
{ IPOPT_ADDEXT, 0x004000, 4, "addext" }, /* IPv7 ?? */
{ IPOPT_VISA, 0x008000, 4, "visa" }, /* size ?? */
{ IPOPT_IMITD, 0x010000, 4, "imitd" }, /* size ?? */
{ IPOPT_EIP, 0x020000, 4, "eip" }, /* RFC1385 */
{ IPOPT_FINN, 0x040000, 4, "finn" }, /* size ?? */
{ IPOPT_DPS, 0x080000, 4, "dps" }, /* size ?? */
{ IPOPT_SDB, 0x100000, 4, "sdb" }, /* size ?? */
{ IPOPT_NSAPA, 0x200000, 4, "nsapa" }, /* size ?? */
{ IPOPT_RTRALRT,0x400000, 4, "rtralrt" }, /* RFC2113 */
{ IPOPT_UMP, 0x800000, 4, "ump" }, /* size ?? */
{ IPOPT_AH, 0x1000000, 0, "ah" }, /* IPPROTO_AH */
{ 0, 0, 0, (char *)NULL } /* must be last */
};
diff --git a/sbin/ipf/libipf/ipf_dotuning.c b/sbin/ipf/libipf/ipf_dotuning.c
index 1db47d76eac1..e435ce035194 100644
--- a/sbin/ipf/libipf/ipf_dotuning.c
+++ b/sbin/ipf/libipf/ipf_dotuning.c
@@ -1,71 +1,70 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include "netinet/ipl.h"
#include <sys/ioctl.h>
void ipf_dotuning(int fd, char *tuneargs, ioctlfunc_t iocfn)
{
ipfobj_t obj;
ipftune_t tu;
char *s, *t;
bzero((char *)&tu, sizeof(tu));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(tu);;
obj.ipfo_ptr = (void *)&tu;
obj.ipfo_type = IPFOBJ_TUNEABLE;
for (s = strtok(tuneargs, ","); s != NULL; s = strtok(NULL, ",")) {
if (!strcmp(s, "list")) {
while (1) {
if ((*iocfn)(fd, SIOCIPFGETNEXT, &obj) == -1) {
ipf_perror_fd(fd, iocfn,
"ioctl(SIOCIPFGETNEXT)");
break;
}
if (tu.ipft_cookie == NULL)
break;
tu.ipft_name[sizeof(tu.ipft_name) - 1] = '\0';
printtunable(&tu);
}
} else if ((t = strchr(s, '=')) != NULL) {
tu.ipft_cookie = NULL;
*t++ = '\0';
strncpy(tu.ipft_name, s, sizeof(tu.ipft_name));
if (sscanf(t, "%lu", &tu.ipft_vlong) == 1) {
if ((*iocfn)(fd, SIOCIPFSET, &obj) == -1) {
ipf_perror_fd(fd, iocfn,
"ioctl(SIOCIPFSET)");
return;
}
} else {
fprintf(stderr, "invalid value '%s'\n", s);
return;
}
} else {
tu.ipft_cookie = NULL;
strncpy(tu.ipft_name, s, sizeof(tu.ipft_name));
if ((*iocfn)(fd, SIOCIPFGET, &obj) == -1) {
ipf_perror_fd(fd, iocfn, "ioctl(SIOCIPFGET)");
return;
}
if (tu.ipft_cookie == NULL) {
fprintf(stderr, "Null cookie for %s\n", s);
return;
}
tu.ipft_name[sizeof(tu.ipft_name) - 1] = '\0';
printtunable(&tu);
}
}
}
diff --git a/sbin/ipf/libipf/ipft_hx.c b/sbin/ipf/libipf/ipft_hx.c
index a540b52da05d..d6ae80ec4efd 100644
--- a/sbin/ipf/libipf/ipft_hx.c
+++ b/sbin/ipf/libipf/ipft_hx.c
@@ -1,182 +1,181 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ipft_hx.c 1.1 3/9/96 (C) 1996 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <ctype.h>
#include "ipf.h"
#include "ipt.h"
extern int opts;
static int hex_open(char *);
static int hex_close(void);
static int hex_readip(mb_t *, char **, int *);
static char *readhex(char *, char *);
struct ipread iphex = { hex_open, hex_close, hex_readip, 0 };
static FILE *tfp = NULL;
static int tfd = -1;
static int
hex_open(char *fname)
{
if (tfp && tfd != -1) {
rewind(tfp);
return (tfd);
}
if (!strcmp(fname, "-")) {
tfd = 0;
tfp = stdin;
} else {
tfd = open(fname, O_RDONLY);
if (tfd != -1)
tfp = fdopen(tfd, "r");
}
return (tfd);
}
static int
hex_close(void)
{
int cfd = tfd;
tfd = -1;
return (close(cfd));
}
static int
hex_readip(mb_t *mb, char **ifn, int *dir)
{
register char *s, *t, *u;
char line[513];
ip_t *ip;
char *buf;
buf = (char *)mb->mb_buf;
/*
* interpret start of line as possibly "[ifname]" or
* "[in/out,ifname]".
*/
if (ifn)
*ifn = NULL;
if (dir)
*dir = 0;
ip = (ip_t *)buf;
while (fgets(line, sizeof(line)-1, tfp)) {
if ((s = strchr(line, '\n'))) {
if (s == line) {
mb->mb_len = (char *)ip - buf;
return (mb->mb_len);
}
*s = '\0';
}
if ((s = strchr(line, '#')))
*s = '\0';
if (!*line)
continue;
if ((opts & OPT_DEBUG) != 0) {
printf("input: %s", line);
}
if ((*line == '[') && (s = strchr(line, ']'))) {
t = line + 1;
if (s - t > 0) {
*s++ = '\0';
if ((u = strchr(t, ',')) && (u < s)) {
u++;
if (ifn)
*ifn = strdup(u);
if (dir) {
if (*t == 'i')
*dir = 0;
else if (*t == 'o')
*dir = 1;
}
} else if (ifn)
*ifn = t;
}
while (*s++ == '+') {
if (!strncasecmp(s, "mcast", 5)) {
mb->mb_flags |= M_MCAST;
s += 5;
}
if (!strncasecmp(s, "bcast", 5)) {
mb->mb_flags |= M_BCAST;
s += 5;
}
if (!strncasecmp(s, "mbcast", 6)) {
mb->mb_flags |= M_MBCAST;
s += 6;
}
}
while (ISSPACE(*s))
s++;
} else
s = line;
t = (char *)ip;
ip = (ip_t *)readhex(s, (char *)ip);
if ((opts & OPT_DEBUG) != 0) {
if (opts & OPT_ASCII) {
int c = *t;
if (t < (char *)ip)
putchar('\t');
while (t < (char *)ip) {
if (isprint(c) && isascii(c))
putchar(c);
else
putchar('.');
t++;
}
}
putchar('\n');
fflush(stdout);
}
}
if (feof(tfp))
return (0);
return (-1);
}
static char
*readhex(register char *src, register char *dst)
{
int state = 0;
char c;
while ((c = *src++)) {
if (ISSPACE(c)) {
if (state) {
dst++;
state = 0;
}
continue;
} else if ((c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||
(c >= 'A' && c <= 'F')) {
c = ISDIGIT(c) ? (c - '0') : (TOUPPER(c) - 55);
if (state == 0) {
*dst = (c << 4);
state++;
} else {
*dst++ |= c;
state = 0;
}
} else
break;
}
return (dst);
}
diff --git a/sbin/ipf/libipf/ipft_pc.c b/sbin/ipf/libipf/ipft_pc.c
index 349b9390e745..0f4a9f6a5983 100644
--- a/sbin/ipf/libipf/ipft_pc.c
+++ b/sbin/ipf/libipf/ipft_pc.c
@@ -1,249 +1,248 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include "ipt.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
struct llc {
int lc_type;
int lc_sz; /* LLC header length */
int lc_to; /* LLC Type offset */
int lc_tl; /* LLC Type length */
};
/*
* While many of these maybe the same, some do have different header formats
* which make this useful.
*/
static struct llc llcs[] = {
{ 0, 0, 0, 0 }, /* DLT_NULL */
{ 1, 14, 12, 2 }, /* DLT_Ethernet */
{ 10, 0, 0, 0 }, /* DLT_FDDI */
{ 12, 0, 0, 0 }, /* DLT_RAW */
{ -1, -1, -1, -1 }
};
typedef struct {
u_int id;
u_short major;
u_short minor;
u_int timezone;
u_int sigfigs;
u_int snaplen;
u_int type;
} fileheader_t;
typedef struct {
u_32_t seconds;
u_32_t microseconds;
u_32_t caplen;
u_32_t wirelen;
} packetheader_t;
static int ipcap_open(char *);
static int ipcap_close(void);
static int ipcap_readip(mb_t *, char **, int *);
static int ipcap_read_rec(packetheader_t *);
static void iswap_hdr(fileheader_t *);
static int pfd = -1, swapped = 0;
static struct llc *llcp = NULL;
struct ipread pcap = { ipcap_open, ipcap_close, ipcap_readip, 0 };
#define SWAPLONG(y) \
((((y)&0xff)<<24) | (((y)&0xff00)<<8) | (((y)&0xff0000)>>8) | (((y)>>24)&0xff))
#define SWAPSHORT(y) \
( (((y)&0xff)<<8) | (((y)&0xff00)>>8) )
static void
iswap_hdr(fileheader_t *p)
{
p->major = SWAPSHORT(p->major);
p->minor = SWAPSHORT(p->minor);
p->timezone = SWAPLONG(p->timezone);
p->sigfigs = SWAPLONG(p->sigfigs);
p->snaplen = SWAPLONG(p->snaplen);
p->type = SWAPLONG(p->type);
}
static int
ipcap_open(char *fname)
{
fileheader_t ph;
int fd, i;
if (pfd != -1)
return (pfd);
if (!strcmp(fname, "-"))
fd = 0;
else if ((fd = open(fname, O_RDONLY)) == -1)
return (-1);
if (read(fd, (char *)&ph, sizeof(ph)) != sizeof(ph))
return (-2);
if (ph.id != 0xa1b2c3d4) {
if (SWAPLONG(ph.id) != 0xa1b2c3d4) {
(void) close(fd);
return (-2);
}
swapped = 1;
iswap_hdr(&ph);
}
for (i = 0; llcs[i].lc_type != -1; i++)
if (llcs[i].lc_type == ph.type) {
llcp = llcs + i;
break;
}
if (llcp == NULL) {
(void) close(fd);
return (-2);
}
pfd = fd;
printf("opened pcap file %s:\n", fname);
printf("\tid: %08x version: %d.%d type: %d snap %d\n",
ph.id, ph.major, ph.minor, ph.type, ph.snaplen);
return (fd);
}
static int
ipcap_close(void)
{
return (close(pfd));
}
/*
* read in the header (and validate) which should be the first record
* in a pcap file.
*/
static int
ipcap_read_rec(packetheader_t *rec)
{
int n, p, i;
n = sizeof(*rec);
while (n > 0) {
i = read(pfd, (char *)rec, sizeof(*rec));
if (i <= 0)
return (-2);
n -= i;
}
if (swapped) {
rec->caplen = SWAPLONG(rec->caplen);
rec->wirelen = SWAPLONG(rec->wirelen);
rec->seconds = SWAPLONG(rec->seconds);
rec->microseconds = SWAPLONG(rec->microseconds);
}
p = rec->caplen;
n = MIN(p, rec->wirelen);
if (!n || n < 0)
return (-3);
if (p < 0 || p > 65536)
return (-4);
return (p);
}
#ifdef notyet
/*
* read an entire pcap packet record. only the data part is copied into
* the available buffer, with the number of bytes copied returned.
*/
static int
ipcap_read(char *buf, int cnt)
{
packetheader_t rec;
static char *bufp = NULL;
int i, n;
if ((i = ipcap_read_rec(&rec)) <= 0)
return (i);
if (!bufp)
bufp = malloc(i);
else
bufp = realloc(bufp, i);
if (read(pfd, bufp, i) != i)
return (-2);
n = MIN(i, cnt);
bcopy(bufp, buf, n);
return (n);
}
#endif
/*
* return only an IP packet read into buf
*/
static int
ipcap_readip(mb_t *mb, char **ifn, int *dir)
{
static char *bufp = NULL;
packetheader_t rec;
struct llc *l;
char *s, ty[4];
int i, j, n;
char *buf;
int cnt;
#if 0
ifn = ifn; /* gcc -Wextra */
dir = dir; /* gcc -Wextra */
#endif
buf = (char *)mb->mb_buf;
cnt = sizeof(mb->mb_buf);
l = llcp;
/* do { */
if ((i = ipcap_read_rec(&rec)) <= 0)
return (i);
if (!bufp)
bufp = malloc(i);
else
bufp = realloc(bufp, i);
s = bufp;
for (j = i, n = 0; j > 0; ) {
n = read(pfd, s, j);
if (n <= 0)
return (-2);
j -= n;
s += n;
}
s = bufp;
i -= l->lc_sz;
s += l->lc_to;
bcopy(s, ty, l->lc_tl);
s += l->lc_tl;
/* } while (ty[0] != 0x8 && ty[1] != 0); */
n = MIN(i, cnt);
bcopy(s, buf, n);
mb->mb_len = n;
return (n);
}
diff --git a/sbin/ipf/libipf/ipft_tx.c b/sbin/ipf/libipf/ipft_tx.c
index 87215f5b7b6e..bab33016b9cc 100644
--- a/sbin/ipf/libipf/ipft_tx.c
+++ b/sbin/ipf/libipf/ipft_tx.c
@@ -1,500 +1,499 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#if !defined(lint)
static const char sccsid[] = "@(#)ipft_tx.c 1.7 6/5/96 (C) 1993 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
#include <ctype.h>
#include "ipf.h"
#include "ipt.h"
extern int opts;
static char *tx_proto = "";
static int text_open(char *), text_close(void);
static int text_readip(mb_t *, char **, int *);
static int parseline(char *, ip_t *, char **, int *);
static char myflagset[] = "FSRPAUEC";
static u_char myflags[] = { TH_FIN, TH_SYN, TH_RST, TH_PUSH,
TH_ACK, TH_URG, TH_ECN, TH_CWR };
struct ipread iptext = { text_open, text_close, text_readip, R_DO_CKSUM };
static FILE *tfp = NULL;
static int tfd = -1;
static u_32_t tx_hostnum(char *, int *);
static u_short tx_portnum(char *);
#ifdef USE_INET6
int parseipv6(char **, ip6_t *, char **, int *);
#endif
/*
* returns an ip address as a long var as a result of either a DNS lookup or
* straight inet_addr() call
*/
static u_32_t
tx_hostnum(char *host, int *resolved)
{
i6addr_t ipa;
*resolved = 0;
if (!strcasecmp("any", host))
return (0L);
if (ISDIGIT(*host))
return (inet_addr(host));
if (gethost(AF_INET, host, &ipa) == -1) {
*resolved = -1;
fprintf(stderr, "can't resolve hostname: %s\n", host);
return (0);
}
return (ipa.in4.s_addr);
}
/*
* find the port number given by the name, either from getservbyname() or
* straight atoi()
*/
static u_short
tx_portnum(char *name)
{
struct servent *sp;
if (ISDIGIT(*name))
return (u_short)atoi(name);
sp = getservbyname(name, tx_proto);
if (sp)
return (ntohs(sp->s_port));
(void) fprintf(stderr, "unknown service \"%s\".\n", name);
return (0);
}
static int
text_open(char *fname)
{
if (tfp && tfd != -1) {
rewind(tfp);
return (tfd);
}
if (!strcmp(fname, "-")) {
tfd = 0;
tfp = stdin;
} else {
tfd = open(fname, O_RDONLY);
if (tfd != -1)
tfp = fdopen(tfd, "r");
}
return (tfd);
}
static int
text_close(void)
{
int cfd = tfd;
tfd = -1;
return (close(cfd));
}
static int
text_readip(mb_t *mb, char **ifn, int *dir)
{
register char *s;
char line[513];
ip_t *ip;
char *buf;
buf = (char *)mb->mb_buf;
*ifn = NULL;
while (fgets(line, sizeof(line)-1, tfp)) {
if ((s = strchr(line, '\n')))
*s = '\0';
if ((s = strchr(line, '\r')))
*s = '\0';
if ((s = strchr(line, '#')))
*s = '\0';
if (!*line)
continue;
if ((opts & OPT_DEBUG) != 0)
printf("input: %s\n", line);
*ifn = NULL;
*dir = 0;
if (!parseline(line, (ip_t *)buf, ifn, dir)) {
ip = (ip_t *)buf;
if (IP_V(ip) == 6) {
#ifdef USE_INET6
mb->mb_len = ntohs(((ip6_t *)ip)->ip6_plen) +
sizeof(ip6_t);
#else
mb->mb_len = 0;
#endif
} else {
mb->mb_len = ntohs(ip->ip_len);
}
return (mb->mb_len);
}
}
if (feof(tfp))
return (0);
return (-1);
}
static int
parseline(char *line, ip_t *ip, char **ifn, int *out)
{
tcphdr_t th, *tcp = &th;
struct icmp icmp, *ic = &icmp;
char *cps[20], **cpp, c, ipopts[68];
int i, r;
if (*ifn)
free(*ifn);
bzero((char *)ip, MAX(sizeof(*tcp), sizeof(*ic)) + sizeof(*ip));
bzero((char *)tcp, sizeof(*tcp));
bzero((char *)ic, sizeof(*ic));
bzero(ipopts, sizeof(ipopts));
IP_HL_A(ip, sizeof(*ip) >> 2);
IP_V_A(ip, IPVERSION);
ip->ip_ttl = 63;
for (i = 0, cps[0] = strtok(line, " \b\t\r\n"); cps[i] && i < 19; )
cps[++i] = strtok(NULL, " \b\t\r\n");
cpp = cps;
if (!*cpp)
return (1);
c = **cpp;
if (!ISALPHA(c) || (TOLOWER(c) != 'o' && TOLOWER(c) != 'i')) {
fprintf(stderr, "bad direction \"%s\"\n", *cpp);
return (1);
}
#ifdef USE_INET6
if (!strcasecmp(*cpp, "out6") || !strcasecmp(*cpp, "in6")) {
return (parseipv6(cpp, (ip6_t *)ip, ifn, out));
}
#endif
*out = (TOLOWER(c) == 'o') ? 1 : 0;
cpp++;
if (!*cpp)
return (1);
if (!strcasecmp(*cpp, "on")) {
cpp++;
if (!*cpp)
return (1);
*ifn = strdup(*cpp++);
if (!*cpp)
return (1);
}
c = **cpp;
ip->ip_len = sizeof(ip_t);
if (!strcasecmp(*cpp, "tcp") || !strcasecmp(*cpp, "udp") ||
!strcasecmp(*cpp, "icmp")) {
if (c == 't') {
ip->ip_p = IPPROTO_TCP;
ip->ip_len += sizeof(struct tcphdr);
tx_proto = "tcp";
} else if (c == 'u') {
ip->ip_p = IPPROTO_UDP;
ip->ip_len += sizeof(struct udphdr);
tx_proto = "udp";
} else {
ip->ip_p = IPPROTO_ICMP;
ip->ip_len += ICMPERR_IPICMPHLEN;
tx_proto = "icmp";
}
cpp++;
} else if (ISDIGIT(**cpp) && !index(*cpp, '.')) {
ip->ip_p = atoi(*cpp);
cpp++;
} else
ip->ip_p = IPPROTO_IP;
if (!*cpp)
return (1);
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP) {
char *last;
last = strchr(*cpp, ',');
if (!last) {
fprintf(stderr, "tcp/udp with no source port\n");
return (1);
}
*last++ = '\0';
tcp->th_sport = htons(tx_portnum(last));
if (ip->ip_p == IPPROTO_TCP) {
tcp->th_win = htons(4096);
TCP_OFF_A(tcp, sizeof(*tcp) >> 2);
}
}
ip->ip_src.s_addr = tx_hostnum(*cpp, &r);
cpp++;
if (!*cpp)
return (1);
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP) {
char *last;
last = strchr(*cpp, ',');
if (!last) {
fprintf(stderr, "tcp/udp with no destination port\n");
return (1);
}
*last++ = '\0';
tcp->th_dport = htons(tx_portnum(last));
}
ip->ip_dst.s_addr = tx_hostnum(*cpp, &r);
cpp++;
if (ip->ip_p == IPPROTO_TCP) {
if (*cpp != NULL) {
char *s, *t;
tcp->th_flags = 0;
for (s = *cpp; *s; s++)
if ((t = strchr(myflagset, *s)))
tcp->th_flags |= myflags[t-myflagset];
if (tcp->th_flags)
cpp++;
}
if (tcp->th_flags & TH_URG)
tcp->th_urp = htons(1);
if (*cpp && !strncasecmp(*cpp, "seq=", 4)) {
tcp->th_seq = htonl(atoi(*cpp + 4));
cpp++;
}
if (*cpp && !strncasecmp(*cpp, "ack=", 4)) {
tcp->th_ack = htonl(atoi(*cpp + 4));
cpp++;
}
} else if (*cpp && ip->ip_p == IPPROTO_ICMP) {
char *t;
t = strchr(*cpp, ',');
if (t != NULL)
*t = '\0';
ic->icmp_type = geticmptype(AF_INET, *cpp);
if (t != NULL)
ic->icmp_code = atoi(t + 1);
cpp++;
if (ic->icmp_type == ICMP_ECHO ||
ic->icmp_type == ICMP_ECHOREPLY)
ic->icmp_id = htons(getpid());
if (t != NULL)
*t = ',';
}
if (*cpp && !strcasecmp(*cpp, "opt")) {
u_long olen;
cpp++;
olen = buildopts(*cpp, ipopts, (IP_HL(ip) - 5) << 2);
if (olen) {
bcopy(ipopts, (char *)(ip + 1), olen);
IP_HL_A(ip, IP_HL(ip) + (olen >> 2));
ip->ip_len += olen;
}
}
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP)
bcopy((char *)tcp, ((char *)ip) + (IP_HL(ip) << 2),
sizeof(*tcp));
else if (ip->ip_p == IPPROTO_ICMP)
bcopy((char *)ic, ((char *)ip) + (IP_HL(ip) << 2),
sizeof(*ic));
ip->ip_len = htons(ip->ip_len);
return (0);
}
#ifdef USE_INET6
int
parseipv6(char **cpp, ip6_t *ip6, char **ifn, int *out)
{
tcphdr_t th, *tcp = &th;
struct icmp6_hdr icmp, *ic6 = &icmp;
bzero((char *)ip6, MAX(sizeof(*tcp), sizeof(*ic6)) + sizeof(*ip6));
bzero((char *)tcp, sizeof(*tcp));
bzero((char *)ic6, sizeof(*ic6));
ip6->ip6_vfc = 0x60;
*out = (**cpp == 'o') ? 1 : 0;
cpp++;
if (!*cpp)
return (1);
if (!strcasecmp(*cpp, "on")) {
cpp++;
if (!*cpp)
return (1);
*ifn = strdup(*cpp++);
if (!*cpp)
return (1);
}
if (!strcasecmp(*cpp, "tcp")) {
ip6->ip6_nxt = IPPROTO_TCP;
tx_proto = "tcp";
cpp++;
} else if (!strcasecmp(*cpp, "udp")) {
ip6->ip6_nxt = IPPROTO_UDP;
tx_proto = "udp";
cpp++;
} else if (!strcasecmp(*cpp, "icmpv6")) {
ip6->ip6_nxt = IPPROTO_ICMPV6;
tx_proto = "icmpv6";
cpp++;
} else if (ISDIGIT(**cpp) && !index(*cpp, ':')) {
ip6->ip6_nxt = atoi(*cpp);
cpp++;
} else
ip6->ip6_nxt = IPPROTO_IPV6;
if (!*cpp)
return (1);
switch (ip6->ip6_nxt)
{
case IPPROTO_TCP :
ip6->ip6_plen = sizeof(struct tcphdr);
break;
case IPPROTO_UDP :
ip6->ip6_plen = sizeof(struct udphdr);
break;
case IPPROTO_ICMPV6 :
ip6->ip6_plen = ICMP6ERR_IPICMPHLEN;
break;
default :
break;
}
if (ip6->ip6_nxt == IPPROTO_TCP || ip6->ip6_nxt == IPPROTO_UDP) {
char *last;
last = strchr(*cpp, ',');
if (!last) {
fprintf(stderr, "tcp/udp with no source port\n");
return (1);
}
*last++ = '\0';
tcp->th_sport = htons(tx_portnum(last));
if (ip6->ip6_nxt == IPPROTO_TCP) {
tcp->th_win = htons(4096);
TCP_OFF_A(tcp, sizeof(*tcp) >> 2);
}
}
if (inet_pton(AF_INET6, *cpp, &ip6->ip6_src) != 1) {
fprintf(stderr, "cannot parse source address '%s'\n", *cpp);
return (1);
}
cpp++;
if (!*cpp)
return (1);
if (ip6->ip6_nxt == IPPROTO_TCP || ip6->ip6_nxt == IPPROTO_UDP) {
char *last;
last = strchr(*cpp, ',');
if (!last) {
fprintf(stderr, "tcp/udp with no destination port\n");
return (1);
}
*last++ = '\0';
tcp->th_dport = htons(tx_portnum(last));
}
if (inet_pton(AF_INET6, *cpp, &ip6->ip6_dst) != 1) {
fprintf(stderr, "cannot parse destination address '%s'\n",
*cpp);
return (1);
}
cpp++;
if (ip6->ip6_nxt == IPPROTO_TCP) {
if (*cpp != NULL) {
char *s, *t;
tcp->th_flags = 0;
for (s = *cpp; *s; s++)
if ((t = strchr(myflagset, *s)))
tcp->th_flags |= myflags[t-myflagset];
if (tcp->th_flags)
cpp++;
}
if (tcp->th_flags & TH_URG)
tcp->th_urp = htons(1);
if (*cpp && !strncasecmp(*cpp, "seq=", 4)) {
tcp->th_seq = htonl(atoi(*cpp + 4));
cpp++;
}
if (*cpp && !strncasecmp(*cpp, "ack=", 4)) {
tcp->th_ack = htonl(atoi(*cpp + 4));
cpp++;
}
} else if (*cpp && ip6->ip6_nxt == IPPROTO_ICMPV6) {
char *t;
t = strchr(*cpp, ',');
if (t != NULL)
*t = '\0';
ic6->icmp6_type = geticmptype(AF_INET6, *cpp);
if (t != NULL)
ic6->icmp6_code = atoi(t + 1);
if (ic6->icmp6_type == ICMP6_ECHO_REQUEST ||
ic6->icmp6_type == ICMP6_ECHO_REPLY)
ic6->icmp6_id = htons(getpid());
if (t != NULL)
*t = ',';
}
if (ip6->ip6_nxt == IPPROTO_TCP || ip6->ip6_nxt == IPPROTO_UDP) {
bcopy((char *)tcp, (char *)ip6 + sizeof(*ip6),
sizeof(*tcp));
} else if (ip6->ip6_nxt == IPPROTO_ICMPV6) {
bcopy((char *)ic6, (char *)ip6 + sizeof(*ip6),
sizeof(*ic6));
}
/*
* Because a length of 0 == jumbo gram...
*/
if (ip6->ip6_plen == 0) {
ip6->ip6_plen++;
}
ip6->ip6_plen = htons(ip6->ip6_plen);
return (0);
}
#endif
diff --git a/sbin/ipf/libipf/ipoptsec.c b/sbin/ipf/libipf/ipoptsec.c
index 7617daec33dd..fad2a564371e 100644
--- a/sbin/ipf/libipf/ipoptsec.c
+++ b/sbin/ipf/libipf/ipoptsec.c
@@ -1,61 +1,60 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
struct ipopt_names secclass[] = {
{ IPSO_CLASS_RES4, 0x01, 0, "reserv-4" },
{ IPSO_CLASS_TOPS, 0x02, 0, "topsecret" },
{ IPSO_CLASS_SECR, 0x04, 0, "secret" },
{ IPSO_CLASS_RES3, 0x08, 0, "reserv-3" },
{ IPSO_CLASS_CONF, 0x10, 0, "confid" },
{ IPSO_CLASS_UNCL, 0x20, 0, "unclass" },
{ IPSO_CLASS_RES2, 0x40, 0, "reserv-2" },
{ IPSO_CLASS_RES1, 0x80, 0, "reserv-1" },
{ 0, 0, 0, NULL } /* must be last */
};
u_char
seclevel(char *slevel)
{
struct ipopt_names *so;
if (slevel == NULL || *slevel == '\0')
return (0);
for (so = secclass; so->on_name; so++)
if (!strcasecmp(slevel, so->on_name))
break;
if (!so->on_name) {
fprintf(stderr, "no such security level: '%s'\n", slevel);
return (0);
}
return (u_char)so->on_value;
}
u_char
secbit(int class)
{
struct ipopt_names *so;
for (so = secclass; so->on_name; so++)
if (so->on_value == class)
break;
if (!so->on_name) {
fprintf(stderr, "no such security class: %d.\n", class);
return (0);
}
return (u_char)so->on_bit;
}
diff --git a/sbin/ipf/libipf/kmem.c b/sbin/ipf/libipf/kmem.c
index c39e36aa5add..0f15159b0348 100644
--- a/sbin/ipf/libipf/kmem.c
+++ b/sbin/ipf/libipf/kmem.c
@@ -1,114 +1,113 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
/*
* kmemcpy() - copies n bytes from kernel memory into user buffer.
* returns 0 on success, -1 on error.
*/
#include <stdio.h>
#include <sys/param.h>
#include <sys/types.h>
#include <sys/uio.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <sys/file.h>
#include <kvm.h>
#include <fcntl.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <net/if.h>
#include "kmem.h"
#if !defined(lint)
static const char sccsid[] = "@(#)kmem.c 1.4 1/12/96 (C) 1992 Darren Reed";
static const char rcsid[] = "@(#)$Id$";
#endif
static kvm_t *kvm_f = NULL;
int
openkmem(char *kern, char *core)
{
kvm_f = kvm_open(kern, core, NULL, O_RDONLY, NULL);
if (kvm_f == NULL)
{
perror("openkmem:open");
return (-1);
}
return (kvm_f != NULL);
}
int
kmemcpy(register char *buf, long pos, register int n)
{
register int r;
if (!n)
return (0);
if (kvm_f == NULL)
if (openkmem(NULL, NULL) == -1)
return (-1);
while ((r = kvm_read(kvm_f, pos, buf, n)) < n)
if (r <= 0)
{
fprintf(stderr, "pos=0x%lx ", (u_long)pos);
perror("kmemcpy:read");
return (-1);
}
else
{
buf += r;
pos += r;
n -= r;
}
return (0);
}
int
kstrncpy(register char *buf, long pos, register int n)
{
register int r;
if (!n)
return (0);
if (kvm_f == NULL)
if (openkmem(NULL, NULL) == -1)
return (-1);
while (n > 0)
{
r = kvm_read(kvm_f, pos, buf, 1);
if (r <= 0)
{
fprintf(stderr, "pos=0x%lx ", (u_long)pos);
perror("kmemcpy:read");
return (-1);
}
else
{
if (*buf == '\0')
break;
buf++;
pos++;
n--;
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/kmem.h b/sbin/ipf/libipf/kmem.h
index bcf6a0be7e27..623d5760c614 100644
--- a/sbin/ipf/libipf/kmem.h
+++ b/sbin/ipf/libipf/kmem.h
@@ -1,30 +1,29 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
* $Id$
*/
#ifndef __KMEM_H__
#define __KMEM_H__
#ifndef __P
# define __P(x) x
#endif
extern int openkmem(char *, char *);
extern int kmemcpy(char *, long, int);
extern int kstrncpy(char *, long, int);
#if defined(__NetBSD__)
# include <paths.h>
#endif
#ifdef _PATH_KMEM
# define KMEM _PATH_KMEM
#else
# define KMEM "/dev/kmem"
#endif
#endif /* __KMEM_H__ */
diff --git a/sbin/ipf/libipf/kmemcpywrap.c b/sbin/ipf/libipf/kmemcpywrap.c
index fab86242c449..43f8833be72d 100644
--- a/sbin/ipf/libipf/kmemcpywrap.c
+++ b/sbin/ipf/libipf/kmemcpywrap.c
@@ -1,22 +1,21 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include "kmem.h"
int
kmemcpywrap(void *from, void *to, size_t size)
{
int ret;
ret = kmemcpy((caddr_t)to, (u_long)from, size);
return (ret);
}
diff --git a/sbin/ipf/libipf/kvatoname.c b/sbin/ipf/libipf/kvatoname.c
index 47b226f13450..1e53cd9c2cd5 100644
--- a/sbin/ipf/libipf/kvatoname.c
+++ b/sbin/ipf/libipf/kvatoname.c
@@ -1,38 +1,37 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include <fcntl.h>
#include <sys/ioctl.h>
char *
kvatoname(ipfunc_t func, ioctlfunc_t iocfunc)
{
static char funcname[40];
ipfunc_resolve_t res;
int fd;
res.ipfu_addr = func;
res.ipfu_name[0] = '\0';
fd = -1;
if ((opts & OPT_DONTOPEN) == 0) {
fd = open(IPL_NAME, O_RDONLY);
if (fd == -1)
return (NULL);
}
(void) (*iocfunc)(fd, SIOCFUNCL, &res);
if (fd >= 0)
close(fd);
strncpy(funcname, res.ipfu_name, sizeof(funcname));
funcname[sizeof(funcname) - 1] = '\0';
return (funcname);
}
diff --git a/sbin/ipf/libipf/load_hash.c b/sbin/ipf/libipf/load_hash.c
index 63894a3cfa72..bfee0fc64642 100644
--- a/sbin/ipf/libipf/load_hash.c
+++ b/sbin/ipf/libipf/load_hash.c
@@ -1,100 +1,99 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_htable.h"
int
load_hash(iphtable_t *iphp, iphtent_t *list, ioctlfunc_t iocfunc)
{
iplookupop_t op;
iphtable_t iph;
iphtent_t *a;
size_t size;
int n;
if (pool_open() == -1)
return (-1);
for (n = 0, a = list; a != NULL; a = a->ipe_next)
n++;
bzero((char *)&iph, sizeof(iph));
op.iplo_arg = 0;
op.iplo_type = IPLT_HASH;
op.iplo_unit = iphp->iph_unit;
strncpy(op.iplo_name, iphp->iph_name, sizeof(op.iplo_name));
if (*op.iplo_name == '\0')
op.iplo_arg = IPHASH_ANON;
op.iplo_size = sizeof(iph);
op.iplo_struct = &iph;
iph = *iphp;
if (n <= 0)
n = 1;
if (iphp->iph_size == 0)
size = n * 2 - 1;
else
size = iphp->iph_size;
if ((list == NULL) && (size == 1)) {
fprintf(stderr,
"WARNING: empty hash table %s, recommend setting %s\n",
iphp->iph_name, "size to match expected use");
}
iph.iph_size = size;
iph.iph_table = NULL;
iph.iph_list = NULL;
iph.iph_ref = 0;
if ((opts & OPT_REMOVE) == 0) {
if (pool_ioctl(iocfunc, SIOCLOOKUPADDTABLE, &op))
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"add lookup hash table"));
}
}
strncpy(iph.iph_name, op.iplo_name, sizeof(op.iplo_name));
strncpy(iphp->iph_name, op.iplo_name, sizeof(op.iplo_name));
if (opts & OPT_VERBOSE) {
iph.iph_table = calloc(size, sizeof(*iph.iph_table));
if (iph.iph_table == NULL) {
perror("calloc(size, sizeof(*iph.iph_table))");
return (-1);
}
iph.iph_list = list;
printhash(&iph, bcopywrap, iph.iph_name, opts, NULL);
free(iph.iph_table);
for (a = list; a != NULL; a = a->ipe_next) {
a->ipe_addr.in4_addr = htonl(a->ipe_addr.in4_addr);
a->ipe_mask.in4_addr = htonl(a->ipe_mask.in4_addr);
}
}
if (opts & OPT_DEBUG)
printf("Hash %s:\n", iph.iph_name);
for (a = list; a != NULL; a = a->ipe_next)
load_hashnode(iphp->iph_unit, iph.iph_name, a, 0, iocfunc);
if ((opts & OPT_REMOVE) != 0) {
if (pool_ioctl(iocfunc, SIOCLOOKUPDELTABLE, &op))
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"delete lookup hash table"));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/load_hashnode.c b/sbin/ipf/libipf/load_hashnode.c
index 46e5552fdbab..11525dc96e35 100644
--- a/sbin/ipf/libipf/load_hashnode.c
+++ b/sbin/ipf/libipf/load_hashnode.c
@@ -1,63 +1,62 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_htable.h"
int
load_hashnode(int unit, char *name, iphtent_t *node, int ttl,
ioctlfunc_t iocfunc)
{
iplookupop_t op;
iphtent_t ipe;
char *what;
int err;
if (pool_open() == -1)
return (-1);
op.iplo_type = IPLT_HASH;
op.iplo_unit = unit;
op.iplo_arg = 0;
op.iplo_size = sizeof(ipe);
op.iplo_struct = &ipe;
strncpy(op.iplo_name, name, sizeof(op.iplo_name));
bzero((char *)&ipe, sizeof(ipe));
ipe.ipe_family = node->ipe_family;
ipe.ipe_die = ttl;
bcopy((char *)&node->ipe_addr, (char *)&ipe.ipe_addr,
sizeof(ipe.ipe_addr));
bcopy((char *)&node->ipe_mask, (char *)&ipe.ipe_mask,
sizeof(ipe.ipe_mask));
bcopy((char *)&node->ipe_group, (char *)&ipe.ipe_group,
sizeof(ipe.ipe_group));
if ((opts & OPT_REMOVE) == 0) {
what = "add";
err = pool_ioctl(iocfunc, SIOCLOOKUPADDNODE, &op);
} else {
what = "delete";
err = pool_ioctl(iocfunc, SIOCLOOKUPDELNODE, &op);
}
if (err != 0)
if (!(opts & OPT_DONOTHING)) {
char msg[80];
snprintf(msg, sizeof(msg), "%s node from lookup hash table", what);
return (ipf_perror_fd(pool_fd(), iocfunc, msg));
}
return (0);
}
diff --git a/sbin/ipf/libipf/load_http.c b/sbin/ipf/libipf/load_http.c
index 738a6f8006f9..5f86b018cca5 100644
--- a/sbin/ipf/libipf/load_http.c
+++ b/sbin/ipf/libipf/load_http.c
@@ -1,208 +1,207 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id: load_http.c,v 1.5.2.5 2012/07/22 08:04:24 darren_r Exp $
*/
#include "ipf.h"
#include <ctype.h>
/*
* Because the URL can be included twice into the buffer, once as the
* full path for the "GET" and once as the "Host:", the buffer it is
* put in needs to be larger than 512*2 to make room for the supporting
* text. Why not just use snprintf and truncate? The warning about the
* URL being too long tells you something is wrong and does not fetch
* any data - just truncating the URL (with snprintf, etc) and sending
* that to the server is allowing an unknown and unintentioned action
* to happen.
*/
#define MAX_URL_LEN 512
#define LOAD_BUFSIZE (MAX_URL_LEN * 2 + 128)
/*
* Format expected is one addres per line, at the start of each line.
*/
alist_t *
load_http(char *url)
{
int fd, len, left, port, endhdr, removed, linenum = 0;
char *s, *t, *u, buffer[LOAD_BUFSIZE], *myurl;
alist_t *a, *rtop, *rbot;
size_t avail;
int error;
/*
* More than this would just be absurd.
*/
if (strlen(url) > MAX_URL_LEN) {
fprintf(stderr, "load_http has a URL > %d bytes?!\n",
MAX_URL_LEN);
return (NULL);
}
fd = -1;
rtop = NULL;
rbot = NULL;
avail = sizeof(buffer);
error = snprintf(buffer, avail, "GET %s HTTP/1.0\r\n", url);
/*
* error is always less then avail due to the constraint on
* the url length above.
*/
avail -= error;
myurl = strdup(url);
if (myurl == NULL)
goto done;
s = myurl + 7; /* http:// */
t = strchr(s, '/');
if (t == NULL) {
fprintf(stderr, "load_http has a malformed URL '%s'\n", url);
free(myurl);
return (NULL);
}
*t++ = '\0';
/*
* 10 is the length of 'Host: \r\n\r\n' below.
*/
if (strlen(s) + strlen(buffer) + 10 > sizeof(buffer)) {
fprintf(stderr, "load_http has a malformed URL '%s'\n", url);
free(myurl);
return (NULL);
}
u = strchr(s, '@');
if (u != NULL)
s = u + 1; /* AUTH */
error = snprintf(buffer + strlen(buffer), avail, "Host: %s\r\n\r\n", s);
if (error >= avail) {
fprintf(stderr, "URL is too large: %s\n", url);
goto done;
}
u = strchr(s, ':');
if (u != NULL) {
*u++ = '\0';
port = atoi(u);
if (port < 0 || port > 65535)
goto done;
} else {
port = 80;
}
fd = connecttcp(s, port);
if (fd == -1)
goto done;
len = strlen(buffer);
if (write(fd, buffer, len) != len)
goto done;
s = buffer;
endhdr = 0;
left = sizeof(buffer) - 1;
while ((len = read(fd, s, left)) > 0) {
s[len] = '\0';
left -= len;
s += len;
if (endhdr >= 0) {
if (endhdr == 0) {
t = strchr(buffer, ' ');
if (t == NULL)
continue;
t++;
if (*t != '2')
break;
}
u = buffer;
while ((t = strchr(u, '\r')) != NULL) {
if (t == u) {
if (*(t + 1) == '\n') {
u = t + 2;
endhdr = -1;
break;
} else
t++;
} else if (*(t + 1) == '\n') {
endhdr++;
u = t + 2;
} else
u = t + 1;
}
if (endhdr >= 0)
continue;
removed = (u - buffer) + 1;
memmove(buffer, u, (sizeof(buffer) - left) - removed);
s -= removed;
left += removed;
}
do {
t = strchr(buffer, '\n');
if (t == NULL)
break;
linenum++;
*t = '\0';
/*
* Remove comment and continue to the next line if
* the comment is at the start of the line.
*/
u = strchr(buffer, '#');
if (u != NULL) {
*u = '\0';
if (u == buffer)
continue;
}
/*
* Trim off tailing white spaces, will include \r
*/
for (u = t - 1; (u >= buffer) && ISSPACE(*u); u--)
*u = '\0';
a = alist_new(AF_UNSPEC, buffer);
if (a != NULL) {
if (rbot != NULL)
rbot->al_next = a;
else
rtop = a;
rbot = a;
} else {
fprintf(stderr,
"%s:%d unrecognised content:%s\n",
url, linenum, buffer);
}
t++;
removed = t - buffer;
memmove(buffer, t, sizeof(buffer) - left - removed);
s -= removed;
left += removed;
} while (1);
}
done:
if (myurl != NULL)
free(myurl);
if (fd != -1)
close(fd);
return (rtop);
}
diff --git a/sbin/ipf/libipf/load_pool.c b/sbin/ipf/libipf/load_pool.c
index c502f3dc77e0..0d90c81e81ff 100644
--- a/sbin/ipf/libipf/load_pool.c
+++ b/sbin/ipf/libipf/load_pool.c
@@ -1,70 +1,69 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_pool.h"
int
load_pool(ip_pool_t *plp, ioctlfunc_t iocfunc)
{
iplookupop_t op;
ip_pool_node_t *a;
ip_pool_t pool;
if (pool_open() == -1)
return (-1);
op.iplo_unit = plp->ipo_unit;
op.iplo_type = IPLT_POOL;
op.iplo_arg = 0;
strncpy(op.iplo_name, plp->ipo_name, sizeof(op.iplo_name));
op.iplo_size = sizeof(pool);
op.iplo_struct = &pool;
bzero((char *)&pool, sizeof(pool));
pool.ipo_unit = plp->ipo_unit;
strncpy(pool.ipo_name, plp->ipo_name, sizeof(pool.ipo_name));
if (plp->ipo_name[0] == '\0')
op.iplo_arg |= IPOOL_ANON;
if ((opts & OPT_REMOVE) == 0) {
if (pool_ioctl(iocfunc, SIOCLOOKUPADDTABLE, &op)) {
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"add lookup table"));
}
}
}
if (op.iplo_arg & IPOOL_ANON)
strncpy(pool.ipo_name, op.iplo_name, sizeof(pool.ipo_name));
if ((opts & OPT_VERBOSE) != 0) {
pool.ipo_list = plp->ipo_list;
(void) printpool(&pool, bcopywrap, pool.ipo_name, opts, NULL);
pool.ipo_list = NULL;
}
for (a = plp->ipo_list; a != NULL; a = a->ipn_next)
load_poolnode(plp->ipo_unit, pool.ipo_name,
a, 0, iocfunc);
if ((opts & OPT_REMOVE) != 0) {
if (pool_ioctl(iocfunc, SIOCLOOKUPDELTABLE, &op))
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"delete lookup table"));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/load_poolnode.c b/sbin/ipf/libipf/load_poolnode.c
index 849bd60791a7..5c9fd838bfa0 100644
--- a/sbin/ipf/libipf/load_poolnode.c
+++ b/sbin/ipf/libipf/load_poolnode.c
@@ -1,66 +1,65 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_pool.h"
int
load_poolnode(int role, char *name, ip_pool_node_t *node, int ttl,
ioctlfunc_t iocfunc)
{
ip_pool_node_t pn;
iplookupop_t op;
char *what;
int err;
if (pool_open() == -1)
return (-1);
op.iplo_unit = role;
op.iplo_type = IPLT_POOL;
op.iplo_arg = 0;
op.iplo_struct = &pn;
op.iplo_size = sizeof(pn);
strncpy(op.iplo_name, name, sizeof(op.iplo_name));
bzero((char *)&pn, sizeof(pn));
bcopy((char *)&node->ipn_addr, (char *)&pn.ipn_addr,
sizeof(pn.ipn_addr));
bcopy((char *)&node->ipn_mask, (char *)&pn.ipn_mask,
sizeof(pn.ipn_mask));
pn.ipn_info = node->ipn_info;
pn.ipn_die = ttl;
strncpy(pn.ipn_name, node->ipn_name, sizeof(pn.ipn_name));
if ((opts & OPT_REMOVE) == 0) {
what = "add";
err = pool_ioctl(iocfunc, SIOCLOOKUPADDNODE, &op);
} else {
what = "delete";
err = pool_ioctl(iocfunc, SIOCLOOKUPDELNODE, &op);
}
if (err != 0) {
if ((opts & OPT_DONOTHING) == 0) {
char msg[80];
snprintf(msg, sizeof(msg), "%s pool node(%s/", what,
inet_ntoa(pn.ipn_addr.adf_addr.in4));
strcat(msg, inet_ntoa(pn.ipn_mask.adf_addr.in4));
return (ipf_perror_fd(pool_fd(), iocfunc, msg));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/mutex_emul.c b/sbin/ipf/libipf/mutex_emul.c
index 3152d2e47013..a1bd8444b333 100644
--- a/sbin/ipf/libipf/mutex_emul.c
+++ b/sbin/ipf/libipf/mutex_emul.c
@@ -1,123 +1,122 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#define EMM_MAGIC 0x9d7adba3
static int mutex_debug = 0;
static FILE *mutex_file = NULL;
static int initcount = 0;
void
eMmutex_enter(eMmutex_t *mtx, char *file, int line)
{
if (mutex_debug & 2)
fprintf(mutex_file, "%s:%d:eMmutex_enter(%s)\n", file, line,
mtx->eMm_owner);
if (mtx->eMm_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMmutex_enter(%p): bad magic: %#x\n",
mtx->eMm_owner, mtx, mtx->eMm_magic);
abort();
}
if (mtx->eMm_held != 0) {
fprintf(stderr, "%s:eMmutex_enter(%p): already locked: %d\n",
mtx->eMm_owner, mtx, mtx->eMm_held);
abort();
}
mtx->eMm_held++;
mtx->eMm_heldin = file;
mtx->eMm_heldat = line;
}
void
eMmutex_exit(eMmutex_t *mtx, char *file, int line)
{
if (mutex_debug & 2)
fprintf(mutex_file, "%s:%d:eMmutex_exit(%s)\n", file, line,
mtx->eMm_owner);
if (mtx->eMm_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMmutex_exit(%p): bad magic: %#x\n",
mtx->eMm_owner, mtx, mtx->eMm_magic);
abort();
}
if (mtx->eMm_held != 1) {
fprintf(stderr, "%s:eMmutex_exit(%p): not locked: %d\n",
mtx->eMm_owner, mtx, mtx->eMm_held);
abort();
}
mtx->eMm_held--;
mtx->eMm_heldin = NULL;
mtx->eMm_heldat = 0;
}
void
eMmutex_init(eMmutex_t *mtx, char *who, char *file, int line)
{
if (mutex_file == NULL && mutex_debug)
mutex_file = fopen("ipf_mutex_log", "w");
if (mutex_debug & 1)
fprintf(mutex_file, "%s:%d:eMmutex_init(%p,%s)\n",
file, line, mtx, who);
if (mtx->eMm_magic == EMM_MAGIC) { /* safe bet ? */
fprintf(stderr,
"%s:eMmutex_init(%p): already initialised?: %#x\n",
mtx->eMm_owner, mtx, mtx->eMm_magic);
abort();
}
mtx->eMm_magic = EMM_MAGIC;
mtx->eMm_held = 0;
if (who != NULL)
mtx->eMm_owner = strdup(who);
else
mtx->eMm_owner = NULL;
initcount++;
}
void
eMmutex_destroy(mtx, file, line)
eMmutex_t *mtx;
char *file;
int line;
{
if (mutex_debug & 1)
fprintf(mutex_file,
"%s:%d:eMmutex_destroy(%p,%s)\n", file, line,
mtx, mtx->eMm_owner);
if (mtx->eMm_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMmutex_destroy(%p): bad magic: %#x\n",
mtx->eMm_owner, mtx, mtx->eMm_magic);
abort();
}
if (mtx->eMm_held != 0) {
fprintf(stderr,
"%s:eMmutex_enter(%p): still locked: %d\n",
mtx->eMm_owner, mtx, mtx->eMm_held);
abort();
}
if (mtx->eMm_owner != NULL)
free(mtx->eMm_owner);
memset(mtx, 0xa5, sizeof(*mtx));
initcount--;
}
void
ipf_mutex_clean(void)
{
if (initcount != 0) {
if (mutex_file)
fprintf(mutex_file, "initcount %d\n", initcount);
abort();
}
}
diff --git a/sbin/ipf/libipf/nametokva.c b/sbin/ipf/libipf/nametokva.c
index 6b86657eba97..06635238165c 100644
--- a/sbin/ipf/libipf/nametokva.c
+++ b/sbin/ipf/libipf/nametokva.c
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include <sys/ioctl.h>
#include <fcntl.h>
ipfunc_t
nametokva(char *name, ioctlfunc_t iocfunc)
{
ipfunc_resolve_t res;
int fd;
strncpy(res.ipfu_name, name, sizeof(res.ipfu_name));
res.ipfu_addr = NULL;
fd = -1;
if ((opts & OPT_DONTOPEN) == 0) {
fd = open(IPL_NAME, O_RDONLY);
if (fd == -1)
return (NULL);
}
(void) (*iocfunc)(fd, SIOCFUNCL, &res);
if (fd >= 0)
close(fd);
if (res.ipfu_addr == NULL)
res.ipfu_addr = (ipfunc_t)-1;
return (res.ipfu_addr);
}
diff --git a/sbin/ipf/libipf/nat_setgroupmap.c b/sbin/ipf/libipf/nat_setgroupmap.c
index 8a4b461c5a88..fd3a2c120e1e 100644
--- a/sbin/ipf/libipf/nat_setgroupmap.c
+++ b/sbin/ipf/libipf/nat_setgroupmap.c
@@ -1,34 +1,33 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
#include "ipf.h"
void
nat_setgroupmap(ipnat_t *n)
{
if (n->in_nsrcmsk == n->in_osrcmsk)
n->in_ippip = 1;
else if (n->in_flags & IPN_AUTOPORTMAP) {
n->in_ippip = ~ntohl(n->in_osrcmsk);
if (n->in_nsrcmsk != 0xffffffff)
n->in_ippip /= (~ntohl(n->in_nsrcmsk) + 1);
n->in_ippip++;
if (n->in_ippip == 0)
n->in_ippip = 1;
n->in_ppip = USABLE_PORTS / n->in_ippip;
} else {
n->in_space = USABLE_PORTS * ~ntohl(n->in_nsrcmsk);
n->in_snip = 0;
if (!(n->in_ppip = n->in_spmin))
n->in_ppip = 1;
n->in_ippip = USABLE_PORTS / n->in_ppip;
}
}
diff --git a/sbin/ipf/libipf/ntomask.c b/sbin/ipf/libipf/ntomask.c
index 0947784106ba..3664d255254c 100644
--- a/sbin/ipf/libipf/ntomask.c
+++ b/sbin/ipf/libipf/ntomask.c
@@ -1,46 +1,45 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
int
ntomask(int family, int nbits, u_32_t *ap)
{
u_32_t mask;
if (nbits < 0)
return (-1);
switch (family)
{
case AF_INET :
if (nbits > 32 || use_inet6 == 1)
return (-1);
if (nbits == 0) {
mask = 0;
} else {
mask = 0xffffffff;
mask <<= (32 - nbits);
}
*ap = htonl(mask);
break;
case 0 :
case AF_INET6 :
if ((nbits > 128) || (use_inet6 == -1))
return (-1);
fill6bits(nbits, ap);
break;
default :
return (-1);
}
return (0);
}
diff --git a/sbin/ipf/libipf/optname.c b/sbin/ipf/libipf/optname.c
index 1523d31b710a..93bf276c7818 100644
--- a/sbin/ipf/libipf/optname.c
+++ b/sbin/ipf/libipf/optname.c
@@ -1,63 +1,62 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
u_32_t
optname(char ***cp, u_short *sp, int linenum)
{
struct ipopt_names *io, *so;
u_long msk = 0;
u_short smsk = 0;
char *s;
int sec = 0;
for (s = strtok(**cp, ","); s; s = strtok(NULL, ",")) {
for (io = ionames; io->on_name; io++)
if (!strcasecmp(s, io->on_name)) {
msk |= io->on_bit;
break;
}
if (!io->on_name) {
fprintf(stderr, "%d: unknown IP option name %s\n",
linenum, s);
return (0);
}
if (!strcasecmp(s, "sec-class"))
sec = 1;
}
if (sec && !*(*cp + 1)) {
fprintf(stderr, "%d: missing security level after sec-class\n",
linenum);
return (0);
}
if (sec) {
(*cp)++;
for (s = strtok(**cp, ","); s; s = strtok(NULL, ",")) {
for (so = secclass; so->on_name; so++)
if (!strcasecmp(s, so->on_name)) {
smsk |= so->on_bit;
break;
}
if (!so->on_name) {
fprintf(stderr,
"%d: no such security level: %s\n",
linenum, s);
return (0);
}
}
if (smsk)
*sp = smsk;
}
return (msk);
}
diff --git a/sbin/ipf/libipf/optprint.c b/sbin/ipf/libipf/optprint.c
index f18ad00dba2a..a70ed28d611f 100644
--- a/sbin/ipf/libipf/optprint.c
+++ b/sbin/ipf/libipf/optprint.c
@@ -1,82 +1,81 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
optprint(u_short *sec, u_long optmsk, u_long optbits)
{
u_short secmsk = sec[0], secbits = sec[1];
struct ipopt_names *io, *so;
char *s;
s = " opt ";
for (io = ionames; io->on_name; io++)
if ((io->on_bit & optmsk) &&
((io->on_bit & optmsk) == (io->on_bit & optbits))) {
if ((io->on_value != IPOPT_SECURITY) ||
(!secmsk && !secbits)) {
printf("%s%s", s, io->on_name);
/*
* Because the ionames table has this entry
* twice.
*/
if (io->on_value == IPOPT_SECURITY)
io++;
s = ",";
}
}
if (secmsk & secbits) {
printf("%ssec-class", s);
s = " ";
for (so = secclass; so->on_name; so++)
if ((secmsk & so->on_bit) &&
((so->on_bit & secmsk) == (so->on_bit & secbits))) {
printf("%s%s", s, so->on_name);
s = ",";
}
}
if ((optmsk && (optmsk != optbits)) ||
(secmsk && (secmsk != secbits))) {
s = " ";
printf(" not opt");
if (optmsk != optbits) {
for (io = ionames; io->on_name; io++)
if ((io->on_bit & optmsk) &&
((io->on_bit & optmsk) !=
(io->on_bit & optbits))) {
if ((io->on_value != IPOPT_SECURITY) ||
(!secmsk && !secbits)) {
printf("%s%s", s, io->on_name);
s = ",";
if (io->on_value ==
IPOPT_SECURITY)
io++;
} else
io++;
}
}
if (secmsk != secbits) {
printf("%ssec-class", s);
s = " ";
for (so = secclass; so->on_name; so++)
if ((so->on_bit & secmsk) &&
((so->on_bit & secmsk) !=
(so->on_bit & secbits))) {
printf("%s%s", s, so->on_name);
s = ",";
}
}
}
}
diff --git a/sbin/ipf/libipf/optprintv6.c b/sbin/ipf/libipf/optprintv6.c
index d043ff774031..e53a879fa439 100644
--- a/sbin/ipf/libipf/optprintv6.c
+++ b/sbin/ipf/libipf/optprintv6.c
@@ -1,46 +1,45 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#ifdef USE_INET6
void
optprintv6(u_short *sec, u_long optmsk, u_long optbits)
{
u_short secmsk = sec[0], secbits = sec[1];
struct ipopt_names *io;
char *s;
s = " v6hdr ";
for (io = v6ionames; io->on_name; io++)
if ((io->on_bit & optmsk) &&
((io->on_bit & optmsk) == (io->on_bit & optbits))) {
printf("%s%s", s, io->on_name);
s = ",";
}
if ((optmsk && (optmsk != optbits)) ||
(secmsk && (secmsk != secbits))) {
s = " ";
printf(" not v6hdrs");
if (optmsk != optbits) {
for (io = v6ionames; io->on_name; io++)
if ((io->on_bit & optmsk) &&
((io->on_bit & optmsk) !=
(io->on_bit & optbits))) {
printf("%s%s", s, io->on_name);
s = ",";
}
}
}
}
#endif
diff --git a/sbin/ipf/libipf/optvalue.c b/sbin/ipf/libipf/optvalue.c
index 370a9d272ed2..44635b04a13a 100644
--- a/sbin/ipf/libipf/optvalue.c
+++ b/sbin/ipf/libipf/optvalue.c
@@ -1,34 +1,33 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
u_32_t
getoptbyname(char *optname)
{
struct ipopt_names *io;
for (io = ionames; io->on_name; io++)
if (!strcasecmp(optname, io->on_name))
return (io->on_bit);
return (-1);
}
u_32_t
getoptbyvalue(int optval)
{
struct ipopt_names *io;
for (io = ionames; io->on_name; io++)
if (io->on_value == optval)
return (io->on_bit);
return (-1);
}
diff --git a/sbin/ipf/libipf/portname.c b/sbin/ipf/libipf/portname.c
index f567b26fc3fd..034c8255537d 100644
--- a/sbin/ipf/libipf/portname.c
+++ b/sbin/ipf/libipf/portname.c
@@ -1,43 +1,42 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
char *
portname(int pr, int port)
{
static char buf[32];
struct protoent *p = NULL;
struct servent *sv = NULL;
struct servent *sv1 = NULL;
if ((opts & OPT_NORESOLVE) == 0) {
if (pr == -1) {
if ((sv = getservbyport(htons(port), "tcp"))) {
strncpy(buf, sv->s_name, sizeof(buf)-1);
buf[sizeof(buf)-1] = '\0';
sv1 = getservbyport(htons(port), "udp");
sv = strncasecmp(buf, sv->s_name, strlen(buf)) ?
NULL : sv1;
}
if (sv)
return (buf);
} else if ((pr != -2) && (p = getprotobynumber(pr))) {
if ((sv = getservbyport(htons(port), p->p_name))) {
strncpy(buf, sv->s_name, sizeof(buf)-1);
buf[sizeof(buf)-1] = '\0';
return (buf);
}
}
}
(void) snprintf(buf, sizeof(buf), "%d", port);
return (buf);
}
diff --git a/sbin/ipf/libipf/print_toif.c b/sbin/ipf/libipf/print_toif.c
index 438207bf7e72..2dcaec7394f9 100644
--- a/sbin/ipf/libipf/print_toif.c
+++ b/sbin/ipf/libipf/print_toif.c
@@ -1,46 +1,45 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
print_toif(int family, char *tag, char *base, frdest_t *fdp)
{
switch (fdp->fd_type)
{
case FRD_NORMAL :
PRINTF("%s %s%s", tag, base + fdp->fd_name,
(fdp->fd_ptr || (long)fdp->fd_ptr == -1) ? "" : "(!)");
#ifdef USE_INET6
if (family == AF_INET6) {
if (IP6_NOTZERO(&fdp->fd_ip6)) {
char ipv6addr[80];
inet_ntop(AF_INET6, &fdp->fd_ip6, ipv6addr,
sizeof(fdp->fd_ip6));
PRINTF(":%s", ipv6addr);
}
} else
#endif
if (fdp->fd_ip.s_addr)
PRINTF(":%s", inet_ntoa(fdp->fd_ip));
putchar(' ');
break;
case FRD_DSTLIST :
PRINTF("%s dstlist/%s ", tag, base + fdp->fd_name);
break;
default :
PRINTF("%s <%d>", tag, fdp->fd_type);
break;
}
}
diff --git a/sbin/ipf/libipf/printactivenat.c b/sbin/ipf/libipf/printactivenat.c
index 222f85a5818b..0a4c254c9529 100644
--- a/sbin/ipf/libipf/printactivenat.c
+++ b/sbin/ipf/libipf/printactivenat.c
@@ -1,163 +1,162 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* Added redirect stuff and a variety of bug fixes. (mcn@EnGarde.com)
*/
#include "ipf.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
static int proto_opened = 0;
void
printactivenat(nat_t *nat, int opts, u_long ticks)
{
struct protoent *pproto;
if (proto_opened == 0) {
proto_opened = 1;
setprotoent(1);
}
PRINTF("%s", getnattype(nat));
if (nat->nat_flags & SI_CLONE)
PRINTF(" CLONE");
if (nat->nat_phnext[0] == NULL && nat->nat_phnext[1] == NULL)
PRINTF(" ORPHAN");
putchar(' ');
if (nat->nat_redir & NAT_REWRITE) {
printactiveaddress(nat->nat_v[0], "%-15s", &nat->nat_osrc6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_osport));
putchar(' ');
printactiveaddress(nat->nat_v[0], "%-15s", &nat->nat_odst6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_odport));
PRINTF("<- -> ");
printactiveaddress(nat->nat_v[1], "%-15s", &nat->nat_nsrc6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_nsport));
putchar(' ');
printactiveaddress(nat->nat_v[1], "%-15s", &nat->nat_ndst6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_ndport));
pproto = getprotobynumber(nat->nat_pr[0]);
PRINTF(" %s", pproto->p_name);
} else if (nat->nat_dir == NAT_OUTBOUND) {
printactiveaddress(nat->nat_v[0], "%-15s", &nat->nat_osrc6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_osport));
PRINTF(" <- -> ");
printactiveaddress(nat->nat_v[1], "%-15s", &nat->nat_nsrc6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_nsport));
PRINTF(" [");
printactiveaddress(nat->nat_v[0], "%s", &nat->nat_odst6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %hu", ntohs(nat->nat_odport));
PRINTF("]");
pproto = getprotobynumber(nat->nat_pr[1]);
PRINTF(" %s", pproto->p_name);
} else {
printactiveaddress(nat->nat_v[1], "%-15s", &nat->nat_ndst6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_ndport));
PRINTF(" <- -> ");
printactiveaddress(nat->nat_v[0], "%-15s", &nat->nat_odst6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %-5hu", ntohs(nat->nat_odport));
PRINTF(" [");
printactiveaddress(nat->nat_v[0], "%s", &nat->nat_osrc6,
nat->nat_ifnames[0]);
if ((nat->nat_flags & IPN_TCPUDP) != 0)
PRINTF(" %hu", ntohs(nat->nat_osport));
PRINTF("]");
pproto = getprotobynumber(nat->nat_pr[0]);
PRINTF(" %s", pproto->p_name);
}
if (opts & OPT_VERBOSE) {
PRINTF("\n\tttl %lu use %hu sumd %s/",
nat->nat_age - ticks, nat->nat_use,
getsumd(nat->nat_sumd[0]));
PRINTF("%s pr %u/%u hash %u/%u flags %x\n",
getsumd(nat->nat_sumd[1]),
nat->nat_pr[0], nat->nat_pr[1],
nat->nat_hv[0], nat->nat_hv[1], nat->nat_flags);
PRINTF("\tifp %s,%s ", FORMAT_IF(nat->nat_ifnames[0]),
FORMAT_IF(nat->nat_ifnames[1]));
#ifdef USE_QUAD_T
PRINTF("bytes %"PRIu64"/%"PRIu64" pkts %"PRIu64"/%"PRIu64"",
(unsigned long long)nat->nat_bytes[0],
(unsigned long long)nat->nat_bytes[1],
(unsigned long long)nat->nat_pkts[0],
(unsigned long long)nat->nat_pkts[1]);
#else
PRINTF("bytes %lu/%lu pkts %lu/%lu", nat->nat_bytes[0],
nat->nat_bytes[1], nat->nat_pkts[0], nat->nat_pkts[1]);
#endif
PRINTF(" ipsumd %x", nat->nat_ipsumd);
}
if (opts & OPT_DEBUG) {
PRINTF("\n\tnat_next %p _pnext %p _hm %p\n",
nat->nat_next, nat->nat_pnext, nat->nat_hm);
PRINTF("\t_hnext %p/%p _phnext %p/%p\n",
nat->nat_hnext[0], nat->nat_hnext[1],
nat->nat_phnext[0], nat->nat_phnext[1]);
PRINTF("\t_data %p _me %p _state %p _aps %p\n",
nat->nat_data, nat->nat_me, nat->nat_state,
nat->nat_aps);
PRINTF("\tfr %p ptr %p ifps %p/%p sync %p\n",
nat->nat_fr, nat->nat_ptr, nat->nat_ifps[0],
nat->nat_ifps[1], nat->nat_sync);
PRINTF("\ttqe:pnext %p next %p ifq %p parent %p/%p\n",
nat->nat_tqe.tqe_pnext, nat->nat_tqe.tqe_next,
nat->nat_tqe.tqe_ifq, nat->nat_tqe.tqe_parent, nat);
PRINTF("\ttqe:die %d touched %d flags %x state %d/%d\n",
nat->nat_tqe.tqe_die, nat->nat_tqe.tqe_touched,
nat->nat_tqe.tqe_flags, nat->nat_tqe.tqe_state[0],
nat->nat_tqe.tqe_state[1]);
}
putchar('\n');
}
diff --git a/sbin/ipf/libipf/printaps.c b/sbin/ipf/libipf/printaps.c
index 00e4db4cb2b8..ee0c516ae2e3 100644
--- a/sbin/ipf/libipf/printaps.c
+++ b/sbin/ipf/libipf/printaps.c
@@ -1,111 +1,110 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* Added redirect stuff and a variety of bug fixes. (mcn@EnGarde.com)
*/
#include "ipf.h"
#include "kmem.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
void
printaps(ap_session_t *aps, int opts, int proto)
{
ipsec_pxy_t ipsec;
ap_session_t ap;
ftpinfo_t ftp;
aproxy_t apr;
raudio_t ra;
if (kmemcpy((char *)&ap, (long)aps, sizeof(ap)))
return;
if (kmemcpy((char *)&apr, (long)ap.aps_apr, sizeof(apr)))
return;
PRINTF("\tproxy %s/%d use %d flags %x\n", apr.apr_label,
apr.apr_p, apr.apr_ref, apr.apr_flags);
#ifdef USE_QUAD_T
PRINTF("\tbytes %"PRIu64" pkts %"PRIu64"",
(unsigned long long)ap.aps_bytes,
(unsigned long long)ap.aps_pkts);
#else
PRINTF("\tbytes %lu pkts %lu", ap.aps_bytes, ap.aps_pkts);
#endif
PRINTF(" data %s\n", ap.aps_data ? "YES" : "NO");
if ((proto == IPPROTO_TCP) && (opts & OPT_VERBOSE)) {
PRINTF("\t\tstate[%u,%u], sel[%d,%d]\n",
ap.aps_state[0], ap.aps_state[1],
ap.aps_sel[0], ap.aps_sel[1]);
#if (defined(NetBSD) && (NetBSD >= 199905) && (NetBSD < 1991011)) || \
defined(__FreeBSD__)
PRINTF("\t\tseq: off %hd/%hd min %x/%x\n",
ap.aps_seqoff[0], ap.aps_seqoff[1],
ap.aps_seqmin[0], ap.aps_seqmin[1]);
PRINTF("\t\tack: off %hd/%hd min %x/%x\n",
ap.aps_ackoff[0], ap.aps_ackoff[1],
ap.aps_ackmin[0], ap.aps_ackmin[1]);
#else
PRINTF("\t\tseq: off %hd/%hd min %lx/%lx\n",
ap.aps_seqoff[0], ap.aps_seqoff[1],
ap.aps_seqmin[0], ap.aps_seqmin[1]);
PRINTF("\t\tack: off %hd/%hd min %lx/%lx\n",
ap.aps_ackoff[0], ap.aps_ackoff[1],
ap.aps_ackmin[0], ap.aps_ackmin[1]);
#endif
}
if (!strcmp(apr.apr_label, "raudio") && ap.aps_psiz == sizeof(ra)) {
if (kmemcpy((char *)&ra, (long)ap.aps_data, sizeof(ra)))
return;
PRINTF("\tReal Audio Proxy:\n");
PRINTF("\t\tSeen PNA: %d\tVersion: %d\tEOS: %d\n",
ra.rap_seenpna, ra.rap_version, ra.rap_eos);
PRINTF("\t\tMode: %#x\tSBF: %#x\n", ra.rap_mode, ra.rap_sbf);
PRINTF("\t\tPorts:pl %hu, pr %hu, sr %hu\n",
ra.rap_plport, ra.rap_prport, ra.rap_srport);
} else if (!strcmp(apr.apr_label, "ftp") &&
(ap.aps_psiz == sizeof(ftp))) {
if (kmemcpy((char *)&ftp, (long)ap.aps_data, sizeof(ftp)))
return;
PRINTF("\tFTP Proxy:\n");
PRINTF("\t\tpassok: %d\n", ftp.ftp_passok);
ftp.ftp_side[0].ftps_buf[FTP_BUFSZ - 1] = '\0';
ftp.ftp_side[1].ftps_buf[FTP_BUFSZ - 1] = '\0';
PRINTF("\tClient:\n");
PRINTF("\t\tseq %x (ack %x) len %d junk %d cmds %d\n",
ftp.ftp_side[0].ftps_seq[0],
ftp.ftp_side[0].ftps_seq[1],
ftp.ftp_side[0].ftps_len, ftp.ftp_side[0].ftps_junk,
ftp.ftp_side[0].ftps_cmds);
PRINTF("\t\tbuf [");
printbuf(ftp.ftp_side[0].ftps_buf, FTP_BUFSZ, 1);
PRINTF("]\n\tServer:\n");
PRINTF("\t\tseq %x (ack %x) len %d junk %d cmds %d\n",
ftp.ftp_side[1].ftps_seq[0],
ftp.ftp_side[1].ftps_seq[1],
ftp.ftp_side[1].ftps_len, ftp.ftp_side[1].ftps_junk,
ftp.ftp_side[1].ftps_cmds);
PRINTF("\t\tbuf [");
printbuf(ftp.ftp_side[1].ftps_buf, FTP_BUFSZ, 1);
PRINTF("]\n");
} else if (!strcmp(apr.apr_label, "ipsec") &&
(ap.aps_psiz == sizeof(ipsec))) {
if (kmemcpy((char *)&ipsec, (long)ap.aps_data, sizeof(ipsec)))
return;
PRINTF("\tIPSec Proxy:\n");
PRINTF("\t\tICookie %08x%08x RCookie %08x%08x %s\n",
(u_int)ntohl(ipsec.ipsc_icookie[0]),
(u_int)ntohl(ipsec.ipsc_icookie[1]),
(u_int)ntohl(ipsec.ipsc_rcookie[0]),
(u_int)ntohl(ipsec.ipsc_rcookie[1]),
ipsec.ipsc_rckset ? "(Set)" : "(Not set)");
}
}
diff --git a/sbin/ipf/libipf/printbuf.c b/sbin/ipf/libipf/printbuf.c
index 3a9281217f6a..0fef3c5de854 100644
--- a/sbin/ipf/libipf/printbuf.c
+++ b/sbin/ipf/libipf/printbuf.c
@@ -1,32 +1,31 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <ctype.h>
#include "ipf.h"
void
printbuf(char *buf, int len, int zend)
{
char *s;
int c;
int i;
for (s = buf, i = len; i; i--) {
c = *s++;
if (isprint(c))
putchar(c);
else
PRINTF("\\%03o", c);
if ((c == '\0') && zend)
break;
}
}
diff --git a/sbin/ipf/libipf/printfr.c b/sbin/ipf/libipf/printfr.c
index 2ffb65f69207..f507c8065c82 100644
--- a/sbin/ipf/libipf/printfr.c
+++ b/sbin/ipf/libipf/printfr.c
@@ -1,471 +1,470 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
/*
* print the filter structure in a useful way
*/
void
printfr( struct frentry *fp, ioctlfunc_t iocfunc)
{
struct protoent *p;
u_short sec[2];
u_32_t type;
int pr, af;
char *s;
int hash;
pr = -2;
type = fp->fr_type & ~FR_T_BUILTIN;
if ((fp->fr_type & FR_T_BUILTIN) != 0)
PRINTF("# Builtin: ");
if (fp->fr_collect != 0)
PRINTF("%u ", fp->fr_collect);
if (fp->fr_type == FR_T_CALLFUNC) {
;
} else if (fp->fr_func != NULL) {
PRINTF("call");
if ((fp->fr_flags & FR_CALLNOW) != 0)
PRINTF(" now");
s = kvatoname(fp->fr_func, iocfunc);
PRINTF(" %s/%u", s ? s : "?", fp->fr_arg);
} else if (FR_ISPASS(fp->fr_flags))
PRINTF("pass");
else if (FR_ISBLOCK(fp->fr_flags)) {
PRINTF("block");
} else if ((fp->fr_flags & FR_LOGMASK) == FR_LOG) {
printlog(fp);
} else if (FR_ISACCOUNT(fp->fr_flags))
PRINTF("count");
else if (FR_ISAUTH(fp->fr_flags))
PRINTF("auth");
else if (FR_ISPREAUTH(fp->fr_flags))
PRINTF("preauth");
else if (FR_ISNOMATCH(fp->fr_flags))
PRINTF("nomatch");
else if (FR_ISDECAPS(fp->fr_flags))
PRINTF("decapsulate");
else if (FR_ISSKIP(fp->fr_flags))
PRINTF("skip %u", fp->fr_arg);
else {
PRINTF("%x", fp->fr_flags);
}
if (fp->fr_flags & FR_RETICMP) {
if ((fp->fr_flags & FR_RETMASK) == FR_FAKEICMP)
PRINTF(" return-icmp-as-dest");
else if ((fp->fr_flags & FR_RETMASK) == FR_RETICMP)
PRINTF(" return-icmp");
if (fp->fr_icode) {
if (fp->fr_icode <= MAX_ICMPCODE)
PRINTF("(%s)",
icmpcodes[(int)fp->fr_icode]);
else
PRINTF("(%d)", fp->fr_icode);
}
} else if ((fp->fr_flags & FR_RETMASK) == FR_RETRST)
PRINTF(" return-rst");
if (fp->fr_flags & FR_OUTQUE)
PRINTF(" out ");
else if (fp->fr_flags & FR_INQUE)
PRINTF(" in ");
if (((fp->fr_flags & FR_LOGB) == FR_LOGB) ||
((fp->fr_flags & FR_LOGP) == FR_LOGP)) {
printlog(fp);
putchar(' ');
}
if (fp->fr_flags & FR_QUICK)
PRINTF("quick ");
if (fp->fr_ifnames[0] != -1) {
printifname("on ", fp->fr_names + fp->fr_ifnames[0],
fp->fr_ifa);
if (fp->fr_ifnames[1] != -1 &&
strcmp(fp->fr_names + fp->fr_ifnames[1], "*"))
printifname(",", fp->fr_names + fp->fr_ifnames[1],
fp->fr_ifas[1]);
putchar(' ');
}
if (fp->fr_tif.fd_name != -1)
print_toif(fp->fr_family, "to", fp->fr_names, &fp->fr_tif);
if (fp->fr_dif.fd_name != -1)
print_toif(fp->fr_family, "dup-to", fp->fr_names,
&fp->fr_dif);
if (fp->fr_rif.fd_name != -1)
print_toif(fp->fr_family, "reply-to", fp->fr_names,
&fp->fr_rif);
if (fp->fr_flags & FR_FASTROUTE)
PRINTF("fastroute ");
if ((fp->fr_ifnames[2] != -1 &&
strcmp(fp->fr_names + fp->fr_ifnames[2], "*")) ||
(fp->fr_ifnames[3] != -1 &&
strcmp(fp->fr_names + fp->fr_ifnames[3], "*"))) {
if (fp->fr_flags & FR_OUTQUE)
PRINTF("in-via ");
else
PRINTF("out-via ");
if (fp->fr_ifnames[2] != -1) {
printifname("", fp->fr_names + fp->fr_ifnames[2],
fp->fr_ifas[2]);
if (fp->fr_ifnames[3] != -1) {
printifname(",",
fp->fr_names + fp->fr_ifnames[3],
fp->fr_ifas[3]);
}
putchar(' ');
}
}
if (fp->fr_family == AF_INET) {
PRINTF("inet ");
af = AF_INET;
#ifdef USE_INET6
} else if (fp->fr_family == AF_INET6) {
PRINTF("inet6 ");
af = AF_INET6;
#endif
} else {
af = -1;
}
if (type == FR_T_IPF) {
if (fp->fr_mip.fi_tos)
PRINTF("tos %#x ", fp->fr_tos);
if (fp->fr_mip.fi_ttl)
PRINTF("ttl %d ", fp->fr_ttl);
if (fp->fr_flx & FI_TCPUDP) {
PRINTF("proto tcp/udp ");
pr = -1;
} else if (fp->fr_mip.fi_p) {
pr = fp->fr_ip.fi_p;
p = getprotobynumber(pr);
PRINTF("proto ");
printproto(p, pr, NULL);
putchar(' ');
}
}
switch (type)
{
case FR_T_NONE :
PRINTF("all");
break;
case FR_T_IPF :
PRINTF("from %s", fp->fr_flags & FR_NOTSRCIP ? "!" : "");
printaddr(af, fp->fr_satype, fp->fr_names, fp->fr_ifnames[0],
&fp->fr_src.s_addr, &fp->fr_smsk.s_addr);
if (fp->fr_scmp)
printportcmp(pr, &fp->fr_tuc.ftu_src);
PRINTF(" to %s", fp->fr_flags & FR_NOTDSTIP ? "!" : "");
printaddr(af, fp->fr_datype, fp->fr_names, fp->fr_ifnames[0],
&fp->fr_dst.s_addr, &fp->fr_dmsk.s_addr);
if (fp->fr_dcmp)
printportcmp(pr, &fp->fr_tuc.ftu_dst);
if (((fp->fr_proto == IPPROTO_ICMP) ||
(fp->fr_proto == IPPROTO_ICMPV6)) && fp->fr_icmpm) {
int type = fp->fr_icmp, code;
char *name;
type = ntohs(fp->fr_icmp);
code = type & 0xff;
type /= 256;
name = icmptypename(fp->fr_family, type);
if (name == NULL)
PRINTF(" icmp-type %d", type);
else
PRINTF(" icmp-type %s", name);
if (ntohs(fp->fr_icmpm) & 0xff)
PRINTF(" code %d", code);
}
if ((fp->fr_proto == IPPROTO_TCP) &&
(fp->fr_tcpf || fp->fr_tcpfm)) {
PRINTF(" flags ");
printtcpflags(fp->fr_tcpf, fp->fr_tcpfm);
}
break;
case FR_T_BPFOPC :
{
fakebpf_t *fb;
int i;
PRINTF("bpf-v%d { \"", fp->fr_family);
i = fp->fr_dsize / sizeof(*fb);
for (fb = fp->fr_data, s = ""; i; i--, fb++, s = " ")
PRINTF("%s%#x %#x %#x %#x", s, fb->fb_c, fb->fb_t,
fb->fb_f, fb->fb_k);
PRINTF("\" }");
break;
}
case FR_T_COMPIPF :
break;
case FR_T_CALLFUNC :
PRINTF("call function at %p", fp->fr_data);
break;
case FR_T_IPFEXPR :
PRINTF("exp { \"");
printipfexpr(fp->fr_data);
PRINTF("\" } ");
break;
default :
PRINTF("[unknown filter type %#x]", fp->fr_type);
break;
}
if ((type == FR_T_IPF) &&
((fp->fr_flx & FI_WITH) || (fp->fr_mflx & FI_WITH) ||
fp->fr_optbits || fp->fr_optmask ||
fp->fr_secbits || fp->fr_secmask)) {
char *comma = " ";
PRINTF(" with");
if (fp->fr_optbits || fp->fr_optmask ||
fp->fr_secbits || fp->fr_secmask) {
sec[0] = fp->fr_secmask;
sec[1] = fp->fr_secbits;
if (fp->fr_family == AF_INET)
optprint(sec, fp->fr_optmask, fp->fr_optbits);
#ifdef USE_INET6
else
optprintv6(sec, fp->fr_optmask,
fp->fr_optbits);
#endif
} else if (fp->fr_mflx & FI_OPTIONS) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_OPTIONS))
PRINTF("not ");
PRINTF("ipopts");
comma = ",";
}
if (fp->fr_mflx & FI_SHORT) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_SHORT))
PRINTF("not ");
PRINTF("short");
comma = ",";
}
if (fp->fr_mflx & FI_FRAG) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_FRAG))
PRINTF("not ");
PRINTF("frag");
comma = ",";
}
if (fp->fr_mflx & FI_FRAGBODY) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_FRAGBODY))
PRINTF("not ");
PRINTF("frag-body");
comma = ",";
}
if (fp->fr_mflx & FI_NATED) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_NATED))
PRINTF("not ");
PRINTF("nat");
comma = ",";
}
if (fp->fr_mflx & FI_LOWTTL) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_LOWTTL))
PRINTF("not ");
PRINTF("lowttl");
comma = ",";
}
if (fp->fr_mflx & FI_BAD) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_BAD))
PRINTF("not ");
PRINTF("bad");
comma = ",";
}
if (fp->fr_mflx & FI_BADSRC) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_BADSRC))
PRINTF("not ");
PRINTF("bad-src");
comma = ",";
}
if (fp->fr_mflx & FI_BADNAT) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_BADNAT))
PRINTF("not ");
PRINTF("bad-nat");
comma = ",";
}
if (fp->fr_mflx & FI_OOW) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_OOW))
PRINTF("not ");
PRINTF("oow");
comma = ",";
}
if (fp->fr_mflx & FI_MBCAST) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_MBCAST))
PRINTF("not ");
PRINTF("mbcast");
comma = ",";
}
if (fp->fr_mflx & FI_BROADCAST) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_BROADCAST))
PRINTF("not ");
PRINTF("bcast");
comma = ",";
}
if (fp->fr_mflx & FI_MULTICAST) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_MULTICAST))
PRINTF("not ");
PRINTF("mcast");
comma = ",";
}
if (fp->fr_mflx & FI_STATE) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_STATE))
PRINTF("not ");
PRINTF("state");
comma = ",";
}
if (fp->fr_mflx & FI_V6EXTHDR) {
fputs(comma, stdout);
if (!(fp->fr_flx & FI_V6EXTHDR))
PRINTF("not ");
PRINTF("v6hdrs");
comma = ",";
}
}
if (fp->fr_flags & FR_KEEPSTATE) {
host_track_t *src = &fp->fr_srctrack;
PRINTF(" keep state");
if ((fp->fr_flags & (FR_STSTRICT|FR_NEWISN|
FR_NOICMPERR|FR_STATESYNC)) ||
(fp->fr_statemax != 0) || (fp->fr_age[0] != 0) ||
(src->ht_max_nodes != 0)) {
char *comma = "";
PRINTF(" (");
if (fp->fr_statemax != 0) {
PRINTF("limit %u", fp->fr_statemax);
comma = ",";
}
if (src->ht_max_nodes != 0) {
PRINTF("%smax-nodes %d", comma,
src->ht_max_nodes);
if (src->ht_max_per_node)
PRINTF(", max-per-src %d/%d",
src->ht_max_per_node,
src->ht_netmask);
comma = ",";
}
if (fp->fr_flags & FR_STSTRICT) {
PRINTF("%sstrict", comma);
comma = ",";
}
if (fp->fr_flags & FR_STLOOSE) {
PRINTF("%sloose", comma);
comma = ",";
}
if (fp->fr_flags & FR_NEWISN) {
PRINTF("%snewisn", comma);
comma = ",";
}
if (fp->fr_flags & FR_NOICMPERR) {
PRINTF("%sno-icmp-err", comma);
comma = ",";
}
if (fp->fr_flags & FR_STATESYNC) {
PRINTF("%ssync", comma);
comma = ",";
}
if (fp->fr_age[0] || fp->fr_age[1])
PRINTF("%sage %d/%d", comma, fp->fr_age[0],
fp->fr_age[1]);
PRINTF(")");
}
}
if (fp->fr_flags & FR_KEEPFRAG) {
PRINTF(" keep frags");
if (fp->fr_flags & (FR_FRSTRICT)) {
PRINTF(" (");
if (fp->fr_flags & FR_FRSTRICT)
PRINTF("strict");
PRINTF(")");
}
}
if (fp->fr_isc != (struct ipscan *)-1) {
if (fp->fr_isctag != -1)
PRINTF(" scan %s", fp->fr_isctag + fp->fr_names);
else
PRINTF(" scan *");
}
if (fp->fr_grhead != -1)
PRINTF(" head %s", fp->fr_names + fp->fr_grhead);
if (fp->fr_group != -1)
PRINTF(" group %s", fp->fr_names + fp->fr_group);
if (fp->fr_logtag != FR_NOLOGTAG || *fp->fr_nattag.ipt_tag) {
char *s = "";
PRINTF(" set-tag(");
if (fp->fr_logtag != FR_NOLOGTAG) {
PRINTF("log=%u", fp->fr_logtag);
s = ", ";
}
if (*fp->fr_nattag.ipt_tag) {
PRINTF("%snat=%-.*s", s, IPFTAG_LEN,
fp->fr_nattag.ipt_tag);
}
PRINTF(")");
}
if (fp->fr_pps)
PRINTF(" pps %d", fp->fr_pps);
if (fp->fr_comment != -1)
PRINTF(" comment \"%s\"", fp->fr_names + fp->fr_comment);
hash = 0;
if ((fp->fr_flags & FR_KEEPSTATE) && (opts & OPT_VERBOSE)) {
PRINTF(" # count %d", fp->fr_statecnt);
if (fp->fr_die != 0)
PRINTF(" rule-ttl %u", fp->fr_die);
hash = 1;
} else if (fp->fr_die != 0) {
PRINTF(" # rule-ttl %u", fp->fr_die);
hash = 1;
}
if (opts & OPT_DEBUG) {
if (hash == 0)
putchar('#');
PRINTF(" ref %d", fp->fr_ref);
}
(void)putchar('\n');
}
diff --git a/sbin/ipf/libipf/printfraginfo.c b/sbin/ipf/libipf/printfraginfo.c
index fcafdde707be..880c01a06454 100644
--- a/sbin/ipf/libipf/printfraginfo.c
+++ b/sbin/ipf/libipf/printfraginfo.c
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include "kmem.h"
void
printfraginfo(char *prefix, struct ipfr *ifr)
{
frentry_t fr;
int family;
PRINTF("%s", prefix);
if (ifr->ipfr_v == 6) {
PRINTF("inet6");
family = AF_INET6;
} else {
PRINTF("inet");
family = AF_INET;
}
fr.fr_flags = 0xffffffff;
PRINTF(" %s -> ", hostname(family, &ifr->ipfr_src));
/*
if (kmemcpy((char *)&fr, (u_long)ifr->ipfr_rule,
sizeof(fr)) == -1)
return;
*/
PRINTF("%s id %x ttl %lu pr %d pkts %u bytes %u seen0 %d ref %d\n",
hostname(family, &ifr->ipfr_dst), ifr->ipfr_id,
ifr->ipfr_ttl, ifr->ipfr_p, ifr->ipfr_pkts, ifr->ipfr_bytes,
ifr->ipfr_seen0, ifr->ipfr_ref);
}
diff --git a/sbin/ipf/libipf/printhash.c b/sbin/ipf/libipf/printhash.c
index 2db6ace81256..f5ebb57a1c33 100644
--- a/sbin/ipf/libipf/printhash.c
+++ b/sbin/ipf/libipf/printhash.c
@@ -1,54 +1,53 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
iphtable_t *
printhash( iphtable_t *hp, copyfunc_t copyfunc, char *name, int opts,
wordtab_t *fields)
{
iphtent_t *ipep, **table;
iphtable_t iph;
int printed;
size_t sz;
if ((*copyfunc)((char *)hp, (char *)&iph, sizeof(iph)))
return (NULL);
if ((name != NULL) && strncmp(name, iph.iph_name, FR_GROUPLEN))
return (iph.iph_next);
if (fields == NULL)
printhashdata(hp, opts);
if ((hp->iph_flags & IPHASH_DELETE) != 0)
PRINTF("# ");
if ((opts & OPT_DEBUG) == 0)
PRINTF("\t{");
sz = iph.iph_size * sizeof(*table);
table = malloc(sz);
if ((*copyfunc)((char *)iph.iph_table, (char *)table, sz))
return (NULL);
for (printed = 0, ipep = iph.iph_list; ipep != NULL; ) {
ipep = printhashnode(&iph, ipep, copyfunc, opts, fields);
printed++;
}
if (printed == 0)
putchar(';');
free(table);
if ((opts & OPT_DEBUG) == 0)
PRINTF(" };\n");
return (iph.iph_next);
}
diff --git a/sbin/ipf/libipf/printhashnode.c b/sbin/ipf/libipf/printhashnode.c
index 777083d456ac..b3c7140c84d3 100644
--- a/sbin/ipf/libipf/printhashnode.c
+++ b/sbin/ipf/libipf/printhashnode.c
@@ -1,94 +1,93 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
iphtent_t *
printhashnode(iphtable_t *iph, iphtent_t *ipep, copyfunc_t copyfunc, int opts,
wordtab_t *fields)
{
iphtent_t ipe;
u_int hv;
int i;
if ((*copyfunc)(ipep, &ipe, sizeof(ipe)))
return (NULL);
hv = IPE_V4_HASH_FN(ipe.ipe_addr.i6[0], ipe.ipe_mask.i6[0],
iph->iph_size);
if (fields != NULL) {
for (i = 0; fields[i].w_value != 0; i++) {
printpoolfield(&ipe, IPLT_HASH, i);
if (fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
} else if ((opts & OPT_DEBUG) != 0) {
#ifdef USE_INET6
if (ipe.ipe_family == AF_INET6) {
char buf[INET6_ADDRSTRLEN + 1];
const char *str;
buf[0] = '\0';
str = inet_ntop(AF_INET6, &ipe.ipe_addr.in6,
buf, sizeof(buf) - 1);
if (str == NULL)
str = "???";
PRINTF("\t%d\tAddress: %s", hv, str);
printmask(ipe.ipe_family, (u_32_t *)&ipe.ipe_mask.in4_addr);
PRINTF("\tRef. Count: %d\tGroup: %s\n", ipe.ipe_ref,
ipe.ipe_group);
#ifdef USE_QUAD_T
PRINTF("\tHits: %"PRIu64"\tBytes: %"PRIu64"\n",
ipe.ipe_hits, ipe.ipe_bytes);
#else
PRINTF("\tHits: %lu\tBytes: %lu\n",
ipe.ipe_hits, ipe.ipe_bytes);
#endif /* USE_QUAD_T */
} else if (ipe.ipe_family == AF_INET) {
#else
if (ipe.ipe_family == AF_INET) {
#endif /* USE_INET6 */
PRINTF("\t%d\tAddress: %s", hv,
inet_ntoa(ipe.ipe_addr.in4));
printmask(ipe.ipe_family, (u_32_t *)&ipe.ipe_mask.in4_addr);
PRINTF("\tRef. Count: %d\tGroup: %s\n", ipe.ipe_ref,
ipe.ipe_group);
#ifdef USE_QUAD_T
PRINTF("\tHits: %"PRIu64"\tBytes: %"PRIu64"\n",
ipe.ipe_hits, ipe.ipe_bytes);
#else
PRINTF("\tHits: %lu\tBytes: %lu\n",
ipe.ipe_hits, ipe.ipe_bytes);
#endif /* USE_QUAD_T */
} else {
PRINTF("\tAddress: family: %d\n",
ipe.ipe_family);
}
} else {
putchar(' ');
printip(ipe.ipe_family, (u_32_t *)&ipe.ipe_addr.in4_addr);
printmask(ipe.ipe_family, (u_32_t *)&ipe.ipe_mask.in4_addr);
if (ipe.ipe_value != 0) {
switch (iph->iph_type & ~IPHASH_ANON)
{
case IPHASH_GROUPMAP :
if (strncmp(ipe.ipe_group, iph->iph_name,
FR_GROUPLEN))
PRINTF(", group=%s", ipe.ipe_group);
break;
}
}
putchar(';');
}
ipep = ipe.ipe_next;
return (ipep);
}
diff --git a/sbin/ipf/libipf/printhostmap.c b/sbin/ipf/libipf/printhostmap.c
index bdb15d84995f..bd8b71ceec16 100644
--- a/sbin/ipf/libipf/printhostmap.c
+++ b/sbin/ipf/libipf/printhostmap.c
@@ -1,29 +1,28 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printhostmap(hostmap_t *hmp, u_int hv)
{
printactiveaddress(hmp->hm_v, "%s", &hmp->hm_osrcip6, NULL);
putchar(',');
printactiveaddress(hmp->hm_v, "%s", &hmp->hm_odstip6, NULL);
PRINTF(" -> ");
printactiveaddress(hmp->hm_v, "%s", &hmp->hm_nsrcip6, NULL);
putchar(',');
printactiveaddress(hmp->hm_v, "%s", &hmp->hm_ndstip6, NULL);
putchar(' ');
PRINTF("(use = %d", hmp->hm_ref);
if (opts & OPT_VERBOSE)
PRINTF(" hv = %u", hv);
printf(")\n");
}
diff --git a/sbin/ipf/libipf/printhostmask.c b/sbin/ipf/libipf/printhostmask.c
index f5495458fa04..7f607dbedcfc 100644
--- a/sbin/ipf/libipf/printhostmask.c
+++ b/sbin/ipf/libipf/printhostmask.c
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printhostmask( int family, u_32_t *addr, u_32_t *mask)
{
#ifdef USE_INET6
char ipbuf[64];
#else
struct in_addr ipa;
#endif
if ((family == -1) || ((!addr || !*addr) && (!mask || !*mask)))
PRINTF("any");
else {
#ifdef USE_INET6
void *ptr = addr;
PRINTF("%s", inet_ntop(family, ptr, ipbuf, sizeof(ipbuf)));
#else
ipa.s_addr = *addr;
PRINTF("%s", inet_ntoa(ipa));
#endif
if (mask != NULL)
printmask(family, mask);
}
}
diff --git a/sbin/ipf/libipf/printifname.c b/sbin/ipf/libipf/printifname.c
index e6a38a8692ad..4f19c30aef2a 100644
--- a/sbin/ipf/libipf/printifname.c
+++ b/sbin/ipf/libipf/printifname.c
@@ -1,20 +1,19 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printifname(char *format, char *name, void *ifp)
{
PRINTF("%s%s", format, name);
if ((ifp == NULL) && strcmp(name, "-") && strcmp(name, "*"))
PRINTF("(!)");
}
diff --git a/sbin/ipf/libipf/printip.c b/sbin/ipf/libipf/printip.c
index 7cf55f04afec..e4249541f946 100644
--- a/sbin/ipf/libipf/printip.c
+++ b/sbin/ipf/libipf/printip.c
@@ -1,41 +1,40 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printip(int family, u_32_t *addr)
{
struct in_addr ipa;
if (family == AF_INET) {
ipa.s_addr = *addr;
if (ntohl(ipa.s_addr) < 256)
PRINTF("%lu", (u_long)ntohl(ipa.s_addr));
else
PRINTF("%s", inet_ntoa(ipa));
}
#ifdef USE_INET6
else if (family == AF_INET6) {
char buf[INET6_ADDRSTRLEN + 1];
const char *str;
buf[0] = '\0';
str = inet_ntop(AF_INET6, addr, buf, sizeof(buf) - 1);
if (str != NULL)
PRINTF("%s", str);
else
PRINTF("???");
}
#endif
else
PRINTF("?(%d)?", family);
}
diff --git a/sbin/ipf/libipf/printlog.c b/sbin/ipf/libipf/printlog.c
index a04842530504..c9faf40595c9 100644
--- a/sbin/ipf/libipf/printlog.c
+++ b/sbin/ipf/libipf/printlog.c
@@ -1,38 +1,37 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#include <syslog.h>
void
printlog(frentry_t *fp)
{
char *s, *u;
PRINTF("log");
if (fp->fr_flags & FR_LOGBODY)
PRINTF(" body");
if (fp->fr_flags & FR_LOGFIRST)
PRINTF(" first");
if (fp->fr_flags & FR_LOGORBLOCK)
PRINTF(" or-block");
if (fp->fr_loglevel != 0xffff) {
PRINTF(" level ");
s = fac_toname(fp->fr_loglevel);
if (s == NULL || *s == '\0')
s = "!!!";
u = pri_toname(fp->fr_loglevel);
if (u == NULL || *u == '\0')
u = "!!!";
PRINTF("%s.%s", s, u);
}
}
diff --git a/sbin/ipf/libipf/printmask.c b/sbin/ipf/libipf/printmask.c
index 1130c5190f58..bdb28d8ee4a2 100644
--- a/sbin/ipf/libipf/printmask.c
+++ b/sbin/ipf/libipf/printmask.c
@@ -1,28 +1,27 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printmask(int family, u_32_t *mask)
{
struct in_addr ipa;
int ones;
if (family == AF_INET6) {
PRINTF("/%d", count6bits(mask));
} else if ((ones = count4bits(*mask)) == -1) {
ipa.s_addr = *mask;
PRINTF("/%s", inet_ntoa(ipa));
} else {
PRINTF("/%d", ones);
}
}
diff --git a/sbin/ipf/libipf/printnat.c b/sbin/ipf/libipf/printnat.c
index e778d9393d9a..e4c096429b59 100644
--- a/sbin/ipf/libipf/printnat.c
+++ b/sbin/ipf/libipf/printnat.c
@@ -1,351 +1,350 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* Added redirect stuff and a variety of bug fixes. (mcn@EnGarde.com)
*/
#include "ipf.h"
#include "kmem.h"
#if !defined(lint)
static const char rcsid[] = "@(#)$Id$";
#endif
/*
* Print out a NAT rule
*/
void
printnat(ipnat_t *np, int opts)
{
struct protoent *pr;
char *base;
int family;
int proto;
if (np->in_v[0] == 4)
family = AF_INET;
#ifdef USE_INET6
else if (np->in_v[0] == 6)
family = AF_INET6;
#endif
else
family = AF_UNSPEC;
if (np->in_flags & IPN_NO)
PRINTF("no ");
switch (np->in_redir)
{
case NAT_REDIRECT|NAT_ENCAP :
PRINTF("encap in on");
proto = np->in_pr[0];
break;
case NAT_MAP|NAT_ENCAP :
PRINTF("encap out on");
proto = np->in_pr[1];
break;
case NAT_REDIRECT|NAT_DIVERTUDP :
PRINTF("divert in on");
proto = np->in_pr[0];
break;
case NAT_MAP|NAT_DIVERTUDP :
PRINTF("divert out on");
proto = np->in_pr[1];
break;
case NAT_REDIRECT|NAT_REWRITE :
PRINTF("rewrite in on");
proto = np->in_pr[0];
break;
case NAT_MAP|NAT_REWRITE :
PRINTF("rewrite out on");
proto = np->in_pr[1];
break;
case NAT_REDIRECT :
PRINTF("rdr");
proto = np->in_pr[0];
break;
case NAT_MAP :
PRINTF("map");
proto = np->in_pr[1];
break;
case NAT_MAPBLK :
PRINTF("map-block");
proto = np->in_pr[1];
break;
case NAT_BIMAP :
PRINTF("bimap");
proto = np->in_pr[0];
break;
default :
FPRINTF(stderr, "unknown value for in_redir: %#x\n",
np->in_redir);
proto = np->in_pr[0];
break;
}
pr = getprotobynumber(proto);
base = np->in_names;
if (!strcmp(base + np->in_ifnames[0], "-"))
PRINTF(" \"%s\"", base + np->in_ifnames[0]);
else
PRINTF(" %s", base + np->in_ifnames[0]);
if ((np->in_ifnames[1] != -1) &&
(strcmp(base + np->in_ifnames[0], base + np->in_ifnames[1]) != 0)) {
if (!strcmp(base + np->in_ifnames[1], "-"))
PRINTF(",\"%s\"", base + np->in_ifnames[1]);
else
PRINTF(",%s", base + np->in_ifnames[1]);
}
putchar(' ');
if (family == AF_INET6)
PRINTF("inet6 ");
if (np->in_redir & (NAT_REWRITE|NAT_ENCAP|NAT_DIVERTUDP)) {
if ((proto != 0) || (np->in_flags & IPN_TCPUDP)) {
PRINTF("proto ");
printproto(pr, proto, np);
putchar(' ');
}
}
if (np->in_flags & IPN_FILTER) {
if (np->in_flags & IPN_NOTSRC)
PRINTF("! ");
PRINTF("from ");
printnataddr(np->in_v[0], np->in_names, &np->in_osrc,
np->in_ifnames[0]);
if (np->in_scmp)
printportcmp(proto, &np->in_tuc.ftu_src);
if (np->in_flags & IPN_NOTDST)
PRINTF(" !");
PRINTF(" to ");
printnataddr(np->in_v[0], np->in_names, &np->in_odst,
np->in_ifnames[0]);
if (np->in_dcmp)
printportcmp(proto, &np->in_tuc.ftu_dst);
}
if (np->in_redir & (NAT_ENCAP|NAT_DIVERTUDP)) {
PRINTF(" -> src ");
printnataddr(np->in_v[1], np->in_names, &np->in_nsrc,
np->in_ifnames[0]);
if ((np->in_redir & NAT_DIVERTUDP) != 0)
PRINTF(",%u", np->in_spmin);
PRINTF(" dst ");
printnataddr(np->in_v[1], np->in_names, &np->in_ndst,
np->in_ifnames[0]);
if ((np->in_redir & NAT_DIVERTUDP) != 0)
PRINTF(",%u udp", np->in_dpmin);
if ((np->in_flags & IPN_PURGE) != 0)
PRINTF(" purge");
PRINTF(";\n");
} else if (np->in_redir & NAT_REWRITE) {
PRINTF(" -> src ");
if (np->in_nsrc.na_atype == FRI_LOOKUP &&
np->in_nsrc.na_type == IPLT_DSTLIST) {
PRINTF("dstlist/");
if (np->in_nsrc.na_subtype == 0)
PRINTF("%d", np->in_nsrc.na_num);
else
PRINTF("%s", base + np->in_nsrc.na_num);
} else {
printnataddr(np->in_v[1], np->in_names, &np->in_nsrc,
np->in_ifnames[0]);
}
if ((((np->in_flags & IPN_TCPUDP) != 0)) &&
(np->in_spmin != 0)) {
if ((np->in_flags & IPN_FIXEDSPORT) != 0) {
PRINTF(",port = %u", np->in_spmin);
} else {
PRINTF(",%u", np->in_spmin);
if (np->in_spmax != np->in_spmin)
PRINTF("-%u", np->in_spmax);
}
}
PRINTF(" dst ");
if (np->in_ndst.na_atype == FRI_LOOKUP &&
np->in_ndst.na_type == IPLT_DSTLIST) {
PRINTF("dstlist/");
if (np->in_ndst.na_subtype == 0)
PRINTF("%d", np->in_nsrc.na_num);
else
PRINTF("%s", base + np->in_ndst.na_num);
} else {
printnataddr(np->in_v[1], np->in_names, &np->in_ndst,
np->in_ifnames[0]);
}
if ((((np->in_flags & IPN_TCPUDP) != 0)) &&
(np->in_dpmin != 0)) {
if ((np->in_flags & IPN_FIXEDDPORT) != 0) {
PRINTF(",port = %u", np->in_dpmin);
} else {
PRINTF(",%u", np->in_dpmin);
if (np->in_dpmax != np->in_dpmin)
PRINTF("-%u", np->in_dpmax);
}
}
if ((np->in_flags & IPN_PURGE) != 0)
PRINTF(" purge");
PRINTF(";\n");
} else if (np->in_redir == NAT_REDIRECT) {
if (!(np->in_flags & IPN_FILTER)) {
printnataddr(np->in_v[0], np->in_names, &np->in_odst,
np->in_ifnames[0]);
if (np->in_flags & IPN_TCPUDP) {
PRINTF(" port %d", np->in_odport);
if (np->in_odport != np->in_dtop)
PRINTF("-%d", np->in_dtop);
}
}
if (np->in_flags & IPN_NO) {
putchar(' ');
printproto(pr, proto, np);
PRINTF(";\n");
return;
}
PRINTF(" -> ");
printnataddr(np->in_v[1], np->in_names, &np->in_ndst,
np->in_ifnames[0]);
if (np->in_flags & IPN_TCPUDP) {
if ((np->in_flags & IPN_FIXEDDPORT) != 0)
PRINTF(" port = %d", np->in_dpmin);
else {
PRINTF(" port %d", np->in_dpmin);
if (np->in_dpmin != np->in_dpmax)
PRINTF("-%d", np->in_dpmax);
}
}
putchar(' ');
printproto(pr, proto, np);
if (np->in_flags & IPN_ROUNDR)
PRINTF(" round-robin");
if (np->in_flags & IPN_FRAG)
PRINTF(" frag");
if (np->in_age[0] != 0 || np->in_age[1] != 0) {
PRINTF(" age %d/%d", np->in_age[0], np->in_age[1]);
}
if (np->in_flags & IPN_STICKY)
PRINTF(" sticky");
if (np->in_mssclamp != 0)
PRINTF(" mssclamp %d", np->in_mssclamp);
if (np->in_plabel != -1)
PRINTF(" proxy %s", np->in_names + np->in_plabel);
if (np->in_tag.ipt_tag[0] != '\0')
PRINTF(" tag %-.*s", IPFTAG_LEN, np->in_tag.ipt_tag);
if ((np->in_flags & IPN_PURGE) != 0)
PRINTF(" purge");
PRINTF("\n");
if (opts & OPT_DEBUG)
PRINTF("\tpmax %u\n", np->in_dpmax);
} else {
int protoprinted = 0;
if (!(np->in_flags & IPN_FILTER)) {
printnataddr(np->in_v[0], np->in_names, &np->in_osrc,
np->in_ifnames[0]);
}
if (np->in_flags & IPN_NO) {
putchar(' ');
printproto(pr, proto, np);
PRINTF(";\n");
return;
}
PRINTF(" -> ");
if (np->in_flags & IPN_SIPRANGE) {
PRINTF("range ");
printnataddr(np->in_v[1], np->in_names, &np->in_nsrc,
np->in_ifnames[0]);
} else {
printnataddr(np->in_v[1], np->in_names, &np->in_nsrc,
np->in_ifnames[0]);
}
if (np->in_plabel != -1) {
PRINTF(" proxy port ");
if (np->in_odport != 0) {
char *s;
s = portname(proto, np->in_odport);
if (s != NULL)
fputs(s, stdout);
else
fputs("???", stdout);
}
PRINTF(" %s/", np->in_names + np->in_plabel);
printproto(pr, proto, NULL);
protoprinted = 1;
} else if (np->in_redir == NAT_MAPBLK) {
if ((np->in_spmin == 0) &&
(np->in_flags & IPN_AUTOPORTMAP))
PRINTF(" ports auto");
else
PRINTF(" ports %d", np->in_spmin);
if (opts & OPT_DEBUG)
PRINTF("\n\tip modulous %d", np->in_spmax);
} else if (np->in_spmin || np->in_spmax) {
if (np->in_flags & IPN_ICMPQUERY) {
PRINTF(" icmpidmap ");
} else {
PRINTF(" portmap ");
}
printproto(pr, proto, np);
protoprinted = 1;
if (np->in_flags & IPN_AUTOPORTMAP) {
PRINTF(" auto");
if (opts & OPT_DEBUG)
PRINTF(" [%d:%d %d %d]",
np->in_spmin, np->in_spmax,
np->in_ippip, np->in_ppip);
} else {
PRINTF(" %d:%d", np->in_spmin, np->in_spmax);
}
if (np->in_flags & IPN_SEQUENTIAL)
PRINTF(" sequential");
}
if (np->in_flags & IPN_FRAG)
PRINTF(" frag");
if (np->in_age[0] != 0 || np->in_age[1] != 0) {
PRINTF(" age %d/%d", np->in_age[0], np->in_age[1]);
}
if (np->in_mssclamp != 0)
PRINTF(" mssclamp %d", np->in_mssclamp);
if (np->in_tag.ipt_tag[0] != '\0')
PRINTF(" tag %s", np->in_tag.ipt_tag);
if (!protoprinted && (np->in_flags & IPN_TCPUDP || proto)) {
putchar(' ');
printproto(pr, proto, np);
}
if ((np->in_flags & IPN_PURGE) != 0)
PRINTF(" purge");
PRINTF("\n");
if (opts & OPT_DEBUG) {
PRINTF("\tnextip ");
printip(family, &np->in_snip);
PRINTF(" pnext %d\n", np->in_spnext);
}
}
if (opts & OPT_DEBUG) {
PRINTF("\tspace %lu use %u hits %lu flags %#x proto %d/%d",
np->in_space, np->in_use, np->in_hits,
np->in_flags, np->in_pr[0], np->in_pr[1]);
PRINTF(" hv %u/%u\n", np->in_hv[0], np->in_hv[1]);
PRINTF("\tifp[0] %p ifp[1] %p apr %p\n",
np->in_ifps[0], np->in_ifps[1], np->in_apr);
PRINTF("\ttqehead %p/%p comment %p\n",
np->in_tqehead[0], np->in_tqehead[1], np->in_comment);
}
}
diff --git a/sbin/ipf/libipf/printpacket.c b/sbin/ipf/libipf/printpacket.c
index 9444f93fe840..a48725a220e0 100644
--- a/sbin/ipf/libipf/printpacket.c
+++ b/sbin/ipf/libipf/printpacket.c
@@ -1,108 +1,107 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#ifndef IP_OFFMASK
# define IP_OFFMASK 0x3fff
#endif
void
printpacket(int dir, mb_t *m)
{
u_short len, off;
tcphdr_t *tcp;
ip_t *ip;
ip = MTOD(m, ip_t *);
if (IP_V(ip) == 6) {
#ifdef USE_INET6
len = ntohs(((ip6_t *)ip)->ip6_plen);
#else
len = ntohs(((u_short *)ip)[2]);
#endif
len += 40;
} else {
len = ntohs(ip->ip_len);
}
ASSERT(len == msgdsize(m));
if ((opts & OPT_HEX) == OPT_HEX) {
u_char *s;
int i;
for (; m != NULL; m = m->mb_next) {
len = m->mb_len;
for (s = (u_char *)m->mb_data, i = 0; i < len; i++) {
PRINTF("%02x", *s++ & 0xff);
if (len - i > 1) {
i++;
PRINTF("%02x", *s++ & 0xff);
}
putchar(' ');
}
}
putchar('\n');
putchar('\n');
return;
}
if (IP_V(ip) == 6) {
printpacket6(dir, m);
return;
}
if (dir)
PRINTF("> ");
else
PRINTF("< ");
PRINTF("%s ", IFNAME(m->mb_ifp));
off = ntohs(ip->ip_off);
tcp = (struct tcphdr *)((char *)ip + (IP_HL(ip) << 2));
PRINTF("ip #%d %d(%d) %d", ntohs(ip->ip_id), ntohs(ip->ip_len),
IP_HL(ip) << 2, ip->ip_p);
if (off & IP_OFFMASK)
PRINTF(" @%d", off << 3);
PRINTF(" %s", inet_ntoa(ip->ip_src));
if (!(off & IP_OFFMASK))
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP)
PRINTF(",%d", ntohs(tcp->th_sport));
PRINTF(" > ");
PRINTF("%s", inet_ntoa(ip->ip_dst));
if (!(off & IP_OFFMASK)) {
if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_UDP)
PRINTF(",%d", ntohs(tcp->th_dport));
if ((ip->ip_p == IPPROTO_TCP) && (tcp->th_flags != 0)) {
putchar(' ');
if (tcp->th_flags & TH_FIN)
putchar('F');
if (tcp->th_flags & TH_SYN)
putchar('S');
if (tcp->th_flags & TH_RST)
putchar('R');
if (tcp->th_flags & TH_PUSH)
putchar('P');
if (tcp->th_flags & TH_ACK)
putchar('A');
if (tcp->th_flags & TH_URG)
putchar('U');
if (tcp->th_flags & TH_ECN)
putchar('E');
if (tcp->th_flags & TH_CWR)
putchar('C');
}
}
putchar('\n');
}
diff --git a/sbin/ipf/libipf/printpacket6.c b/sbin/ipf/libipf/printpacket6.c
index 42d1a36b96b3..c015eabdada5 100644
--- a/sbin/ipf/libipf/printpacket6.c
+++ b/sbin/ipf/libipf/printpacket6.c
@@ -1,58 +1,57 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
/*
* This is meant to work without the IPv6 header files being present or
* the inet_ntop() library.
*/
void
printpacket6(int dir, mb_t *m)
{
u_char *buf, p;
u_short plen, *addrs;
tcphdr_t *tcp;
u_32_t flow;
buf = (u_char *)m->mb_data;
tcp = (tcphdr_t *)(buf + 40);
p = buf[6];
flow = ntohl(*(u_32_t *)buf);
flow &= 0xfffff;
plen = ntohs(*((u_short *)buf +2));
addrs = (u_short *)buf + 4;
if (dir)
PRINTF("> ");
else
PRINTF("< ");
PRINTF("%s ", IFNAME(m->mb_ifp));
PRINTF("ip6/%d %d %#x %d", buf[0] & 0xf, plen, flow, p);
PRINTF(" %x:%x:%x:%x:%x:%x:%x:%x",
ntohs(addrs[0]), ntohs(addrs[1]), ntohs(addrs[2]),
ntohs(addrs[3]), ntohs(addrs[4]), ntohs(addrs[5]),
ntohs(addrs[6]), ntohs(addrs[7]));
if (plen >= 4)
if (p == IPPROTO_TCP || p == IPPROTO_UDP)
(void)PRINTF(",%d", ntohs(tcp->th_sport));
PRINTF(" >");
addrs += 8;
PRINTF(" %x:%x:%x:%x:%x:%x:%x:%x",
ntohs(addrs[0]), ntohs(addrs[1]), ntohs(addrs[2]),
ntohs(addrs[3]), ntohs(addrs[4]), ntohs(addrs[5]),
ntohs(addrs[6]), ntohs(addrs[7]));
if (plen >= 4)
if (p == IPPROTO_TCP || p == IPPROTO_UDP)
PRINTF(",%d", ntohs(tcp->th_dport));
putchar('\n');
}
diff --git a/sbin/ipf/libipf/printpool.c b/sbin/ipf/libipf/printpool.c
index b3bdd02b64b4..86f389c6cbaf 100644
--- a/sbin/ipf/libipf/printpool.c
+++ b/sbin/ipf/libipf/printpool.c
@@ -1,61 +1,60 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
ip_pool_t *
printpool(ip_pool_t *pp, copyfunc_t copyfunc, char *name, int opts,
wordtab_t *fields)
{
ip_pool_node_t *ipnp, *ipnpn, ipn, **pnext;
ip_pool_t ipp;
if ((*copyfunc)(pp, &ipp, sizeof(ipp)))
return (NULL);
if ((name != NULL) && strncmp(name, ipp.ipo_name, FR_GROUPLEN))
return (ipp.ipo_next);
printpooldata(&ipp, opts);
if ((ipp.ipo_flags & IPOOL_DELETE) != 0)
PRINTF("# ");
if ((opts & OPT_DEBUG) == 0)
PRINTF("\t{");
ipnpn = ipp.ipo_list;
ipp.ipo_list = NULL;
pnext = &ipp.ipo_list;
while (ipnpn != NULL) {
ipnp = (ip_pool_node_t *)malloc(sizeof(*ipnp));
(*copyfunc)(ipnpn, ipnp, sizeof(ipn));
ipnpn = ipnp->ipn_next;
*pnext = ipnp;
pnext = &ipnp->ipn_next;
ipnp->ipn_next = NULL;
}
if (ipp.ipo_list == NULL) {
putchar(';');
} else {
for (ipnp = ipp.ipo_list; ipnp != NULL; ipnp = ipnpn) {
ipnpn = printpoolnode(ipnp, opts, fields);
free(ipnp);
if ((opts & OPT_DEBUG) == 0) {
putchar(';');
}
}
}
if ((opts & OPT_DEBUG) == 0)
PRINTF(" };\n");
return (ipp.ipo_next);
}
diff --git a/sbin/ipf/libipf/printpoolnode.c b/sbin/ipf/libipf/printpoolnode.c
index 023aca47c7ff..8cec3fcae757 100644
--- a/sbin/ipf/libipf/printpoolnode.c
+++ b/sbin/ipf/libipf/printpoolnode.c
@@ -1,68 +1,67 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
ip_pool_node_t *
printpoolnode(ip_pool_node_t *np, int opts, wordtab_t *fields)
{
int i;
if (fields != NULL) {
for (i = 0; fields[i].w_value != 0; i++) {
printpoolfield(np, IPLT_POOL, i);
if (fields[i + 1].w_value != 0)
printf("\t");
}
printf("\n");
} else if ((opts & OPT_DEBUG) == 0) {
putchar(' ');
if (np->ipn_info == 1)
PRINTF("! ");
printip(np->ipn_addr.adf_family,
(u_32_t *)&np->ipn_addr.adf_addr.in4);
printmask(np->ipn_addr.adf_family,
(u_32_t *)&np->ipn_mask.adf_addr);
} else {
#ifdef USE_INET6
if (np->ipn_addr.adf_family == AF_INET6) {
char buf[INET6_ADDRSTRLEN + 1];
const char *str;
buf[0] = '\0';
str = inet_ntop(AF_INET6, &np->ipn_addr.adf_addr.in6,
buf, sizeof(buf) - 1);
if (str == NULL)
str = "???";
PRINTF("\tAddress: %s%s", np->ipn_info ? "! " : "",
str);
} else if (np->ipn_addr.adf_family == AF_INET) {
#else
if (np->ipn_addr.adf_family == AF_INET) {
#endif
PRINTF("\tAddress: %s%s", np->ipn_info ? "! " : "",
inet_ntoa(np->ipn_addr.adf_addr.in4));
} else {
PRINTF("\tAddress: family: %d\n",
np->ipn_addr.adf_family);
}
printmask(np->ipn_addr.adf_family,
(u_32_t *)&np->ipn_mask.adf_addr);
#ifdef USE_QUAD_T
PRINTF("\n\t\tHits %"PRIu64"\tBytes %"PRIu64"\tName %s\tRef %d\n",
np->ipn_hits, np->ipn_bytes,
np->ipn_name, np->ipn_ref);
#else
PRINTF("\n\t\tHits %lu\tBytes %lu\tName %s\tRef %d\n",
np->ipn_hits, np->ipn_bytes,
np->ipn_name, np->ipn_ref);
#endif
}
return (np->ipn_next);
}
diff --git a/sbin/ipf/libipf/printportcmp.c b/sbin/ipf/libipf/printportcmp.c
index 556a3ac2fb0b..2e3ee471e3e2 100644
--- a/sbin/ipf/libipf/printportcmp.c
+++ b/sbin/ipf/libipf/printportcmp.c
@@ -1,28 +1,27 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printportcmp(int pr, frpcmp_t *frp)
{
static char *pcmp1[] = { "*", "=", "!=", "<", ">", "<=", ">=",
"<>", "><", ":" };
if (frp->frp_cmp == FR_INRANGE || frp->frp_cmp == FR_OUTRANGE)
PRINTF(" port %d %s %d", frp->frp_port,
pcmp1[frp->frp_cmp], frp->frp_top);
else if (frp->frp_cmp == FR_INCRANGE)
PRINTF(" port %d:%d", frp->frp_port, frp->frp_top);
else
PRINTF(" port %s %s", pcmp1[frp->frp_cmp],
portname(pr, frp->frp_port));
}
diff --git a/sbin/ipf/libipf/printsbuf.c b/sbin/ipf/libipf/printsbuf.c
index c9c89ef6eb01..4d3de8468dee 100644
--- a/sbin/ipf/libipf/printsbuf.c
+++ b/sbin/ipf/libipf/printsbuf.c
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#ifdef IPFILTER_SCAN
#include <ctype.h>
#include <stdio.h>
#include "ipf.h"
#include "netinet/ip_scan.h"
void
printsbuf(char *buf)
{
u_char *s;
int i;
for (s = (u_char *)buf, i = ISC_TLEN; i; i--, s++) {
if (ISPRINT(*s))
putchar(*s);
else
PRINTF("\\%o", *s);
}
}
#else
void printsbuf(char *buf);
void printsbuf(char *buf)
{
#if 0
buf = buf; /* gcc -Wextra */
#endif
}
#endif
diff --git a/sbin/ipf/libipf/printstate.c b/sbin/ipf/libipf/printstate.c
index 1f135231ff58..3b6f6c3b07d4 100644
--- a/sbin/ipf/libipf/printstate.c
+++ b/sbin/ipf/libipf/printstate.c
@@ -1,217 +1,216 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*/
#include "ipf.h"
#include "kmem.h"
ipstate_t *
printstate(ipstate_t *sp, int opts, u_long now)
{
struct protoent *pr;
synclist_t ipsync;
if ((opts & OPT_NORESOLVE) == 0)
pr = getprotobynumber(sp->is_p);
else
pr = NULL;
PRINTF("%d:", sp->is_v);
if (pr != NULL)
PRINTF("%s", pr->p_name);
else
PRINTF("%d", sp->is_p);
PRINTF(" src:%s", hostname(sp->is_family, &sp->is_src.in4));
if (sp->is_p == IPPROTO_UDP || sp->is_p == IPPROTO_TCP) {
if (sp->is_flags & IS_WSPORT)
PRINTF(",*");
else
PRINTF(",%d", ntohs(sp->is_sport));
}
PRINTF(" dst:%s", hostname(sp->is_family, &sp->is_dst.in4));
if (sp->is_p == IPPROTO_UDP || sp->is_p == IPPROTO_TCP) {
if (sp->is_flags & IS_WDPORT)
PRINTF(",*");
else
PRINTF(",%d", ntohs(sp->is_dport));
}
if (sp->is_p == IPPROTO_TCP) {
PRINTF(" state:%d/%d", sp->is_state[0], sp->is_state[1]);
}
PRINTF(" %ld", sp->is_die - now);
if (sp->is_phnext == NULL)
PRINTF(" ORPHAN");
if (sp->is_flags & IS_CLONE)
PRINTF(" CLONE");
putchar('\n');
if (sp->is_p == IPPROTO_TCP) {
PRINTF("\t%x:%x %hu<<%d:%hu<<%d\n",
sp->is_send, sp->is_dend,
sp->is_maxswin, sp->is_swinscale,
sp->is_maxdwin, sp->is_dwinscale);
if ((opts & OPT_VERBOSE) != 0) {
PRINTF("\tcmsk %04x smsk %04x isc %p s0 %08x/%08x\n",
sp->is_smsk[0], sp->is_smsk[1], sp->is_isc,
sp->is_s0[0], sp->is_s0[1]);
PRINTF("\tFWD: ISN inc %x sumd %x\n",
sp->is_isninc[0], sp->is_sumd[0]);
PRINTF("\tREV: ISN inc %x sumd %x\n",
sp->is_isninc[1], sp->is_sumd[1]);
#ifdef IPFILTER_SCAN
PRINTF("\tsbuf[0] [");
printsbuf(sp->is_sbuf[0]);
PRINTF("] sbuf[1] [");
printsbuf(sp->is_sbuf[1]);
PRINTF("]\n");
#endif
}
} else if (sp->is_p == IPPROTO_GRE) {
PRINTF("\tcall %hx/%hx\n", ntohs(sp->is_gre.gs_call[0]),
ntohs(sp->is_gre.gs_call[1]));
} else if (sp->is_p == IPPROTO_ICMP
#ifdef USE_INET6
|| sp->is_p == IPPROTO_ICMPV6
#endif
) {
PRINTF("\tid %hu seq %hu type %d\n", sp->is_icmp.ici_id,
sp->is_icmp.ici_seq, sp->is_icmp.ici_type);
}
#ifdef USE_QUAD_T
PRINTF("\tFWD: IN pkts %"PRIu64" bytes %"PRIu64" OUT pkts %"PRIu64" bytes %"PRIu64"\n\tREV: IN pkts %"PRIu64" bytes %"PRIu64" OUT pkts %"PRIu64" bytes %"PRIu64"\n",
sp->is_pkts[0], sp->is_bytes[0],
sp->is_pkts[1], sp->is_bytes[1],
sp->is_pkts[2], sp->is_bytes[2],
sp->is_pkts[3], sp->is_bytes[3]);
#else
PRINTF("\tFWD: IN pkts %lu bytes %lu OUT pkts %lu bytes %lu\n\tREV: IN pkts %lu bytes %lu OUT pkts %lu bytes %lu\n",
sp->is_pkts[0], sp->is_bytes[0],
sp->is_pkts[1], sp->is_bytes[1],
sp->is_pkts[2], sp->is_bytes[2],
sp->is_pkts[3], sp->is_bytes[3]);
#endif
PRINTF("\ttag %u pass %#x = ", sp->is_tag, sp->is_pass);
/*
* Print out bits set in the result code for the state being
* kept as they would for a rule.
*/
if (FR_ISPASS(sp->is_pass)) {
PRINTF("pass");
} else if (FR_ISBLOCK(sp->is_pass)) {
PRINTF("block");
switch (sp->is_pass & FR_RETMASK)
{
case FR_RETICMP :
PRINTF(" return-icmp");
break;
case FR_FAKEICMP :
PRINTF(" return-icmp-as-dest");
break;
case FR_RETRST :
PRINTF(" return-rst");
break;
default :
break;
}
} else if ((sp->is_pass & FR_LOGMASK) == FR_LOG) {
PRINTF("log");
if (sp->is_pass & FR_LOGBODY)
PRINTF(" body");
if (sp->is_pass & FR_LOGFIRST)
PRINTF(" first");
} else if (FR_ISACCOUNT(sp->is_pass)) {
PRINTF("count");
} else if (FR_ISPREAUTH(sp->is_pass)) {
PRINTF("preauth");
} else if (FR_ISAUTH(sp->is_pass))
PRINTF("auth");
if (sp->is_pass & FR_OUTQUE)
PRINTF(" out");
else
PRINTF(" in");
if ((sp->is_pass & FR_LOG) != 0) {
PRINTF(" log");
if (sp->is_pass & FR_LOGBODY)
PRINTF(" body");
if (sp->is_pass & FR_LOGFIRST)
PRINTF(" first");
if (sp->is_pass & FR_LOGORBLOCK)
PRINTF(" or-block");
}
if (sp->is_pass & FR_QUICK)
PRINTF(" quick");
if (sp->is_pass & FR_KEEPFRAG)
PRINTF(" keep frags");
/* a given; no? */
if (sp->is_pass & FR_KEEPSTATE) {
PRINTF(" keep state");
if (sp->is_pass & (FR_STATESYNC|FR_STSTRICT|FR_STLOOSE)) {
PRINTF(" (");
if (sp->is_pass & FR_STATESYNC)
PRINTF(" sync");
if (sp->is_pass & FR_STSTRICT)
PRINTF(" strict");
if (sp->is_pass & FR_STLOOSE)
PRINTF(" loose");
PRINTF(" )");
}
}
PRINTF("\n");
if ((opts & OPT_VERBOSE) != 0) {
PRINTF("\tref %d", sp->is_ref);
PRINTF(" pkt_flags & %x(%x) = %x\n",
sp->is_flags & 0xf, sp->is_flags, sp->is_flags >> 4);
PRINTF("\tpkt_options & %x = %x, %x = %x \n", sp->is_optmsk[0],
sp->is_opt[0], sp->is_optmsk[1], sp->is_opt[1]);
PRINTF("\tpkt_security & %x = %x, pkt_auth & %x = %x\n",
sp->is_secmsk, sp->is_sec, sp->is_authmsk,
sp->is_auth);
PRINTF("\tis_flx %#x %#x %#x %#x\n", sp->is_flx[0][0],
sp->is_flx[0][1], sp->is_flx[1][0], sp->is_flx[1][1]);
}
PRINTF("\tinterfaces: in %s", FORMAT_IF(sp->is_ifname[0]));
if (opts & OPT_DEBUG)
PRINTF("/%p", sp->is_ifp[0]);
PRINTF(",%s", FORMAT_IF(sp->is_ifname[1]));
if (opts & OPT_DEBUG)
PRINTF("/%p", sp->is_ifp[1]);
PRINTF(" out %s", FORMAT_IF(sp->is_ifname[2]));
if (opts & OPT_DEBUG)
PRINTF("/%p", sp->is_ifp[2]);
PRINTF(",%s", FORMAT_IF(sp->is_ifname[3]));
if (opts & OPT_DEBUG)
PRINTF("/%p", sp->is_ifp[3]);
PRINTF("\n");
PRINTF("\tSync status: ");
if (sp->is_sync != NULL) {
if (kmemcpy((char *)&ipsync, (u_long)sp->is_sync,
sizeof(ipsync))) {
PRINTF("status could not be retrieved\n");
return (NULL);
}
PRINTF("idx %d num %d v %d pr %d rev %d\n",
ipsync.sl_idx, ipsync.sl_num, ipsync.sl_v,
ipsync.sl_p, ipsync.sl_rev);
} else {
PRINTF("not synchronized\n");
}
return (sp->is_next);
}
diff --git a/sbin/ipf/libipf/printtunable.c b/sbin/ipf/libipf/printtunable.c
index b748efd5129a..8cd212a2b8b4 100644
--- a/sbin/ipf/libipf/printtunable.c
+++ b/sbin/ipf/libipf/printtunable.c
@@ -1,29 +1,28 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
void
printtunable(ipftune_t *tup)
{
PRINTF("%s\tmin %lu\tmax %lu\tcurrent ",
tup->ipft_name, tup->ipft_min, tup->ipft_max);
if (tup->ipft_sz == sizeof(u_long))
PRINTF("%lu\n", tup->ipft_vlong);
else if (tup->ipft_sz == sizeof(u_int))
PRINTF("%u\n", tup->ipft_vint);
else if (tup->ipft_sz == sizeof(u_short))
PRINTF("%hu\n", tup->ipft_vshort);
else if (tup->ipft_sz == sizeof(u_char))
PRINTF("%u\n", (u_int)tup->ipft_vchar);
else {
PRINTF("sz = %d\n", tup->ipft_sz);
}
}
diff --git a/sbin/ipf/libipf/remove_hash.c b/sbin/ipf/libipf/remove_hash.c
index 3af2a3f427d7..c6778e372224 100644
--- a/sbin/ipf/libipf/remove_hash.c
+++ b/sbin/ipf/libipf/remove_hash.c
@@ -1,48 +1,47 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_htable.h"
int
remove_hash(iphtable_t *iphp, ioctlfunc_t iocfunc)
{
iplookupop_t op;
iphtable_t iph;
if (pool_open() == -1)
return (-1);
op.iplo_type = IPLT_HASH;
op.iplo_unit = iphp->iph_unit;
strncpy(op.iplo_name, iphp->iph_name, sizeof(op.iplo_name));
if (*op.iplo_name == '\0')
op.iplo_arg = IPHASH_ANON;
op.iplo_size = sizeof(iph);
op.iplo_struct = &iph;
bzero((char *)&iph, sizeof(iph));
iph.iph_unit = iphp->iph_unit;
iph.iph_type = iphp->iph_type;
strncpy(iph.iph_name, iphp->iph_name, sizeof(iph.iph_name));
iph.iph_flags = iphp->iph_flags;
if (pool_ioctl(iocfunc, SIOCLOOKUPDELTABLE, &op)) {
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"remove lookup hash table"));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/remove_hashnode.c b/sbin/ipf/libipf/remove_hashnode.c
index f6679d6acd95..95fada0a81e5 100644
--- a/sbin/ipf/libipf/remove_hashnode.c
+++ b/sbin/ipf/libipf/remove_hashnode.c
@@ -1,52 +1,51 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_htable.h"
int
remove_hashnode(int unit, char *name, iphtent_t *node, ioctlfunc_t iocfunc)
{
iplookupop_t op;
iphtent_t ipe;
if (pool_open() == -1)
return (-1);
op.iplo_type = IPLT_HASH;
op.iplo_unit = unit;
op.iplo_size = sizeof(ipe);
op.iplo_struct = &ipe;
op.iplo_arg = 0;
strncpy(op.iplo_name, name, sizeof(op.iplo_name));
bzero((char *)&ipe, sizeof(ipe));
bcopy((char *)&node->ipe_addr, (char *)&ipe.ipe_addr,
sizeof(ipe.ipe_addr));
bcopy((char *)&node->ipe_mask, (char *)&ipe.ipe_mask,
sizeof(ipe.ipe_mask));
if (opts & OPT_DEBUG) {
printf("\t%s - ", inet_ntoa(ipe.ipe_addr.in4));
printf("%s\n", inet_ntoa(ipe.ipe_mask.in4));
}
if (pool_ioctl(iocfunc, SIOCLOOKUPDELNODE, &op)) {
if (!(opts & OPT_DONOTHING)) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"remove lookup hash node"));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/remove_pool.c b/sbin/ipf/libipf/remove_pool.c
index 0f67368b2b33..21d01fdbc0a4 100644
--- a/sbin/ipf/libipf/remove_pool.c
+++ b/sbin/ipf/libipf/remove_pool.c
@@ -1,45 +1,44 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_htable.h"
int
remove_pool(ip_pool_t *poolp, ioctlfunc_t iocfunc)
{
iplookupop_t op;
ip_pool_t pool;
if (pool_open() == -1)
return (-1);
op.iplo_type = IPLT_POOL;
op.iplo_unit = poolp->ipo_unit;
strncpy(op.iplo_name, poolp->ipo_name, sizeof(op.iplo_name));
op.iplo_size = sizeof(pool);
op.iplo_struct = &pool;
bzero((char *)&pool, sizeof(pool));
pool.ipo_unit = poolp->ipo_unit;
strncpy(pool.ipo_name, poolp->ipo_name, sizeof(pool.ipo_name));
pool.ipo_flags = poolp->ipo_flags;
if (pool_ioctl(iocfunc, SIOCLOOKUPDELTABLE, &op)) {
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"delete lookup pool"));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/remove_poolnode.c b/sbin/ipf/libipf/remove_poolnode.c
index b3c39aa21ec8..2d8caa158604 100644
--- a/sbin/ipf/libipf/remove_poolnode.c
+++ b/sbin/ipf/libipf/remove_poolnode.c
@@ -1,51 +1,50 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <fcntl.h>
#include <sys/ioctl.h>
#include "ipf.h"
#include "netinet/ip_lookup.h"
#include "netinet/ip_pool.h"
int
remove_poolnode(int unit, char *name, ip_pool_node_t *node,
ioctlfunc_t iocfunc)
{
ip_pool_node_t pn;
iplookupop_t op;
if (pool_open() == -1)
return (-1);
op.iplo_unit = unit;
op.iplo_type = IPLT_POOL;
op.iplo_arg = 0;
strncpy(op.iplo_name, name, sizeof(op.iplo_name));
op.iplo_struct = &pn;
op.iplo_size = sizeof(pn);
bzero((char *)&pn, sizeof(pn));
bcopy((char *)&node->ipn_addr, (char *)&pn.ipn_addr,
sizeof(pn.ipn_addr));
bcopy((char *)&node->ipn_mask, (char *)&pn.ipn_mask,
sizeof(pn.ipn_mask));
pn.ipn_info = node->ipn_info;
strncpy(pn.ipn_name, node->ipn_name, sizeof(pn.ipn_name));
if (pool_ioctl(iocfunc, SIOCLOOKUPDELNODE, &op)) {
if ((opts & OPT_DONOTHING) == 0) {
return (ipf_perror_fd(pool_fd(), iocfunc,
"remove lookup pool node"));
}
}
return (0);
}
diff --git a/sbin/ipf/libipf/resetlexer.c b/sbin/ipf/libipf/resetlexer.c
index e6fbbce4ccc0..307ed657a46a 100644
--- a/sbin/ipf/libipf/resetlexer.c
+++ b/sbin/ipf/libipf/resetlexer.c
@@ -1,25 +1,24 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
long string_start = -1;
long string_end = -1;
char *string_val = NULL;
long pos = 0;
void resetlexer(void)
{
string_start = -1;
string_end = -1;
string_val = NULL;
pos = 0;
}
diff --git a/sbin/ipf/libipf/rwlock_emul.c b/sbin/ipf/libipf/rwlock_emul.c
index e15d9610887f..ec8a61c5cff2 100644
--- a/sbin/ipf/libipf/rwlock_emul.c
+++ b/sbin/ipf/libipf/rwlock_emul.c
@@ -1,150 +1,149 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#define EMM_MAGIC 0x97dd8b3a
void eMrwlock_read_enter(eMrwlock_t *rw, char *file, int line)
{
if (rw->eMrw_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMrwlock_read_enter(%p): bad magic: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
if (rw->eMrw_read != 0 || rw->eMrw_write != 0) {
fprintf(stderr,
"%s:eMrwlock_read_enter(%p): already locked: %d/%d\n",
rw->eMrw_owner, rw, rw->eMrw_read, rw->eMrw_write);
abort();
}
rw->eMrw_read++;
rw->eMrw_heldin = file;
rw->eMrw_heldat = line;
}
void eMrwlock_write_enter(eMrwlock_t *rw, char *file, int line)
{
if (rw->eMrw_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMrwlock_write_enter(%p): bad magic: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
if (rw->eMrw_read != 0 || rw->eMrw_write != 0) {
fprintf(stderr,
"%s:eMrwlock_write_enter(%p): already locked: %d/%d\n",
rw->eMrw_owner, rw, rw->eMrw_read, rw->eMrw_write);
abort();
}
rw->eMrw_write++;
rw->eMrw_heldin = file;
rw->eMrw_heldat = line;
}
void eMrwlock_try_upgrade(eMrwlock_t *rw, char *file, int line)
{
if (rw->eMrw_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMrwlock_write_enter(%p): bad magic: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
if (rw->eMrw_read != 0 || rw->eMrw_write != 0) {
fprintf(stderr,
"%s:eMrwlock_try_upgrade(%p): already locked: %d/%d\n",
rw->eMrw_owner, rw, rw->eMrw_read, rw->eMrw_write);
abort();
}
rw->eMrw_write++;
rw->eMrw_heldin = file;
rw->eMrw_heldat = line;
}
void eMrwlock_downgrade(eMrwlock_t *rw, char *file, int line)
{
if (rw->eMrw_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMrwlock_write_enter(%p): bad magic: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
if (rw->eMrw_read != 0 || rw->eMrw_write != 1) {
fprintf(stderr,
"%s:eMrwlock_write_enter(%p): already locked: %d/%d\n",
rw->eMrw_owner, rw, rw->eMrw_read, rw->eMrw_write);
abort();
}
rw->eMrw_write--;
rw->eMrw_read++;
rw->eMrw_heldin = file;
rw->eMrw_heldat = line;
}
void eMrwlock_exit(eMrwlock_t *rw)
{
if (rw->eMrw_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMrwlock_exit(%p): bad magic: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
if (rw->eMrw_read != 1 && rw->eMrw_write != 1) {
fprintf(stderr, "%s:eMrwlock_exit(%p): not locked: %d/%d\n",
rw->eMrw_owner, rw, rw->eMrw_read, rw->eMrw_write);
abort();
}
if (rw->eMrw_read == 1)
rw->eMrw_read--;
else if (rw->eMrw_write == 1)
rw->eMrw_write--;
rw->eMrw_heldin = NULL;
rw->eMrw_heldat = 0;
}
static int initcount = 0;
void eMrwlock_init(eMrwlock_t *rw, char *who)
{
if (rw->eMrw_magic == EMM_MAGIC) { /* safe bet ? */
fprintf(stderr,
"%s:eMrwlock_init(%p): already initialised?: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
rw->eMrw_magic = EMM_MAGIC;
rw->eMrw_read = 0;
rw->eMrw_write = 0;
if (who != NULL)
rw->eMrw_owner = strdup(who);
else
rw->eMrw_owner = NULL;
initcount++;
}
void eMrwlock_destroy(eMrwlock_t *rw)
{
if (rw->eMrw_magic != EMM_MAGIC) {
fprintf(stderr, "%s:eMrwlock_destroy(%p): bad magic: %#x\n",
rw->eMrw_owner, rw, rw->eMrw_magic);
abort();
}
if (rw->eMrw_owner != NULL)
free(rw->eMrw_owner);
memset(rw, 0xa5, sizeof(*rw));
initcount--;
}
void ipf_rwlock_clean(void)
{
if (initcount != 0)
abort();
}
diff --git a/sbin/ipf/libipf/tcp_flags.c b/sbin/ipf/libipf/tcp_flags.c
index e652819bebb1..0156d8cd7f31 100644
--- a/sbin/ipf/libipf/tcp_flags.c
+++ b/sbin/ipf/libipf/tcp_flags.c
@@ -1,47 +1,46 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2000-2004 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id: tcp_flags.c,v 1.8.2.1 2006/06/16 17:21:17 darrenr Exp $
*/
#include "ipf.h"
extern char flagset[];
extern u_char flags[];
u_char tcp_flags(char *flgs, u_char *mask, int linenum)
{
u_char tcpf = 0, tcpfm = 0;
char *s;
s = strchr(flgs, '/');
if (s)
*s++ = '\0';
if (*flgs == '0') {
tcpf = strtol(flgs, NULL, 0);
} else {
tcpf = tcpflags(flgs);
}
if (s != NULL) {
if (*s == '0')
tcpfm = strtol(s, NULL, 0);
else
tcpfm = tcpflags(s);
}
if (!tcpfm) {
if (tcpf == TH_SYN)
tcpfm = 0xff & ~(TH_ECN|TH_CWR);
else
tcpfm = 0xff & ~(TH_ECN);
}
*mask = tcpfm;
return (tcpf);
}
diff --git a/sbin/ipf/libipf/tcpflags.c b/sbin/ipf/libipf/tcpflags.c
index ef2950836393..92437d1be798 100644
--- a/sbin/ipf/libipf/tcpflags.c
+++ b/sbin/ipf/libipf/tcpflags.c
@@ -1,44 +1,43 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
/*
* ECN is a new addition to TCP - RFC 2481
*/
#ifndef TH_ECN
# define TH_ECN 0x40
#endif
#ifndef TH_CWR
# define TH_CWR 0x80
#endif
extern char flagset[];
extern u_char flags[];
u_char tcpflags(char *flgs)
{
u_char tcpf = 0;
char *s, *t;
for (s = flgs; *s; s++) {
if (*s == 'W')
tcpf |= TH_CWR;
else {
if (!(t = strchr(flagset, *s))) {
return (0);
}
tcpf |= flags[t - flagset];
}
}
return (tcpf);
}
diff --git a/sbin/ipf/libipf/tcpoptnames.c b/sbin/ipf/libipf/tcpoptnames.c
index 24e41bb18b8b..3044f939438d 100644
--- a/sbin/ipf/libipf/tcpoptnames.c
+++ b/sbin/ipf/libipf/tcpoptnames.c
@@ -1,22 +1,21 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
struct ipopt_names tcpoptnames[] ={
{ TCPOPT_NOP, 0x000001, 1, "nop" },
{ TCPOPT_MAXSEG, 0x000002, 4, "maxseg" },
{ TCPOPT_WINDOW, 0x000004, 3, "wscale" },
{ TCPOPT_SACK_PERMITTED, 0x000008, 2, "sackok" },
{ TCPOPT_SACK, 0x000010, 3, "sack" },
{ TCPOPT_TIMESTAMP, 0x000020, 10, "tstamp" },
{ 0, 0, 0, (char *)NULL } /* must be last */
};
diff --git a/sbin/ipf/libipf/v6ionames.c b/sbin/ipf/libipf/v6ionames.c
index 9f1207f13431..485af14f7863 100644
--- a/sbin/ipf/libipf/v6ionames.c
+++ b/sbin/ipf/libipf/v6ionames.c
@@ -1,28 +1,27 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
#ifdef USE_INET6
struct ipopt_names v6ionames[] ={
{ IPPROTO_HOPOPTS, 0x000001, 0, "hopopts" },
{ IPPROTO_IPV6, 0x000002, 0, "ipv6" },
{ IPPROTO_ROUTING, 0x000004, 0, "routing" },
{ IPPROTO_FRAGMENT, 0x000008, 0, "frag" },
{ IPPROTO_ESP, 0x000010, 0, "esp" },
{ IPPROTO_AH, 0x000020, 0, "ah" },
{ IPPROTO_NONE, 0x000040, 0, "none" },
{ IPPROTO_DSTOPTS, 0x000080, 0, "dstopts" },
{ IPPROTO_MOBILITY, 0x000100, 0, "mobility" },
{ 0, 0, 0, (char *)NULL }
};
#endif
diff --git a/sbin/ipf/libipf/v6optvalue.c b/sbin/ipf/libipf/v6optvalue.c
index c0d13bc51d85..5d09ad1b584d 100644
--- a/sbin/ipf/libipf/v6optvalue.c
+++ b/sbin/ipf/libipf/v6optvalue.c
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include "ipf.h"
u_32_t getv6optbyname(char *optname)
{
#ifdef USE_INET6
struct ipopt_names *io;
for (io = v6ionames; io->on_name; io++)
if (!strcasecmp(optname, io->on_name))
return (io->on_bit);
#endif
return (-1);
}
u_32_t getv6optbyvalue(int optval)
{
#ifdef USE_INET6
struct ipopt_names *io;
for (io = v6ionames; io->on_name; io++)
if (io->on_value == optval)
return (io->on_bit);
#endif
return (-1);
}
diff --git a/sbin/ipf/libipf/var.c b/sbin/ipf/libipf/var.c
index d3a03b6e46d7..56dcee326478 100644
--- a/sbin/ipf/libipf/var.c
+++ b/sbin/ipf/libipf/var.c
@@ -1,173 +1,172 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <ctype.h>
#include "ipf.h"
typedef struct variable {
struct variable *v_next;
char *v_name;
char *v_value;
} variable_t;
static variable_t *vtop = NULL;
static variable_t *find_var(char *);
static char *expand_string(char *, int);
static variable_t *find_var(name)
char *name;
{
variable_t *v;
for (v = vtop; v != NULL; v = v->v_next)
if (!strcmp(name, v->v_name))
return (v);
return (NULL);
}
char *get_variable(char *string, char **after, int line)
{
char c, *s, *t, *value;
variable_t *v;
s = string;
if (*s == '{') {
s++;
for (t = s; *t != '\0'; t++)
if (*t == '}')
break;
if (*t == '\0') {
fprintf(stderr, "%d: { without }\n", line);
return (NULL);
}
} else if (ISALPHA(*s)) {
for (t = s + 1; *t != '\0'; t++)
if (!ISALPHA(*t) && !ISDIGIT(*t) && (*t != '_'))
break;
} else {
fprintf(stderr, "%d: variables cannot start with '%c'\n",
line, *s);
return (NULL);
}
if (after != NULL)
*after = t;
c = *t;
*t = '\0';
v = find_var(s);
*t = c;
if (v == NULL) {
fprintf(stderr, "%d: unknown variable '%s'\n", line, s);
return (NULL);
}
s = strdup(v->v_value);
value = expand_string(s, line);
if (value != s)
free(s);
return (value);
}
static char *expand_string(char *oldstring, int line)
{
char c, *s, *p1, *p2, *p3, *newstring, *value;
int len;
p3 = NULL;
newstring = oldstring;
for (s = oldstring; *s != '\0'; s++)
if (*s == '$') {
*s = '\0';
s++;
switch (*s)
{
case '$' :
bcopy(s, s - 1, strlen(s));
break;
default :
c = *s;
if (c == '\0')
return (newstring);
value = get_variable(s, &p3, line);
if (value == NULL)
return (NULL);
p2 = expand_string(value, line);
if (p2 == NULL)
return (NULL);
len = strlen(newstring) + strlen(p2);
if (p3 != NULL) {
if (c == '{' && *p3 == '}')
p3++;
len += strlen(p3);
}
p1 = malloc(len + 1);
if (p1 == NULL)
return (NULL);
*(s - 1) = '\0';
strcpy(p1, newstring);
strcat(p1, p2);
if (p3 != NULL)
strcat(p1, p3);
s = p1 + len - strlen(p3) - 1;
if (newstring != oldstring)
free(newstring);
newstring = p1;
break;
}
}
return (newstring);
}
void set_variable(char *name, char *value)
{
variable_t *v;
int len;
if (name == NULL || value == NULL || *name == '\0')
return;
v = find_var(name);
if (v != NULL) {
free(v->v_value);
v->v_value = strdup(value);
return;
}
len = strlen(value);
if ((*value == '"' && value[len - 1] == '"') ||
(*value == '\'' && value[len - 1] == '\'')) {
value[len - 1] = '\0';
value++;
len -=2;
}
v = (variable_t *)malloc(sizeof(*v));
if (v == NULL)
return;
v->v_name = strdup(name);
v->v_value = strdup(value);
v->v_next = vtop;
vtop = v;
}
diff --git a/sbin/ipf/libipf/verbose.c b/sbin/ipf/libipf/verbose.c
index 47988c084516..cfa22083ed02 100644
--- a/sbin/ipf/libipf/verbose.c
+++ b/sbin/ipf/libipf/verbose.c
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
# include <stdarg.h>
#include <stdio.h>
#include "ipf.h"
#include "opts.h"
void verbose(int level, char *fmt, ...)
{
va_list pvar;
va_start(pvar, fmt);
if (opts & OPT_VERBOSE)
vprintf(fmt, pvar);
va_end(pvar);
}
void ipfkverbose(char *fmt, ...)
{
va_list pvar;
va_start(pvar, fmt);
if (opts & OPT_VERBOSE)
verbose(0x1fffffff, fmt, pvar);
va_end(pvar);
}
diff --git a/sbin/newfs_msdos/mkfs_msdos.h b/sbin/newfs_msdos/mkfs_msdos.h
index 7e0c6622c8b7..6e5bad0da8f0 100644
--- a/sbin/newfs_msdos/mkfs_msdos.h
+++ b/sbin/newfs_msdos/mkfs_msdos.h
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
/* $NetBSD: mkfs_msdos.h,v 1.3 2015/10/16 17:38:17 christos Exp $ */
/*-
* Copyright (c) 2013 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Christos Zoulas.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#include <sys/types.h>
#include <stdbool.h>
#define ALLOPTS \
AOPT('@', off_t, offset, 0, "Offset in device") \
AOPT('A', bool, align, -2, "Attempt to cluster align root directory") \
AOPT('B', const char *, bootstrap, -1, "Bootstrap file") \
AOPT('C', off_t, create_size, 0, "Create file") \
AOPT('F', uint8_t, fat_type, 12, "FAT type (12, 16, or 32)") \
AOPT('I', uint32_t, volume_id, 0, "Volume ID") \
AOPT('L', const char *, volume_label, -1, "Volume Label") \
AOPT('N', bool, no_create, -2, "Don't create filesystem, print params only") \
AOPT('O', const char *, OEM_string, -1, "OEM string") \
AOPT('S', uint16_t, bytes_per_sector, 1, "Bytes per sector") \
AOPT('T', time_t, timestamp, 0, "Timestamp") \
AOPT('a', uint32_t, sectors_per_fat, 1, "Sectors per FAT") \
AOPT('b', uint32_t, block_size, 1, "Block size") \
AOPT('c', uint8_t, sectors_per_cluster, 1, "Sectors per cluster") \
AOPT('e', uint16_t, directory_entries, 1, "Directory entries") \
AOPT('f', const char *, floppy, -1, "Standard format floppies (160,180,320,360,640,720,1200,1232,1440,2880)") \
AOPT('h', uint16_t, drive_heads, 1, "Drive heads") \
AOPT('i', uint16_t, info_sector, 1, "Info sector") \
AOPT('k', uint16_t, backup_sector, 1, "Backup sector") \
AOPT('m', uint8_t, media_descriptor, 0, "Media descriptor") \
AOPT('n', uint8_t, num_FAT, 1, "Number of FATs") \
AOPT('o', uint32_t, hidden_sectors, 0, "Hidden sectors") \
AOPT('r', uint16_t, reserved_sectors, 1, "Reserved sectors") \
AOPT('s', uint32_t, size, 1, "File System size") \
AOPT('u', uint16_t, sectors_per_track, 1, "Sectors per track")
struct msdos_options {
#define AOPT(_opt, _type, _name, _min, _desc) _type _name;
ALLOPTS
#undef AOPT
uint32_t timestamp_set:1;
uint32_t volume_id_set:1;
uint32_t media_descriptor_set:1;
uint32_t hidden_sectors_set:1;
};
int mkfs_msdos(const char *, const char *, const struct msdos_options *);
diff --git a/sbin/rcorder/ealloc.c b/sbin/rcorder/ealloc.c
index eae8bb67d69a..9d6f20f77137 100644
--- a/sbin/rcorder/ealloc.c
+++ b/sbin/rcorder/ealloc.c
@@ -1,120 +1,119 @@
-/* $FreeBSD$ */
/* $NetBSD: ealloc.c,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1988, 1989, 1990, 1993
* The Regents of the University of California. All rights reserved.
* Copyright (c) 1989 by Berkeley Softworks
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam de Boor.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#ifndef lint
__RCSID("$NetBSD: ealloc.c,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $");
#endif /* not lint */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <err.h>
#include "ealloc.h"
static void enomem(void);
/*
* enomem --
* die when out of memory.
*/
static void
enomem(void)
{
errx(2, "Cannot allocate memory.");
}
/*
* emalloc --
* malloc, but die on error.
*/
void *
emalloc(size_t len)
{
void *p;
if ((p = malloc(len)) == NULL)
enomem();
return(p);
}
/*
* estrdup --
* strdup, but die on error.
*/
char *
estrdup(const char *str)
{
char *p;
if ((p = strdup(str)) == NULL)
enomem();
return(p);
}
/*
* erealloc --
* realloc, but die on error.
*/
void *
erealloc(void *ptr, size_t size)
{
if ((ptr = realloc(ptr, size)) == NULL)
enomem();
return(ptr);
}
/*
* ecalloc --
* calloc, but die on error.
*/
void *
ecalloc(size_t nmemb, size_t size)
{
void *ptr;
if ((ptr = calloc(nmemb, size)) == NULL)
enomem();
return(ptr);
}
diff --git a/sbin/rcorder/ealloc.h b/sbin/rcorder/ealloc.h
index 093ebc3dadc8..f1c81fb2fd18 100644
--- a/sbin/rcorder/ealloc.h
+++ b/sbin/rcorder/ealloc.h
@@ -1,7 +1,6 @@
-/* $FreeBSD$ */
/* $NetBSD: ealloc.h,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $ */
void *emalloc(size_t len);
char *estrdup(const char *str);
void *erealloc(void *ptr, size_t size);
void *ecalloc(size_t nmemb, size_t size);
diff --git a/sbin/rcorder/hash.c b/sbin/rcorder/hash.c
index 3dcb77054960..e2231461f1a9 100644
--- a/sbin/rcorder/hash.c
+++ b/sbin/rcorder/hash.c
@@ -1,437 +1,436 @@
-/* $FreeBSD$ */
/* $NetBSD: hash.c,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
* Copyright (c) 1988, 1989 by Adam de Boor
* Copyright (c) 1989 by Berkeley Softworks
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam de Boor.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifdef MAKE_BOOTSTRAP
static char rcsid[] = "$NetBSD: hash.c,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $";
#else
#include <sys/cdefs.h>
#ifndef lint
#if 0
static char sccsid[] = "@(#)hash.c 8.1 (Berkeley) 6/6/93";
#else
__RCSID("$NetBSD: hash.c,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $");
#endif
#endif /* not lint */
#endif
#include <sys/types.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
/* hash.c --
*
* This module contains routines to manipulate a hash table.
* See hash.h for a definition of the structure of the hash
* table. Hash tables grow automatically as the amount of
* information increases.
*/
#include "sprite.h"
#ifndef ORDER
#include "make.h"
#endif /* ORDER */
#include "hash.h"
#include "ealloc.h"
/*
* Forward references to local procedures that are used before they're
* defined:
*/
static void RebuildTable(Hash_Table *);
/*
* The following defines the ratio of # entries to # buckets
* at which we rebuild the table to make it larger.
*/
#define rebuildLimit 8
/*
*---------------------------------------------------------
*
* Hash_InitTable --
*
* This routine just sets up the hash table.
*
* Results:
* None.
*
* Side Effects:
* Memory is allocated for the initial bucket area.
*
*---------------------------------------------------------
*/
void
Hash_InitTable(
register Hash_Table *t, /* Structure to use to hold table. */
int numBuckets) /* How many buckets to create for starters.
* This number is rounded up to a power of
* two. If <= 0, a reasonable default is
* chosen. The table will grow in size later
* as needed. */
{
register int i;
register struct Hash_Entry **hp;
/*
* Round up the size to a power of two.
*/
if (numBuckets <= 0)
i = 16;
else {
for (i = 2; i < numBuckets; i <<= 1)
continue;
}
t->numEntries = 0;
t->size = i;
t->mask = i - 1;
t->bucketPtr = hp = (struct Hash_Entry **)emalloc(sizeof(*hp) * i);
while (--i >= 0)
*hp++ = NULL;
}
/*
*---------------------------------------------------------
*
* Hash_DeleteTable --
*
* This routine removes everything from a hash table
* and frees up the memory space it occupied (except for
* the space in the Hash_Table structure).
*
* Results:
* None.
*
* Side Effects:
* Lots of memory is freed up.
*
*---------------------------------------------------------
*/
void
Hash_DeleteTable(Hash_Table *t)
{
register struct Hash_Entry **hp, *h, *nexth = NULL;
register int i;
for (hp = t->bucketPtr, i = t->size; --i >= 0;) {
for (h = *hp++; h != NULL; h = nexth) {
nexth = h->next;
free((char *)h);
}
}
free((char *)t->bucketPtr);
/*
* Set up the hash table to cause memory faults on any future access
* attempts until re-initialization.
*/
t->bucketPtr = NULL;
}
/*
*---------------------------------------------------------
*
* Hash_FindEntry --
*
* Searches a hash table for an entry corresponding to key.
*
* Results:
* The return value is a pointer to the entry for key,
* if key was present in the table. If key was not
* present, NULL is returned.
*
* Side Effects:
* None.
*
*---------------------------------------------------------
*/
Hash_Entry *
Hash_FindEntry(
Hash_Table *t, /* Hash table to search. */
char *key) /* A hash key. */
{
register Hash_Entry *e;
register unsigned h;
register char *p;
for (h = 0, p = key; *p;)
h = (h << 5) - h + *p++;
p = key;
for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next)
if (e->namehash == h && strcmp(e->name, p) == 0)
return (e);
return (NULL);
}
/*
*---------------------------------------------------------
*
* Hash_CreateEntry --
*
* Searches a hash table for an entry corresponding to
* key. If no entry is found, then one is created.
*
* Results:
* The return value is a pointer to the entry. If *newPtr
* isn't NULL, then *newPtr is filled in with TRUE if a
* new entry was created, and FALSE if an entry already existed
* with the given key.
*
* Side Effects:
* Memory may be allocated, and the hash buckets may be modified.
*---------------------------------------------------------
*/
Hash_Entry *
Hash_CreateEntry(
register Hash_Table *t, /* Hash table to search. */
char *key, /* A hash key. */
Boolean *newPtr) /* Filled in with TRUE if new entry created,
* FALSE otherwise. */
{
register Hash_Entry *e;
register unsigned h;
register char *p;
int keylen;
struct Hash_Entry **hp;
/*
* Hash the key. As a side effect, save the length (strlen) of the
* key in case we need to create the entry.
*/
for (h = 0, p = key; *p;)
h = (h << 5) - h + *p++;
keylen = p - key;
p = key;
for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) {
if (e->namehash == h && strcmp(e->name, p) == 0) {
if (newPtr != NULL)
*newPtr = FALSE;
return (e);
}
}
/*
* The desired entry isn't there. Before allocating a new entry,
* expand the table if necessary (and this changes the resulting
* bucket chain).
*/
if (t->numEntries >= rebuildLimit * t->size)
RebuildTable(t);
e = (Hash_Entry *) emalloc(sizeof(*e) + keylen);
hp = &t->bucketPtr[h & t->mask];
e->next = *hp;
*hp = e;
e->clientData = NULL;
e->namehash = h;
(void) strcpy(e->name, p);
t->numEntries++;
if (newPtr != NULL)
*newPtr = TRUE;
return (e);
}
/*
*---------------------------------------------------------
*
* Hash_DeleteEntry --
*
* Delete the given hash table entry and free memory associated with
* it.
*
* Results:
* None.
*
* Side Effects:
* Hash chain that entry lives in is modified and memory is freed.
*
*---------------------------------------------------------
*/
void
Hash_DeleteEntry(Hash_Table *t, Hash_Entry *e)
{
register Hash_Entry **hp, *p;
if (e == NULL)
return;
for (hp = &t->bucketPtr[e->namehash & t->mask];
(p = *hp) != NULL; hp = &p->next) {
if (p == e) {
*hp = p->next;
free((char *)p);
t->numEntries--;
return;
}
}
(void)write(2, "bad call to Hash_DeleteEntry\n", 29);
abort();
}
/*
*---------------------------------------------------------
*
* Hash_EnumFirst --
* This procedure sets things up for a complete search
* of all entries recorded in the hash table.
*
* Results:
* The return value is the address of the first entry in
* the hash table, or NULL if the table is empty.
*
* Side Effects:
* The information in searchPtr is initialized so that successive
* calls to Hash_Next will return successive HashEntry's
* from the table.
*
*---------------------------------------------------------
*/
Hash_Entry *
Hash_EnumFirst(
Hash_Table *t, /* Table to be searched. */
register Hash_Search *searchPtr)/* Area in which to keep state
* about search.*/
{
searchPtr->tablePtr = t;
searchPtr->nextIndex = 0;
searchPtr->hashEntryPtr = NULL;
return Hash_EnumNext(searchPtr);
}
/*
*---------------------------------------------------------
*
* Hash_EnumNext --
* This procedure returns successive entries in the hash table.
*
* Results:
* The return value is a pointer to the next HashEntry
* in the table, or NULL when the end of the table is
* reached.
*
* Side Effects:
* The information in searchPtr is modified to advance to the
* next entry.
*
*---------------------------------------------------------
*/
Hash_Entry *
Hash_EnumNext(
register Hash_Search *searchPtr) /* Area used to keep state about
search. */
{
register Hash_Entry *e;
Hash_Table *t = searchPtr->tablePtr;
/*
* The hashEntryPtr field points to the most recently returned
* entry, or is nil if we are starting up. If not nil, we have
* to start at the next one in the chain.
*/
e = searchPtr->hashEntryPtr;
if (e != NULL)
e = e->next;
/*
* If the chain ran out, or if we are starting up, we need to
* find the next nonempty chain.
*/
while (e == NULL) {
if (searchPtr->nextIndex >= t->size)
return (NULL);
e = t->bucketPtr[searchPtr->nextIndex++];
}
searchPtr->hashEntryPtr = e;
return (e);
}
/*
*---------------------------------------------------------
*
* RebuildTable --
* This local routine makes a new hash table that
* is larger than the old one.
*
* Results:
* None.
*
* Side Effects:
* The entire hash table is moved, so any bucket numbers
* from the old table are invalid.
*
*---------------------------------------------------------
*/
static void
RebuildTable(register Hash_Table *t)
{
register Hash_Entry *e, *next = NULL, **hp, **xp;
register int i, mask;
register Hash_Entry **oldhp;
int oldsize;
oldhp = t->bucketPtr;
oldsize = i = t->size;
i <<= 1;
t->size = i;
t->mask = mask = i - 1;
t->bucketPtr = hp = (struct Hash_Entry **) emalloc(sizeof(*hp) * i);
while (--i >= 0)
*hp++ = NULL;
for (hp = oldhp, i = oldsize; --i >= 0;) {
for (e = *hp++; e != NULL; e = next) {
next = e->next;
xp = &t->bucketPtr[e->namehash & mask];
e->next = *xp;
*xp = e;
}
}
free((char *)oldhp);
}
diff --git a/sbin/rcorder/hash.h b/sbin/rcorder/hash.h
index d190633861a0..6ccf76d002a8 100644
--- a/sbin/rcorder/hash.h
+++ b/sbin/rcorder/hash.h
@@ -1,133 +1,132 @@
-/* $FreeBSD$ */
/* $NetBSD: hash.h,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
* Copyright (c) 1988, 1989 by Adam de Boor
* Copyright (c) 1989 by Berkeley Softworks
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam de Boor.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* from: @(#)hash.h 8.1 (Berkeley) 6/6/93
*/
/* hash.h --
*
* This file contains definitions used by the hash module,
* which maintains hash tables.
*/
#ifndef _HASH
#define _HASH
/*
* The following defines one entry in the hash table.
*/
typedef struct Hash_Entry {
struct Hash_Entry *next; /* Used to link together all the
* entries associated with the same
* bucket. */
ClientData clientData; /* Arbitrary piece of data associated
* with key. */
unsigned namehash; /* hash value of key */
char name[1]; /* key string */
} Hash_Entry;
typedef struct Hash_Table {
struct Hash_Entry **bucketPtr;
/* Pointers to Hash_Entry, one
* for each bucket in the table. */
int size; /* Actual size of array. */
int numEntries; /* Number of entries in the table. */
int mask; /* Used to select bits for hashing. */
} Hash_Table;
/*
* The following structure is used by the searching routines
* to record where we are in the search.
*/
typedef struct Hash_Search {
Hash_Table *tablePtr; /* Table being searched. */
int nextIndex; /* Next bucket to check (after
* current). */
Hash_Entry *hashEntryPtr; /* Next entry to check in current
* bucket. */
} Hash_Search;
/*
* Macros.
*/
/*
* ClientData Hash_GetValue(h)
* Hash_Entry *h;
*/
#define Hash_GetValue(h) ((h)->clientData)
/*
* Hash_SetValue(h, val);
* Hash_Entry *h;
* char *val;
*/
#define Hash_SetValue(h, val) ((h)->clientData = (ClientData) (val))
#ifdef ORDER
/*
* Hash_GetKey(h);
* Hash_Entry *h;
*/
#define Hash_GetKey(h) ((h)->name)
#endif /* ORDER */
/*
* Hash_Size(n) returns the number of words in an object of n bytes
*/
#define Hash_Size(n) (((n) + sizeof (int) - 1) / sizeof (int))
void Hash_InitTable(Hash_Table *, int);
void Hash_DeleteTable(Hash_Table *);
Hash_Entry *Hash_FindEntry(Hash_Table *, char *);
Hash_Entry *Hash_CreateEntry(Hash_Table *, char *, Boolean *);
void Hash_DeleteEntry(Hash_Table *, Hash_Entry *);
Hash_Entry *Hash_EnumFirst(Hash_Table *, Hash_Search *);
Hash_Entry *Hash_EnumNext(Hash_Search *);
#endif /* _HASH */
diff --git a/sbin/setkey/parse.y b/sbin/setkey/parse.y
index 8e4866e7e848..448a8ee5278c 100644
--- a/sbin/setkey/parse.y
+++ b/sbin/setkey/parse.y
@@ -1,1365 +1,1364 @@
-/* $FreeBSD$ */
/* $KAME: parse.y,v 1.83 2004/05/18 08:48:23 sakane Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
%{
#include <sys/types.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <net/route.h>
#include <netinet/in.h>
#include <net/pfkeyv2.h>
#include <netipsec/key_var.h>
#include <netipsec/ipsec.h>
#include <arpa/inet.h>
#include <netinet/udp.h>
#include <string.h>
#include <unistd.h>
#include <stdio.h>
#include <stdint.h>
#include <netdb.h>
#include <ctype.h>
#include <errno.h>
#include "libpfkey.h"
#include "vchar.h"
#define ATOX(c) \
(isdigit(c) ? (c - '0') : (isupper(c) ? (c - 'A' + 10) : (c - 'a' + 10)))
u_int32_t p_spi;
u_int p_ext, p_alg_enc, p_alg_auth, p_replay, p_mode;
u_int32_t p_reqid;
u_int p_key_enc_len, p_key_auth_len;
caddr_t p_key_enc, p_key_auth;
time_t p_lt_hard, p_lt_soft;
u_int p_natt_type;
struct addrinfo *p_natt_oai, *p_natt_oar;
int p_natt_sport, p_natt_dport;
int p_natt_fraglen;
static int p_aiflags = 0, p_aifamily = PF_UNSPEC;
static struct addrinfo *parse_addr(char *, char *);
static int fix_portstr(vchar_t *, vchar_t *, vchar_t *);
static int setvarbuf(char *, int *, struct sadb_ext *, int, caddr_t, int);
void parse_init(void);
void free_buffer(void);
int setkeymsg0(struct sadb_msg *, unsigned int, unsigned int, size_t);
static int setkeymsg_spdaddr(unsigned int, unsigned int, vchar_t *,
struct addrinfo *, int, struct addrinfo *, int);
static int setkeymsg_addr(unsigned int, unsigned int,
struct addrinfo *, struct addrinfo *, int);
static int setkeymsg_add(unsigned int, unsigned int,
struct addrinfo *, struct addrinfo *);
extern int setkeymsg(char *, size_t *);
extern int sendkeymsg(char *, size_t);
extern int yylex(void);
extern void yyfatal(const char *);
extern void yyerror(const char *);
%}
%union {
int num;
unsigned long ulnum;
vchar_t val;
struct addrinfo *res;
}
%token EOT SLASH BLCL ELCL
%token ADD GET DELETE DELETEALL FLUSH DUMP
%token PR_ESP PR_AH PR_IPCOMP PR_TCP
%token F_PROTOCOL F_AUTH F_ENC F_REPLAY F_COMP F_RAWCPI
%token F_MODE MODE F_REQID
%token F_EXT EXTENSION NOCYCLICSEQ
%token ALG_AUTH ALG_AUTH_NOKEY
%token ALG_ENC ALG_ENC_NOKEY ALG_ENC_DESDERIV ALG_ENC_DES32IV ALG_ENC_OLD
%token ALG_ENC_SALT
%token ALG_COMP
%token F_LIFETIME_HARD F_LIFETIME_SOFT
%token DECSTRING QUOTEDSTRING HEXSTRING STRING ANY
/* SPD management */
%token SPDADD SPDDELETE SPDDUMP SPDFLUSH
%token F_POLICY PL_REQUESTS
%token F_AIFLAGS F_NATT F_NATT_MTU
%token TAGGED
%type <num> prefix protocol_spec upper_spec
%type <num> ALG_ENC ALG_ENC_DESDERIV ALG_ENC_DES32IV ALG_ENC_OLD ALG_ENC_NOKEY
%type <num> ALG_ENC_SALT
%type <num> ALG_AUTH ALG_AUTH_NOKEY
%type <num> ALG_COMP
%type <num> PR_ESP PR_AH PR_IPCOMP PR_TCP
%type <num> EXTENSION MODE
%type <ulnum> DECSTRING
%type <val> PL_REQUESTS portstr key_string
%type <val> policy_requests
%type <val> QUOTEDSTRING HEXSTRING STRING
%type <val> F_AIFLAGS
%type <val> upper_misc_spec policy_spec
%type <res> ipaddr
%%
commands
: /*NOTHING*/
| commands command
{
free_buffer();
parse_init();
}
;
command
: add_command
| get_command
| delete_command
| deleteall_command
| flush_command
| dump_command
| spdadd_command
| spddelete_command
| spddump_command
| spdflush_command
;
/* commands concerned with management, there is in tail of this file. */
/* add command */
add_command
: ADD ipaddropts ipaddr ipaddr protocol_spec spi extension_spec algorithm_spec EOT
{
int status;
status = setkeymsg_add(SADB_ADD, $5, $3, $4);
if (status < 0)
return -1;
}
;
/* delete */
delete_command
: DELETE ipaddropts ipaddr ipaddr protocol_spec spi extension_spec EOT
{
int status;
if ($3->ai_next || $4->ai_next) {
yyerror("multiple address specified");
return -1;
}
if (p_mode != IPSEC_MODE_ANY)
yyerror("WARNING: mode is obsolete");
status = setkeymsg_addr(SADB_DELETE, $5, $3, $4, 0);
if (status < 0)
return -1;
}
;
/* deleteall command */
deleteall_command
: DELETEALL ipaddropts ipaddr ipaddr protocol_spec EOT
{
int status;
status = setkeymsg_addr(SADB_DELETE, $5, $3, $4, 1);
if (status < 0)
return -1;
}
;
/* get command */
get_command
: GET ipaddropts ipaddr ipaddr protocol_spec spi extension_spec EOT
{
int status;
if (p_mode != IPSEC_MODE_ANY)
yyerror("WARNING: mode is obsolete");
status = setkeymsg_addr(SADB_GET, $5, $3, $4, 0);
if (status < 0)
return -1;
}
;
/* flush */
flush_command
: FLUSH protocol_spec EOT
{
struct sadb_msg msg;
setkeymsg0(&msg, SADB_FLUSH, $2, sizeof(msg));
sendkeymsg((char *)&msg, sizeof(msg));
}
;
/* dump */
dump_command
: DUMP protocol_spec EOT
{
struct sadb_msg msg;
setkeymsg0(&msg, SADB_DUMP, $2, sizeof(msg));
sendkeymsg((char *)&msg, sizeof(msg));
}
;
protocol_spec
: /*NOTHING*/
{
$$ = SADB_SATYPE_UNSPEC;
}
| PR_ESP
{
$$ = SADB_SATYPE_ESP;
if ($1 == 1)
p_ext |= SADB_X_EXT_OLD;
else
p_ext &= ~SADB_X_EXT_OLD;
}
| PR_AH
{
$$ = SADB_SATYPE_AH;
if ($1 == 1)
p_ext |= SADB_X_EXT_OLD;
else
p_ext &= ~SADB_X_EXT_OLD;
}
| PR_IPCOMP
{
$$ = SADB_X_SATYPE_IPCOMP;
}
| PR_TCP
{
$$ = SADB_X_SATYPE_TCPSIGNATURE;
}
;
spi
: DECSTRING { p_spi = $1; }
| HEXSTRING
{
char *ep;
unsigned long v;
ep = NULL;
v = strtoul($1.buf, &ep, 16);
if (!ep || *ep) {
yyerror("invalid SPI");
return -1;
}
if (v & ~0xffffffff) {
yyerror("SPI too big.");
return -1;
}
p_spi = v;
}
;
algorithm_spec
: esp_spec
| ah_spec
| ipcomp_spec
;
esp_spec
: F_ENC enc_alg F_AUTH auth_alg
| F_ENC enc_alg
;
ah_spec
: F_AUTH auth_alg
;
ipcomp_spec
: F_COMP ALG_COMP
{
if ($2 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $2;
}
| F_COMP ALG_COMP F_RAWCPI
{
if ($2 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $2;
p_ext |= SADB_X_EXT_RAWCPI;
}
;
enc_alg
: ALG_ENC_NOKEY {
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $1;
p_key_enc_len = 0;
p_key_enc = NULL;
if (ipsec_check_keylen(SADB_EXT_SUPPORTED_ENCRYPT,
p_alg_enc, PFKEY_UNUNIT64(p_key_enc_len)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
| ALG_ENC key_string {
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $1;
p_key_enc_len = $2.len;
p_key_enc = $2.buf;
if (ipsec_check_keylen(SADB_EXT_SUPPORTED_ENCRYPT,
p_alg_enc, PFKEY_UNUNIT64(p_key_enc_len)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
| ALG_ENC_OLD {
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
yyerror("WARNING: obsolete algorithm");
p_alg_enc = $1;
p_key_enc_len = 0;
p_key_enc = NULL;
if (ipsec_check_keylen(SADB_EXT_SUPPORTED_ENCRYPT,
p_alg_enc, PFKEY_UNUNIT64(p_key_enc_len)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
| ALG_ENC_DESDERIV key_string
{
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $1;
if (p_ext & SADB_X_EXT_OLD) {
yyerror("algorithm mismatched");
return -1;
}
p_ext |= SADB_X_EXT_DERIV;
p_key_enc_len = $2.len;
p_key_enc = $2.buf;
if (ipsec_check_keylen(SADB_EXT_SUPPORTED_ENCRYPT,
p_alg_enc, PFKEY_UNUNIT64(p_key_enc_len)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
| ALG_ENC_DES32IV key_string
{
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $1;
if (!(p_ext & SADB_X_EXT_OLD)) {
yyerror("algorithm mismatched");
return -1;
}
p_ext |= SADB_X_EXT_IV4B;
p_key_enc_len = $2.len;
p_key_enc = $2.buf;
if (ipsec_check_keylen(SADB_EXT_SUPPORTED_ENCRYPT,
p_alg_enc, PFKEY_UNUNIT64(p_key_enc_len)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
| ALG_ENC_SALT key_string
{
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_enc = $1;
p_key_enc_len = $2.len;
p_key_enc = $2.buf;
/*
* Salted keys include a 4 byte value that is
* not part of the key.
*/
if (ipsec_check_keylen(SADB_EXT_SUPPORTED_ENCRYPT,
p_alg_enc, PFKEY_UNUNIT64(p_key_enc_len - 4)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
;
auth_alg
: ALG_AUTH key_string {
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_auth = $1;
p_key_auth_len = $2.len;
p_key_auth = $2.buf;
if (p_alg_auth == SADB_X_AALG_TCP_MD5) {
if ((p_key_auth_len < 1) || (p_key_auth_len >
80))
return -1;
} else if (ipsec_check_keylen(SADB_EXT_SUPPORTED_AUTH,
p_alg_auth, PFKEY_UNUNIT64(p_key_auth_len)) < 0) {
yyerror(ipsec_strerror());
return -1;
}
}
| ALG_AUTH_NOKEY {
if ($1 < 0) {
yyerror("unsupported algorithm");
return -1;
}
p_alg_auth = $1;
p_key_auth_len = 0;
p_key_auth = NULL;
}
;
key_string
: QUOTEDSTRING
{
$$ = $1;
}
| HEXSTRING
{
caddr_t pp_key;
caddr_t bp;
caddr_t yp = $1.buf;
int l;
l = strlen(yp) % 2 + strlen(yp) / 2;
if ((pp_key = malloc(l)) == 0) {
yyerror("not enough core");
return -1;
}
memset(pp_key, 0, l);
bp = pp_key;
if (strlen(yp) % 2) {
*bp = ATOX(yp[0]);
yp++, bp++;
}
while (*yp) {
*bp = (ATOX(yp[0]) << 4) | ATOX(yp[1]);
yp += 2, bp++;
}
$$.len = l;
$$.buf = pp_key;
}
;
extension_spec
: /*NOTHING*/
| extension_spec extension
;
extension
: F_EXT EXTENSION { p_ext |= $2; }
| F_EXT NOCYCLICSEQ { p_ext &= ~SADB_X_EXT_CYCSEQ; }
| F_MODE MODE { p_mode = $2; }
| F_MODE ANY { p_mode = IPSEC_MODE_ANY; }
| F_REQID DECSTRING { p_reqid = $2; }
| F_REPLAY DECSTRING
{
if ((p_ext & SADB_X_EXT_OLD) != 0) {
yyerror("replay prevention cannot be used with "
"ah/esp-old");
return -1;
}
p_replay = $2;
if (p_replay > (UINT32_MAX - 32) >> 3)
yyerror("replay window is too large");
}
| F_LIFETIME_HARD DECSTRING { p_lt_hard = $2; }
| F_LIFETIME_SOFT DECSTRING { p_lt_soft = $2; }
| F_NATT ipaddr BLCL DECSTRING ELCL ipaddr BLCL DECSTRING ELCL
{
p_natt_type = UDP_ENCAP_ESPINUDP;
p_natt_oai = $2;
p_natt_oar = $6;
if (p_natt_oai == NULL || p_natt_oar == NULL)
return (-1);
p_natt_sport = $4;
p_natt_dport = $8;
}
| F_NATT_MTU DECSTRING
{
p_natt_fraglen = $2;
}
;
/* definition about command for SPD management */
/* spdadd */
spdadd_command
: SPDADD ipaddropts STRING prefix portstr STRING prefix portstr upper_spec upper_misc_spec policy_spec EOT
{
int status;
struct addrinfo *src, *dst;
/* fixed port fields if ulp is icmpv6 */
if ($10.buf != NULL) {
if ($9 != IPPROTO_ICMPV6)
return -1;
free($5.buf);
free($8.buf);
if (fix_portstr(&$10, &$5, &$8))
return -1;
}
src = parse_addr($3.buf, $5.buf);
dst = parse_addr($6.buf, $8.buf);
if (!src || !dst) {
/* yyerror is already called */
return -1;
}
if (src->ai_next || dst->ai_next) {
yyerror("multiple address specified");
freeaddrinfo(src);
freeaddrinfo(dst);
return -1;
}
status = setkeymsg_spdaddr(SADB_X_SPDADD, $9, &$11,
src, $4, dst, $7);
freeaddrinfo(src);
freeaddrinfo(dst);
if (status < 0)
return -1;
}
| SPDADD TAGGED QUOTEDSTRING policy_spec EOT
{
return -1;
}
;
spddelete_command
: SPDDELETE ipaddropts STRING prefix portstr STRING prefix portstr upper_spec upper_misc_spec policy_spec EOT
{
int status;
struct addrinfo *src, *dst;
/* fixed port fields if ulp is icmpv6 */
if ($10.buf != NULL) {
if ($9 != IPPROTO_ICMPV6)
return -1;
free($5.buf);
free($8.buf);
if (fix_portstr(&$10, &$5, &$8))
return -1;
}
src = parse_addr($3.buf, $5.buf);
dst = parse_addr($6.buf, $8.buf);
if (!src || !dst) {
/* yyerror is already called */
return -1;
}
if (src->ai_next || dst->ai_next) {
yyerror("multiple address specified");
freeaddrinfo(src);
freeaddrinfo(dst);
return -1;
}
status = setkeymsg_spdaddr(SADB_X_SPDDELETE, $9, &$11,
src, $4, dst, $7);
freeaddrinfo(src);
freeaddrinfo(dst);
if (status < 0)
return -1;
}
;
spddump_command:
SPDDUMP EOT
{
struct sadb_msg msg;
setkeymsg0(&msg, SADB_X_SPDDUMP, SADB_SATYPE_UNSPEC,
sizeof(msg));
sendkeymsg((char *)&msg, sizeof(msg));
}
;
spdflush_command:
SPDFLUSH EOT
{
struct sadb_msg msg;
setkeymsg0(&msg, SADB_X_SPDFLUSH, SADB_SATYPE_UNSPEC,
sizeof(msg));
sendkeymsg((char *)&msg, sizeof(msg));
}
;
ipaddropts
: /* nothing */
| ipaddropts ipaddropt
;
ipaddropt
: F_AIFLAGS
{
char *p;
for (p = $1.buf + 1; *p; p++)
switch (*p) {
case '4':
p_aifamily = AF_INET;
break;
#ifdef INET6
case '6':
p_aifamily = AF_INET6;
break;
#endif
case 'n':
p_aiflags = AI_NUMERICHOST;
break;
default:
yyerror("invalid flag");
return -1;
}
}
;
ipaddr
: STRING
{
$$ = parse_addr($1.buf, NULL);
if ($$ == NULL) {
/* yyerror already called by parse_addr */
return -1;
}
}
;
prefix
: /*NOTHING*/ { $$ = -1; }
| SLASH DECSTRING { $$ = $2; }
;
portstr
: /*NOTHING*/
{
$$.buf = strdup("0");
if (!$$.buf) {
yyerror("insufficient memory");
return -1;
}
$$.len = strlen($$.buf);
}
| BLCL ANY ELCL
{
$$.buf = strdup("0");
if (!$$.buf) {
yyerror("insufficient memory");
return -1;
}
$$.len = strlen($$.buf);
}
| BLCL DECSTRING ELCL
{
char buf[20];
snprintf(buf, sizeof(buf), "%lu", $2);
$$.buf = strdup(buf);
if (!$$.buf) {
yyerror("insufficient memory");
return -1;
}
$$.len = strlen($$.buf);
}
| BLCL STRING ELCL
{
$$ = $2;
}
;
upper_spec
: DECSTRING { $$ = $1; }
| ANY { $$ = IPSEC_ULPROTO_ANY; }
| PR_TCP { $$ = IPPROTO_TCP; }
| PR_ESP { $$ = IPPROTO_ESP; }
| STRING
{
struct protoent *ent;
ent = getprotobyname($1.buf);
if (ent)
$$ = ent->p_proto;
else {
if (strcmp("icmp6", $1.buf) == 0) {
$$ = IPPROTO_ICMPV6;
} else if(strcmp("ip4", $1.buf) == 0) {
$$ = IPPROTO_IPV4;
} else {
yyerror("invalid upper layer protocol");
return -1;
}
}
endprotoent();
}
;
upper_misc_spec
: /*NOTHING*/
{
$$.buf = NULL;
$$.len = 0;
}
| STRING
{
$$.buf = strdup($1.buf);
if (!$$.buf) {
yyerror("insufficient memory");
return -1;
}
$$.len = strlen($$.buf);
}
;
policy_spec
: F_POLICY policy_requests
{
char *policy;
policy = ipsec_set_policy($2.buf, $2.len);
if (policy == NULL) {
yyerror(ipsec_strerror());
return -1;
}
$$.buf = policy;
$$.len = ipsec_get_policylen(policy);
}
;
policy_requests
: PL_REQUESTS { $$ = $1; }
;
%%
int
setkeymsg0(struct sadb_msg *msg, unsigned type, unsigned satype, size_t l)
{
msg->sadb_msg_version = PF_KEY_V2;
msg->sadb_msg_type = type;
msg->sadb_msg_errno = 0;
msg->sadb_msg_satype = satype;
msg->sadb_msg_reserved = 0;
msg->sadb_msg_seq = 0;
msg->sadb_msg_pid = getpid();
msg->sadb_msg_len = PFKEY_UNIT64(l);
return 0;
}
static int
setkeymsg_plen(struct addrinfo *s)
{
switch (s->ai_addr->sa_family) {
#ifdef INET
case AF_INET:
return (sizeof(struct in_addr) << 3);
#endif
#ifdef INET6
case AF_INET6:
return (sizeof(struct in6_addr) << 3);
#endif
default:
return (-1);
}
}
/* XXX NO BUFFER OVERRUN CHECK! BAD BAD! */
static int
setkeymsg_spdaddr(unsigned type, unsigned upper, vchar_t *policy,
struct addrinfo *srcs, int splen, struct addrinfo *dsts, int dplen)
{
struct sadb_msg *msg;
char buf[BUFSIZ];
int l, l0;
struct sadb_address m_addr;
struct addrinfo *s, *d;
int n;
int plen;
struct sockaddr *sa;
int salen;
msg = (struct sadb_msg *)buf;
if (!srcs || !dsts)
return -1;
/* fix up length afterwards */
setkeymsg0(msg, type, SADB_SATYPE_UNSPEC, 0);
l = sizeof(struct sadb_msg);
memcpy(buf + l, policy->buf, policy->len);
l += policy->len;
l0 = l;
n = 0;
/* do it for all src/dst pairs */
for (s = srcs; s; s = s->ai_next) {
for (d = dsts; d; d = d->ai_next) {
/* rewind pointer */
l = l0;
if (s->ai_addr->sa_family != d->ai_addr->sa_family)
continue;
plen = setkeymsg_plen(s);
if (plen == -1)
continue;
/* set src */
sa = s->ai_addr;
salen = s->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_exttype = SADB_EXT_ADDRESS_SRC;
m_addr.sadb_address_proto = upper;
m_addr.sadb_address_prefixlen =
(splen >= 0 ? splen : plen);
m_addr.sadb_address_reserved = 0;
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
/* set dst */
sa = d->ai_addr;
salen = d->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_exttype = SADB_EXT_ADDRESS_DST;
m_addr.sadb_address_proto = upper;
m_addr.sadb_address_prefixlen =
(dplen >= 0 ? dplen : plen);
m_addr.sadb_address_reserved = 0;
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
msg->sadb_msg_len = PFKEY_UNIT64(l);
sendkeymsg(buf, l);
n++;
}
}
if (n == 0)
return -1;
else
return 0;
}
/* XXX NO BUFFER OVERRUN CHECK! BAD BAD! */
static int
setkeymsg_addr(unsigned type, unsigned satype, struct addrinfo *srcs,
struct addrinfo *dsts, int no_spi)
{
struct sadb_msg *msg;
char buf[BUFSIZ];
int l, l0, len;
struct sadb_sa m_sa;
struct sadb_x_sa2 m_sa2;
struct sadb_x_sa_replay m_replay;
struct sadb_address m_addr;
struct addrinfo *s, *d;
int n;
int plen;
struct sockaddr *sa;
int salen;
msg = (struct sadb_msg *)buf;
if (!srcs || !dsts)
return -1;
/* fix up length afterwards */
setkeymsg0(msg, type, satype, 0);
l = sizeof(struct sadb_msg);
if (!no_spi) {
len = sizeof(struct sadb_sa);
m_sa.sadb_sa_len = PFKEY_UNIT64(len);
m_sa.sadb_sa_exttype = SADB_EXT_SA;
m_sa.sadb_sa_spi = htonl(p_spi);
m_sa.sadb_sa_replay = p_replay > UINT8_MAX ? UINT8_MAX:
p_replay;
m_sa.sadb_sa_state = 0;
m_sa.sadb_sa_auth = p_alg_auth;
m_sa.sadb_sa_encrypt = p_alg_enc;
m_sa.sadb_sa_flags = p_ext;
memcpy(buf + l, &m_sa, len);
l += len;
len = sizeof(struct sadb_x_sa2);
m_sa2.sadb_x_sa2_len = PFKEY_UNIT64(len);
m_sa2.sadb_x_sa2_exttype = SADB_X_EXT_SA2;
m_sa2.sadb_x_sa2_mode = p_mode;
m_sa2.sadb_x_sa2_reqid = p_reqid;
memcpy(buf + l, &m_sa2, len);
l += len;
if (p_replay > UINT8_MAX) {
len = sizeof(struct sadb_x_sa_replay);
m_replay.sadb_x_sa_replay_len = PFKEY_UNIT64(len);
m_replay.sadb_x_sa_replay_exttype =
SADB_X_EXT_SA_REPLAY;
m_replay.sadb_x_sa_replay_replay = p_replay << 3;
memcpy(buf + l, &m_replay, len);
l += len;
}
}
l0 = l;
n = 0;
/* do it for all src/dst pairs */
for (s = srcs; s; s = s->ai_next) {
for (d = dsts; d; d = d->ai_next) {
/* rewind pointer */
l = l0;
if (s->ai_addr->sa_family != d->ai_addr->sa_family)
continue;
plen = setkeymsg_plen(s);
if (plen == -1)
continue;
/* set src */
sa = s->ai_addr;
salen = s->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_exttype = SADB_EXT_ADDRESS_SRC;
m_addr.sadb_address_proto = IPSEC_ULPROTO_ANY;
m_addr.sadb_address_prefixlen = plen;
m_addr.sadb_address_reserved = 0;
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
/* set dst */
sa = d->ai_addr;
salen = d->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_exttype = SADB_EXT_ADDRESS_DST;
m_addr.sadb_address_proto = IPSEC_ULPROTO_ANY;
m_addr.sadb_address_prefixlen = plen;
m_addr.sadb_address_reserved = 0;
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
msg->sadb_msg_len = PFKEY_UNIT64(l);
sendkeymsg(buf, l);
n++;
}
}
if (n == 0)
return -1;
else
return 0;
}
/* XXX NO BUFFER OVERRUN CHECK! BAD BAD! */
static int
setkeymsg_add(unsigned type, unsigned satype, struct addrinfo *srcs,
struct addrinfo *dsts)
{
struct sadb_msg *msg;
char buf[BUFSIZ];
int l, l0, len;
struct sadb_sa m_sa;
struct sadb_x_sa2 m_sa2;
struct sadb_address m_addr;
struct sadb_x_sa_replay m_replay;
struct addrinfo *s, *d;
struct sadb_x_nat_t_type m_natt_type;
struct sadb_x_nat_t_port m_natt_port;
struct sadb_x_nat_t_frag m_natt_frag;
int n;
int plen;
struct sockaddr *sa;
int salen;
msg = (struct sadb_msg *)buf;
if (!srcs || !dsts)
return -1;
/* fix up length afterwards */
setkeymsg0(msg, type, satype, 0);
l = sizeof(struct sadb_msg);
/* set encryption algorithm, if present. */
if (satype != SADB_X_SATYPE_IPCOMP && p_key_enc) {
struct sadb_key m_key;
m_key.sadb_key_len =
PFKEY_UNIT64(sizeof(m_key)
+ PFKEY_ALIGN8(p_key_enc_len));
m_key.sadb_key_exttype = SADB_EXT_KEY_ENCRYPT;
m_key.sadb_key_bits = p_key_enc_len * 8;
m_key.sadb_key_reserved = 0;
setvarbuf(buf, &l,
(struct sadb_ext *)&m_key, sizeof(m_key),
(caddr_t)p_key_enc, p_key_enc_len);
}
/* set authentication algorithm, if present. */
if (p_key_auth) {
struct sadb_key m_key;
m_key.sadb_key_len =
PFKEY_UNIT64(sizeof(m_key)
+ PFKEY_ALIGN8(p_key_auth_len));
m_key.sadb_key_exttype = SADB_EXT_KEY_AUTH;
m_key.sadb_key_bits = p_key_auth_len * 8;
m_key.sadb_key_reserved = 0;
setvarbuf(buf, &l,
(struct sadb_ext *)&m_key, sizeof(m_key),
(caddr_t)p_key_auth, p_key_auth_len);
}
/* set lifetime for HARD */
if (p_lt_hard != 0) {
struct sadb_lifetime m_lt;
u_int slen = sizeof(struct sadb_lifetime);
m_lt.sadb_lifetime_len = PFKEY_UNIT64(slen);
m_lt.sadb_lifetime_exttype = SADB_EXT_LIFETIME_HARD;
m_lt.sadb_lifetime_allocations = 0;
m_lt.sadb_lifetime_bytes = 0;
m_lt.sadb_lifetime_addtime = p_lt_hard;
m_lt.sadb_lifetime_usetime = 0;
memcpy(buf + l, &m_lt, slen);
l += slen;
}
/* set lifetime for SOFT */
if (p_lt_soft != 0) {
struct sadb_lifetime m_lt;
u_int slen = sizeof(struct sadb_lifetime);
m_lt.sadb_lifetime_len = PFKEY_UNIT64(slen);
m_lt.sadb_lifetime_exttype = SADB_EXT_LIFETIME_SOFT;
m_lt.sadb_lifetime_allocations = 0;
m_lt.sadb_lifetime_bytes = 0;
m_lt.sadb_lifetime_addtime = p_lt_soft;
m_lt.sadb_lifetime_usetime = 0;
memcpy(buf + l, &m_lt, slen);
l += slen;
}
len = sizeof(struct sadb_sa);
m_sa.sadb_sa_len = PFKEY_UNIT64(len);
m_sa.sadb_sa_exttype = SADB_EXT_SA;
m_sa.sadb_sa_spi = htonl(p_spi);
m_sa.sadb_sa_replay = p_replay > UINT8_MAX ? UINT8_MAX: p_replay;
m_sa.sadb_sa_state = 0;
m_sa.sadb_sa_auth = p_alg_auth;
m_sa.sadb_sa_encrypt = p_alg_enc;
m_sa.sadb_sa_flags = p_ext;
memcpy(buf + l, &m_sa, len);
l += len;
len = sizeof(struct sadb_x_sa2);
m_sa2.sadb_x_sa2_len = PFKEY_UNIT64(len);
m_sa2.sadb_x_sa2_exttype = SADB_X_EXT_SA2;
m_sa2.sadb_x_sa2_mode = p_mode;
m_sa2.sadb_x_sa2_reqid = p_reqid;
memcpy(buf + l, &m_sa2, len);
l += len;
if (p_replay > UINT8_MAX) {
len = sizeof(struct sadb_x_sa_replay);
m_replay.sadb_x_sa_replay_len = PFKEY_UNIT64(len);
m_replay.sadb_x_sa_replay_exttype = SADB_X_EXT_SA_REPLAY;
m_replay.sadb_x_sa_replay_replay = p_replay << 3;
memcpy(buf + l, &m_replay, len);
l += len;
}
if (p_natt_type != 0) {
len = sizeof(m_natt_type);
memset(&m_natt_type, 0, sizeof(m_natt_type));
m_natt_type.sadb_x_nat_t_type_len = PFKEY_UNIT64(len);
m_natt_type.sadb_x_nat_t_type_exttype = SADB_X_EXT_NAT_T_TYPE;
m_natt_type.sadb_x_nat_t_type_type = p_natt_type;
memcpy(buf + l, &m_natt_type, len);
l += len;
memset(&m_addr, 0, sizeof(m_addr));
m_addr.sadb_address_exttype = SADB_X_EXT_NAT_T_OAI;
sa = p_natt_oai->ai_addr;
salen = p_natt_oai->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_prefixlen = setkeymsg_plen(p_natt_oai);
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
len = sizeof(m_natt_port);
memset(&m_natt_port, 0, sizeof(m_natt_port));
m_natt_port.sadb_x_nat_t_port_len = PFKEY_UNIT64(len);
m_natt_port.sadb_x_nat_t_port_exttype = SADB_X_EXT_NAT_T_SPORT;
m_natt_port.sadb_x_nat_t_port_port = htons(p_natt_sport);
memcpy(buf + l, &m_natt_port, len);
l += len;
memset(&m_addr, 0, sizeof(m_addr));
m_addr.sadb_address_exttype = SADB_X_EXT_NAT_T_OAR;
sa = p_natt_oar->ai_addr;
salen = p_natt_oar->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_prefixlen = setkeymsg_plen(p_natt_oar);
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
len = sizeof(m_natt_port);
memset(&m_natt_port, 0, sizeof(m_natt_port));
m_natt_port.sadb_x_nat_t_port_len = PFKEY_UNIT64(len);
m_natt_port.sadb_x_nat_t_port_exttype = SADB_X_EXT_NAT_T_DPORT;
m_natt_port.sadb_x_nat_t_port_port = htons(p_natt_dport);
memcpy(buf + l, &m_natt_port, len);
l += len;
if (p_natt_fraglen != -1) {
len = sizeof(m_natt_frag);
memset(&m_natt_port, 0, sizeof(m_natt_frag));
m_natt_frag.sadb_x_nat_t_frag_len = PFKEY_UNIT64(len);
m_natt_frag.sadb_x_nat_t_frag_exttype =
SADB_X_EXT_NAT_T_FRAG;
m_natt_frag.sadb_x_nat_t_frag_fraglen = p_natt_fraglen;
memcpy(buf + l, &m_natt_frag, len);
l += len;
}
}
l0 = l;
n = 0;
/* do it for all src/dst pairs */
for (s = srcs; s; s = s->ai_next) {
for (d = dsts; d; d = d->ai_next) {
/* rewind pointer */
l = l0;
if (s->ai_addr->sa_family != d->ai_addr->sa_family)
continue;
plen = setkeymsg_plen(s);
if (plen == -1)
continue;
/* set src */
sa = s->ai_addr;
salen = s->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_exttype = SADB_EXT_ADDRESS_SRC;
m_addr.sadb_address_proto = IPSEC_ULPROTO_ANY;
m_addr.sadb_address_prefixlen = plen;
m_addr.sadb_address_reserved = 0;
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
/* set dst */
sa = d->ai_addr;
salen = d->ai_addr->sa_len;
m_addr.sadb_address_len = PFKEY_UNIT64(sizeof(m_addr) +
PFKEY_ALIGN8(salen));
m_addr.sadb_address_exttype = SADB_EXT_ADDRESS_DST;
m_addr.sadb_address_proto = IPSEC_ULPROTO_ANY;
m_addr.sadb_address_prefixlen = plen;
m_addr.sadb_address_reserved = 0;
setvarbuf(buf, &l, (struct sadb_ext *)&m_addr,
sizeof(m_addr), (caddr_t)sa, salen);
msg->sadb_msg_len = PFKEY_UNIT64(l);
sendkeymsg(buf, l);
n++;
}
}
if (n == 0)
return -1;
else
return 0;
}
static struct addrinfo *
parse_addr(char *host, char *port)
{
struct addrinfo hints, *res = NULL;
int error;
memset(&hints, 0, sizeof(hints));
hints.ai_family = p_aifamily;
hints.ai_socktype = SOCK_DGRAM; /*dummy*/
hints.ai_protocol = IPPROTO_UDP; /*dummy*/
hints.ai_flags = p_aiflags;
error = getaddrinfo(host, port, &hints, &res);
if (error != 0) {
yyerror(gai_strerror(error));
return NULL;
}
return res;
}
static int
fix_portstr(vchar_t *spec, vchar_t *sport, vchar_t *dport)
{
char *p, *p2;
u_int l;
l = 0;
for (p = spec->buf; *p != ',' && *p != '\0' && l < spec->len; p++, l++)
;
if (*p == '\0') {
p2 = "0";
} else {
if (*p == ',') {
*p = '\0';
p2 = ++p;
}
for (p = p2; *p != '\0' && l < spec->len; p++, l++)
;
if (*p != '\0' || *p2 == '\0') {
yyerror("invalid an upper layer protocol spec");
return -1;
}
}
sport->buf = strdup(spec->buf);
if (!sport->buf) {
yyerror("insufficient memory");
return -1;
}
sport->len = strlen(sport->buf);
dport->buf = strdup(p2);
if (!dport->buf) {
yyerror("insufficient memory");
return -1;
}
dport->len = strlen(dport->buf);
return 0;
}
static int
setvarbuf(char *buf, int *off, struct sadb_ext *ebuf, int elen, caddr_t vbuf,
int vlen)
{
memset(buf + *off, 0, PFKEY_UNUNIT64(ebuf->sadb_ext_len));
memcpy(buf + *off, (caddr_t)ebuf, elen);
memcpy(buf + *off + elen, vbuf, vlen);
(*off) += PFKEY_ALIGN8(elen + vlen);
return 0;
}
void
parse_init(void)
{
p_spi = 0;
p_ext = SADB_X_EXT_CYCSEQ;
p_alg_enc = SADB_EALG_NONE;
p_alg_auth = SADB_AALG_NONE;
p_mode = IPSEC_MODE_ANY;
p_reqid = 0;
p_replay = 0;
p_key_enc_len = p_key_auth_len = 0;
p_key_enc = p_key_auth = 0;
p_lt_hard = p_lt_soft = 0;
p_aiflags = 0;
p_aifamily = PF_UNSPEC;
p_natt_type = 0;
p_natt_oai = p_natt_oar = NULL;
p_natt_sport = p_natt_dport = 0;
p_natt_fraglen = -1;
}
void
free_buffer(void)
{
/* we got tons of memory leaks in the parser anyways, leave them */
}
diff --git a/sbin/setkey/setkey.c b/sbin/setkey/setkey.c
index ff2509555ff2..37613bfdb76e 100644
--- a/sbin/setkey/setkey.c
+++ b/sbin/setkey/setkey.c
@@ -1,672 +1,671 @@
-/* $FreeBSD$ */
/* $KAME: setkey.c,v 1.28 2003/06/27 07:15:45 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/linker.h>
#include <sys/module.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <err.h>
#include <net/route.h>
#include <netinet/in.h>
#include <net/pfkeyv2.h>
#include <netipsec/keydb.h>
#include <netipsec/key_debug.h>
#include <netipsec/ipsec.h>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <errno.h>
#include <netdb.h>
#include "libpfkey.h"
void usage(void);
int main(int, char **);
int get_supported(void);
void sendkeyshort(u_int, uint8_t);
void promisc(void);
int sendkeymsg(char *, size_t);
int postproc(struct sadb_msg *, int);
const char *numstr(int);
void shortdump_hdr(void);
void shortdump(struct sadb_msg *);
static void printdate(void);
static int32_t gmt2local(time_t);
static int modload(const char *name);
#define MODE_SCRIPT 1
#define MODE_CMDDUMP 2
#define MODE_CMDFLUSH 3
#define MODE_PROMISC 4
int so;
int f_forever = 0;
int f_all = 0;
int f_verbose = 0;
int f_mode = 0;
int f_cmddump = 0;
int f_policy = 0;
int f_hexdump = 0;
int f_tflag = 0;
int f_scope = 0;
static time_t thiszone;
extern int lineno;
extern int parse(FILE **);
void
usage()
{
printf("usage: setkey [-v] -c\n");
printf(" setkey [-v] -f filename\n");
printf(" setkey [-v] -e \"<script>\"\n");
printf(" setkey [-Pagltv] -D\n");
printf(" setkey [-Pv] -F\n");
printf(" setkey [-h] -x\n");
exit(1);
}
static int
modload(const char *name)
{
if (modfind(name) < 0)
if (kldload(name) < 0 || modfind(name) < 0) {
warn("%s: module not found", name);
return 0;
}
return 1;
}
int
main(ac, av)
int ac;
char **av;
{
FILE *fp = stdin;
int c;
if (ac == 1) {
usage();
/* NOTREACHED */
}
thiszone = gmt2local(0);
while ((c = getopt(ac, av, "acde:f:ghltvxDFP")) != -1) {
switch (c) {
case 'c':
f_mode = MODE_SCRIPT;
fp = stdin;
break;
case 'e':
if (fp != stdin) {
err(-1, "only one -f/-e option is accepted");
}
f_mode = MODE_SCRIPT;
fp = fmemopen(optarg, strlen(optarg), "r");
if (fp == NULL) {
err(-1, "fmemopen");
/*NOTREACHED*/
}
break;
case 'f':
if (fp != stdin) {
err(-1, "only one -f/-e option is accepted");
}
f_mode = MODE_SCRIPT;
if ((fp = fopen(optarg, "r")) == NULL) {
err(-1, "fopen");
/*NOTREACHED*/
}
break;
case 'D':
f_mode = MODE_CMDDUMP;
break;
case 'F':
f_mode = MODE_CMDFLUSH;
break;
case 'a':
f_all = 1;
break;
case 'l':
f_forever = 1;
break;
case 'h':
f_hexdump = 1;
break;
case 'x':
f_mode = MODE_PROMISC;
f_tflag++;
break;
case 'P':
f_policy = 1;
break;
case 'g': /* global */
f_scope |= IPSEC_POLICYSCOPE_GLOBAL;
break;
case 't': /* tunnel */
f_scope |= IPSEC_POLICYSCOPE_IFNET;
break;
case 'v':
f_verbose = 1;
break;
default:
usage();
/*NOTREACHED*/
}
}
modload("ipsec");
so = pfkey_open();
if (so < 0) {
perror("pfkey_open");
exit(1);
}
switch (f_mode) {
case MODE_CMDDUMP:
sendkeyshort(f_policy ? SADB_X_SPDDUMP: SADB_DUMP,
f_policy ? f_scope: SADB_SATYPE_UNSPEC);
break;
case MODE_CMDFLUSH:
sendkeyshort(f_policy ? SADB_X_SPDFLUSH: SADB_FLUSH,
SADB_SATYPE_UNSPEC);
break;
case MODE_SCRIPT:
if (get_supported() < 0) {
errx(-1, "%s", ipsec_strerror());
/*NOTREACHED*/
}
if (parse(&fp))
exit (1);
break;
case MODE_PROMISC:
promisc();
/*NOTREACHED*/
default:
usage();
/*NOTREACHED*/
}
exit(0);
}
int
get_supported()
{
if (pfkey_send_register(so, SADB_SATYPE_UNSPEC) < 0)
return -1;
if (pfkey_recv_register(so) < 0)
return -1;
return 0;
}
void
sendkeyshort(u_int type, uint8_t satype)
{
struct sadb_msg msg;
msg.sadb_msg_version = PF_KEY_V2;
msg.sadb_msg_type = type;
msg.sadb_msg_errno = 0;
msg.sadb_msg_satype = satype;
msg.sadb_msg_len = PFKEY_UNIT64(sizeof(msg));
msg.sadb_msg_reserved = 0;
msg.sadb_msg_seq = 0;
msg.sadb_msg_pid = getpid();
sendkeymsg((char *)&msg, sizeof(msg));
return;
}
void
promisc()
{
struct sadb_msg msg;
u_char rbuf[1024 * 32]; /* XXX: Enough ? Should I do MSG_PEEK ? */
ssize_t l;
msg.sadb_msg_version = PF_KEY_V2;
msg.sadb_msg_type = SADB_X_PROMISC;
msg.sadb_msg_errno = 0;
msg.sadb_msg_satype = 1;
msg.sadb_msg_len = PFKEY_UNIT64(sizeof(msg));
msg.sadb_msg_reserved = 0;
msg.sadb_msg_seq = 0;
msg.sadb_msg_pid = getpid();
if ((l = send(so, &msg, sizeof(msg), 0)) < 0) {
err(1, "send");
/*NOTREACHED*/
}
while (1) {
struct sadb_msg *base;
if ((l = recv(so, rbuf, sizeof(*base), MSG_PEEK)) < 0) {
err(1, "recv");
/*NOTREACHED*/
}
if (l != sizeof(*base))
continue;
base = (struct sadb_msg *)rbuf;
if ((l = recv(so, rbuf, PFKEY_UNUNIT64(base->sadb_msg_len),
0)) < 0) {
err(1, "recv");
/*NOTREACHED*/
}
printdate();
if (f_hexdump) {
int i;
for (i = 0; i < l; i++) {
if (i % 16 == 0)
printf("%08x: ", i);
printf("%02x ", rbuf[i] & 0xff);
if (i % 16 == 15)
printf("\n");
}
if (l % 16)
printf("\n");
}
/* adjust base pointer for promisc mode */
if (base->sadb_msg_type == SADB_X_PROMISC) {
if ((ssize_t)sizeof(*base) < l)
base++;
else
base = NULL;
}
if (base) {
kdebug_sadb(base);
printf("\n");
fflush(stdout);
}
}
}
int
sendkeymsg(buf, len)
char *buf;
size_t len;
{
u_char rbuf[1024 * 32]; /* XXX: Enough ? Should I do MSG_PEEK ? */
ssize_t l;
struct sadb_msg *msg;
{
struct timeval tv;
tv.tv_sec = 1;
tv.tv_usec = 0;
if (setsockopt(so, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv)) < 0) {
perror("setsockopt");
goto end;
}
}
if (f_forever)
shortdump_hdr();
again:
if (f_verbose) {
kdebug_sadb((struct sadb_msg *)buf);
printf("\n");
}
if (f_hexdump) {
int i;
for (i = 0; i < len; i++) {
if (i % 16 == 0)
printf("%08x: ", i);
printf("%02x ", buf[i] & 0xff);
if (i % 16 == 15)
printf("\n");
}
if (len % 16)
printf("\n");
}
if ((l = send(so, buf, len, 0)) < 0) {
perror("send");
goto end;
}
msg = (struct sadb_msg *)rbuf;
do {
if ((l = recv(so, rbuf, sizeof(rbuf), 0)) < 0) {
perror("recv");
goto end;
}
if (PFKEY_UNUNIT64(msg->sadb_msg_len) != l) {
warnx("invalid keymsg length");
break;
}
if (f_verbose) {
kdebug_sadb((struct sadb_msg *)rbuf);
printf("\n");
}
if (postproc(msg, l) < 0)
break;
} while (msg->sadb_msg_errno || msg->sadb_msg_seq);
if (f_forever) {
fflush(stdout);
sleep(1);
goto again;
}
end:
return(0);
}
int
postproc(msg, len)
struct sadb_msg *msg;
int len;
{
if (msg->sadb_msg_errno != 0) {
char inf[80];
const char *errmsg = NULL;
if (f_mode == MODE_SCRIPT)
snprintf(inf, sizeof(inf), "The result of line %d: ", lineno);
else
inf[0] = '\0';
switch (msg->sadb_msg_errno) {
case ENOENT:
switch (msg->sadb_msg_type) {
case SADB_DELETE:
case SADB_GET:
case SADB_X_SPDDELETE:
errmsg = "No entry";
break;
case SADB_DUMP:
errmsg = "No SAD entries";
break;
case SADB_X_SPDDUMP:
errmsg = "No SPD entries";
break;
}
break;
default:
errmsg = strerror(msg->sadb_msg_errno);
}
printf("%s%s.\n", inf, errmsg);
return(-1);
}
switch (msg->sadb_msg_type) {
case SADB_GET:
pfkey_sadump(msg);
break;
case SADB_DUMP:
/* filter out DEAD SAs */
if (!f_all) {
caddr_t mhp[SADB_EXT_MAX + 1];
struct sadb_sa *sa;
pfkey_align(msg, mhp);
pfkey_check(mhp);
if ((sa = (struct sadb_sa *)mhp[SADB_EXT_SA]) != NULL) {
if (sa->sadb_sa_state == SADB_SASTATE_DEAD)
break;
}
}
if (f_forever)
shortdump(msg);
else
pfkey_sadump(msg);
msg = (struct sadb_msg *)((caddr_t)msg +
PFKEY_UNUNIT64(msg->sadb_msg_len));
if (f_verbose) {
kdebug_sadb((struct sadb_msg *)msg);
printf("\n");
}
break;
case SADB_X_SPDDUMP:
pfkey_spdump(msg);
if (msg->sadb_msg_seq == 0) break;
msg = (struct sadb_msg *)((caddr_t)msg +
PFKEY_UNUNIT64(msg->sadb_msg_len));
if (f_verbose) {
kdebug_sadb((struct sadb_msg *)msg);
printf("\n");
}
break;
}
return(0);
}
/*------------------------------------------------------------*/
static const char *satype[] = {
NULL, NULL, "ah", "esp"
};
static const char *sastate[] = {
"L", "M", "D", "d"
};
static const char *ipproto[] = {
/*0*/ "ip", "icmp", "igmp", "ggp", "ip4",
NULL, "tcp", NULL, "egp", NULL,
/*10*/ NULL, NULL, NULL, NULL, NULL,
NULL, NULL, "udp", NULL, NULL,
/*20*/ NULL, NULL, "idp", NULL, NULL,
NULL, NULL, NULL, NULL, "tp",
/*30*/ NULL, NULL, NULL, NULL, NULL,
NULL, NULL, NULL, NULL, NULL,
/*40*/ NULL, "ip6", NULL, "rt6", "frag6",
NULL, "rsvp", "gre", NULL, NULL,
/*50*/ "esp", "ah", NULL, NULL, NULL,
NULL, NULL, NULL, "icmp6", "none",
/*60*/ "dst6",
};
#define STR_OR_ID(x, tab) \
(((x) < sizeof(tab)/sizeof(tab[0]) && tab[(x)]) ? tab[(x)] : numstr(x))
const char *
numstr(x)
int x;
{
static char buf[20];
snprintf(buf, sizeof(buf), "#%d", x);
return buf;
}
void
shortdump_hdr()
{
printf("%-4s %-3s %-1s %-8s %-7s %s -> %s\n",
"time", "p", "s", "spi", "ltime", "src", "dst");
}
void
shortdump(msg)
struct sadb_msg *msg;
{
caddr_t mhp[SADB_EXT_MAX + 1];
char buf[NI_MAXHOST], pbuf[NI_MAXSERV];
struct sadb_sa *sa;
struct sadb_address *saddr;
struct sadb_lifetime *lts, *lth, *ltc;
struct sockaddr *s;
u_int t;
time_t cur = time(0);
pfkey_align(msg, mhp);
pfkey_check(mhp);
printf("%02lu%02lu", (u_long)(cur % 3600) / 60, (u_long)(cur % 60));
printf(" %-3s", STR_OR_ID(msg->sadb_msg_satype, satype));
if ((sa = (struct sadb_sa *)mhp[SADB_EXT_SA]) != NULL) {
printf(" %-1s", STR_OR_ID(sa->sadb_sa_state, sastate));
printf(" %08x", (u_int32_t)ntohl(sa->sadb_sa_spi));
} else
printf("%-1s %-8s", "?", "?");
lts = (struct sadb_lifetime *)mhp[SADB_EXT_LIFETIME_SOFT];
lth = (struct sadb_lifetime *)mhp[SADB_EXT_LIFETIME_HARD];
ltc = (struct sadb_lifetime *)mhp[SADB_EXT_LIFETIME_CURRENT];
if (lts && lth && ltc) {
if (ltc->sadb_lifetime_addtime == 0)
t = (u_long)0;
else
t = (u_long)(cur - ltc->sadb_lifetime_addtime);
if (t >= 1000)
strlcpy(buf, " big/", sizeof(buf));
else
snprintf(buf, sizeof(buf), " %3lu/", (u_long)t);
printf("%s", buf);
t = (u_long)lth->sadb_lifetime_addtime;
if (t >= 1000)
strlcpy(buf, "big", sizeof(buf));
else
snprintf(buf, sizeof(buf), "%-3lu", (u_long)t);
printf("%s", buf);
} else
printf(" ??\?/???"); /* backslash to avoid trigraph ??/ */
printf(" ");
if ((saddr = (struct sadb_address *)mhp[SADB_EXT_ADDRESS_SRC]) != NULL) {
if (saddr->sadb_address_proto)
printf("%s ", STR_OR_ID(saddr->sadb_address_proto, ipproto));
s = (struct sockaddr *)(saddr + 1);
getnameinfo(s, s->sa_len, buf, sizeof(buf),
pbuf, sizeof(pbuf), NI_NUMERICHOST|NI_NUMERICSERV);
if (strcmp(pbuf, "0") != 0)
printf("%s[%s]", buf, pbuf);
else
printf("%s", buf);
} else
printf("?");
printf(" -> ");
if ((saddr = (struct sadb_address *)mhp[SADB_EXT_ADDRESS_DST]) != NULL) {
if (saddr->sadb_address_proto)
printf("%s ", STR_OR_ID(saddr->sadb_address_proto, ipproto));
s = (struct sockaddr *)(saddr + 1);
getnameinfo(s, s->sa_len, buf, sizeof(buf),
pbuf, sizeof(pbuf), NI_NUMERICHOST|NI_NUMERICSERV);
if (strcmp(pbuf, "0") != 0)
printf("%s[%s]", buf, pbuf);
else
printf("%s", buf);
} else
printf("?");
printf("\n");
}
/* From: tcpdump(1):gmt2local.c and util.c */
/*
* Print the timestamp
*/
static void
printdate()
{
struct timeval tp;
int s;
if (gettimeofday(&tp, NULL) == -1) {
perror("gettimeofday");
return;
}
if (f_tflag == 1) {
/* Default */
s = (tp.tv_sec + thiszone ) % 86400;
(void)printf("%02d:%02d:%02d.%06u ",
s / 3600, (s % 3600) / 60, s % 60, (u_int32_t)tp.tv_usec);
} else if (f_tflag > 1) {
/* Unix timeval style */
(void)printf("%u.%06u ",
(u_int32_t)tp.tv_sec, (u_int32_t)tp.tv_usec);
}
printf("\n");
}
/*
* Returns the difference between gmt and local time in seconds.
* Use gmtime() and localtime() to keep things simple.
*/
int32_t
gmt2local(time_t t)
{
register int dt, dir;
register struct tm *gmt, *loc;
struct tm sgmt;
if (t == 0)
t = time(NULL);
gmt = &sgmt;
*gmt = *gmtime(&t);
loc = localtime(&t);
dt = (loc->tm_hour - gmt->tm_hour) * 60 * 60 +
(loc->tm_min - gmt->tm_min) * 60;
/*
* If the year or julian day is different, we span 00:00 GMT
* and must add or subtract a day. Check the year first to
* avoid problems when the julian day wraps.
*/
dir = loc->tm_year - gmt->tm_year;
if (dir == 0)
dir = loc->tm_yday - gmt->tm_yday;
dt += dir * 24 * 60 * 60;
return (dt);
}
diff --git a/sbin/setkey/test-pfkey.c b/sbin/setkey/test-pfkey.c
index ba702c80eb37..c3d2ac88e4c0 100644
--- a/sbin/setkey/test-pfkey.c
+++ b/sbin/setkey/test-pfkey.c
@@ -1,533 +1,532 @@
-/* $FreeBSD$ */
/* $KAME: test-pfkey.c,v 1.4 2000/06/07 00:29:14 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <net/route.h>
#include <net/pfkeyv2.h>
#include <netinet/in.h>
#include <netipsec/keydb.h>
#include <netipsec/key_var.h>
#include <netipsec/key_debug.h>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <errno.h>
#include <netdb.h>
u_char m_buf[BUFSIZ];
u_int m_len;
char *pname;
void Usage(void);
int sendkeymsg(void);
void key_setsadbmsg(u_int);
void key_setsadbsens(void);
void key_setsadbprop(void);
void key_setsadbid(u_int, caddr_t);
void key_setsadblft(u_int, u_int);
void key_setspirange(void);
void key_setsadbkey(u_int, caddr_t);
void key_setsadbsa(void);
void key_setsadbaddr(u_int, u_int, caddr_t);
void key_setsadbextbuf(caddr_t, int, caddr_t, int, caddr_t, int);
void
Usage()
{
printf("Usage:\t%s number\n", pname);
exit(0);
}
int
main(ac, av)
int ac;
char **av;
{
pname = *av;
if (ac == 1) Usage();
key_setsadbmsg(atoi(*(av+1)));
sendkeymsg();
exit(0);
}
/* %%% */
int
sendkeymsg()
{
u_char rbuf[1024 * 32]; /* XXX: Enough ? Should I do MSG_PEEK ? */
int so, len;
if ((so = socket(PF_KEY, SOCK_RAW, PF_KEY_V2)) < 0) {
perror("socket(PF_KEY)");
goto end;
}
#if 0
{
#include <sys/time.h>
struct timeval tv;
tv.tv_sec = 1;
tv.tv_usec = 0;
if (setsockopt(so, SOL_SOCKET, SO_RCVTIMEO, &tv, sizeof(tv)) < 0) {
perror("setsockopt");
goto end;
}
}
#endif
pfkey_sadump((struct sadb_msg *)m_buf);
if ((len = send(so, m_buf, m_len, 0)) < 0) {
perror("send");
goto end;
}
if ((len = recv(so, rbuf, sizeof(rbuf), 0)) < 0) {
perror("recv");
goto end;
}
pfkey_sadump((struct sadb_msg *)rbuf);
end:
(void)close(so);
return(0);
}
void
key_setsadbmsg(type)
u_int type;
{
struct sadb_msg m_msg;
memset(&m_msg, 0, sizeof(m_msg));
m_msg.sadb_msg_version = PF_KEY_V2;
m_msg.sadb_msg_type = type;
m_msg.sadb_msg_errno = 0;
m_msg.sadb_msg_satype = SADB_SATYPE_ESP;
#if 0
m_msg.sadb_msg_reserved = 0;
#endif
m_msg.sadb_msg_seq = 0;
m_msg.sadb_msg_pid = getpid();
m_len = sizeof(struct sadb_msg);
memcpy(m_buf, &m_msg, m_len);
switch (type) {
case SADB_GETSPI:
/*<base, address(SD), SPI range>*/
key_setsadbaddr(SADB_EXT_ADDRESS_SRC, AF_INET, "10.0.3.4");
key_setsadbaddr(SADB_EXT_ADDRESS_DST, AF_INET, "127.0.0.1");
key_setspirange();
/*<base, SA(*), address(SD)>*/
break;
case SADB_ADD:
/* <base, SA, (lifetime(HSC),) address(SD), (address(P),)
key(AE), (identity(SD),) (sensitivity)> */
key_setsadbaddr(SADB_EXT_ADDRESS_PROXY, AF_INET6, "3ffe::1");
case SADB_UPDATE:
key_setsadbsa();
key_setsadblft(SADB_EXT_LIFETIME_HARD, 10);
key_setsadblft(SADB_EXT_LIFETIME_SOFT, 5);
key_setsadbaddr(SADB_EXT_ADDRESS_SRC, AF_INET, "192.168.1.1");
key_setsadbaddr(SADB_EXT_ADDRESS_DST, AF_INET, "10.0.3.4");
/* XXX key_setsadbkey(SADB_EXT_KEY_AUTH, "abcde"); */
key_setsadbkey(SADB_EXT_KEY_AUTH, "1234567812345678");
key_setsadbkey(SADB_EXT_KEY_ENCRYPT, "12345678");
key_setsadbid(SADB_EXT_IDENTITY_SRC, "hoge1234@hoge.com");
key_setsadbid(SADB_EXT_IDENTITY_DST, "hage5678@hage.net");
key_setsadbsens();
/* <base, SA, (lifetime(HSC),) address(SD), (address(P),)
(identity(SD),) (sensitivity)> */
break;
case SADB_DELETE:
/* <base, SA(*), address(SDP)> */
key_setsadbsa();
key_setsadbaddr(SADB_EXT_ADDRESS_SRC, AF_INET, "192.168.1.1");
key_setsadbaddr(SADB_EXT_ADDRESS_DST, AF_INET, "10.0.3.4");
key_setsadbaddr(SADB_EXT_ADDRESS_PROXY, AF_INET6, "3ffe::1");
/* <base, SA(*), address(SDP)> */
break;
case SADB_GET:
/* <base, SA(*), address(SDP)> */
key_setsadbsa();
key_setsadbaddr(SADB_EXT_ADDRESS_SRC, AF_INET, "192.168.1.1");
key_setsadbaddr(SADB_EXT_ADDRESS_DST, AF_INET, "10.0.3.4");
key_setsadbaddr(SADB_EXT_ADDRESS_PROXY, AF_INET6, "3ffe::1");
/* <base, SA, (lifetime(HSC),) address(SD), (address(P),)
key(AE), (identity(SD),) (sensitivity)> */
break;
case SADB_ACQUIRE:
/* <base, address(SD), (address(P),) (identity(SD),)
(sensitivity,) proposal> */
key_setsadbaddr(SADB_EXT_ADDRESS_SRC, AF_INET, "192.168.1.1");
key_setsadbaddr(SADB_EXT_ADDRESS_DST, AF_INET, "10.0.3.4");
key_setsadbaddr(SADB_EXT_ADDRESS_PROXY, AF_INET6, "3ffe::1");
key_setsadbid(SADB_EXT_IDENTITY_SRC, "hoge1234@hoge.com");
key_setsadbid(SADB_EXT_IDENTITY_DST, "hage5678@hage.net");
key_setsadbsens();
key_setsadbprop();
/* <base, address(SD), (address(P),) (identity(SD),)
(sensitivity,) proposal> */
break;
case SADB_REGISTER:
/* <base> */
/* <base, supported> */
break;
case SADB_EXPIRE:
case SADB_FLUSH:
break;
case SADB_DUMP:
break;
case SADB_X_PROMISC:
/* <base> */
/* <base, base(, others)> */
break;
case SADB_X_PCHANGE:
break;
/* for SPD management */
case SADB_X_SPDFLUSH:
case SADB_X_SPDDUMP:
break;
case SADB_X_SPDADD:
#if 0
{
struct sadb_x_policy m_policy;
m_policy.sadb_x_policy_len = PFKEY_UNIT64(sizeof(m_policy));
m_policy.sadb_x_policy_exttype = SADB_X_EXT_POLICY;
m_policy.sadb_x_policy_type = SADB_X_PL_IPSEC;
m_policy.sadb_x_policy_esp_trans = 1;
m_policy.sadb_x_policy_ah_trans = 2;
m_policy.sadb_x_policy_esp_network = 3;
m_policy.sadb_x_policy_ah_network = 4;
m_policy.sadb_x_policy_reserved = 0;
memcpy(m_buf + m_len, &m_policy, sizeof(struct sadb_x_policy));
m_len += sizeof(struct sadb_x_policy);
}
#endif
case SADB_X_SPDDELETE:
key_setsadbaddr(SADB_EXT_ADDRESS_SRC, AF_INET, "192.168.1.1");
key_setsadbaddr(SADB_EXT_ADDRESS_DST, AF_INET, "10.0.3.4");
break;
}
((struct sadb_msg *)m_buf)->sadb_msg_len = PFKEY_UNIT64(m_len);
return;
}
void
key_setsadbsens()
{
struct sadb_sens m_sens;
u_char buf[64];
u_int s, i, slen, ilen, len;
/* make sens & integ */
s = htonl(0x01234567);
i = htonl(0x89abcdef);
slen = sizeof(s);
ilen = sizeof(i);
memcpy(buf, &s, slen);
memcpy(buf + slen, &i, ilen);
len = sizeof(m_sens) + PFKEY_ALIGN8(slen) + PFKEY_ALIGN8(ilen);
m_sens.sadb_sens_len = PFKEY_UNIT64(len);
m_sens.sadb_sens_exttype = SADB_EXT_SENSITIVITY;
m_sens.sadb_sens_dpd = 1;
m_sens.sadb_sens_sens_level = 2;
m_sens.sadb_sens_sens_len = PFKEY_ALIGN8(slen);
m_sens.sadb_sens_integ_level = 3;
m_sens.sadb_sens_integ_len = PFKEY_ALIGN8(ilen);
m_sens.sadb_sens_reserved = 0;
key_setsadbextbuf(m_buf, m_len,
(caddr_t)&m_sens, sizeof(struct sadb_sens),
buf, slen + ilen);
m_len += len;
return;
}
void
key_setsadbprop()
{
struct sadb_prop m_prop;
struct sadb_comb *m_comb;
u_char buf[256];
u_int len = sizeof(m_prop) + sizeof(m_comb) * 2;
/* make prop & comb */
m_prop.sadb_prop_len = PFKEY_UNIT64(len);
m_prop.sadb_prop_exttype = SADB_EXT_PROPOSAL;
m_prop.sadb_prop_replay = 0;
m_prop.sadb_prop_reserved[0] = 0;
m_prop.sadb_prop_reserved[1] = 0;
m_prop.sadb_prop_reserved[2] = 0;
/* the 1st is ESP AES-GCM-16 */
m_comb = (struct sadb_comb *)buf;
m_comb->sadb_comb_auth = SADB_AALG_NONE;
m_comb->sadb_comb_encrypt = SADB_X_EALG_AESGCM16;
m_comb->sadb_comb_flags = 0;
m_comb->sadb_comb_auth_minbits = 0;
m_comb->sadb_comb_auth_maxbits = 0;
m_comb->sadb_comb_encrypt_minbits = 128;
m_comb->sadb_comb_encrypt_maxbits = 256;
m_comb->sadb_comb_reserved = 0;
m_comb->sadb_comb_soft_allocations = 0;
m_comb->sadb_comb_hard_allocations = 0;
m_comb->sadb_comb_soft_bytes = 0;
m_comb->sadb_comb_hard_bytes = 0;
m_comb->sadb_comb_soft_addtime = 0;
m_comb->sadb_comb_hard_addtime = 0;
m_comb->sadb_comb_soft_usetime = 0;
m_comb->sadb_comb_hard_usetime = 0;
/* the 2nd is ESP AES-CBC and AH HMAC-SHA2-256 */
m_comb = (struct sadb_comb *)(buf + sizeof(*m_comb));
m_comb->sadb_comb_auth = SADB_X_AALG_SHA2_256;
m_comb->sadb_comb_encrypt = SADB_X_EALG_RIJNDAELCBC;
m_comb->sadb_comb_flags = 0;
m_comb->sadb_comb_auth_minbits = 256;
m_comb->sadb_comb_auth_maxbits = 256;
m_comb->sadb_comb_encrypt_minbits = 128;
m_comb->sadb_comb_encrypt_maxbits = 256;
m_comb->sadb_comb_reserved = 0;
m_comb->sadb_comb_soft_allocations = 0;
m_comb->sadb_comb_hard_allocations = 0;
m_comb->sadb_comb_soft_bytes = 0;
m_comb->sadb_comb_hard_bytes = 0;
m_comb->sadb_comb_soft_addtime = 0;
m_comb->sadb_comb_hard_addtime = 0;
m_comb->sadb_comb_soft_usetime = 0;
m_comb->sadb_comb_hard_usetime = 0;
key_setsadbextbuf(m_buf, m_len,
(caddr_t)&m_prop, sizeof(struct sadb_prop),
buf, sizeof(*m_comb) * 2);
m_len += len;
return;
}
void
key_setsadbid(ext, str)
u_int ext;
caddr_t str;
{
struct sadb_ident m_id;
u_int idlen = strlen(str), len;
len = sizeof(m_id) + PFKEY_ALIGN8(idlen);
m_id.sadb_ident_len = PFKEY_UNIT64(len);
m_id.sadb_ident_exttype = ext;
m_id.sadb_ident_type = SADB_IDENTTYPE_USERFQDN;
m_id.sadb_ident_reserved = 0;
m_id.sadb_ident_id = getpid();
key_setsadbextbuf(m_buf, m_len,
(caddr_t)&m_id, sizeof(struct sadb_ident),
str, idlen);
m_len += len;
return;
}
void
key_setsadblft(ext, time)
u_int ext, time;
{
struct sadb_lifetime m_lft;
m_lft.sadb_lifetime_len = PFKEY_UNIT64(sizeof(m_lft));
m_lft.sadb_lifetime_exttype = ext;
m_lft.sadb_lifetime_allocations = 0x2;
m_lft.sadb_lifetime_bytes = 0x1000;
m_lft.sadb_lifetime_addtime = time;
m_lft.sadb_lifetime_usetime = 0x0020;
memcpy(m_buf + m_len, &m_lft, sizeof(struct sadb_lifetime));
m_len += sizeof(struct sadb_lifetime);
return;
}
void
key_setspirange()
{
struct sadb_spirange m_spi;
m_spi.sadb_spirange_len = PFKEY_UNIT64(sizeof(m_spi));
m_spi.sadb_spirange_exttype = SADB_EXT_SPIRANGE;
m_spi.sadb_spirange_min = 0x00001000;
m_spi.sadb_spirange_max = 0x00002000;
m_spi.sadb_spirange_reserved = 0;
memcpy(m_buf + m_len, &m_spi, sizeof(struct sadb_spirange));
m_len += sizeof(struct sadb_spirange);
return;
}
void
key_setsadbkey(ext, str)
u_int ext;
caddr_t str;
{
struct sadb_key m_key;
u_int keylen = strlen(str);
u_int len;
len = sizeof(struct sadb_key) + PFKEY_ALIGN8(keylen);
m_key.sadb_key_len = PFKEY_UNIT64(len);
m_key.sadb_key_exttype = ext;
m_key.sadb_key_bits = keylen * 8;
m_key.sadb_key_reserved = 0;
key_setsadbextbuf(m_buf, m_len,
(caddr_t)&m_key, sizeof(struct sadb_key),
str, keylen);
m_len += len;
return;
}
void
key_setsadbsa()
{
struct sadb_sa m_sa;
m_sa.sadb_sa_len = PFKEY_UNIT64(sizeof(struct sadb_sa));
m_sa.sadb_sa_exttype = SADB_EXT_SA;
m_sa.sadb_sa_spi = htonl(0x12345678);
m_sa.sadb_sa_replay = 4;
m_sa.sadb_sa_state = 0;
m_sa.sadb_sa_auth = SADB_AALG_NONE;
m_sa.sadb_sa_encrypt = SADB_X_EALG_AESGCM16;
m_sa.sadb_sa_flags = 0;
memcpy(m_buf + m_len, &m_sa, sizeof(struct sadb_sa));
m_len += sizeof(struct sadb_sa);
return;
}
void
key_setsadbaddr(ext, af, str)
u_int ext, af;
caddr_t str;
{
struct sadb_address m_addr;
u_int len;
struct addrinfo hints, *res;
const char *serv;
int plen;
switch (af) {
case AF_INET:
plen = sizeof(struct in_addr) << 3;
break;
case AF_INET6:
plen = sizeof(struct in6_addr) << 3;
break;
default:
/* XXX bark */
exit(1);
}
/* make sockaddr buffer */
memset(&hints, 0, sizeof(hints));
hints.ai_family = af;
hints.ai_socktype = SOCK_DGRAM; /*dummy*/
hints.ai_flags = AI_NUMERICHOST;
serv = (ext == SADB_EXT_ADDRESS_PROXY ? "0" : "4660"); /*0x1234*/
if (getaddrinfo(str, serv, &hints, &res) != 0 || res->ai_next) {
/* XXX bark */
exit(1);
}
len = sizeof(struct sadb_address) + PFKEY_ALIGN8(res->ai_addrlen);
m_addr.sadb_address_len = PFKEY_UNIT64(len);
m_addr.sadb_address_exttype = ext;
m_addr.sadb_address_proto =
(ext == SADB_EXT_ADDRESS_PROXY ? 0 : IPPROTO_TCP);
m_addr.sadb_address_prefixlen = plen;
m_addr.sadb_address_reserved = 0;
key_setsadbextbuf(m_buf, m_len,
(caddr_t)&m_addr, sizeof(struct sadb_address),
(caddr_t)res->ai_addr, res->ai_addrlen);
m_len += len;
freeaddrinfo(res);
return;
}
void
key_setsadbextbuf(dst, off, ebuf, elen, vbuf, vlen)
caddr_t dst, ebuf, vbuf;
int off, elen, vlen;
{
memset(dst + off, 0, elen + vlen);
memcpy(dst + off, (caddr_t)ebuf, elen);
memcpy(dst + off + elen, vbuf, vlen);
return;
}
diff --git a/sbin/setkey/token.l b/sbin/setkey/token.l
index f5ccb4297d33..5acca879a944 100644
--- a/sbin/setkey/token.l
+++ b/sbin/setkey/token.l
@@ -1,281 +1,280 @@
-/* $FreeBSD$ */
/* $KAME: token.l,v 1.43 2003/07/25 09:35:28 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
%{
#include <sys/types.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <net/route.h>
#include <net/pfkeyv2.h>
#include <netipsec/keydb.h>
#include <netipsec/key_debug.h>
#include <netinet/in.h>
#include <netipsec/ipsec.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <netdb.h>
#include "vchar.h"
#include "y.tab.h"
int lineno = 1;
extern u_char m_buf[BUFSIZ];
extern u_int m_len;
extern int f_debug;
int yylex(void);
void yyfatal(const char *s);
void yyerror(const char *s);
extern void parse_init(void);
int parse(FILE **);
int yyparse(void);
%}
%option noyywrap
/* common section */
nl \n
ws [ \t]+
digit [0-9]
letter [0-9A-Za-z]
hexdigit [0-9A-Fa-f]
dot \.
hyphen \-
slash \/
blcl \[
elcl \]
semi \;
comment \#.*
quotedstring \"[^"]*\"
decstring {digit}+
hexstring 0[xX]{hexdigit}+
ipaddress [a-fA-F0-9:]([a-fA-F0-9:\.]*|[a-fA-F0-9:\.]*%[a-zA-Z0-9]*)
ipaddrmask {slash}{digit}{1,3}
name {letter}(({letter}|{digit}|{hyphen})*({letter}|{digit}))*
hostname {name}(({dot}{name})+{dot}?)?
%s S_PL S_AUTHALG S_ENCALG
%%
add { return(ADD); }
delete { return(DELETE); }
deleteall { return(DELETEALL); }
get { return(GET); }
flush { return(FLUSH); }
dump { return(DUMP); }
/* for management SPD */
spdadd { return(SPDADD); }
spddelete { return(SPDDELETE); }
spddump { return(SPDDUMP); }
spdflush { return(SPDFLUSH); }
tagged { return(TAGGED); }
{hyphen}P { BEGIN S_PL; return(F_POLICY); }
<S_PL>[a-zA-Z0-9:\.\-_/ \n\t][a-zA-Z0-9:\.%\-_/ \n\t]* {
yymore();
/* count up for nl */
{
char *p;
for (p = yytext; *p != '\0'; p++)
if (*p == '\n')
lineno++;
}
yylval.val.len = strlen(yytext);
yylval.val.buf = strdup(yytext);
if (!yylval.val.buf)
yyfatal("insufficient memory");
return(PL_REQUESTS);
}
<S_PL>{semi} { BEGIN INITIAL; return(EOT); }
/* address resolution flags */
{hyphen}[n46][n46]* {
yylval.val.len = strlen(yytext);
yylval.val.buf = strdup(yytext);
if (!yylval.val.buf)
yyfatal("insufficient memory");
return(F_AIFLAGS);
}
/* security protocols */
ah { yylval.num = 0; return(PR_AH); }
esp { yylval.num = 0; return(PR_ESP); }
ah-old { yylval.num = 1; return(PR_AH); }
esp-old { yylval.num = 1; return(PR_ESP); }
ipcomp { yylval.num = 0; return(PR_IPCOMP); }
tcp { yylval.num = 0; return(PR_TCP); }
/* authentication alogorithm */
{hyphen}A { BEGIN S_AUTHALG; return(F_AUTH); }
<S_AUTHALG>hmac-sha1 { yylval.num = SADB_AALG_SHA1HMAC; BEGIN INITIAL; return(ALG_AUTH); }
<S_AUTHALG>hmac-sha2-256 { yylval.num = SADB_X_AALG_SHA2_256; BEGIN INITIAL; return(ALG_AUTH); }
<S_AUTHALG>hmac-sha2-384 { yylval.num = SADB_X_AALG_SHA2_384; BEGIN INITIAL; return(ALG_AUTH); }
<S_AUTHALG>hmac-sha2-512 { yylval.num = SADB_X_AALG_SHA2_512; BEGIN INITIAL; return(ALG_AUTH); }
<S_AUTHALG>aes-xcbc-mac { yylval.num = SADB_X_AALG_AES_XCBC_MAC; BEGIN INITIAL; return(ALG_AUTH); }
<S_AUTHALG>tcp-md5 { yylval.num = SADB_X_AALG_TCP_MD5; BEGIN INITIAL; return(ALG_AUTH); }
<S_AUTHALG>null { yylval.num = SADB_X_AALG_NULL; BEGIN INITIAL; return(ALG_AUTH_NOKEY); }
/* encryption alogorithm */
{hyphen}E { BEGIN S_ENCALG; return(F_ENC); }
<S_ENCALG>null { yylval.num = SADB_EALG_NULL; BEGIN INITIAL; return(ALG_ENC); }
<S_ENCALG>simple { yylval.num = SADB_EALG_NULL; BEGIN INITIAL; return(ALG_ENC_OLD); }
<S_ENCALG>rijndael-cbc { yylval.num = SADB_X_EALG_AESCBC; BEGIN INITIAL; return(ALG_ENC); }
<S_ENCALG>aes-cbc { yylval.num = SADB_X_EALG_AESCBC; BEGIN INITIAL; return(ALG_ENC); }
<S_ENCALG>aes-ctr { yylval.num = SADB_X_EALG_AESCTR; BEGIN INITIAL; return(ALG_ENC_SALT); }
<S_ENCALG>aes-gcm-16 { yylval.num = SADB_X_EALG_AESGCM16; BEGIN INITIAL; return(ALG_ENC_SALT); }
/* compression algorithms */
{hyphen}C { return(F_COMP); }
oui { yylval.num = SADB_X_CALG_OUI; return(ALG_COMP); }
deflate { yylval.num = SADB_X_CALG_DEFLATE; return(ALG_COMP); }
lzs { yylval.num = SADB_X_CALG_LZS; return(ALG_COMP); }
{hyphen}R { return(F_RAWCPI); }
/* extension */
{hyphen}m { return(F_MODE); }
transport { yylval.num = IPSEC_MODE_TRANSPORT; return(MODE); }
tunnel { yylval.num = IPSEC_MODE_TUNNEL; return(MODE); }
{hyphen}u { return(F_REQID); }
{hyphen}f { return(F_EXT); }
random-pad { yylval.num = SADB_X_EXT_PRAND; return(EXTENSION); }
seq-pad { yylval.num = SADB_X_EXT_PSEQ; return(EXTENSION); }
zero-pad { yylval.num = SADB_X_EXT_PZERO; return(EXTENSION); }
nocyclic-seq { return(NOCYCLICSEQ); }
{hyphen}r { return(F_REPLAY); }
{hyphen}lh { return(F_LIFETIME_HARD); }
{hyphen}ls { return(F_LIFETIME_SOFT); }
{hyphen}natt { return(F_NATT); }
{hyphen}natt_mtu { return(F_NATT_MTU); }
/* ... */
any { return(ANY); }
{ws} { }
{nl} { lineno++; }
{comment}
{semi} { return(EOT); }
/* for address parameters: /prefix, [port] */
{slash} { return SLASH; }
{blcl} { return BLCL; }
{elcl} { return ELCL; }
/* parameter */
{decstring} {
char *bp;
yylval.ulnum = strtoul(yytext, &bp, 10);
return(DECSTRING);
}
{hexstring} {
yylval.val.buf = strdup(yytext + 2);
if (!yylval.val.buf)
yyfatal("insufficient memory");
yylval.val.len = strlen(yylval.val.buf);
return(HEXSTRING);
}
{quotedstring} {
char *p = yytext;
while (*++p != '"') ;
*p = '\0';
yytext++;
yylval.val.len = yyleng - 2;
yylval.val.buf = strdup(yytext);
if (!yylval.val.buf)
yyfatal("insufficient memory");
return(QUOTEDSTRING);
}
[A-Za-z0-9:][A-Za-z0-9:%\.-]* {
yylval.val.len = yyleng;
yylval.val.buf = strdup(yytext);
if (!yylval.val.buf)
yyfatal("insufficient memory");
return(STRING);
}
[0-9,]+ {
yylval.val.len = yyleng;
yylval.val.buf = strdup(yytext);
if (!yylval.val.buf)
yyfatal("insufficient memory");
return(STRING);
}
. {
yyfatal("Syntax error");
/*NOTREACHED*/
}
%%
void
yyfatal(const char *s)
{
yyerror(s);
exit(1);
}
void
yyerror(const char *s)
{
printf("line %d: %s at [%s]\n", lineno, s, yytext);
}
int
parse(FILE **fp)
{
yyin = *fp;
parse_init();
if (yyparse()) {
printf("parse failed, line %d.\n", lineno);
return(-1);
}
return(0);
}
diff --git a/sbin/setkey/vchar.h b/sbin/setkey/vchar.h
index c7e96cb9ca1a..035bfa82e1e6 100644
--- a/sbin/setkey/vchar.h
+++ b/sbin/setkey/vchar.h
@@ -1,38 +1,37 @@
-/* $FreeBSD$ */
/* $KAME: vchar.h,v 1.2 2000/06/07 00:29:14 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
typedef struct {
u_int len;
caddr_t buf;
} vchar_t;
diff --git a/secure/lib/libcrypto/opensslconf.h.in b/secure/lib/libcrypto/opensslconf.h.in
index b0936858a221..2658796beb66 100644
--- a/secure/lib/libcrypto/opensslconf.h.in
+++ b/secure/lib/libcrypto/opensslconf.h.in
@@ -1,209 +1,208 @@
-/* $FreeBSD$ */
/*
* WARNING: do not edit!
* Generated by Makefile from include/openssl/opensslconf.h.in
*
* Copyright 2016-2020 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the OpenSSL license (the "License"). You may not use
* this file except in compliance with the License. You can obtain a copy
* in the file LICENSE in the source distribution or at
* https://www.openssl.org/source/license.html
*/
#include <openssl/opensslv.h>
#ifdef __cplusplus
extern "C" {
#endif
#ifdef OPENSSL_ALGORITHM_DEFINES
# error OPENSSL_ALGORITHM_DEFINES no longer supported
#endif
/*
* OpenSSL was configured with the following options:
*/
#ifndef OPENSSL_NO_MD2
# define OPENSSL_NO_MD2
#endif
#ifndef OPENSSL_THREADS
# define OPENSSL_THREADS
#endif
#ifndef OPENSSL_RAND_SEED_OS
# define OPENSSL_RAND_SEED_OS
#endif
#ifndef OPENSSL_NO_AFALGENG
# define OPENSSL_NO_AFALGENG
#endif
#ifndef OPENSSL_NO_ASAN
# define OPENSSL_NO_ASAN
#endif
%%NO_ASM%%#ifndef OPENSSL_NO_ASM
%%NO_ASM%%# define OPENSSL_NO_ASM
%%NO_ASM%%#endif
#ifndef OPENSSL_NO_CRYPTO_MDEBUG
# define OPENSSL_NO_CRYPTO_MDEBUG
#endif
#ifndef OPENSSL_NO_CRYPTO_MDEBUG_BACKTRACE
# define OPENSSL_NO_CRYPTO_MDEBUG_BACKTRACE
#endif
#ifndef OPENSSL_NO_EC_NISTP_64_GCC_128
# define OPENSSL_NO_EC_NISTP_64_GCC_128
#endif
#ifndef OPENSSL_NO_EGD
# define OPENSSL_NO_EGD
#endif
#ifndef OPENSSL_NO_EXTERNAL_TESTS
# define OPENSSL_NO_EXTERNAL_TESTS
#endif
#ifndef OPENSSL_NO_FUZZ_AFL
# define OPENSSL_NO_FUZZ_AFL
#endif
#ifndef OPENSSL_NO_FUZZ_LIBFUZZER
# define OPENSSL_NO_FUZZ_LIBFUZZER
#endif
#ifndef OPENSSL_NO_HEARTBEATS
# define OPENSSL_NO_HEARTBEATS
#endif
%%NO_KTLS%%#ifndef OPENSSL_NO_KTLS
%%NO_KTLS%%# define OPENSSL_NO_KTLS
%%NO_KTLS%%#endif
#ifndef OPENSSL_NO_MSAN
# define OPENSSL_NO_MSAN
#endif
#ifndef OPENSSL_NO_SCTP
# define OPENSSL_NO_SCTP
#endif
#ifndef OPENSSL_NO_SSL_TRACE
# define OPENSSL_NO_SSL_TRACE
#endif
#ifndef OPENSSL_NO_SSL3
# define OPENSSL_NO_SSL3
#endif
#ifndef OPENSSL_NO_SSL3_METHOD
# define OPENSSL_NO_SSL3_METHOD
#endif
#ifndef OPENSSL_NO_UBSAN
# define OPENSSL_NO_UBSAN
#endif
#ifndef OPENSSL_NO_UNIT_TEST
# define OPENSSL_NO_UNIT_TEST
#endif
#ifndef OPENSSL_NO_WEAK_SSL_CIPHERS
# define OPENSSL_NO_WEAK_SSL_CIPHERS
#endif
#ifndef OPENSSL_NO_STATIC_ENGINE
# define OPENSSL_NO_STATIC_ENGINE
#endif
/*
* Sometimes OPENSSSL_NO_xxx ends up with an empty file and some compilers
* don't like that. This will hopefully silence them.
*/
#define NON_EMPTY_TRANSLATION_UNIT static void *dummy = &dummy;
/*
* Applications should use -DOPENSSL_API_COMPAT=<version> to suppress the
* declarations of functions deprecated in or before <version>. Otherwise, they
* still won't see them if the library has been built to disable deprecated
* functions.
*/
#ifndef DECLARE_DEPRECATED
# define DECLARE_DEPRECATED(f) f;
# ifdef __GNUC__
# if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 0)
# undef DECLARE_DEPRECATED
# define DECLARE_DEPRECATED(f) f __attribute__ ((deprecated));
# endif
# elif defined(__SUNPRO_C)
# if (__SUNPRO_C >= 0x5130)
# undef DECLARE_DEPRECATED
# define DECLARE_DEPRECATED(f) f __attribute__ ((deprecated));
# endif
# endif
#endif
#ifndef OPENSSL_FILE
# ifdef OPENSSL_NO_FILENAMES
# define OPENSSL_FILE ""
# define OPENSSL_LINE 0
# else
# define OPENSSL_FILE __FILE__
# define OPENSSL_LINE __LINE__
# endif
#endif
#ifndef OPENSSL_MIN_API
# define OPENSSL_MIN_API 0
#endif
#if !defined(OPENSSL_API_COMPAT) || OPENSSL_API_COMPAT < OPENSSL_MIN_API
# undef OPENSSL_API_COMPAT
# define OPENSSL_API_COMPAT OPENSSL_MIN_API
#endif
/*
* Do not deprecate things to be deprecated in version 1.2.0 before the
* OpenSSL version number matches.
*/
#if OPENSSL_VERSION_NUMBER < 0x10200000L
# define DEPRECATEDIN_1_2_0(f) f;
#elif OPENSSL_API_COMPAT < 0x10200000L
# define DEPRECATEDIN_1_2_0(f) DECLARE_DEPRECATED(f)
#else
# define DEPRECATEDIN_1_2_0(f)
#endif
#if OPENSSL_API_COMPAT < 0x10100000L
# define DEPRECATEDIN_1_1_0(f) DECLARE_DEPRECATED(f)
#else
# define DEPRECATEDIN_1_1_0(f)
#endif
#if OPENSSL_API_COMPAT < 0x10000000L
# define DEPRECATEDIN_1_0_0(f) DECLARE_DEPRECATED(f)
#else
# define DEPRECATEDIN_1_0_0(f)
#endif
#if OPENSSL_API_COMPAT < 0x00908000L
# define DEPRECATEDIN_0_9_8(f) DECLARE_DEPRECATED(f)
#else
# define DEPRECATEDIN_0_9_8(f)
#endif
/* Generate 80386 code? */
#undef I386_ONLY
#undef OPENSSL_UNISTD
#define OPENSSL_UNISTD <unistd.h>
#undef OPENSSL_EXPORT_VAR_AS_FUNCTION
/*
* The following are cipher-specific, but are part of the public API.
*/
#if !defined(OPENSSL_SYS_UEFI)
#ifdef __LP64__
# undef BN_LLONG
/* Only one for the following should be defined */
# define SIXTY_FOUR_BIT_LONG
# undef SIXTY_FOUR_BIT
# undef THIRTY_TWO_BIT
#else
# define BN_LLONG
/* Only one for the following should be defined */
# undef SIXTY_FOUR_BIT_LONG
# undef SIXTY_FOUR_BIT
# define THIRTY_TWO_BIT
#endif
#endif
#define RC4_INT unsigned int
#ifdef __cplusplus
}
#endif
diff --git a/share/examples/FreeBSD_version/FreeBSD_version.c b/share/examples/FreeBSD_version/FreeBSD_version.c
index 036a5aeaaa20..e3f5600a857f 100644
--- a/share/examples/FreeBSD_version/FreeBSD_version.c
+++ b/share/examples/FreeBSD_version/FreeBSD_version.c
@@ -1,21 +1,20 @@
-/* $FreeBSD$ */
#if __FreeBSD__ == 0 /* 1.0 did not define __FreeBSD__ */
#define __FreeBSD_version 199401
#elif __FreeBSD__ == 1 /* 1.1 defined it to be 1 */
#define __FreeBSD_version 199405
#else /* 2.0 and higher define it to be 2 */
#include <osreldate.h> /* and this works */
#endif
#include <stdio.h>
#include <unistd.h>
int
main(void) {
printf("Compilation release date: %d\n", __FreeBSD_version);
#if __FreeBSD_version >= 199408
printf("Execution environment release date: %d\n", getosreldate());
#else
printf("Execution environment release date: can't tell\n");
#endif
return (0);
}
diff --git a/share/examples/ipfilter/l4check/l4check.c b/share/examples/ipfilter/l4check/l4check.c
index 961eeab934fd..6a77d147ce5f 100644
--- a/share/examples/ipfilter/l4check/l4check.c
+++ b/share/examples/ipfilter/l4check/l4check.c
@@ -1,801 +1,800 @@
-/* $FreeBSD$ */
/*
* (C)Copyright (C) 2012 by Darren Reed.
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <sys/ioctl.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <net/if.h>
#include <stdio.h>
#include <netdb.h>
#include <string.h>
#include <ctype.h>
#include <fcntl.h>
#include <errno.h>
#include <stdlib.h>
#include "ip_compat.h"
#include "ip_fil.h"
#include "ip_nat.h"
#include "ipf.h"
extern char *optarg;
typedef struct l4cfg {
struct l4cfg *l4_next;
struct ipnat l4_nat; /* NAT rule */
struct sockaddr_in l4_sin; /* remote socket to connect */
time_t l4_last; /* when we last connected */
int l4_alive; /* 1 = remote alive */
int l4_fd;
int l4_rw; /* 0 = reading, 1 = writing */
char *l4_rbuf; /* read buffer */
int l4_rsize; /* size of buffer */
int l4_rlen; /* how much used */
char *l4_wptr; /* next byte to write */
int l4_wlen; /* length yet to be written */
} l4cfg_t;
l4cfg_t *l4list = NULL;
char *response = NULL;
char *probe = NULL;
l4cfg_t template;
int frequency = 20;
int ctimeout = 1;
int rtimeout = 1;
size_t plen = 0;
size_t rlen = 0;
int natfd = -1;
int opts = 0;
#if defined(sun) && !defined(__svr4__) && !defined(__SVR4)
# define strerror(x) sys_errlist[x]
#endif
char *
copystr(char *dst, char *src)
{
register char *s, *t, c;
register int esc = 0;
for (s = src, t = dst; s && t && (c = *s++); )
if (esc) {
esc = 0;
switch (c)
{
case 'n' :
*t++ = '\n';
break;
case 'r' :
*t++ = '\r';
break;
case 't' :
*t++ = '\t';
break;
}
} else if (c != '\\')
*t++ = c;
else
esc = 1;
*t = '\0';
return dst;
}
void
addnat(l4cfg_t *l4)
{
ipnat_t *ipn = &l4->l4_nat;
printf("Add NAT rule for %s/%#x,%u -> ", inet_ntoa(ipn->in_out[0]),
ipn->in_outmsk, ntohs(ipn->in_pmin));
printf("%s,%u\n", inet_ntoa(ipn->in_in[0]), ntohs(ipn->in_pnext));
if (!(opts & OPT_DONOTHING)) {
if (ioctl(natfd, SIOCADNAT, &ipn) == -1)
perror("ioctl(SIOCADNAT)");
}
}
void
delnat(l4cfg_t *l4)
{
ipnat_t *ipn = &l4->l4_nat;
printf("Remove NAT rule for %s/%#x,%u -> ",
inet_ntoa(ipn->in_out[0]), ipn->in_outmsk, ipn->in_pmin);
printf("%s,%u\n", inet_ntoa(ipn->in_in[0]), ipn->in_pnext);
if (!(opts & OPT_DONOTHING)) {
if (ioctl(natfd, SIOCRMNAT, &ipn) == -1)
perror("ioctl(SIOCRMNAT)");
}
}
void
connectl4(l4cfg_t *l4)
{
l4->l4_rw = 1;
l4->l4_rlen = 0;
l4->l4_wlen = plen;
if (!l4->l4_wlen) {
l4->l4_alive = 1;
addnat(l4);
} else
l4->l4_wptr = probe;
}
void
closel4(l4cfg_t *l4, int dead)
{
close(l4->l4_fd);
l4->l4_fd = -1;
l4->l4_rw = -1;
if (dead && l4->l4_alive) {
l4->l4_alive = 0;
delnat(l4);
}
}
void
connectfd(l4cfg_t *l4)
{
if (connect(l4->l4_fd, (struct sockaddr *)&l4->l4_sin,
sizeof(l4->l4_sin)) == -1) {
if (errno == EISCONN) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "Connected fd %d\n",
l4->l4_fd);
connectl4(l4);
return;
}
if (opts & OPT_VERBOSE)
fprintf(stderr, "Connect failed fd %d: %s\n",
l4->l4_fd, strerror(errno));
closel4(l4, 1);
return;
}
l4->l4_rw = 1;
}
void
writefd(l4cfg_t *l4)
{
char buf[80], *ptr;
int n, i, fd;
fd = l4->l4_fd;
if (l4->l4_rw == -2) {
connectfd(l4);
return;
}
n = l4->l4_wlen;
i = send(fd, l4->l4_wptr, n, 0);
if (i == 0 || i == -1) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "Send on fd %d failed: %s\n",
fd, strerror(errno));
closel4(l4, 1);
} else {
l4->l4_wptr += i;
l4->l4_wlen -= i;
if (l4->l4_wlen == 0)
l4->l4_rw = 0;
if (opts & OPT_VERBOSE)
fprintf(stderr, "Sent %d bytes to fd %d\n", i, fd);
}
}
void readfd(l4cfg_t *l4)
{
char buf[80], *ptr;
int n, i, fd;
fd = l4->l4_fd;
if (l4->l4_rw == -2) {
connectfd(l4);
return;
}
if (l4->l4_rsize) {
n = l4->l4_rsize - l4->l4_rlen;
ptr = l4->l4_rbuf + l4->l4_rlen;
} else {
n = sizeof(buf) - 1;
ptr = buf;
}
if (opts & OPT_VERBOSE)
fprintf(stderr, "Read %d bytes on fd %d to %p\n",
n, fd, ptr);
i = recv(fd, ptr, n, 0);
if (i == 0 || i == -1) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "Read error on fd %d: %s\n",
fd, (i == 0) ? "EOF" : strerror(errno));
closel4(l4, 1);
} else {
if (ptr == buf)
ptr[i] = '\0';
if (opts & OPT_VERBOSE)
fprintf(stderr, "%d: Read %d bytes [%*.*s]\n",
fd, i, i, i, ptr);
if (ptr != buf) {
l4->l4_rlen += i;
if (l4->l4_rlen >= l4->l4_rsize) {
if (!strncmp(response, l4->l4_rbuf,
l4->l4_rsize)) {
printf("%d: Good response\n",
fd);
if (!l4->l4_alive) {
l4->l4_alive = 1;
addnat(l4);
}
closel4(l4, 0);
} else {
if (opts & OPT_VERBOSE)
printf("%d: Bad response\n",
fd);
closel4(l4, 1);
}
}
} else if (!l4->l4_alive) {
l4->l4_alive = 1;
addnat(l4);
closel4(l4, 0);
}
}
}
int
runconfig(void)
{
int fd, opt, res, mfd, i;
struct timeval tv;
time_t now, now1;
fd_set rfd, wfd;
l4cfg_t *l4;
mfd = 0;
opt = 1;
now = time(NULL);
/*
* First, initiate connections that are closed, as required.
*/
for (l4 = l4list; l4; l4 = l4->l4_next) {
if ((l4->l4_last + frequency < now) && (l4->l4_fd == -1)) {
l4->l4_last = now;
fd = socket(AF_INET, SOCK_STREAM, 0);
if (fd == -1)
continue;
setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &opt,
sizeof(opt));
#ifdef O_NONBLOCK
if ((res = fcntl(fd, F_GETFL, 0)) != -1)
fcntl(fd, F_SETFL, res | O_NONBLOCK);
#endif
if (opts & OPT_VERBOSE)
fprintf(stderr,
"Connecting to %s,%d (fd %d)...",
inet_ntoa(l4->l4_sin.sin_addr),
ntohs(l4->l4_sin.sin_port), fd);
if (connect(fd, (struct sockaddr *)&l4->l4_sin,
sizeof(l4->l4_sin)) == -1) {
if (errno != EINPROGRESS) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "failed\n");
perror("connect");
close(fd);
fd = -1;
} else {
if (opts & OPT_VERBOSE)
fprintf(stderr, "waiting\n");
l4->l4_rw = -2;
}
} else {
if (opts & OPT_VERBOSE)
fprintf(stderr, "connected\n");
connectl4(l4);
}
l4->l4_fd = fd;
}
}
/*
* Now look for fd's which we're expecting to read/write from.
*/
FD_ZERO(&rfd);
FD_ZERO(&wfd);
tv.tv_sec = MIN(rtimeout, ctimeout);
tv.tv_usec = 0;
for (l4 = l4list; l4; l4 = l4->l4_next)
if (l4->l4_rw == 0) {
if (now - l4->l4_last > rtimeout) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "%d: Read timeout\n",
l4->l4_fd);
closel4(l4, 1);
continue;
}
if (opts & OPT_VERBOSE)
fprintf(stderr, "Wait for read on fd %d\n",
l4->l4_fd);
FD_SET(l4->l4_fd, &rfd);
if (l4->l4_fd > mfd)
mfd = l4->l4_fd;
} else if ((l4->l4_rw == 1 && l4->l4_wlen) ||
l4->l4_rw == -2) {
if ((l4->l4_rw == -2) &&
(now - l4->l4_last > ctimeout)) {
if (opts & OPT_VERBOSE)
fprintf(stderr,
"%d: connect timeout\n",
l4->l4_fd);
closel4(l4);
continue;
}
if (opts & OPT_VERBOSE)
fprintf(stderr, "Wait for write on fd %d\n",
l4->l4_fd);
FD_SET(l4->l4_fd, &wfd);
if (l4->l4_fd > mfd)
mfd = l4->l4_fd;
}
if (opts & OPT_VERBOSE)
fprintf(stderr, "Select: max fd %d wait %d\n", mfd + 1,
tv.tv_sec);
i = select(mfd + 1, &rfd, &wfd, NULL, &tv);
if (i == -1) {
perror("select");
return -1;
}
now1 = time(NULL);
for (l4 = l4list; (i > 0) && l4; l4 = l4->l4_next) {
if (l4->l4_fd < 0)
continue;
if (FD_ISSET(l4->l4_fd, &rfd)) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "Ready to read on fd %d\n",
l4->l4_fd);
readfd(l4);
i--;
}
if ((l4->l4_fd >= 0) && FD_ISSET(l4->l4_fd, &wfd)) {
if (opts & OPT_VERBOSE)
fprintf(stderr, "Ready to write on fd %d\n",
l4->l4_fd);
writefd(l4);
i--;
}
}
return 0;
}
int
gethostport(char *str, int lnum, u_32_t *ipp, u_short *portp)
{
struct servent *sp;
struct hostent *hp;
char *host, *port;
struct in_addr ip;
host = str;
port = strchr(host, ',');
if (port)
*port++ = '\0';
#ifdef HAVE_INET_ATON
if (ISDIGIT(*host) && inet_aton(host, &ip))
*ipp = ip.s_addr;
#else
if (ISDIGIT(*host))
*ipp = inet_addr(host);
#endif
else {
if (!(hp = gethostbyname(host))) {
fprintf(stderr, "%d: can't resolve hostname: %s\n",
lnum, host);
return 0;
}
*ipp = *(u_32_t *)hp->h_addr;
}
if (port) {
if (ISDIGIT(*port))
*portp = htons(atoi(port));
else {
sp = getservbyname(port, "tcp");
if (sp)
*portp = sp->s_port;
else {
fprintf(stderr, "%d: unknown service %s\n",
lnum, port);
return 0;
}
}
} else
*portp = 0;
return 1;
}
char *
mapfile(char *file, size_t *sizep)
{
struct stat sb;
caddr_t addr;
int fd;
fd = open(file, O_RDONLY);
if (fd == -1) {
perror("open(mapfile)");
return NULL;
}
if (fstat(fd, &sb) == -1) {
perror("fstat(mapfile)");
close(fd);
return NULL;
}
addr = mmap(NULL, sb.st_size, PROT_READ, MAP_SHARED, fd, 0);
if (addr == (caddr_t)-1) {
perror("mmap(mapfile)");
close(fd);
return NULL;
}
close(fd);
*sizep = sb.st_size;
return (char *)addr;
}
int
readconfig(char *filename)
{
char c, buf[512], *s, *t, *errtxt = NULL, *line;
int num, err = 0;
ipnat_t *ipn;
l4cfg_t *l4;
FILE *fp;
fp = fopen(filename, "r");
if (!fp) {
perror("open(configfile)");
return -1;
}
bzero((char *)&template, sizeof(template));
template.l4_fd = -1;
template.l4_rw = -1;
template.l4_sin.sin_family = AF_INET;
ipn = &template.l4_nat;
ipn->in_flags = IPN_TCP|IPN_ROUNDR;
ipn->in_redir = NAT_REDIRECT;
for (num = 1; fgets(buf, sizeof(buf), fp); num++) {
s = strchr(buf, '\n');
if (!s) {
fprintf(stderr, "%d: line too long\n", num);
fclose(fp);
return -1;
}
*s = '\0';
/*
* lines which are comments
*/
s = strchr(buf, '#');
if (s)
*s = '\0';
/*
* Skip leading whitespace
*/
for (line = buf; (c = *line) && ISSPACE(c); line++)
;
if (!*line)
continue;
if (opts & OPT_VERBOSE)
fprintf(stderr, "Parsing: [%s]\n", line);
t = strtok(line, " \t");
if (!t)
continue;
if (!strcasecmp(t, "interface")) {
s = strtok(NULL, " \t");
if (s)
t = strtok(NULL, "\t");
if (!s || !t) {
errtxt = line;
err = -1;
break;
}
if (!strchr(t, ',')) {
fprintf(stderr,
"%d: local address,port missing\n",
num);
err = -1;
break;
}
strncpy(ipn->in_ifname, s, sizeof(ipn->in_ifname));
if (!gethostport(t, num, &ipn->in_outip,
&ipn->in_pmin)) {
errtxt = line;
err = -1;
break;
}
ipn->in_outmsk = 0xffffffff;
ipn->in_pmax = ipn->in_pmin;
if (opts & OPT_VERBOSE)
fprintf(stderr,
"Interface %s %s/%#x port %u\n",
ipn->in_ifname,
inet_ntoa(ipn->in_out[0]),
ipn->in_outmsk, ipn->in_pmin);
} else if (!strcasecmp(t, "remote")) {
if (!*ipn->in_ifname) {
fprintf(stderr,
"%d: ifname not set prior to remote\n",
num);
err = -1;
break;
}
s = strtok(NULL, " \t");
if (s)
t = strtok(NULL, "");
if (!s || !t || strcasecmp(s, "server")) {
errtxt = line;
err = -1;
break;
}
ipn->in_pnext = 0;
if (!gethostport(t, num, &ipn->in_inip,
&ipn->in_pnext)) {
errtxt = line;
err = -1;
break;
}
ipn->in_inmsk = 0xffffffff;
if (ipn->in_pnext == 0)
ipn->in_pnext = ipn->in_pmin;
l4 = (l4cfg_t *)malloc(sizeof(*l4));
if (!l4) {
fprintf(stderr, "%d: out of memory (%d)\n",
num, sizeof(*l4));
err = -1;
break;
}
bcopy((char *)&template, (char *)l4, sizeof(*l4));
l4->l4_sin.sin_addr = ipn->in_in[0];
l4->l4_sin.sin_port = ipn->in_pnext;
l4->l4_next = l4list;
l4list = l4;
} else if (!strcasecmp(t, "connect")) {
s = strtok(NULL, " \t");
if (s)
t = strtok(NULL, "\t");
if (!s || !t) {
errtxt = line;
err = -1;
break;
} else if (!strcasecmp(s, "timeout")) {
ctimeout = atoi(t);
if (opts & OPT_VERBOSE)
fprintf(stderr, "connect timeout %d\n",
ctimeout);
} else if (!strcasecmp(s, "frequency")) {
frequency = atoi(t);
if (opts & OPT_VERBOSE)
fprintf(stderr,
"connect frequency %d\n",
frequency);
} else {
errtxt = line;
err = -1;
break;
}
} else if (!strcasecmp(t, "probe")) {
s = strtok(NULL, " \t");
if (!s) {
errtxt = line;
err = -1;
break;
} else if (!strcasecmp(s, "string")) {
if (probe) {
fprintf(stderr,
"%d: probe already set\n",
num);
err = -1;
break;
}
t = strtok(NULL, "");
if (!t) {
fprintf(stderr,
"%d: No probe string\n", num);
err = -1;
break;
}
probe = malloc(strlen(t));
copystr(probe, t);
plen = strlen(probe);
if (opts & OPT_VERBOSE)
fprintf(stderr, "Probe string [%s]\n",
probe);
} else if (!strcasecmp(s, "file")) {
t = strtok(NULL, " \t");
if (!t) {
errtxt = line;
err = -1;
break;
}
if (probe) {
fprintf(stderr,
"%d: probe already set\n",
num);
err = -1;
break;
}
probe = mapfile(t, &plen);
if (opts & OPT_VERBOSE)
fprintf(stderr,
"Probe file %s len %u@%p\n",
t, plen, probe);
}
} else if (!strcasecmp(t, "response")) {
s = strtok(NULL, " \t");
if (!s) {
errtxt = line;
err = -1;
break;
} else if (!strcasecmp(s, "timeout")) {
t = strtok(NULL, " \t");
if (!t) {
errtxt = line;
err = -1;
break;
}
rtimeout = atoi(t);
if (opts & OPT_VERBOSE)
fprintf(stderr,
"response timeout %d\n",
rtimeout);
} else if (!strcasecmp(s, "string")) {
if (response) {
fprintf(stderr,
"%d: response already set\n",
num);
err = -1;
break;
}
response = strdup(strtok(NULL, ""));
rlen = strlen(response);
template.l4_rsize = rlen;
template.l4_rbuf = malloc(rlen);
if (opts & OPT_VERBOSE)
fprintf(stderr,
"Response string [%s]\n",
response);
} else if (!strcasecmp(s, "file")) {
t = strtok(NULL, " \t");
if (!t) {
errtxt = line;
err = -1;
break;
}
if (response) {
fprintf(stderr,
"%d: response already set\n",
num);
err = -1;
break;
}
response = mapfile(t, &rlen);
template.l4_rsize = rlen;
template.l4_rbuf = malloc(rlen);
if (opts & OPT_VERBOSE)
fprintf(stderr,
"Response file %s len %u@%p\n",
t, rlen, response);
}
} else {
errtxt = line;
err = -1;
break;
}
}
if (errtxt)
fprintf(stderr, "%d: syntax error at \"%s\"\n", num, errtxt);
fclose(fp);
return err;
}
void
usage(char *prog)
{
fprintf(stderr, "Usage: %s -f <configfile>\n", prog);
exit(1);
}
int
main(int argc, char *argv[])
{
char *config = NULL;
int c;
while ((c = getopt(argc, argv, "f:nv")) != -1)
switch (c)
{
case 'f' :
config = optarg;
break;
case 'n' :
opts |= OPT_DONOTHING;
break;
case 'v' :
opts |= OPT_VERBOSE;
break;
}
if (config == NULL)
usage(argv[0]);
if (readconfig(config))
exit(1);
if (!l4list) {
fprintf(stderr, "No remote servers, exiting.");
exit(1);
}
if (!(opts & OPT_DONOTHING)) {
natfd = open(IPL_NAT, O_RDWR);
if (natfd == -1) {
perror("open(IPL_NAT)");
exit(1);
}
}
if (opts & OPT_VERBOSE)
fprintf(stderr, "Starting...\n");
while (runconfig() == 0)
;
}
diff --git a/share/examples/ipfilter/mlfk_rule.c b/share/examples/ipfilter/mlfk_rule.c
index 9f951cf6c31d..0858f21c4241 100644
--- a/share/examples/ipfilter/mlfk_rule.c
+++ b/share/examples/ipfilter/mlfk_rule.c
@@ -1,70 +1,69 @@
-/* $FreeBSD$ */
/*
* Copyright (C) 2012 by Darren Reed.
*
* See the IPFILTER.LICENCE file for details on licencing.
*
* $Id$
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/module.h>
#include <sys/conf.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <net/if.h>
#include <netinet/in_systm.h>
#include <netinet/in.h>
#include <netinet/ipl.h>
#include <netinet/ip_compat.h>
#include <netinet/ip_fil.h>
#include <netinet/ip_state.h>
#include <netinet/ip_nat.h>
#include <netinet/ip_auth.h>
#include <netinet/ip_frag.h>
#include "ip_rules.h"
extern ipf_main_softc_t ipfmain;
static int
ipfrule_modevent(module_t mod, int type, void *unused)
{
int error = 0;
switch (type)
{
case MOD_LOAD :
error = ipfrule_add();
if (!error)
ipfmain.ipf_refcnt++;
break;
case MOD_UNLOAD :
error = ipfrule_remove();
if (!error)
ipfmain.ipf_refcnt--;
break;
default:
error = EINVAL;
break;
}
return error;
}
static moduledata_t ipfrulemod = {
"ipfrule",
ipfrule_modevent,
0
};
DECLARE_MODULE(ipfrule, ipfrulemod, SI_SUB_PROTO_DOMAIN, SI_ORDER_ANY);
#ifdef MODULE_DEPEND
MODULE_DEPEND(ipfrule, ipfilter, 1, 1, 1);
#endif
#ifdef MODULE_VERSION
MODULE_VERSION(ipfrule, 1);
#endif
diff --git a/share/examples/ipfilter/samples/proxy.c b/share/examples/ipfilter/samples/proxy.c
index 483c4b5d768a..7f5949b519be 100644
--- a/share/examples/ipfilter/samples/proxy.c
+++ b/share/examples/ipfilter/samples/proxy.c
@@ -1,317 +1,316 @@
-/* $FreeBSD$ */
/*
* Sample transparent proxy program.
*
* Sample implementation of a program which intercepts a TCP connectiona and
* just echos all data back to the origin. Written to work via inetd as a
* "nonwait" program running as root; ie.
* tcpmux stream tcp nowait root /usr/local/bin/proxy proxy
* with a NAT rue like this:
* rdr smc0 0/0 port 80 -> 127.0.0.1/32 port 1
*/
#include <stdio.h>
#include <string.h>
#include <fcntl.h>
#include <syslog.h>
#if !defined(__SVR4) && !defined(__svr4__)
#include <strings.h>
#else
#include <sys/byteorder.h>
#endif
#include <sys/types.h>
#include <sys/time.h>
#include <sys/param.h>
#include <stdlib.h>
#include <unistd.h>
#include <stddef.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#if defined(sun) && (defined(__svr4__) || defined(__SVR4))
# include <sys/ioccom.h>
# include <sys/sysmacros.h>
#endif
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/ip.h>
#include <netinet/tcp.h>
#include <net/if.h>
#include <netdb.h>
#include <arpa/nameser.h>
#include <arpa/inet.h>
#include <resolv.h>
#include <ctype.h>
#include "netinet/ip_compat.h"
#include "netinet/ip_fil.h"
#include "netinet/ip_nat.h"
#include "netinet/ip_state.h"
#include "netinet/ip_proxy.h"
#include "netinet/ip_nat.h"
#include "netinet/ipl.h"
main(argc, argv)
int argc;
char *argv[];
{
struct sockaddr_in sin, sloc, sout;
ipfobj_t obj;
natlookup_t natlook;
char buffer[512];
int namelen, fd, n;
/*
* get IP# and port # of the remote end of the connection (at the
* origin).
*/
namelen = sizeof(sin);
if (getpeername(0, (struct sockaddr *)&sin, &namelen) == -1) {
perror("getpeername");
exit(-1);
}
/*
* get IP# and port # of the local end of the connection (at the
* man-in-the-middle).
*/
namelen = sizeof(sin);
if (getsockname(0, (struct sockaddr *)&sloc, &namelen) == -1) {
perror("getsockname");
exit(-1);
}
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(natlook);
obj.ipfo_ptr = &natlook;
obj.ipfo_type = IPFOBJ_NATLOOKUP;
/*
* Build up the NAT natlookup structure.
*/
bzero((char *)&natlook, sizeof(natlook));
natlook.nl_outip = sin.sin_addr;
natlook.nl_inip = sloc.sin_addr;
natlook.nl_flags = IPN_TCP;
natlook.nl_outport = sin.sin_port;
natlook.nl_inport = sloc.sin_port;
/*
* Open the NAT device and lookup the mapping pair.
*/
fd = open(IPNAT_NAME, O_RDONLY);
if (ioctl(fd, SIOCGNATL, &obj) == -1) {
perror("ioctl(SIOCGNATL)");
exit(-1);
}
#define DO_NAT_OUT
#ifdef DO_NAT_OUT
if (argc > 1)
do_nat_out(0, 1, fd, &natlook, argv[1]);
#else
/*
* Log it
*/
syslog(LOG_DAEMON|LOG_INFO, "connect to %s,%d",
inet_ntoa(natlook.nl_realip), ntohs(natlook.nl_realport));
printf("connect to %s,%d\n",
inet_ntoa(natlook.nl_realip), ntohs(natlook.nl_realport));
/*
* Just echo data read in from stdin to stdout
*/
while ((n = read(0, buffer, sizeof(buffer))) > 0)
if (write(1, buffer, n) != n)
break;
close(0);
#endif
}
#ifdef DO_NAT_OUT
do_nat_out(in, out, fd, nlp, extif)
int fd;
natlookup_t *nlp;
char *extif;
{
nat_save_t ns, *nsp = &ns;
struct sockaddr_in usin;
u_32_t sum1, sum2, sumd;
int onoff, ofd, slen;
ipfobj_t obj;
ipnat_t *ipn;
nat_t *nat;
bzero((char *)&ns, sizeof(ns));
nat = &ns.ipn_nat;
nat->nat_p = IPPROTO_TCP;
nat->nat_dir = NAT_OUTBOUND;
if ((extif != NULL) && (*extif != '\0')) {
strncpy(nat->nat_ifnames[0], extif,
sizeof(nat->nat_ifnames[0]));
strncpy(nat->nat_ifnames[1], extif,
sizeof(nat->nat_ifnames[1]));
nat->nat_ifnames[0][sizeof(nat->nat_ifnames[0]) - 1] = '\0';
nat->nat_ifnames[1][sizeof(nat->nat_ifnames[1]) - 1] = '\0';
}
ofd = socket(AF_INET, SOCK_DGRAM, 0);
bzero((char *)&usin, sizeof(usin));
usin.sin_family = AF_INET;
usin.sin_addr = nlp->nl_realip;
usin.sin_port = nlp->nl_realport;
(void) connect(ofd, (struct sockaddr *)&usin, sizeof(usin));
slen = sizeof(usin);
(void) getsockname(ofd, (struct sockaddr *)&usin, &slen);
close(ofd);
printf("local IP# to use: %s\n", inet_ntoa(usin.sin_addr));
if ((ofd = socket(AF_INET, SOCK_STREAM, 0)) == -1)
perror("socket");
usin.sin_port = 0;
if (bind(ofd, (struct sockaddr *)&usin, sizeof(usin)))
perror("bind");
slen = sizeof(usin);
if (getsockname(ofd, (struct sockaddr *)&usin, &slen))
perror("getsockname");
printf("local port# to use: %d\n", ntohs(usin.sin_port));
nat->nat_inip = usin.sin_addr;
nat->nat_outip = nlp->nl_outip;
nat->nat_oip = nlp->nl_realip;
sum1 = LONG_SUM(ntohl(usin.sin_addr.s_addr)) + ntohs(usin.sin_port);
sum2 = LONG_SUM(ntohl(nat->nat_outip.s_addr)) + ntohs(nlp->nl_outport);
CALC_SUMD(sum1, sum2, sumd);
nat->nat_sumd[0] = (sumd & 0xffff) + (sumd >> 16);
nat->nat_sumd[1] = nat->nat_sumd[0];
sum1 = LONG_SUM(ntohl(usin.sin_addr.s_addr));
sum2 = LONG_SUM(ntohl(nat->nat_outip.s_addr));
CALC_SUMD(sum1, sum2, sumd);
nat->nat_ipsumd = (sumd & 0xffff) + (sumd >> 16);
nat->nat_inport = usin.sin_port;
nat->nat_outport = nlp->nl_outport;
nat->nat_oport = nlp->nl_realport;
nat->nat_flags = IPN_TCPUDP;
bzero((char *)&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(*nsp);
obj.ipfo_ptr = nsp;
obj.ipfo_type = IPFOBJ_NATSAVE;
onoff = 1;
if (ioctl(fd, SIOCSTLCK, &onoff) == 0) {
if (ioctl(fd, SIOCSTPUT, &obj) != 0)
perror("SIOCSTPUT");
onoff = 0;
if (ioctl(fd, SIOCSTLCK, &onoff) != 0)
perror("SIOCSTLCK");
}
usin.sin_addr = nlp->nl_realip;
usin.sin_port = nlp->nl_realport;
printf("remote end for connection: %s,%d\n", inet_ntoa(usin.sin_addr),
ntohs(usin.sin_port));
fflush(stdout);
if (connect(ofd, (struct sockaddr *)&usin, sizeof(usin)))
perror("connect");
relay(in, out, ofd);
}
relay(in, out, net)
int in, out, net;
{
char netbuf[1024], outbuf[1024];
char *nwptr, *nrptr, *owptr, *orptr;
size_t nsz, osz;
fd_set rd, wr;
int i, n, maxfd;
n = 0;
maxfd = in;
if (out > maxfd)
maxfd = out;
if (net > maxfd)
maxfd = net;
nrptr = netbuf;
nwptr = netbuf;
nsz = sizeof(netbuf);
orptr = outbuf;
owptr = outbuf;
osz = sizeof(outbuf);
while (n >= 0) {
FD_ZERO(&rd);
FD_ZERO(&wr);
if (nrptr - netbuf < sizeof(netbuf))
FD_SET(in, &rd);
if (orptr - outbuf < sizeof(outbuf))
FD_SET(net, &rd);
if (nsz < sizeof(netbuf))
FD_SET(net, &wr);
if (osz < sizeof(outbuf))
FD_SET(out, &wr);
n = select(maxfd + 1, &rd, &wr, NULL, NULL);
if ((n > 0) && FD_ISSET(in, &rd)) {
i = read(in, nrptr, sizeof(netbuf) - (nrptr - netbuf));
if (i <= 0)
break;
nsz -= i;
nrptr += i;
n--;
}
if ((n > 0) && FD_ISSET(net, &rd)) {
i = read(net, orptr, sizeof(outbuf) - (orptr - outbuf));
if (i <= 0)
break;
osz -= i;
orptr += i;
n--;
}
if ((n > 0) && FD_ISSET(out, &wr)) {
i = write(out, owptr, orptr - owptr);
if (i <= 0)
break;
osz += i;
if (osz == sizeof(outbuf) || owptr == orptr) {
orptr = outbuf;
owptr = outbuf;
} else
owptr += i;
n--;
}
if ((n > 0) && FD_ISSET(net, &wr)) {
i = write(net, nwptr, nrptr - nwptr);
if (i <= 0)
break;
nsz += i;
if (nsz == sizeof(netbuf) || nwptr == nrptr) {
nrptr = netbuf;
nwptr = netbuf;
} else
nwptr += i;
}
}
close(net);
close(out);
close(in);
}
#endif
diff --git a/share/examples/ipfilter/samples/relay.c b/share/examples/ipfilter/samples/relay.c
index 11b76b07c509..3d53fd7386ef 100644
--- a/share/examples/ipfilter/samples/relay.c
+++ b/share/examples/ipfilter/samples/relay.c
@@ -1,196 +1,195 @@
-/* $FreeBSD$ */
/*
* Sample program to be used as a transparent proxy.
*
* Must be executed with permission enough to do an ioctl on /dev/ipl
* or equivalent. This is just a sample and is only alpha quality.
* - Darren Reed (8 April 1996)
*/
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/syslog.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <netinet/in.h>
#include <net/if.h>
#include "netinet/ip_compat.h"
#include "netinet/ip_fil.h"
#include "netinet/ip_nat.h"
#include "netinet/ipl.h"
#define RELAY_BUFSZ 8192
char ibuff[RELAY_BUFSZ];
char obuff[RELAY_BUFSZ];
int relay(ifd, ofd, rfd)
int ifd, ofd, rfd;
{
fd_set rfds, wfds;
char *irh, *irt, *rrh, *rrt;
char *iwh, *iwt, *rwh, *rwt;
int nfd, n, rw;
irh = irt = ibuff;
iwh = iwt = obuff;
nfd = ifd;
if (nfd < ofd)
nfd = ofd;
if (nfd < rfd)
nfd = rfd;
while (1) {
FD_ZERO(&rfds);
FD_ZERO(&wfds);
if (irh > irt)
FD_SET(rfd, &wfds);
if (irh < (ibuff + RELAY_BUFSZ))
FD_SET(ifd, &rfds);
if (iwh > iwt)
FD_SET(ofd, &wfds);
if (iwh < (obuff + RELAY_BUFSZ))
FD_SET(rfd, &rfds);
switch ((n = select(nfd + 1, &rfds, &wfds, NULL, NULL)))
{
case -1 :
case 0 :
return -1;
default :
if (FD_ISSET(ifd, &rfds)) {
rw = read(ifd, irh, ibuff + RELAY_BUFSZ - irh);
if (rw == -1)
return -1;
if (rw == 0)
return 0;
irh += rw;
n--;
}
if (n && FD_ISSET(ofd, &wfds)) {
rw = write(ofd, iwt, iwh - iwt);
if (rw == -1)
return -1;
iwt += rw;
n--;
}
if (n && FD_ISSET(rfd, &rfds)) {
rw = read(rfd, iwh, obuff + RELAY_BUFSZ - iwh);
if (rw == -1)
return -1;
if (rw == 0)
return 0;
iwh += rw;
n--;
}
if (n && FD_ISSET(rfd, &wfds)) {
rw = write(rfd, irt, irh - irt);
if (rw == -1)
return -1;
irt += rw;
n--;
}
if (irh == irt)
irh = irt = ibuff;
if (iwh == iwt)
iwh = iwt = obuff;
}
}
}
main(argc, argv)
int argc;
char *argv[];
{
struct sockaddr_in sin;
ipfobj_t obj;
natlookup_t nl;
natlookup_t *nlp = &nl;
int fd, sl = sizeof(sl), se;
openlog(argv[0], LOG_PID|LOG_NDELAY, LOG_DAEMON);
if ((fd = open(IPNAT_NAME, O_RDONLY)) == -1) {
se = errno;
perror("open");
errno = se;
syslog(LOG_ERR, "open: %m\n");
exit(-1);
}
bzero(&obj, sizeof(obj));
obj.ipfo_rev = IPFILTER_VERSION;
obj.ipfo_size = sizeof(nl);
obj.ipfo_ptr = &nl;
obj.ipfo_type = IPFOBJ_NATLOOKUP;
bzero(&nl, sizeof(nl));
nl.nl_flags = IPN_TCP;
bzero(&sin, sizeof(sin));
sin.sin_family = AF_INET;
sl = sizeof(sin);
if (getsockname(0, (struct sockaddr *)&sin, &sl) == -1) {
se = errno;
perror("getsockname");
errno = se;
syslog(LOG_ERR, "getsockname: %m\n");
exit(-1);
} else {
nl.nl_inip.s_addr = sin.sin_addr.s_addr;
nl.nl_inport = sin.sin_port;
}
bzero(&sin, sizeof(sin));
sin.sin_family = AF_INET;
sl = sizeof(sin);
if (getpeername(0, (struct sockaddr *)&sin, &sl) == -1) {
se = errno;
perror("getpeername");
errno = se;
syslog(LOG_ERR, "getpeername: %m\n");
exit(-1);
} else {
nl.nl_outip.s_addr = sin.sin_addr.s_addr;
nl.nl_outport = sin.sin_port;
}
if (ioctl(fd, SIOCGNATL, &obj) == -1) {
se = errno;
perror("ioctl");
errno = se;
syslog(LOG_ERR, "ioctl: %m\n");
exit(-1);
}
sin.sin_port = nl.nl_realport;
sin.sin_addr = nl.nl_realip;
sl = sizeof(sin);
fd = socket(AF_INET, SOCK_STREAM, 0);
if (connect(fd, (struct sockaddr *)&sin, sl) == -1) {
se = errno;
perror("connect");
errno = se;
syslog(LOG_ERR, "connect: %m\n");
exit(-1);
}
(void) ioctl(fd, F_SETFL, ioctl(fd, F_GETFL, 0)|O_NONBLOCK);
(void) ioctl(0, F_SETFL, ioctl(fd, F_GETFL, 0)|O_NONBLOCK);
(void) ioctl(1, F_SETFL, ioctl(fd, F_GETFL, 0)|O_NONBLOCK);
syslog(LOG_NOTICE, "connected to %s,%d\n", inet_ntoa(sin.sin_addr),
ntohs(sin.sin_port));
if (relay(0, 1, fd) == -1) {
se = errno;
perror("relay");
errno = se;
syslog(LOG_ERR, "relay: %m\n");
exit(-1);
}
exit(0);
}
diff --git a/share/examples/ipfilter/samples/userauth.c b/share/examples/ipfilter/samples/userauth.c
index 620bd7220057..cc733a715322 100644
--- a/share/examples/ipfilter/samples/userauth.c
+++ b/share/examples/ipfilter/samples/userauth.c
@@ -1,62 +1,61 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/socket.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <stdio.h>
#include <stdlib.h>
#include <netinet/in.h>
#include <net/if.h>
#include "ip_compat.h"
#include "ip_fil.h"
#include "ip_auth.h"
extern int errno;
main()
{
struct frauth fra;
struct frauth *frap = &fra;
fr_info_t *fin = &fra.fra_info;
fr_ip_t *fi = &fin->fin_fi;
char yn[16];
int fd;
fd = open(IPL_NAME, O_RDWR);
fra.fra_len = 0;
fra.fra_buf = NULL;
while (ioctl(fd, SIOCAUTHW, &frap) == 0) {
if (fra.fra_info.fin_out)
fra.fra_pass = FR_OUTQUE;
else
fra.fra_pass = FR_INQUE;
printf("%s ", inet_ntoa(fi->fi_src));
if (fi->fi_flx & FI_TCPUDP)
printf("port %d ", fin->fin_data[0]);
printf("-> %s ", inet_ntoa(fi->fi_dst));
if (fi->fi_flx & FI_TCPUDP)
printf("port %d ", fin->fin_data[1]);
printf("\n");
printf("Allow packet through ? [y/n]");
fflush(stdout);
if (!fgets(yn, sizeof(yn), stdin))
break;
fflush(stdin);
if (yn[0] == 'n' || yn[0] == 'N')
fra.fra_pass |= FR_BLOCK;
else if (yn[0] == 'y' || yn[0] == 'Y') {
fra.fra_pass |= FR_PASS;
if (fra.fra_info.fin_fi.fi_flx & FI_TCPUDP)
fra.fra_pass |= FR_KEEPSTATE;
} else
fra.fra_pass |= FR_NOMATCH;
printf("answer = %c (%x), id %d idx %d\n", yn[0],
fra.fra_pass, fra.fra_info.fin_id, fra.fra_index);
if (ioctl(fd, SIOCAUTHR, &frap) != 0)
perror("SIOCAUTHR");
}
fprintf(stderr, "errno=%d \n", errno);
perror("frauth-SIOCAUTHW");
}
diff --git a/share/examples/ses/srcs/chpmon.c b/share/examples/ses/srcs/chpmon.c
index cb78f062f354..40574e16cf0f 100644
--- a/share/examples/ses/srcs/chpmon.c
+++ b/share/examples/ses/srcs/chpmon.c
@@ -1,126 +1,125 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
#include <sys/ioctl.h>
#include "ses.h"
/*
* Continuously monitor all named SES devices
* and turn all but INFO enclosure status
* values into CRITICAL enclosure status.
*/
#define BADSTAT \
(SES_ENCSTAT_UNRECOV|SES_ENCSTAT_CRITICAL|SES_ENCSTAT_NONCRITICAL)
int
main(int a, char **v)
{
int fd, delay, dev;
ses_encstat stat, *carray;
if (a < 3) {
fprintf(stderr, "usage: %s polling-interval device "
"[ device ... ]\n", *v);
return (1);
}
delay = atoi(v[1]);
carray = malloc(a);
if (carray == NULL) {
perror("malloc");
return (1);
}
bzero((void *)carray, a);
for (;;) {
for (dev = 2; dev < a; dev++) {
fd = open(v[dev], O_RDWR);
if (fd < 0) {
perror(v[dev]);
continue;
}
/*
* First clear any enclosure status, in case it is
* a latched status.
*/
stat = 0;
if (ioctl(fd, SESIOC_SETENCSTAT, (caddr_t) &stat) < 0) {
fprintf(stderr, "%s: SESIOC_SETENCSTAT1: %s\n",
v[dev], strerror(errno));
(void) close(fd);
continue;
}
/*
* Now get the actual current enclosure status.
*/
if (ioctl(fd, SESIOC_GETENCSTAT, (caddr_t) &stat) < 0) {
fprintf(stderr, "%s: SESIOC_GETENCSTAT: %s\n",
v[dev], strerror(errno));
(void) close(fd);
continue;
}
if ((stat & BADSTAT) == 0) {
if (carray[dev]) {
fprintf(stdout, "%s: Clearing CRITICAL "
"condition\n", v[dev]);
carray[dev] = 0;
}
(void) close(fd);
continue;
}
carray[dev] = 1;
fprintf(stdout, "%s: Setting CRITICAL from:", v[dev]);
if (stat & SES_ENCSTAT_UNRECOV)
fprintf(stdout, " UNRECOVERABLE");
if (stat & SES_ENCSTAT_CRITICAL)
fprintf(stdout, " CRITICAL");
if (stat & SES_ENCSTAT_NONCRITICAL)
fprintf(stdout, " NONCRITICAL");
putchar('\n');
stat = SES_ENCSTAT_CRITICAL;
if (ioctl(fd, SESIOC_SETENCSTAT, (caddr_t) &stat) < 0) {
fprintf(stderr, "%s: SESIOC_SETENCSTAT 2: %s\n",
v[dev], strerror(errno));
}
(void) close(fd);
}
sleep(delay);
}
/* NOTREACHED */
}
diff --git a/share/examples/ses/srcs/eltsub.c b/share/examples/ses/srcs/eltsub.c
index 0dfded94a583..4173eba4997f 100644
--- a/share/examples/ses/srcs/eltsub.c
+++ b/share/examples/ses/srcs/eltsub.c
@@ -1,190 +1,189 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_enc.h>
#include "eltsub.h"
char *
geteltnm(int type)
{
static char rbuf[132];
switch (type) {
case ELMTYP_UNSPECIFIED:
sprintf(rbuf, "Unspecified");
break;
case ELMTYP_DEVICE:
sprintf(rbuf, "Device Slot");
break;
case ELMTYP_POWER:
sprintf(rbuf, "Power Supply");
break;
case ELMTYP_FAN:
sprintf(rbuf, "Cooling");
break;
case ELMTYP_THERM:
sprintf(rbuf, "Temperature Sensor");
break;
case ELMTYP_DOORLOCK:
sprintf(rbuf, "Door Lock");
break;
case ELMTYP_ALARM:
sprintf(rbuf, "Audible alarm");
break;
case ELMTYP_ESCC:
sprintf(rbuf, "Enclosure Services Controller Electronics");
break;
case ELMTYP_SCC:
sprintf(rbuf, "SCC Controller Electronics");
break;
case ELMTYP_NVRAM:
sprintf(rbuf, "Nonvolatile Cache");
break;
case ELMTYP_INV_OP_REASON:
sprintf(rbuf, "Invalid Operation Reason");
break;
case ELMTYP_UPS:
sprintf(rbuf, "Uninterruptible Power Supply");
break;
case ELMTYP_DISPLAY:
sprintf(rbuf, "Display");
break;
case ELMTYP_KEYPAD:
sprintf(rbuf, "Key Pad Entry");
break;
case ELMTYP_ENCLOSURE:
sprintf(rbuf, "Enclosure");
break;
case ELMTYP_SCSIXVR:
sprintf(rbuf, "SCSI Port/Transceiver");
break;
case ELMTYP_LANGUAGE:
sprintf(rbuf, "Language");
break;
case ELMTYP_COMPORT:
sprintf(rbuf, "Communication Port");
break;
case ELMTYP_VOM:
sprintf(rbuf, "Voltage Sensor");
break;
case ELMTYP_AMMETER:
sprintf(rbuf, "Current Sensor");
break;
case ELMTYP_SCSI_TGT:
sprintf(rbuf, "SCSI Target Port");
break;
case ELMTYP_SCSI_INI:
sprintf(rbuf, "SCSI Initiator Port");
break;
case ELMTYP_SUBENC:
sprintf(rbuf, "Simple Subenclosure");
break;
case ELMTYP_ARRAY_DEV:
sprintf(rbuf, "Array Device Slot");
break;
case ELMTYP_SAS_EXP:
sprintf(rbuf, "SAS Expander");
break;
case ELMTYP_SAS_CONN:
sprintf(rbuf, "SAS Connector");
break;
default:
(void) sprintf(rbuf, "<Type 0x%x>", type);
break;
}
return (rbuf);
}
static char *
scode2ascii(u_char code)
{
static char rbuf[32];
switch (code & 0xf) {
case SES_OBJSTAT_UNSUPPORTED:
sprintf(rbuf, "Unsupported");
break;
case SES_OBJSTAT_OK:
sprintf(rbuf, "OK");
break;
case SES_OBJSTAT_CRIT:
sprintf(rbuf, "Critical");
break;
case SES_OBJSTAT_NONCRIT:
sprintf(rbuf, "Noncritical");
break;
case SES_OBJSTAT_UNRECOV:
sprintf(rbuf, "Unrecoverable");
break;
case SES_OBJSTAT_NOTINSTALLED:
sprintf(rbuf, "Not Installed");
break;
case SES_OBJSTAT_UNKNOWN:
sprintf(rbuf, "Unknown");
break;
case SES_OBJSTAT_NOTAVAIL:
sprintf(rbuf, "Not Available");
break;
case SES_OBJSTAT_NOACCESS:
sprintf(rbuf, "No Access Allowed");
break;
default:
sprintf(rbuf, "<Status 0x%x>", code & 0xf);
break;
}
return (rbuf);
}
char *
stat2ascii(int eletype __unused, u_char *cstat)
{
static char ebuf[256], *scode;
scode = scode2ascii(cstat[0]);
sprintf(ebuf, "status: %s%s%s%s (0x%02x 0x%02x 0x%02x 0x%02x)",
scode,
(cstat[0] & 0x40) ? ", Prd.Fail" : "",
(cstat[0] & 0x20) ? ", Disabled" : "",
(cstat[0] & 0x10) ? ", Swapped" : "",
cstat[0], cstat[1], cstat[2], cstat[3]);
return (ebuf);
}
diff --git a/share/examples/ses/srcs/eltsub.h b/share/examples/ses/srcs/eltsub.h
index 3d98572352e9..0623b4ac1e5c 100644
--- a/share/examples/ses/srcs/eltsub.h
+++ b/share/examples/ses/srcs/eltsub.h
@@ -1,36 +1,35 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
char * geteltnm(int);
char * stat2ascii(int, u_char *);
diff --git a/share/examples/ses/srcs/getencstat.c b/share/examples/ses/srcs/getencstat.c
index 7cdde90dc74b..55a7a0e8edc4 100644
--- a/share/examples/ses/srcs/getencstat.c
+++ b/share/examples/ses/srcs/getencstat.c
@@ -1,196 +1,195 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sys/ioctl.h>
#include <fcntl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_enc.h>
#include "eltsub.h"
int
main(int a, char **v)
{
encioc_string_t stri;
encioc_element_t *objp;
encioc_elm_status_t ob;
encioc_elm_desc_t objd;
encioc_elm_devnames_t objdn;
int fd, nobj, f, i, verbose, quiet, errors;
u_char estat;
char str[32];
if (a < 2) {
fprintf(stderr, "usage: %s [ -v ] device [ device ... ]\n", *v);
return (1);
}
errors = quiet = verbose = 0;
if (strcmp(v[1], "-V") == 0) {
verbose = 2;
v++;
} else if (strcmp(v[1], "-v") == 0) {
verbose = 1;
v++;
} else if (strcmp(v[1], "-q") == 0) {
quiet = 1;
verbose = 0;
v++;
}
while (*++v) {
fd = open(*v, O_RDONLY);
if (fd < 0) {
perror(*v);
continue;
}
if (verbose > 1) {
stri.bufsiz = sizeof(str);
stri.buf = &str[0];
if (ioctl(fd, ENCIOC_GETENCNAME, (caddr_t) &stri) == 0)
printf("%s: Enclosure Name: %s\n", *v, stri.buf);
stri.bufsiz = sizeof(str);
stri.buf = &str[0];
if (ioctl(fd, ENCIOC_GETENCID, (caddr_t) &stri) == 0)
printf("%s: Enclosure ID: %s\n", *v, stri.buf);
}
if (ioctl(fd, ENCIOC_GETNELM, (caddr_t) &nobj) < 0) {
perror("ENCIOC_GETNELM");
(void) close(fd);
continue;
}
if (ioctl(fd, ENCIOC_GETENCSTAT, (caddr_t) &estat) < 0) {
perror("ENCIOC_GETENCSTAT");
(void) close(fd);
continue;
}
if ((verbose == 0 || quiet == 1) && estat == 0) {
if (quiet == 0)
fprintf(stdout, "%s: Enclosure OK\n", *v);
(void) close(fd);
continue;
}
fprintf(stdout, "%s: Enclosure Status ", *v);
if (estat == 0) {
fprintf(stdout, "<OK");
} else {
errors++;
f = '<';
if (estat & SES_ENCSTAT_INFO) {
fprintf(stdout, "%cINFO", f);
f = ',';
}
if (estat & SES_ENCSTAT_NONCRITICAL) {
fprintf(stdout, "%cNONCRITICAL", f);
f = ',';
}
if (estat & SES_ENCSTAT_CRITICAL) {
fprintf(stdout, "%cCRITICAL", f);
f = ',';
}
if (estat & SES_ENCSTAT_UNRECOV) {
fprintf(stdout, "%cUNRECOV", f);
f = ',';
}
}
fprintf(stdout, ">\n");
objp = calloc(nobj, sizeof (encioc_element_t));
if (objp == NULL) {
perror("calloc");
(void) close(fd);
continue;
}
if (ioctl(fd, ENCIOC_GETELMMAP, (caddr_t) objp) < 0) {
perror("ENCIOC_GETELMMAP");
(void) close(fd);
continue;
}
for (i = 0; i < nobj; i++) {
ob.elm_idx = objp[i].elm_idx;
if (ioctl(fd, ENCIOC_GETELMSTAT, (caddr_t) &ob) < 0) {
perror("ENCIOC_GETELMSTAT");
(void) close(fd);
break;
}
bzero(&objd, sizeof(objd));
objd.elm_idx = objp[i].elm_idx;
objd.elm_desc_len = UINT16_MAX;
objd.elm_desc_str = calloc(UINT16_MAX, sizeof(char));
if (objd.elm_desc_str == NULL) {
perror("calloc");
(void) close(fd);
continue;
}
if (ioctl(fd, ENCIOC_GETELMDESC, (caddr_t)&objd) < 0) {
perror("ENCIOC_GETELMDESC");
(void) close(fd);
break;
}
bzero(&objdn, sizeof(objdn));
objdn.elm_idx = objp[i].elm_idx;
objdn.elm_names_size = 128;
objdn.elm_devnames = calloc(128, sizeof(char));
if (objdn.elm_devnames == NULL) {
perror("calloc");
(void) close(fd);
break;
}
/*
* This ioctl isn't critical and has a good chance
* of returning -1.
*/
(void)ioctl(fd, ENCIOC_GETELMDEVNAMES, (caddr_t)&objdn);
fprintf(stdout, "Element 0x%x: %s", ob.elm_idx,
geteltnm(objp[i].elm_type));
fprintf(stdout, ", %s",
stat2ascii(objp[i].elm_type, ob.cstat));
if (objd.elm_desc_len > 0)
fprintf(stdout, ", descriptor: '%s'",
objd.elm_desc_str);
if (objdn.elm_names_len > 0)
fprintf(stdout, ", dev: '%s'",
objdn.elm_devnames);
fprintf(stdout, "\n");
free(objdn.elm_devnames);
}
free(objp);
(void) close(fd);
}
return (errors);
}
diff --git a/share/examples/ses/srcs/getnobj.c b/share/examples/ses/srcs/getnobj.c
index 92d3458dec6e..6ad1bc892717 100644
--- a/share/examples/ses/srcs/getnobj.c
+++ b/share/examples/ses/srcs/getnobj.c
@@ -1,67 +1,66 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_ses.h>
int
main(int argc, char **argv)
{
unsigned int nobj;
int fd;
while (*++argv != NULL) {
char *name = *argv;
fd = open(name, O_RDONLY);
if (fd < 0) {
perror(name);
continue;
}
if (ioctl(fd, SESIOC_GETNOBJ, (caddr_t) &nobj) < 0) {
perror("SESIOC_GETNOBJ");
} else {
fprintf(stdout, "%s: %d objects\n", name, nobj);
}
close (fd);
}
return (0);
}
diff --git a/share/examples/ses/srcs/getobjmap.c b/share/examples/ses/srcs/getobjmap.c
index fbcc12e63f36..a52484185d0e 100644
--- a/share/examples/ses/srcs/getobjmap.c
+++ b/share/examples/ses/srcs/getobjmap.c
@@ -1,88 +1,87 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_ses.h>
#include "eltsub.h"
int
main(int a, char **v)
{
ses_object *objp;
int nobj, fd, i;
while (*++v) {
fd = open(*v, O_RDONLY);
if (fd < 0) {
perror(*v);
continue;
}
if (ioctl(fd, SESIOC_GETNOBJ, (caddr_t) &nobj) < 0) {
perror("SESIOC_GETNOBJ");
(void) close(fd);
continue;
}
fprintf(stdout, "%s: %d objects\n", *v, nobj);
if (nobj == 0) {
(void) close(fd);
continue;
}
objp = calloc(nobj, sizeof (ses_object));
if (objp == NULL) {
perror("calloc");
(void) close(fd);
continue;
}
if (ioctl(fd, SESIOC_GETOBJMAP, (caddr_t) objp) < 0) {
perror("SESIOC_GETOBJMAP");
(void) close(fd);
continue;
}
for (i = 0; i < nobj; i++) {
printf(" Object %d: ID 0x%x Type '%s'\n", i,
objp[i].obj_id, geteltnm((int)objp[i].object_type));
}
free(objp);
(void) close(fd);
}
return (0);
}
diff --git a/share/examples/ses/srcs/getobjstat.c b/share/examples/ses/srcs/getobjstat.c
index d49f6f97d2f3..83a5e6462961 100644
--- a/share/examples/ses/srcs/getobjstat.c
+++ b/share/examples/ses/srcs/getobjstat.c
@@ -1,77 +1,76 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_ses.h>
int
main(int a, char **v)
{
int fd;
int i;
ses_objstat obj;
long cvt;
char *x;
if (a != 3) {
usage:
fprintf(stderr, "usage: %s device objectid\n", *v);
return (1);
}
fd = open(v[1], O_RDONLY);
if (fd < 0) {
perror(v[1]);
return (1);
}
x = v[2];
cvt = strtol(v[2], &x, 0);
if (x == v[2]) {
goto usage;
}
obj.obj_id = cvt;
if (ioctl(fd, SESIOC_GETOBJSTAT, (caddr_t) &obj) < 0) {
perror("SESIOC_GETOBJSTAT");
return (1);
}
fprintf(stdout, "Object 0x%x: 0x%x 0x%x 0x%x 0x%x\n", obj.obj_id,
obj.cstat[0], obj.cstat[1], obj.cstat[2], obj.cstat[3]);
(void) close(fd);
return (0);
}
diff --git a/share/examples/ses/srcs/inienc.c b/share/examples/ses/srcs/inienc.c
index f418787b303c..f72e71552f7b 100644
--- a/share/examples/ses/srcs/inienc.c
+++ b/share/examples/ses/srcs/inienc.c
@@ -1,62 +1,61 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_ses.h>
int
main(int a, char **v)
{
int fd;
while (*++v) {
fd = open(*v, O_RDWR);
if (fd < 0) {
perror(*v);
continue;
}
if (ioctl(fd, SESIOC_INIT, NULL) < 0) {
perror("SESIOC_GETNOBJ");
}
(void) close(fd);
}
return (0);
}
diff --git a/share/examples/ses/srcs/sesd.c b/share/examples/ses/srcs/sesd.c
index acf9508fefce..9a6cb8cfe34a 100644
--- a/share/examples/ses/srcs/sesd.c
+++ b/share/examples/ses/srcs/sesd.c
@@ -1,177 +1,176 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_enc.h>
#define ALLSTAT (SES_ENCSTAT_UNRECOV | SES_ENCSTAT_CRITICAL | \
SES_ENCSTAT_NONCRITICAL | SES_ENCSTAT_INFO)
/*
* Monitor named SES devices and note (via syslog) any changes in status.
*/
int
main(int a, char **v)
{
static const char *usage =
"usage: %s [ -c ] [ -d ] [ -t pollinterval ] device [ device ]\n";
int fd, polltime, dev, nodaemon, clear, c;
encioc_enc_status_t stat, nstat, *carray;
if (a < 2) {
fprintf(stderr, usage, *v);
return (1);
}
nodaemon = 0;
polltime = 30;
clear = 0;
while ((c = getopt(a, v, "cdt:")) != -1) {
switch (c) {
case 'c':
clear = 1;
break;
case 'd':
nodaemon = 1;
break;
case 't':
polltime = atoi(optarg);
break;
default:
fprintf(stderr, usage, *v);
return (1);
}
}
carray = malloc(a);
if (carray == NULL) {
perror("malloc");
return (1);
}
for (dev = optind; dev < a; dev++)
carray[dev] = (encioc_enc_status_t) -1;
/*
* Check to make sure we can open all devices
*/
for (dev = optind; dev < a; dev++) {
fd = open(v[dev], O_RDWR);
if (fd < 0) {
perror(v[dev]);
return (1);
}
if (ioctl(fd, ENCIOC_INIT, NULL) < 0) {
fprintf(stderr, "%s: ENCIOC_INIT fails- %s\n",
v[dev], strerror(errno));
return (1);
}
(void) close(fd);
}
if (nodaemon == 0) {
if (daemon(0, 0) < 0) {
perror("daemon");
return (1);
}
openlog("sesd", LOG_CONS, LOG_USER);
} else {
openlog("sesd", LOG_CONS|LOG_PERROR, LOG_USER);
}
for (;;) {
for (dev = optind; dev < a; dev++) {
fd = open(v[dev], O_RDWR);
if (fd < 0) {
syslog(LOG_ERR, "%s: %m", v[dev]);
continue;
}
/*
* Get the actual current enclosure status.
*/
if (ioctl(fd, ENCIOC_GETENCSTAT, (caddr_t) &stat) < 0) {
syslog(LOG_ERR,
"%s: ENCIOC_GETENCSTAT- %m", v[dev]);
(void) close(fd);
continue;
}
if (stat != 0 && clear) {
nstat = 0;
if (ioctl(fd, ENCIOC_SETENCSTAT,
(caddr_t) &nstat) < 0) {
syslog(LOG_ERR,
"%s: ENCIOC_SETENCSTAT- %m", v[dev]);
}
}
(void) close(fd);
if (stat == carray[dev])
continue;
carray[dev] = stat;
if ((stat & ALLSTAT) == 0) {
syslog(LOG_NOTICE,
"%s: Enclosure Status OK", v[dev]);
}
if (stat & SES_ENCSTAT_INFO) {
syslog(LOG_NOTICE,
"%s: Enclosure Has Information", v[dev]);
}
if (stat & SES_ENCSTAT_NONCRITICAL) {
syslog(LOG_WARNING,
"%s: Enclosure Non-Critical", v[dev]);
}
if (stat & SES_ENCSTAT_CRITICAL) {
syslog(LOG_CRIT,
"%s: Enclosure Critical", v[dev]);
}
if (stat & SES_ENCSTAT_UNRECOV) {
syslog(LOG_ALERT,
"%s: Enclosure Unrecoverable", v[dev]);
}
}
sleep(polltime);
}
/* NOTREACHED */
}
diff --git a/share/examples/ses/srcs/setencstat.c b/share/examples/ses/srcs/setencstat.c
index 87a7fa263043..dbfbaf27aacb 100644
--- a/share/examples/ses/srcs/setencstat.c
+++ b/share/examples/ses/srcs/setencstat.c
@@ -1,69 +1,68 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_enc.h>
int
main(int a, char **v)
{
int fd;
long val;
encioc_enc_status_t stat;
if (a != 3) {
fprintf(stderr, "usage: %s device enclosure_status\n", *v);
return (1);
}
fd = open(v[1], O_RDWR);
if (fd < 0) {
perror(v[1]);
return (1);
}
val = strtol(v[2], NULL, 0);
stat = (encioc_enc_status_t)val;
if (ioctl(fd, ENCIOC_SETENCSTAT, (caddr_t) &stat) < 0) {
perror("ENCIOC_SETENCSTAT");
}
(void) close(fd);
return (0);
}
diff --git a/share/examples/ses/srcs/setobjstat.c b/share/examples/ses/srcs/setobjstat.c
index 26a5dd19ebcd..e5d374e5252a 100644
--- a/share/examples/ses/srcs/setobjstat.c
+++ b/share/examples/ses/srcs/setobjstat.c
@@ -1,84 +1,83 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <unistd.h>
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_enc.h>
int
main(int a, char **v)
{
int fd;
int i;
encioc_elm_status_t obj;
long cvt;
char *x;
if (a != 7) {
usage:
fprintf(stderr,
"usage: %s device objectid stat0 stat1 stat2 stat3\n", *v);
return (1);
}
fd = open(v[1], O_RDWR);
if (fd < 0) {
perror(v[1]);
return (1);
}
x = v[2];
cvt = strtol(v[2], &x, 0);
if (x == v[2]) {
goto usage;
}
obj.elm_idx = cvt;
for (i = 0; i < 4; i++) {
x = v[3 + i];
cvt = strtol(v[3 + i], &x, 0);
if (x == v[3 + i]) {
goto usage;
}
obj.cstat[i] = cvt;
}
if (ioctl(fd, ENCIOC_SETELMSTAT, (caddr_t) &obj) < 0) {
perror("ENCIOC_SETELMSTAT");
}
(void) close(fd);
return (0);
}
diff --git a/share/examples/sunrpc/msg/msg_proc.c b/share/examples/sunrpc/msg/msg_proc.c
index 45ffe7cc1153..bc7130bf029a 100644
--- a/share/examples/sunrpc/msg/msg_proc.c
+++ b/share/examples/sunrpc/msg/msg_proc.c
@@ -1,30 +1,29 @@
/* @(#)msg_proc.c 2.1 88/08/11 4.0 RPCSRC */
-/* $FreeBSD$ */
/*
* msg_proc.c: implementation of the remote procedure "printmessage"
*/
#include <paths.h>
#include <stdio.h>
#include <rpc/rpc.h> /* always need this here */
#include "msg.h" /* need this too: msg.h will be generated by rpcgen */
/*
* Remote version of "printmessage"
*/
int *
printmessage_1(msg)
char **msg;
{
static int result; /* must be static! */
FILE *f;
f = fopen(_PATH_CONSOLE, "w");
if (f == NULL) {
result = 0;
return (&result);
}
fprintf(f, "%s\n", *msg);
fclose(f);
result = 1;
return (&result);
}
diff --git a/share/examples/sunrpc/msg/printmsg.c b/share/examples/sunrpc/msg/printmsg.c
index 681007c4b1fe..d8b227bde926 100644
--- a/share/examples/sunrpc/msg/printmsg.c
+++ b/share/examples/sunrpc/msg/printmsg.c
@@ -1,45 +1,44 @@
/* @(#)printmsg.c 2.1 88/08/11 4.0 RPCSRC */
-/* $FreeBSD$ */
/*
* printmsg.c: print a message on the console
*/
#include <paths.h>
#include <stdio.h>
main(argc, argv)
int argc;
char *argv[];
{
char *message;
if (argc < 2) {
fprintf(stderr, "usage: %s <message>\n", argv[0]);
exit(1);
}
message = argv[1];
if (!printmessage(message)) {
fprintf(stderr, "%s: sorry, couldn't print your message\n",
argv[0]);
exit(1);
}
printf("Message delivered!\n");
}
/*
* Print a message to the console.
* Return a boolean indicating whether the message was actually printed.
*/
printmessage(msg)
char *msg;
{
FILE *f;
f = fopen(_PATH_CONSOLE, "w");
if (f == NULL) {
return (0);
}
fprintf(f, "%s\n", msg);
fclose(f);
return(1);
}
diff --git a/share/examples/tests/tests/atf/printf_test.c b/share/examples/tests/tests/atf/printf_test.c
index 5a4cb658395e..90fe32b23a3a 100644
--- a/share/examples/tests/tests/atf/printf_test.c
+++ b/share/examples/tests/tests/atf/printf_test.c
@@ -1,159 +1,158 @@
-/* $FreeBSD$
*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright 2013 Google Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Google Inc. nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE. */
/*
* INTRODUCTION
*
* This sample test program implements various test cases for the printf(3)
* family of functions in order to demonstrate the usage of the ATF C API
* (see atf-c-api(3)).
*
* Note that this test program is called printf_test because it is intended
* to validate various functions of the printf(3) family. For this reason,
* each test is prefixed with the name of the function under test followed
* by a description of the specific condition being validated. You should
* use a similar naming scheme for your own tests.
*/
#include <atf-c.h>
#include <stdio.h>
#include <string.h>
/*
* This is the simplest form of a test case definition: a test case
* without a header.
*
* In most cases, this is the definition you will want to use. However,
* make absolutely sure that the test case name is descriptive enough.
* Multi-word test case names are encouraged. Keep in mind that these
* are exposed to the reader in the test reports, and the goal is for
* the combination of the test program plus the name of the test case to
* give a pretty clear idea of what specific condition the test is
* validating.
*/
ATF_TC_WITHOUT_HEAD(snprintf__two_formatters);
ATF_TC_BODY(snprintf__two_formatters, tc)
{
char buffer[128];
/* This first require-style check invokes the function we are
* interested in testing. This will cause the test to fail if
* the condition provided to ATF_REQUIRE is not met. */
ATF_REQUIRE(snprintf(buffer, sizeof(buffer), "%s, %s!",
"Hello", "tests") > 0);
/* This second check-style check compares that the result of the
* snprintf call we performed above is correct. We use a check
* instead of a require. */
ATF_CHECK_STREQ("Hello, tests!", buffer);
}
/*
* This is a more complex form of a test case definition: a test case
* with a header and a body. You should always favor the simpler
* definition above unless you have to override specific metadata
* variables.
*
* See atf-test-case(4) and kyua-atf-interface(1) for details on all
* available properties.
*/
ATF_TC(snprintf__overflow);
ATF_TC_HEAD(snprintf__overflow, tc)
{
/* In this specific case, we define a textual description for
* the test case, which is later exported to the reports for
* documentation purposes.
*
* However, note again that you should favor highly descriptive
* test case names to textual descriptions. */
atf_tc_set_md_var(tc, "descr", "This test case validates the proper "
"truncation of the output string from snprintf when it does not "
"fit the provided buffer.");
}
ATF_TC_BODY(snprintf__overflow, tc)
{
char buffer[10];
/* This is a similar test to the above, but in this case we do the
* test ourselves and forego the ATF_* macros. Note that we use the
* atf_tc_fail() function instead of exit(2) or similar because we
* want Kyua to have access to the failure message.
*
* In general, prefer using the ATF_* macros wherever possible. Only
* resort to manual tests when the macros are unsuitable (and consider
* filing a feature request to get a new macro if you think your case
* is generic enough). */
if (snprintf(buffer, sizeof(buffer), "0123456789abcdef") != 16)
atf_tc_fail("snprintf did not return the expected number "
"of characters");
ATF_CHECK(strcmp(buffer, "012345678") == 0);
}
/*
* Another simple test case, but this time with side-effects. This
* particular test case modifies the contents of the current directory
* and does not clean up after itself, which is perfectly fine.
*/
ATF_TC_WITHOUT_HEAD(fprintf__simple_string);
ATF_TC_BODY(fprintf__simple_string, tc)
{
const char *contents = "This is a message\n";
FILE *output = fopen("test.txt", "w");
ATF_REQUIRE(fprintf(output, "%s", contents) > 0);
fclose(output);
/* The ATF C library provides more than just macros to verify the
* outcome of expressions. It also includes various helper functions
* to work with files and processes. Here is just a simple
* example. */
ATF_REQUIRE(atf_utils_compare_file("test.txt", contents));
/* Of special note here is that we are NOT deleting the
* temporary files we created in this test. Kyua takes care of
* this cleanup automatically and tests can (and should) rely on
* this behavior. */
}
/*
* Lastly, we tell ATF which test cases exist in this program. This
* function should not do anything other than this registration.
*/
ATF_TP_ADD_TCS(tp)
{
ATF_TP_ADD_TC(tp, snprintf__two_formatters);
ATF_TP_ADD_TC(tp, snprintf__overflow);
ATF_TP_ADD_TC(tp, fprintf__simple_string);
return (atf_no_error());
}
diff --git a/share/examples/tests/tests/plain/printf_test.c b/share/examples/tests/tests/plain/printf_test.c
index 89d96d037791..09c46086a58b 100644
--- a/share/examples/tests/tests/plain/printf_test.c
+++ b/share/examples/tests/tests/plain/printf_test.c
@@ -1,122 +1,121 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright 2013 Google Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Google Inc. nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE. */
/*
* INTRODUCTION
*
* This plain test program mimics the structure and contents of its
* ATF-based counterpart. It attempts to represent various test cases
* in different separate functions and just calls them all from main().
*
* In reality, plain test programs can be much simpler. All they have
* to do is return 0 on success and non-0 otherwise.
*/
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
static void
snprintf__two_formatters(void)
{
char buffer[128];
if (snprintf(buffer, sizeof(buffer), "%s, %s!", "Hello",
"tests") <= 0)
errx(EXIT_FAILURE, "snprintf with two formatters failed");
if (strcmp(buffer, "Hello, tests!") != 0)
errx(EXIT_FAILURE, "Bad formatting: got %s", buffer);
}
static void
snprintf__overflow(void)
{
char buffer[10];
if (snprintf(buffer, sizeof(buffer), "0123456789abcdef") != 16)
errx(EXIT_FAILURE, "snprintf did not return the expected "
"number of characters");
if (strcmp(buffer, "012345678") != 0)
errx(EXIT_FAILURE, "Bad formatting: got %s", buffer);
}
static void
fprintf__simple_string(void)
{
FILE *file;
char buffer[128];
size_t length;
const char *contents = "This is a message\n";
file = fopen("test.txt", "w+");
if (fprintf(file, "%s", contents) <= 0)
err(EXIT_FAILURE, "fprintf failed to write to file");
rewind(file);
length = fread(buffer, 1, sizeof(buffer) - 1, file);
if (length != strlen(contents))
err(EXIT_FAILURE, "fread failed");
buffer[length] = '\0';
fclose(file);
if (strcmp(buffer, contents) != 0)
errx(EXIT_FAILURE, "Written and read data differ");
/* Of special note here is that we are NOT deleting the temporary
* files we created in this test. Kyua takes care of this cleanup
* automatically and tests can (and should) rely on this behavior. */
}
int
main(void)
{
/* If you have read the printf_test.c counterpart in the atf/
* directory, you may think that the sequencing of tests below and
* the exposed behavior to the user is very similar. But you'd be
* wrong.
*
* There are two major differences with this and the ATF version.
* The first is that the code below has no provisions to detect
* failures in one test and continue running the other tests: the
* first failure causes the whole test program to exit. The second
* is that this particular main() has no arguments: without ATF,
* all test programs may expose a different command-line interface,
* and this is an issue for consistency purposes. */
snprintf__two_formatters();
snprintf__overflow();
fprintf__simple_string();
return EXIT_SUCCESS;
}
diff --git a/share/examples/tests/tests/tap/printf_test.c b/share/examples/tests/tests/tap/printf_test.c
index 4e74f790a826..b3dd90fca3eb 100644
--- a/share/examples/tests/tests/tap/printf_test.c
+++ b/share/examples/tests/tests/tap/printf_test.c
@@ -1,185 +1,184 @@
-/* $FreeBSD$
*
* Copyright 2013 Google Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Google Inc. nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE. */
/*
* INTRODUCTION
*
* This plain test program mimics the structure and contents of its
* ATF-based counterpart. It attempts to represent various test cases
* in different separate functions and just calls them all from main().
*
* In reality, plain test programs can be much simpler. All they have
* to do is return 0 on success and non-0 otherwise.
*/
#include <err.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
static int failed;
static int test_num = 1;
#define TEST_COUNT 7
static void
fail(const char *fmt, ...)
{
char *msg;
va_list ap;
failed = 1;
va_start(ap, fmt);
if (vasprintf(&msg, fmt, ap) == -1)
err(1, NULL);
va_end(ap);
printf("not ok %d - %s\n", test_num, msg);
free(msg);
test_num++;
}
static void
pass(void)
{
printf("ok %d\n", test_num);
test_num++;
}
static void
skip(int skip_num)
{
int i;
for (i = 0; i < skip_num; i++) {
printf("not ok %d # SKIP\n", test_num);
test_num++;
}
}
static void
snprintf__two_formatters(void)
{
char buffer[128];
if (snprintf(buffer, sizeof(buffer), "%s, %s!", "Hello",
"tests") <= 0) {
fail("snprintf with two formatters failed");
skip(1);
} else {
pass();
if (strcmp(buffer, "Hello, tests!") != 0)
fail("Bad formatting: got %s", buffer);
else
pass();
}
}
static void
snprintf__overflow(void)
{
char buffer[10];
if (snprintf(buffer, sizeof(buffer), "0123456789abcdef") != 16) {
fail("snprintf did not return the expected "
"number of characters");
skip(1);
return;
}
pass();
if (strcmp(buffer, "012345678") != 0)
fail("Bad formatting: got %s", buffer);
else
pass();
}
static void
fprintf__simple_string(void)
{
FILE *file;
char buffer[128];
size_t length;
const char *contents = "This is a message\n";
file = fopen("test.txt", "w+");
if (fprintf(file, "%s", contents) <= 0) {
fail("fprintf failed to write to file");
skip(2);
return;
}
pass();
rewind(file);
length = fread(buffer, 1, sizeof(buffer) - 1, file);
if (length != strlen(contents)) {
fail("fread failed");
skip(1);
return;
}
pass();
buffer[length] = '\0';
fclose(file);
if (strcmp(buffer, contents) != 0)
fail("Written and read data differ");
else
pass();
/* Of special note here is that we are NOT deleting the temporary
* files we created in this test. Kyua takes care of this cleanup
* automatically and tests can (and should) rely on this behavior. */
}
int
main(void)
{
/* If you have read the printf_test.c counterpart in the atf/
* directory, you may think that the sequencing of tests below and
* the exposed behavior to the user is very similar. But you'd be
* wrong.
*
* There are two major differences with this and the ATF version.
* The first is that the code below has no provisions to detect
* failures in one test and continue running the other tests: the
* first failure causes the whole test program to exit. The second
* is that this particular main() has no arguments: without ATF,
* all test programs may expose a different command-line interface,
* and this is an issue for consistency purposes. */
printf("1..%d\n", TEST_COUNT);
snprintf__two_formatters();
snprintf__overflow();
fprintf__simple_string();
return (failed);
}
diff --git a/stand/efi/include/Guid/MemoryTypeInformation.h b/stand/efi/include/Guid/MemoryTypeInformation.h
index 50386b747d35..be9c4b5177a9 100644
--- a/stand/efi/include/Guid/MemoryTypeInformation.h
+++ b/stand/efi/include/Guid/MemoryTypeInformation.h
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
/** @file
This file defines:
* Memory Type Information GUID for HOB and Variable.
* Memory Type Information Variable Name.
* Memory Type Information GUID HOB data structure.
The memory type information HOB and variable can
be used to store the information for each memory type in Variable or HOB.
Copyright (c) 2006 - 2010, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials are licensed and made available under
the terms and conditions of the BSD License that accompanies this distribution.
The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php.
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __MEMORY_TYPE_INFORMATION_GUID_H__
#define __MEMORY_TYPE_INFORMATION_GUID_H__
#define EFI_MEMORY_TYPE_INFORMATION_GUID \
{ 0x4c19049f,0x4137,0x4dd3, { 0x9c,0x10,0x8b,0x97,0xa8,0x3f,0xfd,0xfa } }
#define EFI_MEMORY_TYPE_INFORMATION_VARIABLE_NAME "MemoryTypeInformation"
extern EFI_GUID gEfiMemoryTypeInformationGuid;
typedef struct {
UINT32 Type; ///< EFI memory type defined in UEFI specification.
UINT32 NumberOfPages; ///< The pages of this type memory.
} EFI_MEMORY_TYPE_INFORMATION;
#endif
diff --git a/stand/efi/include/Guid/MtcVendor.h b/stand/efi/include/Guid/MtcVendor.h
index 471e7df4d673..3aa774f55477 100644
--- a/stand/efi/include/Guid/MtcVendor.h
+++ b/stand/efi/include/Guid/MtcVendor.h
@@ -1,32 +1,31 @@
-/* $FreeBSD$ */
/** @file
GUID is for MTC variable.
Copyright (c) 2011, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials are licensed and made available under
the terms and conditions of the BSD License that accompanies this distribution.
The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php.
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __MTC_VENDOR_GUID_H__
#define __MTC_VENDOR_GUID_H__
//
// Vendor GUID of the variable for the high part of monotonic counter (UINT32).
//
#define MTC_VENDOR_GUID \
{ 0xeb704011, 0x1402, 0x11d3, { 0x8e, 0x77, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b } }
//
// Name of the variable for the high part of monotonic counter
//
#define MTC_VARIABLE_NAME "MTC"
extern EFI_GUID gMtcVendorGuid;
#endif
diff --git a/stand/efi/include/Guid/ZeroGuid.h b/stand/efi/include/Guid/ZeroGuid.h
index a7502cb83534..6de8c3821f5f 100644
--- a/stand/efi/include/Guid/ZeroGuid.h
+++ b/stand/efi/include/Guid/ZeroGuid.h
@@ -1,26 +1,25 @@
-/* $FreeBSD$ */
/** @file
GUID has all zero values.
Copyright (c) 2011, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials are licensed and made available under
the terms and conditions of the BSD License that accompanies this distribution.
The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php.
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __ZERO_GUID_H__
#define __ZERO_GUID_H__
#define ZERO_GUID \
{ \
0x0, 0x0, 0x0, {0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0} \
}
extern EFI_GUID gZeroGuid;
#endif
diff --git a/stand/efi/include/Protocol/EdidActive.h b/stand/efi/include/Protocol/EdidActive.h
index 88fc0c68ec37..1f6ff052a91c 100644
--- a/stand/efi/include/Protocol/EdidActive.h
+++ b/stand/efi/include/Protocol/EdidActive.h
@@ -1,53 +1,52 @@
-/* $FreeBSD$ */
/** @file
EDID Active Protocol from the UEFI 2.0 specification.
Placed on the video output device child handle that is actively displaying output.
Copyright (c) 2006 - 2012, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __EDID_ACTIVE_H__
#define __EDID_ACTIVE_H__
#define EFI_EDID_ACTIVE_PROTOCOL_GUID \
{ \
0xbd8c1056, 0x9f36, 0x44ec, {0x92, 0xa8, 0xa6, 0x33, 0x7f, 0x81, 0x79, 0x86 } \
}
///
/// This protocol contains the EDID information for an active video output device. This is either the
/// EDID information retrieved from the EFI_EDID_OVERRIDE_PROTOCOL if an override is
/// available, or an identical copy of the EDID information from the
/// EFI_EDID_DISCOVERED_PROTOCOL if no overrides are available.
///
typedef struct {
///
/// The size, in bytes, of the Edid buffer. 0 if no EDID information
/// is available from the video output device. Otherwise, it must be a
/// minimum of 128 bytes.
///
UINT32 SizeOfEdid;
///
/// A pointer to a read-only array of bytes that contains the EDID
/// information for an active video output device. This pointer is
/// NULL if no EDID information is available for the video output
/// device. The minimum size of a valid Edid buffer is 128 bytes.
/// EDID information is defined in the E-EDID EEPROM
/// specification published by VESA (www.vesa.org).
///
UINT8 *Edid;
} EFI_EDID_ACTIVE_PROTOCOL;
extern EFI_GUID gEfiEdidActiveProtocolGuid;
#endif
diff --git a/stand/efi/include/Protocol/EdidDiscovered.h b/stand/efi/include/Protocol/EdidDiscovered.h
index a521e90d0056..c10b6ee89a82 100644
--- a/stand/efi/include/Protocol/EdidDiscovered.h
+++ b/stand/efi/include/Protocol/EdidDiscovered.h
@@ -1,51 +1,50 @@
-/* $FreeBSD$ */
/** @file
EDID Discovered Protocol from the UEFI 2.0 specification.
This protocol is placed on the video output device child handle. It represents
the EDID information being used for the output device represented by the child handle.
Copyright (c) 2006 - 2012, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __EDID_DISCOVERED_H__
#define __EDID_DISCOVERED_H__
#define EFI_EDID_DISCOVERED_PROTOCOL_GUID \
{ \
0x1c0c34f6, 0xd380, 0x41fa, {0xa0, 0x49, 0x8a, 0xd0, 0x6c, 0x1a, 0x66, 0xaa } \
}
///
/// This protocol contains the EDID information retrieved from a video output device.
///
typedef struct {
///
/// The size, in bytes, of the Edid buffer. 0 if no EDID information
/// is available from the video output device. Otherwise, it must be a
/// minimum of 128 bytes.
///
UINT32 SizeOfEdid;
///
/// A pointer to a read-only array of bytes that contains the EDID
/// information for an active video output device. This pointer is
/// NULL if no EDID information is available for the video output
/// device. The minimum size of a valid Edid buffer is 128 bytes.
/// EDID information is defined in the E-EDID EEPROM
/// specification published by VESA (www.vesa.org).
///
UINT8 *Edid;
} EFI_EDID_DISCOVERED_PROTOCOL;
extern EFI_GUID gEfiEdidDiscoveredProtocolGuid;
#endif
diff --git a/stand/efi/include/Protocol/EdidOverride.h b/stand/efi/include/Protocol/EdidOverride.h
index d64d400e8c06..450c95641fce 100644
--- a/stand/efi/include/Protocol/EdidOverride.h
+++ b/stand/efi/include/Protocol/EdidOverride.h
@@ -1,68 +1,67 @@
-/* $FreeBSD$ */
/** @file
EDID Override Protocol from the UEFI 2.0 specification.
Allow platform to provide EDID information to the producer of the Graphics Output
protocol.
Copyright (c) 2006 - 2008, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __EDID_OVERRIDE_H__
#define __EDID_OVERRIDE_H__
#define EFI_EDID_OVERRIDE_PROTOCOL_GUID \
{ \
0x48ecb431, 0xfb72, 0x45c0, {0xa9, 0x22, 0xf4, 0x58, 0xfe, 0x4, 0xb, 0xd5 } \
}
typedef struct _EFI_EDID_OVERRIDE_PROTOCOL EFI_EDID_OVERRIDE_PROTOCOL;
#define EFI_EDID_OVERRIDE_DONT_OVERRIDE 0x01
#define EFI_EDID_OVERRIDE_ENABLE_HOT_PLUG 0x02
/**
Returns policy information and potentially a replacement EDID for the specified video output device.
@param This The EFI_EDID_OVERRIDE_PROTOCOL instance.
@param ChildHandle A child handle produced by the Graphics Output EFI
driver that represents a video output device.
@param Attributes The attributes associated with ChildHandle video output device.
@param EdidSize A pointer to the size, in bytes, of the Edid buffer.
@param Edid A pointer to callee allocated buffer that contains the EDID that
should be used for ChildHandle. A value of NULL
represents no EDID override for ChildHandle.
@retval EFI_SUCCESS Valid overrides returned for ChildHandle.
@retval EFI_UNSUPPORTED ChildHandle has no overrides.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_EDID_OVERRIDE_PROTOCOL_GET_EDID)(
IN EFI_EDID_OVERRIDE_PROTOCOL *This,
IN EFI_HANDLE *ChildHandle,
OUT UINT32 *Attributes,
IN OUT UINTN *EdidSize,
IN OUT UINT8 **Edid
);
///
/// This protocol is produced by the platform to allow the platform to provide
/// EDID information to the producer of the Graphics Output protocol.
///
struct _EFI_EDID_OVERRIDE_PROTOCOL {
EFI_EDID_OVERRIDE_PROTOCOL_GET_EDID GetEdid;
};
extern EFI_GUID gEfiEdidOverrideProtocolGuid;
#endif
diff --git a/stand/efi/include/Protocol/Http.h b/stand/efi/include/Protocol/Http.h
index 54f49ab5e35c..c88cc9f78847 100644
--- a/stand/efi/include/Protocol/Http.h
+++ b/stand/efi/include/Protocol/Http.h
@@ -1,523 +1,522 @@
-/* $FreeBSD$ */
/** @file
This file defines the EFI HTTP Protocol interface. It is split into
the following two main sections:
HTTP Service Binding Protocol (HTTPSB)
HTTP Protocol (HTTP)
Copyright (c) 2016 - 2018, Intel Corporation. All rights reserved.<BR>
(C) Copyright 2015-2017 Hewlett Packard Enterprise Development LP<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
@par Revision Reference:
This Protocol is introduced in UEFI Specification 2.5
**/
#ifndef __EFI_HTTP_PROTOCOL_H__
#define __EFI_HTTP_PROTOCOL_H__
#define EFI_HTTP_SERVICE_BINDING_PROTOCOL_GUID \
{ \
0xbdc8e6af, 0xd9bc, 0x4379, {0xa7, 0x2a, 0xe0, 0xc4, 0xe7, 0x5d, 0xae, 0x1c } \
}
#define EFI_HTTP_PROTOCOL_GUID \
{ \
0x7a59b29b, 0x910b, 0x4171, {0x82, 0x42, 0xa8, 0x5a, 0x0d, 0xf2, 0x5b, 0x5b } \
}
typedef struct _EFI_HTTP_PROTOCOL EFI_HTTP_PROTOCOL;
///
/// EFI_HTTP_VERSION
///
typedef enum {
HttpVersion10,
HttpVersion11,
HttpVersionUnsupported
} EFI_HTTP_VERSION;
///
/// EFI_HTTP_METHOD
///
typedef enum {
HttpMethodGet,
HttpMethodPost,
HttpMethodPatch,
HttpMethodOptions,
HttpMethodConnect,
HttpMethodHead,
HttpMethodPut,
HttpMethodDelete,
HttpMethodTrace,
HttpMethodMax
} EFI_HTTP_METHOD;
///
/// EFI_HTTP_STATUS_CODE
///
typedef enum {
HTTP_STATUS_UNSUPPORTED_STATUS = 0,
HTTP_STATUS_100_CONTINUE,
HTTP_STATUS_101_SWITCHING_PROTOCOLS,
HTTP_STATUS_200_OK,
HTTP_STATUS_201_CREATED,
HTTP_STATUS_202_ACCEPTED,
HTTP_STATUS_203_NON_AUTHORITATIVE_INFORMATION,
HTTP_STATUS_204_NO_CONTENT,
HTTP_STATUS_205_RESET_CONTENT,
HTTP_STATUS_206_PARTIAL_CONTENT,
HTTP_STATUS_300_MULTIPLE_CHOICES,
HTTP_STATUS_301_MOVED_PERMANENTLY,
HTTP_STATUS_302_FOUND,
HTTP_STATUS_303_SEE_OTHER,
HTTP_STATUS_304_NOT_MODIFIED,
HTTP_STATUS_305_USE_PROXY,
HTTP_STATUS_307_TEMPORARY_REDIRECT,
HTTP_STATUS_400_BAD_REQUEST,
HTTP_STATUS_401_UNAUTHORIZED,
HTTP_STATUS_402_PAYMENT_REQUIRED,
HTTP_STATUS_403_FORBIDDEN,
HTTP_STATUS_404_NOT_FOUND,
HTTP_STATUS_405_METHOD_NOT_ALLOWED,
HTTP_STATUS_406_NOT_ACCEPTABLE,
HTTP_STATUS_407_PROXY_AUTHENTICATION_REQUIRED,
HTTP_STATUS_408_REQUEST_TIME_OUT,
HTTP_STATUS_409_CONFLICT,
HTTP_STATUS_410_GONE,
HTTP_STATUS_411_LENGTH_REQUIRED,
HTTP_STATUS_412_PRECONDITION_FAILED,
HTTP_STATUS_413_REQUEST_ENTITY_TOO_LARGE,
HTTP_STATUS_414_REQUEST_URI_TOO_LARGE,
HTTP_STATUS_415_UNSUPPORTED_MEDIA_TYPE,
HTTP_STATUS_416_REQUESTED_RANGE_NOT_SATISFIED,
HTTP_STATUS_417_EXPECTATION_FAILED,
HTTP_STATUS_500_INTERNAL_SERVER_ERROR,
HTTP_STATUS_501_NOT_IMPLEMENTED,
HTTP_STATUS_502_BAD_GATEWAY,
HTTP_STATUS_503_SERVICE_UNAVAILABLE,
HTTP_STATUS_504_GATEWAY_TIME_OUT,
HTTP_STATUS_505_HTTP_VERSION_NOT_SUPPORTED,
HTTP_STATUS_308_PERMANENT_REDIRECT
} EFI_HTTP_STATUS_CODE;
///
/// EFI_HTTPv4_ACCESS_POINT
///
typedef struct {
///
/// Set to TRUE to instruct the EFI HTTP instance to use the default address
/// information in every TCP connection made by this instance. In addition, when set
/// to TRUE, LocalAddress and LocalSubnet are ignored.
///
BOOLEAN UseDefaultAddress;
///
/// If UseDefaultAddress is set to FALSE, this defines the local IP address to be
/// used in every TCP connection opened by this instance.
///
EFI_IPv4_ADDRESS LocalAddress;
///
/// If UseDefaultAddress is set to FALSE, this defines the local subnet to be used
/// in every TCP connection opened by this instance.
///
EFI_IPv4_ADDRESS LocalSubnet;
///
/// This defines the local port to be used in
/// every TCP connection opened by this instance.
///
UINT16 LocalPort;
} EFI_HTTPv4_ACCESS_POINT;
///
/// EFI_HTTPv6_ACCESS_POINT
///
typedef struct {
///
/// Local IP address to be used in every TCP connection opened by this instance.
///
EFI_IPv6_ADDRESS LocalAddress;
///
/// Local port to be used in every TCP connection opened by this instance.
///
UINT16 LocalPort;
} EFI_HTTPv6_ACCESS_POINT;
///
/// EFI_HTTP_CONFIG_DATA_ACCESS_POINT
///
typedef struct {
///
/// HTTP version that this instance will support.
///
EFI_HTTP_VERSION HttpVersion;
///
/// Time out (in milliseconds) when blocking for requests.
///
UINT32 TimeOutMillisec;
///
/// Defines behavior of EFI DNS and TCP protocols consumed by this instance. If
/// FALSE, this instance will use EFI_DNS4_PROTOCOL and EFI_TCP4_PROTOCOL. If TRUE,
/// this instance will use EFI_DNS6_PROTOCOL and EFI_TCP6_PROTOCOL.
///
BOOLEAN LocalAddressIsIPv6;
union {
///
/// When LocalAddressIsIPv6 is FALSE, this points to the local address, subnet, and
/// port used by the underlying TCP protocol.
///
EFI_HTTPv4_ACCESS_POINT *IPv4Node;
///
/// When LocalAddressIsIPv6 is TRUE, this points to the local IPv6 address and port
/// used by the underlying TCP protocol.
///
EFI_HTTPv6_ACCESS_POINT *IPv6Node;
} AccessPoint;
} EFI_HTTP_CONFIG_DATA;
///
/// EFI_HTTP_REQUEST_DATA
///
typedef struct {
///
/// The HTTP method (e.g. GET, POST) for this HTTP Request.
///
EFI_HTTP_METHOD Method;
///
/// The URI of a remote host. From the information in this field, the HTTP instance
/// will be able to determine whether to use HTTP or HTTPS and will also be able to
/// determine the port number to use. If no port number is specified, port 80 (HTTP)
/// is assumed. See RFC 3986 for more details on URI syntax.
///
CHAR16 *Url;
} EFI_HTTP_REQUEST_DATA;
///
/// EFI_HTTP_RESPONSE_DATA
///
typedef struct {
///
/// Response status code returned by the remote host.
///
EFI_HTTP_STATUS_CODE StatusCode;
} EFI_HTTP_RESPONSE_DATA;
///
/// EFI_HTTP_HEADER
///
typedef struct {
///
/// Null terminated string which describes a field name. See RFC 2616 Section 14 for
/// detailed information about field names.
///
CHAR8 *FieldName;
///
/// Null terminated string which describes the corresponding field value. See RFC 2616
/// Section 14 for detailed information about field values.
///
CHAR8 *FieldValue;
} EFI_HTTP_HEADER;
///
/// EFI_HTTP_MESSAGE
///
typedef struct {
///
/// HTTP message data.
///
union {
///
/// When the token is used to send a HTTP request, Request is a pointer to storage that
/// contains such data as URL and HTTP method.
///
EFI_HTTP_REQUEST_DATA *Request;
///
/// When used to await a response, Response points to storage containing HTTP response
/// status code.
///
EFI_HTTP_RESPONSE_DATA *Response;
} Data;
///
/// Number of HTTP header structures in Headers list. On request, this count is
/// provided by the caller. On response, this count is provided by the HTTP driver.
///
UINTN HeaderCount;
///
/// Array containing list of HTTP headers. On request, this array is populated by the
/// caller. On response, this array is allocated and populated by the HTTP driver. It
/// is the responsibility of the caller to free this memory on both request and
/// response.
///
EFI_HTTP_HEADER *Headers;
///
/// Length in bytes of the HTTP body. This can be zero depending on the HttpMethod type.
///
UINTN BodyLength;
///
/// Body associated with the HTTP request or response. This can be NULL depending on
/// the HttpMethod type.
///
VOID *Body;
} EFI_HTTP_MESSAGE;
///
/// EFI_HTTP_TOKEN
///
typedef struct {
///
/// This Event will be signaled after the Status field is updated by the EFI HTTP
/// Protocol driver. The type of Event must be EFI_NOTIFY_SIGNAL. The Task Priority
/// Level (TPL) of Event must be lower than or equal to TPL_CALLBACK.
///
EFI_EVENT Event;
///
/// Status will be set to one of the following value if the HTTP request is
/// successfully sent or if an unexpected error occurs:
/// EFI_SUCCESS: The HTTP request was successfully sent to the remote host.
/// EFI_HTTP_ERROR: The response message was successfully received but contains a
/// HTTP error. The response status code is returned in token.
/// EFI_ABORTED: The HTTP request was cancelled by the caller and removed from
/// the transmit queue.
/// EFI_TIMEOUT: The HTTP request timed out before reaching the remote host.
/// EFI_DEVICE_ERROR: An unexpected system or network error occurred.
///
EFI_STATUS Status;
///
/// Pointer to storage containing HTTP message data.
///
EFI_HTTP_MESSAGE *Message;
} EFI_HTTP_TOKEN;
/**
Returns the operational parameters for the current HTTP child instance.
The GetModeData() function is used to read the current mode data (operational
parameters) for this HTTP protocol instance.
@param[in] This Pointer to EFI_HTTP_PROTOCOL instance.
@param[out] HttpConfigData Point to buffer for operational parameters of this
HTTP instance. It is the responsibility of the caller
to allocate the memory for HttpConfigData and
HttpConfigData->AccessPoint.IPv6Node/IPv4Node. In fact,
it is recommended to allocate sufficient memory to record
IPv6Node since it is big enough for all possibilities.
@retval EFI_SUCCESS Operation succeeded.
@retval EFI_INVALID_PARAMETER This is NULL.
HttpConfigData is NULL.
HttpConfigData->AccessPoint.IPv4Node or
HttpConfigData->AccessPoint.IPv6Node is NULL.
@retval EFI_NOT_STARTED This EFI HTTP Protocol instance has not been started.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_HTTP_GET_MODE_DATA)(
IN EFI_HTTP_PROTOCOL *This,
OUT EFI_HTTP_CONFIG_DATA *HttpConfigData
);
/**
Initialize or brutally reset the operational parameters for this EFI HTTP instance.
The Configure() function does the following:
When HttpConfigData is not NULL Initialize this EFI HTTP instance by configuring
timeout, local address, port, etc.
When HttpConfigData is NULL, reset this EFI HTTP instance by closing all active
connections with remote hosts, canceling all asynchronous tokens, and flush request
and response buffers without informing the appropriate hosts.
No other EFI HTTP function can be executed by this instance until the Configure()
function is executed and returns successfully.
@param[in] This Pointer to EFI_HTTP_PROTOCOL instance.
@param[in] HttpConfigData Pointer to the configure data to configure the instance.
@retval EFI_SUCCESS Operation succeeded.
@retval EFI_INVALID_PARAMETER One or more of the following conditions is TRUE:
This is NULL.
HttpConfigData->LocalAddressIsIPv6 is FALSE and
HttpConfigData->AccessPoint.IPv4Node is NULL.
HttpConfigData->LocalAddressIsIPv6 is TRUE and
HttpConfigData->AccessPoint.IPv6Node is NULL.
@retval EFI_ALREADY_STARTED Reinitialize this HTTP instance without calling
Configure() with NULL to reset it.
@retval EFI_DEVICE_ERROR An unexpected system or network error occurred.
@retval EFI_OUT_OF_RESOURCES Could not allocate enough system resources when
executing Configure().
@retval EFI_UNSUPPORTED One or more options in ConfigData are not supported
in the implementation.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_HTTP_CONFIGURE)(
IN EFI_HTTP_PROTOCOL *This,
IN EFI_HTTP_CONFIG_DATA *HttpConfigData OPTIONAL
);
/**
The Request() function queues an HTTP request to this HTTP instance,
similar to Transmit() function in the EFI TCP driver. When the HTTP request is sent
successfully, or if there is an error, Status in token will be updated and Event will
be signaled.
@param[in] This Pointer to EFI_HTTP_PROTOCOL instance.
@param[in] Token Pointer to storage containing HTTP request token.
@retval EFI_SUCCESS Outgoing data was processed.
@retval EFI_NOT_STARTED This EFI HTTP Protocol instance has not been started.
@retval EFI_DEVICE_ERROR An unexpected system or network error occurred.
@retval EFI_TIMEOUT Data was dropped out of the transmit or receive queue.
@retval EFI_INVALID_PARAMETER One or more of the following conditions is TRUE:
This is NULL.
Token is NULL.
Token->Message is NULL.
Token->Message->Body is not NULL,
Token->Message->BodyLength is non-zero, and
Token->Message->Data is NULL, but a previous call to
Request()has not been completed successfully.
@retval EFI_OUT_OF_RESOURCES Could not allocate enough system resources.
@retval EFI_UNSUPPORTED The HTTP method is not supported in current implementation.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_HTTP_REQUEST) (
IN EFI_HTTP_PROTOCOL *This,
IN EFI_HTTP_TOKEN *Token
);
/**
Abort an asynchronous HTTP request or response token.
The Cancel() function aborts a pending HTTP request or response transaction. If
Token is not NULL and the token is in transmit or receive queues when it is being
cancelled, its Token->Status will be set to EFI_ABORTED and then Token->Event will
be signaled. If the token is not in one of the queues, which usually means that the
asynchronous operation has completed, EFI_NOT_FOUND is returned. If Token is NULL,
all asynchronous tokens issued by Request() or Response() will be aborted.
@param[in] This Pointer to EFI_HTTP_PROTOCOL instance.
@param[in] Token Point to storage containing HTTP request or response
token.
@retval EFI_SUCCESS Request and Response queues are successfully flushed.
@retval EFI_INVALID_PARAMETER This is NULL.
@retval EFI_NOT_STARTED This instance hasn't been configured.
@retval EFI_NOT_FOUND The asynchronous request or response token is not
found.
@retval EFI_UNSUPPORTED The implementation does not support this function.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_HTTP_CANCEL)(
IN EFI_HTTP_PROTOCOL *This,
IN EFI_HTTP_TOKEN *Token
);
/**
The Response() function queues an HTTP response to this HTTP instance, similar to
Receive() function in the EFI TCP driver. When the HTTP Response is received successfully,
or if there is an error, Status in token will be updated and Event will be signaled.
The HTTP driver will queue a receive token to the underlying TCP instance. When data
is received in the underlying TCP instance, the data will be parsed and Token will
be populated with the response data. If the data received from the remote host
contains an incomplete or invalid HTTP header, the HTTP driver will continue waiting
(asynchronously) for more data to be sent from the remote host before signaling
Event in Token.
It is the responsibility of the caller to allocate a buffer for Body and specify the
size in BodyLength. If the remote host provides a response that contains a content
body, up to BodyLength bytes will be copied from the receive buffer into Body and
BodyLength will be updated with the amount of bytes received and copied to Body. This
allows the client to download a large file in chunks instead of into one contiguous
block of memory. Similar to HTTP request, if Body is not NULL and BodyLength is
non-zero and all other fields are NULL or 0, the HTTP driver will queue a receive
token to underlying TCP instance. If data arrives in the receive buffer, up to
BodyLength bytes of data will be copied to Body. The HTTP driver will then update
BodyLength with the amount of bytes received and copied to Body.
If the HTTP driver does not have an open underlying TCP connection with the host
specified in the response URL, Request() will return EFI_ACCESS_DENIED. This is
consistent with RFC 2616 recommendation that HTTP clients should attempt to maintain
an open TCP connection between client and host.
@param[in] This Pointer to EFI_HTTP_PROTOCOL instance.
@param[in] Token Pointer to storage containing HTTP response token.
@retval EFI_SUCCESS Allocation succeeded.
@retval EFI_NOT_STARTED This EFI HTTP Protocol instance has not been
initialized.
@retval EFI_INVALID_PARAMETER One or more of the following conditions is TRUE:
This is NULL.
Token is NULL.
Token->Message->Headers is NULL.
Token->Message is NULL.
Token->Message->Body is not NULL,
Token->Message->BodyLength is non-zero, and
Token->Message->Data is NULL, but a previous call to
Response() has not been completed successfully.
@retval EFI_OUT_OF_RESOURCES Could not allocate enough system resources.
@retval EFI_ACCESS_DENIED An open TCP connection is not present with the host
specified by response URL.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_HTTP_RESPONSE) (
IN EFI_HTTP_PROTOCOL *This,
IN EFI_HTTP_TOKEN *Token
);
/**
The Poll() function can be used by network drivers and applications to increase the
rate that data packets are moved between the communication devices and the transmit
and receive queues.
In some systems, the periodic timer event in the managed network driver may not poll
the underlying communications device fast enough to transmit and/or receive all data
packets without missing incoming packets or dropping outgoing packets. Drivers and
applications that are experiencing packet loss should try calling the Poll() function
more often.
@param[in] This Pointer to EFI_HTTP_PROTOCOL instance.
@retval EFI_SUCCESS Incoming or outgoing data was processed..
@retval EFI_DEVICE_ERROR An unexpected system or network error occurred
@retval EFI_INVALID_PARAMETER This is NULL.
@retval EFI_NOT_READY No incoming or outgoing data is processed.
@retval EFI_NOT_STARTED This EFI HTTP Protocol instance has not been started.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_HTTP_POLL) (
IN EFI_HTTP_PROTOCOL *This
);
///
/// The EFI HTTP protocol is designed to be used by EFI drivers and applications to
/// create and transmit HTTP Requests, as well as handle HTTP responses that are
/// returned by a remote host. This EFI protocol uses and relies on an underlying EFI
/// TCP protocol.
///
struct _EFI_HTTP_PROTOCOL {
EFI_HTTP_GET_MODE_DATA GetModeData;
EFI_HTTP_CONFIGURE Configure;
EFI_HTTP_REQUEST Request;
EFI_HTTP_CANCEL Cancel;
EFI_HTTP_RESPONSE Response;
EFI_HTTP_POLL Poll;
};
extern EFI_GUID gEfiHttpServiceBindingProtocolGuid;
extern EFI_GUID gEfiHttpProtocolGuid;
#endif
diff --git a/stand/efi/include/Protocol/Ip4Config2.h b/stand/efi/include/Protocol/Ip4Config2.h
index 47241d7ad7d4..41b5abaafa02 100644
--- a/stand/efi/include/Protocol/Ip4Config2.h
+++ b/stand/efi/include/Protocol/Ip4Config2.h
@@ -1,324 +1,323 @@
-/* $FreeBSD$ */
/** @file
This file provides a definition of the EFI IPv4 Configuration II
Protocol.
Copyright (c) 2015 - 2018, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at<BR>
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
@par Revision Reference:
This Protocol is introduced in UEFI Specification 2.5
**/
#ifndef __EFI_IP4CONFIG2_PROTOCOL_H__
#define __EFI_IP4CONFIG2_PROTOCOL_H__
/* #include <Protocol/Ip4.h> */
#define EFI_IP4_CONFIG2_PROTOCOL_GUID \
{ \
0x5b446ed1, 0xe30b, 0x4faa, {0x87, 0x1a, 0x36, 0x54, 0xec, 0xa3, 0x60, 0x80 } \
}
typedef struct _EFI_IP4_CONFIG2_PROTOCOL EFI_IP4_CONFIG2_PROTOCOL;
///
/// EFI_IP4_CONFIG2_DATA_TYPE
///
typedef enum {
///
/// The interface information of the communication device this EFI
/// IPv4 Configuration II Protocol instance manages. This type of
/// data is read only. The corresponding Data is of type
/// EFI_IP4_CONFIG2_INTERFACE_INFO.
///
Ip4Config2DataTypeInterfaceInfo,
///
/// The general configuration policy for the EFI IPv4 network stack
/// running on the communication device this EFI IPv4
/// Configuration II Protocol instance manages. The policy will
/// affect other configuration settings. The corresponding Data is of
/// type EFI_IP4_CONFIG2_POLICY.
///
Ip4Config2DataTypePolicy,
///
/// The station addresses set manually for the EFI IPv4 network
/// stack. It is only configurable when the policy is
/// Ip4Config2PolicyStatic. The corresponding Data is of
/// type EFI_IP4_CONFIG2_MANUAL_ADDRESS. When DataSize
/// is 0 and Data is NULL, the existing configuration is cleared
/// from the EFI IPv4 Configuration II Protocol instance.
///
Ip4Config2DataTypeManualAddress,
///
/// The gateway addresses set manually for the EFI IPv4 network
/// stack running on the communication device this EFI IPv4
/// Configuration II Protocol manages. It is not configurable when
/// the policy is Ip4Config2PolicyDhcp. The gateway
/// addresses must be unicast IPv4 addresses. The corresponding
/// Data is a pointer to an array of EFI_IPv4_ADDRESS instances.
/// When DataSize is 0 and Data is NULL, the existing configuration
/// is cleared from the EFI IPv4 Configuration II Protocol instance.
///
Ip4Config2DataTypeGateway,
///
/// The DNS server list for the EFI IPv4 network stack running on
/// the communication device this EFI IPv4 Configuration II
/// Protocol manages. It is not configurable when the policy is
/// Ip4Config2PolicyDhcp. The DNS server addresses must be
/// unicast IPv4 addresses. The corresponding Data is a pointer to
/// an array of EFI_IPv4_ADDRESS instances. When DataSize
/// is 0 and Data is NULL, the existing configuration is cleared
/// from the EFI IPv4 Configuration II Protocol instance.
///
Ip4Config2DataTypeDnsServer,
Ip4Config2DataTypeMaximum
} EFI_IP4_CONFIG2_DATA_TYPE;
///
/// EFI_IP4_CONFIG2_INTERFACE_INFO related definitions
///
#define EFI_IP4_CONFIG2_INTERFACE_INFO_NAME_SIZE 32
///
/// EFI_IP4_CONFIG2_INTERFACE_INFO
///
typedef struct {
///
/// The name of the interface. It is a NULL-terminated Unicode string.
///
CHAR16 Name[EFI_IP4_CONFIG2_INTERFACE_INFO_NAME_SIZE];
///
/// The interface type of the network interface. See RFC 1700,
/// section "Number Hardware Type".
///
UINT8 IfType;
///
/// The size, in bytes, of the network interface's hardware address.
///
UINT32 HwAddressSize;
///
/// The hardware address for the network interface.
///
EFI_MAC_ADDRESS HwAddress;
///
/// The station IPv4 address of this EFI IPv4 network stack.
///
EFI_IPv4_ADDRESS StationAddress;
///
/// The subnet address mask that is associated with the station address.
///
EFI_IPv4_ADDRESS SubnetMask;
///
/// Size of the following RouteTable, in bytes. May be zero.
///
UINT32 RouteTableSize;
///
/// The route table of the IPv4 network stack runs on this interface.
/// Set to NULL if RouteTableSize is zero. Type EFI_IP4_ROUTE_TABLE is defined in
/// EFI_IP4_PROTOCOL.GetModeData().
///
EFI_IP4_ROUTE_TABLE *RouteTable OPTIONAL;
} EFI_IP4_CONFIG2_INTERFACE_INFO;
///
/// EFI_IP4_CONFIG2_POLICY
///
typedef enum {
///
/// Under this policy, the Ip4Config2DataTypeManualAddress,
/// Ip4Config2DataTypeGateway and Ip4Config2DataTypeDnsServer configuration
/// data are required to be set manually. The EFI IPv4 Protocol will get all
/// required configuration such as IPv4 address, subnet mask and
/// gateway settings from the EFI IPv4 Configuration II protocol.
///
Ip4Config2PolicyStatic,
///
/// Under this policy, the Ip4Config2DataTypeManualAddress,
/// Ip4Config2DataTypeGateway and Ip4Config2DataTypeDnsServer configuration data are
/// not allowed to set via SetData(). All of these configurations are retrieved from DHCP
/// server or other auto-configuration mechanism.
///
Ip4Config2PolicyDhcp,
Ip4Config2PolicyMax
} EFI_IP4_CONFIG2_POLICY;
///
/// EFI_IP4_CONFIG2_MANUAL_ADDRESS
///
typedef struct {
///
/// The IPv4 unicast address.
///
EFI_IPv4_ADDRESS Address;
///
/// The subnet mask.
///
EFI_IPv4_ADDRESS SubnetMask;
} EFI_IP4_CONFIG2_MANUAL_ADDRESS;
/**
Set the configuration for the EFI IPv4 network stack running on the communication device this EFI
IPv4 Configuration II Protocol instance manages.
This function is used to set the configuration data of type DataType for the EFI IPv4 network stack
running on the communication device this EFI IPv4 Configuration II Protocol instance manages.
The successfully configured data is valid after system reset or power-off.
The DataSize is used to calculate the count of structure instances in the Data for some
DataType that multiple structure instances are allowed.
This function is always non-blocking. When setting some typeof configuration data, an
asynchronous process is invoked to check the correctness of the data, such as doing address conflict
detection on the manually set local IPv4 address. EFI_NOT_READY is returned immediately to
indicate that such an asynchronous process is invoked and the process is not finished yet. The caller
willing to get the result of the asynchronous process is required to call RegisterDataNotify()
to register an event on the specified configuration data. Once the event is signaled, the caller can call
GetData()to get back the configuration data in order to know the result. For other types of
configuration data that do not require an asynchronous configuration process, the result of the
operation is immediately returned.
@param[in] This Pointer to the EFI_IP4_CONFIG2_PROTOCOL instance.
@param[in] DataType The type of data to set.
@param[in] DataSize Size of the buffer pointed to by Data in bytes.
@param[in] Data The data buffer to set. The type ofthe data buffer is associated
with the DataType.
@retval EFI_SUCCESS The specified configuration data for the EFI IPv4 network stack is set
successfully.
@retval EFI_INVALID_PARAMETER One or more of the following are TRUE:
This is NULL.
One or more fields in Data and DataSize do not match the
requirement of the data type indicated by DataType.
@retval EFI_WRITE_PROTECTED The specified configuration data is read-only or the specified configuration
data can not be set under the current policy.
@retval EFI_ACCESS_DENIED Another set operation on the specified configuration data is already in process.
@retval EFI_NOT_READY An asynchronous process is invoked to set the specified configuration data and
the process is not finished yet.
@retval EFI_BAD_BUFFER_SIZE The DataSize does not match the size of the type indicated by DataType.
@retval EFI_UNSUPPORTED This DataType is not supported.
@retval EFI_OUT_OF_RESOURCES Required system resources could not be allocated.
@retval EFI_DEVICE_ERROR An unexpected system error or network error occurred.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_CONFIG2_SET_DATA) (
IN EFI_IP4_CONFIG2_PROTOCOL *This,
IN EFI_IP4_CONFIG2_DATA_TYPE DataType,
IN UINTN DataSize,
IN VOID *Data
);
/**
Get the configuration data for the EFI IPv4 network stack running on the communication device this
EFI IPv4 Configuration II Protocol instance manages.
This function returns the configuration data of type DataType for the EFI IPv4 network stack
running on the communication device this EFI IPv4 Configuration II Protocol instance manages.
The caller is responsible for allocating the buffer usedto return the specified configuration data and
the required size will be returned to the caller if the size of the buffer is too small.
EFI_NOT_READY is returned if the specified configuration data is not ready due to an already in
progress asynchronous configuration process. The caller can call RegisterDataNotify() to
register an event on the specified configuration data. Once the asynchronous configuration process is
finished, the event will be signaled and a subsequent GetData() call will return the specified
configuration data.
@param[in] This Pointer to the EFI_IP4_CONFIG2_PROTOCOL instance.
@param[in] DataType The type of data to get.
@param[out] DataSize On input, in bytes, the size of Data. On output, in bytes, the size
of buffer required to store the specified configuration data.
@param[in] Data The data buffer in which the configuration data is returned. The
type of the data buffer is associated with the DataType. Ignored
if DataSize is 0.
@retval EFI_SUCCESS The specified configuration data is got successfully.
@retval EFI_INVALID_PARAMETER One or more of the followings are TRUE:
This is NULL.
DataSize is NULL.
Data is NULL if *DataSizeis not zero.
@retval EFI_BUFFER_TOO_SMALL The size of Data is too small for the specified configuration data
and the required size is returned in DataSize.
@retval EFI_NOT_READY The specified configuration data is not ready due to an already in
progress asynchronous configuration process.
@retval EFI_NOT_FOUND The specified configuration data is not found.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_CONFIG2_GET_DATA) (
IN EFI_IP4_CONFIG2_PROTOCOL *This,
IN EFI_IP4_CONFIG2_DATA_TYPE DataType,
IN OUT UINTN *DataSize,
IN VOID *Data OPTIONAL
);
/**
Register an event that is to be signaled whenever a configuration process on the specified
configuration data is done.
This function registers an event that is to be signaled whenever a configuration process on the
specified configuration data is done. An event can be registered for different DataType
simultaneously and the caller is responsible for determining which type of configuration data causes
the signaling of the event in such case.
@param[in] This Pointer to the EFI_IP4_CONFIG2_PROTOCOL instance.
@param[in] DataType The type of data to unregister the event for.
@param[in] Event The event to register.
@retval EFI_SUCCESS The notification event for the specified configuration data is
registered.
@retval EFI_INVALID_PARAMETER This is NULL or Event is NULL.
@retval EFI_UNSUPPORTED The configuration data type specified by DataType is not supported.
@retval EFI_OUT_OF_RESOURCES Required system resources could not be allocated.
@retval EFI_ACCESS_DENIED The Event is already registered for the DataType.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_CONFIG2_REGISTER_NOTIFY) (
IN EFI_IP4_CONFIG2_PROTOCOL *This,
IN EFI_IP4_CONFIG2_DATA_TYPE DataType,
IN EFI_EVENT Event
);
/**
Remove a previously registered event for the specified configuration data.
This function removes a previously registeredevent for the specified configuration data.
@param[in] This Pointer to the EFI_IP4_CONFIG2_PROTOCOL instance.
@param[in] DataType The type of data to remove the previously registered event for.
@param[in] Event The event to unregister.
@retval EFI_SUCCESS The event registered for the specified configuration data is removed.
@retval EFI_INVALID_PARAMETER This is NULL or Event is NULL.
@retval EFI_NOT_FOUND The Eventhas not been registered for the specified DataType.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_CONFIG2_UNREGISTER_NOTIFY) (
IN EFI_IP4_CONFIG2_PROTOCOL *This,
IN EFI_IP4_CONFIG2_DATA_TYPE DataType,
IN EFI_EVENT Event
);
///
/// The EFI_IP4_CONFIG2_PROTOCOL is designed to be the central repository for the common
/// configurations and the administrator configurable settings for the EFI IPv4 network stack.
/// An EFI IPv4 Configuration II Protocol instance will be installed on each communication device that
/// the EFI IPv4 network stack runs on.
///
struct _EFI_IP4_CONFIG2_PROTOCOL {
EFI_IP4_CONFIG2_SET_DATA SetData;
EFI_IP4_CONFIG2_GET_DATA GetData;
EFI_IP4_CONFIG2_REGISTER_NOTIFY RegisterDataNotify;
EFI_IP4_CONFIG2_UNREGISTER_NOTIFY UnregisterDataNotify;
};
extern EFI_GUID gEfiIp4Config2ProtocolGuid;
#endif
diff --git a/stand/efi/include/Protocol/ServiceBinding.h b/stand/efi/include/Protocol/ServiceBinding.h
index 39602b086e5b..ac501515ac67 100644
--- a/stand/efi/include/Protocol/ServiceBinding.h
+++ b/stand/efi/include/Protocol/ServiceBinding.h
@@ -1,95 +1,94 @@
-/* $FreeBSD$ */
/** @file
UEFI Service Binding Protocol is defined in UEFI specification.
The file defines the generic Service Binding Protocol functions.
It provides services that are required to create and destroy child
handles that support a given set of protocols.
Copyright (c) 2006 - 2018, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __EFI_SERVICE_BINDING_H__
#define __EFI_SERVICE_BINDING_H__
///
/// Forward reference for pure ANSI compatibility
///
typedef struct _EFI_SERVICE_BINDING_PROTOCOL EFI_SERVICE_BINDING_PROTOCOL;
/**
Creates a child handle and installs a protocol.
The CreateChild() function installs a protocol on ChildHandle.
If ChildHandle is a pointer to NULL, then a new handle is created and returned in ChildHandle.
If ChildHandle is not a pointer to NULL, then the protocol installs on the existing ChildHandle.
@param This Pointer to the EFI_SERVICE_BINDING_PROTOCOL instance.
@param ChildHandle Pointer to the handle of the child to create. If it is NULL,
then a new handle is created. If it is a pointer to an existing UEFI handle,
then the protocol is added to the existing UEFI handle.
@retval EFI_SUCCES The protocol was added to ChildHandle.
@retval EFI_INVALID_PARAMETER ChildHandle is NULL.
@retval EFI_OUT_OF_RESOURCES There are not enough resources available to create
the child
@retval other The child handle was not created
**/
typedef
EFI_STATUS
(EFIAPI *EFI_SERVICE_BINDING_CREATE_CHILD)(
IN EFI_SERVICE_BINDING_PROTOCOL *This,
IN OUT EFI_HANDLE *ChildHandle
);
/**
Destroys a child handle with a protocol installed on it.
The DestroyChild() function does the opposite of CreateChild(). It removes a protocol
that was installed by CreateChild() from ChildHandle. If the removed protocol is the
last protocol on ChildHandle, then ChildHandle is destroyed.
@param This Pointer to the EFI_SERVICE_BINDING_PROTOCOL instance.
@param ChildHandle Handle of the child to destroy
@retval EFI_SUCCES The protocol was removed from ChildHandle.
@retval EFI_UNSUPPORTED ChildHandle does not support the protocol that is being removed.
@retval EFI_INVALID_PARAMETER Child handle is NULL.
@retval EFI_ACCESS_DENIED The protocol could not be removed from the ChildHandle
because its services are being used.
@retval other The child handle was not destroyed
**/
typedef
EFI_STATUS
(EFIAPI *EFI_SERVICE_BINDING_DESTROY_CHILD)(
IN EFI_SERVICE_BINDING_PROTOCOL *This,
IN EFI_HANDLE ChildHandle
);
///
/// The EFI_SERVICE_BINDING_PROTOCOL provides member functions to create and destroy
/// child handles. A driver is responsible for adding protocols to the child handle
/// in CreateChild() and removing protocols in DestroyChild(). It is also required
/// that the CreateChild() function opens the parent protocol BY_CHILD_CONTROLLER
/// to establish the parent-child relationship, and closes the protocol in DestroyChild().
/// The pseudo code for CreateChild() and DestroyChild() is provided to specify the
/// required behavior, not to specify the required implementation. Each consumer of
/// a software protocol is responsible for calling CreateChild() when it requires the
/// protocol and calling DestroyChild() when it is finished with that protocol.
///
struct _EFI_SERVICE_BINDING_PROTOCOL {
EFI_SERVICE_BINDING_CREATE_CHILD CreateChild;
EFI_SERVICE_BINDING_DESTROY_CHILD DestroyChild;
};
#endif
diff --git a/stand/efi/include/README b/stand/efi/include/README
index bf821fae7e60..126cfa752f69 100644
--- a/stand/efi/include/README
+++ b/stand/efi/include/README
@@ -1,36 +1,35 @@
-/* $FreeBSD$ */
/*-
Files in this directory and subdirectories are subject to the following
copyright unless superceded or supplemented by additional specific license
terms found in the file headers of individual files.
Copyright (c) 1998-2000 Intel Corporation
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL INTEL BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT 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 SUCH DAMAGE. THE EFI SPECIFICATION AND ALL
OTHER INFORMATION ON THIS WEB SITE ARE PROVIDED "AS IS" WITH NO
WARRANTIES, AND ARE SUBJECT TO CHANGE WITHOUT NOTICE.
*/
diff --git a/stand/efi/include/amd64/efibind.h b/stand/efi/include/amd64/efibind.h
index 8cfce5bbc5f1..2f900786fb9d 100644
--- a/stand/efi/include/amd64/efibind.h
+++ b/stand/efi/include/amd64/efibind.h
@@ -1,271 +1,270 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 1999 - 2003 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efefind.h
Abstract:
EFI to compile bindings
Revision History
--*/
#pragma pack()
#ifdef __FreeBSD__
#include <sys/stdint.h>
#else
//
// Basic int types of various widths
//
#if (__STDC_VERSION__ < 199901L )
// No ANSI C 1999/2000 stdint.h integer width declarations
#ifdef _MSC_EXTENSIONS
// Use Microsoft C compiler integer width declarations
typedef unsigned __int64 uint64_t;
typedef __int64 int64_t;
typedef unsigned __int32 uint32_t;
typedef __int32 int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#else
#ifdef UNIX_LP64
// Use LP64 programming model from C_FLAGS for integer width declarations
typedef unsigned long uint64_t;
typedef long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#else
// Assume P64 programming model from C_FLAGS for integer width declarations
typedef unsigned long long uint64_t;
typedef long long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#endif
#endif
#endif
#endif /* __FreeBSD__ */
//
// Basic EFI types of various widths
//
#ifndef ACPI_THREAD_ID /* ACPI's definitions are fine */
#define ACPI_USE_SYSTEM_INTTYPES 1 /* Tell ACPI we've defined types */
typedef uint64_t UINT64;
typedef int64_t INT64;
#ifndef _BASETSD_H_
typedef uint32_t UINT32;
typedef int32_t INT32;
#endif
typedef uint16_t UINT16;
typedef int16_t INT16;
typedef uint8_t UINT8;
typedef int8_t INT8;
#endif
#undef VOID
#define VOID void
typedef int64_t INTN;
typedef uint64_t UINTN;
#ifdef EFI_NT_EMULATOR
#define POST_CODE(_Data)
#else
#ifdef EFI_DEBUG
#define POST_CODE(_Data) __asm mov eax,(_Data) __asm out 0x80,al
#else
#define POST_CODE(_Data)
#endif
#endif
#define EFIERR(a) (0x8000000000000000 | a)
#define EFI_ERROR_MASK 0x8000000000000000
#define EFIERR_OEM(a) (0xc000000000000000 | a)
#define BAD_POINTER 0xFBFBFBFBFBFBFBFB
#define MAX_ADDRESS 0xFFFFFFFFFFFFFFFF
#define BREAKPOINT() __asm { int 3 }
//
// Pointers must be aligned to these address to function
//
#define MIN_ALIGNMENT_SIZE 4
#define ALIGN_VARIABLE(Value ,Adjustment) \
(UINTN)Adjustment = 0; \
if((UINTN)Value % MIN_ALIGNMENT_SIZE) \
(UINTN)Adjustment = MIN_ALIGNMENT_SIZE - ((UINTN)Value % MIN_ALIGNMENT_SIZE); \
Value = (UINTN)Value + (UINTN)Adjustment
//
// Define macros to build data structure signatures from characters.
//
#define EFI_SIGNATURE_16(A,B) ((A) | (B<<8))
#define EFI_SIGNATURE_32(A,B,C,D) (EFI_SIGNATURE_16(A,B) | (EFI_SIGNATURE_16(C,D) << 16))
#define EFI_SIGNATURE_64(A,B,C,D,E,F,G,H) (EFI_SIGNATURE_32(A,B,C,D) | ((UINT64)(EFI_SIGNATURE_32(E,F,G,H)) << 32))
//
// EFIAPI - prototype calling convention for EFI function pointers
// BOOTSERVICE - prototype for implementation of a boot service interface
// RUNTIMESERVICE - prototype for implementation of a runtime service interface
// RUNTIMEFUNCTION - prototype for implementation of a runtime function that is not a service
// RUNTIME_CODE - pragma macro for declaring runtime code
//
#ifdef __amd64__
#define EFIAPI __attribute__((ms_abi))
#endif
#ifndef EFIAPI // Forces EFI calling conventions reguardless of compiler options
#ifdef _MSC_EXTENSIONS
#define EFIAPI __cdecl // Force C calling convention for Microsoft C compiler
#else
#define EFIAPI // Substitute expresion to force C calling convention
#endif
#endif
#define BOOTSERVICE
//#define RUNTIMESERVICE(proto,a) alloc_text("rtcode",a); proto a
//#define RUNTIMEFUNCTION(proto,a) alloc_text("rtcode",a); proto a
#define RUNTIMESERVICE
#define RUNTIMEFUNCTION
#define RUNTIME_CODE(a) alloc_text("rtcode", a)
#define BEGIN_RUNTIME_DATA() data_seg("rtdata")
#define END_RUNTIME_DATA() data_seg("")
#define VOLATILE volatile
#define MEMORY_FENCE()
#ifdef EFI_NO_INTERFACE_DECL
#define EFI_FORWARD_DECLARATION(x)
#define EFI_INTERFACE_DECL(x)
#else
#define EFI_FORWARD_DECLARATION(x) typedef struct _##x x
#define EFI_INTERFACE_DECL(x) typedef struct x
#endif
#ifdef EFI_NT_EMULATOR
//
// To help ensure proper coding of integrated drivers, they are
// compiled as DLLs. In NT they require a dll init entry pointer.
// The macro puts a stub entry point into the DLL so it will load.
//
#define EFI_DRIVER_ENTRY_POINT(InitFunction) \
EFI_STATUS \
InitFunction ( \
EFI_HANDLE ImageHandle, \
EFI_SYSTEM_TABLE *SystemTable \
); \
\
UINTN \
__stdcall \
_DllMainCRTStartup ( \
UINTN Inst, \
UINTN reason_for_call, \
VOID *rserved \
) \
{ \
return 1; \
} \
\
int \
__declspec( dllexport ) \
__cdecl \
InitializeDriver ( \
void *ImageHandle, \
void *SystemTable \
) \
{ \
return InitFunction(ImageHandle, SystemTable); \
}
#define LOAD_INTERNAL_DRIVER(_if, type, name, entry) \
(_if)->LoadInternal(type, name, NULL)
#else // EFI_NT_EMULATOR
//
// When building similar to FW, link everything together as
// one big module.
//
#define EFI_DRIVER_ENTRY_POINT(InitFunction)
#define LOAD_INTERNAL_DRIVER(_if, type, name, entry) \
(_if)->LoadInternal(type, name, entry)
#endif // EFI_FW_NT
#ifdef __FreeBSD__
#define INTERFACE_DECL(x) struct x
#else
//
// Some compilers don't support the forward reference construct:
// typedef struct XXXXX
//
// The following macro provide a workaround for such cases.
//
#ifdef NO_INTERFACE_DECL
#define INTERFACE_DECL(x)
#else
#define INTERFACE_DECL(x) typedef struct x
#endif
#endif /* __FreeBSD__ */
#ifdef _MSC_EXTENSIONS
#pragma warning ( disable : 4731 ) // Suppress warnings about modification of EBP
#endif
diff --git a/stand/efi/include/amd64/pe.h b/stand/efi/include/amd64/pe.h
index f8033c55ac55..ad5985cc2740 100644
--- a/stand/efi/include/amd64/pe.h
+++ b/stand/efi/include/amd64/pe.h
@@ -1,591 +1,590 @@
-/* $FreeBSD$ */
/*
PE32+ header file
*/
#ifndef _PE_H
#define _PE_H
#define IMAGE_DOS_SIGNATURE 0x5A4D // MZ
#define IMAGE_OS2_SIGNATURE 0x454E // NE
#define IMAGE_OS2_SIGNATURE_LE 0x454C // LE
#define IMAGE_NT_SIGNATURE 0x00004550 // PE00
#define IMAGE_EDOS_SIGNATURE 0x44454550 // PEED
typedef struct _IMAGE_DOS_HEADER { // DOS .EXE header
UINT16 e_magic; // Magic number
UINT16 e_cblp; // Bytes on last page of file
UINT16 e_cp; // Pages in file
UINT16 e_crlc; // Relocations
UINT16 e_cparhdr; // Size of header in paragraphs
UINT16 e_minalloc; // Minimum extra paragraphs needed
UINT16 e_maxalloc; // Maximum extra paragraphs needed
UINT16 e_ss; // Initial (relative) SS value
UINT16 e_sp; // Initial SP value
UINT16 e_csum; // Checksum
UINT16 e_ip; // Initial IP value
UINT16 e_cs; // Initial (relative) CS value
UINT16 e_lfarlc; // File address of relocation table
UINT16 e_ovno; // Overlay number
UINT16 e_res[4]; // Reserved words
UINT16 e_oemid; // OEM identifier (for e_oeminfo)
UINT16 e_oeminfo; // OEM information; e_oemid specific
UINT16 e_res2[10]; // Reserved words
UINT32 e_lfanew; // File address of new exe header
} IMAGE_DOS_HEADER, *PIMAGE_DOS_HEADER;
typedef struct _IMAGE_OS2_HEADER { // OS/2 .EXE header
UINT16 ne_magic; // Magic number
UINT8 ne_ver; // Version number
UINT8 ne_rev; // Revision number
UINT16 ne_enttab; // Offset of Entry Table
UINT16 ne_cbenttab; // Number of bytes in Entry Table
UINT32 ne_crc; // Checksum of whole file
UINT16 ne_flags; // Flag UINT16
UINT16 ne_autodata; // Automatic data segment number
UINT16 ne_heap; // Initial heap allocation
UINT16 ne_stack; // Initial stack allocation
UINT32 ne_csip; // Initial CS:IP setting
UINT32 ne_sssp; // Initial SS:SP setting
UINT16 ne_cseg; // Count of file segments
UINT16 ne_cmod; // Entries in Module Reference Table
UINT16 ne_cbnrestab; // Size of non-resident name table
UINT16 ne_segtab; // Offset of Segment Table
UINT16 ne_rsrctab; // Offset of Resource Table
UINT16 ne_restab; // Offset of resident name table
UINT16 ne_modtab; // Offset of Module Reference Table
UINT16 ne_imptab; // Offset of Imported Names Table
UINT32 ne_nrestab; // Offset of Non-resident Names Table
UINT16 ne_cmovent; // Count of movable entries
UINT16 ne_align; // Segment alignment shift count
UINT16 ne_cres; // Count of resource segments
UINT8 ne_exetyp; // Target Operating system
UINT8 ne_flagsothers; // Other .EXE flags
UINT16 ne_pretthunks; // offset to return thunks
UINT16 ne_psegrefbytes; // offset to segment ref. bytes
UINT16 ne_swaparea; // Minimum code swap area size
UINT16 ne_expver; // Expected Windows version number
} IMAGE_OS2_HEADER, *PIMAGE_OS2_HEADER;
//
// File header format.
//
typedef struct _IMAGE_FILE_HEADER {
UINT16 Machine;
UINT16 NumberOfSections;
UINT32 TimeDateStamp;
UINT32 PointerToSymbolTable;
UINT32 NumberOfSymbols;
UINT16 SizeOfOptionalHeader;
UINT16 Characteristics;
} IMAGE_FILE_HEADER, *PIMAGE_FILE_HEADER;
#define IMAGE_SIZEOF_FILE_HEADER 20
#define IMAGE_FILE_RELOCS_STRIPPED 0x0001 // Relocation info stripped from file.
#define IMAGE_FILE_EXECUTABLE_IMAGE 0x0002 // File is executable (i.e. no unresolved externel references).
#define IMAGE_FILE_LINE_NUMS_STRIPPED 0x0004 // Line nunbers stripped from file.
#define IMAGE_FILE_LOCAL_SYMS_STRIPPED 0x0008 // Local symbols stripped from file.
#define IMAGE_FILE_BYTES_REVERSED_LO 0x0080 // Bytes of machine word are reversed.
#define IMAGE_FILE_32BIT_MACHINE 0x0100 // 32 bit word machine.
#define IMAGE_FILE_DEBUG_STRIPPED 0x0200 // Debugging info stripped from file in .DBG file
#define IMAGE_FILE_SYSTEM 0x1000 // System File.
#define IMAGE_FILE_DLL 0x2000 // File is a DLL.
#define IMAGE_FILE_BYTES_REVERSED_HI 0x8000 // Bytes of machine word are reversed.
#define IMAGE_FILE_MACHINE_UNKNOWN 0
#define IMAGE_FILE_MACHINE_I386 0x14c // Intel 386.
#define IMAGE_FILE_MACHINE_R3000 0x162 // MIPS little-endian, 0540 big-endian
#define IMAGE_FILE_MACHINE_R4000 0x166 // MIPS little-endian
#define IMAGE_FILE_MACHINE_ALPHA 0x184 // Alpha_AXP
#define IMAGE_FILE_MACHINE_POWERPC 0x1F0 // IBM PowerPC Little-Endian
#define IMAGE_FILE_MACHINE_TAHOE 0x7cc // Intel EM machine
//
// Directory format.
//
typedef struct _IMAGE_DATA_DIRECTORY {
UINT32 VirtualAddress;
UINT32 Size;
} IMAGE_DATA_DIRECTORY, *PIMAGE_DATA_DIRECTORY;
#define IMAGE_NUMBEROF_DIRECTORY_ENTRIES 16
//
// Optional header format.
//
typedef struct _IMAGE_OPTIONAL_HEADER {
//
// Standard fields.
//
UINT16 Magic;
UINT8 MajorLinkerVersion;
UINT8 MinorLinkerVersion;
UINT32 SizeOfCode;
UINT32 SizeOfInitializedData;
UINT32 SizeOfUninitializedData;
UINT32 AddressOfEntryPoint;
UINT32 BaseOfCode;
UINT32 BaseOfData;
//
// NT additional fields.
//
UINT32 ImageBase;
UINT32 SectionAlignment;
UINT32 FileAlignment;
UINT16 MajorOperatingSystemVersion;
UINT16 MinorOperatingSystemVersion;
UINT16 MajorImageVersion;
UINT16 MinorImageVersion;
UINT16 MajorSubsystemVersion;
UINT16 MinorSubsystemVersion;
UINT32 Reserved1;
UINT32 SizeOfImage;
UINT32 SizeOfHeaders;
UINT32 CheckSum;
UINT16 Subsystem;
UINT16 DllCharacteristics;
UINT32 SizeOfStackReserve;
UINT32 SizeOfStackCommit;
UINT32 SizeOfHeapReserve;
UINT32 SizeOfHeapCommit;
UINT32 LoaderFlags;
UINT32 NumberOfRvaAndSizes;
IMAGE_DATA_DIRECTORY DataDirectory[IMAGE_NUMBEROF_DIRECTORY_ENTRIES];
} IMAGE_OPTIONAL_HEADER, *PIMAGE_OPTIONAL_HEADER;
typedef struct _IMAGE_ROM_OPTIONAL_HEADER {
UINT16 Magic;
UINT8 MajorLinkerVersion;
UINT8 MinorLinkerVersion;
UINT32 SizeOfCode;
UINT32 SizeOfInitializedData;
UINT32 SizeOfUninitializedData;
UINT32 AddressOfEntryPoint;
UINT32 BaseOfCode;
UINT32 BaseOfData;
UINT32 BaseOfBss;
UINT32 GprMask;
UINT32 CprMask[4];
UINT32 GpValue;
} IMAGE_ROM_OPTIONAL_HEADER, *PIMAGE_ROM_OPTIONAL_HEADER;
#define IMAGE_SIZEOF_ROM_OPTIONAL_HEADER 56
#define IMAGE_SIZEOF_STD_OPTIONAL_HEADER 28
#define IMAGE_SIZEOF_NT_OPTIONAL_HEADER 224
#define IMAGE_NT_OPTIONAL_HDR_MAGIC 0x10b
#define IMAGE_ROM_OPTIONAL_HDR_MAGIC 0x107
typedef struct _IMAGE_NT_HEADERS {
UINT32 Signature;
IMAGE_FILE_HEADER FileHeader;
IMAGE_OPTIONAL_HEADER OptionalHeader;
} IMAGE_NT_HEADERS, *PIMAGE_NT_HEADERS;
typedef struct _IMAGE_ROM_HEADERS {
IMAGE_FILE_HEADER FileHeader;
IMAGE_ROM_OPTIONAL_HEADER OptionalHeader;
} IMAGE_ROM_HEADERS, *PIMAGE_ROM_HEADERS;
#define IMAGE_FIRST_SECTION( ntheader ) ((PIMAGE_SECTION_HEADER) \
((UINT32)ntheader + \
FIELD_OFFSET( IMAGE_NT_HEADERS, OptionalHeader ) + \
((PIMAGE_NT_HEADERS)(ntheader))->FileHeader.SizeOfOptionalHeader \
))
// Subsystem Values
#define IMAGE_SUBSYSTEM_UNKNOWN 0 // Unknown subsystem.
#define IMAGE_SUBSYSTEM_NATIVE 1 // Image doesn't require a subsystem.
#define IMAGE_SUBSYSTEM_WINDOWS_GUI 2 // Image runs in the Windows GUI subsystem.
#define IMAGE_SUBSYSTEM_WINDOWS_CUI 3 // Image runs in the Windows character subsystem.
#define IMAGE_SUBSYSTEM_OS2_CUI 5 // image runs in the OS/2 character subsystem.
#define IMAGE_SUBSYSTEM_POSIX_CUI 7 // image run in the Posix character subsystem.
// Directory Entries
#define IMAGE_DIRECTORY_ENTRY_EXPORT 0 // Export Directory
#define IMAGE_DIRECTORY_ENTRY_IMPORT 1 // Import Directory
#define IMAGE_DIRECTORY_ENTRY_RESOURCE 2 // Resource Directory
#define IMAGE_DIRECTORY_ENTRY_EXCEPTION 3 // Exception Directory
#define IMAGE_DIRECTORY_ENTRY_SECURITY 4 // Security Directory
#define IMAGE_DIRECTORY_ENTRY_BASERELOC 5 // Base Relocation Table
#define IMAGE_DIRECTORY_ENTRY_DEBUG 6 // Debug Directory
#define IMAGE_DIRECTORY_ENTRY_COPYRIGHT 7 // Description String
#define IMAGE_DIRECTORY_ENTRY_GLOBALPTR 8 // Machine Value (MIPS GP)
#define IMAGE_DIRECTORY_ENTRY_TLS 9 // TLS Directory
#define IMAGE_DIRECTORY_ENTRY_LOAD_CONFIG 10 // Load Configuration Directory
//
// Section header format.
//
#define IMAGE_SIZEOF_SHORT_NAME 8
typedef struct _IMAGE_SECTION_HEADER {
UINT8 Name[IMAGE_SIZEOF_SHORT_NAME];
union {
UINT32 PhysicalAddress;
UINT32 VirtualSize;
} Misc;
UINT32 VirtualAddress;
UINT32 SizeOfRawData;
UINT32 PointerToRawData;
UINT32 PointerToRelocations;
UINT32 PointerToLinenumbers;
UINT16 NumberOfRelocations;
UINT16 NumberOfLinenumbers;
UINT32 Characteristics;
} IMAGE_SECTION_HEADER, *PIMAGE_SECTION_HEADER;
#define IMAGE_SIZEOF_SECTION_HEADER 40
#define IMAGE_SCN_TYPE_NO_PAD 0x00000008 // Reserved.
#define IMAGE_SCN_CNT_CODE 0x00000020 // Section contains code.
#define IMAGE_SCN_CNT_INITIALIZED_DATA 0x00000040 // Section contains initialized data.
#define IMAGE_SCN_CNT_UNINITIALIZED_DATA 0x00000080 // Section contains uninitialized data.
#define IMAGE_SCN_LNK_OTHER 0x00000100 // Reserved.
#define IMAGE_SCN_LNK_INFO 0x00000200 // Section contains comments or some other type of information.
#define IMAGE_SCN_LNK_REMOVE 0x00000800 // Section contents will not become part of image.
#define IMAGE_SCN_LNK_COMDAT 0x00001000 // Section contents comdat.
#define IMAGE_SCN_ALIGN_1BYTES 0x00100000 //
#define IMAGE_SCN_ALIGN_2BYTES 0x00200000 //
#define IMAGE_SCN_ALIGN_4BYTES 0x00300000 //
#define IMAGE_SCN_ALIGN_8BYTES 0x00400000 //
#define IMAGE_SCN_ALIGN_16BYTES 0x00500000 // Default alignment if no others are specified.
#define IMAGE_SCN_ALIGN_32BYTES 0x00600000 //
#define IMAGE_SCN_ALIGN_64BYTES 0x00700000 //
#define IMAGE_SCN_MEM_DISCARDABLE 0x02000000 // Section can be discarded.
#define IMAGE_SCN_MEM_NOT_CACHED 0x04000000 // Section is not cachable.
#define IMAGE_SCN_MEM_NOT_PAGED 0x08000000 // Section is not pageable.
#define IMAGE_SCN_MEM_SHARED 0x10000000 // Section is shareable.
#define IMAGE_SCN_MEM_EXECUTE 0x20000000 // Section is executable.
#define IMAGE_SCN_MEM_READ 0x40000000 // Section is readable.
#define IMAGE_SCN_MEM_WRITE 0x80000000 // Section is writeable.
//
// Symbol format.
//
#define IMAGE_SIZEOF_SYMBOL 18
//
// Section values.
//
// Symbols have a section number of the section in which they are
// defined. Otherwise, section numbers have the following meanings:
//
#define IMAGE_SYM_UNDEFINED (UINT16)0 // Symbol is undefined or is common.
#define IMAGE_SYM_ABSOLUTE (UINT16)-1 // Symbol is an absolute value.
#define IMAGE_SYM_DEBUG (UINT16)-2 // Symbol is a special debug item.
//
// Type (fundamental) values.
//
#define IMAGE_SYM_TYPE_NULL 0 // no type.
#define IMAGE_SYM_TYPE_VOID 1 //
#define IMAGE_SYM_TYPE_CHAR 2 // type character.
#define IMAGE_SYM_TYPE_SHORT 3 // type short integer.
#define IMAGE_SYM_TYPE_INT 4 //
#define IMAGE_SYM_TYPE_LONG 5 //
#define IMAGE_SYM_TYPE_FLOAT 6 //
#define IMAGE_SYM_TYPE_DOUBLE 7 //
#define IMAGE_SYM_TYPE_STRUCT 8 //
#define IMAGE_SYM_TYPE_UNION 9 //
#define IMAGE_SYM_TYPE_ENUM 10 // enumeration.
#define IMAGE_SYM_TYPE_MOE 11 // member of enumeration.
#define IMAGE_SYM_TYPE_BYTE 12 //
#define IMAGE_SYM_TYPE_WORD 13 //
#define IMAGE_SYM_TYPE_UINT 14 //
#define IMAGE_SYM_TYPE_DWORD 15 //
//
// Type (derived) values.
//
#define IMAGE_SYM_DTYPE_NULL 0 // no derived type.
#define IMAGE_SYM_DTYPE_POINTER 1 // pointer.
#define IMAGE_SYM_DTYPE_FUNCTION 2 // function.
#define IMAGE_SYM_DTYPE_ARRAY 3 // array.
//
// Storage classes.
//
#define IMAGE_SYM_CLASS_END_OF_FUNCTION (BYTE )-1
#define IMAGE_SYM_CLASS_NULL 0
#define IMAGE_SYM_CLASS_AUTOMATIC 1
#define IMAGE_SYM_CLASS_EXTERNAL 2
#define IMAGE_SYM_CLASS_STATIC 3
#define IMAGE_SYM_CLASS_REGISTER 4
#define IMAGE_SYM_CLASS_EXTERNAL_DEF 5
#define IMAGE_SYM_CLASS_LABEL 6
#define IMAGE_SYM_CLASS_UNDEFINED_LABEL 7
#define IMAGE_SYM_CLASS_MEMBER_OF_STRUCT 8
#define IMAGE_SYM_CLASS_ARGUMENT 9
#define IMAGE_SYM_CLASS_STRUCT_TAG 10
#define IMAGE_SYM_CLASS_MEMBER_OF_UNION 11
#define IMAGE_SYM_CLASS_UNION_TAG 12
#define IMAGE_SYM_CLASS_TYPE_DEFINITION 13
#define IMAGE_SYM_CLASS_UNDEFINED_STATIC 14
#define IMAGE_SYM_CLASS_ENUM_TAG 15
#define IMAGE_SYM_CLASS_MEMBER_OF_ENUM 16
#define IMAGE_SYM_CLASS_REGISTER_PARAM 17
#define IMAGE_SYM_CLASS_BIT_FIELD 18
#define IMAGE_SYM_CLASS_BLOCK 100
#define IMAGE_SYM_CLASS_FUNCTION 101
#define IMAGE_SYM_CLASS_END_OF_STRUCT 102
#define IMAGE_SYM_CLASS_FILE 103
// new
#define IMAGE_SYM_CLASS_SECTION 104
#define IMAGE_SYM_CLASS_WEAK_EXTERNAL 105
// type packing constants
#define N_BTMASK 017
#define N_TMASK 060
#define N_TMASK1 0300
#define N_TMASK2 0360
#define N_BTSHFT 4
#define N_TSHIFT 2
// MACROS
//
// Communal selection types.
//
#define IMAGE_COMDAT_SELECT_NODUPLICATES 1
#define IMAGE_COMDAT_SELECT_ANY 2
#define IMAGE_COMDAT_SELECT_SAME_SIZE 3
#define IMAGE_COMDAT_SELECT_EXACT_MATCH 4
#define IMAGE_COMDAT_SELECT_ASSOCIATIVE 5
#define IMAGE_WEAK_EXTERN_SEARCH_NOLIBRARY 1
#define IMAGE_WEAK_EXTERN_SEARCH_LIBRARY 2
#define IMAGE_WEAK_EXTERN_SEARCH_ALIAS 3
//
// Relocation format.
//
typedef struct _IMAGE_RELOCATION {
UINT32 VirtualAddress;
UINT32 SymbolTableIndex;
UINT16 Type;
} IMAGE_RELOCATION;
#define IMAGE_SIZEOF_RELOCATION 10
//
// I386 relocation types.
//
#define IMAGE_REL_I386_ABSOLUTE 0 // Reference is absolute, no relocation is necessary
#define IMAGE_REL_I386_DIR16 01 // Direct 16-bit reference to the symbols virtual address
#define IMAGE_REL_I386_REL16 02 // PC-relative 16-bit reference to the symbols virtual address
#define IMAGE_REL_I386_DIR32 06 // Direct 32-bit reference to the symbols virtual address
#define IMAGE_REL_I386_DIR32NB 07 // Direct 32-bit reference to the symbols virtual address, base not included
#define IMAGE_REL_I386_SEG12 011 // Direct 16-bit reference to the segment-selector bits of a 32-bit virtual address
#define IMAGE_REL_I386_SECTION 012
#define IMAGE_REL_I386_SECREL 013
#define IMAGE_REL_I386_REL32 024 // PC-relative 32-bit reference to the symbols virtual address
//
// MIPS relocation types.
//
#define IMAGE_REL_MIPS_ABSOLUTE 0 // Reference is absolute, no relocation is necessary
#define IMAGE_REL_MIPS_REFHALF 01
#define IMAGE_REL_MIPS_REFWORD 02
#define IMAGE_REL_MIPS_JMPADDR 03
#define IMAGE_REL_MIPS_REFHI 04
#define IMAGE_REL_MIPS_REFLO 05
#define IMAGE_REL_MIPS_GPREL 06
#define IMAGE_REL_MIPS_LITERAL 07
#define IMAGE_REL_MIPS_SECTION 012
#define IMAGE_REL_MIPS_SECREL 013
#define IMAGE_REL_MIPS_REFWORDNB 042
#define IMAGE_REL_MIPS_PAIR 045
//
// Alpha Relocation types.
//
#define IMAGE_REL_ALPHA_ABSOLUTE 0x0
#define IMAGE_REL_ALPHA_REFLONG 0x1
#define IMAGE_REL_ALPHA_REFQUAD 0x2
#define IMAGE_REL_ALPHA_GPREL32 0x3
#define IMAGE_REL_ALPHA_LITERAL 0x4
#define IMAGE_REL_ALPHA_LITUSE 0x5
#define IMAGE_REL_ALPHA_GPDISP 0x6
#define IMAGE_REL_ALPHA_BRADDR 0x7
#define IMAGE_REL_ALPHA_HINT 0x8
#define IMAGE_REL_ALPHA_INLINE_REFLONG 0x9
#define IMAGE_REL_ALPHA_REFHI 0xA
#define IMAGE_REL_ALPHA_REFLO 0xB
#define IMAGE_REL_ALPHA_PAIR 0xC
#define IMAGE_REL_ALPHA_MATCH 0xD
#define IMAGE_REL_ALPHA_SECTION 0xE
#define IMAGE_REL_ALPHA_SECREL 0xF
#define IMAGE_REL_ALPHA_REFLONGNB 0x10
//
// IBM PowerPC relocation types.
//
#define IMAGE_REL_PPC_ABSOLUTE 0x0000 // NOP
#define IMAGE_REL_PPC_ADDR64 0x0001 // 64-bit address
#define IMAGE_REL_PPC_ADDR32 0x0002 // 32-bit address
#define IMAGE_REL_PPC_ADDR24 0x0003 // 26-bit address, shifted left 2 (branch absolute)
#define IMAGE_REL_PPC_ADDR16 0x0004 // 16-bit address
#define IMAGE_REL_PPC_ADDR14 0x0005 // 16-bit address, shifted left 2 (load doubleword)
#define IMAGE_REL_PPC_REL24 0x0006 // 26-bit PC-relative offset, shifted left 2 (branch relative)
#define IMAGE_REL_PPC_REL14 0x0007 // 16-bit PC-relative offset, shifted left 2 (br cond relative)
#define IMAGE_REL_PPC_TOCREL16 0x0008 // 16-bit offset from TOC base
#define IMAGE_REL_PPC_TOCREL14 0x0009 // 16-bit offset from TOC base, shifted left 2 (load doubleword)
#define IMAGE_REL_PPC_ADDR32NB 0x000A // 32-bit addr w/o image base
#define IMAGE_REL_PPC_SECREL 0x000B // va of containing section (as in an image sectionhdr)
#define IMAGE_REL_PPC_SECTION 0x000C // sectionheader number
#define IMAGE_REL_PPC_IFGLUE 0x000D // substitute TOC restore instruction iff symbol is glue code
#define IMAGE_REL_PPC_IMGLUE 0x000E // symbol is glue code; virtual address is TOC restore instruction
#define IMAGE_REL_PPC_TYPEMASK 0x00FF // mask to isolate above values in IMAGE_RELOCATION.Type
// Flag bits in IMAGE_RELOCATION.TYPE
#define IMAGE_REL_PPC_NEG 0x0100 // subtract reloc value rather than adding it
#define IMAGE_REL_PPC_BRTAKEN 0x0200 // fix branch prediction bit to predict branch taken
#define IMAGE_REL_PPC_BRNTAKEN 0x0400 // fix branch prediction bit to predict branch not taken
#define IMAGE_REL_PPC_TOCDEFN 0x0800 // toc slot defined in file (or, data in toc)
//
// Based relocation format.
//
typedef struct _IMAGE_BASE_RELOCATION {
UINT32 VirtualAddress;
UINT32 SizeOfBlock;
// UINT16 TypeOffset[1];
} IMAGE_BASE_RELOCATION, *PIMAGE_BASE_RELOCATION;
#define IMAGE_SIZEOF_BASE_RELOCATION 8
//
// Based relocation types.
//
#define IMAGE_REL_BASED_ABSOLUTE 0
#define IMAGE_REL_BASED_HIGH 1
#define IMAGE_REL_BASED_LOW 2
#define IMAGE_REL_BASED_HIGHLOW 3
#define IMAGE_REL_BASED_HIGHADJ 4
#define IMAGE_REL_BASED_MIPS_JMPADDR 5
#define IMAGE_REL_BASED_DIR64 10
//
// Line number format.
//
typedef struct _IMAGE_LINENUMBER {
union {
UINT32 SymbolTableIndex; // Symbol table index of function name if Linenumber is 0.
UINT32 VirtualAddress; // Virtual address of line number.
} Type;
UINT16 Linenumber; // Line number.
} IMAGE_LINENUMBER;
#define IMAGE_SIZEOF_LINENUMBER 6
//
// Archive format.
//
#define IMAGE_ARCHIVE_START_SIZE 8
#define IMAGE_ARCHIVE_START "!<arch>\n"
#define IMAGE_ARCHIVE_END "`\n"
#define IMAGE_ARCHIVE_PAD "\n"
#define IMAGE_ARCHIVE_LINKER_MEMBER "/ "
#define IMAGE_ARCHIVE_LONGNAMES_MEMBER "// "
typedef struct _IMAGE_ARCHIVE_MEMBER_HEADER {
UINT8 Name[16]; // File member name - `/' terminated.
UINT8 Date[12]; // File member date - decimal.
UINT8 UserID[6]; // File member user id - decimal.
UINT8 GroupID[6]; // File member group id - decimal.
UINT8 Mode[8]; // File member mode - octal.
UINT8 Size[10]; // File member size - decimal.
UINT8 EndHeader[2]; // String to end header.
} IMAGE_ARCHIVE_MEMBER_HEADER, *PIMAGE_ARCHIVE_MEMBER_HEADER;
#define IMAGE_SIZEOF_ARCHIVE_MEMBER_HDR 60
//
// DLL support.
//
//
// Export Format
//
typedef struct _IMAGE_EXPORT_DIRECTORY {
UINT32 Characteristics;
UINT32 TimeDateStamp;
UINT16 MajorVersion;
UINT16 MinorVersion;
UINT32 Name;
UINT32 Base;
UINT32 NumberOfFunctions;
UINT32 NumberOfNames;
UINT32 *AddressOfFunctions;
UINT32 *AddressOfNames;
UINT32 *AddressOfNameOrdinals;
} IMAGE_EXPORT_DIRECTORY, *PIMAGE_EXPORT_DIRECTORY;
//
// Import Format
//
typedef struct _IMAGE_IMPORT_BY_NAME {
UINT16 Hint;
UINT8 Name[1];
} IMAGE_IMPORT_BY_NAME, *PIMAGE_IMPORT_BY_NAME;
typedef struct _IMAGE_THUNK_DATA {
union {
UINT32 Function;
UINT32 Ordinal;
PIMAGE_IMPORT_BY_NAME AddressOfData;
} u1;
} IMAGE_THUNK_DATA, *PIMAGE_THUNK_DATA;
#define IMAGE_ORDINAL_FLAG 0x80000000
#define IMAGE_SNAP_BY_ORDINAL(Ordinal) ((Ordinal & IMAGE_ORDINAL_FLAG) != 0)
#define IMAGE_ORDINAL(Ordinal) (Ordinal & 0xffff)
typedef struct _IMAGE_IMPORT_DESCRIPTOR {
UINT32 Characteristics;
UINT32 TimeDateStamp;
UINT32 ForwarderChain;
UINT32 Name;
PIMAGE_THUNK_DATA FirstThunk;
} IMAGE_IMPORT_DESCRIPTOR, *PIMAGE_IMPORT_DESCRIPTOR;
#endif
diff --git a/stand/efi/include/arm/efibind.h b/stand/efi/include/arm/efibind.h
index 177032adc01a..8bc9f4b56eb2 100644
--- a/stand/efi/include/arm/efibind.h
+++ b/stand/efi/include/arm/efibind.h
@@ -1,165 +1,164 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 2004 - 2012, Intel Corporation. All rights reserved.
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
Module Name:
EfiBind.h
Abstract:
Processor or Compiler specific defines and types for IA-32.
We are using the ANSI C 2000 _t type definitions for basic types.
This it technically a violation of the coding standard, but they
are used to make EfiTypes.h portable. Code other than EfiTypes.h
should never use any ANSI C 2000 _t integer types.
--*/
#ifndef _EFI_BIND_H_
#define _EFI_BIND_H_
#define EFI_DRIVER_ENTRY_POINT(InitFunction)
#define EFI_APPLICATION_ENTRY_POINT EFI_DRIVER_ENTRY_POINT
//
// Make sure we are using the correct packing rules per EFI specification
//
#ifndef __GNUC__
#pragma pack()
#endif
#ifdef __FreeBSD__
#include <sys/stdint.h>
#else
//
// Assume standard IA-32 alignment.
// BugBug: Need to check portability of long long
//
typedef unsigned long long uint64_t;
typedef long long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef signed char int8_t;
#endif
typedef uint64_t UINT64;
typedef int64_t INT64;
typedef uint32_t UINT32;
typedef int32_t INT32;
typedef uint16_t UINT16;
typedef int16_t INT16;
typedef uint8_t UINT8;
typedef int8_t INT8;
#undef VOID
#define VOID void
//
// Native integer size in stdint.h
//
typedef uint32_t UINTN;
typedef int32_t INTN;
#define EFIERR(a) (0x80000000 | a)
#define EFI_ERROR_MASK 0x80000000
#define EFIERR_OEM(a) (0xc0000000 | a)
//
// Processor specific defines
//
#define EFI_MAX_BIT 0x80000000
#define MAX_2_BITS 0xC0000000
//
// Maximum legal IA-32 address
//
#define EFI_MAX_ADDRESS 0xFFFFFFFF
//
// Bad pointer value to use in check builds.
// if you see this value you are using uninitialized or free'ed data
//
#define EFI_BAD_POINTER 0xAFAFAFAF
#define EFI_BAD_POINTER_AS_BYTE 0xAF
#define EFI_DEADLOOP() { volatile UINTN __iii; __iii = 1; while (__iii); }
//
// Inject a break point in the code to assist debugging for NT Emulation Environment
// For real hardware, just put in a halt loop. Don't do a while(1) because the
// compiler will optimize away the rest of the function following, so that you run out in
// the weeds if you skip over it with a debugger.
//
#define EFI_BREAKPOINT EFI_DEADLOOP()
//
// Memory Fence forces serialization, and is needed to support out of order
// memory transactions. The Memory Fence is mainly used to make sure IO
// transactions complete in a deterministic sequence, and to syncronize locks
// an other MP code. Currently no memory fencing is required.
//
#define MEMORY_FENCE()
//
// Some compilers don't support the forward reference construct:
// typedef struct XXXXX. The forward reference is required for
// ANSI compatibility.
//
// The following macro provide a workaround for such cases.
//
#ifdef EFI_NO_INTERFACE_DECL
#define EFI_FORWARD_DECLARATION(x)
#else
#define EFI_FORWARD_DECLARATION(x) typedef struct _##x x
#endif
//
// Some C compilers optimize the calling conventions to increase performance.
// EFIAPI is used to make all public APIs follow the standard C calling
// convention.
//
#define EFIAPI
//
// For symbol name in GNU assembly code, an extra "_" is necessary
//
#if defined(__GNUC__)
///
/// Private worker functions for ASM_PFX()
///
#define _CONCATENATE(a, b) __CONCATENATE(a, b)
#define __CONCATENATE(a, b) a ## b
///
/// The __USER_LABEL_PREFIX__ macro predefined by GNUC represents the prefix
/// on symbols in assembly language.
///
#define ASM_PFX(name) _CONCATENATE (__USER_LABEL_PREFIX__, name)
#endif
#define INTERFACE_DECL(x) struct x
#endif
diff --git a/stand/efi/include/arm64/efibind.h b/stand/efi/include/arm64/efibind.h
index 4751e2e944a8..4fdfd9f21386 100644
--- a/stand/efi/include/arm64/efibind.h
+++ b/stand/efi/include/arm64/efibind.h
@@ -1,217 +1,216 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 1999 - 2003 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efefind.h
Abstract:
EFI to compile bindings
Revision History
--*/
#pragma pack()
#ifdef __FreeBSD__
#include <sys/stdint.h>
#else
//
// Basic int types of various widths
//
#if (__STDC_VERSION__ < 199901L )
// No ANSI C 1999/2000 stdint.h integer width declarations
#ifdef _MSC_EXTENSIONS
// Use Microsoft C compiler integer width declarations
typedef unsigned __int64 uint64_t;
typedef __int64 int64_t;
typedef unsigned __int32 uint32_t;
typedef __int32 int32_t;
typedef unsigned __int16 uint16_t;
typedef __int16 int16_t;
typedef unsigned __int8 uint8_t;
typedef __int8 int8_t;
#else
#ifdef UNIX_LP64
// Use LP64 programming model from C_FLAGS for integer width declarations
typedef unsigned long uint64_t;
typedef long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#else
// Assume P64 programming model from C_FLAGS for integer width declarations
typedef unsigned long long uint64_t;
typedef long long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#endif
#endif
#endif
#endif /* __FreeBSD__ */
//
// Basic EFI types of various widths
//
typedef uint64_t UINT64;
typedef int64_t INT64;
typedef uint32_t UINT32;
typedef int32_t INT32;
typedef uint16_t UINT16;
typedef int16_t INT16;
typedef uint8_t UINT8;
typedef int8_t INT8;
#undef VOID
#define VOID void
typedef int64_t INTN;
typedef uint64_t UINTN;
//++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
// BugBug: Code to debug
//
#define BIT63 0x8000000000000000
#define PLATFORM_IOBASE_ADDRESS (0xffffc000000 | BIT63)
#define PORT_TO_MEMD(_Port) (PLATFORM_IOBASE_ADDRESS | ( ( ( (_Port) & 0xfffc) << 10 ) | ( (_Port) & 0x0fff) ) )
//
// Macro's with casts make this much easier to use and read.
//
#define PORT_TO_MEM8D(_Port) (*(UINT8 *)(PORT_TO_MEMD(_Port)))
#define POST_CODE(_Data) (PORT_TO_MEM8D(0x80) = (_Data))
//
// BugBug: End Debug Code!!!
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
#define EFIERR(a) (0x8000000000000000 | a)
#define EFI_ERROR_MASK 0x8000000000000000
#define EFIERR_OEM(a) (0xc000000000000000 | a)
#define BAD_POINTER 0xFBFBFBFBFBFBFBFB
#define MAX_ADDRESS 0xFFFFFFFFFFFFFFFF
#define BREAKPOINT() __break(0)
//
// Pointers must be aligned to these address to function
// you will get an alignment fault if this value is less than 8
//
#define MIN_ALIGNMENT_SIZE 8
#define ALIGN_VARIABLE(Value , Adjustment) \
(UINTN) Adjustment = 0; \
if((UINTN)Value % MIN_ALIGNMENT_SIZE) \
(UINTN)Adjustment = MIN_ALIGNMENT_SIZE - ((UINTN)Value % MIN_ALIGNMENT_SIZE); \
Value = (UINTN)Value + (UINTN)Adjustment
//
// Define macros to create data structure signatures.
//
#define EFI_SIGNATURE_16(A,B) ((A) | (B<<8))
#define EFI_SIGNATURE_32(A,B,C,D) (EFI_SIGNATURE_16(A,B) | (EFI_SIGNATURE_16(C,D) << 16))
#define EFI_SIGNATURE_64(A,B,C,D,E,F,G,H) (EFI_SIGNATURE_32(A,B,C,D) | ((UINT64)(EFI_SIGNATURE_32(E,F,G,H)) << 32))
//
// EFIAPI - prototype calling convention for EFI function pointers
// BOOTSERVICE - prototype for implementation of a boot service interface
// RUNTIMESERVICE - prototype for implementation of a runtime service interface
// RUNTIMEFUNCTION - prototype for implementation of a runtime function that is not a service
// RUNTIME_CODE - pragma macro for declaring runtime code
//
#ifndef EFIAPI // Forces EFI calling conventions reguardless of compiler options
#ifdef _MSC_EXTENSIONS
#define EFIAPI __cdecl // Force C calling convention for Microsoft C compiler
#else
#define EFIAPI // Substitute expresion to force C calling convention
#endif
#endif
#define BOOTSERVICE
#define RUNTIMESERVICE
#define RUNTIMEFUNCTION
#define RUNTIME_CODE(a) alloc_text("rtcode", a)
#define BEGIN_RUNTIME_DATA() data_seg("rtdata")
#define END_RUNTIME_DATA() data_seg()
#define VOLATILE volatile
//
// BugBug: Need to find out if this is portable across compilers.
//
void __mfa (void);
#define MEMORY_FENCE() __mfa()
#ifdef EFI_NO_INTERFACE_DECL
#define EFI_FORWARD_DECLARATION(x)
#define EFI_INTERFACE_DECL(x)
#else
#define EFI_FORWARD_DECLARATION(x) typedef struct _##x x
#define EFI_INTERFACE_DECL(x) typedef struct x
#endif
//
// When build similar to FW, then link everything together as
// one big module.
//
#define EFI_DRIVER_ENTRY_POINT(InitFunction)
#define LOAD_INTERNAL_DRIVER(_if, type, name, entry) \
(_if)->LoadInternal(type, name, entry)
// entry(NULL, ST)
#ifdef __FreeBSD__
#define INTERFACE_DECL(x) struct x
#else
//
// Some compilers don't support the forward reference construct:
// typedef struct XXXXX
//
// The following macro provide a workaround for such cases.
//
#ifdef NO_INTERFACE_DECL
#define INTERFACE_DECL(x)
#else
#define INTERFACE_DECL(x) typedef struct x
#endif
#endif
diff --git a/stand/efi/include/efi.h b/stand/efi/include/efi.h
index 7e44a5b819fc..20776dcee2fc 100644
--- a/stand/efi/include/efi.h
+++ b/stand/efi/include/efi.h
@@ -1,77 +1,76 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efi.h
Abstract:
Public EFI header files
Revision History
--*/
//
// Build flags on input
// EFI32
// EFI_DEBUG - Enable debugging code
// EFI_NT_EMULATOR - Building for running under NT
//
#ifndef _EFI_INCLUDE_
#define _EFI_INCLUDE_
#define EFI_FIRMWARE_VENDOR L"INTEL"
#define EFI_FIRMWARE_MAJOR_REVISION 14
#define EFI_FIRMWARE_MINOR_REVISION 62
#define EFI_FIRMWARE_REVISION ((EFI_FIRMWARE_MAJOR_REVISION <<16) | (EFI_FIRMWARE_MINOR_REVISION))
#include "efibind.h"
#include "efidef.h"
#include "efidevp.h"
#include "efipciio.h"
#include "efiprot.h"
#include "eficon.h"
#include "eficonsctl.h"
#include "efiser.h"
#include "efi_nii.h"
#include "efipxebc.h"
#include "efinet.h"
#include "efiapi.h"
#include "efifs.h"
#include "efierr.h"
#include "efigop.h"
#include "efiip.h"
#include "efiudp.h"
#include "efitcp.h"
#include "efipoint.h"
#include "efiuga.h"
#include <sys/types.h>
/*
* Global variables
*/
extern EFI_LOADED_IMAGE *boot_img;
extern bool boot_services_active;
/*
* FreeBSD UUID
*/
#define FREEBSD_BOOT_VAR_GUID \
{ 0xCFEE69AD, 0xA0DE, 0x47A9, {0x93, 0xA8, 0xF6, 0x31, 0x06, 0xF8, 0xAE, 0x99} }
#endif
diff --git a/stand/efi/include/efi_nii.h b/stand/efi/include/efi_nii.h
index 561cbd46a3ea..069e318428ea 100644
--- a/stand/efi/include/efi_nii.h
+++ b/stand/efi/include/efi_nii.h
@@ -1,86 +1,85 @@
-/* $FreeBSD$ */
#ifndef _EFI_NII_H
#define _EFI_NII_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module name:
efi_nii.h
Abstract:
Revision history:
2000-Feb-18 M(f)J GUID updated.
Structure order changed for machine word alignment.
Added StringId[4] to structure.
2000-Feb-14 M(f)J Genesis.
--*/
#define EFI_NETWORK_INTERFACE_IDENTIFIER_PROTOCOL \
{ 0xE18541CD, 0xF755, 0x4f73, {0x92, 0x8D, 0x64, 0x3C, 0x8A, 0x79, 0xB2, 0x29} }
#define EFI_NETWORK_INTERFACE_IDENTIFIER_PROTOCOL_31 \
{ 0x1ACED566, 0x76ED, 0x4218, {0xBC, 0x81, 0x76, 0x7F, 0x1F, 0x97, 0x7A, 0x89} }
#define EFI_NETWORK_INTERFACE_IDENTIFIER_INTERFACE_REVISION 0x00010000
#define EFI_NETWORK_INTERFACE_IDENTIFIER_INTERFACE_REVISION_31 0x00010001
typedef enum {
EfiNetworkInterfaceUndi = 1
} EFI_NETWORK_INTERFACE_TYPE;
typedef struct {
UINT64 Revision;
// Revision of the network interface identifier protocol interface.
UINT64 ID;
// Address of the first byte of the identifying structure for this
// network interface. This is set to zero if there is no structure.
//
// For PXE/UNDI this is the first byte of the !PXE structure.
UINT64 ImageAddr;
// Address of the UNrelocated driver/ROM image. This is set
// to zero if there is no driver/ROM image.
//
// For 16-bit UNDI, this is the first byte of the option ROM in
// upper memory.
//
// For 32/64-bit S/W UNDI, this is the first byte of the EFI ROM
// image.
//
// For H/W UNDI, this is set to zero.
UINT32 ImageSize;
// Size of the UNrelocated driver/ROM image of this network interface.
// This is set to zero if there is no driver/ROM image.
CHAR8 StringId[4];
// 4 char ASCII string to go in class identifier (option 60) in DHCP
// and Boot Server discover packets.
// For EfiNetworkInterfaceUndi this field is "UNDI".
// For EfiNetworkInterfaceSnp this field is "SNPN".
UINT8 Type;
UINT8 MajorVer;
UINT8 MinorVer;
// Information to be placed into the PXE DHCP and Discover packets.
// This is the network interface type and version number that will
// be placed into DHCP option 94 (client network interface identifier).
BOOLEAN Ipv6Supported;
UINT8 IfNum; // interface number to be used with pxeid structure
} EFI_NETWORK_INTERFACE_IDENTIFIER_INTERFACE;
extern EFI_GUID NetworkInterfaceIdentifierProtocol;
extern EFI_GUID NetworkInterfaceIdentifierProtocol_31;
#endif // _EFI_NII_H
diff --git a/stand/efi/include/efiapi.h b/stand/efi/include/efiapi.h
index 2347a4d9cf73..6c96c6f707ad 100644
--- a/stand/efi/include/efiapi.h
+++ b/stand/efi/include/efiapi.h
@@ -1,1196 +1,1195 @@
-/* $FreeBSD$ */
#ifndef _EFI_API_H
#define _EFI_API_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efiapi.h
Abstract:
Global EFI runtime & boot service interfaces
Revision History
--*/
//
// EFI Specification Revision
//
#define EFI_SPECIFICATION_MAJOR_REVISION 1
#define EFI_SPECIFICATION_MINOR_REVISION 10
//
// Declare forward referenced data structures
//
INTERFACE_DECL(_EFI_SYSTEM_TABLE);
//
// EFI Memory
//
typedef
EFI_STATUS
(EFIAPI *EFI_ALLOCATE_PAGES) (
IN EFI_ALLOCATE_TYPE Type,
IN EFI_MEMORY_TYPE MemoryType,
IN UINTN NoPages,
OUT EFI_PHYSICAL_ADDRESS *Memory
);
typedef
EFI_STATUS
(EFIAPI *EFI_FREE_PAGES) (
IN EFI_PHYSICAL_ADDRESS Memory,
IN UINTN NoPages
);
typedef
EFI_STATUS
(EFIAPI *EFI_GET_MEMORY_MAP) (
IN OUT UINTN *MemoryMapSize,
IN OUT EFI_MEMORY_DESCRIPTOR *MemoryMap,
OUT UINTN *MapKey,
OUT UINTN *DescriptorSize,
OUT UINT32 *DescriptorVersion
);
#define NextMemoryDescriptor(Ptr,Size) ((EFI_MEMORY_DESCRIPTOR *) (((UINT8 *) Ptr) + Size))
typedef
EFI_STATUS
(EFIAPI *EFI_ALLOCATE_POOL) (
IN EFI_MEMORY_TYPE PoolType,
IN UINTN Size,
OUT VOID **Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_FREE_POOL) (
IN VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_SET_VIRTUAL_ADDRESS_MAP) (
IN UINTN MemoryMapSize,
IN UINTN DescriptorSize,
IN UINT32 DescriptorVersion,
IN EFI_MEMORY_DESCRIPTOR *VirtualMap
);
#define EFI_OPTIONAL_PTR 0x00000001
#define EFI_INTERNAL_FNC 0x00000002 // Pointer to internal runtime fnc
#define EFI_INTERNAL_PTR 0x00000004 // Pointer to internal runtime data
typedef
EFI_STATUS
(EFIAPI *EFI_CONVERT_POINTER) (
IN UINTN DebugDisposition,
IN OUT VOID **Address
);
//
// EFI Events
//
#define EVT_TIMER 0x80000000
#define EVT_RUNTIME 0x40000000
#define EVT_RUNTIME_CONTEXT 0x20000000
#define EVT_NOTIFY_WAIT 0x00000100
#define EVT_NOTIFY_SIGNAL 0x00000200
#define EVT_SIGNAL_EXIT_BOOT_SERVICES 0x00000201
#define EVT_SIGNAL_VIRTUAL_ADDRESS_CHANGE 0x60000202
#define EVT_EFI_SIGNAL_MASK 0x000000FF
#define EVT_EFI_SIGNAL_MAX 2
typedef
VOID
(EFIAPI *EFI_EVENT_NOTIFY) (
IN EFI_EVENT Event,
IN VOID *Context
);
typedef
EFI_STATUS
(EFIAPI *EFI_CREATE_EVENT) (
IN UINT32 Type,
IN EFI_TPL NotifyTpl,
IN EFI_EVENT_NOTIFY NotifyFunction,
IN VOID *NotifyContext,
OUT EFI_EVENT *Event
);
typedef enum {
TimerCancel,
TimerPeriodic,
TimerRelative,
TimerTypeMax
} EFI_TIMER_DELAY;
typedef
EFI_STATUS
(EFIAPI *EFI_SET_TIMER) (
IN EFI_EVENT Event,
IN EFI_TIMER_DELAY Type,
IN UINT64 TriggerTime
);
typedef
EFI_STATUS
(EFIAPI *EFI_SIGNAL_EVENT) (
IN EFI_EVENT Event
);
typedef
EFI_STATUS
(EFIAPI *EFI_WAIT_FOR_EVENT) (
IN UINTN NumberOfEvents,
IN EFI_EVENT *Event,
OUT UINTN *Index
);
typedef
EFI_STATUS
(EFIAPI *EFI_CLOSE_EVENT) (
IN EFI_EVENT Event
);
typedef
EFI_STATUS
(EFIAPI *EFI_CHECK_EVENT) (
IN EFI_EVENT Event
);
//
// Task priority level
//
#define TPL_APPLICATION 4
#define TPL_CALLBACK 8
#define TPL_NOTIFY 16
#define TPL_HIGH_LEVEL 31
typedef
EFI_TPL
(EFIAPI *EFI_RAISE_TPL) (
IN EFI_TPL NewTpl
);
typedef
VOID
(EFIAPI *EFI_RESTORE_TPL) (
IN EFI_TPL OldTpl
);
//
// EFI platform varibles
//
#define EFI_GLOBAL_VARIABLE \
{ 0x8BE4DF61, 0x93CA, 0x11d2, {0xAA, 0x0D, 0x00, 0xE0, 0x98, 0x03, 0x2B, 0x8C} }
// Variable attributes
#define EFI_VARIABLE_NON_VOLATILE 0x00000001
#define EFI_VARIABLE_BOOTSERVICE_ACCESS 0x00000002
#define EFI_VARIABLE_RUNTIME_ACCESS 0x00000004
#define EFI_VARIABLE_HARDWARE_ERROR_RECORD 0x00000008
#define EFI_VARIABLE_AUTHENTICATED_WRITE_ACCESS 0x00000010
#define EFI_VARIABLE_TIME_BASED_AUTHENTICATED_WRITE_ACCESS 0x00000020
#define EFI_VARIABLE_APPEND_WRITE 0x00000040
// Variable size limitation
#define EFI_MAXIMUM_VARIABLE_SIZE 1024
typedef
EFI_STATUS
(EFIAPI *EFI_GET_VARIABLE) (
IN CHAR16 *VariableName,
IN EFI_GUID *VendorGuid,
OUT UINT32 *Attributes OPTIONAL,
IN OUT UINTN *DataSize,
OUT VOID *Data
);
typedef
EFI_STATUS
(EFIAPI *EFI_GET_NEXT_VARIABLE_NAME) (
IN OUT UINTN *VariableNameSize,
IN OUT CHAR16 *VariableName,
IN OUT EFI_GUID *VendorGuid
);
typedef
EFI_STATUS
(EFIAPI *EFI_SET_VARIABLE) (
IN const CHAR16 *VariableName,
IN EFI_GUID *VendorGuid,
IN UINT32 Attributes,
IN UINTN DataSize,
IN VOID *Data
);
//
// EFI Time
//
typedef struct {
UINT32 Resolution; // 1e-6 parts per million
UINT32 Accuracy; // hertz
BOOLEAN SetsToZero; // Set clears sub-second time
} EFI_TIME_CAPABILITIES;
typedef
EFI_STATUS
(EFIAPI *EFI_GET_TIME) (
OUT EFI_TIME *Time,
OUT EFI_TIME_CAPABILITIES *Capabilities OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_SET_TIME) (
IN EFI_TIME *Time
);
typedef
EFI_STATUS
(EFIAPI *EFI_GET_WAKEUP_TIME) (
OUT BOOLEAN *Enabled,
OUT BOOLEAN *Pending,
OUT EFI_TIME *Time
);
typedef
EFI_STATUS
(EFIAPI *EFI_SET_WAKEUP_TIME) (
IN BOOLEAN Enable,
IN EFI_TIME *Time OPTIONAL
);
//
// Image functions
//
// PE32+ Subsystem type for EFI images
#if !defined(IMAGE_SUBSYSTEM_EFI_APPLICATION)
#define IMAGE_SUBSYSTEM_EFI_APPLICATION 10
#define IMAGE_SUBSYSTEM_EFI_BOOT_SERVICE_DRIVER 11
#define IMAGE_SUBSYSTEM_EFI_RUNTIME_DRIVER 12
#endif
// PE32+ Machine type for EFI images
#if !defined(EFI_IMAGE_MACHINE_IA32)
#define EFI_IMAGE_MACHINE_IA32 0x014c
#endif
#if !defined(EFI_IMAGE_MACHINE_EBC)
#define EFI_IMAGE_MACHINE_EBC 0x0EBC
#endif
// Image Entry prototype
typedef
EFI_STATUS
(EFIAPI *EFI_IMAGE_ENTRY_POINT) (
IN EFI_HANDLE ImageHandle,
IN struct _EFI_SYSTEM_TABLE *SystemTable
);
typedef
EFI_STATUS
(EFIAPI *EFI_IMAGE_LOAD) (
IN BOOLEAN BootPolicy,
IN EFI_HANDLE ParentImageHandle,
IN EFI_DEVICE_PATH *FilePath,
IN VOID *SourceBuffer OPTIONAL,
IN UINTN SourceSize,
OUT EFI_HANDLE *ImageHandle
);
typedef
EFI_STATUS
(EFIAPI *EFI_IMAGE_START) (
IN EFI_HANDLE ImageHandle,
OUT UINTN *ExitDataSize,
OUT CHAR16 **ExitData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_EXIT) (
IN EFI_HANDLE ImageHandle,
IN EFI_STATUS ExitStatus,
IN UINTN ExitDataSize,
IN CHAR16 *ExitData OPTIONAL
) __dead2;
typedef
EFI_STATUS
(EFIAPI *EFI_IMAGE_UNLOAD) (
IN EFI_HANDLE ImageHandle
);
// Image handle
#define LOADED_IMAGE_PROTOCOL \
{ 0x5B1B31A1, 0x9562, 0x11d2, {0x8E, 0x3F, 0x00, 0xA0, 0xC9, 0x69, 0x72, 0x3B} }
#define EFI_LOADED_IMAGE_INFORMATION_REVISION 0x1000
typedef struct {
UINT32 Revision;
EFI_HANDLE ParentHandle;
struct _EFI_SYSTEM_TABLE *SystemTable;
// Source location of image
EFI_HANDLE DeviceHandle;
EFI_DEVICE_PATH *FilePath;
VOID *Reserved;
// Images load options
UINT32 LoadOptionsSize;
VOID *LoadOptions;
// Location of where image was loaded
VOID *ImageBase;
UINT64 ImageSize;
EFI_MEMORY_TYPE ImageCodeType;
EFI_MEMORY_TYPE ImageDataType;
// If the driver image supports a dynamic unload request
EFI_IMAGE_UNLOAD Unload;
} EFI_LOADED_IMAGE;
typedef
EFI_STATUS
(EFIAPI *EFI_EXIT_BOOT_SERVICES) (
IN EFI_HANDLE ImageHandle,
IN UINTN MapKey
);
//
// Misc
//
typedef
EFI_STATUS
(EFIAPI *EFI_STALL) (
IN UINTN Microseconds
);
typedef
EFI_STATUS
(EFIAPI *EFI_SET_WATCHDOG_TIMER) (
IN UINTN Timeout,
IN UINT64 WatchdogCode,
IN UINTN DataSize,
IN CHAR16 *WatchdogData OPTIONAL
);
typedef enum {
EfiResetCold,
EfiResetWarm,
EfiResetShutdown
} EFI_RESET_TYPE;
typedef
VOID
(EFIAPI *EFI_RESET_SYSTEM) (
IN EFI_RESET_TYPE ResetType,
IN EFI_STATUS ResetStatus,
IN UINTN DataSize,
IN CHAR16 *ResetData OPTIONAL
) __dead2;
typedef
EFI_STATUS
(EFIAPI *EFI_GET_NEXT_MONOTONIC_COUNT) (
OUT UINT64 *Count
);
typedef
EFI_STATUS
(EFIAPI *EFI_GET_NEXT_HIGH_MONO_COUNT) (
OUT UINT32 *HighCount
);
//
// Protocol handler functions
//
typedef enum {
EFI_NATIVE_INTERFACE
} EFI_INTERFACE_TYPE;
typedef
EFI_STATUS
(EFIAPI *EFI_INSTALL_PROTOCOL_INTERFACE) (
IN OUT EFI_HANDLE *Handle,
IN EFI_GUID *Protocol,
IN EFI_INTERFACE_TYPE InterfaceType,
IN VOID *Interface
);
typedef
EFI_STATUS
(EFIAPI *EFI_REINSTALL_PROTOCOL_INTERFACE) (
IN EFI_HANDLE Handle,
IN EFI_GUID *Protocol,
IN VOID *OldInterface,
IN VOID *NewInterface
);
typedef
EFI_STATUS
(EFIAPI *EFI_UNINSTALL_PROTOCOL_INTERFACE) (
IN EFI_HANDLE Handle,
IN EFI_GUID *Protocol,
IN VOID *Interface
);
typedef
EFI_STATUS
(EFIAPI *EFI_HANDLE_PROTOCOL) (
IN EFI_HANDLE Handle,
IN EFI_GUID *Protocol,
OUT VOID **Interface
);
typedef
EFI_STATUS
(EFIAPI *EFI_REGISTER_PROTOCOL_NOTIFY) (
IN EFI_GUID *Protocol,
IN EFI_EVENT Event,
OUT VOID **Registration
);
typedef enum {
AllHandles,
ByRegisterNotify,
ByProtocol
} EFI_LOCATE_SEARCH_TYPE;
typedef
EFI_STATUS
(EFIAPI *EFI_LOCATE_HANDLE) (
IN EFI_LOCATE_SEARCH_TYPE SearchType,
IN EFI_GUID *Protocol OPTIONAL,
IN VOID *SearchKey OPTIONAL,
IN OUT UINTN *BufferSize,
OUT EFI_HANDLE *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_LOCATE_DEVICE_PATH) (
IN EFI_GUID *Protocol,
IN OUT EFI_DEVICE_PATH **DevicePath,
OUT EFI_HANDLE *Device
);
typedef
EFI_STATUS
(EFIAPI *EFI_INSTALL_CONFIGURATION_TABLE) (
IN EFI_GUID *Guid,
IN VOID *Table
);
typedef
EFI_STATUS
(EFIAPI *EFI_RESERVED_SERVICE) (
VOID
);
typedef
EFI_STATUS
(EFIAPI *EFI_CONNECT_CONTROLLER) (
IN EFI_HANDLE ControllerHandle,
IN EFI_HANDLE *DriverImageHandle OPTIONAL,
IN EFI_DEVICE_PATH *RemainingDevicePath OPTIONAL,
IN BOOLEAN Recursive
);
typedef
EFI_STATUS
(EFIAPI *EFI_DISCONNECT_CONTROLLER)(
IN EFI_HANDLE ControllerHandle,
IN EFI_HANDLE DriverImageHandle, OPTIONAL
IN EFI_HANDLE ChildHandle OPTIONAL
);
#define EFI_OPEN_PROTOCOL_BY_HANDLE_PROTOCOL 0x00000001
#define EFI_OPEN_PROTOCOL_GET_PROTOCOL 0x00000002
#define EFI_OPEN_PROTOCOL_TEST_PROTOCOL 0x00000004
#define EFI_OPEN_PROTOCOL_BY_CHILD_CONTROLLER 0x00000008
#define EFI_OPEN_PROTOCOL_BY_DRIVER 0x00000010
#define EFI_OPEN_PROTOCOL_EXCLUSIVE 0x00000020
typedef
EFI_STATUS
(EFIAPI *EFI_OPEN_PROTOCOL) (
IN EFI_HANDLE Handle,
IN EFI_GUID *Protocol,
OUT VOID **Interface,
IN EFI_HANDLE ImageHandle,
IN EFI_HANDLE ControllerHandle, OPTIONAL
IN UINT32 Attributes
);
typedef
EFI_STATUS
(EFIAPI *EFI_CLOSE_PROTOCOL) (
IN EFI_HANDLE Handle,
IN EFI_GUID *Protocol,
IN EFI_HANDLE ImageHandle,
IN EFI_HANDLE DeviceHandle
);
typedef struct {
EFI_HANDLE AgentHandle;
EFI_HANDLE ControllerHandle;
UINT32 Attributes;
UINT32 OpenCount;
} EFI_OPEN_PROTOCOL_INFORMATION_ENTRY;
typedef
EFI_STATUS
(EFIAPI *EFI_OPEN_PROTOCOL_INFORMATION) (
IN EFI_HANDLE UserHandle,
IN EFI_GUID *Protocol,
IN EFI_OPEN_PROTOCOL_INFORMATION_ENTRY **EntryBuffer,
OUT UINTN *EntryCount
);
typedef
EFI_STATUS
(EFIAPI *EFI_PROTOCOLS_PER_HANDLE) (
IN EFI_HANDLE UserHandle,
OUT EFI_GUID ***ProtocolBuffer,
OUT UINTN *ProtocolBufferCount
);
typedef
EFI_STATUS
(EFIAPI *EFI_LOCATE_HANDLE_BUFFER) (
IN EFI_LOCATE_SEARCH_TYPE SearchType,
IN EFI_GUID *Protocol OPTIONAL,
IN VOID *SearchKey OPTIONAL,
IN OUT UINTN *NumberHandles,
OUT EFI_HANDLE **Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_LOCATE_PROTOCOL) (
EFI_GUID *Protocol,
VOID *Registration, OPTIONAL
VOID **Interface
);
typedef
EFI_STATUS
(EFIAPI *EFI_INSTALL_MULTIPLE_PROTOCOL_INTERFACES) (
IN OUT EFI_HANDLE *Handle,
...
);
typedef
EFI_STATUS
(EFIAPI *EFI_UNINSTALL_MULTIPLE_PROTOCOL_INTERFACES) (
IN EFI_HANDLE Handle,
...
);
typedef
EFI_STATUS
(EFIAPI *EFI_CALCULATE_CRC32) (
IN VOID *Data,
IN UINTN DataSize,
OUT UINT32 *Crc32
);
typedef
VOID
(EFIAPI *EFI_COPY_MEM) (
IN VOID *Destination,
IN VOID *Source,
IN UINTN Length
);
typedef
VOID
(EFIAPI *EFI_SET_MEM) (
IN VOID *Buffer,
IN UINTN Size,
IN UINT8 Value
);
//
// Standard EFI table header
//
typedef struct _EFI_TABLE_HEARDER {
UINT64 Signature;
UINT32 Revision;
UINT32 HeaderSize;
UINT32 CRC32;
UINT32 Reserved;
} EFI_TABLE_HEADER;
//
// EFI Runtime Serivces Table
//
#define EFI_RUNTIME_SERVICES_SIGNATURE 0x56524553544e5552
#define EFI_RUNTIME_SERVICES_REVISION ((EFI_SPECIFICATION_MAJOR_REVISION<<16) | (EFI_SPECIFICATION_MINOR_REVISION))
typedef struct {
EFI_TABLE_HEADER Hdr;
//
// Time services
//
EFI_GET_TIME GetTime;
EFI_SET_TIME SetTime;
EFI_GET_WAKEUP_TIME GetWakeupTime;
EFI_SET_WAKEUP_TIME SetWakeupTime;
//
// Virtual memory services
//
EFI_SET_VIRTUAL_ADDRESS_MAP SetVirtualAddressMap;
EFI_CONVERT_POINTER ConvertPointer;
//
// Variable serviers
//
EFI_GET_VARIABLE GetVariable;
EFI_GET_NEXT_VARIABLE_NAME GetNextVariableName;
EFI_SET_VARIABLE SetVariable;
//
// Misc
//
EFI_GET_NEXT_HIGH_MONO_COUNT GetNextHighMonotonicCount;
EFI_RESET_SYSTEM ResetSystem;
} EFI_RUNTIME_SERVICES;
//
// EFI Boot Services Table
//
#define EFI_BOOT_SERVICES_SIGNATURE 0x56524553544f4f42
#define EFI_BOOT_SERVICES_REVISION ((EFI_SPECIFICATION_MAJOR_REVISION<<16) | (EFI_SPECIFICATION_MINOR_REVISION))
typedef struct {
EFI_TABLE_HEADER Hdr;
//
// Task priority functions
//
EFI_RAISE_TPL RaiseTPL;
EFI_RESTORE_TPL RestoreTPL;
//
// Memory functions
//
EFI_ALLOCATE_PAGES AllocatePages;
EFI_FREE_PAGES FreePages;
EFI_GET_MEMORY_MAP GetMemoryMap;
EFI_ALLOCATE_POOL AllocatePool;
EFI_FREE_POOL FreePool;
//
// Event & timer functions
//
EFI_CREATE_EVENT CreateEvent;
EFI_SET_TIMER SetTimer;
EFI_WAIT_FOR_EVENT WaitForEvent;
EFI_SIGNAL_EVENT SignalEvent;
EFI_CLOSE_EVENT CloseEvent;
EFI_CHECK_EVENT CheckEvent;
//
// Protocol handler functions
//
EFI_INSTALL_PROTOCOL_INTERFACE InstallProtocolInterface;
EFI_REINSTALL_PROTOCOL_INTERFACE ReinstallProtocolInterface;
EFI_UNINSTALL_PROTOCOL_INTERFACE UninstallProtocolInterface;
EFI_HANDLE_PROTOCOL HandleProtocol;
VOID *Reserved;
EFI_REGISTER_PROTOCOL_NOTIFY RegisterProtocolNotify;
EFI_LOCATE_HANDLE LocateHandle;
EFI_LOCATE_DEVICE_PATH LocateDevicePath;
EFI_INSTALL_CONFIGURATION_TABLE InstallConfigurationTable;
//
// Image functions
//
EFI_IMAGE_LOAD LoadImage;
EFI_IMAGE_START StartImage;
EFI_EXIT Exit;
EFI_IMAGE_UNLOAD UnloadImage;
EFI_EXIT_BOOT_SERVICES ExitBootServices;
//
// Misc functions
//
EFI_GET_NEXT_MONOTONIC_COUNT GetNextMonotonicCount;
EFI_STALL Stall;
EFI_SET_WATCHDOG_TIMER SetWatchdogTimer;
//
// DriverSupport Services
//
EFI_CONNECT_CONTROLLER ConnectController;
EFI_DISCONNECT_CONTROLLER DisconnectController;
//
// Open and Close Protocol Services
//
EFI_OPEN_PROTOCOL OpenProtocol;
EFI_CLOSE_PROTOCOL CloseProtocol;
EFI_OPEN_PROTOCOL_INFORMATION OpenProtocolInformation;
//
// Library Services to reduce size of drivers
//
EFI_PROTOCOLS_PER_HANDLE ProtocolsPerHandle;
EFI_LOCATE_HANDLE_BUFFER LocateHandleBuffer;
EFI_LOCATE_PROTOCOL LocateProtocol;
EFI_INSTALL_MULTIPLE_PROTOCOL_INTERFACES InstallMultipleProtocolInterfaces;
EFI_UNINSTALL_MULTIPLE_PROTOCOL_INTERFACES UninstallMultipleProtocolInterfaces;
//
// CRC32 services
//
EFI_CALCULATE_CRC32 CalculateCrc32;
//
// Memory Utility Services
//
EFI_COPY_MEM CopyMem;
EFI_SET_MEM SetMem;
} EFI_BOOT_SERVICES;
//
// EFI Configuration Table and GUID definitions
//
#define MPS_TABLE_GUID \
{ 0xeb9d2d2f, 0x2d88, 0x11d3, {0x9a, 0x16, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define ACPI_TABLE_GUID \
{ 0xeb9d2d30, 0x2d88, 0x11d3, {0x9a, 0x16, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define ACPI_20_TABLE_GUID \
{ 0x8868e871, 0xe4f1, 0x11d3, {0xbc, 0x22, 0x0, 0x80, 0xc7, 0x3c, 0x88, 0x81} }
#define SMBIOS_TABLE_GUID \
{ 0xeb9d2d31, 0x2d88, 0x11d3, {0x9a, 0x16, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define SMBIOS3_TABLE_GUID \
{ 0xf2fd1544, 0x9794, 0x4a2c, {0x99, 0x2e, 0xe5, 0xbb, 0xcf, 0x20, 0xe3, 0x94} }
#define SAL_SYSTEM_TABLE_GUID \
{ 0xeb9d2d32, 0x2d88, 0x11d3, {0x9a, 0x16, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define FDT_TABLE_GUID \
{ 0xb1b621d5, 0xf19c, 0x41a5, {0x83, 0x0b, 0xd9, 0x15, 0x2c, 0x69, 0xaa, 0xe0} }
#define DXE_SERVICES_TABLE_GUID \
{ 0x5ad34ba, 0x6f02, 0x4214, {0x95, 0x2e, 0x4d, 0xa0, 0x39, 0x8e, 0x2b, 0xb9} }
#define HOB_LIST_TABLE_GUID \
{ 0x7739f24c, 0x93d7, 0x11d4, {0x9a, 0x3a, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define LZMA_DECOMPRESSION_GUID \
{ 0xee4e5898, 0x3914, 0x4259, {0x9d, 0x6e, 0xdc, 0x7b, 0xd7, 0x94, 0x3, 0xcf} }
#define ARM_MP_CORE_INFO_TABLE_GUID \
{ 0xa4ee0728, 0xe5d7, 0x4ac5, {0xb2, 0x1e, 0x65, 0x8e, 0xd8, 0x57, 0xe8, 0x34} }
#define ESRT_TABLE_GUID \
{ 0xb122a263, 0x3661, 0x4f68, {0x99, 0x29, 0x78, 0xf8, 0xb0, 0xd6, 0x21, 0x80} }
#define MEMORY_TYPE_INFORMATION_TABLE_GUID \
{ 0x4c19049f, 0x4137, 0x4dd3, {0x9c, 0x10, 0x8b, 0x97, 0xa8, 0x3f, 0xfd, 0xfa} }
#define DEBUG_IMAGE_INFO_TABLE_GUID \
{ 0x49152e77, 0x1ada, 0x4764, {0xb7, 0xa2, 0x7a, 0xfe, 0xfe, 0xd9, 0x5e, 0x8b} }
typedef struct _EFI_CONFIGURATION_TABLE {
EFI_GUID VendorGuid;
VOID *VendorTable;
} EFI_CONFIGURATION_TABLE;
//
// EFI System Table
//
#define EFI_SYSTEM_TABLE_SIGNATURE 0x5453595320494249
#define EFI_SYSTEM_TABLE_REVISION ((EFI_SPECIFICATION_MAJOR_REVISION<<16) | (EFI_SPECIFICATION_MINOR_REVISION))
#define EFI_1_10_SYSTEM_TABLE_REVISION ((1<<16) | 10)
#define EFI_1_02_SYSTEM_TABLE_REVISION ((1<<16) | 02)
typedef struct _EFI_SYSTEM_TABLE {
EFI_TABLE_HEADER Hdr;
CHAR16 *FirmwareVendor;
UINT32 FirmwareRevision;
EFI_HANDLE ConsoleInHandle;
SIMPLE_INPUT_INTERFACE *ConIn;
EFI_HANDLE ConsoleOutHandle;
SIMPLE_TEXT_OUTPUT_INTERFACE *ConOut;
EFI_HANDLE StandardErrorHandle;
SIMPLE_TEXT_OUTPUT_INTERFACE *StdErr;
EFI_RUNTIME_SERVICES *RuntimeServices;
EFI_BOOT_SERVICES *BootServices;
UINTN NumberOfTableEntries;
EFI_CONFIGURATION_TABLE *ConfigurationTable;
} EFI_SYSTEM_TABLE;
/*
* unlisted GUID's..
*/
#define EFI_EBC_INTERPRETER_PROTOCOL_GUID \
{ 0x13AC6DD1, 0x73D0, 0x11D4, {0xB0, 0x6B, 0x00, 0xAA, 0x00, 0xBD, 0x6D, 0xE7} }
#define EFI_DRIVER_CONFIGURATION2_PROTOCOL_GUID \
{ 0xbfd7dc1d, 0x24f1, 0x40d9, {0x82, 0xe7, 0x2e, 0x09, 0xbb, 0x6b, 0x4e, 0xbe} }
#define EFI_DRIVER_CONFIGURATION_PROTOCOL_GUID \
{ 0x107a772b, 0xd5e1, 0x11d4, {0x9a, 0x46, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_DRIVER_BINDING_PROTOCOL_GUID \
{ 0x18A031AB, 0xB443, 0x4D1A, \
{ 0xA5, 0xC0, 0x0C, 0x09, 0x26, 0x1E, 0x9F, 0x71 } \
}
#define EFI_TAPE_IO_PROTOCOL_GUID \
{ 0x1e93e633, 0xd65a, 0x459e, \
{ 0xab, 0x84, 0x93, 0xd9, 0xec, 0x26, 0x6d, 0x18 } \
}
#define EFI_SCSI_IO_PROTOCOL_GUID \
{ 0x932f47e6, 0x2362, 0x4002, \
{ 0x80, 0x3e, 0x3c, 0xd5, 0x4b, 0x13, 0x8f, 0x85 } \
}
#define EFI_USB2_HC_PROTOCOL_GUID \
{ 0x3e745226, 0x9818, 0x45b6, \
{ 0xa2, 0xac, 0xd7, 0xcd, 0x0e, 0x8b, 0xa2, 0xbc } \
}
#define EFI_DEBUG_SUPPORT_PROTOCOL_GUID \
{ 0x2755590C, 0x6F3C, 0x42FA, \
{ 0x9E, 0xA4, 0xA3, 0xBA, 0x54, 0x3C, 0xDA, 0x25 } \
}
#define EFI_DEBUGPORT_PROTOCOL_GUID \
{ 0xEBA4E8D2, 0x3858, 0x41EC, \
{ 0xA2, 0x81, 0x26, 0x47, 0xBA, 0x96, 0x60, 0xD0 } \
}
#define EFI_DECOMPRESS_PROTOCOL_GUID \
{ 0xd8117cfe, 0x94a6, 0x11d4, \
{ 0x9a, 0x3a, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d } \
}
#define EFI_ACPI_TABLE_PROTOCOL_GUID \
{ 0xffe06bdd, 0x6107, 0x46a6, \
{ 0x7b, 0xb2, 0x5a, 0x9c, 0x7e, 0xc5, 0x27, 0x5c} \
}
#define EFI_HII_CONFIG_ROUTING_PROTOCOL_GUID \
{ 0x587e72d7, 0xcc50, 0x4f79, \
{ 0x82, 0x09, 0xca, 0x29, 0x1f, 0xc1, 0xa1, 0x0f } \
}
#define EFI_HII_DATABASE_PROTOCOL_GUID \
{ 0xef9fc172, 0xa1b2, 0x4693, \
{ 0xb3, 0x27, 0x6d, 0x32, 0xfc, 0x41, 0x60, 0x42 } \
}
#define EFI_HII_STRING_PROTOCOL_GUID \
{ 0xfd96974, 0x23aa, 0x4cdc, \
{ 0xb9, 0xcb, 0x98, 0xd1, 0x77, 0x50, 0x32, 0x2a } \
}
#define EFI_HII_IMAGE_PROTOCOL_GUID \
{ 0x31a6406a, 0x6bdf, 0x4e46, \
{ 0xb2, 0xa2, 0xeb, 0xaa, 0x89, 0xc4, 0x9, 0x20 } \
}
#define EFI_HII_FONT_PROTOCOL_GUID \
{ 0xe9ca4775, 0x8657, 0x47fc, \
{ 0x97, 0xe7, 0x7e, 0xd6, 0x5a, 0x8, 0x43, 0x24 } \
}
#define EFI_HII_CONFIGURATION_ACCESS_PROTOCOL_GUID \
{ 0x330d4706, 0xf2a0, 0x4e4f, \
{ 0xa3, 0x69, 0xb6, 0x6f, 0xa8, 0xd5, 0x43, 0x85 } \
}
#define EFI_COMPONENT_NAME_PROTOCOL_GUID \
{ 0x107a772c, 0xd5e1, 0x11d4, {0x9a, 0x46, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_COMPONENT_NAME2_PROTOCOL_GUID \
{ 0x6a7a5cff, 0xe8d9, 0x4f70, \
{ 0xba, 0xda, 0x75, 0xab, 0x30, 0x25, 0xce, 0x14} \
}
#define EFI_USB_IO_PROTOCOL_GUID \
{ 0x2B2F68D6, 0x0CD2, 0x44cf, \
{ 0x8E, 0x8B, 0xBB, 0xA2, 0x0B, 0x1B, 0x5B, 0x75 } \
}
#define EFI_HCDP_TABLE_GUID \
{ 0xf951938d, 0x620b, 0x42ef, \
{ 0x82, 0x79, 0xa8, 0x4b, 0x79, 0x61, 0x78, 0x98 } \
}
#define EFI_DEVICE_TREE_GUID \
{ 0xb1b621d5, 0xf19c, 0x41a5, \
{ 0x83, 0x0b, 0xd9, 0x15, 0x2c, 0x69, 0xaa, 0xe0 } \
}
#define EFI_VENDOR_APPLE_GUID \
{ 0x2B0585EB, 0xD8B8, 0x49A9, \
{ 0x8B, 0x8C, 0xE2, 0x1B, 0x01, 0xAE, 0xF2, 0xB7 } \
}
#define EFI_CONSOLE_IN_DEVICE_GUID \
{ 0xd3b36f2b, 0xd551, 0x11d4, {0x9a, 0x46, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_CONSOLE_OUT_DEVICE_GUID \
{ 0xd3b36f2c, 0xd551, 0x11d4, {0x9a, 0x46, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_STANDARD_ERROR_DEVICE_GUID \
{ 0xd3b36f2d, 0xd551, 0x11d4, {0x9a, 0x46, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_UNICODE_COLLATION2_PROTOCOL_GUID \
{ 0xa4c751fc, 0x23ae, 0x4c3e, {0x92, 0xe9, 0x49, 0x64, 0xcf, 0x63, 0xf3, 0x49} }
#define EFI_FORM_BROWSER2_PROTOCOL_GUID \
{ 0xb9d4c360, 0xbcfb, 0x4f9b, {0x92, 0x98, 0x53, 0xc1, 0x36, 0x98, 0x22, 0x58} }
#define EFI_ARP_SERVICE_BINDING_PROTOCOL_GUID \
{ 0xf44c00ee, 0x1f2c, 0x4a00, {0xaa, 0x9, 0x1c, 0x9f, 0x3e, 0x8, 0x0, 0xa3} }
#define EFI_ARP_PROTOCOL_GUID \
{ 0xf4b427bb, 0xba21, 0x4f16, {0xbc, 0x4e, 0x43, 0xe4, 0x16, 0xab, 0x61, 0x9c} }
#define EFI_IP4_CONFIG_PROTOCOL_GUID \
{ 0x3b95aa31, 0x3793, 0x434b, {0x86, 0x67, 0xc8, 0x07, 0x08, 0x92, 0xe0, 0x5e} }
#define EFI_IP6_CONFIG_PROTOCOL_GUID \
{ 0x937fe521, 0x95ae, 0x4d1a, {0x89, 0x29, 0x48, 0xbc, 0xd9, 0x0a, 0xd3, 0x1a} }
#define EFI_MANAGED_NETWORK_SERVICE_BINDING_PROTOCOL_GUID \
{ 0xf36ff770, 0xa7e1, 0x42cf, {0x9e, 0xd2, 0x56, 0xf0, 0xf2, 0x71, 0xf4, 0x4c} }
#define EFI_MANAGED_NETWORK_PROTOCOL_GUID \
{ 0x7ab33a91, 0xace5, 0x4326, {0xb5, 0x72, 0xe7, 0xee, 0x33, 0xd3, 0x9f, 0x16} }
#define EFI_MTFTP4_SERVICE_BINDING_PROTOCOL_GUID \
{ 0x2FE800BE, 0x8F01, 0x4aa6, {0x94, 0x6B, 0xD7, 0x13, 0x88, 0xE1, 0x83, 0x3F} }
#define EFI_MTFTP4_PROTOCOL_GUID \
{ 0x78247c57, 0x63db, 0x4708, {0x99, 0xc2, 0xa8, 0xb4, 0xa9, 0xa6, 0x1f, 0x6b} }
#define EFI_MTFTP6_SERVICE_BINDING_PROTOCOL_GUID \
{ 0xd9760ff3, 0x3cca, 0x4267, {0x80, 0xf9, 0x75, 0x27, 0xfa, 0xfa, 0x42, 0x23} }
#define EFI_MTFTP6_PROTOCOL_GUID \
{ 0xbf0a78ba, 0xec29, 0x49cf, {0xa1, 0xc9, 0x7a, 0xe5, 0x4e, 0xab, 0x6a, 0x51} }
#define EFI_DHCP4_PROTOCOL_GUID \
{ 0x8a219718, 0x4ef5, 0x4761, {0x91, 0xc8, 0xc0, 0xf0, 0x4b, 0xda, 0x9e, 0x56} }
#define EFI_DHCP4_SERVICE_BINDING_PROTOCOL_GUID \
{ 0x9d9a39d8, 0xbd42, 0x4a73, {0xa4, 0xd5, 0x8e, 0xe9, 0x4b, 0xe1, 0x13, 0x80} }
#define EFI_DHCP6_SERVICE_BINDING_PROTOCOL_GUID \
{ 0x9fb9a8a1, 0x2f4a, 0x43a6, {0x88, 0x9c, 0xd0, 0xf7, 0xb6, 0xc4, 0x7a, 0xd5} }
#define EFI_DHCP6_PROTOCOL_GUID \
{ 0x87c8bad7, 0x595, 0x4053, {0x82, 0x97, 0xde, 0xde, 0x39, 0x5f, 0x5d, 0x5b} }
#define EFI_SCSI_PASS_THRU_PROTOCOL_GUID \
{ 0xa59e8fcf, 0xbda0, 0x43bb, {0x90, 0xb1, 0xd3, 0x73, 0x2e, 0xca, 0xa8, 0x77} }
#define EFI_EXT_SCSI_PASS_THRU_PROTOCOL_GUID \
{ 0x143b7632, 0xb81b, 0x4cb7, {0xab, 0xd3, 0xb6, 0x25, 0xa5, 0xb9, 0xbf, 0xfe} }
#define EFI_DISK_INFO_PROTOCOL_GUID \
{ 0xd432a67f, 0x14dc, 0x484b, {0xb3, 0xbb, 0x3f, 0x2, 0x91, 0x84, 0x93, 0x27} }
#define EFI_ISA_IO_PROTOCOL_GUID \
{ 0x7ee2bd44, 0x3da0, 0x11d4, { 0x9a, 0x38, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_VLAN_CONFIG_PROTOCOL_GUID \
{ 0x9e23d768, 0xd2f3, 0x4366, {0x9f, 0xc3, 0x3a, 0x7a, 0xba, 0x86, 0x43, 0x74} }
#define EFI_IDE_CONTROLLER_INIT_PROTOCOL_GUID \
{ 0xa1e37052, 0x80d9, 0x4e65, {0xa3, 0x17, 0x3e, 0x9a, 0x55, 0xc4, 0x3e, 0xc9} }
#define EFI_ISA_ACPI_PROTOCOL_GUID \
{ 0x64a892dc, 0x5561, 0x4536, {0x92, 0xc7, 0x79, 0x9b, 0xfc, 0x18, 0x33, 0x55} }
#define EFI_PCI_ENUMERATION_COMPLETE_GUID \
{ 0x30cfe3e7, 0x3de1, 0x4586, {0xbe, 0x20, 0xde, 0xab, 0xa1, 0xb3, 0xb7, 0x93} }
#define EFI_DRIVER_DIAGNOSTICS_PROTOCOL_GUID \
{ 0x0784924f, 0xe296, 0x11d4, {0x9a, 0x49, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d } }
#define EFI_DRIVER_DIAGNOSTICS2_PROTOCOL_GUID \
{ 0x4d330321, 0x025f, 0x4aac, {0x90, 0xd8, 0x5e, 0xd9, 0x00, 0x17, 0x3b, 0x63} }
#define EFI_CAPSULE_ARCH_PROTOCOL_GUID \
{ 0x5053697e, 0x2cbc, 0x4819, {0x90, 0xd9, 0x05, 0x80, 0xde, 0xee, 0x57, 0x54} }
#define EFI_MONOTONIC_COUNTER_ARCH_PROTOCOL_GUID \
{0x1da97072, 0xbddc, 0x4b30, {0x99, 0xf1, 0x72, 0xa0, 0xb5, 0x6f, 0xff, 0x2a} }
#define EFI_REALTIME_CLOCK_ARCH_PROTOCOL_GUID \
{0x27cfac87, 0x46cc, 0x11d4, {0x9a, 0x38, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_MP_SERVICES_PROTOCOL_GUID \
{ 0x3fdda605, 0xa76e, 0x4f46, {0xad, 0x29, 0x12, 0xf4, 0x53, 0x1b, 0x3d, 0x08} }
#define EFI_VARIABLE_ARCH_PROTOCOL_GUID \
{ 0x1e5668e2, 0x8481, 0x11d4, {0xbc, 0xf1, 0x0, 0x80, 0xc7, 0x3c, 0x88, 0x81 } }
#define EFI_VARIABLE_WRITE_ARCH_PROTOCOL_GUID \
{ 0x6441f818, 0x6362, 0x4e44, {0xb5, 0x70, 0x7d, 0xba, 0x31, 0xdd, 0x24, 0x53} }
#define EFI_WATCHDOG_TIMER_ARCH_PROTOCOL_GUID \
{ 0x6441f818, 0x6362, 0x4e44, {0xb5, 0x70, 0x7d, 0xba, 0x31, 0xdd, 0x24, 0x53} }
#define EFI_ACPI_SUPPORT_PROTOCOL_GUID \
{ 0x6441f818, 0x6362, 0x4e44, {0xb5, 0x70, 0x7d, 0xba, 0x31, 0xdd, 0x24, 0x53} }
#define EFI_BDS_ARCH_PROTOCOL_GUID \
{ 0x665e3ff6, 0x46cc, 0x11d4, {0x9a, 0x38, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_METRONOME_ARCH_PROTOCOL_GUID \
{ 0x26baccb2, 0x6f42, 0x11d4, {0xbc, 0xe7, 0x0, 0x80, 0xc7, 0x3c, 0x88, 0x81 } }
#define EFI_TIMER_ARCH_PROTOCOL_GUID \
{ 0x26baccb3, 0x6f42, 0x11d4, {0xbc, 0xe7, 0x0, 0x80, 0xc7, 0x3c, 0x88, 0x81 } }
#define EFI_DPC_PROTOCOL_GUID \
{ 0x480f8ae9, 0xc46, 0x4aa9, { 0xbc, 0x89, 0xdb, 0x9f, 0xba, 0x61, 0x98, 0x6} }
#define EFI_PRINT2_PROTOCOL_GUID \
{ 0xf05976ef, 0x83f1, 0x4f3d, {0x86, 0x19, 0xf7, 0x59, 0x5d, 0x41, 0xe5, 0x38} }
#define EFI_RESET_ARCH_PROTOCOL_GUID \
{ 0x27cfac88, 0x46cc, 0x11d4, {0x9a, 0x38, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define EFI_CPU_ARCH_PROTOCOL_GUID \
{ 0x26baccb1, 0x6f42, 0x11d4, {0xbc, 0xe7, 0x0, 0x80, 0xc7, 0x3c, 0x88, 0x81 } }
#define EFI_CPU_IO2_PROTOCOL_GUID \
{ 0xad61f191, 0xae5f, 0x4c0e, {0xb9, 0xfa, 0xe8, 0x69, 0xd2, 0x88, 0xc6, 0x4f} }
#define EFI_LEGACY_8259_PROTOCOL_GUID \
{ 0x38321dba, 0x4fe0, 0x4e17, {0x8a, 0xec, 0x41, 0x30, 0x55, 0xea, 0xed, 0xc1} }
#define EFI_SECURITY_ARCH_PROTOCOL_GUID \
{ 0xa46423e3, 0x4617, 0x49f1, {0xb9, 0xff, 0xd1, 0xbf, 0xa9, 0x11, 0x58, 0x39} }
#define EFI_SECURITY2_ARCH_PROTOCOL_GUID \
{ 0x94ab2f58, 0x1438, 0x4ef1, {0x91, 0x52, 0x18, 0x94, 0x1a, 0x3a, 0x0e, 0x68} }
#define EFI_RUNTIME_ARCH_PROTOCOL_GUID \
{ 0xb7dfb4e1, 0x52f, 0x449f, {0x87, 0xbe, 0x98, 0x18, 0xfc, 0x91, 0xb7, 0x33} }
#define EFI_STATUS_CODE_RUNTIME_PROTOCOL_GUID \
{ 0xd2b2b828, 0x826, 0x48a7, {0xb3, 0xdf, 0x98, 0x3c, 0x0, 0x60, 0x24, 0xf0} }
#define EFI_DATA_HUB_PROTOCOL_GUID \
{ 0xae80d021, 0x618e, 0x11d4, {0xbc, 0xd7, 0x0, 0x80, 0xc7, 0x3c, 0x88, 0x81} }
#define PCD_PROTOCOL_GUID \
{ 0x11b34006, 0xd85b, 0x4d0a, { 0xa2, 0x90, 0xd5, 0xa5, 0x71, 0x31, 0xe, 0xf7} }
#define EFI_PCD_PROTOCOL_GUID \
{ 0x13a3f0f6, 0x264a, 0x3ef0, {0xf2, 0xe0, 0xde, 0xc5, 0x12, 0x34, 0x2f, 0x34} }
#define EFI_FIRMWARE_VOLUME_BLOCK_PROTOCOL_GUID \
{ 0x8f644fa9, 0xe850, 0x4db1, {0x9c, 0xe2, 0xb, 0x44, 0x69, 0x8e, 0x8d, 0xa4 } }
#define EFI_FIRMWARE_VOLUME2_PROTOCOL_GUID \
{ 0x220e73b6, 0x6bdb, 0x4413, { 0x84, 0x5, 0xb9, 0x74, 0xb1, 0x8, 0x61, 0x9a } }
#define EFI_FIRMWARE_VOLUME_DISPATCH_PROTOCOL_GUID \
{ 0x7aa35a69, 0x506c, 0x444f, {0xa7, 0xaf, 0x69, 0x4b, 0xf5, 0x6f, 0x71, 0xc8} }
#define LZMA_COMPRESS_GUID \
{ 0xee4e5898, 0x3914, 0x4259, {0x9d, 0x6e, 0xdc, 0x7b, 0xd7, 0x94, 0x03, 0xcf} }
#endif
diff --git a/stand/efi/include/eficon.h b/stand/efi/include/eficon.h
index ba80114eb9be..39855b8b0725 100644
--- a/stand/efi/include/eficon.h
+++ b/stand/efi/include/eficon.h
@@ -1,527 +1,526 @@
-/* $FreeBSD$ */
#ifndef _EFI_CON_H
#define _EFI_CON_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
eficon.h
Abstract:
EFI console protocols
Revision History
--*/
//
// Text output protocol
//
#define SIMPLE_TEXT_OUTPUT_PROTOCOL \
{ 0x387477c2, 0x69c7, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
INTERFACE_DECL(_SIMPLE_TEXT_OUTPUT_INTERFACE);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_RESET) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN BOOLEAN ExtendedVerification
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_OUTPUT_STRING) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN CHAR16 *String
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_TEST_STRING) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN CHAR16 *String
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_QUERY_MODE) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN UINTN ModeNumber,
OUT UINTN *Columns,
OUT UINTN *Rows
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_SET_MODE) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN UINTN ModeNumber
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_SET_ATTRIBUTE) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN UINTN Attribute
);
#define EFI_BLACK 0x00
#define EFI_BLUE 0x01
#define EFI_GREEN 0x02
#define EFI_CYAN (EFI_BLUE | EFI_GREEN)
#define EFI_RED 0x04
#define EFI_MAGENTA (EFI_BLUE | EFI_RED)
#define EFI_BROWN (EFI_GREEN | EFI_RED)
#define EFI_LIGHTGRAY (EFI_BLUE | EFI_GREEN | EFI_RED)
#define EFI_BRIGHT 0x08
#define EFI_DARKGRAY (EFI_BRIGHT)
#define EFI_LIGHTBLUE (EFI_BLUE | EFI_BRIGHT)
#define EFI_LIGHTGREEN (EFI_GREEN | EFI_BRIGHT)
#define EFI_LIGHTCYAN (EFI_CYAN | EFI_BRIGHT)
#define EFI_LIGHTRED (EFI_RED | EFI_BRIGHT)
#define EFI_LIGHTMAGENTA (EFI_MAGENTA | EFI_BRIGHT)
#define EFI_YELLOW (EFI_BROWN | EFI_BRIGHT)
#define EFI_WHITE (EFI_BLUE | EFI_GREEN | EFI_RED | EFI_BRIGHT)
#define EFI_TEXT_ATTR(f,b) ((f) | ((b) << 4))
#define EFI_BACKGROUND_BLACK 0x00
#define EFI_BACKGROUND_BLUE 0x10
#define EFI_BACKGROUND_GREEN 0x20
#define EFI_BACKGROUND_CYAN (EFI_BACKGROUND_BLUE | EFI_BACKGROUND_GREEN)
#define EFI_BACKGROUND_RED 0x40
#define EFI_BACKGROUND_MAGENTA (EFI_BACKGROUND_BLUE | EFI_BACKGROUND_RED)
#define EFI_BACKGROUND_BROWN (EFI_BACKGROUND_GREEN | EFI_BACKGROUND_RED)
#define EFI_BACKGROUND_LIGHTGRAY (EFI_BACKGROUND_BLUE | EFI_BACKGROUND_GREEN | EFI_BACKGROUND_RED)
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_CLEAR_SCREEN) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_SET_CURSOR_POSITION) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN UINTN Column,
IN UINTN Row
);
typedef
EFI_STATUS
(EFIAPI *EFI_TEXT_ENABLE_CURSOR) (
IN struct _SIMPLE_TEXT_OUTPUT_INTERFACE *This,
IN BOOLEAN Enable
);
typedef struct {
INT32 MaxMode;
// current settings
INT32 Mode;
INT32 Attribute;
INT32 CursorColumn;
INT32 CursorRow;
BOOLEAN CursorVisible;
} SIMPLE_TEXT_OUTPUT_MODE;
typedef struct _SIMPLE_TEXT_OUTPUT_INTERFACE {
EFI_TEXT_RESET Reset;
EFI_TEXT_OUTPUT_STRING OutputString;
EFI_TEXT_TEST_STRING TestString;
EFI_TEXT_QUERY_MODE QueryMode;
EFI_TEXT_SET_MODE SetMode;
EFI_TEXT_SET_ATTRIBUTE SetAttribute;
EFI_TEXT_CLEAR_SCREEN ClearScreen;
EFI_TEXT_SET_CURSOR_POSITION SetCursorPosition;
EFI_TEXT_ENABLE_CURSOR EnableCursor;
// Current mode
SIMPLE_TEXT_OUTPUT_MODE *Mode;
} SIMPLE_TEXT_OUTPUT_INTERFACE;
//
// Define's for required EFI Unicode Box Draw character
//
#define BOXDRAW_HORIZONTAL 0x2500
#define BOXDRAW_VERTICAL 0x2502
#define BOXDRAW_DOWN_RIGHT 0x250c
#define BOXDRAW_DOWN_LEFT 0x2510
#define BOXDRAW_UP_RIGHT 0x2514
#define BOXDRAW_UP_LEFT 0x2518
#define BOXDRAW_VERTICAL_RIGHT 0x251c
#define BOXDRAW_VERTICAL_LEFT 0x2524
#define BOXDRAW_DOWN_HORIZONTAL 0x252c
#define BOXDRAW_UP_HORIZONTAL 0x2534
#define BOXDRAW_VERTICAL_HORIZONTAL 0x253c
#define BOXDRAW_DOUBLE_HORIZONTAL 0x2550
#define BOXDRAW_DOUBLE_VERTICAL 0x2551
#define BOXDRAW_DOWN_RIGHT_DOUBLE 0x2552
#define BOXDRAW_DOWN_DOUBLE_RIGHT 0x2553
#define BOXDRAW_DOUBLE_DOWN_RIGHT 0x2554
#define BOXDRAW_DOWN_LEFT_DOUBLE 0x2555
#define BOXDRAW_DOWN_DOUBLE_LEFT 0x2556
#define BOXDRAW_DOUBLE_DOWN_LEFT 0x2557
#define BOXDRAW_UP_RIGHT_DOUBLE 0x2558
#define BOXDRAW_UP_DOUBLE_RIGHT 0x2559
#define BOXDRAW_DOUBLE_UP_RIGHT 0x255a
#define BOXDRAW_UP_LEFT_DOUBLE 0x255b
#define BOXDRAW_UP_DOUBLE_LEFT 0x255c
#define BOXDRAW_DOUBLE_UP_LEFT 0x255d
#define BOXDRAW_VERTICAL_RIGHT_DOUBLE 0x255e
#define BOXDRAW_VERTICAL_DOUBLE_RIGHT 0x255f
#define BOXDRAW_DOUBLE_VERTICAL_RIGHT 0x2560
#define BOXDRAW_VERTICAL_LEFT_DOUBLE 0x2561
#define BOXDRAW_VERTICAL_DOUBLE_LEFT 0x2562
#define BOXDRAW_DOUBLE_VERTICAL_LEFT 0x2563
#define BOXDRAW_DOWN_HORIZONTAL_DOUBLE 0x2564
#define BOXDRAW_DOWN_DOUBLE_HORIZONTAL 0x2565
#define BOXDRAW_DOUBLE_DOWN_HORIZONTAL 0x2566
#define BOXDRAW_UP_HORIZONTAL_DOUBLE 0x2567
#define BOXDRAW_UP_DOUBLE_HORIZONTAL 0x2568
#define BOXDRAW_DOUBLE_UP_HORIZONTAL 0x2569
#define BOXDRAW_VERTICAL_HORIZONTAL_DOUBLE 0x256a
#define BOXDRAW_VERTICAL_DOUBLE_HORIZONTAL 0x256b
#define BOXDRAW_DOUBLE_VERTICAL_HORIZONTAL 0x256c
//
// EFI Required Block Elements Code Chart
//
#define BLOCKELEMENT_FULL_BLOCK 0x2588
#define BLOCKELEMENT_LIGHT_SHADE 0x2591
//
// EFI Required Geometric Shapes Code Chart
//
#define GEOMETRICSHAPE_UP_TRIANGLE 0x25b2
#define GEOMETRICSHAPE_RIGHT_TRIANGLE 0x25ba
#define GEOMETRICSHAPE_DOWN_TRIANGLE 0x25bc
#define GEOMETRICSHAPE_LEFT_TRIANGLE 0x25c4
//
// EFI Required Arrow shapes
//
#define ARROW_UP 0x2191
#define ARROW_DOWN 0x2193
//
// Text input protocol
//
#define SIMPLE_TEXT_INPUT_PROTOCOL \
{ 0x387477c1, 0x69c7, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
INTERFACE_DECL(_SIMPLE_INPUT_INTERFACE);
typedef struct {
UINT16 ScanCode;
CHAR16 UnicodeChar;
} EFI_INPUT_KEY;
//
// Baseline unicode control chars
//
#define CHAR_NULL 0x0000
#define CHAR_BACKSPACE 0x0008
#define CHAR_TAB 0x0009
#define CHAR_LINEFEED 0x000A
#define CHAR_CARRIAGE_RETURN 0x000D
//
// Scan codes for base line keys
//
#define SCAN_NULL 0x0000
#define SCAN_UP 0x0001
#define SCAN_DOWN 0x0002
#define SCAN_RIGHT 0x0003
#define SCAN_LEFT 0x0004
#define SCAN_HOME 0x0005
#define SCAN_END 0x0006
#define SCAN_INSERT 0x0007
#define SCAN_DELETE 0x0008
#define SCAN_PAGE_UP 0x0009
#define SCAN_PAGE_DOWN 0x000A
#define SCAN_F1 0x000B
#define SCAN_F2 0x000C
#define SCAN_F3 0x000D
#define SCAN_F4 0x000E
#define SCAN_F5 0x000F
#define SCAN_F6 0x0010
#define SCAN_F7 0x0011
#define SCAN_F8 0x0012
#define SCAN_F9 0x0013
#define SCAN_F10 0x0014
#define SCAN_ESC 0x0017
//
// EFI Scan code Ex
//
#define SCAN_F11 0x0015
#define SCAN_F12 0x0016
#define SCAN_F13 0x0068
#define SCAN_F14 0x0069
#define SCAN_F15 0x006A
#define SCAN_F16 0x006B
#define SCAN_F17 0x006C
#define SCAN_F18 0x006D
#define SCAN_F19 0x006E
#define SCAN_F20 0x006F
#define SCAN_F21 0x0070
#define SCAN_F22 0x0071
#define SCAN_F23 0x0072
#define SCAN_F24 0x0073
#define SCAN_MUTE 0x007F
#define SCAN_VOLUME_UP 0x0080
#define SCAN_VOLUME_DOWN 0x0081
#define SCAN_BRIGHTNESS_UP 0x0100
#define SCAN_BRIGHTNESS_DOWN 0x0101
#define SCAN_SUSPEND 0x0102
#define SCAN_HIBERNATE 0x0103
#define SCAN_TOGGLE_DISPLAY 0x0104
#define SCAN_RECOVERY 0x0105
#define SCAN_EJECT 0x0106
typedef
EFI_STATUS
(EFIAPI *EFI_INPUT_RESET) (
IN struct _SIMPLE_INPUT_INTERFACE *This,
IN BOOLEAN ExtendedVerification
);
typedef
EFI_STATUS
(EFIAPI *EFI_INPUT_READ_KEY) (
IN struct _SIMPLE_INPUT_INTERFACE *This,
OUT EFI_INPUT_KEY *Key
);
typedef struct _SIMPLE_INPUT_INTERFACE {
EFI_INPUT_RESET Reset;
EFI_INPUT_READ_KEY ReadKeyStroke;
EFI_EVENT WaitForKey;
} SIMPLE_INPUT_INTERFACE;
#define EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL_GUID \
{0xdd9e7534, 0x7762, 0x4698, {0x8c, 0x14, 0xf5, 0x85, \
0x17, 0xa6, 0x25, 0xaa} }
INTERFACE_DECL(_EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL);
typedef UINT8 EFI_KEY_TOGGLE_STATE;
//
// Any Shift or Toggle State that is valid should have
// high order bit set.
//
typedef struct EFI_KEY_STATE {
UINT32 KeyShiftState;
EFI_KEY_TOGGLE_STATE KeyToggleState;
} EFI_KEY_STATE;
typedef struct {
EFI_INPUT_KEY Key;
EFI_KEY_STATE KeyState;
} EFI_KEY_DATA;
//
// Shift state
//
#define EFI_SHIFT_STATE_VALID 0x80000000
#define EFI_RIGHT_SHIFT_PRESSED 0x00000001
#define EFI_LEFT_SHIFT_PRESSED 0x00000002
#define EFI_RIGHT_CONTROL_PRESSED 0x00000004
#define EFI_LEFT_CONTROL_PRESSED 0x00000008
#define EFI_RIGHT_ALT_PRESSED 0x00000010
#define EFI_LEFT_ALT_PRESSED 0x00000020
#define EFI_RIGHT_LOGO_PRESSED 0x00000040
#define EFI_LEFT_LOGO_PRESSED 0x00000080
#define EFI_MENU_KEY_PRESSED 0x00000100
#define EFI_SYS_REQ_PRESSED 0x00000200
//
// Toggle state
//
#define EFI_TOGGLE_STATE_VALID 0x80
#define EFI_KEY_STATE_EXPOSED 0x40
#define EFI_SCROLL_LOCK_ACTIVE 0x01
#define EFI_NUM_LOCK_ACTIVE 0x02
#define EFI_CAPS_LOCK_ACTIVE 0x04
//
// EFI Key Notfication Function
//
typedef
EFI_STATUS
(EFIAPI *EFI_KEY_NOTIFY_FUNCTION) (
IN EFI_KEY_DATA *KeyData
);
typedef
EFI_STATUS
(EFIAPI *EFI_INPUT_RESET_EX) (
IN struct _EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL *This,
IN BOOLEAN ExtendedVerification
)
/*++
Routine Description:
Reset the input device and optionaly run diagnostics
Arguments:
This - Protocol instance pointer.
ExtendedVerification - Driver may perform diagnostics on reset.
Returns:
EFI_SUCCESS - The device was reset.
EFI_DEVICE_ERROR - The device is not functioning properly and could
not be reset.
--*/
;
typedef
EFI_STATUS
(EFIAPI *EFI_INPUT_READ_KEY_EX) (
IN struct _EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL *This,
OUT EFI_KEY_DATA *KeyData
)
/*++
Routine Description:
Reads the next keystroke from the input device. The WaitForKey Event can
be used to test for existence of a keystroke via WaitForEvent () call.
Arguments:
This - Protocol instance pointer.
KeyData - A pointer to a buffer that is filled in with the keystroke
state data for the key that was pressed.
Returns:
EFI_SUCCESS - The keystroke information was returned.
EFI_NOT_READY - There was no keystroke data availiable.
EFI_DEVICE_ERROR - The keystroke information was not returned due to
hardware errors.
EFI_INVALID_PARAMETER - KeyData is NULL.
--*/
;
typedef
EFI_STATUS
(EFIAPI *EFI_SET_STATE) (
IN struct _EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL *This,
IN EFI_KEY_TOGGLE_STATE *KeyToggleState
)
/*++
Routine Description:
Set certain state for the input device.
Arguments:
This - Protocol instance pointer.
KeyToggleState - A pointer to the EFI_KEY_TOGGLE_STATE to set the
state for the input device.
Returns:
EFI_SUCCESS - The device state was set successfully.
EFI_DEVICE_ERROR - The device is not functioning correctly and could
not have the setting adjusted.
EFI_UNSUPPORTED - The device does not have the ability to set its state.
EFI_INVALID_PARAMETER - KeyToggleState is NULL.
--*/
;
typedef
EFI_STATUS
(EFIAPI *EFI_REGISTER_KEYSTROKE_NOTIFY) (
IN struct _EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL *This,
IN EFI_KEY_DATA *KeyData,
IN EFI_KEY_NOTIFY_FUNCTION KeyNotificationFunction,
OUT EFI_HANDLE *NotifyHandle
)
/*++
Routine Description:
Register a notification function for a particular keystroke for the input device.
Arguments:
This - Protocol instance pointer.
KeyData - A pointer to a buffer that is filled in with the keystroke
information data for the key that was pressed.
KeyNotificationFunction - Points to the function to be called when the key
sequence is typed specified by KeyData.
NotifyHandle - Points to the unique handle assigned to the registered notification.
Returns:
EFI_SUCCESS - The notification function was registered successfully.
EFI_OUT_OF_RESOURCES - Unable to allocate resources for necesssary data structures.
EFI_INVALID_PARAMETER - KeyData or NotifyHandle is NULL.
--*/
;
typedef
EFI_STATUS
(EFIAPI *EFI_UNREGISTER_KEYSTROKE_NOTIFY) (
IN struct _EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL *This,
IN EFI_HANDLE NotificationHandle
)
/*++
Routine Description:
Remove a registered notification function from a particular keystroke.
Arguments:
This - Protocol instance pointer.
NotificationHandle - The handle of the notification function being unregistered.
Returns:
EFI_SUCCESS - The notification function was unregistered successfully.
EFI_INVALID_PARAMETER - The NotificationHandle is invalid.
EFI_NOT_FOUND - Can not find the matching entry in database.
--*/
;
typedef struct _EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL {
EFI_INPUT_RESET_EX Reset;
EFI_INPUT_READ_KEY_EX ReadKeyStrokeEx;
EFI_EVENT WaitForKeyEx;
EFI_SET_STATE SetState;
EFI_REGISTER_KEYSTROKE_NOTIFY RegisterKeyNotify;
EFI_UNREGISTER_KEYSTROKE_NOTIFY UnregisterKeyNotify;
} EFI_SIMPLE_TEXT_INPUT_EX_PROTOCOL;
#endif
diff --git a/stand/efi/include/eficonsctl.h b/stand/efi/include/eficonsctl.h
index 68be3d69f4fd..c7f5a137045e 100644
--- a/stand/efi/include/eficonsctl.h
+++ b/stand/efi/include/eficonsctl.h
@@ -1,134 +1,133 @@
/*-
* Copyright (c) 2004 - 2010, Intel Corporation. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Original Module Name: ConsoleControl.h
* Abstract: Abstraction of a Text mode or GOP/UGA screen
*/
-/* $FreeBSD$ */
#ifndef _EFI_CONS_CTL_H
#define _EFI_CONS_CTL_H
#define EFI_CONSOLE_CONTROL_PROTOCOL_GUID \
{ 0xf42f7782, 0x12e, 0x4c12, {0x99, 0x56, 0x49, 0xf9, 0x43, 0x4, 0xf7, 0x21} }
typedef struct _EFI_CONSOLE_CONTROL_PROTOCOL EFI_CONSOLE_CONTROL_PROTOCOL;
typedef enum {
EfiConsoleControlScreenText,
EfiConsoleControlScreenGraphics,
EfiConsoleControlScreenMaxValue
} EFI_CONSOLE_CONTROL_SCREEN_MODE;
typedef
EFI_STATUS
(EFIAPI *EFI_CONSOLE_CONTROL_PROTOCOL_GET_MODE) (
IN EFI_CONSOLE_CONTROL_PROTOCOL *This,
OUT EFI_CONSOLE_CONTROL_SCREEN_MODE *Mode,
OUT BOOLEAN *GopUgaExists, OPTIONAL
OUT BOOLEAN *StdInLocked OPTIONAL
)
/*++
Routine Description:
Return the current video mode information. Also returns info about existence
of Graphics Output devices or UGA Draw devices in system, and if the Std In
device is locked. All the arguments are optional and only returned if a non
NULL pointer is passed in.
Arguments:
This - Protocol instance pointer.
Mode - Are we in text of grahics mode.
GopUgaExists - TRUE if Console Spliter has found a GOP or UGA device
StdInLocked - TRUE if StdIn device is keyboard locked
Returns:
EFI_SUCCESS - Mode information returned.
--*/
;
typedef
EFI_STATUS
(EFIAPI *EFI_CONSOLE_CONTROL_PROTOCOL_SET_MODE) (
IN EFI_CONSOLE_CONTROL_PROTOCOL *This,
IN EFI_CONSOLE_CONTROL_SCREEN_MODE Mode
)
/*++
Routine Description:
Set the current mode to either text or graphics. Graphics is
for Quiet Boot.
Arguments:
This - Protocol instance pointer.
Mode - Mode to set the
Returns:
EFI_SUCCESS - Mode information returned.
--*/
;
typedef
EFI_STATUS
(EFIAPI *EFI_CONSOLE_CONTROL_PROTOCOL_LOCK_STD_IN) (
IN EFI_CONSOLE_CONTROL_PROTOCOL *This,
IN CHAR16 *Password
)
/*++
Routine Description:
Lock Std In devices until Password is typed.
Arguments:
This - Protocol instance pointer.
Password - Password needed to unlock screen. NULL means unlock keyboard
Returns:
EFI_SUCCESS - Mode information returned.
EFI_DEVICE_ERROR - Std In not locked
--*/
;
struct _EFI_CONSOLE_CONTROL_PROTOCOL {
EFI_CONSOLE_CONTROL_PROTOCOL_GET_MODE GetMode;
EFI_CONSOLE_CONTROL_PROTOCOL_SET_MODE SetMode;
EFI_CONSOLE_CONTROL_PROTOCOL_LOCK_STD_IN LockStdIn;
};
extern EFI_GUID gEfiConsoleControlProtocolGuid;
#endif
diff --git a/stand/efi/include/efidebug.h b/stand/efi/include/efidebug.h
index 5576d5f4e48c..b43b62d1283c 100644
--- a/stand/efi/include/efidebug.h
+++ b/stand/efi/include/efidebug.h
@@ -1,118 +1,117 @@
-/* $FreeBSD$ */
#ifndef _EFI_DEBUG_H
#define _EFI_DEBUG_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efidebug.h
Abstract:
EFI library debug functions
Revision History
--*/
extern UINTN EFIDebug;
#if EFI_DEBUG
#define DBGASSERT(a) DbgAssert(__FILE__, __LINE__, #a)
#define DEBUG(a) DbgPrint a
#else
#define DBGASSERT(a)
#define DEBUG(a)
#endif
#if EFI_DEBUG_CLEAR_MEMORY
#define DBGSETMEM(a,l) SetMem(a,l,(CHAR8)BAD_POINTER)
#else
#define DBGSETMEM(a,l)
#endif
#define D_INIT 0x00000001 // Initialization style messages
#define D_WARN 0x00000002 // Warnings
#define D_LOAD 0x00000004 // Load events
#define D_FS 0x00000008 // EFI File system
#define D_POOL 0x00000010 // Alloc & Free's
#define D_PAGE 0x00000020 // Alloc & Free's
#define D_INFO 0x00000040 // Verbose
#define D_VARIABLE 0x00000100 // Variable
#define D_VAR 0x00000100 // Variable
#define D_BM 0x00000400 // Boot Manager
#define D_BLKIO 0x00001000 // BlkIo Driver
#define D_BLKIO_ULTRA 0x00002000 // BlkIo Driver
#define D_NET 0x00004000 // SNI Driver
#define D_NET_ULTRA 0x00008000 // SNI Driver
#define D_UNDI 0x00010000 // UNDI Driver
#define D_LOADFILE 0x00020000 // UNDI Driver
#define D_EVENT 0x00080000 // Event messages
#define D_ERROR 0x80000000 // Error
#define D_RESERVED 0x7ff40A80 // Bits not reserved above
//
// Current Debug level of the system, value of EFIDebug
//
//#define EFI_DBUG_MASK (D_ERROR | D_WARN | D_LOAD | D_BLKIO | D_INIT)
#define EFI_DBUG_MASK (D_ERROR)
//
//
//
#if EFI_DEBUG
#define ASSERT(a) if(!(a)) DBGASSERT(a)
#define ASSERT_LOCKED(l) if(!(l)->Lock) DBGASSERT(l not locked)
#define ASSERT_STRUCT(p,t) DBGASSERT(t not structure), p
#else
#define ASSERT(a)
#define ASSERT_LOCKED(l)
#define ASSERT_STRUCT(p,t)
#endif
//
// Prototypes
//
INTN
DbgAssert (
CHAR8 *file,
INTN lineno,
CHAR8 *string
);
INTN
DbgPrint (
INTN mask,
CHAR8 *format,
...
);
#endif
diff --git a/stand/efi/include/efidef.h b/stand/efi/include/efidef.h
index a8f88d41df24..54be3bb2a0ce 100644
--- a/stand/efi/include/efidef.h
+++ b/stand/efi/include/efidef.h
@@ -1,224 +1,223 @@
-/* $FreeBSD$ */
#ifndef _EFI_DEF_H
#define _EFI_DEF_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efidef.h
Abstract:
EFI definitions
Revision History
--*/
typedef UINT16 CHAR16;
typedef UINT8 CHAR8;
#ifndef ACPI_THREAD_ID /* ACPI's definitions are fine */
typedef UINT8 BOOLEAN;
#endif
#ifndef TRUE
#define TRUE ((BOOLEAN) 1)
#define FALSE ((BOOLEAN) 0)
#endif
#ifndef NULL
#define NULL ((VOID *) 0)
#endif
typedef UINTN EFI_STATUS;
typedef UINT64 EFI_LBA;
typedef UINTN EFI_TPL;
typedef VOID *EFI_HANDLE;
typedef VOID *EFI_EVENT;
//
// Prototype argument decoration for EFI parameters to indicate
// their direction
//
// IN - argument is passed into the function
// OUT - argument (pointer) is returned from the function
// OPTIONAL - argument is optional
//
#ifndef IN
#define IN
#define OUT
#define OPTIONAL
#define CONST const
#endif
//
// A GUID
//
typedef struct {
UINT32 Data1;
UINT16 Data2;
UINT16 Data3;
UINT8 Data4[8];
} EFI_GUID;
//
// Time
//
typedef struct {
UINT16 Year; // 1998 - 20XX
UINT8 Month; // 1 - 12
UINT8 Day; // 1 - 31
UINT8 Hour; // 0 - 23
UINT8 Minute; // 0 - 59
UINT8 Second; // 0 - 59
UINT8 Pad1;
UINT32 Nanosecond; // 0 - 999,999,999
INT16 TimeZone; // -1440 to 1440 or 2047
UINT8 Daylight;
UINT8 Pad2;
} EFI_TIME;
// Bit definitions for EFI_TIME.Daylight
#define EFI_TIME_ADJUST_DAYLIGHT 0x01
#define EFI_TIME_IN_DAYLIGHT 0x02
// Value definition for EFI_TIME.TimeZone
#define EFI_UNSPECIFIED_TIMEZONE 0x07FF
//
// Networking
//
typedef struct {
UINT8 Addr[4];
} EFI_IPv4_ADDRESS;
typedef struct {
UINT8 Addr[16];
} EFI_IPv6_ADDRESS;
typedef struct {
UINT8 Addr[32];
} EFI_MAC_ADDRESS;
typedef struct {
UINT32 ReceivedQueueTimeoutValue;
UINT32 TransmitQueueTimeoutValue;
UINT16 ProtocolTypeFilter;
BOOLEAN EnableUnicastReceive;
BOOLEAN EnableMulticastReceive;
BOOLEAN EnableBroadcastReceive;
BOOLEAN EnablePromiscuousReceive;
BOOLEAN FlushQueuesOnReset;
BOOLEAN EnableReceiveTimestamps;
BOOLEAN DisableBackgroundPolling;
} EFI_MANAGED_NETWORK_CONFIG_DATA;
//
// Memory
//
typedef UINT64 EFI_PHYSICAL_ADDRESS;
typedef UINT64 EFI_VIRTUAL_ADDRESS;
typedef enum {
AllocateAnyPages,
AllocateMaxAddress,
AllocateAddress,
MaxAllocateType
} EFI_ALLOCATE_TYPE;
//Preseve the attr on any range supplied.
//ConventialMemory must have WB,SR,SW when supplied.
//When allocating from ConventialMemory always make it WB,SR,SW
//When returning to ConventialMemory always make it WB,SR,SW
//When getting the memory map, or on RT for runtime types
typedef enum {
EfiReservedMemoryType,
EfiLoaderCode,
EfiLoaderData,
EfiBootServicesCode,
EfiBootServicesData,
EfiRuntimeServicesCode,
EfiRuntimeServicesData,
EfiConventionalMemory,
EfiUnusableMemory,
EfiACPIReclaimMemory,
EfiACPIMemoryNVS,
EfiMemoryMappedIO,
EfiMemoryMappedIOPortSpace,
EfiPalCode,
EfiPersistentMemory,
EfiMaxMemoryType
} EFI_MEMORY_TYPE;
// possible caching types for the memory range
#define EFI_MEMORY_UC 0x0000000000000001
#define EFI_MEMORY_WC 0x0000000000000002
#define EFI_MEMORY_WT 0x0000000000000004
#define EFI_MEMORY_WB 0x0000000000000008
#define EFI_MEMORY_UCE 0x0000000000000010
// physical memory protection on range
#define EFI_MEMORY_WP 0x0000000000001000
#define EFI_MEMORY_RP 0x0000000000002000
#define EFI_MEMORY_XP 0x0000000000004000
#define EFI_MEMORY_NV 0x0000000000008000
#define EFI_MEMORY_MORE_RELIABLE 0x0000000000010000
#define EFI_MEMORY_RO 0x0000000000020000
// range requires a runtime mapping
#define EFI_MEMORY_RUNTIME 0x8000000000000000
#define EFI_MEMORY_DESCRIPTOR_VERSION 1
typedef struct {
UINT32 Type; // Field size is 32 bits followed by 32 bit pad
UINT32 Pad;
EFI_PHYSICAL_ADDRESS PhysicalStart; // Field size is 64 bits
EFI_VIRTUAL_ADDRESS VirtualStart; // Field size is 64 bits
UINT64 NumberOfPages; // Field size is 64 bits
UINT64 Attribute; // Field size is 64 bits
} EFI_MEMORY_DESCRIPTOR;
//
// International Language
//
typedef UINT8 ISO_639_2;
#define ISO_639_2_ENTRY_SIZE 3
//
//
//
#define EFI_PAGE_SIZE 4096
#define EFI_PAGE_MASK 0xFFF
#define EFI_PAGE_SHIFT 12
#define EFI_SIZE_TO_PAGES(a) \
( ((a) >> EFI_PAGE_SHIFT) + (((a) & EFI_PAGE_MASK) ? 1 : 0) )
#endif
diff --git a/stand/efi/include/efidevp.h b/stand/efi/include/efidevp.h
index b00b78f02c6a..409f2b23b9ef 100644
--- a/stand/efi/include/efidevp.h
+++ b/stand/efi/include/efidevp.h
@@ -1,511 +1,510 @@
-/* $FreeBSD$ */
#ifndef _DEVPATH_H
#define _DEVPATH_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
devpath.h
Abstract:
Defines for parsing the EFI Device Path structures
Revision History
--*/
//
// Device Path structures - Section C
//
#pragma pack(1)
typedef struct _EFI_DEVICE_PATH {
UINT8 Type;
UINT8 SubType;
UINT8 Length[2];
} EFI_DEVICE_PATH;
#define EFI_DP_TYPE_MASK 0x7F
#define EFI_DP_TYPE_UNPACKED 0x80
#define END_DEVICE_PATH_TYPE 0x7f
#define END_ENTIRE_DEVICE_PATH_SUBTYPE 0xff
#define END_INSTANCE_DEVICE_PATH_SUBTYPE 0x01
#define END_DEVICE_PATH_LENGTH (sizeof(EFI_DEVICE_PATH))
#define DP_IS_END_TYPE(a)
#define DP_IS_END_SUBTYPE(a) ( ((a)->SubType == END_ENTIRE_DEVICE_PATH_SUBTYPE )
#define DevicePathType(a) ( ((a)->Type) & EFI_DP_TYPE_MASK )
#define DevicePathSubType(a) ( (a)->SubType )
#define DevicePathNodeLength(a) ((size_t)(((a)->Length[0]) | ((a)->Length[1] << 8)))
#define NextDevicePathNode(a) ( (EFI_DEVICE_PATH *) ( ((UINT8 *) (a)) + DevicePathNodeLength(a)))
#define IsDevicePathType(a, t) ( DevicePathType(a) == t )
#define IsDevicePathEndType(a) IsDevicePathType(a, END_DEVICE_PATH_TYPE)
#define IsDevicePathEndSubType(a) ( (a)->SubType == END_ENTIRE_DEVICE_PATH_SUBTYPE )
#define IsDevicePathEnd(a) ( IsDevicePathEndType(a) && IsDevicePathEndSubType(a) )
#define IsDevicePathUnpacked(a) ( (a)->Type & EFI_DP_TYPE_UNPACKED )
#define SetDevicePathNodeLength(a,l) { \
(a)->Length[0] = (UINT8) (l); \
(a)->Length[1] = (UINT8) ((l) >> 8); \
}
#define SetDevicePathEndNode(a) { \
(a)->Type = END_DEVICE_PATH_TYPE; \
(a)->SubType = END_ENTIRE_DEVICE_PATH_SUBTYPE; \
(a)->Length[0] = sizeof(EFI_DEVICE_PATH); \
(a)->Length[1] = 0; \
}
/*
*
*/
#define HARDWARE_DEVICE_PATH 0x01
#define HW_PCI_DP 0x01
typedef struct _PCI_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT8 Function;
UINT8 Device;
} PCI_DEVICE_PATH;
#define HW_PCCARD_DP 0x02
typedef struct _PCCARD_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT8 FunctionNumber;
} PCCARD_DEVICE_PATH;
#define HW_MEMMAP_DP 0x03
typedef struct _MEMMAP_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 MemoryType;
EFI_PHYSICAL_ADDRESS StartingAddress;
EFI_PHYSICAL_ADDRESS EndingAddress;
} MEMMAP_DEVICE_PATH;
#define HW_VENDOR_DP 0x04
typedef struct _VENDOR_DEVICE_PATH {
EFI_DEVICE_PATH Header;
EFI_GUID Guid;
} VENDOR_DEVICE_PATH;
#define UNKNOWN_DEVICE_GUID \
{ 0xcf31fac5, 0xc24e, 0x11d2, {0x85, 0xf3, 0x0, 0xa0, 0xc9, 0x3e, 0xc9, 0x3b} }
typedef struct _UKNOWN_DEVICE_VENDOR_DP {
VENDOR_DEVICE_PATH DevicePath;
UINT8 LegacyDriveLetter;
} UNKNOWN_DEVICE_VENDOR_DEVICE_PATH;
#define HW_CONTROLLER_DP 0x05
typedef struct _CONTROLLER_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 Controller;
} CONTROLLER_DEVICE_PATH;
/*
*
*/
#define ACPI_DEVICE_PATH 0x02
#define ACPI_DP 0x01
typedef struct _ACPI_HID_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 HID;
UINT32 UID;
} ACPI_HID_DEVICE_PATH;
#define ACPI_EXTENDED_DP 0x02
typedef struct _ACPI_EXTENDED_HID_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 HID;
UINT32 UID;
UINT32 CID;
} ACPI_EXTENDED_HID_DEVICE_PATH;
#define ACPI_ADR_DP 0x03
/* ACPI_ADR_DEVICE_PATH not defined */
//
// EISA ID Macro
// EISA ID Definition 32-bits
// bits[15:0] - three character compressed ASCII EISA ID.
// bits[31:16] - binary number
// Compressed ASCII is 5 bits per character 0b00001 = 'A' 0b11010 = 'Z'
//
#define PNP_EISA_ID_CONST 0x41d0
#define EISA_ID(_Name, _Num) ((UINT32) ((_Name) | (_Num) << 16))
#define EISA_PNP_ID(_PNPId) (EISA_ID(PNP_EISA_ID_CONST, (_PNPId)))
#define EFI_PNP_ID(_PNPId) (EISA_ID(PNP_EISA_ID_CONST, (_PNPId)))
#define PNP_EISA_ID_MASK 0xffff
#define EISA_ID_TO_NUM(_Id) ((_Id) >> 16)
/*
*
*/
#define MESSAGING_DEVICE_PATH 0x03
#define MSG_ATAPI_DP 0x01
typedef struct _ATAPI_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT8 PrimarySecondary;
UINT8 SlaveMaster;
UINT16 Lun;
} ATAPI_DEVICE_PATH;
#define MSG_SCSI_DP 0x02
typedef struct _SCSI_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT16 Pun;
UINT16 Lun;
} SCSI_DEVICE_PATH;
#define MSG_FIBRECHANNEL_DP 0x03
typedef struct _FIBRECHANNEL_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 Reserved;
UINT64 WWN;
UINT64 Lun;
} FIBRECHANNEL_DEVICE_PATH;
#define MSG_1394_DP 0x04
typedef struct _F1394_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 Reserved;
UINT64 Guid;
} F1394_DEVICE_PATH;
#define MSG_USB_DP 0x05
typedef struct _USB_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT8 ParentPortNumber;
UINT8 InterfaceNumber;
} USB_DEVICE_PATH;
#define MSG_USB_CLASS_DP 0x0F
typedef struct _USB_CLASS_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT16 VendorId;
UINT16 ProductId;
UINT8 DeviceClass;
UINT8 DeviceSubClass;
UINT8 DeviceProtocol;
} USB_CLASS_DEVICE_PATH;
#define MSG_I2O_DP 0x06
typedef struct _I2O_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 Tid;
} I2O_DEVICE_PATH;
#define MSG_MAC_ADDR_DP 0x0b
typedef struct _MAC_ADDR_DEVICE_PATH {
EFI_DEVICE_PATH Header;
EFI_MAC_ADDRESS MacAddress;
UINT8 IfType;
} MAC_ADDR_DEVICE_PATH;
#define MSG_IPv4_DP 0x0c
typedef struct _IPv4_DEVICE_PATH {
EFI_DEVICE_PATH Header;
EFI_IPv4_ADDRESS LocalIpAddress;
EFI_IPv4_ADDRESS RemoteIpAddress;
UINT16 LocalPort;
UINT16 RemotePort;
UINT16 Protocol;
BOOLEAN StaticIpAddress;
EFI_IPv4_ADDRESS GatewayIpAddress;
EFI_IPv4_ADDRESS SubnetMask;
} IPv4_DEVICE_PATH;
#define MSG_IPv6_DP 0x0d
typedef struct _IPv6_DEVICE_PATH {
EFI_DEVICE_PATH Header;
EFI_IPv6_ADDRESS LocalIpAddress;
EFI_IPv6_ADDRESS RemoteIpAddress;
UINT16 LocalPort;
UINT16 RemotePort;
UINT16 Protocol;
BOOLEAN StaticIpAddress;
} IPv6_DEVICE_PATH;
#define MSG_INFINIBAND_DP 0x09
typedef struct _INFINIBAND_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 ResourceFlags;
UINT8 PortGid[16];
UINT64 ServiceId;
UINT64 TargetPortId;
UINT64 DeviceId;
} INFINIBAND_DEVICE_PATH;
#define INFINIBAND_RESOURCE_FLAG_IOC_SERVICE 0x01
#define INFINIBAND_RESOURCE_FLAG_EXTENDED_BOOT_ENVIRONMENT 0x02
#define INFINIBAND_RESOURCE_FLAG_CONSOLE_PROTOCOL 0x04
#define INFINIBAND_RESOURCE_FLAG_STORAGE_PROTOCOL 0x08
#define INFINIBAND_RESOURCE_FLAG_NETWORK_PROTOCOL 0x10
#define MSG_UART_DP 0x0e
typedef struct _UART_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 Reserved;
UINT64 BaudRate;
UINT8 DataBits;
UINT8 Parity;
UINT8 StopBits;
} UART_DEVICE_PATH;
#define MSG_VENDOR_DP 0x0A
/* Use VENDOR_DEVICE_PATH struct */
#define DEVICE_PATH_MESSAGING_PC_ANSI \
{ 0xe0c14753, 0xf9be, 0x11d2, {0x9a, 0x0c, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define DEVICE_PATH_MESSAGING_VT_100 \
{ 0xdfa66065, 0xb419, 0x11d3, {0x9a, 0x2d, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define DEVICE_PATH_MESSAGING_VT_100_PLUS \
{ 0x7baec70b, 0x57e0, 0x4c76, {0x8e, 0x87, 0x2f, 0x9e, 0x28, 0x08, 0x83, 0x43} }
#define DEVICE_PATH_MESSAGING_VT_UTF8 \
{ 0xad15a0d6, 0x8bec, 0x4acf, {0xa0, 0x73, 0xd0, 0x1d, 0xe7, 0x7e, 0x2d, 0x88} }
/* Device Logical Unit SubType. */
#define MSG_DEVICE_LOGICAL_UNIT_DP 0x11
typedef struct {
EFI_DEVICE_PATH Header;
/* Logical Unit Number for the interface. */
UINT8 Lun;
} DEVICE_LOGICAL_UNIT_DEVICE_PATH;
#define MSG_SATA_DP 0x12
typedef struct _SATA_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT16 HBAPortNumber;
UINT16 PortMultiplierPortNumber;
UINT16 Lun;
} SATA_DEVICE_PATH;
/* DNS Device Path SubType */
#define MSG_DNS_DP 0x1F
typedef struct {
EFI_DEVICE_PATH Header;
/* Indicates the DNS server address is IPv4 or IPv6 address. */
UINT8 IsIPv6;
/* Instance of the DNS server address. */
/* XXX: actually EFI_IP_ADDRESS */
EFI_IPv4_ADDRESS DnsServerIp[];
} DNS_DEVICE_PATH;
/* Uniform Resource Identifiers (URI) Device Path SubType */
#define MSG_URI_DP 0x18
typedef struct {
EFI_DEVICE_PATH Header;
/* Instance of the URI pursuant to RFC 3986. */
CHAR8 Uri[];
} URI_DEVICE_PATH;
#define MEDIA_DEVICE_PATH 0x04
#define MEDIA_HARDDRIVE_DP 0x01
typedef struct _HARDDRIVE_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 PartitionNumber;
UINT64 PartitionStart;
UINT64 PartitionSize;
UINT8 Signature[16];
UINT8 MBRType;
UINT8 SignatureType;
} HARDDRIVE_DEVICE_PATH;
#define MBR_TYPE_PCAT 0x01
#define MBR_TYPE_EFI_PARTITION_TABLE_HEADER 0x02
#define SIGNATURE_TYPE_MBR 0x01
#define SIGNATURE_TYPE_GUID 0x02
#define MEDIA_CDROM_DP 0x02
typedef struct _CDROM_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT32 BootEntry;
UINT64 PartitionStart;
UINT64 PartitionSize;
} CDROM_DEVICE_PATH;
#define MEDIA_VENDOR_DP 0x03
/* Use VENDOR_DEVICE_PATH struct */
#define MEDIA_FILEPATH_DP 0x04
typedef struct _FILEPATH_DEVICE_PATH {
EFI_DEVICE_PATH Header;
CHAR16 PathName[1];
} FILEPATH_DEVICE_PATH;
#define SIZE_OF_FILEPATH_DEVICE_PATH EFI_FIELD_OFFSET(FILEPATH_DEVICE_PATH,PathName)
#define MEDIA_PROTOCOL_DP 0x05
typedef struct _MEDIA_PROTOCOL_DEVICE_PATH {
EFI_DEVICE_PATH Header;
EFI_GUID Protocol;
} MEDIA_PROTOCOL_DEVICE_PATH;
#define BBS_DEVICE_PATH 0x05
#define BBS_BBS_DP 0x01
typedef struct _BBS_BBS_DEVICE_PATH {
EFI_DEVICE_PATH Header;
UINT16 DeviceType;
UINT16 StatusFlag;
CHAR8 String[1];
} BBS_BBS_DEVICE_PATH;
/* DeviceType definitions - from BBS specification */
#define BBS_TYPE_FLOPPY 0x01
#define BBS_TYPE_HARDDRIVE 0x02
#define BBS_TYPE_CDROM 0x03
#define BBS_TYPE_PCMCIA 0x04
#define BBS_TYPE_USB 0x05
#define BBS_TYPE_EMBEDDED_NETWORK 0x06
#define BBS_TYPE_DEV 0x80
#define BBS_TYPE_UNKNOWN 0xFF
typedef union {
EFI_DEVICE_PATH DevPath;
PCI_DEVICE_PATH Pci;
PCCARD_DEVICE_PATH PcCard;
MEMMAP_DEVICE_PATH MemMap;
VENDOR_DEVICE_PATH Vendor;
UNKNOWN_DEVICE_VENDOR_DEVICE_PATH UnknownVendor;
CONTROLLER_DEVICE_PATH Controller;
ACPI_HID_DEVICE_PATH Acpi;
ATAPI_DEVICE_PATH Atapi;
SCSI_DEVICE_PATH Scsi;
FIBRECHANNEL_DEVICE_PATH FibreChannel;
F1394_DEVICE_PATH F1394;
USB_DEVICE_PATH Usb;
USB_CLASS_DEVICE_PATH UsbClass;
I2O_DEVICE_PATH I2O;
MAC_ADDR_DEVICE_PATH MacAddr;
IPv4_DEVICE_PATH Ipv4;
IPv6_DEVICE_PATH Ipv6;
INFINIBAND_DEVICE_PATH InfiniBand;
UART_DEVICE_PATH Uart;
HARDDRIVE_DEVICE_PATH HardDrive;
CDROM_DEVICE_PATH CD;
FILEPATH_DEVICE_PATH FilePath;
MEDIA_PROTOCOL_DEVICE_PATH MediaProtocol;
BBS_BBS_DEVICE_PATH Bbs;
} EFI_DEV_PATH;
typedef union {
EFI_DEVICE_PATH *DevPath;
PCI_DEVICE_PATH *Pci;
PCCARD_DEVICE_PATH *PcCard;
MEMMAP_DEVICE_PATH *MemMap;
VENDOR_DEVICE_PATH *Vendor;
UNKNOWN_DEVICE_VENDOR_DEVICE_PATH *UnknownVendor;
CONTROLLER_DEVICE_PATH *Controller;
ACPI_HID_DEVICE_PATH *Acpi;
ACPI_EXTENDED_HID_DEVICE_PATH *ExtendedAcpi;
ATAPI_DEVICE_PATH *Atapi;
SCSI_DEVICE_PATH *Scsi;
FIBRECHANNEL_DEVICE_PATH *FibreChannel;
F1394_DEVICE_PATH *F1394;
USB_DEVICE_PATH *Usb;
USB_CLASS_DEVICE_PATH *UsbClass;
I2O_DEVICE_PATH *I2O;
MAC_ADDR_DEVICE_PATH *MacAddr;
IPv4_DEVICE_PATH *Ipv4;
IPv6_DEVICE_PATH *Ipv6;
INFINIBAND_DEVICE_PATH *InfiniBand;
UART_DEVICE_PATH *Uart;
HARDDRIVE_DEVICE_PATH *HardDrive;
FILEPATH_DEVICE_PATH *FilePath;
MEDIA_PROTOCOL_DEVICE_PATH *MediaProtocol;
CDROM_DEVICE_PATH *CD;
BBS_BBS_DEVICE_PATH *Bbs;
} EFI_DEV_PATH_PTR;
#define EFI_LOADED_IMAGE_DEVICE_PATH_PROTOCOL_GUID \
{ 0xbc62157e, 0x3e33, 0x4fec, { 0x99, 0x20, 0x2d, 0x3b, 0x36, 0xd7, 0x50, 0xdf } }
#define EFI_DEVICE_PATH_TO_TEXT_PROTOCOL_GUID \
{ 0x8b843e20, 0x8132, 0x4852, { 0x90, 0xcc, 0x55, 0x1a, 0x4e, 0x4a, 0x7f, 0x1c } }
#define EFI_DEVICE_PATH_FROM_TEXT_PROTOCOL_GUID \
{ 0x05c99a21, 0xc70f, 0x4ad2, { 0x8a, 0x5f, 0x35, 0xdf, 0x33, 0x43, 0xf5, 0x1e } }
INTERFACE_DECL(_EFI_DEVICE_PATH_PROTOCOL);
typedef
CHAR16*
(EFIAPI *EFI_DEVICE_PATH_TO_TEXT_NODE) (
IN struct _EFI_DEVICE_PATH *This,
IN BOOLEAN DisplayOnly,
IN BOOLEAN AllowShortCuts
);
typedef
CHAR16*
(EFIAPI *EFI_DEVICE_PATH_TO_TEXT_PATH) (
IN struct _EFI_DEVICE_PATH *This,
IN BOOLEAN DisplayOnly,
IN BOOLEAN AllowShortCuts
);
typedef struct _EFI_DEVICE_PATH_TO_TEXT_PROTOCOL {
EFI_DEVICE_PATH_TO_TEXT_NODE ConvertDeviceNodeToText;
EFI_DEVICE_PATH_TO_TEXT_PATH ConvertDevicePathToText;
} EFI_DEVICE_PATH_TO_TEXT_PROTOCOL;
typedef
struct _EFI_DEVICE_PATH*
(EFIAPI *EFI_DEVICE_PATH_FROM_TEXT_NODE) (
IN CONST CHAR16* TextDeviceNode
);
typedef
struct _EFI_DEVICE_PATH*
(EFIAPI *EFI_DEVICE_PATH_FROM_TEXT_PATH) (
IN CONST CHAR16* TextDevicePath
);
typedef struct _EFI_DEVICE_PATH_FROM_TEXT_PROTOCOL {
EFI_DEVICE_PATH_FROM_TEXT_NODE ConvertTextToDeviceNode;
EFI_DEVICE_PATH_FROM_TEXT_PATH ConvertTextToDevicePath;
} EFI_DEVICE_PATH_FROM_TEXT_PROTOCOL;
#pragma pack()
#endif
diff --git a/stand/efi/include/efierr.h b/stand/efi/include/efierr.h
index a8b655718599..2aa2622a3877 100644
--- a/stand/efi/include/efierr.h
+++ b/stand/efi/include/efierr.h
@@ -1,68 +1,67 @@
-/* $FreeBSD$ */
#ifndef _EFI_ERR_H
#define _EFI_ERR_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efierr.h
Abstract:
EFI error codes
Revision History
--*/
#define EFIWARN(a) (a)
#define EFI_ERROR(a) (((INTN) a) < 0)
#define EFI_ERROR_CODE(a) (unsigned long)(a & ~EFI_ERROR_MASK)
#define EFI_SUCCESS 0
#define EFI_LOAD_ERROR EFIERR(1)
#define EFI_INVALID_PARAMETER EFIERR(2)
#define EFI_UNSUPPORTED EFIERR(3)
#define EFI_BAD_BUFFER_SIZE EFIERR(4)
#define EFI_BUFFER_TOO_SMALL EFIERR(5)
#define EFI_NOT_READY EFIERR(6)
#define EFI_DEVICE_ERROR EFIERR(7)
#define EFI_WRITE_PROTECTED EFIERR(8)
#define EFI_OUT_OF_RESOURCES EFIERR(9)
#define EFI_VOLUME_CORRUPTED EFIERR(10)
#define EFI_VOLUME_FULL EFIERR(11)
#define EFI_NO_MEDIA EFIERR(12)
#define EFI_MEDIA_CHANGED EFIERR(13)
#define EFI_NOT_FOUND EFIERR(14)
#define EFI_ACCESS_DENIED EFIERR(15)
#define EFI_NO_RESPONSE EFIERR(16)
#define EFI_NO_MAPPING EFIERR(17)
#define EFI_TIMEOUT EFIERR(18)
#define EFI_NOT_STARTED EFIERR(19)
#define EFI_ALREADY_STARTED EFIERR(20)
#define EFI_ABORTED EFIERR(21)
#define EFI_ICMP_ERROR EFIERR(22)
#define EFI_TFTP_ERROR EFIERR(23)
#define EFI_PROTOCOL_ERROR EFIERR(24)
#define EFI_WARN_UNKNOWN_GLYPH EFIWARN(1)
#define EFI_WARN_DELETE_FAILURE EFIWARN(2)
#define EFI_WARN_WRITE_FAILURE EFIWARN(3)
#define EFI_WARN_BUFFER_TOO_SMALL EFIWARN(4)
#endif
diff --git a/stand/efi/include/efifpswa.h b/stand/efi/include/efifpswa.h
index 21823c5ff6f1..ed831d02e51b 100644
--- a/stand/efi/include/efifpswa.h
+++ b/stand/efi/include/efifpswa.h
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
#ifndef _EFI_FPSWA_H
#define _EFI_FPSWA_H
/*
* EFI FP SWA Driver (Floating Point Software Assist)
*/
#define EFI_INTEL_FPSWA \
{ 0xc41b6531, 0x97b9, 0x11d3, {0x9a, 0x29, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
INTERFACE_DECL(_FPSWA_INTERFACE);
typedef struct _FPSWA_RET {
UINT64 status;
UINT64 err1;
UINT64 err2;
UINT64 err3;
} FPSWA_RET;
typedef
FPSWA_RET
(EFIAPI *EFI_FPSWA) (
IN UINTN TrapType,
IN OUT VOID *Bundle,
IN OUT UINT64 *pipsr,
IN OUT UINT64 *pfsr,
IN OUT UINT64 *pisr,
IN OUT UINT64 *ppreds,
IN OUT UINT64 *pifs,
IN OUT VOID *fp_state
);
typedef struct _FPSWA_INTERFACE {
UINT32 Revision;
UINT32 Reserved;
EFI_FPSWA Fpswa;
} FPSWA_INTERFACE;
#endif
diff --git a/stand/efi/include/efifs.h b/stand/efi/include/efifs.h
index 58febb66eb75..cb92eac9557f 100644
--- a/stand/efi/include/efifs.h
+++ b/stand/efi/include/efifs.h
@@ -1,123 +1,122 @@
-/* $FreeBSD$ */
#ifndef _EFI_FS_H
#define _EFI_FS_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efifs.h
Abstract:
EFI File System structures
Revision History
--*/
//
// EFI Partition header (normaly starts in LBA 1)
//
#define EFI_PARTITION_SIGNATURE 0x5053595320494249
#define EFI_PARTITION_REVISION 0x00010001
#define MIN_EFI_PARTITION_BLOCK_SIZE 512
#define EFI_PARTITION_LBA 1
typedef struct _EFI_PARTITION_HEADER {
EFI_TABLE_HEADER Hdr;
UINT32 DirectoryAllocationNumber;
UINT32 BlockSize;
EFI_LBA FirstUsableLba;
EFI_LBA LastUsableLba;
EFI_LBA UnusableSpace;
EFI_LBA FreeSpace;
EFI_LBA RootFile;
EFI_LBA SecutiryFile;
} EFI_PARTITION_HEADER;
//
// File header
//
#define EFI_FILE_HEADER_SIGNATURE 0x454c494620494249
#define EFI_FILE_HEADER_REVISION 0x00010000
#define EFI_FILE_STRING_SIZE 260
typedef struct _EFI_FILE_HEADER {
EFI_TABLE_HEADER Hdr;
UINT32 Class;
UINT32 LBALOffset;
EFI_LBA Parent;
UINT64 FileSize;
UINT64 FileAttributes;
EFI_TIME FileCreateTime;
EFI_TIME FileModificationTime;
EFI_GUID VendorGuid;
CHAR16 FileString[EFI_FILE_STRING_SIZE];
} EFI_FILE_HEADER;
//
// Return the file's first LBAL which is in the same
// logical block as the file header
//
#define EFI_FILE_LBAL(a) ((EFI_LBAL *) (((CHAR8 *) (a)) + (a)->LBALOffset))
#define EFI_FILE_CLASS_FREE_SPACE 1
#define EFI_FILE_CLASS_EMPTY 2
#define EFI_FILE_CLASS_NORMAL 3
//
// Logical Block Address List - the fundemental block
// description structure
//
#define EFI_LBAL_SIGNATURE 0x4c41424c20494249
#define EFI_LBAL_REVISION 0x00010000
typedef struct _EFI_LBAL {
EFI_TABLE_HEADER Hdr;
UINT32 Class;
EFI_LBA Parent;
EFI_LBA Next;
UINT32 ArraySize;
UINT32 ArrayCount;
} EFI_LBAL;
// Array size
#define EFI_LBAL_ARRAY_SIZE(lbal,offs,blks) \
(((blks) - (offs) - (lbal)->Hdr.HeaderSize) / sizeof(EFI_RL))
//
// Logical Block run-length
//
typedef struct {
EFI_LBA Start;
UINT64 Length;
} EFI_RL;
//
// Return the run-length structure from an LBAL header
//
#define EFI_LBAL_RL(a) ((EFI_RL*) (((CHAR8 *) (a)) + (a)->Hdr.HeaderSize))
#endif
diff --git a/stand/efi/include/efigop.h b/stand/efi/include/efigop.h
index 104fa6e44b5a..e1d4b8163401 100644
--- a/stand/efi/include/efigop.h
+++ b/stand/efi/include/efigop.h
@@ -1,121 +1,120 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efigop.h
Abstract:
Info about framebuffers
Revision History
--*/
#ifndef _EFIGOP_H
#define _EFIGOP_H
#define EFI_GRAPHICS_OUTPUT_PROTOCOL_GUID \
{ 0x9042a9de, 0x23dc, 0x4a38, {0x96, 0xfb, 0x7a, 0xde, 0xd0, 0x80, 0x51, 0x6a} }
INTERFACE_DECL(_EFI_GRAPHICS_OUTPUT);
typedef struct {
UINT32 RedMask;
UINT32 GreenMask;
UINT32 BlueMask;
UINT32 ReservedMask;
} EFI_PIXEL_BITMASK;
typedef enum {
PixelRedGreenBlueReserved8BitPerColor,
PixelBlueGreenRedReserved8BitPerColor,
PixelBitMask,
PixelBltOnly,
PixelFormatMax,
} EFI_GRAPHICS_PIXEL_FORMAT;
typedef struct {
UINT32 Version;
UINT32 HorizontalResolution;
UINT32 VerticalResolution;
EFI_GRAPHICS_PIXEL_FORMAT PixelFormat;
EFI_PIXEL_BITMASK PixelInformation;
UINT32 PixelsPerScanLine;
} EFI_GRAPHICS_OUTPUT_MODE_INFORMATION;
typedef struct {
UINT32 MaxMode;
UINT32 Mode;
EFI_GRAPHICS_OUTPUT_MODE_INFORMATION *Info;
UINTN SizeOfInfo;
EFI_PHYSICAL_ADDRESS FrameBufferBase;
UINTN FrameBufferSize;
} EFI_GRAPHICS_OUTPUT_PROTOCOL_MODE;
typedef
EFI_STATUS
(EFIAPI *EFI_GRAPHICS_OUTPUT_PROTOCOL_QUERY_MODE) (
IN struct _EFI_GRAPHICS_OUTPUT *This,
IN UINT32 ModeNumber,
OUT UINTN *SizeOfInfo,
OUT EFI_GRAPHICS_OUTPUT_MODE_INFORMATION **Info
);
typedef
EFI_STATUS
(EFIAPI *EFI_GRAPHICS_OUTPUT_PROTOCOL_SET_MODE) (
IN struct _EFI_GRAPHICS_OUTPUT *This,
IN UINT32 ModeNumber
);
typedef struct {
UINT8 Blue;
UINT8 Green;
UINT8 Red;
UINT8 Reserved;
} EFI_GRAPHICS_OUTPUT_BLT_PIXEL;
typedef enum {
EfiBltVideoFill,
EfiBltVideoToBltBuffer,
EfiBltBufferToVideo,
EfiBltVideoToVideo,
EfiGraphcisOutputBltOperationMax,
} EFI_GRAPHICS_OUTPUT_BLT_OPERATION;
typedef
EFI_STATUS
(EFIAPI *EFI_GRAPHICS_OUTPUT_PROTOCOL_BLT) (
IN struct _EFI_GRAPHICS_OUTPUT *This,
IN OUT EFI_GRAPHICS_OUTPUT_BLT_PIXEL *BltBuffer,
IN EFI_GRAPHICS_OUTPUT_BLT_OPERATION BltOperation,
IN UINTN SourceX,
IN UINTN SourceY,
IN UINTN DestinationX,
IN UINTN DestinationY,
IN UINTN Width,
IN UINTN Height,
IN UINTN Delta
);
typedef struct _EFI_GRAPHICS_OUTPUT {
EFI_GRAPHICS_OUTPUT_PROTOCOL_QUERY_MODE QueryMode;
EFI_GRAPHICS_OUTPUT_PROTOCOL_SET_MODE SetMode;
EFI_GRAPHICS_OUTPUT_PROTOCOL_BLT Blt;
EFI_GRAPHICS_OUTPUT_PROTOCOL_MODE *Mode;
} EFI_GRAPHICS_OUTPUT;
#endif /* _EFIGOP_H */
diff --git a/stand/efi/include/efigpt.h b/stand/efi/include/efigpt.h
index 045d49520b40..ac90a304f762 100644
--- a/stand/efi/include/efigpt.h
+++ b/stand/efi/include/efigpt.h
@@ -1,69 +1,68 @@
-/* $FreeBSD$ */
#ifndef _EFI_GPT_H
#define _EFI_GPT_H
/*++
Copyright (c) 1998 Intel Corporation
Module Name:
EfiGpt.h
Abstract:
Include file for EFI partitioning scheme
Revision History
--*/
#define PRIMARY_PART_HEADER_LBA 1
typedef struct {
EFI_TABLE_HEADER Header;
EFI_LBA MyLBA;
EFI_LBA AlternateLBA;
EFI_LBA FirstUsableLBA;
EFI_LBA LastUsableLBA;
EFI_GUID DiskGUID;
EFI_LBA PartitionEntryLBA;
UINT32 NumberOfPartitionEntries;
UINT32 SizeOfPartitionEntry;
UINT32 PartitionEntryArrayCRC32;
} EFI_PARTITION_TABLE_HEADER;
#define EFI_PTAB_HEADER_ID "EFI PART"
typedef struct {
EFI_GUID PartitionTypeGUID;
EFI_GUID UniquePartitionGUID;
EFI_LBA StartingLBA;
EFI_LBA EndingLBA;
UINT64 Attributes;
CHAR16 PartitionName[36];
} EFI_PARTITION_ENTRY;
//
// EFI Partition Attributes
//
#define EFI_PART_USED_BY_EFI 0x0000000000000001
#define EFI_PART_REQUIRED_TO_FUNCTION 0x0000000000000002
#define EFI_PART_USED_BY_OS 0x0000000000000004
#define EFI_PART_REQUIRED_BY_OS 0x0000000000000008
#define EFI_PART_BACKUP_REQUIRED 0x0000000000000010
#define EFI_PART_USER_DATA 0x0000000000000020
#define EFI_PART_CRITICAL_USER_DATA 0x0000000000000040
#define EFI_PART_REDUNDANT_PARTITION 0x0000000000000080
#define EFI_PART_TYPE_UNUSED_GUID \
{ 0x00000000, 0x0000, 0x0000, {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00} }
#define EFI_PART_TYPE_EFI_SYSTEM_PART_GUID \
{ 0xc12a7328, 0xf81f, 0x11d2, {0xba, 0x4b, 0x00, 0xa0, 0xc9, 0x3e, 0xc9, 0x3b} }
#define EFI_PART_TYPE_LEGACY_MBR_GUID \
{ 0x024dee41, 0x33e7, 0x11d3, {0x9d, 0x69, 0x00, 0x08, 0xc7, 0x81, 0xf3, 0x9f} }
#endif
diff --git a/stand/efi/include/efiip.h b/stand/efi/include/efiip.h
index ce0910a1b998..839507964f75 100644
--- a/stand/efi/include/efiip.h
+++ b/stand/efi/include/efiip.h
@@ -1,460 +1,459 @@
-/* $FreeBSD$ */
#ifndef _EFI_IP_H
#define _EFI_IP_H
/*++
Copyright (c) 2013 Intel Corporation
--*/
#define EFI_IP4_SERVICE_BINDING_PROTOCOL \
{0xc51711e7,0xb4bf,0x404a,{0xbf,0xb8,0x0a,0x04, 0x8e,0xf1,0xff,0xe4}}
#define EFI_IP4_PROTOCOL \
{0x41d94cd2,0x35b6,0x455a,{0x82,0x58,0xd4,0xe5,0x13,0x34,0xaa,0xdd}}
#define EFI_IP6_SERVICE_BINDING_PROTOCOL \
{0xec835dd3,0xfe0f,0x617b,{0xa6,0x21,0xb3,0x50,0xc3,0xe1,0x33,0x88}}
#define EFI_IP6_PROTOCOL \
{0x2c8759d5,0x5c2d,0x66ef,{0x92,0x5f,0xb6,0x6c,0x10,0x19,0x57,0xe2}}
INTERFACE_DECL(_EFI_IP4);
INTERFACE_DECL(_EFI_IP6);
typedef struct {
EFI_HANDLE InstanceHandle;
EFI_IPv4_ADDRESS Ip4Address;
EFI_IPv4_ADDRESS SubnetMask;
} EFI_IP4_ADDRESS_PAIR;
typedef struct {
EFI_HANDLE DriverHandle;
UINT32 AddressCount;
EFI_IP4_ADDRESS_PAIR AddressPairs[1];
} EFI_IP4_VARIABLE_DATA;
typedef struct {
UINT8 DefaultProtocol;
BOOLEAN AcceptAnyProtocol;
BOOLEAN AcceptIcmpErrors;
BOOLEAN AcceptBroadcast;
BOOLEAN AcceptPromiscuous;
BOOLEAN UseDefaultAddress;
EFI_IPv4_ADDRESS StationAddress;
EFI_IPv4_ADDRESS SubnetMask;
UINT8 TypeOfService;
UINT8 TimeToLive;
BOOLEAN DoNotFragment;
BOOLEAN RawData;
UINT32 ReceiveTimeout;
UINT32 TransmitTimeout;
} EFI_IP4_CONFIG_DATA;
typedef struct {
EFI_IPv4_ADDRESS SubnetAddress;
EFI_IPv4_ADDRESS SubnetMask;
EFI_IPv4_ADDRESS GatewayAddress;
} EFI_IP4_ROUTE_TABLE;
typedef struct {
UINT8 Type;
UINT8 Code;
} EFI_IP4_ICMP_TYPE;
typedef struct {
BOOLEAN IsStarted;
UINT32 MaxPacketSize;
EFI_IP4_CONFIG_DATA ConfigData;
BOOLEAN IsConfigured;
UINT32 GroupCount;
EFI_IPv4_ADDRESS *GroupTable;
UINT32 RouteCount;
EFI_IP4_ROUTE_TABLE *RouteTable;
UINT32 IcmpTypeCount;
EFI_IP4_ICMP_TYPE *IcmpTypeList;
} EFI_IP4_MODE_DATA;
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_GET_MODE_DATA) (
IN struct _EFI_IP4 *This,
OUT EFI_IP4_MODE_DATA *Ip4ModeData OPTIONAL,
OUT EFI_MANAGED_NETWORK_CONFIG_DATA *MnpConfigData OPTIONAL,
OUT EFI_SIMPLE_NETWORK_MODE *SnpModeData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_CONFIGURE) (
IN struct _EFI_IP4 *This,
IN EFI_IP4_CONFIG_DATA *IpConfigData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_GROUPS) (
IN struct _EFI_IP4 *This,
IN BOOLEAN JoinFlag,
IN EFI_IPv4_ADDRESS *GroupAddress OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_ROUTES) (
IN struct _EFI_IP4 *This,
IN BOOLEAN DeleteRoute,
IN EFI_IPv4_ADDRESS *SubnetAddress,
IN EFI_IPv4_ADDRESS *SubnetMask,
IN EFI_IPv4_ADDRESS *GatewayAddress
);
#pragma pack(1)
typedef struct {
UINT8 HeaderLength:4;
UINT8 Version:4;
UINT8 TypeOfService;
UINT16 TotalLength;
UINT16 Identification;
UINT16 Fragmentation;
UINT8 TimeToLive;
UINT8 Protocol;
UINT16 Checksum;
EFI_IPv4_ADDRESS SourceAddress;
EFI_IPv4_ADDRESS DestinationAddress;
} EFI_IP4_HEADER;
#pragma pack()
typedef struct {
UINT32 FragmentLength;
VOID *FragmentBuffer;
} EFI_IP4_FRAGMENT_DATA;
typedef struct {
EFI_TIME TimeStamp;
EFI_EVENT RecycleSignal;
UINT32 HeaderLength;
EFI_IP4_HEADER *Header;
UINT32 OptionsLength;
VOID *Options;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_IP4_FRAGMENT_DATA FragmentTable[1];
} EFI_IP4_RECEIVE_DATA;
typedef struct {
EFI_IPv4_ADDRESS SourceAddress;
EFI_IPv4_ADDRESS GatewayAddress;
UINT8 Protocol;
UINT8 TypeOfService;
UINT8 TimeToLive;
BOOLEAN DoNotFragment;
} EFI_IP4_OVERRIDE_DATA;
typedef struct {
EFI_IPv4_ADDRESS DestinationAddress;
EFI_IP4_OVERRIDE_DATA *OverrideData;
UINT32 OptionsLength;
VOID *OptionsBuffer;
UINT32 TotalDataLength;
UINT32 FragmentCount;
EFI_IP4_FRAGMENT_DATA FragmentTable[1];
} EFI_IP4_TRANSMIT_DATA;
typedef struct {
EFI_EVENT Event;
EFI_STATUS Status;
union {
EFI_IP4_RECEIVE_DATA *RxData;
EFI_IP4_TRANSMIT_DATA *TxData;
} Packet;
} EFI_IP4_COMPLETION_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_TRANSMIT) (
IN struct _EFI_IP4 *This,
IN EFI_IP4_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_RECEIVE) (
IN struct _EFI_IP4 *This,
IN EFI_IP4_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_CANCEL)(
IN struct _EFI_IP4 *This,
IN EFI_IP4_COMPLETION_TOKEN *Token OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP4_POLL) (
IN struct _EFI_IP4 *This
);
typedef struct _EFI_IP4 {
EFI_IP4_GET_MODE_DATA GetModeData;
EFI_IP4_CONFIGURE Configure;
EFI_IP4_GROUPS Groups;
EFI_IP4_ROUTES Routes;
EFI_IP4_TRANSMIT Transmit;
EFI_IP4_RECEIVE Receive;
EFI_IP4_CANCEL Cancel;
EFI_IP4_POLL Poll;
} EFI_IP4;
typedef struct {
UINT8 DefaultProtocol;
BOOLEAN AcceptAnyProtocol;
BOOLEAN AcceptIcmpErrors;
BOOLEAN AcceptPromiscuous;
EFI_IPv6_ADDRESS DestinationAddress;
EFI_IPv6_ADDRESS StationAddress;
UINT8 TrafficClass;
UINT8 HopLimit;
UINT32 FlowLabel;
UINT32 ReceiveTimeout;
UINT32 TransmitTimeout;
} EFI_IP6_CONFIG_DATA;
typedef struct {
EFI_IPv6_ADDRESS Address;
UINT8 PrefixLength;
} EFI_IP6_ADDRESS_INFO;
typedef struct {
EFI_IPv6_ADDRESS Gateway;
EFI_IPv6_ADDRESS Destination;
UINT8 PrefixLength;
} EFI_IP6_ROUTE_TABLE;
typedef enum {
EfiNeighborInComplete,
EfiNeighborReachable,
EfiNeighborStale,
EfiNeighborDelay,
EfiNeighborProbe
} EFI_IP6_NEIGHBOR_STATE;
typedef struct {
EFI_IPv6_ADDRESS Neighbor;
EFI_MAC_ADDRESS LinkAddress;
EFI_IP6_NEIGHBOR_STATE State;
} EFI_IP6_NEIGHBOR_CACHE;
typedef struct {
UINT8 Type;
UINT8 Code;
} EFI_IP6_ICMP_TYPE;
//***********************************************************
// ICMPv6 type definitions for error messages
//***********************************************************
#define ICMP_V6_DEST_UNREACHABLE 0x1
#define ICMP_V6_PACKET_TOO_BIG 0x2
#define ICMP_V6_TIME_EXCEEDED 0x3
#define ICMP_V6_PARAMETER_PROBLEM 0x4
//***********************************************************
// ICMPv6 type definition for informational messages
//***********************************************************
#define ICMP_V6_ECHO_REQUEST 0x80
#define ICMP_V6_ECHO_REPLY 0x81
#define ICMP_V6_LISTENER_QUERY 0x82
#define ICMP_V6_LISTENER_REPORT 0x83
#define ICMP_V6_LISTENER_DONE 0x84
#define ICMP_V6_ROUTER_SOLICIT 0x85
#define ICMP_V6_ROUTER_ADVERTISE 0x86
#define ICMP_V6_NEIGHBOR_SOLICIT 0x87
#define ICMP_V6_NEIGHBOR_ADVERTISE 0x88
#define ICMP_V6_REDIRECT 0x89
#define ICMP_V6_LISTENER_REPORT_2 0x8F
//***********************************************************
// ICMPv6 code definitions for ICMP_V6_DEST_UNREACHABLE
//***********************************************************
#define ICMP_V6_NO_ROUTE_TO_DEST 0x0
#define ICMP_V6_COMM_PROHIBITED 0x1
#define ICMP_V6_BEYOND_SCOPE 0x2
#define ICMP_V6_ADDR_UNREACHABLE 0x3
#define ICMP_V6_PORT_UNREACHABLE 0x4
#define ICMP_V6_SOURCE_ADDR_FAILED 0x5
#define ICMP_V6_ROUTE_REJECTED 0x6
//***********************************************************
// ICMPv6 code definitions for ICMP_V6_TIME_EXCEEDED
//***********************************************************
#define ICMP_V6_TIMEOUT_HOP_LIMIT 0x0
#define ICMP_V6_TIMEOUT_REASSEMBLE 0x1
//***********************************************************
// ICMPv6 code definitions for ICMP_V6_PARAMETER_PROBLEM
//***********************************************************
#define ICMP_V6_ERRONEOUS_HEADER 0x0
#define ICMP_V6_UNRECOGNIZE_NEXT_HDR 0x1
#define ICMP_V6_UNRECOGNIZE_OPTION 0x2
typedef struct {
BOOLEAN IsStarted;
UINT32 MaxPacketSize;
EFI_IP6_CONFIG_DATA ConfigData;
BOOLEAN IsConfigured;
UINT32 AddressCount;
EFI_IP6_ADDRESS_INFO *AddressList;
UINT32 GroupCount;
EFI_IPv6_ADDRESS *GroupTable;
UINT32 RouteCount;
EFI_IP6_ROUTE_TABLE *RouteTable;
UINT32 NeighborCount;
EFI_IP6_NEIGHBOR_CACHE *NeighborCache;
UINT32 PrefixCount;
EFI_IP6_ADDRESS_INFO *PrefixTable;
UINT32 IcmpTypeCount;
EFI_IP6_ICMP_TYPE *IcmpTypeList;
} EFI_IP6_MODE_DATA;
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_GET_MODE_DATA) (
IN struct _EFI_IP6 *This,
OUT EFI_IP6_MODE_DATA *Ip6ModeData OPTIONAL,
OUT EFI_MANAGED_NETWORK_CONFIG_DATA *MnpConfigData OPTIONAL,
OUT EFI_SIMPLE_NETWORK_MODE *SnpModeData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_CONFIGURE) (
IN struct _EFI_IP6 *This,
IN EFI_IP6_CONFIG_DATA *Ip6ConfigData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_GROUPS) (
IN struct _EFI_IP6 *This,
IN BOOLEAN JoinFlag,
IN EFI_IPv6_ADDRESS *GroupAddress OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_ROUTES) (
IN struct _EFI_IP6 *This,
IN BOOLEAN DeleteRoute,
IN EFI_IPv6_ADDRESS *Destination OPTIONAL,
IN UINT8 PrefixLength,
IN EFI_IPv6_ADDRESS *GatewayAddress OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_NEIGHBORS) (
IN struct _EFI_IP6 *This,
IN BOOLEAN DeleteFlag,
IN EFI_IPv6_ADDRESS *TargetIp6Address,
IN EFI_MAC_ADDRESS *TargetLinkAddress OPTIONAL,
IN UINT32 Timeout,
IN BOOLEAN Override
);
typedef struct _EFI_IP6_FRAGMENT_DATA {
UINT32 FragmentLength;
VOID *FragmentBuffer;
} EFI_IP6_FRAGMENT_DATA;
typedef struct _EFI_IP6_OVERRIDE_DATA {
UINT8 Protocol;
UINT8 HopLimit;
UINT32 FlowLabel;
} EFI_IP6_OVERRIDE_DATA;
typedef struct _EFI_IP6_TRANSMIT_DATA {
EFI_IPv6_ADDRESS DestinationAddress;
EFI_IP6_OVERRIDE_DATA *OverrideData;
UINT32 ExtHdrsLength;
VOID *ExtHdrs;
UINT8 NextHeader;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_IP6_FRAGMENT_DATA FragmentTable[1];
} EFI_IP6_TRANSMIT_DATA;
#pragma pack(1)
typedef struct _EFI_IP6_HEADER {
UINT8 TrafficClassH:4;
UINT8 Version:4;
UINT8 FlowLabelH:4;
UINT8 TrafficClassL:4;
UINT16 FlowLabelL;
UINT16 PayloadLength;
UINT8 NextHeader;
UINT8 HopLimit;
EFI_IPv6_ADDRESS SourceAddress;
EFI_IPv6_ADDRESS DestinationAddress;
} EFI_IP6_HEADER;
#pragma pack()
typedef struct _EFI_IP6_RECEIVE_DATA {
EFI_TIME TimeStamp;
EFI_EVENT RecycleSignal;
UINT32 HeaderLength;
EFI_IP6_HEADER *Header;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_IP6_FRAGMENT_DATA FragmentTable[1];
} EFI_IP6_RECEIVE_DATA;
typedef struct {
EFI_EVENT Event;
EFI_STATUS Status;
union {
EFI_IP6_RECEIVE_DATA *RxData;
EFI_IP6_TRANSMIT_DATA *TxData;
} Packet;
} EFI_IP6_COMPLETION_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_TRANSMIT) (
IN struct _EFI_IP6 *This,
IN EFI_IP6_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_RECEIVE) (
IN struct _EFI_IP6 *This,
IN EFI_IP6_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_CANCEL)(
IN struct _EFI_IP6 *This,
IN EFI_IP6_COMPLETION_TOKEN *Token OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_IP6_POLL) (
IN struct _EFI_IP6 *This
);
typedef struct _EFI_IP6 {
EFI_IP6_GET_MODE_DATA GetModeData;
EFI_IP6_CONFIGURE Configure;
EFI_IP6_GROUPS Groups;
EFI_IP6_ROUTES Routes;
EFI_IP6_NEIGHBORS Neighbors;
EFI_IP6_TRANSMIT Transmit;
EFI_IP6_RECEIVE Receive;
EFI_IP6_CANCEL Cancel;
EFI_IP6_POLL Poll;
} EFI_IP6;
#endif /* _EFI_IP_H */
diff --git a/stand/efi/include/efinet.h b/stand/efi/include/efinet.h
index 3ac58b2431ca..9cd13f5a4653 100644
--- a/stand/efi/include/efinet.h
+++ b/stand/efi/include/efinet.h
@@ -1,348 +1,347 @@
-/* $FreeBSD$ */
#ifndef _EFINET_H
#define _EFINET_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efinet.h
Abstract:
EFI Simple Network protocol
Revision History
--*/
///////////////////////////////////////////////////////////////////////////////
//
// Simple Network Protocol
//
#define EFI_SIMPLE_NETWORK_PROTOCOL \
{ 0xA19832B9, 0xAC25, 0x11D3, {0x9A, 0x2D, 0x00, 0x90, 0x27, 0x3F, 0xC1, 0x4D} }
INTERFACE_DECL(_EFI_SIMPLE_NETWORK);
///////////////////////////////////////////////////////////////////////////////
//
typedef struct {
//
// Total number of frames received. Includes frames with errors and
// dropped frames.
//
UINT64 RxTotalFrames;
//
// Number of valid frames received and copied into receive buffers.
//
UINT64 RxGoodFrames;
//
// Number of frames below the minimum length for the media.
// This would be <64 for ethernet.
//
UINT64 RxUndersizeFrames;
//
// Number of frames longer than the maxminum length for the
// media. This would be >1500 for ethernet.
//
UINT64 RxOversizeFrames;
//
// Valid frames that were dropped because receive buffers were full.
//
UINT64 RxDroppedFrames;
//
// Number of valid unicast frames received and not dropped.
//
UINT64 RxUnicastFrames;
//
// Number of valid broadcast frames received and not dropped.
//
UINT64 RxBroadcastFrames;
//
// Number of valid mutlicast frames received and not dropped.
//
UINT64 RxMulticastFrames;
//
// Number of frames w/ CRC or alignment errors.
//
UINT64 RxCrcErrorFrames;
//
// Total number of bytes received. Includes frames with errors
// and dropped frames.
//
UINT64 RxTotalBytes;
//
// Transmit statistics.
//
UINT64 TxTotalFrames;
UINT64 TxGoodFrames;
UINT64 TxUndersizeFrames;
UINT64 TxOversizeFrames;
UINT64 TxDroppedFrames;
UINT64 TxUnicastFrames;
UINT64 TxBroadcastFrames;
UINT64 TxMulticastFrames;
UINT64 TxCrcErrorFrames;
UINT64 TxTotalBytes;
//
// Number of collisions detection on this subnet.
//
UINT64 Collisions;
//
// Number of frames destined for unsupported protocol.
//
UINT64 UnsupportedProtocol;
} EFI_NETWORK_STATISTICS;
///////////////////////////////////////////////////////////////////////////////
//
typedef enum {
EfiSimpleNetworkStopped,
EfiSimpleNetworkStarted,
EfiSimpleNetworkInitialized,
EfiSimpleNetworkMaxState
} EFI_SIMPLE_NETWORK_STATE;
///////////////////////////////////////////////////////////////////////////////
//
#define EFI_SIMPLE_NETWORK_RECEIVE_UNICAST 0x01
#define EFI_SIMPLE_NETWORK_RECEIVE_MULTICAST 0x02
#define EFI_SIMPLE_NETWORK_RECEIVE_BROADCAST 0x04
#define EFI_SIMPLE_NETWORK_RECEIVE_PROMISCUOUS 0x08
#define EFI_SIMPLE_NETWORK_RECEIVE_PROMISCUOUS_MULTICAST 0x10
///////////////////////////////////////////////////////////////////////////////
//
#define EFI_SIMPLE_NETWORK_RECEIVE_INTERRUPT 0x01
#define EFI_SIMPLE_NETWORK_TRANSMIT_INTERRUPT 0x02
#define EFI_SIMPLE_NETWORK_COMMAND_INTERRUPT 0x04
#define EFI_SIMPLE_NETWORK_SOFTWARE_INTERRUPT 0x08
///////////////////////////////////////////////////////////////////////////////
//
#define MAX_MCAST_FILTER_CNT 16
typedef struct {
UINT32 State;
UINT32 HwAddressSize;
UINT32 MediaHeaderSize;
UINT32 MaxPacketSize;
UINT32 NvRamSize;
UINT32 NvRamAccessSize;
UINT32 ReceiveFilterMask;
UINT32 ReceiveFilterSetting;
UINT32 MaxMCastFilterCount;
UINT32 MCastFilterCount;
EFI_MAC_ADDRESS MCastFilter[MAX_MCAST_FILTER_CNT];
EFI_MAC_ADDRESS CurrentAddress;
EFI_MAC_ADDRESS BroadcastAddress;
EFI_MAC_ADDRESS PermanentAddress;
UINT8 IfType;
BOOLEAN MacAddressChangeable;
BOOLEAN MultipleTxSupported;
BOOLEAN MediaPresentSupported;
BOOLEAN MediaPresent;
} EFI_SIMPLE_NETWORK_MODE;
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_START) (
IN struct _EFI_SIMPLE_NETWORK *This
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_STOP) (
IN struct _EFI_SIMPLE_NETWORK *This
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_INITIALIZE) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN UINTN ExtraRxBufferSize OPTIONAL,
IN UINTN ExtraTxBufferSize OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_RESET) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN BOOLEAN ExtendedVerification
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_SHUTDOWN) (
IN struct _EFI_SIMPLE_NETWORK *This
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_RECEIVE_FILTERS) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN UINT32 Enable,
IN UINT32 Disable,
IN BOOLEAN ResetMCastFilter,
IN UINTN MCastFilterCnt OPTIONAL,
IN EFI_MAC_ADDRESS *MCastFilter OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_STATION_ADDRESS) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN BOOLEAN Reset,
IN EFI_MAC_ADDRESS *New OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_STATISTICS) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN BOOLEAN Reset,
IN OUT UINTN *StatisticsSize OPTIONAL,
OUT EFI_NETWORK_STATISTICS *StatisticsTable OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_MCAST_IP_TO_MAC) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN BOOLEAN IPv6,
IN EFI_IP_ADDRESS *IP,
OUT EFI_MAC_ADDRESS *MAC
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_NVDATA) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN BOOLEAN ReadWrite,
IN UINTN Offset,
IN UINTN BufferSize,
IN OUT VOID *Buffer
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_GET_STATUS) (
IN struct _EFI_SIMPLE_NETWORK *This,
OUT UINT32 *InterruptStatus OPTIONAL,
OUT VOID **TxBuf OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_TRANSMIT) (
IN struct _EFI_SIMPLE_NETWORK *This,
IN UINTN HeaderSize,
IN UINTN BufferSize,
IN VOID *Buffer,
IN EFI_MAC_ADDRESS *SrcAddr OPTIONAL,
IN EFI_MAC_ADDRESS *DestAddr OPTIONAL,
IN UINT16 *Protocol OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_NETWORK_RECEIVE) (
IN struct _EFI_SIMPLE_NETWORK *This,
OUT UINTN *HeaderSize OPTIONAL,
IN OUT UINTN *BufferSize,
OUT VOID *Buffer,
OUT EFI_MAC_ADDRESS *SrcAddr OPTIONAL,
OUT EFI_MAC_ADDRESS *DestAddr OPTIONAL,
OUT UINT16 *Protocol OPTIONAL
);
///////////////////////////////////////////////////////////////////////////////
//
#define EFI_SIMPLE_NETWORK_INTERFACE_REVISION 0x00010000
typedef struct _EFI_SIMPLE_NETWORK {
UINT64 Revision;
EFI_SIMPLE_NETWORK_START Start;
EFI_SIMPLE_NETWORK_STOP Stop;
EFI_SIMPLE_NETWORK_INITIALIZE Initialize;
EFI_SIMPLE_NETWORK_RESET Reset;
EFI_SIMPLE_NETWORK_SHUTDOWN Shutdown;
EFI_SIMPLE_NETWORK_RECEIVE_FILTERS ReceiveFilters;
EFI_SIMPLE_NETWORK_STATION_ADDRESS StationAddress;
EFI_SIMPLE_NETWORK_STATISTICS Statistics;
EFI_SIMPLE_NETWORK_MCAST_IP_TO_MAC MCastIpToMac;
EFI_SIMPLE_NETWORK_NVDATA NvData;
EFI_SIMPLE_NETWORK_GET_STATUS GetStatus;
EFI_SIMPLE_NETWORK_TRANSMIT Transmit;
EFI_SIMPLE_NETWORK_RECEIVE Receive;
EFI_EVENT WaitForPacket;
EFI_SIMPLE_NETWORK_MODE *Mode;
} EFI_SIMPLE_NETWORK;
#endif /* _EFINET_H */
diff --git a/stand/efi/include/efipart.h b/stand/efi/include/efipart.h
index ef1a8709d91b..32a715c8781b 100644
--- a/stand/efi/include/efipart.h
+++ b/stand/efi/include/efipart.h
@@ -1,69 +1,68 @@
-/* $FreeBSD$ */
#ifndef _EFI_PART_H
#define _EFI_PART_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efipart.h
Abstract:
Info about disk partitions and Master Boot Records
Revision History
--*/
//
//
//
#define EFI_PARTITION 0xef
#define MBR_SIZE 512
#pragma pack(1)
typedef struct {
UINT8 BootIndicator;
UINT8 StartHead;
UINT8 StartSector;
UINT8 StartTrack;
UINT8 OSIndicator;
UINT8 EndHead;
UINT8 EndSector;
UINT8 EndTrack;
UINT8 StartingLBA[4];
UINT8 SizeInLBA[4];
} MBR_PARTITION_RECORD;
#define EXTRACT_UINT32(D) (UINT32)(D[0] | (D[1] << 8) | (D[2] << 16) | (D[3] << 24))
#define MBR_SIGNATURE 0xaa55
#define MIN_MBR_DEVICE_SIZE 0x80000
#define MBR_ERRATA_PAD 0x40000 // 128 MB
#define MAX_MBR_PARTITIONS 4
typedef struct {
UINT8 BootStrapCode[440];
UINT8 UniqueMbrSignature[4];
UINT8 Unknown[2];
MBR_PARTITION_RECORD Partition[MAX_MBR_PARTITIONS];
UINT16 Signature;
} MASTER_BOOT_RECORD;
#pragma pack()
#endif
diff --git a/stand/efi/include/efipciio.h b/stand/efi/include/efipciio.h
index b42fa59395a0..4e9ca153f721 100644
--- a/stand/efi/include/efipciio.h
+++ b/stand/efi/include/efipciio.h
@@ -1,560 +1,559 @@
-/* $FreeBSD$ */
/** @file
EFI PCI I/O Protocol provides the basic Memory, I/O, PCI configuration,
and DMA interfaces that a driver uses to access its PCI controller.
Copyright (c) 2006 - 2010, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
**/
#ifndef __PCI_IO_H__
#define __PCI_IO_H__
#define EFI_PCI_ROOT_IO_GUID \
{ 0x2F707EBB, 0x4A1A, 0x11d4, { 0x9A, 0x38, 0x00, 0x90, 0x27, 0x3F, 0xC1, 0x4D }}
///
/// Global ID for the PCI I/O Protocol
///
#define EFI_PCI_IO_PROTOCOL_GUID \
{ 0x4cf5b200, 0x68b8, 0x4ca5, {0x9e, 0xec, 0xb2, 0x3e, 0x3f, 0x50, 0x2, 0x9a} }
typedef struct _EFI_PCI_IO_PROTOCOL EFI_PCI_IO_PROTOCOL;
///
/// *******************************************************
/// EFI_PCI_IO_PROTOCOL_WIDTH
/// *******************************************************
///
typedef enum {
EfiPciIoWidthUint8 = 0,
EfiPciIoWidthUint16,
EfiPciIoWidthUint32,
EfiPciIoWidthUint64,
EfiPciIoWidthFifoUint8,
EfiPciIoWidthFifoUint16,
EfiPciIoWidthFifoUint32,
EfiPciIoWidthFifoUint64,
EfiPciIoWidthFillUint8,
EfiPciIoWidthFillUint16,
EfiPciIoWidthFillUint32,
EfiPciIoWidthFillUint64,
EfiPciIoWidthMaximum
} EFI_PCI_IO_PROTOCOL_WIDTH;
//
// Complete PCI address generater
//
#define EFI_PCI_IO_PASS_THROUGH_BAR 0xff ///< Special BAR that passes a memory or I/O cycle through unchanged
#define EFI_PCI_IO_ATTRIBUTE_MASK 0x077f ///< All the following I/O and Memory cycles
#define EFI_PCI_IO_ATTRIBUTE_ISA_MOTHERBOARD_IO 0x0001 ///< I/O cycles 0x0000-0x00FF (10 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_ISA_IO 0x0002 ///< I/O cycles 0x0100-0x03FF or greater (10 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_VGA_PALETTE_IO 0x0004 ///< I/O cycles 0x3C6, 0x3C8, 0x3C9 (10 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_VGA_MEMORY 0x0008 ///< MEM cycles 0xA0000-0xBFFFF (24 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_VGA_IO 0x0010 ///< I/O cycles 0x3B0-0x3BB and 0x3C0-0x3DF (10 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_IDE_PRIMARY_IO 0x0020 ///< I/O cycles 0x1F0-0x1F7, 0x3F6, 0x3F7 (10 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_IDE_SECONDARY_IO 0x0040 ///< I/O cycles 0x170-0x177, 0x376, 0x377 (10 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_MEMORY_WRITE_COMBINE 0x0080 ///< Map a memory range so writes are combined
#define EFI_PCI_IO_ATTRIBUTE_IO 0x0100 ///< Enable the I/O decode bit in the PCI Config Header
#define EFI_PCI_IO_ATTRIBUTE_MEMORY 0x0200 ///< Enable the Memory decode bit in the PCI Config Header
#define EFI_PCI_IO_ATTRIBUTE_BUS_MASTER 0x0400 ///< Enable the DMA bit in the PCI Config Header
#define EFI_PCI_IO_ATTRIBUTE_MEMORY_CACHED 0x0800 ///< Map a memory range so all r/w accesses are cached
#define EFI_PCI_IO_ATTRIBUTE_MEMORY_DISABLE 0x1000 ///< Disable a memory range
#define EFI_PCI_IO_ATTRIBUTE_EMBEDDED_DEVICE 0x2000 ///< Clear for an add-in PCI Device
#define EFI_PCI_IO_ATTRIBUTE_EMBEDDED_ROM 0x4000 ///< Clear for a physical PCI Option ROM accessed through ROM BAR
#define EFI_PCI_IO_ATTRIBUTE_DUAL_ADDRESS_CYCLE 0x8000 ///< Clear for PCI controllers that can not genrate a DAC
#define EFI_PCI_IO_ATTRIBUTE_ISA_IO_16 0x10000 ///< I/O cycles 0x0100-0x03FF or greater (16 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_VGA_PALETTE_IO_16 0x20000 ///< I/O cycles 0x3C6, 0x3C8, 0x3C9 (16 bit decode)
#define EFI_PCI_IO_ATTRIBUTE_VGA_IO_16 0x40000 ///< I/O cycles 0x3B0-0x3BB and 0x3C0-0x3DF (16 bit decode)
#define EFI_PCI_DEVICE_ENABLE (EFI_PCI_IO_ATTRIBUTE_IO | EFI_PCI_IO_ATTRIBUTE_MEMORY | EFI_PCI_IO_ATTRIBUTE_BUS_MASTER)
#define EFI_VGA_DEVICE_ENABLE (EFI_PCI_IO_ATTRIBUTE_VGA_PALETTE_IO | EFI_PCI_IO_ATTRIBUTE_VGA_MEMORY | EFI_PCI_IO_ATTRIBUTE_VGA_IO | EFI_PCI_IO_ATTRIBUTE_IO)
///
/// *******************************************************
/// EFI_PCI_IO_PROTOCOL_OPERATION
/// *******************************************************
///
typedef enum {
///
/// A read operation from system memory by a bus master.
///
EfiPciIoOperationBusMasterRead,
///
/// A write operation from system memory by a bus master.
///
EfiPciIoOperationBusMasterWrite,
///
/// Provides both read and write access to system memory by both the processor and a
/// bus master. The buffer is coherent from both the processor's and the bus master's point of view.
///
EfiPciIoOperationBusMasterCommonBuffer,
EfiPciIoOperationMaximum
} EFI_PCI_IO_PROTOCOL_OPERATION;
///
/// *******************************************************
/// EFI_PCI_IO_PROTOCOL_ATTRIBUTE_OPERATION
/// *******************************************************
///
typedef enum {
///
/// Retrieve the PCI controller's current attributes, and return them in Result.
///
EfiPciIoAttributeOperationGet,
///
/// Set the PCI controller's current attributes to Attributes.
///
EfiPciIoAttributeOperationSet,
///
/// Enable the attributes specified by the bits that are set in Attributes for this PCI controller.
///
EfiPciIoAttributeOperationEnable,
///
/// Disable the attributes specified by the bits that are set in Attributes for this PCI controller.
///
EfiPciIoAttributeOperationDisable,
///
/// Retrieve the PCI controller's supported attributes, and return them in Result.
///
EfiPciIoAttributeOperationSupported,
EfiPciIoAttributeOperationMaximum
} EFI_PCI_IO_PROTOCOL_ATTRIBUTE_OPERATION;
/**
Reads from the memory space of a PCI controller. Returns either when the polling exit criteria is
satisfied or after a defined duration.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Width Signifies the width of the memory or I/O operations.
@param BarIndex The BAR index of the standard PCI Configuration header to use as the
base address for the memory operation to perform.
@param Offset The offset within the selected BAR to start the memory operation.
@param Mask Mask used for the polling criteria.
@param Value The comparison value used for the polling exit criteria.
@param Delay The number of 100 ns units to poll.
@param Result Pointer to the last value read from the memory location.
@retval EFI_SUCCESS The last data returned from the access matched the poll exit criteria.
@retval EFI_UNSUPPORTED BarIndex not valid for this PCI controller.
@retval EFI_UNSUPPORTED Offset is not valid for the BarIndex of this PCI controller.
@retval EFI_TIMEOUT Delay expired before a match occurred.
@retval EFI_OUT_OF_RESOURCES The request could not be completed due to a lack of resources.
@retval EFI_INVALID_PARAMETER One or more parameters are invalid.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_POLL_IO_MEM)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_PCI_IO_PROTOCOL_WIDTH Width,
IN UINT8 BarIndex,
IN UINT64 Offset,
IN UINT64 Mask,
IN UINT64 Value,
IN UINT64 Delay,
OUT UINT64 *Result
);
/**
Enable a PCI driver to access PCI controller registers in the PCI memory or I/O space.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Width Signifies the width of the memory or I/O operations.
@param BarIndex The BAR index of the standard PCI Configuration header to use as the
base address for the memory or I/O operation to perform.
@param Offset The offset within the selected BAR to start the memory or I/O operation.
@param Count The number of memory or I/O operations to perform.
@param Buffer For read operations, the destination buffer to store the results. For write
operations, the source buffer to write data from.
@retval EFI_SUCCESS The data was read from or written to the PCI controller.
@retval EFI_UNSUPPORTED BarIndex not valid for this PCI controller.
@retval EFI_UNSUPPORTED The address range specified by Offset, Width, and Count is not
valid for the PCI BAR specified by BarIndex.
@retval EFI_OUT_OF_RESOURCES The request could not be completed due to a lack of resources.
@retval EFI_INVALID_PARAMETER One or more parameters are invalid.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_IO_MEM)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_PCI_IO_PROTOCOL_WIDTH Width,
IN UINT8 BarIndex,
IN UINT64 Offset,
IN UINTN Count,
IN OUT VOID *Buffer
);
typedef struct {
///
/// Read PCI controller registers in the PCI memory or I/O space.
///
EFI_PCI_IO_PROTOCOL_IO_MEM Read;
///
/// Write PCI controller registers in the PCI memory or I/O space.
///
EFI_PCI_IO_PROTOCOL_IO_MEM Write;
} EFI_PCI_IO_PROTOCOL_ACCESS;
/**
Enable a PCI driver to access PCI controller registers in PCI configuration space.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Width Signifies the width of the memory operations.
@param Offset The offset within the PCI configuration space for the PCI controller.
@param Count The number of PCI configuration operations to perform.
@param Buffer For read operations, the destination buffer to store the results. For write
operations, the source buffer to write data from.
@retval EFI_SUCCESS The data was read from or written to the PCI controller.
@retval EFI_UNSUPPORTED The address range specified by Offset, Width, and Count is not
valid for the PCI configuration header of the PCI controller.
@retval EFI_OUT_OF_RESOURCES The request could not be completed due to a lack of resources.
@retval EFI_INVALID_PARAMETER Buffer is NULL or Width is invalid.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_CONFIG)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_PCI_IO_PROTOCOL_WIDTH Width,
IN UINT32 Offset,
IN UINTN Count,
IN OUT VOID *Buffer
);
typedef struct {
///
/// Read PCI controller registers in PCI configuration space.
///
EFI_PCI_IO_PROTOCOL_CONFIG Read;
///
/// Write PCI controller registers in PCI configuration space.
///
EFI_PCI_IO_PROTOCOL_CONFIG Write;
} EFI_PCI_IO_PROTOCOL_CONFIG_ACCESS;
/**
Enables a PCI driver to copy one region of PCI memory space to another region of PCI
memory space.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Width Signifies the width of the memory operations.
@param DestBarIndex The BAR index in the standard PCI Configuration header to use as the
base address for the memory operation to perform.
@param DestOffset The destination offset within the BAR specified by DestBarIndex to
start the memory writes for the copy operation.
@param SrcBarIndex The BAR index in the standard PCI Configuration header to use as the
base address for the memory operation to perform.
@param SrcOffset The source offset within the BAR specified by SrcBarIndex to start
the memory reads for the copy operation.
@param Count The number of memory operations to perform. Bytes moved is Width
size * Count, starting at DestOffset and SrcOffset.
@retval EFI_SUCCESS The data was copied from one memory region to another memory region.
@retval EFI_UNSUPPORTED DestBarIndex not valid for this PCI controller.
@retval EFI_UNSUPPORTED SrcBarIndex not valid for this PCI controller.
@retval EFI_UNSUPPORTED The address range specified by DestOffset, Width, and Count
is not valid for the PCI BAR specified by DestBarIndex.
@retval EFI_UNSUPPORTED The address range specified by SrcOffset, Width, and Count is
not valid for the PCI BAR specified by SrcBarIndex.
@retval EFI_INVALID_PARAMETER Width is invalid.
@retval EFI_OUT_OF_RESOURCES The request could not be completed due to a lack of resources.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_COPY_MEM)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_PCI_IO_PROTOCOL_WIDTH Width,
IN UINT8 DestBarIndex,
IN UINT64 DestOffset,
IN UINT8 SrcBarIndex,
IN UINT64 SrcOffset,
IN UINTN Count
);
/**
Provides the PCI controller-specific addresses needed to access system memory.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Operation Indicates if the bus master is going to read or write to system memory.
@param HostAddress The system memory address to map to the PCI controller.
@param NumberOfBytes On input the number of bytes to map. On output the number of bytes
that were mapped.
@param DeviceAddress The resulting map address for the bus master PCI controller to use to
access the hosts HostAddress.
@param Mapping A resulting value to pass to Unmap().
@retval EFI_SUCCESS The range was mapped for the returned NumberOfBytes.
@retval EFI_UNSUPPORTED The HostAddress cannot be mapped as a common buffer.
@retval EFI_INVALID_PARAMETER One or more parameters are invalid.
@retval EFI_OUT_OF_RESOURCES The request could not be completed due to a lack of resources.
@retval EFI_DEVICE_ERROR The system hardware could not map the requested address.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_MAP)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_PCI_IO_PROTOCOL_OPERATION Operation,
IN VOID *HostAddress,
IN OUT UINTN *NumberOfBytes,
OUT EFI_PHYSICAL_ADDRESS *DeviceAddress,
OUT VOID **Mapping
);
/**
Completes the Map() operation and releases any corresponding resources.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Mapping The mapping value returned from Map().
@retval EFI_SUCCESS The range was unmapped.
@retval EFI_DEVICE_ERROR The data was not committed to the target system memory.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_UNMAP)(
IN EFI_PCI_IO_PROTOCOL *This,
IN VOID *Mapping
);
/**
Allocates pages that are suitable for an EfiPciIoOperationBusMasterCommonBuffer
mapping.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Type This parameter is not used and must be ignored.
@param MemoryType The type of memory to allocate, EfiBootServicesData or
EfiRuntimeServicesData.
@param Pages The number of pages to allocate.
@param HostAddress A pointer to store the base system memory address of the
allocated range.
@param Attributes The requested bit mask of attributes for the allocated range.
@retval EFI_SUCCESS The requested memory pages were allocated.
@retval EFI_UNSUPPORTED Attributes is unsupported. The only legal attribute bits are
MEMORY_WRITE_COMBINE and MEMORY_CACHED.
@retval EFI_INVALID_PARAMETER One or more parameters are invalid.
@retval EFI_OUT_OF_RESOURCES The memory pages could not be allocated.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_ALLOCATE_BUFFER)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_ALLOCATE_TYPE Type,
IN EFI_MEMORY_TYPE MemoryType,
IN UINTN Pages,
OUT VOID **HostAddress,
IN UINT64 Attributes
);
/**
Frees memory that was allocated with AllocateBuffer().
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Pages The number of pages to free.
@param HostAddress The base system memory address of the allocated range.
@retval EFI_SUCCESS The requested memory pages were freed.
@retval EFI_INVALID_PARAMETER The memory range specified by HostAddress and Pages
was not allocated with AllocateBuffer().
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_FREE_BUFFER)(
IN EFI_PCI_IO_PROTOCOL *This,
IN UINTN Pages,
IN VOID *HostAddress
);
/**
Flushes all PCI posted write transactions from a PCI host bridge to system memory.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@retval EFI_SUCCESS The PCI posted write transactions were flushed from the PCI host
bridge to system memory.
@retval EFI_DEVICE_ERROR The PCI posted write transactions were not flushed from the PCI
host bridge due to a hardware error.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_FLUSH)(
IN EFI_PCI_IO_PROTOCOL *This
);
/**
Retrieves this PCI controller's current PCI bus number, device number, and function number.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param SegmentNumber The PCI controller's current PCI segment number.
@param BusNumber The PCI controller's current PCI bus number.
@param DeviceNumber The PCI controller's current PCI device number.
@param FunctionNumber The PCI controller's current PCI function number.
@retval EFI_SUCCESS The PCI controller location was returned.
@retval EFI_INVALID_PARAMETER One or more parameters are invalid.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_GET_LOCATION)(
IN EFI_PCI_IO_PROTOCOL *This,
OUT UINTN *SegmentNumber,
OUT UINTN *BusNumber,
OUT UINTN *DeviceNumber,
OUT UINTN *FunctionNumber
);
/**
Performs an operation on the attributes that this PCI controller supports. The operations include
getting the set of supported attributes, retrieving the current attributes, setting the current
attributes, enabling attributes, and disabling attributes.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Operation The operation to perform on the attributes for this PCI controller.
@param Attributes The mask of attributes that are used for Set, Enable, and Disable
operations.
@param Result A pointer to the result mask of attributes that are returned for the Get
and Supported operations.
@retval EFI_SUCCESS The operation on the PCI controller's attributes was completed.
@retval EFI_INVALID_PARAMETER One or more parameters are invalid.
@retval EFI_UNSUPPORTED one or more of the bits set in
Attributes are not supported by this PCI controller or one of
its parent bridges when Operation is Set, Enable or Disable.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_ATTRIBUTES)(
IN EFI_PCI_IO_PROTOCOL *This,
IN EFI_PCI_IO_PROTOCOL_ATTRIBUTE_OPERATION Operation,
IN UINT64 Attributes,
OUT UINT64 *Result OPTIONAL
);
/**
Gets the attributes that this PCI controller supports setting on a BAR using
SetBarAttributes(), and retrieves the list of resource descriptors for a BAR.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param BarIndex The BAR index of the standard PCI Configuration header to use as the
base address for resource range. The legal range for this field is 0..5.
@param Supports A pointer to the mask of attributes that this PCI controller supports
setting for this BAR with SetBarAttributes().
@param Resources A pointer to the ACPI 2.0 resource descriptors that describe the current
configuration of this BAR of the PCI controller.
@retval EFI_SUCCESS If Supports is not NULL, then the attributes that the PCI
controller supports are returned in Supports. If Resources
is not NULL, then the ACPI 2.0 resource descriptors that the PCI
controller is currently using are returned in Resources.
@retval EFI_INVALID_PARAMETER Both Supports and Attributes are NULL.
@retval EFI_UNSUPPORTED BarIndex not valid for this PCI controller.
@retval EFI_OUT_OF_RESOURCES There are not enough resources available to allocate
Resources.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_GET_BAR_ATTRIBUTES)(
IN EFI_PCI_IO_PROTOCOL *This,
IN UINT8 BarIndex,
OUT UINT64 *Supports, OPTIONAL
OUT VOID **Resources OPTIONAL
);
/**
Sets the attributes for a range of a BAR on a PCI controller.
@param This A pointer to the EFI_PCI_IO_PROTOCOL instance.
@param Attributes The mask of attributes to set for the resource range specified by
BarIndex, Offset, and Length.
@param BarIndex The BAR index of the standard PCI Configuration header to use as the
base address for resource range. The legal range for this field is 0..5.
@param Offset A pointer to the BAR relative base address of the resource range to be
modified by the attributes specified by Attributes.
@param Length A pointer to the length of the resource range to be modified by the
attributes specified by Attributes.
@retval EFI_SUCCESS The set of attributes specified by Attributes for the resource
range specified by BarIndex, Offset, and Length were
set on the PCI controller, and the actual resource range is returned
in Offset and Length.
@retval EFI_INVALID_PARAMETER Offset or Length is NULL.
@retval EFI_UNSUPPORTED BarIndex not valid for this PCI controller.
@retval EFI_OUT_OF_RESOURCES There are not enough resources to set the attributes on the
resource range specified by BarIndex, Offset, and
Length.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_IO_PROTOCOL_SET_BAR_ATTRIBUTES)(
IN EFI_PCI_IO_PROTOCOL *This,
IN UINT64 Attributes,
IN UINT8 BarIndex,
IN OUT UINT64 *Offset,
IN OUT UINT64 *Length
);
///
/// The EFI_PCI_IO_PROTOCOL provides the basic Memory, I/O, PCI configuration,
/// and DMA interfaces used to abstract accesses to PCI controllers.
/// There is one EFI_PCI_IO_PROTOCOL instance for each PCI controller on a PCI bus.
/// A device driver that wishes to manage a PCI controller in a system will have to
/// retrieve the EFI_PCI_IO_PROTOCOL instance that is associated with the PCI controller.
///
struct _EFI_PCI_IO_PROTOCOL {
EFI_PCI_IO_PROTOCOL_POLL_IO_MEM PollMem;
EFI_PCI_IO_PROTOCOL_POLL_IO_MEM PollIo;
EFI_PCI_IO_PROTOCOL_ACCESS Mem;
EFI_PCI_IO_PROTOCOL_ACCESS Io;
EFI_PCI_IO_PROTOCOL_CONFIG_ACCESS Pci;
EFI_PCI_IO_PROTOCOL_COPY_MEM CopyMem;
EFI_PCI_IO_PROTOCOL_MAP Map;
EFI_PCI_IO_PROTOCOL_UNMAP Unmap;
EFI_PCI_IO_PROTOCOL_ALLOCATE_BUFFER AllocateBuffer;
EFI_PCI_IO_PROTOCOL_FREE_BUFFER FreeBuffer;
EFI_PCI_IO_PROTOCOL_FLUSH Flush;
EFI_PCI_IO_PROTOCOL_GET_LOCATION GetLocation;
EFI_PCI_IO_PROTOCOL_ATTRIBUTES Attributes;
EFI_PCI_IO_PROTOCOL_GET_BAR_ATTRIBUTES GetBarAttributes;
EFI_PCI_IO_PROTOCOL_SET_BAR_ATTRIBUTES SetBarAttributes;
///
/// The size, in bytes, of the ROM image.
///
UINT64 RomSize;
///
/// A pointer to the in memory copy of the ROM image. The PCI Bus Driver is responsible
/// for allocating memory for the ROM image, and copying the contents of the ROM to memory.
/// The contents of this buffer are either from the PCI option ROM that can be accessed
/// through the ROM BAR of the PCI controller, or it is from a platform-specific location.
/// The Attributes() function can be used to determine from which of these two sources
/// the RomImage buffer was initialized.
///
VOID *RomImage;
};
extern EFI_GUID gEfiPciIoProtocolGuid;
#endif
diff --git a/stand/efi/include/efipoint.h b/stand/efi/include/efipoint.h
index 99944f720378..46e92ffd3b48 100644
--- a/stand/efi/include/efipoint.h
+++ b/stand/efi/include/efipoint.h
@@ -1,116 +1,115 @@
-/* $FreeBSD$ */
/* Copyright (C) 2014 by John Cronin
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#ifndef _EFI_POINT_H
#define _EFI_POINT_H
#define EFI_SIMPLE_POINTER_PROTOCOL_GUID \
{ 0x31878c87, 0xb75, 0x11d5, { 0x9a, 0x4f, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d } }
INTERFACE_DECL(_EFI_SIMPLE_POINTER);
typedef struct {
INT32 RelativeMovementX;
INT32 RelativeMovementY;
INT32 RelativeMovementZ;
BOOLEAN LeftButton;
BOOLEAN RightButton;
} EFI_SIMPLE_POINTER_STATE;
typedef struct {
UINT64 ResolutionX;
UINT64 ResolutionY;
UINT64 ResolutionZ;
BOOLEAN LeftButton;
BOOLEAN RightButton;
} EFI_SIMPLE_POINTER_MODE;
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_POINTER_RESET) (
IN struct _EFI_SIMPLE_POINTER *This,
IN BOOLEAN ExtendedVerification
);
typedef
EFI_STATUS
(EFIAPI *EFI_SIMPLE_POINTER_GET_STATE) (
IN struct _EFI_SIMPLE_POINTER *This,
IN OUT EFI_SIMPLE_POINTER_STATE *State
);
typedef struct _EFI_SIMPLE_POINTER {
EFI_SIMPLE_POINTER_RESET Reset;
EFI_SIMPLE_POINTER_GET_STATE GetState;
EFI_EVENT WaitForInput;
EFI_SIMPLE_POINTER_MODE *Mode;
} EFI_SIMPLE_POINTER_PROTOCOL;
#define EFI_ABSOLUTE_POINTER_PROTOCOL_GUID \
{ 0x8D59D32B, 0xC655, 0x4AE9, { 0x9B, 0x15, 0xF2, 0x59, 0x04, 0x99, 0x2A, 0x43 } }
INTERFACE_DECL(_EFI_ABSOLUTE_POINTER_PROTOCOL);
typedef struct {
UINT64 AbsoluteMinX;
UINT64 AbsoluteMinY;
UINT64 AbsoluteMinZ;
UINT64 AbsoluteMaxX;
UINT64 AbsoluteMaxY;
UINT64 AbsoluteMaxZ;
UINT32 Attributes;
} EFI_ABSOLUTE_POINTER_MODE;
typedef struct {
UINT64 CurrentX;
UINT64 CurrentY;
UINT64 CurrentZ;
UINT32 ActiveButtons;
} EFI_ABSOLUTE_POINTER_STATE;
#define EFI_ABSP_SupportsAltActive 0x00000001
#define EFI_ABSP_SupportsPressureAsZ 0x00000002
#define EFI_ABSP_TouchActive 0x00000001
#define EFI_ABS_AltActive 0x00000002
typedef
EFI_STATUS
(EFIAPI *EFI_ABSOLUTE_POINTER_RESET) (
IN struct _EFI_ABSOLUTE_POINTER_PROTOCOL *This,
IN BOOLEAN ExtendedVerification
);
typedef
EFI_STATUS
(EFIAPI *EFI_ABSOLUTE_POINTER_GET_STATE) (
IN struct _EFI_ABSOLUTE_POINTER_PROTOCOL *This,
IN OUT EFI_ABSOLUTE_POINTER_STATE *State
);
typedef struct _EFI_ABSOLUTE_POINTER_PROTOCOL {
EFI_ABSOLUTE_POINTER_RESET Reset;
EFI_ABSOLUTE_POINTER_GET_STATE GetState;
EFI_EVENT WaitForInput;
EFI_ABSOLUTE_POINTER_MODE *Mode;
} EFI_ABSOLUTE_POINTER_PROTOCOL;
#endif
diff --git a/stand/efi/include/efiprot.h b/stand/efi/include/efiprot.h
index 351b2d347ad4..be11ea83b3a2 100644
--- a/stand/efi/include/efiprot.h
+++ b/stand/efi/include/efiprot.h
@@ -1,636 +1,635 @@
-/* $FreeBSD$ */
#ifndef _EFI_PROT_H
#define _EFI_PROT_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efiprot.h
Abstract:
EFI Protocols
Revision History
--*/
#include <efidef.h>
//
// Device Path protocol
//
#define DEVICE_PATH_PROTOCOL \
{ 0x9576e91, 0x6d3f, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
//
// Block IO protocol
//
#define BLOCK_IO_PROTOCOL \
{ 0x964e5b21, 0x6459, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
#define EFI_BLOCK_IO_INTERFACE_REVISION 0x00010000
INTERFACE_DECL(_EFI_BLOCK_IO);
typedef
EFI_STATUS
(EFIAPI *EFI_BLOCK_RESET) (
IN struct _EFI_BLOCK_IO *This,
IN BOOLEAN ExtendedVerification
);
typedef
EFI_STATUS
(EFIAPI *EFI_BLOCK_READ) (
IN struct _EFI_BLOCK_IO *This,
IN UINT32 MediaId,
IN EFI_LBA LBA,
IN UINTN BufferSize,
OUT VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_BLOCK_WRITE) (
IN struct _EFI_BLOCK_IO *This,
IN UINT32 MediaId,
IN EFI_LBA LBA,
IN UINTN BufferSize,
IN VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_BLOCK_FLUSH) (
IN struct _EFI_BLOCK_IO *This
);
typedef struct {
UINT32 MediaId;
BOOLEAN RemovableMedia;
BOOLEAN MediaPresent;
BOOLEAN LogicalPartition;
BOOLEAN ReadOnly;
BOOLEAN WriteCaching;
UINT32 BlockSize;
UINT32 IoAlign;
EFI_LBA LastBlock;
} EFI_BLOCK_IO_MEDIA;
typedef struct _EFI_BLOCK_IO {
UINT64 Revision;
EFI_BLOCK_IO_MEDIA *Media;
EFI_BLOCK_RESET Reset;
EFI_BLOCK_READ ReadBlocks;
EFI_BLOCK_WRITE WriteBlocks;
EFI_BLOCK_FLUSH FlushBlocks;
} EFI_BLOCK_IO;
//
// Disk Block IO protocol
//
#define DISK_IO_PROTOCOL \
{ 0xce345171, 0xba0b, 0x11d2, {0x8e, 0x4f, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
#define EFI_DISK_IO_INTERFACE_REVISION 0x00010000
INTERFACE_DECL(_EFI_DISK_IO);
typedef
EFI_STATUS
(EFIAPI *EFI_DISK_READ) (
IN struct _EFI_DISK_IO *This,
IN UINT32 MediaId,
IN UINT64 Offset,
IN UINTN BufferSize,
OUT VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_DISK_WRITE) (
IN struct _EFI_DISK_IO *This,
IN UINT32 MediaId,
IN UINT64 Offset,
IN UINTN BufferSize,
IN VOID *Buffer
);
typedef struct _EFI_DISK_IO {
UINT64 Revision;
EFI_DISK_READ ReadDisk;
EFI_DISK_WRITE WriteDisk;
} EFI_DISK_IO;
//
// Simple file system protocol
//
#define SIMPLE_FILE_SYSTEM_PROTOCOL \
{ 0x964e5b22, 0x6459, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
INTERFACE_DECL(_EFI_FILE_IO_INTERFACE);
INTERFACE_DECL(_EFI_FILE_HANDLE);
typedef
EFI_STATUS
(EFIAPI *EFI_VOLUME_OPEN) (
IN struct _EFI_FILE_IO_INTERFACE *This,
OUT struct _EFI_FILE_HANDLE **Root
);
#define EFI_FILE_IO_INTERFACE_REVISION 0x00010000
typedef struct _EFI_FILE_IO_INTERFACE {
UINT64 Revision;
EFI_VOLUME_OPEN OpenVolume;
} EFI_FILE_IO_INTERFACE;
//
//
//
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_OPEN) (
IN struct _EFI_FILE_HANDLE *File,
OUT struct _EFI_FILE_HANDLE **NewHandle,
IN CHAR16 *FileName,
IN UINT64 OpenMode,
IN UINT64 Attributes
);
// Open modes
#define EFI_FILE_MODE_READ 0x0000000000000001
#define EFI_FILE_MODE_WRITE 0x0000000000000002
#define EFI_FILE_MODE_CREATE 0x8000000000000000
// File attributes
#define EFI_FILE_READ_ONLY 0x0000000000000001
#define EFI_FILE_HIDDEN 0x0000000000000002
#define EFI_FILE_SYSTEM 0x0000000000000004
#define EFI_FILE_RESERVIED 0x0000000000000008
#define EFI_FILE_DIRECTORY 0x0000000000000010
#define EFI_FILE_ARCHIVE 0x0000000000000020
#define EFI_FILE_VALID_ATTR 0x0000000000000037
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_CLOSE) (
IN struct _EFI_FILE_HANDLE *File
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_DELETE) (
IN struct _EFI_FILE_HANDLE *File
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_READ) (
IN struct _EFI_FILE_HANDLE *File,
IN OUT UINTN *BufferSize,
OUT VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_WRITE) (
IN struct _EFI_FILE_HANDLE *File,
IN OUT UINTN *BufferSize,
IN VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_SET_POSITION) (
IN struct _EFI_FILE_HANDLE *File,
IN UINT64 Position
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_GET_POSITION) (
IN struct _EFI_FILE_HANDLE *File,
OUT UINT64 *Position
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_GET_INFO) (
IN struct _EFI_FILE_HANDLE *File,
IN EFI_GUID *InformationType,
IN OUT UINTN *BufferSize,
OUT VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_SET_INFO) (
IN struct _EFI_FILE_HANDLE *File,
IN EFI_GUID *InformationType,
IN UINTN BufferSize,
IN VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_FILE_FLUSH) (
IN struct _EFI_FILE_HANDLE *File
);
#define EFI_FILE_HANDLE_REVISION 0x00010000
typedef struct _EFI_FILE_HANDLE {
UINT64 Revision;
EFI_FILE_OPEN Open;
EFI_FILE_CLOSE Close;
EFI_FILE_DELETE Delete;
EFI_FILE_READ Read;
EFI_FILE_WRITE Write;
EFI_FILE_GET_POSITION GetPosition;
EFI_FILE_SET_POSITION SetPosition;
EFI_FILE_GET_INFO GetInfo;
EFI_FILE_SET_INFO SetInfo;
EFI_FILE_FLUSH Flush;
} EFI_FILE, *EFI_FILE_HANDLE;
//
// File information types
//
#define EFI_FILE_INFO_ID \
{ 0x9576e92, 0x6d3f, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
typedef struct {
UINT64 Size;
UINT64 FileSize;
UINT64 PhysicalSize;
EFI_TIME CreateTime;
EFI_TIME LastAccessTime;
EFI_TIME ModificationTime;
UINT64 Attribute;
CHAR16 FileName[1];
} EFI_FILE_INFO;
//
// The FileName field of the EFI_FILE_INFO data structure is variable length.
// Whenever code needs to know the size of the EFI_FILE_INFO data structure, it needs to
// be the size of the data structure without the FileName field. The following macro
// computes this size correctly no matter how big the FileName array is declared.
// This is required to make the EFI_FILE_INFO data structure ANSI compilant.
//
#define SIZE_OF_EFI_FILE_INFO EFI_FIELD_OFFSET(EFI_FILE_INFO,FileName)
#define EFI_FILE_SYSTEM_INFO_ID \
{ 0x9576e93, 0x6d3f, 0x11d2, {0x8e, 0x39, 0x0, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
typedef struct {
UINT64 Size;
BOOLEAN ReadOnly;
UINT64 VolumeSize;
UINT64 FreeSpace;
UINT32 BlockSize;
CHAR16 VolumeLabel[1];
} EFI_FILE_SYSTEM_INFO;
//
// The VolumeLabel field of the EFI_FILE_SYSTEM_INFO data structure is variable length.
// Whenever code needs to know the size of the EFI_FILE_SYSTEM_INFO data structure, it needs
// to be the size of the data structure without the VolumeLable field. The following macro
// computes this size correctly no matter how big the VolumeLable array is declared.
// This is required to make the EFI_FILE_SYSTEM_INFO data structure ANSI compilant.
//
#define SIZE_OF_EFI_FILE_SYSTEM_INFO EFI_FIELD_OFFSET(EFI_FILE_SYSTEM_INFO,VolumeLabel)
#define EFI_FILE_SYSTEM_VOLUME_LABEL_INFO_ID \
{ 0xDB47D7D3,0xFE81, 0x11d3, {0x9A, 0x35, 0x00, 0x90, 0x27, 0x3F, 0xC1, 0x4D} }
typedef struct {
CHAR16 VolumeLabel[1];
} EFI_FILE_SYSTEM_VOLUME_LABEL_INFO;
#define SIZE_OF_EFI_FILE_SYSTEM_VOLUME_LABEL_INFO EFI_FIELD_OFFSET(EFI_FILE_SYSTEM_VOLUME_LABEL_INFO,VolumeLabel)
//
// Load file protocol
//
#define LOAD_FILE_PROTOCOL \
{ 0x56EC3091, 0x954C, 0x11d2, {0x8E, 0x3F, 0x00, 0xA0, 0xC9, 0x69, 0x72, 0x3B} }
INTERFACE_DECL(_EFI_LOAD_FILE_INTERFACE);
typedef
EFI_STATUS
(EFIAPI *EFI_LOAD_FILE) (
IN struct _EFI_LOAD_FILE_INTERFACE *This,
IN EFI_DEVICE_PATH *FilePath,
IN BOOLEAN BootPolicy,
IN OUT UINTN *BufferSize,
IN VOID *Buffer OPTIONAL
);
typedef struct _EFI_LOAD_FILE_INTERFACE {
EFI_LOAD_FILE LoadFile;
} EFI_LOAD_FILE_INTERFACE;
//
// Device IO protocol
//
#define DEVICE_IO_PROTOCOL \
{ 0xaf6ac311, 0x84c3, 0x11d2, {0x8e, 0x3c, 0x00, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
INTERFACE_DECL(_EFI_DEVICE_IO_INTERFACE);
typedef enum {
IO_UINT8,
IO_UINT16,
IO_UINT32,
IO_UINT64,
//
// Specification Change: Copy from MMIO to MMIO vs. MMIO to buffer, buffer to MMIO
//
MMIO_COPY_UINT8,
MMIO_COPY_UINT16,
MMIO_COPY_UINT32,
MMIO_COPY_UINT64
} EFI_IO_WIDTH;
#define EFI_PCI_ADDRESS(bus,dev,func,reg) \
( (UINT64) ( (((UINTN)bus) << 24) + (((UINTN)dev) << 16) + (((UINTN)func) << 8) + ((UINTN)reg) ))
typedef
EFI_STATUS
(EFIAPI *EFI_DEVICE_IO) (
IN struct _EFI_DEVICE_IO_INTERFACE *This,
IN EFI_IO_WIDTH Width,
IN UINT64 Address,
IN UINTN Count,
IN OUT VOID *Buffer
);
typedef struct {
EFI_DEVICE_IO Read;
EFI_DEVICE_IO Write;
} EFI_IO_ACCESS;
typedef
EFI_STATUS
(EFIAPI *EFI_PCI_DEVICE_PATH) (
IN struct _EFI_DEVICE_IO_INTERFACE *This,
IN UINT64 Address,
IN OUT EFI_DEVICE_PATH **PciDevicePath
);
typedef enum {
EfiBusMasterRead,
EfiBusMasterWrite,
EfiBusMasterCommonBuffer
} EFI_IO_OPERATION_TYPE;
typedef
EFI_STATUS
(EFIAPI *EFI_IO_MAP) (
IN struct _EFI_DEVICE_IO_INTERFACE *This,
IN EFI_IO_OPERATION_TYPE Operation,
IN EFI_PHYSICAL_ADDRESS *HostAddress,
IN OUT UINTN *NumberOfBytes,
OUT EFI_PHYSICAL_ADDRESS *DeviceAddress,
OUT VOID **Mapping
);
typedef
EFI_STATUS
(EFIAPI *EFI_IO_UNMAP) (
IN struct _EFI_DEVICE_IO_INTERFACE *This,
IN VOID *Mapping
);
typedef
EFI_STATUS
(EFIAPI *EFI_IO_ALLOCATE_BUFFER) (
IN struct _EFI_DEVICE_IO_INTERFACE *This,
IN EFI_ALLOCATE_TYPE Type,
IN EFI_MEMORY_TYPE MemoryType,
IN UINTN Pages,
IN OUT EFI_PHYSICAL_ADDRESS *HostAddress
);
typedef
EFI_STATUS
(EFIAPI *EFI_IO_FLUSH) (
IN struct _EFI_DEVICE_IO_INTERFACE *This
);
typedef
EFI_STATUS
(EFIAPI *EFI_IO_FREE_BUFFER) (
IN struct _EFI_DEVICE_IO_INTERFACE *This,
IN UINTN Pages,
IN EFI_PHYSICAL_ADDRESS HostAddress
);
typedef struct _EFI_DEVICE_IO_INTERFACE {
EFI_IO_ACCESS Mem;
EFI_IO_ACCESS Io;
EFI_IO_ACCESS Pci;
EFI_IO_MAP Map;
EFI_PCI_DEVICE_PATH PciDevicePath;
EFI_IO_UNMAP Unmap;
EFI_IO_ALLOCATE_BUFFER AllocateBuffer;
EFI_IO_FLUSH Flush;
EFI_IO_FREE_BUFFER FreeBuffer;
} EFI_DEVICE_IO_INTERFACE;
//
// Unicode Collation protocol
//
#define UNICODE_COLLATION_PROTOCOL \
{ 0x1d85cd7f, 0xf43d, 0x11d2, {0x9a, 0xc, 0x0, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
#define UNICODE_BYTE_ORDER_MARK (CHAR16)(0xfeff)
INTERFACE_DECL(_EFI_UNICODE_COLLATION_INTERFACE);
typedef
INTN
(EFIAPI *EFI_UNICODE_COLLATION_STRICOLL) (
IN struct _EFI_UNICODE_COLLATION_INTERFACE *This,
IN CHAR16 *s1,
IN CHAR16 *s2
);
typedef
BOOLEAN
(EFIAPI *EFI_UNICODE_COLLATION_METAIMATCH) (
IN struct _EFI_UNICODE_COLLATION_INTERFACE *This,
IN CHAR16 *String,
IN CHAR16 *Pattern
);
typedef
VOID
(EFIAPI *EFI_UNICODE_COLLATION_STRLWR) (
IN struct _EFI_UNICODE_COLLATION_INTERFACE *This,
IN OUT CHAR16 *Str
);
typedef
VOID
(EFIAPI *EFI_UNICODE_COLLATION_STRUPR) (
IN struct _EFI_UNICODE_COLLATION_INTERFACE *This,
IN OUT CHAR16 *Str
);
typedef
VOID
(EFIAPI *EFI_UNICODE_COLLATION_FATTOSTR) (
IN struct _EFI_UNICODE_COLLATION_INTERFACE *This,
IN UINTN FatSize,
IN CHAR8 *Fat,
OUT CHAR16 *String
);
typedef
BOOLEAN
(EFIAPI *EFI_UNICODE_COLLATION_STRTOFAT) (
IN struct _EFI_UNICODE_COLLATION_INTERFACE *This,
IN CHAR16 *String,
IN UINTN FatSize,
OUT CHAR8 *Fat
);
typedef struct _EFI_UNICODE_COLLATION_INTERFACE {
// general
EFI_UNICODE_COLLATION_STRICOLL StriColl;
EFI_UNICODE_COLLATION_METAIMATCH MetaiMatch;
EFI_UNICODE_COLLATION_STRLWR StrLwr;
EFI_UNICODE_COLLATION_STRUPR StrUpr;
// for supporting fat volumes
EFI_UNICODE_COLLATION_FATTOSTR FatToStr;
EFI_UNICODE_COLLATION_STRTOFAT StrToFat;
CHAR8 *SupportedLanguages;
} EFI_UNICODE_COLLATION_INTERFACE;
//
// Driver Binding protocol
//
#define DRIVER_BINDING_PROTOCOL \
{ 0x18a031ab, 0xb443, 0x4d1a, {0xa5, 0xc0, 0x0c, 0x09, 0x26, 0x1e, 0x9f, 0x71} }
INTERFACE_DECL(_EFI_DRIVER_BINDING);
typedef
EFI_STATUS
(EFIAPI *EFI_DRIVER_BINDING_SUPPORTED) (
IN struct _EFI_DRIVER_BINDING *This,
IN EFI_HANDLE ControllerHandle,
IN EFI_DEVICE_PATH *RemainingPath
);
typedef
EFI_STATUS
(EFIAPI *EFI_DRIVER_BINDING_START) (
IN struct _EFI_DRIVER_BINDING *This,
IN EFI_HANDLE ControllerHandle,
IN EFI_DEVICE_PATH *RemainingPath
);
typedef
EFI_STATUS
(EFIAPI *EFI_DRIVER_BINDING_STOP) (
IN struct _EFI_DRIVER_BINDING *This,
IN EFI_HANDLE ControllerHandle,
IN UINTN NumberOfChildren,
IN EFI_HANDLE *ChildHandleBuffer
);
typedef struct _EFI_DRIVER_BINDING {
EFI_DRIVER_BINDING_SUPPORTED Supported;
EFI_DRIVER_BINDING_START Start;
EFI_DRIVER_BINDING_STOP Stop;
UINT32 Version;
EFI_HANDLE ImageHandle;
EFI_HANDLE DriverBindingHandle;
} EFI_DRIVER_BINDING;
//
// Component Name Protocol 2
//
#define COMPONENT_NAME2_PROTOCOL \
{ 0x6a7a5cff, 0xe8d9, 0x4f70, {0xba, 0xda, 0x75, 0xab, 0x30, 0x25, 0xce, 0x14 } }
INTERFACE_DECL(_EFI_COMPONENT_NAME2);
typedef
EFI_STATUS
(EFIAPI *EFI_COMPONENT_NAME_GET_DRIVER_NAME) (
IN struct _EFI_COMPONENT_NAME2 *This,
IN CHAR8 * Language,
OUT CHAR16 **DriverName
);
typedef
EFI_STATUS
(EFIAPI *EFI_COMPONENT_NAME_GET_CONTROLLER_NAME) (
IN struct _EFI_COMPONENT_NAME2 *This,
IN EFI_HANDLE ControllerHandle,
IN EFI_HANDLE ChildHandle OPTIONAL,
IN CHAR8 *Language,
OUT CHAR16 **ControllerName
);
typedef struct _EFI_COMPONENT_NAME2 {
EFI_COMPONENT_NAME_GET_DRIVER_NAME GetDriverName;
EFI_COMPONENT_NAME_GET_CONTROLLER_NAME GetControllerName;
CHAR8 **SupportedLanguages;
} EFI_COMPONENT_NAME2;
#endif
diff --git a/stand/efi/include/efipxebc.h b/stand/efi/include/efipxebc.h
index ba0b2e9b6c5d..5d5c60a104b0 100644
--- a/stand/efi/include/efipxebc.h
+++ b/stand/efi/include/efipxebc.h
@@ -1,472 +1,471 @@
-/* $FreeBSD$ */
#ifndef _EFIPXEBC_H
#define _EFIPXEBC_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efipxebc.h
Abstract:
EFI PXE Base Code Protocol
Revision History
--*/
//
// PXE Base Code protocol
//
#define EFI_PXE_BASE_CODE_PROTOCOL \
{ 0x03c4e603, 0xac28, 0x11d3, {0x9a, 0x2d, 0x00, 0x90, 0x27, 0x3f, 0xc1, 0x4d} }
INTERFACE_DECL(_EFI_PXE_BASE_CODE);
#define DEFAULT_TTL 8
#define DEFAULT_ToS 0
//
// Address definitions
//
typedef union {
UINT32 Addr[4];
EFI_IPv4_ADDRESS v4;
EFI_IPv6_ADDRESS v6;
} EFI_IP_ADDRESS;
typedef UINT16 EFI_PXE_BASE_CODE_UDP_PORT;
//
// Packet definitions
//
typedef struct {
UINT8 BootpOpcode;
UINT8 BootpHwType;
UINT8 BootpHwAddrLen;
UINT8 BootpGateHops;
UINT32 BootpIdent;
UINT16 BootpSeconds;
UINT16 BootpFlags;
UINT8 BootpCiAddr[4];
UINT8 BootpYiAddr[4];
UINT8 BootpSiAddr[4];
UINT8 BootpGiAddr[4];
UINT8 BootpHwAddr[16];
UINT8 BootpSrvName[64];
UINT8 BootpBootFile[128];
UINT32 DhcpMagik;
UINT8 DhcpOptions[56];
} EFI_PXE_BASE_CODE_DHCPV4_PACKET;
// TBD in EFI v1.1
//typedef struct {
// UINT8 reserved;
//} EFI_PXE_BASE_CODE_DHCPV6_PACKET;
typedef union {
UINT8 Raw[1472];
EFI_PXE_BASE_CODE_DHCPV4_PACKET Dhcpv4;
// EFI_PXE_BASE_CODE_DHCPV6_PACKET Dhcpv6;
} EFI_PXE_BASE_CODE_PACKET;
typedef struct {
UINT8 Type;
UINT8 Code;
UINT16 Checksum;
union {
UINT32 reserved;
UINT32 Mtu;
UINT32 Pointer;
struct {
UINT16 Identifier;
UINT16 Sequence;
} Echo;
} u;
UINT8 Data[494];
} EFI_PXE_BASE_CODE_ICMP_ERROR;
typedef struct {
UINT8 ErrorCode;
CHAR8 ErrorString[127];
} EFI_PXE_BASE_CODE_TFTP_ERROR;
//
// IP Receive Filter definitions
//
#define EFI_PXE_BASE_CODE_MAX_IPCNT 8
typedef struct {
UINT8 Filters;
UINT8 IpCnt;
UINT16 reserved;
EFI_IP_ADDRESS IpList[EFI_PXE_BASE_CODE_MAX_IPCNT];
} EFI_PXE_BASE_CODE_IP_FILTER;
#define EFI_PXE_BASE_CODE_IP_FILTER_STATION_IP 0x0001
#define EFI_PXE_BASE_CODE_IP_FILTER_BROADCAST 0x0002
#define EFI_PXE_BASE_CODE_IP_FILTER_PROMISCUOUS 0x0004
#define EFI_PXE_BASE_CODE_IP_FILTER_PROMISCUOUS_MULTICAST 0x0008
//
// ARP Cache definitions
//
typedef struct {
EFI_IP_ADDRESS IpAddr;
EFI_MAC_ADDRESS MacAddr;
} EFI_PXE_BASE_CODE_ARP_ENTRY;
typedef struct {
EFI_IP_ADDRESS IpAddr;
EFI_IP_ADDRESS SubnetMask;
EFI_IP_ADDRESS GwAddr;
} EFI_PXE_BASE_CODE_ROUTE_ENTRY;
//
// UDP definitions
//
#define EFI_PXE_BASE_CODE_UDP_OPFLAGS_ANY_SRC_IP 0x0001
#define EFI_PXE_BASE_CODE_UDP_OPFLAGS_ANY_SRC_PORT 0x0002
#define EFI_PXE_BASE_CODE_UDP_OPFLAGS_ANY_DEST_IP 0x0004
#define EFI_PXE_BASE_CODE_UDP_OPFLAGS_ANY_DEST_PORT 0x0008
#define EFI_PXE_BASE_CODE_UDP_OPFLAGS_USE_FILTER 0x0010
#define EFI_PXE_BASE_CODE_UDP_OPFLAGS_MAY_FRAGMENT 0x0020
//
// Discover() definitions
//
#define EFI_PXE_BASE_CODE_BOOT_TYPE_BOOTSTRAP 0
#define EFI_PXE_BASE_CODE_BOOT_TYPE_MS_WINNT_RIS 1
#define EFI_PXE_BASE_CODE_BOOT_TYPE_INTEL_LCM 2
#define EFI_PXE_BASE_CODE_BOOT_TYPE_DOSUNDI 3
#define EFI_PXE_BASE_CODE_BOOT_TYPE_NEC_ESMPRO 4
#define EFI_PXE_BASE_CODE_BOOT_TYPE_IBM_WSoD 5
#define EFI_PXE_BASE_CODE_BOOT_TYPE_IBM_LCCM 6
#define EFI_PXE_BASE_CODE_BOOT_TYPE_CA_UNICENTER_TNG 7
#define EFI_PXE_BASE_CODE_BOOT_TYPE_HP_OPENVIEW 8
#define EFI_PXE_BASE_CODE_BOOT_TYPE_ALTIRIS_9 9
#define EFI_PXE_BASE_CODE_BOOT_TYPE_ALTIRIS_10 10
#define EFI_PXE_BASE_CODE_BOOT_TYPE_ALTIRIS_11 11
#define EFI_PXE_BASE_CODE_BOOT_TYPE_NOT_USED_12 12
#define EFI_PXE_BASE_CODE_BOOT_TYPE_REDHAT_INSTALL 13
#define EFI_PXE_BASE_CODE_BOOT_TYPE_REDHAT_BOOT 14
#define EFI_PXE_BASE_CODE_BOOT_TYPE_REMBO 15
#define EFI_PXE_BASE_CODE_BOOT_TYPE_BEOBOOT 16
//
// 17 through 32767 are reserved
// 32768 through 65279 are for vendor use
// 65280 through 65534 are reserved
//
#define EFI_PXE_BASE_CODE_BOOT_TYPE_PXETEST 65535
#define EFI_PXE_BASE_CODE_BOOT_LAYER_MASK 0x7FFF
#define EFI_PXE_BASE_CODE_BOOT_LAYER_INITIAL 0x0000
#define EFI_PXE_BASE_CODE_BOOT_LAYER_CREDENTIALS 0x8000
typedef struct {
UINT16 Type;
BOOLEAN AcceptAnyResponse;
UINT8 Reserved;
EFI_IP_ADDRESS IpAddr;
} EFI_PXE_BASE_CODE_SRVLIST;
typedef struct {
BOOLEAN UseMCast;
BOOLEAN UseBCast;
BOOLEAN UseUCast;
BOOLEAN MustUseList;
EFI_IP_ADDRESS ServerMCastIp;
UINT16 IpCnt;
EFI_PXE_BASE_CODE_SRVLIST SrvList[1];
} EFI_PXE_BASE_CODE_DISCOVER_INFO;
//
// Mtftp() definitions
//
typedef enum {
EFI_PXE_BASE_CODE_TFTP_FIRST,
EFI_PXE_BASE_CODE_TFTP_GET_FILE_SIZE,
EFI_PXE_BASE_CODE_TFTP_READ_FILE,
EFI_PXE_BASE_CODE_TFTP_WRITE_FILE,
EFI_PXE_BASE_CODE_TFTP_READ_DIRECTORY,
EFI_PXE_BASE_CODE_MTFTP_GET_FILE_SIZE,
EFI_PXE_BASE_CODE_MTFTP_READ_FILE,
EFI_PXE_BASE_CODE_MTFTP_READ_DIRECTORY,
EFI_PXE_BASE_CODE_MTFTP_LAST
} EFI_PXE_BASE_CODE_TFTP_OPCODE;
typedef struct {
EFI_IP_ADDRESS MCastIp;
EFI_PXE_BASE_CODE_UDP_PORT CPort;
EFI_PXE_BASE_CODE_UDP_PORT SPort;
UINT16 ListenTimeout;
UINT16 TransmitTimeout;
} EFI_PXE_BASE_CODE_MTFTP_INFO;
//
// PXE Base Code Mode structure
//
#define EFI_PXE_BASE_CODE_MAX_ARP_ENTRIES 8
#define EFI_PXE_BASE_CODE_MAX_ROUTE_ENTRIES 8
typedef struct {
BOOLEAN Started;
BOOLEAN Ipv6Available;
BOOLEAN Ipv6Supported;
BOOLEAN UsingIpv6;
BOOLEAN BisSupported;
BOOLEAN BisDetected;
BOOLEAN AutoArp;
BOOLEAN SendGUID;
BOOLEAN DhcpDiscoverValid;
BOOLEAN DhcpAckReceived;
BOOLEAN ProxyOfferReceived;
BOOLEAN PxeDiscoverValid;
BOOLEAN PxeReplyReceived;
BOOLEAN PxeBisReplyReceived;
BOOLEAN IcmpErrorReceived;
BOOLEAN TftpErrorReceived;
BOOLEAN MakeCallbacks;
UINT8 TTL;
UINT8 ToS;
EFI_IP_ADDRESS StationIp;
EFI_IP_ADDRESS SubnetMask;
EFI_PXE_BASE_CODE_PACKET DhcpDiscover;
EFI_PXE_BASE_CODE_PACKET DhcpAck;
EFI_PXE_BASE_CODE_PACKET ProxyOffer;
EFI_PXE_BASE_CODE_PACKET PxeDiscover;
EFI_PXE_BASE_CODE_PACKET PxeReply;
EFI_PXE_BASE_CODE_PACKET PxeBisReply;
EFI_PXE_BASE_CODE_IP_FILTER IpFilter;
UINT32 ArpCacheEntries;
EFI_PXE_BASE_CODE_ARP_ENTRY ArpCache[EFI_PXE_BASE_CODE_MAX_ARP_ENTRIES];
UINT32 RouteTableEntries;
EFI_PXE_BASE_CODE_ROUTE_ENTRY RouteTable[EFI_PXE_BASE_CODE_MAX_ROUTE_ENTRIES];
EFI_PXE_BASE_CODE_ICMP_ERROR IcmpError;
EFI_PXE_BASE_CODE_TFTP_ERROR TftpError;
} EFI_PXE_BASE_CODE_MODE;
//
// PXE Base Code Interface Function definitions
//
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_START) (
IN struct _EFI_PXE_BASE_CODE *This,
IN BOOLEAN UseIpv6
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_STOP) (
IN struct _EFI_PXE_BASE_CODE *This
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_DHCP) (
IN struct _EFI_PXE_BASE_CODE *This,
IN BOOLEAN SortOffers
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_DISCOVER) (
IN struct _EFI_PXE_BASE_CODE *This,
IN UINT16 Type,
IN UINT16 *Layer,
IN BOOLEAN UseBis,
IN OUT EFI_PXE_BASE_CODE_DISCOVER_INFO *Info OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_MTFTP) (
IN struct _EFI_PXE_BASE_CODE *This,
IN EFI_PXE_BASE_CODE_TFTP_OPCODE Operation,
IN OUT VOID *BufferPtr OPTIONAL,
IN BOOLEAN Overwrite,
IN OUT UINT64 *BufferSize,
IN UINTN *BlockSize OPTIONAL,
IN EFI_IP_ADDRESS *ServerIp,
IN UINT8 *Filename,
IN EFI_PXE_BASE_CODE_MTFTP_INFO *Info OPTIONAL,
IN BOOLEAN DontUseBuffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_UDP_WRITE) (
IN struct _EFI_PXE_BASE_CODE *This,
IN UINT16 OpFlags,
IN EFI_IP_ADDRESS *DestIp,
IN EFI_PXE_BASE_CODE_UDP_PORT *DestPort,
IN EFI_IP_ADDRESS *GatewayIp, OPTIONAL
IN EFI_IP_ADDRESS *SrcIp, OPTIONAL
IN OUT EFI_PXE_BASE_CODE_UDP_PORT *SrcPort, OPTIONAL
IN UINTN *HeaderSize, OPTIONAL
IN VOID *HeaderPtr, OPTIONAL
IN UINTN *BufferSize,
IN VOID *BufferPtr
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_UDP_READ) (
IN struct _EFI_PXE_BASE_CODE *This,
IN UINT16 OpFlags,
IN OUT EFI_IP_ADDRESS *DestIp, OPTIONAL
IN OUT EFI_PXE_BASE_CODE_UDP_PORT *DestPort, OPTIONAL
IN OUT EFI_IP_ADDRESS *SrcIp, OPTIONAL
IN OUT EFI_PXE_BASE_CODE_UDP_PORT *SrcPort, OPTIONAL
IN UINTN *HeaderSize, OPTIONAL
IN VOID *HeaderPtr, OPTIONAL
IN OUT UINTN *BufferSize,
IN VOID *BufferPtr
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_SET_IP_FILTER) (
IN struct _EFI_PXE_BASE_CODE *This,
IN EFI_PXE_BASE_CODE_IP_FILTER *NewFilter
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_ARP) (
IN struct _EFI_PXE_BASE_CODE *This,
IN EFI_IP_ADDRESS *IpAddr,
IN EFI_MAC_ADDRESS *MacAddr OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_SET_PARAMETERS) (
IN struct _EFI_PXE_BASE_CODE *This,
IN BOOLEAN *NewAutoArp, OPTIONAL
IN BOOLEAN *NewSendGUID, OPTIONAL
IN UINT8 *NewTTL, OPTIONAL
IN UINT8 *NewToS, OPTIONAL
IN BOOLEAN *NewMakeCallback OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_SET_STATION_IP) (
IN struct _EFI_PXE_BASE_CODE *This,
IN EFI_IP_ADDRESS *NewStationIp, OPTIONAL
IN EFI_IP_ADDRESS *NewSubnetMask OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_PXE_BASE_CODE_SET_PACKETS) (
IN struct _EFI_PXE_BASE_CODE *This,
BOOLEAN *NewDhcpDiscoverValid, OPTIONAL
BOOLEAN *NewDhcpAckReceived, OPTIONAL
BOOLEAN *NewProxyOfferReceived, OPTIONAL
BOOLEAN *NewPxeDiscoverValid, OPTIONAL
BOOLEAN *NewPxeReplyReceived, OPTIONAL
BOOLEAN *NewPxeBisReplyReceived,OPTIONAL
IN EFI_PXE_BASE_CODE_PACKET *NewDhcpDiscover, OPTIONAL
IN EFI_PXE_BASE_CODE_PACKET *NewDhcpAck, OPTIONAL
IN EFI_PXE_BASE_CODE_PACKET *NewProxyOffer, OPTIONAL
IN EFI_PXE_BASE_CODE_PACKET *NewPxeDiscover, OPTIONAL
IN EFI_PXE_BASE_CODE_PACKET *NewPxeReply, OPTIONAL
IN EFI_PXE_BASE_CODE_PACKET *NewPxeBisReply OPTIONAL
);
//
// PXE Base Code Protocol structure
//
#define EFI_PXE_BASE_CODE_INTERFACE_REVISION 0x00010000
typedef struct _EFI_PXE_BASE_CODE {
UINT64 Revision;
EFI_PXE_BASE_CODE_START Start;
EFI_PXE_BASE_CODE_STOP Stop;
EFI_PXE_BASE_CODE_DHCP Dhcp;
EFI_PXE_BASE_CODE_DISCOVER Discover;
EFI_PXE_BASE_CODE_MTFTP Mtftp;
EFI_PXE_BASE_CODE_UDP_WRITE UdpWrite;
EFI_PXE_BASE_CODE_UDP_READ UdpRead;
EFI_PXE_BASE_CODE_SET_IP_FILTER SetIpFilter;
EFI_PXE_BASE_CODE_ARP Arp;
EFI_PXE_BASE_CODE_SET_PARAMETERS SetParameters;
EFI_PXE_BASE_CODE_SET_STATION_IP SetStationIp;
EFI_PXE_BASE_CODE_SET_PACKETS SetPackets;
EFI_PXE_BASE_CODE_MODE *Mode;
} EFI_PXE_BASE_CODE;
//
// Call Back Definitions
//
#define EFI_PXE_BASE_CODE_CALLBACK_PROTOCOL \
{ 0x245dca21, 0xfb7b, 0x11d3, {0x8f, 0x01, 0x00, 0xa0, 0xc9, 0x69, 0x72, 0x3b} }
//
// Revision Number
//
#define EFI_PXE_BASE_CODE_CALLBACK_INTERFACE_REVISION 0x00010000
INTERFACE_DECL(_EFI_PXE_BASE_CODE_CALLBACK);
typedef enum {
EFI_PXE_BASE_CODE_FUNCTION_FIRST,
EFI_PXE_BASE_CODE_FUNCTION_DHCP,
EFI_PXE_BASE_CODE_FUNCTION_DISCOVER,
EFI_PXE_BASE_CODE_FUNCTION_MTFTP,
EFI_PXE_BASE_CODE_FUNCTION_UDP_WRITE,
EFI_PXE_BASE_CODE_FUNCTION_UDP_READ,
EFI_PXE_BASE_CODE_FUNCTION_ARP,
EFI_PXE_BASE_CODE_FUNCTION_IGMP,
EFI_PXE_BASE_CODE_PXE_FUNCTION_LAST
} EFI_PXE_BASE_CODE_FUNCTION;
typedef enum {
EFI_PXE_BASE_CODE_CALLBACK_STATUS_FIRST,
EFI_PXE_BASE_CODE_CALLBACK_STATUS_CONTINUE,
EFI_PXE_BASE_CODE_CALLBACK_STATUS_ABORT,
EFI_PXE_BASE_CODE_CALLBACK_STATUS_LAST
} EFI_PXE_BASE_CODE_CALLBACK_STATUS;
typedef
EFI_PXE_BASE_CODE_CALLBACK_STATUS
(EFIAPI *EFI_PXE_CALLBACK) (
IN struct _EFI_PXE_BASE_CODE_CALLBACK *This,
IN EFI_PXE_BASE_CODE_FUNCTION Function,
IN BOOLEAN Received,
IN UINT32 PacketLen,
IN EFI_PXE_BASE_CODE_PACKET *Packet OPTIONAL
);
typedef struct _EFI_PXE_BASE_CODE_CALLBACK {
UINT64 Revision;
EFI_PXE_CALLBACK Callback;
} EFI_PXE_BASE_CODE_CALLBACK;
#endif /* _EFIPXEBC_H */
diff --git a/stand/efi/include/efiser.h b/stand/efi/include/efiser.h
index e3d66e203a4b..9a13653453fb 100644
--- a/stand/efi/include/efiser.h
+++ b/stand/efi/include/efiser.h
@@ -1,139 +1,138 @@
-/* $FreeBSD$ */
#ifndef _EFI_SER_H
#define _EFI_SER_H
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efiser.h
Abstract:
EFI serial protocol
Revision History
--*/
//
// Serial protocol
//
#define SERIAL_IO_PROTOCOL \
{ 0xBB25CF6F, 0xF1D4, 0x11D2, {0x9A, 0x0C, 0x00, 0x90, 0x27, 0x3F, 0xC1, 0xFD} }
INTERFACE_DECL(_SERIAL_IO_INTERFACE);
typedef enum {
DefaultParity,
NoParity,
EvenParity,
OddParity,
MarkParity,
SpaceParity
} EFI_PARITY_TYPE;
typedef enum {
DefaultStopBits,
OneStopBit, // 1 stop bit
OneFiveStopBits, // 1.5 stop bits
TwoStopBits // 2 stop bits
} EFI_STOP_BITS_TYPE;
#define EFI_SERIAL_CLEAR_TO_SEND 0x0010 // RO
#define EFI_SERIAL_DATA_SET_READY 0x0020 // RO
#define EFI_SERIAL_RING_INDICATE 0x0040 // RO
#define EFI_SERIAL_CARRIER_DETECT 0x0080 // RO
#define EFI_SERIAL_REQUEST_TO_SEND 0x0002 // WO
#define EFI_SERIAL_DATA_TERMINAL_READY 0x0001 // WO
#define EFI_SERIAL_INPUT_BUFFER_EMPTY 0x0100 // RO
#define EFI_SERIAL_OUTPUT_BUFFER_EMPTY 0x0200 // RO
#define EFI_SERIAL_HARDWARE_LOOPBACK_ENABLE 0x1000 // RW
#define EFI_SERIAL_SOFTWARE_LOOPBACK_ENABLE 0x2000 // RW
#define EFI_SERIAL_HARDWARE_FLOW_CONTROL_ENABLE 0x4000 // RW
typedef
EFI_STATUS
(EFIAPI *EFI_SERIAL_RESET) (
IN struct _SERIAL_IO_INTERFACE *This
);
typedef
EFI_STATUS
(EFIAPI *EFI_SERIAL_SET_ATTRIBUTES) (
IN struct _SERIAL_IO_INTERFACE *This,
IN UINT64 BaudRate,
IN UINT32 ReceiveFifoDepth,
IN UINT32 Timeout,
IN EFI_PARITY_TYPE Parity,
IN UINT8 DataBits,
IN EFI_STOP_BITS_TYPE StopBits
);
typedef
EFI_STATUS
(EFIAPI *EFI_SERIAL_SET_CONTROL_BITS) (
IN struct _SERIAL_IO_INTERFACE *This,
IN UINT32 Control
);
typedef
EFI_STATUS
(EFIAPI *EFI_SERIAL_GET_CONTROL_BITS) (
IN struct _SERIAL_IO_INTERFACE *This,
OUT UINT32 *Control
);
typedef
EFI_STATUS
(EFIAPI *EFI_SERIAL_WRITE) (
IN struct _SERIAL_IO_INTERFACE *This,
IN OUT UINTN *BufferSize,
IN VOID *Buffer
);
typedef
EFI_STATUS
(EFIAPI *EFI_SERIAL_READ) (
IN struct _SERIAL_IO_INTERFACE *This,
IN OUT UINTN *BufferSize,
OUT VOID *Buffer
);
typedef struct {
UINT32 ControlMask;
// current Attributes
UINT32 Timeout;
UINT64 BaudRate;
UINT32 ReceiveFifoDepth;
UINT32 DataBits;
UINT32 Parity;
UINT32 StopBits;
} SERIAL_IO_MODE;
#define SERIAL_IO_INTERFACE_REVISION 0x00010000
typedef struct _SERIAL_IO_INTERFACE {
UINT32 Revision;
EFI_SERIAL_RESET Reset;
EFI_SERIAL_SET_ATTRIBUTES SetAttributes;
EFI_SERIAL_SET_CONTROL_BITS SetControl;
EFI_SERIAL_GET_CONTROL_BITS GetControl;
EFI_SERIAL_WRITE Write;
EFI_SERIAL_READ Read;
SERIAL_IO_MODE *Mode;
} SERIAL_IO_INTERFACE;
#endif
diff --git a/stand/efi/include/efistdarg.h b/stand/efi/include/efistdarg.h
index 25f556984112..f4cf0356563c 100644
--- a/stand/efi/include/efistdarg.h
+++ b/stand/efi/include/efistdarg.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
#ifndef _EFISTDARG_H_
#define _EFISTDARG_H_
/*++
Copyright (c) 1999 - 2002 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
devpath.h
Abstract:
Defines for parsing the EFI Device Path structures
Revision History
--*/
#define _INTSIZEOF(n) ( (sizeof(n) + sizeof(UINTN) - 1) & ~(sizeof(UINTN) - 1) )
typedef CHAR8 * va_list;
#define va_start(ap,v) ( ap = (va_list)&v + _INTSIZEOF(v) )
#define va_arg(ap,t) ( *(t *)((ap += _INTSIZEOF(t)) - _INTSIZEOF(t)) )
#define va_end(ap) ( ap = (va_list)0 )
#endif /* _INC_STDARG */
diff --git a/stand/efi/include/efitcp.h b/stand/efi/include/efitcp.h
index 9f47b5ce8edc..6c5df7fd944d 100644
--- a/stand/efi/include/efitcp.h
+++ b/stand/efi/include/efitcp.h
@@ -1,392 +1,391 @@
-/* $FreeBSD$ */
#ifndef _EFI_TCP_H
#define _EFI_TCP_H
/*++
Copyright (c) 2013 Intel Corporation
--*/
#define EFI_TCP4_SERVICE_BINDING_PROTOCOL \
{ 0x00720665, 0x67eb, 0x4a99, {0xba, 0xf7, 0xd3, 0xc3, 0x3a, 0x1c,0x7c, 0xc9}}
#define EFI_TCP4_PROTOCOL \
{ 0x65530bc7, 0xa359, 0x410f, {0xb0, 0x10, 0x5a, 0xad, 0xc7, 0xec, 0x2b, 0x62}}
#define EFI_TCP6_SERVICE_BINDING_PROTOCOL \
{ 0xec20eb79, 0x6c1a, 0x4664, {0x9a, 0xd, 0xd2, 0xe4, 0xcc, 0x16, 0xd6, 0x64}}
#define EFI_TCP6_PROTOCOL \
{ 0x46e44855, 0xbd60, 0x4ab7, {0xab, 0xd, 0xa6, 0x79, 0xb9, 0x44, 0x7d, 0x77}}
INTERFACE_DECL(_EFI_TCP4);
INTERFACE_DECL(_EFI_TCP6);
typedef struct {
BOOLEAN UseDefaultAddress;
EFI_IPv4_ADDRESS StationAddress;
EFI_IPv4_ADDRESS SubnetMask;
UINT16 StationPort;
EFI_IPv4_ADDRESS RemoteAddress;
UINT16 RemotePort;
BOOLEAN ActiveFlag;
} EFI_TCP4_ACCESS_POINT;
typedef struct {
UINT32 ReceiveBufferSize;
UINT32 SendBufferSize;
UINT32 MaxSynBackLog;
UINT32 ConnectionTimeout;
UINT32 DataRetries;
UINT32 FinTimeout;
UINT32 TimeWaitTimeout;
UINT32 KeepAliveProbes;
UINT32 KeepAliveTime;
UINT32 KeepAliveInterval;
BOOLEAN EnableNagle;
BOOLEAN EnableTimeStamp;
BOOLEAN EnableWindowScaling;
BOOLEAN EnableSelectiveAck;
BOOLEAN EnablePAthMtuDiscovery;
} EFI_TCP4_OPTION;
typedef struct {
// Receiving Filters
// I/O parameters
UINT8 TypeOfService;
UINT8 TimeToLive;
// Access Point
EFI_TCP4_ACCESS_POINT AccessPoint;
// TCP Control Options
EFI_TCP4_OPTION *ControlOption;
} EFI_TCP4_CONFIG_DATA;
typedef enum {
Tcp4StateClosed = 0,
Tcp4StateListen = 1,
Tcp4StateSynSent = 2,
Tcp4StateSynReceived = 3,
Tcp4StateEstablished = 4,
Tcp4StateFinWait1 = 5,
Tcp4StateFinWait2 = 6,
Tcp4StateClosing = 7,
Tcp4StateTimeWait = 8,
Tcp4StateCloseWait = 9,
Tcp4StateLastAck = 10
} EFI_TCP4_CONNECTION_STATE;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_GET_MODE_DATA) (
IN struct _EFI_TCP4 *This,
OUT EFI_TCP4_CONNECTION_STATE *Tcp4State OPTIONAL,
OUT EFI_TCP4_CONFIG_DATA *Tcp4ConfigData OPTIONAL,
OUT EFI_IP4_MODE_DATA *Ip4ModeData OPTIONAL,
OUT EFI_MANAGED_NETWORK_CONFIG_DATA *MnpConfigData OPTIONAL,
OUT EFI_SIMPLE_NETWORK_MODE *SnpModeData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_CONFIGURE) (
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_CONFIG_DATA *TcpConfigData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_ROUTES) (
IN struct _EFI_TCP4 *This,
IN BOOLEAN DeleteRoute,
IN EFI_IPv4_ADDRESS *SubnetAddress,
IN EFI_IPv4_ADDRESS *SubnetMask,
IN EFI_IPv4_ADDRESS *GatewayAddress
);
typedef struct {
EFI_EVENT Event;
EFI_STATUS Status;
} EFI_TCP4_COMPLETION_TOKEN;
typedef struct {
EFI_TCP4_COMPLETION_TOKEN CompletionToken;
} EFI_TCP4_CONNECTION_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_CONNECT) (
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_CONNECTION_TOKEN *ConnectionToken
);
typedef struct {
EFI_TCP4_COMPLETION_TOKEN CompletionToken;
EFI_HANDLE NewChildHandle;
} EFI_TCP4_LISTEN_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_ACCEPT) (
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_LISTEN_TOKEN *ListenToken
);
#define EFI_CONNECTION_FIN EFIERR(104)
#define EFI_CONNECTION_RESET EFIERR(105)
#define EFI_CONNECTION_REFUSED EFIERR(106)
typedef struct {
UINT32 FragmentLength;
VOID *FragmentBuffer;
} EFI_TCP4_FRAGMENT_DATA;
typedef struct {
BOOLEAN UrgentFlag;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_TCP4_FRAGMENT_DATA FragmentTable[1];
} EFI_TCP4_RECEIVE_DATA;
typedef struct {
BOOLEAN Push;
BOOLEAN Urgent;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_TCP4_FRAGMENT_DATA FragmentTable[1];
} EFI_TCP4_TRANSMIT_DATA;
typedef struct {
EFI_TCP4_COMPLETION_TOKEN CompletionToken;
union {
EFI_TCP4_RECEIVE_DATA *RxData;
EFI_TCP4_TRANSMIT_DATA *TxData;
} Packet;
} EFI_TCP4_IO_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_TRANSMIT) (
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_IO_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_RECEIVE) (
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_IO_TOKEN *Token
);
typedef struct {
EFI_TCP4_COMPLETION_TOKEN CompletionToken;
BOOLEAN AbortOnClose;
} EFI_TCP4_CLOSE_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_CLOSE)(
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_CLOSE_TOKEN *CloseToken
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_CANCEL)(
IN struct _EFI_TCP4 *This,
IN EFI_TCP4_COMPLETION_TOKEN *Token OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP4_POLL) (
IN struct _EFI_TCP4 *This
);
typedef struct _EFI_TCP4 {
EFI_TCP4_GET_MODE_DATA GetModeData;
EFI_TCP4_CONFIGURE Configure;
EFI_TCP4_ROUTES Routes;
EFI_TCP4_CONNECT Connect;
EFI_TCP4_ACCEPT Accept;
EFI_TCP4_TRANSMIT Transmit;
EFI_TCP4_RECEIVE Receive;
EFI_TCP4_CLOSE Close;
EFI_TCP4_CANCEL Cancel;
EFI_TCP4_POLL Poll;
} EFI_TCP4;
typedef enum {
Tcp6StateClosed = 0,
Tcp6StateListen = 1,
Tcp6StateSynSent = 2,
Tcp6StateSynReceived = 3,
Tcp6StateEstablished = 4,
Tcp6StateFinWait1 = 5,
Tcp6StateFinWait2 = 6,
Tcp6StateClosing = 7,
Tcp6StateTimeWait = 8,
Tcp6StateCloseWait = 9,
Tcp6StateLastAck = 10
} EFI_TCP6_CONNECTION_STATE;
typedef struct {
EFI_IPv6_ADDRESS StationAddress;
UINT16 StationPort;
EFI_IPv6_ADDRESS RemoteAddress;
UINT16 RemotePort;
BOOLEAN ActiveFlag;
} EFI_TCP6_ACCESS_POINT;
typedef struct {
UINT32 ReceiveBufferSize;
UINT32 SendBufferSize;
UINT32 MaxSynBackLog;
UINT32 ConnectionTimeout;
UINT32 DataRetries;
UINT32 FinTimeout;
UINT32 TimeWaitTimeout;
UINT32 KeepAliveProbes;
UINT32 KeepAliveTime;
UINT32 KeepAliveInterval;
BOOLEAN EnableNagle;
BOOLEAN EnableTimeStamp;
BOOLEAN EnableWindbowScaling;
BOOLEAN EnableSelectiveAck;
BOOLEAN EnablePathMtuDiscovery;
} EFI_TCP6_OPTION;
typedef struct {
UINT8 TrafficClass;
UINT8 HopLimit;
EFI_TCP6_ACCESS_POINT AccessPoint;
EFI_TCP6_OPTION *ControlOption;
} EFI_TCP6_CONFIG_DATA;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_GET_MODE_DATA) (
IN struct _EFI_TCP6 *This,
OUT EFI_TCP6_CONNECTION_STATE *Tcp6State OPTIONAL,
OUT EFI_TCP6_CONFIG_DATA *Tcp6ConfigData OPTIONAL,
OUT EFI_IP6_MODE_DATA *Ip6ModeData OPTIONAL,
OUT EFI_MANAGED_NETWORK_CONFIG_DATA *MnpConfigData OPTIONAL,
OUT EFI_SIMPLE_NETWORK_MODE *SnpModeData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_CONFIGURE) (
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_CONFIG_DATA *Tcp6ConfigData OPTIONAL
);
typedef struct {
EFI_EVENT Event;
EFI_STATUS Status;
} EFI_TCP6_COMPLETION_TOKEN;
typedef struct {
EFI_TCP6_COMPLETION_TOKEN CompletionToken;
} EFI_TCP6_CONNECTION_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_CONNECT) (
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_CONNECTION_TOKEN *ConnectionToken
);
typedef struct {
EFI_TCP6_COMPLETION_TOKEN CompletionToken;
EFI_HANDLE NewChildHandle;
} EFI_TCP6_LISTEN_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_ACCEPT) (
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_LISTEN_TOKEN *ListenToken
);
typedef struct {
UINT32 FragmentLength;
VOID *FragmentBuffer;
} EFI_TCP6_FRAGMENT_DATA;
typedef struct {
BOOLEAN UrgentFlag;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_TCP6_FRAGMENT_DATA FragmentTable[1];
} EFI_TCP6_RECEIVE_DATA;
typedef struct {
BOOLEAN Push;
BOOLEAN Urgent;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_TCP6_FRAGMENT_DATA FragmentTable[1];
} EFI_TCP6_TRANSMIT_DATA;
typedef struct {
EFI_TCP6_COMPLETION_TOKEN CompletionToken;
union {
EFI_TCP6_RECEIVE_DATA *RxData;
EFI_TCP6_TRANSMIT_DATA *TxData;
} Packet;
} EFI_TCP6_IO_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_TRANSMIT) (
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_IO_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_RECEIVE) (
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_IO_TOKEN *Token
);
typedef struct {
EFI_TCP6_COMPLETION_TOKEN CompletionToken;
BOOLEAN AbortOnClose;
} EFI_TCP6_CLOSE_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_CLOSE)(
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_CLOSE_TOKEN *CloseToken
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_CANCEL)(
IN struct _EFI_TCP6 *This,
IN EFI_TCP6_COMPLETION_TOKEN *Token OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_TCP6_POLL) (
IN struct _EFI_TCP6 *This
);
typedef struct _EFI_TCP6 {
EFI_TCP6_GET_MODE_DATA GetModeData;
EFI_TCP6_CONFIGURE Configure;
EFI_TCP6_CONNECT Connect;
EFI_TCP6_ACCEPT Accept;
EFI_TCP6_TRANSMIT Transmit;
EFI_TCP6_RECEIVE Receive;
EFI_TCP6_CLOSE Close;
EFI_TCP6_CANCEL Cancel;
EFI_TCP6_POLL Poll;
} EFI_TCP6;
#endif /* _EFI_TCP_H */
diff --git a/stand/efi/include/efiudp.h b/stand/efi/include/efiudp.h
index 82c8df79b59a..7c8b467eb9c4 100644
--- a/stand/efi/include/efiudp.h
+++ b/stand/efi/include/efiudp.h
@@ -1,273 +1,272 @@
-/* $FreeBSD$ */
#ifndef _EFI_UDP_H
#define _EFI_UDP_H
/*++
Copyright (c) 2013 Intel Corporation
--*/
#define EFI_UDP4_SERVICE_BINDING_PROTOCOL \
{ 0x83f01464, 0x99bd, 0x45e5, {0xb3, 0x83, 0xaf, 0x63, 0x05, 0xd8, 0xe9, 0xe6} }
#define EFI_UDP4_PROTOCOL \
{ 0x3ad9df29, 0x4501, 0x478d, {0xb1, 0xf8, 0x7f, 0x7f, 0xe7, 0x0e, 0x50, 0xf3} }
#define EFI_UDP6_SERVICE_BINDING_PROTOCOL \
{ 0x66ed4721, 0x3c98, 0x4d3e, {0x81, 0xe3, 0xd0, 0x3d, 0xd3, 0x9a, 0x72, 0x54} }
#define EFI_UDP6_PROTOCOL \
{ 0x4f948815, 0xb4b9, 0x43cb, {0x8a, 0x33, 0x90, 0xe0, 0x60, 0xb3,0x49, 0x55} }
INTERFACE_DECL(_EFI_UDP4);
INTERFACE_DECL(_EFI_UDP6);
typedef struct {
BOOLEAN AcceptBroadcast;
BOOLEAN AcceptPromiscuous;
BOOLEAN AcceptAnyPort;
BOOLEAN AllowDuplicatePort;
UINT8 TypeOfService;
UINT8 TimeToLive;
BOOLEAN DoNotFragment;
UINT32 ReceiveTimeout;
UINT32 TransmitTimeout;
BOOLEAN UseDefaultAddress;
EFI_IPv4_ADDRESS StationAddress;
EFI_IPv4_ADDRESS SubnetMask;
UINT16 StationPort;
EFI_IPv4_ADDRESS RemoteAddress;
UINT16 RemotePort;
} EFI_UDP4_CONFIG_DATA;
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_GET_MODE_DATA) (
IN struct _EFI_UDP4 *This,
OUT EFI_UDP4_CONFIG_DATA *Udp4ConfigData OPTIONAL,
OUT EFI_IP4_MODE_DATA *Ip4ModeData OPTIONAL,
OUT EFI_MANAGED_NETWORK_CONFIG_DATA *MnpConfigData OPTIONAL,
OUT EFI_SIMPLE_NETWORK_MODE *SnpModeData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_CONFIGURE) (
IN struct _EFI_UDP4 *This,
IN EFI_UDP4_CONFIG_DATA *UdpConfigData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_GROUPS) (
IN struct _EFI_UDP4 *This,
IN BOOLEAN JoinFlag,
IN EFI_IPv4_ADDRESS *MulticastAddress OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_ROUTES) (
IN struct _EFI_UDP4 *This,
IN BOOLEAN DeleteRoute,
IN EFI_IPv4_ADDRESS *SubnetAddress,
IN EFI_IPv4_ADDRESS *SubnetMask,
IN EFI_IPv4_ADDRESS *GatewayAddress
);
#define EFI_NETWORK_UNREACHABLE EFIERR(100)
#define EFI_HOST_UNREACHABLE EFIERR(101)
#define EFI_PROTOCOL_UNREACHABLE EFIERR(102)
#define EFI_PORT_UNREACHABLE EFIERR(103)
typedef struct {
EFI_IPv4_ADDRESS SourceAddress;
UINT16 SourcePort;
EFI_IPv4_ADDRESS DestinationAddress;
UINT16 DestinationPort;
} EFI_UDP4_SESSION_DATA;
typedef struct {
UINT32 FragmentLength;
VOID *FragmentBuffer;
} EFI_UDP4_FRAGMENT_DATA;
typedef struct {
EFI_TIME TimeStamp;
EFI_EVENT RecycleSignal;
EFI_UDP4_SESSION_DATA UdpSession;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_UDP4_FRAGMENT_DATA FragmentTable[1];
} EFI_UDP4_RECEIVE_DATA;
typedef struct {
EFI_UDP4_SESSION_DATA *UdpSessionData;
EFI_IPv4_ADDRESS *GatewayAddress;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_UDP4_FRAGMENT_DATA FragmentTable[1];
} EFI_UDP4_TRANSMIT_DATA;
typedef struct {
EFI_EVENT Event;
EFI_STATUS Status;
union {
EFI_UDP4_RECEIVE_DATA *RxData;
EFI_UDP4_TRANSMIT_DATA *TxData;
} Packet;
} EFI_UDP4_COMPLETION_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_TRANSMIT) (
IN struct _EFI_UDP4 *This,
IN EFI_UDP4_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_RECEIVE) (
IN struct _EFI_UDP4 *This,
IN EFI_UDP4_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_CANCEL)(
IN struct _EFI_UDP4 *This,
IN EFI_UDP4_COMPLETION_TOKEN *Token OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP4_POLL) (
IN struct _EFI_UDP4 *This
);
typedef struct _EFI_UDP4 {
EFI_UDP4_GET_MODE_DATA GetModeData;
EFI_UDP4_CONFIGURE Configure;
EFI_UDP4_GROUPS Groups;
EFI_UDP4_ROUTES Routes;
EFI_UDP4_TRANSMIT Transmit;
EFI_UDP4_RECEIVE Receive;
EFI_UDP4_CANCEL Cancel;
EFI_UDP4_POLL Poll;
} EFI_UDP4;
typedef struct {
BOOLEAN AcceptPromiscuous;
BOOLEAN AcceptAnyPort;
BOOLEAN AllowDuplicatePort;
UINT8 TrafficClass;
UINT8 HopLimit;
UINT32 ReceiveTimeout;
UINT32 TransmitTimeout;
EFI_IPv6_ADDRESS StationAddress;
UINT16 StationPort;
EFI_IPv6_ADDRESS RemoteAddress;
UINT16 RemotePort;
} EFI_UDP6_CONFIG_DATA;
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_GET_MODE_DATA) (
IN struct _EFI_UDP6 *This,
OUT EFI_UDP6_CONFIG_DATA *Udp6ConfigData OPTIONAL,
OUT EFI_IP6_MODE_DATA *Ip6ModeData OPTIONAL,
OUT EFI_MANAGED_NETWORK_CONFIG_DATA *MnpConfigData OPTIONAL,
OUT EFI_SIMPLE_NETWORK_MODE *SnpModeData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_CONFIGURE) (
IN struct _EFI_UDP6 *This,
IN EFI_UDP6_CONFIG_DATA *UdpConfigData OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_GROUPS) (
IN struct _EFI_UDP6 *This,
IN BOOLEAN JoinFlag,
IN EFI_IPv6_ADDRESS *MulticastAddress OPTIONAL
);
typedef struct {
EFI_IPv6_ADDRESS SourceAddress;
UINT16 SourcePort;
EFI_IPv6_ADDRESS DestinationAddress;
UINT16 DestinationPort;
} EFI_UDP6_SESSION_DATA;
typedef struct {
UINT32 FragmentLength;
VOID *FragmentBuffer;
} EFI_UDP6_FRAGMENT_DATA;
typedef struct {
EFI_TIME TimeStamp;
EFI_EVENT RecycleSignal;
EFI_UDP6_SESSION_DATA UdpSession;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_UDP6_FRAGMENT_DATA FragmentTable[1];
} EFI_UDP6_RECEIVE_DATA;
typedef struct {
EFI_UDP6_SESSION_DATA *UdpSessionData;
UINT32 DataLength;
UINT32 FragmentCount;
EFI_UDP6_FRAGMENT_DATA FragmentTable[1];
} EFI_UDP6_TRANSMIT_DATA;
typedef struct {
EFI_EVENT Event;
EFI_STATUS Status;
union {
EFI_UDP6_RECEIVE_DATA *RxData;
EFI_UDP6_TRANSMIT_DATA *TxData;
} Packet;
} EFI_UDP6_COMPLETION_TOKEN;
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_TRANSMIT) (
IN struct _EFI_UDP6 *This,
IN EFI_UDP6_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_RECEIVE) (
IN struct _EFI_UDP6 *This,
IN EFI_UDP6_COMPLETION_TOKEN *Token
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_CANCEL)(
IN struct _EFI_UDP6 *This,
IN EFI_UDP6_COMPLETION_TOKEN *Token OPTIONAL
);
typedef
EFI_STATUS
(EFIAPI *EFI_UDP6_POLL) (
IN struct _EFI_UDP6 *This
);
typedef struct _EFI_UDP6 {
EFI_UDP6_GET_MODE_DATA GetModeData;
EFI_UDP6_CONFIGURE Configure;
EFI_UDP6_GROUPS Groups;
EFI_UDP6_TRANSMIT Transmit;
EFI_UDP6_RECEIVE Receive;
EFI_UDP6_CANCEL Cancel;
EFI_UDP6_POLL Poll;
} EFI_UDP6;
#endif /* _EFI_UDP_H */
diff --git a/stand/efi/include/efiuga.h b/stand/efi/include/efiuga.h
index 00464b7cb4c0..b15c2176c32f 100644
--- a/stand/efi/include/efiuga.h
+++ b/stand/efi/include/efiuga.h
@@ -1,168 +1,167 @@
-/* $FreeBSD$ */
/** @file
UGA Draw protocol from the EFI 1.1 specification.
Abstraction of a very simple graphics device.
Copyright (c) 2006 - 2008, Intel Corporation. All rights reserved.<BR>
This program and the accompanying materials are licensed and made available
under the terms and conditions of the BSD License which accompanies this
distribution. The full text of the license may be found at:
http://opensource.org/licenses/bsd-license.php
THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
File name: UgaDraw.h
**/
#ifndef __UGA_DRAW_H__
#define __UGA_DRAW_H__
#define EFI_UGA_DRAW_PROTOCOL_GUID \
{ 0x982c298b, 0xf4fa, 0x41cb, {0xb8, 0x38, 0x77, 0xaa, 0x68, 0x8f, 0xb8, 0x39} }
typedef struct _EFI_UGA_DRAW_PROTOCOL EFI_UGA_DRAW_PROTOCOL;
/**
Return the current video mode information.
@param This Protocol instance pointer.
@param HorizontalResolution Current video horizontal resolution in pixels
@param VerticalResolution Current video vertical resolution in pixels
@param ColorDepth Current video color depth in bits per pixel
@param RefreshRate Current video refresh rate in Hz.
@retval EFI_SUCCESS Mode information returned.
@retval EFI_NOT_STARTED Video display is not initialized. Call SetMode ()
@retval EFI_INVALID_PARAMETER One of the input args was NULL.
**/
typedef
EFI_STATUS
(EFIAPI *EFI_UGA_DRAW_PROTOCOL_GET_MODE) (
IN EFI_UGA_DRAW_PROTOCOL *This,
OUT UINT32 *HorizontalResolution,
OUT UINT32 *VerticalResolution,
OUT UINT32 *ColorDepth,
OUT UINT32 *RefreshRate
)
;
/**
Return the current video mode information.
@param This Protocol instance pointer.
@param HorizontalResolution Current video horizontal resolution in pixels
@param VerticalResolution Current video vertical resolution in pixels
@param ColorDepth Current video color depth in bits per pixel
@param RefreshRate Current video refresh rate in Hz.
@retval EFI_SUCCESS Mode information returned.
@retval EFI_NOT_STARTED Video display is not initialized. Call SetMode ()
**/
typedef
EFI_STATUS
(EFIAPI *EFI_UGA_DRAW_PROTOCOL_SET_MODE) (
IN EFI_UGA_DRAW_PROTOCOL *This,
IN UINT32 HorizontalResolution,
IN UINT32 VerticalResolution,
IN UINT32 ColorDepth,
IN UINT32 RefreshRate
)
;
typedef struct {
UINT8 Blue;
UINT8 Green;
UINT8 Red;
UINT8 Reserved;
} EFI_UGA_PIXEL;
typedef union {
EFI_UGA_PIXEL Pixel;
UINT32 Raw;
} EFI_UGA_PIXEL_UNION;
typedef enum {
EfiUgaVideoFill,
EfiUgaVideoToBltBuffer,
EfiUgaBltBufferToVideo,
EfiUgaVideoToVideo,
EfiUgaBltMax
} EFI_UGA_BLT_OPERATION;
/**
Type specifying a pointer to a function to perform an UGA Blt operation.
The following table defines actions for BltOperations:
<B>EfiUgaVideoFill</B> - Write data from the BltBuffer pixel (SourceX, SourceY)
directly to every pixel of the video display rectangle
(DestinationX, DestinationY) (DestinationX + Width, DestinationY + Height).
Only one pixel will be used from the BltBuffer. Delta is NOT used.
<B>EfiUgaVideoToBltBuffer</B> - Read data from the video display rectangle
(SourceX, SourceY) (SourceX + Width, SourceY + Height) and place it in
the BltBuffer rectangle (DestinationX, DestinationY )
(DestinationX + Width, DestinationY + Height). If DestinationX or
DestinationY is not zero then Delta must be set to the length in bytes
of a row in the BltBuffer.
<B>EfiUgaBltBufferToVideo</B> - Write data from the BltBuffer rectangle
(SourceX, SourceY) (SourceX + Width, SourceY + Height) directly to the
video display rectangle (DestinationX, DestinationY)
(DestinationX + Width, DestinationY + Height). If SourceX or SourceY is
not zero then Delta must be set to the length in bytes of a row in the
BltBuffer.
<B>EfiUgaVideoToVideo</B> - Copy from the video display rectangle (SourceX, SourceY)
(SourceX + Width, SourceY + Height) .to the video display rectangle
(DestinationX, DestinationY) (DestinationX + Width, DestinationY + Height).
The BltBuffer and Delta are not used in this mode.
@param[in] This - Protocol instance pointer.
@param[in] BltBuffer - Buffer containing data to blit into video buffer. This
buffer has a size of Width*Height*sizeof(EFI_UGA_PIXEL)
@param[in] BltOperation - Operation to perform on BlitBuffer and video memory
@param[in] SourceX - X coordinate of source for the BltBuffer.
@param[in] SourceY - Y coordinate of source for the BltBuffer.
@param[in] DestinationX - X coordinate of destination for the BltBuffer.
@param[in] DestinationY - Y coordinate of destination for the BltBuffer.
@param[in] Width - Width of rectangle in BltBuffer in pixels.
@param[in] Height - Hight of rectangle in BltBuffer in pixels.
@param[in] Delta - OPTIONAL
@retval EFI_SUCCESS - The Blt operation completed.
@retval EFI_INVALID_PARAMETER - BltOperation is not valid.
@retval EFI_DEVICE_ERROR - A hardware error occurred writing to the video buffer.
--*/
typedef
EFI_STATUS
(EFIAPI *EFI_UGA_DRAW_PROTOCOL_BLT) (
IN EFI_UGA_DRAW_PROTOCOL * This,
IN EFI_UGA_PIXEL * BltBuffer, OPTIONAL
IN EFI_UGA_BLT_OPERATION BltOperation,
IN UINTN SourceX,
IN UINTN SourceY,
IN UINTN DestinationX,
IN UINTN DestinationY,
IN UINTN Width,
IN UINTN Height,
IN UINTN Delta OPTIONAL
);
struct _EFI_UGA_DRAW_PROTOCOL {
EFI_UGA_DRAW_PROTOCOL_GET_MODE GetMode;
EFI_UGA_DRAW_PROTOCOL_SET_MODE SetMode;
EFI_UGA_DRAW_PROTOCOL_BLT Blt;
};
extern EFI_GUID gEfiUgaDrawProtocolGuid;
#endif
diff --git a/stand/efi/include/i386/efibind.h b/stand/efi/include/i386/efibind.h
index 0f1d4f115598..6123a98d1b9b 100644
--- a/stand/efi/include/i386/efibind.h
+++ b/stand/efi/include/i386/efibind.h
@@ -1,267 +1,266 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 1999 - 2003 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efefind.h
Abstract:
EFI to compile bindings
Revision History
--*/
#pragma pack()
#ifdef __FreeBSD__
#include <sys/stdint.h>
#else
//
// Basic int types of various widths
//
#if (__STDC_VERSION__ < 199901L )
// No ANSI C 1999/2000 stdint.h integer width declarations
#ifdef _MSC_EXTENSIONS
// Use Microsoft C compiler integer width declarations
typedef unsigned __int64 uint64_t;
typedef __int64 int64_t;
typedef unsigned __int32 uint32_t;
typedef __int32 int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#else
#ifdef UNIX_LP64
// Use LP64 programming model from C_FLAGS for integer width declarations
typedef unsigned long uint64_t;
typedef long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#else
// Assume P64 programming model from C_FLAGS for integer width declarations
typedef unsigned long long uint64_t;
typedef long long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#endif
#endif
#endif
#endif /* __FreeBSD__ */
//
// Basic EFI types of various widths
//
#ifndef ACPI_THREAD_ID /* ACPI's definitions are fine, use those */
#define ACPI_USE_SYSTEM_INTTYPES 1 /* Tell ACPI we've defined types */
typedef uint64_t UINT64;
typedef int64_t INT64;
#ifndef _BASETSD_H_
typedef uint32_t UINT32;
typedef int32_t INT32;
#endif
typedef uint16_t UINT16;
typedef int16_t INT16;
typedef uint8_t UINT8;
typedef int8_t INT8;
#endif
#undef VOID
#define VOID void
typedef int32_t INTN;
typedef uint32_t UINTN;
#ifdef EFI_NT_EMULATOR
#define POST_CODE(_Data)
#else
#ifdef EFI_DEBUG
#define POST_CODE(_Data) __asm mov eax,(_Data) __asm out 0x80,al
#else
#define POST_CODE(_Data)
#endif
#endif
#define EFIERR(a) (0x80000000 | a)
#define EFI_ERROR_MASK 0x80000000
#define EFIERR_OEM(a) (0xc0000000 | a)
#define BAD_POINTER 0xFBFBFBFB
#define MAX_ADDRESS 0xFFFFFFFF
#define BREAKPOINT() __asm { int 3 }
//
// Pointers must be aligned to these address to function
//
#define MIN_ALIGNMENT_SIZE 4
#define ALIGN_VARIABLE(Value ,Adjustment) \
(UINTN)Adjustment = 0; \
if((UINTN)Value % MIN_ALIGNMENT_SIZE) \
(UINTN)Adjustment = MIN_ALIGNMENT_SIZE - ((UINTN)Value % MIN_ALIGNMENT_SIZE); \
Value = (UINTN)Value + (UINTN)Adjustment
//
// Define macros to build data structure signatures from characters.
//
#define EFI_SIGNATURE_16(A,B) ((A) | (B<<8))
#define EFI_SIGNATURE_32(A,B,C,D) (EFI_SIGNATURE_16(A,B) | (EFI_SIGNATURE_16(C,D) << 16))
#define EFI_SIGNATURE_64(A,B,C,D,E,F,G,H) (EFI_SIGNATURE_32(A,B,C,D) | ((UINT64)(EFI_SIGNATURE_32(E,F,G,H)) << 32))
//
// EFIAPI - prototype calling convention for EFI function pointers
// BOOTSERVICE - prototype for implementation of a boot service interface
// RUNTIMESERVICE - prototype for implementation of a runtime service interface
// RUNTIMEFUNCTION - prototype for implementation of a runtime function that is not a service
// RUNTIME_CODE - pragma macro for declaring runtime code
//
#ifndef EFIAPI // Forces EFI calling conventions reguardless of compiler options
#ifdef _MSC_EXTENSIONS
#define EFIAPI __cdecl // Force C calling convention for Microsoft C compiler
#else
#define EFIAPI // Substitute expresion to force C calling convention
#endif
#endif
#define BOOTSERVICE
//#define RUNTIMESERVICE(proto,a) alloc_text("rtcode",a); proto a
//#define RUNTIMEFUNCTION(proto,a) alloc_text("rtcode",a); proto a
#define RUNTIMESERVICE
#define RUNTIMEFUNCTION
#define RUNTIME_CODE(a) alloc_text("rtcode", a)
#define BEGIN_RUNTIME_DATA() data_seg("rtdata")
#define END_RUNTIME_DATA() data_seg()
#define VOLATILE volatile
#define MEMORY_FENCE()
#ifdef EFI_NO_INTERFACE_DECL
#define EFI_FORWARD_DECLARATION(x)
#define EFI_INTERFACE_DECL(x)
#else
#define EFI_FORWARD_DECLARATION(x) typedef struct _##x x
#define EFI_INTERFACE_DECL(x) typedef struct x
#endif
#ifdef EFI_NT_EMULATOR
//
// To help ensure proper coding of integrated drivers, they are
// compiled as DLLs. In NT they require a dll init entry pointer.
// The macro puts a stub entry point into the DLL so it will load.
//
#define EFI_DRIVER_ENTRY_POINT(InitFunction) \
EFI_STATUS \
InitFunction ( \
EFI_HANDLE ImageHandle, \
EFI_SYSTEM_TABLE *SystemTable \
); \
\
UINTN \
__stdcall \
_DllMainCRTStartup ( \
UINTN Inst, \
UINTN reason_for_call, \
VOID *rserved \
) \
{ \
return 1; \
} \
\
int \
__declspec( dllexport ) \
__cdecl \
InitializeDriver ( \
void *ImageHandle, \
void *SystemTable \
) \
{ \
return InitFunction(ImageHandle, SystemTable); \
}
#define LOAD_INTERNAL_DRIVER(_if, type, name, entry) \
(_if)->LoadInternal(type, name, NULL)
#else // EFI_NT_EMULATOR
//
// When build similar to FW, then link everything together as
// one big module.
//
#define EFI_DRIVER_ENTRY_POINT(InitFunction)
#define LOAD_INTERNAL_DRIVER(_if, type, name, entry) \
(_if)->LoadInternal(type, name, entry)
#endif // EFI_FW_NT
#ifdef __FreeBSD__
#define INTERFACE_DECL(x) struct x
#else
//
// Some compilers don't support the forward reference construct:
// typedef struct XXXXX
//
// The following macro provide a workaround for such cases.
//
#ifdef NO_INTERFACE_DECL
#define INTERFACE_DECL(x)
#else
#define INTERFACE_DECL(x) typedef struct x
#endif
#endif /* __FreeBSD__ */
#ifdef _MSC_EXTENSIONS
#pragma warning ( disable : 4731 ) // Suppress warnings about modification of EBP
#endif
diff --git a/stand/efi/include/i386/pe.h b/stand/efi/include/i386/pe.h
index e2ae25c3ddf6..ede10814939f 100644
--- a/stand/efi/include/i386/pe.h
+++ b/stand/efi/include/i386/pe.h
@@ -1,630 +1,629 @@
-/* $FreeBSD$ */
/*
PE32+ header file
*/
#ifndef _PE_H
#define _PE_H
#define IMAGE_DOS_SIGNATURE 0x5A4D // MZ
#define IMAGE_OS2_SIGNATURE 0x454E // NE
#define IMAGE_OS2_SIGNATURE_LE 0x454C // LE
#define IMAGE_NT_SIGNATURE 0x00004550 // PE00
#define IMAGE_EDOS_SIGNATURE 0x44454550 // PEED
typedef struct _IMAGE_DOS_HEADER { // DOS .EXE header
UINT16 e_magic; // Magic number
UINT16 e_cblp; // Bytes on last page of file
UINT16 e_cp; // Pages in file
UINT16 e_crlc; // Relocations
UINT16 e_cparhdr; // Size of header in paragraphs
UINT16 e_minalloc; // Minimum extra paragraphs needed
UINT16 e_maxalloc; // Maximum extra paragraphs needed
UINT16 e_ss; // Initial (relative) SS value
UINT16 e_sp; // Initial SP value
UINT16 e_csum; // Checksum
UINT16 e_ip; // Initial IP value
UINT16 e_cs; // Initial (relative) CS value
UINT16 e_lfarlc; // File address of relocation table
UINT16 e_ovno; // Overlay number
UINT16 e_res[4]; // Reserved words
UINT16 e_oemid; // OEM identifier (for e_oeminfo)
UINT16 e_oeminfo; // OEM information; e_oemid specific
UINT16 e_res2[10]; // Reserved words
UINT32 e_lfanew; // File address of new exe header
} IMAGE_DOS_HEADER, *PIMAGE_DOS_HEADER;
typedef struct _IMAGE_OS2_HEADER { // OS/2 .EXE header
UINT16 ne_magic; // Magic number
UINT8 ne_ver; // Version number
UINT8 ne_rev; // Revision number
UINT16 ne_enttab; // Offset of Entry Table
UINT16 ne_cbenttab; // Number of bytes in Entry Table
UINT32 ne_crc; // Checksum of whole file
UINT16 ne_flags; // Flag UINT16
UINT16 ne_autodata; // Automatic data segment number
UINT16 ne_heap; // Initial heap allocation
UINT16 ne_stack; // Initial stack allocation
UINT32 ne_csip; // Initial CS:IP setting
UINT32 ne_sssp; // Initial SS:SP setting
UINT16 ne_cseg; // Count of file segments
UINT16 ne_cmod; // Entries in Module Reference Table
UINT16 ne_cbnrestab; // Size of non-resident name table
UINT16 ne_segtab; // Offset of Segment Table
UINT16 ne_rsrctab; // Offset of Resource Table
UINT16 ne_restab; // Offset of resident name table
UINT16 ne_modtab; // Offset of Module Reference Table
UINT16 ne_imptab; // Offset of Imported Names Table
UINT32 ne_nrestab; // Offset of Non-resident Names Table
UINT16 ne_cmovent; // Count of movable entries
UINT16 ne_align; // Segment alignment shift count
UINT16 ne_cres; // Count of resource segments
UINT8 ne_exetyp; // Target Operating system
UINT8 ne_flagsothers; // Other .EXE flags
UINT16 ne_pretthunks; // offset to return thunks
UINT16 ne_psegrefbytes; // offset to segment ref. bytes
UINT16 ne_swaparea; // Minimum code swap area size
UINT16 ne_expver; // Expected Windows version number
} IMAGE_OS2_HEADER, *PIMAGE_OS2_HEADER;
//
// File header format.
//
typedef struct _IMAGE_FILE_HEADER {
UINT16 Machine;
UINT16 NumberOfSections;
UINT32 TimeDateStamp;
UINT32 PointerToSymbolTable;
UINT32 NumberOfSymbols;
UINT16 SizeOfOptionalHeader;
UINT16 Characteristics;
} IMAGE_FILE_HEADER, *PIMAGE_FILE_HEADER;
#define IMAGE_SIZEOF_FILE_HEADER 20
#define IMAGE_FILE_RELOCS_STRIPPED 0x0001 // Relocation info stripped from file.
#define IMAGE_FILE_EXECUTABLE_IMAGE 0x0002 // File is executable (i.e. no unresolved externel references).
#define IMAGE_FILE_LINE_NUMS_STRIPPED 0x0004 // Line nunbers stripped from file.
#define IMAGE_FILE_LOCAL_SYMS_STRIPPED 0x0008 // Local symbols stripped from file.
#define IMAGE_FILE_BYTES_REVERSED_LO 0x0080 // Bytes of machine word are reversed.
#define IMAGE_FILE_32BIT_MACHINE 0x0100 // 32 bit word machine.
#define IMAGE_FILE_DEBUG_STRIPPED 0x0200 // Debugging info stripped from file in .DBG file
#define IMAGE_FILE_SYSTEM 0x1000 // System File.
#define IMAGE_FILE_DLL 0x2000 // File is a DLL.
#define IMAGE_FILE_BYTES_REVERSED_HI 0x8000 // Bytes of machine word are reversed.
#define IMAGE_FILE_MACHINE_UNKNOWN 0
#define IMAGE_FILE_MACHINE_I386 0x14c // Intel 386.
#define IMAGE_FILE_MACHINE_R3000 0x162 // MIPS little-endian, 0540 big-endian
#define IMAGE_FILE_MACHINE_R4000 0x166 // MIPS little-endian
#define IMAGE_FILE_MACHINE_ALPHA 0x184 // Alpha_AXP
#define IMAGE_FILE_MACHINE_POWERPC 0x1F0 // IBM PowerPC Little-Endian
#define IMAGE_FILE_MACHINE_TAHOE 0x7cc // Intel EM machine
//
// Directory format.
//
typedef struct _IMAGE_DATA_DIRECTORY {
UINT32 VirtualAddress;
UINT32 Size;
} IMAGE_DATA_DIRECTORY, *PIMAGE_DATA_DIRECTORY;
#define IMAGE_NUMBEROF_DIRECTORY_ENTRIES 16
//
// Optional header format.
//
typedef struct _IMAGE_OPTIONAL_HEADER {
//
// Standard fields.
//
UINT16 Magic;
UINT8 MajorLinkerVersion;
UINT8 MinorLinkerVersion;
UINT32 SizeOfCode;
UINT32 SizeOfInitializedData;
UINT32 SizeOfUninitializedData;
UINT32 AddressOfEntryPoint;
UINT32 BaseOfCode;
UINT32 BaseOfData;
//
// NT additional fields.
//
UINT32 ImageBase;
UINT32 SectionAlignment;
UINT32 FileAlignment;
UINT16 MajorOperatingSystemVersion;
UINT16 MinorOperatingSystemVersion;
UINT16 MajorImageVersion;
UINT16 MinorImageVersion;
UINT16 MajorSubsystemVersion;
UINT16 MinorSubsystemVersion;
UINT32 Reserved1;
UINT32 SizeOfImage;
UINT32 SizeOfHeaders;
UINT32 CheckSum;
UINT16 Subsystem;
UINT16 DllCharacteristics;
UINT32 SizeOfStackReserve;
UINT32 SizeOfStackCommit;
UINT32 SizeOfHeapReserve;
UINT32 SizeOfHeapCommit;
UINT32 LoaderFlags;
UINT32 NumberOfRvaAndSizes;
IMAGE_DATA_DIRECTORY DataDirectory[IMAGE_NUMBEROF_DIRECTORY_ENTRIES];
} IMAGE_OPTIONAL_HEADER, *PIMAGE_OPTIONAL_HEADER;
typedef struct _IMAGE_ROM_OPTIONAL_HEADER {
UINT16 Magic;
UINT8 MajorLinkerVersion;
UINT8 MinorLinkerVersion;
UINT32 SizeOfCode;
UINT32 SizeOfInitializedData;
UINT32 SizeOfUninitializedData;
UINT32 AddressOfEntryPoint;
UINT32 BaseOfCode;
UINT32 BaseOfData;
UINT32 BaseOfBss;
UINT32 GprMask;
UINT32 CprMask[4];
UINT32 GpValue;
} IMAGE_ROM_OPTIONAL_HEADER, *PIMAGE_ROM_OPTIONAL_HEADER;
#define IMAGE_SIZEOF_ROM_OPTIONAL_HEADER 56
#define IMAGE_SIZEOF_STD_OPTIONAL_HEADER 28
#define IMAGE_SIZEOF_NT_OPTIONAL_HEADER 224
#define IMAGE_NT_OPTIONAL_HDR_MAGIC 0x10b
#define IMAGE_ROM_OPTIONAL_HDR_MAGIC 0x107
typedef struct _IMAGE_NT_HEADERS {
UINT32 Signature;
IMAGE_FILE_HEADER FileHeader;
IMAGE_OPTIONAL_HEADER OptionalHeader;
} IMAGE_NT_HEADERS, *PIMAGE_NT_HEADERS;
typedef struct _IMAGE_ROM_HEADERS {
IMAGE_FILE_HEADER FileHeader;
IMAGE_ROM_OPTIONAL_HEADER OptionalHeader;
} IMAGE_ROM_HEADERS, *PIMAGE_ROM_HEADERS;
#define IMAGE_FIRST_SECTION( ntheader ) ((PIMAGE_SECTION_HEADER) \
((UINT32)ntheader + \
FIELD_OFFSET( IMAGE_NT_HEADERS, OptionalHeader ) + \
((PIMAGE_NT_HEADERS)(ntheader))->FileHeader.SizeOfOptionalHeader \
))
// Subsystem Values
#define IMAGE_SUBSYSTEM_UNKNOWN 0 // Unknown subsystem.
#define IMAGE_SUBSYSTEM_NATIVE 1 // Image doesn't require a subsystem.
#define IMAGE_SUBSYSTEM_WINDOWS_GUI 2 // Image runs in the Windows GUI subsystem.
#define IMAGE_SUBSYSTEM_WINDOWS_CUI 3 // Image runs in the Windows character subsystem.
#define IMAGE_SUBSYSTEM_OS2_CUI 5 // image runs in the OS/2 character subsystem.
#define IMAGE_SUBSYSTEM_POSIX_CUI 7 // image run in the Posix character subsystem.
// Directory Entries
#define IMAGE_DIRECTORY_ENTRY_EXPORT 0 // Export Directory
#define IMAGE_DIRECTORY_ENTRY_IMPORT 1 // Import Directory
#define IMAGE_DIRECTORY_ENTRY_RESOURCE 2 // Resource Directory
#define IMAGE_DIRECTORY_ENTRY_EXCEPTION 3 // Exception Directory
#define IMAGE_DIRECTORY_ENTRY_SECURITY 4 // Security Directory
#define IMAGE_DIRECTORY_ENTRY_BASERELOC 5 // Base Relocation Table
#define IMAGE_DIRECTORY_ENTRY_DEBUG 6 // Debug Directory
#define IMAGE_DIRECTORY_ENTRY_COPYRIGHT 7 // Description String
#define IMAGE_DIRECTORY_ENTRY_GLOBALPTR 8 // Machine Value (MIPS GP)
#define IMAGE_DIRECTORY_ENTRY_TLS 9 // TLS Directory
#define IMAGE_DIRECTORY_ENTRY_LOAD_CONFIG 10 // Load Configuration Directory
//
// Section header format.
//
#define IMAGE_SIZEOF_SHORT_NAME 8
typedef struct _IMAGE_SECTION_HEADER {
UINT8 Name[IMAGE_SIZEOF_SHORT_NAME];
union {
UINT32 PhysicalAddress;
UINT32 VirtualSize;
} Misc;
UINT32 VirtualAddress;
UINT32 SizeOfRawData;
UINT32 PointerToRawData;
UINT32 PointerToRelocations;
UINT32 PointerToLinenumbers;
UINT16 NumberOfRelocations;
UINT16 NumberOfLinenumbers;
UINT32 Characteristics;
} IMAGE_SECTION_HEADER, *PIMAGE_SECTION_HEADER;
#define IMAGE_SIZEOF_SECTION_HEADER 40
#define IMAGE_SCN_TYPE_NO_PAD 0x00000008 // Reserved.
#define IMAGE_SCN_CNT_CODE 0x00000020 // Section contains code.
#define IMAGE_SCN_CNT_INITIALIZED_DATA 0x00000040 // Section contains initialized data.
#define IMAGE_SCN_CNT_UNINITIALIZED_DATA 0x00000080 // Section contains uninitialized data.
#define IMAGE_SCN_LNK_OTHER 0x00000100 // Reserved.
#define IMAGE_SCN_LNK_INFO 0x00000200 // Section contains comments or some other type of information.
#define IMAGE_SCN_LNK_REMOVE 0x00000800 // Section contents will not become part of image.
#define IMAGE_SCN_LNK_COMDAT 0x00001000 // Section contents comdat.
#define IMAGE_SCN_ALIGN_1BYTES 0x00100000 //
#define IMAGE_SCN_ALIGN_2BYTES 0x00200000 //
#define IMAGE_SCN_ALIGN_4BYTES 0x00300000 //
#define IMAGE_SCN_ALIGN_8BYTES 0x00400000 //
#define IMAGE_SCN_ALIGN_16BYTES 0x00500000 // Default alignment if no others are specified.
#define IMAGE_SCN_ALIGN_32BYTES 0x00600000 //
#define IMAGE_SCN_ALIGN_64BYTES 0x00700000 //
#define IMAGE_SCN_MEM_DISCARDABLE 0x02000000 // Section can be discarded.
#define IMAGE_SCN_MEM_NOT_CACHED 0x04000000 // Section is not cachable.
#define IMAGE_SCN_MEM_NOT_PAGED 0x08000000 // Section is not pageable.
#define IMAGE_SCN_MEM_SHARED 0x10000000 // Section is shareable.
#define IMAGE_SCN_MEM_EXECUTE 0x20000000 // Section is executable.
#define IMAGE_SCN_MEM_READ 0x40000000 // Section is readable.
#define IMAGE_SCN_MEM_WRITE 0x80000000 // Section is writeable.
//
// Symbol format.
//
#define IMAGE_SIZEOF_SYMBOL 18
//
// Section values.
//
// Symbols have a section number of the section in which they are
// defined. Otherwise, section numbers have the following meanings:
//
#define IMAGE_SYM_UNDEFINED (UINT16)0 // Symbol is undefined or is common.
#define IMAGE_SYM_ABSOLUTE (UINT16)-1 // Symbol is an absolute value.
#define IMAGE_SYM_DEBUG (UINT16)-2 // Symbol is a special debug item.
//
// Type (fundamental) values.
//
#define IMAGE_SYM_TYPE_NULL 0 // no type.
#define IMAGE_SYM_TYPE_VOID 1 //
#define IMAGE_SYM_TYPE_CHAR 2 // type character.
#define IMAGE_SYM_TYPE_SHORT 3 // type short integer.
#define IMAGE_SYM_TYPE_INT 4 //
#define IMAGE_SYM_TYPE_LONG 5 //
#define IMAGE_SYM_TYPE_FLOAT 6 //
#define IMAGE_SYM_TYPE_DOUBLE 7 //
#define IMAGE_SYM_TYPE_STRUCT 8 //
#define IMAGE_SYM_TYPE_UNION 9 //
#define IMAGE_SYM_TYPE_ENUM 10 // enumeration.
#define IMAGE_SYM_TYPE_MOE 11 // member of enumeration.
#define IMAGE_SYM_TYPE_BYTE 12 //
#define IMAGE_SYM_TYPE_WORD 13 //
#define IMAGE_SYM_TYPE_UINT 14 //
#define IMAGE_SYM_TYPE_DWORD 15 //
//
// Type (derived) values.
//
#define IMAGE_SYM_DTYPE_NULL 0 // no derived type.
#define IMAGE_SYM_DTYPE_POINTER 1 // pointer.
#define IMAGE_SYM_DTYPE_FUNCTION 2 // function.
#define IMAGE_SYM_DTYPE_ARRAY 3 // array.
//
// Storage classes.
//
#define IMAGE_SYM_CLASS_END_OF_FUNCTION (BYTE )-1
#define IMAGE_SYM_CLASS_NULL 0
#define IMAGE_SYM_CLASS_AUTOMATIC 1
#define IMAGE_SYM_CLASS_EXTERNAL 2
#define IMAGE_SYM_CLASS_STATIC 3
#define IMAGE_SYM_CLASS_REGISTER 4
#define IMAGE_SYM_CLASS_EXTERNAL_DEF 5
#define IMAGE_SYM_CLASS_LABEL 6
#define IMAGE_SYM_CLASS_UNDEFINED_LABEL 7
#define IMAGE_SYM_CLASS_MEMBER_OF_STRUCT 8
#define IMAGE_SYM_CLASS_ARGUMENT 9
#define IMAGE_SYM_CLASS_STRUCT_TAG 10
#define IMAGE_SYM_CLASS_MEMBER_OF_UNION 11
#define IMAGE_SYM_CLASS_UNION_TAG 12
#define IMAGE_SYM_CLASS_TYPE_DEFINITION 13
#define IMAGE_SYM_CLASS_UNDEFINED_STATIC 14
#define IMAGE_SYM_CLASS_ENUM_TAG 15
#define IMAGE_SYM_CLASS_MEMBER_OF_ENUM 16
#define IMAGE_SYM_CLASS_REGISTER_PARAM 17
#define IMAGE_SYM_CLASS_BIT_FIELD 18
#define IMAGE_SYM_CLASS_BLOCK 100
#define IMAGE_SYM_CLASS_FUNCTION 101
#define IMAGE_SYM_CLASS_END_OF_STRUCT 102
#define IMAGE_SYM_CLASS_FILE 103
// new
#define IMAGE_SYM_CLASS_SECTION 104
#define IMAGE_SYM_CLASS_WEAK_EXTERNAL 105
// type packing constants
#define N_BTMASK 017
#define N_TMASK 060
#define N_TMASK1 0300
#define N_TMASK2 0360
#define N_BTSHFT 4
#define N_TSHIFT 2
// MACROS
//
// Communal selection types.
//
#define IMAGE_COMDAT_SELECT_NODUPLICATES 1
#define IMAGE_COMDAT_SELECT_ANY 2
#define IMAGE_COMDAT_SELECT_SAME_SIZE 3
#define IMAGE_COMDAT_SELECT_EXACT_MATCH 4
#define IMAGE_COMDAT_SELECT_ASSOCIATIVE 5
#define IMAGE_WEAK_EXTERN_SEARCH_NOLIBRARY 1
#define IMAGE_WEAK_EXTERN_SEARCH_LIBRARY 2
#define IMAGE_WEAK_EXTERN_SEARCH_ALIAS 3
//
// Relocation format.
//
typedef struct _IMAGE_RELOCATION {
UINT32 VirtualAddress;
UINT32 SymbolTableIndex;
UINT16 Type;
} IMAGE_RELOCATION;
#define IMAGE_SIZEOF_RELOCATION 10
//
// I386 relocation types.
//
#define IMAGE_REL_I386_ABSOLUTE 0 // Reference is absolute, no relocation is necessary
#define IMAGE_REL_I386_DIR16 01 // Direct 16-bit reference to the symbols virtual address
#define IMAGE_REL_I386_REL16 02 // PC-relative 16-bit reference to the symbols virtual address
#define IMAGE_REL_I386_DIR32 06 // Direct 32-bit reference to the symbols virtual address
#define IMAGE_REL_I386_DIR32NB 07 // Direct 32-bit reference to the symbols virtual address, base not included
#define IMAGE_REL_I386_SEG12 011 // Direct 16-bit reference to the segment-selector bits of a 32-bit virtual address
#define IMAGE_REL_I386_SECTION 012
#define IMAGE_REL_I386_SECREL 013
#define IMAGE_REL_I386_REL32 024 // PC-relative 32-bit reference to the symbols virtual address
//
// MIPS relocation types.
//
#define IMAGE_REL_MIPS_ABSOLUTE 0 // Reference is absolute, no relocation is necessary
#define IMAGE_REL_MIPS_REFHALF 01
#define IMAGE_REL_MIPS_REFWORD 02
#define IMAGE_REL_MIPS_JMPADDR 03
#define IMAGE_REL_MIPS_REFHI 04
#define IMAGE_REL_MIPS_REFLO 05
#define IMAGE_REL_MIPS_GPREL 06
#define IMAGE_REL_MIPS_LITERAL 07
#define IMAGE_REL_MIPS_SECTION 012
#define IMAGE_REL_MIPS_SECREL 013
#define IMAGE_REL_MIPS_REFWORDNB 042
#define IMAGE_REL_MIPS_PAIR 045
//
// Alpha Relocation types.
//
#define IMAGE_REL_ALPHA_ABSOLUTE 0x0
#define IMAGE_REL_ALPHA_REFLONG 0x1
#define IMAGE_REL_ALPHA_REFQUAD 0x2
#define IMAGE_REL_ALPHA_GPREL32 0x3
#define IMAGE_REL_ALPHA_LITERAL 0x4
#define IMAGE_REL_ALPHA_LITUSE 0x5
#define IMAGE_REL_ALPHA_GPDISP 0x6
#define IMAGE_REL_ALPHA_BRADDR 0x7
#define IMAGE_REL_ALPHA_HINT 0x8
#define IMAGE_REL_ALPHA_INLINE_REFLONG 0x9
#define IMAGE_REL_ALPHA_REFHI 0xA
#define IMAGE_REL_ALPHA_REFLO 0xB
#define IMAGE_REL_ALPHA_PAIR 0xC
#define IMAGE_REL_ALPHA_MATCH 0xD
#define IMAGE_REL_ALPHA_SECTION 0xE
#define IMAGE_REL_ALPHA_SECREL 0xF
#define IMAGE_REL_ALPHA_REFLONGNB 0x10
//
// IBM PowerPC relocation types.
//
#define IMAGE_REL_PPC_ABSOLUTE 0x0000 // NOP
#define IMAGE_REL_PPC_ADDR64 0x0001 // 64-bit address
#define IMAGE_REL_PPC_ADDR32 0x0002 // 32-bit address
#define IMAGE_REL_PPC_ADDR24 0x0003 // 26-bit address, shifted left 2 (branch absolute)
#define IMAGE_REL_PPC_ADDR16 0x0004 // 16-bit address
#define IMAGE_REL_PPC_ADDR14 0x0005 // 16-bit address, shifted left 2 (load doubleword)
#define IMAGE_REL_PPC_REL24 0x0006 // 26-bit PC-relative offset, shifted left 2 (branch relative)
#define IMAGE_REL_PPC_REL14 0x0007 // 16-bit PC-relative offset, shifted left 2 (br cond relative)
#define IMAGE_REL_PPC_TOCREL16 0x0008 // 16-bit offset from TOC base
#define IMAGE_REL_PPC_TOCREL14 0x0009 // 16-bit offset from TOC base, shifted left 2 (load doubleword)
#define IMAGE_REL_PPC_ADDR32NB 0x000A // 32-bit addr w/o image base
#define IMAGE_REL_PPC_SECREL 0x000B // va of containing section (as in an image sectionhdr)
#define IMAGE_REL_PPC_SECTION 0x000C // sectionheader number
#define IMAGE_REL_PPC_IFGLUE 0x000D // substitute TOC restore instruction iff symbol is glue code
#define IMAGE_REL_PPC_IMGLUE 0x000E // symbol is glue code; virtual address is TOC restore instruction
#define IMAGE_REL_PPC_TYPEMASK 0x00FF // mask to isolate above values in IMAGE_RELOCATION.Type
// Flag bits in IMAGE_RELOCATION.TYPE
#define IMAGE_REL_PPC_NEG 0x0100 // subtract reloc value rather than adding it
#define IMAGE_REL_PPC_BRTAKEN 0x0200 // fix branch prediction bit to predict branch taken
#define IMAGE_REL_PPC_BRNTAKEN 0x0400 // fix branch prediction bit to predict branch not taken
#define IMAGE_REL_PPC_TOCDEFN 0x0800 // toc slot defined in file (or, data in toc)
//
// Based relocation format.
//
typedef struct _IMAGE_BASE_RELOCATION {
UINT32 VirtualAddress;
UINT32 SizeOfBlock;
// UINT16 TypeOffset[1];
} IMAGE_BASE_RELOCATION, *PIMAGE_BASE_RELOCATION;
#define IMAGE_SIZEOF_BASE_RELOCATION 8
//
// Based relocation types.
//
#define IMAGE_REL_BASED_ABSOLUTE 0
#define IMAGE_REL_BASED_HIGH 1
#define IMAGE_REL_BASED_LOW 2
#define IMAGE_REL_BASED_HIGHLOW 3
#define IMAGE_REL_BASED_HIGHADJ 4
#define IMAGE_REL_BASED_MIPS_JMPADDR 5
#define IMAGE_REL_BASED_DIR64 10
//
// Line number format.
//
typedef struct _IMAGE_LINENUMBER {
union {
UINT32 SymbolTableIndex; // Symbol table index of function name if Linenumber is 0.
UINT32 VirtualAddress; // Virtual address of line number.
} Type;
UINT16 Linenumber; // Line number.
} IMAGE_LINENUMBER;
#define IMAGE_SIZEOF_LINENUMBER 6
//
// Archive format.
//
#define IMAGE_ARCHIVE_START_SIZE 8
#define IMAGE_ARCHIVE_START "!<arch>\n"
#define IMAGE_ARCHIVE_END "`\n"
#define IMAGE_ARCHIVE_PAD "\n"
#define IMAGE_ARCHIVE_LINKER_MEMBER "/ "
#define IMAGE_ARCHIVE_LONGNAMES_MEMBER "// "
typedef struct _IMAGE_ARCHIVE_MEMBER_HEADER {
UINT8 Name[16]; // File member name - `/' terminated.
UINT8 Date[12]; // File member date - decimal.
UINT8 UserID[6]; // File member user id - decimal.
UINT8 GroupID[6]; // File member group id - decimal.
UINT8 Mode[8]; // File member mode - octal.
UINT8 Size[10]; // File member size - decimal.
UINT8 EndHeader[2]; // String to end header.
} IMAGE_ARCHIVE_MEMBER_HEADER, *PIMAGE_ARCHIVE_MEMBER_HEADER;
#define IMAGE_SIZEOF_ARCHIVE_MEMBER_HDR 60
//
// DLL support.
//
//
// Export Format
//
typedef struct _IMAGE_EXPORT_DIRECTORY {
UINT32 Characteristics;
UINT32 TimeDateStamp;
UINT16 MajorVersion;
UINT16 MinorVersion;
UINT32 Name;
UINT32 Base;
UINT32 NumberOfFunctions;
UINT32 NumberOfNames;
UINT32 *AddressOfFunctions;
UINT32 *AddressOfNames;
UINT32 *AddressOfNameOrdinals;
} IMAGE_EXPORT_DIRECTORY, *PIMAGE_EXPORT_DIRECTORY;
//
// Import Format
//
typedef struct _IMAGE_IMPORT_BY_NAME {
UINT16 Hint;
UINT8 Name[1];
} IMAGE_IMPORT_BY_NAME, *PIMAGE_IMPORT_BY_NAME;
typedef struct _IMAGE_THUNK_DATA {
union {
UINT32 Function;
UINT32 Ordinal;
PIMAGE_IMPORT_BY_NAME AddressOfData;
} u1;
} IMAGE_THUNK_DATA, *PIMAGE_THUNK_DATA;
#define IMAGE_ORDINAL_FLAG 0x80000000
#define IMAGE_SNAP_BY_ORDINAL(Ordinal) ((Ordinal & IMAGE_ORDINAL_FLAG) != 0)
#define IMAGE_ORDINAL(Ordinal) (Ordinal & 0xffff)
typedef struct _IMAGE_IMPORT_DESCRIPTOR {
UINT32 Characteristics;
UINT32 TimeDateStamp;
UINT32 ForwarderChain;
UINT32 Name;
PIMAGE_THUNK_DATA FirstThunk;
} IMAGE_IMPORT_DESCRIPTOR, *PIMAGE_IMPORT_DESCRIPTOR;
#define IMAGE_DEBUG_TYPE_CODEVIEW 2
typedef struct {
UINT32 Characteristics;
UINT32 TimeDateStamp;
UINT16 MajorVersion;
UINT16 MinorVersion;
UINT32 Type;
UINT32 SizeOfData;
UINT32 RVA;
UINT32 FileOffset;
} IMAGE_DEBUG_DIRECTORY_ENTRY;
#define CODEVIEW_SIGNATURE_NB10 0x3031424E // "NB10"
typedef struct {
UINT32 Signature; // "NB10"
UINT32 Unknown;
UINT32 Unknown2;
UINT32 Unknown3;
//
// Filename of .PDB goes here
//
} EFI_IMAGE_DEBUG_CODEVIEW_NB10_ENTRY;
#define CODEVIEW_SIGNATURE_RSDS 0x53445352 // "RSDS"
typedef struct {
UINT32 Signature; // "RSDS"
UINT32 Unknown;
UINT32 Unknown2;
UINT32 Unknown3;
UINT32 Unknown4;
UINT32 Unknown5;
//
// Filename of .PDB goes here
//
} EFI_IMAGE_DEBUG_CODEVIEW_RSDS_ENTRY;
#endif
diff --git a/stand/efi/include/riscv/efibind.h b/stand/efi/include/riscv/efibind.h
index 4751e2e944a8..4fdfd9f21386 100644
--- a/stand/efi/include/riscv/efibind.h
+++ b/stand/efi/include/riscv/efibind.h
@@ -1,217 +1,216 @@
-/* $FreeBSD$ */
/*++
Copyright (c) 1999 - 2003 Intel Corporation. All rights reserved
This software and associated documentation (if any) is furnished
under a license and may only be used or copied in accordance
with the terms of the license. Except as permitted by such
license, no part of this software or documentation may be
reproduced, stored in a retrieval system, or transmitted in any
form or by any means without the express written consent of
Intel Corporation.
Module Name:
efefind.h
Abstract:
EFI to compile bindings
Revision History
--*/
#pragma pack()
#ifdef __FreeBSD__
#include <sys/stdint.h>
#else
//
// Basic int types of various widths
//
#if (__STDC_VERSION__ < 199901L )
// No ANSI C 1999/2000 stdint.h integer width declarations
#ifdef _MSC_EXTENSIONS
// Use Microsoft C compiler integer width declarations
typedef unsigned __int64 uint64_t;
typedef __int64 int64_t;
typedef unsigned __int32 uint32_t;
typedef __int32 int32_t;
typedef unsigned __int16 uint16_t;
typedef __int16 int16_t;
typedef unsigned __int8 uint8_t;
typedef __int8 int8_t;
#else
#ifdef UNIX_LP64
// Use LP64 programming model from C_FLAGS for integer width declarations
typedef unsigned long uint64_t;
typedef long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#else
// Assume P64 programming model from C_FLAGS for integer width declarations
typedef unsigned long long uint64_t;
typedef long long int64_t;
typedef unsigned int uint32_t;
typedef int int32_t;
typedef unsigned short uint16_t;
typedef short int16_t;
typedef unsigned char uint8_t;
typedef char int8_t;
#endif
#endif
#endif
#endif /* __FreeBSD__ */
//
// Basic EFI types of various widths
//
typedef uint64_t UINT64;
typedef int64_t INT64;
typedef uint32_t UINT32;
typedef int32_t INT32;
typedef uint16_t UINT16;
typedef int16_t INT16;
typedef uint8_t UINT8;
typedef int8_t INT8;
#undef VOID
#define VOID void
typedef int64_t INTN;
typedef uint64_t UINTN;
//++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
// BugBug: Code to debug
//
#define BIT63 0x8000000000000000
#define PLATFORM_IOBASE_ADDRESS (0xffffc000000 | BIT63)
#define PORT_TO_MEMD(_Port) (PLATFORM_IOBASE_ADDRESS | ( ( ( (_Port) & 0xfffc) << 10 ) | ( (_Port) & 0x0fff) ) )
//
// Macro's with casts make this much easier to use and read.
//
#define PORT_TO_MEM8D(_Port) (*(UINT8 *)(PORT_TO_MEMD(_Port)))
#define POST_CODE(_Data) (PORT_TO_MEM8D(0x80) = (_Data))
//
// BugBug: End Debug Code!!!
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
#define EFIERR(a) (0x8000000000000000 | a)
#define EFI_ERROR_MASK 0x8000000000000000
#define EFIERR_OEM(a) (0xc000000000000000 | a)
#define BAD_POINTER 0xFBFBFBFBFBFBFBFB
#define MAX_ADDRESS 0xFFFFFFFFFFFFFFFF
#define BREAKPOINT() __break(0)
//
// Pointers must be aligned to these address to function
// you will get an alignment fault if this value is less than 8
//
#define MIN_ALIGNMENT_SIZE 8
#define ALIGN_VARIABLE(Value , Adjustment) \
(UINTN) Adjustment = 0; \
if((UINTN)Value % MIN_ALIGNMENT_SIZE) \
(UINTN)Adjustment = MIN_ALIGNMENT_SIZE - ((UINTN)Value % MIN_ALIGNMENT_SIZE); \
Value = (UINTN)Value + (UINTN)Adjustment
//
// Define macros to create data structure signatures.
//
#define EFI_SIGNATURE_16(A,B) ((A) | (B<<8))
#define EFI_SIGNATURE_32(A,B,C,D) (EFI_SIGNATURE_16(A,B) | (EFI_SIGNATURE_16(C,D) << 16))
#define EFI_SIGNATURE_64(A,B,C,D,E,F,G,H) (EFI_SIGNATURE_32(A,B,C,D) | ((UINT64)(EFI_SIGNATURE_32(E,F,G,H)) << 32))
//
// EFIAPI - prototype calling convention for EFI function pointers
// BOOTSERVICE - prototype for implementation of a boot service interface
// RUNTIMESERVICE - prototype for implementation of a runtime service interface
// RUNTIMEFUNCTION - prototype for implementation of a runtime function that is not a service
// RUNTIME_CODE - pragma macro for declaring runtime code
//
#ifndef EFIAPI // Forces EFI calling conventions reguardless of compiler options
#ifdef _MSC_EXTENSIONS
#define EFIAPI __cdecl // Force C calling convention for Microsoft C compiler
#else
#define EFIAPI // Substitute expresion to force C calling convention
#endif
#endif
#define BOOTSERVICE
#define RUNTIMESERVICE
#define RUNTIMEFUNCTION
#define RUNTIME_CODE(a) alloc_text("rtcode", a)
#define BEGIN_RUNTIME_DATA() data_seg("rtdata")
#define END_RUNTIME_DATA() data_seg()
#define VOLATILE volatile
//
// BugBug: Need to find out if this is portable across compilers.
//
void __mfa (void);
#define MEMORY_FENCE() __mfa()
#ifdef EFI_NO_INTERFACE_DECL
#define EFI_FORWARD_DECLARATION(x)
#define EFI_INTERFACE_DECL(x)
#else
#define EFI_FORWARD_DECLARATION(x) typedef struct _##x x
#define EFI_INTERFACE_DECL(x) typedef struct x
#endif
//
// When build similar to FW, then link everything together as
// one big module.
//
#define EFI_DRIVER_ENTRY_POINT(InitFunction)
#define LOAD_INTERNAL_DRIVER(_if, type, name, entry) \
(_if)->LoadInternal(type, name, entry)
// entry(NULL, ST)
#ifdef __FreeBSD__
#define INTERFACE_DECL(x) struct x
#else
//
// Some compilers don't support the forward reference construct:
// typedef struct XXXXX
//
// The following macro provide a workaround for such cases.
//
#ifdef NO_INTERFACE_DECL
#define INTERFACE_DECL(x)
#else
#define INTERFACE_DECL(x) typedef struct x
#endif
#endif
diff --git a/stand/efi/loader/arch/amd64/ldscript.amd64 b/stand/efi/loader/arch/amd64/ldscript.amd64
index 874df9b08f9e..57014aefc025 100644
--- a/stand/efi/loader/arch/amd64/ldscript.amd64
+++ b/stand/efi/loader/arch/amd64/ldscript.amd64
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf64-x86-64-freebsd", "elf64-x86-64-freebsd", "elf64-x86-64-freebsd")
OUTPUT_ARCH(i386:x86-64)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0;
ImageBase = .;
.hash : { *(.hash) } /* this MUST come first! */
. = ALIGN(4096);
.eh_frame :
{
*(.eh_frame)
}
. = ALIGN(4096);
.text : {
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.plt)
} =0xCCCCCCCC
. = ALIGN(4096);
.data : {
*(.rodata .rodata.* .gnu.linkonce.r.*)
*(.rodata1)
*(.sdata2 .sdata2.* .gnu.linkonce.s2.*)
*(.sbss2 .sbss2.* .gnu.linkonce.sb2.*)
*(.opd)
*(.data .data.* .gnu.linkonce.d.*)
*(.data1)
*(.plabel)
*(.dynbss)
*(.bss .bss.* .gnu.linkonce.b.*)
*(COMMON)
}
. = ALIGN(4096);
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
. = ALIGN(4096);
__gp = .;
.sdata : {
*(.got.plt .got)
*(.sdata .sdata.* .gnu.linkonce.s.*)
*(dynsbss)
*(.sbss .sbss.* .gnu.linkonce.sb.*)
*(.scommon)
}
. = ALIGN(4096);
.dynamic : { *(.dynamic) }
. = ALIGN(4096);
.rela.dyn : {
*(.rela.data*)
*(.rela.got)
*(.rela.stab)
*(.relaset_*)
}
. = ALIGN(4096);
.reloc : { *(.reloc) }
. = ALIGN(4096);
.dynsym : { *(.dynsym) }
. = ALIGN(4096);
.dynstr : { *(.dynstr) }
}
diff --git a/stand/efi/loader/arch/arm/ldscript.arm b/stand/efi/loader/arch/arm/ldscript.arm
index 68775a88a9cd..13affe12bbba 100644
--- a/stand/efi/loader/arch/arm/ldscript.arm
+++ b/stand/efi/loader/arch/arm/ldscript.arm
@@ -1,67 +1,66 @@
-/* $FreeBSD$ */
OUTPUT_ARCH(arm)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0;
ImageBase = .;
.text : {
*(.peheader)
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.gnu.linkonce.t*)
} =0
_etext = .;
PROVIDE (etext = .);
. = ALIGN(16);
.data :
{
*(.data .data.*)
*(.gnu.linkonce.d*)
*(.rodata)
*(.rodata.*)
CONSTRUCTORS
. = ALIGN(4);
PROVIDE (__bss_start = .);
*(.sbss)
*(.scommon)
*(.dynsbss)
*(.dynbss)
*(.bss)
*(COMMON)
. = ALIGN(4);
PROVIDE (__bss_end = .);
}
.dynamic : { *(.dynamic) }
/* We want the small data sections together, so single-instruction offsets
can access them all, and initialized data all before uninitialized, so
we can shorten the on-disk segment size. */
.sdata : {
*(.got.plt .got)
*(.sdata*.sdata.* .gnu.linkonce.s.*)
}
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
__gp = .;
.plt : { *(.plt) }
.reloc : { *(.reloc) }
.dynsym : { *(.dynsym) }
.dynstr : { *(.dynstr) }
.rel.dyn : {
*(.rel.*)
*(.relset_*)
}
_edata = .;
.hash : { *(.hash) }
}
diff --git a/stand/efi/loader/arch/arm64/ldscript.arm64 b/stand/efi/loader/arch/arm64/ldscript.arm64
index c10448f4180e..bacb81b5032f 100644
--- a/stand/efi/loader/arch/arm64/ldscript.arm64
+++ b/stand/efi/loader/arch/arm64/ldscript.arm64
@@ -1,89 +1,88 @@
-/* $FreeBSD$ */
/*
OUTPUT_FORMAT("elf64-aarch64-freebsd", "elf64-aarch64-freebsd", "elf64-aarch64-freebsd")
*/
OUTPUT_ARCH(aarch64)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0;
ImageBase = .;
.text : {
*(.peheader)
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.plt)
} =0xD4200000
. = ALIGN(4096);
_etext = .;
__data_start = .;
.data : {
*(.rodata .rodata.* .gnu.linkonce.r.*)
*(.rodata1)
*(.sdata2 .sdata2.* .gnu.linkonce.s2.*)
*(.sbss2 .sbss2.* .gnu.linkonce.sb2.*)
*(.opd)
*(.data .data.* .gnu.linkonce.d.*)
*(.data1)
*(.plabel)
. = ALIGN(16);
__bss_start = .;
*(.sbss .sbss.* .gnu.linkonce.sb.*)
*(.scommon)
*(.dynbss)
*(.bss *.bss.*)
*(COMMON)
. = ALIGN(16);
__bss_end = .;
}
. = ALIGN(16);
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
. = ALIGN(16);
__gp = .;
.sdata : {
*(.got.plt .got)
*(.sdata .sdata.* .gnu.linkonce.s.*)
*(dynsbss)
*(.scommon)
}
. = ALIGN(16);
.dynamic : { *(.dynamic) }
. = ALIGN(16);
.rela.dyn : {
*(.rela.text .rela.text.* .rela.gnu.linkonce.t.*)
*(.rela.rodata .rela.rodata.* .rela.gnu.linkonce.r.*)
*(.rela.data .rela.data.* .rela.gnu.linkonce.d.*)
*(.rela.got)
*(.rela.sdata .rela.sdata.* .rela.gnu.linkonce.s.*)
*(.rela.sbss .rela.sbss.* .rela.gnu.linkonce.sb.*)
*(.rela.sdata2 .rela.sdata2.* .rela.gnu.linkonce.s2.*)
*(.rela.sbss2 .rela.sbss2.* .rela.gnu.linkonce.sb2.*)
*(.rela.bss .rela.bss.* .rela.gnu.linkonce.b.*)
*(.rela.plt)
*(.relset_*)
*(.rela.dyn .rela.dyn.*)
}
. = ALIGN(16);
.reloc : { *(.reloc) }
. = ALIGN(16);
.dynsym : { *(.dynsym) }
_edata = .;
__data_size = . - __data_start;
/* Unused sections */
.interp : { *(.interp) }
.dynstr : { *(.dynstr) }
.hash : { *(.hash) }
}
diff --git a/stand/efi/loader/arch/i386/ldscript.i386 b/stand/efi/loader/arch/i386/ldscript.i386
index e17212a1bddd..d305a1bcbeca 100644
--- a/stand/efi/loader/arch/i386/ldscript.i386
+++ b/stand/efi/loader/arch/i386/ldscript.i386
@@ -1,77 +1,76 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf32-i386-freebsd", "elf32-i386-freebsd", "elf32-i386-freebsd")
OUTPUT_ARCH(i386)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0;
ImageBase = .;
. = SIZEOF_HEADERS;
. = ALIGN(4096);
.text : {
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.plt)
} =0xCCCCCCCC
. = ALIGN(4096);
.data : {
*(.rodata .rodata.* .gnu.linkonce.r.*)
*(.rodata1)
*(.sdata2 .sdata2.* .gnu.linkonce.s2.*)
*(.sbss2 .sbss2.* .gnu.linkonce.sb2.*)
*(.opd)
*(.data .data.* .gnu.linkonce.d.*)
*(.data1)
*(.plabel)
*(.dynbss)
*(.bss .bss.* .gnu.linkonce.b.*)
*(COMMON)
}
. = ALIGN(4096);
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
. = ALIGN(4096);
__gp = .;
.sdata : {
*(.got.plt .got)
*(.sdata .sdata.* .gnu.linkonce.s.*)
*(dynsbss)
*(.sbss .sbss.* .gnu.linkonce.sb.*)
*(.scommon)
}
. = ALIGN(4096);
.dynamic : { *(.dynamic) }
. = ALIGN(4096);
.rel.dyn : {
*(.rel.text .rel.text.* .rel.gnu.linkonce.t.*)
*(.rel.rodata .rel.rodata.* .rel.gnu.linkonce.r.*)
*(.rel.data .rel.data.* .rel.gnu.linkonce.d.*)
*(.rel.got)
*(.rel.sdata .rel.sdata.* .rel.gnu.linkonce.s.*)
*(.rel.sbss .rel.sbss.* .rel.gnu.linkonce.sb.*)
*(.rel.sdata2 .rel.sdata2.* .rel.gnu.linkonce.s2.*)
*(.rel.sbss2 .rel.sbss2.* .rel.gnu.linkonce.sb2.*)
*(.rel.bss .rel.bss.* .rel.gnu.linkonce.b.*)
*(.rel.plt)
*(.relset_*)
*(.rel.dyn .rel.dyn.*)
}
. = ALIGN(4096);
.reloc : { *(.reloc) }
. = ALIGN(4096);
.hash : { *(.hash) }
. = ALIGN(4096);
.dynsym : { *(.dynsym) }
. = ALIGN(4096);
.dynstr : { *(.dynstr) }
}
diff --git a/stand/efi/loader/arch/riscv/ldscript.riscv b/stand/efi/loader/arch/riscv/ldscript.riscv
index aa736f0d9b2a..342ec62cf03e 100644
--- a/stand/efi/loader/arch/riscv/ldscript.riscv
+++ b/stand/efi/loader/arch/riscv/ldscript.riscv
@@ -1,88 +1,87 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf64-littleriscv", "elf64-littleriscv", "elf64-littleriscv")
OUTPUT_ARCH(riscv64)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0;
ImageBase = .;
.text : {
*(.peheader)
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.plt)
} =0x9090
. = ALIGN(16);
.data : {
*(.rodata .rodata.* .gnu.linkonce.r.*)
*(.rodata1)
*(.sdata2 .sdata2.* .gnu.linkonce.s2.*)
*(.sbss2 .sbss2.* .gnu.linkonce.sb2.*)
*(.opd)
*(.data .data.* .gnu.linkonce.d.*)
*(.data1)
*(.plabel)
. = ALIGN(16);
__bss_start = .;
*(.sbss .sbss.* .gnu.linkonce.sb.*)
*(.scommon)
*(.dynbss)
*(.bss *.bss.*)
*(COMMON)
. = ALIGN(16);
__bss_end = .;
}
. = ALIGN(16);
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
. = ALIGN(16);
.sdata : {
/*
* u-boot expects the gp register to be untouched by the EFI payload, so we
* can't enable this yet.
*/
/* __global_pointer$ = . + 0x800; */
*(.got.plt .got)
*(.sdata .sdata.* .gnu.linkonce.s.*)
*(dynsbss)
*(.scommon)
}
. = ALIGN(16);
.dynamic : { *(.dynamic) }
. = ALIGN(16);
.rela.dyn : {
*(.rela.text .rela.text.* .rela.gnu.linkonce.t.*)
*(.rela.rodata .rela.rodata.* .rela.gnu.linkonce.r.*)
*(.rela.data .rela.data.* .rela.gnu.linkonce.d.*)
*(.rela.got)
*(.rela.sdata .rela.sdata.* .rela.gnu.linkonce.s.*)
*(.rela.sbss .rela.sbss.* .rela.gnu.linkonce.sb.*)
*(.rela.sdata2 .rela.sdata2.* .rela.gnu.linkonce.s2.*)
*(.rela.sbss2 .rela.sbss2.* .rela.gnu.linkonce.sb2.*)
*(.rela.bss .rela.bss.* .rela.gnu.linkonce.b.*)
*(.rela.plt)
*(.relset_*)
*(.rela.dyn .rela.dyn.*)
}
. = ALIGN(16);
.reloc : { *(.reloc) }
. = ALIGN(16);
.dynsym : { *(.dynsym) }
_edata = .;
/* Unused sections */
.interp : { *(.interp) }
.dynstr : { *(.dynstr) }
.hash : { *(.hash) }
}
diff --git a/stand/ficl/aarch64/sysdep.c b/stand/ficl/aarch64/sysdep.c
index 43e7c3c91f1d..87bed142d684 100644
--- a/stand/ficl/aarch64/sysdep.c
+++ b/stand/ficl/aarch64/sysdep.c
@@ -1,99 +1,98 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar(*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/amd64/sysdep.c b/stand/ficl/amd64/sysdep.c
index 147c4683b6c2..41a5c679e9b3 100644
--- a/stand/ficl/amd64/sysdep.c
+++ b/stand/ficl/amd64/sysdep.c
@@ -1,101 +1,100 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
#include "../x86/sysdep.c"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar((unsigned char)*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/amd64/sysdep.h b/stand/ficl/amd64/sysdep.h
index 08bc0e1f4d0b..0e9a8bb0c788 100644
--- a/stand/ficl/amd64/sysdep.h
+++ b/stand/ficl/amd64/sysdep.h
@@ -1,434 +1,433 @@
/*******************************************************************
s y s d e p . h
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Ficl system dependent types and prototypes...
**
** Note: Ficl also depends on the use of "assert" when
** FICL_ROBUST is enabled. This may require some consideration
** in firmware systems since assert often
** assumes stderr/stdout.
** $Id: sysdep.h,v 1.11 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
**
** $Id: sysdep.h,v 1.6 2001-04-26 21:41:55-07 jsadler Exp jsadler $
*/
-/* $FreeBSD$ */
#if !defined (__SYSDEP_H__)
#define __SYSDEP_H__
#include <sys/types.h>
#include <stddef.h> /* size_t, NULL */
#include <setjmp.h>
#include <assert.h>
#if !defined IGNORE /* Macro to silence unused param warnings */
#define IGNORE(x) &x
#endif
/*
** TRUE and FALSE for C boolean operations, and
** portable 32 bit types for CELLs
**
*/
#if !defined TRUE
#define TRUE 1
#endif
#if !defined FALSE
#define FALSE 0
#endif
/*
** System dependent data type declarations...
*/
#if !defined INT32
#define INT32 int
#endif
#if !defined UNS32
#define UNS32 unsigned int
#endif
#if !defined UNS16
#define UNS16 unsigned short
#endif
#if !defined UNS8
#define UNS8 unsigned char
#endif
#if !defined NULL
#define NULL ((void *)0)
#endif
/*
** FICL_UNS and FICL_INT must have the same size as a void* on
** the target system. A CELL is a union of void*, FICL_UNS, and
** FICL_INT.
** (11/2000: same for FICL_FLOAT)
*/
#if !defined FICL_INT
#define FICL_INT long
#endif
#if !defined FICL_UNS
#define FICL_UNS unsigned long
#endif
#if !defined FICL_FLOAT
#define FICL_FLOAT float
#endif
/*
** Ficl presently supports values of 32 and 64 for BITS_PER_CELL
*/
#if !defined BITS_PER_CELL
#define BITS_PER_CELL 64
#endif
#if ((BITS_PER_CELL != 32) && (BITS_PER_CELL != 64))
Error!
#endif
typedef struct
{
FICL_UNS hi;
FICL_UNS lo;
} DPUNS;
typedef struct
{
FICL_UNS quot;
FICL_UNS rem;
} UNSQR;
typedef struct
{
FICL_INT hi;
FICL_INT lo;
} DPINT;
typedef struct
{
FICL_INT quot;
FICL_INT rem;
} INTQR;
/*
** B U I L D C O N T R O L S
*/
#if !defined (FICL_MINIMAL)
#define FICL_MINIMAL 0
#endif
#if (FICL_MINIMAL)
#define FICL_WANT_SOFTWORDS 0
#define FICL_WANT_FILE 0
#define FICL_WANT_FLOAT 0
#define FICL_WANT_USER 0
#define FICL_WANT_LOCALS 0
#define FICL_WANT_DEBUGGER 0
#define FICL_WANT_OOP 0
#define FICL_PLATFORM_EXTEND 0
#define FICL_MULTITHREAD 0
#define FICL_ROBUST 0
#define FICL_EXTENDED_PREFIX 0
#endif
/*
** FICL_PLATFORM_EXTEND
** Includes words defined in ficlCompilePlatform
*/
#if !defined (FICL_PLATFORM_EXTEND)
#define FICL_PLATFORM_EXTEND 1
#endif
/*
** FICL_WANT_FILE
** Includes the FILE and FILE-EXT wordset and associated code. Turn this off if you do not
** have a filesystem!
** Contributed by Larry Hastings
*/
#if !defined (FICL_WANT_FILE)
#define FICL_WANT_FILE 0
#endif
/*
** FICL_WANT_FLOAT
** Includes a floating point stack for the VM, and words to do float operations.
** Contributed by Guy Carver
*/
#if !defined (FICL_WANT_FLOAT)
#define FICL_WANT_FLOAT 0
#endif
/*
** FICL_WANT_DEBUGGER
** Inludes a simple source level debugger
*/
#if !defined (FICL_WANT_DEBUGGER)
#define FICL_WANT_DEBUGGER 1
#endif
/*
** FICL_EXTENDED_PREFIX enables a bunch of extra prefixes in prefix.c and prefix.fr (if
** included as part of softcore.c)
*/
#if !defined FICL_EXTENDED_PREFIX
#define FICL_EXTENDED_PREFIX 0
#endif
/*
** User variables: per-instance variables bound to the VM.
** Kinda like thread-local storage. Could be implemented in a
** VM private dictionary, but I've chosen the lower overhead
** approach of an array of CELLs instead.
*/
#if !defined FICL_WANT_USER
#define FICL_WANT_USER 1
#endif
#if !defined FICL_USER_CELLS
#define FICL_USER_CELLS 16
#endif
/*
** FICL_WANT_LOCALS controls the creation of the LOCALS wordset and
** a private dictionary for local variable compilation.
*/
#if !defined FICL_WANT_LOCALS
#define FICL_WANT_LOCALS 1
#endif
/* Max number of local variables per definition */
#if !defined FICL_MAX_LOCALS
#define FICL_MAX_LOCALS 16
#endif
/*
** FICL_WANT_OOP
** Inludes object oriented programming support (in softwords)
** OOP support requires locals and user variables!
*/
#if !(FICL_WANT_LOCALS) || !(FICL_WANT_USER)
#if !defined (FICL_WANT_OOP)
#define FICL_WANT_OOP 0
#endif
#endif
#if !defined (FICL_WANT_OOP)
#define FICL_WANT_OOP 1
#endif
/*
** FICL_WANT_SOFTWORDS
** Controls inclusion of all softwords in softcore.c
*/
#if !defined (FICL_WANT_SOFTWORDS)
#define FICL_WANT_SOFTWORDS 1
#endif
/*
** FICL_MULTITHREAD enables dictionary mutual exclusion
** wia the ficlLockDictionary system dependent function.
** Note: this implementation is experimental and poorly
** tested. Further, it's unnecessary unless you really
** intend to have multiple SESSIONS (poor choice of name
** on my part) - that is, threads that modify the dictionary
** at the same time.
*/
#if !defined FICL_MULTITHREAD
#define FICL_MULTITHREAD 0
#endif
/*
** PORTABLE_LONGMULDIV causes ficlLongMul and ficlLongDiv to be
** defined in C in sysdep.c. Use this if you cannot easily
** generate an inline asm definition
*/
#if !defined (PORTABLE_LONGMULDIV)
#define PORTABLE_LONGMULDIV 0
#endif
/*
** INLINE_INNER_LOOP causes the inner interpreter to be inline code
** instead of a function call. This is mainly because MS VC++ 5
** chokes with an internal compiler error on the function version.
** in release mode. Sheesh.
*/
#if !defined INLINE_INNER_LOOP
#if defined _DEBUG
#define INLINE_INNER_LOOP 0
#else
#define INLINE_INNER_LOOP 1
#endif
#endif
/*
** FICL_ROBUST enables bounds checking of stacks and the dictionary.
** This will detect stack over and underflows and dictionary overflows.
** Any exceptional condition will result in an assertion failure.
** (As generated by the ANSI assert macro)
** FICL_ROBUST == 1 --> stack checking in the outer interpreter
** FICL_ROBUST == 2 also enables checking in many primitives
*/
#if !defined FICL_ROBUST
#define FICL_ROBUST 2
#endif
/*
** FICL_DEFAULT_STACK Specifies the default size (in CELLs) of
** a new virtual machine's stacks, unless overridden at
** create time.
*/
#if !defined FICL_DEFAULT_STACK
#define FICL_DEFAULT_STACK 128
#endif
/*
** FICL_DEFAULT_DICT specifies the number of CELLs to allocate
** for the system dictionary by default. The value
** can be overridden at startup time as well.
** FICL_DEFAULT_ENV specifies the number of cells to allot
** for the environment-query dictionary.
*/
#if !defined FICL_DEFAULT_DICT
#define FICL_DEFAULT_DICT 12288
#endif
#if !defined FICL_DEFAULT_ENV
#define FICL_DEFAULT_ENV 260
#endif
/*
** FICL_DEFAULT_VOCS specifies the maximum number of wordlists in
** the dictionary search order. See Forth DPANS sec 16.3.3
** (file://dpans16.htm#16.3.3)
*/
#if !defined FICL_DEFAULT_VOCS
#define FICL_DEFAULT_VOCS 16
#endif
/*
** FICL_MAX_PARSE_STEPS controls the size of an array in the FICL_SYSTEM structure
** that stores pointers to parser extension functions. I would never expect to have
** more than 8 of these, so that's the default limit. Too many of these functions
** will probably exact a nasty performance penalty.
*/
#if !defined FICL_MAX_PARSE_STEPS
#define FICL_MAX_PARSE_STEPS 8
#endif
/*
** FICL_ALIGN is the power of two to which the dictionary
** pointer address must be aligned. This value is usually
** either 1 or 2, depending on the memory architecture
** of the target system; 2 is safe on any 16 or 32 bit
** machine. 3 would be appropriate for a 64 bit machine.
*/
#if !defined FICL_ALIGN
#define FICL_ALIGN 3
#define FICL_ALIGN_ADD ((1 << FICL_ALIGN) - 1)
#endif
/*
** System dependent routines --
** edit the implementations in sysdep.c to be compatible
** with your runtime environment...
** ficlTextOut sends a NULL terminated string to the
** default output device - used for system error messages
** ficlMalloc and ficlFree have the same semantics as malloc and free
** in standard C
** ficlLongMul multiplies two UNS32s and returns a 64 bit unsigned
** product
** ficlLongDiv divides an UNS64 by an UNS32 and returns UNS32 quotient
** and remainder
*/
struct vm;
void ficlTextOut(struct vm *pVM, char *msg, int fNewline);
void *ficlMalloc (size_t size);
void ficlFree (void *p);
void *ficlRealloc(void *p, size_t size);
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** must be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** before timeout (optional - could also block forever)
**
** NOTE: this function must be implemented with lock counting
** semantics: nested calls must behave properly.
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock);
#else
#define ficlLockDictionary(x) 0 /* ignore */
#endif
/*
** 64 bit integer math support routines: multiply two UNS32s
** to get a 64 bit product, & divide the product by an UNS32
** to get an UNS32 quotient and remainder. Much easier in asm
** on a 32 bit CPU than in C, which usually doesn't support
** the double length result (but it should).
*/
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y);
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y);
/*
** FICL_HAVE_FTRUNCATE indicates whether the current OS supports
** the ftruncate() function (available on most UNIXes). This
** function is necessary to provide the complete File-Access wordset.
*/
#if !defined (FICL_HAVE_FTRUNCATE)
#define FICL_HAVE_FTRUNCATE 0
#endif
#endif /*__SYSDEP_H__*/
diff --git a/stand/ficl/arm/sysdep.c b/stand/ficl/arm/sysdep.c
index 43e7c3c91f1d..87bed142d684 100644
--- a/stand/ficl/arm/sysdep.c
+++ b/stand/ficl/arm/sysdep.c
@@ -1,99 +1,98 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar(*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/dict.c b/stand/ficl/dict.c
index b76d92559f8f..7a6fc7568236 100644
--- a/stand/ficl/dict.c
+++ b/stand/ficl/dict.c
@@ -1,864 +1,863 @@
/*******************************************************************
** d i c t . c
** Forth Inspired Command Language - dictionary methods
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 19 July 1997
** $Id: dict.c,v 1.14 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** This file implements the dictionary -- FICL's model of
** memory management. All FICL words are stored in the
** dictionary. A word is a named chunk of data with its
** associated code. FICL treats all words the same, even
** precompiled ones, so your words become first-class
** extensions of the language. You can even define new
** control structures.
**
** 29 jun 1998 (sadler) added variable sized hash table support
*/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <ctype.h>
#else
#include <stand.h>
#endif
#include <string.h>
#include "ficl.h"
/* Dictionary on-demand resizing control variables */
CELL dictThreshold;
CELL dictIncrease;
static char *dictCopyName(FICL_DICT *pDict, STRINGINFO si);
/**************************************************************************
d i c t A b o r t D e f i n i t i o n
** Abort a definition in process: reclaim its memory and unlink it
** from the dictionary list. Assumes that there is a smudged
** definition in process...otherwise does nothing.
** NOTE: this function is not smart enough to unlink a word that
** has been successfully defined (ie linked into a hash). It
** only works for defs in process. If the def has been unsmudged,
** nothing happens.
**************************************************************************/
void dictAbortDefinition(FICL_DICT *pDict)
{
FICL_WORD *pFW;
ficlLockDictionary(TRUE);
pFW = pDict->smudge;
if (pFW->flags & FW_SMUDGE)
pDict->here = (CELL *)pFW->name;
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
a l i g n P t r
** Aligns the given pointer to FICL_ALIGN address units.
** Returns the aligned pointer value.
**************************************************************************/
void *alignPtr(void *ptr)
{
#if FICL_ALIGN > 0
char *cp;
CELL c;
cp = (char *)ptr + FICL_ALIGN_ADD;
c.p = (void *)cp;
c.u = c.u & (~FICL_ALIGN_ADD);
ptr = (CELL *)c.p;
#endif
return ptr;
}
/**************************************************************************
d i c t A l i g n
** Align the dictionary's free space pointer
**************************************************************************/
void dictAlign(FICL_DICT *pDict)
{
pDict->here = alignPtr(pDict->here);
}
/**************************************************************************
d i c t A l l o t
** Allocate or remove n chars of dictionary space, with
** checks for underrun and overrun
**************************************************************************/
int dictAllot(FICL_DICT *pDict, int n)
{
char *cp = (char *)pDict->here;
#if FICL_ROBUST
if (n > 0)
{
if ((unsigned)n <= dictCellsAvail(pDict) * sizeof (CELL))
cp += n;
else
return 1; /* dict is full */
}
else
{
n = -n;
if ((unsigned)n <= dictCellsUsed(pDict) * sizeof (CELL))
cp -= n;
else /* prevent underflow */
cp -= dictCellsUsed(pDict) * sizeof (CELL);
}
#else
cp += n;
#endif
pDict->here = PTRtoCELL cp;
return 0;
}
/**************************************************************************
d i c t A l l o t C e l l s
** Reserve space for the requested number of cells in the
** dictionary. If nCells < 0 , removes space from the dictionary.
**************************************************************************/
int dictAllotCells(FICL_DICT *pDict, int nCells)
{
#if FICL_ROBUST
if (nCells > 0)
{
if (nCells <= dictCellsAvail(pDict))
pDict->here += nCells;
else
return 1; /* dict is full */
}
else
{
nCells = -nCells;
if (nCells <= dictCellsUsed(pDict))
pDict->here -= nCells;
else /* prevent underflow */
pDict->here -= dictCellsUsed(pDict);
}
#else
pDict->here += nCells;
#endif
return 0;
}
/**************************************************************************
d i c t A p p e n d C e l l
** Append the specified cell to the dictionary
**************************************************************************/
void dictAppendCell(FICL_DICT *pDict, CELL c)
{
*pDict->here++ = c;
return;
}
/**************************************************************************
d i c t A p p e n d C h a r
** Append the specified char to the dictionary
**************************************************************************/
void dictAppendChar(FICL_DICT *pDict, char c)
{
char *cp = (char *)pDict->here;
*cp++ = c;
pDict->here = PTRtoCELL cp;
return;
}
/**************************************************************************
d i c t A p p e n d W o r d
** Create a new word in the dictionary with the specified
** name, code, and flags. Name must be NULL-terminated.
**************************************************************************/
FICL_WORD *dictAppendWord(FICL_DICT *pDict,
char *name,
FICL_CODE pCode,
UNS8 flags)
{
STRINGINFO si;
SI_SETLEN(si, strlen(name));
SI_SETPTR(si, name);
return dictAppendWord2(pDict, si, pCode, flags);
}
/**************************************************************************
d i c t A p p e n d W o r d 2
** Create a new word in the dictionary with the specified
** STRINGINFO, code, and flags. Does not require a NULL-terminated
** name.
**************************************************************************/
FICL_WORD *dictAppendWord2(FICL_DICT *pDict,
STRINGINFO si,
FICL_CODE pCode,
UNS8 flags)
{
FICL_COUNT len = (FICL_COUNT)SI_COUNT(si);
char *pName;
FICL_WORD *pFW;
ficlLockDictionary(TRUE);
/*
** NOTE: dictCopyName advances "here" as a side-effect.
** It must execute before pFW is initialized.
*/
pName = dictCopyName(pDict, si);
pFW = (FICL_WORD *)pDict->here;
pDict->smudge = pFW;
pFW->hash = hashHashCode(si);
pFW->code = pCode;
pFW->flags = (UNS8)(flags | FW_SMUDGE);
pFW->nName = (char)len;
pFW->name = pName;
/*
** Point "here" to first cell of new word's param area...
*/
pDict->here = pFW->param;
if (!(flags & FW_SMUDGE))
dictUnsmudge(pDict);
ficlLockDictionary(FALSE);
return pFW;
}
/**************************************************************************
d i c t A p p e n d U N S
** Append the specified FICL_UNS to the dictionary
**************************************************************************/
void dictAppendUNS(FICL_DICT *pDict, FICL_UNS u)
{
*pDict->here++ = LVALUEtoCELL(u);
return;
}
/**************************************************************************
d i c t C e l l s A v a i l
** Returns the number of empty cells left in the dictionary
**************************************************************************/
int dictCellsAvail(FICL_DICT *pDict)
{
return pDict->size - dictCellsUsed(pDict);
}
/**************************************************************************
d i c t C e l l s U s e d
** Returns the number of cells consumed in the dicionary
**************************************************************************/
int dictCellsUsed(FICL_DICT *pDict)
{
return pDict->here - pDict->dict;
}
/**************************************************************************
d i c t C h e c k
** Checks the dictionary for corruption and throws appropriate
** errors.
** Input: +n number of ADDRESS UNITS (not Cells) proposed to allot
** -n number of ADDRESS UNITS proposed to de-allot
** 0 just do a consistency check
**************************************************************************/
void dictCheck(FICL_DICT *pDict, FICL_VM *pVM, int n)
{
if ((n >= 0) && (dictCellsAvail(pDict) * (int)sizeof(CELL) < n))
{
vmThrowErr(pVM, "Error: dictionary full");
}
if ((n <= 0) && (dictCellsUsed(pDict) * (int)sizeof(CELL) < -n))
{
vmThrowErr(pVM, "Error: dictionary underflow");
}
if (pDict->nLists > FICL_DEFAULT_VOCS)
{
dictResetSearchOrder(pDict);
vmThrowErr(pVM, "Error: search order overflow");
}
else if (pDict->nLists < 0)
{
dictResetSearchOrder(pDict);
vmThrowErr(pVM, "Error: search order underflow");
}
return;
}
/**************************************************************************
d i c t C o p y N a m e
** Copy up to nFICLNAME characters of the name specified by si into
** the dictionary starting at "here", then NULL-terminate the name,
** point "here" to the next available byte, and return the address of
** the beginning of the name. Used by dictAppendWord.
** N O T E S :
** 1. "here" is guaranteed to be aligned after this operation.
** 2. If the string has zero length, align and return "here"
**************************************************************************/
static char *dictCopyName(FICL_DICT *pDict, STRINGINFO si)
{
char *oldCP = (char *)pDict->here;
char *cp = oldCP;
char *name = SI_PTR(si);
int i = SI_COUNT(si);
if (i == 0)
{
dictAlign(pDict);
return (char *)pDict->here;
}
if (i > nFICLNAME)
i = nFICLNAME;
for (; i > 0; --i)
{
*cp++ = *name++;
}
*cp++ = '\0';
pDict->here = PTRtoCELL cp;
dictAlign(pDict);
return oldCP;
}
/**************************************************************************
d i c t C r e a t e
** Create and initialize a dictionary with the specified number
** of cells capacity, and no hashing (hash size == 1).
**************************************************************************/
FICL_DICT *dictCreate(unsigned nCells)
{
return dictCreateHashed(nCells, 1);
}
FICL_DICT *dictCreateHashed(unsigned nCells, unsigned nHash)
{
FICL_DICT *pDict;
size_t nAlloc;
nAlloc = sizeof (FICL_HASH) + nCells * sizeof (CELL)
+ (nHash - 1) * sizeof (FICL_WORD *);
pDict = ficlMalloc(sizeof (FICL_DICT));
assert(pDict);
memset(pDict, 0, sizeof (FICL_DICT));
pDict->dict = ficlMalloc(nAlloc);
assert(pDict->dict);
pDict->size = nCells;
dictEmpty(pDict, nHash);
return pDict;
}
/**************************************************************************
d i c t C r e a t e W o r d l i s t
** Create and initialize an anonymous wordlist
**************************************************************************/
FICL_HASH *dictCreateWordlist(FICL_DICT *dp, int nBuckets)
{
FICL_HASH *pHash;
dictAlign(dp);
pHash = (FICL_HASH *)dp->here;
dictAllot(dp, sizeof (FICL_HASH)
+ (nBuckets-1) * sizeof (FICL_WORD *));
pHash->size = nBuckets;
hashReset(pHash);
return pHash;
}
/**************************************************************************
d i c t D e l e t e
** Free all memory allocated for the given dictionary
**************************************************************************/
void dictDelete(FICL_DICT *pDict)
{
assert(pDict);
ficlFree(pDict);
return;
}
/**************************************************************************
d i c t E m p t y
** Empty the dictionary, reset its hash table, and reset its search order.
** Clears and (re-)creates the hash table with the size specified by nHash.
**************************************************************************/
void dictEmpty(FICL_DICT *pDict, unsigned nHash)
{
FICL_HASH *pHash;
pDict->here = pDict->dict;
dictAlign(pDict);
pHash = (FICL_HASH *)pDict->here;
dictAllot(pDict,
sizeof (FICL_HASH) + (nHash - 1) * sizeof (FICL_WORD *));
pHash->size = nHash;
hashReset(pHash);
pDict->pForthWords = pHash;
pDict->smudge = NULL;
dictResetSearchOrder(pDict);
return;
}
/**************************************************************************
d i c t H a s h S u m m a r y
** Calculate a figure of merit for the dictionary hash table based
** on the average search depth for all the words in the dictionary,
** assuming uniform distribution of target keys. The figure of merit
** is the ratio of the total search depth for all keys in the table
** versus a theoretical optimum that would be achieved if the keys
** were distributed into the table as evenly as possible.
** The figure would be worse if the hash table used an open
** addressing scheme (i.e. collisions resolved by searching the
** table for an empty slot) for a given size table.
**************************************************************************/
#if FICL_WANT_FLOAT
void dictHashSummary(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_HASH *pFHash;
FICL_WORD **pHash;
unsigned size;
FICL_WORD *pFW;
unsigned i;
int nMax = 0;
int nWords = 0;
int nFilled;
double avg = 0.0;
double best;
int nAvg, nRem, nDepth;
dictCheck(dp, pVM, 0);
pFHash = dp->pSearch[dp->nLists - 1];
pHash = pFHash->table;
size = pFHash->size;
nFilled = size;
for (i = 0; i < size; i++)
{
int n = 0;
pFW = pHash[i];
while (pFW)
{
++n;
++nWords;
pFW = pFW->link;
}
avg += (double)(n * (n+1)) / 2.0;
if (n > nMax)
nMax = n;
if (n == 0)
--nFilled;
}
/* Calc actual avg search depth for this hash */
avg = avg / nWords;
/* Calc best possible performance with this size hash */
nAvg = nWords / size;
nRem = nWords % size;
nDepth = size * (nAvg * (nAvg+1))/2 + (nAvg+1)*nRem;
best = (double)nDepth/nWords;
sprintf(pVM->pad,
"%d bins, %2.0f%% filled, Depth: Max=%d, Avg=%2.1f, Best=%2.1f, Score: %2.0f%%",
size,
(double)nFilled * 100.0 / size, nMax,
avg,
best,
100.0 * best / avg);
ficlTextOut(pVM, pVM->pad, 1);
return;
}
#endif
/**************************************************************************
d i c t I n c l u d e s
** Returns TRUE iff the given pointer is within the address range of
** the dictionary.
**************************************************************************/
int dictIncludes(FICL_DICT *pDict, void *p)
{
return ((p >= (void *) &pDict->dict)
&& (p < (void *)(&pDict->dict + pDict->size))
);
}
/**************************************************************************
d i c t L o o k u p
** Find the FICL_WORD that matches the given name and length.
** If found, returns the word's address. Otherwise returns NULL.
** Uses the search order list to search multiple wordlists.
**************************************************************************/
FICL_WORD *dictLookup(FICL_DICT *pDict, STRINGINFO si)
{
FICL_WORD *pFW = NULL;
FICL_HASH *pHash;
int i;
UNS16 hashCode = hashHashCode(si);
assert(pDict);
ficlLockDictionary(1);
for (i = (int)pDict->nLists - 1; (i >= 0) && (!pFW); --i)
{
pHash = pDict->pSearch[i];
pFW = hashLookup(pHash, si, hashCode);
}
ficlLockDictionary(0);
return pFW;
}
/**************************************************************************
f i c l L o o k u p L o c
** Same as dictLookup, but looks in system locals dictionary first...
** Assumes locals dictionary has only one wordlist...
**************************************************************************/
#if FICL_WANT_LOCALS
FICL_WORD *ficlLookupLoc(FICL_SYSTEM *pSys, STRINGINFO si)
{
FICL_WORD *pFW = NULL;
FICL_DICT *pDict = pSys->dp;
FICL_HASH *pHash = ficlGetLoc(pSys)->pForthWords;
int i;
UNS16 hashCode = hashHashCode(si);
assert(pHash);
assert(pDict);
ficlLockDictionary(1);
/*
** check the locals dict first...
*/
pFW = hashLookup(pHash, si, hashCode);
/*
** If no joy, (!pFW) --------------------------v
** iterate over the search list in the main dict
*/
for (i = (int)pDict->nLists - 1; (i >= 0) && (!pFW); --i)
{
pHash = pDict->pSearch[i];
pFW = hashLookup(pHash, si, hashCode);
}
ficlLockDictionary(0);
return pFW;
}
#endif
/**************************************************************************
d i c t R e s e t S e a r c h O r d e r
** Initialize the dictionary search order list to sane state
**************************************************************************/
void dictResetSearchOrder(FICL_DICT *pDict)
{
assert(pDict);
pDict->pCompile = pDict->pForthWords;
pDict->nLists = 1;
pDict->pSearch[0] = pDict->pForthWords;
return;
}
/**************************************************************************
d i c t S e t F l a g s
** Changes the flags field of the most recently defined word:
** Set all bits that are ones in the set parameter, clear all bits
** that are ones in the clr parameter. Clear wins in case the same bit
** is set in both parameters.
**************************************************************************/
void dictSetFlags(FICL_DICT *pDict, UNS8 set, UNS8 clr)
{
assert(pDict->smudge);
pDict->smudge->flags |= set;
pDict->smudge->flags &= ~clr;
return;
}
/**************************************************************************
d i c t S e t I m m e d i a t e
** Set the most recently defined word as IMMEDIATE
**************************************************************************/
void dictSetImmediate(FICL_DICT *pDict)
{
assert(pDict->smudge);
pDict->smudge->flags |= FW_IMMEDIATE;
return;
}
/**************************************************************************
d i c t U n s m u d g e
** Completes the definition of a word by linking it
** into the main list
**************************************************************************/
void dictUnsmudge(FICL_DICT *pDict)
{
FICL_WORD *pFW = pDict->smudge;
FICL_HASH *pHash = pDict->pCompile;
assert(pHash);
assert(pFW);
/*
** :noname words never get linked into the list...
*/
if (pFW->nName > 0)
hashInsertWord(pHash, pFW);
pFW->flags &= ~(FW_SMUDGE);
return;
}
/**************************************************************************
d i c t W h e r e
** Returns the value of the HERE pointer -- the address
** of the next free cell in the dictionary
**************************************************************************/
CELL *dictWhere(FICL_DICT *pDict)
{
return pDict->here;
}
/**************************************************************************
h a s h F o r g e t
** Unlink all words in the hash that have addresses greater than or
** equal to the address supplied. Implementation factor for FORGET
** and MARKER.
**************************************************************************/
void hashForget(FICL_HASH *pHash, void *where)
{
FICL_WORD *pWord;
unsigned i;
assert(pHash);
assert(where);
for (i = 0; i < pHash->size; i++)
{
pWord = pHash->table[i];
while ((void *)pWord >= where)
{
pWord = pWord->link;
}
pHash->table[i] = pWord;
}
return;
}
/**************************************************************************
h a s h H a s h C o d e
**
** Generate a 16 bit hashcode from a character string using a rolling
** shift and add stolen from PJ Weinberger of Bell Labs fame. Case folds
** the name before hashing it...
** N O T E : If string has zero length, returns zero.
**************************************************************************/
UNS16 hashHashCode(STRINGINFO si)
{
/* hashPJW */
UNS8 *cp;
UNS16 code = (UNS16)si.count;
UNS16 shift = 0;
if (si.count == 0)
return 0;
/* changed to run without errors under Purify -- lch */
for (cp = (UNS8 *)si.cp; si.count && *cp; cp++, si.count--)
{
code = (UNS16)((code << 4) + tolower(*cp));
shift = (UNS16)(code & 0xf000);
if (shift)
{
code ^= (UNS16)(shift >> 8);
code ^= (UNS16)shift;
}
}
return (UNS16)code;
}
/**************************************************************************
h a s h I n s e r t W o r d
** Put a word into the hash table using the word's hashcode as
** an index (modulo the table size).
**************************************************************************/
void hashInsertWord(FICL_HASH *pHash, FICL_WORD *pFW)
{
FICL_WORD **pList;
assert(pHash);
assert(pFW);
if (pHash->size == 1)
{
pList = pHash->table;
}
else
{
pList = pHash->table + (pFW->hash % pHash->size);
}
pFW->link = *pList;
*pList = pFW;
return;
}
/**************************************************************************
h a s h L o o k u p
** Find a name in the hash table given the hashcode and text of the name.
** Returns the address of the corresponding FICL_WORD if found,
** otherwise NULL.
** Note: outer loop on link field supports inheritance in wordlists.
** It's not part of ANS Forth - ficl only. hashReset creates wordlists
** with NULL link fields.
**************************************************************************/
FICL_WORD *hashLookup(FICL_HASH *pHash, STRINGINFO si, UNS16 hashCode)
{
FICL_UNS nCmp = si.count;
FICL_WORD *pFW;
UNS16 hashIdx;
if (nCmp > nFICLNAME)
nCmp = nFICLNAME;
for (; pHash != NULL; pHash = pHash->link)
{
if (pHash->size > 1)
hashIdx = (UNS16)(hashCode % pHash->size);
else /* avoid the modulo op for single threaded lists */
hashIdx = 0;
for (pFW = pHash->table[hashIdx]; pFW; pFW = pFW->link)
{
if ( (pFW->nName == si.count)
&& (!strincmp(si.cp, pFW->name, nCmp)) )
return pFW;
#if FICL_ROBUST
assert(pFW != pFW->link);
#endif
}
}
return NULL;
}
/**************************************************************************
h a s h R e s e t
** Initialize a FICL_HASH to empty state.
**************************************************************************/
void hashReset(FICL_HASH *pHash)
{
unsigned i;
assert(pHash);
for (i = 0; i < pHash->size; i++)
{
pHash->table[i] = NULL;
}
pHash->link = NULL;
pHash->name = NULL;
return;
}
/**************************************************************************
d i c t C h e c k T h r e s h o l d
** Verify if an increase in the dictionary size is warranted, and do it if
** so.
**************************************************************************/
void dictCheckThreshold(FICL_DICT* dp)
{
if( dictCellsAvail(dp) < dictThreshold.u ) {
dp->dict = ficlMalloc( dictIncrease.u * sizeof (CELL) );
assert(dp->dict);
dp->here = dp->dict;
dp->size = dictIncrease.u;
dictAlign(dp);
}
}
diff --git a/stand/ficl/ficl.c b/stand/ficl/ficl.c
index 219cf84b2225..3731b42b2a32 100644
--- a/stand/ficl/ficl.c
+++ b/stand/ficl/ficl.c
@@ -1,696 +1,695 @@
/*******************************************************************
** f i c l . c
** Forth Inspired Command Language - external interface
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 19 July 1997
** $Id: ficl.c,v 1.16 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** This is an ANS Forth interpreter written in C.
** Ficl uses Forth syntax for its commands, but turns the Forth
** model on its head in other respects.
** Ficl provides facilities for interoperating
** with programs written in C: C functions can be exported to Ficl,
** and Ficl commands can be executed via a C calling interface. The
** interpreter is re-entrant, so it can be used in multiple instances
** in a multitasking system. Unlike Forth, Ficl's outer interpreter
** expects a text block as input, and returns to the caller after each
** text block, so the data pump is somewhere in external code in the
** style of TCL.
**
** Code is written in ANSI C for portability.
*/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include <string.h>
#include "ficl.h"
/*
** System statics
** Each FICL_SYSTEM builds a global dictionary during its start
** sequence. This is shared by all virtual machines of that system.
** Therefore only one VM can update the dictionary
** at a time. The system imports a locking function that
** you can override in order to control update access to
** the dictionary. The function is stubbed out by default,
** but you can insert one: #define FICL_MULTITHREAD 1
** and supply your own version of ficlLockDictionary.
*/
static int defaultStack = FICL_DEFAULT_STACK;
static void ficlSetVersionEnv(FICL_SYSTEM *pSys);
/**************************************************************************
f i c l I n i t S y s t e m
** Binds a global dictionary to the interpreter system.
** You specify the address and size of the allocated area.
** After that, ficl manages it.
** First step is to set up the static pointers to the area.
** Then write the "precompiled" portion of the dictionary in.
** The dictionary needs to be at least large enough to hold the
** precompiled part. Try 1K cells minimum. Use "words" to find
** out how much of the dictionary is used at any time.
**************************************************************************/
FICL_SYSTEM *ficlInitSystemEx(FICL_SYSTEM_INFO *fsi)
{
int nDictCells;
int nEnvCells;
FICL_SYSTEM *pSys = ficlMalloc(sizeof (FICL_SYSTEM));
assert(pSys);
assert(fsi->size == sizeof (FICL_SYSTEM_INFO));
memset(pSys, 0, sizeof (FICL_SYSTEM));
nDictCells = fsi->nDictCells;
if (nDictCells <= 0)
nDictCells = FICL_DEFAULT_DICT;
nEnvCells = fsi->nEnvCells;
if (nEnvCells <= 0)
nEnvCells = FICL_DEFAULT_DICT;
pSys->dp = dictCreateHashed((unsigned)nDictCells, HASHSIZE);
pSys->dp->pForthWords->name = "forth-wordlist";
pSys->envp = dictCreate((unsigned)nEnvCells);
pSys->envp->pForthWords->name = "environment";
pSys->textOut = fsi->textOut;
pSys->pExtend = fsi->pExtend;
#if FICL_WANT_LOCALS
/*
** The locals dictionary is only searched while compiling,
** but this is where speed is most important. On the other
** hand, the dictionary gets emptied after each use of locals
** The need to balance search speed with the cost of the 'empty'
** operation led me to select a single-threaded list...
*/
pSys->localp = dictCreate((unsigned)FICL_MAX_LOCALS * CELLS_PER_WORD);
#endif
/*
** Build the precompiled dictionary and load softwords. We need a temporary
** VM to do this - ficlNewVM links one to the head of the system VM list.
** ficlCompilePlatform (defined in win32.c, for example) adds platform specific words.
*/
ficlCompileCore(pSys);
ficlCompilePrefix(pSys);
#if FICL_WANT_FLOAT
ficlCompileFloat(pSys);
#endif
#if FICL_PLATFORM_EXTEND
ficlCompilePlatform(pSys);
#endif
ficlSetVersionEnv(pSys);
/*
** Establish the parse order. Note that prefixes precede numbers -
** this allows constructs like "0b101010" which might parse as a
** hex value otherwise.
*/
ficlAddPrecompiledParseStep(pSys, "?prefix", ficlParsePrefix);
ficlAddPrecompiledParseStep(pSys, "?number", ficlParseNumber);
#if FICL_WANT_FLOAT
ficlAddPrecompiledParseStep(pSys, ">float", ficlParseFloatNumber);
#endif
/*
** Now create a temporary VM to compile the softwords. Since all VMs are
** linked into the vmList of FICL_SYSTEM, we don't have to pass the VM
** to ficlCompileSoftCore -- it just hijacks whatever it finds in the VM list.
** ficl 2.05: vmCreate no longer depends on the presence of INTERPRET in the
** dictionary, so a VM can be created before the dictionary is built. It just
** can't do much...
*/
ficlNewVM(pSys);
ficlCompileSoftCore(pSys);
ficlFreeVM(pSys->vmList);
return pSys;
}
FICL_SYSTEM *ficlInitSystem(int nDictCells)
{
FICL_SYSTEM_INFO fsi;
ficlInitInfo(&fsi);
fsi.nDictCells = nDictCells;
return ficlInitSystemEx(&fsi);
}
/**************************************************************************
f i c l A d d P a r s e S t e p
** Appends a parse step function to the end of the parse list (see
** FICL_PARSE_STEP notes in ficl.h for details). Returns 0 if successful,
** nonzero if there's no more room in the list.
**************************************************************************/
int ficlAddParseStep(FICL_SYSTEM *pSys, FICL_WORD *pFW)
{
int i;
for (i = 0; i < FICL_MAX_PARSE_STEPS; i++)
{
if (pSys->parseList[i] == NULL)
{
pSys->parseList[i] = pFW;
return 0;
}
}
return 1;
}
/*
** Compile a word into the dictionary that invokes the specified FICL_PARSE_STEP
** function. It is up to the user (as usual in Forth) to make sure the stack
** preconditions are valid (there needs to be a counted string on top of the stack)
** before using the resulting word.
*/
void ficlAddPrecompiledParseStep(FICL_SYSTEM *pSys, char *name, FICL_PARSE_STEP pStep)
{
FICL_DICT *dp = pSys->dp;
FICL_WORD *pFW = dictAppendWord(dp, name, parseStepParen, FW_DEFAULT);
dictAppendCell(dp, LVALUEtoCELL(pStep));
ficlAddParseStep(pSys, pFW);
}
/*
** This word lists the parse steps in order
*/
void ficlListParseSteps(FICL_VM *pVM)
{
int i;
FICL_SYSTEM *pSys = pVM->pSys;
assert(pSys);
vmTextOut(pVM, "Parse steps:", 1);
vmTextOut(pVM, "lookup", 1);
for (i = 0; i < FICL_MAX_PARSE_STEPS; i++)
{
if (pSys->parseList[i] != NULL)
{
vmTextOut(pVM, pSys->parseList[i]->name, 1);
}
else break;
}
return;
}
/**************************************************************************
f i c l N e w V M
** Create a new virtual machine and link it into the system list
** of VMs for later cleanup by ficlTermSystem.
**************************************************************************/
FICL_VM *ficlNewVM(FICL_SYSTEM *pSys)
{
FICL_VM *pVM = vmCreate(NULL, defaultStack, defaultStack);
pVM->link = pSys->vmList;
pVM->pSys = pSys;
pVM->pExtend = pSys->pExtend;
vmSetTextOut(pVM, pSys->textOut);
pSys->vmList = pVM;
return pVM;
}
/**************************************************************************
f i c l F r e e V M
** Removes the VM in question from the system VM list and deletes the
** memory allocated to it. This is an optional call, since ficlTermSystem
** will do this cleanup for you. This function is handy if you're going to
** do a lot of dynamic creation of VMs.
**************************************************************************/
void ficlFreeVM(FICL_VM *pVM)
{
FICL_SYSTEM *pSys = pVM->pSys;
FICL_VM *pList = pSys->vmList;
assert(pVM != NULL);
if (pSys->vmList == pVM)
{
pSys->vmList = pSys->vmList->link;
}
else for (; pList != NULL; pList = pList->link)
{
if (pList->link == pVM)
{
pList->link = pVM->link;
break;
}
}
if (pList)
vmDelete(pVM);
return;
}
/**************************************************************************
f i c l B u i l d
** Builds a word into the dictionary.
** Preconditions: system must be initialized, and there must
** be enough space for the new word's header! Operation is
** controlled by ficlLockDictionary, so any initialization
** required by your version of the function (if you overrode
** it) must be complete at this point.
** Parameters:
** name -- duh, the name of the word
** code -- code to execute when the word is invoked - must take a single param
** pointer to a FICL_VM
** flags -- 0 or more of F_IMMEDIATE, F_COMPILE, use bitwise OR!
**
**************************************************************************/
int ficlBuild(FICL_SYSTEM *pSys, char *name, FICL_CODE code, char flags)
{
#if FICL_MULTITHREAD
int err = ficlLockDictionary(TRUE);
if (err) return err;
#endif /* FICL_MULTITHREAD */
assert(dictCellsAvail(pSys->dp) > sizeof (FICL_WORD) / sizeof (CELL));
dictAppendWord(pSys->dp, name, code, flags);
ficlLockDictionary(FALSE);
return 0;
}
/**************************************************************************
f i c l E v a l u a t e
** Wrapper for ficlExec() which sets SOURCE-ID to -1.
**************************************************************************/
int ficlEvaluate(FICL_VM *pVM, char *pText)
{
int returnValue;
CELL id = pVM->sourceID;
pVM->sourceID.i = -1;
returnValue = ficlExecC(pVM, pText, -1);
pVM->sourceID = id;
return returnValue;
}
/**************************************************************************
f i c l E x e c
** Evaluates a block of input text in the context of the
** specified interpreter. Emits any requested output to the
** interpreter's output function.
**
** Contains the "inner interpreter" code in a tight loop
**
** Returns one of the VM_XXXX codes defined in ficl.h:
** VM_OUTOFTEXT is the normal exit condition
** VM_ERREXIT means that the interp encountered a syntax error
** and the vm has been reset to recover (some or all
** of the text block got ignored
** VM_USEREXIT means that the user executed the "bye" command
** to shut down the interpreter. This would be a good
** time to delete the vm, etc -- or you can ignore this
** signal.
**************************************************************************/
int ficlExec(FICL_VM *pVM, char *pText)
{
return ficlExecC(pVM, pText, -1);
}
int ficlExecC(FICL_VM *pVM, char *pText, FICL_INT size)
{
FICL_SYSTEM *pSys = pVM->pSys;
FICL_DICT *dp = pSys->dp;
int except;
jmp_buf vmState;
jmp_buf *oldState;
TIB saveTib;
assert(pVM);
assert(pSys->pInterp[0]);
if (size < 0)
size = strlen(pText);
vmPushTib(pVM, pText, size, &saveTib);
/*
** Save and restore VM's jmp_buf to enable nested calls to ficlExec
*/
oldState = pVM->pState;
pVM->pState = &vmState; /* This has to come before the setjmp! */
except = setjmp(vmState);
switch (except)
{
case 0:
if (pVM->fRestart)
{
pVM->runningWord->code(pVM);
pVM->fRestart = 0;
}
else
{ /* set VM up to interpret text */
vmPushIP(pVM, &(pSys->pInterp[0]));
}
vmInnerLoop(pVM);
break;
case VM_RESTART:
pVM->fRestart = 1;
except = VM_OUTOFTEXT;
break;
case VM_OUTOFTEXT:
vmPopIP(pVM);
#ifdef TESTMAIN
if ((pVM->state != COMPILE) && (pVM->sourceID.i == 0))
ficlTextOut(pVM, FICL_PROMPT, 0);
#endif
break;
case VM_USEREXIT:
case VM_INNEREXIT:
case VM_BREAK:
break;
case VM_QUIT:
if (pVM->state == COMPILE)
{
dictAbortDefinition(dp);
#if FICL_WANT_LOCALS
dictEmpty(pSys->localp, pSys->localp->pForthWords->size);
#endif
}
vmQuit(pVM);
break;
case VM_ERREXIT:
case VM_ABORT:
case VM_ABORTQ:
default: /* user defined exit code?? */
if (pVM->state == COMPILE)
{
dictAbortDefinition(dp);
#if FICL_WANT_LOCALS
dictEmpty(pSys->localp, pSys->localp->pForthWords->size);
#endif
}
dictResetSearchOrder(dp);
vmReset(pVM);
break;
}
pVM->pState = oldState;
vmPopTib(pVM, &saveTib);
return (except);
}
/**************************************************************************
f i c l E x e c X T
** Given a pointer to a FICL_WORD, push an inner interpreter and
** execute the word to completion. This is in contrast with vmExecute,
** which does not guarantee that the word will have completed when
** the function returns (ie in the case of colon definitions, which
** need an inner interpreter to finish)
**
** Returns one of the VM_XXXX exception codes listed in ficl.h. Normal
** exit condition is VM_INNEREXIT, ficl's private signal to exit the
** inner loop under normal circumstances. If another code is thrown to
** exit the loop, this function will re-throw it if it's nested under
** itself or ficlExec.
**
** NOTE: this function is intended so that C code can execute ficlWords
** given their address in the dictionary (xt).
**************************************************************************/
int ficlExecXT(FICL_VM *pVM, FICL_WORD *pWord)
{
int except;
jmp_buf vmState;
jmp_buf *oldState;
FICL_WORD *oldRunningWord;
assert(pVM);
assert(pVM->pSys->pExitInner);
/*
** Save the runningword so that RESTART behaves correctly
** over nested calls.
*/
oldRunningWord = pVM->runningWord;
/*
** Save and restore VM's jmp_buf to enable nested calls
*/
oldState = pVM->pState;
pVM->pState = &vmState; /* This has to come before the setjmp! */
except = setjmp(vmState);
if (except)
vmPopIP(pVM);
else
vmPushIP(pVM, &(pVM->pSys->pExitInner));
switch (except)
{
case 0:
vmExecute(pVM, pWord);
vmInnerLoop(pVM);
break;
case VM_INNEREXIT:
case VM_BREAK:
break;
case VM_RESTART:
case VM_OUTOFTEXT:
case VM_USEREXIT:
case VM_QUIT:
case VM_ERREXIT:
case VM_ABORT:
case VM_ABORTQ:
default: /* user defined exit code?? */
if (oldState)
{
pVM->pState = oldState;
vmThrow(pVM, except);
}
break;
}
pVM->pState = oldState;
pVM->runningWord = oldRunningWord;
return (except);
}
/**************************************************************************
f i c l L o o k u p
** Look in the system dictionary for a match to the given name. If
** found, return the address of the corresponding FICL_WORD. Otherwise
** return NULL.
**************************************************************************/
FICL_WORD *ficlLookup(FICL_SYSTEM *pSys, char *name)
{
STRINGINFO si;
SI_PSZ(si, name);
return dictLookup(pSys->dp, si);
}
/**************************************************************************
f i c l G e t D i c t
** Returns the address of the system dictionary
**************************************************************************/
FICL_DICT *ficlGetDict(FICL_SYSTEM *pSys)
{
return pSys->dp;
}
/**************************************************************************
f i c l G e t E n v
** Returns the address of the system environment space
**************************************************************************/
FICL_DICT *ficlGetEnv(FICL_SYSTEM *pSys)
{
return pSys->envp;
}
/**************************************************************************
f i c l S e t E n v
** Create an environment variable with a one-CELL payload. ficlSetEnvD
** makes one with a two-CELL payload.
**************************************************************************/
void ficlSetEnv(FICL_SYSTEM *pSys, char *name, FICL_UNS value)
{
STRINGINFO si;
FICL_WORD *pFW;
FICL_DICT *envp = pSys->envp;
SI_PSZ(si, name);
pFW = dictLookup(envp, si);
if (pFW == NULL)
{
dictAppendWord(envp, name, constantParen, FW_DEFAULT);
dictAppendCell(envp, LVALUEtoCELL(value));
}
else
{
pFW->param[0] = LVALUEtoCELL(value);
}
return;
}
void ficlSetEnvD(FICL_SYSTEM *pSys, char *name, FICL_UNS hi, FICL_UNS lo)
{
FICL_WORD *pFW;
STRINGINFO si;
FICL_DICT *envp = pSys->envp;
SI_PSZ(si, name);
pFW = dictLookup(envp, si);
if (pFW == NULL)
{
dictAppendWord(envp, name, twoConstParen, FW_DEFAULT);
dictAppendCell(envp, LVALUEtoCELL(lo));
dictAppendCell(envp, LVALUEtoCELL(hi));
}
else
{
pFW->param[0] = LVALUEtoCELL(lo);
pFW->param[1] = LVALUEtoCELL(hi);
}
return;
}
/**************************************************************************
f i c l G e t L o c
** Returns the address of the system locals dictionary. This dict is
** only used during compilation, and is shared by all VMs.
**************************************************************************/
#if FICL_WANT_LOCALS
FICL_DICT *ficlGetLoc(FICL_SYSTEM *pSys)
{
return pSys->localp;
}
#endif
/**************************************************************************
f i c l S e t S t a c k S i z e
** Set the stack sizes (return and parameter) to be used for all
** subsequently created VMs. Returns actual stack size to be used.
**************************************************************************/
int ficlSetStackSize(int nStackCells)
{
if (nStackCells >= FICL_DEFAULT_STACK)
defaultStack = nStackCells;
else
defaultStack = FICL_DEFAULT_STACK;
return defaultStack;
}
/**************************************************************************
f i c l T e r m S y s t e m
** Tear the system down by deleting the dictionaries and all VMs.
** This saves you from having to keep track of all that stuff.
**************************************************************************/
void ficlTermSystem(FICL_SYSTEM *pSys)
{
if (pSys->dp)
dictDelete(pSys->dp);
pSys->dp = NULL;
if (pSys->envp)
dictDelete(pSys->envp);
pSys->envp = NULL;
#if FICL_WANT_LOCALS
if (pSys->localp)
dictDelete(pSys->localp);
pSys->localp = NULL;
#endif
while (pSys->vmList != NULL)
{
FICL_VM *pVM = pSys->vmList;
pSys->vmList = pSys->vmList->link;
vmDelete(pVM);
}
ficlFree(pSys);
pSys = NULL;
return;
}
/**************************************************************************
f i c l S e t V e r s i o n E n v
** Create a double cell environment constant for the version ID
**************************************************************************/
static void ficlSetVersionEnv(FICL_SYSTEM *pSys)
{
ficlSetEnvD(pSys, "ficl-version", FICL_VER_MAJOR, FICL_VER_MINOR);
ficlSetEnv (pSys, "ficl-robust", FICL_ROBUST);
return;
}
diff --git a/stand/ficl/ficl.h b/stand/ficl/ficl.h
index 97cf00b0dff3..bdade26eee09 100644
--- a/stand/ficl/ficl.h
+++ b/stand/ficl/ficl.h
@@ -1,1168 +1,1167 @@
/*******************************************************************
** f i c l . h
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 19 July 1997
** Dedicated to RHS, in loving memory
** $Id: ficl.h,v 1.18 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#if !defined (__FICL_H__)
#define __FICL_H__
/*
** Ficl (Forth-inspired command language) is an ANS Forth
** interpreter written in C. Unlike traditional Forths, this
** interpreter is designed to be embedded into other systems
** as a command/macro/development prototype language.
**
** Where Forths usually view themselves as the center of the system
** and expect the rest of the system to be coded in Forth, Ficl
** acts as a component of the system. It is easy to export
** code written in C or ASM to Ficl in the style of TCL, or to invoke
** Ficl code from a compiled module. This allows you to do incremental
** development in a way that combines the best features of threaded
** languages (rapid development, quick code/test/debug cycle,
** reasonably fast) with the best features of C (everyone knows it,
** easier to support large blocks of code, efficient, type checking).
**
** Ficl provides facilities for interoperating
** with programs written in C: C functions can be exported to Ficl,
** and Ficl commands can be executed via a C calling interface. The
** interpreter is re-entrant, so it can be used in multiple instances
** in a multitasking system. Unlike Forth, Ficl's outer interpreter
** expects a text block as input, and returns to the caller after each
** text block, so the "data pump" is somewhere in external code. This
** is more like TCL than Forth, which usually expcets to be at the center
** of the system, requesting input at its convenience. Each Ficl virtual
** machine can be bound to a different I/O channel, and is independent
** of all others in in the same address space except that all virtual
** machines share a common dictionary (a sort or open symbol table that
** defines all of the elements of the language).
**
** Code is written in ANSI C for portability.
**
** Summary of Ficl features and constraints:
** - Standard: Implements the ANSI Forth CORE word set and part
** of the CORE EXT word-set, SEARCH and SEARCH EXT, TOOLS and
** TOOLS EXT, LOCAL and LOCAL ext and various extras.
** - Extensible: you can export code written in Forth, C,
** or asm in a straightforward way. Ficl provides open
** facilities for extending the language in an application
** specific way. You can even add new control structures!
** - Ficl and C can interact in two ways: Ficl can encapsulate
** C code, or C code can invoke Ficl code.
** - Thread-safe, re-entrant: The shared system dictionary
** uses a locking mechanism that you can either supply
** or stub out to provide exclusive access. Each Ficl
** virtual machine has an otherwise complete state, and
** each can be bound to a separate I/O channel (or none at all).
** - Simple encapsulation into existing systems: a basic implementation
** requires three function calls (see the example program in testmain.c).
** - ROMable: Ficl is designed to work in RAM-based and ROM code / RAM data
** environments. It does require somewhat more memory than a pure
** ROM implementation because it builds its system dictionary in
** RAM at startup time.
** - Written an ANSI C to be as simple as I can make it to understand,
** support, debug, and port. Compiles without complaint at /Az /W4
** (require ANSI C, max warnings) under Microsoft VC++ 5.
** - Does full 32 bit math (but you need to implement
** two mixed precision math primitives (see sysdep.c))
** - Indirect threaded interpreter is not the fastest kind of
** Forth there is (see pForth 68K for a really fast subroutine
** threaded interpreter), but it's the cleanest match to a
** pure C implementation.
**
** P O R T I N G F i c l
**
** To install Ficl on your target system, you need an ANSI C compiler
** and its runtime library. Inspect the system dependent macros and
** functions in sysdep.h and sysdep.c and edit them to suit your
** system. For example, INT16 is a short on some compilers and an
** int on others. Check the default CELL alignment controlled by
** FICL_ALIGN. If necessary, add new definitions of ficlMalloc, ficlFree,
** ficlLockDictionary, and ficlTextOut to work with your operating system.
** Finally, use testmain.c as a guide to installing the Ficl system and
** one or more virtual machines into your code. You do not need to include
** testmain.c in your build.
**
** T o D o L i s t
**
** 1. Unimplemented system dependent CORE word: key
** 2. Ficl uses the PAD in some CORE words - this violates the standard,
** but it's cleaner for a multithreaded system. I'll have to make a
** second pad for reference by the word PAD to fix this.
**
** F o r M o r e I n f o r m a t i o n
**
** Web home of ficl
** http://ficl.sourceforge.net
** Check this website for Forth literature (including the ANSI standard)
** http://www.taygeta.com/forthlit.html
** and here for software and more links
** http://www.taygeta.com/forth.html
**
** Obvious Performance enhancement opportunities
** Compile speed
** - work on interpret speed
** - turn off locals (FICL_WANT_LOCALS)
** Interpret speed
** - Change inner interpreter (and everything else)
** so that a definition is a list of pointers to functions
** and inline data rather than pointers to words. This gets
** rid of vm->runningWord and a level of indirection in the
** inner loop. I'll look at it for ficl 3.0
** - Make the main hash table a bigger prime (HASHSIZE)
** - FORGET about twiddling the hash function - my experience is
** that that is a waste of time.
** - Eliminate the need to pass the pVM parameter on the stack
** by dedicating a register to it. Most words need access to the
** vm, but the parameter passing overhead can be reduced. One way
** requires that the host OS have a task switch callout. Create
** a global variable for the running VM and refer to it in words
** that need VM access. Alternative: use thread local storage.
** For single threaded implementations, you can just use a global.
** The first two solutions create portability problems, so I
** haven't considered doing them. Another possibility is to
** declare the pVm parameter to be "register", and hope the compiler
** pays attention.
**
*/
/*
** Revision History:
**
** 15 Apr 1999 (sadler) Merged FreeBSD changes for exception wordset and
** counted strings in ficlExec.
** 12 Jan 1999 (sobral) Corrected EVALUATE behavior. Now TIB has an
** "end" field, and all words respect this. ficlExec is passed a "size"
** of TIB, as well as vmPushTib. This size is used to calculate the "end"
** of the string, ie, base+size. If the size is not known, pass -1.
**
** 10 Jan 1999 (sobral) EXCEPTION word set has been added, and existing
** words has been modified to conform to EXCEPTION EXT word set.
**
** 27 Aug 1998 (sadler) testing and corrections for LOCALS, LOCALS EXT,
** SEARCH / SEARCH EXT, TOOLS / TOOLS EXT.
** Added .X to display in hex, PARSE and PARSE-WORD to supplement WORD,
** EMPTY to clear stack.
**
** 29 jun 1998 (sadler) added variable sized hash table support
** and ANS Forth optional SEARCH & SEARCH EXT word set.
** 26 May 1998 (sadler)
** FICL_PROMPT macro
** 14 April 1998 (sadler) V1.04
** Ficlwin: Windows version, Skip Carter's Linux port
** 5 March 1998 (sadler) V1.03
** Bug fixes -- passes John Ryan's ANS test suite "core.fr"
**
** 24 February 1998 (sadler) V1.02
** -Fixed bugs in <# # #>
** -Changed FICL_WORD so that storage for the name characters
** can be allocated from the dictionary as needed rather than
** reserving 32 bytes in each word whether needed or not -
** this saved 50% of the dictionary storage requirement.
** -Added words in testmain for Win32 functions system,chdir,cwd,
** also added a word that loads and evaluates a file.
**
** December 1997 (sadler)
** -Added VM_RESTART exception handling in ficlExec -- this lets words
** that require additional text to succeed (like :, create, variable...)
** recover gracefully from an empty input buffer rather than emitting
** an error message. Definitions can span multiple input blocks with
** no restrictions.
** -Changed #include order so that <assert.h> is included in sysdep.h,
** and sysdep is included in all other files. This lets you define
** NDEBUG in sysdep.h to disable assertions if you want to.
** -Make PC specific system dependent code conditional on _M_IX86
** defined so that ports can coexist in sysdep.h/sysdep.c
*/
#ifdef __cplusplus
extern "C" {
#endif
#include "sysdep.h"
#include <limits.h> /* UCHAR_MAX */
/*
** Forward declarations... read on.
*/
struct ficl_word;
typedef struct ficl_word FICL_WORD;
struct vm;
typedef struct vm FICL_VM;
struct ficl_dict;
typedef struct ficl_dict FICL_DICT;
struct ficl_system;
typedef struct ficl_system FICL_SYSTEM;
struct ficl_system_info;
typedef struct ficl_system_info FICL_SYSTEM_INFO;
/*
** the Good Stuff starts here...
*/
#define FICL_VER "3.03"
#define FICL_VER_MAJOR 3
#define FICL_VER_MINOR 3
#if !defined (FICL_PROMPT)
#define FICL_PROMPT "ok> "
#endif
/*
** ANS Forth requires false to be zero, and true to be the ones
** complement of false... that unifies logical and bitwise operations
** nicely.
*/
#define FICL_TRUE (~(FICL_UNS)0)
#define FICL_FALSE (0)
#define FICL_BOOL(x) ((x) ? FICL_TRUE : FICL_FALSE)
/*
** A CELL is the main storage type. It must be large enough
** to contain a pointer or a scalar. In order to accommodate
** 32 bit and 64 bit processors, use abstract types for int,
** unsigned, and float.
*/
typedef union _cell
{
FICL_INT i;
FICL_UNS u;
#if (FICL_WANT_FLOAT)
FICL_FLOAT f;
#endif
void *p;
void (*fn)(void);
} CELL;
/*
** LVALUEtoCELL does a little pointer trickery to cast any CELL sized
** lvalue (informal definition: an expression whose result has an
** address) to CELL. Remember that constants and casts are NOT
** themselves lvalues!
*/
#define LVALUEtoCELL(v) (*(CELL *)&v)
/*
** PTRtoCELL is a cast through void * intended to satisfy the
** most outrageously pedantic compiler... (I won't mention
** its name)
*/
#define PTRtoCELL (CELL *)(void *)
#define PTRtoSTRING (FICL_STRING *)(void *)
/*
** Strings in FICL are stored in Pascal style - with a count
** preceding the text. We'll also NULL-terminate them so that
** they work with the usual C lib string functions. (Belt &
** suspenders? You decide.)
** STRINGINFO hides the implementation with a couple of
** macros for use in internal routines.
*/
typedef unsigned char FICL_COUNT;
#define FICL_STRING_MAX UCHAR_MAX
typedef struct _ficl_string
{
FICL_COUNT count;
char text[1];
} FICL_STRING;
typedef struct
{
FICL_UNS count;
char *cp;
} STRINGINFO;
#define SI_COUNT(si) (si.count)
#define SI_PTR(si) (si.cp)
#define SI_SETLEN(si, len) (si.count = (FICL_UNS)(len))
#define SI_SETPTR(si, ptr) (si.cp = (char *)(ptr))
/*
** Init a STRINGINFO from a pointer to NULL-terminated string
*/
#define SI_PSZ(si, psz) \
{si.cp = psz; si.count = (FICL_COUNT)strlen(psz);}
/*
** Init a STRINGINFO from a pointer to FICL_STRING
*/
#define SI_PFS(si, pfs) \
{si.cp = pfs->text; si.count = pfs->count;}
/*
** Ficl uses this little structure to hold the address of
** the block of text it's working on and an index to the next
** unconsumed character in the string. Traditionally, this is
** done by a Text Input Buffer, so I've called this struct TIB.
**
** Since this structure also holds the size of the input buffer,
** and since evaluate requires that, let's put the size here.
** The size is stored as an end-pointer because that is what the
** null-terminated string aware functions find most easy to deal
** with.
** Notice, though, that nobody really uses this except evaluate,
** so it might just be moved to FICL_VM instead. (sobral)
*/
typedef struct
{
FICL_INT index;
char *end;
char *cp;
} TIB;
/*
** Stacks get heavy use in Ficl and Forth...
** Each virtual machine implements two of them:
** one holds parameters (data), and the other holds return
** addresses and control flow information for the virtual
** machine. (Note: C's automatic stack is implicitly used,
** but not modeled because it doesn't need to be...)
** Here's an abstract type for a stack
*/
typedef struct _ficlStack
{
FICL_UNS nCells; /* size of the stack */
CELL *pFrame; /* link reg for stack frame */
CELL *sp; /* stack pointer */
CELL base[1]; /* Top of stack */
} FICL_STACK;
/*
** Stack methods... many map closely to required Forth words.
*/
FICL_STACK *stackCreate (unsigned nCells);
void stackDelete (FICL_STACK *pStack);
int stackDepth (FICL_STACK *pStack);
void stackDrop (FICL_STACK *pStack, int n);
CELL stackFetch (FICL_STACK *pStack, int n);
CELL stackGetTop (FICL_STACK *pStack);
void stackLink (FICL_STACK *pStack, int nCells);
void stackPick (FICL_STACK *pStack, int n);
CELL stackPop (FICL_STACK *pStack);
void *stackPopPtr (FICL_STACK *pStack);
FICL_UNS stackPopUNS (FICL_STACK *pStack);
FICL_INT stackPopINT (FICL_STACK *pStack);
void stackPush (FICL_STACK *pStack, CELL c);
void stackPushPtr (FICL_STACK *pStack, void *ptr);
void stackPushUNS (FICL_STACK *pStack, FICL_UNS u);
void stackPushINT (FICL_STACK *pStack, FICL_INT i);
void stackReset (FICL_STACK *pStack);
void stackRoll (FICL_STACK *pStack, int n);
void stackSetTop (FICL_STACK *pStack, CELL c);
void stackStore (FICL_STACK *pStack, int n, CELL c);
void stackUnlink (FICL_STACK *pStack);
#if (FICL_WANT_FLOAT)
float stackPopFloat (FICL_STACK *pStack);
void stackPushFloat(FICL_STACK *pStack, FICL_FLOAT f);
#endif
/*
** Shortcuts (Guy Carver)
*/
#define PUSHPTR(p) stackPushPtr(pVM->pStack,p)
#define PUSHUNS(u) stackPushUNS(pVM->pStack,u)
#define PUSHINT(i) stackPushINT(pVM->pStack,i)
#define PUSHFLOAT(f) stackPushFloat(pVM->fStack,f)
#define PUSH(c) stackPush(pVM->pStack,c)
#define POPPTR() stackPopPtr(pVM->pStack)
#define POPUNS() stackPopUNS(pVM->pStack)
#define POPINT() stackPopINT(pVM->pStack)
#define POPFLOAT() stackPopFloat(pVM->fStack)
#define POP() stackPop(pVM->pStack)
#define GETTOP() stackGetTop(pVM->pStack)
#define SETTOP(c) stackSetTop(pVM->pStack,LVALUEtoCELL(c))
#define GETTOPF() stackGetTop(pVM->fStack)
#define SETTOPF(c) stackSetTop(pVM->fStack,LVALUEtoCELL(c))
#define STORE(n,c) stackStore(pVM->pStack,n,LVALUEtoCELL(c))
#define DEPTH() stackDepth(pVM->pStack)
#define DROP(n) stackDrop(pVM->pStack,n)
#define DROPF(n) stackDrop(pVM->fStack,n)
#define FETCH(n) stackFetch(pVM->pStack,n)
#define PICK(n) stackPick(pVM->pStack,n)
#define PICKF(n) stackPick(pVM->fStack,n)
#define ROLL(n) stackRoll(pVM->pStack,n)
#define ROLLF(n) stackRoll(pVM->fStack,n)
/*
** The virtual machine (VM) contains the state for one interpreter.
** Defined operations include:
** Create & initialize
** Delete
** Execute a block of text
** Parse a word out of the input stream
** Call return, and branch
** Text output
** Throw an exception
*/
typedef FICL_WORD ** IPTYPE; /* the VM's instruction pointer */
/*
** Each VM has a placeholder for an output function -
** this makes it possible to have each VM do I/O
** through a different device. If you specify no
** OUTFUNC, it defaults to ficlTextOut.
*/
typedef void (*OUTFUNC)(FICL_VM *pVM, char *text, int fNewline);
/*
** Each VM operates in one of two non-error states: interpreting
** or compiling. When interpreting, words are simply executed.
** When compiling, most words in the input stream have their
** addresses inserted into the word under construction. Some words
** (known as IMMEDIATE) are executed in the compile state, too.
*/
/* values of STATE */
#define INTERPRET 0
#define COMPILE 1
/*
** The pad is a small scratch area for text manipulation. ANS Forth
** requires it to hold at least 84 characters.
*/
#if !defined nPAD
#define nPAD 256
#endif
/*
** ANS Forth requires that a word's name contain {1..31} characters.
*/
#if !defined nFICLNAME
#define nFICLNAME 31
#endif
/*
** OK - now we can really define the VM...
*/
struct vm
{
FICL_SYSTEM *pSys; /* Which system this VM belongs to */
FICL_VM *link; /* Ficl keeps a VM list for simple teardown */
jmp_buf *pState; /* crude exception mechanism... */
OUTFUNC textOut; /* Output callback - see sysdep.c */
void * pExtend; /* vm extension pointer for app use - initialized from FICL_SYSTEM */
short fRestart; /* Set TRUE to restart runningWord */
IPTYPE ip; /* instruction pointer */
FICL_WORD *runningWord;/* address of currently running word (often just *(ip-1) ) */
FICL_UNS state; /* compiling or interpreting */
FICL_UNS base; /* number conversion base */
FICL_STACK *pStack; /* param stack */
FICL_STACK *rStack; /* return stack */
#if FICL_WANT_FLOAT
FICL_STACK *fStack; /* float stack (optional) */
#endif
CELL sourceID; /* -1 if EVALUATE, 0 if normal input */
TIB tib; /* address of incoming text string */
#if FICL_WANT_USER
CELL user[FICL_USER_CELLS];
#endif
char pad[nPAD]; /* the scratch area (see above) */
};
/*
** A FICL_CODE points to a function that gets called to help execute
** a word in the dictionary. It always gets passed a pointer to the
** running virtual machine, and from there it can get the address
** of the parameter area of the word it's supposed to operate on.
** For precompiled words, the code is all there is. For user defined
** words, the code assumes that the word's parameter area is a list
** of pointers to the code fields of other words to execute, and
** may also contain inline data. The first parameter is always
** a pointer to a code field.
*/
typedef void (*FICL_CODE)(FICL_VM *pVm);
#if 0
#define VM_ASSERT(pVM) assert((*(pVM->ip - 1)) == pVM->runningWord)
#else
#define VM_ASSERT(pVM)
#endif
/*
** Ficl models memory as a contiguous space divided into
** words in a linked list called the dictionary.
** A FICL_WORD starts each entry in the list.
** Version 1.02: space for the name characters is allotted from
** the dictionary ahead of the word struct, rather than using
** a fixed size array for each name.
*/
struct ficl_word
{
struct ficl_word *link; /* Previous word in the dictionary */
UNS16 hash;
UNS8 flags; /* Immediate, Smudge, Compile-only */
FICL_COUNT nName; /* Number of chars in word name */
char *name; /* First nFICLNAME chars of word name */
FICL_CODE code; /* Native code to execute the word */
CELL param[1]; /* First data cell of the word */
};
/*
** Worst-case size of a word header: nFICLNAME chars in name
*/
#define CELLS_PER_WORD \
( (sizeof (FICL_WORD) + nFICLNAME + sizeof (CELL)) \
/ (sizeof (CELL)) )
int wordIsImmediate(FICL_WORD *pFW);
int wordIsCompileOnly(FICL_WORD *pFW);
/* flag values for word header */
#define FW_IMMEDIATE 1 /* execute me even if compiling */
#define FW_COMPILE 2 /* error if executed when not compiling */
#define FW_SMUDGE 4 /* definition in progress - hide me */
#define FW_ISOBJECT 8 /* word is an object or object member variable */
#define FW_COMPIMMED (FW_IMMEDIATE | FW_COMPILE)
#define FW_DEFAULT 0
/*
** Exit codes for vmThrow
*/
#define VM_INNEREXIT -256 /* tell ficlExecXT to exit inner loop */
#define VM_OUTOFTEXT -257 /* hungry - normal exit */
#define VM_RESTART -258 /* word needs more text to succeed - re-run it */
#define VM_USEREXIT -259 /* user wants to quit */
#define VM_ERREXIT -260 /* interp found an error */
#define VM_BREAK -261 /* debugger breakpoint */
#define VM_ABORT -1 /* like errexit -- abort */
#define VM_ABORTQ -2 /* like errexit -- abort" */
#define VM_QUIT -56 /* like errexit, but leave pStack & base alone */
void vmBranchRelative(FICL_VM *pVM, int offset);
FICL_VM * vmCreate (FICL_VM *pVM, unsigned nPStack, unsigned nRStack);
void vmDelete (FICL_VM *pVM);
void vmExecute (FICL_VM *pVM, FICL_WORD *pWord);
FICL_DICT *vmGetDict (FICL_VM *pVM);
char * vmGetString (FICL_VM *pVM, FICL_STRING *spDest, char delimiter);
STRINGINFO vmGetWord (FICL_VM *pVM);
STRINGINFO vmGetWord0 (FICL_VM *pVM);
int vmGetWordToPad (FICL_VM *pVM);
STRINGINFO vmParseString (FICL_VM *pVM, char delimiter);
STRINGINFO vmParseStringEx(FICL_VM *pVM, char delimiter, char fSkipLeading);
CELL vmPop (FICL_VM *pVM);
void vmPush (FICL_VM *pVM, CELL c);
void vmPopIP (FICL_VM *pVM);
void vmPushIP (FICL_VM *pVM, IPTYPE newIP);
void vmQuit (FICL_VM *pVM);
void vmReset (FICL_VM *pVM);
void vmSetTextOut (FICL_VM *pVM, OUTFUNC textOut);
void vmTextOut (FICL_VM *pVM, char *text, int fNewline);
void vmTextOut (FICL_VM *pVM, char *text, int fNewline);
void vmThrow (FICL_VM *pVM, int except);
void vmThrowErr (FICL_VM *pVM, char *fmt, ...);
#define vmGetRunningWord(pVM) ((pVM)->runningWord)
/*
** The inner interpreter - coded as a macro (see note for
** INLINE_INNER_LOOP in sysdep.h for complaints about VC++ 5
*/
#define M_VM_STEP(pVM) \
FICL_WORD *tempFW = *(pVM)->ip++; \
(pVM)->runningWord = tempFW; \
tempFW->code(pVM);
#define M_INNER_LOOP(pVM) \
for (;;) { M_VM_STEP(pVM) }
#if INLINE_INNER_LOOP != 0
#define vmInnerLoop(pVM) M_INNER_LOOP(pVM)
#else
void vmInnerLoop(FICL_VM *pVM);
#endif
/*
** vmCheckStack needs a vm pointer because it might have to say
** something if it finds a problem. Parms popCells and pushCells
** correspond to the number of parameters on the left and right of
** a word's stack effect comment.
*/
void vmCheckStack(FICL_VM *pVM, int popCells, int pushCells);
#if FICL_WANT_FLOAT
void vmCheckFStack(FICL_VM *pVM, int popCells, int pushCells);
#endif
/*
** TIB access routines...
** ANS forth seems to require the input buffer to be represented
** as a pointer to the start of the buffer, and an index to the
** next character to read.
** PushTib points the VM to a new input string and optionally
** returns a copy of the current state
** PopTib restores the TIB state given a saved TIB from PushTib
** GetInBuf returns a pointer to the next unused char of the TIB
*/
void vmPushTib (FICL_VM *pVM, char *text, FICL_INT nChars, TIB *pSaveTib);
void vmPopTib (FICL_VM *pVM, TIB *pTib);
#define vmGetInBuf(pVM) ((pVM)->tib.cp + (pVM)->tib.index)
#define vmGetInBufLen(pVM) ((pVM)->tib.end - (pVM)->tib.cp)
#define vmGetInBufEnd(pVM) ((pVM)->tib.end)
#define vmGetTibIndex(pVM) (pVM)->tib.index
#define vmSetTibIndex(pVM, i) (pVM)->tib.index = i
#define vmUpdateTib(pVM, str) (pVM)->tib.index = (str) - (pVM)->tib.cp
/*
** Generally useful string manipulators omitted by ANSI C...
** ltoa complements strtol
*/
#if defined(_WIN32) && !FICL_MAIN
/* #SHEESH
** Why do Microsoft Meatballs insist on contaminating
** my namespace with their string functions???
*/
#pragma warning(disable: 4273)
#endif
int isPowerOfTwo(FICL_UNS u);
char *ltoa( FICL_INT value, char *string, int radix );
char *ultoa(FICL_UNS value, char *string, int radix );
char digit_to_char(int value);
char *strrev( char *string );
char *skipSpace(char *cp, char *end);
char *caseFold(char *cp);
int strincmp(char *cp1, char *cp2, FICL_UNS count);
#if defined(_WIN32) && !FICL_MAIN
#pragma warning(default: 4273)
#endif
/*
** Ficl hash table - variable size.
** assert(size > 0)
** If size is 1, the table degenerates into a linked list.
** A WORDLIST (see the search order word set in DPANS) is
** just a pointer to a FICL_HASH in this implementation.
*/
#if !defined HASHSIZE /* Default size of hash table. For most uniform */
#define HASHSIZE 241 /* performance, use a prime number! */
#endif
typedef struct ficl_hash
{
struct ficl_hash *link; /* link to parent class wordlist for OO */
char *name; /* optional pointer to \0 terminated wordlist name */
unsigned size; /* number of buckets in the hash */
FICL_WORD *table[1];
} FICL_HASH;
void hashForget (FICL_HASH *pHash, void *where);
UNS16 hashHashCode (STRINGINFO si);
void hashInsertWord(FICL_HASH *pHash, FICL_WORD *pFW);
FICL_WORD *hashLookup (FICL_HASH *pHash, STRINGINFO si, UNS16 hashCode);
void hashReset (FICL_HASH *pHash);
/*
** A Dictionary is a linked list of FICL_WORDs. It is also Ficl's
** memory model. Description of fields:
**
** here -- points to the next free byte in the dictionary. This
** pointer is forced to be CELL-aligned before a definition is added.
** Do not assume any specific alignment otherwise - Use dictAlign().
**
** smudge -- pointer to word currently being defined (or last defined word)
** If the definition completes successfully, the word will be
** linked into the hash table. If unsuccessful, dictUnsmudge
** uses this pointer to restore the previous state of the dictionary.
** Smudge prevents unintentional recursion as a side-effect: the
** dictionary search algo examines only completed definitions, so a
** word cannot invoke itself by name. See the ficl word "recurse".
** NOTE: smudge always points to the last word defined. IMMEDIATE
** makes use of this fact. Smudge is initially NULL.
**
** pForthWords -- pointer to the default wordlist (FICL_HASH).
** This is the initial compilation list, and contains all
** ficl's precompiled words.
**
** pCompile -- compilation wordlist - initially equal to pForthWords
** pSearch -- array of pointers to wordlists. Managed as a stack.
** Highest index is the first list in the search order.
** nLists -- number of lists in pSearch. nLists-1 is the highest
** filled slot in pSearch, and points to the first wordlist
** in the search order
** size -- number of cells in the dictionary (total)
** dict -- start of data area. Must be at the end of the struct.
*/
struct ficl_dict
{
CELL *here;
FICL_WORD *smudge;
FICL_HASH *pForthWords;
FICL_HASH *pCompile;
FICL_HASH *pSearch[FICL_DEFAULT_VOCS];
int nLists;
unsigned size; /* Number of cells in dict (total)*/
CELL *dict; /* Base of dictionary memory */
};
void *alignPtr(void *ptr);
void dictAbortDefinition(FICL_DICT *pDict);
void dictAlign (FICL_DICT *pDict);
int dictAllot (FICL_DICT *pDict, int n);
int dictAllotCells (FICL_DICT *pDict, int nCells);
void dictAppendCell (FICL_DICT *pDict, CELL c);
void dictAppendChar (FICL_DICT *pDict, char c);
FICL_WORD *dictAppendWord (FICL_DICT *pDict,
char *name,
FICL_CODE pCode,
UNS8 flags);
FICL_WORD *dictAppendWord2(FICL_DICT *pDict,
STRINGINFO si,
FICL_CODE pCode,
UNS8 flags);
void dictAppendUNS (FICL_DICT *pDict, FICL_UNS u);
int dictCellsAvail (FICL_DICT *pDict);
int dictCellsUsed (FICL_DICT *pDict);
void dictCheck (FICL_DICT *pDict, FICL_VM *pVM, int n);
void dictCheckThreshold(FICL_DICT* dp);
FICL_DICT *dictCreate(unsigned nCELLS);
FICL_DICT *dictCreateHashed(unsigned nCells, unsigned nHash);
FICL_HASH *dictCreateWordlist(FICL_DICT *dp, int nBuckets);
void dictDelete (FICL_DICT *pDict);
void dictEmpty (FICL_DICT *pDict, unsigned nHash);
#if FICL_WANT_FLOAT
void dictHashSummary(FICL_VM *pVM);
#endif
int dictIncludes (FICL_DICT *pDict, void *p);
FICL_WORD *dictLookup (FICL_DICT *pDict, STRINGINFO si);
#if FICL_WANT_LOCALS
FICL_WORD *ficlLookupLoc (FICL_SYSTEM *pSys, STRINGINFO si);
#endif
void dictResetSearchOrder(FICL_DICT *pDict);
void dictSetFlags (FICL_DICT *pDict, UNS8 set, UNS8 clr);
void dictSetImmediate(FICL_DICT *pDict);
void dictUnsmudge (FICL_DICT *pDict);
CELL *dictWhere (FICL_DICT *pDict);
/*
** P A R S E S T E P
** (New for 2.05)
** See words.c: interpWord
** By default, ficl goes through two attempts to parse each token from its input
** stream: it first attempts to match it with a word in the dictionary, and
** if that fails, it attempts to convert it into a number. This mechanism is now
** extensible by additional steps. This allows extensions like floating point and
** double number support to be factored cleanly.
**
** Each parse step is a function that receives the next input token as a STRINGINFO.
** If the parse step matches the token, it must apply semantics to the token appropriate
** to the present value of VM.state (compiling or interpreting), and return FICL_TRUE.
** Otherwise it returns FICL_FALSE. See words.c: isNumber for an example
**
** Note: for the sake of efficiency, it's a good idea both to limit the number
** of parse steps and to code each parse step so that it rejects tokens that
** do not match as quickly as possible.
*/
typedef int (*FICL_PARSE_STEP)(FICL_VM *pVM, STRINGINFO si);
/*
** Appends a parse step function to the end of the parse list (see
** FICL_PARSE_STEP notes in ficl.h for details). Returns 0 if successful,
** nonzero if there's no more room in the list. Each parse step is a word in
** the dictionary. Precompiled parse steps can use (PARSE-STEP) as their
** CFA - see parenParseStep in words.c.
*/
int ficlAddParseStep(FICL_SYSTEM *pSys, FICL_WORD *pFW); /* ficl.c */
void ficlAddPrecompiledParseStep(FICL_SYSTEM *pSys, char *name, FICL_PARSE_STEP pStep);
void ficlListParseSteps(FICL_VM *pVM);
/*
** FICL_BREAKPOINT record.
** origXT - if NULL, this breakpoint is unused. Otherwise it stores the xt
** that the breakpoint overwrote. This is restored to the dictionary when the
** BP executes or gets cleared
** address - the location of the breakpoint (address of the instruction that
** has been replaced with the breakpoint trap
** origXT - The original contents of the location with the breakpoint
** Note: address is NULL when this breakpoint is empty
*/
typedef struct FICL_BREAKPOINT
{
void *address;
FICL_WORD *origXT;
} FICL_BREAKPOINT;
/*
** F I C L _ S Y S T E M
** The top level data structure of the system - ficl_system ties a list of
** virtual machines with their corresponding dictionaries. Ficl 3.0 will
** support multiple Ficl systems, allowing multiple concurrent sessions
** to separate dictionaries with some constraints.
** The present model allows multiple sessions to one dictionary provided
** you implement ficlLockDictionary() as specified in sysdep.h
** Note: the pExtend pointer is there to provide context for applications. It is copied
** to each VM's pExtend field as that VM is created.
*/
struct ficl_system
{
FICL_SYSTEM *link;
void *pExtend; /* Initializes VM's pExtend pointer (for application use) */
FICL_VM *vmList;
FICL_DICT *dp;
FICL_DICT *envp;
#ifdef FICL_WANT_LOCALS
FICL_DICT *localp;
#endif
FICL_WORD *pInterp[3];
FICL_WORD *parseList[FICL_MAX_PARSE_STEPS];
OUTFUNC textOut;
FICL_WORD *pBranchParen;
FICL_WORD *pDoParen;
FICL_WORD *pDoesParen;
FICL_WORD *pExitInner;
FICL_WORD *pExitParen;
FICL_WORD *pBranch0;
FICL_WORD *pInterpret;
FICL_WORD *pLitParen;
FICL_WORD *pTwoLitParen;
FICL_WORD *pLoopParen;
FICL_WORD *pPLoopParen;
FICL_WORD *pQDoParen;
FICL_WORD *pSemiParen;
FICL_WORD *pOfParen;
FICL_WORD *pStore;
FICL_WORD *pDrop;
FICL_WORD *pCStringLit;
FICL_WORD *pStringLit;
#if FICL_WANT_LOCALS
FICL_WORD *pGetLocalParen;
FICL_WORD *pGet2LocalParen;
FICL_WORD *pGetLocal0;
FICL_WORD *pGetLocal1;
FICL_WORD *pToLocalParen;
FICL_WORD *pTo2LocalParen;
FICL_WORD *pToLocal0;
FICL_WORD *pToLocal1;
FICL_WORD *pLinkParen;
FICL_WORD *pUnLinkParen;
FICL_INT nLocals;
CELL *pMarkLocals;
#endif
FICL_BREAKPOINT bpStep;
};
struct ficl_system_info
{
int size; /* structure size tag for versioning */
int nDictCells; /* Size of system's Dictionary */
OUTFUNC textOut; /* default textOut function */
void *pExtend; /* Initializes VM's pExtend pointer - for application use */
int nEnvCells; /* Size of Environment dictionary */
};
#define ficlInitInfo(x) { memset((x), 0, sizeof(FICL_SYSTEM_INFO)); \
(x)->size = sizeof(FICL_SYSTEM_INFO); }
/*
** External interface to FICL...
*/
/*
** f i c l I n i t S y s t e m
** Binds a global dictionary to the interpreter system and initializes
** the dict to contain the ANSI CORE wordset.
** You can specify the address and size of the allocated area.
** Using ficlInitSystemEx you can also specify the text output function.
** After that, ficl manages it.
** First step is to set up the static pointers to the area.
** Then write the "precompiled" portion of the dictionary in.
** The dictionary needs to be at least large enough to hold the
** precompiled part. Try 1K cells minimum. Use "words" to find
** out how much of the dictionary is used at any time.
*/
FICL_SYSTEM *ficlInitSystemEx(FICL_SYSTEM_INFO *fsi);
/* Deprecated call */
FICL_SYSTEM *ficlInitSystem(int nDictCells);
/*
** f i c l T e r m S y s t e m
** Deletes the system dictionary and all virtual machines that
** were created with ficlNewVM (see below). Call this function to
** reclaim all memory used by the dictionary and VMs.
*/
void ficlTermSystem(FICL_SYSTEM *pSys);
/*
** f i c l E v a l u a t e
** Evaluates a block of input text in the context of the
** specified interpreter. Also sets SOURCE-ID properly.
**
** PLEASE USE THIS FUNCTION when throwing a hard-coded
** string to the FICL interpreter.
*/
int ficlEvaluate(FICL_VM *pVM, char *pText);
/*
** f i c l E x e c
** Evaluates a block of input text in the context of the
** specified interpreter. Emits any requested output to the
** interpreter's output function. If the input string is NULL
** terminated, you can pass -1 as nChars rather than count it.
** Execution returns when the text block has been executed,
** or an error occurs.
** Returns one of the VM_XXXX codes defined in ficl.h:
** VM_OUTOFTEXT is the normal exit condition
** VM_ERREXIT means that the interp encountered a syntax error
** and the vm has been reset to recover (some or all
** of the text block got ignored
** VM_USEREXIT means that the user executed the "bye" command
** to shut down the interpreter. This would be a good
** time to delete the vm, etc -- or you can ignore this
** signal.
** VM_ABORT and VM_ABORTQ are generated by 'abort' and 'abort"'
** commands.
** Preconditions: successful execution of ficlInitSystem,
** Successful creation and init of the VM by ficlNewVM (or equiv)
**
** If you call ficlExec() or one of its brothers, you MUST
** ensure pVM->sourceID was set to a sensible value.
** ficlExec() explicitly DOES NOT manage SOURCE-ID for you.
*/
int ficlExec (FICL_VM *pVM, char *pText);
int ficlExecC(FICL_VM *pVM, char *pText, FICL_INT nChars);
int ficlExecXT(FICL_VM *pVM, FICL_WORD *pWord);
/*
** ficlExecFD(FICL_VM *pVM, int fd);
* Evaluates text from file passed in via fd.
* Execution returns when all of file has been executed or an
* error occurs.
*/
int ficlExecFD(FICL_VM *pVM, int fd);
/*
** Create a new VM from the heap, and link it into the system VM list.
** Initializes the VM and binds default sized stacks to it. Returns the
** address of the VM, or NULL if an error occurs.
** Precondition: successful execution of ficlInitSystem
*/
FICL_VM *ficlNewVM(FICL_SYSTEM *pSys);
/*
** Force deletion of a VM. You do not need to do this
** unless you're creating and discarding a lot of VMs.
** For systems that use a constant pool of VMs for the life
** of the system, ficltermSystem takes care of VM cleanup
** automatically.
*/
void ficlFreeVM(FICL_VM *pVM);
/*
** Set the stack sizes (return and parameter) to be used for all
** subsequently created VMs. Returns actual stack size to be used.
*/
int ficlSetStackSize(int nStackCells);
/*
** Returns the address of the most recently defined word in the system
** dictionary with the given name, or NULL if no match.
** Precondition: successful execution of ficlInitSystem
*/
FICL_WORD *ficlLookup(FICL_SYSTEM *pSys, char *name);
/*
** f i c l G e t D i c t
** Utility function - returns the address of the system dictionary.
** Precondition: successful execution of ficlInitSystem
*/
FICL_DICT *ficlGetDict(FICL_SYSTEM *pSys);
FICL_DICT *ficlGetEnv (FICL_SYSTEM *pSys);
void ficlSetEnv (FICL_SYSTEM *pSys, char *name, FICL_UNS value);
void ficlSetEnvD(FICL_SYSTEM *pSys, char *name, FICL_UNS hi, FICL_UNS lo);
#if FICL_WANT_LOCALS
FICL_DICT *ficlGetLoc (FICL_SYSTEM *pSys);
#endif
/*
** f i c l B u i l d
** Builds a word into the system default dictionary in a thread-safe way.
** Preconditions: system must be initialized, and there must
** be enough space for the new word's header! Operation is
** controlled by ficlLockDictionary, so any initialization
** required by your version of the function (if you "overrode"
** it) must be complete at this point.
** Parameters:
** name -- the name of the word to be built
** code -- code to execute when the word is invoked - must take a single param
** pointer to a FICL_VM
** flags -- 0 or more of FW_IMMEDIATE, FW_COMPILE, use bitwise OR!
** Most words can use FW_DEFAULT.
** nAllot - number of extra cells to allocate in the parameter area (usually zero)
*/
int ficlBuild(FICL_SYSTEM *pSys, char *name, FICL_CODE code, char flags);
/*
** f i c l C o m p i l e C o r e
** Builds the ANS CORE wordset into the dictionary - called by
** ficlInitSystem - no need to waste dict space by doing it again.
*/
void ficlCompileCore(FICL_SYSTEM *pSys);
void ficlCompilePrefix(FICL_SYSTEM *pSys);
void ficlCompileSearch(FICL_SYSTEM *pSys);
void ficlCompileSoftCore(FICL_SYSTEM *pSys);
void ficlCompileTools(FICL_SYSTEM *pSys);
void ficlCompileFile(FICL_SYSTEM *pSys);
#if FICL_WANT_FLOAT
void ficlCompileFloat(FICL_SYSTEM *pSys);
int ficlParseFloatNumber( FICL_VM *pVM, STRINGINFO si ); /* float.c */
#endif
#if FICL_PLATFORM_EXTEND
void ficlCompilePlatform(FICL_SYSTEM *pSys);
#endif
int ficlParsePrefix(FICL_VM *pVM, STRINGINFO si);
/*
** from words.c...
*/
void constantParen(FICL_VM *pVM);
void twoConstParen(FICL_VM *pVM);
int ficlParseNumber(FICL_VM *pVM, STRINGINFO si);
void ficlTick(FICL_VM *pVM);
void parseStepParen(FICL_VM *pVM);
/*
** From tools.c
*/
int isAFiclWord(FICL_DICT *pd, FICL_WORD *pFW);
/*
** The following supports SEE and the debugger.
*/
typedef enum
{
BRANCH,
COLON,
CONSTANT,
CREATE,
DO,
DOES,
IF,
LITERAL,
LOOP,
OF,
PLOOP,
PRIMITIVE,
QDO,
STRINGLIT,
CSTRINGLIT,
#if FICL_WANT_USER
USER,
#endif
VARIABLE,
} WORDKIND;
WORDKIND ficlWordClassify(FICL_WORD *pFW);
/*
** Dictionary on-demand resizing
*/
extern CELL dictThreshold;
extern CELL dictIncrease;
/*
** Various FreeBSD goodies
*/
#if defined(__i386__) && !defined(TESTMAIN)
extern void ficlOutb(FICL_VM *pVM);
extern void ficlInb(FICL_VM *pVM);
#endif
extern void ficlSetenv(FICL_VM *pVM);
extern void ficlSetenvq(FICL_VM *pVM);
extern void ficlGetenv(FICL_VM *pVM);
extern void ficlUnsetenv(FICL_VM *pVM);
extern void ficlCopyin(FICL_VM *pVM);
extern void ficlCopyout(FICL_VM *pVM);
extern void ficlFindfile(FICL_VM *pVM);
extern void ficlCcall(FICL_VM *pVM);
#if !defined(TESTMAIN)
extern void ficlPnpdevices(FICL_VM *pVM);
extern void ficlPnphandlers(FICL_VM *pVM);
#endif
/*
** Used with File-Access wordset.
*/
#define FICL_FAM_READ 1
#define FICL_FAM_WRITE 2
#define FICL_FAM_APPEND 4
#define FICL_FAM_BINARY 8
#define FICL_FAM_OPEN_MODE(fam) ((fam) & (FICL_FAM_READ | FICL_FAM_WRITE | FICL_FAM_APPEND))
#if (FICL_WANT_FILE)
typedef struct ficlFILE
{
FILE *f;
char filename[256];
} ficlFILE;
#endif
#include <sys/linker_set.h>
typedef void ficlCompileFcn(FICL_SYSTEM *);
#define FICL_COMPILE_SET(func) \
DATA_SET(Xficl_compile_set, func)
SET_DECLARE(Xficl_compile_set, ficlCompileFcn);
#ifdef LOADER_VERIEXEC
#include <verify_file.h>
#endif
#ifdef __cplusplus
}
#endif
#endif /* __FICL_H__ */
diff --git a/stand/ficl/fileaccess.c b/stand/ficl/fileaccess.c
index 9dd23f9d34b8..a66262fb2bf3 100644
--- a/stand/ficl/fileaccess.c
+++ b/stand/ficl/fileaccess.c
@@ -1,432 +1,431 @@
-/* $FreeBSD$ */
#include <errno.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <sys/stat.h>
#include "ficl.h"
#if FICL_WANT_FILE
/*
**
** fileaccess.c
**
** Implements all of the File Access word set that can be implemented in portable C.
**
*/
static void pushIor(FICL_VM *pVM, int success)
{
int ior;
if (success)
ior = 0;
else
ior = errno;
stackPushINT(pVM->pStack, ior);
}
static void ficlFopen(FICL_VM *pVM, char *writeMode) /* ( c-addr u fam -- fileid ior ) */
{
int fam = stackPopINT(pVM->pStack);
int length = stackPopINT(pVM->pStack);
void *address = (void *)stackPopPtr(pVM->pStack);
char mode[4];
FILE *f;
char *filename = (char *)alloca(length + 1);
memcpy(filename, address, length);
filename[length] = 0;
*mode = 0;
switch (FICL_FAM_OPEN_MODE(fam))
{
case 0:
stackPushPtr(pVM->pStack, NULL);
stackPushINT(pVM->pStack, EINVAL);
return;
case FICL_FAM_READ:
strcat(mode, "r");
break;
case FICL_FAM_WRITE:
strcat(mode, writeMode);
break;
case FICL_FAM_READ | FICL_FAM_WRITE:
strcat(mode, writeMode);
strcat(mode, "+");
break;
}
strcat(mode, (fam & FICL_FAM_BINARY) ? "b" : "t");
f = fopen(filename, mode);
if (f == NULL)
stackPushPtr(pVM->pStack, NULL);
else
#ifdef LOADER_VERIEXEC
if (*mode == 'r' &&
verify_file(fileno(f), filename, 0, VE_GUESS, __func__) < 0) {
fclose(f);
stackPushPtr(pVM->pStack, NULL);
} else
#endif
{
ficlFILE *ff = (ficlFILE *)malloc(sizeof(ficlFILE));
strcpy(ff->filename, filename);
ff->f = f;
stackPushPtr(pVM->pStack, ff);
fseek(f, 0, SEEK_SET);
}
pushIor(pVM, f != NULL);
}
static void ficlOpenFile(FICL_VM *pVM) /* ( c-addr u fam -- fileid ior ) */
{
ficlFopen(pVM, "a");
}
static void ficlCreateFile(FICL_VM *pVM) /* ( c-addr u fam -- fileid ior ) */
{
ficlFopen(pVM, "w");
}
static int closeFiclFILE(ficlFILE *ff) /* ( fileid -- ior ) */
{
FILE *f = ff->f;
free(ff);
return !fclose(f);
}
static void ficlCloseFile(FICL_VM *pVM) /* ( fileid -- ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
pushIor(pVM, closeFiclFILE(ff));
}
static void ficlDeleteFile(FICL_VM *pVM) /* ( c-addr u -- ior ) */
{
int length = stackPopINT(pVM->pStack);
void *address = (void *)stackPopPtr(pVM->pStack);
char *filename = (char *)alloca(length + 1);
memcpy(filename, address, length);
filename[length] = 0;
pushIor(pVM, !unlink(filename));
}
static void ficlRenameFile(FICL_VM *pVM) /* ( c-addr1 u1 c-addr2 u2 -- ior ) */
{
int length;
void *address;
char *from;
char *to;
length = stackPopINT(pVM->pStack);
address = (void *)stackPopPtr(pVM->pStack);
to = (char *)alloca(length + 1);
memcpy(to, address, length);
to[length] = 0;
length = stackPopINT(pVM->pStack);
address = (void *)stackPopPtr(pVM->pStack);
from = (char *)alloca(length + 1);
memcpy(from, address, length);
from[length] = 0;
pushIor(pVM, !rename(from, to));
}
static void ficlFileStatus(FICL_VM *pVM) /* ( c-addr u -- x ior ) */
{
struct stat statbuf;
int length = stackPopINT(pVM->pStack);
void *address = (void *)stackPopPtr(pVM->pStack);
char *filename = (char *)alloca(length + 1);
memcpy(filename, address, length);
filename[length] = 0;
if (stat(filename, &statbuf) == 0)
{
/*
** the "x" left on the stack is implementation-defined.
** I push the file's access mode (readable, writeable, is directory, etc)
** as defined by ANSI C.
*/
stackPushINT(pVM->pStack, statbuf.st_mode);
stackPushINT(pVM->pStack, 0);
}
else
{
stackPushINT(pVM->pStack, -1);
stackPushINT(pVM->pStack, ENOENT);
}
}
static void ficlFilePosition(FICL_VM *pVM) /* ( fileid -- ud ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
long ud = ftell(ff->f);
stackPushINT(pVM->pStack, ud);
pushIor(pVM, ud != -1);
}
static long fileSize(FILE *f)
{
struct stat statbuf;
statbuf.st_size = -1;
if (fstat(fileno(f), &statbuf) != 0)
return -1;
return statbuf.st_size;
}
static void ficlFileSize(FICL_VM *pVM) /* ( fileid -- ud ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
long ud = fileSize(ff->f);
stackPushINT(pVM->pStack, ud);
pushIor(pVM, ud != -1);
}
#define nLINEBUF 256
static void ficlIncludeFile(FICL_VM *pVM) /* ( i*x fileid -- j*x ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
CELL id = pVM->sourceID;
int result = VM_OUTOFTEXT;
long currentPosition, totalSize;
long size;
pVM->sourceID.p = (void *)ff;
currentPosition = ftell(ff->f);
totalSize = fileSize(ff->f);
size = totalSize - currentPosition;
if ((totalSize != -1) && (currentPosition != -1) && (size > 0))
{
char *buffer = (char *)malloc(size);
long got = fread(buffer, 1, size, ff->f);
if (got == size)
result = ficlExecC(pVM, buffer, size);
}
#if 0
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
CELL id = pVM->sourceID;
char cp[nLINEBUF];
int nLine = 0;
int keepGoing;
int result;
pVM->sourceID.p = (void *)ff;
/* feed each line to ficlExec */
keepGoing = TRUE;
while (keepGoing && fgets(cp, nLINEBUF, ff->f))
{
int len = strlen(cp) - 1;
nLine++;
if (len <= 0)
continue;
if (cp[len] == '\n')
cp[len] = '\0';
result = ficlExec(pVM, cp);
switch (result)
{
case VM_OUTOFTEXT:
case VM_USEREXIT:
break;
default:
pVM->sourceID = id;
keepGoing = FALSE;
break;
}
}
#endif /* 0 */
/*
** Pass an empty line with SOURCE-ID == -1 to flush
** any pending REFILLs (as required by FILE wordset)
*/
pVM->sourceID.i = -1;
ficlExec(pVM, "");
pVM->sourceID = id;
closeFiclFILE(ff);
}
static void ficlReadFile(FICL_VM *pVM) /* ( c-addr u1 fileid -- u2 ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
int length = stackPopINT(pVM->pStack);
void *address = (void *)stackPopPtr(pVM->pStack);
int result;
clearerr(ff->f);
result = fread(address, 1, length, ff->f);
stackPushINT(pVM->pStack, result);
pushIor(pVM, ferror(ff->f) == 0);
}
static void ficlReadLine(FICL_VM *pVM) /* ( c-addr u1 fileid -- u2 flag ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
int length = stackPopINT(pVM->pStack);
char *address = (char *)stackPopPtr(pVM->pStack);
int error;
int flag;
if (feof(ff->f))
{
stackPushINT(pVM->pStack, -1);
stackPushINT(pVM->pStack, 0);
stackPushINT(pVM->pStack, 0);
return;
}
clearerr(ff->f);
*address = 0;
fgets(address, length, ff->f);
error = ferror(ff->f);
if (error != 0)
{
stackPushINT(pVM->pStack, -1);
stackPushINT(pVM->pStack, 0);
stackPushINT(pVM->pStack, error);
return;
}
length = strlen(address);
flag = (length > 0);
if (length && ((address[length - 1] == '\r') || (address[length - 1] == '\n')))
length--;
stackPushINT(pVM->pStack, length);
stackPushINT(pVM->pStack, flag);
stackPushINT(pVM->pStack, 0); /* ior */
}
static void ficlWriteFile(FICL_VM *pVM) /* ( c-addr u1 fileid -- ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
int length = stackPopINT(pVM->pStack);
void *address = (void *)stackPopPtr(pVM->pStack);
clearerr(ff->f);
fwrite(address, 1, length, ff->f);
pushIor(pVM, ferror(ff->f) == 0);
}
static void ficlWriteLine(FICL_VM *pVM) /* ( c-addr u1 fileid -- ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
size_t length = (size_t)stackPopINT(pVM->pStack);
void *address = (void *)stackPopPtr(pVM->pStack);
clearerr(ff->f);
if (fwrite(address, 1, length, ff->f) == length)
fwrite("\n", 1, 1, ff->f);
pushIor(pVM, ferror(ff->f) == 0);
}
static void ficlRepositionFile(FICL_VM *pVM) /* ( ud fileid -- ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
size_t ud = (size_t)stackPopINT(pVM->pStack);
pushIor(pVM, fseek(ff->f, ud, SEEK_SET) == 0);
}
static void ficlFlushFile(FICL_VM *pVM) /* ( fileid -- ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
pushIor(pVM, fflush(ff->f) == 0);
}
#if FICL_HAVE_FTRUNCATE
static void ficlResizeFile(FICL_VM *pVM) /* ( ud fileid -- ior ) */
{
ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack);
size_t ud = (size_t)stackPopINT(pVM->pStack);
pushIor(pVM, ftruncate(fileno(ff->f), ud) == 0);
}
#endif /* FICL_HAVE_FTRUNCATE */
#endif /* FICL_WANT_FILE */
void ficlCompileFile(FICL_SYSTEM *pSys)
{
#if FICL_WANT_FILE
FICL_DICT *dp = pSys->dp;
assert(dp);
dictAppendWord(dp, "create-file", ficlCreateFile, FW_DEFAULT);
dictAppendWord(dp, "open-file", ficlOpenFile, FW_DEFAULT);
dictAppendWord(dp, "close-file", ficlCloseFile, FW_DEFAULT);
dictAppendWord(dp, "include-file", ficlIncludeFile, FW_DEFAULT);
dictAppendWord(dp, "read-file", ficlReadFile, FW_DEFAULT);
dictAppendWord(dp, "read-line", ficlReadLine, FW_DEFAULT);
dictAppendWord(dp, "write-file", ficlWriteFile, FW_DEFAULT);
dictAppendWord(dp, "write-line", ficlWriteLine, FW_DEFAULT);
dictAppendWord(dp, "file-position", ficlFilePosition, FW_DEFAULT);
dictAppendWord(dp, "file-size", ficlFileSize, FW_DEFAULT);
dictAppendWord(dp, "reposition-file", ficlRepositionFile, FW_DEFAULT);
dictAppendWord(dp, "file-status", ficlFileStatus, FW_DEFAULT);
dictAppendWord(dp, "flush-file", ficlFlushFile, FW_DEFAULT);
dictAppendWord(dp, "delete-file", ficlDeleteFile, FW_DEFAULT);
dictAppendWord(dp, "rename-file", ficlRenameFile, FW_DEFAULT);
#ifdef FICL_HAVE_FTRUNCATE
dictAppendWord(dp, "resize-file", ficlResizeFile, FW_DEFAULT);
ficlSetEnv(pSys, "file", FICL_TRUE);
ficlSetEnv(pSys, "file-ext", FICL_TRUE);
#endif /* FICL_HAVE_FTRUNCATE */
#else
(void)pSys;
#endif /* FICL_WANT_FILE */
}
diff --git a/stand/ficl/float.c b/stand/ficl/float.c
index dfd1456c8dac..895252b60f20 100644
--- a/stand/ficl/float.c
+++ b/stand/ficl/float.c
@@ -1,1067 +1,1066 @@
/*******************************************************************
** f l o a t . c
** Forth Inspired Command Language
** ANS Forth FLOAT word-set written in C
** Author: Guy Carver & John Sadler (john_sadler@alum.mit.edu)
** Created: Apr 2001
** $Id: float.c,v 1.8 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include "ficl.h"
#if FICL_WANT_FLOAT
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
/*******************************************************************
** Do float addition r1 + r2.
** f+ ( r1 r2 -- r )
*******************************************************************/
static void Fadd(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 1);
#endif
f = POPFLOAT();
f += GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do float subtraction r1 - r2.
** f- ( r1 r2 -- r )
*******************************************************************/
static void Fsub(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 1);
#endif
f = POPFLOAT();
f = GETTOPF().f - f;
SETTOPF(f);
}
/*******************************************************************
** Do float multiplication r1 * r2.
** f* ( r1 r2 -- r )
*******************************************************************/
static void Fmul(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 1);
#endif
f = POPFLOAT();
f *= GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do float negation.
** fnegate ( r -- r )
*******************************************************************/
static void Fnegate(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 1);
#endif
f = -GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do float division r1 / r2.
** f/ ( r1 r2 -- r )
*******************************************************************/
static void Fdiv(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 1);
#endif
f = POPFLOAT();
f = GETTOPF().f / f;
SETTOPF(f);
}
/*******************************************************************
** Do float + integer r + n.
** f+i ( r n -- r )
*******************************************************************/
static void Faddi(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 1);
vmCheckStack(pVM, 1, 0);
#endif
f = (FICL_FLOAT)POPINT();
f += GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do float - integer r - n.
** f-i ( r n -- r )
*******************************************************************/
static void Fsubi(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 1);
vmCheckStack(pVM, 1, 0);
#endif
f = GETTOPF().f;
f -= (FICL_FLOAT)POPINT();
SETTOPF(f);
}
/*******************************************************************
** Do float * integer r * n.
** f*i ( r n -- r )
*******************************************************************/
static void Fmuli(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 1);
vmCheckStack(pVM, 1, 0);
#endif
f = (FICL_FLOAT)POPINT();
f *= GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do float / integer r / n.
** f/i ( r n -- r )
*******************************************************************/
static void Fdivi(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 1);
vmCheckStack(pVM, 1, 0);
#endif
f = GETTOPF().f;
f /= (FICL_FLOAT)POPINT();
SETTOPF(f);
}
/*******************************************************************
** Do integer - float n - r.
** i-f ( n r -- r )
*******************************************************************/
static void isubf(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 1);
vmCheckStack(pVM, 1, 0);
#endif
f = (FICL_FLOAT)POPINT();
f -= GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do integer / float n / r.
** i/f ( n r -- r )
*******************************************************************/
static void idivf(FICL_VM *pVM)
{
FICL_FLOAT f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1,1);
vmCheckStack(pVM, 1, 0);
#endif
f = (FICL_FLOAT)POPINT();
f /= GETTOPF().f;
SETTOPF(f);
}
/*******************************************************************
** Do integer to float conversion.
** int>float ( n -- r )
*******************************************************************/
static void itof(FICL_VM *pVM)
{
float f;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
vmCheckFStack(pVM, 0, 1);
#endif
f = (float)POPINT();
PUSHFLOAT(f);
}
/*******************************************************************
** Do float to integer conversion.
** float>int ( r -- n )
*******************************************************************/
static void Ftoi(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
vmCheckFStack(pVM, 1, 0);
#endif
i = (FICL_INT)POPFLOAT();
PUSHINT(i);
}
/*******************************************************************
** Floating point constant execution word.
*******************************************************************/
void FconstantParen(FICL_VM *pVM)
{
FICL_WORD *pFW = pVM->runningWord;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 0, 1);
#endif
PUSHFLOAT(pFW->param[0].f);
}
/*******************************************************************
** Create a floating point constant.
** fconstant ( r -"name"- )
*******************************************************************/
static void Fconstant(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
#endif
dictAppendWord2(dp, si, FconstantParen, FW_DEFAULT);
dictAppendCell(dp, stackPop(pVM->fStack));
}
/*******************************************************************
** Display a float in decimal format.
** f. ( r -- )
*******************************************************************/
static void FDot(FICL_VM *pVM)
{
float f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
#endif
f = POPFLOAT();
sprintf(pVM->pad,"%#f ",f);
vmTextOut(pVM, pVM->pad, 0);
}
/*******************************************************************
** Display a float in engineering format.
** fe. ( r -- )
*******************************************************************/
static void EDot(FICL_VM *pVM)
{
float f;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
#endif
f = POPFLOAT();
sprintf(pVM->pad,"%#e ",f);
vmTextOut(pVM, pVM->pad, 0);
}
/**************************************************************************
d i s p l a y FS t a c k
** Display the parameter stack (code for "f.s")
** f.s ( -- )
**************************************************************************/
static void displayFStack(FICL_VM *pVM)
{
int d = stackDepth(pVM->fStack);
int i;
CELL *pCell;
vmCheckFStack(pVM, 0, 0);
vmTextOut(pVM, "F:", 0);
if (d == 0)
vmTextOut(pVM, "[0]", 0);
else
{
ltoa(d, &pVM->pad[1], pVM->base);
pVM->pad[0] = '[';
strcat(pVM->pad,"] ");
vmTextOut(pVM,pVM->pad,0);
pCell = pVM->fStack->sp - d;
for (i = 0; i < d; i++)
{
sprintf(pVM->pad,"%#f ",(*pCell++).f);
vmTextOut(pVM,pVM->pad,0);
}
}
}
/*******************************************************************
** Do float stack depth.
** fdepth ( -- n )
*******************************************************************/
static void Fdepth(FICL_VM *pVM)
{
int i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
i = stackDepth(pVM->fStack);
PUSHINT(i);
}
/*******************************************************************
** Do float stack drop.
** fdrop ( r -- )
*******************************************************************/
static void Fdrop(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
#endif
DROPF(1);
}
/*******************************************************************
** Do float stack 2drop.
** f2drop ( r r -- )
*******************************************************************/
static void FtwoDrop(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 0);
#endif
DROPF(2);
}
/*******************************************************************
** Do float stack dup.
** fdup ( r -- r r )
*******************************************************************/
static void Fdup(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 2);
#endif
PICKF(0);
}
/*******************************************************************
** Do float stack 2dup.
** f2dup ( r1 r2 -- r1 r2 r1 r2 )
*******************************************************************/
static void FtwoDup(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 4);
#endif
PICKF(1);
PICKF(1);
}
/*******************************************************************
** Do float stack over.
** fover ( r1 r2 -- r1 r2 r1 )
*******************************************************************/
static void Fover(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 3);
#endif
PICKF(1);
}
/*******************************************************************
** Do float stack 2over.
** f2over ( r1 r2 r3 -- r1 r2 r3 r1 r2 )
*******************************************************************/
static void FtwoOver(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 4, 6);
#endif
PICKF(3);
PICKF(3);
}
/*******************************************************************
** Do float stack pick.
** fpick ( n -- r )
*******************************************************************/
static void Fpick(FICL_VM *pVM)
{
CELL c = POP();
#if FICL_ROBUST > 1
vmCheckFStack(pVM, c.i+1, c.i+2);
#endif
PICKF(c.i);
}
/*******************************************************************
** Do float stack ?dup.
** f?dup ( r -- r )
*******************************************************************/
static void FquestionDup(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 2);
#endif
c = GETTOPF();
if (c.f != 0)
PICKF(0);
}
/*******************************************************************
** Do float stack roll.
** froll ( n -- )
*******************************************************************/
static void Froll(FICL_VM *pVM)
{
int i = POP().i;
i = (i > 0) ? i : 0;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, i+1, i+1);
#endif
ROLLF(i);
}
/*******************************************************************
** Do float stack -roll.
** f-roll ( n -- )
*******************************************************************/
static void FminusRoll(FICL_VM *pVM)
{
int i = POP().i;
i = (i > 0) ? i : 0;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, i+1, i+1);
#endif
ROLLF(-i);
}
/*******************************************************************
** Do float stack rot.
** frot ( r1 r2 r3 -- r2 r3 r1 )
*******************************************************************/
static void Frot(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 3, 3);
#endif
ROLLF(2);
}
/*******************************************************************
** Do float stack -rot.
** f-rot ( r1 r2 r3 -- r3 r1 r2 )
*******************************************************************/
static void Fminusrot(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 3, 3);
#endif
ROLLF(-2);
}
/*******************************************************************
** Do float stack swap.
** fswap ( r1 r2 -- r2 r1 )
*******************************************************************/
static void Fswap(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 2);
#endif
ROLLF(1);
}
/*******************************************************************
** Do float stack 2swap
** f2swap ( r1 r2 r3 r4 -- r3 r4 r1 r2 )
*******************************************************************/
static void FtwoSwap(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 4, 4);
#endif
ROLLF(3);
ROLLF(3);
}
/*******************************************************************
** Get a floating point number from a variable.
** f@ ( n -- r )
*******************************************************************/
static void Ffetch(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 0, 1);
vmCheckStack(pVM, 1, 0);
#endif
pCell = (CELL *)POPPTR();
PUSHFLOAT(pCell->f);
}
/*******************************************************************
** Store a floating point number into a variable.
** f! ( r n -- )
*******************************************************************/
static void Fstore(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
vmCheckStack(pVM, 1, 0);
#endif
pCell = (CELL *)POPPTR();
pCell->f = POPFLOAT();
}
/*******************************************************************
** Add a floating point number to contents of a variable.
** f+! ( r n -- )
*******************************************************************/
static void FplusStore(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
vmCheckFStack(pVM, 1, 0);
#endif
pCell = (CELL *)POPPTR();
pCell->f += POPFLOAT();
}
/*******************************************************************
** Floating point literal execution word.
*******************************************************************/
static void fliteralParen(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
PUSHFLOAT(*(float*)(pVM->ip));
vmBranchRelative(pVM, 1);
}
/*******************************************************************
** Compile a floating point literal.
*******************************************************************/
static void fliteralIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_WORD *pfLitParen = ficlLookup(pVM->pSys, "(fliteral)");
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
#endif
dictAppendCell(dp, LVALUEtoCELL(pfLitParen));
dictAppendCell(dp, stackPop(pVM->fStack));
}
/*******************************************************************
** Do float 0= comparison r = 0.0.
** f0= ( r -- T/F )
*******************************************************************/
static void FzeroEquals(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0); /* Make sure something on float stack. */
vmCheckStack(pVM, 0, 1); /* Make sure room for result. */
#endif
c.i = FICL_BOOL(POPFLOAT() == 0);
PUSH(c);
}
/*******************************************************************
** Do float 0< comparison r < 0.0.
** f0< ( r -- T/F )
*******************************************************************/
static void FzeroLess(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0); /* Make sure something on float stack. */
vmCheckStack(pVM, 0, 1); /* Make sure room for result. */
#endif
c.i = FICL_BOOL(POPFLOAT() < 0);
PUSH(c);
}
/*******************************************************************
** Do float 0> comparison r > 0.0.
** f0> ( r -- T/F )
*******************************************************************/
static void FzeroGreater(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
vmCheckStack(pVM, 0, 1);
#endif
c.i = FICL_BOOL(POPFLOAT() > 0);
PUSH(c);
}
/*******************************************************************
** Do float = comparison r1 = r2.
** f= ( r1 r2 -- T/F )
*******************************************************************/
static void FisEqual(FICL_VM *pVM)
{
float x, y;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 0);
vmCheckStack(pVM, 0, 1);
#endif
x = POPFLOAT();
y = POPFLOAT();
PUSHINT(FICL_BOOL(x == y));
}
/*******************************************************************
** Do float < comparison r1 < r2.
** f< ( r1 r2 -- T/F )
*******************************************************************/
static void FisLess(FICL_VM *pVM)
{
float x, y;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 0);
vmCheckStack(pVM, 0, 1);
#endif
y = POPFLOAT();
x = POPFLOAT();
PUSHINT(FICL_BOOL(x < y));
}
/*******************************************************************
** Do float > comparison r1 > r2.
** f> ( r1 r2 -- T/F )
*******************************************************************/
static void FisGreater(FICL_VM *pVM)
{
float x, y;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 2, 0);
vmCheckStack(pVM, 0, 1);
#endif
y = POPFLOAT();
x = POPFLOAT();
PUSHINT(FICL_BOOL(x > y));
}
/*******************************************************************
** Move float to param stack (assumes they both fit in a single CELL)
** f>s
*******************************************************************/
static void FFrom(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 1, 0);
vmCheckStack(pVM, 0, 1);
#endif
c = stackPop(pVM->fStack);
stackPush(pVM->pStack, c);
return;
}
static void ToF(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 0, 1);
vmCheckStack(pVM, 1, 0);
#endif
c = stackPop(pVM->pStack);
stackPush(pVM->fStack, c);
return;
}
/**************************************************************************
F l o a t P a r s e S t a t e
** Enum to determine the current segment of a floating point number
** being parsed.
**************************************************************************/
#define NUMISNEG 1
#define EXPISNEG 2
typedef enum _floatParseState
{
FPS_START,
FPS_ININT,
FPS_INMANT,
FPS_STARTEXP,
FPS_INEXP
} FloatParseState;
/**************************************************************************
f i c l P a r s e F l o a t N u m b e r
** pVM -- Virtual Machine pointer.
** si -- String to parse.
** Returns 1 if successful, 0 if not.
**************************************************************************/
int ficlParseFloatNumber( FICL_VM *pVM, STRINGINFO si )
{
unsigned char ch, digit;
char *cp;
FICL_COUNT count;
float power;
float accum = 0.0f;
float mant = 0.1f;
FICL_INT exponent = 0;
char flag = 0;
FloatParseState estate = FPS_START;
#if FICL_ROBUST > 1
vmCheckFStack(pVM, 0, 1);
#endif
/*
** floating point numbers only allowed in base 10
*/
if (pVM->base != 10)
return(0);
cp = SI_PTR(si);
count = (FICL_COUNT)SI_COUNT(si);
/* Loop through the string's characters. */
while ((count--) && ((ch = *cp++) != 0))
{
switch (estate)
{
/* At start of the number so look for a sign. */
case FPS_START:
{
estate = FPS_ININT;
if (ch == '-')
{
flag |= NUMISNEG;
break;
}
if (ch == '+')
{
break;
}
} /* Note! Drop through to FPS_ININT */
/*
**Converting integer part of number.
** Only allow digits, decimal and 'E'.
*/
case FPS_ININT:
{
if (ch == '.')
{
estate = FPS_INMANT;
}
else if ((ch == 'e') || (ch == 'E'))
{
estate = FPS_STARTEXP;
}
else
{
digit = (unsigned char)(ch - '0');
if (digit > 9)
return(0);
accum = accum * 10 + digit;
}
break;
}
/*
** Processing the fraction part of number.
** Only allow digits and 'E'
*/
case FPS_INMANT:
{
if ((ch == 'e') || (ch == 'E'))
{
estate = FPS_STARTEXP;
}
else
{
digit = (unsigned char)(ch - '0');
if (digit > 9)
return(0);
accum += digit * mant;
mant *= 0.1f;
}
break;
}
/* Start processing the exponent part of number. */
/* Look for sign. */
case FPS_STARTEXP:
{
estate = FPS_INEXP;
if (ch == '-')
{
flag |= EXPISNEG;
break;
}
else if (ch == '+')
{
break;
}
} /* Note! Drop through to FPS_INEXP */
/*
** Processing the exponent part of number.
** Only allow digits.
*/
case FPS_INEXP:
{
digit = (unsigned char)(ch - '0');
if (digit > 9)
return(0);
exponent = exponent * 10 + digit;
break;
}
}
}
/* If parser never made it to the exponent this is not a float. */
if (estate < FPS_STARTEXP)
return(0);
/* Set the sign of the number. */
if (flag & NUMISNEG)
accum = -accum;
/* If exponent is not 0 then adjust number by it. */
if (exponent != 0)
{
/* Determine if exponent is negative. */
if (flag & EXPISNEG)
{
exponent = -exponent;
}
/* power = 10^x */
power = (float)pow(10.0, exponent);
accum *= power;
}
PUSHFLOAT(accum);
if (pVM->state == COMPILE)
fliteralIm(pVM);
return(1);
}
#endif /* FICL_WANT_FLOAT */
/**************************************************************************
** Add float words to a system's dictionary.
** pSys -- Pointer to the FICL sytem to add float words to.
**************************************************************************/
void ficlCompileFloat(FICL_SYSTEM *pSys)
{
FICL_DICT *dp = pSys->dp;
assert(dp);
#if FICL_WANT_FLOAT
dictAppendWord(dp, ">float", ToF, FW_DEFAULT);
/* d>f */
dictAppendWord(dp, "f!", Fstore, FW_DEFAULT);
dictAppendWord(dp, "f*", Fmul, FW_DEFAULT);
dictAppendWord(dp, "f+", Fadd, FW_DEFAULT);
dictAppendWord(dp, "f-", Fsub, FW_DEFAULT);
dictAppendWord(dp, "f/", Fdiv, FW_DEFAULT);
dictAppendWord(dp, "f0<", FzeroLess, FW_DEFAULT);
dictAppendWord(dp, "f0=", FzeroEquals, FW_DEFAULT);
dictAppendWord(dp, "f<", FisLess, FW_DEFAULT);
/*
f>d
*/
dictAppendWord(dp, "f@", Ffetch, FW_DEFAULT);
/*
falign
faligned
*/
dictAppendWord(dp, "fconstant", Fconstant, FW_DEFAULT);
dictAppendWord(dp, "fdepth", Fdepth, FW_DEFAULT);
dictAppendWord(dp, "fdrop", Fdrop, FW_DEFAULT);
dictAppendWord(dp, "fdup", Fdup, FW_DEFAULT);
dictAppendWord(dp, "fliteral", fliteralIm, FW_IMMEDIATE);
/*
float+
floats
floor
fmax
fmin
*/
dictAppendWord(dp, "f?dup", FquestionDup, FW_DEFAULT);
dictAppendWord(dp, "f=", FisEqual, FW_DEFAULT);
dictAppendWord(dp, "f>", FisGreater, FW_DEFAULT);
dictAppendWord(dp, "f0>", FzeroGreater, FW_DEFAULT);
dictAppendWord(dp, "f2drop", FtwoDrop, FW_DEFAULT);
dictAppendWord(dp, "f2dup", FtwoDup, FW_DEFAULT);
dictAppendWord(dp, "f2over", FtwoOver, FW_DEFAULT);
dictAppendWord(dp, "f2swap", FtwoSwap, FW_DEFAULT);
dictAppendWord(dp, "f+!", FplusStore, FW_DEFAULT);
dictAppendWord(dp, "f+i", Faddi, FW_DEFAULT);
dictAppendWord(dp, "f-i", Fsubi, FW_DEFAULT);
dictAppendWord(dp, "f*i", Fmuli, FW_DEFAULT);
dictAppendWord(dp, "f/i", Fdivi, FW_DEFAULT);
dictAppendWord(dp, "int>float", itof, FW_DEFAULT);
dictAppendWord(dp, "float>int", Ftoi, FW_DEFAULT);
dictAppendWord(dp, "f.", FDot, FW_DEFAULT);
dictAppendWord(dp, "f.s", displayFStack, FW_DEFAULT);
dictAppendWord(dp, "fe.", EDot, FW_DEFAULT);
dictAppendWord(dp, "fover", Fover, FW_DEFAULT);
dictAppendWord(dp, "fnegate", Fnegate, FW_DEFAULT);
dictAppendWord(dp, "fpick", Fpick, FW_DEFAULT);
dictAppendWord(dp, "froll", Froll, FW_DEFAULT);
dictAppendWord(dp, "frot", Frot, FW_DEFAULT);
dictAppendWord(dp, "fswap", Fswap, FW_DEFAULT);
dictAppendWord(dp, "i-f", isubf, FW_DEFAULT);
dictAppendWord(dp, "i/f", idivf, FW_DEFAULT);
dictAppendWord(dp, "float>", FFrom, FW_DEFAULT);
dictAppendWord(dp, "f-roll", FminusRoll, FW_DEFAULT);
dictAppendWord(dp, "f-rot", Fminusrot, FW_DEFAULT);
dictAppendWord(dp, "(fliteral)", fliteralParen, FW_COMPILE);
ficlSetEnv(pSys, "floating", FICL_FALSE); /* not all required words are present */
ficlSetEnv(pSys, "floating-ext", FICL_FALSE);
ficlSetEnv(pSys, "floating-stack", FICL_DEFAULT_STACK);
#endif
return;
}
diff --git a/stand/ficl/i386/sysdep.c b/stand/ficl/i386/sysdep.c
index 147c4683b6c2..41a5c679e9b3 100644
--- a/stand/ficl/i386/sysdep.c
+++ b/stand/ficl/i386/sysdep.c
@@ -1,101 +1,100 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
#include "../x86/sysdep.c"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar((unsigned char)*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/i386/sysdep.h b/stand/ficl/i386/sysdep.h
index 94fda2047ede..8eebbe9e7177 100644
--- a/stand/ficl/i386/sysdep.h
+++ b/stand/ficl/i386/sysdep.h
@@ -1,432 +1,431 @@
/*******************************************************************
s y s d e p . h
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Ficl system dependent types and prototypes...
**
** Note: Ficl also depends on the use of "assert" when
** FICL_ROBUST is enabled. This may require some consideration
** in firmware systems since assert often
** assumes stderr/stdout.
** $Id: sysdep.h,v 1.11 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#if !defined (__SYSDEP_H__)
#define __SYSDEP_H__
#include <sys/types.h>
#include <stddef.h> /* size_t, NULL */
#include <setjmp.h>
#include <assert.h>
#if !defined IGNORE /* Macro to silence unused param warnings */
#define IGNORE(x) (void)x
#endif
/*
** TRUE and FALSE for C boolean operations, and
** portable 32 bit types for CELLs
**
*/
#if !defined TRUE
#define TRUE 1
#endif
#if !defined FALSE
#define FALSE 0
#endif
/*
** System dependent data type declarations...
*/
#if !defined INT32
#define INT32 long
#endif
#if !defined UNS32
#define UNS32 unsigned long
#endif
#if !defined UNS16
#define UNS16 unsigned short
#endif
#if !defined UNS8
#define UNS8 unsigned char
#endif
#if !defined NULL
#define NULL ((void *)0)
#endif
/*
** FICL_UNS and FICL_INT must have the same size as a void* on
** the target system. A CELL is a union of void*, FICL_UNS, and
** FICL_INT.
** (11/2000: same for FICL_FLOAT)
*/
#if !defined FICL_INT
#define FICL_INT INT32
#endif
#if !defined FICL_UNS
#define FICL_UNS UNS32
#endif
#if !defined FICL_FLOAT
#define FICL_FLOAT float
#endif
/*
** Ficl presently supports values of 32 and 64 for BITS_PER_CELL
*/
#if !defined BITS_PER_CELL
#define BITS_PER_CELL 32
#endif
#if ((BITS_PER_CELL != 32) && (BITS_PER_CELL != 64))
Error!
#endif
typedef struct
{
FICL_UNS hi;
FICL_UNS lo;
} DPUNS;
typedef struct
{
FICL_UNS quot;
FICL_UNS rem;
} UNSQR;
typedef struct
{
FICL_INT hi;
FICL_INT lo;
} DPINT;
typedef struct
{
FICL_INT quot;
FICL_INT rem;
} INTQR;
/*
** B U I L D C O N T R O L S
*/
#if !defined (FICL_MINIMAL)
#define FICL_MINIMAL 0
#endif
#if (FICL_MINIMAL)
#define FICL_WANT_SOFTWORDS 0
#define FICL_WANT_FILE 0
#define FICL_WANT_FLOAT 0
#define FICL_WANT_USER 0
#define FICL_WANT_LOCALS 0
#define FICL_WANT_DEBUGGER 0
#define FICL_WANT_OOP 0
#define FICL_PLATFORM_EXTEND 0
#define FICL_MULTITHREAD 0
#define FICL_ROBUST 0
#define FICL_EXTENDED_PREFIX 0
#endif
/*
** FICL_PLATFORM_EXTEND
** Includes words defined in ficlCompilePlatform
*/
#if !defined (FICL_PLATFORM_EXTEND)
#define FICL_PLATFORM_EXTEND 1
#endif
/*
** FICL_WANT_FILE
** Includes the FILE and FILE-EXT wordset and associated code. Turn this off if you do not
** have a filesystem!
** Contributed by Larry Hastings
*/
#if !defined (FICL_WANT_FILE)
#define FICL_WANT_FILE 0
#endif
/*
** FICL_WANT_FLOAT
** Includes a floating point stack for the VM, and words to do float operations.
** Contributed by Guy Carver
*/
#if !defined (FICL_WANT_FLOAT)
#define FICL_WANT_FLOAT 0
#endif
/*
** FICL_WANT_DEBUGGER
** Inludes a simple source level debugger
*/
#if !defined (FICL_WANT_DEBUGGER)
#define FICL_WANT_DEBUGGER 1
#endif
/*
** FICL_EXTENDED_PREFIX enables a bunch of extra prefixes in prefix.c and prefix.fr (if
** included as part of softcore.c)
*/
#if !defined FICL_EXTENDED_PREFIX
#define FICL_EXTENDED_PREFIX 0
#endif
/*
** User variables: per-instance variables bound to the VM.
** Kinda like thread-local storage. Could be implemented in a
** VM private dictionary, but I've chosen the lower overhead
** approach of an array of CELLs instead.
*/
#if !defined FICL_WANT_USER
#define FICL_WANT_USER 1
#endif
#if !defined FICL_USER_CELLS
#define FICL_USER_CELLS 16
#endif
/*
** FICL_WANT_LOCALS controls the creation of the LOCALS wordset and
** a private dictionary for local variable compilation.
*/
#if !defined FICL_WANT_LOCALS
#define FICL_WANT_LOCALS 1
#endif
/* Max number of local variables per definition */
#if !defined FICL_MAX_LOCALS
#define FICL_MAX_LOCALS 16
#endif
/*
** FICL_WANT_OOP
** Inludes object oriented programming support (in softwords)
** OOP support requires locals and user variables!
*/
#if !(FICL_WANT_LOCALS) || !(FICL_WANT_USER)
#if !defined (FICL_WANT_OOP)
#define FICL_WANT_OOP 0
#endif
#endif
#if !defined (FICL_WANT_OOP)
#define FICL_WANT_OOP 1
#endif
/*
** FICL_WANT_SOFTWORDS
** Controls inclusion of all softwords in softcore.c
*/
#if !defined (FICL_WANT_SOFTWORDS)
#define FICL_WANT_SOFTWORDS 1
#endif
/*
** FICL_MULTITHREAD enables dictionary mutual exclusion
** wia the ficlLockDictionary system dependent function.
** Note: this implementation is experimental and poorly
** tested. Further, it's unnecessary unless you really
** intend to have multiple SESSIONS (poor choice of name
** on my part) - that is, threads that modify the dictionary
** at the same time.
*/
#if !defined FICL_MULTITHREAD
#define FICL_MULTITHREAD 0
#endif
/*
** PORTABLE_LONGMULDIV causes ficlLongMul and ficlLongDiv to be
** defined in C in sysdep.c. Use this if you cannot easily
** generate an inline asm definition
*/
#if !defined (PORTABLE_LONGMULDIV)
#define PORTABLE_LONGMULDIV 0
#endif
/*
** INLINE_INNER_LOOP causes the inner interpreter to be inline code
** instead of a function call. This is mainly because MS VC++ 5
** chokes with an internal compiler error on the function version.
** in release mode. Sheesh.
*/
#if !defined INLINE_INNER_LOOP
#if defined _DEBUG
#define INLINE_INNER_LOOP 0
#else
#define INLINE_INNER_LOOP 1
#endif
#endif
/*
** FICL_ROBUST enables bounds checking of stacks and the dictionary.
** This will detect stack over and underflows and dictionary overflows.
** Any exceptional condition will result in an assertion failure.
** (As generated by the ANSI assert macro)
** FICL_ROBUST == 1 --> stack checking in the outer interpreter
** FICL_ROBUST == 2 also enables checking in many primitives
*/
#if !defined FICL_ROBUST
#define FICL_ROBUST 2
#endif
/*
** FICL_DEFAULT_STACK Specifies the default size (in CELLs) of
** a new virtual machine's stacks, unless overridden at
** create time.
*/
#if !defined FICL_DEFAULT_STACK
#define FICL_DEFAULT_STACK 128
#endif
/*
** FICL_DEFAULT_DICT specifies the number of CELLs to allocate
** for the system dictionary by default. The value
** can be overridden at startup time as well.
** FICL_DEFAULT_ENV specifies the number of cells to allot
** for the environment-query dictionary.
*/
#if !defined FICL_DEFAULT_DICT
#define FICL_DEFAULT_DICT 12288
#endif
#if !defined FICL_DEFAULT_ENV
#define FICL_DEFAULT_ENV 260
#endif
/*
** FICL_DEFAULT_VOCS specifies the maximum number of wordlists in
** the dictionary search order. See Forth DPANS sec 16.3.3
** (file://dpans16.htm#16.3.3)
*/
#if !defined FICL_DEFAULT_VOCS
#define FICL_DEFAULT_VOCS 16
#endif
/*
** FICL_MAX_PARSE_STEPS controls the size of an array in the FICL_SYSTEM structure
** that stores pointers to parser extension functions. I would never expect to have
** more than 8 of these, so that's the default limit. Too many of these functions
** will probably exact a nasty performance penalty.
*/
#if !defined FICL_MAX_PARSE_STEPS
#define FICL_MAX_PARSE_STEPS 8
#endif
/*
** FICL_ALIGN is the power of two to which the dictionary
** pointer address must be aligned. This value is usually
** either 1 or 2, depending on the memory architecture
** of the target system; 2 is safe on any 16 or 32 bit
** machine. 3 would be appropriate for a 64 bit machine.
*/
#if !defined FICL_ALIGN
#define FICL_ALIGN 2
#define FICL_ALIGN_ADD ((1 << FICL_ALIGN) - 1)
#endif
/*
** System dependent routines --
** edit the implementations in sysdep.c to be compatible
** with your runtime environment...
** ficlTextOut sends a NULL terminated string to the
** default output device - used for system error messages
** ficlMalloc and ficlFree have the same semantics as malloc and free
** in standard C
** ficlLongMul multiplies two UNS32s and returns a 64 bit unsigned
** product
** ficlLongDiv divides an UNS64 by an UNS32 and returns UNS32 quotient
** and remainder
*/
struct vm;
void ficlTextOut(struct vm *pVM, char *msg, int fNewline);
void *ficlMalloc (size_t size);
void ficlFree (void *p);
void *ficlRealloc(void *p, size_t size);
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** must be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** before timeout (optional - could also block forever)
**
** NOTE: this function must be implemented with lock counting
** semantics: nested calls must behave properly.
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock);
#else
#define ficlLockDictionary(x) /* ignore */
#endif
/*
** 64 bit integer math support routines: multiply two UNS32s
** to get a 64 bit product, & divide the product by an UNS32
** to get an UNS32 quotient and remainder. Much easier in asm
** on a 32 bit CPU than in C, which usually doesn't support
** the double length result (but it should).
*/
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y);
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y);
/*
** FICL_HAVE_FTRUNCATE indicates whether the current OS supports
** the ftruncate() function (available on most UNIXes). This
** function is necessary to provide the complete File-Access wordset.
*/
#if !defined (FICL_HAVE_FTRUNCATE)
#define FICL_HAVE_FTRUNCATE 0
#endif
#endif /*__SYSDEP_H__*/
diff --git a/stand/ficl/math64.c b/stand/ficl/math64.c
index 6e50458151bc..2122a02629f0 100644
--- a/stand/ficl/math64.c
+++ b/stand/ficl/math64.c
@@ -1,561 +1,560 @@
/*******************************************************************
** m a t h 6 4 . c
** Forth Inspired Command Language - 64 bit math support routines
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 25 January 1998
** Rev 2.03: Support for 128 bit DP math. This file really ouught to
** be renamed!
** $Id: math64.c,v 1.9 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include "ficl.h"
#include "math64.h"
/**************************************************************************
m 6 4 A b s
** Returns the absolute value of an DPINT
**************************************************************************/
DPINT m64Abs(DPINT x)
{
if (m64IsNegative(x))
x = m64Negate(x);
return x;
}
/**************************************************************************
m 6 4 F l o o r e d D i v I
**
** FROM THE FORTH ANS...
** Floored division is integer division in which the remainder carries
** the sign of the divisor or is zero, and the quotient is rounded to
** its arithmetic floor. Symmetric division is integer division in which
** the remainder carries the sign of the dividend or is zero and the
** quotient is the mathematical quotient rounded towards zero or
** truncated. Examples of each are shown in tables 3.3 and 3.4.
**
** Table 3.3 - Floored Division Example
** Dividend Divisor Remainder Quotient
** -------- ------- --------- --------
** 10 7 3 1
** -10 7 4 -2
** 10 -7 -4 -2
** -10 -7 -3 1
**
**
** Table 3.4 - Symmetric Division Example
** Dividend Divisor Remainder Quotient
** -------- ------- --------- --------
** 10 7 3 1
** -10 7 -3 -1
** 10 -7 3 -1
** -10 -7 -3 1
**************************************************************************/
INTQR m64FlooredDivI(DPINT num, FICL_INT den)
{
INTQR qr;
UNSQR uqr;
int signRem = 1;
int signQuot = 1;
if (m64IsNegative(num))
{
num = m64Negate(num);
signQuot = -signQuot;
}
if (den < 0)
{
den = -den;
signRem = -signRem;
signQuot = -signQuot;
}
uqr = ficlLongDiv(m64CastIU(num), (FICL_UNS)den);
qr = m64CastQRUI(uqr);
if (signQuot < 0)
{
qr.quot = -qr.quot;
if (qr.rem != 0)
{
qr.quot--;
qr.rem = den - qr.rem;
}
}
if (signRem < 0)
qr.rem = -qr.rem;
return qr;
}
/**************************************************************************
m 6 4 I s N e g a t i v e
** Returns TRUE if the specified DPINT has its sign bit set.
**************************************************************************/
int m64IsNegative(DPINT x)
{
return (x.hi < 0);
}
/**************************************************************************
m 6 4 M a c
** Mixed precision multiply and accumulate primitive for number building.
** Multiplies DPUNS u by FICL_UNS mul and adds FICL_UNS add. Mul is typically
** the numeric base, and add represents a digit to be appended to the
** growing number.
** Returns the result of the operation
**************************************************************************/
DPUNS m64Mac(DPUNS u, FICL_UNS mul, FICL_UNS add)
{
DPUNS resultLo = ficlLongMul(u.lo, mul);
DPUNS resultHi = ficlLongMul(u.hi, mul);
resultLo.hi += resultHi.lo;
resultHi.lo = resultLo.lo + add;
if (resultHi.lo < resultLo.lo)
resultLo.hi++;
resultLo.lo = resultHi.lo;
return resultLo;
}
/**************************************************************************
m 6 4 M u l I
** Multiplies a pair of FICL_INTs and returns an DPINT result.
**************************************************************************/
DPINT m64MulI(FICL_INT x, FICL_INT y)
{
DPUNS prod;
int sign = 1;
if (x < 0)
{
sign = -sign;
x = -x;
}
if (y < 0)
{
sign = -sign;
y = -y;
}
prod = ficlLongMul(x, y);
if (sign > 0)
return m64CastUI(prod);
else
return m64Negate(m64CastUI(prod));
}
/**************************************************************************
m 6 4 N e g a t e
** Negates an DPINT by complementing and incrementing.
**************************************************************************/
DPINT m64Negate(DPINT x)
{
x.hi = ~x.hi;
x.lo = ~x.lo;
x.lo ++;
if (x.lo == 0)
x.hi++;
return x;
}
/**************************************************************************
m 6 4 P u s h
** Push an DPINT onto the specified stack in the order required
** by ANS Forth (most significant cell on top)
** These should probably be macros...
**************************************************************************/
void i64Push(FICL_STACK *pStack, DPINT i64)
{
stackPushINT(pStack, i64.lo);
stackPushINT(pStack, i64.hi);
return;
}
void u64Push(FICL_STACK *pStack, DPUNS u64)
{
stackPushINT(pStack, u64.lo);
stackPushINT(pStack, u64.hi);
return;
}
/**************************************************************************
m 6 4 P o p
** Pops an DPINT off the stack in the order required by ANS Forth
** (most significant cell on top)
** These should probably be macros...
**************************************************************************/
DPINT i64Pop(FICL_STACK *pStack)
{
DPINT ret;
ret.hi = stackPopINT(pStack);
ret.lo = stackPopINT(pStack);
return ret;
}
DPUNS u64Pop(FICL_STACK *pStack)
{
DPUNS ret;
ret.hi = stackPopINT(pStack);
ret.lo = stackPopINT(pStack);
return ret;
}
/**************************************************************************
m 6 4 S y m m e t r i c D i v
** Divide an DPINT by a FICL_INT and return a FICL_INT quotient and a
** FICL_INT remainder. The absolute values of quotient and remainder are not
** affected by the signs of the numerator and denominator (the operation
** is symmetric on the number line)
**************************************************************************/
INTQR m64SymmetricDivI(DPINT num, FICL_INT den)
{
INTQR qr;
UNSQR uqr;
int signRem = 1;
int signQuot = 1;
if (m64IsNegative(num))
{
num = m64Negate(num);
signRem = -signRem;
signQuot = -signQuot;
}
if (den < 0)
{
den = -den;
signQuot = -signQuot;
}
uqr = ficlLongDiv(m64CastIU(num), (FICL_UNS)den);
qr = m64CastQRUI(uqr);
if (signRem < 0)
qr.rem = -qr.rem;
if (signQuot < 0)
qr.quot = -qr.quot;
return qr;
}
/**************************************************************************
m 6 4 U M o d
** Divides a DPUNS by base (an UNS16) and returns an UNS16 remainder.
** Writes the quotient back to the original DPUNS as a side effect.
** This operation is typically used to convert an DPUNS to a text string
** in any base. See words.c:numberSignS, for example.
** Mechanics: performs 4 ficlLongDivs, each of which produces 16 bits
** of the quotient. C does not provide a way to divide an FICL_UNS by an
** UNS16 and get an FICL_UNS quotient (ldiv is closest, but it's signed,
** unfortunately), so I've used ficlLongDiv.
**************************************************************************/
#if (BITS_PER_CELL == 32)
#define UMOD_SHIFT 16
#define UMOD_MASK 0x0000ffff
#elif (BITS_PER_CELL == 64)
#define UMOD_SHIFT 32
#define UMOD_MASK 0x00000000ffffffff
#endif
UNS16 m64UMod(DPUNS *pUD, UNS16 base)
{
DPUNS ud;
UNSQR qr;
DPUNS result;
result.hi = result.lo = 0;
ud.hi = 0;
ud.lo = pUD->hi >> UMOD_SHIFT;
qr = ficlLongDiv(ud, (FICL_UNS)base);
result.hi = qr.quot << UMOD_SHIFT;
ud.lo = (qr.rem << UMOD_SHIFT) | (pUD->hi & UMOD_MASK);
qr = ficlLongDiv(ud, (FICL_UNS)base);
result.hi |= qr.quot & UMOD_MASK;
ud.lo = (qr.rem << UMOD_SHIFT) | (pUD->lo >> UMOD_SHIFT);
qr = ficlLongDiv(ud, (FICL_UNS)base);
result.lo = qr.quot << UMOD_SHIFT;
ud.lo = (qr.rem << UMOD_SHIFT) | (pUD->lo & UMOD_MASK);
qr = ficlLongDiv(ud, (FICL_UNS)base);
result.lo |= qr.quot & UMOD_MASK;
*pUD = result;
return (UNS16)(qr.rem);
}
/**************************************************************************
** Contributed by
** Michael A. Gauland gaulandm@mdhost.cse.tek.com
**************************************************************************/
#if PORTABLE_LONGMULDIV != 0
/**************************************************************************
m 6 4 A d d
**
**************************************************************************/
DPUNS m64Add(DPUNS x, DPUNS y)
{
DPUNS result;
int carry;
result.hi = x.hi + y.hi;
result.lo = x.lo + y.lo;
carry = ((x.lo | y.lo) & CELL_HI_BIT) && !(result.lo & CELL_HI_BIT);
carry |= ((x.lo & y.lo) & CELL_HI_BIT);
if (carry)
{
result.hi++;
}
return result;
}
/**************************************************************************
m 6 4 S u b
**
**************************************************************************/
DPUNS m64Sub(DPUNS x, DPUNS y)
{
DPUNS result;
result.hi = x.hi - y.hi;
result.lo = x.lo - y.lo;
if (x.lo < y.lo)
{
result.hi--;
}
return result;
}
/**************************************************************************
m 6 4 A S L
** 64 bit left shift
**************************************************************************/
DPUNS m64ASL( DPUNS x )
{
DPUNS result;
result.hi = x.hi << 1;
if (x.lo & CELL_HI_BIT)
{
result.hi++;
}
result.lo = x.lo << 1;
return result;
}
/**************************************************************************
m 6 4 A S R
** 64 bit right shift (unsigned - no sign extend)
**************************************************************************/
DPUNS m64ASR( DPUNS x )
{
DPUNS result;
result.lo = x.lo >> 1;
if (x.hi & 1)
{
result.lo |= CELL_HI_BIT;
}
result.hi = x.hi >> 1;
return result;
}
/**************************************************************************
m 6 4 O r
** 64 bit bitwise OR
**************************************************************************/
DPUNS m64Or( DPUNS x, DPUNS y )
{
DPUNS result;
result.hi = x.hi | y.hi;
result.lo = x.lo | y.lo;
return result;
}
/**************************************************************************
m 6 4 C o m p a r e
** Return -1 if x < y; 0 if x==y, and 1 if x > y.
**************************************************************************/
int m64Compare(DPUNS x, DPUNS y)
{
int result;
if (x.hi > y.hi)
{
result = +1;
}
else if (x.hi < y.hi)
{
result = -1;
}
else
{
/* High parts are equal */
if (x.lo > y.lo)
{
result = +1;
}
else if (x.lo < y.lo)
{
result = -1;
}
else
{
result = 0;
}
}
return result;
}
/**************************************************************************
f i c l L o n g M u l
** Portable versions of ficlLongMul and ficlLongDiv in C
** Contributed by:
** Michael A. Gauland gaulandm@mdhost.cse.tek.com
**************************************************************************/
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS result = { 0, 0 };
DPUNS addend;
addend.lo = y;
addend.hi = 0; /* No sign extension--arguments are unsigned */
while (x != 0)
{
if ( x & 1)
{
result = m64Add(result, addend);
}
x >>= 1;
addend = m64ASL(addend);
}
return result;
}
/**************************************************************************
f i c l L o n g D i v
** Portable versions of ficlLongMul and ficlLongDiv in C
** Contributed by:
** Michael A. Gauland gaulandm@mdhost.cse.tek.com
**************************************************************************/
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
DPUNS quotient;
DPUNS subtrahend;
DPUNS mask;
quotient.lo = 0;
quotient.hi = 0;
subtrahend.lo = y;
subtrahend.hi = 0;
mask.lo = 1;
mask.hi = 0;
while ((m64Compare(subtrahend, q) < 0) &&
(subtrahend.hi & CELL_HI_BIT) == 0)
{
mask = m64ASL(mask);
subtrahend = m64ASL(subtrahend);
}
while (mask.lo != 0 || mask.hi != 0)
{
if (m64Compare(subtrahend, q) <= 0)
{
q = m64Sub( q, subtrahend);
quotient = m64Or(quotient, mask);
}
mask = m64ASR(mask);
subtrahend = m64ASR(subtrahend);
}
result.quot = quotient.lo;
result.rem = q.lo;
return result;
}
#endif
diff --git a/stand/ficl/math64.h b/stand/ficl/math64.h
index a4e56369564f..3acbbffec75f 100644
--- a/stand/ficl/math64.h
+++ b/stand/ficl/math64.h
@@ -1,88 +1,87 @@
/*******************************************************************
** m a t h 6 4 . h
** Forth Inspired Command Language - 64 bit math support routines
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 25 January 1998
** $Id: math64.h,v 1.9 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#if !defined (__MATH64_H__)
#define __MATH64_H__
#ifdef __cplusplus
extern "C" {
#endif
DPINT m64Abs(DPINT x);
int m64IsNegative(DPINT x);
DPUNS m64Mac(DPUNS u, FICL_UNS mul, FICL_UNS add);
DPINT m64MulI(FICL_INT x, FICL_INT y);
DPINT m64Negate(DPINT x);
INTQR m64FlooredDivI(DPINT num, FICL_INT den);
void i64Push(FICL_STACK *pStack, DPINT i64);
DPINT i64Pop(FICL_STACK *pStack);
void u64Push(FICL_STACK *pStack, DPUNS u64);
DPUNS u64Pop(FICL_STACK *pStack);
INTQR m64SymmetricDivI(DPINT num, FICL_INT den);
UNS16 m64UMod(DPUNS *pUD, UNS16 base);
#if PORTABLE_LONGMULDIV != 0 /* see sysdep.h */
DPUNS m64Add(DPUNS x, DPUNS y);
DPUNS m64ASL( DPUNS x );
DPUNS m64ASR( DPUNS x );
int m64Compare(DPUNS x, DPUNS y);
DPUNS m64Or( DPUNS x, DPUNS y );
DPUNS m64Sub(DPUNS x, DPUNS y);
#endif
#define i64Extend(i64) (i64).hi = ((i64).lo < 0) ? -1L : 0
#define m64CastIU(i64) (*(DPUNS *)(&(i64)))
#define m64CastUI(u64) (*(DPINT *)(&(u64)))
#define m64CastQRIU(iqr) (*(UNSQR *)(&(iqr)))
#define m64CastQRUI(uqr) (*(INTQR *)(&(uqr)))
#define CELL_HI_BIT (1L << (BITS_PER_CELL-1))
#ifdef __cplusplus
}
#endif
#endif
diff --git a/stand/ficl/mips/sysdep.c b/stand/ficl/mips/sysdep.c
index 43e7c3c91f1d..87bed142d684 100644
--- a/stand/ficl/mips/sysdep.c
+++ b/stand/ficl/mips/sysdep.c
@@ -1,99 +1,98 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar(*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/mips64/sysdep.c b/stand/ficl/mips64/sysdep.c
index 43e7c3c91f1d..87bed142d684 100644
--- a/stand/ficl/mips64/sysdep.c
+++ b/stand/ficl/mips64/sysdep.c
@@ -1,99 +1,98 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar(*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/powerpc/sysdep.c b/stand/ficl/powerpc/sysdep.c
index 43e7c3c91f1d..87bed142d684 100644
--- a/stand/ficl/powerpc/sysdep.c
+++ b/stand/ficl/powerpc/sysdep.c
@@ -1,99 +1,98 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar(*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/prefix.c b/stand/ficl/prefix.c
index a34fc6c78240..f78ee597480f 100644
--- a/stand/ficl/prefix.c
+++ b/stand/ficl/prefix.c
@@ -1,199 +1,198 @@
/*******************************************************************
** p r e f i x . c
** Forth Inspired Command Language
** Parser extensions for Ficl
** Authors: Larry Hastings & John Sadler (john_sadler@alum.mit.edu)
** Created: April 2001
** $Id: prefix.c,v 1.6 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <string.h>
#include <ctype.h>
#include "ficl.h"
#include "math64.h"
/*
** (jws) revisions:
** A prefix is a word in a dedicated wordlist (name stored in list_name below)
** that is searched in a special way by the prefix parse step. When a prefix
** matches the beginning of an incoming token, push the non-prefix part of the
** token back onto the input stream and execute the prefix code.
**
** The parse step is called ficlParsePrefix.
** Storing prefix entries in the dictionary greatly simplifies
** the process of matching and dispatching prefixes, avoids the
** need to clean up a dynamically allocated prefix list when the system
** goes away, but still allows prefixes to be allocated at runtime.
*/
static char list_name[] = "<prefixes>";
/**************************************************************************
f i c l P a r s e P r e f i x
** This is the parse step for prefixes - it checks an incoming word
** to see if it starts with a prefix, and if so runs the corrseponding
** code against the remainder of the word and returns true.
**************************************************************************/
int ficlParsePrefix(FICL_VM *pVM, STRINGINFO si)
{
int i;
FICL_HASH *pHash;
FICL_WORD *pFW = ficlLookup(pVM->pSys, list_name);
/*
** Make sure we found the prefix dictionary - otherwise silently fail
** If forth-wordlist is not in the search order, we won't find the prefixes.
*/
if (!pFW)
return FICL_FALSE;
pHash = (FICL_HASH *)(pFW->param[0].p);
/*
** Walk the list looking for a match with the beginning of the incoming token
*/
for (i = 0; i < (int)pHash->size; i++)
{
pFW = pHash->table[i];
while (pFW != NULL)
{
int n;
n = pFW->nName;
/*
** If we find a match, adjust the TIB to give back the non-prefix characters
** and execute the prefix word.
*/
if (!strincmp(SI_PTR(si), pFW->name, (FICL_UNS)n))
{
/* (sadler) fixed off-by-one error when the token has no trailing space in the TIB */
vmSetTibIndex(pVM, si.cp + n - pVM->tib.cp );
vmExecute(pVM, pFW);
return (int)FICL_TRUE;
}
pFW = pFW->link;
}
}
return FICL_FALSE;
}
static void tempBase(FICL_VM *pVM, int base)
{
int oldbase = pVM->base;
STRINGINFO si = vmGetWord0(pVM);
pVM->base = base;
if (!ficlParseNumber(pVM, si))
{
int i = SI_COUNT(si);
vmThrowErr(pVM, "%.*s not recognized", i, SI_PTR(si));
}
pVM->base = oldbase;
return;
}
static void fTempBase(FICL_VM *pVM)
{
int base = stackPopINT(pVM->pStack);
tempBase(pVM, base);
return;
}
static void prefixHex(FICL_VM *pVM)
{
tempBase(pVM, 16);
}
static void prefixTen(FICL_VM *pVM)
{
tempBase(pVM, 10);
}
/**************************************************************************
f i c l C o m p i l e P r e f i x
** Build prefix support into the dictionary and the parser
** Note: since prefixes always execute, they are effectively IMMEDIATE.
** If they need to generate code in compile state you must add
** this code explicitly.
**************************************************************************/
void ficlCompilePrefix(FICL_SYSTEM *pSys)
{
FICL_DICT *dp = pSys->dp;
FICL_HASH *pHash;
FICL_HASH *pPrevCompile = dp->pCompile;
#if (FICL_EXTENDED_PREFIX)
FICL_WORD *pFW;
#endif
/*
** Create a named wordlist for prefixes to reside in...
** Since we're doing a special kind of search, make it
** a single bucket hashtable - hashing does not help here.
*/
pHash = dictCreateWordlist(dp, 1);
pHash->name = list_name;
dictAppendWord(dp, list_name, constantParen, FW_DEFAULT);
dictAppendCell(dp, LVALUEtoCELL(pHash));
/*
** Put __tempbase in the forth-wordlist
*/
dictAppendWord(dp, "__tempbase", fTempBase, FW_DEFAULT);
/*
** Temporarily make the prefix list the compile wordlist so that
** we can create some precompiled prefixes.
*/
dp->pCompile = pHash;
dictAppendWord(dp, "0x", prefixHex, FW_DEFAULT);
dictAppendWord(dp, "0d", prefixTen, FW_DEFAULT);
#if (FICL_EXTENDED_PREFIX)
pFW = ficlLookup(pSys, "\\");
if (pFW)
{
dictAppendWord(dp, "//", pFW->code, FW_DEFAULT);
}
#endif
dp->pCompile = pPrevCompile;
return;
}
diff --git a/stand/ficl/riscv/sysdep.c b/stand/ficl/riscv/sysdep.c
index 43e7c3c91f1d..87bed142d684 100644
--- a/stand/ficl/riscv/sysdep.c
+++ b/stand/ficl/riscv/sysdep.c
@@ -1,99 +1,98 @@
/*******************************************************************
** s y s d e p . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** Implementations of FICL external interface functions...
**
*******************************************************************/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdio.h>
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
/*
******************* FreeBSD P O R T B E G I N S H E R E ******************** Michael Smith
*/
#if PORTABLE_LONGMULDIV == 0
DPUNS ficlLongMul(FICL_UNS x, FICL_UNS y)
{
DPUNS q;
uint64_t qx;
qx = (uint64_t)x * (uint64_t) y;
q.hi = (uint32_t)( qx >> 32 );
q.lo = (uint32_t)( qx & 0xFFFFFFFFL);
return q;
}
UNSQR ficlLongDiv(DPUNS q, FICL_UNS y)
{
UNSQR result;
uint64_t qx, qh;
qh = q.hi;
qx = (qh << 32) | q.lo;
result.quot = qx / y;
result.rem = qx % y;
return result;
}
#endif
void ficlTextOut(FICL_VM *pVM, char *msg, int fNewline)
{
IGNORE(pVM);
while(*msg != 0)
putchar(*(msg++));
if (fNewline)
putchar('\n');
return;
}
void *ficlMalloc (size_t size)
{
return malloc(size);
}
void *ficlRealloc (void *p, size_t size)
{
return realloc(p, size);
}
void ficlFree (void *p)
{
free(p);
}
/*
** Stub function for dictionary access control - does nothing
** by default, user can redefine to guarantee exclusive dict
** access to a single thread for updates. All dict update code
** is guaranteed to be bracketed as follows:
** ficlLockDictionary(TRUE);
** <code that updates dictionary>
** ficlLockDictionary(FALSE);
**
** Returns zero if successful, nonzero if unable to acquire lock
** befor timeout (optional - could also block forever)
*/
#if FICL_MULTITHREAD
int ficlLockDictionary(short fLock)
{
IGNORE(fLock);
return 0;
}
#endif /* FICL_MULTITHREAD */
diff --git a/stand/ficl/search.c b/stand/ficl/search.c
index d445cb32d93a..2fa0d39ed36e 100644
--- a/stand/ficl/search.c
+++ b/stand/ficl/search.c
@@ -1,393 +1,392 @@
/*******************************************************************
** s e a r c h . c
** Forth Inspired Command Language
** ANS Forth SEARCH and SEARCH-EXT word-set written in C
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 6 June 2000
** $Id: search.c,v 1.9 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <string.h>
#include "ficl.h"
#include "math64.h"
/**************************************************************************
d e f i n i t i o n s
** SEARCH ( -- )
** Make the compilation word list the same as the first word list in the
** search order. Specifies that the names of subsequent definitions will
** be placed in the compilation word list. Subsequent changes in the search
** order will not affect the compilation word list.
**************************************************************************/
static void definitions(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
assert(pDict);
if (pDict->nLists < 1)
{
vmThrowErr(pVM, "DEFINITIONS error - empty search order");
}
pDict->pCompile = pDict->pSearch[pDict->nLists-1];
return;
}
/**************************************************************************
f o r t h - w o r d l i s t
** SEARCH ( -- wid )
** Return wid, the identifier of the word list that includes all standard
** words provided by the implementation. This word list is initially the
** compilation word list and is part of the initial search order.
**************************************************************************/
static void forthWordlist(FICL_VM *pVM)
{
FICL_HASH *pHash = vmGetDict(pVM)->pForthWords;
stackPushPtr(pVM->pStack, pHash);
return;
}
/**************************************************************************
g e t - c u r r e n t
** SEARCH ( -- wid )
** Return wid, the identifier of the compilation word list.
**************************************************************************/
static void getCurrent(FICL_VM *pVM)
{
ficlLockDictionary(TRUE);
stackPushPtr(pVM->pStack, vmGetDict(pVM)->pCompile);
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
g e t - o r d e r
** SEARCH ( -- widn ... wid1 n )
** Returns the number of word lists n in the search order and the word list
** identifiers widn ... wid1 identifying these word lists. wid1 identifies
** the word list that is searched first, and widn the word list that is
** searched last. The search order is unaffected.
**************************************************************************/
static void getOrder(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
int nLists = pDict->nLists;
int i;
ficlLockDictionary(TRUE);
for (i = 0; i < nLists; i++)
{
stackPushPtr(pVM->pStack, pDict->pSearch[i]);
}
stackPushUNS(pVM->pStack, nLists);
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
s e a r c h - w o r d l i s t
** SEARCH ( c-addr u wid -- 0 | xt 1 | xt -1 )
** Find the definition identified by the string c-addr u in the word list
** identified by wid. If the definition is not found, return zero. If the
** definition is found, return its execution token xt and one (1) if the
** definition is immediate, minus-one (-1) otherwise.
**************************************************************************/
static void searchWordlist(FICL_VM *pVM)
{
STRINGINFO si;
UNS16 hashCode;
FICL_WORD *pFW;
FICL_HASH *pHash = stackPopPtr(pVM->pStack);
si.count = (FICL_COUNT)stackPopUNS(pVM->pStack);
si.cp = stackPopPtr(pVM->pStack);
hashCode = hashHashCode(si);
ficlLockDictionary(TRUE);
pFW = hashLookup(pHash, si, hashCode);
ficlLockDictionary(FALSE);
if (pFW)
{
stackPushPtr(pVM->pStack, pFW);
stackPushINT(pVM->pStack, (wordIsImmediate(pFW) ? 1 : -1));
}
else
{
stackPushUNS(pVM->pStack, 0);
}
return;
}
/**************************************************************************
s e t - c u r r e n t
** SEARCH ( wid -- )
** Set the compilation word list to the word list identified by wid.
**************************************************************************/
static void setCurrent(FICL_VM *pVM)
{
FICL_HASH *pHash = stackPopPtr(pVM->pStack);
FICL_DICT *pDict = vmGetDict(pVM);
ficlLockDictionary(TRUE);
pDict->pCompile = pHash;
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
s e t - o r d e r
** SEARCH ( widn ... wid1 n -- )
** Set the search order to the word lists identified by widn ... wid1.
** Subsequently, word list wid1 will be searched first, and word list
** widn searched last. If n is zero, empty the search order. If n is minus
** one, set the search order to the implementation-defined minimum
** search order. The minimum search order shall include the words
** FORTH-WORDLIST and SET-ORDER. A system shall allow n to
** be at least eight.
**************************************************************************/
static void setOrder(FICL_VM *pVM)
{
int i;
int nLists = stackPopINT(pVM->pStack);
FICL_DICT *dp = vmGetDict(pVM);
if (nLists > FICL_DEFAULT_VOCS)
{
vmThrowErr(pVM, "set-order error: list would be too large");
}
ficlLockDictionary(TRUE);
if (nLists >= 0)
{
dp->nLists = nLists;
for (i = nLists-1; i >= 0; --i)
{
dp->pSearch[i] = stackPopPtr(pVM->pStack);
}
}
else
{
dictResetSearchOrder(dp);
}
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
f i c l - w o r d l i s t
** SEARCH ( -- wid )
** Create a new empty word list, returning its word list identifier wid.
** The new word list may be returned from a pool of preallocated word
** lists or may be dynamically allocated in data space. A system shall
** allow the creation of at least 8 new word lists in addition to any
** provided as part of the system.
** Notes:
** 1. ficl creates a new single-list hash in the dictionary and returns
** its address.
** 2. ficl-wordlist takes an arg off the stack indicating the number of
** hash entries in the wordlist. Ficl 2.02 and later define WORDLIST as
** : wordlist 1 ficl-wordlist ;
**************************************************************************/
static void ficlWordlist(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_HASH *pHash;
FICL_UNS nBuckets;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
nBuckets = stackPopUNS(pVM->pStack);
pHash = dictCreateWordlist(dp, nBuckets);
stackPushPtr(pVM->pStack, pHash);
return;
}
/**************************************************************************
S E A R C H >
** ficl ( -- wid )
** Pop wid off the search order. Error if the search order is empty
**************************************************************************/
static void searchPop(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
int nLists;
ficlLockDictionary(TRUE);
nLists = dp->nLists;
if (nLists == 0)
{
vmThrowErr(pVM, "search> error: empty search order");
}
stackPushPtr(pVM->pStack, dp->pSearch[--dp->nLists]);
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
> S E A R C H
** ficl ( wid -- )
** Push wid onto the search order. Error if the search order is full.
**************************************************************************/
static void searchPush(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
ficlLockDictionary(TRUE);
if (dp->nLists > FICL_DEFAULT_VOCS)
{
vmThrowErr(pVM, ">search error: search order overflow");
}
dp->pSearch[dp->nLists++] = stackPopPtr(pVM->pStack);
ficlLockDictionary(FALSE);
return;
}
/**************************************************************************
W I D - G E T - N A M E
** ficl ( wid -- c-addr u )
** Get wid's (optional) name and push onto stack as a counted string
**************************************************************************/
static void widGetName(FICL_VM *pVM)
{
FICL_HASH *pHash = vmPop(pVM).p;
char *cp = pHash->name;
FICL_INT len = 0;
if (cp)
len = strlen(cp);
vmPush(pVM, LVALUEtoCELL(cp));
vmPush(pVM, LVALUEtoCELL(len));
return;
}
/**************************************************************************
W I D - S E T - N A M E
** ficl ( wid c-addr -- )
** Set wid's name pointer to the \0 terminated string address supplied
**************************************************************************/
static void widSetName(FICL_VM *pVM)
{
char *cp = (char *)vmPop(pVM).p;
FICL_HASH *pHash = vmPop(pVM).p;
pHash->name = cp;
return;
}
/**************************************************************************
setParentWid
** FICL
** setparentwid ( parent-wid wid -- )
** Set WID's link field to the parent-wid. search-wordlist will
** iterate through all the links when finding words in the child wid.
**************************************************************************/
static void setParentWid(FICL_VM *pVM)
{
FICL_HASH *parent, *child;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
child = (FICL_HASH *)stackPopPtr(pVM->pStack);
parent = (FICL_HASH *)stackPopPtr(pVM->pStack);
child->link = parent;
return;
}
/**************************************************************************
f i c l C o m p i l e S e a r c h
** Builds the primitive wordset and the environment-query namespace.
**************************************************************************/
void ficlCompileSearch(FICL_SYSTEM *pSys)
{
FICL_DICT *dp = pSys->dp;
assert (dp);
/*
** optional SEARCH-ORDER word set
*/
dictAppendWord(dp, ">search", searchPush, FW_DEFAULT);
dictAppendWord(dp, "search>", searchPop, FW_DEFAULT);
dictAppendWord(dp, "definitions",
definitions, FW_DEFAULT);
dictAppendWord(dp, "forth-wordlist",
forthWordlist, FW_DEFAULT);
dictAppendWord(dp, "get-current",
getCurrent, FW_DEFAULT);
dictAppendWord(dp, "get-order", getOrder, FW_DEFAULT);
dictAppendWord(dp, "search-wordlist",
searchWordlist, FW_DEFAULT);
dictAppendWord(dp, "set-current",
setCurrent, FW_DEFAULT);
dictAppendWord(dp, "set-order", setOrder, FW_DEFAULT);
dictAppendWord(dp, "ficl-wordlist",
ficlWordlist, FW_DEFAULT);
/*
** Set SEARCH environment query values
*/
ficlSetEnv(pSys, "search-order", FICL_TRUE);
ficlSetEnv(pSys, "search-order-ext", FICL_TRUE);
ficlSetEnv(pSys, "wordlists", FICL_DEFAULT_VOCS);
dictAppendWord(dp, "wid-get-name", widGetName, FW_DEFAULT);
dictAppendWord(dp, "wid-set-name", widSetName, FW_DEFAULT);
dictAppendWord(dp, "wid-set-super",
setParentWid, FW_DEFAULT);
return;
}
diff --git a/stand/ficl/stack.c b/stand/ficl/stack.c
index f98a3b61db7d..366e0adc3cf0 100644
--- a/stand/ficl/stack.c
+++ b/stand/ficl/stack.c
@@ -1,372 +1,371 @@
/*******************************************************************
** s t a c k . c
** Forth Inspired Command Language
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 16 Oct 1997
** $Id: stack.c,v 1.10 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdlib.h>
#else
#include <stand.h>
#endif
#include "ficl.h"
#define STKDEPTH(s) ((s)->sp - (s)->base)
/*
** N O T E: Stack convention:
**
** sp points to the first available cell
** push: store value at sp, increment sp
** pop: decrement sp, fetch value at sp
** Stack grows from low to high memory
*/
/*******************************************************************
v m C h e c k S t a c k
** Check the parameter stack for underflow or overflow.
** nCells controls the type of check: if nCells is zero,
** the function checks the stack state for underflow and overflow.
** If nCells > 0, checks to see that the stack has room to push
** that many cells. If less than zero, checks to see that the
** stack has room to pop that many cells. If any test fails,
** the function throws (via vmThrow) a VM_ERREXIT exception.
*******************************************************************/
void vmCheckStack(FICL_VM *pVM, int popCells, int pushCells)
{
FICL_STACK *pStack = pVM->pStack;
int nFree = pStack->base + pStack->nCells - pStack->sp;
if (popCells > STKDEPTH(pStack))
{
vmThrowErr(pVM, "Error: stack underflow");
}
if (nFree < pushCells - popCells)
{
vmThrowErr(pVM, "Error: stack overflow");
}
return;
}
#if FICL_WANT_FLOAT
void vmCheckFStack(FICL_VM *pVM, int popCells, int pushCells)
{
FICL_STACK *fStack = pVM->fStack;
int nFree = fStack->base + fStack->nCells - fStack->sp;
if (popCells > STKDEPTH(fStack))
{
vmThrowErr(pVM, "Error: float stack underflow");
}
if (nFree < pushCells - popCells)
{
vmThrowErr(pVM, "Error: float stack overflow");
}
}
#endif
/*******************************************************************
s t a c k C r e a t e
**
*******************************************************************/
FICL_STACK *stackCreate(unsigned nCells)
{
size_t size = sizeof (FICL_STACK) + nCells * sizeof (CELL);
FICL_STACK *pStack = ficlMalloc(size);
#if FICL_ROBUST
assert (nCells != 0);
assert (pStack != NULL);
#endif
pStack->nCells = nCells;
pStack->sp = pStack->base;
pStack->pFrame = NULL;
return pStack;
}
/*******************************************************************
s t a c k D e l e t e
**
*******************************************************************/
void stackDelete(FICL_STACK *pStack)
{
if (pStack)
ficlFree(pStack);
return;
}
/*******************************************************************
s t a c k D e p t h
**
*******************************************************************/
int stackDepth(FICL_STACK *pStack)
{
return STKDEPTH(pStack);
}
/*******************************************************************
s t a c k D r o p
**
*******************************************************************/
void stackDrop(FICL_STACK *pStack, int n)
{
#if FICL_ROBUST
assert(n > 0);
#endif
pStack->sp -= n;
return;
}
/*******************************************************************
s t a c k F e t c h
**
*******************************************************************/
CELL stackFetch(FICL_STACK *pStack, int n)
{
return pStack->sp[-n-1];
}
void stackStore(FICL_STACK *pStack, int n, CELL c)
{
pStack->sp[-n-1] = c;
return;
}
/*******************************************************************
s t a c k G e t T o p
**
*******************************************************************/
CELL stackGetTop(FICL_STACK *pStack)
{
return pStack->sp[-1];
}
/*******************************************************************
s t a c k L i n k
** Link a frame using the stack's frame pointer. Allot space for
** nCells cells in the frame
** 1) Push pFrame
** 2) pFrame = sp
** 3) sp += nCells
*******************************************************************/
void stackLink(FICL_STACK *pStack, int nCells)
{
stackPushPtr(pStack, pStack->pFrame);
pStack->pFrame = pStack->sp;
pStack->sp += nCells;
return;
}
/*******************************************************************
s t a c k U n l i n k
** Unink a stack frame previously created by stackLink
** 1) sp = pFrame
** 2) pFrame = pop()
*******************************************************************/
void stackUnlink(FICL_STACK *pStack)
{
pStack->sp = pStack->pFrame;
pStack->pFrame = stackPopPtr(pStack);
return;
}
/*******************************************************************
s t a c k P i c k
**
*******************************************************************/
void stackPick(FICL_STACK *pStack, int n)
{
stackPush(pStack, stackFetch(pStack, n));
return;
}
/*******************************************************************
s t a c k P o p
**
*******************************************************************/
CELL stackPop(FICL_STACK *pStack)
{
return *--pStack->sp;
}
void *stackPopPtr(FICL_STACK *pStack)
{
return (*--pStack->sp).p;
}
FICL_UNS stackPopUNS(FICL_STACK *pStack)
{
return (*--pStack->sp).u;
}
FICL_INT stackPopINT(FICL_STACK *pStack)
{
return (*--pStack->sp).i;
}
#if (FICL_WANT_FLOAT)
float stackPopFloat(FICL_STACK *pStack)
{
return (*(--pStack->sp)).f;
}
#endif
/*******************************************************************
s t a c k P u s h
**
*******************************************************************/
void stackPush(FICL_STACK *pStack, CELL c)
{
*pStack->sp++ = c;
}
void stackPushPtr(FICL_STACK *pStack, void *ptr)
{
*pStack->sp++ = LVALUEtoCELL(ptr);
}
void stackPushUNS(FICL_STACK *pStack, FICL_UNS u)
{
*pStack->sp++ = LVALUEtoCELL(u);
}
void stackPushINT(FICL_STACK *pStack, FICL_INT i)
{
*pStack->sp++ = LVALUEtoCELL(i);
}
#if (FICL_WANT_FLOAT)
void stackPushFloat(FICL_STACK *pStack, FICL_FLOAT f)
{
*pStack->sp++ = LVALUEtoCELL(f);
}
#endif
/*******************************************************************
s t a c k R e s e t
**
*******************************************************************/
void stackReset(FICL_STACK *pStack)
{
pStack->sp = pStack->base;
return;
}
/*******************************************************************
s t a c k R o l l
** Roll nth stack entry to the top (counting from zero), if n is
** >= 0. Drop other entries as needed to fill the hole.
** If n < 0, roll top-of-stack to nth entry, pushing others
** upward as needed to fill the hole.
*******************************************************************/
void stackRoll(FICL_STACK *pStack, int n)
{
CELL c;
CELL *pCell;
if (n == 0)
return;
else if (n > 0)
{
pCell = pStack->sp - n - 1;
c = *pCell;
for (;n > 0; --n, pCell++)
{
*pCell = pCell[1];
}
*pCell = c;
}
else
{
pCell = pStack->sp - 1;
c = *pCell;
for (; n < 0; ++n, pCell--)
{
*pCell = pCell[-1];
}
*pCell = c;
}
return;
}
/*******************************************************************
s t a c k S e t T o p
**
*******************************************************************/
void stackSetTop(FICL_STACK *pStack, CELL c)
{
pStack->sp[-1] = c;
return;
}
diff --git a/stand/ficl/testmain.c b/stand/ficl/testmain.c
index 7167f30a2561..42c8edf4efa5 100644
--- a/stand/ficl/testmain.c
+++ b/stand/ficl/testmain.c
@@ -1,345 +1,344 @@
/*
** stub main for testing FICL under userland
** $Id: testmain.c,v 1.13 2001/12/05 07:21:34 jsadler Exp $
*/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include "ficl.h"
/*
** Ficl interface to getcwd
** Prints the current working directory using the VM's
** textOut method...
*/
static void ficlGetCWD(FICL_VM *pVM)
{
char *cp;
cp = getcwd(NULL, 80);
vmTextOut(pVM, cp, 1);
free(cp);
return;
}
/*
** Ficl interface to chdir
** Gets a newline (or NULL) delimited string from the input
** and feeds it to chdir()
** Example:
** cd c:\tmp
*/
static void ficlChDir(FICL_VM *pVM)
{
FICL_STRING *pFS = (FICL_STRING *)pVM->pad;
vmGetString(pVM, pFS, '\n');
if (pFS->count > 0)
{
int err = chdir(pFS->text);
if (err)
{
vmTextOut(pVM, "Error: path not found", 1);
vmThrow(pVM, VM_QUIT);
}
}
else
{
vmTextOut(pVM, "Warning (chdir): nothing happened", 1);
}
return;
}
/*
** Ficl interface to system (ANSI)
** Gets a newline (or NULL) delimited string from the input
** and feeds it to system()
** Example:
** system rm -rf /
** \ ouch!
*/
static void ficlSystem(FICL_VM *pVM)
{
FICL_STRING *pFS = (FICL_STRING *)pVM->pad;
vmGetString(pVM, pFS, '\n');
if (pFS->count > 0)
{
int err = system(pFS->text);
if (err)
{
sprintf(pVM->pad, "System call returned %d", err);
vmTextOut(pVM, pVM->pad, 1);
vmThrow(pVM, VM_QUIT);
}
}
else
{
vmTextOut(pVM, "Warning (system): nothing happened", 1);
}
return;
}
/*
** Ficl add-in to load a text file and execute it...
** Cheesy, but illustrative.
** Line oriented... filename is newline (or NULL) delimited.
** Example:
** load test.ficl
*/
#define nLINEBUF 256
static void ficlLoad(FICL_VM *pVM)
{
char cp[nLINEBUF];
char filename[nLINEBUF];
FICL_STRING *pFilename = (FICL_STRING *)filename;
int nLine = 0;
FILE *fp;
int result;
CELL id;
struct stat buf;
vmGetString(pVM, pFilename, '\n');
if (pFilename->count <= 0)
{
vmTextOut(pVM, "Warning (load): nothing happened", 1);
return;
}
/*
** get the file's size and make sure it exists
*/
result = stat( pFilename->text, &buf );
if (result != 0)
{
vmTextOut(pVM, "Unable to stat file: ", 0);
vmTextOut(pVM, pFilename->text, 1);
vmThrow(pVM, VM_QUIT);
}
fp = fopen(pFilename->text, "r");
if (!fp)
{
vmTextOut(pVM, "Unable to open file ", 0);
vmTextOut(pVM, pFilename->text, 1);
vmThrow(pVM, VM_QUIT);
}
id = pVM->sourceID;
pVM->sourceID.p = (void *)fp;
/* feed each line to ficlExec */
while (fgets(cp, nLINEBUF, fp))
{
int len = strlen(cp) - 1;
nLine++;
if (len <= 0)
continue;
result = ficlExecC(pVM, cp, len);
if (result != VM_QUIT && result != VM_USEREXIT && result != VM_OUTOFTEXT )
{
pVM->sourceID = id;
fclose(fp);
vmThrowErr(pVM, "Error loading file <%s> line %d", pFilename->text, nLine);
break;
}
}
/*
** Pass an empty line with SOURCE-ID == -1 to flush
** any pending REFILLs (as required by FILE wordset)
*/
pVM->sourceID.i = -1;
ficlExec(pVM, "");
pVM->sourceID = id;
fclose(fp);
/* handle "bye" in loaded files. --lch */
if (result == VM_USEREXIT)
vmThrow(pVM, VM_USEREXIT);
return;
}
/*
** Dump a tab delimited file that summarizes the contents of the
** dictionary hash table by hashcode...
*/
static void spewHash(FICL_VM *pVM)
{
FICL_HASH *pHash = vmGetDict(pVM)->pForthWords;
FICL_WORD *pFW;
FILE *pOut;
unsigned i;
unsigned nHash = pHash->size;
if (!vmGetWordToPad(pVM))
vmThrow(pVM, VM_OUTOFTEXT);
pOut = fopen(pVM->pad, "w");
if (!pOut)
{
vmTextOut(pVM, "unable to open file", 1);
return;
}
for (i=0; i < nHash; i++)
{
int n = 0;
pFW = pHash->table[i];
while (pFW)
{
n++;
pFW = pFW->link;
}
fprintf(pOut, "%d\t%d", i, n);
pFW = pHash->table[i];
while (pFW)
{
fprintf(pOut, "\t%s", pFW->name);
pFW = pFW->link;
}
fprintf(pOut, "\n");
}
fclose(pOut);
return;
}
static void ficlBreak(FICL_VM *pVM)
{
pVM->state = pVM->state;
return;
}
static void ficlClock(FICL_VM *pVM)
{
clock_t now = clock();
stackPushUNS(pVM->pStack, (FICL_UNS)now);
return;
}
static void clocksPerSec(FICL_VM *pVM)
{
stackPushUNS(pVM->pStack, CLOCKS_PER_SEC);
return;
}
static void execxt(FICL_VM *pVM)
{
FICL_WORD *pFW;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
pFW = stackPopPtr(pVM->pStack);
ficlExecXT(pVM, pFW);
return;
}
void buildTestInterface(FICL_SYSTEM *pSys)
{
ficlBuild(pSys, "break", ficlBreak, FW_DEFAULT);
ficlBuild(pSys, "clock", ficlClock, FW_DEFAULT);
ficlBuild(pSys, "cd", ficlChDir, FW_DEFAULT);
ficlBuild(pSys, "execxt", execxt, FW_DEFAULT);
ficlBuild(pSys, "load", ficlLoad, FW_DEFAULT);
ficlBuild(pSys, "pwd", ficlGetCWD, FW_DEFAULT);
ficlBuild(pSys, "system", ficlSystem, FW_DEFAULT);
ficlBuild(pSys, "spewhash", spewHash, FW_DEFAULT);
ficlBuild(pSys, "clocks/sec",
clocksPerSec, FW_DEFAULT);
return;
}
int main(int argc, char **argv)
{
char in[256];
FICL_VM *pVM;
FICL_SYSTEM *pSys;
pSys = ficlInitSystem(10000);
buildTestInterface(pSys);
pVM = ficlNewVM(pSys);
ficlEvaluate(pVM, ".ver .( " __DATE__ " ) cr quit");
/*
** load file from cmd line...
*/
if (argc > 1)
{
sprintf(in, ".( loading %s ) cr load %s\n cr", argv[1], argv[1]);
ficlEvaluate(pVM, in);
}
for (;;)
{
int ret;
if (fgets(in, sizeof(in) - 1, stdin) == NULL)
break;
ret = ficlExec(pVM, in);
if (ret == VM_USEREXIT)
{
ficlTermSystem(pSys);
break;
}
}
return 0;
}
diff --git a/stand/ficl/tools.c b/stand/ficl/tools.c
index db1e94850f5e..2e5d3cd3b55b 100644
--- a/stand/ficl/tools.c
+++ b/stand/ficl/tools.c
@@ -1,918 +1,917 @@
/*******************************************************************
** t o o l s . c
** Forth Inspired Command Language - programming tools
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 20 June 2000
** $Id: tools.c,v 1.11 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
/*
** NOTES:
** SEE needs information about the addresses of functions that
** are the CFAs of colon definitions, constants, variables, DOES>
** words, and so on. It gets this information from a table and supporting
** functions in words.c.
** colonParen doDoes createParen variableParen userParen constantParen
**
** Step and break debugger for Ficl
** debug ( xt -- ) Start debugging an xt
** Set a breakpoint
** Specify breakpoint default action
*/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdlib.h>
#include <stdio.h> /* sprintf */
#include <ctype.h>
#else
#include <stand.h>
#endif
#include <string.h>
#include "ficl.h"
#if 0
/*
** nBREAKPOINTS sizes the breakpoint array. One breakpoint (bp 0) is reserved
** for the STEP command. The rest are user programmable.
*/
#define nBREAKPOINTS 32
#endif
/**************************************************************************
v m S e t B r e a k
** Set a breakpoint at the current value of IP by
** storing that address in a BREAKPOINT record
**************************************************************************/
static void vmSetBreak(FICL_VM *pVM, FICL_BREAKPOINT *pBP)
{
FICL_WORD *pStep = ficlLookup(pVM->pSys, "step-break");
assert(pStep);
pBP->address = pVM->ip;
pBP->origXT = *pVM->ip;
*pVM->ip = pStep;
}
/**************************************************************************
** d e b u g P r o m p t
**************************************************************************/
static void debugPrompt(FICL_VM *pVM)
{
vmTextOut(pVM, "dbg> ", 0);
}
/**************************************************************************
** i s A F i c l W o r d
** Vet a candidate pointer carefully to make sure
** it's not some chunk o' inline data...
** It has to have a name, and it has to look
** like it's in the dictionary address range.
** NOTE: this excludes :noname words!
**************************************************************************/
int isAFiclWord(FICL_DICT *pd, FICL_WORD *pFW)
{
if (!dictIncludes(pd, pFW))
return 0;
if (!dictIncludes(pd, pFW->name))
return 0;
if ((pFW->link != NULL) && !dictIncludes(pd, pFW->link))
return 0;
if ((pFW->nName <= 0) || (pFW->name[pFW->nName] != '\0'))
return 0;
if (strlen(pFW->name) != pFW->nName)
return 0;
return 1;
}
#if 0
static int isPrimitive(FICL_WORD *pFW)
{
WORDKIND wk = ficlWordClassify(pFW);
return ((wk != COLON) && (wk != DOES));
}
#endif
/**************************************************************************
f i n d E n c l o s i n g W o r d
** Given a pointer to something, check to make sure it's an address in the
** dictionary. If so, search backwards until we find something that looks
** like a dictionary header. If successful, return the address of the
** FICL_WORD found. Otherwise return NULL.
** nSEARCH_CELLS sets the maximum neighborhood this func will search before giving up
**************************************************************************/
#define nSEARCH_CELLS 100
static FICL_WORD *findEnclosingWord(FICL_VM *pVM, CELL *cp)
{
FICL_WORD *pFW;
FICL_DICT *pd = vmGetDict(pVM);
int i;
if (!dictIncludes(pd, (void *)cp))
return NULL;
for (i = nSEARCH_CELLS; i > 0; --i, --cp)
{
pFW = (FICL_WORD *)(cp + 1 - (sizeof (FICL_WORD) / sizeof (CELL)));
if (isAFiclWord(pd, pFW))
return pFW;
}
return NULL;
}
/**************************************************************************
s e e
** TOOLS ( "<spaces>name" -- )
** Display a human-readable representation of the named word's definition.
** The source of the representation (object-code decompilation, source
** block, etc.) and the particular form of the display is implementation
** defined.
**************************************************************************/
/*
** seeColon (for proctologists only)
** Walks a colon definition, decompiling
** on the fly. Knows about primitive control structures.
*/
static void seeColon(FICL_VM *pVM, CELL *pc)
{
char *cp;
CELL *param0 = pc;
FICL_DICT *pd = vmGetDict(pVM);
FICL_WORD *pSemiParen = ficlLookup(pVM->pSys, "(;)");
assert(pSemiParen);
for (; pc->p != pSemiParen; pc++)
{
FICL_WORD *pFW = (FICL_WORD *)(pc->p);
cp = pVM->pad;
if ((void *)pc == (void *)pVM->ip)
*cp++ = '>';
else
*cp++ = ' ';
cp += sprintf(cp, "%3d ", (int)(pc-param0));
if (isAFiclWord(pd, pFW))
{
WORDKIND kind = ficlWordClassify(pFW);
CELL c;
switch (kind)
{
case LITERAL:
c = *++pc;
if (isAFiclWord(pd, c.p))
{
FICL_WORD *pLit = (FICL_WORD *)c.p;
sprintf(cp, "%.*s ( %#lx literal )",
pLit->nName, pLit->name, (unsigned long)c.u);
}
else
sprintf(cp, "literal %ld (%#lx)",
(long)c.i, (unsigned long)c.u);
break;
case STRINGLIT:
{
FICL_STRING *sp = (FICL_STRING *)(void *)++pc;
pc = (CELL *)alignPtr(sp->text + sp->count + 1) - 1;
sprintf(cp, "s\" %.*s\"", sp->count, sp->text);
}
break;
case CSTRINGLIT:
{
FICL_STRING *sp = (FICL_STRING *)(void *)++pc;
pc = (CELL *)alignPtr(sp->text + sp->count + 1) - 1;
sprintf(cp, "c\" %.*s\"", sp->count, sp->text);
}
break;
case IF:
c = *++pc;
if (c.i > 0)
sprintf(cp, "if / while (branch %d)", (int)(pc+c.i-param0));
else
sprintf(cp, "until (branch %d)", (int)(pc+c.i-param0));
break;
case BRANCH:
c = *++pc;
if (c.i == 0)
sprintf(cp, "repeat (branch %d)", (int)(pc+c.i-param0));
else if (c.i == 1)
sprintf(cp, "else (branch %d)", (int)(pc+c.i-param0));
else
sprintf(cp, "endof (branch %d)", (int)(pc+c.i-param0));
break;
case OF:
c = *++pc;
sprintf(cp, "of (branch %d)", (int)(pc+c.i-param0));
break;
case QDO:
c = *++pc;
sprintf(cp, "?do (leave %d)", (int)((CELL *)c.p-param0));
break;
case DO:
c = *++pc;
sprintf(cp, "do (leave %d)", (int)((CELL *)c.p-param0));
break;
case LOOP:
c = *++pc;
sprintf(cp, "loop (branch %d)", (int)(pc+c.i-param0));
break;
case PLOOP:
c = *++pc;
sprintf(cp, "+loop (branch %d)", (int)(pc+c.i-param0));
break;
default:
sprintf(cp, "%.*s", pFW->nName, pFW->name);
break;
}
}
else /* probably not a word - punt and print value */
{
sprintf(cp, "%ld ( %#lx )", (long)pc->i, (unsigned long)pc->u);
}
vmTextOut(pVM, pVM->pad, 1);
}
vmTextOut(pVM, ";", 1);
}
/*
** Here's the outer part of the decompiler. It's
** just a big nested conditional that checks the
** CFA of the word to decompile for each kind of
** known word-builder code, and tries to do
** something appropriate. If the CFA is not recognized,
** just indicate that it is a primitive.
*/
static void seeXT(FICL_VM *pVM)
{
FICL_WORD *pFW;
WORDKIND kind;
pFW = (FICL_WORD *)stackPopPtr(pVM->pStack);
kind = ficlWordClassify(pFW);
switch (kind)
{
case COLON:
sprintf(pVM->pad, ": %.*s", pFW->nName, pFW->name);
vmTextOut(pVM, pVM->pad, 1);
seeColon(pVM, pFW->param);
break;
case DOES:
vmTextOut(pVM, "does>", 1);
seeColon(pVM, (CELL *)pFW->param->p);
break;
case CREATE:
vmTextOut(pVM, "create", 1);
break;
case VARIABLE:
sprintf(pVM->pad, "variable = %ld (%#lx)",
(long)pFW->param->i, (unsigned long)pFW->param->u);
vmTextOut(pVM, pVM->pad, 1);
break;
#if FICL_WANT_USER
case USER:
sprintf(pVM->pad, "user variable %ld (%#lx)",
(long)pFW->param->i, (unsigned long)pFW->param->u);
vmTextOut(pVM, pVM->pad, 1);
break;
#endif
case CONSTANT:
sprintf(pVM->pad, "constant = %ld (%#lx)",
(long)pFW->param->i, (unsigned long)pFW->param->u);
vmTextOut(pVM, pVM->pad, 1);
default:
sprintf(pVM->pad, "%.*s is a primitive", pFW->nName, pFW->name);
vmTextOut(pVM, pVM->pad, 1);
break;
}
if (pFW->flags & FW_IMMEDIATE)
{
vmTextOut(pVM, "immediate", 1);
}
if (pFW->flags & FW_COMPILE)
{
vmTextOut(pVM, "compile-only", 1);
}
return;
}
static void see(FICL_VM *pVM)
{
ficlTick(pVM);
seeXT(pVM);
return;
}
/**************************************************************************
f i c l D e b u g X T
** debug ( xt -- )
** Given an xt of a colon definition or a word defined by DOES>, set the
** VM up to debug the word: push IP, set the xt as the next thing to execute,
** set a breakpoint at its first instruction, and run to the breakpoint.
** Note: the semantics of this word are equivalent to "step in"
**************************************************************************/
void ficlDebugXT(FICL_VM *pVM)
{
FICL_WORD *xt = stackPopPtr(pVM->pStack);
WORDKIND wk = ficlWordClassify(xt);
stackPushPtr(pVM->pStack, xt);
seeXT(pVM);
switch (wk)
{
case COLON:
case DOES:
/*
** Run the colon code and set a breakpoint at the next instruction
*/
vmExecute(pVM, xt);
vmSetBreak(pVM, &(pVM->pSys->bpStep));
break;
default:
vmExecute(pVM, xt);
break;
}
return;
}
/**************************************************************************
s t e p I n
** FICL
** Execute the next instruction, stepping into it if it's a colon definition
** or a does> word. This is the easy kind of step.
**************************************************************************/
void stepIn(FICL_VM *pVM)
{
/*
** Do one step of the inner loop
*/
{
M_VM_STEP(pVM)
}
/*
** Now set a breakpoint at the next instruction
*/
vmSetBreak(pVM, &(pVM->pSys->bpStep));
return;
}
/**************************************************************************
s t e p O v e r
** FICL
** Execute the next instruction atomically. This requires some insight into
** the memory layout of compiled code. Set a breakpoint at the next instruction
** in this word, and run until we hit it
**************************************************************************/
void stepOver(FICL_VM *pVM)
{
FICL_WORD *pFW;
WORDKIND kind;
FICL_WORD *pStep = ficlLookup(pVM->pSys, "step-break");
assert(pStep);
pFW = *pVM->ip;
kind = ficlWordClassify(pFW);
switch (kind)
{
case COLON:
case DOES:
/*
** assume that the next cell holds an instruction
** set a breakpoint there and return to the inner interp
*/
pVM->pSys->bpStep.address = pVM->ip + 1;
pVM->pSys->bpStep.origXT = pVM->ip[1];
pVM->ip[1] = pStep;
break;
default:
stepIn(pVM);
break;
}
return;
}
/**************************************************************************
s t e p - b r e a k
** FICL
** Handles breakpoints for stepped execution.
** Upon entry, bpStep contains the address and replaced instruction
** of the current breakpoint.
** Clear the breakpoint
** Get a command from the console.
** i (step in) - execute the current instruction and set a new breakpoint
** at the IP
** o (step over) - execute the current instruction to completion and set
** a new breakpoint at the IP
** g (go) - execute the current instruction and exit
** q (quit) - abort current word
** b (toggle breakpoint)
**************************************************************************/
void stepBreak(FICL_VM *pVM)
{
STRINGINFO si;
FICL_WORD *pFW;
FICL_WORD *pOnStep;
if (!pVM->fRestart)
{
assert(pVM->pSys->bpStep.address);
assert(pVM->pSys->bpStep.origXT);
/*
** Clear the breakpoint that caused me to run
** Restore the original instruction at the breakpoint,
** and restore the IP
*/
pVM->ip = (IPTYPE)(pVM->pSys->bpStep.address);
*pVM->ip = pVM->pSys->bpStep.origXT;
/*
** If there's an onStep, do it
*/
pOnStep = ficlLookup(pVM->pSys, "on-step");
if (pOnStep)
ficlExecXT(pVM, pOnStep);
/*
** Print the name of the next instruction
*/
pFW = pVM->pSys->bpStep.origXT;
sprintf(pVM->pad, "next: %.*s", pFW->nName, pFW->name);
#if 0
if (isPrimitive(pFW))
{
strcat(pVM->pad, " ( primitive )");
}
#endif
vmTextOut(pVM, pVM->pad, 1);
debugPrompt(pVM);
}
else
{
pVM->fRestart = 0;
}
si = vmGetWord(pVM);
if (!strincmp(si.cp, "i", si.count))
{
stepIn(pVM);
}
else if (!strincmp(si.cp, "g", si.count))
{
return;
}
else if (!strincmp(si.cp, "l", si.count))
{
FICL_WORD *xt;
xt = findEnclosingWord(pVM, (CELL *)(pVM->ip));
if (xt)
{
stackPushPtr(pVM->pStack, xt);
seeXT(pVM);
}
else
{
vmTextOut(pVM, "sorry - can't do that", 1);
}
vmThrow(pVM, VM_RESTART);
}
else if (!strincmp(si.cp, "o", si.count))
{
stepOver(pVM);
}
else if (!strincmp(si.cp, "q", si.count))
{
ficlTextOut(pVM, FICL_PROMPT, 0);
vmThrow(pVM, VM_ABORT);
}
else if (!strincmp(si.cp, "x", si.count))
{
/*
** Take whatever's left in the TIB and feed it to a subordinate ficlExec
*/
int ret;
char *cp = pVM->tib.cp + pVM->tib.index;
int count = pVM->tib.end - cp;
FICL_WORD *oldRun = pVM->runningWord;
ret = ficlExecC(pVM, cp, count);
if (ret == VM_OUTOFTEXT)
{
ret = VM_RESTART;
pVM->runningWord = oldRun;
vmTextOut(pVM, "", 1);
}
vmThrow(pVM, ret);
}
else
{
vmTextOut(pVM, "i -- step In", 1);
vmTextOut(pVM, "o -- step Over", 1);
vmTextOut(pVM, "g -- Go (execute to completion)", 1);
vmTextOut(pVM, "l -- List source code", 1);
vmTextOut(pVM, "q -- Quit (stop debugging and abort)", 1);
vmTextOut(pVM, "x -- eXecute the rest of the line as ficl words", 1);
debugPrompt(pVM);
vmThrow(pVM, VM_RESTART);
}
return;
}
/**************************************************************************
b y e
** TOOLS
** Signal the system to shut down - this causes ficlExec to return
** VM_USEREXIT. The rest is up to you.
**************************************************************************/
static void bye(FICL_VM *pVM)
{
vmThrow(pVM, VM_USEREXIT);
return;
}
/**************************************************************************
d i s p l a y S t a c k
** TOOLS
** Display the parameter stack (code for ".s")
**************************************************************************/
static void displayPStack(FICL_VM *pVM)
{
FICL_STACK *pStk = pVM->pStack;
int d = stackDepth(pStk);
int i;
CELL *pCell;
vmCheckStack(pVM, 0, 0);
if (d == 0)
vmTextOut(pVM, "(Stack Empty) ", 0);
else
{
pCell = pStk->base;
for (i = 0; i < d; i++)
{
vmTextOut(pVM, ltoa((*pCell++).i, pVM->pad, pVM->base), 0);
vmTextOut(pVM, " ", 0);
}
}
return;
}
static void displayRStack(FICL_VM *pVM)
{
FICL_STACK *pStk = pVM->rStack;
int d = stackDepth(pStk);
int i;
CELL *pCell;
FICL_DICT *dp = vmGetDict(pVM);
vmCheckStack(pVM, 0, 0);
if (d == 0)
vmTextOut(pVM, "(Stack Empty) ", 0);
else
{
pCell = pStk->base;
for (i = 0; i < d; i++)
{
CELL c = *pCell++;
/*
** Attempt to find the word that contains the
** stacked address (as if it is part of a colon definition).
** If this works, print the name of the word. Otherwise print
** the value as a number.
*/
if (dictIncludes(dp, c.p))
{
FICL_WORD *pFW = findEnclosingWord(pVM, c.p);
if (pFW)
{
int offset = (CELL *)c.p - &pFW->param[0];
sprintf(pVM->pad, "%s+%d ", pFW->name, offset);
vmTextOut(pVM, pVM->pad, 0);
continue; /* no need to print the numeric value */
}
}
vmTextOut(pVM, ltoa(c.i, pVM->pad, pVM->base), 0);
vmTextOut(pVM, " ", 0);
}
}
return;
}
/**************************************************************************
f o r g e t - w i d
**
**************************************************************************/
static void forgetWid(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
FICL_HASH *pHash;
pHash = (FICL_HASH *)stackPopPtr(pVM->pStack);
hashForget(pHash, pDict->here);
return;
}
/**************************************************************************
f o r g e t
** TOOLS EXT ( "<spaces>name" -- )
** Skip leading space delimiters. Parse name delimited by a space.
** Find name, then delete name from the dictionary along with all
** words added to the dictionary after name. An ambiguous
** condition exists if name cannot be found.
**
** If the Search-Order word set is present, FORGET searches the
** compilation word list. An ambiguous condition exists if the
** compilation word list is deleted.
**************************************************************************/
static void forget(FICL_VM *pVM)
{
void *where;
FICL_DICT *pDict = vmGetDict(pVM);
FICL_HASH *pHash = pDict->pCompile;
ficlTick(pVM);
where = ((FICL_WORD *)stackPopPtr(pVM->pStack))->name;
hashForget(pHash, where);
pDict->here = PTRtoCELL where;
return;
}
/**************************************************************************
l i s t W o r d s
**
**************************************************************************/
#define nCOLWIDTH 8
static void listWords(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_HASH *pHash = dp->pSearch[dp->nLists - 1];
FICL_WORD *wp;
int nChars = 0;
int len;
int y = 0;
unsigned i;
int nWords = 0;
char *cp;
char *pPad = pVM->pad;
for (i = 0; i < pHash->size; i++)
{
for (wp = pHash->table[i]; wp != NULL; wp = wp->link, nWords++)
{
if (wp->nName == 0) /* ignore :noname defs */
continue;
cp = wp->name;
nChars += sprintf(pPad + nChars, "%s", cp);
if (nChars > 70)
{
pPad[nChars] = '\0';
nChars = 0;
y++;
if(y>23) {
y=0;
vmTextOut(pVM, "--- Press Enter to continue ---",0);
getchar();
vmTextOut(pVM,"\r",0);
}
vmTextOut(pVM, pPad, 1);
}
else
{
len = nCOLWIDTH - nChars % nCOLWIDTH;
while (len-- > 0)
pPad[nChars++] = ' ';
}
if (nChars > 70)
{
pPad[nChars] = '\0';
nChars = 0;
y++;
if(y>23) {
y=0;
vmTextOut(pVM, "--- Press Enter to continue ---",0);
getchar();
vmTextOut(pVM,"\r",0);
}
vmTextOut(pVM, pPad, 1);
}
}
}
if (nChars > 0)
{
pPad[nChars] = '\0';
nChars = 0;
vmTextOut(pVM, pPad, 1);
}
sprintf(pVM->pad, "Dictionary: %d words, %ld cells used of %u total",
nWords, (long) (dp->here - dp->dict), dp->size);
vmTextOut(pVM, pVM->pad, 1);
return;
}
/**************************************************************************
l i s t E n v
** Print symbols defined in the environment
**************************************************************************/
static void listEnv(FICL_VM *pVM)
{
FICL_DICT *dp = pVM->pSys->envp;
FICL_HASH *pHash = dp->pForthWords;
FICL_WORD *wp;
unsigned i;
int nWords = 0;
for (i = 0; i < pHash->size; i++)
{
for (wp = pHash->table[i]; wp != NULL; wp = wp->link, nWords++)
{
vmTextOut(pVM, wp->name, 1);
}
}
sprintf(pVM->pad, "Environment: %d words, %ld cells used of %u total",
nWords, (long) (dp->here - dp->dict), dp->size);
vmTextOut(pVM, pVM->pad, 1);
return;
}
/**************************************************************************
e n v C o n s t a n t
** Ficl interface to ficlSetEnv and ficlSetEnvD - allow ficl code to set
** environment constants...
**************************************************************************/
static void envConstant(FICL_VM *pVM)
{
unsigned value;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
vmGetWordToPad(pVM);
value = POPUNS();
ficlSetEnv(pVM->pSys, pVM->pad, (FICL_UNS)value);
return;
}
static void env2Constant(FICL_VM *pVM)
{
unsigned v1, v2;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
vmGetWordToPad(pVM);
v2 = POPUNS();
v1 = POPUNS();
ficlSetEnvD(pVM->pSys, pVM->pad, v1, v2);
return;
}
/**************************************************************************
f i c l C o m p i l e T o o l s
** Builds wordset for debugger and TOOLS optional word set
**************************************************************************/
void ficlCompileTools(FICL_SYSTEM *pSys)
{
FICL_DICT *dp = pSys->dp;
assert (dp);
/*
** TOOLS and TOOLS EXT
*/
dictAppendWord(dp, ".s", displayPStack, FW_DEFAULT);
dictAppendWord(dp, "bye", bye, FW_DEFAULT);
dictAppendWord(dp, "forget", forget, FW_DEFAULT);
dictAppendWord(dp, "see", see, FW_DEFAULT);
dictAppendWord(dp, "words", listWords, FW_DEFAULT);
/*
** Set TOOLS environment query values
*/
ficlSetEnv(pSys, "tools", FICL_TRUE);
ficlSetEnv(pSys, "tools-ext", FICL_FALSE);
/*
** Ficl extras
*/
dictAppendWord(dp, "r.s", displayRStack, FW_DEFAULT); /* guy carver */
dictAppendWord(dp, ".env", listEnv, FW_DEFAULT);
dictAppendWord(dp, "env-constant",
envConstant, FW_DEFAULT);
dictAppendWord(dp, "env-2constant",
env2Constant, FW_DEFAULT);
dictAppendWord(dp, "debug-xt", ficlDebugXT, FW_DEFAULT);
dictAppendWord(dp, "parse-order",
ficlListParseSteps,
FW_DEFAULT);
dictAppendWord(dp, "step-break",stepBreak, FW_DEFAULT);
dictAppendWord(dp, "forget-wid",forgetWid, FW_DEFAULT);
dictAppendWord(dp, "see-xt", seeXT, FW_DEFAULT);
return;
}
diff --git a/stand/ficl/unix.c b/stand/ficl/unix.c
index 5b5644079ba9..77ab3a405d70 100644
--- a/stand/ficl/unix.c
+++ b/stand/ficl/unix.c
@@ -1,23 +1,22 @@
-/* $FreeBSD$ */
#include <string.h>
#include <netinet/in.h>
#include "ficl.h"
unsigned long ficlNtohl(unsigned long number)
{
return ntohl(number);
}
void ficlCompilePlatform(FICL_DICT *dp)
{
return;
}
diff --git a/stand/ficl/vm.c b/stand/ficl/vm.c
index 97a4f04e3b3b..b435e1b6069c 100644
--- a/stand/ficl/vm.c
+++ b/stand/ficl/vm.c
@@ -1,805 +1,804 @@
/*******************************************************************
** v m . c
** Forth Inspired Command Language - virtual machine methods
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 19 July 1997
** $Id: vm.c,v 1.13 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** This file implements the virtual machine of FICL. Each virtual
** machine retains the state of an interpreter. A virtual machine
** owns a pair of stacks for parameters and return addresses, as
** well as a pile of state variables and the two dedicated registers
** of the interp.
*/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdlib.h>
#include <stdio.h>
#include <ctype.h>
#else
#include <stand.h>
#endif
#include <stdarg.h>
#include <string.h>
#include "ficl.h"
static char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
/**************************************************************************
v m B r a n c h R e l a t i v e
**
**************************************************************************/
void vmBranchRelative(FICL_VM *pVM, int offset)
{
pVM->ip += offset;
return;
}
/**************************************************************************
v m C r e a t e
** Creates a virtual machine either from scratch (if pVM is NULL on entry)
** or by resizing and reinitializing an existing VM to the specified stack
** sizes.
**************************************************************************/
FICL_VM *vmCreate(FICL_VM *pVM, unsigned nPStack, unsigned nRStack)
{
if (pVM == NULL)
{
pVM = (FICL_VM *)ficlMalloc(sizeof (FICL_VM));
assert (pVM);
memset(pVM, 0, sizeof (FICL_VM));
}
if (pVM->pStack)
stackDelete(pVM->pStack);
pVM->pStack = stackCreate(nPStack);
if (pVM->rStack)
stackDelete(pVM->rStack);
pVM->rStack = stackCreate(nRStack);
#if FICL_WANT_FLOAT
if (pVM->fStack)
stackDelete(pVM->fStack);
pVM->fStack = stackCreate(nPStack);
#endif
pVM->textOut = ficlTextOut;
vmReset(pVM);
return pVM;
}
/**************************************************************************
v m D e l e t e
** Free all memory allocated to the specified VM and its subordinate
** structures.
**************************************************************************/
void vmDelete (FICL_VM *pVM)
{
if (pVM)
{
ficlFree(pVM->pStack);
ficlFree(pVM->rStack);
#if FICL_WANT_FLOAT
ficlFree(pVM->fStack);
#endif
ficlFree(pVM);
}
return;
}
/**************************************************************************
v m E x e c u t e
** Sets up the specified word to be run by the inner interpreter.
** Executes the word's code part immediately, but in the case of
** colon definition, the definition itself needs the inner interp
** to complete. This does not happen until control reaches ficlExec
**************************************************************************/
void vmExecute(FICL_VM *pVM, FICL_WORD *pWord)
{
pVM->runningWord = pWord;
pWord->code(pVM);
return;
}
/**************************************************************************
v m I n n e r L o o p
** the mysterious inner interpreter...
** This loop is the address interpreter that makes colon definitions
** work. Upon entry, it assumes that the IP points to an entry in
** a definition (the body of a colon word). It runs one word at a time
** until something does vmThrow. The catcher for this is expected to exist
** in the calling code.
** vmThrow gets you out of this loop with a longjmp()
** Visual C++ 5 chokes on this loop in Release mode. Aargh.
**************************************************************************/
#if INLINE_INNER_LOOP == 0
void vmInnerLoop(FICL_VM *pVM)
{
M_INNER_LOOP(pVM);
}
#endif
#if 0
/*
** Recast inner loop that inlines tokens for control structures, arithmetic and stack operations,
** as well as create does> : ; and various literals
*/
typedef enum
{
PATCH = 0,
L0,
L1,
L2,
LMINUS1,
LMINUS2,
DROP,
SWAP,
DUP,
PICK,
ROLL,
FETCH,
STORE,
BRANCH,
CBRANCH,
LEAVE,
TO_R,
R_FROM,
EXIT;
} OPCODE;
typedef CELL *IPTYPE;
void vmInnerLoop(FICL_VM *pVM)
{
IPTYPE ip = pVM->ip;
FICL_STACK *pStack = pVM->pStack;
for (;;)
{
OPCODE o = (*ip++).i;
CELL c;
switch (o)
{
case L0:
stackPushINT(pStack, 0);
break;
case L1:
stackPushINT(pStack, 1);
break;
case L2:
stackPushINT(pStack, 2);
break;
case LMINUS1:
stackPushINT(pStack, -1);
break;
case LMINUS2:
stackPushINT(pStack, -2);
break;
case DROP:
stackDrop(pStack, 1);
break;
case SWAP:
stackRoll(pStack, 1);
break;
case DUP:
stackPick(pStack, 0);
break;
case PICK:
c = *ip++;
stackPick(pStack, c.i);
break;
case ROLL:
c = *ip++;
stackRoll(pStack, c.i);
break;
case EXIT:
return;
}
}
return;
}
#endif
/**************************************************************************
v m G e t D i c t
** Returns the address dictionary for this VM's system
**************************************************************************/
FICL_DICT *vmGetDict(FICL_VM *pVM)
{
assert(pVM);
return pVM->pSys->dp;
}
/**************************************************************************
v m G e t S t r i n g
** Parses a string out of the VM input buffer and copies up to the first
** FICL_STRING_MAX characters to the supplied destination buffer, a
** FICL_STRING. The destination string is NULL terminated.
**
** Returns the address of the first unused character in the dest buffer.
**************************************************************************/
char *vmGetString(FICL_VM *pVM, FICL_STRING *spDest, char delimiter)
{
STRINGINFO si = vmParseStringEx(pVM, delimiter, 0);
if (SI_COUNT(si) > FICL_STRING_MAX)
{
SI_SETLEN(si, FICL_STRING_MAX);
}
strncpy(spDest->text, SI_PTR(si), SI_COUNT(si));
spDest->text[SI_COUNT(si)] = '\0';
spDest->count = (FICL_COUNT)SI_COUNT(si);
return spDest->text + SI_COUNT(si) + 1;
}
/**************************************************************************
v m G e t W o r d
** vmGetWord calls vmGetWord0 repeatedly until it gets a string with
** non-zero length.
**************************************************************************/
STRINGINFO vmGetWord(FICL_VM *pVM)
{
STRINGINFO si = vmGetWord0(pVM);
if (SI_COUNT(si) == 0)
{
vmThrow(pVM, VM_RESTART);
}
return si;
}
/**************************************************************************
v m G e t W o r d 0
** Skip leading whitespace and parse a space delimited word from the tib.
** Returns the start address and length of the word. Updates the tib
** to reflect characters consumed, including the trailing delimiter.
** If there's nothing of interest in the tib, returns zero. This function
** does not use vmParseString because it uses isspace() rather than a
** single delimiter character.
**************************************************************************/
STRINGINFO vmGetWord0(FICL_VM *pVM)
{
char *pSrc = vmGetInBuf(pVM);
char *pEnd = vmGetInBufEnd(pVM);
STRINGINFO si;
FICL_UNS count = 0;
char ch = 0;
pSrc = skipSpace(pSrc, pEnd);
SI_SETPTR(si, pSrc);
/*
for (ch = *pSrc; (pEnd != pSrc) && !isspace(ch); ch = *++pSrc)
{
count++;
}
*/
/* Changed to make Purify happier. --lch */
for (;;)
{
if (pEnd == pSrc)
break;
ch = *pSrc;
if (isspace(ch))
break;
count++;
pSrc++;
}
SI_SETLEN(si, count);
if ((pEnd != pSrc) && isspace(ch)) /* skip one trailing delimiter */
pSrc++;
vmUpdateTib(pVM, pSrc);
return si;
}
/**************************************************************************
v m G e t W o r d T o P a d
** Does vmGetWord and copies the result to the pad as a NULL terminated
** string. Returns the length of the string. If the string is too long
** to fit in the pad, it is truncated.
**************************************************************************/
int vmGetWordToPad(FICL_VM *pVM)
{
STRINGINFO si;
char *cp = (char *)pVM->pad;
si = vmGetWord(pVM);
if (SI_COUNT(si) > nPAD)
SI_SETLEN(si, nPAD);
strncpy(cp, SI_PTR(si), SI_COUNT(si));
cp[SI_COUNT(si)] = '\0';
return (int)(SI_COUNT(si));
}
/**************************************************************************
v m P a r s e S t r i n g
** Parses a string out of the input buffer using the delimiter
** specified. Skips leading delimiters, marks the start of the string,
** and counts characters to the next delimiter it encounters. It then
** updates the vm input buffer to consume all these chars, including the
** trailing delimiter.
** Returns the address and length of the parsed string, not including the
** trailing delimiter.
**************************************************************************/
STRINGINFO vmParseString(FICL_VM *pVM, char delim)
{
return vmParseStringEx(pVM, delim, 1);
}
STRINGINFO vmParseStringEx(FICL_VM *pVM, char delim, char fSkipLeading)
{
STRINGINFO si;
char *pSrc = vmGetInBuf(pVM);
char *pEnd = vmGetInBufEnd(pVM);
char ch;
if (fSkipLeading)
{ /* skip lead delimiters */
while ((pSrc != pEnd) && (*pSrc == delim))
pSrc++;
}
SI_SETPTR(si, pSrc); /* mark start of text */
for (ch = *pSrc; (pSrc != pEnd)
&& (ch != delim)
&& (ch != '\r')
&& (ch != '\n'); ch = *++pSrc)
{
; /* find next delimiter or end of line */
}
/* set length of result */
SI_SETLEN(si, pSrc - SI_PTR(si));
if ((pSrc != pEnd) && (*pSrc == delim)) /* gobble trailing delimiter */
pSrc++;
vmUpdateTib(pVM, pSrc);
return si;
}
/**************************************************************************
v m P o p
**
**************************************************************************/
CELL vmPop(FICL_VM *pVM)
{
return stackPop(pVM->pStack);
}
/**************************************************************************
v m P u s h
**
**************************************************************************/
void vmPush(FICL_VM *pVM, CELL c)
{
stackPush(pVM->pStack, c);
return;
}
/**************************************************************************
v m P o p I P
**
**************************************************************************/
void vmPopIP(FICL_VM *pVM)
{
pVM->ip = (IPTYPE)(stackPopPtr(pVM->rStack));
return;
}
/**************************************************************************
v m P u s h I P
**
**************************************************************************/
void vmPushIP(FICL_VM *pVM, IPTYPE newIP)
{
stackPushPtr(pVM->rStack, (void *)pVM->ip);
pVM->ip = newIP;
return;
}
/**************************************************************************
v m P u s h T i b
** Binds the specified input string to the VM and clears >IN (the index)
**************************************************************************/
void vmPushTib(FICL_VM *pVM, char *text, FICL_INT nChars, TIB *pSaveTib)
{
if (pSaveTib)
{
*pSaveTib = pVM->tib;
}
pVM->tib.cp = text;
pVM->tib.end = text + nChars;
pVM->tib.index = 0;
}
void vmPopTib(FICL_VM *pVM, TIB *pTib)
{
if (pTib)
{
pVM->tib = *pTib;
}
return;
}
/**************************************************************************
v m Q u i t
**
**************************************************************************/
void vmQuit(FICL_VM *pVM)
{
stackReset(pVM->rStack);
pVM->fRestart = 0;
pVM->ip = NULL;
pVM->runningWord = NULL;
pVM->state = INTERPRET;
pVM->tib.cp = NULL;
pVM->tib.end = NULL;
pVM->tib.index = 0;
pVM->pad[0] = '\0';
pVM->sourceID.i = 0;
return;
}
/**************************************************************************
v m R e s e t
**
**************************************************************************/
void vmReset(FICL_VM *pVM)
{
vmQuit(pVM);
stackReset(pVM->pStack);
#if FICL_WANT_FLOAT
stackReset(pVM->fStack);
#endif
pVM->base = 10;
return;
}
/**************************************************************************
v m S e t T e x t O u t
** Binds the specified output callback to the vm. If you pass NULL,
** binds the default output function (ficlTextOut)
**************************************************************************/
void vmSetTextOut(FICL_VM *pVM, OUTFUNC textOut)
{
if (textOut)
pVM->textOut = textOut;
else
pVM->textOut = ficlTextOut;
return;
}
/**************************************************************************
v m T e x t O u t
** Feeds text to the vm's output callback
**************************************************************************/
void vmTextOut(FICL_VM *pVM, char *text, int fNewline)
{
assert(pVM);
assert(pVM->textOut);
(pVM->textOut)(pVM, text, fNewline);
return;
}
/**************************************************************************
v m T h r o w
**
**************************************************************************/
void vmThrow(FICL_VM *pVM, int except)
{
if (pVM->pState)
longjmp(*(pVM->pState), except);
}
void vmThrowErr(FICL_VM *pVM, char *fmt, ...)
{
va_list va;
va_start(va, fmt);
vsprintf(pVM->pad, fmt, va);
vmTextOut(pVM, pVM->pad, 1);
va_end(va);
longjmp(*(pVM->pState), VM_ERREXIT);
}
/**************************************************************************
w o r d I s I m m e d i a t e
**
**************************************************************************/
int wordIsImmediate(FICL_WORD *pFW)
{
return ((pFW != NULL) && (pFW->flags & FW_IMMEDIATE));
}
/**************************************************************************
w o r d I s C o m p i l e O n l y
**
**************************************************************************/
int wordIsCompileOnly(FICL_WORD *pFW)
{
return ((pFW != NULL) && (pFW->flags & FW_COMPILE));
}
/**************************************************************************
s t r r e v
**
**************************************************************************/
char *strrev( char *string )
{ /* reverse a string in-place */
int i = strlen(string);
char *p1 = string; /* first char of string */
char *p2 = string + i - 1; /* last non-NULL char of string */
char c;
if (i > 1)
{
while (p1 < p2)
{
c = *p2;
*p2 = *p1;
*p1 = c;
p1++; p2--;
}
}
return string;
}
/**************************************************************************
d i g i t _ t o _ c h a r
**
**************************************************************************/
char digit_to_char(int value)
{
return digits[value];
}
/**************************************************************************
i s P o w e r O f T w o
** Tests whether supplied argument is an integer power of 2 (2**n)
** where 32 > n > 1, and returns n if so. Otherwise returns zero.
**************************************************************************/
int isPowerOfTwo(FICL_UNS u)
{
int i = 1;
FICL_UNS t = 2;
for (; ((t <= u) && (t != 0)); i++, t <<= 1)
{
if (u == t)
return i;
}
return 0;
}
/**************************************************************************
l t o a
**
**************************************************************************/
char *ltoa( FICL_INT value, char *string, int radix )
{ /* convert long to string, any base */
char *cp = string;
int sign = ((radix == 10) && (value < 0));
int pwr;
assert(radix > 1);
assert(radix < 37);
assert(string);
pwr = isPowerOfTwo((FICL_UNS)radix);
if (sign)
value = -value;
if (value == 0)
*cp++ = '0';
else if (pwr != 0)
{
FICL_UNS v = (FICL_UNS) value;
FICL_UNS mask = (FICL_UNS) ~(-1 << pwr);
while (v)
{
*cp++ = digits[v & mask];
v >>= pwr;
}
}
else
{
UNSQR result;
DPUNS v;
v.hi = 0;
v.lo = (FICL_UNS)value;
while (v.lo)
{
result = ficlLongDiv(v, (FICL_UNS)radix);
*cp++ = digits[result.rem];
v.lo = result.quot;
}
}
if (sign)
*cp++ = '-';
*cp++ = '\0';
return strrev(string);
}
/**************************************************************************
u l t o a
**
**************************************************************************/
char *ultoa(FICL_UNS value, char *string, int radix )
{ /* convert long to string, any base */
char *cp = string;
DPUNS ud;
UNSQR result;
assert(radix > 1);
assert(radix < 37);
assert(string);
if (value == 0)
*cp++ = '0';
else
{
ud.hi = 0;
ud.lo = value;
result.quot = value;
while (ud.lo)
{
result = ficlLongDiv(ud, (FICL_UNS)radix);
ud.lo = result.quot;
*cp++ = digits[result.rem];
}
}
*cp++ = '\0';
return strrev(string);
}
/**************************************************************************
c a s e F o l d
** Case folds a NULL terminated string in place. All characters
** get converted to lower case.
**************************************************************************/
char *caseFold(char *cp)
{
char *oldCp = cp;
while (*cp)
{
if (isupper(*cp))
*cp = (char)tolower(*cp);
cp++;
}
return oldCp;
}
/**************************************************************************
s t r i n c m p
** (jws) simplified the code a bit in hopes of appeasing Purify
**************************************************************************/
int strincmp(char *cp1, char *cp2, FICL_UNS count)
{
int i = 0;
for (; 0 < count; ++cp1, ++cp2, --count)
{
i = tolower(*cp1) - tolower(*cp2);
if (i != 0)
return i;
else if (*cp1 == '\0')
return 0;
}
return 0;
}
/**************************************************************************
s k i p S p a c e
** Given a string pointer, returns a pointer to the first non-space
** char of the string, or to the NULL terminator if no such char found.
** If the pointer reaches "end" first, stop there. Pass NULL to
** suppress this behavior.
**************************************************************************/
char *skipSpace(char *cp, char *end)
{
assert(cp);
while ((cp != end) && isspace(*cp))
cp++;
return cp;
}
diff --git a/stand/ficl/words.c b/stand/ficl/words.c
index 3f781c6d2ff4..8d06bedf8375 100644
--- a/stand/ficl/words.c
+++ b/stand/ficl/words.c
@@ -1,5221 +1,5220 @@
/*******************************************************************
** w o r d s . c
** Forth Inspired Command Language
** ANS Forth CORE word-set written in C
** Author: John Sadler (john_sadler@alum.mit.edu)
** Created: 19 July 1997
** $Id: words.c,v 1.17 2001/12/05 07:21:34 jsadler Exp $
*******************************************************************/
/*
** Copyright (c) 1997-2001 John Sadler (john_sadler@alum.mit.edu)
** All rights reserved.
**
** Get the latest Ficl release at http://ficl.sourceforge.net
**
** I am interested in hearing from anyone who uses ficl. If you have
** a problem, a success story, a defect, an enhancement request, or
** if you would like to contribute to the ficl release, please
** contact me by email at the address above.
**
** L I C E N S E and D I S C L A I M E R
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
** ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
** OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
** HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
** 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
** SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#ifdef TESTMAIN
#include <stdlib.h>
#include <stdio.h>
#include <ctype.h>
#include <fcntl.h>
#else
#include <stand.h>
#endif
#include <string.h>
#include "ficl.h"
#include "math64.h"
static void colonParen(FICL_VM *pVM);
static void literalIm(FICL_VM *pVM);
static int ficlParseWord(FICL_VM *pVM, STRINGINFO si);
/*
** Control structure building words use these
** strings' addresses as markers on the stack to
** check for structure completion.
*/
static char doTag[] = "do";
static char colonTag[] = "colon";
static char leaveTag[] = "leave";
static char destTag[] = "target";
static char origTag[] = "origin";
static char caseTag[] = "case";
static char ofTag[] = "of";
static char fallthroughTag[] = "fallthrough";
#if FICL_WANT_LOCALS
static void doLocalIm(FICL_VM *pVM);
static void do2LocalIm(FICL_VM *pVM);
#endif
/*
** C O N T R O L S T R U C T U R E B U I L D E R S
**
** Push current dict location for later branch resolution.
** The location may be either a branch target or a patch address...
*/
static void markBranch(FICL_DICT *dp, FICL_VM *pVM, char *tag)
{
PUSHPTR(dp->here);
PUSHPTR(tag);
return;
}
static void markControlTag(FICL_VM *pVM, char *tag)
{
PUSHPTR(tag);
return;
}
static void matchControlTag(FICL_VM *pVM, char *tag)
{
char *cp;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
cp = (char *)stackPopPtr(pVM->pStack);
/*
** Changed the code below to compare the pointers first (by popular demand)
*/
if ( (cp != tag) && strcmp(cp, tag) )
{
vmThrowErr(pVM, "Error -- unmatched control structure \"%s\"", tag);
}
return;
}
/*
** Expect a branch target address on the param stack,
** compile a literal offset from the current dict location
** to the target address
*/
static void resolveBackBranch(FICL_DICT *dp, FICL_VM *pVM, char *tag)
{
FICL_INT offset;
CELL *patchAddr;
matchControlTag(pVM, tag);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
patchAddr = (CELL *)stackPopPtr(pVM->pStack);
offset = patchAddr - dp->here;
dictAppendCell(dp, LVALUEtoCELL(offset));
return;
}
/*
** Expect a branch patch address on the param stack,
** compile a literal offset from the patch location
** to the current dict location
*/
static void resolveForwardBranch(FICL_DICT *dp, FICL_VM *pVM, char *tag)
{
FICL_INT offset;
CELL *patchAddr;
matchControlTag(pVM, tag);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
patchAddr = (CELL *)stackPopPtr(pVM->pStack);
offset = dp->here - patchAddr;
*patchAddr = LVALUEtoCELL(offset);
return;
}
/*
** Match the tag to the top of the stack. If success,
** sopy "here" address into the cell whose address is next
** on the stack. Used by do..leave..loop.
*/
static void resolveAbsBranch(FICL_DICT *dp, FICL_VM *pVM, char *tag)
{
CELL *patchAddr;
char *cp;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
cp = stackPopPtr(pVM->pStack);
/*
** Changed the comparison below to compare the pointers first (by popular demand)
*/
if ((cp != tag) && strcmp(cp, tag))
{
vmTextOut(pVM, "Warning -- Unmatched control word: ", 0);
vmTextOut(pVM, tag, 1);
}
patchAddr = (CELL *)stackPopPtr(pVM->pStack);
*patchAddr = LVALUEtoCELL(dp->here);
return;
}
/**************************************************************************
f i c l P a r s e N u m b e r
** Attempts to convert the NULL terminated string in the VM's pad to
** a number using the VM's current base. If successful, pushes the number
** onto the param stack and returns TRUE. Otherwise, returns FALSE.
** (jws 8/01) Trailing decimal point causes a zero cell to be pushed. (See
** the standard for DOUBLE wordset.
**************************************************************************/
int ficlParseNumber(FICL_VM *pVM, STRINGINFO si)
{
FICL_INT accum = 0;
char isNeg = FALSE;
char hasDP = FALSE;
unsigned base = pVM->base;
char *cp = SI_PTR(si);
FICL_COUNT count= (FICL_COUNT)SI_COUNT(si);
unsigned ch;
unsigned digit;
if (count > 1)
{
switch (*cp)
{
case '-':
cp++;
count--;
isNeg = TRUE;
break;
case '+':
cp++;
count--;
isNeg = FALSE;
break;
default:
break;
}
}
if ((count > 0) && (cp[count-1] == '.')) /* detect & remove trailing decimal */
{
hasDP = TRUE;
count--;
}
if (count == 0) /* detect "+", "-", ".", "+." etc */
return FALSE;
while ((count--) && ((ch = *cp++) != '\0'))
{
if (!isalnum(ch))
return FALSE;
digit = ch - '0';
if (digit > 9)
digit = tolower(ch) - 'a' + 10;
if (digit >= base)
return FALSE;
accum = accum * base + digit;
}
if (hasDP) /* simple (required) DOUBLE support */
PUSHINT(0);
if (isNeg)
accum = -accum;
PUSHINT(accum);
if (pVM->state == COMPILE)
literalIm(pVM);
return TRUE;
}
/**************************************************************************
a d d & f r i e n d s
**
**************************************************************************/
static void add(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
i = stackPopINT(pVM->pStack);
i += stackGetTop(pVM->pStack).i;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void sub(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
i = stackPopINT(pVM->pStack);
i = stackGetTop(pVM->pStack).i - i;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void mul(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
i = stackPopINT(pVM->pStack);
i *= stackGetTop(pVM->pStack).i;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void negate(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
i = -stackPopINT(pVM->pStack);
PUSHINT(i);
return;
}
static void ficlDiv(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
i = stackPopINT(pVM->pStack);
i = stackGetTop(pVM->pStack).i / i;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
/*
** slash-mod CORE ( n1 n2 -- n3 n4 )
** Divide n1 by n2, giving the single-cell remainder n3 and the single-cell
** quotient n4. An ambiguous condition exists if n2 is zero. If n1 and n2
** differ in sign, the implementation-defined result returned will be the
** same as that returned by either the phrase
** >R S>D R> FM/MOD or the phrase >R S>D R> SM/REM .
** NOTE: Ficl complies with the second phrase (symmetric division)
*/
static void slashMod(FICL_VM *pVM)
{
DPINT n1;
FICL_INT n2;
INTQR qr;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 2);
#endif
n2 = stackPopINT(pVM->pStack);
n1.lo = stackPopINT(pVM->pStack);
i64Extend(n1);
qr = m64SymmetricDivI(n1, n2);
PUSHINT(qr.rem);
PUSHINT(qr.quot);
return;
}
static void onePlus(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
i = stackGetTop(pVM->pStack).i;
i += 1;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void oneMinus(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
i = stackGetTop(pVM->pStack).i;
i -= 1;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void twoMul(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
i = stackGetTop(pVM->pStack).i;
i *= 2;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void twoDiv(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
i = stackGetTop(pVM->pStack).i;
i >>= 1;
stackSetTop(pVM->pStack, LVALUEtoCELL(i));
return;
}
static void mulDiv(FICL_VM *pVM)
{
FICL_INT x, y, z;
DPINT prod;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 3, 1);
#endif
z = stackPopINT(pVM->pStack);
y = stackPopINT(pVM->pStack);
x = stackPopINT(pVM->pStack);
prod = m64MulI(x,y);
x = m64SymmetricDivI(prod, z).quot;
PUSHINT(x);
return;
}
static void mulDivRem(FICL_VM *pVM)
{
FICL_INT x, y, z;
DPINT prod;
INTQR qr;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 3, 2);
#endif
z = stackPopINT(pVM->pStack);
y = stackPopINT(pVM->pStack);
x = stackPopINT(pVM->pStack);
prod = m64MulI(x,y);
qr = m64SymmetricDivI(prod, z);
PUSHINT(qr.rem);
PUSHINT(qr.quot);
return;
}
/**************************************************************************
c o l o n d e f i n i t i o n s
** Code to begin compiling a colon definition
** This function sets the state to COMPILE, then creates a
** new word whose name is the next word in the input stream
** and whose code is colonParen.
**************************************************************************/
static void colon(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
dictCheckThreshold(dp);
pVM->state = COMPILE;
markControlTag(pVM, colonTag);
dictAppendWord2(dp, si, colonParen, FW_DEFAULT | FW_SMUDGE);
#if FICL_WANT_LOCALS
pVM->pSys->nLocals = 0;
#endif
return;
}
/**************************************************************************
c o l o n P a r e n
** This is the code that executes a colon definition. It assumes that the
** virtual machine is running a "next" loop (See the vm.c
** for its implementation of member function vmExecute()). The colon
** code simply copies the address of the first word in the list of words
** to interpret into IP after saving its old value. When we return to the
** "next" loop, the virtual machine will call the code for each word in
** turn.
**
**************************************************************************/
static void colonParen(FICL_VM *pVM)
{
IPTYPE tempIP = (IPTYPE) (pVM->runningWord->param);
vmPushIP(pVM, tempIP);
return;
}
/**************************************************************************
s e m i c o l o n C o I m
**
** IMMEDIATE code for ";". This function sets the state to INTERPRET and
** terminates a word under compilation by appending code for "(;)" to
** the definition. TO DO: checks for leftover branch target tags on the
** return stack and complains if any are found.
**************************************************************************/
static void semiParen(FICL_VM *pVM)
{
vmPopIP(pVM);
return;
}
static void semicolonCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pSemiParen);
matchControlTag(pVM, colonTag);
#if FICL_WANT_LOCALS
assert(pVM->pSys->pUnLinkParen);
if (pVM->pSys->nLocals > 0)
{
FICL_DICT *pLoc = ficlGetLoc(pVM->pSys);
dictEmpty(pLoc, pLoc->pForthWords->size);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pUnLinkParen));
}
pVM->pSys->nLocals = 0;
#endif
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pSemiParen));
pVM->state = INTERPRET;
dictUnsmudge(dp);
return;
}
/**************************************************************************
e x i t
** CORE
** This function simply pops the previous instruction
** pointer and returns to the "next" loop. Used for exiting from within
** a definition. Note that exitParen is identical to semiParen - they
** are in two different functions so that "see" can correctly identify
** the end of a colon definition, even if it uses "exit".
**************************************************************************/
static void exitParen(FICL_VM *pVM)
{
vmPopIP(pVM);
return;
}
static void exitCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pExitParen);
IGNORE(pVM);
#if FICL_WANT_LOCALS
if (pVM->pSys->nLocals > 0)
{
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pUnLinkParen));
}
#endif
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pExitParen));
return;
}
/**************************************************************************
c o n s t a n t P a r e n
** This is the run-time code for "constant". It simply returns the
** contents of its word's first data cell.
**
**************************************************************************/
void constantParen(FICL_VM *pVM)
{
FICL_WORD *pFW = pVM->runningWord;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
stackPush(pVM->pStack, pFW->param[0]);
return;
}
void twoConstParen(FICL_VM *pVM)
{
FICL_WORD *pFW = pVM->runningWord;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 2);
#endif
stackPush(pVM->pStack, pFW->param[0]); /* lo */
stackPush(pVM->pStack, pFW->param[1]); /* hi */
return;
}
/**************************************************************************
c o n s t a n t
** IMMEDIATE
** Compiles a constant into the dictionary. Constants return their
** value when invoked. Expects a value on top of the parm stack.
**************************************************************************/
static void constant(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
dictAppendWord2(dp, si, constantParen, FW_DEFAULT);
dictAppendCell(dp, stackPop(pVM->pStack));
return;
}
static void twoConstant(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
c = stackPop(pVM->pStack);
dictAppendWord2(dp, si, twoConstParen, FW_DEFAULT);
dictAppendCell(dp, stackPop(pVM->pStack));
dictAppendCell(dp, c);
return;
}
/**************************************************************************
d i s p l a y C e l l
** Drop and print the contents of the cell at the top of the param
** stack
**************************************************************************/
static void displayCell(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
c = stackPop(pVM->pStack);
ltoa((c).i, pVM->pad, pVM->base);
strcat(pVM->pad, " ");
vmTextOut(pVM, pVM->pad, 0);
return;
}
static void uDot(FICL_VM *pVM)
{
FICL_UNS u;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
u = stackPopUNS(pVM->pStack);
ultoa(u, pVM->pad, pVM->base);
strcat(pVM->pad, " ");
vmTextOut(pVM, pVM->pad, 0);
return;
}
static void hexDot(FICL_VM *pVM)
{
FICL_UNS u;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
u = stackPopUNS(pVM->pStack);
ultoa(u, pVM->pad, 16);
strcat(pVM->pad, " ");
vmTextOut(pVM, pVM->pad, 0);
return;
}
/**************************************************************************
s t r l e n
** FICL ( c-string -- length )
**
** Returns the length of a C-style (zero-terminated) string.
**
** --lch
**/
static void ficlStrlen(FICL_VM *ficlVM)
{
char *address = (char *)stackPopPtr(ficlVM->pStack);
stackPushINT(ficlVM->pStack, strlen(address));
}
/**************************************************************************
s p r i n t f
** FICL ( i*x c-addr-fmt u-fmt c-addr-buffer u-buffer -- c-addr-buffer u-written success-flag )
** Similar to the C sprintf() function. It formats into a buffer based on
** a "format" string. Each character in the format string is copied verbatim
** to the output buffer, until SPRINTF encounters a percent sign ("%").
** SPRINTF then skips the percent sign, and examines the next character
** (the "format character"). Here are the valid format characters:
** s - read a C-ADDR U-LENGTH string from the stack and copy it to
** the buffer
** d - read a cell from the stack, format it as a string (base-10,
** signed), and copy it to the buffer
** x - same as d, except in base-16
** u - same as d, but unsigned
** % - output a literal percent-sign to the buffer
** SPRINTF returns the c-addr-buffer argument unchanged, the number of bytes
** written, and a flag indicating whether or not it ran out of space while
** writing to the output buffer (TRUE if it ran out of space).
**
** If SPRINTF runs out of space in the buffer to store the formatted string,
** it still continues parsing, in an effort to preserve your stack (otherwise
** it might leave uneaten arguments behind).
**
** --lch
**************************************************************************/
static void ficlSprintf(FICL_VM *pVM) /* */
{
int bufferLength = stackPopINT(pVM->pStack);
char *buffer = (char *)stackPopPtr(pVM->pStack);
char *bufferStart = buffer;
int formatLength = stackPopINT(pVM->pStack);
char *format = (char *)stackPopPtr(pVM->pStack);
char *formatStop = format + formatLength;
int base = 10;
int unsignedInteger = FALSE;
FICL_INT append = FICL_TRUE;
while (format < formatStop)
{
char scratch[64];
char *source;
int actualLength;
int desiredLength;
int leadingZeroes;
if (*format != '%')
{
source = format;
actualLength = desiredLength = 1;
leadingZeroes = 0;
}
else
{
format++;
if (format == formatStop)
break;
leadingZeroes = (*format == '0');
if (leadingZeroes)
{
format++;
if (format == formatStop)
break;
}
desiredLength = isdigit(*format);
if (desiredLength)
{
desiredLength = strtol(format, &format, 10);
if (format == formatStop)
break;
}
else if (*format == '*')
{
desiredLength = stackPopINT(pVM->pStack);
format++;
if (format == formatStop)
break;
}
switch (*format)
{
case 's':
case 'S':
{
actualLength = stackPopINT(pVM->pStack);
source = (char *)stackPopPtr(pVM->pStack);
break;
}
case 'x':
case 'X':
base = 16;
case 'u':
case 'U':
unsignedInteger = TRUE;
case 'd':
case 'D':
{
int integer = stackPopINT(pVM->pStack);
if (unsignedInteger)
ultoa(integer, scratch, base);
else
ltoa(integer, scratch, base);
base = 10;
unsignedInteger = FALSE;
source = scratch;
actualLength = strlen(scratch);
break;
}
case '%':
source = format;
actualLength = 1;
default:
continue;
}
}
if (append != FICL_FALSE)
{
if (!desiredLength)
desiredLength = actualLength;
if (desiredLength > bufferLength)
{
append = FICL_FALSE;
desiredLength = bufferLength;
}
while (desiredLength > actualLength)
{
*buffer++ = (char)((leadingZeroes) ? '0' : ' ');
bufferLength--;
desiredLength--;
}
memcpy(buffer, source, actualLength);
buffer += actualLength;
bufferLength -= actualLength;
}
format++;
}
stackPushPtr(pVM->pStack, bufferStart);
stackPushINT(pVM->pStack, buffer - bufferStart);
stackPushINT(pVM->pStack, append);
}
/**************************************************************************
d u p & f r i e n d s
**
**************************************************************************/
static void depth(FICL_VM *pVM)
{
int i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
i = stackDepth(pVM->pStack);
PUSHINT(i);
return;
}
static void drop(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
stackDrop(pVM->pStack, 1);
return;
}
static void twoDrop(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
stackDrop(pVM->pStack, 2);
return;
}
static void dup(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 2);
#endif
stackPick(pVM->pStack, 0);
return;
}
static void twoDup(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 4);
#endif
stackPick(pVM->pStack, 1);
stackPick(pVM->pStack, 1);
return;
}
static void over(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 3);
#endif
stackPick(pVM->pStack, 1);
return;
}
static void twoOver(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 4, 6);
#endif
stackPick(pVM->pStack, 3);
stackPick(pVM->pStack, 3);
return;
}
static void pick(FICL_VM *pVM)
{
CELL c = stackPop(pVM->pStack);
#if FICL_ROBUST > 1
vmCheckStack(pVM, c.i+1, c.i+2);
#endif
stackPick(pVM->pStack, c.i);
return;
}
static void questionDup(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 2);
#endif
c = stackGetTop(pVM->pStack);
if (c.i != 0)
stackPick(pVM->pStack, 0);
return;
}
static void roll(FICL_VM *pVM)
{
int i = stackPop(pVM->pStack).i;
i = (i > 0) ? i : 0;
#if FICL_ROBUST > 1
vmCheckStack(pVM, i+1, i+1);
#endif
stackRoll(pVM->pStack, i);
return;
}
static void minusRoll(FICL_VM *pVM)
{
int i = stackPop(pVM->pStack).i;
i = (i > 0) ? i : 0;
#if FICL_ROBUST > 1
vmCheckStack(pVM, i+1, i+1);
#endif
stackRoll(pVM->pStack, -i);
return;
}
static void rot(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 3, 3);
#endif
stackRoll(pVM->pStack, 2);
return;
}
static void swap(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 2);
#endif
stackRoll(pVM->pStack, 1);
return;
}
static void twoSwap(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 4, 4);
#endif
stackRoll(pVM->pStack, 3);
stackRoll(pVM->pStack, 3);
return;
}
/**************************************************************************
e m i t & f r i e n d s
**
**************************************************************************/
static void emit(FICL_VM *pVM)
{
char cp[2];
int i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
i = stackPopINT(pVM->pStack);
cp[0] = (char)i;
cp[1] = '\0';
vmTextOut(pVM, cp, 0);
return;
}
static void cr(FICL_VM *pVM)
{
vmTextOut(pVM, "", 1);
return;
}
static void commentLine(FICL_VM *pVM)
{
char *cp = vmGetInBuf(pVM);
char *pEnd = vmGetInBufEnd(pVM);
char ch = *cp;
while ((cp != pEnd) && (ch != '\r') && (ch != '\n'))
{
ch = *++cp;
}
/*
** Cope with DOS or UNIX-style EOLs -
** Check for /r, /n, /r/n, or /n/r end-of-line sequences,
** and point cp to next char. If EOL is \0, we're done.
*/
if (cp != pEnd)
{
cp++;
if ( (cp != pEnd) && (ch != *cp)
&& ((*cp == '\r') || (*cp == '\n')) )
cp++;
}
vmUpdateTib(pVM, cp);
return;
}
/*
** paren CORE
** Compilation: Perform the execution semantics given below.
** Execution: ( "ccc<paren>" -- )
** Parse ccc delimited by ) (right parenthesis). ( is an immediate word.
** The number of characters in ccc may be zero to the number of characters
** in the parse area.
**
*/
static void commentHang(FICL_VM *pVM)
{
vmParseStringEx(pVM, ')', 0);
return;
}
/**************************************************************************
F E T C H & S T O R E
**
**************************************************************************/
static void fetch(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
pCell = (CELL *)stackPopPtr(pVM->pStack);
stackPush(pVM->pStack, *pCell);
return;
}
/*
** two-fetch CORE ( a-addr -- x1 x2 )
** Fetch the cell pair x1 x2 stored at a-addr. x2 is stored at a-addr and
** x1 at the next consecutive cell. It is equivalent to the sequence
** DUP CELL+ @ SWAP @ .
*/
static void twoFetch(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 2);
#endif
pCell = (CELL *)stackPopPtr(pVM->pStack);
stackPush(pVM->pStack, *pCell++);
stackPush(pVM->pStack, *pCell);
swap(pVM);
return;
}
/*
** store CORE ( x a-addr -- )
** Store x at a-addr.
*/
static void store(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
pCell = (CELL *)stackPopPtr(pVM->pStack);
*pCell = stackPop(pVM->pStack);
}
/*
** two-store CORE ( x1 x2 a-addr -- )
** Store the cell pair x1 x2 at a-addr, with x2 at a-addr and x1 at the
** next consecutive cell. It is equivalent to the sequence
** SWAP OVER ! CELL+ ! .
*/
static void twoStore(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 3, 0);
#endif
pCell = (CELL *)stackPopPtr(pVM->pStack);
*pCell++ = stackPop(pVM->pStack);
*pCell = stackPop(pVM->pStack);
}
static void plusStore(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
pCell = (CELL *)stackPopPtr(pVM->pStack);
pCell->i += stackPop(pVM->pStack).i;
}
static void quadFetch(FICL_VM *pVM)
{
UNS32 *pw;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
pw = (UNS32 *)stackPopPtr(pVM->pStack);
PUSHUNS((FICL_UNS)*pw);
return;
}
static void quadStore(FICL_VM *pVM)
{
UNS32 *pw;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
pw = (UNS32 *)stackPopPtr(pVM->pStack);
*pw = (UNS32)(stackPop(pVM->pStack).u);
}
static void wFetch(FICL_VM *pVM)
{
UNS16 *pw;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
pw = (UNS16 *)stackPopPtr(pVM->pStack);
PUSHUNS((FICL_UNS)*pw);
return;
}
static void wStore(FICL_VM *pVM)
{
UNS16 *pw;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
pw = (UNS16 *)stackPopPtr(pVM->pStack);
*pw = (UNS16)(stackPop(pVM->pStack).u);
}
static void cFetch(FICL_VM *pVM)
{
UNS8 *pc;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
pc = (UNS8 *)stackPopPtr(pVM->pStack);
PUSHUNS((FICL_UNS)*pc);
return;
}
static void cStore(FICL_VM *pVM)
{
UNS8 *pc;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
pc = (UNS8 *)stackPopPtr(pVM->pStack);
*pc = (UNS8)(stackPop(pVM->pStack).u);
}
/**************************************************************************
b r a n c h P a r e n
**
** Runtime for "(branch)" -- expects a literal offset in the next
** compilation address, and branches to that location.
**************************************************************************/
static void branchParen(FICL_VM *pVM)
{
vmBranchRelative(pVM, (uintptr_t)*(pVM->ip));
return;
}
/**************************************************************************
b r a n c h 0
** Runtime code for "(branch0)"; pop a flag from the stack,
** branch if 0. fall through otherwise. The heart of "if" and "until".
**************************************************************************/
static void branch0(FICL_VM *pVM)
{
FICL_UNS flag;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
flag = stackPopUNS(pVM->pStack);
if (flag)
{ /* fall through */
vmBranchRelative(pVM, 1);
}
else
{ /* take branch (to else/endif/begin) */
vmBranchRelative(pVM, (uintptr_t)*(pVM->ip));
}
return;
}
/**************************************************************************
i f C o I m
** IMMEDIATE COMPILE-ONLY
** Compiles code for a conditional branch into the dictionary
** and pushes the branch patch address on the stack for later
** patching by ELSE or THEN/ENDIF.
**************************************************************************/
static void ifCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pBranch0);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranch0));
markBranch(dp, pVM, origTag);
dictAppendUNS(dp, 1);
return;
}
/**************************************************************************
e l s e C o I m
**
** IMMEDIATE COMPILE-ONLY
** compiles an "else"...
** 1) Compile a branch and a patch address; the address gets patched
** by "endif" to point past the "else" code.
** 2) Pop the "if" patch address
** 3) Patch the "if" branch to point to the current compile address.
** 4) Push the "else" patch address. ("endif" patches this to jump past
** the "else" code.
**************************************************************************/
static void elseCoIm(FICL_VM *pVM)
{
CELL *patchAddr;
FICL_INT offset;
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pBranchParen);
/* (1) compile branch runtime */
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranchParen));
matchControlTag(pVM, origTag);
patchAddr =
(CELL *)stackPopPtr(pVM->pStack); /* (2) pop "if" patch addr */
markBranch(dp, pVM, origTag); /* (4) push "else" patch addr */
dictAppendUNS(dp, 1); /* (1) compile patch placeholder */
offset = dp->here - patchAddr;
*patchAddr = LVALUEtoCELL(offset); /* (3) Patch "if" */
return;
}
/**************************************************************************
e n d i f C o I m
** IMMEDIATE COMPILE-ONLY
**************************************************************************/
static void endifCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
resolveForwardBranch(dp, pVM, origTag);
return;
}
/**************************************************************************
c a s e C o I m
** IMMEDIATE COMPILE-ONLY
**
**
** At compile-time, a CASE-SYS (see DPANS94 6.2.0873) looks like this:
** i*addr i caseTag
** and an OF-SYS (see DPANS94 6.2.1950) looks like this:
** i*addr i caseTag addr ofTag
** The integer under caseTag is the count of fixup addresses that branch
** to ENDCASE.
**************************************************************************/
static void caseCoIm(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 2);
#endif
PUSHUNS(0);
markControlTag(pVM, caseTag);
return;
}
/**************************************************************************
e n d c a s eC o I m
** IMMEDIATE COMPILE-ONLY
**************************************************************************/
static void endcaseCoIm(FICL_VM *pVM)
{
FICL_UNS fixupCount;
FICL_DICT *dp;
CELL *patchAddr;
FICL_INT offset;
assert(pVM->pSys->pDrop);
/*
** if the last OF ended with FALLTHROUGH,
** just add the FALLTHROUGH fixup to the
** ENDOF fixups
*/
if (stackGetTop(pVM->pStack).p == fallthroughTag)
{
matchControlTag(pVM, fallthroughTag);
patchAddr = POPPTR();
matchControlTag(pVM, caseTag);
fixupCount = POPUNS();
PUSHPTR(patchAddr);
PUSHUNS(fixupCount + 1);
markControlTag(pVM, caseTag);
}
matchControlTag(pVM, caseTag);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
fixupCount = POPUNS();
#if FICL_ROBUST > 1
vmCheckStack(pVM, fixupCount, 0);
#endif
dp = vmGetDict(pVM);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pDrop));
while (fixupCount--)
{
patchAddr = (CELL *)stackPopPtr(pVM->pStack);
offset = dp->here - patchAddr;
*patchAddr = LVALUEtoCELL(offset);
}
return;
}
static void ofParen(FICL_VM *pVM)
{
FICL_UNS a, b;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
a = POPUNS();
b = stackGetTop(pVM->pStack).u;
if (a == b)
{ /* fall through */
stackDrop(pVM->pStack, 1);
vmBranchRelative(pVM, 1);
}
else
{ /* take branch to next of or endswitch */
vmBranchRelative(pVM, *(int *)(pVM->ip));
}
return;
}
/**************************************************************************
o f C o I m
** IMMEDIATE COMPILE-ONLY
**************************************************************************/
static void ofCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
CELL *fallthroughFixup = NULL;
assert(pVM->pSys->pBranch0);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 3);
#endif
if (stackGetTop(pVM->pStack).p == fallthroughTag)
{
matchControlTag(pVM, fallthroughTag);
fallthroughFixup = POPPTR();
}
matchControlTag(pVM, caseTag);
markControlTag(pVM, caseTag);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pOfParen));
markBranch(dp, pVM, ofTag);
dictAppendUNS(dp, 2);
if (fallthroughFixup != NULL)
{
FICL_INT offset = dp->here - fallthroughFixup;
*fallthroughFixup = LVALUEtoCELL(offset);
}
return;
}
/**************************************************************************
e n d o f C o I m
** IMMEDIATE COMPILE-ONLY
**************************************************************************/
static void endofCoIm(FICL_VM *pVM)
{
CELL *patchAddr;
FICL_UNS fixupCount;
FICL_INT offset;
FICL_DICT *dp = vmGetDict(pVM);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 4, 3);
#endif
assert(pVM->pSys->pBranchParen);
/* ensure we're in an OF, */
matchControlTag(pVM, ofTag);
/* grab the address of the branch location after the OF */
patchAddr = (CELL *)stackPopPtr(pVM->pStack);
/* ensure we're also in a "case" */
matchControlTag(pVM, caseTag);
/* grab the current number of ENDOF fixups */
fixupCount = POPUNS();
/* compile branch runtime */
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranchParen));
/* push a new ENDOF fixup, the updated count of ENDOF fixups, and the caseTag */
PUSHPTR(dp->here);
PUSHUNS(fixupCount + 1);
markControlTag(pVM, caseTag);
/* reserve space for the ENDOF fixup */
dictAppendUNS(dp, 2);
/* and patch the original OF */
offset = dp->here - patchAddr;
*patchAddr = LVALUEtoCELL(offset);
}
/**************************************************************************
f a l l t h r o u g h C o I m
** IMMEDIATE COMPILE-ONLY
**************************************************************************/
static void fallthroughCoIm(FICL_VM *pVM)
{
CELL *patchAddr;
FICL_INT offset;
FICL_DICT *dp = vmGetDict(pVM);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 4, 3);
#endif
/* ensure we're in an OF, */
matchControlTag(pVM, ofTag);
/* grab the address of the branch location after the OF */
patchAddr = (CELL *)stackPopPtr(pVM->pStack);
/* ensure we're also in a "case" */
matchControlTag(pVM, caseTag);
/* okay, here we go. put the case tag back. */
markControlTag(pVM, caseTag);
/* compile branch runtime */
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranchParen));
/* push a new FALLTHROUGH fixup and the fallthroughTag */
PUSHPTR(dp->here);
markControlTag(pVM, fallthroughTag);
/* reserve space for the FALLTHROUGH fixup */
dictAppendUNS(dp, 2);
/* and patch the original OF */
offset = dp->here - patchAddr;
*patchAddr = LVALUEtoCELL(offset);
}
/**************************************************************************
h a s h
** hash ( c-addr u -- code)
** calculates hashcode of specified string and leaves it on the stack
**************************************************************************/
static void hash(FICL_VM *pVM)
{
STRINGINFO si;
SI_SETLEN(si, stackPopUNS(pVM->pStack));
SI_SETPTR(si, stackPopPtr(pVM->pStack));
PUSHUNS(hashHashCode(si));
return;
}
/**************************************************************************
i n t e r p r e t
** This is the "user interface" of a Forth. It does the following:
** while there are words in the VM's Text Input Buffer
** Copy next word into the pad (vmGetWord)
** Attempt to find the word in the dictionary (dictLookup)
** If successful, execute the word.
** Otherwise, attempt to convert the word to a number (isNumber)
** If successful, push the number onto the parameter stack.
** Otherwise, print an error message and exit loop...
** End Loop
**
** From the standard, section 3.4
** Text interpretation (see 6.1.1360 EVALUATE and 6.1.2050 QUIT) shall
** repeat the following steps until either the parse area is empty or an
** ambiguous condition exists:
** a) Skip leading spaces and parse a name (see 3.4.1);
**************************************************************************/
static void interpret(FICL_VM *pVM)
{
STRINGINFO si;
int i;
FICL_SYSTEM *pSys;
assert(pVM);
pSys = pVM->pSys;
si = vmGetWord0(pVM);
/*
** Get next word...if out of text, we're done.
*/
if (si.count == 0)
{
vmThrow(pVM, VM_OUTOFTEXT);
}
/*
** Attempt to find the incoming token in the dictionary. If that fails...
** run the parse chain against the incoming token until somebody eats it.
** Otherwise emit an error message and give up.
** Although ficlParseWord could be part of the parse list, I've hard coded it
** in for robustness. ficlInitSystem adds the other default steps to the list.
*/
if (ficlParseWord(pVM, si))
return;
for (i=0; i < FICL_MAX_PARSE_STEPS; i++)
{
FICL_WORD *pFW = pSys->parseList[i];
if (pFW == NULL)
break;
if (pFW->code == parseStepParen)
{
FICL_PARSE_STEP pStep;
pStep = (FICL_PARSE_STEP)(pFW->param->fn);
if ((*pStep)(pVM, si))
return;
}
else
{
stackPushPtr(pVM->pStack, SI_PTR(si));
stackPushUNS(pVM->pStack, SI_COUNT(si));
ficlExecXT(pVM, pFW);
if (stackPopINT(pVM->pStack))
return;
}
}
i = SI_COUNT(si);
vmThrowErr(pVM, "%.*s not found", i, SI_PTR(si));
return; /* back to inner interpreter */
}
/**************************************************************************
f i c l P a r s e W o r d
** From the standard, section 3.4
** b) Search the dictionary name space (see 3.4.2). If a definition name
** matching the string is found:
** 1.if interpreting, perform the interpretation semantics of the definition
** (see 3.4.3.2), and continue at a);
** 2.if compiling, perform the compilation semantics of the definition
** (see 3.4.3.3), and continue at a).
**
** c) If a definition name matching the string is not found, attempt to
** convert the string to a number (see 3.4.1.3). If successful:
** 1.if interpreting, place the number on the data stack, and continue at a);
** 2.if compiling, compile code that when executed will place the number on
** the stack (see 6.1.1780 LITERAL), and continue at a);
**
** d) If unsuccessful, an ambiguous condition exists (see 3.4.4).
**
** (jws 4/01) Modified to be a FICL_PARSE_STEP
**************************************************************************/
static int ficlParseWord(FICL_VM *pVM, STRINGINFO si)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_WORD *tempFW;
#if FICL_ROBUST
dictCheck(dp, pVM, 0);
vmCheckStack(pVM, 0, 0);
#endif
#if FICL_WANT_LOCALS
if (pVM->pSys->nLocals > 0)
{
tempFW = ficlLookupLoc(pVM->pSys, si);
}
else
#endif
tempFW = dictLookup(dp, si);
if (pVM->state == INTERPRET)
{
if (tempFW != NULL)
{
if (wordIsCompileOnly(tempFW))
{
vmThrowErr(pVM, "Error: Compile only!");
}
vmExecute(pVM, tempFW);
return (int)FICL_TRUE;
}
}
else /* (pVM->state == COMPILE) */
{
if (tempFW != NULL)
{
if (wordIsImmediate(tempFW))
{
vmExecute(pVM, tempFW);
}
else
{
dictAppendCell(dp, LVALUEtoCELL(tempFW));
}
return (int)FICL_TRUE;
}
}
return FICL_FALSE;
}
/*
** Surrogate precompiled parse step for ficlParseWord (this step is hard coded in
** INTERPRET)
*/
static void lookup(FICL_VM *pVM)
{
STRINGINFO si;
SI_SETLEN(si, stackPopUNS(pVM->pStack));
SI_SETPTR(si, stackPopPtr(pVM->pStack));
stackPushINT(pVM->pStack, ficlParseWord(pVM, si));
return;
}
/**************************************************************************
p a r e n P a r s e S t e p
** (parse-step) ( c-addr u -- flag )
** runtime for a precompiled parse step - pop a counted string off the
** stack, run the parse step against it, and push the result flag (FICL_TRUE
** if success, FICL_FALSE otherwise).
**************************************************************************/
void parseStepParen(FICL_VM *pVM)
{
STRINGINFO si;
FICL_WORD *pFW = pVM->runningWord;
FICL_PARSE_STEP pStep = (FICL_PARSE_STEP)(pFW->param->fn);
SI_SETLEN(si, stackPopINT(pVM->pStack));
SI_SETPTR(si, stackPopPtr(pVM->pStack));
PUSHINT((*pStep)(pVM, si));
return;
}
static void addParseStep(FICL_VM *pVM)
{
FICL_WORD *pStep;
FICL_DICT *pd = vmGetDict(pVM);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
pStep = (FICL_WORD *)(stackPop(pVM->pStack).p);
if ((pStep != NULL) && isAFiclWord(pd, pStep))
ficlAddParseStep(pVM->pSys, pStep);
return;
}
/**************************************************************************
l i t e r a l P a r e n
**
** This is the runtime for (literal). It assumes that it is part of a colon
** definition, and that the next CELL contains a value to be pushed on the
** parameter stack at runtime. This code is compiled by "literal".
**
**************************************************************************/
static void literalParen(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
PUSHINT(*(FICL_INT *)(pVM->ip));
vmBranchRelative(pVM, 1);
return;
}
static void twoLitParen(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 2);
#endif
PUSHINT(*((FICL_INT *)(pVM->ip)+1));
PUSHINT(*(FICL_INT *)(pVM->ip));
vmBranchRelative(pVM, 2);
return;
}
/**************************************************************************
l i t e r a l I m
**
** IMMEDIATE code for "literal". This function gets a value from the stack
** and compiles it into the dictionary preceded by the code for "(literal)".
** IMMEDIATE
**************************************************************************/
static void literalIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pLitParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pLitParen));
dictAppendCell(dp, stackPop(pVM->pStack));
return;
}
static void twoLiteralIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pTwoLitParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pTwoLitParen));
dictAppendCell(dp, stackPop(pVM->pStack));
dictAppendCell(dp, stackPop(pVM->pStack));
return;
}
/**************************************************************************
l o g i c a n d c o m p a r i s o n s
**
**************************************************************************/
static void zeroEquals(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
c.i = FICL_BOOL(stackPopINT(pVM->pStack) == 0);
stackPush(pVM->pStack, c);
return;
}
static void zeroLess(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
c.i = FICL_BOOL(stackPopINT(pVM->pStack) < 0);
stackPush(pVM->pStack, c);
return;
}
static void zeroGreater(FICL_VM *pVM)
{
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
c.i = FICL_BOOL(stackPopINT(pVM->pStack) > 0);
stackPush(pVM->pStack, c);
return;
}
static void isEqual(FICL_VM *pVM)
{
CELL x, y;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
x = stackPop(pVM->pStack);
y = stackPop(pVM->pStack);
PUSHINT(FICL_BOOL(x.i == y.i));
return;
}
static void isLess(FICL_VM *pVM)
{
CELL x, y;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
y = stackPop(pVM->pStack);
x = stackPop(pVM->pStack);
PUSHINT(FICL_BOOL(x.i < y.i));
return;
}
static void uIsLess(FICL_VM *pVM)
{
FICL_UNS u1, u2;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
u2 = stackPopUNS(pVM->pStack);
u1 = stackPopUNS(pVM->pStack);
PUSHINT(FICL_BOOL(u1 < u2));
return;
}
static void isGreater(FICL_VM *pVM)
{
CELL x, y;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
y = stackPop(pVM->pStack);
x = stackPop(pVM->pStack);
PUSHINT(FICL_BOOL(x.i > y.i));
return;
}
static void uIsGreater(FICL_VM *pVM)
{
FICL_UNS u1, u2;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
u2 = stackPopUNS(pVM->pStack);
u1 = stackPopUNS(pVM->pStack);
PUSHINT(FICL_BOOL(u1 > u2));
return;
}
static void bitwiseAnd(FICL_VM *pVM)
{
CELL x, y;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
x = stackPop(pVM->pStack);
y = stackPop(pVM->pStack);
PUSHINT(x.i & y.i);
return;
}
static void bitwiseOr(FICL_VM *pVM)
{
CELL x, y;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
x = stackPop(pVM->pStack);
y = stackPop(pVM->pStack);
PUSHINT(x.i | y.i);
return;
}
static void bitwiseXor(FICL_VM *pVM)
{
CELL x, y;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 1);
#endif
x = stackPop(pVM->pStack);
y = stackPop(pVM->pStack);
PUSHINT(x.i ^ y.i);
return;
}
static void bitwiseNot(FICL_VM *pVM)
{
CELL x;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
x = stackPop(pVM->pStack);
PUSHINT(~x.i);
return;
}
/**************************************************************************
D o / L o o p
** do -- IMMEDIATE COMPILE ONLY
** Compiles code to initialize a loop: compile (do),
** allot space to hold the "leave" address, push a branch
** target address for the loop.
** (do) -- runtime for "do"
** pops index and limit from the p stack and moves them
** to the r stack, then skips to the loop body.
** loop -- IMMEDIATE COMPILE ONLY
** +loop
** Compiles code for the test part of a loop:
** compile (loop), resolve forward branch from "do", and
** copy "here" address to the "leave" address allotted by "do"
** i,j,k -- COMPILE ONLY
** Runtime: Push loop indices on param stack (i is innermost loop...)
** Note: each loop has three values on the return stack:
** ( R: leave limit index )
** "leave" is the absolute address of the next cell after the loop
** limit and index are the loop control variables.
** leave -- COMPILE ONLY
** Runtime: pop the loop control variables, then pop the
** "leave" address and jump (absolute) there.
**************************************************************************/
static void doCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pDoParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pDoParen));
/*
** Allot space for a pointer to the end
** of the loop - "leave" uses this...
*/
markBranch(dp, pVM, leaveTag);
dictAppendUNS(dp, 0);
/*
** Mark location of head of loop...
*/
markBranch(dp, pVM, doTag);
return;
}
static void doParen(FICL_VM *pVM)
{
CELL index, limit;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
index = stackPop(pVM->pStack);
limit = stackPop(pVM->pStack);
/* copy "leave" target addr to stack */
stackPushPtr(pVM->rStack, *(pVM->ip++));
stackPush(pVM->rStack, limit);
stackPush(pVM->rStack, index);
return;
}
static void qDoCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pQDoParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pQDoParen));
/*
** Allot space for a pointer to the end
** of the loop - "leave" uses this...
*/
markBranch(dp, pVM, leaveTag);
dictAppendUNS(dp, 0);
/*
** Mark location of head of loop...
*/
markBranch(dp, pVM, doTag);
return;
}
static void qDoParen(FICL_VM *pVM)
{
CELL index, limit;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
index = stackPop(pVM->pStack);
limit = stackPop(pVM->pStack);
/* copy "leave" target addr to stack */
stackPushPtr(pVM->rStack, *(pVM->ip++));
if (limit.u == index.u)
{
vmPopIP(pVM);
}
else
{
stackPush(pVM->rStack, limit);
stackPush(pVM->rStack, index);
}
return;
}
/*
** Runtime code to break out of a do..loop construct
** Drop the loop control variables; the branch address
** past "loop" is next on the return stack.
*/
static void leaveCo(FICL_VM *pVM)
{
/* almost unloop */
stackDrop(pVM->rStack, 2);
/* exit */
vmPopIP(pVM);
return;
}
static void unloopCo(FICL_VM *pVM)
{
stackDrop(pVM->rStack, 3);
return;
}
static void loopCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pLoopParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pLoopParen));
resolveBackBranch(dp, pVM, doTag);
resolveAbsBranch(dp, pVM, leaveTag);
return;
}
static void plusLoopCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pPLoopParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pPLoopParen));
resolveBackBranch(dp, pVM, doTag);
resolveAbsBranch(dp, pVM, leaveTag);
return;
}
static void loopParen(FICL_VM *pVM)
{
FICL_INT index = stackGetTop(pVM->rStack).i;
FICL_INT limit = stackFetch(pVM->rStack, 1).i;
index++;
if (index >= limit)
{
stackDrop(pVM->rStack, 3); /* nuke the loop indices & "leave" addr */
vmBranchRelative(pVM, 1); /* fall through the loop */
}
else
{ /* update index, branch to loop head */
stackSetTop(pVM->rStack, LVALUEtoCELL(index));
vmBranchRelative(pVM, (uintptr_t)*(pVM->ip));
}
return;
}
static void plusLoopParen(FICL_VM *pVM)
{
FICL_INT index,limit,increment;
int flag;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
index = stackGetTop(pVM->rStack).i;
limit = stackFetch(pVM->rStack, 1).i;
increment = POP().i;
index += increment;
if (increment < 0)
flag = (index < limit);
else
flag = (index >= limit);
if (flag)
{
stackDrop(pVM->rStack, 3); /* nuke the loop indices & "leave" addr */
vmBranchRelative(pVM, 1); /* fall through the loop */
}
else
{ /* update index, branch to loop head */
stackSetTop(pVM->rStack, LVALUEtoCELL(index));
vmBranchRelative(pVM, (uintptr_t)*(pVM->ip));
}
return;
}
static void loopICo(FICL_VM *pVM)
{
CELL index = stackGetTop(pVM->rStack);
stackPush(pVM->pStack, index);
return;
}
static void loopJCo(FICL_VM *pVM)
{
CELL index = stackFetch(pVM->rStack, 3);
stackPush(pVM->pStack, index);
return;
}
static void loopKCo(FICL_VM *pVM)
{
CELL index = stackFetch(pVM->rStack, 6);
stackPush(pVM->pStack, index);
return;
}
/**************************************************************************
r e t u r n s t a c k
**
**************************************************************************/
static void toRStack(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
stackPush(pVM->rStack, POP());
}
static void fromRStack(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
PUSH(stackPop(pVM->rStack));
}
static void fetchRStack(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
PUSH(stackGetTop(pVM->rStack));
}
static void twoToR(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
stackRoll(pVM->pStack, 1);
stackPush(pVM->rStack, stackPop(pVM->pStack));
stackPush(pVM->rStack, stackPop(pVM->pStack));
return;
}
static void twoRFrom(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 2);
#endif
stackPush(pVM->pStack, stackPop(pVM->rStack));
stackPush(pVM->pStack, stackPop(pVM->rStack));
stackRoll(pVM->pStack, 1);
return;
}
static void twoRFetch(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 2);
#endif
stackPush(pVM->pStack, stackFetch(pVM->rStack, 1));
stackPush(pVM->pStack, stackFetch(pVM->rStack, 0));
return;
}
/**************************************************************************
v a r i a b l e
**
**************************************************************************/
static void variableParen(FICL_VM *pVM)
{
FICL_WORD *fw;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
fw = pVM->runningWord;
PUSHPTR(fw->param);
}
static void variable(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
dictAppendWord2(dp, si, variableParen, FW_DEFAULT);
dictAllotCells(dp, 1);
return;
}
static void twoVariable(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
dictAppendWord2(dp, si, variableParen, FW_DEFAULT);
dictAllotCells(dp, 2);
return;
}
/**************************************************************************
b a s e & f r i e n d s
**
**************************************************************************/
static void base(FICL_VM *pVM)
{
CELL *pBase;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
pBase = (CELL *)(&pVM->base);
stackPush(pVM->pStack, LVALUEtoCELL(pBase));
return;
}
static void decimal(FICL_VM *pVM)
{
pVM->base = 10;
return;
}
static void hex(FICL_VM *pVM)
{
pVM->base = 16;
return;
}
/**************************************************************************
a l l o t & f r i e n d s
**
**************************************************************************/
static void allot(FICL_VM *pVM)
{
FICL_DICT *dp;
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
dp = vmGetDict(pVM);
i = POPINT();
#if FICL_ROBUST
dictCheck(dp, pVM, i);
#endif
dictAllot(dp, i);
return;
}
static void here(FICL_VM *pVM)
{
FICL_DICT *dp;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
dp = vmGetDict(pVM);
PUSHPTR(dp->here);
return;
}
static void comma(FICL_VM *pVM)
{
FICL_DICT *dp;
CELL c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
dp = vmGetDict(pVM);
c = POP();
dictAppendCell(dp, c);
return;
}
static void cComma(FICL_VM *pVM)
{
FICL_DICT *dp;
char c;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
dp = vmGetDict(pVM);
c = (char)POPINT();
dictAppendChar(dp, c);
return;
}
static void cells(FICL_VM *pVM)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
i = POPINT();
PUSHINT(i * (FICL_INT)sizeof (CELL));
return;
}
static void cellPlus(FICL_VM *pVM)
{
char *cp;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
cp = POPPTR();
PUSHPTR(cp + sizeof (CELL));
return;
}
/**************************************************************************
t i c k
** tick CORE ( "<spaces>name" -- xt )
** Skip leading space delimiters. Parse name delimited by a space. Find
** name and return xt, the execution token for name. An ambiguous condition
** exists if name is not found.
**************************************************************************/
void ficlTick(FICL_VM *pVM)
{
FICL_WORD *pFW = NULL;
STRINGINFO si = vmGetWord(pVM);
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
pFW = dictLookup(vmGetDict(pVM), si);
if (!pFW)
{
int i = SI_COUNT(si);
vmThrowErr(pVM, "%.*s not found", i, SI_PTR(si));
}
PUSHPTR(pFW);
return;
}
static void bracketTickCoIm(FICL_VM *pVM)
{
ficlTick(pVM);
literalIm(pVM);
return;
}
/**************************************************************************
p o s t p o n e
** Lookup the next word in the input stream and compile code to
** insert it into definitions created by the resulting word
** (defers compilation, even of immediate words)
**************************************************************************/
static void postponeCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_WORD *pFW;
FICL_WORD *pComma = ficlLookup(pVM->pSys, ",");
assert(pComma);
ficlTick(pVM);
pFW = stackGetTop(pVM->pStack).p;
if (wordIsImmediate(pFW))
{
dictAppendCell(dp, stackPop(pVM->pStack));
}
else
{
literalIm(pVM);
dictAppendCell(dp, LVALUEtoCELL(pComma));
}
return;
}
/**************************************************************************
e x e c u t e
** Pop an execution token (pointer to a word) off the stack and
** run it
**************************************************************************/
static void execute(FICL_VM *pVM)
{
FICL_WORD *pFW;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
pFW = stackPopPtr(pVM->pStack);
vmExecute(pVM, pFW);
return;
}
/**************************************************************************
i m m e d i a t e
** Make the most recently compiled word IMMEDIATE -- it executes even
** in compile state (most often used for control compiling words
** such as IF, THEN, etc)
**************************************************************************/
static void immediate(FICL_VM *pVM)
{
IGNORE(pVM);
dictSetImmediate(vmGetDict(pVM));
return;
}
static void compileOnly(FICL_VM *pVM)
{
IGNORE(pVM);
dictSetFlags(vmGetDict(pVM), FW_COMPILE, 0);
return;
}
static void setObjectFlag(FICL_VM *pVM)
{
IGNORE(pVM);
dictSetFlags(vmGetDict(pVM), FW_ISOBJECT, 0);
return;
}
static void isObject(FICL_VM *pVM)
{
FICL_INT flag;
FICL_WORD *pFW = (FICL_WORD *)stackPopPtr(pVM->pStack);
flag = ((pFW != NULL) && (pFW->flags & FW_ISOBJECT)) ? FICL_TRUE : FICL_FALSE;
stackPushINT(pVM->pStack, flag);
return;
}
static void cstringLit(FICL_VM *pVM)
{
FICL_STRING *sp = (FICL_STRING *)(pVM->ip);
char *cp = sp->text;
cp += sp->count + 1;
cp = alignPtr(cp);
pVM->ip = (IPTYPE)(void *)cp;
stackPushPtr(pVM->pStack, sp);
return;
}
static void cstringQuoteIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
if (pVM->state == INTERPRET)
{
FICL_STRING *sp = (FICL_STRING *) dp->here;
vmGetString(pVM, sp, '\"');
stackPushPtr(pVM->pStack, sp);
/* move HERE past string so it doesn't get overwritten. --lch */
dictAllot(dp, sp->count + sizeof(FICL_COUNT));
}
else /* COMPILE state */
{
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pCStringLit));
dp->here = PTRtoCELL vmGetString(pVM, (FICL_STRING *)dp->here, '\"');
dictAlign(dp);
}
return;
}
/**************************************************************************
d o t Q u o t e
** IMMEDIATE word that compiles a string literal for later display
** Compile stringLit, then copy the bytes of the string from the TIB
** to the dictionary. Backpatch the count byte and align the dictionary.
**
** stringlit: Fetch the count from the dictionary, then push the address
** and count on the stack. Finally, update ip to point to the first
** aligned address after the string text.
**************************************************************************/
static void stringLit(FICL_VM *pVM)
{
FICL_STRING *sp;
FICL_COUNT count;
char *cp;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 2);
#endif
sp = (FICL_STRING *)(pVM->ip);
count = sp->count;
cp = sp->text;
PUSHPTR(cp);
PUSHUNS(count);
cp += count + 1;
cp = alignPtr(cp);
pVM->ip = (IPTYPE)(void *)cp;
}
static void dotQuoteCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_WORD *pType = ficlLookup(pVM->pSys, "type");
assert(pType);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pStringLit));
dp->here = PTRtoCELL vmGetString(pVM, (FICL_STRING *)dp->here, '\"');
dictAlign(dp);
dictAppendCell(dp, LVALUEtoCELL(pType));
return;
}
static void dotParen(FICL_VM *pVM)
{
char *pSrc = vmGetInBuf(pVM);
char *pEnd = vmGetInBufEnd(pVM);
char *pDest = pVM->pad;
char ch;
/*
** Note: the standard does not want leading spaces skipped (apparently)
*/
for (ch = *pSrc; (pEnd != pSrc) && (ch != ')'); ch = *++pSrc)
*pDest++ = ch;
*pDest = '\0';
if ((pEnd != pSrc) && (ch == ')'))
pSrc++;
vmTextOut(pVM, pVM->pad, 0);
vmUpdateTib(pVM, pSrc);
return;
}
/**************************************************************************
s l i t e r a l
** STRING
** Interpretation: Interpretation semantics for this word are undefined.
** Compilation: ( c-addr1 u -- )
** Append the run-time semantics given below to the current definition.
** Run-time: ( -- c-addr2 u )
** Return c-addr2 u describing a string consisting of the characters
** specified by c-addr1 u during compilation. A program shall not alter
** the returned string.
**************************************************************************/
static void sLiteralCoIm(FICL_VM *pVM)
{
FICL_DICT *dp;
char *cp, *cpDest;
FICL_UNS u;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 0);
#endif
dp = vmGetDict(pVM);
u = POPUNS();
cp = POPPTR();
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pStringLit));
cpDest = (char *) dp->here;
*cpDest++ = (char) u;
for (; u > 0; --u)
{
*cpDest++ = *cp++;
}
*cpDest++ = 0;
dp->here = PTRtoCELL alignPtr(cpDest);
return;
}
/**************************************************************************
s t a t e
** Return the address of the VM's state member (must be sized the
** same as a CELL for this reason)
**************************************************************************/
static void state(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
PUSHPTR(&pVM->state);
return;
}
/**************************************************************************
c r e a t e . . . d o e s >
** Make a new word in the dictionary with the run-time effect of
** a variable (push my address), but with extra space allotted
** for use by does> .
**************************************************************************/
static void createParen(FICL_VM *pVM)
{
CELL *pCell;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
pCell = pVM->runningWord->param;
PUSHPTR(pCell+1);
return;
}
static void create(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
dictCheckThreshold(dp);
dictAppendWord2(dp, si, createParen, FW_DEFAULT);
dictAllotCells(dp, 1);
return;
}
static void doDoes(FICL_VM *pVM)
{
CELL *pCell;
IPTYPE tempIP;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 0, 1);
#endif
pCell = pVM->runningWord->param;
tempIP = (IPTYPE)((*pCell).p);
PUSHPTR(pCell+1);
vmPushIP(pVM, tempIP);
return;
}
static void doesParen(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
dp->smudge->code = doDoes;
dp->smudge->param[0] = LVALUEtoCELL(pVM->ip);
vmPopIP(pVM);
return;
}
static void doesCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
#if FICL_WANT_LOCALS
assert(pVM->pSys->pUnLinkParen);
if (pVM->pSys->nLocals > 0)
{
FICL_DICT *pLoc = ficlGetLoc(pVM->pSys);
dictEmpty(pLoc, pLoc->pForthWords->size);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pUnLinkParen));
}
pVM->pSys->nLocals = 0;
#endif
IGNORE(pVM);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pDoesParen));
return;
}
/**************************************************************************
t o b o d y
** to-body CORE ( xt -- a-addr )
** a-addr is the data-field address corresponding to xt. An ambiguous
** condition exists if xt is not for a word defined via CREATE.
**************************************************************************/
static void toBody(FICL_VM *pVM)
{
FICL_WORD *pFW;
/*#$-GUY CHANGE: Added robustness.-$#*/
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
pFW = POPPTR();
PUSHPTR(pFW->param + 1);
return;
}
/*
** from-body ficl ( a-addr -- xt )
** Reverse effect of >body
*/
static void fromBody(FICL_VM *pVM)
{
char *ptr;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 1);
#endif
ptr = (char *)POPPTR() - sizeof (FICL_WORD);
PUSHPTR(ptr);
return;
}
/*
** >name ficl ( xt -- c-addr u )
** Push the address and length of a word's name given its address
** xt.
*/
static void toName(FICL_VM *pVM)
{
FICL_WORD *pFW;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 2);
#endif
pFW = POPPTR();
PUSHPTR(pFW->name);
PUSHUNS(pFW->nName);
return;
}
static void getLastWord(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
FICL_WORD *wp = pDict->smudge;
assert(wp);
vmPush(pVM, LVALUEtoCELL(wp));
return;
}
/**************************************************************************
l b r a c k e t e t c
**
**************************************************************************/
static void lbracketCoIm(FICL_VM *pVM)
{
pVM->state = INTERPRET;
return;
}
static void rbracket(FICL_VM *pVM)
{
pVM->state = COMPILE;
return;
}
/**************************************************************************
p i c t u r e d n u m e r i c w o r d s
**
** less-number-sign CORE ( -- )
** Initialize the pictured numeric output conversion process.
** (clear the pad)
**************************************************************************/
static void lessNumberSign(FICL_VM *pVM)
{
FICL_STRING *sp = PTRtoSTRING pVM->pad;
sp->count = 0;
return;
}
/*
** number-sign CORE ( ud1 -- ud2 )
** Divide ud1 by the number in BASE giving the quotient ud2 and the remainder
** n. (n is the least-significant digit of ud1.) Convert n to external form
** and add the resulting character to the beginning of the pictured numeric
** output string. An ambiguous condition exists if # executes outside of a
** <# #> delimited number conversion.
*/
static void numberSign(FICL_VM *pVM)
{
FICL_STRING *sp;
DPUNS u;
UNS16 rem;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 2);
#endif
sp = PTRtoSTRING pVM->pad;
u = u64Pop(pVM->pStack);
rem = m64UMod(&u, (UNS16)(pVM->base));
sp->text[sp->count++] = digit_to_char(rem);
u64Push(pVM->pStack, u);
return;
}
/*
** number-sign-greater CORE ( xd -- c-addr u )
** Drop xd. Make the pictured numeric output string available as a character
** string. c-addr and u specify the resulting character string. A program
** may replace characters within the string.
*/
static void numberSignGreater(FICL_VM *pVM)
{
FICL_STRING *sp;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 2);
#endif
sp = PTRtoSTRING pVM->pad;
sp->text[sp->count] = 0;
strrev(sp->text);
DROP(2);
PUSHPTR(sp->text);
PUSHUNS(sp->count);
return;
}
/*
** number-sign-s CORE ( ud1 -- ud2 )
** Convert one digit of ud1 according to the rule for #. Continue conversion
** until the quotient is zero. ud2 is zero. An ambiguous condition exists if
** #S executes outside of a <# #> delimited number conversion.
** TO DO: presently does not use ud1 hi cell - use it!
*/
static void numberSignS(FICL_VM *pVM)
{
FICL_STRING *sp;
DPUNS u;
UNS16 rem;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 2, 2);
#endif
sp = PTRtoSTRING pVM->pad;
u = u64Pop(pVM->pStack);
do
{
rem = m64UMod(&u, (UNS16)(pVM->base));
sp->text[sp->count++] = digit_to_char(rem);
}
while (u.hi || u.lo);
u64Push(pVM->pStack, u);
return;
}
/*
** HOLD CORE ( char -- )
** Add char to the beginning of the pictured numeric output string. An ambiguous
** condition exists if HOLD executes outside of a <# #> delimited number conversion.
*/
static void hold(FICL_VM *pVM)
{
FICL_STRING *sp;
int i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
sp = PTRtoSTRING pVM->pad;
i = POPINT();
sp->text[sp->count++] = (char) i;
return;
}
/*
** SIGN CORE ( n -- )
** If n is negative, add a minus sign to the beginning of the pictured
** numeric output string. An ambiguous condition exists if SIGN
** executes outside of a <# #> delimited number conversion.
*/
static void sign(FICL_VM *pVM)
{
FICL_STRING *sp;
int i;
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
sp = PTRtoSTRING pVM->pad;
i = POPINT();
if (i < 0)
sp->text[sp->count++] = '-';
return;
}
/**************************************************************************
t o N u m b e r
** to-number CORE ( ud1 c-addr1 u1 -- ud2 c-addr2 u2 )
** ud2 is the unsigned result of converting the characters within the
** string specified by c-addr1 u1 into digits, using the number in BASE,
** and adding each into ud1 after multiplying ud1 by the number in BASE.
** Conversion continues left-to-right until a character that is not
** convertible, including any + or -, is encountered or the string is
** entirely converted. c-addr2 is the location of the first unconverted
** character or the first character past the end of the string if the string
** was entirely converted. u2 is the number of unconverted characters in the
** string. An ambiguous condition exists if ud2 overflows during the
** conversion.
**************************************************************************/
static void toNumber(FICL_VM *pVM)
{
FICL_UNS count;
char *cp;
DPUNS accum;
FICL_UNS base = pVM->base;
FICL_UNS ch;
FICL_UNS digit;
#if FICL_ROBUST > 1
vmCheckStack(pVM,4,4);
#endif
count = POPUNS();
cp = (char *)POPPTR();
accum = u64Pop(pVM->pStack);
for (ch = *cp; count > 0; ch = *++cp, count--)
{
if (ch < '0')
break;
digit = ch - '0';
if (digit > 9)
digit = tolower(ch) - 'a' + 10;
/*
** Note: following test also catches chars between 9 and a
** because 'digit' is unsigned!
*/
if (digit >= base)
break;
accum = m64Mac(accum, base, digit);
}
u64Push(pVM->pStack, accum);
PUSHPTR(cp);
PUSHUNS(count);
return;
}
/**************************************************************************
q u i t & a b o r t
** quit CORE ( -- ) ( R: i*x -- )
** Empty the return stack, store zero in SOURCE-ID if it is present, make
** the user input device the input source, and enter interpretation state.
** Do not display a message. Repeat the following:
**
** Accept a line from the input source into the input buffer, set >IN to
** zero, and interpret.
** Display the implementation-defined system prompt if in
** interpretation state, all processing has been completed, and no
** ambiguous condition exists.
**************************************************************************/
static void quit(FICL_VM *pVM)
{
vmThrow(pVM, VM_QUIT);
return;
}
static void ficlAbort(FICL_VM *pVM)
{
vmThrow(pVM, VM_ABORT);
return;
}
/**************************************************************************
a c c e p t
** accept CORE ( c-addr +n1 -- +n2 )
** Receive a string of at most +n1 characters. An ambiguous condition
** exists if +n1 is zero or greater than 32,767. Display graphic characters
** as they are received. A program that depends on the presence or absence
** of non-graphic characters in the string has an environmental dependency.
** The editing functions, if any, that the system performs in order to
** construct the string are implementation-defined.
**
** (Although the standard text doesn't say so, I assume that the intent
** of 'accept' is to store the string at the address specified on
** the stack.)
** Implementation: if there's more text in the TIB, use it. Otherwise
** throw out for more text. Copy characters up to the max count into the
** address given, and return the number of actual characters copied.
**
** Note (sobral) this may not be the behavior you'd expect if you're
** trying to get user input at load time!
**************************************************************************/
static void accept(FICL_VM *pVM)
{
FICL_UNS count, len;
char *cp;
char *pBuf, *pEnd;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
pBuf = vmGetInBuf(pVM);
pEnd = vmGetInBufEnd(pVM);
len = pEnd - pBuf;
if (len == 0)
vmThrow(pVM, VM_RESTART);
/*
** Now we have something in the text buffer - use it
*/
count = stackPopINT(pVM->pStack);
cp = stackPopPtr(pVM->pStack);
len = (count < len) ? count : len;
strncpy(cp, vmGetInBuf(pVM), len);
pBuf += len;
vmUpdateTib(pVM, pBuf);
PUSHINT(len);
return;
}
/**************************************************************************
a l i g n
** 6.1.0705 ALIGN CORE ( -- )
** If the data-space pointer is not aligned, reserve enough space to
** align it.
**************************************************************************/
static void align(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
IGNORE(pVM);
dictAlign(dp);
return;
}
/**************************************************************************
a l i g n e d
**
**************************************************************************/
static void aligned(FICL_VM *pVM)
{
void *addr;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,1);
#endif
addr = POPPTR();
PUSHPTR(alignPtr(addr));
return;
}
/**************************************************************************
b e g i n & f r i e n d s
** Indefinite loop control structures
** A.6.1.0760 BEGIN
** Typical use:
** : X ... BEGIN ... test UNTIL ;
** or
** : X ... BEGIN ... test WHILE ... REPEAT ;
**************************************************************************/
static void beginCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
markBranch(dp, pVM, destTag);
return;
}
static void untilCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pBranch0);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranch0));
resolveBackBranch(dp, pVM, destTag);
return;
}
static void whileCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pBranch0);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranch0));
markBranch(dp, pVM, origTag);
twoSwap(pVM);
dictAppendUNS(dp, 1);
return;
}
static void repeatCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pBranchParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranchParen));
/* expect "begin" branch marker */
resolveBackBranch(dp, pVM, destTag);
/* expect "while" branch marker */
resolveForwardBranch(dp, pVM, origTag);
return;
}
static void againCoIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
assert(pVM->pSys->pBranchParen);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pBranchParen));
/* expect "begin" branch marker */
resolveBackBranch(dp, pVM, destTag);
return;
}
/**************************************************************************
c h a r & f r i e n d s
** 6.1.0895 CHAR CORE ( "<spaces>name" -- char )
** Skip leading space delimiters. Parse name delimited by a space.
** Put the value of its first character onto the stack.
**
** bracket-char CORE
** Interpretation: Interpretation semantics for this word are undefined.
** Compilation: ( "<spaces>name" -- )
** Skip leading space delimiters. Parse name delimited by a space.
** Append the run-time semantics given below to the current definition.
** Run-time: ( -- char )
** Place char, the value of the first character of name, on the stack.
**************************************************************************/
static void ficlChar(FICL_VM *pVM)
{
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,0,1);
#endif
si = vmGetWord(pVM);
PUSHUNS((FICL_UNS)(si.cp[0]));
return;
}
static void charCoIm(FICL_VM *pVM)
{
ficlChar(pVM);
literalIm(pVM);
return;
}
/**************************************************************************
c h a r P l u s
** char-plus CORE ( c-addr1 -- c-addr2 )
** Add the size in address units of a character to c-addr1, giving c-addr2.
**************************************************************************/
static void charPlus(FICL_VM *pVM)
{
char *cp;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,1);
#endif
cp = POPPTR();
PUSHPTR(cp + 1);
return;
}
/**************************************************************************
c h a r s
** chars CORE ( n1 -- n2 )
** n2 is the size in address units of n1 characters.
** For most processors, this function can be a no-op. To guarantee
** portability, we'll multiply by sizeof (char).
**************************************************************************/
#if defined (_M_IX86)
#pragma warning(disable: 4127)
#endif
static void ficlChars(FICL_VM *pVM)
{
if (sizeof (char) > 1)
{
FICL_INT i;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,1);
#endif
i = POPINT();
PUSHINT(i * sizeof (char));
}
/* otherwise no-op! */
return;
}
#if defined (_M_IX86)
#pragma warning(default: 4127)
#endif
/**************************************************************************
c o u n t
** COUNT CORE ( c-addr1 -- c-addr2 u )
** Return the character string specification for the counted string stored
** at c-addr1. c-addr2 is the address of the first character after c-addr1.
** u is the contents of the character at c-addr1, which is the length in
** characters of the string at c-addr2.
**************************************************************************/
static void count(FICL_VM *pVM)
{
FICL_STRING *sp;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,2);
#endif
sp = POPPTR();
PUSHPTR(sp->text);
PUSHUNS(sp->count);
return;
}
/**************************************************************************
e n v i r o n m e n t ?
** environment-query CORE ( c-addr u -- false | i*x true )
** c-addr is the address of a character string and u is the string's
** character count. u may have a value in the range from zero to an
** implementation-defined maximum which shall not be less than 31. The
** character string should contain a keyword from 3.2.6 Environmental
** queries or the optional word sets to be checked for correspondence
** with an attribute of the present environment. If the system treats the
** attribute as unknown, the returned flag is false; otherwise, the flag
** is true and the i*x returned is of the type specified in the table for
** the attribute queried.
**************************************************************************/
static void environmentQ(FICL_VM *pVM)
{
FICL_DICT *envp;
FICL_WORD *pFW;
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
envp = pVM->pSys->envp;
si.count = (FICL_COUNT)stackPopUNS(pVM->pStack);
si.cp = stackPopPtr(pVM->pStack);
pFW = dictLookup(envp, si);
if (pFW != NULL)
{
vmExecute(pVM, pFW);
PUSHINT(FICL_TRUE);
}
else
{
PUSHINT(FICL_FALSE);
}
return;
}
/**************************************************************************
e v a l u a t e
** EVALUATE CORE ( i*x c-addr u -- j*x )
** Save the current input source specification. Store minus-one (-1) in
** SOURCE-ID if it is present. Make the string described by c-addr and u
** both the input source and input buffer, set >IN to zero, and interpret.
** When the parse area is empty, restore the prior input source
** specification. Other stack effects are due to the words EVALUATEd.
**
**************************************************************************/
static void evaluate(FICL_VM *pVM)
{
FICL_UNS count;
char *cp;
CELL id;
int result;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,0);
#endif
count = POPUNS();
cp = POPPTR();
IGNORE(count);
id = pVM->sourceID;
pVM->sourceID.i = -1;
result = ficlExecC(pVM, cp, count);
pVM->sourceID = id;
if (result != VM_OUTOFTEXT)
vmThrow(pVM, result);
return;
}
/**************************************************************************
s t r i n g q u o t e
** Interpreting: get string delimited by a quote from the input stream,
** copy to a scratch area, and put its count and address on the stack.
** Compiling: compile code to push the address and count of a string
** literal, compile the string from the input stream, and align the dict
** pointer.
**************************************************************************/
static void stringQuoteIm(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
if (pVM->state == INTERPRET)
{
FICL_STRING *sp = (FICL_STRING *) dp->here;
vmGetString(pVM, sp, '\"');
PUSHPTR(sp->text);
PUSHUNS(sp->count);
}
else /* COMPILE state */
{
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pStringLit));
dp->here = PTRtoCELL vmGetString(pVM, (FICL_STRING *)dp->here, '\"');
dictAlign(dp);
}
return;
}
/**************************************************************************
t y p e
** Pop count and char address from stack and print the designated string.
**************************************************************************/
static void type(FICL_VM *pVM)
{
FICL_UNS count = stackPopUNS(pVM->pStack);
char *cp = stackPopPtr(pVM->pStack);
char *pDest = (char *)ficlMalloc(count + 1);
/*
** Since we don't have an output primitive for a counted string
** (oops), make sure the string is null terminated. If not, copy
** and terminate it.
*/
if (!pDest)
vmThrowErr(pVM, "Error: out of memory");
strncpy(pDest, cp, count);
pDest[count] = '\0';
vmTextOut(pVM, pDest, 0);
ficlFree(pDest);
return;
}
/**************************************************************************
w o r d
** word CORE ( char "<chars>ccc<char>" -- c-addr )
** Skip leading delimiters. Parse characters ccc delimited by char. An
** ambiguous condition exists if the length of the parsed string is greater
** than the implementation-defined length of a counted string.
**
** c-addr is the address of a transient region containing the parsed word
** as a counted string. If the parse area was empty or contained no
** characters other than the delimiter, the resulting string has a zero
** length. A space, not included in the length, follows the string. A
** program may replace characters within the string.
** NOTE! Ficl also NULL-terminates the dest string.
**************************************************************************/
static void ficlWord(FICL_VM *pVM)
{
FICL_STRING *sp;
char delim;
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,1);
#endif
sp = (FICL_STRING *)pVM->pad;
delim = (char)POPINT();
si = vmParseStringEx(pVM, delim, 1);
if (SI_COUNT(si) > nPAD-1)
SI_SETLEN(si, nPAD-1);
sp->count = (FICL_COUNT)SI_COUNT(si);
strncpy(sp->text, SI_PTR(si), SI_COUNT(si));
/*#$-GUY CHANGE: I added this.-$#*/
sp->text[sp->count] = 0;
strcat(sp->text, " ");
PUSHPTR(sp);
return;
}
/**************************************************************************
p a r s e - w o r d
** ficl PARSE-WORD ( <spaces>name -- c-addr u )
** Skip leading spaces and parse name delimited by a space. c-addr is the
** address within the input buffer and u is the length of the selected
** string. If the parse area is empty, the resulting string has a zero length.
**************************************************************************/
static void parseNoCopy(FICL_VM *pVM)
{
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,0,2);
#endif
si = vmGetWord0(pVM);
PUSHPTR(SI_PTR(si));
PUSHUNS(SI_COUNT(si));
return;
}
/**************************************************************************
p a r s e
** CORE EXT ( char "ccc<char>" -- c-addr u )
** Parse ccc delimited by the delimiter char.
** c-addr is the address (within the input buffer) and u is the length of
** the parsed string. If the parse area was empty, the resulting string has
** a zero length.
** NOTE! PARSE differs from WORD: it does not skip leading delimiters.
**************************************************************************/
static void parse(FICL_VM *pVM)
{
STRINGINFO si;
char delim;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,2);
#endif
delim = (char)POPINT();
si = vmParseStringEx(pVM, delim, 0);
PUSHPTR(SI_PTR(si));
PUSHUNS(SI_COUNT(si));
return;
}
/**************************************************************************
f i l l
** CORE ( c-addr u char -- )
** If u is greater than zero, store char in each of u consecutive
** characters of memory beginning at c-addr.
**************************************************************************/
static void fill(FICL_VM *pVM)
{
char ch;
FICL_UNS u;
char *cp;
#if FICL_ROBUST > 1
vmCheckStack(pVM,3,0);
#endif
ch = (char)POPINT();
u = POPUNS();
cp = (char *)POPPTR();
while (u > 0)
{
*cp++ = ch;
u--;
}
return;
}
/**************************************************************************
f i n d
** FIND CORE ( c-addr -- c-addr 0 | xt 1 | xt -1 )
** Find the definition named in the counted string at c-addr. If the
** definition is not found, return c-addr and zero. If the definition is
** found, return its execution token xt. If the definition is immediate,
** also return one (1), otherwise also return minus-one (-1). For a given
** string, the values returned by FIND while compiling may differ from
** those returned while not compiling.
**************************************************************************/
static void do_find(FICL_VM *pVM, STRINGINFO si, void *returnForFailure)
{
FICL_WORD *pFW;
pFW = dictLookup(vmGetDict(pVM), si);
if (pFW)
{
PUSHPTR(pFW);
PUSHINT((wordIsImmediate(pFW) ? 1 : -1));
}
else
{
PUSHPTR(returnForFailure);
PUSHUNS(0);
}
return;
}
/**************************************************************************
f i n d
** FIND CORE ( c-addr -- c-addr 0 | xt 1 | xt -1 )
** Find the definition named in the counted string at c-addr. If the
** definition is not found, return c-addr and zero. If the definition is
** found, return its execution token xt. If the definition is immediate,
** also return one (1), otherwise also return minus-one (-1). For a given
** string, the values returned by FIND while compiling may differ from
** those returned while not compiling.
**************************************************************************/
static void cFind(FICL_VM *pVM)
{
FICL_STRING *sp;
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,2);
#endif
sp = POPPTR();
SI_PFS(si, sp);
do_find(pVM, si, sp);
}
/**************************************************************************
s f i n d
** FICL ( c-addr u -- 0 0 | xt 1 | xt -1 )
** Like FIND, but takes "c-addr u" for the string.
**************************************************************************/
static void sFind(FICL_VM *pVM)
{
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,2);
#endif
si.count = stackPopINT(pVM->pStack);
si.cp = stackPopPtr(pVM->pStack);
do_find(pVM, si, NULL);
}
/**************************************************************************
f m S l a s h M o d
** f-m-slash-mod CORE ( d1 n1 -- n2 n3 )
** Divide d1 by n1, giving the floored quotient n3 and the remainder n2.
** Input and output stack arguments are signed. An ambiguous condition
** exists if n1 is zero or if the quotient lies outside the range of a
** single-cell signed integer.
**************************************************************************/
static void fmSlashMod(FICL_VM *pVM)
{
DPINT d1;
FICL_INT n1;
INTQR qr;
#if FICL_ROBUST > 1
vmCheckStack(pVM,3,2);
#endif
n1 = POPINT();
d1 = i64Pop(pVM->pStack);
qr = m64FlooredDivI(d1, n1);
PUSHINT(qr.rem);
PUSHINT(qr.quot);
return;
}
/**************************************************************************
s m S l a s h R e m
** s-m-slash-rem CORE ( d1 n1 -- n2 n3 )
** Divide d1 by n1, giving the symmetric quotient n3 and the remainder n2.
** Input and output stack arguments are signed. An ambiguous condition
** exists if n1 is zero or if the quotient lies outside the range of a
** single-cell signed integer.
**************************************************************************/
static void smSlashRem(FICL_VM *pVM)
{
DPINT d1;
FICL_INT n1;
INTQR qr;
#if FICL_ROBUST > 1
vmCheckStack(pVM,3,2);
#endif
n1 = POPINT();
d1 = i64Pop(pVM->pStack);
qr = m64SymmetricDivI(d1, n1);
PUSHINT(qr.rem);
PUSHINT(qr.quot);
return;
}
static void ficlMod(FICL_VM *pVM)
{
DPINT d1;
FICL_INT n1;
INTQR qr;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
n1 = POPINT();
d1.lo = POPINT();
i64Extend(d1);
qr = m64SymmetricDivI(d1, n1);
PUSHINT(qr.rem);
return;
}
/**************************************************************************
u m S l a s h M o d
** u-m-slash-mod CORE ( ud u1 -- u2 u3 )
** Divide ud by u1, giving the quotient u3 and the remainder u2.
** All values and arithmetic are unsigned. An ambiguous condition
** exists if u1 is zero or if the quotient lies outside the range of a
** single-cell unsigned integer.
*************************************************************************/
static void umSlashMod(FICL_VM *pVM)
{
DPUNS ud;
FICL_UNS u1;
UNSQR qr;
u1 = stackPopUNS(pVM->pStack);
ud = u64Pop(pVM->pStack);
qr = ficlLongDiv(ud, u1);
PUSHUNS(qr.rem);
PUSHUNS(qr.quot);
return;
}
/**************************************************************************
l s h i f t
** l-shift CORE ( x1 u -- x2 )
** Perform a logical left shift of u bit-places on x1, giving x2.
** Put zeroes into the least significant bits vacated by the shift.
** An ambiguous condition exists if u is greater than or equal to the
** number of bits in a cell.
**
** r-shift CORE ( x1 u -- x2 )
** Perform a logical right shift of u bit-places on x1, giving x2.
** Put zeroes into the most significant bits vacated by the shift. An
** ambiguous condition exists if u is greater than or equal to the
** number of bits in a cell.
**************************************************************************/
static void lshift(FICL_VM *pVM)
{
FICL_UNS nBits;
FICL_UNS x1;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
nBits = POPUNS();
x1 = POPUNS();
PUSHUNS(x1 << nBits);
return;
}
static void rshift(FICL_VM *pVM)
{
FICL_UNS nBits;
FICL_UNS x1;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
nBits = POPUNS();
x1 = POPUNS();
PUSHUNS(x1 >> nBits);
return;
}
/**************************************************************************
m S t a r
** m-star CORE ( n1 n2 -- d )
** d is the signed product of n1 times n2.
**************************************************************************/
static void mStar(FICL_VM *pVM)
{
FICL_INT n2;
FICL_INT n1;
DPINT d;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,2);
#endif
n2 = POPINT();
n1 = POPINT();
d = m64MulI(n1, n2);
i64Push(pVM->pStack, d);
return;
}
static void umStar(FICL_VM *pVM)
{
FICL_UNS u2;
FICL_UNS u1;
DPUNS ud;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,2);
#endif
u2 = POPUNS();
u1 = POPUNS();
ud = ficlLongMul(u1, u2);
u64Push(pVM->pStack, ud);
return;
}
/**************************************************************************
m a x & m i n
**
**************************************************************************/
static void ficlMax(FICL_VM *pVM)
{
FICL_INT n2;
FICL_INT n1;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
n2 = POPINT();
n1 = POPINT();
PUSHINT((n1 > n2) ? n1 : n2);
return;
}
static void ficlMin(FICL_VM *pVM)
{
FICL_INT n2;
FICL_INT n1;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,1);
#endif
n2 = POPINT();
n1 = POPINT();
PUSHINT((n1 < n2) ? n1 : n2);
return;
}
/**************************************************************************
m o v e
** CORE ( addr1 addr2 u -- )
** If u is greater than zero, copy the contents of u consecutive address
** units at addr1 to the u consecutive address units at addr2. After MOVE
** completes, the u consecutive address units at addr2 contain exactly
** what the u consecutive address units at addr1 contained before the move.
** NOTE! This implementation assumes that a char is the same size as
** an address unit.
**************************************************************************/
static void move(FICL_VM *pVM)
{
FICL_UNS u;
char *addr2;
char *addr1;
#if FICL_ROBUST > 1
vmCheckStack(pVM,3,0);
#endif
u = POPUNS();
addr2 = POPPTR();
addr1 = POPPTR();
if (u == 0)
return;
/*
** Do the copy carefully, so as to be
** correct even if the two ranges overlap
*/
if (addr1 >= addr2)
{
for (; u > 0; u--)
*addr2++ = *addr1++;
}
else
{
addr2 += u-1;
addr1 += u-1;
for (; u > 0; u--)
*addr2-- = *addr1--;
}
return;
}
/**************************************************************************
r e c u r s e
**
**************************************************************************/
static void recurseCoIm(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
IGNORE(pVM);
dictAppendCell(pDict, LVALUEtoCELL(pDict->smudge));
return;
}
/**************************************************************************
s t o d
** s-to-d CORE ( n -- d )
** Convert the number n to the double-cell number d with the same
** numerical value.
**************************************************************************/
static void sToD(FICL_VM *pVM)
{
FICL_INT s;
#if FICL_ROBUST > 1
vmCheckStack(pVM,1,2);
#endif
s = POPINT();
/* sign extend to 64 bits.. */
PUSHINT(s);
PUSHINT((s < 0) ? -1 : 0);
return;
}
/**************************************************************************
s o u r c e
** CORE ( -- c-addr u )
** c-addr is the address of, and u is the number of characters in, the
** input buffer.
**************************************************************************/
static void source(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM,0,2);
#endif
PUSHPTR(pVM->tib.cp);
PUSHINT(vmGetInBufLen(pVM));
return;
}
/**************************************************************************
v e r s i o n
** non-standard...
**************************************************************************/
static void ficlVersion(FICL_VM *pVM)
{
vmTextOut(pVM, "ficl Version " FICL_VER, 1);
return;
}
/**************************************************************************
t o I n
** to-in CORE
**************************************************************************/
static void toIn(FICL_VM *pVM)
{
#if FICL_ROBUST > 1
vmCheckStack(pVM,0,1);
#endif
PUSHPTR(&pVM->tib.index);
return;
}
/**************************************************************************
c o l o n N o N a m e
** CORE EXT ( C: -- colon-sys ) ( S: -- xt )
** Create an unnamed colon definition and push its address.
** Change state to compile.
**************************************************************************/
static void colonNoName(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
FICL_WORD *pFW;
STRINGINFO si;
SI_SETLEN(si, 0);
SI_SETPTR(si, NULL);
pVM->state = COMPILE;
pFW = dictAppendWord2(dp, si, colonParen, FW_DEFAULT | FW_SMUDGE);
PUSHPTR(pFW);
markControlTag(pVM, colonTag);
return;
}
/**************************************************************************
u s e r V a r i a b l e
** user ( u -- ) "<spaces>name"
** Get a name from the input stream and create a user variable
** with the name and the index supplied. The run-time effect
** of a user variable is to push the address of the indexed cell
** in the running vm's user array.
**
** User variables are vm local cells. Each vm has an array of
** FICL_USER_CELLS of them when FICL_WANT_USER is nonzero.
** Ficl's user facility is implemented with two primitives,
** "user" and "(user)", a variable ("nUser") (in softcore.c) that
** holds the index of the next free user cell, and a redefinition
** (also in softcore) of "user" that defines a user word and increments
** nUser.
**************************************************************************/
#if FICL_WANT_USER
static void userParen(FICL_VM *pVM)
{
FICL_INT i = pVM->runningWord->param[0].i;
PUSHPTR(&pVM->user[i]);
return;
}
static void userVariable(FICL_VM *pVM)
{
FICL_DICT *dp = vmGetDict(pVM);
STRINGINFO si = vmGetWord(pVM);
CELL c;
c = stackPop(pVM->pStack);
if (c.i >= FICL_USER_CELLS)
{
vmThrowErr(pVM, "Error - out of user space");
}
dictAppendWord2(dp, si, userParen, FW_DEFAULT);
dictAppendCell(dp, c);
return;
}
#endif
/**************************************************************************
t o V a l u e
** CORE EXT
** Interpretation: ( x "<spaces>name" -- )
** Skip leading spaces and parse name delimited by a space. Store x in
** name. An ambiguous condition exists if name was not defined by VALUE.
** NOTE: In ficl, VALUE is an alias of CONSTANT
**************************************************************************/
static void toValue(FICL_VM *pVM)
{
STRINGINFO si = vmGetWord(pVM);
FICL_DICT *dp = vmGetDict(pVM);
FICL_WORD *pFW;
#if FICL_WANT_LOCALS
if ((pVM->pSys->nLocals > 0) && (pVM->state == COMPILE))
{
FICL_DICT *pLoc = ficlGetLoc(pVM->pSys);
pFW = dictLookup(pLoc, si);
if (pFW && (pFW->code == doLocalIm))
{
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pToLocalParen));
dictAppendCell(dp, LVALUEtoCELL(pFW->param[0]));
return;
}
else if (pFW && pFW->code == do2LocalIm)
{
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pTo2LocalParen));
dictAppendCell(dp, LVALUEtoCELL(pFW->param[0]));
return;
}
}
#endif
assert(pVM->pSys->pStore);
pFW = dictLookup(dp, si);
if (!pFW)
{
int i = SI_COUNT(si);
vmThrowErr(pVM, "%.*s not found", i, SI_PTR(si));
}
if (pVM->state == INTERPRET)
pFW->param[0] = stackPop(pVM->pStack);
else /* compile code to store to word's param */
{
PUSHPTR(&pFW->param[0]);
literalIm(pVM);
dictAppendCell(dp, LVALUEtoCELL(pVM->pSys->pStore));
}
return;
}
#if FICL_WANT_LOCALS
/**************************************************************************
l i n k P a r e n
** ( -- )
** Link a frame on the return stack, reserving nCells of space for
** locals - the value of nCells is the next cell in the instruction
** stream.
**************************************************************************/
static void linkParen(FICL_VM *pVM)
{
FICL_INT nLink = *(FICL_INT *)(pVM->ip);
vmBranchRelative(pVM, 1);
stackLink(pVM->rStack, nLink);
return;
}
static void unlinkParen(FICL_VM *pVM)
{
stackUnlink(pVM->rStack);
return;
}
/**************************************************************************
d o L o c a l I m
** Immediate - cfa of a local while compiling - when executed, compiles
** code to fetch the value of a local given the local's index in the
** word's pfa
**************************************************************************/
static void getLocalParen(FICL_VM *pVM)
{
FICL_INT nLocal = *(FICL_INT *)(pVM->ip++);
stackPush(pVM->pStack, pVM->rStack->pFrame[nLocal]);
return;
}
static void toLocalParen(FICL_VM *pVM)
{
FICL_INT nLocal = *(FICL_INT *)(pVM->ip++);
pVM->rStack->pFrame[nLocal] = stackPop(pVM->pStack);
return;
}
static void getLocal0(FICL_VM *pVM)
{
stackPush(pVM->pStack, pVM->rStack->pFrame[0]);
return;
}
static void toLocal0(FICL_VM *pVM)
{
pVM->rStack->pFrame[0] = stackPop(pVM->pStack);
return;
}
static void getLocal1(FICL_VM *pVM)
{
stackPush(pVM->pStack, pVM->rStack->pFrame[1]);
return;
}
static void toLocal1(FICL_VM *pVM)
{
pVM->rStack->pFrame[1] = stackPop(pVM->pStack);
return;
}
/*
** Each local is recorded in a private locals dictionary as a
** word that does doLocalIm at runtime. DoLocalIm compiles code
** into the client definition to fetch the value of the
** corresponding local variable from the return stack.
** The private dictionary gets initialized at the end of each block
** that uses locals (in ; and does> for example).
*/
static void doLocalIm(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
FICL_INT nLocal = pVM->runningWord->param[0].i;
if (pVM->state == INTERPRET)
{
stackPush(pVM->pStack, pVM->rStack->pFrame[nLocal]);
}
else
{
if (nLocal == 0)
{
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pGetLocal0));
}
else if (nLocal == 1)
{
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pGetLocal1));
}
else
{
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pGetLocalParen));
dictAppendCell(pDict, LVALUEtoCELL(nLocal));
}
}
return;
}
/**************************************************************************
l o c a l P a r e n
** paren-local-paren LOCAL
** Interpretation: Interpretation semantics for this word are undefined.
** Execution: ( c-addr u -- )
** When executed during compilation, (LOCAL) passes a message to the
** system that has one of two meanings. If u is non-zero,
** the message identifies a new local whose definition name is given by
** the string of characters identified by c-addr u. If u is zero,
** the message is last local and c-addr has no significance.
**
** The result of executing (LOCAL) during compilation of a definition is
** to create a set of named local identifiers, each of which is
** a definition name, that only have execution semantics within the scope
** of that definition's source.
**
** local Execution: ( -- x )
**
** Push the local's value, x, onto the stack. The local's value is
** initialized as described in 13.3.3 Processing locals and may be
** changed by preceding the local's name with TO. An ambiguous condition
** exists when local is executed while in interpretation state.
**************************************************************************/
static void localParen(FICL_VM *pVM)
{
FICL_DICT *pDict;
STRINGINFO si;
#if FICL_ROBUST > 1
vmCheckStack(pVM,2,0);
#endif
pDict = vmGetDict(pVM);
SI_SETLEN(si, POPUNS());
SI_SETPTR(si, (char *)POPPTR());
if (SI_COUNT(si) > 0)
{ /* add a local to the **locals** dict and update nLocals */
FICL_DICT *pLoc = ficlGetLoc(pVM->pSys);
if (pVM->pSys->nLocals >= FICL_MAX_LOCALS)
{
vmThrowErr(pVM, "Error: out of local space");
}
dictAppendWord2(pLoc, si, doLocalIm, FW_COMPIMMED);
dictAppendCell(pLoc, LVALUEtoCELL(pVM->pSys->nLocals));
if (pVM->pSys->nLocals == 0)
{ /* compile code to create a local stack frame */
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pLinkParen));
/* save location in dictionary for #locals */
pVM->pSys->pMarkLocals = pDict->here;
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->nLocals));
/* compile code to initialize first local */
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pToLocal0));
}
else if (pVM->pSys->nLocals == 1)
{
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pToLocal1));
}
else
{
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pToLocalParen));
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->nLocals));
}
(pVM->pSys->nLocals)++;
}
else if (pVM->pSys->nLocals > 0)
{ /* write nLocals to (link) param area in dictionary */
*(FICL_INT *)(pVM->pSys->pMarkLocals) = pVM->pSys->nLocals;
}
return;
}
static void get2LocalParen(FICL_VM *pVM)
{
FICL_INT nLocal = *(FICL_INT *)(pVM->ip++);
stackPush(pVM->pStack, pVM->rStack->pFrame[nLocal]);
stackPush(pVM->pStack, pVM->rStack->pFrame[nLocal+1]);
return;
}
static void do2LocalIm(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
FICL_INT nLocal = pVM->runningWord->param[0].i;
if (pVM->state == INTERPRET)
{
stackPush(pVM->pStack, pVM->rStack->pFrame[nLocal]);
stackPush(pVM->pStack, pVM->rStack->pFrame[nLocal+1]);
}
else
{
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pGet2LocalParen));
dictAppendCell(pDict, LVALUEtoCELL(nLocal));
}
return;
}
static void to2LocalParen(FICL_VM *pVM)
{
FICL_INT nLocal = *(FICL_INT *)(pVM->ip++);
pVM->rStack->pFrame[nLocal+1] = stackPop(pVM->pStack);
pVM->rStack->pFrame[nLocal] = stackPop(pVM->pStack);
return;
}
static void twoLocalParen(FICL_VM *pVM)
{
FICL_DICT *pDict = vmGetDict(pVM);
STRINGINFO si;
SI_SETLEN(si, stackPopUNS(pVM->pStack));
SI_SETPTR(si, (char *)stackPopPtr(pVM->pStack));
if (SI_COUNT(si) > 0)
{ /* add a local to the **locals** dict and update nLocals */
FICL_DICT *pLoc = ficlGetLoc(pVM->pSys);
if (pVM->pSys->nLocals >= FICL_MAX_LOCALS)
{
vmThrowErr(pVM, "Error: out of local space");
}
dictAppendWord2(pLoc, si, do2LocalIm, FW_COMPIMMED);
dictAppendCell(pLoc, LVALUEtoCELL(pVM->pSys->nLocals));
if (pVM->pSys->nLocals == 0)
{ /* compile code to create a local stack frame */
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pLinkParen));
/* save location in dictionary for #locals */
pVM->pSys->pMarkLocals = pDict->here;
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->nLocals));
}
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->pTo2LocalParen));
dictAppendCell(pDict, LVALUEtoCELL(pVM->pSys->nLocals));
pVM->pSys->nLocals += 2;
}
else if (pVM->pSys->nLocals > 0)
{ /* write nLocals to (link) param area in dictionary */
*(FICL_INT *)(pVM->pSys->pMarkLocals) = pVM->pSys->nLocals;
}
return;
}
#endif
/**************************************************************************
c o m p a r e
** STRING ( c-addr1 u1 c-addr2 u2 -- n )
** Compare the string specified by c-addr1 u1 to the string specified by
** c-addr2 u2. The strings are compared, beginning at the given addresses,
** character by character, up to the length of the shorter string or until a
** difference is found. If the two strings are identical, n is zero. If the two
** strings are identical up to the length of the shorter string, n is minus-one
** (-1) if u1 is less than u2 and one (1) otherwise. If the two strings are not
** identical up to the length of the shorter string, n is minus-one (-1) if the
** first non-matching character in the string specified by c-addr1 u1 has a
** lesser numeric value than the corresponding character in the string specified
** by c-addr2 u2 and one (1) otherwise.
**************************************************************************/
static void compareInternal(FICL_VM *pVM, int caseInsensitive)
{
char *cp1, *cp2;
FICL_UNS u1, u2, uMin;
int n = 0;
vmCheckStack(pVM, 4, 1);
u2 = stackPopUNS(pVM->pStack);
cp2 = (char *)stackPopPtr(pVM->pStack);
u1 = stackPopUNS(pVM->pStack);
cp1 = (char *)stackPopPtr(pVM->pStack);
uMin = (u1 < u2)? u1 : u2;
for ( ; (uMin > 0) && (n == 0); uMin--)
{
char c1 = *cp1++;
char c2 = *cp2++;
if (caseInsensitive)
{
c1 = (char)tolower(c1);
c2 = (char)tolower(c2);
}
n = (int)(c1 - c2);
}
if (n == 0)
n = (int)(u1 - u2);
if (n < 0)
n = -1;
else if (n > 0)
n = 1;
PUSHINT(n);
return;
}
static void compareString(FICL_VM *pVM)
{
compareInternal(pVM, FALSE);
}
static void compareStringInsensitive(FICL_VM *pVM)
{
compareInternal(pVM, TRUE);
}
/**************************************************************************
p a d
** CORE EXT ( -- c-addr )
** c-addr is the address of a transient region that can be used to hold
** data for intermediate processing.
**************************************************************************/
static void pad(FICL_VM *pVM)
{
stackPushPtr(pVM->pStack, pVM->pad);
}
/**************************************************************************
s o u r c e - i d
** CORE EXT, FILE ( -- 0 | -1 | fileid )
** Identifies the input source as follows:
**
** SOURCE-ID Input source
** --------- ------------
** fileid Text file fileid
** -1 String (via EVALUATE)
** 0 User input device
**************************************************************************/
static void sourceid(FICL_VM *pVM)
{
PUSHINT(pVM->sourceID.i);
return;
}
/**************************************************************************
r e f i l l
** CORE EXT ( -- flag )
** Attempt to fill the input buffer from the input source, returning a true
** flag if successful.
** When the input source is the user input device, attempt to receive input
** into the terminal input buffer. If successful, make the result the input
** buffer, set >IN to zero, and return true. Receipt of a line containing no
** characters is considered successful. If there is no input available from
** the current input source, return false.
** When the input source is a string from EVALUATE, return false and
** perform no other action.
**************************************************************************/
static void refill(FICL_VM *pVM)
{
FICL_INT ret = (pVM->sourceID.i == -1) ? FICL_FALSE : FICL_TRUE;
if (ret && (pVM->fRestart == 0))
vmThrow(pVM, VM_RESTART);
PUSHINT(ret);
return;
}
/**************************************************************************
freebsd exception handling words
** Catch, from ANS Forth standard. Installs a safety net, then EXECUTE
** the word in ToS. If an exception happens, restore the state to what
** it was before, and pushes the exception value on the stack. If not,
** push zero.
**
** Notice that Catch implements an inner interpreter. This is ugly,
** but given how ficl works, it cannot be helped. The problem is that
** colon definitions will be executed *after* the function returns,
** while "code" definitions will be executed immediately. I considered
** other solutions to this problem, but all of them shared the same
** basic problem (with added disadvantages): if ficl ever changes it's
** inner thread modus operandi, one would have to fix this word.
**
** More comments can be found throughout catch's code.
**
** Daniel C. Sobral Jan 09/1999
** sadler may 2000 -- revised to follow ficl.c:ficlExecXT.
**************************************************************************/
static void ficlCatch(FICL_VM *pVM)
{
int except;
jmp_buf vmState;
FICL_VM VM;
FICL_STACK pStack;
FICL_STACK rStack;
FICL_WORD *pFW;
assert(pVM);
assert(pVM->pSys->pExitInner);
/*
** Get xt.
** We need this *before* we save the stack pointer, or
** we'll have to pop one element out of the stack after
** an exception. I prefer to get done with it up front. :-)
*/
#if FICL_ROBUST > 1
vmCheckStack(pVM, 1, 0);
#endif
pFW = stackPopPtr(pVM->pStack);
/*
** Save vm's state -- a catch will not back out environmental
** changes.
**
** We are *not* saving dictionary state, since it is
** global instead of per vm, and we are not saving
** stack contents, since we are not required to (and,
** thus, it would be useless). We save pVM, and pVM
** "stacks" (a structure containing general information
** about it, including the current stack pointer).
*/
memcpy((void*)&VM, (void*)pVM, sizeof(FICL_VM));
memcpy((void*)&pStack, (void*)pVM->pStack, sizeof(FICL_STACK));
memcpy((void*)&rStack, (void*)pVM->rStack, sizeof(FICL_STACK));
/*
** Give pVM a jmp_buf
*/
pVM->pState = &vmState;
/*
** Safety net
*/
except = setjmp(vmState);
switch (except)
{
/*
** Setup condition - push poison pill so that the VM throws
** VM_INNEREXIT if the XT terminates normally, then execute
** the XT
*/
case 0:
vmPushIP(pVM, &(pVM->pSys->pExitInner)); /* Open mouth, insert emetic */
vmExecute(pVM, pFW);
vmInnerLoop(pVM);
break;
/*
** Normal exit from XT - lose the poison pill,
** restore old setjmp vector and push a zero.
*/
case VM_INNEREXIT:
vmPopIP(pVM); /* Gack - hurl poison pill */
pVM->pState = VM.pState; /* Restore just the setjmp vector */
PUSHINT(0); /* Push 0 -- everything is ok */
break;
/*
** Some other exception got thrown - restore pre-existing VM state
** and push the exception code
*/
default:
/* Restore vm's state */
memcpy((void*)pVM, (void*)&VM, sizeof(FICL_VM));
memcpy((void*)pVM->pStack, (void*)&pStack, sizeof(FICL_STACK));
memcpy((void*)pVM->rStack, (void*)&rStack, sizeof(FICL_STACK));
PUSHINT(except);/* Push error */
break;
}
}
/**************************************************************************
** t h r o w
** EXCEPTION
** Throw -- From ANS Forth standard.
**
** Throw takes the ToS and, if that's different from zero,
** returns to the last executed catch context. Further throws will
** unstack previously executed "catches", in LIFO mode.
**
** Daniel C. Sobral Jan 09/1999
**************************************************************************/
static void ficlThrow(FICL_VM *pVM)
{
int except;
except = stackPopINT(pVM->pStack);
if (except)
vmThrow(pVM, except);
}
/**************************************************************************
** a l l o c a t e
** MEMORY
**************************************************************************/
static void ansAllocate(FICL_VM *pVM)
{
size_t size;
void *p;
size = stackPopINT(pVM->pStack);
p = ficlMalloc(size);
PUSHPTR(p);
if (p)
PUSHINT(0);
else
PUSHINT(1);
}
/**************************************************************************
** f r e e
** MEMORY
**************************************************************************/
static void ansFree(FICL_VM *pVM)
{
void *p;
p = stackPopPtr(pVM->pStack);
ficlFree(p);
PUSHINT(0);
}
/**************************************************************************
** r e s i z e
** MEMORY
**************************************************************************/
static void ansResize(FICL_VM *pVM)
{
size_t size;
void *new, *old;
size = stackPopINT(pVM->pStack);
old = stackPopPtr(pVM->pStack);
new = ficlRealloc(old, size);
if (new)
{
PUSHPTR(new);
PUSHINT(0);
}
else
{
PUSHPTR(old);
PUSHINT(1);
}
}
/**************************************************************************
** e x i t - i n n e r
** Signals execXT that an inner loop has completed
**************************************************************************/
static void ficlExitInner(FICL_VM *pVM)
{
vmThrow(pVM, VM_INNEREXIT);
}
/**************************************************************************
d n e g a t e
** DOUBLE ( d1 -- d2 )
** d2 is the negation of d1.
**************************************************************************/
static void dnegate(FICL_VM *pVM)
{
DPINT i = i64Pop(pVM->pStack);
i = m64Negate(i);
i64Push(pVM->pStack, i);
return;
}
#if 0
/**************************************************************************
**
**************************************************************************/
static void funcname(FICL_VM *pVM)
{
IGNORE(pVM);
return;
}
#endif
/**************************************************************************
f i c l W o r d C l a s s i f y
** This public function helps to classify word types for SEE
** and the deugger in tools.c. Given a pointer to a word, it returns
** a member of WOR
**************************************************************************/
WORDKIND ficlWordClassify(FICL_WORD *pFW)
{
typedef struct
{
WORDKIND kind;
FICL_CODE code;
} CODEtoKIND;
static CODEtoKIND codeMap[] =
{
{BRANCH, branchParen},
{COLON, colonParen},
{CONSTANT, constantParen},
{CREATE, createParen},
{DO, doParen},
{DOES, doDoes},
{IF, branch0},
{LITERAL, literalParen},
{LOOP, loopParen},
{OF, ofParen},
{PLOOP, plusLoopParen},
{QDO, qDoParen},
{CSTRINGLIT, cstringLit},
{STRINGLIT, stringLit},
#if FICL_WANT_USER
{USER, userParen},
#endif
{VARIABLE, variableParen},
};
#define nMAP (sizeof(codeMap) / sizeof(CODEtoKIND))
FICL_CODE code = pFW->code;
int i;
for (i=0; i < nMAP; i++)
{
if (codeMap[i].code == code)
return codeMap[i].kind;
}
return PRIMITIVE;
}
#ifdef TESTMAIN
/**************************************************************************
** r a n d o m
** FICL-specific
**************************************************************************/
static void ficlRandom(FICL_VM *pVM)
{
PUSHUNS(random());
}
/**************************************************************************
** s e e d - r a n d o m
** FICL-specific
**************************************************************************/
static void ficlSeedRandom(FICL_VM *pVM)
{
srandom(POPUNS());
}
#endif
/**************************************************************************
f i c l C o m p i l e C o r e
** Builds the primitive wordset and the environment-query namespace.
**************************************************************************/
void ficlCompileCore(FICL_SYSTEM *pSys)
{
FICL_DICT *dp = pSys->dp;
assert (dp);
/*
** CORE word set
** see softcore.c for definitions of: abs bl space spaces abort"
*/
pSys->pStore =
dictAppendWord(dp, "!", store, FW_DEFAULT);
dictAppendWord(dp, "#", numberSign, FW_DEFAULT);
dictAppendWord(dp, "#>", numberSignGreater,FW_DEFAULT);
dictAppendWord(dp, "#s", numberSignS, FW_DEFAULT);
dictAppendWord(dp, "\'", ficlTick, FW_DEFAULT);
dictAppendWord(dp, "(", commentHang, FW_IMMEDIATE);
dictAppendWord(dp, "*", mul, FW_DEFAULT);
dictAppendWord(dp, "*/", mulDiv, FW_DEFAULT);
dictAppendWord(dp, "*/mod", mulDivRem, FW_DEFAULT);
dictAppendWord(dp, "+", add, FW_DEFAULT);
dictAppendWord(dp, "+!", plusStore, FW_DEFAULT);
dictAppendWord(dp, "+loop", plusLoopCoIm, FW_COMPIMMED);
dictAppendWord(dp, ",", comma, FW_DEFAULT);
dictAppendWord(dp, "-", sub, FW_DEFAULT);
dictAppendWord(dp, ".", displayCell, FW_DEFAULT);
dictAppendWord(dp, ".\"", dotQuoteCoIm, FW_COMPIMMED);
dictAppendWord(dp, "/", ficlDiv, FW_DEFAULT);
dictAppendWord(dp, "/mod", slashMod, FW_DEFAULT);
dictAppendWord(dp, "0<", zeroLess, FW_DEFAULT);
dictAppendWord(dp, "0=", zeroEquals, FW_DEFAULT);
dictAppendWord(dp, "1+", onePlus, FW_DEFAULT);
dictAppendWord(dp, "1-", oneMinus, FW_DEFAULT);
dictAppendWord(dp, "2!", twoStore, FW_DEFAULT);
dictAppendWord(dp, "2*", twoMul, FW_DEFAULT);
dictAppendWord(dp, "2/", twoDiv, FW_DEFAULT);
dictAppendWord(dp, "2@", twoFetch, FW_DEFAULT);
dictAppendWord(dp, "2drop", twoDrop, FW_DEFAULT);
dictAppendWord(dp, "2dup", twoDup, FW_DEFAULT);
dictAppendWord(dp, "2over", twoOver, FW_DEFAULT);
dictAppendWord(dp, "2swap", twoSwap, FW_DEFAULT);
dictAppendWord(dp, ":", colon, FW_DEFAULT);
dictAppendWord(dp, ";", semicolonCoIm, FW_COMPIMMED);
dictAppendWord(dp, "<", isLess, FW_DEFAULT);
dictAppendWord(dp, "<#", lessNumberSign, FW_DEFAULT);
dictAppendWord(dp, "=", isEqual, FW_DEFAULT);
dictAppendWord(dp, ">", isGreater, FW_DEFAULT);
dictAppendWord(dp, ">body", toBody, FW_DEFAULT);
dictAppendWord(dp, ">in", toIn, FW_DEFAULT);
dictAppendWord(dp, ">number", toNumber, FW_DEFAULT);
dictAppendWord(dp, ">r", toRStack, FW_COMPILE);
dictAppendWord(dp, "?dup", questionDup, FW_DEFAULT);
dictAppendWord(dp, "@", fetch, FW_DEFAULT);
dictAppendWord(dp, "abort", ficlAbort, FW_DEFAULT);
dictAppendWord(dp, "accept", accept, FW_DEFAULT);
dictAppendWord(dp, "align", align, FW_DEFAULT);
dictAppendWord(dp, "aligned", aligned, FW_DEFAULT);
dictAppendWord(dp, "allot", allot, FW_DEFAULT);
dictAppendWord(dp, "and", bitwiseAnd, FW_DEFAULT);
dictAppendWord(dp, "base", base, FW_DEFAULT);
dictAppendWord(dp, "begin", beginCoIm, FW_COMPIMMED);
dictAppendWord(dp, "c!", cStore, FW_DEFAULT);
dictAppendWord(dp, "c,", cComma, FW_DEFAULT);
dictAppendWord(dp, "c@", cFetch, FW_DEFAULT);
dictAppendWord(dp, "case", caseCoIm, FW_COMPIMMED);
dictAppendWord(dp, "cell+", cellPlus, FW_DEFAULT);
dictAppendWord(dp, "cells", cells, FW_DEFAULT);
dictAppendWord(dp, "char", ficlChar, FW_DEFAULT);
dictAppendWord(dp, "char+", charPlus, FW_DEFAULT);
dictAppendWord(dp, "chars", ficlChars, FW_DEFAULT);
dictAppendWord(dp, "constant", constant, FW_DEFAULT);
dictAppendWord(dp, "count", count, FW_DEFAULT);
dictAppendWord(dp, "cr", cr, FW_DEFAULT);
dictAppendWord(dp, "create", create, FW_DEFAULT);
dictAppendWord(dp, "decimal", decimal, FW_DEFAULT);
dictAppendWord(dp, "depth", depth, FW_DEFAULT);
dictAppendWord(dp, "do", doCoIm, FW_COMPIMMED);
dictAppendWord(dp, "does>", doesCoIm, FW_COMPIMMED);
pSys->pDrop =
dictAppendWord(dp, "drop", drop, FW_DEFAULT);
dictAppendWord(dp, "dup", dup, FW_DEFAULT);
dictAppendWord(dp, "else", elseCoIm, FW_COMPIMMED);
dictAppendWord(dp, "emit", emit, FW_DEFAULT);
dictAppendWord(dp, "endcase", endcaseCoIm, FW_COMPIMMED);
dictAppendWord(dp, "endof", endofCoIm, FW_COMPIMMED);
dictAppendWord(dp, "environment?", environmentQ,FW_DEFAULT);
dictAppendWord(dp, "evaluate", evaluate, FW_DEFAULT);
dictAppendWord(dp, "execute", execute, FW_DEFAULT);
dictAppendWord(dp, "exit", exitCoIm, FW_COMPIMMED);
dictAppendWord(dp, "fallthrough",fallthroughCoIm,FW_COMPIMMED);
dictAppendWord(dp, "fill", fill, FW_DEFAULT);
dictAppendWord(dp, "find", cFind, FW_DEFAULT);
dictAppendWord(dp, "fm/mod", fmSlashMod, FW_DEFAULT);
dictAppendWord(dp, "here", here, FW_DEFAULT);
dictAppendWord(dp, "hold", hold, FW_DEFAULT);
dictAppendWord(dp, "i", loopICo, FW_COMPILE);
dictAppendWord(dp, "if", ifCoIm, FW_COMPIMMED);
dictAppendWord(dp, "immediate", immediate, FW_DEFAULT);
dictAppendWord(dp, "invert", bitwiseNot, FW_DEFAULT);
dictAppendWord(dp, "j", loopJCo, FW_COMPILE);
dictAppendWord(dp, "k", loopKCo, FW_COMPILE);
dictAppendWord(dp, "leave", leaveCo, FW_COMPILE);
dictAppendWord(dp, "literal", literalIm, FW_IMMEDIATE);
dictAppendWord(dp, "loop", loopCoIm, FW_COMPIMMED);
dictAppendWord(dp, "lshift", lshift, FW_DEFAULT);
dictAppendWord(dp, "m*", mStar, FW_DEFAULT);
dictAppendWord(dp, "max", ficlMax, FW_DEFAULT);
dictAppendWord(dp, "min", ficlMin, FW_DEFAULT);
dictAppendWord(dp, "mod", ficlMod, FW_DEFAULT);
dictAppendWord(dp, "move", move, FW_DEFAULT);
dictAppendWord(dp, "negate", negate, FW_DEFAULT);
dictAppendWord(dp, "of", ofCoIm, FW_COMPIMMED);
dictAppendWord(dp, "or", bitwiseOr, FW_DEFAULT);
dictAppendWord(dp, "over", over, FW_DEFAULT);
dictAppendWord(dp, "postpone", postponeCoIm, FW_COMPIMMED);
dictAppendWord(dp, "quit", quit, FW_DEFAULT);
dictAppendWord(dp, "r>", fromRStack, FW_COMPILE);
dictAppendWord(dp, "r@", fetchRStack, FW_COMPILE);
dictAppendWord(dp, "recurse", recurseCoIm, FW_COMPIMMED);
dictAppendWord(dp, "repeat", repeatCoIm, FW_COMPIMMED);
dictAppendWord(dp, "rot", rot, FW_DEFAULT);
dictAppendWord(dp, "rshift", rshift, FW_DEFAULT);
dictAppendWord(dp, "s\"", stringQuoteIm, FW_IMMEDIATE);
dictAppendWord(dp, "s>d", sToD, FW_DEFAULT);
dictAppendWord(dp, "sign", sign, FW_DEFAULT);
dictAppendWord(dp, "sm/rem", smSlashRem, FW_DEFAULT);
dictAppendWord(dp, "source", source, FW_DEFAULT);
dictAppendWord(dp, "state", state, FW_DEFAULT);
dictAppendWord(dp, "swap", swap, FW_DEFAULT);
dictAppendWord(dp, "then", endifCoIm, FW_COMPIMMED);
dictAppendWord(dp, "type", type, FW_DEFAULT);
dictAppendWord(dp, "u.", uDot, FW_DEFAULT);
dictAppendWord(dp, "u<", uIsLess, FW_DEFAULT);
dictAppendWord(dp, "u>", uIsGreater, FW_DEFAULT);
dictAppendWord(dp, "um*", umStar, FW_DEFAULT);
dictAppendWord(dp, "um/mod", umSlashMod, FW_DEFAULT);
dictAppendWord(dp, "unloop", unloopCo, FW_COMPILE);
dictAppendWord(dp, "until", untilCoIm, FW_COMPIMMED);
dictAppendWord(dp, "variable", variable, FW_DEFAULT);
dictAppendWord(dp, "while", whileCoIm, FW_COMPIMMED);
dictAppendWord(dp, "word", ficlWord, FW_DEFAULT);
dictAppendWord(dp, "xor", bitwiseXor, FW_DEFAULT);
dictAppendWord(dp, "[", lbracketCoIm, FW_COMPIMMED);
dictAppendWord(dp, "[\']", bracketTickCoIm,FW_COMPIMMED);
dictAppendWord(dp, "[char]", charCoIm, FW_COMPIMMED);
dictAppendWord(dp, "]", rbracket, FW_DEFAULT);
/*
** CORE EXT word set...
** see softcore.fr for other definitions
*/
/* "#tib" */
dictAppendWord(dp, ".(", dotParen, FW_IMMEDIATE);
/* ".r" */
dictAppendWord(dp, "0>", zeroGreater, FW_DEFAULT);
dictAppendWord(dp, "2>r", twoToR, FW_COMPILE);
dictAppendWord(dp, "2r>", twoRFrom, FW_COMPILE);
dictAppendWord(dp, "2r@", twoRFetch, FW_COMPILE);
dictAppendWord(dp, ":noname", colonNoName, FW_DEFAULT);
dictAppendWord(dp, "?do", qDoCoIm, FW_COMPIMMED);
dictAppendWord(dp, "again", againCoIm, FW_COMPIMMED);
dictAppendWord(dp, "c\"", cstringQuoteIm, FW_IMMEDIATE);
dictAppendWord(dp, "hex", hex, FW_DEFAULT);
dictAppendWord(dp, "pad", pad, FW_DEFAULT);
dictAppendWord(dp, "parse", parse, FW_DEFAULT);
dictAppendWord(dp, "pick", pick, FW_DEFAULT);
/* query restore-input save-input tib u.r u> unused [compile] */
dictAppendWord(dp, "roll", roll, FW_DEFAULT);
dictAppendWord(dp, "refill", refill, FW_DEFAULT);
dictAppendWord(dp, "source-id", sourceid, FW_DEFAULT);
dictAppendWord(dp, "to", toValue, FW_IMMEDIATE);
dictAppendWord(dp, "value", constant, FW_DEFAULT);
dictAppendWord(dp, "\\", commentLine, FW_IMMEDIATE);
/*
** Set CORE environment query values
*/
ficlSetEnv(pSys, "/counted-string", FICL_STRING_MAX);
ficlSetEnv(pSys, "/hold", nPAD);
ficlSetEnv(pSys, "/pad", nPAD);
ficlSetEnv(pSys, "address-unit-bits", 8);
ficlSetEnv(pSys, "core", FICL_TRUE);
ficlSetEnv(pSys, "core-ext", FICL_FALSE);
ficlSetEnv(pSys, "floored", FICL_FALSE);
ficlSetEnv(pSys, "max-char", UCHAR_MAX);
ficlSetEnvD(pSys,"max-d", 0x7fffffff, 0xffffffff);
ficlSetEnv(pSys, "max-n", 0x7fffffff);
ficlSetEnv(pSys, "max-u", 0xffffffff);
ficlSetEnvD(pSys,"max-ud", 0xffffffff, 0xffffffff);
ficlSetEnv(pSys, "return-stack-cells",FICL_DEFAULT_STACK);
ficlSetEnv(pSys, "stack-cells", FICL_DEFAULT_STACK);
/*
** DOUBLE word set (partial)
*/
dictAppendWord(dp, "2constant", twoConstant, FW_IMMEDIATE);
dictAppendWord(dp, "2literal", twoLiteralIm, FW_IMMEDIATE);
dictAppendWord(dp, "2variable", twoVariable, FW_IMMEDIATE);
dictAppendWord(dp, "dnegate", dnegate, FW_DEFAULT);
/*
** EXCEPTION word set
*/
dictAppendWord(dp, "catch", ficlCatch, FW_DEFAULT);
dictAppendWord(dp, "throw", ficlThrow, FW_DEFAULT);
ficlSetEnv(pSys, "exception", FICL_TRUE);
ficlSetEnv(pSys, "exception-ext", FICL_TRUE);
/*
** LOCAL and LOCAL EXT
** see softcore.c for implementation of locals|
*/
#if FICL_WANT_LOCALS
pSys->pLinkParen =
dictAppendWord(dp, "(link)", linkParen, FW_COMPILE);
pSys->pUnLinkParen =
dictAppendWord(dp, "(unlink)", unlinkParen, FW_COMPILE);
dictAppendWord(dp, "doLocal", doLocalIm, FW_COMPIMMED);
pSys->pGetLocalParen =
dictAppendWord(dp, "(@local)", getLocalParen, FW_COMPILE);
pSys->pToLocalParen =
dictAppendWord(dp, "(toLocal)", toLocalParen, FW_COMPILE);
pSys->pGetLocal0 =
dictAppendWord(dp, "(@local0)", getLocal0, FW_COMPILE);
pSys->pToLocal0 =
dictAppendWord(dp, "(toLocal0)",toLocal0, FW_COMPILE);
pSys->pGetLocal1 =
dictAppendWord(dp, "(@local1)", getLocal1, FW_COMPILE);
pSys->pToLocal1 =
dictAppendWord(dp, "(toLocal1)",toLocal1, FW_COMPILE);
dictAppendWord(dp, "(local)", localParen, FW_COMPILE);
pSys->pGet2LocalParen =
dictAppendWord(dp, "(@2local)", get2LocalParen, FW_COMPILE);
pSys->pTo2LocalParen =
dictAppendWord(dp, "(to2Local)",to2LocalParen, FW_COMPILE);
dictAppendWord(dp, "(2local)", twoLocalParen, FW_COMPILE);
ficlSetEnv(pSys, "locals", FICL_TRUE);
ficlSetEnv(pSys, "locals-ext", FICL_TRUE);
ficlSetEnv(pSys, "#locals", FICL_MAX_LOCALS);
#endif
/*
** Optional MEMORY-ALLOC word set
*/
dictAppendWord(dp, "allocate", ansAllocate, FW_DEFAULT);
dictAppendWord(dp, "free", ansFree, FW_DEFAULT);
dictAppendWord(dp, "resize", ansResize, FW_DEFAULT);
ficlSetEnv(pSys, "memory-alloc", FICL_TRUE);
/*
** optional SEARCH-ORDER word set
*/
ficlCompileSearch(pSys);
/*
** TOOLS and TOOLS EXT
*/
ficlCompileTools(pSys);
/*
** FILE and FILE EXT
*/
#if FICL_WANT_FILE
ficlCompileFile(pSys);
#endif
/*
** Ficl extras
*/
#if FICL_WANT_FLOAT
dictAppendWord(dp, ".hash", dictHashSummary,FW_DEFAULT);
#endif
dictAppendWord(dp, ".ver", ficlVersion, FW_DEFAULT);
dictAppendWord(dp, "-roll", minusRoll, FW_DEFAULT);
dictAppendWord(dp, ">name", toName, FW_DEFAULT);
dictAppendWord(dp, "add-parse-step",
addParseStep, FW_DEFAULT);
dictAppendWord(dp, "body>", fromBody, FW_DEFAULT);
dictAppendWord(dp, "compare", compareString, FW_DEFAULT); /* STRING */
dictAppendWord(dp, "compare-insensitive", compareStringInsensitive, FW_DEFAULT); /* STRING */
dictAppendWord(dp, "compile-only",
compileOnly, FW_DEFAULT);
dictAppendWord(dp, "endif", endifCoIm, FW_COMPIMMED);
dictAppendWord(dp, "last-word", getLastWord, FW_DEFAULT);
dictAppendWord(dp, "hash", hash, FW_DEFAULT);
dictAppendWord(dp, "objectify", setObjectFlag, FW_DEFAULT);
dictAppendWord(dp, "?object", isObject, FW_DEFAULT);
dictAppendWord(dp, "parse-word",parseNoCopy, FW_DEFAULT);
dictAppendWord(dp, "sfind", sFind, FW_DEFAULT);
dictAppendWord(dp, "sliteral", sLiteralCoIm, FW_COMPIMMED); /* STRING */
dictAppendWord(dp, "sprintf", ficlSprintf, FW_DEFAULT);
dictAppendWord(dp, "strlen", ficlStrlen, FW_DEFAULT);
dictAppendWord(dp, "q@", quadFetch, FW_DEFAULT);
dictAppendWord(dp, "q!", quadStore, FW_DEFAULT);
dictAppendWord(dp, "w@", wFetch, FW_DEFAULT);
dictAppendWord(dp, "w!", wStore, FW_DEFAULT);
dictAppendWord(dp, "x.", hexDot, FW_DEFAULT);
#if FICL_WANT_USER
dictAppendWord(dp, "(user)", userParen, FW_DEFAULT);
dictAppendWord(dp, "user", userVariable, FW_DEFAULT);
#endif
#ifdef TESTMAIN
dictAppendWord(dp, "random", ficlRandom, FW_DEFAULT);
dictAppendWord(dp, "seed-random",ficlSeedRandom,FW_DEFAULT);
#endif
/*
** internal support words
*/
dictAppendWord(dp, "(create)", createParen, FW_COMPILE);
pSys->pExitParen =
dictAppendWord(dp, "(exit)", exitParen, FW_COMPILE);
pSys->pSemiParen =
dictAppendWord(dp, "(;)", semiParen, FW_COMPILE);
pSys->pLitParen =
dictAppendWord(dp, "(literal)", literalParen, FW_COMPILE);
pSys->pTwoLitParen =
dictAppendWord(dp, "(2literal)",twoLitParen, FW_COMPILE);
pSys->pStringLit =
dictAppendWord(dp, "(.\")", stringLit, FW_COMPILE);
pSys->pCStringLit =
dictAppendWord(dp, "(c\")", cstringLit, FW_COMPILE);
pSys->pBranch0 =
dictAppendWord(dp, "(branch0)", branch0, FW_COMPILE);
pSys->pBranchParen =
dictAppendWord(dp, "(branch)", branchParen, FW_COMPILE);
pSys->pDoParen =
dictAppendWord(dp, "(do)", doParen, FW_COMPILE);
pSys->pDoesParen =
dictAppendWord(dp, "(does>)", doesParen, FW_COMPILE);
pSys->pQDoParen =
dictAppendWord(dp, "(?do)", qDoParen, FW_COMPILE);
pSys->pLoopParen =
dictAppendWord(dp, "(loop)", loopParen, FW_COMPILE);
pSys->pPLoopParen =
dictAppendWord(dp, "(+loop)", plusLoopParen, FW_COMPILE);
pSys->pInterpret =
dictAppendWord(dp, "interpret", interpret, FW_DEFAULT);
dictAppendWord(dp, "lookup", lookup, FW_DEFAULT);
pSys->pOfParen =
dictAppendWord(dp, "(of)", ofParen, FW_DEFAULT);
dictAppendWord(dp, "(variable)",variableParen, FW_COMPILE);
dictAppendWord(dp, "(constant)",constantParen, FW_COMPILE);
dictAppendWord(dp, "(parse-step)",
parseStepParen, FW_DEFAULT);
pSys->pExitInner =
dictAppendWord(dp, "exit-inner",ficlExitInner, FW_DEFAULT);
/*
** Set up system's outer interpreter loop - maybe this should be in initSystem?
*/
pSys->pInterp[0] = pSys->pInterpret;
pSys->pInterp[1] = pSys->pBranchParen;
pSys->pInterp[2] = (FICL_WORD *)(void *)(-2);
assert(dictCellsAvail(dp) > 0);
return;
}
diff --git a/stand/ficl/x86/sysdep.c b/stand/ficl/x86/sysdep.c
index f45c115f7fca..eed3db8ad4c3 100644
--- a/stand/ficl/x86/sysdep.c
+++ b/stand/ficl/x86/sysdep.c
@@ -1,51 +1,50 @@
-/* $FreeBSD$ */
#ifndef TESTMAIN
#include <machine/cpufunc.h>
/*
* outb ( port# c -- )
* Store a byte to I/O port number port#
*/
void
ficlOutb(FICL_VM *pVM)
{
u_char c;
uint32_t port;
port=stackPopUNS(pVM->pStack);
c=(u_char)stackPopINT(pVM->pStack);
outb(port,c);
}
/*
* inb ( port# -- c )
* Fetch a byte from I/O port number port#
*/
void
ficlInb(FICL_VM *pVM)
{
u_char c;
uint32_t port;
port=stackPopUNS(pVM->pStack);
c=inb(port);
stackPushINT(pVM->pStack,c);
}
/*
* Glue function to add the appropriate forth words to access x86 special cpu
* functionality.
*/
static void ficlCompileCpufunc(FICL_SYSTEM *pSys)
{
FICL_DICT *dp = pSys->dp;
assert (dp);
dictAppendWord(dp, "outb", ficlOutb, FW_DEFAULT);
dictAppendWord(dp, "inb", ficlInb, FW_DEFAULT);
}
FICL_COMPILE_SET(ficlCompileCpufunc);
#endif
diff --git a/stand/i386/boot.ldscript b/stand/i386/boot.ldscript
index 2f2a2d3e936e..6d2eb71ba465 100644
--- a/stand/i386/boot.ldscript
+++ b/stand/i386/boot.ldscript
@@ -1,17 +1,16 @@
-/* $FreeBSD$ */
/* Simplified linker script for the boot loaders. */
OUTPUT_FORMAT("elf32-i386-freebsd")
OUTPUT_ARCH(i386)
ENTRY(_start)
SECTIONS {
. = ORG;
.text : { *(.text .text.*) } =0xcccccccc /* Pad with int3, if needed */
.rodata : { *(.rodata .rodata.*) }
.got : { *(.got) *(.igot) }
.got.plt : { *(.got.plt) *(.igot.plt) }
.data : { *(.data .data.*) }
_edata = .; PROVIDE (edata = .);
.bss : { *(.bss .bss.*) }
_end = .; PROVIDE (end = .);
/DISCARD/ : { *(.interp) }
}
diff --git a/stand/kboot/arch/aarch64/ldscript.aarch64 b/stand/kboot/arch/aarch64/ldscript.aarch64
index d7107fe8c18a..62b7d2b6be01 100644
--- a/stand/kboot/arch/aarch64/ldscript.aarch64
+++ b/stand/kboot/arch/aarch64/ldscript.aarch64
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf64-aarch64", "elf64-aarch64", "elf64-aarch64")
OUTPUT_ARCH(aarch64)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0x401000;
ImageBase = .;
.hash : { *(.hash) } /* this MUST come first! */
. = ALIGN(4096);
.eh_frame :
{
*(.eh_frame)
}
. = ALIGN(4096);
.text : {
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.plt)
} =0xCCCCCCCC
. = ALIGN(4096);
.data : {
*(.rodata .rodata.* .gnu.linkonce.r.*)
*(.rodata1)
*(.sdata2 .sdata2.* .gnu.linkonce.s2.*)
*(.sbss2 .sbss2.* .gnu.linkonce.sb2.*)
*(.opd)
*(.data .data.* .gnu.linkonce.d.*)
*(.data1)
*(.plabel)
*(.dynbss)
*(.bss .bss.* .gnu.linkonce.b.*)
*(COMMON)
}
. = ALIGN(4096);
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
. = ALIGN(4096);
__gp = .;
.sdata : {
*(.got.plt .got)
*(.sdata .sdata.* .gnu.linkonce.s.*)
*(dynsbss)
*(.sbss .sbss.* .gnu.linkonce.sb.*)
*(.scommon)
}
. = ALIGN(4096);
.dynamic : { *(.dynamic) }
. = ALIGN(4096);
.rela.dyn : {
*(.rela.data*)
*(.rela.got)
*(.rela.stab)
*(.relaset_*)
}
. = ALIGN(4096);
.reloc : { *(.reloc) }
. = ALIGN(4096);
.dynsym : { *(.dynsym) }
. = ALIGN(4096);
.dynstr : { *(.dynstr) }
}
diff --git a/stand/kboot/arch/amd64/ldscript.amd64 b/stand/kboot/arch/amd64/ldscript.amd64
index bbfe47cd4ef5..4009ba5fa81c 100644
--- a/stand/kboot/arch/amd64/ldscript.amd64
+++ b/stand/kboot/arch/amd64/ldscript.amd64
@@ -1,72 +1,71 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf64-x86-64", "elf64-x86-64", "elf64-x86-64")
OUTPUT_ARCH(i386:x86-64)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0x401000;
ImageBase = .;
.hash : { *(.hash) } /* this MUST come first! */
. = ALIGN(4096);
.eh_frame :
{
*(.eh_frame)
}
. = ALIGN(4096);
.text : {
*(.text .stub .text.* .gnu.linkonce.t.*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.plt)
} =0xCCCCCCCC
. = ALIGN(4096);
.data : {
*(.rodata .rodata.* .gnu.linkonce.r.*)
*(.rodata1)
*(.sdata2 .sdata2.* .gnu.linkonce.s2.*)
*(.sbss2 .sbss2.* .gnu.linkonce.sb2.*)
*(.opd)
*(.data .data.* .gnu.linkonce.d.*)
*(.data1)
*(.plabel)
*(.dynbss)
*(.bss .bss.* .gnu.linkonce.b.*)
*(COMMON)
}
. = ALIGN(4096);
set_Xcommand_set : {
__start_set_Xcommand_set = .;
*(set_Xcommand_set)
__stop_set_Xcommand_set = .;
}
set_Xficl_compile_set : {
__start_set_Xficl_compile_set = .;
*(set_Xficl_compile_set)
__stop_set_Xficl_compile_set = .;
}
. = ALIGN(4096);
__gp = .;
.sdata : {
*(.got.plt .got)
*(.sdata .sdata.* .gnu.linkonce.s.*)
*(dynsbss)
*(.sbss .sbss.* .gnu.linkonce.sb.*)
*(.scommon)
}
. = ALIGN(4096);
.dynamic : { *(.dynamic) }
. = ALIGN(4096);
.rela.dyn : {
*(.rela.data*)
*(.rela.got)
*(.rela.stab)
*(.relaset_*)
}
. = ALIGN(4096);
.reloc : { *(.reloc) }
. = ALIGN(4096);
.dynsym : { *(.dynsym) }
. = ALIGN(4096);
.dynstr : { *(.dynstr) }
}
diff --git a/stand/kshim/bsd_busspace.c b/stand/kshim/bsd_busspace.c
index 778c4494d96c..fc35ffcb9a0c 100644
--- a/stand/kshim/bsd_busspace.c
+++ b/stand/kshim/bsd_busspace.c
@@ -1,216 +1,215 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <bsd_kernel.h>
struct burst {
uint32_t dw0;
uint32_t dw1;
uint32_t dw2;
uint32_t dw3;
uint32_t dw4;
uint32_t dw5;
uint32_t dw6;
uint32_t dw7;
};
int
bus_space_subregion(bus_space_tag_t t, bus_space_handle_t bsh,
bus_size_t offset, bus_size_t size, bus_space_handle_t *nbshp)
{
*nbshp = bsh + offset;
return (0);
}
void
bus_space_read_multi_1(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint8_t *datap, bus_size_t count)
{
while (count--) {
*datap++ = bus_space_read_1(t, h, offset);
}
}
void
bus_space_read_multi_2(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint16_t *datap, bus_size_t count)
{
while (count--) {
*datap++ = bus_space_read_2(t, h, offset);
}
}
void
bus_space_read_multi_4(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint32_t *datap, bus_size_t count)
{
h += offset;
while (count--) {
*datap++ = *((volatile uint32_t *)h);
}
}
void
bus_space_write_multi_1(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint8_t *datap, bus_size_t count)
{
while (count--) {
uint8_t temp = *datap++;
bus_space_write_1(t, h, offset, temp);
}
}
void
bus_space_write_multi_2(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint16_t *datap, bus_size_t count)
{
while (count--) {
uint16_t temp = *datap++;
bus_space_write_2(t, h, offset, temp);
}
}
void
bus_space_write_multi_4(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint32_t *datap, bus_size_t count)
{
h += offset;
while (count--) {
*((volatile uint32_t *)h) = *datap++;
}
}
void
bus_space_write_1(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint8_t data)
{
*((volatile uint8_t *)(h + offset)) = data;
}
void
bus_space_write_2(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint16_t data)
{
*((volatile uint16_t *)(h + offset)) = data;
}
void
bus_space_write_4(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint32_t data)
{
*((volatile uint32_t *)(h + offset)) = data;
}
uint8_t
bus_space_read_1(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset)
{
return (*((volatile uint8_t *)(h + offset)));
}
uint16_t
bus_space_read_2(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset)
{
return (*((volatile uint16_t *)(h + offset)));
}
uint32_t
bus_space_read_4(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset)
{
return (*((volatile uint32_t *)(h + offset)));
}
void
bus_space_read_region_1(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint8_t *datap, bus_size_t count)
{
h += offset;
while (count--) {
*datap++ = *((volatile uint8_t *)h);
h += 1;
}
}
void
bus_space_write_region_1(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint8_t *datap, bus_size_t count)
{
h += offset;
while (count--) {
*((volatile uint8_t *)h) = *datap++;
h += 1;
}
}
void
bus_space_read_region_4(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint32_t *datap, bus_size_t count)
{
enum { BURST = sizeof(struct burst) / 4 };
h += offset;
while (count >= BURST) {
*(struct burst *)datap = *((/* volatile */ struct burst *)h);
h += BURST * 4;
datap += BURST;
count -= BURST;
}
while (count--) {
*datap++ = *((volatile uint32_t *)h);
h += 4;
}
}
void
bus_space_write_region_4(bus_space_tag_t t, bus_space_handle_t h,
bus_size_t offset, uint32_t *datap, bus_size_t count)
{
enum { BURST = sizeof(struct burst) / 4 };
h += offset;
while (count >= BURST) {
*((/* volatile */ struct burst *)h) = *(struct burst *)datap;
h += BURST * 4;
datap += BURST;
count -= BURST;
}
while (count--) {
*((volatile uint32_t *)h) = *datap++;
h += 4;
}
}
diff --git a/stand/kshim/bsd_global.h b/stand/kshim/bsd_global.h
index 63bba757736d..4f4bb4e499bd 100644
--- a/stand/kshim/bsd_global.h
+++ b/stand/kshim/bsd_global.h
@@ -1,68 +1,67 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _BSD_GLOBAL_H_
#define _BSD_GLOBAL_H_
#include <bsd_kernel.h>
#include <sys/gpio.h>
#define USB_DEBUG_VAR usb_debug
#include <dev/usb/usb_freebsd_loader.h>
#include <dev/usb/usb_endian.h>
#include <dev/usb/usb.h>
#include <dev/usb/usbdi.h>
#include <dev/usb/usb_core.h>
#include <dev/usb/usb_debug.h>
#include <dev/usb/usb_process.h>
#include <dev/usb/usb_busdma.h>
#include <dev/usb/usb_dynamic.h>
#include <dev/usb/usb_transfer.h>
#include <dev/usb/usb_device.h>
#include <dev/usb/usb_hub.h>
#include <dev/usb/usb_controller.h>
#include <dev/usb/usb_bus.h>
#include <dev/usb/usbdi_util.h>
#include <dev/usb/usb_cdc.h>
#include <dev/usb/usb_dev.h>
#include <dev/usb/usb_mbuf.h>
#include <dev/usb/usb_msctest.h>
#include <dev/usb/usb_pci.h>
#include <dev/usb/usb_pf.h>
#include <dev/usb/usb_request.h>
#include <dev/usb/usb_util.h>
#include <dev/usb/usbhid.h>
#include <dev/usb/usb_ioctl.h>
#include <dev/usb/usb_generic.h>
#include <dev/usb/quirk/usb_quirk.h>
#include <dev/usb/template/usb_template.h>
#include <dev/usb/controller/ehci.h>
#include <dev/usb/controller/ehcireg.h>
extern struct usb_process usb_process[USB_PROC_MAX];
#endif /* _BSD_GLOBAL_H_ */
diff --git a/stand/kshim/bsd_kernel.c b/stand/kshim/bsd_kernel.c
index 5d47c799921b..ac552d86603f 100644
--- a/stand/kshim/bsd_kernel.c
+++ b/stand/kshim/bsd_kernel.c
@@ -1,1474 +1,1473 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <bsd_global.h>
struct usb_process usb_process[USB_PROC_MAX];
static device_t usb_pci_root;
int (*bus_alloc_resource_any_cb)(struct resource *res, device_t dev,
int type, int *rid, unsigned int flags);
int (*ofw_bus_status_ok_cb)(device_t dev);
int (*ofw_bus_is_compatible_cb)(device_t dev, char *name);
/*------------------------------------------------------------------------*
* Implementation of busdma API
*------------------------------------------------------------------------*/
int
bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
bus_size_t boundary, bus_addr_t lowaddr,
bus_addr_t highaddr, bus_dma_filter_t *filter,
void *filterarg, bus_size_t maxsize, int nsegments,
bus_size_t maxsegsz, int flags, bus_dma_lock_t *lockfunc,
void *lockfuncarg, bus_dma_tag_t *dmat)
{
struct bus_dma_tag *ret;
ret = malloc(sizeof(struct bus_dma_tag), XXX, XXX);
if (*dmat == NULL)
return (ENOMEM);
ret->alignment = alignment;
ret->maxsize = maxsize;
*dmat = ret;
return (0);
}
int
bus_dmamem_alloc(bus_dma_tag_t dmat, void** vaddr, int flags,
bus_dmamap_t *mapp)
{
void *addr;
addr = malloc(dmat->maxsize + dmat->alignment, XXX, XXX);
if (addr == NULL)
return (ENOMEM);
*mapp = addr;
addr = (void*)(((uintptr_t)addr + dmat->alignment - 1) & ~(dmat->alignment - 1));
*vaddr = addr;
return (0);
}
int
bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
bus_size_t buflen, bus_dmamap_callback_t *callback,
void *callback_arg, int flags)
{
bus_dma_segment_t segs[1];
segs[0].ds_addr = (uintptr_t)buf;
segs[0].ds_len = buflen;
(*callback)(callback_arg, segs, 1, 0);
return (0);
}
void
bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, int flags)
{
/* Assuming coherent memory */
__asm__ __volatile__("": : :"memory");
}
void
bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
{
free(map, XXX);
}
int
bus_dma_tag_destroy(bus_dma_tag_t dmat)
{
free(dmat, XXX);
return (0);
}
/*------------------------------------------------------------------------*
* Implementation of resource management API
*------------------------------------------------------------------------*/
struct resource *
bus_alloc_resource_any(device_t dev, int type, int *rid, unsigned int flags)
{
struct resource *res;
int ret = EINVAL;
res = malloc(sizeof(*res), XXX, XXX);
if (res == NULL)
return (NULL);
res->__r_i = malloc(sizeof(struct resource_i), XXX, XXX);
if (res->__r_i == NULL) {
free(res, XXX);
return (NULL);
}
if (bus_alloc_resource_any_cb != NULL)
ret = (*bus_alloc_resource_any_cb)(res, dev, type, rid, flags);
if (ret == 0)
return (res);
free(res->__r_i, XXX);
free(res, XXX);
return (NULL);
}
int
bus_alloc_resources(device_t dev, struct resource_spec *rs,
struct resource **res)
{
int i;
for (i = 0; rs[i].type != -1; i++)
res[i] = NULL;
for (i = 0; rs[i].type != -1; i++) {
res[i] = bus_alloc_resource_any(dev,
rs[i].type, &rs[i].rid, rs[i].flags);
if (res[i] == NULL && !(rs[i].flags & RF_OPTIONAL)) {
bus_release_resources(dev, rs, res);
return (ENXIO);
}
}
return (0);
}
void
bus_release_resources(device_t dev, const struct resource_spec *rs,
struct resource **res)
{
int i;
for (i = 0; rs[i].type != -1; i++)
if (res[i] != NULL) {
bus_release_resource(
dev, rs[i].type, rs[i].rid, res[i]);
res[i] = NULL;
}
}
int
bus_setup_intr(device_t dev, struct resource *r, int flags,
driver_filter_t filter, driver_intr_t handler, void *arg, void **cookiep)
{
dev->dev_irq_filter = filter;
dev->dev_irq_fn = handler;
dev->dev_irq_arg = arg;
return (0);
}
int
bus_teardown_intr(device_t dev, struct resource *r, void *cookie)
{
dev->dev_irq_filter = NULL;
dev->dev_irq_fn = NULL;
dev->dev_irq_arg = NULL;
return (0);
}
int
bus_release_resource(device_t dev, int type, int rid, struct resource *r)
{
/* Resource releasing is not supported */
return (EINVAL);
}
int
bus_generic_attach(device_t dev)
{
device_t child;
TAILQ_FOREACH(child, &dev->dev_children, dev_link) {
device_probe_and_attach(child);
}
return (0);
}
bus_space_tag_t
rman_get_bustag(struct resource *r)
{
return (r->r_bustag);
}
bus_space_handle_t
rman_get_bushandle(struct resource *r)
{
return (r->r_bushandle);
}
u_long
rman_get_size(struct resource *r)
{
return (r->__r_i->r_end - r->__r_i->r_start + 1);
}
int
ofw_bus_status_okay(device_t dev)
{
if (ofw_bus_status_ok_cb == NULL)
return (0);
return ((*ofw_bus_status_ok_cb)(dev));
}
int
ofw_bus_is_compatible(device_t dev, char *name)
{
if (ofw_bus_is_compatible_cb == NULL)
return (0);
return ((*ofw_bus_is_compatible_cb)(dev, name));
}
/*------------------------------------------------------------------------*
* Implementation of mutex API
*------------------------------------------------------------------------*/
struct mtx Giant;
static void
mtx_system_init(void *arg)
{
mtx_init(&Giant, "Giant", NULL, MTX_DEF | MTX_RECURSE);
}
SYSINIT(mtx_system_init, SI_SUB_LOCK, SI_ORDER_MIDDLE, mtx_system_init, NULL);
void
mtx_init(struct mtx *mtx, const char *name, const char *type, int opt)
{
mtx->owned = 0;
mtx->parent = mtx;
}
void
mtx_lock(struct mtx *mtx)
{
mtx = mtx->parent;
mtx->owned++;
}
void
mtx_unlock(struct mtx *mtx)
{
mtx = mtx->parent;
mtx->owned--;
}
int
mtx_owned(struct mtx *mtx)
{
mtx = mtx->parent;
return (mtx->owned != 0);
}
void
mtx_destroy(struct mtx *mtx)
{
/* NOP */
}
/*------------------------------------------------------------------------*
* Implementation of shared/exclusive mutex API
*------------------------------------------------------------------------*/
void
sx_init_flags(struct sx *sx, const char *name, int flags)
{
sx->owned = 0;
}
void
sx_destroy(struct sx *sx)
{
/* NOP */
}
void
sx_xlock(struct sx *sx)
{
sx->owned++;
}
void
sx_xunlock(struct sx *sx)
{
sx->owned--;
}
int
sx_xlocked(struct sx *sx)
{
return (sx->owned != 0);
}
/*------------------------------------------------------------------------*
* Implementaiton of condition variable API
*------------------------------------------------------------------------*/
void
cv_init(struct cv *cv, const char *desc)
{
cv->sleeping = 0;
}
void
cv_destroy(struct cv *cv)
{
/* NOP */
}
void
cv_wait(struct cv *cv, struct mtx *mtx)
{
cv_timedwait(cv, mtx, -1);
}
int
cv_timedwait(struct cv *cv, struct mtx *mtx, int timo)
{
int start = ticks;
int delta;
int time = 0;
if (cv->sleeping)
return (EWOULDBLOCK); /* not allowed */
cv->sleeping = 1;
while (cv->sleeping) {
if (timo >= 0) {
delta = ticks - start;
if (delta >= timo || delta < 0)
break;
}
mtx_unlock(mtx);
usb_idle();
if (++time >= (1000000 / hz)) {
time = 0;
callout_process(1);
}
/* Sleep for 1 us */
delay(1);
mtx_lock(mtx);
}
if (cv->sleeping) {
cv->sleeping = 0;
return (EWOULDBLOCK); /* not allowed */
}
return (0);
}
void
cv_signal(struct cv *cv)
{
cv->sleeping = 0;
}
void
cv_broadcast(struct cv *cv)
{
cv->sleeping = 0;
}
/*------------------------------------------------------------------------*
* Implementation of callout API
*------------------------------------------------------------------------*/
static void callout_proc_msg(struct usb_proc_msg *);
volatile int ticks = 0;
static LIST_HEAD(, callout) head_callout = LIST_HEAD_INITIALIZER(&head_callout);
static struct mtx mtx_callout;
static struct usb_proc_msg callout_msg[2];
static void
callout_system_init(void *arg)
{
mtx_init(&mtx_callout, "callout-mtx", NULL, MTX_DEF | MTX_RECURSE);
callout_msg[0].pm_callback = &callout_proc_msg;
callout_msg[1].pm_callback = &callout_proc_msg;
}
SYSINIT(callout_system_init, SI_SUB_LOCK, SI_ORDER_MIDDLE, callout_system_init, NULL);
static void
callout_callback(struct callout *c)
{
mtx_lock(c->mtx);
mtx_lock(&mtx_callout);
if (c->entry.le_prev != NULL) {
LIST_REMOVE(c, entry);
c->entry.le_prev = NULL;
}
mtx_unlock(&mtx_callout);
if (c->c_func != NULL)
(c->c_func) (c->c_arg);
if (!(c->flags & CALLOUT_RETURNUNLOCKED))
mtx_unlock(c->mtx);
}
void
callout_process(int timeout)
{
ticks += timeout;
usb_proc_msignal(usb_process + 2, &callout_msg[0], &callout_msg[1]);
}
static void
callout_proc_msg(struct usb_proc_msg *pmsg)
{
struct callout *c;
int delta;
repeat:
mtx_lock(&mtx_callout);
LIST_FOREACH(c, &head_callout, entry) {
delta = c->timeout - ticks;
if (delta < 0) {
mtx_unlock(&mtx_callout);
callout_callback(c);
goto repeat;
}
}
mtx_unlock(&mtx_callout);
}
void
callout_init_mtx(struct callout *c, struct mtx *mtx, int flags)
{
memset(c, 0, sizeof(*c));
if (mtx == NULL)
mtx = &Giant;
c->mtx = mtx;
c->flags = (flags & CALLOUT_RETURNUNLOCKED);
}
void
callout_reset(struct callout *c, int to_ticks,
void (*func) (void *), void *arg)
{
callout_stop(c);
c->c_func = func;
c->c_arg = arg;
c->timeout = ticks + to_ticks;
mtx_lock(&mtx_callout);
LIST_INSERT_HEAD(&head_callout, c, entry);
mtx_unlock(&mtx_callout);
}
void
callout_stop(struct callout *c)
{
mtx_lock(&mtx_callout);
if (c->entry.le_prev != NULL) {
LIST_REMOVE(c, entry);
c->entry.le_prev = NULL;
}
mtx_unlock(&mtx_callout);
c->c_func = NULL;
c->c_arg = NULL;
}
void
callout_drain(struct callout *c)
{
if (c->mtx == NULL)
return; /* not initialised */
mtx_lock(c->mtx);
callout_stop(c);
mtx_unlock(c->mtx);
}
int
callout_pending(struct callout *c)
{
int retval;
mtx_lock(&mtx_callout);
retval = (c->entry.le_prev != NULL);
mtx_unlock(&mtx_callout);
return (retval);
}
/*------------------------------------------------------------------------*
* Implementation of device API
*------------------------------------------------------------------------*/
static const char unknown_string[] = { "unknown" };
static TAILQ_HEAD(, module_data) module_head =
TAILQ_HEAD_INITIALIZER(module_head);
static uint8_t
devclass_equal(const char *a, const char *b)
{
char ta, tb;
if (a == b)
return (1);
while (1) {
ta = *a;
tb = *b;
if (ta != tb)
return (0);
if (ta == 0)
break;
a++;
b++;
}
return (1);
}
int
bus_generic_resume(device_t dev)
{
return (0);
}
int
bus_generic_shutdown(device_t dev)
{
return (0);
}
int
bus_generic_suspend(device_t dev)
{
return (0);
}
int
bus_generic_print_child(device_t dev, device_t child)
{
return (0);
}
void
bus_generic_driver_added(device_t dev, driver_t *driver)
{
return;
}
device_t
device_get_parent(device_t dev)
{
return (dev ? dev->dev_parent : NULL);
}
void
device_set_interrupt(device_t dev, driver_filter_t *filter,
driver_intr_t *fn, void *arg)
{
dev->dev_irq_filter = filter;
dev->dev_irq_fn = fn;
dev->dev_irq_arg = arg;
}
void
device_run_interrupts(device_t parent)
{
device_t child;
if (parent == NULL)
return;
TAILQ_FOREACH(child, &parent->dev_children, dev_link) {
int status;
if (child->dev_irq_filter != NULL)
status = child->dev_irq_filter(child->dev_irq_arg);
else
status = FILTER_SCHEDULE_THREAD;
if (status == FILTER_SCHEDULE_THREAD) {
if (child->dev_irq_fn != NULL)
(child->dev_irq_fn) (child->dev_irq_arg);
}
}
}
void
device_set_ivars(device_t dev, void *ivars)
{
dev->dev_aux = ivars;
}
void *
device_get_ivars(device_t dev)
{
return (dev ? dev->dev_aux : NULL);
}
int
device_get_unit(device_t dev)
{
return (dev ? dev->dev_unit : 0);
}
int
bus_generic_detach(device_t dev)
{
device_t child;
int error;
if (!dev->dev_attached)
return (EBUSY);
TAILQ_FOREACH(child, &dev->dev_children, dev_link) {
if ((error = device_detach(child)) != 0)
return (error);
}
return (0);
}
const char *
device_get_nameunit(device_t dev)
{
if (dev && dev->dev_nameunit[0])
return (dev->dev_nameunit);
return (unknown_string);
}
static uint8_t
devclass_create(devclass_t *dc_pp)
{
if (dc_pp == NULL) {
return (1);
}
if (dc_pp[0] == NULL) {
dc_pp[0] = malloc(sizeof(**(dc_pp)),
M_DEVBUF, M_WAITOK | M_ZERO);
if (dc_pp[0] == NULL) {
return (1);
}
}
return (0);
}
static const struct module_data *
devclass_find_create(const char *classname)
{
const struct module_data *mod;
TAILQ_FOREACH(mod, &module_head, entry) {
if (devclass_equal(mod->mod_name, classname)) {
if (devclass_create(mod->devclass_pp)) {
continue;
}
return (mod);
}
}
return (NULL);
}
static uint8_t
devclass_add_device(const struct module_data *mod, device_t dev)
{
device_t *pp_dev;
device_t *end;
uint8_t unit;
pp_dev = mod->devclass_pp[0]->dev_list;
end = pp_dev + DEVCLASS_MAXUNIT;
unit = 0;
while (pp_dev != end) {
if (*pp_dev == NULL) {
*pp_dev = dev;
dev->dev_unit = unit;
dev->dev_module = mod;
snprintf(dev->dev_nameunit,
sizeof(dev->dev_nameunit),
"%s%d", device_get_name(dev), unit);
return (0);
}
pp_dev++;
unit++;
}
DPRINTF("Could not add device to devclass.\n");
return (1);
}
static void
devclass_delete_device(const struct module_data *mod, device_t dev)
{
if (mod == NULL) {
return;
}
mod->devclass_pp[0]->dev_list[dev->dev_unit] = NULL;
dev->dev_module = NULL;
}
static device_t
make_device(device_t parent, const char *name)
{
device_t dev = NULL;
const struct module_data *mod = NULL;
if (name) {
mod = devclass_find_create(name);
if (!mod) {
DPRINTF("%s:%d:%s: can't find device "
"class %s\n", __FILE__, __LINE__,
__FUNCTION__, name);
goto done;
}
}
dev = malloc(sizeof(*dev),
M_DEVBUF, M_WAITOK | M_ZERO);
if (dev == NULL)
goto done;
dev->dev_parent = parent;
TAILQ_INIT(&dev->dev_children);
if (name) {
dev->dev_fixed_class = 1;
if (devclass_add_device(mod, dev)) {
goto error;
}
}
done:
return (dev);
error:
if (dev) {
free(dev, M_DEVBUF);
}
return (NULL);
}
device_t
device_add_child(device_t dev, const char *name, int unit)
{
device_t child;
if (unit != -1) {
device_printf(dev, "Unit is not -1\n");
}
child = make_device(dev, name);
if (child == NULL) {
device_printf(dev, "Could not add child '%s'\n", name);
goto done;
}
if (dev == NULL) {
/* no parent */
goto done;
}
TAILQ_INSERT_TAIL(&dev->dev_children, child, dev_link);
done:
return (child);
}
int
device_delete_child(device_t dev, device_t child)
{
int error = 0;
device_t grandchild;
/* detach parent before deleting children, if any */
error = device_detach(child);
if (error)
goto done;
/* remove children second */
while ((grandchild = TAILQ_FIRST(&child->dev_children))) {
error = device_delete_child(child, grandchild);
if (error) {
device_printf(dev, "Error deleting child!\n");
goto done;
}
}
devclass_delete_device(child->dev_module, child);
if (dev != NULL) {
/* remove child from parent */
TAILQ_REMOVE(&dev->dev_children, child, dev_link);
}
free(child, M_DEVBUF);
done:
return (error);
}
int
device_delete_children(device_t dev)
{
device_t child;
int error = 0;
while ((child = TAILQ_FIRST(&dev->dev_children))) {
error = device_delete_child(dev, child);
if (error) {
device_printf(dev, "Error deleting child!\n");
break;
}
}
return (error);
}
void
device_quiet(device_t dev)
{
dev->dev_quiet = 1;
}
const char *
device_get_desc(device_t dev)
{
if (dev)
return &(dev->dev_desc[0]);
return (unknown_string);
}
static int
default_method(void)
{
/* do nothing */
DPRINTF("Default method called\n");
return (0);
}
void *
device_get_method(device_t dev, const char *what)
{
const struct device_method *mtod;
mtod = dev->dev_module->driver->methods;
while (mtod->func != NULL) {
if (devclass_equal(mtod->desc, what)) {
return (mtod->func);
}
mtod++;
}
return ((void *)&default_method);
}
const char *
device_get_name(device_t dev)
{
if (dev == NULL)
return (unknown_string);
return (dev->dev_module->driver->name);
}
static int
device_allocate_softc(device_t dev)
{
const struct module_data *mod;
mod = dev->dev_module;
if ((dev->dev_softc_alloc == 0) &&
(mod->driver->size != 0)) {
dev->dev_sc = malloc(mod->driver->size,
M_DEVBUF, M_WAITOK | M_ZERO);
if (dev->dev_sc == NULL)
return (ENOMEM);
dev->dev_softc_alloc = 1;
}
return (0);
}
int
device_probe_and_attach(device_t dev)
{
const struct module_data *mod;
const char *bus_name_parent;
bus_name_parent = device_get_name(device_get_parent(dev));
if (dev->dev_attached)
return (0); /* fail-safe */
if (dev->dev_fixed_class) {
mod = dev->dev_module;
if (DEVICE_PROBE(dev) <= 0) {
if (device_allocate_softc(dev) == 0) {
if (DEVICE_ATTACH(dev) == 0) {
/* success */
dev->dev_attached = 1;
return (0);
}
}
}
device_detach(dev);
goto error;
}
/*
* Else find a module for our device, if any
*/
TAILQ_FOREACH(mod, &module_head, entry) {
if (devclass_equal(mod->bus_name, bus_name_parent)) {
if (devclass_create(mod->devclass_pp)) {
continue;
}
if (devclass_add_device(mod, dev)) {
continue;
}
if (DEVICE_PROBE(dev) <= 0) {
if (device_allocate_softc(dev) == 0) {
if (DEVICE_ATTACH(dev) == 0) {
/* success */
dev->dev_attached = 1;
return (0);
}
}
}
/* else try next driver */
device_detach(dev);
}
}
error:
return (ENODEV);
}
int
device_detach(device_t dev)
{
const struct module_data *mod = dev->dev_module;
int error;
if (dev->dev_attached) {
error = DEVICE_DETACH(dev);
if (error) {
return error;
}
dev->dev_attached = 0;
}
device_set_softc(dev, NULL);
if (dev->dev_fixed_class == 0)
devclass_delete_device(mod, dev);
return (0);
}
void
device_set_softc(device_t dev, void *softc)
{
if (dev->dev_softc_alloc) {
free(dev->dev_sc, M_DEVBUF);
dev->dev_sc = NULL;
}
dev->dev_sc = softc;
dev->dev_softc_alloc = 0;
}
void *
device_get_softc(device_t dev)
{
if (dev == NULL)
return (NULL);
return (dev->dev_sc);
}
int
device_is_attached(device_t dev)
{
return (dev->dev_attached);
}
void
device_set_desc(device_t dev, const char *desc)
{
snprintf(dev->dev_desc, sizeof(dev->dev_desc), "%s", desc);
}
void
device_set_desc_copy(device_t dev, const char *desc)
{
device_set_desc(dev, desc);
}
void *
devclass_get_softc(devclass_t dc, int unit)
{
return (device_get_softc(devclass_get_device(dc, unit)));
}
int
devclass_get_maxunit(devclass_t dc)
{
int max_unit = 0;
if (dc) {
max_unit = DEVCLASS_MAXUNIT;
while (max_unit--) {
if (dc->dev_list[max_unit]) {
break;
}
}
max_unit++;
}
return (max_unit);
}
device_t
devclass_get_device(devclass_t dc, int unit)
{
return (((unit < 0) || (unit >= DEVCLASS_MAXUNIT) || (dc == NULL)) ?
NULL : dc->dev_list[unit]);
}
devclass_t
devclass_find(const char *classname)
{
const struct module_data *mod;
TAILQ_FOREACH(mod, &module_head, entry) {
if (devclass_equal(mod->driver->name, classname))
return (mod->devclass_pp[0]);
}
return (NULL);
}
void
module_register(void *data)
{
struct module_data *mdata = data;
TAILQ_INSERT_TAIL(&module_head, mdata, entry);
}
/*------------------------------------------------------------------------*
* System startup
*------------------------------------------------------------------------*/
static void
sysinit_run(const void **ppdata)
{
const struct sysinit *psys;
while ((psys = *ppdata) != NULL) {
(psys->func) (psys->data);
ppdata++;
}
}
/*------------------------------------------------------------------------*
* USB process API
*------------------------------------------------------------------------*/
static int usb_do_process(struct usb_process *);
static int usb_proc_level = -1;
static struct mtx usb_proc_mtx;
void
usb_idle(void)
{
int old_level = usb_proc_level;
int old_giant = Giant.owned;
int worked;
device_run_interrupts(usb_pci_root);
do {
worked = 0;
Giant.owned = 0;
while (++usb_proc_level < USB_PROC_MAX)
worked |= usb_do_process(usb_process + usb_proc_level);
usb_proc_level = old_level;
Giant.owned = old_giant;
} while (worked);
}
void
usb_init(void)
{
sysinit_run(sysinit_data);
}
void
usb_uninit(void)
{
sysinit_run(sysuninit_data);
}
static void
usb_process_init_sub(struct usb_process *up)
{
TAILQ_INIT(&up->up_qhead);
cv_init(&up->up_cv, "-");
cv_init(&up->up_drain, "usbdrain");
up->up_mtx = &usb_proc_mtx;
}
static void
usb_process_init(void *arg)
{
uint8_t x;
mtx_init(&usb_proc_mtx, "usb-proc-mtx", NULL, MTX_DEF | MTX_RECURSE);
for (x = 0; x != USB_PROC_MAX; x++)
usb_process_init_sub(&usb_process[x]);
}
SYSINIT(usb_process_init, SI_SUB_LOCK, SI_ORDER_MIDDLE, usb_process_init, NULL);
static int
usb_do_process(struct usb_process *up)
{
struct usb_proc_msg *pm;
int worked = 0;
mtx_lock(&usb_proc_mtx);
repeat:
pm = TAILQ_FIRST(&up->up_qhead);
if (pm != NULL) {
worked = 1;
(pm->pm_callback) (pm);
if (pm == TAILQ_FIRST(&up->up_qhead)) {
/* nothing changed */
TAILQ_REMOVE(&up->up_qhead, pm, pm_qentry);
pm->pm_qentry.tqe_prev = NULL;
}
goto repeat;
}
mtx_unlock(&usb_proc_mtx);
return (worked);
}
void *
usb_proc_msignal(struct usb_process *up, void *_pm0, void *_pm1)
{
struct usb_proc_msg *pm0 = _pm0;
struct usb_proc_msg *pm1 = _pm1;
struct usb_proc_msg *pm2;
usb_size_t d;
uint8_t t;
t = 0;
if (pm0->pm_qentry.tqe_prev) {
t |= 1;
}
if (pm1->pm_qentry.tqe_prev) {
t |= 2;
}
if (t == 0) {
/*
* No entries are queued. Queue "pm0" and use the existing
* message number.
*/
pm2 = pm0;
} else if (t == 1) {
/* Check if we need to increment the message number. */
if (pm0->pm_num == up->up_msg_num) {
up->up_msg_num++;
}
pm2 = pm1;
} else if (t == 2) {
/* Check if we need to increment the message number. */
if (pm1->pm_num == up->up_msg_num) {
up->up_msg_num++;
}
pm2 = pm0;
} else if (t == 3) {
/*
* Both entries are queued. Re-queue the entry closest to
* the end.
*/
d = (pm1->pm_num - pm0->pm_num);
/* Check sign after subtraction */
if (d & 0x80000000) {
pm2 = pm0;
} else {
pm2 = pm1;
}
TAILQ_REMOVE(&up->up_qhead, pm2, pm_qentry);
} else {
pm2 = NULL; /* panic - should not happen */
}
/* Put message last on queue */
pm2->pm_num = up->up_msg_num;
TAILQ_INSERT_TAIL(&up->up_qhead, pm2, pm_qentry);
return (pm2);
}
/*------------------------------------------------------------------------*
* usb_proc_is_gone
*
* Return values:
* 0: USB process is running
* Else: USB process is tearing down
*------------------------------------------------------------------------*/
uint8_t
usb_proc_is_gone(struct usb_process *up)
{
return (0);
}
/*------------------------------------------------------------------------*
* usb_proc_mwait
*
* This function will return when the USB process message pointed to
* by "pm" is no longer on a queue. This function must be called
* having "usb_proc_mtx" locked.
*------------------------------------------------------------------------*/
void
usb_proc_mwait(struct usb_process *up, void *_pm0, void *_pm1)
{
struct usb_proc_msg *pm0 = _pm0;
struct usb_proc_msg *pm1 = _pm1;
/* Just remove the messages from the queue. */
if (pm0->pm_qentry.tqe_prev) {
TAILQ_REMOVE(&up->up_qhead, pm0, pm_qentry);
pm0->pm_qentry.tqe_prev = NULL;
}
if (pm1->pm_qentry.tqe_prev) {
TAILQ_REMOVE(&up->up_qhead, pm1, pm_qentry);
pm1->pm_qentry.tqe_prev = NULL;
}
}
/*------------------------------------------------------------------------*
* SYSTEM attach
*------------------------------------------------------------------------*/
#ifdef USB_PCI_PROBE_LIST
static device_method_t pci_methods[] = {
DEVMETHOD_END
};
static driver_t pci_driver = {
.name = "pci",
.methods = pci_methods,
};
static devclass_t pci_devclass;
DRIVER_MODULE(pci, pci, pci_driver, pci_devclass, 0, 0);
static const char *usb_pci_devices[] = {
USB_PCI_PROBE_LIST
};
#define USB_PCI_USB_MAX (sizeof(usb_pci_devices) / sizeof(void *))
static device_t usb_pci_dev[USB_PCI_USB_MAX];
static void
usb_pci_mod_load(void *arg)
{
uint32_t x;
usb_pci_root = device_add_child(NULL, "pci", -1);
if (usb_pci_root == NULL)
return;
for (x = 0; x != USB_PCI_USB_MAX; x++) {
usb_pci_dev[x] = device_add_child(usb_pci_root, usb_pci_devices[x], -1);
if (usb_pci_dev[x] == NULL)
continue;
if (device_probe_and_attach(usb_pci_dev[x])) {
device_printf(usb_pci_dev[x],
"WARNING: Probe and attach failed!\n");
}
}
}
SYSINIT(usb_pci_mod_load, SI_SUB_RUN_SCHEDULER, SI_ORDER_MIDDLE, usb_pci_mod_load, 0);
static void
usb_pci_mod_unload(void *arg)
{
uint32_t x;
for (x = 0; x != USB_PCI_USB_MAX; x++) {
if (usb_pci_dev[x]) {
device_detach(usb_pci_dev[x]);
device_delete_child(usb_pci_root, usb_pci_dev[x]);
}
}
if (usb_pci_root)
device_delete_child(NULL, usb_pci_root);
}
SYSUNINIT(usb_pci_mod_unload, SI_SUB_RUN_SCHEDULER, SI_ORDER_MIDDLE, usb_pci_mod_unload, 0);
#endif
/*------------------------------------------------------------------------*
* MALLOC API
*------------------------------------------------------------------------*/
#ifndef HAVE_MALLOC
#define USB_POOL_ALIGN 8
static uint8_t usb_pool[USB_POOL_SIZE] __aligned(USB_POOL_ALIGN);
static uint32_t usb_pool_rem = USB_POOL_SIZE;
static uint32_t usb_pool_entries;
struct malloc_hdr {
TAILQ_ENTRY(malloc_hdr) entry;
uint32_t size;
} __aligned(USB_POOL_ALIGN);
static TAILQ_HEAD(, malloc_hdr) malloc_head =
TAILQ_HEAD_INITIALIZER(malloc_head);
void *
usb_malloc(unsigned long size)
{
struct malloc_hdr *hdr;
size = (size + USB_POOL_ALIGN - 1) & ~(USB_POOL_ALIGN - 1);
size += sizeof(struct malloc_hdr);
TAILQ_FOREACH(hdr, &malloc_head, entry) {
if (hdr->size == size)
break;
}
if (hdr) {
DPRINTF("MALLOC: Entries = %d; Remainder = %d; Size = %d\n",
(int)usb_pool_entries, (int)usb_pool_rem, (int)size);
TAILQ_REMOVE(&malloc_head, hdr, entry);
memset(hdr + 1, 0, hdr->size - sizeof(*hdr));
return (hdr + 1);
}
if (usb_pool_rem >= size) {
hdr = (void *)(usb_pool + USB_POOL_SIZE - usb_pool_rem);
hdr->size = size;
usb_pool_rem -= size;
usb_pool_entries++;
DPRINTF("MALLOC: Entries = %d; Remainder = %d; Size = %d\n",
(int)usb_pool_entries, (int)usb_pool_rem, (int)size);
memset(hdr + 1, 0, hdr->size - sizeof(*hdr));
return (hdr + 1);
}
return (NULL);
}
void
usb_free(void *arg)
{
struct malloc_hdr *hdr;
if (arg == NULL)
return;
hdr = arg;
hdr--;
TAILQ_INSERT_TAIL(&malloc_head, hdr, entry);
}
#endif
char *
usb_strdup(const char *str)
{
char *tmp;
int len;
len = 1 + strlen(str);
tmp = malloc(len,XXX,XXX);
if (tmp == NULL)
return (NULL);
memcpy(tmp, str, len);
return (tmp);
}
diff --git a/stand/kshim/bsd_kernel.h b/stand/kshim/bsd_kernel.h
index 18ac71e1d7ff..10f9451d7b95 100644
--- a/stand/kshim/bsd_kernel.h
+++ b/stand/kshim/bsd_kernel.h
@@ -1,718 +1,717 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2011 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _BSD_KERNEL_H_
#define _BSD_KERNEL_H_
#if !defined(_STANDALONE)
#error "_STANDALONE is not defined!"
#endif
#undef __FreeBSD_version
#define __FreeBSD_version 1300000
#include <sys/cdefs.h>
#include <sys/queue.h>
#include <sys/errno.h>
#define offsetof(type, field) __builtin_offsetof(type, field)
#define howmany(x, y) (((x)+((y)-1))/(y))
#define nitems(x) (sizeof((x)) / sizeof((x)[0]))
#define isalpha(x) (((x) >= 'a' && (x) <= 'z') || ((x) >= 'A' && (x) <= 'Z'))
#define isdigit(x) ((x) >= '0' && (x) <= '9')
#define panic(...) do { printf("USB PANIC: " __VA_ARGS__); while (1) ; } while (0)
#define rebooting 0
#define M_USB 0
#define M_USBDEV 0
#define USB_PROC_MAX 3
#define USB_BUS_GIANT_PROC(bus) (usb_process + 2)
#define USB_BUS_NON_GIANT_BULK_PROC(bus) (usb_process + 2)
#define USB_BUS_NON_GIANT_ISOC_PROC(bus) (usb_process + 2)
#define USB_BUS_EXPLORE_PROC(bus) (usb_process + 0)
#define USB_BUS_CONTROL_XFER_PROC(bus) (usb_process + 1)
#define SYSCTL_DECL(...)
struct sysctl_ctx_list {
};
struct sysctl_req {
void *newptr;
};
#define SYSCTL_HANDLER_ARGS void *oidp, void *arg1, \
uint32_t arg2, struct sysctl_req *req
#define SYSCTL_NODE(name,...) struct { } name __used
#define SYSCTL_INT(...)
#define SYSCTL_UINT(...)
#define SYSCTL_PROC(...)
#define SYSCTL_ADD_NODE(...) NULL
#define SYSCTL_ADD_U16(...) NULL
#define SYSCTL_ADD_PROC(...) NULL
#define sysctl_handle_int(...) EOPNOTSUPP
#define sysctl_handle_string(...) EOPNOTSUPP
#define sysctl_ctx_init(ctx) do { (void)(ctx); } while (0)
#define sysctl_ctx_free(ctx) do { (void)(ctx); } while (0)
#define TUNABLE_INT(...)
#define MALLOC_DECLARE(...)
#define MALLOC_DEFINE(...)
#define EVENTHANDLER_DECLARE(...)
#define EVENTHANDLER_INVOKE(...)
#define KASSERT(...)
#define CTASSERT(x) _Static_assert(x, "compile-time assertion failed")
#define SCHEDULER_STOPPED(x) (0)
#define PI_SWI(...) (0)
#define UNIQ_NAME(x) x
#define UNIQ_NAME_STR(x) #x
#define DEVCLASS_MAXUNIT 32
#define MOD_LOAD 1
#define MOD_UNLOAD 2
#define DEVMETHOD(what,func) { #what, (void *)&func }
#define DEVMETHOD_END {0,0}
#define EARLY_DRIVER_MODULE(a, b, c, d, e, f, g) DRIVER_MODULE(a, b, c, d, e, f)
#define DRIVER_MODULE(name, busname, driver, devclass, evh, arg) \
static struct module_data bsd_##name##_##busname##_driver_mod = { \
evh, arg, #busname, #name, #busname "/" #name, \
&driver, &devclass, { 0, 0 } }; \
SYSINIT(bsd_##name##_##busname##_driver_mod, SI_SUB_DRIVERS, \
SI_ORDER_MIDDLE, module_register, \
&bsd_##name##_##busname##_driver_mod)
#define SYSINIT(uniq, subs, order, _func, _data) \
const struct sysinit UNIQ_NAME(sysinit_##uniq) = { \
.func = (_func), \
.data = __DECONST(void *, _data) \
}; \
SYSINIT_ENTRY(uniq##_entry, "sysinit", (subs), \
(order), "const struct sysinit", \
UNIQ_NAME_STR(sysinit_##uniq), "SYSINIT")
#define SYSUNINIT(uniq, subs, order, _func, _data) \
const struct sysinit UNIQ_NAME(sysuninit_##uniq) = { \
.func = (_func), \
.data = __DECONST(void *, _data) \
}; \
SYSINIT_ENTRY(uniq##_entry, "sysuninit", (subs), \
(order), "const struct sysuninit", \
UNIQ_NAME_STR(sysuninit_##uniq), "SYSUNINIT")
#define MODULE_DEPEND(...)
#define MODULE_VERSION(...)
#define NULL ((void *)0)
#define BUS_SPACE_BARRIER_READ 0x01
#define BUS_SPACE_BARRIER_WRITE 0x02
#define hz 1000
#undef PAGE_SIZE
#define PAGE_SIZE 4096
#undef PAGE_SHIFT
#define PAGE_SHIFT 12
#undef MIN
#define MIN(a,b) (((a) < (b)) ? (a) : (b))
#undef MAX
#define MAX(a,b) (((a) > (b)) ? (a) : (b))
#define MTX_DEF 0
#define MTX_SPIN 0
#define MTX_RECURSE 0
#define SX_DUPOK 0
#define SX_NOWITNESS 0
#define WITNESS_WARN(...)
#define cold 0
#define BUS_PROBE_GENERIC 0
#define BUS_PROBE_DEFAULT (-20)
#define CALLOUT_RETURNUNLOCKED 0x1
#undef ffs
#define ffs(x) __builtin_ffs(x)
#undef va_list
#define va_list __builtin_va_list
#undef va_size
#define va_size(type) __builtin_va_size(type)
#undef va_start
#define va_start(ap, last) __builtin_va_start(ap, last)
#undef va_end
#define va_end(ap) __builtin_va_end(ap)
#undef va_arg
#define va_arg(ap, type) __builtin_va_arg((ap), type)
#define DEVICE_ATTACH(dev, ...) \
(((device_attach_t *)(device_get_method(dev, "device_attach")))(dev,## __VA_ARGS__))
#define DEVICE_DETACH(dev, ...) \
(((device_detach_t *)(device_get_method(dev, "device_detach")))(dev,## __VA_ARGS__))
#define DEVICE_PROBE(dev, ...) \
(((device_probe_t *)(device_get_method(dev, "device_probe")))(dev,## __VA_ARGS__))
#define DEVICE_RESUME(dev, ...) \
(((device_resume_t *)(device_get_method(dev, "device_resume")))(dev,## __VA_ARGS__))
#define DEVICE_SHUTDOWN(dev, ...) \
(((device_shutdown_t *)(device_get_method(dev, "device_shutdown")))(dev,## __VA_ARGS__))
#define DEVICE_SUSPEND(dev, ...) \
(((device_suspend_t *)(device_get_method(dev, "device_suspend")))(dev,## __VA_ARGS__))
#define USB_HANDLE_REQUEST(dev, ...) \
(((usb_handle_request_t *)(device_get_method(dev, "usb_handle_request")))(dev,## __VA_ARGS__))
#define USB_TAKE_CONTROLLER(dev, ...) \
(((usb_take_controller_t *)(device_get_method(dev, "usb_take_controller")))(dev,## __VA_ARGS__))
#define GPIO_PIN_SET(dev, ...) \
(((gpio_pin_set_t *)(device_get_method(dev, "gpio_pin_set")))(dev,## __VA_ARGS__))
#define GPIO_PIN_SETFLAGS(dev, ...) \
(((gpio_pin_setflags_t *)(device_get_method(dev, "gpio_pin_setflags")))(dev,## __VA_ARGS__))
enum {
SI_SUB_DUMMY = 0x0000000,
SI_SUB_LOCK = 0x1B00000,
SI_SUB_KLD = 0x2000000,
SI_SUB_DRIVERS = 0x3100000,
SI_SUB_PSEUDO = 0x7000000,
SI_SUB_KICK_SCHEDULER = 0xa000000,
SI_SUB_RUN_SCHEDULER = 0xfffffff
};
enum {
SI_ORDER_FIRST = 0x0000000,
SI_ORDER_SECOND = 0x0000001,
SI_ORDER_THIRD = 0x0000002,
SI_ORDER_FOURTH = 0x0000003,
SI_ORDER_MIDDLE = 0x1000000,
SI_ORDER_ANY = 0xfffffff /* last */
};
struct uio;
struct thread;
struct malloc_type;
struct usb_process;
#ifndef INT32_MAX
#define INT32_MAX 0x7fffffff
#endif
#ifndef HAVE_STANDARD_DEFS
#define _UINT8_T_DECLARED
typedef unsigned char uint8_t;
#define _INT8_T_DECLARED
typedef signed char int8_t;
#define _UINT16_T_DECLARED
typedef unsigned short uint16_t;
#define _INT16_T_DECLARED
typedef signed short int16_t;
#define _UINT32_T_DECLARED
typedef unsigned int uint32_t;
#define _INT32_T_DECLARED
typedef signed int int32_t;
#define _UINT64_T_DECLARED
#ifndef __LP64__
typedef unsigned long long uint64_t;
#else
typedef unsigned long uint64_t;
#endif
#define _INT64_T_DECLARED
#ifndef __LP64__
typedef signed long long int64_t;
#else
typedef signed long int64_t;
#endif
typedef uint16_t uid_t;
typedef uint16_t gid_t;
typedef uint16_t mode_t;
typedef uint8_t *caddr_t;
#define _UINTPTR_T_DECLARED
typedef unsigned long uintptr_t;
#define _UINTMAX_T_DECLARED
typedef unsigned long uintmax_t;
typedef unsigned long vm_paddr_t;
#define _SIZE_T_DECLARED
typedef unsigned long size_t;
#define _SSIZE_T_DECLARED
typedef signed long ssize_t;
#define _OFF_T_DECLARED
typedef unsigned long off_t;
typedef int64_t sbintime_t;
typedef unsigned char u_char;
typedef unsigned short u_short;
typedef unsigned int u_int;
typedef unsigned long u_long;
#endif
typedef unsigned long bus_addr_t;
typedef unsigned long bus_size_t;
typedef struct bus_dma_segment {
bus_addr_t ds_addr; /* DMA address */
bus_size_t ds_len; /* length of transfer */
} bus_dma_segment_t;
struct bus_dma_tag {
uint32_t alignment;
uint32_t maxsize;
};
typedef void *bus_dmamap_t;
typedef struct bus_dma_tag *bus_dma_tag_t;
typedef enum {
BUS_DMA_LOCK = 0x01,
BUS_DMA_UNLOCK = 0x02,
} bus_dma_lock_op_t;
typedef void *bus_space_tag_t;
typedef uint8_t *bus_space_handle_t;
typedef int bus_dma_filter_t(void *, bus_addr_t);
typedef void bus_dma_lock_t(void *, bus_dma_lock_op_t);
#ifndef __bool_true_false_are_defined
#define __bool_true_false_are_defined
typedef _Bool bool;
#define true 1
#define false 0
#endif
/* SYSINIT API */
#include <sysinit.h>
struct sysinit {
void (*func) (void *arg);
void *data;
};
/* MUTEX API */
struct mtx {
int owned;
struct mtx *parent;
};
#define mtx_assert(...) do { } while (0)
void mtx_init(struct mtx *, const char *, const char *, int);
void mtx_lock(struct mtx *);
void mtx_unlock(struct mtx *);
#define mtx_lock_spin(x) mtx_lock(x)
#define mtx_unlock_spin(x) mtx_unlock(x)
int mtx_owned(struct mtx *);
void mtx_destroy(struct mtx *);
extern struct mtx Giant;
/* SX API */
struct sx {
int owned;
};
#define sx_assert(...) do { } while (0)
#define sx_init(...) sx_init_flags(__VA_ARGS__, 0)
void sx_init_flags(struct sx *, const char *, int);
void sx_destroy(struct sx *);
void sx_xlock(struct sx *);
void sx_xunlock(struct sx *);
int sx_xlocked(struct sx *);
/* CONDVAR API */
struct cv {
int sleeping;
};
void cv_init(struct cv *, const char *desc);
void cv_destroy(struct cv *);
void cv_wait(struct cv *, struct mtx *);
int cv_timedwait(struct cv *, struct mtx *, int);
void cv_signal(struct cv *);
void cv_broadcast(struct cv *);
/* CALLOUT API */
typedef void callout_fn_t (void *);
extern volatile int ticks;
struct callout {
LIST_ENTRY(callout) entry;
callout_fn_t *c_func;
void *c_arg;
struct mtx *mtx;
int flags;
int timeout;
};
void callout_init_mtx(struct callout *, struct mtx *, int);
void callout_reset(struct callout *, int, callout_fn_t *, void *);
void callout_stop(struct callout *);
void callout_drain(struct callout *);
int callout_pending(struct callout *);
void callout_process(int timeout);
/* DEVICE API */
struct driver;
struct devclass;
struct device;
struct module;
struct module_data;
struct sbuf;
typedef struct driver driver_t;
typedef struct devclass *devclass_t;
typedef struct device *device_t;
typedef void (driver_intr_t)(void *arg);
typedef int (driver_filter_t)(void *arg);
#define FILTER_STRAY 0x01
#define FILTER_HANDLED 0x02
#define FILTER_SCHEDULE_THREAD 0x04
typedef int device_attach_t (device_t dev);
typedef int device_detach_t (device_t dev);
typedef int device_resume_t (device_t dev);
typedef int device_shutdown_t (device_t dev);
typedef int device_probe_t (device_t dev);
typedef int device_suspend_t (device_t dev);
typedef int gpio_pin_set_t (device_t dev, uint32_t, unsigned int);
typedef int gpio_pin_setflags_t (device_t dev, uint32_t, uint32_t);
typedef int bus_child_location_str_t (device_t parent, device_t child, char *buf, size_t buflen);
typedef int bus_child_pnpinfo_str_t (device_t parent, device_t child, char *buf, size_t buflen);
typedef int bus_child_location_t (device_t parent, device_t child, struct sbuf *);
typedef int bus_child_pnpinfo_t (device_t parent, device_t child, struct sbuf *);
typedef int bus_get_device_path_t (device_t bus, device_t child, const char *locator, struct sbuf *sb);
#define bus_generic_get_device_path(...) EOPNOTSUPP
typedef void bus_driver_added_t (device_t dev, driver_t *driver);
struct device_method {
const char *desc;
void *const func;
};
typedef struct device_method device_method_t;
struct device {
TAILQ_HEAD(device_list, device) dev_children;
TAILQ_ENTRY(device) dev_link;
struct device *dev_parent;
const struct module_data *dev_module;
void *dev_sc;
void *dev_aux;
driver_filter_t *dev_irq_filter;
driver_intr_t *dev_irq_fn;
void *dev_irq_arg;
uint16_t dev_unit;
char dev_nameunit[64];
char dev_desc[64];
uint8_t dev_res_alloc:1;
uint8_t dev_quiet:1;
uint8_t dev_softc_set:1;
uint8_t dev_softc_alloc:1;
uint8_t dev_attached:1;
uint8_t dev_fixed_class:1;
uint8_t dev_unit_manual:1;
};
struct devclass {
device_t dev_list[DEVCLASS_MAXUNIT];
};
struct driver {
const char *name;
const struct device_method *methods;
uint32_t size;
};
struct module_data {
int (*callback) (struct module *, int, void *arg);
void *arg;
const char *bus_name;
const char *mod_name;
const char *long_name;
const struct driver *driver;
struct devclass **devclass_pp;
TAILQ_ENTRY(module_data) entry;
};
device_t device_get_parent(device_t dev);
void *device_get_method(device_t dev, const char *what);
const char *device_get_name(device_t dev);
const char *device_get_nameunit(device_t dev);
#define device_printf(dev, fmt,...) \
printf("%s: " fmt, device_get_nameunit(dev),## __VA_ARGS__)
device_t device_add_child(device_t dev, const char *name, int unit);
void device_quiet(device_t dev);
void device_set_interrupt(device_t dev, driver_filter_t *, driver_intr_t *, void *);
void device_run_interrupts(device_t parent);
void device_set_ivars(device_t dev, void *ivars);
void *device_get_ivars(device_t dev);
const char *device_get_desc(device_t dev);
int device_probe_and_attach(device_t dev);
int device_detach(device_t dev);
void *device_get_softc(device_t dev);
void device_set_softc(device_t dev, void *softc);
int device_delete_child(device_t dev, device_t child);
int device_delete_children(device_t dev);
int device_is_attached(device_t dev);
void device_set_desc(device_t dev, const char *desc);
void device_set_desc_copy(device_t dev, const char *desc);
int device_get_unit(device_t dev);
void *devclass_get_softc(devclass_t dc, int unit);
int devclass_get_maxunit(devclass_t dc);
device_t devclass_get_device(devclass_t dc, int unit);
devclass_t devclass_find(const char *classname);
#define BUS_LOCATOR_UEFI "UEFI"
#define bus_get_dma_tag(...) (NULL)
#define bus_topo_lock(...) mtx_lock(&Giant)
#define bus_topo_unlock(...) mtx_unlock(&Giant)
int bus_generic_detach(device_t dev);
int bus_generic_resume(device_t dev);
int bus_generic_shutdown(device_t dev);
int bus_generic_suspend(device_t dev);
int bus_generic_print_child(device_t dev, device_t child);
void bus_generic_driver_added(device_t dev, driver_t *driver);
int bus_space_subregion(bus_space_tag_t t, bus_space_handle_t bsh,
bus_size_t offset, bus_size_t size, bus_space_handle_t *nbshp);
/* BUS SPACE API */
void bus_space_write_1(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint8_t data);
void bus_space_write_2(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint16_t data);
void bus_space_write_4(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint32_t data);
uint8_t bus_space_read_1(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset);
uint16_t bus_space_read_2(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset);
uint32_t bus_space_read_4(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset);
void bus_space_read_multi_1(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint8_t *datap, bus_size_t count);
void bus_space_read_multi_2(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint16_t *datap, bus_size_t count);
void bus_space_read_multi_4(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint32_t *datap, bus_size_t count);
void bus_space_write_multi_1(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint8_t *datap, bus_size_t count);
void bus_space_write_multi_2(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint16_t *datap, bus_size_t count);
void bus_space_write_multi_4(bus_space_tag_t t, bus_space_handle_t h, bus_size_t offset, uint32_t *datap, bus_size_t count);
void bus_space_read_region_1(bus_space_tag_t space, bus_space_handle_t handle, bus_size_t offset, uint8_t *datap, bus_size_t count);
void bus_space_write_region_1(bus_space_tag_t space, bus_space_handle_t handle, bus_size_t offset, uint8_t *datap, bus_size_t count);
void bus_space_read_region_4(bus_space_tag_t space, bus_space_handle_t handle, bus_size_t offset, uint32_t *datap, bus_size_t count);
void bus_space_write_region_4(bus_space_tag_t space, bus_space_handle_t handle, bus_size_t offset, uint32_t *datap, bus_size_t count);
void bus_space_barrier(bus_space_tag_t space, bus_space_handle_t handle, bus_size_t offset, bus_size_t length, int flags);
void module_register(void *);
/* LIB-C */
void *memset(void *, int, size_t len);
void *memcpy(void *, const void *, size_t len);
int memcmp(const void *, const void *, size_t len);
int printf(const char *,...) __printflike(1, 2);
int snprintf(char *restrict str, size_t size, const char *restrict format,...) __printflike(3, 4);
size_t strlen(const char *s);
int strcmp(const char *, const char *);
/* MALLOC API */
#undef malloc
#define malloc(s,x,f) usb_malloc(s)
void *usb_malloc(size_t);
#undef free
#define free(p,x) usb_free(p)
void usb_free(void *);
#define strdup(p,x) usb_strdup(p)
char *usb_strdup(const char *str);
/* ENDIANNESS */
#ifndef HAVE_ENDIAN_DEFS
/* Assume little endian */
#define htole64(x) ((uint64_t)(x))
#define le64toh(x) ((uint64_t)(x))
#define htole32(x) ((uint32_t)(x))
#define le32toh(x) ((uint32_t)(x))
#define htole16(x) ((uint16_t)(x))
#define le16toh(x) ((uint16_t)(x))
#define be32toh(x) ((uint32_t)(x))
#define htobe32(x) ((uint32_t)(x))
#else
#include <sys/endian.h>
#endif
/* USB */
typedef int usb_handle_request_t (device_t dev, const void *req, void **pptr, uint16_t *plen, uint16_t offset, uint8_t *pstate);
typedef int usb_take_controller_t (device_t dev);
void usb_idle(void);
void usb_init(void);
void usb_uninit(void);
/* set some defaults */
#ifndef USB_POOL_SIZE
#define USB_POOL_SIZE (1024*1024) /* 1 MByte */
#endif
int pause(const char *, int);
void DELAY(unsigned int);
/* OTHER */
struct selinfo {
};
/* SYSTEM STARTUP API */
extern const void *sysinit_data[];
extern const void *sysuninit_data[];
/* Resources */
enum intr_type {
INTR_TYPE_TTY = 1,
INTR_TYPE_BIO = 2,
INTR_TYPE_NET = 4,
INTR_TYPE_CAM = 8,
INTR_TYPE_MISC = 16,
INTR_TYPE_CLK = 32,
INTR_TYPE_AV = 64,
INTR_EXCL = 256, /* exclusive interrupt */
INTR_MPSAFE = 512, /* this interrupt is SMP safe */
INTR_ENTROPY = 1024, /* this interrupt provides entropy */
INTR_MD1 = 4096, /* flag reserved for MD use */
INTR_MD2 = 8192, /* flag reserved for MD use */
INTR_MD3 = 16384, /* flag reserved for MD use */
INTR_MD4 = 32768 /* flag reserved for MD use */
};
struct resource_i {
u_long r_start; /* index of the first entry in this resource */
u_long r_end; /* index of the last entry (inclusive) */
};
struct resource {
struct resource_i *__r_i;
bus_space_tag_t r_bustag; /* bus_space tag */
bus_space_handle_t r_bushandle; /* bus_space handle */
};
struct resource_spec {
int type;
int rid;
int flags;
};
#define SYS_RES_IRQ 1 /* interrupt lines */
#define SYS_RES_DRQ 2 /* isa dma lines */
#define SYS_RES_MEMORY 3 /* i/o memory */
#define SYS_RES_IOPORT 4 /* i/o ports */
#define RF_ALLOCATED 0x0001 /* resource has been reserved */
#define RF_ACTIVE 0x0002 /* resource allocation has been activated */
#define RF_SHAREABLE 0x0004 /* resource permits contemporaneous sharing */
#define RF_SPARE1 0x0008
#define RF_SPARE2 0x0010
#define RF_FIRSTSHARE 0x0020 /* first in sharing list */
#define RF_PREFETCHABLE 0x0040 /* resource is prefetchable */
#define RF_OPTIONAL 0x0080 /* for bus_alloc_resources() */
int bus_alloc_resources(device_t, struct resource_spec *, struct resource **);
int bus_release_resource(device_t, int, int, struct resource *);
void bus_release_resources(device_t, const struct resource_spec *,
struct resource **);
struct resource *bus_alloc_resource_any(device_t, int, int *, unsigned int);
int bus_generic_attach(device_t);
bus_space_tag_t rman_get_bustag(struct resource *);
bus_space_handle_t rman_get_bushandle(struct resource *);
u_long rman_get_size(struct resource *);
int bus_setup_intr(device_t, struct resource *, int, driver_filter_t,
driver_intr_t, void *, void **);
int bus_teardown_intr(device_t, struct resource *, void *);
int ofw_bus_status_okay(device_t);
int ofw_bus_is_compatible(device_t, char *);
extern int (*bus_alloc_resource_any_cb)(struct resource *res, device_t dev,
int type, int *rid, unsigned int flags);
extern int (*ofw_bus_status_ok_cb)(device_t dev);
extern int (*ofw_bus_is_compatible_cb)(device_t dev, char *name);
#ifndef strlcpy
#define strlcpy(d,s,n) snprintf((d),(n),"%s",(s))
#endif
/* Should be defined in user application since it is machine-dependent */
extern int delay(unsigned int);
/* BUS dma */
#define BUS_SPACE_MAXADDR_24BIT 0xFFFFFF
#define BUS_SPACE_MAXADDR_32BIT 0xFFFFFFFF
#define BUS_SPACE_MAXADDR 0xFFFFFFFF
#define BUS_SPACE_MAXSIZE_24BIT 0xFFFFFF
#define BUS_SPACE_MAXSIZE_32BIT 0xFFFFFFFF
#define BUS_SPACE_MAXSIZE 0xFFFFFFFF
#define BUS_DMA_WAITOK 0x00 /* safe to sleep (pseudo-flag) */
#define BUS_DMA_NOWAIT 0x01 /* not safe to sleep */
#define BUS_DMA_ALLOCNOW 0x02 /* perform resource allocation now */
#define BUS_DMA_COHERENT 0x04 /* hint: map memory in a coherent way */
#define BUS_DMA_ZERO 0x08 /* allocate zero'ed memory */
#define BUS_DMA_BUS1 0x10 /* placeholders for bus functions... */
#define BUS_DMA_BUS2 0x20
#define BUS_DMA_BUS3 0x40
#define BUS_DMA_BUS4 0x80
#define BUS_DMASYNC_PREREAD 0x01
#define BUS_DMASYNC_POSTREAD 0x02
#define BUS_DMASYNC_PREWRITE 0x04
#define BUS_DMASYNC_POSTWRITE 0x08
typedef void bus_dmamap_callback_t(void *, bus_dma_segment_t *, int, int);
int
bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
bus_size_t boundary, bus_addr_t lowaddr,
bus_addr_t highaddr, bus_dma_filter_t *filter,
void *filterarg, bus_size_t maxsize, int nsegments,
bus_size_t maxsegsz, int flags, bus_dma_lock_t *lockfunc,
void *lockfuncarg, bus_dma_tag_t *dmat);
int bus_dmamem_alloc(bus_dma_tag_t, void** vaddr, int flags, bus_dmamap_t *);
void bus_dmamem_free(bus_dma_tag_t, void *vaddr, bus_dmamap_t);
int bus_dma_tag_destroy(bus_dma_tag_t);
int bus_dmamap_load(bus_dma_tag_t, bus_dmamap_t, void *buf,
bus_size_t buflen, bus_dmamap_callback_t *,
void *callback_arg, int flags);
void bus_dmamap_unload(bus_dma_tag_t, bus_dmamap_t);
void bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, int flags);
/* SBUF */
#define sbuf_printf(...) do { } while (0)
#endif /* _BSD_KERNEL_H_ */
diff --git a/stand/kshim/sysinit.h b/stand/kshim/sysinit.h
index a7a450ee4cf2..d74ab9e3af59 100644
--- a/stand/kshim/sysinit.h
+++ b/stand/kshim/sysinit.h
@@ -1,57 +1,56 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _SYSINIT_H_
#define _SYSINIT_H_
struct sysinit_data {
uint8_t b_keyword_name[64];
uint8_t b_debug_info[128];
uint8_t b_global_type[128];
uint8_t b_global_name[128];
uint8_t b_file_name[256];
uint32_t dw_endian32;
uint32_t dw_msb_value; /* must be non-zero, else entry is skipped */
uint32_t dw_lsb_value;
uint32_t dw_file_line;
} __attribute__((__packed__));
#define SYSINIT_ENTRY(uniq, keyword, msb, lsb, g_type, g_name, debug) \
static const struct sysinit_data sysinit_##uniq \
__attribute__((__section__(".debug.sysinit"), \
__used__, __aligned__(1))) = { \
.b_keyword_name = { keyword }, \
.b_debug_info = { debug }, \
.b_global_type = { g_type }, \
.b_global_name = { g_name }, \
.b_file_name = { __FILE__ }, \
.dw_endian32 = 0x76543210U, \
.dw_msb_value = (msb), \
.dw_lsb_value = (lsb), \
.dw_file_line = __LINE__ \
}
#endif /* _SYSINIT_H_ */
diff --git a/stand/libsa/bootparam.h b/stand/libsa/bootparam.h
index 9c9f50ea434d..6f0c773a0759 100644
--- a/stand/libsa/bootparam.h
+++ b/stand/libsa/bootparam.h
@@ -1,6 +1,5 @@
/* $NetBSD: bootparam.h,v 1.3 1998/01/05 19:19:41 perry Exp $ */
-/* $FreeBSD$ */
int bp_whoami(int sock);
int bp_getfile(int sock, char *key, struct in_addr *addrp, char *path);
diff --git a/stand/libsa/crc32_libkern.c b/stand/libsa/crc32_libkern.c
index d2bd738d4c20..bf9a20f82a47 100644
--- a/stand/libsa/crc32_libkern.c
+++ b/stand/libsa/crc32_libkern.c
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
#include "../../sys/libkern/gsb_crc32.c"
diff --git a/stand/libsa/netif.h b/stand/libsa/netif.h
index 44165ab0d88a..74b41c75666c 100644
--- a/stand/libsa/netif.h
+++ b/stand/libsa/netif.h
@@ -1,65 +1,64 @@
/* $NetBSD: netif.h,v 1.4 1995/09/14 23:45:30 pk Exp $ */
-/* $FreeBSD$ */
#ifndef __SYS_LIBNETBOOT_NETIF_H
#define __SYS_LIBNETBOOT_NETIF_H
#include "iodesc.h"
struct netif_driver {
const char *netif_bname;
int (*netif_match)(struct netif *, void *);
int (*netif_probe)(struct netif *, void *);
void (*netif_init)(struct iodesc *, void *);
ssize_t (*netif_get)(struct iodesc *, void **, time_t);
ssize_t (*netif_put)(struct iodesc *, void *, size_t);
void (*netif_end)(struct netif *);
struct netif_dif *netif_ifs;
int netif_nifs;
};
struct netif_dif {
int dif_unit;
int dif_nsel;
struct netif_stats *dif_stats;
void *dif_private;
/* the following fields are used internally by the netif layer */
u_long dif_used;
};
struct netif_stats {
int collisions;
int collision_error;
int missed;
int sent;
int received;
int deferred;
int overflow;
};
struct netif {
struct netif_driver *nif_driver;
int nif_unit;
int nif_sel;
void *nif_devdata;
};
extern struct netif_driver *netif_drivers[]; /* machdep */
extern int n_netif_drivers;
extern int netif_debug;
void netif_init(void);
struct netif *netif_select(void *);
int netif_probe(struct netif *, void *);
void netif_attach(struct netif *, struct iodesc *, void *);
void netif_detach(struct netif *);
ssize_t netif_get(struct iodesc *, void **, time_t);
ssize_t netif_put(struct iodesc *, void *, size_t);
int netif_open(void *);
int netif_close(int);
struct iodesc *socktodesc(int);
#endif /* __SYS_LIBNETBOOT_NETIF_H */
diff --git a/stand/libsa/nfsv2.h b/stand/libsa/nfsv2.h
index 09b2428b8012..165517760eca 100644
--- a/stand/libsa/nfsv2.h
+++ b/stand/libsa/nfsv2.h
@@ -1,121 +1,120 @@
-/* $FreeBSD$ */
/* $NetBSD: nfsv2.h,v 1.2 1996/02/26 23:05:23 gwr Exp $ */
/*
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Rick Macklem at The University of Guelph.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)nfsv2.h 8.1 (Berkeley) 6/10/93
*/
/*
* nfs definitions as per the version 2 specs
*/
/*
* Constants as defined in the Sun NFS Version 2 spec.
* "NFS: Network File System Protocol Specification" RFC1094
*/
#define NFS_PORT 2049
#define NFS_PROG 100003
#define NFS_VER2 2
#define NFS_MAXDGRAMDATA 8192
#define NFS_MAXDATA 32768
#define NFS_MAXPATHLEN 1024
#define NFS_MAXNAMLEN 255
#define NFS_FHSIZE 32
#define NFS_MAXPKTHDR 404
#define NFS_MAXPACKET (NFS_MAXPKTHDR+NFS_MAXDATA)
#define NFS_MINPACKET 20
#define NFS_FABLKSIZE 512 /* Size in bytes of a block wrt fa_blocks */
#define NFS_READDIRSIZE 1024
/* Stat numbers for rpc returns */
#define NFS_OK 0
#define NFSERR_PERM 1
#define NFSERR_NOENT 2
#define NFSERR_IO 5
#define NFSERR_NXIO 6
#define NFSERR_ACCES 13
#define NFSERR_EXIST 17
#define NFSERR_NODEV 19
#define NFSERR_NOTDIR 20
#define NFSERR_ISDIR 21
#define NFSERR_FBIG 27
#define NFSERR_NOSPC 28
#define NFSERR_ROFS 30
#define NFSERR_NAMETOL 63
#define NFSERR_NOTEMPTY 66
#define NFSERR_DQUOT 69
#define NFSERR_STALE 70
#define NFSERR_WFLUSH 99
/* Sizes in bytes of various nfs rpc components */
#define NFSX_FH 32
#define NFSX_UNSIGNED 4
#define NFSX_FATTR 68
#define NFSX_SATTR 32
#define NFSX_STATFS 20
#define NFSX_COOKIE 4
/* nfs rpc procedure numbers */
#define NFSPROC_NULL 0
#define NFSPROC_GETATTR 1
#define NFSPROC_SETATTR 2
#define NFSPROC_NOOP 3
#define NFSPROC_ROOT NFSPROC_NOOP /* Obsolete */
#define NFSPROC_LOOKUP 4
#define NFSPROC_READLINK 5
#define NFSPROC_READ 6
#define NFSPROC_WRITECACHE NFSPROC_NOOP /* Obsolete */
#define NFSPROC_WRITE 8
#define NFSPROC_CREATE 9
#define NFSPROC_REMOVE 10
#define NFSPROC_RENAME 11
#define NFSPROC_LINK 12
#define NFSPROC_SYMLINK 13
#define NFSPROC_MKDIR 14
#define NFSPROC_RMDIR 15
#define NFSPROC_READDIR 16
#define NFSPROC_STATFS 17
#define NFS_NPROCS 18
/* File types */
typedef enum {
NFNON=0,
NFREG=1,
NFDIR=2,
NFBLK=3,
NFCHR=4,
NFLNK=5
} nfstype;
diff --git a/stand/libsa/powerpc/_setjmp.S b/stand/libsa/powerpc/_setjmp.S
index c36f2e6a6b87..a47920380a23 100644
--- a/stand/libsa/powerpc/_setjmp.S
+++ b/stand/libsa/powerpc/_setjmp.S
@@ -1,119 +1,118 @@
-/* $FreeBSD$ */
/* from: NetBSD: setjmp.S,v 1.1 1998/01/27 15:13:12 sakamoto Exp $ */
/* from: OpenBSD: setjmp.S,v 1.2 1996/12/28 06:22:18 rahnds Exp */
/* kernel version of this file, does not have signal goop */
/* int setjmp(jmp_buf env) */
#include <machine/asm.h>
#ifdef __powerpc64__
#define LD_REG ld
#define ST_REG std
#define REGWIDTH 8
#else
#define LD_REG lwz
#define ST_REG stw
#define REGWIDTH 4
#endif
#define JMP_r1 1*REGWIDTH
#define JMP_r2 2*REGWIDTH
#define JMP_r14 3*REGWIDTH
#define JMP_r15 4*REGWIDTH
#define JMP_r16 5*REGWIDTH
#define JMP_r17 6*REGWIDTH
#define JMP_r18 7*REGWIDTH
#define JMP_r19 8*REGWIDTH
#define JMP_r20 9*REGWIDTH
#define JMP_r21 10*REGWIDTH
#define JMP_r22 11*REGWIDTH
#define JMP_r23 12*REGWIDTH
#define JMP_r24 13*REGWIDTH
#define JMP_r25 14*REGWIDTH
#define JMP_r26 15*REGWIDTH
#define JMP_r27 16*REGWIDTH
#define JMP_r28 17*REGWIDTH
#define JMP_r29 18*REGWIDTH
#define JMP_r30 19*REGWIDTH
#define JMP_r31 20*REGWIDTH
#define JMP_lr 21*REGWIDTH
#define JMP_cr 22*REGWIDTH
#define JMP_ctr 23*REGWIDTH
#define JMP_xer 24*REGWIDTH
#define JMP_sig 25*REGWIDTH
ASENTRY_NOPROF(_setjmp)
ST_REG 31, JMP_r31(3)
/* r1, r2, r14-r30 */
ST_REG 1, JMP_r1 (3)
ST_REG 2, JMP_r2 (3)
ST_REG 14, JMP_r14(3)
ST_REG 15, JMP_r15(3)
ST_REG 16, JMP_r16(3)
ST_REG 17, JMP_r17(3)
ST_REG 18, JMP_r18(3)
ST_REG 19, JMP_r19(3)
ST_REG 20, JMP_r20(3)
ST_REG 21, JMP_r21(3)
ST_REG 22, JMP_r22(3)
ST_REG 23, JMP_r23(3)
ST_REG 24, JMP_r24(3)
ST_REG 25, JMP_r25(3)
ST_REG 26, JMP_r26(3)
ST_REG 27, JMP_r27(3)
ST_REG 28, JMP_r28(3)
ST_REG 29, JMP_r29(3)
ST_REG 30, JMP_r30(3)
/* cr, lr, ctr, xer */
mfcr 0
ST_REG 0, JMP_cr(3)
mflr 0
ST_REG 0, JMP_lr(3)
mfctr 0
ST_REG 0, JMP_ctr(3)
mfxer 0
ST_REG 0, JMP_xer(3)
/* f14-f31, fpscr */
li 3, 0
blr
ASEND(_setjmp)
.extern sigsetmask
ASENTRY_NOPROF(_longjmp)
LD_REG 31, JMP_r31(3)
/* r1, r2, r14-r30 */
LD_REG 1, JMP_r1 (3)
LD_REG 2, JMP_r2 (3)
LD_REG 14, JMP_r14(3)
LD_REG 15, JMP_r15(3)
LD_REG 16, JMP_r16(3)
LD_REG 17, JMP_r17(3)
LD_REG 18, JMP_r18(3)
LD_REG 19, JMP_r19(3)
LD_REG 20, JMP_r20(3)
LD_REG 21, JMP_r21(3)
LD_REG 22, JMP_r22(3)
LD_REG 23, JMP_r23(3)
LD_REG 24, JMP_r24(3)
LD_REG 25, JMP_r25(3)
LD_REG 26, JMP_r26(3)
LD_REG 27, JMP_r27(3)
LD_REG 28, JMP_r28(3)
LD_REG 29, JMP_r29(3)
LD_REG 30, JMP_r30(3)
/* cr, lr, ctr, xer */
LD_REG 0, JMP_cr(3)
mtcr 0
LD_REG 0, JMP_lr(3)
mtlr 0
LD_REG 0, JMP_ctr(3)
mtctr 0
LD_REG 0, JMP_xer(3)
mtxer 0
/* f14-f31, fpscr */
mr 3, 4
blr
ASEND(_longjmp)
.section .note.GNU-stack,"",%progbits
diff --git a/stand/powerpc/ofw/ldscript.powerpc b/stand/powerpc/ofw/ldscript.powerpc
index 9202eff286b2..1c023ce6ade6 100644
--- a/stand/powerpc/ofw/ldscript.powerpc
+++ b/stand/powerpc/ofw/ldscript.powerpc
@@ -1,143 +1,142 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf32-powerpc-freebsd", "elf32-powerpc-freebsd",
"elf32-powerpc-freebsd")
OUTPUT_ARCH(powerpc:common)
ENTRY(_start)
SEARCH_DIR(/usr/lib);
PROVIDE (__stack = 0);
PHDRS
{
text PT_LOAD;
}
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0x02c00000 + SIZEOF_HEADERS;
.interp : { *(.interp) } :text
.hash : { *(.hash) }
.dynsym : { *(.dynsym) }
.dynstr : { *(.dynstr) }
.gnu.version : { *(.gnu.version) }
.gnu.version_d : { *(.gnu.version_d) }
.gnu.version_r : { *(.gnu.version_r) }
.rela.text :
{ *(.rela.text) *(.rela.gnu.linkonce.t*) }
.rela.data :
{ *(.rela.data) *(.rela.gnu.linkonce.d*) }
.rela.rodata :
{ *(.rela.rodata) *(.rela.gnu.linkonce.r*) }
.rela.got : { *(.rela.got) }
.rela.got1 : { *(.rela.got1) }
.rela.got2 : { *(.rela.got2) }
.rela.ctors : { *(.rela.ctors) }
.rela.dtors : { *(.rela.dtors) }
.rela.init : { *(.rela.init) }
.rela.fini : { *(.rela.fini) }
.rela.bss : { *(.rela.bss) }
.rela.plt : { *(.rela.plt) }
.rela.sdata : { *(.rela.sdata) }
.rela.sbss : { *(.rela.sbss) }
.rela.sdata2 : { *(.rela.sdata2) }
.rela.sbss2 : { *(.rela.sbss2) }
.text :
{
*(.text)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.gnu.linkonce.t*)
} =0
_etext = .;
PROVIDE (etext = .);
.init : { *(.init) } =0
.fini : { *(.fini) } =0
.rodata : { *(.rodata) *(.gnu.linkonce.r*) }
.rodata1 : { *(.rodata1) }
.sdata2 : { *(.sdata2) }
.sbss2 : { *(.sbss2) }
/* Adjust the address for the data segment to the next page up. */
. = ((. + 0x1000) & ~(0x1000 - 1));
.data.rel.ro : { *(.data.rel.ro*) }
.data :
{
*(.data)
*(.gnu.linkonce.d*)
CONSTRUCTORS
}
.data1 : { *(.data1) }
.got1 : { *(.got1) }
.dynamic : { *(.dynamic) }
/* Put .ctors and .dtors next to the .got2 section, so that the pointers
get relocated with -mrelocatable. Also put in the .fixup pointers.
The current compiler no longer needs this, but keep it around for 2.7.2 */
PROVIDE (_GOT2_START_ = .);
.got2 : { *(.got2) }
PROVIDE (__CTOR_LIST__ = .);
.ctors : { *(.ctors) }
PROVIDE (__CTOR_END__ = .);
PROVIDE (__DTOR_LIST__ = .);
.dtors : { *(.dtors) }
PROVIDE (__DTOR_END__ = .);
PROVIDE (_FIXUP_START_ = .);
.fixup : { *(.fixup) }
PROVIDE (_FIXUP_END_ = .);
PROVIDE (_GOT2_END_ = .);
PROVIDE (_GOT_START_ = .);
.got : { *(.got) }
.got.plt : { *(.got.plt) }
PROVIDE (_GOT_END_ = .);
/* We want the small data sections together, so single-instruction offsets
can access them all, and initialized data all before uninitialized, so
we can shorten the on-disk segment size. */
.sdata : { *(.sdata) }
_edata = .;
PROVIDE (edata = .);
.sbss :
{
PROVIDE (__sbss_start = .);
*(.sbss)
*(.scommon)
*(.dynsbss)
PROVIDE (__sbss_end = .);
}
.plt : { *(.plt) }
.bss :
{
PROVIDE (__bss_start = .);
*(.dynbss)
*(.bss)
*(COMMON)
}
_end = . ;
PROVIDE (end = .);
/* Stabs debugging sections. */
.stab 0 : { *(.stab) }
.stabstr 0 : { *(.stabstr) }
/* DWARF debug sections.
Symbols in the DWARF debugging sections are relative to the beginning
of the section so we begin them at 0. */
/* DWARF 1 */
.debug 0 : { *(.debug) }
.line 0 : { *(.line) }
/* GNU DWARF 1 extensions */
.debug_srcinfo 0 : { *(.debug_srcinfo) }
.debug_sfnames 0 : { *(.debug_sfnames) }
/* DWARF 1.1 and DWARF 2 */
.debug_aranges 0 : { *(.debug_aranges) }
.debug_pubnames 0 : { *(.debug_pubnames) }
/* DWARF 2 */
.debug_info 0 : { *(.debug_info) }
.debug_abbrev 0 : { *(.debug_abbrev) }
.debug_line 0 : { *(.debug_line) }
.debug_frame 0 : { *(.debug_frame) }
.debug_str 0 : { *(.debug_str) }
.debug_loc 0 : { *(.debug_loc) }
.debug_macinfo 0 : { *(.debug_macinfo) }
/* SGI/MIPS DWARF 2 extensions */
.debug_weaknames 0 : { *(.debug_weaknames) }
.debug_funcnames 0 : { *(.debug_funcnames) }
.debug_typenames 0 : { *(.debug_typenames) }
.debug_varnames 0 : { *(.debug_varnames) }
/* These must appear regardless of . */
}
diff --git a/stand/powerpc/ofw/ldscript.powerpcle b/stand/powerpc/ofw/ldscript.powerpcle
index 47fe96e0233f..946e3dd48ae9 100644
--- a/stand/powerpc/ofw/ldscript.powerpcle
+++ b/stand/powerpc/ofw/ldscript.powerpcle
@@ -1,143 +1,142 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf32-powerpcle-freebsd", "elf32-powerpcle-freebsd",
"elf32-powerpcle-freebsd")
OUTPUT_ARCH(powerpcle:common)
ENTRY(_start)
SEARCH_DIR(/usr/lib);
PROVIDE (__stack = 0);
PHDRS
{
text PT_LOAD;
}
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0x02c00000 + SIZEOF_HEADERS;
.interp : { *(.interp) } :text
.hash : { *(.hash) }
.dynsym : { *(.dynsym) }
.dynstr : { *(.dynstr) }
.gnu.version : { *(.gnu.version) }
.gnu.version_d : { *(.gnu.version_d) }
.gnu.version_r : { *(.gnu.version_r) }
.rela.text :
{ *(.rela.text) *(.rela.gnu.linkonce.t*) }
.rela.data :
{ *(.rela.data) *(.rela.gnu.linkonce.d*) }
.rela.rodata :
{ *(.rela.rodata) *(.rela.gnu.linkonce.r*) }
.rela.got : { *(.rela.got) }
.rela.got1 : { *(.rela.got1) }
.rela.got2 : { *(.rela.got2) }
.rela.ctors : { *(.rela.ctors) }
.rela.dtors : { *(.rela.dtors) }
.rela.init : { *(.rela.init) }
.rela.fini : { *(.rela.fini) }
.rela.bss : { *(.rela.bss) }
.rela.plt : { *(.rela.plt) }
.rela.sdata : { *(.rela.sdata) }
.rela.sbss : { *(.rela.sbss) }
.rela.sdata2 : { *(.rela.sdata2) }
.rela.sbss2 : { *(.rela.sbss2) }
.text :
{
*(.text)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.gnu.linkonce.t*)
} =0
_etext = .;
PROVIDE (etext = .);
.init : { *(.init) } =0
.fini : { *(.fini) } =0
.rodata : { *(.rodata) *(.gnu.linkonce.r*) }
.rodata1 : { *(.rodata1) }
.sdata2 : { *(.sdata2) }
.sbss2 : { *(.sbss2) }
/* Adjust the address for the data segment to the next page up. */
. = ((. + 0x1000) & ~(0x1000 - 1));
.data.rel.ro : { *(.data.rel.ro*) }
.data :
{
*(.data)
*(.gnu.linkonce.d*)
CONSTRUCTORS
}
.data1 : { *(.data1) }
.got1 : { *(.got1) }
.dynamic : { *(.dynamic) }
/* Put .ctors and .dtors next to the .got2 section, so that the pointers
get relocated with -mrelocatable. Also put in the .fixup pointers.
The current compiler no longer needs this, but keep it around for 2.7.2 */
PROVIDE (_GOT2_START_ = .);
.got2 : { *(.got2) }
PROVIDE (__CTOR_LIST__ = .);
.ctors : { *(.ctors) }
PROVIDE (__CTOR_END__ = .);
PROVIDE (__DTOR_LIST__ = .);
.dtors : { *(.dtors) }
PROVIDE (__DTOR_END__ = .);
PROVIDE (_FIXUP_START_ = .);
.fixup : { *(.fixup) }
PROVIDE (_FIXUP_END_ = .);
PROVIDE (_GOT2_END_ = .);
PROVIDE (_GOT_START_ = .);
.got : { *(.got) }
.got.plt : { *(.got.plt) }
PROVIDE (_GOT_END_ = .);
/* We want the small data sections together, so single-instruction offsets
can access them all, and initialized data all before uninitialized, so
we can shorten the on-disk segment size. */
.sdata : { *(.sdata) }
_edata = .;
PROVIDE (edata = .);
.sbss :
{
PROVIDE (__sbss_start = .);
*(.sbss)
*(.scommon)
*(.dynsbss)
PROVIDE (__sbss_end = .);
}
.plt : { *(.plt) }
.bss :
{
PROVIDE (__bss_start = .);
*(.dynbss)
*(.bss)
*(COMMON)
}
_end = . ;
PROVIDE (end = .);
/* Stabs debugging sections. */
.stab 0 : { *(.stab) }
.stabstr 0 : { *(.stabstr) }
/* DWARF debug sections.
Symbols in the DWARF debugging sections are relative to the beginning
of the section so we begin them at 0. */
/* DWARF 1 */
.debug 0 : { *(.debug) }
.line 0 : { *(.line) }
/* GNU DWARF 1 extensions */
.debug_srcinfo 0 : { *(.debug_srcinfo) }
.debug_sfnames 0 : { *(.debug_sfnames) }
/* DWARF 1.1 and DWARF 2 */
.debug_aranges 0 : { *(.debug_aranges) }
.debug_pubnames 0 : { *(.debug_pubnames) }
/* DWARF 2 */
.debug_info 0 : { *(.debug_info) }
.debug_abbrev 0 : { *(.debug_abbrev) }
.debug_line 0 : { *(.debug_line) }
.debug_frame 0 : { *(.debug_frame) }
.debug_str 0 : { *(.debug_str) }
.debug_loc 0 : { *(.debug_loc) }
.debug_macinfo 0 : { *(.debug_macinfo) }
/* SGI/MIPS DWARF 2 extensions */
.debug_weaknames 0 : { *(.debug_weaknames) }
.debug_funcnames 0 : { *(.debug_funcnames) }
.debug_typenames 0 : { *(.debug_typenames) }
.debug_varnames 0 : { *(.debug_varnames) }
/* These must appear regardless of . */
}
diff --git a/stand/uboot/arch/arm/ldscript.arm b/stand/uboot/arch/arm/ldscript.arm
index b768e00f39a3..3ab3d165cde2 100644
--- a/stand/uboot/arch/arm/ldscript.arm
+++ b/stand/uboot/arch/arm/ldscript.arm
@@ -1,134 +1,133 @@
-/* $FreeBSD$ */
OUTPUT_ARCH(arm)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = UBLDR_LOADADDR + SIZEOF_HEADERS;
. = ALIGN(8);
.text :
{
*(.text)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.gnu.linkonce.t*)
} =0
_etext = .;
PROVIDE (etext = .);
.interp : { *(.interp) }
.hash : { *(.hash) }
.dynsym : { *(.dynsym) }
.dynstr : { *(.dynstr) }
.gnu.version : { *(.gnu.version) }
.gnu.version_d : { *(.gnu.version_d) }
.gnu.version_r : { *(.gnu.version_r) }
.rela.text :
{ *(.rela.text) *(.rela.gnu.linkonce.t*) }
.rela.data :
{ *(.rela.data) *(.rela.gnu.linkonce.d*) }
.rela.rodata :
{ *(.rela.rodata) *(.rela.gnu.linkonce.r*) }
.rela.got : { *(.rela.got) }
.rela.got1 : { *(.rela.got1) }
.rela.got2 : { *(.rela.got2) }
.dynamic : { *(.dynamic) }
PROVIDE (_GOT_START_ = .);
.got : { *(.got) }
.got.plt : { *(.got.plt) }
PROVIDE (_GOT_END_ = .);
.rela.ctors : { *(.rela.ctors) }
.rela.dtors : { *(.rela.dtors) }
.rela.init : { *(.rela.init) }
.rela.fini : { *(.rela.fini) }
.rela.bss : { *(.rela.bss) }
.rela.plt : { *(.rela.plt) }
.rela.sdata : { *(.rela.sdata) }
.rela.sbss : { *(.rela.sbss) }
.rela.sdata2 : { *(.rela.sdata2) }
.rela.sbss2 : { *(.rela.sbss2) }
.init : { *(.init) } =0
.fini : { *(.fini) } =0
.rodata : { *(.rodata) *(.gnu.linkonce.r*) }
.rodata1 : { *(.rodata1) }
.sdata2 : { *(.sdata2) }
.sbss2 : { *(.sbss2) }
/* Adjust the address for the data segment to the doubleword boundary. */
. = ALIGN(8);
.data :
{
*(.data)
*(.gnu.linkonce.d*)
CONSTRUCTORS
}
.data1 : { *(.data1) }
.got1 : { *(.got1) }
/* Put .ctors and .dtors next to the .got2 section, so that the pointers
get relocated with -mrelocatable. Also put in the .fixup pointers.
The current compiler no longer needs this, but keep it around for 2.7.2 */
PROVIDE (_GOT2_START_ = .);
.got2 : { *(.got2) }
PROVIDE (__CTOR_LIST__ = .);
.ctors : { *(.ctors) }
PROVIDE (__CTOR_END__ = .);
PROVIDE (__DTOR_LIST__ = .);
.dtors : { *(.dtors) }
PROVIDE (__DTOR_END__ = .);
PROVIDE (_FIXUP_START_ = .);
.fixup : { *(.fixup) }
PROVIDE (_FIXUP_END_ = .);
PROVIDE (_GOT2_END_ = .);
/* We want the small data sections together, so single-instruction offsets
can access them all, and initialized data all before uninitialized, so
we can shorten the on-disk segment size. */
.sdata : { *(.sdata) }
_edata = .;
PROVIDE (edata = .);
.sbss :
{
PROVIDE (__sbss_start = .);
*(.sbss)
*(.scommon)
*(.dynsbss)
PROVIDE (__sbss_end = .);
}
.plt : { *(.plt) }
.bss :
{
PROVIDE (__bss_start = .);
*(.dynbss)
*(.bss)
*(COMMON)
}
_end = . ;
PROVIDE (end = .);
/* Stabs debugging sections. */
.stab 0 : { *(.stab) }
.stabstr 0 : { *(.stabstr) }
/* DWARF debug sections.
Symbols in the DWARF debugging sections are relative to the beginning
of the section so we begin them at 0. */
/* DWARF 1 */
.debug 0 : { *(.debug) }
.line 0 : { *(.line) }
/* GNU DWARF 1 extensions */
.debug_srcinfo 0 : { *(.debug_srcinfo) }
.debug_sfnames 0 : { *(.debug_sfnames) }
/* DWARF 1.1 and DWARF 2 */
.debug_aranges 0 : { *(.debug_aranges) }
.debug_pubnames 0 : { *(.debug_pubnames) }
/* DWARF 2 */
.debug_info 0 : { *(.debug_info) }
.debug_abbrev 0 : { *(.debug_abbrev) }
.debug_line 0 : { *(.debug_line) }
.debug_frame 0 : { *(.debug_frame) }
.debug_str 0 : { *(.debug_str) }
.debug_loc 0 : { *(.debug_loc) }
.debug_macinfo 0 : { *(.debug_macinfo) }
/* SGI/MIPS DWARF 2 extensions */
.debug_weaknames 0 : { *(.debug_weaknames) }
.debug_funcnames 0 : { *(.debug_funcnames) }
.debug_typenames 0 : { *(.debug_typenames) }
.debug_varnames 0 : { *(.debug_varnames) }
/* These must appear regardless of . */
}
diff --git a/stand/uboot/arch/mips/ldscript.mips b/stand/uboot/arch/mips/ldscript.mips
index 815dabc74587..44bb1a0b2c9a 100644
--- a/stand/uboot/arch/mips/ldscript.mips
+++ b/stand/uboot/arch/mips/ldscript.mips
@@ -1,134 +1,133 @@
-/* $FreeBSD$ */
OUTPUT_ARCH(mips)
ENTRY(_start)
SECTIONS
{
/* Read-only sections, merged into text segment: */
/*. = UBLDR_LOADADDR + SIZEOF_HEADERS;*/
. = UBLDR_LOADADDR;
.text :
{
start.o(.text*)
*(EXCLUDE_FILE (start.o) .text*)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.gnu.linkonce.t*)
} =0
_etext = .;
PROVIDE (etext = .);
.interp : { *(.interp) }
.hash : { *(.hash) }
.dynsym : { *(.dynsym) }
.dynstr : { *(.dynstr) }
.gnu.version : { *(.gnu.version) }
.gnu.version_d : { *(.gnu.version_d) }
.gnu.version_r : { *(.gnu.version_r) }
.rela.text :
{ *(.rela.text) *(.rela.gnu.linkonce.t*) }
.rela.data :
{ *(.rela.data) *(.rela.gnu.linkonce.d*) }
.rela.rodata :
{ *(.rela.rodata) *(.rela.gnu.linkonce.r*) }
.rela.got : { *(.rela.got) }
.rela.got1 : { *(.rela.got1) }
.rela.got2 : { *(.rela.got2) }
.rela.ctors : { *(.rela.ctors) }
.rela.dtors : { *(.rela.dtors) }
.rela.init : { *(.rela.init) }
.rela.fini : { *(.rela.fini) }
.rela.bss : { *(.rela.bss) }
.rela.plt : { *(.rela.plt) }
.rela.sdata : { *(.rela.sdata) }
.rela.sbss : { *(.rela.sbss) }
.rela.sdata2 : { *(.rela.sdata2) }
.rela.sbss2 : { *(.rela.sbss2) }
.init : { *(.init) } =0
.fini : { *(.fini) } =0
.rodata : { *(.rodata) *(.gnu.linkonce.r*) }
.rodata1 : { *(.rodata1) }
.sdata2 : { *(.sdata2) }
.sbss2 : { *(.sbss2) }
/* Adjust the address for the data segment to the next page up. */
. = ((. + 0x1000) & ~(0x1000 - 1));
.data :
{
*(.data)
*(.gnu.linkonce.d*)
}
.data1 : { *(.data1) }
.got1 : { *(.got1) }
.dynamic : { *(.dynamic) }
/* Put .ctors and .dtors next to the .got2 section, so that the pointers
get relocated with -mrelocatable. Also put in the .fixup pointers.
The current compiler no longer needs this, but keep it around for 2.7.2 */
PROVIDE (_GOT2_START_ = .);
.got2 : { *(.got2) }
PROVIDE (__CTOR_LIST__ = .);
.ctors : { *(.ctors) }
PROVIDE (__CTOR_END__ = .);
PROVIDE (__DTOR_LIST__ = .);
.dtors : { *(.dtors) }
PROVIDE (__DTOR_END__ = .);
PROVIDE (_FIXUP_START_ = .);
.fixup : { *(.fixup) }
PROVIDE (_FIXUP_END_ = .);
PROVIDE (_GOT2_END_ = .);
PROVIDE (_GOT_START_ = .);
.got : { *(.got) }
.got.plt : { *(.got.plt) }
PROVIDE (_GOT_END_ = .);
/* We want the small data sections together, so single-instruction offsets
can access them all, and initialized data all before uninitialized, so
we can shorten the on-disk segment size. */
.sdata : { *(.sdata) }
_edata = .;
PROVIDE (edata = .);
.sbss :
{
PROVIDE (__sbss_start = .);
*(.sbss)
*(.scommon)
*(.dynsbss)
PROVIDE (__sbss_end = .);
}
.plt : { *(.plt) }
.bss :
{
PROVIDE (__bss_start = .);
*(.dynbss)
*(.bss)
*(COMMON)
}
_end = . ;
PROVIDE (end = .);
/* Stabs debugging sections. */
.stab 0 : { *(.stab) }
.stabstr 0 : { *(.stabstr) }
/* DWARF debug sections.
Symbols in the DWARF debugging sections are relative to the beginning
of the section so we begin them at 0. */
/* DWARF 1 */
.debug 0 : { *(.debug) }
.line 0 : { *(.line) }
/* GNU DWARF 1 extensions */
.debug_srcinfo 0 : { *(.debug_srcinfo) }
.debug_sfnames 0 : { *(.debug_sfnames) }
/* DWARF 1.1 and DWARF 2 */
.debug_aranges 0 : { *(.debug_aranges) }
.debug_pubnames 0 : { *(.debug_pubnames) }
/* DWARF 2 */
.debug_info 0 : { *(.debug_info) }
.debug_abbrev 0 : { *(.debug_abbrev) }
.debug_line 0 : { *(.debug_line) }
.debug_frame 0 : { *(.debug_frame) }
.debug_str 0 : { *(.debug_str) }
.debug_loc 0 : { *(.debug_loc) }
.debug_macinfo 0 : { *(.debug_macinfo) }
/* SGI/MIPS DWARF 2 extensions */
.debug_weaknames 0 : { *(.debug_weaknames) }
.debug_funcnames 0 : { *(.debug_funcnames) }
.debug_typenames 0 : { *(.debug_typenames) }
.debug_varnames 0 : { *(.debug_varnames) }
/* These must appear regardless of . */
}
diff --git a/stand/uboot/arch/powerpc/ldscript.powerpc b/stand/uboot/arch/powerpc/ldscript.powerpc
index 923838365793..7f33129a7b59 100644
--- a/stand/uboot/arch/powerpc/ldscript.powerpc
+++ b/stand/uboot/arch/powerpc/ldscript.powerpc
@@ -1,138 +1,137 @@
-/* $FreeBSD$ */
OUTPUT_FORMAT("elf32-powerpc-freebsd", "elf32-powerpc-freebsd",
"elf32-powerpc-freebsd")
OUTPUT_ARCH(powerpc:common)
ENTRY(_start)
SEARCH_DIR(/usr/lib);
PROVIDE (__stack = 0);
SECTIONS
{
/* Read-only sections, merged into text segment: */
. = 0x00010000 + SIZEOF_HEADERS;
.interp : { *(.interp) }
.hash : { *(.hash) }
.dynsym : { *(.dynsym) }
.dynstr : { *(.dynstr) }
.gnu.version : { *(.gnu.version) }
.gnu.version_d : { *(.gnu.version_d) }
.gnu.version_r : { *(.gnu.version_r) }
.rela.text :
{ *(.rela.text) *(.rela.gnu.linkonce.t*) }
.rela.data :
{ *(.rela.data) *(.rela.gnu.linkonce.d*) }
.rela.rodata :
{ *(.rela.rodata) *(.rela.gnu.linkonce.r*) }
.rela.got : { *(.rela.got) }
.rela.got1 : { *(.rela.got1) }
.rela.got2 : { *(.rela.got2) }
.rela.ctors : { *(.rela.ctors) }
.rela.dtors : { *(.rela.dtors) }
.rela.init : { *(.rela.init) }
.rela.fini : { *(.rela.fini) }
.rela.bss : { *(.rela.bss) }
.rela.plt : { *(.rela.plt) }
.rela.sdata : { *(.rela.sdata) }
.rela.sbss : { *(.rela.sbss) }
.rela.sdata2 : { *(.rela.sdata2) }
.rela.sbss2 : { *(.rela.sbss2) }
.text :
{
*(.text)
/* .gnu.warning sections are handled specially by elf32.em. */
*(.gnu.warning)
*(.gnu.linkonce.t*)
} =0
_etext = .;
PROVIDE (etext = .);
.init : { *(.init) } =0
.fini : { *(.fini) } =0
.rodata : { *(.rodata) *(.gnu.linkonce.r*) }
.rodata1 : { *(.rodata1) }
.sdata2 : { *(.sdata2) }
.sbss2 : { *(.sbss2) }
/* Adjust the address for the data segment to the next page up. */
. = ((. + 0x1000) & ~(0x1000 - 1));
.data :
{
*(.data)
*(.gnu.linkonce.d*)
CONSTRUCTORS
}
.data1 : { *(.data1) }
.got1 : { *(.got1) }
.dynamic : { *(.dynamic) }
/* Put .ctors and .dtors next to the .got2 section, so that the pointers
get relocated with -mrelocatable. Also put in the .fixup pointers.
The current compiler no longer needs this, but keep it around for 2.7.2 */
PROVIDE (_GOT2_START_ = .);
.got2 : { *(.got2) }
PROVIDE (__CTOR_LIST__ = .);
.ctors : { *(.ctors) }
PROVIDE (__CTOR_END__ = .);
PROVIDE (__DTOR_LIST__ = .);
.dtors : { *(.dtors) }
PROVIDE (__DTOR_END__ = .);
PROVIDE (_FIXUP_START_ = .);
.fixup : { *(.fixup) }
PROVIDE (_FIXUP_END_ = .);
PROVIDE (_GOT2_END_ = .);
PROVIDE (_GOT_START_ = .);
.got : { *(.got) }
.got.plt : { *(.got.plt) }
PROVIDE (_GOT_END_ = .);
/* We want the small data sections together, so single-instruction offsets
can access them all, and initialized data all before uninitialized, so
we can shorten the on-disk segment size. */
.sdata : { *(.sdata) }
_edata = .;
PROVIDE (edata = .);
.sbss :
{
PROVIDE (__sbss_start = .);
*(.sbss)
*(.scommon)
*(.dynsbss)
PROVIDE (__sbss_end = .);
}
.plt : { *(.plt) }
.bss :
{
PROVIDE (__bss_start = .);
*(.dynbss)
*(.bss)
*(COMMON)
}
_end = . ;
PROVIDE (end = .);
/* Stabs debugging sections. */
.stab 0 : { *(.stab) }
.stabstr 0 : { *(.stabstr) }
/* DWARF debug sections.
Symbols in the DWARF debugging sections are relative to the beginning
of the section so we begin them at 0. */
/* DWARF 1 */
.debug 0 : { *(.debug) }
.line 0 : { *(.line) }
/* GNU DWARF 1 extensions */
.debug_srcinfo 0 : { *(.debug_srcinfo) }
.debug_sfnames 0 : { *(.debug_sfnames) }
/* DWARF 1.1 and DWARF 2 */
.debug_aranges 0 : { *(.debug_aranges) }
.debug_pubnames 0 : { *(.debug_pubnames) }
/* DWARF 2 */
.debug_info 0 : { *(.debug_info) }
.debug_abbrev 0 : { *(.debug_abbrev) }
.debug_line 0 : { *(.debug_line) }
.debug_frame 0 : { *(.debug_frame) }
.debug_str 0 : { *(.debug_str) }
.debug_loc 0 : { *(.debug_loc) }
.debug_macinfo 0 : { *(.debug_macinfo) }
/* SGI/MIPS DWARF 2 extensions */
.debug_weaknames 0 : { *(.debug_weaknames) }
.debug_funcnames 0 : { *(.debug_funcnames) }
.debug_typenames 0 : { *(.debug_typenames) }
.debug_varnames 0 : { *(.debug_varnames) }
/* These must appear regardless of . */
}
diff --git a/stand/usb/storage/umass_common.c b/stand/usb/storage/umass_common.c
index 5ddd159297b7..639d70a7f7e6 100644
--- a/stand/usb/storage/umass_common.c
+++ b/stand/usb/storage/umass_common.c
@@ -1,90 +1,89 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2014 Hans Petter Selasky <hselasky@FreeBSD.org>
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include USB_GLOBAL_INCLUDE_FILE
#include "umass_common.h"
struct usb_attach_arg umass_uaa;
static device_probe_t umass_probe;
static device_attach_t umass_attach;
static device_detach_t umass_detach;
static devclass_t umass_devclass;
static device_method_t umass_methods[] = {
/* Device interface */
DEVMETHOD(device_probe, umass_probe),
DEVMETHOD(device_attach, umass_attach),
DEVMETHOD(device_detach, umass_detach),
DEVMETHOD_END
};
static driver_t umass_driver = {
.name = "umass",
.methods = umass_methods,
};
DRIVER_MODULE(umass, uhub, umass_driver, umass_devclass, NULL, 0);
static int
umass_probe(device_t dev)
{
struct usb_attach_arg *uaa = device_get_ivars(dev);
if (uaa->usb_mode != USB_MODE_HOST ||
uaa->info.bInterfaceClass != UICLASS_MASS ||
uaa->info.bInterfaceSubClass != UISUBCLASS_SCSI ||
uaa->info.bInterfaceProtocol != UIPROTO_MASS_BBB ||
device_get_unit(dev) != 0)
return (ENXIO);
return (0);
}
static int
umass_attach(device_t dev)
{
struct usb_attach_arg *uaa = device_get_ivars(dev);
umass_uaa = *uaa;
return (0); /* success */
}
static int
umass_detach(device_t dev)
{
#ifdef USB_DEBUG
memset(&umass_uaa, 0, sizeof(umass_uaa));
#endif
return (0);
}
diff --git a/stand/usb/storage/umass_common.h b/stand/usb/storage/umass_common.h
index a8ffd4987eb9..964f60836e4a 100644
--- a/stand/usb/storage/umass_common.h
+++ b/stand/usb/storage/umass_common.h
@@ -1,41 +1,40 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2014 Hans Petter Selasky <hselasky@FreeBSD.org>
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _UMASS_COMMON_H_
#define _UMASS_COMMON_H_
struct usb_attach_arg;
struct devsw;
extern struct usb_attach_arg umass_uaa;
extern struct devsw umass_disk;
#endif /* _UMASS_COMMON_H_ */
diff --git a/stand/usb/storage/umass_loader.c b/stand/usb/storage/umass_loader.c
index 647d8a58b534..01f1e3602b6a 100644
--- a/stand/usb/storage/umass_loader.c
+++ b/stand/usb/storage/umass_loader.c
@@ -1,241 +1,240 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2014 Hans Petter Selasky <hselasky@FreeBSD.org>
* All rights reserved.
*
* This software was developed by SRI International and the University of
* Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
* ("CTSRD"), as part of the DARPA CRASH research programme.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <bootstrap.h>
#include <stdarg.h>
#include <stand.h>
#include <disk.h>
#define HAVE_STANDARD_DEFS
#include USB_GLOBAL_INCLUDE_FILE
#include "umass_common.h"
static int umass_disk_init(void);
static int umass_disk_open(struct open_file *,...);
static int umass_disk_close(struct open_file *);
static void umass_disk_cleanup(void);
static int umass_disk_ioctl(struct open_file *, u_long, void *);
static int umass_disk_strategy(void *, int, daddr_t, size_t, char *, size_t *);
static int umass_disk_print(int);
struct devsw umass_disk = {
.dv_name = "umass",
.dv_type = DEVT_DISK,
.dv_init = umass_disk_init,
.dv_strategy = umass_disk_strategy,
.dv_open = umass_disk_open,
.dv_close = umass_disk_close,
.dv_ioctl = umass_disk_ioctl,
.dv_print = umass_disk_print,
.dv_cleanup = umass_disk_cleanup,
.dv_fmtdev = disk_fmtdev,
.dv_parsedev = disk_parsedev,
};
static int
umass_disk_init(void)
{
uint32_t time;
usb_init();
usb_needs_explore_all();
/* wait 8 seconds for a USB mass storage device to appear */
for (time = 0; time < (8 * hz); time++) {
usb_idle();
delay(1000000 / hz);
time++;
callout_process(1);
if (umass_uaa.device != NULL)
return (0);
}
return (0);
}
static int
umass_disk_strategy(void *devdata, int flag, daddr_t dblk, size_t size,
char *buf, size_t *rsizep)
{
if (umass_uaa.device == NULL)
return (ENXIO);
if (rsizep != NULL)
*rsizep = 0;
flag &= F_MASK;
if (flag == F_WRITE) {
if (usb_msc_write_10(umass_uaa.device, 0, dblk, size >> 9, buf) != 0)
return (EINVAL);
} else if (flag == F_READ) {
if (usb_msc_read_10(umass_uaa.device, 0, dblk, size >> 9, buf) != 0)
return (EINVAL);
} else {
return (EROFS);
}
if (rsizep != NULL)
*rsizep = size;
return (0);
}
static int
umass_disk_open_sub(struct disk_devdesc *dev)
{
uint32_t nblock;
uint32_t blocksize;
if (usb_msc_read_capacity(umass_uaa.device, 0, &nblock, &blocksize) != 0)
return (EINVAL);
return (disk_open(dev, ((uint64_t)nblock + 1) * (uint64_t)blocksize, blocksize));
}
static int
umass_disk_open(struct open_file *f,...)
{
va_list ap;
struct disk_devdesc *dev;
va_start(ap, f);
dev = va_arg(ap, struct disk_devdesc *);
va_end(ap);
if (umass_uaa.device == NULL)
return (ENXIO);
if (dev->d_unit != 0)
return (EIO);
return (umass_disk_open_sub(dev));
}
static int
umass_disk_ioctl(struct open_file *f, u_long cmd, void *buf)
{
struct disk_devdesc *dev;
uint32_t nblock;
uint32_t blocksize;
int rc;
dev = (struct disk_devdesc *)(f->f_devdata);
if (dev == NULL)
return (EINVAL);
rc = disk_ioctl(dev, cmd, buf);
if (rc != ENOTTY)
return (rc);
switch (cmd) {
case DIOCGSECTORSIZE:
case DIOCGMEDIASIZE:
if (usb_msc_read_capacity(umass_uaa.device, 0,
&nblock, &blocksize) != 0)
return (EINVAL);
if (cmd == DIOCGMEDIASIZE)
*(uint64_t*)buf = nblock;
else
*(uint32_t*)buf = blocksize;
return (0);
default:
return (ENXIO);
}
}
static int
umass_disk_close(struct open_file *f)
{
struct disk_devdesc *dev;
dev = (struct disk_devdesc *)f->f_devdata;
return (disk_close(dev));
}
static int
umass_disk_print(int verbose)
{
struct disk_devdesc dev;
printf("%s devices:", umass_disk.dv_name);
if (pager_output("\n") != 0)
return (1);
memset(&dev, 0, sizeof(dev));
ret = pager_output(" umass0 UMASS device\n");
if (ret != 0)
return (ret);
dev.d_dev = &umass_disk;
dev.d_unit = 0;
dev.d_slice = D_SLICENONE;
dev.d_partition = D_PARTNONE;
if (umass_disk_open_sub(&dev) == 0) {
ret = disk_print(&dev, " umass0", verbose);
disk_close(&dev);
}
return (ret);
}
static void
umass_disk_cleanup(void)
{
usb_uninit();
}
/* USB specific functions */
extern void callout_process(int);
extern void usb_idle(void);
extern void usb_init(void);
extern void usb_uninit(void);
void
DELAY(unsigned int usdelay)
{
delay(usdelay);
}
int
pause(const char *what, int timeout)
{
if (timeout == 0)
timeout = 1;
delay((1000000 / hz) * timeout);
return (0);
}
diff --git a/stand/usb/test/bsd_usbloader_test.c b/stand/usb/test/bsd_usbloader_test.c
index 35140b87c360..a92bdebfbebe 100644
--- a/stand/usb/test/bsd_usbloader_test.c
+++ b/stand/usb/test/bsd_usbloader_test.c
@@ -1,101 +1,100 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <time.h>
extern int usleep(int);
extern void callout_process(int);
extern void usb_idle(void);
extern void usb_init(void);
extern void usb_uninit(void);
#define hz 1000
#ifdef HAVE_MALLOC
void *
usb_malloc(size_t size)
{
return (malloc(size));
}
void
usb_free(void *ptr)
{
free(ptr);
}
#endif
void
DELAY(unsigned int delay)
{
usleep(delay);
}
void
delay(unsigned int delay)
{
usleep(delay);
}
int
pause(const char *what, int timeout)
{
if (timeout == 0)
timeout = 1;
usleep((1000000 / hz) * timeout);
return (0);
}
int
main(int argc, char **argv)
{
uint32_t time;
usb_init();
time = 0;
while (1) {
usb_idle();
usleep(1000);
if (++time >= (1000 / hz)) {
time = 0;
callout_process(1);
}
}
usb_uninit();
return (0);
}
diff --git a/stand/usb/tools/sysinit.c b/stand/usb/tools/sysinit.c
index b968fe0ab858..cb2868a0d728 100644
--- a/stand/usb/tools/sysinit.c
+++ b/stand/usb/tools/sysinit.c
@@ -1,331 +1,330 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* This utility sorts sysinit structure entries in binary format and
* prints out the result in C-format.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <err.h>
#include <unistd.h>
#include <fcntl.h>
#include <string.h>
#include <sysexits.h>
#include "sysinit.h"
static int opt_R;
static const char *input_f;
static const char *output_f;
static const char *struct_name;
static const char *keyword;
static struct sysinit_data **start;
static struct sysinit_data **stop;
static int input_file = -1;
static int output_file = -1;
static uint8_t *input_ptr;
static uint32_t input_len;
static uint32_t endian32;
static char scratch_buf[4096];
static int success;
static void do_sysinit(void);
/* the following function converts the numbers into host endian format */
static uint32_t
read32(uint32_t val)
{
uint32_t temp;
uint32_t endian;
endian = endian32;
temp = 0;
while (val) {
temp |= (val & 0xF) << ((endian & 0xF) * 4);
endian >>= 4;
val >>= 4;
}
return (temp);
}
static void
do_write(int fd, const char *buf)
{
int len = strlen(buf);
if (write(fd, buf, len) != len)
err(EX_SOFTWARE, "Could not write to output file");
}
static void *
do_malloc(int size)
{
void *ptr;
ptr = malloc(size);
if (ptr == NULL)
errx(EX_SOFTWARE, "Could not allocate memory");
return (ptr);
}
static void
usage(void)
{
errx(EX_USAGE, "sysinit -i sysinit.bin -o sysinit_data.c \\\n"
"\t" "-k sysinit -s sysinit_data [ -R (reverse)]");
}
static void
cleanup(void)
{
if (output_file >= 0)
close(output_file);
if (input_file >= 0)
close(input_file);
if (success == 0) {
if (output_f)
unlink(output_f);
}
}
static int
compare(const void *_pa, const void *_pb)
{
const struct sysinit_data * const *pa = _pa;
const struct sysinit_data * const *pb = _pb;
if ((*pa)->dw_msb_value > (*pb)->dw_msb_value)
return (1);
if ((*pa)->dw_msb_value < (*pb)->dw_msb_value)
return (-1);
if ((*pa)->dw_lsb_value > (*pb)->dw_lsb_value)
return (1);
if ((*pa)->dw_lsb_value < (*pb)->dw_lsb_value)
return (-1);
return (0); /* equal */
}
static int
compare_R(const void *_pa, const void *_pb)
{
const struct sysinit_data * const *pa = _pa;
const struct sysinit_data * const *pb = _pb;
if ((*pa)->dw_msb_value > (*pb)->dw_msb_value)
return (-1);
if ((*pa)->dw_msb_value < (*pb)->dw_msb_value)
return (1);
if ((*pa)->dw_lsb_value > (*pb)->dw_lsb_value)
return (-1);
if ((*pa)->dw_lsb_value < (*pb)->dw_lsb_value)
return (1);
return (0); /* equal */
}
int
main(int argc, char **argv)
{
struct sysinit_data **sipp;
int c;
int entries;
off_t off;
while ((c = getopt(argc, argv, "k:s:i:o:Rh")) != -1) {
switch (c) {
case 'i':
input_f = optarg;
break;
case 'o':
output_f = optarg;
break;
case 'R':
opt_R = 1;
break;
case 'k':
keyword = optarg;
break;
case 's':
struct_name = optarg;
break;
default:
usage();
}
}
if (input_f == NULL || output_f == NULL ||
struct_name == NULL || keyword == NULL)
usage();
atexit(&cleanup);
cleanup();
input_file = open(input_f, O_RDONLY);
if (input_file < 0)
err(EX_SOFTWARE, "Could not open input file: %s", input_f);
output_file = open(output_f, O_TRUNC | O_CREAT | O_RDWR, 0600);
if (output_file < 0)
err(EX_SOFTWARE, "Could not open output file: %s", output_f);
off = lseek(input_file, 0, SEEK_END);
input_ptr = do_malloc(off);
input_len = off;
if (input_len % (uint32_t)sizeof(struct sysinit_data)) {
errx(EX_SOFTWARE, "Input file size is not divisible by %u",
(unsigned int)sizeof(struct sysinit_data));
}
off = lseek(input_file, 0, SEEK_SET);
if (off < 0)
err(EX_SOFTWARE, "Could not seek to start of input file");
if (read(input_file, input_ptr, input_len) != input_len)
err(EX_SOFTWARE, "Could not read input file");
entries = input_len / (uint32_t)sizeof(struct sysinit_data);
start = do_malloc(sizeof(void *) * entries);
stop = start + entries;
for (c = 0; c != entries; c++)
start[c] = &((struct sysinit_data *)input_ptr)[c];
if (start != stop)
endian32 = (*start)->dw_endian32;
/* switch all fields to host endian order */
for (sipp = start; sipp < stop; sipp++) {
(*sipp)->dw_lsb_value = read32((*sipp)->dw_lsb_value);
(*sipp)->dw_msb_value = read32((*sipp)->dw_msb_value);
(*sipp)->dw_file_line = read32((*sipp)->dw_file_line);
}
if (opt_R == 0) {
/* sort entries, rising numerical order */
qsort(start, entries, sizeof(void *), &compare);
} else {
/* sort entries, falling numerical order */
qsort(start, entries, sizeof(void *), &compare_R);
}
/* safe all strings */
for (sipp = start; sipp < stop; sipp++) {
(*sipp)->b_keyword_name[sizeof((*sipp)->b_keyword_name) - 1] = 0;
(*sipp)->b_global_type[sizeof((*sipp)->b_global_type) - 1] = 0;
(*sipp)->b_global_name[sizeof((*sipp)->b_global_name) - 1] = 0;
(*sipp)->b_file_name[sizeof((*sipp)->b_file_name) - 1] = 0;
(*sipp)->b_debug_info[sizeof((*sipp)->b_debug_info) - 1] = 0;
}
if (strcmp(keyword, "sysinit") == 0)
do_sysinit();
else if (strcmp(keyword, "sysuninit") == 0)
do_sysinit();
else
errx(EX_USAGE, "Unknown keyword '%s'", keyword);
success = 1;
return (0);
}
static void
do_sysinit(void)
{
struct sysinit_data **sipp;
int c;
snprintf(scratch_buf, sizeof(scratch_buf),
"/*\n"
" * This file was automatically generated.\n"
" * Please do not edit.\n"
" */\n\n");
/* write out externals */
for (c = 0, sipp = start; sipp < stop; c++, sipp++) {
if (strcmp((const char *)(*sipp)->b_keyword_name, keyword))
continue;
if ((*sipp)->dw_msb_value == 0)
continue;
snprintf(scratch_buf, sizeof(scratch_buf),
"/* #%04u: %s entry at %s:%u */\n",
c, (*sipp)->b_debug_info, (*sipp)->b_file_name,
(unsigned int)(*sipp)->dw_file_line);
do_write(output_file, scratch_buf);
snprintf(scratch_buf, sizeof(scratch_buf),
"extern %s %s;\n\n", (*sipp)->b_global_type,
(*sipp)->b_global_name);
do_write(output_file, scratch_buf);
}
snprintf(scratch_buf, sizeof(scratch_buf),
"const void *%s[] = {\n", struct_name);
do_write(output_file, scratch_buf);
/* write out actual table */
for (c = 0, sipp = start; sipp < stop; c++, sipp++) {
if (strcmp((const char *)(*sipp)->b_keyword_name, keyword))
continue;
if ((*sipp)->dw_msb_value == 0)
continue;
snprintf(scratch_buf, sizeof(scratch_buf),
"\t&%s, /* #%04u */\n",
(*sipp)->b_global_name, (unsigned int)c);
do_write(output_file, scratch_buf);
}
snprintf(scratch_buf, sizeof(scratch_buf),
"\t(const void *)0\n"
"};\n");
do_write(output_file, scratch_buf);
}
diff --git a/stand/usb/usb_busdma_loader.c b/stand/usb/usb_busdma_loader.c
index 90dc1692ba01..2ca855e468a1 100644
--- a/stand/usb/usb_busdma_loader.c
+++ b/stand/usb/usb_busdma_loader.c
@@ -1,619 +1,618 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2013 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <bsd_global.h>
#if USB_HAVE_BUSDMA
static void usb_pc_common_mem_cb(struct usb_page_cache *pc,
void *vaddr, uint32_t length);
#endif
/*------------------------------------------------------------------------*
* usbd_get_page - lookup DMA-able memory for the given offset
*
* NOTE: Only call this function when the "page_cache" structure has
* been properly initialized !
*------------------------------------------------------------------------*/
void
usbd_get_page(struct usb_page_cache *pc, usb_frlength_t offset,
struct usb_page_search *res)
{
#if USB_HAVE_BUSDMA
struct usb_page *page;
if (pc->page_start) {
/* Case 1 - something has been loaded into DMA */
if (pc->buffer) {
/* Case 1a - Kernel Virtual Address */
res->buffer = USB_ADD_BYTES(pc->buffer, offset);
}
offset += pc->page_offset_buf;
/* compute destination page */
page = pc->page_start;
if (pc->ismultiseg) {
page += (offset / USB_PAGE_SIZE);
offset %= USB_PAGE_SIZE;
res->length = USB_PAGE_SIZE - offset;
res->physaddr = page->physaddr + offset;
} else {
res->length = (usb_size_t)-1;
res->physaddr = page->physaddr + offset;
}
if (!pc->buffer) {
/* Case 1b - Non Kernel Virtual Address */
res->buffer = USB_ADD_BYTES(page->buffer, offset);
}
return;
}
#endif
/* Case 2 - Plain PIO */
res->buffer = USB_ADD_BYTES(pc->buffer, offset);
res->length = (usb_size_t)-1;
#if USB_HAVE_BUSDMA
res->physaddr = 0;
#endif
}
/*------------------------------------------------------------------------*
* usbd_copy_in - copy directly to DMA-able memory
*------------------------------------------------------------------------*/
void
usbd_copy_in(struct usb_page_cache *cache, usb_frlength_t offset,
const void *ptr, usb_frlength_t len)
{
struct usb_page_search buf_res;
while (len != 0) {
usbd_get_page(cache, offset, &buf_res);
if (buf_res.length > len) {
buf_res.length = len;
}
memcpy(buf_res.buffer, ptr, buf_res.length);
offset += buf_res.length;
len -= buf_res.length;
ptr = USB_ADD_BYTES(ptr, buf_res.length);
}
}
/*------------------------------------------------------------------------*
* usbd_copy_out - copy directly from DMA-able memory
*------------------------------------------------------------------------*/
void
usbd_copy_out(struct usb_page_cache *cache, usb_frlength_t offset,
void *ptr, usb_frlength_t len)
{
struct usb_page_search res;
while (len != 0) {
usbd_get_page(cache, offset, &res);
if (res.length > len) {
res.length = len;
}
memcpy(ptr, res.buffer, res.length);
offset += res.length;
len -= res.length;
ptr = USB_ADD_BYTES(ptr, res.length);
}
}
/*------------------------------------------------------------------------*
* usbd_frame_zero - zero DMA-able memory
*------------------------------------------------------------------------*/
void
usbd_frame_zero(struct usb_page_cache *cache, usb_frlength_t offset,
usb_frlength_t len)
{
struct usb_page_search res;
while (len != 0) {
usbd_get_page(cache, offset, &res);
if (res.length > len) {
res.length = len;
}
memset(res.buffer, 0, res.length);
offset += res.length;
len -= res.length;
}
}
#if USB_HAVE_BUSDMA
/*------------------------------------------------------------------------*
* usb_pc_common_mem_cb - BUS-DMA callback function
*------------------------------------------------------------------------*/
static void
usb_pc_common_mem_cb(struct usb_page_cache *pc,
void *vaddr, uint32_t length)
{
struct usb_page *pg;
usb_size_t rem;
bus_size_t off;
bus_addr_t phys = (uintptr_t)vaddr; /* XXX */
uint32_t nseg;
if (length == 0)
nseg = 1;
else
nseg = ((length + USB_PAGE_SIZE - 1) / USB_PAGE_SIZE);
pg = pc->page_start;
pg->physaddr = phys & ~(USB_PAGE_SIZE - 1);
rem = phys & (USB_PAGE_SIZE - 1);
pc->page_offset_buf = rem;
pc->page_offset_end += rem;
length += rem;
for (off = USB_PAGE_SIZE; off < length; off += USB_PAGE_SIZE) {
pg++;
pg->physaddr = (phys + off) & ~(USB_PAGE_SIZE - 1);
}
}
/*------------------------------------------------------------------------*
* usb_pc_alloc_mem - allocate DMA'able memory
*
* Returns:
* 0: Success
* Else: Failure
*------------------------------------------------------------------------*/
uint8_t
usb_pc_alloc_mem(struct usb_page_cache *pc, struct usb_page *pg,
usb_size_t size, usb_size_t align)
{
void *ptr;
uint32_t rem;
/* allocate zeroed memory */
if (align != 1) {
ptr = malloc(size + align, XXX, XXX);
if (ptr == NULL)
goto error;
rem = (-((uintptr_t)ptr)) & (align - 1);
} else {
ptr = malloc(size, XXX, XXX);
if (ptr == NULL)
goto error;
rem = 0;
}
/* setup page cache */
pc->buffer = ((uint8_t *)ptr) + rem;
pc->page_start = pg;
pc->page_offset_buf = 0;
pc->page_offset_end = size;
pc->map = NULL;
pc->tag = ptr;
pc->ismultiseg = (align == 1);
/* compute physical address */
usb_pc_common_mem_cb(pc, pc->buffer, size);
usb_pc_cpu_flush(pc);
return (0);
error:
/* reset most of the page cache */
pc->buffer = NULL;
pc->page_start = NULL;
pc->page_offset_buf = 0;
pc->page_offset_end = 0;
pc->map = NULL;
pc->tag = NULL;
return (1);
}
/*------------------------------------------------------------------------*
* usb_pc_free_mem - free DMA memory
*
* This function is NULL safe.
*------------------------------------------------------------------------*/
void
usb_pc_free_mem(struct usb_page_cache *pc)
{
if (pc != NULL && pc->buffer != NULL) {
free(pc->tag, XXX);
pc->buffer = NULL;
}
}
/*------------------------------------------------------------------------*
* usb_pc_load_mem - load virtual memory into DMA
*
* Return values:
* 0: Success
* Else: Error
*------------------------------------------------------------------------*/
uint8_t
usb_pc_load_mem(struct usb_page_cache *pc, usb_size_t size, uint8_t sync)
{
/* setup page cache */
pc->page_offset_buf = 0;
pc->page_offset_end = size;
pc->ismultiseg = 1;
mtx_assert(pc->tag_parent->mtx, MA_OWNED);
if (size > 0) {
/* compute physical address */
usb_pc_common_mem_cb(pc, pc->buffer, size);
}
if (sync == 0) {
/*
* Call callback so that refcount is decremented
* properly:
*/
pc->tag_parent->dma_error = 0;
(pc->tag_parent->func) (pc->tag_parent);
}
return (0);
}
/*------------------------------------------------------------------------*
* usb_pc_cpu_invalidate - invalidate CPU cache
*------------------------------------------------------------------------*/
void
usb_pc_cpu_invalidate(struct usb_page_cache *pc)
{
if (pc->page_offset_end == pc->page_offset_buf) {
/* nothing has been loaded into this page cache! */
return;
}
/* NOP */
}
/*------------------------------------------------------------------------*
* usb_pc_cpu_flush - flush CPU cache
*------------------------------------------------------------------------*/
void
usb_pc_cpu_flush(struct usb_page_cache *pc)
{
if (pc->page_offset_end == pc->page_offset_buf) {
/* nothing has been loaded into this page cache! */
return;
}
/* NOP */
}
/*------------------------------------------------------------------------*
* usb_pc_dmamap_create - create a DMA map
*
* Returns:
* 0: Success
* Else: Failure
*------------------------------------------------------------------------*/
uint8_t
usb_pc_dmamap_create(struct usb_page_cache *pc, usb_size_t size)
{
return (0); /* NOP, success */
}
/*------------------------------------------------------------------------*
* usb_pc_dmamap_destroy
*
* This function is NULL safe.
*------------------------------------------------------------------------*/
void
usb_pc_dmamap_destroy(struct usb_page_cache *pc)
{
/* NOP */
}
/*------------------------------------------------------------------------*
* usb_dma_tag_setup - initialise USB DMA tags
*------------------------------------------------------------------------*/
void
usb_dma_tag_setup(struct usb_dma_parent_tag *udpt,
struct usb_dma_tag *udt, bus_dma_tag_t dmat,
struct mtx *mtx, usb_dma_callback_t *func,
uint8_t ndmabits, uint8_t nudt)
{
memset(udpt, 0, sizeof(*udpt));
/* sanity checking */
if ((nudt == 0) ||
(ndmabits == 0) ||
(mtx == NULL)) {
/* something is corrupt */
return;
}
/* initialise condition variable */
cv_init(udpt->cv, "USB DMA CV");
/* store some information */
udpt->mtx = mtx;
udpt->func = func;
udpt->tag = dmat;
udpt->utag_first = udt;
udpt->utag_max = nudt;
udpt->dma_bits = ndmabits;
while (nudt--) {
memset(udt, 0, sizeof(*udt));
udt->tag_parent = udpt;
udt++;
}
}
/*------------------------------------------------------------------------*
* usb_bus_tag_unsetup - factored out code
*------------------------------------------------------------------------*/
void
usb_dma_tag_unsetup(struct usb_dma_parent_tag *udpt)
{
struct usb_dma_tag *udt;
uint8_t nudt;
udt = udpt->utag_first;
nudt = udpt->utag_max;
while (nudt--) {
udt->align = 0;
udt++;
}
if (udpt->utag_max) {
/* destroy the condition variable */
cv_destroy(udpt->cv);
}
}
/*------------------------------------------------------------------------*
* usb_bdma_work_loop
*
* This function handles loading of virtual buffers into DMA and is
* only called when "dma_refcount" is zero.
*------------------------------------------------------------------------*/
void
usb_bdma_work_loop(struct usb_xfer_queue *pq)
{
struct usb_xfer_root *info;
struct usb_xfer *xfer;
usb_frcount_t nframes;
xfer = pq->curr;
info = xfer->xroot;
mtx_assert(info->xfer_mtx, MA_OWNED);
if (xfer->error) {
/* some error happened */
USB_BUS_LOCK(info->bus);
usbd_transfer_done(xfer, 0);
USB_BUS_UNLOCK(info->bus);
return;
}
if (!xfer->flags_int.bdma_setup) {
struct usb_page *pg;
usb_frlength_t frlength_0;
uint8_t isread;
xfer->flags_int.bdma_setup = 1;
/* reset BUS-DMA load state */
info->dma_error = 0;
if (xfer->flags_int.isochronous_xfr) {
/* only one frame buffer */
nframes = 1;
frlength_0 = xfer->sumlen;
} else {
/* can be multiple frame buffers */
nframes = xfer->nframes;
frlength_0 = xfer->frlengths[0];
}
/*
* Set DMA direction first. This is needed to
* select the correct cache invalidate and cache
* flush operations.
*/
isread = USB_GET_DATA_ISREAD(xfer);
pg = xfer->dma_page_ptr;
if (xfer->flags_int.control_xfr &&
xfer->flags_int.control_hdr) {
/* special case */
if (xfer->flags_int.usb_mode == USB_MODE_DEVICE) {
/* The device controller writes to memory */
xfer->frbuffers[0].isread = 1;
} else {
/* The host controller reads from memory */
xfer->frbuffers[0].isread = 0;
}
} else {
/* default case */
xfer->frbuffers[0].isread = isread;
}
/*
* Setup the "page_start" pointer which points to an array of
* USB pages where information about the physical address of a
* page will be stored. Also initialise the "isread" field of
* the USB page caches.
*/
xfer->frbuffers[0].page_start = pg;
info->dma_nframes = nframes;
info->dma_currframe = 0;
info->dma_frlength_0 = frlength_0;
pg += (frlength_0 / USB_PAGE_SIZE);
pg += 2;
while (--nframes > 0) {
xfer->frbuffers[nframes].isread = isread;
xfer->frbuffers[nframes].page_start = pg;
pg += (xfer->frlengths[nframes] / USB_PAGE_SIZE);
pg += 2;
}
}
if (info->dma_error) {
USB_BUS_LOCK(info->bus);
usbd_transfer_done(xfer, USB_ERR_DMA_LOAD_FAILED);
USB_BUS_UNLOCK(info->bus);
return;
}
if (info->dma_currframe != info->dma_nframes) {
if (info->dma_currframe == 0) {
/* special case */
usb_pc_load_mem(xfer->frbuffers,
info->dma_frlength_0, 0);
} else {
/* default case */
nframes = info->dma_currframe;
usb_pc_load_mem(xfer->frbuffers + nframes,
xfer->frlengths[nframes], 0);
}
/* advance frame index */
info->dma_currframe++;
return;
}
/* go ahead */
usb_bdma_pre_sync(xfer);
/* start loading next USB transfer, if any */
usb_command_wrapper(pq, NULL);
/* finally start the hardware */
usbd_pipe_enter(xfer);
}
/*------------------------------------------------------------------------*
* usb_bdma_done_event
*
* This function is called when the BUS-DMA has loaded virtual memory
* into DMA, if any.
*------------------------------------------------------------------------*/
void
usb_bdma_done_event(struct usb_dma_parent_tag *udpt)
{
struct usb_xfer_root *info;
info = USB_DMATAG_TO_XROOT(udpt);
mtx_assert(info->xfer_mtx, MA_OWNED);
/* copy error */
info->dma_error = udpt->dma_error;
/* enter workloop again */
usb_command_wrapper(&info->dma_q,
info->dma_q.curr);
}
/*------------------------------------------------------------------------*
* usb_bdma_pre_sync
*
* This function handles DMA synchronisation that must be done before
* an USB transfer is started.
*------------------------------------------------------------------------*/
void
usb_bdma_pre_sync(struct usb_xfer *xfer)
{
struct usb_page_cache *pc;
usb_frcount_t nframes;
if (xfer->flags_int.isochronous_xfr) {
/* only one frame buffer */
nframes = 1;
} else {
/* can be multiple frame buffers */
nframes = xfer->nframes;
}
pc = xfer->frbuffers;
while (nframes--) {
if (pc->isread) {
usb_pc_cpu_invalidate(pc);
} else {
usb_pc_cpu_flush(pc);
}
pc++;
}
}
/*------------------------------------------------------------------------*
* usb_bdma_post_sync
*
* This function handles DMA synchronisation that must be done after
* an USB transfer is complete.
*------------------------------------------------------------------------*/
void
usb_bdma_post_sync(struct usb_xfer *xfer)
{
struct usb_page_cache *pc;
usb_frcount_t nframes;
if (xfer->flags_int.isochronous_xfr) {
/* only one frame buffer */
nframes = 1;
} else {
/* can be multiple frame buffers */
nframes = xfer->nframes;
}
pc = xfer->frbuffers;
while (nframes--) {
if (pc->isread) {
usb_pc_cpu_invalidate(pc);
}
pc++;
}
}
#endif
diff --git a/tests/sys/geom/class/eli/testvect.h b/tests/sys/geom/class/eli/testvect.h
index 873457340579..49fb0588f596 100644
--- a/tests/sys/geom/class/eli/testvect.h
+++ b/tests/sys/geom/class/eli/testvect.h
@@ -1,1137 +1,1136 @@
-/* $FreeBSD$ */
/* Test Vectors for PBKDF2-SHA512 */
/* salt, saltlen, passwd, itr, hmacout, hmacoutlen */
{ "\331}\035\215\000\272\350\261", 8, "\323\303\210\231\260\225\217\035", 100, "J\257\275\352n\371\300!tp\367\257\347c'\000\243F\246\376\274H\263\312m\336\304\3515P\222Cb\037-\313W\0067\232\024%\235\252\322\035\225k\025\2248\251r\312]v\316\021j\231\224\2556\350", 64 },
{ "\321\213\277\330\210E\207x", 8, "(C\371\344\354\356\232\212\346\014\335M(\234g\226", 100, "\035MoB\245\001\000\315\332\235\356?alD\231I[%A\372\367\027\267,\303\022\324\004\302a\302t\257\306S\251\250;-pa\246Z\200\003*+\026\305_\250\214n\321\340.\032a3\371\346\025\042", 64 },
{ "\344\353\215\257\020\315\245\367", 8, "/pj@N\344\271\243^\352\236gu\352\344os\366FR\362\001\347\301", 100, "\223eS:\015\311\023\317\230O\012\347\014\32070\321\337p\353\305\361\223\323\333&\011'\360?\022\374P\336\337\031\266,~@!\037\000\320v\360!\225\221@C\266|k\370@\305\202\235+\314\247\305&", 64 },
{ "\364\275\222\376\0064\240g", 8, "_\2000 A\233#\372\351\332\247\010\313\274\334\255\362J\356\333\302\345\317\305*\357 \366Aj\344\346", 100, "\223\015X\340\024\244\2767\027\253\261\232\360(?\350H7\326K\322\246\341\222\202:@\254\3218\016T\275\212^\005\344\202\230\220s\311\201\025\233~K6\241*b\244\203\273\355\270\277\242\300V3\037\224\311", 64 },
{ "\272\207\326\030\010\374\263f", 8, "\323\230\233\317\337\001\241]G\312\347\320K\3374\247\016\343\246\353\300\373\267\335\314h\216\245$\373\210\214\014b\340\377\256\0202E", 100, "a\274S.\032\246\330\321\322\207\004\241n\303\363\361\361\215\367Xi\250\275\246\037\355\255\342\004\253\250\243&\032\357\250\204\207K\2612\0318\3353\253\335Z\351\337\253v\345\322r\030\0066\230jp\345\373\203", 64 },
{ "j\276\230\215\031$\326v", 8, "gy\264\354\363\322(w\262\272\203\306{\356\031\376\277+\276L\337\270G\345!>29\010\204m\240!\326\255\326\321\272(\325T\033B\262[\267]\272", 100, "\2563\024\201\310\372\017\373\270\232\277\265:j\231\365\032zS\3723\012\341i\302V\233l\247\030:\355\262]\337\361JUe:\350|#D\262\335)\260\333\273\221\252\005\226\322'\371+a\270a\302\276p", 64 },
{ ",;\270P\012\035\262\235", 8, "\375 \232J\304\271_\272\033\027\363\021\227\260\323\310\304k\004.\327\354\217,\357\353]I0\332We\245\257\371,\260\360\325\224\026q[VuS\217\004\262\376T\353\262\321\241\024", 100, "\313\246&~\374Zq(0\000\002\332\356\355M\353Z?\310~\234\327\011\242\370\032GK\250\020\203sJ\234I,\271\012\230\204g\323\345\343\343\350\231\227\015\350b\256\012\367Q\255v\365\210\247\2614\210\365", 64 },
{ "\021\325\267u\203$\352\274", 8, "\232\032\225'\021*'a\042\023{\250\361r\262\365\370\032\347\336\363Re28\033J\3763^\311I\322:\036\204\320\033\245\200\262\225\341\377\334\241p\314\334\005O,\374\225\234\014\266\365\030i6\210a\205", 100, "\220\006\216\2420-8m\2766\353(6\212\306\261C@\252\2104\005\205\274\204\365\226\373\016\345\332\207\361A\244\023W\3051:\277\2705Z\253\262\371M\024L\215\224\340p\336\355\250\030*8\300\017\254f", 64 },
{ "[\353e\224\2423\270m", 8, "\1776\374\302o0\007\307w\032\307\266\376\320\042/\266\352\233\224\316\3616\314!`\015d\316\370L{\201B\245\317\366@V\036\227\273I\205\251\306GW\200*\340P\267\202#\354\330\266O\347\254(\203\270\366w\274\375\272\016\240\313", 100, "?j\005\340=\022\012NM\024\231\220_u\023@\042\214\014b\375\251\023\244y3m\330\377\341\271~V0\263\223\274\325Rmug\026Dt!\347%\270\244\371@\177\350\250N\320\246\034\320\013|\276\027", 64 },
{ "\262\304(\244\326\272\262\311", 8, "\210C(\273\376\013/\034", 200, "6+\233\201\350\374\2053\013\377SA\007\037\303\027RyrC\361\303\321\031\225d\215\314\213\210\006\031\217\035L)\377'\016\263\310\206\326\372\362\230\226.F\134\277\367\35357(\214\262\036\310@\363#\020", 64 },
{ "\246<\216\226^F\004\036", 8, "\344].\210\212\236\252f\256n\006\250\2615\325\371", 200, "\213J\234\270\227$St\265\035\323\001&\025\027T>\015F\205\325\361_\003l\245|\213S\232@\254o\227\235l$\355\037\214\220\032\213\320\265lM\334\320\313+\205.\355\310\201K\370^\025\134\346[K", 64 },
{ "9s72\020\270\251\350", 8, "\323\370:k\323o\271Y\335\306\375#\333\222\246?C\313\023\202>\005\025\216", 200, "\371\373\341\202(\231\010\325_\335\205\253\216\371\227\354\352Os2\356e\033L\236znr;\337a'\025\335n\032f\304\177u\001n{\236`\261\346N\2748R\017\243\226[\256@<\021m\202r\363g", 64 },
{ "\032\216\254\215\022l\001H", 8, "\027J\232\302\240lTSU\215y\262\360\017\346\3253\276r\276\211\306>\3740\263\264\002\333J;\262", 200, "\3206K,\267r<\302r\207y\373\3625]2Y\3710\343\272\211\202\3465g\340jG\001`\341\352\313\203\250x\221K\254iV\350w\2220\257Yc\360Z\263\237\255\042\325\341\307\330\232s@?\210", 64 },
{ "D\302g\023\316\224l\271", 8, "\262t\301{\366\345Bv\271!\213\303\244O8\314\336\363\325|\206x\034d$#\001<Z\233\272\014J=\2079?\134\015(", 200, "\334\222G\300~'\042LS\0218\006,\261\207]\277\245GH\007\246\357f\205\325-\3044\337\347\007\373\304\261\317\212\224\276pl\302?\271\321\010\375Q\202\236M\3105\251\310\234\032g~\301_\007\244R", 64 },
{ "\316@&\224\241\245\211{", 8, "\276\217\365\352O\212\377\257\177\350f\276\330\3035\204\215\327f\256\300\364\212\271\306q\242?-\307\324\317y^\201t\272\371\331M;c\210\202\201\221\363\030", 200, "\340\001\331YS\230\231|\356\024D8\243f\223\335\207\361\2241=\264\0366\030\230Z0\340\226K\352\241C\355\260\236b\1346\035\030\3059\022\335n#\311\025\351L\334\001\366\003\042\302\265\275\347\134]\204", 64 },
{ "\234^\035\320rt-B", 8, "\357\274\204\366N9\273:\216\331,D\300t\320\361\324F\313\220E\250u\203\307\003\221\365X\303O\230\312~\342\336\007R\232\244M\305U\320\367\272\367\366?\267c\253\354\301\221X", 200, "\017m\031\004\022\364(\016\310U\3621\301\316}k\362\306\227:\233+\000\230\334:,\005\307q\204\332L[\236\223\225\204y\037\037\262o\257]\012\365t\036\351(>x9\012\241\256W\241\334\307\240\207F", 64 },
{ "\037\346\010\241]\004x\204", 8, "T\334\371\316I\33656Q\027\277\203\033\303\240\371\231\352\214\3701@\002\015?2\264\002\257R\205\250\264}\021\012\326\366wF\311\267\271\0042C:/\341\031\242\337\237.\021V\034\263`W\306Y\3533", 200, "V\370Nt\341W\226|\367\226\200\033|\006Kii\263\304\307\347\301#L\371\335l|O\304\300v\361d\255h^\322\026\332U\224\270\255\227\022\226G\326\363\303\244\234\235\016/<\331\247\307\242\355\226\307", 64 },
{ "\364\303X\325\327\256\342f", 8, "\227E\237\320\214GB\332\005\0333\250=\020c(\345\007?\032)\2643\243\202\371\200\030\002\225\011/\030\030\003Q\354\344\361B\214\333.\015\336`\376.\360\243$\017\367K\207\212\347L\356S\230\346\034*\307\207\203\233a\310\370\255", 200, "L(\217#(\300jA\343\037\251rR\312G\024\016dj:\212|\024\373\275\134\375\374\247\266FpF\275:\373_\314\134\244\016\373\203k\265\225\243\212t\240\310\347\226\262%\233\213\332w\042WL\302\331", 64 },
{ "c\027\266\220\010\031\241\313", 8, "F#\323\2367\260\323\273", 300, "@\200\033\254\020\246\206L$\203\026.T\223\205\364\362@\204*\316\232u\033\321\212;l\202\313s\205\333<1~\211\267\213\336Z\276\233W\322\366!\3629l\343@O\216+[!\262I\350\262\312\022\357", 64 },
{ "\001\277`\003x\301n\313", 8, "\257'\372i.M$\356\230\032\252yq\302\004c", 300, "?\037\327=m\335R\367?\242q\002\023V\203\017q8\252\325?6\213\241\274\275\356\344*\312/p~.<\305\346]\377\242\361\025\311\375\303\247\305\345@U\230\364F\275\211n\250Ay\352\026+\253V", 64 },
{ "\203\020{)\016R\324\350", 8, "\261\200\031:\346l\242u\352\300\014_\320\221y\213e\214\352\042c\371\257\361", 300, "\001\2111R\305R'b.L\007$\042\267\346\304(|+2\240\260\021\042\243J\344\237\006\236\203A\032\363\356\251\015.\321\336\03431X\002\355\221\313]\264\310\315o\316aw\246|\312bT:\325\300", 64 },
{ "\002X\311\253\033h\036'", 8, "P\206\257!\305E\377\275\310\005\364Bn\005\342>!w\017@}\245\350\177\305\312\323\361,\301y\022", 300, "\360\301\033\007\367,\374\242\177\3153D\251*_>{\005\272NQ\021\024:0\036\357\333c\254/\001\035\202\341\330\005\0245\265b}\261\232\273\0318\225\227\252\210\361\300\016\357\323\204\202\246\376\277@\225w", 64 },
{ ">+\207\003k\311\225\276", 8, "((\260Eak\253\305\3243Q\332*N\276\323\325_48\317\264&\340\005\323N\224p\003\331Fl\215\317 w\034u?", 300, "\276\317.\310Gj \217\3502.za\021\230\322C6\255\301\354-\263\247\002\352\377\267]\243\201n\245\213D\240\010D|\324\336\251\326\342e\231\350*\300\315\007\234\236\002}\372\013\364\257\232\262:\207e", 64 },
{ "\265G\357\330S\302?8", 8, "7S-\203\036\340\015\356\027\253\302\376\222\037\2276\0141|p\255\313\325\211\206\265\230\333\027\343\231\007\335\366\356\011 $ \312`\333y\267K4\317\277", 300, "\004\264\241\262\204\361YL%#v\373\013@E/\335\353 l\365\242u\215\301p\360O\030{\0236\033\206$\340\263\202bC\032\014\252\365\323\325\350u\210\234\020\037\015\275\000{h\363a\244\024\177\356\236", 64 },
{ "I\257\321\376\365\317\267I", 8, "\200!XxW\233B\374,\362\027,\343\022\204\220\373\231=\376\343\362\246\224 \001\233\015\0338\337\224#%\320\037\342\276\314X{h\036\210w\377\011@=\021\034\3429!\211\350", 300, "`\277s c\215t\251,\306:L\267`u%D\244\021\340\036C\304\032\014u\042\134Mzo\313\225\3641\017\037\271q*\321\023\227\253\215\330\351\373\202\220\274`P\267\277\373\007\366\370\031\350\015\214\245", 64 },
{ "\324\366\347;\363R\300!", 8, "y\262~C\031\252 \004\215a\033\355l9\024C\237b/\032Kk\316q\257K\017\017\036\316\003\246\005\225(\0168\264\032pT\030\250\334\341\020\012X K\325\002\254mh\265\134N*?\233\007Zn", 300, "\202\252\261h$8%\335rv\260\0005\313Lj\244\262\342\202\352\277\005 \2418\2740Y\333\036\014[\015\030'O\351\377|D\0114O\344\203\177\360\337\3610\315\323\2528\247\307\3535R\366)\033\236", 64 },
{ "\301\357\263\261\347O\344,", 8, "\216\376\312\271K}\224Pt\022\2572\230lR\177\340m\224\271\305\237Z\374\252\204\313M\307&\330]^W[\001\317\207\264\305\017\224\331\245\361\301Z\371r\264\223\202\201\353\252k\223Bk\361\323c\307\255(\010:x%\257\3352", 300, "\312\240!.\3606\236]\235\315\2409\042?\027\015\271\030\352l>\272s\345\340\231\317\263\306W6[\342\360\307\305 !\357\003|g][\275j=ptx\344\265\271~\036_\361\004\246\261\313\241D)", 64 },
{ "\257\000;+\233Q\214b", 8, "eoq{\270\246ua", 400, "\251B\370\245m\000>\134\007\256\373\001\251\262,\310\367\376\323\334{K\202\177\235\376x\365D(+\367\361\373\031\376\254H\243\305/N\267\205\2108\301*\025@\030\311\012.\261\237\377\015\205h\261\042\372\034", 64 },
{ "hU\325\246:obb", 8, "?/\352\332\327c\027\331\305N'\321\355\337\316\241", 400, "\177\312\2275\203 \026aNXF\010\377\336=\240\025\312\252r\01363\234\351\2754[y7E\334CQ\371\243F\010l\2545\253\214\341\323\300u\202\225\236\250\356\007Q\000Q\302\207M@g\350m:", 64 },
{ "p(\256-\313\020{\300", 8, "\334\310\227\225J\356\360\307!\353\023\332|\214\306\036\026\253|-\267\341\321\223", 400, "\267\250\271J-\265\303\247\337ib\237l>\352\344\302\3321\3006\240\233\232N\2661\236\022s+\300\1342\375%\251Yl\032kK}\227T`\364\233v0|/\217\026\032\261\020\225\335k@`\021\227", 64 },
{ ",\032\034\337\304,\340\334", 8, "\011F\350\213N\0058\212}N\267\007\007E\276\203C\315\332\013\030`\372\030\370\001\240\030\354@9\327", 400, "\206A\034\355\042\030\025\220\000\251\025`\356\372Fr\313\246L\307\255@;\366\354\346\362\206h\023>A\271\273r\036\224\325Q\246\2527 ^\014!\240:|\335G\322\333\032\005ok~\371\372\255oD\257", 64 },
{ "H\322\305\000\020\341\365\243", 8, "\330\313R\037\276\004\355\327\363QH\327\364r\305}\014\370\007B\252xS\345\003\346\202\366\250\375\237\315 \205\355\214Rj\037\365", 400, "u\346\0049k\347\134\211\023\330\015\360o`\217\266\234\012\007\003\270\025A}\373^\366d:n\344\000PqM\314\200\213<\204:N\0279\323z\337\271\031\337x\0007\352\220\032b \303\346`\201\2729", 64 },
{ "\236\271\202\214\310\003r\323", 8, "\020>\356\364\222*\307l\337\312\351\343R\273pxL6|\305\324\362\273>\332\245t\3267\212\276\231\310\343\243\034X\360,\224il\313\374\217\2407\134", 400, "\224?^QsO\227|\332iTx\204=g\360\033\352\240`\330L\212\276(\201Dx\017\216\016\231\307^\204K%^\327\360\257\236\005j\010\233\371H\203n`zx\230cH\320,M\315\344%\215\024", 64 },
{ "\353h~\2307\320gN", 8, "\235H\252\037+\014\003\265\235*v\020I\376\207\331\222\266\274\0270tb\341\276.\306w^\331\270\263k\341%\270\200\232\321b/\244\310\016\361\316\362:\375/\371\255B\307./", 400, "\221Y)\236*\214\226e\360\324\257\367\230R\014_\314\214\236\027O\004\305\370\317w\257\260\001w\245\003P\371\335Y\240\227\365\243bh\254\372\247\375\301)k\255\245&\262\036\374_\026\224\326D\220\336\246\351", 64 },
{ "\362\023\013 \331\240-M", 8, "\353~\003\260'd@\026_<\301\360]EU\332i\336\177g\347\313\232\337\3562\010\250\345c\235\265\236\343;\322\302~\317\371\002~\027\012\332\301r\014#\322\004\353\261\275g\263\017(W>{`\322P", 400, "SA\003b\271\034\227\224gN\023\203\207 mW\365\257Nz\267wn\016\221\017g%(n\256/\330\311\377+\335\261\343CA\015A\272\352-\345`\245\370W6\020Y\215\2212\000\272\001\022$*\376", 64 },
{ "\250c`\236vN\302\210", 8, "\257(\256\0171z\243\023\042\134\363\223\252}GzB\307\261\220\301\270\027\327\326\353\253>\313\276\006UAd\355}\276\320)\375`E\353*-\370\226\370\021\004\203\374e\016e\275\202\313\227AP/?5\260\225\217\243\276Ag\377", 400, "\203\022\352c\27522Z\265mo\224\016G\376/C\026\000{\0201\015(\224\005!fV\262\204N\265\206\202\336\255\362\036\015\330\241!5\247\035rVG\346v\301W\306\204\335HS\371Tlq\207\334", 64 },
{ "\327\002\265\344\005\337@O", 8, "\233\317\326\221:\2409Y", 500, "\134\021\253\352\370\313yg<\015\200\022b\317Vq\262\220\257fL\315\302\201\266\036lxQ\371\021 J\337)(2\346\017V2\310\217\030\274I\357\215\2115\277p\351\236\012\272\346V:\317\003\326\2062", 64 },
{ "\320u\027+-\245\0217", 8, "\216\257\376\3147\035d\300\366\365\315\320w\304\236$", 500, "\001_\134H\237\352\244\340\034\274\366\034H\321\311\216\255R_U\263\221\206J\301\2641\304J~\274oH\007\340\246a\313\204>\216\330\311x*<\334T\216\251S\322at\360\234\243w3\033\2061PL", 64 },
{ "#@\256\000\333y\350\327", 8, "Rb\213R\263\262W\317\333\354\261\340\246\26119H\334\277U\253\266C\247", 500, "\343\224\023a\337\367\347\276\245\310-(\363\021\271\221_\360\245\233\356S\236\363\027\212\0046*\244\376\3032\352\007\023Fs-\332\203#+\355\244\33654\205a\200\302w\314\335\0157\212S\227\271l\202*", 64 },
{ "\350e\303Y\257\366M\223", 8, "d\311\323\036\030%\266j\372\006\016\024;\344\350\256\234\026\341el\325\270\236\226\020\312b[\212\353\343", 500, "F\026H&\347}\264@\307\246ap\356W\272P\023\254\204/-\006\337u\230K\221\204\312h\337Q\021\037p9\222U\032\262k~\013e\017X\134/\243\264>j\251=DBu_*\350Z\260\010z", 64 },
{ "\277\212\2413\001K\016_", 8, "\005<<y\266oky\302\237\177\024\352Z\342]\033\340d\200|\243\204\211\253\017\001\212\237\134KR\0069\202\3539\365\375\372", 500, " :\341\020\036\347\334\222\354\253\226E`;\355k\016\2340\337\023\303x\230\204\234\222\316W\002h5\251\256\264)\302\347\007\034f]\015\217k\263@\236\004W\366]7\352E\033\345\201\311\204Y\353\2310", 64 },
{ "\366@\217\206\246\210\347\233", 8, "T\203Q\310Z\350\354Y\231\213n\276c\134\3137\035+;\306\254j\247>#\022(`\277\021/J4~\363\354x\207\271\211Ft\233\026\252\326:\236", 500, "\220\344\307\355\203\332\013\207\2504\364\207\303\026\316\251\026X\367\373sN\225\2540\243\006\233/l\224\370\310\346\352\227}K\267\223E,\010G{e\270>})\274\312\001\3350\311\261\367?7\251|i\243", 64 },
{ "\271\035\035\334\321\366u\304", 8, "\325L\272\252\211;\134\014}^\270\007<\316[68S\361\3264lA\240}\025l\032\265\036\247\227!\035x\354C\262<?\375oQ\205\377\201\026%#\211\037\274\345\020\347\301", 500, "\246\035\300\203\200@\345TZt\032\374\337\024!\350\023\221P\017;\257\025\376J}\317\305P/\013\312\375G\014\245\001\211\212H\015R\006#\274ca\360\255nf\276<s\220T\373#\271\345\305\211\015\304", 64 },
{ "\241\322Q\333\203\362\233\316", 8, "\214\375\234\011\345\017\211/\020\021\006\026\257KLP\346\263\042\242]\346\216d\251\177v\301\375\332Ys\321@\217\3775\355\216\313\271\351\336\253\326tA^\242\307)^\022\371\342\217D\030\042\206\346\134\025\361", 500, "ET\245\031\000Z8\234\203\270\363\325\033`\220j\205\134J\343\020@K\030|[\370\362Px\037m\215\300F\216\220\305\134\035dQ\2661\315\300\250\366\022\303\012\257,.\026%\344g\267oy\271\307a", 64 },
{ "\230l#\3474V\000k", 8, "\277\2702U\260\313\030\303\001\210c\206o\374B7\033\363\230\257\333\372\244\214\362&\377\037H3u\012\204\222\221N\042\327\235\301Z~\361\356\273\304\365\310\033\350\024\034\264\013\361\242h\305N\327d\001\252\357\027\322B\263\337\322\262\034", 500, "\034:\344l\216\335U\036\314\346Z{\215\377\233G\271\351\307J\273l\370b\007\203\036=\024g\207J\007!\015\327\335\333\000\214\306\307.?`\240\241J\236g`\305\264\342\327M!\262\3735\235\236\016\243", 64 },
{ "\350b\311\324\315c\012h", 8, "(\007\243m\002r\024\360", 600, "bO\231yF\305\225K\256\036\277\234)\134\263&\030P\352B\010<A\025\376\306\331?\213\276i\016\021.\265\310\335\346\323\354x\367\301V\014/\207\317\231L\201g8zM\017\323\212\221\021\367g$p", 64 },
{ "4\252\245\207\245\212^\274", 8, "Q\376\241\252\2757\010\225\006 \227\200c\015\253\262", 600, "t\345\035\277Ok\031\022\275>[\177\320\324\305%\333{\317*V\220\027\367\322_\234\017\253]\024\347dDB#>\373\003\216\347\333r\220Z\334\301\346\356']\323 \375t7cQh\010\004v\2253", 64 },
{ "\275\303\226\316\005\315-\300", 8, "\223\241?\356\014`\255l\337ad\241k\345\355\226\334\266@\217C\221\237\005", 600, "\312\375\227\367e\311\261\367\012\304\303\372K:\226\326\010E\235\355A\225\331j\026n\3264\303\301\324\214YnM\261\310\020\002bi\324\311\247\011\237{;\013\216C<> \017-xk\370\265\303\333\311\014", 64 },
{ "J\242\213\023\026l\3506", 8, "\303\020\346\376\230\303\347=_\355#\0015\363\345+\233\216\203l\347rSa\272Q9\336>\034\257\233", 600, "\3331\377\232\361\326D\362V#\2124l\237\327\215\231\375%|)aM\037\201\030\027\341OxFU<\306\302\355fO\326\325\242\177A\254\316H\247V\227\342\032\377\002\256VY\220\303\363\206[j\222\226", 64 },
{ "\222\360%qi`\034\316", 8, "\370Hx\232\025]yH\337ys\310\032f\317g\371\315-zT\225c4\033Uy\021\314\013\337\260\247G_4s%\261\004", 600, "\336lk\337\003M\223\020y\344p\356\250\000\301z\337\263.WN),\335!\375\227\210\367d\263Z\214Y\330\333\264\030\004\326\011W\005\323\3448\354(^T'\200\255\301\320\012\355F\240\271\203\012\353\313", 64 },
{ "0\015\376\022\354\343\255/", 8, "\304\347\345\335\327g\331\204\343\025\246\030\247y\365-\266\264\361\212\366\211\035\216\276+\235<\371\321\226[\250\336\346tn<}\247\2076%\231\373\227o\351", 600, "\201\306eLu\262\032\355\246H`2\246\247-\007\217H;\017\370\277\237)\275='\001HG$\134\223N\000\335n\304y\272\205N\2265\310\305o\250# \235r\312\236\217W\324\360\323\007\351\215\232+", 64 },
{ "\030\253\370\026\377\013s\252", 8, "\337\202p\313\334&[ql\346\042\350\016\272+\322|\004S5d\223]9}\250\253EW\357+\215\315\255\246\023\352>\274\001\027\231x\225#\261:n\342\012l\253\005\036\134\327", 600, "\223\241\274\227M\2322t\205\027\016\377\267\015\350\012Y \321\217\000\305\305Y\322\301\260\316\230\200\003rQ\235\245\177\003\305\342\022Iu\375\323>1W\002\013\321k\264\334?\225:!\377\014\331\206\270\371'", 64 },
{ "a\033o\014\314\261\004\243", 8, "y\340j\235ZH+4\023}\372=4\262\303\213\134|\220\252\255\0014\021\262\355\224\212\312\341\277 l^\021t\261S^j\007\313N\005\277\340\224\345\320\346\226eH\042\313q\271i\317\023U]B\331", 600, "\355=1\261\000\236>\260t@\241\370\305\323\2139\016\316vb\352\2533\336L\015\371\321\265\211_\273\177c\311UAa8P\263\017\272\037\217<\201\327\205\002IV\227\034\273\002\002\3312#\243\225\327b", 64 },
{ "[$\035\042a\220:c", 8, "j\312\316\373\207\241\335\304\0327\033\263\274[\305\234\371\224\253\012\266x\340\224V\230\335\374l3\320L\252\306qA\344\3069C&H\265\211\306X\347\311:\376\223It,\251\300!h\24791\371V\007\375\233J\032\330.\236U", 600, "`l\213nT\353\237\304\251I\256 >C\231\000X\377\332\206\204K\262Z\353\327\022\265}\245y\232\3368WI\332/\213\316\042\371\200\033\0378\322U4J\363\360\357\350\361*\367.>\363\377\334\0232", 64 },
{ "\354\304\015\017\355\240\021\276", 8, "\247\274\225<\353\357\376c", 700, "\374\221\245\277Y\007w\274\375\266'l\316\243\333\312\223\257\301\270\303K\337q_\331\354\347\376\012\223\275\344\001t\373F`\235\302\3108W\332\205Q\223d\004\207\223aki\277\307\313}\326\254\234v\042\341", 64 },
{ "IZ\367\257\273\377\332k", 8, "i\027\226\010\004~\257w\273?\222\224\212\274 C", 700, "\253\034\346./iA\3661T32Zw\312\266.\357\034\032\202\213\332\320\356\356\327\275\217\251\326\356\042\377^\270\362\346W\367\353\237\331B[\021\034\310& Me]|\355\274\207\325\372=\373iR\177", 64 },
{ "G\334S\242\304\334Y<", 8, "\330x<\264\323\016\237-\300\231\260\364\210B\314bW\255/\235\014\277\3450", 700, ";U\042\252\241\200\357\247\366\020?gb\0358\231W\354\331\377MS\273 F\3361<U<Z\330\257\327\036\273Vrw\017\241\310\221\332\200\221 _up\365,\346\030\231\206c:,t\227*\276\335", 64 },
{ "}\276z\315\217\015\352\372", 8, "/K/$\233}sC_\300SM\357\361\355\006\376\303\177S\207\317\322\200\300\2030|\272*\357\201", 700, "\012s\226x\326\261\376\341\276\240Yf\256p\027\235\363\0332#/\275\005\372@\241\202\362\237\256>\313\377\344\361\004edjn\276\261[\0221\225\017\3731\203`\350a\301a\005\036wwQ\034m\323\226", 64 },
{ "T\236\334\030&\300sl", 8, "\006\377L|^\220T\213\307-f\214\024\215\251\366\224\240\250L\364\346=\224\001m\206D\335\375i\371.\261\3026\364\270\225\320", 700, "|i\376\031T\307y\012)\250\211\242c\200\244\370\232\212\206\316$-\031~\274\264\302IJ\243\356\367\232C\314c\013U\037\236\305\313\264\207\322}\273VHX\300\321\002Yi\237\261\345e\031\005{L|", 64 },
{ "A\313\345\257\373[@]", 8, ")\227\310\042\306\361\235\256\363y\337\341\265\3144\344\012\342\3540\260>\343\246\214id\013\254c:\203>\020\365\267x\243\013B7w4\235\267\015\330,", 700, "\0428\377Wc\042\366\266\227\254\030_w\263g\202\376\326\267\253\336\265\353\026\200t\017\354l\227\352\314[;\364\263\361\203\215\220\374.\272\042:.@m\033\250\274}\3646\000\330b^\363\364\327(A\015", 64 },
{ "\210\332a\312\367\024()", 8, "]\215\337\017p\215\251/\2747[\206\312\314Zk\267'\324\223c4\265Z%\315\210&\014\021&\262\270U\274@\374\221\0262\2720\3360?\274\214\330\302\373\240G\205RwQ", 700, "0\3646)\364\337\3250\333!\010\356\306D\241]wn\353\303\265:\374\315~6C%\250\346\234\231\367\330\367\220\221\324\255\221\375\344mc\271+R\324\374z\027\237H?k\343\211\022\014\375\134J\256\014", 64 },
{ "\305\354v] \232v\253", 8, "9\230\361c\001XS\355\303\361*\366\267z\363\226\237\331E\336\222#\305\037\326\005v\336\375_+=\277\212_\0269!A=\235\007h\254\370Z7K\346\277\246\360*\015Kb6\303\022\224\322\026M\313", 700, "\253\232\256))\226\212\353\237S+\307u<>$\3440\367\363v\222\250\321k:\323^\234P\351\236f\205?\003F\326\016\355\311\244\023\346\321\243|\256!\273\2243y\226P\026\323m\250\306\360Q\267p", 64 },
{ "\001\363\342\257~\177S\275", 8, "B\012\033\376\003<9&\264 \214\003\212\001j\004;/\321@\231r\267\024\302\270\344c\0306\262\215\205@\263_\360\033j\3177Z\220\042E#\206\231X_}j\012\340\365\325\336\376D[\273g\366O\377\300\265\373\256\203\2779", 700, "\013\331\003N\240.\215\336\022\230\317\271\042\376lv\311\036\305[f4\351\314\237f\323e2u2\272g\225\261b1\027\246>\251\235\261\326$\243\201\342\250CG\224MY\3737\225\312o\355TU\032\275", 64 },
{ "\017\327\331x\230\001\363\353", 8, ".\331\317\373;\330h_", 800, "\265udMk\214\004v\236Q\366c\336\020\010/\243\236\262\020\320\004\016\241\371\242\232i |)\240\305=\266\316\201\350UAY$J\243\230\267P\377\011\000o\033+\211\236\020r\356|\261\317\033\355u", 64 },
{ "\032\276\352\212\347\313\231;", 8, "\311\365\134;\311+\024N\037\134\0020\362\354\324x", 800, "\276\004-\013\036\334\372\350\311\270\306T3\014\230\351\015\230^@\330\342\304\324\034F\264e\367\013\273\355\251\260\271O4\257\020x\362*\354il)\363\201\017\232\032\344:\312\037\005\341\325\3720\326\366\002b", 64 },
{ "]]Yk\304T\222f", 8, "H\031\273\324T\210$\267\222\324\027\270_\2514\214\347\317o\177C\272\313\012", 800, "\325\007\134%\256\3015\242\203%;\261\350\324!\262\367\002H\177\355\247Mk\042m\373\263\306#\301\3472\354\344\353\031\346\246\017\202\342\306V\005D\266giX\205\012\016H3\231\344bn:;v\225,", 64 },
{ "\346\320\306\0348\265\356\000", 8, "\376S\210\356d\366\033O0\352\265\314ZV\263\3701p\023\262f\227\356\025\361\002EV\204\337\304\206", 800, "Z\2104\306`\244\211\342\010\204%\343\240\207VL\375_T\342\360\031\017\257_\207\345\327\014\347Fn?\331QY\310\375\334b\244\337\241\003\370\202\0356!\305\326z\330@\201\0241\244\332:v\371/\264", 64 },
{ "r\206Tl\304\226\231\356", 8, "g_B@\2277\267\027l\314\247W\306\346\221\226\223\201\013\263R\245A<\024\177\007\230\222|\216\331~\233{\350n\244\341\362", 800, "f8ma\263y|\237\2600q\021'\276I\3642\276\344\255\345\032\270\273\032\262\365\026\004\364j\211x:\330_\207\250\336\311\016g\376\261\366\307\345\223\204k\362\355\252l!\357X\211\003\035L`]\341", 64 },
{ "\016\320!\037;\311\210\213", 8, "\347\042\302\3575\315\031\013\267\340\377)\031DY\177`G\316D\251\025\327o\311\233We3\236\022L\017\354\314\342d\207\343\017\345\235\010H\210\225E\345", 800, "4V\003\007\215ht\377\262zSoW\277\3314\316L\376oAw\367\015\224\304\201\2176\277\375}9r\042\304hZU\374\306\202\205\354\2167M!(\371]\313\357]\233\005\345\256N\252]\177Q#", 64 },
{ "\347\274e\2157\327\016 ", 8, "\272xp\134\303\305\032\372\217\330\225\227\354\372?D\027\354\212\376\311\236\260?H\362\257\006\261\003\350|p\266\331R\363\036{\332\335t\021\327\213.\253\202Ss \335\252#*%", 800, "\1346\322\026\247m\011\012,\203\263\2449,\344\250\235\360|t>\225\277.Z\215\037\226)5\356\345JV\334\234\211\357c\024=\2534\257\026\225\005\023\221\330\275\010\246\011^\374\034A\246Pd\212\234\317", 64 },
{ "Z\207\036\243J\207\322D", 8, "\323\326\355\204\245}\341\034\322\331\364\234\240\241\260\2203,X\355\362\335O9^V\212\373;\214\342\334\020\316\234\214\324H\317wH_\313S\257\335\240e\007n\372\036](\317\024\331\231`\031\023\002\243\033", 800, "\224\343\262\023\213\042XE\317\300\260\327\316\217{{\322\307\234yqc\011BMd\312\373\375M\323]@X\3400\012\2175k\235_X\307a\134\023\376\035\323Z\312\011\376?\346\006C\356x \332\323\227", 64 },
{ "4\324\256]z\277\006\304", 8, "Os\324\324\223\211\353X\217\245\344\317\334w C\265\024\371e5\007\235\230\364CH*\036\243\251\222,|/\270+\31386ywY\202.ByB J\245p\237(\315\024l\362\240SC\352\261D\24176\026\024D\023u", 800, "\014\217}\334\346\012\202\320\323x\317\341\363\307y\261\134\355\0259|\237\224\200Q\002q#\232t\336\215\303\355\020\263\221\0257\205)\374-\316\271sj(\000\332h\303&\003\323%\3052x\035\230\3673\267", 64 },
{ "\2311\362\360(*\314c", 8, "\226\205\332a\235\200\177\002", 900, "\266N>\311\351\345\223>\327\365/\202\006\211\317\345\265z\001\276\340'\355\303QyH\367\311\042\032\350\331\012\034\261\327po\323\275E\317\000D\234\355\032\241\242\332]e\276Pk\264\000\211ia0q5", 64 },
{ "\020\277\212\360H>\226S", 8, "\333\342rh\323\302\366\223vK\376\004\340\213\316;", 900, "\344\254\354@\367\243\012\310\303\042\263\330\230\230\307\266-\011\134\024\221[\371\320\324\244\375^S\314u\303\335:<Q\220\026 o\356G\134\363\015\256\313\250,\0069\302eFSC9\211\000#\372x2d", 64 },
{ "\302\324)\317\203\362C>", 8, "\035)\304;g\254m\313n\232Rn\276\022\264\317.\210WB\272\026M~", 900, "[i{\304\237n\213\314\375\2223w\134T\257\027\265\307\015\264\016\022\245~\250\031\257\342w\211Q\242{\012\370&\003P\016\311\032+\235,F\260\362\327&2wxw\030\277D#\365'c\216\303A\356", 64 },
{ "\324\210\245\303\375jc\134", 8, "\003\042\006\004.8\256\321\013\216'\227\210\353\226.\364\037\300\351e\206\357JY\201\254x\015\352\023\212", 900, "\2727$\177\202\237\0142`&\034\321\224P\3620\013\367pg\371h\315 \134\227\306\241\257\3333uS\025\206\030\2704n\013\354^\032\034\266]\024\254\000\256\356\2356\331nz\263\310Q\2178\201\310\320", 64 },
{ "\322;F\214L\230wH", 8, "\330%\316\307\264\310\375q;+\256*\315h\300\274\215yZ\320\360\203)\353|\310!\016u\260\350\222\323\177\303\226\212o\3255", 900, "m\267\007?\353\220\220$\231\316;f\201\253X\312\320\006{\307\014\334s\3257\277[^\0055\2567\134\270yr9A\342\273N\217i\374\314\364\301\312\335G\036\014R\341|w\323ei\226\014I\034C", 64 },
{ "\345\342>\335\2457/,", 8, "\355\262\340\201\134\012o\2011F\234^\321\211\216w\207\022[\361\310\004\236\256`x`j^\263v*\2250\336=*\340\017\317R|\00164\353<\244", 900, "\004\240\005\275jv\352M\360\350\036U\306l\237[\031C\224\205C0iT\370\242\011K\042\030\333\375\302^\255B\301\354\310\240*\323\257\310\222\240\354\233\221\346h\311;\214\321\240\341]\363\326\335\022\216\224", 64 },
{ ".\245\313\031\277\374\042l", 8, "-]\026q\347=q\004<\002@^\242\277\355\212\334\337M\304B\351\015:p\323!lA\357\204\206\364*N\317\363\016\016\230D6\227\337\347*t\243\177\021]Y|\240\035\006", 900, "p\006\336\010\351\337\304\260\372\210\267\013\231 t\265\231\274{%DScF\3726\320\205\275 \011h'\251B\363\323L\014V\260\362#z'\233\322H_\306t\273\027\353\272\021f0Q\222\244\0316\225", 64 },
{ "\014Y>\242\331\270\367G", 8, "\222\344 \364|\347CP.9\372Tu\341n\014\333\321\034\204k4y\312\314\363\323(\221\365\023\032\342Y!\010n\273\213ot\346\310h\304\220y./\235\342Pg\214\037\217\352\316\374\276\3740\256e", 900, "\211\042{m\201\233_\3020\350\237<\315\272\256\200\010\323)\210\210*\042\200~\266\343\177ic\212\300\363L\215\271\022\2609_\361eWbF8\203\271\363\214t\272\275X5\011\355<\2233[T]P", 64 },
{ "\334\023\304\233\305\200\206\272", 8, "\314\332|aD\003\341\033_\3733\374\263\042L&9\014g\336\253\355Ir`\004\014\377\306\2031\212nX)uG\236I\021\031\337\336u0m;\3126u\332\025Q\370u\303$2*YH\211\343Z\3628\237\274\2061sw", 900, "\005Zx\257\262D\357n\005b\014(\012\277O<\313\361M\331\373mB8\031\215\035/\247\005B\343\346\305\337o\024\275\357|Y\235@\221}\202M1\0325\306\325A\253\250\241JY\326\255\032\272\314c", 64 },
{ "Z\270\301ED\237U|", 8, "\0272-\237\010\275\377\042", 1000, "\360\355\220\212\252\371b9P\343K\301,\024$\227|\305\346\327$>\215R\243\214Vs\273W{\306\234x\347Jlb\211\355\321\310\015\002\267\352[\210\335Zl\341\023\236u{\225\264\027\370Wc\343&", 64 },
{ "\262\3435,q\037^\014", 8, "G\330\246\256\356\260\201)P|\336R\254\301\265m", 1000, "\314\320h\267\227\350\034\216p\334\250\372\230\300\273\220s\352K\341\347\253\317\321\362\042R\311fN\177S[\376b\354@R\320\010\251W\374\256]\243\262NO\000\206\347\005\306`\215u4/!\365\025T\026", 64 },
{ "\033\341\202Z\263\274s\025", 8, "\317\320\367\371\200\035\361Z\240oE~t\347\300\227\330V]g\337r\316@", 1000, "\234\313t+9d;3\226!\325\256\242\211`\323\030\352\336\377\306\215rZ\263#{\306\037{7\307\203\325M\032\031Q^\260[8$a\272\215\337?p\022A\335n%u\214\232\303^\352\241\251~\247", 64 },
{ "uc\214\232\3031l\300", 8, "\013(7Vl\341\013JA\276\222u\345\271\363\015\134\317\340R\214\335\312\245\264z\324\326\366L\344\250", 1000, "'\352\216\246\314\215\365\333%\334\202\342\334\352\347\211%\312\215(R\312k\246\330\207\223\004LhVFw\374\322\331\275\265\334k7\343\013\312\010_\264\362b[\254\366\226\224hvgG\307\200\347\216\033\036", 64 },
{ "cD\020\266.C`u", 8, "\247&^M\360@\266Y\365\322'\367\262l\376\250\042KU\360\237nOl\207\346\2520\203\0428\003\332o\344\0046`\226a", 1000, "\241u\001\027W\202YT\341\275\204.Y\242_U\016t\003\025\001\340\304\213\364L\264)\023\346\031(d\234\256\313\204\260\262x\220N\017\274\340\315\000\276q\017\001;x\375v\004\025\300\276U9\336\260\375", 64 },
{ "a\0162\201\011\221d\017", 8, "\256aW\215\327\374\235\334;\303\032\021\037wg\306K@\001d\213L\244>\343Z\234u\336\313\024b\344`\233\271\234\333\365\305Z\306\0218\310UK\306", 1000, "\304\023e\243|\032k\320ni\270\002\252\306\036tZ\015j\373\340\331\207\245\347\032\261L\354kh\012\356\363e7\015\334\352\206\036;\320~\331\260\330\003\257\310\244\364\244\370\305\233:J\363\367\324\362\025[", 64 },
{ "\324\304\265\306\270\217\276\015", 8, "\276\027jRk0X\215\227lG\236\240RpJ\220N\005\250b\345tQ\221h\321\354P\371\035\244$\256l\023HZ[\031\255- O\236\222:\267t\254d\313's\317\024", 1000, "\250\316\327\215\271\374\206\207\220\351D\263\306Q\362\366c|\273VQ\241\016\377\004n\314f\215\253\305\321\350\236.ZjX\037|!\314m\331\3775\011\034n_\263x\267\345\241\322j\230l^G\334\256L", 64 },
{ "\030\302&\234\200)\230\305", 8, "+L\221:5T\274h\237\256q\323\353m\333fh\201}Q\351*\351\240\267\276\327\007\254\316\214J\342\350\351\367\367\266\301\010\3775\015\014\351\337\3264\355K\027\355\327m\300\241@?#\232\225\263\037\007", 1000, "\201\355F\216\035\037@\350_\232\325Mx5\353\004*\372\250\370%X\247)\315\324\314\256\315\242}?\373L3\346a\331\302\134\334=\237n\275 \330_OZ]VW\007q\312\254\244\276\024\034K,C", 64 },
{ "?\362\015\253q\331|\250", 8, "}\020\020\337\215V\263\334p\346\003G\363\301A\333\134\177\222w\271\262\306>m\2774\343\006#P\260\306mS#Gs\250\363u\230\227\377\015\361\235\336\273V\230\316\214\276l\201\272\241}\361\260\357Aw\015\263\246/\366\026\375\037", 1000, "u'\305L\233\270\032\326\225\2422\323\347\335g\374\270\023\352E\305\332\240\231\244\035\343\226\322z\264\346\354M\036\211ye:A1\257K\236\215\333B#BV!\333\245\336|\217\317P\257>\257\265\252\003", 64 },
{ "(\134\324\014\245*\260?", 8, "\263nO\374\320BL\042", 2000, "\354`\262\357X\301\351\240\333\374\3536\307\367A\273gVR\366B\1775\217_]\214\016\2641j$kE\201g\270,\276$\213\205\250\237\005\211D$\351\241\334\222\337\326\360\372\277P\002k\224\235\2137", 64 },
{ "VC\260\247\227+K\325", 8, "\214y\202\334\330\323;\206\274k\026\333#X\247H", 2000, "\005\366 t\203\277\030z|\241z+\222\344\134C\306XV\367\042\032Y\2074j\211\034g~\013\263Z}\354d\342\246\005\011\250\230\244\222\336(\224\320\320\221\237lj\227\003\345c\311P\023t\000\243<", 64 },
{ "\226\264\332\250Q\332\033?", 8, "6\177z\010St\034J\240\224\003\367\252I\322/\034ZS\243\322\307\374\311", 2000, "\225\325\364`R\004\354\021\306\2123\337\341M\273\023xsu\030\210\267U\375\011\223{\002!3a\031\254\247\200\302\265\016\277\301\235\024\014Vj\363\022\367H\224\372\205\337\302G\035\351\257~\316\371\252D\342", 64 },
{ "\347\016\225\220\026\324\301Y", 8, "\351\314\237M\230\305o\321\374\374\253H\236(*=1\364\203\007\210\344\001\245\2736\022\340C\314\265\224", 2000, "kN3z\003R\340\020D\033\221{\234\352\211\201\315\356\017\234\370\270\214\035J\335KM\255\200I\010=:\3512\030\260(+\257\276\275\001\361\263j\030\002\224\352\372\031$q_\023\330\333\021\233\240\222x", 64 },
{ "\340r\267}u]\377\350", 8, "\242\360\243\361\363\020jX_g\376\016X\352dF\022;'+\306\213\375\036\224\214A\242L\022\334\025\231\015\267\305\001:\032\270", 2000, "\230D8\251\010\031,p\016\330\310\233\241O\031#\310[\324u\261\207\2042\361u\310;\366\342[9\201\005\037\20261\316\351;&\273\325\263\305\325@\251\027\343Ak\225\270\014K\342\037\015\305\247e\231", 64 },
{ "\013n\007\254\357\255\217\340", 8, "\334\015\217\312\237\315sW\026\357{W\321,\031\034\374\023\2720y\251\235q\030\2170\357\251\366\370\364\312E\205.w\273r\242`\246\005}>,\231\250", 2000, "w\210\363\2605\020\134\374\231\024\327\314\205\310\325\247\033%\322T\226\271@\302\004\266q\304\345\326\275\347\260\322\361\2435\344\010\356\300%g\307\217K\0423!`R,\005\327\201\0037U\266\2705\275\343r", 64 },
{ "\202\361W\024^\252\307\235", 8, "\356\247\020\315\037(p\361\006\223 \261\035\332b\222m\236\027\367n\020dw\323\247\3017:8\034\256\302\363\263|\273\134TF\260M_D\3418h\237\365\260\262\257\007\344\231\351", 2000, "\327G\376I\211\335s\3060\367\277\200\015\270\327\351\023\3539\245\203\356\244\367Y\244\340\277\207\235\360\027\347\352\343.\301\3570\347\330\324\352\353S\242>\324w\213\271\262\013\211\250\035\261a\011\271\370\034\3633", 64 },
{ "\207-J\204\243\334\335\016", 8, "\261\134\241\340\024\3441\306'\32061\256\202\267\232\370\2327\257\357\342R\202\326\345\300\362Cp\315!;\320\305\240\013Zm\234\343\217\373f)#\223\343s7\320R\342d\224\027\212,+\304\262k\243l", 2000, "\271\317r\177#\201M\306\320\314\317e\236\042k\031\032\242W\364\321\255\026YkJ\371zp`\337\264\212\253x\034Ef\2003\214-\370o\277\305\3671\355\013\320C\247d\214nA\273!C\375\025\2218", 64 },
{ "\300H\213\371\272>\337\241", 8, "\001qO\241\310Gs\274\036\375\272\362\033\014\256\327v^\037\321\246\277e\224\300\235\231U\367\316'\014\327\232\265Z\033*s\302\252}xo\374(a\231\355\301\0350\021\231\024F\177\276\341\221N\316\025f\320\324\134\247\376\335\274c", 2000, "\301\360\262PJf1\243rl\320\364\320\017\312@~\240\031\206\211\261\330\035?\314\356\253\263>\016\252wt\341\213\001!\014.N\264\350\377]\243\234\245\354\325Au\353\227\236;L\333\332k\340\343\352z", 64 },
{ "z\015\256n_HF\264", 8, "IO\305\325\253\232\001\022", 3000, "\021\032\252P\005v\354\234q:\204\326\203U\2162\246\371\343\340b\327+\037\330\360\241_\215\134H\214c\373Ix\364j>\036L\016\355i\226\034Q\370\320'\320'\014i\336A\210Z|D\200\006\006\202", 64 },
{ "\027\035\353\321\372\222%>", 8, "\375\3772\334\316\222?\333\300\325\265\005\360\361\347F", 3000, "\231\0011>Jk\031l\324q\271\2308\316\025B\362/JA\010\370\021\377C[3\016G\260/l~\042\350_8\252%\373Q\275-\263}>\356\330\337&\005\265L\353\377\021\324~\255\371\346\316R\204", 64 },
{ "'\331\374\255\355\315\206^", 8, "~Wx\355\211\365/\372@\022c3\337\311\233\253\007\215j\356\264\254\321\032", 3000, "}\344w\013/\000n<Z\343TQOIyz\327\340,o\367\240}\006\023\233\010\0006\313z\311\343\007\0073\036\011i,Jp\006\210\201\246\225\221\230\033\205\037\361B\247L\001F\373\011\347\366#1", 64 },
{ "\207\214\016^\012\327\344\220", 8, "\335\222\345{\030\333\011\253\244V\255\206[\304u\202\265\202\312\275\232\314)\303\252I\375J>\371<7", 3000, "f8\205}\321\371=\330\3410\034\030\354\323\033\270\333\227\320vUS\336\305\010\332`\306q8\351\027\034n\372\356\363$u\376@\017\244\3467Ft6H{\264\345\275k\302G \334\202\275\257\375\242r", 64 },
{ "\241\364\000\231\250^_\277", 8, "R4\332\217\332\374?\341\030\277\345\025~Q\364#l\307\273\331\357\0352\361\373\246\320M\220\250\265EP\225\221(\236\026\332\272", 3000, "\177\243\277\322\005\134\016\015E\251\300\205\250\352\366e_~\377\251+\223\011\021\326\042\033\277\267\206\037\224\231g\260\031_V\341.\300{\243-x\025Q>\177u8\223\177\032\201T3\360\033\336\201\255\234\024", 64 },
{ "\020\011\277\006(\215\353j", 8, "\215\341\262\207s/M\323\274\341\223\322q\215t\177\225\246\367?\326\245Y\330\026\221:\370`u1\305\377\261\215p\311[D\0229\200(\205\216\341\247\230", 3000, "\236\022O\372{|'\313\011\216[d\364\210\030\36249\2122\266\221\022xD\266\363\207'z\215t\2448\007Be{\272\244\207\251\352\365_\353t\333u\355\317\327\327\205\222\250\003\330\201B\023\004#5", 64 },
{ "C\251\361u\026\34102", 8, "5\343\200wqFK\2739\260#\224\301\256\323$\247\033\272\322\346_\227k\274\250Wzt\3062\134VI\202\234\325fv\013*m\003\355=R\366\214\233\305O\333|\200\376b", 3000, "\030\177WT\007\014.\134XcB\245\202\004\363\021\313E\344M\216\332<\330W\360N\314\134\341\255\030%\031\323\024\035\312O\370\213\017\263\034*\261\344\031\356\237\271Oi\213.\276\315\314\367\222\212\027\024W", 64 },
{ "\311\254\331ZS\226@L", 8, "\013\320= \345\032S\317t\255\2550\245<G\371\373\277\254\243\377\332e\356\235\335\006k\224\012>\3062\232\316\241\002\235\333\015$Lx\376\026\334K\010\360=\237*;\007\134\3506O\352,\037\322\342\013", 3000, "\344\202\347\365^\026e&\200\260\214A\324\264\022\313\225\351\033\254\254o\357\255(\215^z\034\200\220\312K\301\240\227MO\030\231\366\020\031=\203\012\224=\024\004>\316W2:\363D\365\231hy\366\365j", 64 },
{ "\134#\216 D[\241\223", 8, "\017P\274\200^(R\220\266g;\211Z\265\036\345\337\360\2310y\031\330\206rF\253\254\375\271dr\321\367iT\304\2003fV\367\333\264\247\2370S:\377&\216\360yfs\202h>\327\347C\261\345\274\357q\037\331^\305\134", 3000, "\177\373nj\013\324\202\021\035]!)\370\370%\005\353\016~W\330\265\217\362\337\301Z\275\321V\000g71\335\377v\013R\335K\315\241\225\216qE\312\272@.\020\315b\247l\3359:\242\265\000)\310", 64 },
{ "\304\326\303\344\272\260A?", 8, "`f\262P\027'\211\217", 4000, "\012^\363\365\134\265*$\014\270]F\274|\375>p\341\003dT\242\337u{\314\205\307\260\360\322\025\214\007E\307y\365\352\310\240\372\134Fji\370\241\017\305\336\262\351\332\002{\026\270\376\363\266\134\274;", 64 },
{ "1\2004\011\006-\032R", 8, "\353\371\330A\261\263)\213u\007\233-\354\230!\202", 4000, "{o\014.\322\016\323\244\021\037&W4*\362\300)mGv\014\016\306\307\237/6G[\267\033\213u\313\266J'\276GtN!\000\216\363^7Y\037\370\021\014\333\250\374\332\274\235l\230\263\220\347\222", 64 },
{ "\354n\227\202\363\306j8", 8, "T\334\212\366\246\020\042\264\342r\271\317a\0047\322\317\354O\031\202\342\370o", 4000, "\312~\260\260\027\266G\247\236\312`n\335\342\262Ec\247\272x\001\003\252y=\002\362\362\004\326\350\007\0252!\263\312\360H\344\246\016\207vEO\022\205\212\306\276\251O\325;Gz\307O\266}\020\322\376", 64 },
{ "\360\263\275l\234\244zO", 8, "\335\375\273\001\261%\233,\007\350\255\247\342\235\310-\032\035\314\246\252\027+a\233f\204\274M5W\262", 4000, "\317\365.\214hyP\313\205\356(4Y\251\224W\367\263\361\027\262\324\277\255M\010z\263\314?0\025\003\367\332\236.\004\331\302\232\011R\332D8;]Dz`v\000\246\242a\247b\033M\031\270\011?", 64 },
{ "v\327\346&\035C\320\322", 8, "\260 ^\376\355\375\2567_\272\252\255Wb\376v\0057M\226\346\031\272a#Up\264#\015\311\342+\2128`(\224\224V", 4000, "`s7\365\307p\250\356x\310^7\320f\2442mm\242\0207\023\360\300\264\336\252.\266\244\202\134\042\311\023F\374\206\225'\371|\327R\371\277\357\307\304\250\352E\016\253\010N@-/9\257'\0235", 64 },
{ "\252\317\025\232\012l\372\275", 8, "\216\020\363\015\245F\277y5\254}\016'\272\204Rf\226\340\341E\230L\024\352\205\312\306\340\042\241\017\263\375\337\355\013\020KJ\273\342\3572^\313\312U", 4000, "\222\010Cw\275\317./j@\012\032LH^\222s\205\240\335\011\026\310\275i\246\264\347\305\302\365\302\336\221}R\016]\231\006#G\321\222\255\215E\262\272\013\202\260%~\027\350U\031\220(U\210\221\314", 64 },
{ "\035dQ9@Z\267$", 8, "\204]\013SSO\332\324\322\327\216\362D\203\253\241/\262\21093\374Z\213\001t\376>\207\024e\273\371.\037|\036\334p\005}\353\277'/\346\014#NP\362\2504w6/", 4000, "\252BW%6\265\317\000\271\024C\010C\202nYZ\027\006@\334\321\365g\371z\017\3469J\374\262\366\242G\200\017\363\313\223=\251s\213`\343\362\007\000~_CV\336\207\240\352F*\313#x\212P", 64 },
{ "\344\263\246\321\357 \003\347", 8, "aT\363\245-\012\023\032\333\253\3049D\372\033\332I\370\005o\267\177\340\226\211&\356T(\210\017\355\372\003\207\277F\012\010\221\213\274s\314\200xLST\260\375\217\013\331wG\240\343\344\347\347\301\324\302", 4000, "\324\336\003\003\337\337\215\354\327z\217\0319E\000\020\353\011\366\347\001\035x\3660D\332\014\276\374\2363\3635\026\227\031f0G#=\015\213\275\210\237\032\207\342s\002\263\2438h'\301)M\351\213\200\274", 64 },
{ "fJ\325L\311M\364\333", 8, "\2640\311\202\3471\2310\011\271\345\002\265\225\257>\220\277\205\311f_I3\247|l\351\222\341\353j\240|2G\035(\353\203\250\031Jl]\317\226\223\343\205]Z\324\356\245,\264v\030\333~t\035\220*f\027k\207\364Yr", 4000, "42\335%\022\372\310&W\2374\335bp\217\247m#\210\006\207\021\371\134N\306\335a]S\274\350y\247oZ\024\272j%\326\213;\324\273\347w\300E]\347%'Z\261\206w\2350(\265\205\301\302", 64 },
{ "\363\237$\002\006\023\357\001", 8, "f\327\370v\0061\026\200", 5000, "\331\303\025\301\344\370\222\004z\275\364\374h\253Y9i\027md\032\020<\042\017\250\261\317%#ne\303Z\324!\354\300\006\235\374[Y\341\036`\373a0\357\357\015\246\3464\352*'\241\272-\317\325M", 64 },
{ "\332|{6Q\346v\313", 8, "\134!gL\026\024\376\2430~\306\2743\232c\206", 5000, "3\325\201\34598\202\330\263Y\005\244\321}}w+\245:\274\177\255\365\265\000e7\375\312gc\261'OG\266hPp\365\250\364\042\333\373\323|\205m\005\2572\021\027\271]\233\360\216-;\210\371\274", 64 },
{ "\333\220G-\240N<G", 8, "c\353\354]\365w\033\206\365\244\366\247>\205\232\303\177 \012\324\374rl\034", 5000, "U\342\2200*K\262\010\177\273\024\2455|\367\336\2311\225\366/\005b\305\345{\233\301k\030\023?e\250Cf\007\134\036:\377\213\027)\353%\323R\322:b\255Rqr\007!\020r6\305a)F", 64 },
{ "\234\004/\345\032\000v\220", 8, "ar\031\272\305\245\232*\007\247\025HL\274\010\336E+\311\336\2557\266\300\263%\3031\337F\227<", 5000, "\320\254\3477Do\003\227NL\334\355\217)\317\302\221\344\300\320\356\204\266\350\305\223\275\273&r\327\014\261\352\324@\356\032\325\221\330C\346\202\233\013\007\304\031#h\202\244L\207\236p\351\371\335\213O\341^", 64 },
{ "k\317u\332\217\324\322\216", 8, "\177Te\253\271\260\255\276\353o\223D\324\001s\317L\033V\242\247,\2566\233\206\313\315\014\332b\317\312\134\322\216\314d\344\344", 5000, "\316\021\033\027\375R\207\327\021\341\340\253Y\230\016\257\355\024\027B\226\322\346\025\017\2429.\336\2262\352\324\375\225\356\367\353\235\012X\011\361$Q,s\240\033\372\254p\202>\343\034^\303<\211\242\273AA", 64 },
{ "`\226\222T\332\377\223\015", 8, "\351\350a \311\352J/ <U\222Hk\374\355l\264\236\357\307\205aH\004)\377\340\277\355\272\274\252\351\360\364\331\310:\236\032q{\211\331\036\016\007", 5000, "\240_\025\006Q\261\013\276\237G4\304.\260\203V\320\372\010@\334\233::\330@z\227sz1H\0061N\202\365\341W\244\273\357\360\222\333>\015\270I~3\360\2378\265kP\302\371q\202\3006\000", 64 },
{ "\303\327\253eb|\362\227", 8, "\30630\364^\006>\227\224\315o\217]aL\236*\256DZ\270<^N.\326\014y!!Ng\375\325P-v\220\341\206\315'>\314X\315\364\276\014L\324\212\374\354e\230", 5000, "\267\272\262\235\213^\042E\255\330\372\010&\012p\354nBG\344\246\266#t\300\237a\271)\275\010x\356b\274a7^\327\303S9s\343\203\236!=\332n06\241\312\254s\335\265\334\356\324\367\177\375", 64 },
{ "Z\3378}!\257\020\301", 8, "\301.\2642Q\250\277$\271\334M\307\250jz\364\354\361+K\322\275\343\242\322\021Z\2747\333\213\241\224\011\0320j\267\011\337O\023~{7/y\350\012_\202\331\216L\206\003\006\026iQ^\310\036\360", 5000, "\216\202S\222}\336pr\331?\232X\323M!\202<\372\263%\353\264\334\035\370_\323<V\336H\234\254]f\315\335\357\255H\313\245\270\343\205\232\262\201\246\261\310\315\333}\266\340\204\363B\256:\300\006\365", 64 },
{ "\344\342_\244\230\227\337x", 8, "7\255\0124\272=\224\246\241\357E\2452?<c!\223\037l\252\222\316\362J\034\204UL\324v\015\234\252\366I\351\212[\267\312\003_\275\364X\312\204\006=\3528\253\252~!\202\225B\203\3253\333\005/\270\222b\332\342\001\020", 5000, "\342o\255kBZ2\361e\364\203\035\013\343\323!\276\331\271\207WE\207\375\304\222 mI\365\377\332\270\042\344\032\033\225oe\317\247w\336\305\345\3711\321\226.\277\2514\327\031\324:\347\255\227\006 \323", 64 },
{ "\344f\014\337\306\314\200:", 8, "\274\251\230\012(\271\313_", 6000, "\317,\335\301(<M\214r-\333\206$\325\241\214\304\274\343\037J\015\305\245\026\314\373\270\317\271\314\3022|\232\271\214\020\200\036|7\271`Ag\2151S\036\266\234|\333+\376\200\261!\315\26021\243", 64 },
{ "\212>\363\217\322\014\301\177", 8, "\344\303W\177\317\032+u\032B\353\375\317,\225r", 6000, "\212\205\266\373(\344\246\213'\247\262\257\030vZ\355L)\242\375\353p\227\3250h\022Xg\356\310\350=\353\247=/k%\021\364\030\223\013\272-\177\277iX\005?\000\200\325\310\245\0137\247\365\034\234\007", 64 },
{ "\235z\200\0425D\206\326", 8, "ZC\014\243\032t3g\336&\0058\016`U\317\210K$\205\236\264\274\224", 6000, "\233__\371\276\213\263L\005\211\250jO\042\364m,B\020S9\014\332\263~`R\334\236\020\224d\374\037\201\311\327\262:l\221\315&\277\351A\251\262\000\012\200R\203\360\011\371.\373\323b\000\316\277\275", 64 },
{ "\013\216\203\231;\177\030\022", 8, ";\250\2605\215\314[\2478\314\343\342gM\352\211\020:\336\3271E\260\042\3444\274\305\234:\226\221", 6000, "k\255\012\344\344\350\306;fm\253<\277T\017\020?\234\215\216A\373\303\3375l\325\333\027P\301\006\214\221\202\375\342\240\213\012\307g3`\377@*F\3518\000?\010\002\021\005\023\227+E\177\363\022\236", 64 },
{ "\211\354\257\301\023\201\377\374", 8, "t\235\202\224\274\013\350\134Cnm77\352w\200B>\250\213\211l\275\357\234/\004\342\311\216)\260a\016B\216o\253&\317", 6000, "\304\225\214\273\016\374\375V\215\207G\264?/\273*\276\257\343\012\234/\025&/\017\331\211\355\016\351+\301bS\004x\017\326\252\032&\205\030\222\347\272\002\036\231\261\033\200\276\330\367\007\252\376\005#\217~\212", 64 },
{ "{\355d\364\020MGs", 8, "\324\301)\225SI\220\322\320\333\263[\375\2154\006X\303\014\275x\300a\313O:E]\011\236\134\203\344\220wj\231\320\300\015\222\321\324\177\341\320\237\372", 6000, "]\005'\026\210\036\250\037{}hs7\254d\327\243$Ch\000.\011E|\213_\347\3579d\342\321E\212\334\251~\231\221o9\006\323\317\013L9L\312\206\357\372\007Hv\234Q\311'+\001\276\034", 64 },
{ "DR\0073?q\272\374", 8, "\250l\002\017#4\320=p\032\202\257s\207\352\347I\373\244z\377jD\227<I8\210\213\306\372,\204\324]']\271\346\347`$Rw\261\224\037\006\242\216\245 \027%f\351", 6000, "\005T\364\022\034\357\242\240\243\2461D\0034\313\322\232\340\363s\335\233\245\003Bb\230\037\033[$L\276\013DJ\024\234\306\217\246\013\353\270\262\3364\245\324)\342\352S\253`\027\312k%/e\373}\261", 64 },
{ "s\355\341\224\375?7$", 8, "y$u\342\341\261\215\244P\211!6\034u0Z\251\335$\354r\306o\3605qd\237\344B.\274\234\231f\036\260\032!\267O6(\366<\250~\252\276\250\332\037;\205vo<\353\376y}3\211k", 6000, "\310d\310\246\367\305\310\013\003\330\037\365>\214IG\364\206\004\322\261-\217\305\301\214.\314\206\373p\341 TSu\323\377L\373Bu{\032\247\370\270Q\260\307PZ\337\203\304\235\004\254\354\322\363\260\001\004", 64 },
{ "PB\323`z9_2", 8, "\373\317\015\021\275\311\335\315\323\231\212}\307j\336::\201\343Y\210\042P+M\263Gh\031d1\034jz&\134\366\363\012\374\274\212\244\315j|\207\331 \345\312\027x\026\261f\016\311\035Mt\370x\243\323\3550A\014R\033h", 6000, "\134L\334\310\334X\035\356S\015v\243\242|\002\037\305\022\375\372qK]\020\300\226\001\334\310P\357\376s\203\225 \037\305\373o\261\020\303\264\370\256\262\337\237\251\273>:E\335e\260\316\246U`c}\016", 64 },
{ "\027\223!\256N\260<\200", 8, "\020\374\203\034\005b\230\201", 7000, "\302I|/\305\025\001\003\233\244@\332R<&1\333\030B<\010\3315\267\213\317\231U\225\303\336S\217\037\337\212C\202\022p\270\207o\205D\177!}j\221\215\027)\306~s\004h\323\342\336Z\252\377", 64 },
{ "\201\016\210\273m\345&W", 8, "\253\363\011\215\2646\222:gr\001:h{\012Y", 7000, "\244*>\204\042@\302A*b\010\024j\270\220P!\2114\327\031\237\304\231Lb\303\336J\325\321K\263d0\200\327\005l\320\344\336\353\323\012y}N\251!h\275\363\376\320\225\341f\246RE\310\2418", 64 },
{ "\276\257\256+\244\247\211\226", 8, "?\235\347\030\024\362ng\234\254\017@\033\321\331TO_\255\277!\042\233t", 7000, "\216I\365\206\200\134\002\353\213I$\327$U\275\240(\351\352\2738{\313H\202\275F/\322\013h(8\263\205\326\303\042\2621\032\204M\264hT\221\205\310\263\214\273\262\313\221\267\206m|)G\324\241\025", 64 },
{ "\2020\274j\042\224\231\221", 8, "\334\260p\216\333[3\014\301-\223\026&\315G|\231\207\205{\310\336@H\246\3257M\020\031\362-", 7000, "x\213\321\215\223\332\313\016\323\012\310\330?o\300\277\177j\312\220\255H\247&\366\232BX\232\352\362N0\225=\373\010\260\027'\271v\376\220\324\263\225~\354\035\277r\222f\221\260R\253\215m\203|$\334", 64 },
{ "\372+1\367\246\333\271w", 8, "`\220^\277$Y\341q?\315!\014J\221\210\242\232ySd'\354\361z\306\301\016\252\274\342\267sso_TZ\200fe", 7000, "d\224\227\252\306\204\012g\201\237\314i~\216\214QV(1C\271\320\233K\341\351\313\005\342\343>\361\341\377\030\204b7N\340\356\274Ma\023\212\314\222\240\211\033\013\211-\356\264\267\027\262\005\313\270[\204", 64 },
{ "e/\227\361\021\350\237E", 8, "-NQ\342\360?\267#\011s\303\241\227\353\232\227\010f\003f\012;[\022\217iu\317\024g,caX\370.\214\321\273\035|\337EB\014\2636\235", 7000, "\247_\330\233!\237~,D\351\274\202\265Z\026G\224a}\277q1\250?\023!\276\011j\254e\233\255\374\246b\024\275ss\200\031\036\312\322\257i\357\367\371\022\324\213W\014\246<}_\003G\317\204\247", 64 },
{ "\230\373\305\254hVc5", 8, "\362\306\303B\214\210\020QR\316\205\356\241\373>W\307q\237\261\227\355\251R\334\332j\303\231\202Y\356~\213C$l\353f\017\031US\334\324\016\034D:\374\345\252\235D\303\214", 7000, "\331[#\367\002\331}\306\266\3258\246n\226\357M\204u\226\320\306\323n\015$\320\247\305;\265~\2478\025V\364\222\366s\240f\270\314\034\250\277\347d\275\351\326\310]\213\244d\264v\303\317\371p\235\263", 64 },
{ "j\332\311\021\016q~\273", 8, "G\026\002J\024d]\255~\231\271\322d\335T1\203\371(\350\331b\013\302n\244\004pi\231\210\205\332\327oE\205\345\011\300\216df>F@\323\020\240I)\026\335\362\345ndx\321b|a\304U", 7000, "\371?q\263\265\2344%\200;\333\251G\020E\316\333\331RD`\275\260\006\261\356\332b\027Tv\251\243\001S(p\361\313\011(g\327^\241\0030\376\365\3425\376\363\307\216\234\316\216\377b{\310\347\003", 64 },
{ "oS\366\311V \247u", 8, "\217\350\316\355\003>f\334\306W\026\213\307? \304a\245\370\333\364[\236\0256\267\320g\360xn{\037\015\356H\271\010\255\360\265\3136\025\266\342\324\246\204\211\311k\244\322\342\231\307\204o\2376\361cy3w\314\347/\246@\022", 7000, "\211\314\257hDW;\257\3702\271\243\322\314\3131\352\250e\313\006\364/\001\207\327J\350\214\350\232U\353\216\024\344\177(\325\366K\031Rt\220\201L\265\263{\366\305\305\215]\373x\177\373\020K\224\346\350", 64 },
{ "\2713\267\214\012\302\311g", 8, "bo\2109\255\305P\036", 8000, "\236bG>\215\363\021\012\242\265P8\373\332\017,\367o\217}\210\320\035\320\255\316}1\005\021m'\205\214B\236y\232\377\300\262&\240pJRXQ9\226\011\212\316\346E3\302\252!l\266\304\134\017", 64 },
{ "l\364\370\012\341\025\344z", 8, "\201\004\012\261\355\255N]*\324i\346\002z\300O", 8000, "\024\220\237\352h\017\263\237Vk7\015\250\007\000\253\203\305\255\220\337|\306\233\240\023\361\226d\304\315g!GGY\363g\331\005\376\354\243\371\207Q\212\246Ez\030|\341\315;h?Pe\351\256\004\364\373", 64 },
{ "\302\241:W\337\336\036\342", 8, "\273\233\362\231\357\212^\310 $n\370\314\324a\225\235\004L|\322\015\357\256", 8000, "\357\333\324\221\253\207\002\244\006\352S#\326\352Y\201\034\307\301e\22120\252\036\333\2151\010\134*~\235T\322\007\200\020x\221phGw4p\221d\251\262\355\013=\236I_Vm\241\003CN\245]", 64 },
{ "\250\275\025\013\365\363\227\210", 8, "\030\02582\351Z8\344\017\0252\203\305sTM6\322\336\214\037\303\223!H\306\276R3\235\323D", 8000, "\337/\303\204\376H\020/\366\036\3336O\234\237b\012Q,=9z*4VZ<\320\214\270\341\277\262gjEu,I\224\242\316c\217h\042\211\005\300+\033&\336\024\254&\227&\301\324\004\362\377r", 64 },
{ "\366\345\301\371\301\220\3759", 8, "\315\012\003\227M\042[2[ \036\264dB\022a\326\372\203%\223\005\330&\007\304\012\300n\347\233\012\263o\330)\177DC\323", 8000, "\023\006\222\026\010\342gH\220\370\372\277Z\327/?\240P\244\244-\326\333e\234g8p\323\263OG2K_\272S=\276\012\011\314\217G\027{\215\246\360 \024\224\244\352\363\003\307\371o\305\212\341\3706", 64 },
{ "\272\010\025[\365PR<", 8, "\270\205:\014\2338\264k\246~\025\245z3\345\001?\005Nk\006\202\357\220:|\251\2522\276Z\243\232<~8\341i\326IQq\265\355\013$c\241", 8000, "\031\240\307X\344 m0\221(p%\247>\215B\244\325\211#\036\355\215\356\231\247\263=B\232G\264E\260\222\214`\006v\315L\011\355\025F\235\352\347\365Pm\230\211\273\255N\0023\021\202\362\370\004\340", 64 },
{ "\031\322*2\357\375S\022", 8, "\366\252\324S\223=\016\205>\011\374\2703\234\226\316\004\327\231\1774K\236\030T\232_\315AS'\374H\326\226E\037\225\263.s\004g\332\360\372\0147\200\364Z\003\262\225GJ", 8000, "Y$ \014\261L\304\307\264F\212M\362\364\272\375f5\223\016\275&3z|\227\021]mvP-\024\225!+\361\371\250\335\375\377\310\035\017=\233\347\225\235\042\335\241\300\264\260E*\327\034\220E\204\325", 64 },
{ "\031\220H$e\221aZ", 8, "\366\331\016o\241W!J\177\212U\230\316F\042\345xO@\324\314cQfu\315\261\312j\252\005{\001\035\362/`i|\361\237\367GmJ\303\356\035\366sV<\031\346\2736\266t\302\024x\001\360t", 8000, "IB\042P\213'\260\225\275a\244\255\225\361\346a%\321tT\251t?gbp\344@x\016\002A\025\242\264\177\224\256'~;\256\216\277\301Nc\302a\216\325\220~\213\240\245\252\260E2\371\216w\134", 64 },
{ "\004\341juF>\010\303", 8, "\012\374\210H\310\034\235\215\205\261\207r\3443\224\300<G:\272 \230>\027\275\304\271\366\021\300\034\024b\256\337\0164\007w\335\243$T\300m\010O\202]%\306h\205\311\260B\206c\236\011\233m\305\305V\042\020\274\001[zM", 8000, "e\327,[\030\205\3270?\251o\320\177\305\134\272`\256\332~\363\017\200(\035s=\343\300\244A\231\243\267\247\032\353\325\275\256k\221\364\230\301\301\2658\260D\035\244\207>\211\354\035\220\202$:\012\345\177", 64 },
{ "\244\276\254\240~1|k", 8, "\251>\326\357\223\360I\224", 9000, "\202\327C\273\265\315pa&\261\02517B\232V\007\200q\302i\240\265\250\302FH\230\002]\357\216\204\245\351\221\223\335\250[\0274\265\307\214\362\347_\213\003]\244\360\344\014\011\003t\226\031\016\354\034L", 64 },
{ "v\015\177M_\312\0052", 8, "\366;\234/9\024b`\042Np7\3674\335\254", 9000, "\363{J[\233\031\001=k\307d\011w?\300 `\320\005\253\303\373\134\004Q\212\334\344} \355v\221\370\315a\314\205\236\343\363H=\357/\026\2531\024\316ZC\200D\345\212\3025\011\333!`:q", 64 },
{ "\272\021\314kDz,\250", 8, "\1774.\331\031\134\003wT\204\366\216@\2057N\223\237m<\341\307Z\307", 9000, "\323`\024\332+\270\220\374#eZ\314\217\274\015\275\234>X\342\363\240l\202\321\3030\245n44\267\007\377\042\334\225\323>t\310\316\301\333\213\215\205N\330\274+\214\323(\342\012\336\255\233\233T\220\345\352", 64 },
{ "\346G\354\015KEg9", 8, "\320i\372\224\255\204t\310p\216(.\260j\241\215\217\245\350o\362=\024d\323\350\364\212\010\300\351\265", 9000, "\237\006\200\214I\354\024/O\134\026\322\201i\203\031vjkO\024\234\311\351M\020\202\350\016vO\331}^\333\223\247\006\366\251\260\3661()\027\322\361\350v\310F\005n\337\277'\361\327\220\330\031\374\037", 64 },
{ "\350V\321\365\262\311q\250", 8, "\343m\037\250\273\367\033\260\306+\343\236\021\337\216;&\366\361\237\301\244\224\035\017m\033\241T\206\011\006\030\220\240\222(\226=%", 9000, "\215,\364\267-?M\243\134l\345\312s\270\224lu\363@\337\360Gz\357 =0\374\320\027E~\206t\347\031\222\371\211H\333\242\210p\371H\023E\262u\004\042@\250\341.\316IYA%\364\010o", 64 },
{ "\134\012\274\273\331\3564\247", 8, "o\2669\261\335\134\307M'\373{\361\367\325\253\331\243qy\316^\031\315\223>\024\007\177\375L\216\001\272Y\235\246\340\341$rG\352<\203s\255%#", 9000, "-\017\003\263@\273\011\274\3138Fx\036\312\320/3y\26458\035V\222\376\004\312\330]\263\317*\265q\324\340a%\016\214\241\255v\033U4j\006\002n\346\014\326\011\211\201\237I4\330\034\0002\335", 64 },
{ "\276Z\205\372\215/E^", 8, "\260X\264\010\316\224\021_\014\005\246\0046\005I\377j\356N\365\013\253}\007\250BlGu\224\027\37541\352\316\3704\305\024\343%\037\342\265\236YA\200\005j\352\203\254\315\237", 9000, "\266t\3301\355\364\233_\353*\333\220Z\007\360\343t\343&\260\036\334\201\254\335R\373&b\237\027\221\343]U\304\212+\0367\307\375w\250\227\233\042U\227\215\324\017`_\254\3125.E\002D\321\200;", 64 },
{ "\226\005\201\252\315+\266a", 8, "\377\315Y\201\220\361\037\222\262r \237\226*r\005\236\225\036\323\313(n\257b\011\330\357H:# \321\271\344\202,\231Q\016\013\034\222\003\364\205|m\335\232\0172V\355\275*vH\262\177\205\307\210D", 9000, "\234GS\240:\220\213\346l\004u\204\234\243\351I\370\260\375\010\201\035\223_E\354\271v\036\250\266h\227[\243=\337\315?\220\3253\300\366\346\024[\307w<v;\233\235P$m\005B\022sp\326'", 64 },
{ "8\260\371\214PU|Y", 8, "q\301\012\024AGM\017\210k=\134\332hh\227\354[\332\273\220\213`\303~\344\250\232\231\312#\227\236\335\244\276\202\223E\350J&Y\253\342\262\254\334\215$\306\003\3649\202IF\251\224\205\230\010/>\325\313y&l\027\010-", 9000, "\307\367\342\016j\337\217Jr\210\226)\242A\315v6U\313S\042\025`\335\346\002\240'U\312\342\210]=|DZU\253\237\320\235\264\311p\200\221EP\311z*\207\267\305J\273P\033Utu\254\300", 64 },
{ "\347H\205\004\340w\177\321\313\337\042G\204\274\033\334", 16, "h}o\344Iv:b", 100, "\037 \023\347\332\024\007\042\036e\253\276\016\270RM\224\223w\012i\223\305\2474]_=\257\303.\331\025EqB}\214\204s\253sD\037\317b\034\000\376e\012\340V\220\224\00532+\024f\206\032a", 64 },
{ "S>\007\330\027\271yp\211\357\017\246\200q\302\376", 16, "\266\042\300\276\377Z\362X\241\271\005\257\355l\232\235", 100, "\320\302\134\002$F\034\315\343\211\010\256\264\222\021\363\177\003T\030\225\027\333\376\213\256\357\202\324\272\350\201\3161\233\277\327\04293 \332>?\327A\377\361\265b\274\202\246\3123\236\366\001g\211u\223\354\354", 64 },
{ "B\031~Q\003^\310\367\210K\014\256\245\202\316j", 16, "\015-L\002\032\352\005\215\322f\024\344\3559\360\273\222\336\347\221\356_c\320", 100, "\177\207_s#\007\301m\206\013\2300!\365\000\2125o\261\376\343\365x\220\313\356\264p\304\013\033\306\354\246}\304\004Z\311l]\002b\362yd\013\234c\007\340\262Bh\001\013\314\364\021l=T\344~", 64 },
{ "\245\360\247\005\370r{\215\303#0\353\344>\002d", 16, "_k\016jF9i\254\253\026,\251e\003\315\3136\016\023\213\337/\331q\343\356n_\355\242\200\231", 100, "\303\207[\317\226\277\341}\225.\324<\006jL\035\372\247\245\332j\334V\015\266\012\366\273\213;\213\275\021\020\341\271\325W\277\303oy\260\215\021U1<sqH\325\365w\267\330\012Tq\007Z\212u\355", 64 },
{ "dC\335\234s\307\200N\275\374+<\344\034{\377", 16, "\265\260\003\355\317\205\027(\201\346`~\235p\222\253d\337\356\202B\315\257x\225j\242\365(/\2146\203c\3558X\035o\004", 100, "\373er\245\374_{\365\002zgBZ\361]<\020%\255\215Teg\011\371&K\304\355\307C\203\377}\375\022\325\237\274O\200F\177\015\322\347\264\0151\034\360M\206\264\235pc\177\345\005r\012\2779", 64 },
{ "\225\204\264\2129\205\026$q\227\006\221\250\330-<", 16, "\006?E\232\340\334Y\3517\213{\017\315zQ\274v\3122;\237\031C\012\210! \364m\361\331\015\267c\014\207\236A\271\002\317\260\036\231&x\202\253", 100, "\240\034\354\377\037_;\322\013\3704j\021 8\217qT1[\014\031\227\213\350\377vg\370:\032LR\260\336\023.\212\023\2658q\244\232o\256\014\374\002C\341\342\017x\364\0322y D\315\042\332\230", 64 },
{ "\204\307\332m\134va\332\276\322\307Q~\2166\274", 16, "~f\344^m\013\033\337\034\014\225\035I\244\260|\002EsJ3\005G\333\2734\377\362\327\375\010\271\201\227(\376\325\352\346?\024\354F\236<?\300\035.\357\354\226\035?\344\242", 100, "Y\376\307y\275\304\3730\355J\022\305t\242\272;\007\313\370m\251`}\341\261\266\205\321\203\262^\256b\346\362\010\371;\241al3\177D\016\014X\026K\363\235H\373\216f\022\134\325)\026@8\272\374", 64 },
{ "A\003*\333\311\305\365L\134\232\373\332O\371\312\275", 16, "\372\011\216Z\3042P/\277#\253\315\177\261\300\026\2136\222\310ekk\263\032k\033qQ\231\222\030\134\341\377\241<\277\024\032!\014V\357e\276ck\020\307\327\373K\217J]R\017-LB\022\253\202", 100, "D\244_!\201\266\242\014.\305L\262\363B\210\251q\246\236~\205\361\177\332JaZ}\006L2Wp\333\234\345\301\351\236\234Y\273\034\300t\203\002\2024\264\355\246\036\206\014\035\251\342q-\237%\204\241", 64 },
{ "%\343yf\223~F\304<\227j\221\342\233\327f", 16, "\2639\134\317\005n\321q\237\270@\327\264\255\201\016u\304V\134\250TtuI\245N\266\334:t{V\327\022\302@\260!\362\016\2506\367\007\223Gx\023h\341\266c\336B\376\260\001\242\007\235\273s\370\266\261\242\326~\354\245r", 100, "M%S\014\270\306\265\253@\253\036(j\216\223\233\316\325\341\324\020c3\324A7\352D\215\313\035\333p\030\310\370\034\276\023\376\026\345\357U\3515\355\375L\005\002\304\333#q;\262\244\367\207\235\2635\363", 64 },
{ "\3161r!\203\342m2G\011~\365A\246\331\270", 16, "1\257\201\240\223\217W{", 200, "S`\203\030\240\261\241\304w\301\302\276%\035.U\225\224Vjts\352\005a\230yiJ\355\217D>\333\205D-`-[<\335E$V\253\014\213mg\267\355k\262\211(7(\016\003\036\231$\257", 64 },
{ "\3746\000\2150\247\037#\313\331\351l\012\333\247A", 16, "\234y\004\241[\363vH\207.\227X3\234\366G", 200, "\314z=\265I\243\201;\010\234\015.\042\377\265`\220\223M \006\234\276\035\036\2571\322\237+~C\241qv\223\006\223I\034\225qT'Q\232q7\3102\336\371\271\237~F(~\350\317W\236D\000", 64 },
{ "\305\363\361\241\301\257\317\177\3327\134\252\316f \307", 16, "\324)\212\012\226\034\330\315\313\323n\361&s(,\205\322\034\211a\236\335\375", 200, "&\3403J!17\345\026 \211\235C\025R\212\177\374\273\343\027\3772\026}\232\347\016\362U\352\025|-\373V\300Q\221\003\317,\037x\334Dq\230j\277\206(iW\037.\336vJ\230W=\013\376", 64 },
{ "\342\015\026\337\254d\021\237\010\216O\314\271\015\202>", 16, "\272\010\351vz\243\205y\234\345\354\262[\353^z\346G\324\177@\217\357\252z\254\354\240\241Yb0", 200, "_\235S\033v\365x\3567c\255\216L\267\200\307\204\006\365\271\276>H#\260\015\335\025d\000\230H4\255\365\264\370& \204[\345w\035ne\301\254\312\246$\213\345\362\261\256s;,\321\304\371o\333", 64 },
{ "P\220Zg>x\313,\234\260\240\262\260\351\177{", 16, "\3762s\2309\276B\215}-\215&\363Z\374\305\233\325\203\254\367\212\250\266H\222\002\256\362~m\374mr\354\305\317\330\215\214", 200, "B\2700\007hU\301p|\227\275\342e\005%\374\023D\242x\311l\0344\211\256k(\264%\011\362\266:a\305\330\252\320\303\365uh6\240\0033\271\236c\220M:}\365|\210\010\305g\000\364\027\347", 64 },
{ "\032\222\254\003\000n\311\010x\225ny~\226p\016", 16, "\303\3346\310>\2656\271\251L\272\243\007\315\221OZ\300\212q\335\367\246t\234`\213\214\347\332U\340\352\275\265\134\354\203\333( ?\256\304\035D\012?", 200, "t\301\031U\330\0141Jw\010\027\212\334q,\306\307\313\354\177L^h\376&\033\310-\231\220\273=\277?n\201>~\0263\216\012M\341\224\037\034\244\036:\325\017\2024\230\342\006i=$\3546*\243", 64 },
{ "z\012!\011\346\202\316+8\217e\255\023>\350\221", 16, "\177\015\264RK\134=\005j\210\255\202\373z\327\304\377\027\267g\254\3139\333\354\215\273\177\0112\237\327\343D\205>\213\231j#\235\355\363,\237\315t\021\335Q\300t.\346v\210", 200, "\233c\377\253\202\010\203\256\372\357<\200\231\334\3074\207\371\232\243\206\023\212zj\272\273\216\217\210f\200`\031\202Z\337/\2467?\177\226\321\215\300\216\260\222t\320i\361\012oT\017\302\340\353=\302\240z", 64 },
{ "8\346\2320\027\300\302e_\224V5\347!\037<", 16, "\247b\235u\341\201tX7\372$\260M\312R\344\275\241i\233\255\253\030\206\256u!\334\201\275\202\042\036_\237\335=\031,\015\230\372\303\224\312\334\220V\035\323\226\340;\177\250v\375{k\344\331\255\214$", 200, "\216\323\264\300\362\373?\027\346\000\323\275\267q\001\222 y\303D\366{@f\034\226O\234\341\216\230/\226\324\034{\001\264\042\326\357\015\360\037<Q\210%\374\261\022c!LDvL\335G1+\005A\332", 64 },
{ "\207\216&\025\344\223`\034;\343\303r/j\007\313", 16, "\204\266\035\374\206\335<=^\3426:.\200\320\024\031\320\303\351-Z\265\253\212?`\036u\215\220\334\031\327i\267\261o1\134\274uo\002f\212\365;gb\344\302i\2514Ys\246~\0047\022\201_,P\272\221?\276f\323", 200, "U\012\365]\223\021\2637)\033\005\011\374\134\3653\207s\276\134i\351\3359\241e\033\344\370\3560\225x6>\362\2602\306\277.s\244\001t\346V\333\016\3111\015r0\316\005b\330s\204\317uxc", 64 },
{ "`\204\233i\237g%EA\265\241\220\240\311\271\277", 16, "\007{\3171vCb\215", 300, "\231\365\3613x\302\240\021\024\331\3726O\333\340E\304 OVy^\0121\360\353\237\210PM\261P\011\325\311\307{ -\307\016\204R\300+\003\324M\312h\003\304+\251\214\005\205&\002\252\022\240\3702", 64 },
{ "t\271\276\220\376\026\002Q\320(\350\3108\032\234\227", 16, "\275'o.\375\363f\266\245\373IN`\331\016]", 300, "\234\203\367\265\303\221\335\243F\363!\225\007..\177v\266\321oe\227\013_/3\032\330\225d3\233*\252\042A\323gR\303}A\374\300A\353s*~\205LdO\305\002[\201\204\033>\244\207\330\030", 64 },
{ "\200|\315\327\367T6\016E/+~\016\267\042\366", 16, "hR\302J\352\242*>\306R\202R\354\214^\317\216\270\277\014\316\322P*", 300, "\215.\042\007PDE\315\3073\355\007^\2619\323ET\250\004\334|\364lQ8\020/f|\206\344Q\010p')\013\220\277\231\362\272\00462\344r\211%i\273U\012y\346\322<\005s\204\017\200\274", 64 },
{ "\302\354a`\2242\277\372\213\134P\021lU\200u", 16, "\320\311\272#\313\335\306\264\251J\255lR}\002\273G\3006\371\205h\235Ah-X\001\312\3341\027", 300, "\022\220u_\275S\011\301u+\222\351\307~q\226\007\233d\231\276\026e\251x\3123(\243B\227\021\215\277\031\315\226\315Y<\360\213$h\203\017\266\335\024\247cSC\350<\340\303\343\237\241*\200}\265", 64 },
{ "/\342EJ\341\2354E\202N)\376\311\231S\231", 16, "\266\012\010\366\027c\3434\364\272\373\260 \263\207\262\344<U\207\134\236\275\014\331\313\3632X\310\306\217%C\202\240\224T\025\272", 300, "\010o\235\266\302 P\020_p\277\341-Go\371\362\324\202H@\231\2337CqY\367\356\355\311\026\343e\022]\372n\221\234\277\2640{+kO?;2\335M\275\315\377\217q\234\337\335cr\263\314", 64 },
{ "\224\327G\362\204r\233\256\261Gnu\317O\267\307", 16, "\365\332\350D\026)y\270\241n\252\364\375\371\006ke\306\342\255|3\220/\017\231\256\330\355\211sj\247\274\016\365\243\213\037\206\010\221\273@Z\224Fo", 300, "\347\2317\346\344\255\016\300\025\002g\226U1\252\233,\335K\134\347\336\336hw\202\250\270\204\204\013|a\020O\226\341F\307-t\362\342P\322\370:\376\272jRm\005\255\200\236\315\320\346\334#\212\321\011", 64 },
{ "\014cTy\324$\201z\331\244\337\372\020\206\004\004", 16, "\265\367\261\204v5\371W\332r/\007\310-\010\204\264\022\317~O\361\316a*\2773$$2\021\321\240\372\316B\267c\323J\354\042\022l\242P\203U\243\371\216\2674\221\266\212", 300, "_\346\213N~n\353\034E!\216\2141j\031\0171\344\303\222p\301t\356\254G\373O\240\260P\215\034\345\211m\350\342\332\210\034\313d=\317p\215\247\302\027\212\324}|3\245C\242v\000\242\333\326\027", 64 },
{ "\030T\270\036\224\037\265\023f\255\242\2064)\376\366", 16, "\035\370\211.;\345\356(\223zz\376\376\371\323\267\2034\326]\271\245\252\244\345\304\352\347{\250\030\267?\275\011\255\224\223\353\010\236Sy\2256\004h\3632\036\255\003\353\247\337:$\375\303\273~\351\260\260", 300, "aNdOT\0026\300D\377W\256\322\200wZa\276\235W\262\313Z\342\220\307\321\377\223\276\2735\311\253\353\307j\343\257-hv\200`\345_\371I\232\372\250\006n\335R\331/;\210\002\027\367\355U", 64 },
{ "\255\021\324~\275N\274g\255\042\242/\312:\177\367", 16, "\200w\215\352\253\031\350\310$4u\376\363Z-\315\231\375\331\320Gp;s\231)\251\024x\261\354\021\353\177\024i\314\370Q*\206\345\275r\353\255\246\305\275\257\336\316\035\335\024\356\323Ya\022\301\247\202H\350f\235<\177\026\200\352", 300, "\010\360'C\342\355\042\307\216\356\335~c\037t\001\273q\357\253MK\217/\353\337\317\031\333\333X\025T\276c\252\226V9@\277\344S\360\347\261&P\036x%d\260\375'\364h\250\037\320\267\211\336b", 64 },
{ "\032\230)\010U\321\363\256<\2418\352\364?sT", 16, "K\245\210\270<\375$\305", 400, "R\276R\016\305\241\307(PiZ\036d\234?2\255m;O\027\242\277K\006\021\315\221y\023)\003\276\341T\254\236\323!\370(\242|\261Ah\216$\303bE\365\222\020\357dH\247-_\313\013?\207", 64 },
{ "\361\206Y\022\331\265\007\326\022E\366{\321\334\202`", 16, "^\357\274\264\322\277bu\351\034\213\220-\370\275%", 400, "\352.\227\274pWs\177O\260 \351\000G\3132n\223\231\213+\042n\245^\216D\313P\267\323\031V\236\035\225\005\365\304\273\254\227?\202\221L@\377\204\236\372\322\310;\317\267\244\356\302\337\311\326($", 64 },
{ "\333$\332\236\256\323\210\250\276f\2306\256!\373\245", 16, "p\025g\221|\037`E\215\363\204,6o\263Rt\346\304\351\032\240\205\377", 400, "\316)\361\005\357\302\270\277=\224J\301\271G\260\373L.c\011o5\331%\222\202\324r\012\216\327\222C\214\340\354x\273A*\364\316F\351!\315\343\267\351K\005\252\223,e\346t\216\237\236ZHt\363", 64 },
{ "\022\021\361\351Er\243I\231\314\334\325\303\352\335L", 16, "\303Vj\271t\253T\272\372\317\0070\351\013\230\031\306\023\240\255<S2\310y5\306\322\2468\022.", 400, "~\255\277\277$\336\252\037\237\347\253\277\200]\014\377\242\001J\232\304\351j\037X\307xJ\307\024\035\265\177\364\223\346\345c\3726M\344\257\255\305\210\370\361T\316\254\271\325A.\031\375[\270\027\326\313LQ", 64 },
{ "\026\360z\243\245\346\356n\337\340G\366@\271\332\356", 16, "-\017t\0314st\365.\234\352\357\251\203X\252\134Bk}\331\231G\212n,\363\263\271\247\321YY\274\3376\373`\325\014", 400, "\316\024o\372\015\253\331\202\3058\300\201N\375!\325\034\036\377\272z\017\2072v\24190\031\344GA\241\216\213\262p\361$xl\011dJ\306Y\304\224\276V\376\273\0375%=\340\213\373\261=\200qN", 64 },
{ "\275;#\207\242t\304G\340\257\302/\377\304\210.", 16, "\370\3540\232\367\017\205\322+\275C\024\372cY\237\023\245\257h\200;\310u+;\232u.8\300\373\225+\033\254\346{\360T\204\012\215\231\357\010\372\252", 400, "l#n\313q\010\223\025c\351\347\335\340\207\042\005<\042(\321\376\365\224\365\360D\210\010\235\134y\267\034?-\271\304\007E\364\350\351AN\214\220\231\235\374T\241:\203\0372?{\202\3554\251[\377W", 64 },
{ "\376g\244>\237\350\271Y\245+\011 \341\344\277", 16, "\326&\352]\243\333[\211\035t!\366\204\204.\351\005\036:\260F<\210?\343m\226\035_\134\255@\016\260\017\347\033\256\377\361Cd,\343@\007\264e\177L\275f\216\346rP", 400, "\300\042\035WU\336\316\023i\201\215\215KSU\215aH=\010\332C\207\276\207\254}\373\331\325\312\013)%<)WM\330r+ \014\214\217\012c\266\023\364\330\356t\264\042(\031\312\271\312\351\3356J", 64 },
{ "\260\354\027\023%\230\372\345'\315\035rq\356<\327", 16, "\300#\263\231\336\337J9\346\354\007\273\351\244z\013\247C\342\337\042cF\221\022\221\203z\200\244\323H\015\366p\364*1\2271\134\326\377>\002{\260:\242\224\323\035\211\002\277\347\246\227\237\223\315\315\361=", 400, "/\015\317\021n>l.\252\256A\340'/\327vM\233\262C*\241\361\036\353\203sjK\003\007\331\361][\204\3643\237$\234\353\205_\206\226\337\275\375\025\255\314\263\250\311\244.\362P\336w8_\344", 64 },
{ "\366\317\345\225\251\365g\205\211\324*\313\001E\314R", 16, "{-\027(\230\231a\371\302\271rc\302\204\32402\204\312\005f\227\336R@f+%\250\372%\023\340\002!\203\037\237!\1346\012\355\345\246\020\346\263\204\204\222\356\221\2334=\3333\364)bs\242\314w\001g\214\212\020Gq", 400, "\212K\270\302:\017\317\343\266*H-\373\241\321\200\021\204y\276\272\252\347#\333V\025sI&\325@\337\015t\312JR\312\222\243le-\204\354WAi\364d\353\364+\023\376\363\210}\261\236\242\262\222", 64 },
{ "'\225\026<J\233\370j\177\376\303\004t\245e\022", 16, "\323$\345\255\0226\340\213", 500, "\207\004\3713\226'\232\001B\245\206d\217\341\347 Y!\202\231\271a'T\235\207\332j\275\276\325\345\352_~\362\233)d~\343\222e\257gc\024\254\007AS\227\304\265\244E\211,A\256\355\341\314\276", 64 },
{ "\347\0059\307Jj\001\214W\314\346\300\014A*\227", 16, "\030D\250+\305\240t\201\316=\314\036C\373\356>", 500, "\341\213,\254\202dg\312T3&z\363\354#\350\301\204b\302\357\253~\315a\342\235Z\206J\002\341\042\004\342h+\274Z\305\350.8^\377C\241c'\231+UI\216`a\002\203>>H\276q\330", 64 },
{ "\355\2508\036\235/\211\331\356\0223S\2121`\224", 16, "Zk\3217\020B\320\302u\222N\357<B\030\230+\232\373\236\336\134\231\264", 500, "\001\247\340{\214\204N\310\016\217\020\307\007\246\214\327\017\226\200.\277Z\001\314\020\011s \033s\340Qu\304\346\320\032\254F\221\326\311\255+\274\320H\013\013U!\315\2352cI\233\205\260\333 \211\334\332", 64 },
{ "\031\234.\215%6\373A\206\272\274\042!\317\217f", 16, "\203\177'z[V\001\351s6(\367\212\325\3164s\361\322\310\372\371Q\220\322\255\257\262$6;\335", 500, "`\377\010'\332J_ra6\325[~\314c\333j\243\377FA\225\376\327\037\274\327\365\002\017\006\026sa\352AI\246o\227i\341}Cq\226A<0_E\271L\346\334J\272dz\240<\235oG", 64 },
{ "\303-i\022C|@\340\327\022\203(H\212\244\226", 16, "\231\266$)L ]d\015\036\027#\214J*\247rY\216\341\016\031\205\177\232DC\267\236C\001z\2371\035\323ssq\243", 500, "\273\316\217\230&jG,\325\217\215\346\002\367\221s\021#\321}\316\034R6U\345\255\2170\340\2165,\361O\177K\230n\0052s\036\260r!\223\303\027\022\222\225@\213\015\275\351\311}\252\343\237c\321", 64 },
{ "\275\363\307\201\216\362\240]\211\024\371\235\235\213\011s", 16, "f\233\330\275\352\231X\307\247\341\276\021\325M\352YD\255\273\001\230\255\026u\212C\200,j3\267h+\316a\377\030\215\211\002\002\213\247j\011}q\336", 500, "~6\341PS\357\366\303\206C\341\272f\272\250k\364\340z\366\317!\134\002o\320\245#\301vrE\331rMX\026\334,\350\323}k\267z\177\217\367\210\011\260KX\224I:\370-\247i\263\337\236\220", 64 },
{ "\237U\344h\375\271R\302\302\204\203\331\253\234\252/", 16, "\207\254\042\210|\022\345l\012\364FJ\255\331a\0066\206\257>UBC\364\221M<\344\210Rq\254\327[v\266\347\251Y\022\367E\376m\303<AR$,\253\357\3070-\010", 500, "b\0106\220\000\252\277^\365*\214\346m\265\326?H%\311r4?\234\030\033M!\031\213c(\246)c\367R\020\010\241\002\331Sl\274\313\241\3309\366\007\322\325\300\344\013#\020\213\360E_\016{O", 64 },
{ "C%\004\016%\275\272D&JRYE\310\023w", 16, "\314\337\034\217\005\224]\007\340=1B\302\010 \254\032\325\320E\254\014m\017s:\276\247B\024elC\227n\134\177%\345\317u\023[\337\266-\367\304\242\020\275\243h\260\016h\0057\335\325p\307t8", 500, "g7\263\346\134\244\212\267\377\264\312\244#\244\367\213\263-\315k\231\210\243hw\247mF\321V\334R\322\311\253\376c\214\320\360\351\253\373{\0300\260\021j\254\307\267\220\232\006\367v\026\020\042\246\314\252\230", 64 },
{ "\042\244+\354\317u\022\256xC{z\200\365t\203", 16, "4\260be\177!A\327X\275\207\035\252{Yy\267X\274\216\245\322*\317\335\236\346\216a\311\201\215\310\042\007g+\273\033gm%\365\012\245\255w\206t\353\216\303\032\342\300\266\216\223\017\354dzH\347\356\321m|xh7\264", 500, "\272\266f\004\021c\344\271&\275\332\340owE\221\0426\230\213\236z\337F\246\215s\327\036\042]\314\276e\021\372\267KY\223}'\203^U%\216\340\377<\376\341\272jhn\340\217\314V\343\201Y\367", 64 },
{ "G\372r\346\225\177\025\000\241\347\316a\303l\340\260", 16, "\273\360'=o\001\332\206", 600, "kX\276\343~\243\351\324\017\035\024x\004>\332\134\270\020\332\333\026\224\204\367\254\362U\011 \324\276m\330 \032\222^W\2304\345F\005fw\364\277\322VXJ\345\0167KM\213\022fv'~\032k", 64 },
{ "\134\244y5\2355\245\326E\016:R\206\032\334\202", 16, "\233\364\201H8\215y\376\014\277\016\334\013\337Jm", 600, "8\337\036\337\322h\016\272\377\261\302jZ\271\312!F\372\364\327>XPTg\232\226F\021\362\024%~\371@\314\226;\026\244\2356\312\134\134\236K\217\243\341\0052J\304\014\354n\205\321\365\256\214t\337", 64 },
{ "Q\361\217DR\030\023l0f\316\321\317\370\000\270", 16, "\210\323\252\322\0060{\223\006\022On0fm\202\011\315\357a\031\373*\317", 600, "\300\241\266\226\264\202\202\216m\0166|\321<:^\367\256B\327\211\036d\030\002i\207\311\322RSC\252\303G*xD\203\213\003\343\252=D\261b6\033?\351\257Y\251\261)\254j6I\203e<\333", 64 },
{ "W\240\211i \373\342$O\315\042y\243\371o\203", 16, "m\225\254MJ\265\037\231)\021\336\371\254\253\256\317.\204\210N\300\226\320w\354\021G>\014\256\310\034", 600, "\373\356\000o\004\330\262\234\262\250\346f\212ap\337e\220,\007f\333\202\270\253_ms\351\013\373\234\251j\204\360\033\257e\344\360\200A\324S\320\251\235)\015\013m\202\206$eE\370\243\001\014\221\300\275", 64 },
{ "\305\337\271 *\214\274\272\356\013\307u\215/<'", 16, "\323>\273\2563S\220)\265\367\346\246\002l),\025\177\027f\332\223\014\004\260}A%R0 #Z\357h\340e\261\025>", 600, "\333\224\212N\256t\331\335\002\315\266\324W\214\017\016\273\250\303\021\326\340\016fC\015&\305\213\266Pi\261\344D\325A\367z\251\326n\321\305\2120L\324v\006\262r\320\211[\023\253\301\330\376\017\245w\000", 64 },
{ "\227\317\337v\243\316\223\362\003=\022\307\243\250o\216", 16, "\247\270\205\312\252b\325\344\227\372q6\3660\004\035i&r\212 \253\177\211\365\034\207`\213\310&\005\307zo\332\363\344R`\217\267\270l<\275\321\317", 600, "\312\021O\242AA,?\251\335\207\244\357\274\2753\020\006\321\240\362\262\304\253\210\370\231>\323v}\335C\000r\362<d\2412\254\241\200\255MC\372jgIc\271\347\362'\274(7\004\254\330\327\376\214", 64 },
{ "\356\036|j\017iK\004\321 \025u\242\327\244\316", 16, "\230M\377Z\240zp\210\2750\342K\023\200\005\337\264&\224~\002\340\202\222\267\206\235\267\262j\254\3448\272<I\200\307J\013N\216\277\262\203\305\200c\312\035s\246/]S\210", 600, "\276\207\371\037\244\344R\327\312\330\344\316G/\345\341\042\304\026\246F\376\022\375\236\005d\211K!\320:\037S\346;\231\220\353\275\235\256y\300\326\356\312\343\342wp5\346\260\374\233\003P\364\322\025\323\042$", 64 },
{ "3]\266l\353\305\337\311\016\344o&\357\017\317\017", 16, "zt\201\022)\365\233\245\216\024\031\213\254\265\015Ws,J\333Q\337 \027\347+Y8\375\347\326\242\306\204$}\363\351Ru\256\234\220\212\373\3738bjg\365_\022\211\201\364_\307\267qi.\021[", 600, "\333\371\263/\027\334\204\362M\300L\374\032~)\270D\256Oc\321\370<\225\346g\327\264\031\340\347\253\225\330\226\015\016\017\250\200\200\364<miJ\036\316lR\254\211\221\303\366\016\312\206\326\357fg?\017", 64 },
{ "0\206\034\374\010\323=jw'\222\226\216\022\313M", 16, "-\231\206v9\237\214\223\304\006\237I\322\361\314\354%\234\204\217\223.D`\341|SU\226\007\327\342\2041\3539\310<2J\332\212V6m\301\313\322:12+7m\225 U\2731\245\333\305\262n\225\320\237\242\223\035Ax", 600, "\334A\033H\030\334\327k)\024\377\340\202~\016\336\223u\257:A\253\360\012\033j\202\351\245\023!\236\231%b \335\035\214V]\023J\272rr\240\030\324\027\360\305$\335? t\203\017\351\323\210\225\356", 64 },
{ "3a,\340\2156\013\030\034r3\375\351c@\327", 16, "\345\306cH\353\360\246\345", 700, "\270P\206\031\330\027\3040\266\342\302\362\324\241E\352\030}\221x\251\030\356\037\350\030\326T\377\353\026\271\217\024%9\026Q!=/\362\263|\243\353E\010\250\375bB\262\322\032\356m\277}\251E\3261\300", 64 },
{ "/\257xg\230\231n\356rG\376\2620v\241\273", 16, "\373\236\277.U\233e`\204z<\200\015\303+!", 700, "KF\216z\177a,rjH\312\003\232\227\300Q\021\266\3301\315\221w\007\021\270\271B^_]\300:0\263\002\300\351\215\373\265\302\231t\177\220\324\223\375\252\214\321\261\207\007\337\036\347\306\245|{\227\373", 64 },
{ "\202P\001\305L\343@\203\372\017k\254nS\370P", 16, "P\322\260\346j\204\250\374\341Q\234p\226\200s\034\334\351\315]\356\224G\266", 700, "-\332)\326k\210r\373U\207p4\014\030\205$C\260\206\344n1\200\227\241D\357U\363\224\321\350\025g\022\317\255\001\343\204\276\260\0251\022\270\211W\247^\343:\374\263I\355%\024\002\257{\250'#", 64 },
{ "Y\352\246\230v.\224^\2668\252\316\337\366\3338", 16, "3_~\337c-\311\010l\313\373I_\213\035\253\311(\313|\223\264\237X\327NZ$K\335\014T", 700, "\020\275\314M\357\326\251M\022\325\023.\332Se\364\200c\0177>|f\273\246\225\314\354\244\272\260\330o\221e\233\005ea'7\336\232\232:\221S\031\334r`\316\2015\257\377\203:j\221\264d@\342", 64 },
{ "\255\377\250\342\216\0156\217\331\352\220r\302\236\376w", 16, "\377I\023\011\206\313\214=\006\344\0217\037\034\312Q\013\303;#v\275,\276b\036\023\375r\332\302G\335\307\333B\325\374\347\271", 700, "0\2629)\037Z\226\272\312\021\215\345\266_\036\373\277\012\023\364\271%\271\272\366\353\205\322\243\220\1342<\233\372\311M\232\027,\215<\334Z\357N6F\207O#\031n\215\235<\256\333\304k\223\323\240]", 64 },
{ "\243<+\014\304\027\016\025\023\373@\377rt@\336", 16, "\316\023W\361\200\325\241\255_\347\247V\0324U\031.\377u1F=\234\206\365\342\256\210\243\346\217\317m\3334\267\242\263|.\015H9\212\313\360\331,", 700, "B\322\302\014Tt\014A\243K\347\353K\031\364_)\340Q\356\216\006\367\275\355\246\035\362k)\322$\242jn\3077\255@\036d#\266\267\274\267\343ti\211\376\032\200x\313[\306\267\247n\222\222\347\021", 64 },
{ "\371)r\237\3421+4\356s\277\234\343\330\212\313", 16, "\262\017\333\260\372\305\253\325SWj\350\233\231\222\372s\277\032\272[p;5\204T\014\243\017A\345\314\217\210\323&9\222!y\247U\3673'\351\266W\216N\215\265\0331\331\373", 700, "r\016\300\215\261\246E\350\234\360\035\340\025\033\206C`\206b.\326\223\367sV\320\232\006\374\227\234N\027\222\376\273\264\356\206\340\317\337>\237\266r\207\206\224zp\343\335b\333\237k\240\306\204I9qF", 64 },
{ "\351\236t\270\232A\203a}#a\340\217\314\235\246", 16, "\345a\00716#31\263\314\220\255\005<\306\277\3574;\025\004\341\323\215\023\210l\373|\226\234\251O\242\2334\311\336g\260\033<\261\236\237\271\357\230\035\273\016c\212\200\3406\361g\022\263\030\311E\277", 700, "\300\270 \346\234{<\357^\225\303\255u\351\042\254\267A6\032?\023\251\226\320\361AToOc\201\220\335\241\276\363.\277\227G\042i\300x^`\230\253\247S\205\231\2700\370]\304\343y-\134\262\274", 64 },
{ "\326\315\030\330\327m\324g`\357\314\374,m\313\027", 16, "\222\231=\273\242\212\226\031\325\251e5\213\256\244i\036\370\247\361\2530\377\372E\244\265\367\346\251\312\300<\304\221\035\201<nh\3467\037\326;\016\007:\002\2045m!\042\277q\361P;\337\026'n\3731\177\2606\316\216\205X", 700, "@\315\352\037#l\270<\236\354\360\376\001\335#/l`\305\375\013\027\021\334m\221^\377\220\222\202\226\314RWq\3007}w-\035\025}\243J\345$=4<\302\272/\351\356\006X\3256\025\0113\000", 64 },
{ "\206{K\024`\326\224\214U\327Z\207\266\012jO", 16, "\340N\030\355<(1\034", 800, "\270\207o\260\013\311UX\253\004!\317\203\251<\350ke=\300FyfU\346\253(\3346!,j\266\002\251)]\207\232\312\232%\323\310j*4\342\213\243\246H/\012\002\207\030\316\240{c\245\213W", 64 },
{ "#\010-`\240\273\343zl\372\213r\261\371-h", 16, "\231\006\305\205;Qm\210\275Q\263\331\336\020\324,", 800, "\267j\314\261\015\207\272\237#+4\205M\254\237L\352\2248\337\026\303\004\220\262\232\323\004\212^$Wy\042\266\313T\345\374\305\376/\227\334\341\315\317\364\370\134$\247\270EC\237\365K@\356]\002t\024", 64 },
{ "\034_M(\213\033\010`\253=Da\352\231\014\026", 16, "\356\204lV\262b\024\340P\306\373\273&\204\203a\251\004\316\371\253l-5", 800, "\205ek/~/_d\023q@e\205\327\240\226\215J\232K\345'\377\256\334P\226^(\220O\255*\227\257@Pt\323pP\375\010\234\177h\264\032\254\031\356%}.\257\2040\251\331\334\226\262\202O", 64 },
{ "k\264\374\363\246\260\027[\226\207\201C\327\200=\342", 16, "\343\360\005w3'\253\362\353\030#\346\254\254\227=R\274\230\001\177_-\004d\320\317\263\223g\027\013", 800, "/\007\331v\327\007\365\277\237\361\200\2643\235)9\247\320\371vm\216d\236\266X\262 \3254\300\005RSI6\260B\277m\032@L=\207l\256\036jw\365\236\215\216\365i\305\001\037\213\262\236f\237", 64 },
{ "\3144\231\023\012\010\377\351]5\341!\252\026m7", 16, "\332u\261q_\015\003\347\370\330\274?\202\316\336'\223L\346w-\024\346\236Y\363j\3019\211e8\304\006\241I/V\247\277", 800, "\016\262\272\311\010\201\270c\006Le\301D\362sR\274\010\356\231\275\002\260\267\374~\233M\134\217\204\233~\360\246\042\305\015\230'\233\005 D\371K\231NT\323M\362\206!\0100\316\247\202\333\233\2570N", 64 },
{ "\264M0\374\215\246O\340h\022?\042\326x?\254", 16, "\330=\266\357\362\233\013aM\377\273j\317\366#\342\240I\267\323\203\264\233\362\341]\261\011\206\035\345\234\372\247\015\322\205\2212\2123\363Y\274\226!\270$", 800, "g\350\315-uW\360\247T/_AH\336R\251\355\374Q\274\361\257\353;;-\303\341\252\006j\3071\334P\271b\374\306\272=\301\274\317!r+\322\342nAO\223\260h\254\270A\217\360\221C\020\375", 64 },
{ "\262\234\242\024\023\246;\320?Rm\313\203\134\257\253", 16, "\011-L\245\210\020\275\003\265.\006\325d\005Q\012j\325{\357\312\007\036~\324\011c\203A{\363\010\244@I\276v4\330a\316\234$lL\351\227Ml\033\245\016\035\350\230:", 800, "\362~\243\251j\037Ef\332\032Tf\002\003D\254_\361\220|8\325\177\304\021')K!\230\226\006n/.+\354\236\007\264\0053\3451o57\211x\217\033h=\360&\255+\265\242\217;6U\302", 64 },
{ "\244\034\321}s\264x7\325\015\366j\037\3222\011", 16, "\345\345X\367~\021\235\341#\225_\305+\326\310%\346\200w\004\340{\226\226\021\014M\2509\013\242Q\012\206\035\234+\2672\214\210,\306u\004;\345\303\002\221\231\320\037\310w\300B\327G[\357#?\231", 800, "l\017\322\2302z:bu\331X\333\236~\227\337\255\330\345\364\335\016\305\3370\243\275n`FnB\346H\134(\025\022\231WJ\037\253\212\245\210U\354`\0269\354\246\243\213\275Nqn\352`\2649\004", 64 },
{ "H\235\224~X\271\344\241\303\035`\265\0324\2460", 16, "n'\340=s\250u\025a\267\361\030n\326o\357\255\021\313\2600g\200\222\277zL\370E\223\277\357 \340\030G\207\031\007\277\227\302\233\254\320\375F\370\262O\303\030\262-\216\214\042P\323o\2002\337\220\334R\314\372\223\007\373\207", 800, "[\316\226 \270\134\257\204\241\336^\273\236\332G\333\214\343<\2759\037\202)j|\233\310\032)\214w\207\264&\335\366\214\352\370\030\343\353\2047\327\353\255\027\362\351\361m\264\226\227\207 \270\260]\373|\027", 64 },
{ "!\206i\223\011X\356\016B\030\270\305\207\375-I", 16, "\027\240;R3\271|\332", 900, "\360*\314r\326\366\254l\023\203P\222\026\371'7G\375O\250\016\245b\267\277\233\320s\256=%'\254\316\353\023g\177\235\210f\206\351U\336\3409\312E\221\205\321\335cD\350,\325>\277\342\304\015@", 64 },
{ "o}J\242\212Q\201\317\222\006\331dI:\362T", 16, "\227\363\374\030\2151\324W\373\366>QP\367\032\315", 900, "\374\010\253\244u\317\244|\366\2348h\341\373\322\350\234,{x>V\036\006\266m\042\374\335,\351Vl\376\341\026\000\233\302\021\013u\274\246\363#F\321\234\226A[J\323\253\371\201\344\306\312\222\300\232!", 64 },
{ "fW`\315\042.\323\234/\024e/\235.\367{", 16, "\377\001Rk\017\237\367\371WR4q\271\242\200\034\374\224\224\026\371\3056\305", 900, "\314e3\234\224\216\231\334\257\005\354\223\241\322\363t\134 T\343l\246q\237[\300n.\014F\207I6 Hp21\271l\244b\023\352\214\356\331+\331\006'\321\215\301}\223!\3318Mp7\005\330", 64 },
{ "\365\016\371I\230s\357\307\245\037\373\023N\2579\236", 16, "+\214\007\212\252%\034\006\337Z\013\267\134l\211\030\302\271\267\376W\014!\370 \354\272k\013 \265\035", 900, "\026\345\251\321>\361;\226\251\251\277\3261$\233\224tk\373\011h\030\256N\030\314e\352M\2200\273\341\351\350\302\257\03796Lc\3615\215\033J\326q\347\364T\0232B<\015\202\251b\021\352\271\224", 64 },
{ "\357\305\300\016h4\217\213\205|\365\275\2402M\212", 16, "\232{\261\235\227\366}\037?xZ\217{\271\352\3539\3628\370T\207\370\222\334\221PJ6\237`\235\343\020n\323\370}+\025", 900, "\006An\011@\267Z\023\026aW\274\002\263\316S\006\374\372\362%\003\357C\355\307\202\023\266YN\245\361\324:\311\201/Pa\342e4\2122\203\255\312T\201\243l\357\337}\361\302\347\034}\315l\007\301", 64 },
{ "\254\373N\035\251\017\360\304\005\333`\256\301\240\351\020", 16, "\257\231q%\353\262\257\37167\260\364e\222*\0135\242\214-\263;\011\232e\237\221\202\026\352\334\034=\326\346\246\016\353\375hH\020\2666;\276\254\254", 900, "{1\200C\304@\350\255\323d\266\042|\2019\262\264\177/T\362\020\346V=\032\360\226WC\234\260u\244X/6\326\202\363\025[\327Y1\240\243\030\373m$Yp8\220\272v\321]\361\343\305?\226", 64 },
{ "\200\323\244\005\342\327}\330\0329D\266v\037\332\234", 16, "\305sYC\035z\357\246\025\315'\376\305Do\345\022\320\016L\321\236rW)\0128>;\042\215\2640\244\370\245\271\312\220\222\211j\247\323\252\324\252\316G\014\307\303\220\026>\241", 900, ":\015\356\340\031MC[\210\244\201QVg/u5\331\215\134Q\277J\322E\306\222\372\346X0\210N^\207'\300I\345\011\020\366R\014\177\213\037\3425&\252>\264H\316\335\235W\264\265\256\3774\002", 64 },
{ "\033t\350)6\260R\333\031\346'3\021x\014)", 16, "\317\036\207|'\372vD9\324\306m\004B96\364<o\007\317f\274e\355ty\341;\311#\031\311\203\321\341\034\201\373\315\352\353\302\267\361\034A\206=\353&\346\367\260G\220\013\244\013\030\334\254\257l", 900, "t\261\230\3379L\220\244)\266t\031\022tW\027\314x\205\017@\345 \027d\006\211\266g{k\255a\031C0\253nVA\025\215\257\027P\376Pc\316J\341x\273\272\241\332\315I\360\2035T\264,", 64 },
{ "\320RQ\307\356\3355\246\351\031\230\013o)C\227", 16, "\273\250 {\345\241\252\366\333o\345\2065>3\007/\337\212\015\042\015\317\022\375\3434\3669\266\243\234+\336\261\234!@P\204\377\220d\236\370\254\370vx\312\134\017\204\3509\225+\034\351\024\267aH}p\364fW\006+;=", 900, "\023\234\016G\310\260[R\353\236BW\207\317\016H\245'\203'\3209L\0148\230(x\027\337\025\256\355&O\2170\024\177\312\200\005\320\365Z\353c\365\207\333\134\264?\321j\0170\312\263\366\350\2733\030", 64 },
{ "}\026\215\320q$\364\307\271\035\234s\210bw\265", 16, "\260d\255\307\300\313\321\370", 1000, "ko~\027fI:q\276\226\305\216\270\317\010\340)d\020\353l\010\274H\013-\306\331\014\277\252\254}\007~\371\327{\352\216\255\211<\366\221\201\311\001\340\267JV\227+\347\253.\222\200U\317F_\276", 64 },
{ "\302\316l\266\270\312\0316W\200lJD\344\263\264", 16, "\353L\235\037:<\341\377\357z\035R\322\221b\010", 1000, "\357\261'\225|\274\201H\253\332.\240:\2151\3776\250\032Sa\351\3659\223\366\240H\200\2439\007\223\240\300k?,\004\203$\200\220M\236\202\314\032\321/\231;\210\312\013\214=U\0129\246\247\347\324", 64 },
{ "\351%\241\263p\261\200\362S\377%\206e\350\237p", 16, "\347x\025h\232\331\240\015\006\035\273\353\233\001@\004\177>\254We\361\353\215", 1000, "\302\000\266c\330\375\3350W\022\272\3446\345EY+\311~\244\0162\006=\353N\212\343\257/-B\271\270\343!\030Q\210\242F\307r\276342\261F[\342\337\277\321\217\360v\015\215\301\005\367\232C", 64 },
{ "\224U\367\245\357\276\004zv\004\017`\350\315\220^", 16, "\230G\361u\016\305\221\367\253\334\344Dg&x0\314\301/j\042\211~\320\207\207y\217r\237p\354", 1000, "{8\226FL\023\270\334N,\247>\033\032B\032\354k\010\001\373\222;t\023X\304\371\276\244\203\316Vw\352\214\310yI\010x\025\215\250}\301\027\205 .\042P`\306Xrx\322\257\235\340J;\277", 64 },
{ "\225t\353\356\367\376\013\326RX\246\016\134D\243\336", 16, "D\006}S\362\262u\220p\364\313\365&{\346n\277\322Jv\2202xdk\230g\327\341C1\220\374\322>;C\263\254W", 1000, "\026.X\262\251\361\032\206=\326\251\214\2721.!5n:\266-\267\015\213\216\313\335vP\013\305\034*\301\177\226\010\345\030\322\213C\313\233\251n\245p*\207tO\021\022\221\020)\006\212\237\014\223\020\256", 64 },
{ ")\035\350\023\325\370\321\370\243\005\263dm\3147\252", 16, "\015m$\343M\220\3573\304\200,C\032m\237}\256\366=A@\200\223\177z|~\263a\321\320\344=z\0229\244\200\222\253\013\224\021\265\224\023Hf", 1000, "x\351\246kB\345\355\201\134K M\003\321V\307\024\257\246\251\031\224>\244\021e]\014\262\272\004\206>\251\270D\372\226\206\352\225\273\010\036!\364_\327\244\001\353\012\250\232\227W(\034\231p\301\031\203\325", 64 },
{ "\246\337^`\273\277pp\204\370\235\023\256\026&Z", 16, "\327 h\205i7+eN\362\265T\320\321\237\214s\036,\326\021\357:7S\302\212\253\016e+\251\253\334z]\022\256]c\007\310`\223\364\022\206\245\217O\036\251\366\214\242\370", 1000, "\346\364s\202y\026\347\275\220gk\304\232\326\234\025\257Rg\254\233\216\344a\306\225\366N\216?\276\367\032pn\364-\322\331\367y\002*\276\322x\340Q\016\354:\341\216\320b\216w:\267_\227>\274\235", 64 },
{ ";\355],\232J\026\265\200\333\220Di\271\362\325", 16, "\217p\015\025\3636\334\234\011:\304\3378\203T\247\207\350qA\370\365\307\021\230\250\312:\214l\311~\274\220\303\225S\250\230\343hc\261\374\343gI\374JO\013\325N\271\255A\264\032\215\013>>\262\021", 1000, "Tm\271\346\333\031\034\261o\233\342G\006\277\264\2759\015$\351\352\331\214\200BL\375\356\322\376\340\337)f\356%\346Tm@\277F\027\012\315>\327\276\001\302\2576\313\244\315\276H3\346A\266\226\312T", 64 },
{ "1\317C\247\340O\362+\332\245\006\261\2069\252\342", 16, "l\31548\373\321n\375\007\337\320\277WV\334\205Q\230:\021\010*g?\3702\004\005\306\305\324\025\256 \203\351^\276\347H\306\345=k\310\247G}\326\020\347\363\350\016\215{\023\374\357\335\2669\315\353\336\250\224\303W\370\246\221", 1000, "E66r;h\253\215\200\205\375d\261\331\275\264\330\3146o\011W\210\217NI\343w\256;\226\351\351\000h\346\340wi\221\275\302C}l{\336\272\030\177\273o[6zV3j6\007<z\301\012", 64 },
{ "\374v\346\261\317NF\250\231\373\033\2245\2710e", 16, "&\323\263\377\023\341\277\134", 2000, "[\223\375&G\271K\011\025\134\370\0106\031C\004\026\342S~\322o\341\255\022\005C\010&a\035\2518\363\042\344*=\023@\033\366\340w.n\354\200\360\365hp\377y\245\337:\251\006\245\355]\240\257", 64 },
{ "\004\3662\363\223\211\214!8R\001\342\222@\240\007", 16, "s\134\376\266\373 \303\003v\371\241\351\333$.\030", 2000, "{w\276SN\361\322\134'B\322\251\020\355T\370\313\030cT\330\320\223%P\013\363\241K\257\000\257G\312-=\244\213\276%r/I\367\013*\241,\303\376R\217\330\000\250C\311\371\134\042=\260g\214", 64 },
{ "\326\177\361\022NR\032\230\371\324L\276\245\201\013^", 16, "\205w1\025*\032d\307J\134\335-\314s\313cb\227Np\367J?\200", 2000, "\347S8\233X\213Z\345\247v\342\237\354\302\025\237`\315\204\221A\253\245\260\327\275\244\300\0167\216\307F1o=\012\341\207\307\305u\220\340_D]5~JC[$\254\034\005O\336\036\232\223\253O\007", 64 },
{ "\032[1B\237\025C\314\315,y\242c\361\363\201", 16, "$\344\215n\370\134\225tJm4\011\012U\004\201w#\034\273)^\236\202\334\266l\232\205*F\333", 2000, "\0323i\231\017)\341A\202c\335\200H}\017v;\037\226\036P.\270\205\035\000\372)\257\023y\340M\277\232b\000\037\341\266>)L\244T\025\256\353\2726\023\241\3501\221Qz\342\001S*^\327x", 64 },
{ "^u\024=)!f\324L\251Z\200\377#\134\362", 16, "\224v\363\204\345\353\263&e\242g\310\227\323\231\370\320\350u(3>\346\013?\3316\360n\316\2560\032\264n\003\177\352b\360", 2000, "u64\012\241KEM\001(>Z\237\042\027\240\361|\252\216\357\214\017-\302\002\365\224\355\277\351\033\011\030\324\363\034\320q\340&F4uCc\235{\347\013l\2671zB\025\236\3174\215k\361IJ", 64 },
{ "\256\002\200\356\321\334\300\0423Y\021fv\323iD", 16, "\224\307\134\316\002\320\273^[g\332G\320U\0139\004\022\220\010\372\200'iw\376\236\012\034\304\017\035\334a%/\322\277\3206o\262*8\014<\004\202", 2000, "4\274\031mr\012\340\305s\042/\217\205y3\374`\224\223\311\377\222\301\202\214\351\337\010\015\315m\213\263\334g\314oT\372\330\246(\333\306X\321\376X2\206\026\230\333\361\325z=\277n98\334\377@", 64 },
{ "\250\346\251\243\207\200\303\011\307\231z\220\332\004\367\021", 16, "F\251%7\247?A\003\200\015@A\260\042\247\310\356\004/`#\222\244\201\317\375>\134B\023\024\007\032\251z\330\371\3456\006Be\207\343\354CR<\261O\352\362J\361\377\367", 2000, "\276\207\365,\306\033P\0200\231\2013c\351-\301\032\207\212#\301\3233D\374b\027\206\357\335\341\321\205TO<\316\225\011\271\013Ca\235\315>\214\325\222R$\003a\224\005v\253\226\243s$\375\345\240", 64 },
{ "\222\324\307\304'\000\210\255 [),\322\357l\332", 16, "\007\345\242+\012\357t\231\202\266\324\250iv\277\257n\315\354r\025\004\356\233\317n\256\042\202\372\251\223\230\226c\203=\334\331\230\237\034\2129\215\365\317\006\250\010\361\335\226\261\367u[zT63|\365!", 2000, "\371\270dr\215\025\035\212\004\012q>\263\267*L\201\373g<\333+\215@\334\260E\253,\302\261>\222\201)Y\006\316,{?\303H\240\253\326\362b\134\374\177\013c\351\237h\025\2350\313\3422\313\272", 64 },
{ "\325\351\200@r/\240=\323\331\372\023\244H\013\236", 16, "\326\307\360\340u/\260\312d\314E\240r\134\025h\272\202\230\177\364\346\134-L\345\362\260Y$\207\027fv\257(\336a\307\215\341!X{\024\0317\345\257\240\263q\332\032Y\230k\026\254\037-t\031\244'\353\324\344\3014pD", 2000, "sf\252}\216![5`hs\210\324T5H\346\037v\314\344\346\330c\240\373\021\023-s\350\356kj\224M~i\206\325\246\325b\347\335\252\303+\277n\003\307lgw\217\245\025R\205\301\257gb", 64 },
{ "\244 \262P\000\300\360\311\042\251hn\226\023A\270", 16, "R{\337\244\226\014\276w", 3000, "b\254\205l3\271@=Y`\251\226<\316\334\013$\321\357[\357\324P\201\246!\355W;\362{\367h\2072\270\247\353 \271\357\233_\330C\322\231\341\251\315\010xm\270\350\260\352\304\035\304\204K$m", 64 },
{ "\015}\205\262\251\331\300M\312\216\024H;\313O\030", 16, "@\225\032!\031\231W`\325%\332\334+\345L\257", 3000, "S\042\245F\263\330\001\203\365\020Q(Q\032O\302\236\311jA[Yq$\000\210\266\026BIFj\255\263\362L\357^\304I\266\222\223\001~\321N2\202\206\301Ml?.R\321\215h\327*\347\317\324", 64 },
{ "\270\257g\226\273\231t\256;\025\270\267mL\177y", 16, "\224\2678\3320\274\306\365\254a\260\307\276\377\012Y\231\372-\3652\026\225\026", 3000, "5\3706\342[/{PT\265sHl\345\275\215\273W\300\354\341\342 \334\011\013T\003l\225Q\333\277B\240s\211\231s\360\353\301A4yj&`\024\005_\307\216\325E3\235R\032>\213\034[4", 64 },
{ "\312\207\223Gfp\250\306\342\002|\233\1349U\004", 16, "4\321\374\364\375ycx\020g\345\224\352\0424\313\011c*p\267\376\232_\370|\240\010.\3227\033", 3000, "\341.\134\262?0\256n\334\263\356\273\3141m*\352\344\237\302\300\364>\347Kq,mu<\327\010\267.lg\002\232\226\350\354\010\263\215+\032\014\230\262\375R\264\032\204\334\351/\314q\361w\246D\274", 64 },
{ "\2645\264\241X\321\351\352\342\015\253\257\241\354xn", 16, "\214Ihf0\343\371\323=X6\244\327\237l%\340\300\021\006\271Q\340\002\267\331\234\0100\231#j\005\342[\367\012\042J\237", 3000, "A?@\303a\325\243\015\200\206\256\025m\2471\254|\252\203j$Y(\013'\346\336\011\217\355I\346m.\001\337\033V\022\342\2177\216\264\211\000\253\330\007\315\323s\365o\371\330t\361\235:\0231\266#", 64 },
{ "\250b\326\230\271\352\346\357\305\245\303:\3236\036\300", 16, "Fe\247\220E?\206\201p\303G\006\357\027\204xD\264\237\247t\042\357N\335\351\351B6\177Q\301\307\334\012H>\2572\275.'tu#\014\371\260", 3000, "\3270\222r\024-Gf*\352\204\271\305\315l\234\370\364\313\304\250N\267\321i_=5\370R-\302Oi\251\305\236\244\376\005\033\270\265\031\007\242\234\301\02166q\243\042\035\326j\224w\035\232J#m", 64 },
{ "\226 \316\360\363n\302\012\207I\3022\252\232\271\221", 16, "\213\316\027t\212l\242\354\014\304\376\344\377\352o\207\330\376\037?t/\214\316\017\027\363Y\010\017\027N\326\007\003\263\274\042\177\230z\264x\340\017\204\005\203\200}w8R\304|g", 3000, "x\330\300Nq\0371t=\326=O'i\0176\314k\351\301\335\134\372s\200\331\010\322\226e3N\016\341\251\3670QT\322\200\346\217\300\202w\010\253\242\342\272\024&|i\307\270[H\357\306Vu\004", 64 },
{ "ng,\206\357\313\353!`\263a\237\375\256\224s", 16, "\334\370\260\331\016\0355\342]/\207\227K\2323\256\003\004\314\256\020\020Wc\241\367!s\366\223\025\254\245\227`\335\226-<\375\367\010_p\2151*\204\2501\263\242r\324y\231>Ej\324\374\265\247+", 3000, "\233\241\316\316\335\307~\260\336\332\273\337\263yqH^\202\037\265\375\032\353\364\277\241\241\2456\325\3558\364\360ft\316\031F\350\300\026\026\264;\345{Ru\002~\027\340U\316\313\231\205\205p\3167\256*", 64 },
{ "]\340\304\315\250W\316\336J\263\231\002\216\251\364\242", 16, "\201\376\003\177\021\346\237\211\320\262\334k\320Hu\220r\357\237%\222\357\013\350\330\042{\210t\227\376\372\016\3707\340\230f\200\360\300u\312\034\220\376]ct\225\311\275\005z1\243l\373-\234\2154\317zZ\0306\312\2435\032C", 3000, "V\373\262\256p\232H\0424\034\215\015\273)\217\366\237\253\323R\226\256A\257\334\355\035\376\331=\251.T)OVJd0\005q#\356\346\012\223,\017\015S\227\007\034\010\026\370\271\233\267\030\010\357*\244", 64 },
{ "\021\225f`U!\334\331P\355\312\351-\032E)", 16, "+d'\210\235<\262\204", 4000, "'\276\227\331e\015\206\231\234\323\2578\306/\0338\007U8\354}%\310\265\335%O%\255\377\376Lo\303\350n0\353Zi\355\277\315l\010\252\366'G\272\263f\341\310N2V\346\334\257\214\333\002G", 64 },
{ "^\314\361\023\376q\261\003\245N\240\353\031\300\031I", 16, "\355^\377\321#:\253X@7\201\251\215\257&\310", 4000, "\266=p\000\366\231n\365r\310\011\266\315\357\242\011\333\237o\030k\364\341T\042E\332\313\255\227\246\251.^\372\012\317\222\355\244\2066\034\336\000\250\277x\000\315\002\373\263]\037b\350S\036\303\341X\002\335", 64 },
{ "\300&m\242\343a\326$\210e\200x\012\335\036Z", 16, "SG\363E\013\273\017VO\360a#J\220,\263\375\322\202\227\242;Pr", 4000, "\242\351.\17783>g\001<\034\004\030\002\312\345\270\021k\342\375\243/\342-\346\240\017\260bj\342e\206\225\134\367x\330\020/\363v\214\241\025\205lg\347$\275\300\315\205\021u-1\246SH\205$", 64 },
{ "\235QV\311\015\001\301Sd\204*\270o\026\177A", 16, "w\020\211E\315W\014\015\342\344j\251X\341\2528\354\371\336\214\260B\367)\264r\345r~\221k\255", 4000, "\3260\375\203\347\030\375\023\351t]\015=\301\267\303\035\204\2345cJ\2565\243\266G\211\333\024\311\320\2556\031\302\310\257\273{\340\274A\011\305\206\272\232\264\336\217\012)\375\036~q]\241\267\220[\203\330", 64 },
{ "\303g\3655f\271\332\250\306${\317S'\270U", 16, "\300RV\321<\333\2779\031\216\346/\305Dv\021\333a\374\344\303\355\370\0367\201\315\346]\242\375)\323=e\023\013\201\306 ", 4000, "@\253ur\230\326\344l!\004\026\352D\222,\021l\0316S\205-,\035\374#E\023q\034\312\0003?\234\000bs\334\011\011\204w\2558\356v\343\255y\260\023\320\305T\314\300K\232\000\013\352\305:", 64 },
{ "\366\307\305\200i\370k\246sc\035zh#`\035", 16, "\341@\032\010\373\0114'\275\204P\256\314\324>\030\266\343 \034jB\372\0124\255^\234\207\274\322\227\357\244VJ\273wq\326\224\373x\360\327k\3508", 4000, "\323u\002\267\022\271\274t\002\305B\017\015\366y`\256\201{w\017\240/\225p\356\036yj\277\277\242\243)$\244\333\272j\367\024\223>\021o\370Aq\343nV\237\031\234\350z\226\201\300\024\256\006Gh", 64 },
{ "\365\236\311\322\134\327\033F\230F\370_\217\221H\315", 16, "\214\207u\217\253\234Y\236\377\343qB\374\035\231b\267\266\314\226V\207T\367\352V\001jY<\337~q\203\345\265\230zB\2110\346U0\231\205\246\254\013\213\011\134\236\351YO", 4000, "\315\360d\246\273\364\265\217\210\306dnuA\004\347\022w\200\375\267\341\336\340\226jlc\354\205\310\316\251G\373\347\237Cee]O\351\237UN\236`\305\244W6al;#\336\377n\335(\337qO", 64 },
{ "\341\325\003\214aV\254\361\365\314\333y}\005\036p", 16, "\274\271\3200UV\327\273\263H\022\362@\322\300\362)SMQ\335'6}\017\255\332e\341=\377v}\024\012\316\233\324xJ\367\011\016\260[\260N\322\257\011\005h\273\237L\010C\263\3300\321C\365H", 4000, "\336=?\327\210\002\245G\275:Q\371\271\233\300\273v\274@\002\363\340A\305\372\272%\355\365\343\012\000a\204\276\243$|\237\223\221\240*\351\311\262\327\367U\000\316$G\224q\036\033\327\224\247\371rzY", 64 },
{ "E\352\312,\222$\365\267\303\016\331\276\345f\305\134", 16, "\01152\236\032\242H}L\263\334qk-9\013\006\356\357\251\372\026Tb\304\256\226#Ad\216\3024\333\264\240S\217:S\257\024\347\030\321\026\223\024f\301\261]\301\002\272\350\023M<\254\255A\270]Yh\251g\2235\206*", 4000, "\352\317\323\300\357w\365m\200D*\277\024\330\246H\207\347\257\211^\240\362\005\001D\237\310\332@T\243pB\247\025\236\204V\377\346u\242\203q\324\307\320\314\207\372\376\222\206m\134\037\365[\307,\240\377c", 64 },
{ "ho\014\234\352\310\134-\224\021\301\134\015d\356\351", 16, "'\256\217k~\376y\335", 5000, "_\341\264f\012\003\275\012It\363\322\301\032\342\337\331j$'\006\014!3\3029\313\200n\266\003\254@\236[\011\214XK\372\020\210\335\031\134\303\011\042-\004\365\003sn5\235NK\375\013`\022\336\025", 64 },
{ "4\020\304\323y$t\014\202P\251H\371\235|\035", 16, "\303\370Y \366f\325\317\352\030^\245\234\366\010u", 5000, "#W\033\270\241m\245%\357\270\243\340\211\271\263y*\341-\002\277I\332\227\042\271x\321\344\246\030x\252\233\326-s\302\334\327G:(!\315\220c\346\240\375\012@F8@\205\271Vx\321\202\024!}", 64 },
{ "\034.{\0068\255D\335\340\303m\273\356\223x\204", 16, "\247z\325\244A\337\245'5\373\351\336X\330\003\2576\243H\020s\226\266p", 5000, "\353\206?\351#+\346\206\330\225;ua\020\263\312p\024\2229\213h\015\336q\254\216P\256 \004}\001\355\230\214emU\323E\371g--\237\303\022'\016\033\355\274\267\271\351T\0327\300\306\253\031v", 64 },
{ "\015\363\324\364\323\220\323f\177rR&v\375\027U", 16, "C\020\362\262F\351H\240l\271\245_G\134\034mC}\277\354\017\377_Ab,l\322_6[v", 5000, "\370\357\015*{\001\221\310\244\235\134\214k\335\310%\274\226\3203o6\223\361\243\356\200\000\340\240\330~\225\266\004\224\254\211\276\270\202^\251P4\237\350^\036\3671MV\317\214\227\022\211\344\022\321\001\257}", 64 },
{ "\312\272\240\233x{\372:;\253\370\330\334#\267A", 16, "\323&\213|\016\3346>\224\345\032;R\233\0056\316:\037\315V?\221!h\0308\231\333\207\221k\035\222\252\014I\2215K", 5000, "\004\012\245\017y\316\355)\320\007\331\236c\324+\3771\247\257|\336C\332\331\317\037\007KG\321\334\235\237\265\301\360\315Im\212\260\012d\033DIb\042\260\025\304\311I6\2158\3527n[\032\347x\371", 64 },
{ "\215R\005M\032\350\240=\023x\0165\246\231$.", 16, "\021\272d\364Y\217\317\346\026\0161\327\214\001\357\335D\030\364OE\264\266\012\270\350c\276\340\327\254(\2638\361O\253\254!Lb\021\014S\234Z8Y", 5000, "_\3748\356H\220\264;\253\233\323\376\2548\235\004\357)\002\277#Gz\253\363j\026\015^\335\024#\211\002\354\207\373E\364\2513\344(f`\214\227\3319\031SIh\260\234\202\301\375\204\315 \002\347\376", 64 },
{ "\245\313\007\234\303h\224\215\356\243\352O\206,e\266", 16, "\031\033p\375\350W\006\004\213\313]3\214\257v\333\0357\016\375\364\021\344\305\323,;_\330E\224\351&N\244\026\275J\354\024\340\310'/(\012V\217\253P\361\236\273PMl", 5000, "v\276{&\342:\355Rm1\362\320E\344J?\015\023\323l\315\331\252\031\245\206\231\014\303\340\022\231\241\332qe\036\226qF\213\254\037^\220\042\324L\204\011q\277\233T\303\350o\217k[\327x2\346", 64 },
{ "\273E~\201\327n\340\231\001G\001\367l\206\021\030", 16, "<0=\371\010\317Aa\375\340\261\234F\275\251\236\024\310d\003\265^\345|\372-\223\305\235\272\344\350\271\3669-Q\264\312S\323 \236\343\352x\304)\341\334\355>j\024\251\377\252-\356\241.QW\256", 5000, "\307\241^1\271\302UOY$\250\372pd\343l\031\205\353\272s\004\311\002R\276\006\232I?\327\020\237[\363\012\2656-\361Z\177\025\210V\204ZF\351w|\206RqU\042T\205+\222Op\235\376", 64 },
{ "[\034\223\310a\210w\351\020J\351\263\240z\034\261", 16, "<\217A\265\347 \264\242\024\324:\011\370b\263\345R\012'\271.\005\350d\027\314\017\034\361W\316Tj\225n\1778Y\356'\012ie\307\342cF\266?M\300. \271\247`\042\344\272\371\013\273s\316\357X\207\304\357\013\322\315", 5000, "\241\224\024\317\303\227\241\317\332\351\301\3567j\326\320w)\275\223\234m\241{B\356\274P\274,\012|\235\367.E\345c ^Z\321\031\352I\042\005\365\264\360\245\357K;\306\202h\350\206fV1\000\325", 64 },
{ "5\265\376M\262\3518<\353of\232AA \374", 16, "WSKsW#\354W", 6000, "o\027\243%Q.\3759\331k\011R\363\367jK\234\357o\363\317\220|'\245\233l\250\001N\203\322\002Q\026\027H\267\253v.\351\242\220\257e=}\010/v!9\346\352\3749\2014q-\340N\376", 64 },
{ "\350\203\337\210]\367\213\335\270\213\232\026\221|,\370", 16, "\346\327\263\312\213\345\005\011'~\221\027\355\241J\231", 6000, "*\022\205kO\256\322\231(\361\367\342\277\266\220\000nj\330xh\340\215O\356d\210\225\303\2373\340\2130;\005\254S\3115R\257g\344\233\023\347\205\237\274M\307\367\327\364-W\246W\203\275\373\237\272", 64 },
{ "m\326\335]k)2U\200G\347\000\311\010\311\302", 16, "\340\250^(]nb\003\212\354b\177\344\011y\300P\016cl/0\016\213", 6000, "\273\333\252\306\015\232\306\321\251_]Y\006\042\345\350r\222\010\372\026\205Mg\373\347\267\014\234\032\016d\210i@n*aP\316s\366\206\200\004\015\017\034\325g\334OS\177\214\374\230\211eP\213rNp", 64 },
{ "f\323\354%,\247\330/\027\373\267@~\345\352\256", 16, "=\354\324\017\336\012\214\370\014Pd\217\317f\364\301a\207\032+\227\2247\201\317\215\333\020\276B&0", 6000, "\245+\223Y\302\363Wl\312\0344J\245)\347\217\027l\027\321\0121\341\365/\263\374t\330\262\210\220\250\354\240q\020^\033M\274\261\350Sp\325\254_\262\304\357U\031*\262$\363\371\030\036ay\200\242", 64 },
{ "|\035\377\326\376\2752^\335\207\230\271\341\326z*", 16, "P\271\315\034\230[z$j\377\266\015\205\3064h_\316\254\271\353\342\301*\366\366\350iV\004\351f}\260wr\257\236\025\241", 6000, "\301\354S\253]c\332 \277\205!Y\356v%\225\367c`gB\006\024\247t\314\300Q\323\225\020d\036\024A\353d\335\007\025\014\245?\252\246W\222w'\301\263\003M\014\300.\014\2420\011\355\342XA", 64 },
{ "\364;\377\002H\026A\016P\352\331g\2407[\261", 16, "p\271\243\3110\372w{O\317\315Q\035\371\221\016\236\215\002\222\317Z{\372\375X\316 8\226\270\024\344\373^>\235\274\320\337\313\366\223\246\336\250\134K", 6000, "\340Lv+w\360\311\322\355_\036@Hd\246\275\324\033\235\274\013RJr&zD\230\345\033\216\234\213\255\237[\217U\367\300\356\331\372\237\021)x\362\216\306/\351\374\314\210\2341h\227|\230,\336D", 64 },
{ "\134.\271\033\351\232P\020\356k\321X\351q\331\004", 16, "\277\207!\216\312\324\347\223\234\202\360\220}m\3773\210\232pe\020\254\371\334\266(\227\254?\305\017T5\020\210\223\006O\223\375\357!+\363\003\245.\325\255vF\350\3565s\221", 6000, "\352*\003U\323P\225\256\254\374\001\337\312\377[\134>\2306\270\001\217V\033\006<\243\265\012\355+\024&\374\313\031\254|\302\006\216\216\250wD\352\320\3128zf\000\205[P\323\013E{\025\353\276\316\034", 64 },
{ "\015\372\205\371:m\005T\000n\3255\366\220\2653", 16, "\266\234\036\134e\020:],5\005\201\331`S\305\224\017kW=@.\025\376\017\353\022\210\007#|M6\354\210\3121N\356\331\033\223\230\344\305sR\241\232p*t\217\366\243\352E\255\332\004\270\365\361", 6000, "qq\245\012\237#\004\316%\345a6\322\340\353\0344\265\013LH`\237A\232\337\357]\363\023[\353\2631\000\277\013\317\336\371\3125\312y\305`\236*]]\204\236\302\344e#L\270F\232\372\267\232\250", 64 },
{ "F\256\277\366N\234\235\316\042\230\263\256\025Q\320'", 16, "\200\254Yq.\205\373\373\0056\331\214\376C\235\277\323\350\261Rc<\177.<\326\237B\353\373\360\313\257\333^\212\303\023>\223\004\327Q\333\271\011I\303\230N\325N\0172vT\011\214\330a\260\216n\017\207xd\264\327\272f\276", 6000, "9\343\311g\224\222\221\275\256Mb\206nD\361\232L\327s\222P\005;\255\027\240\261R-M\231\347\315\3164\264\314F\347\245\372\247\247\303Q\341\241\271\003\035\207\303\304\335,\012\360?Y\320Y\227\376q", 64 },
{ "#\256)c\376QG\273\245\222Y\010\357x\221;", 16, "\315Ysi\036\266I\332", 7000, "Z\213\027\2367\231\205\005\224\300'\224>u*\372\031\003U\205\242e\223\274Q6F\362;?\022\327_\343!\214\276\262\247L\260MLX\247N*Y+\331\361\215\220l\331\213\361\335c\314\203.\330~", 64 },
{ "\360\343\200\367\344\250O\260\215`\247Z\341\274\346\270", 16, "\310\2524/j\334(\344\303\017Bs-\201\264\312", 7000, "\037$}\362F\213\254\306\345R\345i\326Z&\262Q\017\304\210\026\216\336#\220:A]\210[W\246\272\005\011z\337\036g\366\206)\245\201\214K\335#\212\205\350B\376h\034!\235\006M\272\256\225\257\220", 64 },
{ "<\230\261\363\334\357\217\022\276\000R\306\240\210Dg", 16, "FQ\263I\223\375\335\2135\006\374-1/\227\207S\341\202!\372\206\253\236", 7000, "\266|\263\374\266\265}\000\261eB\307;\233\241V\253C\014\224\230\012\326q\276\242>M\214[wt \361\361\205\303\311\320\355dV\245\242A\237MAt\237\340\242K\3133\355\357\034\303\200\0277\267U", 64 },
{ "\213.\310\205\014W\307\364sd\223u\363\035M\260", 16, "\331\007K\015\367D\224\016Q@\243a\264\342\346\216t\2161\030p\345{\227\245]\245\274\235{\322\245", 7000, "nX\013K/^l\377\237\3044\010\277\367\134.\222\215/\3471\023&:]!^\261\177g\272\011\177\374#2\177\326v\251\003\005\374\232z\030\274@\311\321n\323\227*\024H\225PA\241y(\276\361", 64 },
{ "`k\271x\304Cf\230\313;O\277\236\2448\207", 16, "r(\245\265\003\237kT\204@\321\252\202j\242\352\365\366FZZ:\366\272#\323\017\2666U\240v\252\236S\332\011\001\361p", 7000, "W\200\361\034j\376\022\254\325\205\257|\232\255w/0\373\267n~\355u_\331\007\242jXi\034E\254\032S\205\034/\023i\356\310\250\226\3517\201\311\360\237\201\221O\267w\355`\366\217\257\006z\357\321", 64 },
{ "bg\316Zg(\330\371\016:\011^\202\000\235f", 16, "_\177\346\022\375\256%\310\347m\336p`_J\333\334\003\312k\254X,Z\361\372\303#\305q;\343&XT\316`\006\036\215\306\207\327\311\255(\203/", 7000, "\313\000\3670T+\346TF\365[6\223rBb\241\267_\035\321y\315o\255\321\035\361\230\371\230\015\264\347y\364'\376-\240yL\036\260\265\234\265n.\217\312\261a\234\032\227\257\207a\331\354\010\263X", 64 },
{ "\350\026px{\014~\0317\015\314\231h\336\237\217", 16, "\347A\307^u\267Qc\027\235j\323\012\315\311\031\234\2003R'\015\221\370\030\227\003)h\214\236\012Qok\210`\320\227\307\354\303\305\317\314~|\014Z\012WA\036M\322I", 7000, "\227|\356\271\333<f0\014\3640u\2273Vq\3353\2653\134JW20\020\016\023\335\243\023jm8\316Co\245\204\273\304B7H7G|\302)x\342!.\252\244\216\3137\253\365\202\256 \263", 64 },
{ "%\020@8\324O\311\316\032\222\200J>\257\235G", 16, "\311\372\032x.?\3452L\331*\235\356\356\261sY\313\266\260\014\202\333\016\006\322j\3516\007U\377\215p\177s\267&\010\352\010A\361\315\357<z\241\213\202L\302\314\334\316\244\202\234g.\361\202\326D", 7000, "`<\340.\017\300\273\033\250>\0103k\220\311\042\250\267\022\312\030\034>\343\250\320\300\002\0123i\361\025~V\037\273\277\322\272sI\375m\375\337(\345*\220\362w\231\373\315y\230\273l3\017\226\260`", 64 },
{ ",<\361\027\343\375\355\265O\264\234[w5\261\340", 16, "dS:\242\350\2612,\314\224}\367\361kW\335+Gj\357Q\355\251i@\326r\024K\346\034B\340\360\242\356\016\272\216m\232u\220\300\236\333\312\363\036\241(\322&\244\211=\275\376\006.\377\013\034\220\020\306\353\274\374\042[\300", 7000, "\277\364m'[]\305CMd`\345G\237\352\371\225\215\373j>V\362\241!\364l\033<\236\364O\023\276?n\231\207\3735\201r\270\305\337\177'b\031\014\251\213\217mZ\320\266O\211\364&\0304x", 64 },
{ "\225\306\272{\341v\275 [\231\230\317\371\363Je", 16, "\343\036pA\252Q\264\242", 8000, "sJ\331\240\3206G\226\015\2441\370e\317\012u\356\372V>}\251l\1340\033U\177\215\316\317\037v\226\016\272O\275Z\341\307\370\317q\311\010\332\304\012a\375\343y\336ZT\377-2\361\203 \042\336", 64 },
{ "\320\231-\337g\034\212\004\342\037QU:X\277\316", 16, "\216k\037\361.T\244\366\003\010E\323U\233v\240", 8000, "\021\375\214G\326\017\316\350\013*\236-\013\026S\223\310,d\036L\311\032CM\006\0352\241\232\000\342\224\025x:\215S\2146wvh\205\306-[p2\003\322M\224\353\237\263/\216\134`Z8\273_", 64 },
{ "*/E\206\367\224\243\334\243\262r\326\360\231*H", 16, "\345\315t\032\021\207@\026\330=HF\320\204\304\330!\232Om\322\246\0260", 8000, "\200\306R\350\230V\334N\020\001Ol\242\024yN:\350\241\332\214\262\016\2629V\264(\2059\220\326b\340\303\020h\232gb\202ZCiR\275z\347+\326\267\027+A\246!\345\206k6\344\255\264*", 64 },
{ "S\345P\373\311\016\352\202\352`)Ecl\336\361", 16, "\376\007\354p2\333q\006\237q%\037\220/,\007\264\366\006-\335\273\235\377\036\345\035:\351\042k<", 8000, "\204\256G\244\332\302{GC\274\335x\200\216\001\232\211>\263\211\360\032\031\267\236\317\257\211\273\031u?.M\022\014\220!\202\225\310_VC)L\001\323\362\014\231\341\244\350\222\022\243\361t\364\357\316G\257", 64 },
{ "F\042a\201rU \373\374e\273\351=\364w\222", 16, "\212\030=]!}o\373VP\036\303\376/\373\322\025\222n\234\300Rl\264\010\2311(Y\275\232\3137\013i>\327\233)\207", 8000, "\233\276*\331\257\377\012\270|\212\272\2466cAh\225\024\334\2332\026\177\330'\006\210\210V\277\323\251\211\230\212\363W\2258y\224\236=9\337(]\010\3171N<k\242\015Yy|\341\352\347\207~\207", 64 },
{ "\034\341\200H\203<\277\020\2368\307 }A\340\347", 16, "vZE-\014t\314D\300\2448\266\177\005{\025K \307\307\004W\262\005g\336\017\227i\217Z\203\351^\337MQ\314\253\311\246|O\334\377~v\042", 8000, "\364\037\206\254\004m&7\332$\036\012)\267M \241\332\245\241\262\201\032V\010\134e\323N\2445\351L=\231\316\306\233GS\234R\236,\257}-\0130(<\035\032;\212o{\312A\331\011(\350@", 64 },
{ "p\256\034\024\365\010\220\260\312\026\350\042PO5\347", 16, "\006h(k\243\227\366\276-a\363\360\134[\034b\022Oj\264\351\2013]\271\366\307s\342\361P\306\243\323\006\020\230L\374\347vy\226?\235\300\230\255 2\362\261y\341%\256", 8000, "\332\253\037X\211\234`\315\340\253\202\275?\356\366 [\357\275up$\275\317\204\267\301\255\372Y \235\350\031\000H0\306\372\330\030!\2324\304\035]\220\033\336\014}Bj\2449\242yq\341\330\014S\343", 64 },
{ "\343\333\355\3028:j\326\017\246J\255a\340\371\202", 16, "\217=\347\210g\256\017\252\3509\244zE\010\237<\311\271\342\3100\223\350\037\324Zf\245\356<\357,\005\323\351\261e\3544]l\313\215\341\020\355\316&O\231\255N\036\330\337!\307\370!\265\030\023\206Z", 8000, "v\245\254(/P\3105\353\335G4\277\250\243c.\260\355\343\376\021\017eK\224\007\036\331./=\134\220\234\026\337$\261Q\006\022\201\305@\277\036\267-\360\240ds9e\221\303s\3768\216\344R8", 64 },
{ "\246\214g#qw!]\335\300\024\276\231$\245F", 16, " \331\012\010\316,\374\312\371\0232'%0\3142\016a\356\307\266\233%\270\007\034e\306\232\327R\240\231mj\262\037H]\275\2011\217\246\343O\206\237\003/\2128I\222_\373n{\377\210\220x\217\224\375\327:\317\374\001\353j", 8000, "\334\020\265\311is\344\340\002|\352\365\362\252\257\347?\001WPB(9Y7O\353\313\343\244\276\217\257\217\302v\260s>\342\016.Cjm\322Y\356\26574\207\332\355^\351f\0258\343\267w\361B", 64 },
{ "\305?\017\233\177\271m4\354\221@\216j\376%_", 16, "_,H\223\264<\314\342", 9000, "\236\314\367\273Z6(]M\214\215U\254\264\325Gb\24793\042l66\014g\317\342a\236\317\251\254CaS\326![\210\303\323\202\032f\014M\247\034w\225a\220\303\332\024L\317M\324\022\023\206\316", 64 },
{ "?0`\205\22034\220\217B\361\242\217+'\022", 16, "\177\315\237t\250\213S\313\337\265\337\371]l8\026", 9000, "\377n\327S\215\306\365\346\375Gj\247\245e\2004\343\202\221^_\275}\323\2345\302\007\333\337p\353\265\222\350t\227g\356\032\272G't\242r3V\276\362Lf\222\016\244Ez\200\315\247\370B|\372", 64 },
{ "\306$\211\276,\353}W.\355\274\330\215Ay\346", 16, "\330\362\015\255\012+e\264\241.\036#\377\327\001\011\205\254i;[P\223\363", 9000, "\204\003\342\235\365\213\361\303\3248_\324\346\330RpT4\235J\0106j\263\032\2113bjHj\233\332\365oA\222\247s;\250\247\017\377U\354-f\005\277p\377\345\345&ILO05\232R\325\311", 64 },
{ "\257\364\250\253\267\304/\330\357ch\230xu]1", 16, "\247\336\344\240\322\251G\223\222\225P\370\322\311/\204f}\253\222\252\363y\214\346\016x\262&N_\002", 9000, "\262\003\321\0362H\220\310\344\306\265\020\373\300T3\2652+\252g\275\225\224\036\357\2050B?\375E\273\232\344\024\310\344Zh\004(%@e)\264\202\2022iAZ\030\210\033r\346\211\332x\363\023\032", 64 },
{ "\340\000\323\220e,\371U\242\254f\245\272\337\001\357", 16, "\215\306\001}9&\307\2221d\253\212q\236\3316G\005|\015\042\012\361+\005w\270\367\211\332N\026\331\037\250\014\212d\330\246", 9000, "\260\342\217\247s\321\350A\016\221\371\222W\304&<`\312c#\366\002\225\241fJ\033\211F\252\300\251Z\313\225q\202\036w\253\264\277+\361\256\235\354\300\203g\334qz\310[\022\326\212\223\314H\247Wg", 64 },
{ "\025[\275\212\134\0013L[|\034k\356Q\321\267", 16, "#YZ\033(t\272\257\363\262\134\225y\206zF\234rB\266\221\254\367\310\042\264\270\236\026\372#v\354\213\265\372\221\304-i\020\042\0107\344\253\3678", 9000, "E\267\177\372_&\305\201\215\351\335\007irx\302U\037\252\012q4\201U\356%\366m\245\202\373bqh\244;\271z\372l\2516u\267\004\013\246z\274F\021\312E\177\2159|\037\033C\340\351\332\353", 64 },
{ "\312\016\206\247\361E\252\245\001\033\031\234\227\246L\332", 16, "^S8\353\353\0307\031}\012\247}o\352@\027\217\200s\220\206c\320`D\270\232\275#\361\223\210ur\361%\003\034\3607\255E\016\271p\336\274\260Q\027\0136r\246\025\263", 9000, "\202d\317\362\315$\311J\377+\037\244V\342.\336\363Mx^\347\202\206Vm:\363[\3353\324\316\3403\012\357\351\364\221TN\340\275ALC\033mC\224\225\274\000{n>i\327\006\221p\360:\020", 64 },
{ "I-\350\031\2302\352\226OO\234*?me\030", 16, "\004'\254\034\206\216\214\277\213/\235\237\007\312K\347\034\361?\376\327C64w\313\300\004Z\226\207\303\363\0066\377\375=\341\371\207Aq\247V\237\024T\246\200X\342]\005\356\337\273\023tq\226\032\021\202", 9000, "\367\317\013/\030\210_\377\013k\366C\234s\237\011\212\330!.\016\263@\353\017\007\034\345B\212s\204\371q\336;\334\032\313E\324>\326e\344\304v\205\004\342\000\343v\025\346ZO\2243Y\264\366Z{", 64 },
{ "\237\234O\246\003\264m\356\326\201\266\313\345\227j\324", 16, "\027\016\205\250\331\027\275\260Q\032'\204\373j<\233N\251v\234\346T\250\270n\017\244\225\275\340\354\346LJ\376\2779\2311\311\312P\335\036\323\202h\255\254\376\261\350kO\3324\277\266\223\207Q\263\373\351&\0030\247\330lL9", 9000, "r\036\301q\371B\034\017/H\010>\242\326\247F\353\014\333:)9\353\261c\003\177\223\3277\250Sm\263\306\316\261\341\321\321\134\232b\312\235\014@\336l\330\3356\001nw>\363\015\210O!*{Z", 64 },
{ "\227\346\344\330,\020\250\376\033v\253F\236\207\374\245C\230\255&\277\300\310M", 24, "\333\256\034\031\307s\315'", 100, "\267@0\237\025s\217\307\3646\231O\246za\000\340\233Q\254$\277/=)M\250\213i\245\275t\333\322U\256S\025\030<\200fFkO\2528Y\272\243:\033\315\304\313\237\017\356\255\274\357m\323\215", 64 },
{ "\3410\3103\201\025\037\366'2\340N\277\256q\345Gc\020\036kH\373w", 24, "\302\330?\225\200d\3510\335\346\211\317\324\365\366*", 100, "FN\014\374\031a\240\212\202H\314\016\371|{\025\267\243\353r\257\365{35\134q\252\205\357]\317,Y\350G\206\365Tuf9\356\267\365S\371\332+\245f\332\213\371\320\215\215\300\242\243\216F\361-", 64 },
{ "\265\001\263W\336\011\274\204=\356p6\210\000\216k\216k\203\365>W\275k", 24, "\270\342\331\242\013|j\306\324$X\035R\365\326\242\307\036Z\321\303\357hi", 100, "\005\301\361qhJ\263\253\2069O\003\242E\333Z\014\003\274\336f\322De(\376\024T\336\250\2111T\270\320>\366\266\311P\177\234\264(\015Vd\260+ De[\0301}gzZ/\263\263ma", 64 },
{ "C\347\306\033\005#\201X+OL\177\310\360:\207'L\316B\325\264\324\264", 24, "\021\357\353jzG\377\235V\012u\262'\256\354:\007\343A-'{Z\204\204\226\321GbTP\270", 100, "\200GB\211ui\244\352\343Sj\207|\250\213\035\010[\335\312\345k)&a\035\363\213\371\217\212\317\364\031{]\355\315E\222@n\026\375k\357\004\3505\025\226w<\134\226\324\326\254\345$\322l\302\247", 64 },
{ "\236\030\042\231=f\332wq\260\342\364o\372S\374t^\343\027\374\006\002\024", 24, "\344\273\215\371\325wt\273n\225\221\020\263\214~\226\266\237\226\323w\026\313\327\377\201\022\226\356.7`C\362jR\217,\362.", 100, "\235\361\025\375f\302\004\271\274\003\354w\027\001f\034\246\323HME~<%\303I\037 \266\042\335PY\306\134<]\364\377\026\254d^a\327\275\012\134\223\027\265\277\177\035W\3347,d\362\250`\006\342", 64 },
{ "\035x\237%7I1\271N\370\236\340\214p\331\367@\355o\134\256\032\355\243", 24, "3w\231\014p'd\220\317\366[Kz\241\271\010\200u\225.E\277\313q\262\341\313\031\271\205\016\024\3616\021\345\030\254\367\314\312] \026\211\273fs", 100, "-\300\221\205rc1\013\374\370_xC\315\013Y\21477\320\202m(\345(%:\260\232\304\004\263\303\275\304\317D\376\245\331K\310\027\343\322\221q\200.Kp\206\311\231\306!a\240\203\324^)%\026", 64 },
{ "\023\366\263t\006\015l\264\316Gq\271\3468j\220\271\232\361\223tW\224\020", 24, "\365\367`yT7jO\360\247/;-K\241\031\227\034\211\251[\236S\015\035P\304\256\342E!q\205WJ\207\373\016\006\355`\235\367[~\300\264'\232\200u\241\234\210io", 100, "\271\034\330\262\216K\312\224\375\206\243\341{\372}\232\210R2H\032n\264\377J\021*\263\022\240\277i\242\356GS\302\243b\230@\034<\261\276\025\016\340EIt$;\347\221\024W\311\275R\254\272A\037", 64 },
{ "\373Oc{\307\313=\3414>\340\016\245\217jar]\035\307\252\010\031\025", 24, "kk\262\256\340\255Z\310\235\020\320_\032\345\260\243\352\202\321\301\246s\300)\3314FJ\267\361b\237\034*BrjY=z\336\300\344\370\371\035\227\334[5*\325\3152\233Z\022\302\3733Wr\012\005", 100, "\246\372\3420\204\346\034\314$wZT/\240\376d\252\354?\331y\225\037\252\374Ah.\304\3737\242\013K\351\035tH(\255\353\240\214\304\350\245s\273\326\265\340\300\253,\022/\311\223\024\3369\002{V", 64 },
{ "\201\012\000\332_\206`\206GD\336\346Gm\227j>\301Y\333\2658\354\001", 24, "\361\321\374qZ\346\016\307Xm(a\256\301\002\245\352\216\244/ca\247,\315V\017+H\004\355wmR\225Upz\373\217\333\206\337>\257\313\275\307\260\342PS\013\260\356\377\322\267e\027\250\030\262B\012\346Q\260\025C\311\317", 100, "\254\012\230\016\257A\017\210\264Z&\234\320\375BRb?\266\012\2509\222\355UgM\322Y^\321b\225\243\353\374\374\224\2545$q\030\030\370\332M\302\350\014F\023p\033\201\316\004\000\270b\016!)$", 64 },
{ "n( \210$O\004\366\207T\3158\361!\212\3606\317<\330G\250\260\272", 24, "\204+\330\321\244\030h\275", 200, "\353Ko\207&\357t\224\036\266ob\222)Cz\360#p\020E\357k\320\370\007R\375\311'\347\007\364p\340\341\275\220\341\260\032\316]-Rthu\206\202\255QY\251.\214\245\330\007\312\354@\375\204", 64 },
{ "'\273`n\012l\345{r4\347\264\223\376LW\311\363P_h\302\001C", 24, "\324\200pH\263\220\2615\305\341\371Gp:\323\322", 200, "\205-\343\243<\333\375na\337\314\271J\354S\300D7\011J\364\023?\2222\360\267\221\010Fr\256\366{\366\235\255\331K 1\370\307V\373\020o\363\367\036\226\004\246G\331o\321%\314\220\254\234\317\033", 64 },
{ "\345/\334G\221\360\212(\211i\247\012\215\223h(P\366\215\371\300w\336\274", 24, "o\341\236\363w\371x\217Y)\013\331\006\034\222\007\221oA\022\037\332\252-", 200, "os\235_H\326N\300\244\310\361o0\202j4\334YO \345#:/\227\042=$@\363h\212\365\376\277\34220\301\371\373\250\327\201\374\012!)_\001\346Y\2061\220\302e\323\004E\364\025\334Q", 64 },
{ "|fm*#\220r\246\343f\364\364\241\370P\313\315}\216x\303,\335w", 24, "\342\177\034\326\226\223Oo\035\214\227\361\305\316\314\307\323\223\353\271\303_\213^\337\017\204C\316\037t\345", 200, "\2571!\373\364\361]\225\332K\267\042\317\314\030\2360.\257\037H\215E\276I,\356\033\13411\267\335>;\226\254g\2532\024\323t\024\237\275\014\021\267\251\004\004\331o\305\036\256\221\234\242\210[\273\271", 64 },
{ "\315\3742x\230\331D\375G\256R\363g\316 \024Q\034\317C\271X\240K", 24, "<3~d\026V9\2178\224\202\324U\335\006%\270=\225^\001l\212\212UC\277\270\233r\211lR\300\275\223\275\300\346J", 200, "`[\366\233Zk==\042\033\211\322-r\354e6D\210\302\275\247\274\374\0266\203d\234\315\331\244\2671\226\014\336\243\350\216^\206\255\242\023ueK\017%CN\002t\300N\244\272?/s\243\200\327", 64 },
{ "v\313\001I\364\011(l\005=7\330\0012\000C@w\317\206\230\306\363\000", 24, " \300\300\271\3443iMC\254\301*%S\325\211\212Rw\350\3027N\233\237\334\3134\204\332\031HS\374\3749\214 \3503FN\367\002\030\312\351D", 200, "S\007a\011\031\231\366\371g\003@\3407\024\016\376yl\373M ksH\327=6\210Y\225Q\325(\2348\334\362E/w#\375\354qY5\324\356F\212\232:\033\231\306\235\302\321\330y\226\005\260X", 64 },
{ "\335\002\277\030F@\273\340E\000\300\304\372\322n\230\262\354\032\250/*\351\230", 24, "\270\207\0010\377\337\347\375\213\331q\315\033\371\253\012n\275\262D\267\226G\367\371P\213*xA!\364!J\342\2113\242\321:\205\203hF\015\315D\026\313\353[`\213`\374j", 200, "3\301\365]\214s%u\230\234\215e\331<.\347<\320T/\254\351\243huF\003dA\341\342\372\206\243\005\277\257\033\364\042[\200Y\326\017@\015\271R\225\035\330z\37523*\313\3347\027\226\325\355", 64 },
{ "C\325RQ/\246$:h\177\362\331\223\261\312\006\237%\326zY\375\033\341", 24, "\002d\2740-\177h\221\356\310\211B\036K/H\335\336X\326\324\3304\251D\365\377\234\220\375\325,`\003O?\340\276=1\246+\231\336\233\211\272\265\257K\036\316\333\204\223g\035\336s\347h\230\270f", 200, "[\037\344w\257\272\235\230\032\270\263xh\361\014\273\350:\273\201Z[\314W\254\224\222\364;z\303\372D:\022a\366\266\364U\3467\314\337\357\246su\014FO\240\030:\325\362ZA\363`\362\005q!", 64 },
{ "=e\0029fU\375,?\262\327\273+f\013\263\201\021\027N\026y\341\340", 24, "\312\204\344\332=f\0336\341\017\264#j\216\206\236k\022Z`B\242\355'Y\016\267h?F\270\213B0\245;\367f\363\246J\012\200\330y\230\200}\347$\243\343\216\032\037\006\271\214\322X\255\256\032\276\021%\263aM\264\252G", 200, "H)\352\343\007'}5\333\013:e\354\225zG\271\032\340~\262\351\261\177\004\227~\333I\363\301u\210S\252\231\340+R\271\336\317\027\354\351\364<\276\220\042a\373\320en\370\001\301\305\356\344\244\236,", 64 },
{ "\376\374`\300n\003\362\372\017\2253-\307\232\264a\351F\247\002\011\270\336\311", 24, "\023\265B\220\374\244\304\323", 300, "{\346'N\227\254\343\334b\323\220\316&\335\375\227\013\314K\214~E\374$n.Mi\337\223\326L\361\342\237\242\257D\207'#\237\373.\2729\363\005\003O\216\011\005$\261O\214\343\275(X\336]\317", 64 },
{ "\177\337\370\037J\313\252R\367\027-\303\274\322?(]\370\017_?\010\360a", 24, "~hCg\251\003\302}\372\2644,v\264q\251", 300, "\003\253\302X\215\255\034\206\337\272\327Z}\206\000\333\311\026\377T\336\347\315\341>\210gsS*\276@3(T\340\263#\325\327\335\027~\310\201;C\2723?\042\341R\346\247\273\355\344\002\300\341\314\245\345", 64 },
{ "mD\363\333\332\276\206\023\340y\331\010\326\322\331vHX\265:\277\042\350_", 24, "w\011\263\376{\016R3\025\013<\033\261\320\024\017\356)\371\235c\021\353\262", 300, "\304\010\302K\273#u\237\227\3135^\134\2743z\326F\265=}0#m\240@\303\020\356\373\042Xl\223^)\242\031\374\215\031T\316\020\203\255\273$\024\034h1\370\270;\276\277P\250k\252\352\232\371", 64 },
{ "Z\2556U\206\026\34258E\247BT\276%L\367\0119r\032\233L\272", 24, "8@\034\305j[D\015A\317!\227jgy\313D\315ZIu\367\266{@]\335\311}\351dC", 300, "\022\23418\340\022\235\005\024\016\010m\217\370\271\262\307z\325\003\237:a\216\255w\023y=#fx\323k\346\215\331\275\206YGw_\261\353\007<e\201\376\200L\030Af\352T\314\310\010I\266\333>", 64 },
{ "\247\005\202\025\315\206zP\360\241\134\036C<-\006\327\363\201q\251\002`\267", 24, "\271]\336\352\244%\215\020\330\3458\377\225\350\302\237\253\033\202\367\265\373\331\261o\250\031Q\374q\217\254\233o\230\375\236\327\333f", 300, " ~\303\251\370\211U\337,\237Ln}E\320.k\245\246i\234\202r\314\324MU\365\377v\3177\266nXT\002%\346<;\350\3354\262\330\275\303W\242\014\024UN\274Hd\210 W\244\222Fv", 64 },
{ "%\312/\275\212\305\002\376\340\362\311b\224\3203\012\317R\370]\336\204\260>", 24, "\343';\334\363\247E\332\354\203kj\3654>+_E\310\353~xO\202n\234\217\227\360\371\261\343\314E\331-\210\203\032]\177;)$~\333\367\313", 300, "\2553\037\301\022E\356\010\274\241\216\332\333\037!9X\374z\314\306T\345\274'Z\256\375\036\355HL\337Dw\276\235D\225\213\304\214\350\250\031\316\200B\317\320:\0253\233\233\025n\264\016Y\271\242\035\316", 64 },
{ "\273o\033\015`\0168\005\343\233[\262$q\314\315\246\011\036(\233\203\211'", 24, "Qsa\3029\213*\321F\261}\270\357\330\030\200\335\375'\261cT$\2101\303\035\253\024\267\240\246\377&\316\357\331\221\361nl\0327B\015[\332h\333\376\351\0258\232\203\321", 300, "\260<4h\346\217Q\237=\376N\213\261R\257\374@!&\300\311\027\263\346'\230\377\224\134\225\237\002vQu\006\033y\036D\357T\362\316\311.\321\271\207r8\304\035T\226\233\326\345,\327\361W\217\364", 64 },
{ "-\207,\240\261txU\001\360Q\213R3\332\236\037_7\016H\261d,", 24, ",U^\351\036\003\300?0&+'`\363\252j\202\270V\375\007\355DR^\032\011\237}B\304\031\267.[\266J\273]\325y\335\327\2555\201m\233\254\352A\315\214\337\022Q\270\330\367?\363A\021f", 300, "\220\326\330u\2268\305\223\255\2359\332\203\273F\203I~\012\232g\001\355jb\224\212\226\032\277\036z\326\0361\265\025[N\226\261$f\216\311\236X:.\366\036_\020:\247\004d\276_\276\237`\323=", 64 },
{ "\276\035\274eI\033\356\262M3\021I\315\006j\241T\025\216\342\246\223\035}", 24, "1\316\345\252\312\377\027_\302v+.\276[\002j\006\266\233\037\265UR\023\255\244o\263\333\276+\264s\336\304f'\250\377\003\300\006\320\006B\375\205\300\332\341p\241\223\254\024j\274\231\024:\003\276\233\232\006\011\201\220\356\257\257\361", 300, "\271\353O+ C\226\325Qu\362\201Cb\304)\014\367\001\376\243\027\360U\273\356Y\235\234\357\243\002a\210\324\017`\304F\317;\022\014\021Y\375?\356\343\253\306\371\006\330fdD\333O6\042\203\214\354", 64 },
{ "\342$\336\336[\306\001\033/\216\277\201\367\014\257\362\331\320\374\036\034\361\371N", 24, "\220F\317Y\0232\2022", 400, "\351\321\325*\035\023\026\377\273d.\016s\225\276\321.\330u\014V+\331Z\223\365\034\371\377\236^\203\213\240\375\220/\313P\024WS\331\034\251\347\220ux\231[$\334:x\014|\344\010\233U)\276\344", 64 },
{ "D\255;\367\374\305_\373\372\020$\201\275\3735p`S\330\333\246\271\316)", 24, "\300M\273:\024\362\017\002\247j\376#8\321\260\346", 400, "rW\235\326[\326(\001\223\221\340\316\006z Z$\217\321\372\3722\277\024\334\025I\252\374\134\232\342!\2111\351\323}^\324\217L\032\350n1\372>\311\001\323\3239\321\345i\262\323\013\014\262j \336", 64 },
{ "\200q\243(\134z\361\042cG\335'v\231\025X:\016\316\0170\342hH", 24, "!8\347\001?\220\313\251\3042\306\201\004l\012\356.\177\367~e\305\3269", 400, "\371\230\253b7m\177\266\325\344\350\375>!<gIL\313I\276\357\327\375\031\016\227v\272\216fO\250\226\3245T4\1774[\221\246\205\306rU\245\010:\314?k7&\337\337\010\274\003\031\305\210{", 64 },
{ "\376mL\306W\276\307I\220\0377\307~=\224(\177_i\025\016KW\021", 24, "uM\345\215\317o9o\020\220@\034\0078_\301\376\251\001\244\271\023rt\357\237U|\277I\370F", 400, "\222C\346\307\233\311\251)5%\273}j\207\312\356a\254-\207\276V\010=v:L\210\372$\257lxO\331X\265\320a\177Y\005W\210n?\366aI\032DX8\010\372\231\360\222\241\260\301\353\342\042", 64 },
{ "\365\016\366\0250 \037\313M\265\367\354\327Q\021\011\276c\0155\026\340\037)", 24, "\255^@\2710\375\217|\031\241\022\250#\347\217\201/\031\377.M\274$\206`D3\274F\213\253q\250|\302\203\221\300\344\301", 400, "\330\000\3218Hl\224\367\226\324B;N\337'\223.\2572\023\372N\277\310\210'HY\321L\206x\331\177\301s\373\226Eh@\360+\234bXu\327\037N \011\037aR_+\343\350A\020-_\222", 64 },
{ "\031\367P\265S\025\224\354\273G\203\211L\3560\234:\134\026\315\250\304?\217", 24, "\322[\307,\212(e\3775=\2660\252\346(bQ\212\307Fs\234L;\177I\010\313\272\227\256\042WpF\362V\024\357\225F\355M\201C\340x\211", 400, "y\001\326\022\223\014',D\302F\247nk\3156?\342\230\014\003|\331\024I\216!\237\366}\237\351fMhM\035\015\225\362gk\246Z\334s\020\221'\035\027\002fU\234\324q;\260\240\350\245\220\000", 64 },
{ "\361\232\331\355\367{X\357\033\346K \204\003\215\215\322\305re\241\245\342s", 24, "_\323\217h\017`\236\2053\017$mx\027{\241j\367\333\233\262\234d\042i=\006\222\210\334\313\253k\276\206\350\031&\2064\2421.~\306\261\015\042U\331vE\237\034\206u", 400, "[\273{\337%\242\275P\227\273\352x\267#\012\370`\305\372\261\270v\202\317\024c\372\274$\262\016h\3420\250\244\223\210\3579\335\230_\252\177Y7\276\371\313x\307\304\341n\201k\312\361\3505=\230(", 64 },
{ "\042\230l\031lO\001\333k\036\327]\342:\314x\265\035\2663>D\246b", 24, "\314\354\361@\255\027O\232\037\322w\032\316\356i\023\333\331\342n-\301Q\002\244\2328z\026\304$\372\366\260cc\310_S\236\241\237\304\212[\022'\365\226e\016_X\303\323\005'\374\010}O\336\242\321", 400, "\273\265\023\023\343\261\201\026t\300\270#E\336\012I8\300\271\011\016`\234\326\2417\015\311t\012\322\341\355T\335\254\217L\243\253\211\364\234d\222-\344\203\027o\342y1\305\266\261$\316\376\364\220\317I\267", 64 },
{ "\275\272\371\314\250`\370\331\324d(\227\364e\203!\014\322m\254kH\012\354", 24, "\2617\007\347\243\255u9\320\226\035d\341\311\344L\272\352\023\256\361\332\364\2700\014\247\331s]\234\223\223\210/\273V\364\335\015\032\267\357_\001q\310\367\260E\374!E\335\200\337\316sQ\205\023\240M\355\267\250\020{\207\254\231i", 400, "R\300\302\270\242\312\331\300\376P\201\353\0128\370\241o\233\316\260\030\222\303\322)\376\017>\007\011\005\222JPb\361\233\340)\036\352\242\035*>\373R\020\203\355\340\000\0212K8\311\240\266\134\347\351\216\326", 64 },
{ "\330\2011\262\366s\232\025\317~\260\312\237+J\202\020t?\134l\207\310\304", 24, "cE\245\266X\315\3545", 500, "\315\247\030\277\337=T\214\254\331&\364\374\030\246\000]\220\345\274\373k\243O\0234\006\210\2606\031\360y\205\226\221\212I\341\006\216M\206K\211\342\314s\343\327\316\353A]}z@b\0053\202\212R[", 64 },
{ "\250+>b\307\310\001\233\331\261o\360>\206\2733Dp\340y\017\372V\023", 24, "E\241\134\345\365\327\016\336D,\217\032\022E\233\262", 500, "O5\263\352\317g89k\247\351\020/\037\3033\370T7\304\256o\216\337\227\321\225\254hH\211G\316\224j^c\271?\340\036\003\177\001\205Y\303a3\376f \021\211\344q\362\255Q\341\264\244u\321", 64 },
{ "\2153$\257\243\042\257\230\3443\276Y\275\000\354^\363\317\342#\343\272~?", 24, ")\246LD\006}w(\243\307w\260\336\241\024w{O\237/\236\004\230\016", 500, "\304\373j\036\0062\302._\327q\002\302 \023~\367\007.TC,\206\177DX\275Y]\224\366\232\212\001U\207z\305\233\317\320\203\3543\353s\374\012\272q`]\333W\305\250E\336VG\223\343I\257", 64 },
{ "\224\302\305\230\315\313\231\243pxO_\014\374\342\256\237\231\356\330\215:\260S", 24, "\310D\2217\341\363\362\243&@$\221\340\320\266\213\236`LOy:'\300\244\314\212\302^Q\373\376", 500, "i\311\241\337\357s\333\356P+\023'\330\310\273\205D\354\233\343\310\306;\037\213N6\230\006\273\261H\272X\243\367\341t\234\035\263\2034{\203p\034\371gY\265^_\010\267\321~\272\34364\227\322\027", 64 },
{ "m#\277k\323P\307\256\351\316\020\370d\202\377\023P~l\024\201p\033\015", 24, "\366g\225\335\215\223\322\241\007\333\007Y\275\343\330\267\346\003\006\306q\332\317\355\355\377\373}\303i\3322\262\322\221\226\217\305\027\354", 500, "\351\011\202M\306\035&\257KE\357\361\3644\243^\272\346\024\375\267gK4\010y\013\021\361o\253\025\2719\267yk\374\261 [\010\036\360yP\311\351v\0252\236\270i\217\356\022\006\214\224k@L\343", 64 },
{ "\264\276S\014\276;\012]s|\330\273\223+\222\230\004j-\035u\260\336\364", 24, "\177\010jO\370\237\274\370J\333u\240\013\255\374\3621\342\013\240H\374l\372\225\016\266Vy\315\371\030*\024\231\302pLl\234\336\255\271T\001V\254\263", 500, "\225$\317\031\226?\314Cy\201\035-<S\2020g\215\037\202\327\001a=\372\225-\211\275\323K\262\271\244\243\317\244~\301\367\364T\260\204YC\030\304L>@<\030\252\205\014\245\231\277\271\013\317\375\260", 64 },
{ ".\373qW\226\272\303\354\235\374\302\320h\345\357\034\014\250\344\266\244\325\244\270", 24, "\240/%\223\314\333\316\363\361\034q\245\312\134]\254\263\267\255f\225\217\313\313!ax\035\273\264\272_\027\037\323c\253\271\372\246\013\361\305\364\014\016@-\310\361\233Tc(\015\014", 500, "\010\250\337\244J\255\022/\001\035M\334\2426i\327\255\012i\333\217Y4\250uG\007D\225:\276\344|\027(\311\302\307\321!!A\003\343y\202\247\267\253R\032\312Y\243\134\007\252\321\236\251\364\307\342\366", 64 },
{ "3\244\330\322\257\350\201\244$\032V\270\032\236T:YU\211U\265\327\262\355", 24, "\227o]\354 ;iq\224\345\203Z\231L9+\374\316\265\226\226{\375\377\204\007\223\274\273RH\244\134\243\224A\337W-k\362\372\317'\207\023\272\361\347\015\3371\344\334\226\277\215\277\237\351O\307\362}", 500, "I^J\373\327{\005\200L\373\304\022M\022\250J\253Iu`\345;/\023\325\362\001\032\367{B\017\366_\034a\257x\000\025}tA\347\332]#_\260\023\211{\301\310/@.&\272-\005\323\262\355", 64 },
{ "\343~<_Kd\253{\262\357W95\256\337n\325\336\357\257\260-\227\011", 24, "\251\014\025\254\015\257!\326\256@1\225Ay\027\311\313\204'#\230\306\254\036\324p\221e>\230{\373ZP\236\025\025\3610\001\313\002\275\315\204\263\332\315\342\003-\326\356\216[+\270g\255p%\224O\306\365\241H\262\001q\231\346", 500, "\307\204\357\347\320l\0328\015\373G\336\271\322h\326\034\245\301,G\215Jf\031\177\355fhtW\034g\266\316V\034\222\042\346U\253Ac\036\304g$1\004\244\245VP=41\313\200\272FJe\374", 64 },
{ ".\246\322\250\363\276\370\266\342\207\226\210p\366P\025FM\371\232\203*\036\303", 24, "m\221\370\307\016\020\374\317", 600, "\252D\266\320\035\2649\007=\003\326\355p\332;\021\277\360\200\255\033\313w\366}\201a\325\377A\033\365\321\320S\357G\241e\344\375)\0303E;\256\017 \031'\223\204\2630\027\253\225\354\305T\366\360\005", 64 },
{ "\277\010D\025\241\325\032%\235\032y2<s\011<Y\377\225\352\244\330\000L", 24, "\370i\352\334*\266\264\012\3658l\372*\306\372\357", 600, "\364\254\356\215\306\033\275\312B\255\314\214\267F\307-\025-tv\3412\251\361W\370t\240\316S\302 Iv\224\246\004\375nyqJ1fS\204\016\000\272\302W\244+\377a(\2510\003l\366\002\202\374", 64 },
{ "\364@\374/\361\272\034(p\366L\357\303\342\237\265q\200=\335m\346HZ", 24, "\311\2429I\020y\324\235$\345\013\260\300\323\230K\317\250O\017#\364\264\303", 600, "\324;$\316\314\300! L\200\337\003\301\276\346\032\204\212T\346x\027tn\206\252A\316\001\243\177\362j\033Xj,\214\301\025\024\004\017\315V}I\355]\314\250K\276@\027L\362e\2667\373\215\324\344", 64 },
{ "8\343\210K\202+\330o&\213\367s\237\275\202\330k\262\020\217\272\254u\247", 24, "\347U'\014#\363\233\207\301\241\317*gUE\230\346\313\362J\037E\0357\226\273\037\225\226\265\026\321", 600, "K\213\220\325y=\007\255\361\203\376\376\354\303v\215+\244\360\272m\020\273\212BV\300\261\334\250\214N\304\333\034r)\3515\357\025\377\334\231[\351\013JE\222\332\322\250>A;H\020\214\333\306\356j$", 64 },
{ "\002\261>m$`\016\02494\263\307\353\263\252r\006\356x\223\215\321\236\037", 24, ".\222M\266\201\371\370\375\214\134\223)\242\011\371\225\365Y\203*\365\275\252\037\262\315\024;\032\256SuK\275hn\231\233HN", 600, "q\223\223]O\3412\371D\304\246Z\277P\267\307\247\327\213\036$\223\234Q\021e\332u\004\240\254\316_\012\036!\230\213\233~=\233Ay/\313\010\204\207\220\312j*\016\324\347\042=\017\217Qn4\302", 64 },
{ "\216i\036Z\247\365\202\373\255\243\035o\301\221\013\3434*r\347\214\002\342T", 24, "F-\311\364o3?M\260\205\340:)\302.>#\203O\340\245@6\375\356\313X\267\302c0\014\325\261{\013\267\253\277\027W\254\004a\353\350\255b", 600, "Uq\242\257\354/\372\365\027\376\020\267#S\277\237\300\314t\021\234\370\034\320\206-\357T\272\370\204r\002ZAsX\356j}\012\2259\247\231\211<6-\372\027V8ZM]\200\2344\227\276q\033\322", 64 },
{ "g,R\261\255\355\242\315\344\302\207\312\216\326$&\246\352\351\004\230\372\357\342", 24, "\011\237\227\033\026b\224\320Z\340\2019r\220\367\304m\256%&&\3424zt!CY F\014\347\345v\255\230Se\372\021\242\203YH\277\262\213\301\327\267\314\036\205\0020$", 600, "\020*\217~@\030\030z\241\300Cf\230\362\037\343r\203\344A\304Z\223\2310\331X\377\365k\237\245'l\223\024\012`\345*\324?\310L\344!\270\340>\001 aL\220\001\221KD\235n9\333\362\227", 64 },
{ "-^[\305D\215\276\210\007\255\365\315\023\340\343\011\212_\340?\215(\221|", 24, "'(\221\177\261K\003\247;*\201=\251?\240\345\026U\225\252\355lg\342\310\021-\006\004\270-\256\340&\007e\304\042;]K\306b ;h\222d\353\277\030\332}\355\030\001\347o\375a:#\207\232", 600, "\213{K\321\232\301\253\312\037\324\340\2454\262\376J\335\210J\235\252\220\370-\004\042\134C\316\025\275Te\250\333\212\227\324\035\006\244c\273\004Mq2\276\373\005w'\212f\266u\010\320(\361\332\217W\000", 64 },
{ "E\223\025>\255\312\337\310X\234\377\032\243\275\366\347~QmZ\027\013\257l", 24, "\202\021:\372K\001\252\250\363`\260Lk\255\042^|m\312\370\200,Gv'\255\024\022<\357\346\002\016b\252\315,\303\374\247\326\324\352\254\322\250L\306;\315\311\374\264\042z\354\256\304\021BD\231%\236s\321n\236\251\022\006\262", 600, "T\024\252$\261\307\0362\033@Y92dA\366\341\204\33236\265\357\205\232\266\027oI\245J\272\233O\215\317\302\246\374Ko\204\270z\356\236\042\315\360\312l\231{\274\026\225\221\345\377\343MG\321\320", 64 },
{ "ew\357\210D\321\347\2421\315\323\264_\036\253\332^\253\325\271I\211\212\250", 24, "h5\202`\361F\354\312", 700, "o\325\241\254!\217\211\331~e\346{\211Z5\371+\353\334\134\034\207\213\243\270I\334\317S\312X\344\326y\217f\261\021\243\223\251\015h\022C\303\026\036\222E,\203\366G\362Sy`\3241\3205\262\265", 64 },
{ "\275\247\376Y\223o+\2440\255\024e\351\324_\203\206\326t\333\134\332J7", 24, "trXoC\241\333\350\3415x\210\356\307]\243", 700, "gyBJl\234\206\356:\023K\310gd\312\200\346\320\2479V\272\340\000\024J\316\362PI\271\263\202\022Yhs\302L1\234\037\267\200\312\3641\0171\265\217\215\205S6\243\222\300d5x9\306\275", 64 },
{ "\001\024\003\337\276\355UDd\202\271\302\262m\021\205b\021\234\3108\220\226\343", 24, "<\015&\212c@\264\015n4z\261\252>\355\025\231\363C\224\311n\313-", 700, "g\2301\253WQM\014\240kG#\037t\014gaF\007\234\317:\261|C=\344+\252)~*Pr_\037\376\013y,\377\376\344\2419\266J\227\260\2123\225s\344s\224(\204\024\344@\001c\255", 64 },
{ ">\030*\353\341\240\203\312r\031t\260\265\012\345\331\354\016\014}\306SI\351", 24, "Z\020\013K\254\006\0164\347J\264)O0^a\025T_(\243\025p\261\210j\203\260\233\026\263\360", 700, "\223\3078V\010{G\373\301\030Ea\340\335\315\251\237\257W&B@\022+yHu\2165Y\377p2\344\003\340\341\326f\134\262\267\253\037\300d\312\030t\030\324\211\032Y\255\257T\237K\332\220\310\307P", 64 },
{ "\374\310\024\302\321W\213\250C\252\275\336\024\341i''\022\373xg\007\247x", 24, "\3404>\007'\303\215\331\2719\357\362\010\2146Nf,\272\304Hd\226%\251\2659\252\336\224@\355\357W\024\322\265\341\355\226", 700, "\273\207\247\374n\350\247\030\2469m\313-'\204\200h\022\356\320\341\302\001%ON\343\244\316\227W\212\3252\317\234\366\275,\033\261}\325\350\341\207\203\306y\010\034{%z]r\350\206\201{\017\330|\031", 64 },
{ "\240+\274h}\2040K(f\267\320\015\265CC\337\226\200\335\032E2[", 24, "\240\266\274n\2077\260C\005\223\036\004\011]\322q^*3\276\235\226\320\027=\344$M^\227N\370\022\234\313\007Wk\366.\205\016\365\350\200\020\217E", 700, "\212\232\234:U\323\302L(\362\221\016[\270\266\001v3\253\225\340t{\016\226|EC2Jx\377\264hn6\331\266\014W\245\233\277m\020\353\245\023\221\016H\000|c\307\362P\027)5\323\0230\344", 64 },
{ "\030\307\267{\345\270MM\201\325\330:O\224f\313\005\311\325\310\210t<C", 24, "\240\201]i\274A\034i\352:}\134\024\367'\300T8\256\217\377cm\027H\3617\250\210\276\013\364\031E\240}\252\004\034\222[\330\373\013\021\003\025\036%\011@\362\030\232\342\250", 700, "\374:\213\373\257\356B\374\274\021+\352i\022I\206\346\205[A\376\275\322?\245\212s\030\262,\301\015*\370\350\326\024\227Bdv\362[\177!\016\261\276L\322\226\265\0337\016\207\325\321\260`J\277\363\270", 64 },
{ "\325\272g\264\270iVI\230\366IkD\347sy~\232\272\200\347\337\337u", 24, "\134\247r\3219\313\346\200\227]\377\235\304d\214\310u\317\014\243\261\345\267O\256\010\013D\035K\245\226\375\217\3611\001\013\307\220k:T\025\226\304*\225&\255e:\207\246\375\317\224\304\251\275Z\206;q", 700, "\262\323\010\0153-\007\321\273]\337\032\205\230;c\210\310\343\034D\214\003\234\003\355\274j6.\326s\037\315\216\237\000\371\350\213\347\365\351\340\010\356\260\366\201\227\340\3711\262\3773j\306\042]\273\211\332\032", 64 },
{ "\357\334>Ja\022\002\010\374\335S/\247\253\270\010-\205f\257?\330\234\032", 24, "\335I!\203\271D\364\336OF\220\225]! \362\013%Bsp\326\341\343\360K\267\267\367L\354\370@\371\035\227\225\360Z\205mx\276\371F\247P\344.\223\264\221x}\322\225!\346\350\256\2742\253\265C\367\377\022\036;\017P", 700, "(\036gv\030n\0139/\250P\272\313\230\351\226\211\363\237\312Y\037\272\311\265=\351\343\305\374_\246\235A\264YD\304\334\202K>\037\274\336)\301%\366\242\246D\324\134A\303\2414\276*\031Y\376\357", 64 },
{ "#\0427\244K\257\006l\005*\256m~8+\317\373\325x`\224.\320\221", 24, "\261f\203\226F\362\245\334", 800, "\267c\357A}cz\243\206\233+\230\256=\203\034H\007[\32169\375\366\322J=hG\336o60\336{\244\037\2775\326\243\213\320)\337\003\370\323Q\232\242A\306ZRT\016\242\242\350\372\015\220\260", 64 },
{ "\347\377\324\375\314\303n\375%,\010\336{\375\3320\227\344\2662\0024\325\365", 24, "\361\311\366\227\314\275\335}\213\1773o\371\231\357K", 800, "\273\267\010\210e`\307P\264k\012\345K\247\362\367\033\310=\000\225\035V\220\312\213X\314\341\273|9\325\275\304\241m\012EI\271\302\2747\331A~\177\032#\233\376\353]N\301\365^Mh\272.+\260", 64 },
{ "\357\2528\231\262a\032ZJm\3157\260\331<[\232\27441\372\310\267\036", 24, "l\001\255\324\355\0220\246E\206G-~-\333\004\331Y\026\363\303R\010\324", 800, "\246\354\213\206<\223h\204\367\333W\021!2G\376\014:\373\013\327m\225\227\336\250\342\221\310\321\363\253z\354\022uk\342\177\302\213F\3758\021\341mgESmN\257\356\014\276\344ju\372\332\361\014\011", 64 },
{ "u\267\0421[S\023km]\353\002\364\331~J\3503\376Ay\335L\012", 24, "\352\204\321\301fO\005\370g\003m\307\304\344\354:\030\244\216\215\026\331\262\2267\223\3655qX\252x", 800, "\011\254b\343o*\216\240Dp\215<U\244\235\272\372_\042k\233\034ia\244|=\215\206t\363\333|\276HB0\311\233\023\257@\004\2428\017\251\234\237J\003\207\333\335\263(\370\243Yo\206\244\031\235", 64 },
{ "\233\342\010\335\331\134\3669g\031\337\033K\261\267\0421\177\332&E\340.\337", 24, "i\367\302\236\300d\014\025ch\323\320\376\231\211w\223%a\372\365\257\237\337\243\277}]\322\177u\375A>\015A!.E0", 800, "\375\240\241\236\314\214\274}\266\250\225p\024zo\012\354\220\377#_\210\001\301\343KG2\362\312B\335\331\304L\224\205\267o\320E\305\233G\021\031\2726iE\267\257E\217\310\313\247\312\232\200p`\266\375", 64 },
{ "\255\032\237A_\223m\000!7E\226\354wSZ \375\207\316\2177d\031", 24, "\324\234\005\333;6(\316k9\134\271r_\035p%\350Rm6\2418\025\204vv\212b$\321\027\314\250_\3478\233y\303\301\370\016\200\301IZ\316", 800, "\316\312\267%f\212!y0\237 \243\207\371\274\321\134\274!\327\362\004\014\210D\250\232\307PbslaL:\252\262\201#\315<\220\232\275\273\246G\311\333/\032p;D\253\235\2401b\016\224\215\134\341", 64 },
{ "z\006\205PE\271u\361w$g\362u'\134\013\240U\303\0055\305!U", 24, "\0279\275\233\304 \031Fb\231\224\204\276\203\021\011kM@\341\223\236+ \262q\337\212\376\222\3471\243\3615\333\247\340`7\004\3137'\263\231\302\327\3253\353\326VP[\263", 800, "\011\253 \313\264\371\333\363\017o3(F\001\234\207\243\263\376G)Y>x\271\332`\270!\250I\375V\300$\000C\206}v\345{\247\257\314\276\017*\365%\332\374\242\242\343\271\243\210D\200{+\254;", 64 },
{ "\367\212\237\347\371`\021\024\317\363m\366\226P\240\271~\353l\015\204[\350\306", 24, "B\343\221\021\345\275\004\353ZB\274\223t7\313:\233\255\233\363\361\351\014\315\314\325\343^\370\301S\012\212\317>%\022\023\210\352<2(\224\311\312\027\232\327:\227\214\230\363\023\037\337.\024\010\372\317h\023", 800, "\327\304K\020\214\277B\366\002\330C:n\353t\334fXe\351P\033\032\311M+`\320/r\265!\301B\231\350`\001\013\311c?\220\333\326\202\216\243\365\245^\245j\377\372\210\307\272\303\342\216\370\210\355", 64 },
{ "\212\264Q\307\376[/\236\013n\346\243\030\322\026\321\205\216\324\214\360=\370}", 24, "\202e\341xV\033\272\236\340\342\216:\016\2516y2G\267D\211\375!\247I\342\021\277b\031P*\207\035P\205\244\235\311\310_2\346\023\354T\004\304\327.\332TR\312\346\034\212\302\251\134\005\310\016\004\200\257L|\205c\303\205", 800, "\220\242\272\200\024,\341E\312\361`\270\304\345\016\037\273\273\341\301\134\224\316\032\003\324$(\316\234o<\250\263?6\351\024\312\042d\373\366\320\036Pa\015'nX\213\033:\313N{i\134/s$=@", 64 },
{ "\274\322\370Z\025\306%\003\310\201(b\362P\000g\264\011\212\340{3\244\236", 24, "\256e\007,5\002=\262", 900, "\005\001w|\222\320\330\021\015P\305/k\244+(\002\366\277\207\243a\302\350\301\227;Mdc\250\024\370\006\311\007\226\302\037o\367Wg\377q?k\005\223u\021\036\375U\321@\363\232\317\363\225\177\3303", 64 },
{ "f\247\021,n\027\321:\311Y\243M\345.\204Qe\302\206\301(\205\031\235", 24, "\037^\213\344\352\177&\134\004\203\203{%&\027i", 900, "\253m\201\326M\344} \345K\2152,\245a\255\306'\265\353\216\011\217\004\207Y\271b\234\222\230m\016mu\340\231\035\235\215\3413:\004\332\015\310yR\260\023b\206\000\230\007\314\214\370 8\011\210\313", 64 },
{ "U\257m1\225~y\202\247\245\346\262\261&\252\253\261\375\022\303\247<j\344", 24, "\317nW\220k.\354<\216,\361BpOg\344,\361\243\364\006c\205\372", 900, "\304|\026z\316?\247\327\240\300,\306\315,q\333uV$\364\3113a\301\222\362\266E\345\303\3540Ck\254q/\204mB&\234\311\234\320m\353\261\225\355R\355\214\001\215\362$\346\336\304\214I\243u", 64 },
{ "r\322o\336\354\307\264\377Z\343\001b\007Z\274c\305\275\214\265<A\372\201", 24, "\264\025-\211\214\371.\260\356\334\002f\277\134\265jd\341d\277\234pN\210'\361\353\377\220\350R\200", 900, "gH\223-MD\365\211\322^\211.\251\200\346\004\336\252\221+\265\304\026v\234\026\305.\305\270:dU\365L-\276\042j\241\264BX\376\260\313\032\367\026\317\342$\244\210F\010\234\335\377\334\027b?\030", 64 },
{ "\357\253B\361\221\317\276\014\001\344\310\024\3269k\233\324\252.\351\374.3\372", 24, "r\252oh-\222)c\226\012\0159Em\303N\240\313\336\313P\267oWX\277\2155\032V\367\324[\006\320tl%\007\305", 900, "-\035\234&\233\305\302]h\300\343\351\370\274\217\2001\346\312\276r\300SL\025wJ\257\251x\205\311\367T\332\262\233\221\367\256\003\234\316`\273\226\262\312\205&'\2449\375\260\206\216\267zD\010b\024\266", 64 },
{ "\021teT\012\013\023\355\233\377\036\003t\344D\333\251\336\034\211\332\344\375q", 24, "\271\376\324\336\2374\201\300\303:c\0305\010W=\302\327e\375:\305}\244\275\210\317\246\255\005$\204\215Ft\225\031v\034\2326\273w\012)\317\302\253", 900, "\372yMd6\017\2368\014uJJ\271\0174\363\271\205V\274J\206\365\250\026#PB\214\201,\021d\0264\221k\030\255\222*\317\315\234\032\235`\274i\364\231A\017\042\013\325\375\220ySb\246_\023", 64 },
{ "\317`T\2038\305\247\261O\235n\021Nf\255\014b\237\316\226hK)8", 24, "\274\346,z\027d\020\274'z\350fUh\247\364\375\324\015v&\327\237A6<}b\337\033\375E\205<K\017\032\213\001\307\3357\312d\274\312k\245Ku\030\035U\267Zd", 900, "\327\352\362\257\276\005\015\355\134T\201C8&\030\220\213{e\014i2!s\207\346\327\316\262\352e>e\351\342\321\260\237\275L\220^)\3519\017\261\013\364\243\037\030\277\375MkIo\275y\004_j\241", 64 },
{ "\367B\325\214\226\364F9!\304<\320{\342kg\315I\315\023\316\372A\336", 24, "\240a\265\361\241\204\221O\347\345\026K2\336a\357\304\037F\311\341\276\216\343\360A\334\014E\317\265\203Ik\346]\317\031\272~\365\267ft\241\015\350GX\235\021\037;\024\033\354\2124J\337\377\304\203\250", 900, "\202\242\3013\2208U:\340\237\377\261,\312\016\251^\260\271l\324\213\034\311j4\011\236\254\360\251\341\347\310{H\017\320 }\232\274Jg{\217\324\257\363o\357\344\026\026G\277\310\004\242\235\263\357-\222", 64 },
{ "\016\270E&%\327f4\252\212>4r\344d\252\234\271'\254S\324\352\350", 24, "\375\306\361\014e1\036\264\033W\024j\367\214\265\027*\201\337\333\233\275y?\027\270~F\274\346dC\364w\211`L@\364PCo\257)#\346\343?)m(_k\252K\375\275\003\3456\376\2240\036\360\222\373C\265\217\322\251", 900, "\302\205\312\343Gl\252\336J7\013\234\355z\377E\3711U\311\204\213\332X07Z\222\333\017s\351k3\333\370\273\352\361nvB,w\315\202\214\327\367\351W\3560\350\377\016\2111\323\315Rd\360\241", 64 },
{ "X\241g:\042LD\026\033\305\2103\347%\313\222M%IxT\3311[", 24, "\354*\024\334zTk&", 1000, "TW\205I\026\261\327\304\271\241.\340\134\260\241U\257\312\000L\177\012\002\020c\266\333W\352q\331P\336\027\357\363j\356P\3036y\357\306.\361C\232\134\245[\366\203\213\307}r\255\350\324~\330J@", 64 },
{ "P\273\256\313\320\002{\007\246Q\235\261\314\225\325f+\265c\221f3\037|", 24, "\3772#\270\014I\036\251\274<S\330N\376\215m", 1000, "\347\3452\211_k\005\334\023\365\360}\245\213\242\367\300\315HLN\212R\230\037\224QL\241\220\374;\334\023\332\306\255\017^X\234\374ak\370 \247\001`\345o\255O\315\275\3052L\012P\340\307\014\305", 64 },
{ "J\242`\033\017\337\255\360\324\326\225\221}7\335\307\357\376\315\360\211\273\246d", 24, "\275j\034\275\221T\245\036+e*\225`\301\342\0125\2330\330V\212jt", 1000, "\016J&\254\205\215\330\2111\350\013\034\372c\273\363=|u\0377t\025S\025\0177\302\332\213m\326\0169d\263\271\037X\263\251\334\035V\2564`\260\033N\356\237\245\344\322\323-\022\356\203YB\337\314", 64 },
{ "\001Q]=\016v\371)=sJ\245\042\233\335\322c`\000\303i\265|i", 24, "\226*l\351\350\326\021\027\201\3548\223=\376\250|\226}\234\352\316\224\327R\324\027^\235)\232\230u", 1000, "\244\257\326\351lw\257J\300:\373\206\027G\326\217\014}mB\243\340\361T-\030p\236\034\367\265\350\234\326\270\300\265\274\211\213\215\303\365\341\257\227-\363]\245 \351\006\364\275\037>\343\270*\254r\244S", 64 },
{ "~\021+\245uZ\362\213\366\200\022\206\215\334\351NYt\355\377{\353m\027", 24, "\2447u\244\364\217\330\177\207zVy\210\026|h\302\255\343\012l\034W\235\214w\263\270\256\236\255\312\134j\272Z\350\134v\357", 1000, "\323\021P\223\322\235O\310\243\376\254\014W\021\250#\357\307'\305\362)z\177Y\177\354w\265\015qzf\333>\020G}\011\355\350O]\253<\221\251A\013\315:\023\201\267\010\210\372\277B6\241\244*\314", 64 },
{ "`\216\220\304\345\323\032\361\230\006\373k\0015w\247j2xL\303\242\021\301", 24, "\354\314=\001]\034\307\013\035\250P\231Pi&\031\205\203\027Y?\360\215nEQ\021\336\373\215\332O}h\264\207\253Ah\377\376a\264u\251\002z\252", 1000, "\321=R\262\037DS\377\205\222t\316\371\353\206\267\315\313\246\364\3673\010%\224\351\307z2\230\360\273\220\311aGp\2636\015l9\300\345\003\326r\356m\203Q\235\232O\227 \352\341\021{\267M;E", 64 },
{ "\354\004\006\232\301c\330+\321\346{\032\251+\226\274\273r\2126K\000\000\320", 24, "\244\371\011l\010r\042\231\366N\007\354\251\304\237\021\200\314\321d\330P\027Jgm\022NQ\015u\354\016\023s\363\0059\003x\243\366\361'\375s\330\266\310\334]\350\201\037\330\177", 1000, "\262\340\313\343-\0366\257\034\321\223hwX\317D\305h_\036\012\323\303\360(\016\014\351\244\256|;\031\316\355\317&\244\221\374Do\370\351\372\233\344\027\237x\225\212\032\026\321>\203\335{\263\343h\254\245", 64 },
{ "\306\321\026\304\337ii\326\313\346\326Vw\314&B=\233:\237?\221\201\353", 24, ")\344\304\012\2374O\241\033;\035\3024u\021\243\347\201\314\277u\304\210h\252\022\241\237y\031In&\3374\356\315b\214\004\277\370;\330~\237\335\262\275[\373\3121t\005',\211\201=I\321\216\334", 1000, "\376L\243\307O\223 ;d\203\232\017\217\324\246\260*=>\377\373z8\226\237\255\341\320\342Z\301\015m\363\005\201X\026\202\221\017\351\301\003M\366J\031\263\035\001{:\307R\026\356\367Ww\226\2106N", 64 },
{ "a\201~E\177k^\377\225\372\322\254\303%\007\300\327\315\250\025\257VA0", 24, "\270SB\012l\322\243\037q\035\317;\324\307\324\351\347\030]\245\265\366X\2650e\322e=P\205R4\344\245\227\221F\272\356\034&\323&\022m`z2\275\303\266:\207\212\213U:,\035\227I\275\347\257\023\211\206\211\324\377\364", 1000, "\224F\035\020\272\0235\366!5\234\200\355y^\042+\321\275nk\247\366\034#b\235o\214\277\020\375\344q\374\035\261\263\222\246TI\221 \240u\232[\214\346HB\221\322\003\377r\371wG\025\035y\345", 64 },
{ "(A\2328\302\034m\303m\265$2&\227\250\016Q\3779\275,\313\013h", 24, "\250\337%\227r\334&S", 2000, "\241}n\035\312\202l\273\322\352\272\252\212)\335\230\226\325\012\362eE\004\315\357\177\245'\022\0052\244\024\014\225\227\007\243As\277\251\351-\262\246u4\312Z\214\274\202O\376\324\262m\035\201\360*\343\006", 64 },
{ "\224\227\346\024\316\015\012\374\275#\026\307#\012\262Nr\313\353+ \216\372\032", 24, "t[\215\345V\325<\254\367\361\255\343\245\023\017C", 2000, "u-\242\357\275\260\2226\270\312\037\230\275\372rS\327\216l9\316Q\356\210\323\210E5@\217\347\036\032C\202)\033\230f<\227\023\256'o\233\247\006c\320j\244\341\020\134\177\313\177A\214\336\215\230\322", 64 },
{ "b\247o\224K\245\234t/\302\265\264>\310\225\024\015#\255\227>\225\022@", 24, "\211e\230C\273\3177\2211j\365\030\320\203H\255\017^\256\324S\212\266\372", 2000, "\302\004\0071\000\034\042\360R\205>\020.\016\334\042W\230c\250\222zs\337-\377\373r\333c\001\371\272z\363\0003'\362\202raS\244V\354\377\344\336$\201\336\322\372Uqy`>{B\021\234\030", 64 },
{ "\002,v\342\377\027yk\360b6]\032eS\242\353\011\353\204T\307\207\022", 24, "\236\177\303M\345\365\027T\017\323:\360\225z\271\361\220\265\017\300\273\030\223\2531U\316T\020)\225\375", 2000, "\340\214P\252yt\0126\301i\3054U\217\267\024\364\035\306\003\376!/\345\374?9\250\207,S\031K\276\223\257\364\346\367\241 &\256\271\314-:\272+n\367\023\272\311Y\346\004\225\315\016\236\205\306\350", 64 },
{ "\004\000\227\245\266\231UzT\033sW\240t\234\004\356\320xazQZ\033", 24, "\257\341\327r\023?z\022Y\205t\302{\252\341\027\341\333\260_d\030\206\354\367\026\302*M2\225\347\336N\253\251&Ad\276", 2000, "\353\364R\036\042\354w$=(^!\317\207\266\342\212\215\263\250+\307H#P\011\3448'\212'\030m\037V\021\212\375\3601\311B\233\361!9\036\2135\034\337\264T\331\346-k\222z6I;\303\360", 64 },
{ "\015\213l\014\376\305F\340\317\356[<8l\000\235L\361\327\3623\251,\032", 24, "\356~\011\332\242\011\203:\271\222\204xV\274#\0064\016\237\364[\377\231|j\031\336\272Q\007\331\371$\010\361\231\346\205\337\340U%\230\241\221\202f\267", 2000, "*\230O\020\204]\354H\245&VSOk\247\352Jd>\243\322\351(kX\302c\177UhS]\001hq\245K\320oB\201;\335 %\3164\256\024`\233\273\256\304\324\247\321\345|\023$?cJ", 64 },
{ "\203\371\026\261\020\021\004\370\246\244o\321\365\355j\004\200\367V\304>)\355\300", 24, "\260\347Jg9\373\303\270u\270\253\343C\300\336\010\307?\016bu\366<\334!\312\337v\240w\177[j\227\224AU'\037{\032\245\347n\343\011\370\342o)\214\354\265\236\234B", 2000, "G\345\0377\201\012\226\231\207F\224\006\035\236p9\303\365\3250\223\226>,\313\330d\317\237\312\3238BN.\257\0155h\377\034\236\331\223\037\307\3416\317]\203\302\252\356\234\230^\027\220\375|\0341\006", 64 },
{ "!\323\234\201\027.\265K1\243\334w\375W\367s\264\232]^\011\243'k", 24, "`C\241\225\020\3131\226V\311\257\355\361\313\326\304\003K\206\266\311L:\327'\370@\317U\300\027\207\012[\246h\247\004d Re\027\247\222\323\212\225\324\020v\252_\252\255\361\367\303\020(b\015\346\336", 2000, "\332\363\361a\364\375z\356\215\366N\256\330L\022H\2644\134I\362\373\310\212\213\262\326%\366\351`)\315\014\356a\266\037\352\262\236\365\326z)uU\374\364cq\307=\331\013\316\243\335\033{\273\244'c", 64 },
{ "\263\266<g\264\006\270t@\246\036\020\370ng\270q\2354\326<8g\322", 24, "\011\354\243T\342\245\336\376\205\342}\200\240\246\245\342jwQ\026\334fj\214\217 \343\324\233\036\0135\303\353O\337z\326y\300\354\273\016\364I\222\363B\321\023\234\200\221\032\010\255p\213\222r\241d\247\360=\032\252\031\276Q\344P", 2000, "\275q\253 \305[\023\277\357y\331)\360c\277\256q-\272_:\020\301\026H!V\247$\341\250\304#+\352Y\263\0176a<\276\202\271\010\235\322\317\001\003\007S\300\326\311\254\024\271jp!d\226V", 64 },
{ ";|\254\203Z\375\011\366\211:\027\033\373s\035\020\3351\034\214\036\240/\371", 24, "\352z.\3715\305\236\346", 3000, "\021\327 \326\306\266\022}\355\375\217\206\205\224\220&\035\301Yz<)5D\177\264&,/S\362\374\336ey\216{\320\241t\354p\207\025\360\301\355K\272\276\300\356\221\025jq\232\371\251\343k\253\215\307", 64 },
{ "\227\017>\230s\247\032\243\235\271\203y\245\243\012\276\015\230C\230\262\213T\346", 24, "4GO\256\202.5\272\256\313\017\307\220\252\234E", 3000, "\223\021;\244\350D\254W\275\346\222\261N:\235\364\316N`V\307\134\004\037\005m\332\222J\324H\020^\325=\233\356\350'!\035^\245\025\263\022.\272\004\254\342\243?\010\011k\224\331\331\2322\336R\242", 64 },
{ "\237V\216}VW3\357\037qC\305\317\207\302\220\351\331\037\375L:\022 ", 24, "\336\277\323o\333\220q\304\274\313h\237|a\327\323\230\261(\371~\020\327d", 3000, "\211\017E*\360`\315\036-Q\374A^B\343\020\200y\034\177U7\340\260\371?U\221\323}\321\212\261\255\3411L\246\315\334\004%K\01749\207\341\027\313X\230v\300\032=\304\340\307\240\005cu\036", 64 },
{ "\277^\326\265S(\042\033\000\346Y\234M\000\310\025\344\3171\343\230\017s:", 24, "j\301\025\325\364\345h6p,\377h\322\372[\215\262\261\235{\355\352ae3:\042\337o^\270\226", 3000, "\367\314\334~\313\305\216R\375\313\317( W\2524\237\367t\006V\356l\270\305\025b\351\372\016\205\274\032yn\321\366B,Z\300\245\310\364\202\374\336y\325\015\221\342\343\223\254)\340GH\354\021\235u\354", 64 },
{ "oP\0024\027P6\376C\272\232\025\207\225\3616\361\26629\313\004\375$", 24, "\031r\357\216B\274\223?U\2367\002<&\2615Lj\012\276\303\327~\373\314\373\3762\010N\177\231\324\036n\334`\317\013\200", 3000, "&\322\212\306\227\365|H\226f\313\2425.p\030V\261j\350|\352\205:|L\316[\023\305\222`W\264\246-\232DO*+\343:\241\251\320\233\354\377\203\246\235S\027\341\250\316\327C<\226~\346o", 64 },
{ "O7\204\017\015\252\361\327R\030\367$\314\307\217\207\252\323\333\270\213\207]0", 24, "'\234\271/\326l\237\264-\337%\332\012n\372\276H\262\134\263\336\213\337\021M\234\321Q\227\333r\266\304XS\343\211\256T\322\303\234\211\260\241[\037\271", 3000, "_\203,Z\033\317!\350W\356\335\2426T\015IE\012s\331~\301D\012\374\306\235V\321p\340$\353\263\331\237(76I+\000P\342/\001N\345\313\241\214\377\333\377\360Z9}\3544\236\201\370\351", 64 },
{ "\244\350\3759f9f\300\002\015\214P\344\022\200\351[\134RvR\363\225~", 24, "\204\253i\244\217\223s=\217_\313\242\024<\252\241\3530\215,\212^\335S\257j\331\003DNLn\2414\035\017,p{\364\360\342U\032\254\007\021\036\256\345t\253\316M\021\254", 3000, "F\264\340\263\355%\367\007CHC\304!5o\030K^=\305\204P\305gIJ\274\177s\232?\341\000\364\014>\214n\236\004\363\250\323\324\211g\025\371\004Y\357c\351\033(O%\312\267\214\313\001\003\274", 64 },
{ " \373\314\232\000\2625\230_\303\350zD\210\252*\034\305\005\017\355\356\227\270", 24, "R)\032\244p\363 !9\274-\205\343'\231)X\346\025E\323r\032\357\024\020Fr@\013K\221M\376a\336$\024q1\310zU\031\271\274\325(\352\265\017\042\210\016\276\271]\330\252#\244X\261O", 3000, "\241\362\014\177\002\312\211G\001\312\001z5_3\207\232\300\227\245\201J\255\376n/\177(\371x<\303f$\353\210\014\232\232[\244\277h\353\341\022\320\325\002TF\352\037\264Tf\2676\370\271\321\363!\307", 64 },
{ "\333\025O\227@h\274\2608\237\300\004\377\223\022\320\341\312e\202`xN\263", 24, "a\042V\324\255~rU\355\206\366\202\005\354\002}w\033\215\266\010` \215\226-@\231\246\376\340\010\023\015\216)z\221\365\327\372\262\203\035j=5\265\243\242E\035n\036\014\0177\367\205\237\363\031\346\264!K\357Y\350d\375\373", 3000, "\003\242\243\204\364\011Z\213&\276\020\270\364\204\275&v\013\015?/d\352XM\302\306\371\242l\360\033/\247=\277c\331:\021OUK\262^l\270]qh\242\257b\213TJ4L1\364\366\253\201r", 64 },
{ "(n\026\312\205\343\005\033\363+;\013\305ww\340`ET\312*\2063\371", 24, "\327\336n\263\257uk\336", 4000, "Fj?_\352\260\304u^\354\210\205e\025_K\026\277\346Vrq(\224n\204\371\024\221\021dc\360\030z\270eu*\203\365\336p\32321\305w\347\245\265\337\212}S\302\247LR\377{\002\203\235", 64 },
{ "\275\277G\270\316\265\317Y\033\321\261\3341^\036)\235\253\253\274\014\227\327\374", 24, ":\311\227\357\355\353V\261iP\265L\354xr\262", 4000, "\021\332D\300\265\336P\356\226\215\014[=\000\234\027\224eX\022\260P\220\207\315\274~\030(e'\314\134\256KX\015\022\361`\315N7\021$\005\213\027\327\230\300\212\246\267\010UF\322}\260\276\006[\273", 64 },
{ "e\3241\366\225:\037\220p\032\242\346\364\341\237s\332\235+\033<xe\027", 24, "\305\270~\333\313s9K\307i\247\303f\313\270\243[E\266\334\344\335;\007", 4000, "\240\277\036$\372\225\232Q\003\3203\373\367\343\370\025\225\305x\307d]\011\374\335aq\022\034\022C\355\011\340\341\366\301P\332\3016q\021\343\247F\245\321\273\224\327\323(\250@S\2052\255\2013$1\334", 64 },
{ "\306T\011\2261\274\303\245\340@\300\374>`\007\333\260$\241\007p\013j\007", 24, "q\326\233\230 \340\376\340\330\241\255\270}Qb\037\331L\363\243\021Fe\012\204\210\220 \246'e\323", 4000, "\233A\343!1\343\230\230\201Xu\272V\314L\330\204\217\301\265\376Ph\035s\321\253_\303\224\201\262M\350\365\375\302\325\217&D\234\314\320D\210S\370L\3674\217B\311\251\313\237\243\202)\030\022\307\336", 64 },
{ "\266\015\355@-\222\245\034\2232\353\327a\326[\223H>\212BBP\212\221", 24, "\207Q\350>\367*\313\020LH\353Ap\025/e\240\033\230\221=\367\325\243\326Bp\037KHzi\302\017\247\254\306\375@\346", 4000, "Ii\225\355?a\327\357\035d\007@`A\307M\214\027\304\205\376\343\2641.\325^\336\030g\275u\351\333_\205@Q2v\255\263\353O\243\006Q\243\303\031\252\252\036_\020\3739\202\307\177C\314{\271", 64 },
{ "\362\272&\200\012\014\365\001\341\023T\232,j\201\202\324\0042\256h\377L\250", 24, "=\013\254\322\351\270\307\341\322\310Y\262\211%\357\356\273\233\346'\265\277\350\313\342\263\244\017\361\005?\033\352\374+\305\244e\270\232$bB\375/k\355\316", 4000, "\222a\254\336Z1\3035)c\302\226\031v\216\345qr\234\247\211\134\004O\010\033\205\221YR\313\365\034`\244\276m8\204\255\217}\333\013p\017\307,\245\270\344~\037.\027@\243\3008\226\346\364\004^", 64 },
{ "g\027\243\247\030\210\246\017\355\022\306\212\347\226pup\007v\374H\261\006b", 24, "s\006v\241m\353\271\320{X]\346V\027\345\331\360\017\302\210\010\213\243\134\361`\235\306\265\036U\025\264\373T\373\324n\033\226\037\252\031\340s_xtA\310\335a|A\252\274", 4000, "l\247\361\333NE h\255\336\021\374\356\327}\347\314\347lZ\336\335\377\341\354\342\206\317\310\036\302G\2039-\374\005\027\204\313\304\340\334\032\032z{S\273\330\1772Q\220a\201\260\264\312\222\003\317\034U", 64 },
{ ":\243\340\307\302'<pH\011\377\3357RG8e`\273\361 \0344\310", 24, ")N\346\003\210\316\011a\015\241Q\361\013\214\202\346\362\033gK\224600\360\336C\213\351u\024\343\306\001\312\037D\250PH\211\374Zg\361\377\232eT\300\323O*&A\236\316L\356\261\2314\320.", 4000, "\271D\336\350\333\027\332\363.\371\351\321q&T\032W\225c\031\203\373\361\340\372\216Y\245\027y\362[\257l\233\212\211\243\370\012\013_3Ww\236\221q\201\370\330\224\310\313:\214\345\263\033d\224i\205\233", 64 },
{ "\214\037\033\217\010-\262\005S\033\374\344\304\226\266\221]jN\317R8#a", 24, "\377\260D \264\301\200\271\361\026\227B(\210\336\004\315\343\3651\306u\357\271\271b\251;Jm\261\234\327\273\344+\003\261hF\321eP'9\363C\021\305\203\004\200Dj\313\205\005`$&'\134\276\037\367\033\205\006\330\365\207!", 4000, "\340\310\353\232\220:\034\301\332\357\226\332\377\365\306\025\2256\325\357\017/(\134\351CE\241\032\261\207\265POQ\303S\323\274\013CM\257\256\364\327\2351S\022\211C\211\225E\233\177yl\027\232\274%8", 64 },
{ "\205\247]\253`\230\036\334\353\377\005\303\314\331\376\030\322\340g-\004\235\027\032", 24, "#\002\015\020uG\356\206", 5000, "\3705\320lm?\250B\023\0274\267\022x\005\220:=\333\234M.l\347\263\323o\251NI\330\260\325\377\031\004\327\251\354\300\301\246\037C\241_A\274@\3306\365\274\207K\234/L\305\276hB(\177", 64 },
{ "!B=J\001\350-\300:\2314\241\256(;\273\271\330\305\267.C\351H", 24, "t\0022\334\212\342\356\356\033\254\256Cd\303\212C", 5000, "DB\037\011\037}\330b\230\342\2150\224\211\244\220\231\2744L\042d\342\042V\024+\004\224\330GCZ\312\340i\004&5\204\017\320$\013\015\262\226\035\300\222\215\201\345q\022B\0132\206CI*:\310", 64 },
{ "5C\225w7\027IS\023\304\217n6\032\320,\217\235\300*\351\277@\272", 24, "\234\247\326I\214\006\274\036]u=u\255>\256\134\326\301W\356]\307\3327", 5000, "\205\254\255LW\275\210\264\205a\214\001\323\312\254\251\233%O\222!0\037\177\274:\212\357\354`\005\335W\254\265[\275>S\243s\225\032\341\313\214\321D\177*\246\001\366\005S\234\230\010\300\301\024\337\3777", 64 },
{ "i\347u\243(?];\2174p\027|w\252\232\374\252\031\360\013<\244\313", 24, "U\204\031A\265u\316;\325\340\215C\340\026\245\366\027V#\3607\320\223\315\352\364\316\240\020\276\034\342", 5000, "p\216\236P/^Q\034\303A/:C\012-V\363\242J\370\310\265\333b4\2267\177!pX:e\306\242(c\325\033\306\315\312B{\311\026\250k\026\257\207\217E\306\013\246>:@%\203\272\001A", 64 },
{ "#E2\2447&#\202\264\042-e\346\315\327\212S`\354\357T\373\374\356", 24, "}+\227\036\352<\035B\325jB\225\343w\237\034\206\255\235\260\233\336\204Sx\216\317\202\001\261\242wb\035\352\304\235D\221\267", 5000, "\242\246\366\007v\255\267\332>O\332\005\024)K>f\350\031\325)\224\236\277/j9\373w\375\224\207\327B\321\354\265!f\373\013\375\024o\3768\345c\351\202\305~\366\221\301\237\3504}\215\313\306aK", 64 },
{ "n\342f\266\256\206\242}}3\011Iw\350\264de\356\210\365.A\357I", 24, "\313\366\372-\305\017\251\134\366\265\2732\304\203\300\275\224\300\314ZKR\016\260\363\273\014\255\344\304kW\217\275\021\357\334*\342\022\243\312\303\265\016OM1", 5000, "9H\012\364@\023gk\224\324\007\340\017\215U\013\247(\006\007\305\335\006xAp\372\343\267\322\355\250\344#385;D\342\310Q\030\214\271b\275\265S\246A\020\247\030%\233,$C\267\334\036I\020", 64 },
{ "p\224\002t\321\207- x\331MZn\352\042*\220Cv\230\303\244u\233", 24, "DE.\236\2209#`\026\303\274.\352\300\310\230\216\032\216\214\307\254\024\253\317U\033b\327\3532\033\231\370\344<\376\013-\330\0032\260\264L\012\305\020\254\356N\375c\333\010\236", 5000, "\324\235\2268\20247\200[\222\042\315\006\244\002\207\367h\31422p\371\205\206Y\202\331\307V\227\210\024@\002q\226\225\345\305`iwI\274\334\373\310\345\330\271\226N\331\242\371g{\231\266\035F\330\263", 64 },
{ "I\2423\320\015(\222H\242\017\252\211\353\375Ja8\033\340\3765\314\322u", 24, "\346M\375k'| \307\351{\221\376\304T\026\0058)!\025\306\022\271\227\032G\254\200+\201\033\021e\032\334\002\301\317\201V\3658$\042\266\362\216i\217\266\021Y\312\017r-\354j9R\022\037\321)", 5000, "\224I\371i\265\005\262\257\262\253\373zV\250\240<\311\201\257\362\222UH\340\367\200Q\212\017\335\251J\020\002\341PB\202\030\022\017\277\032fT\256\013\266\355\227=\224!D\371\225\240J\215w\002\255>\300", 64 },
{ "\205\027X\235\021\3344\2458U\361\222k\375\353\370\226z\3140\321v\353\026", 24, "\254\365t\304\343\317\275\254\0273g\241\003\320C\326\264\034Ep\360\267\273\2332\210B'\222\210\303W\202\021\364\246\302\320\236\256#\3074\324\313\216V\231\242c*\003\2345l\0365\353n\347\276c^\366>\257\215\227\215-R\207", 5000, "\337F\336\013{\253\267\314\001wC\321\201G\344<AZ0\204\371I?\376\376\035\255\362\306q\315_\0041\274\271j\037\2603\021\213\313\242S`\334\262!\217\264\220\344\006\366\251\233x\375\134y\177\215\362", 64 },
{ "O\311\352s\262i8`u\374q\212\026Y0\262\361\211\344\3648\343/\342", 24, "\367\033\267\204E\231y\270", 6000, "\357\355\000\253&\257a\257W\134.o' j\236#+\326\003i\207\205O\0016\274\364\305p\006^WG\351\214\233\255\240x\2511\303!\370\203\253\030\312ZC\275~\373\220\024\010\345yio\032\310\344", 64 },
{ "|\242P\225\031<B\246\003\270\007f\361n\364$*e!s\305\233\266\274", 24, ";\276\370\217l\336{\273j\331F8\037\205\223\335", 6000, "8\304\347\235\034\311'\334N|*Z\200\347L~\257\251w\321\363b\362,-\370\273l\0065\004\332 p\301\224\212\274'\275\3045\224m\036\214\004z\001\260 1\236\344R7\0216\377\300\243\311\311\030", 64 },
{ "\024\334SfoW\372\005\016{e\017\307?\320\351\275\340!\007_\264\250\016", 24, "|N\264\010\2442\254\356\210\226\375 )\021\0102\202\343\244]\375\256c\324", 6000, "8j\333\364\246d\320\244\264T\374L\352\204\014\037\217\025\006\032\333pX\220B@\333\317\332d\333\354\304\352\037\236\253\306\250\201\340@X\215\316=\335-\2502\315o\255\016\372,Z\301a\232T\230\251\226", 64 },
{ "\236\357$\340/T3\376\3370E\134\303\265+\232\244\230I\301\315\271\265\232", 24, "\244\027:r\356 `u\207\211\305W\261\336\350\005\201\035\2720\335\306g\305\222\177\302\361\036i4\367", 6000, "I\316\212\361~\310+\254H[\262\016{?\321\353\374\334\327\324\347\250\266\373s\022\315\236\371\232\276\027\217\337+@\245\210\220\271\260b\270\312\265\207\272\004\345\324\206\246\254\024\351Q\367!V\311\355HB\037", 64 },
{ "\031t\203\3355\251\001F|'\261\335\224a\244\324<\206L\315\206Oh\306", 24, "\243\341z\234\361'\337~\204\247\376!\261\036K\254N\027\360\024,\264_l\216`\360T\223\251\327\323f\016\267\304P@j`", 6000, "`-?\220!\256\364\036\215\002\014g\201\261\237\252\354\313\266\330\033\004f\016\335\020O}!c\357\314\326\326\271=\375\331B4\200\311|\213\247\036hH\254i,\3004\020\210\332\204\210\014{\2136q-", 64 },
{ "-\002U\017^\036K\372\367h#\0059^\2679\261\232\243\360\343EKL", 24, "\177\330B\025(\220\227b\320\243\213\042\255\327-c&\231\204\205\255@\300F\042^\362\020\277\2773\231b2W\256\274\032\134\265\217\305\367\022\276\342e>", 6000, "\226\341q(.\361\024R\272\037\201Z\202\300\271\002\216AM[g\263=\0039\034m\250pb\235_\205\3468A\007\213\276\366oK\273]\277k\010\011#\255\264V.)m\032_|\372x\230mnv", 64 },
{ ";\346\354\013\230\227\031F\357Nz\350\262\002\025\305\013\337\377\332\350\256\014\030", 24, "\222G\375\327\177$\353\274\353\357@\007\026\356\266\303\240\370\271\241h\241\003f\233\0061=U\264\177\320\311\312\334\036\031\025\275'\324\341QQ`\277A\347J|\012\3315\243\230\217", 6000, "\332\363q\304\333D\240\347\241\032i\333P\231b\271\344\317\024\355\314\301\267\316\021\237\321<l\361h?\345r\000t\324\030\231\217\305\334\235\012\343\236\261\211\2728\352Mi\002\226\270\205\2675\177\363\321\011\250", 64 },
{ "\373\253'*\353\374\273\310L\000\244J\362\244\36404\023M\361e\212\001\353", 24, "\217\252\271@\215R\277\205\340\235\300GJ\340\033)\320Q\322A\276\330\017\334\233\363\240\322\014\027\210g.\003\3302\027R\361\305X\256^\321\325\304\005\231^\332\034\226R\377uu%\3745\346\352\023\244-", 6000, "\023%\374\376\017\226\316]4N#\370\230N\001\356 \212F\312cRw<*\376@W\271W\332\254`\324\317K15*\223\272\316T\006Y==5v\352\033\334\302\204c9h+\357\337\360\217\034c", 64 },
{ "\235D\371t\022@\313\322\301\303\367\177\362\355\210\035\017\347T\253\376\354\214x", 24, "\016\352\350&o\250\006D\321H\272\361,\312\375\263\0228+oE\015\216\337\306o\363\261x\3618\255\005\273\226\350\265NE\234\302\375\334k\333\331\251\204\204\222\003\234\342\313Wj#\226)+W1S\207\273i\246yA8X;", 6000, " \230\212\310\275x\361\313\246\032\207\364}s\2368r\301~\257^\313Y\0215(#?\271X\335\245y*\377\353\330\202^k\376Lad\311\000\350q\222\241\205\004\277%\306wS\311\3762+\326\227\334", 64 },
{ "?;\330*\023p\010B\134\023?2\350\023\004\355._r\215\354l\353D", 24, "\363\377\344\232\235\373\265\341", 7000, "\355\245w\013\015vz\277p\223j\225`<\037U\264\3475\257\304\246D\245#y\355\232\012\302\037)\332\315\221z\003Y\242\362\017*\365\031\261\014\267\012\341\203\354L\260\316\343\213N\362\233\000\272F\344\306", 64 },
{ "k9\317\360E3\264\030\032\316\253Oq\247\232\220\010\376\354\244\243,m\012", 24, "\266t\031\337)\034\306\036\212\036M,i\002\355C", 7000, ",\236\266v\336\331o\322\226~\253>`\013\215\202l\365\330\311g\235\247\232\361\336\257\206,\321\317\330\006\253\233\302$T\357\324\035\241\0316\030\036(\204\251\331\376M^\2559.\225@\0110[j\201\350", 64 },
{ "7Y\231\310\325x\221\333\3057~t\254\265\325\335\247\326\227\363:\134\355\201", 24, "\340\341y\031.\267\217\264\012\020M\250\347\274l\311_\255\361o\232\260I\342", 7000, "\202\267\254}\0042\357\253\273\261\022\024H\020\203\013\032to}\347m\337\376\371$\250\255\321r\016\006\274\367\311\323\243^wsG\237Vw\004p]\325\261\365\027\356b\230\205\322L]\021\203\371\2709d", 64 },
{ "\177\335\200\3270AM\247Y\322\010*\234\035A\261C\366n\036>r`l", 24, "\214\014\337\257?\303=\024\240\307\343\00255#\326\0235\267\327K>\354\375\211\321b\021[i6>", 7000, "K\000\352K\222\245\260\275\361\361o\365\326\364\036\2770\207\331 \312LL\350c\006\226\247\014\217\217\261/;AP2N\327\343\013\246d@f\250-\364\304\013\002\314T\032\025\247\017\217c\366\003\305\037\362", 64 },
{ "\200s3/\021\217F\036\305x\321\206\215\004mk\314<\000\300\226(*\244", 24, "\247\250\3112z~\236L\327\215\003\367\022\244\217\201\373f\010$HE\221\026%w\326>\033\017\226\020\207G\367\352iL\322/", 7000, "\311\374\230\374<ac\322]\333S\011$`\320V\351\034\012\225t\241\301\361\0110\272\2529|\357\205\264\235\326\322WTM\223\374\240/\007\230\007\334\252?H\306`\006\345k\267\333\275\252y\314\263Gf", 64 },
{ "m\252\243^\355E4f\270w>$\026\042\360\254\307\307\252\207ZP\232\364", 24, "\207tG[%\035\246\377\337\325\331N\022~\365\236/\304\201\374\021@U\372] \226\375\037E8\007\254\354\370}5vZ\031\206`\366!\322\366\342^", 7000, "\245\210\355\305?\007\012\026-\377\272\025\2700\270\375T\332iM?\216$tT\216.}\356\005ExPe\005\262?\223\226,O'\365\000k\246E\202\021\213\324\035qRg'c\024'\200X\026\240o", 64 },
{ "\021\300\216*\364\017\360\1340\321\362\221`G\234W\363\333h\324\216b\217\307", 24, "+E\251\013\223\005\246S3R\255\016G`\212\214\246\352\012t\353\324\237\230\242\241c\227\021\374\316#\260\351\317\0252\243\007\002\346\026\237\023\216\3117\344S}.9\274\203h\371", 7000, "\362\315\306z\261\307\255\373<zn\003\252\001\014\310$\213\365\351\007\006\364\307F\303\036\336\323\366\236Z?3\3569=\202\134\215\205{\355\366~p4\011\326@\215u\265\337L\300\011\317\300t\243%\012\336", 64 },
{ "]-\377\321\373\264'r\036\250\350R\036{\374\332\015\267J<\257\243\237\362", 24, "`\366\021\261\372\032\353:\005w\271A\215@\323u\353\342v\022\254 Z\0015\265b\314~\245\374^\036\230m\255\274]\356 \325t\002\246g\376>\276u6\243\021\347\234C\370\206\306Bv\257\211\347\242", 7000, "\033\256\213\370\341\215jM\215\216\262\324d\007\316\365\227\371\2034\134\272\012\206h8\212\253Z\027\314\305\017z\371\010\216s\343\313\277{A\262>\312k\376`*d\300\360\2516\241:%aj\215\242\275\375", 64 },
{ "2\214\342\377V\332?\2433\233\177\347:\352\242\364\337\340\331X\237\257}6", 24, "\320\326\244\261\006:\026\037p\252$B\205\265\036`\362\327%w\241\271\317\367\004\026\215\364\260\023F\3245\220\276\367\347\260G&g$,\2219\015\177a\224\211\313\016\346\027+ \011\354\017`\026#>a\327\022\372\177|_\023\231", 7000, "\332\3414\351\013\042V\243\371\033\321o\023\023m7T^\220X\343\300H\010\306a\307+9\326\315\323\226\032\205\030\024b\371\365j\220n\014\312\024\003p\345X\017\341=\321\304\205\340Q\300\362`\307\314\365", 64 },
{ "55v.A\333M\011\253\244\245\331H\317t\353\235\243\306\200\307\241\330d", 24, "\301\032\244\327Z\351#\344", 8000, ">\334a\343\370\316\221c\363\253\306\042\325\007\310UU\351g\340|&\203l\034Q*\36754\206\134\264<\341q\342\332bg\014\000\301}yR:pI\342\301\343\250x\232p.\373\211\033o\016\015\300", 64 },
{ "u\034\247\2249\312\031?K\134\367\227\373\015w\005\303v\375\311\227Y\264P", 24, "\347\374w\031d0O\321\342+\036q\026\015+L", 8000, "\000\307\323\245\336\306|\361i\245\221\003\013Mn\233\211\227\230=\272\211Ybv.\007\256\244u\364\350\201k\274RA\022\327\212\325\234Or\0137gx\340$\365`\355\255\3310r\205CF\246\3554\003", 64 },
{ ">\372\324z\264\3456\210u\275\205\315\302%$\323\023\204.\245\305O\266\215", 24, "\210\036\242\335\310\002\367\363\365\034\003\030\207\017\007\022m\0369Z\322\032\272\213", 8000, "wO\311(\236\027@\354\006YJ\353\207~\360\237`Y\316\242\247\307uz)\307\023\267\262\340\007\307u\2256\0220\347\1774\274\042\271M\335\026D\342`\356\004\255\2702\21587\0270\346\310\231\303\215", 64 },
{ "\205\015pw\204\330\315l\327UI\003\134\005\033j!\202\007M9\030\017\257", 24, "\243\006_`Ge\333\270\232\361\256\305\266\204\351\231\232\310k\230}\035\225oh,F \177\213\3508", 8000, "|\206d\356K\204\337\023\357\324\325\377U\314\343\001\177Q{m\277Y\3232\347Z\264\343\032b\367\337\204\347\237\340\220\000\005\240\015\256\207\240\266\020{#p\216Kd\031\245\266\237\366\327\003\352\20096\270", 64 },
{ "\234\317\267X\261\316p\305\317\270\037\223\364s`)\266\360\255\372Cx\034\344", 24, "\037*ZQG\262z\310\302\331\247\036\355\331S\227\271\245\240=K\342\360}\015o\376\275\353\370v\326\011\352\366\011\035\346t\315", 8000, "X\246h\312\331\270l\217;7\371z\357\213}\021\200`\035\335\277S\211#\024\257\253\367\270$\306\334\346\236e\030r\031\356Z\314\340_\237\242\025\134\314z\360\216\020\337\205\272z\314\036L\216Y\217G>", 64 },
{ "\216\336\334\260\010\376\034\330\025Ilx\217\376+\341?A\303\320\212)\242[", 24, "\002\257\245\0163\344\244v\375\344\023\272\244;\353\242\371|\010H\337(\200ut\252\252W\260\256\355\251\244|\013H\257\350P\003\210\330Ji\026\361\230\313", 8000, "H\320\325\372\034/\365\265\000Z\356\250\353{\205\202\247\006\313|I\032\013+F\373\270\134S\015\036\3443\240\376\334\3018\3343h^\344\200\243\312Nk\264,\302K\365\267\315\346y\030!\020\313\373\241\272", 64 },
{ "\364[\025a\015\244\351\226\361\277\362RnY\016Vg\011\004\032\0243V\334", 24, "\303\035t\266\010\251('\331\304\035\276E2\030\216\305\330\026\3153\271\227szf\361\307Jg\217\003\200.\031\034ga{\247\042\021VG\262\216\264t\015\006\014\232\236\300\335\360", 8000, "\373Ng\266cw\232\023\340\345\134(\241\223\330\251P*.\251p\023I\216\222\016s\274\2610\2719-QX\017s'\364\367\203[z;\321\275\367N]\016\205\216\032\246\351\013\014\230u:a!\340\344", 64 },
{ "\036-\324\033\321\251\200\377\035C\2173\352\252);\211\025\316\215\375\214w\215", 24, "\300\007\353\005\230\026\313\261\017\376~\245\312\375R\275\336UpX\223\261R\321\012\257\305\361\354\305y\016[P\026\302\367\203\210\222\320\267\341A\374\323Lk\237\360\277\303\226v\214\362\372\303\363\2325\032Y\216", 8000, "G\277\034+\204mQ\037Jh\3735M\226yb\271T\333\216\320\233+\3414.\010\243\335\030vR\223r*\272O\263\222\310\204\366\266)\037\012o\344\333#\027\260\037\300F\010f\336\236\236\367\203\213\222", 64 },
{ "\266c\307\213\340;\202\254\364tO\370\023\221\332\006w3Q\352d\224\000a", 24, "p\035\261\247\274*,[\341\236\263\237,\272\361\301\232\301w\203\023\024}\265]\313E\203g\364\247o\005\134Az_\007G\007\010\220;\326RR\216\262\025\200\255\262>\330\321\276\316\331\356\310\334(\241e\345D\263\330Gx\324\325", 8000, "\253h\230\377\267\373 \214\322-\273\273~\336\356\177\024\205\277\240\277[\227\023\332\316\315\374\000\272\351\357Z\011\021\300\377\371\376o\223\336\235\312\021U\330\257mz\250N\206\210jB\134m%\276/o\357\354", 64 },
{ "\245\221f\320]\012k\303\031\336Wr\336'kl%\250\3559=\266P\274", 24, "\243 \351Hp\230\003\351", 9000, "Z0\012\276\353\351\232\246\223\035\333\243S\367\365\272\376;\035\314\004HG\030\213\275yU\355\005'\341\134\002O\014\310\134\21217\020\011\317\311\032\031\317\355/=h\201N\305\243\232\300\354\342\005\206\216\200", 64 },
{ "K\213x;{\306\322N-=\201\352v\366\255\013\005\012\221\2142\336\014\300", 24, "\200>\242~\026\241\226\204\221\351\213\303\223\237*\345", 9000, "\273\325T\251\032q\370\2077\310\220FF9e\204\342\226\374\247BP\370_\273\024%\314r/Y\270\231\343\323\353A{r\334\013$\315\224-\226\272\276\244x\337\220d*H\021G\307\271\347\251\304\360a", 64 },
{ "X8\022-Z\303\263\357\3236\371-\322\352\212}\226xVF\200KH\271", 24, "\352\321\241\333\217\016\012\344\245\240\216\017-\367\340\324\260i/\320\377{$Z", 9000, "\363\313A;\203\243u\267\276\002\327\036\2234\323\217o(k\372\333\023\240\221\300\254\2677\234\2040\300\350uv\327\371\262\215\272x'\213\274\010\021\034|\352\3338\353\273\027\272\265\376n\134\210r\300\006\247", 64 },
{ "\335y\005\355Q\326\204\360\222$g\356s\374o\200W\011\220\001\247\025'u", 24, "\035*\242\310`G,\244Q\372\256\301\305p\034\271)t4bW\2076\225\177y\335\322\317\245\256&", 9000, "f\326\017\227\016\302R\363\324\314\010\271\320U\341Y\222\370\265\277z\370\313\303TA\334b\371\226\254\264pq\336^D\330\134Q/n\324\320,`ay8\203-\035\223\351\301%3\032\355\217<\233\256\236", 64 },
{ " \250t\357\202 ;\3730`p\201\373k+r]\354;\370\244\030p?", 24, "\363\217\315\313~\351\231+$\215\216\362W\26569\223\027\300<\252\336=?\320\015t\333\004\265\316$'Z\010\337\032\300\356o", 9000, "\013\263\374\335\225\200S$\237\251\312#@\227@iE\373\364tpE_\342\203\204\364q\350\333\215\237\345\262n\217X\023\020`\257\327\257\236a\273\007\271\020\213`9\363:\011\240\014\257u\013B\302\365Z", 64 },
{ "\037\211\342J\233OL\256\313,\272\317E\355__\006\211\354\343)a\326\366", 24, "\3069v\303-\210\007`\270\242\024-\010\203d\242\210\250\347g\031\343\265}\035\317WY\2600n\342\263\317\300\010\007A\023\313\311\320\361Y\266\206\326\256", 9000, "\037\232\322\324l|\277\265I9\377\203-F\026`\202\206;f\256-6\312\374b\0152\016@p\017\374*\250\213\255i|\274.\326\364y\336}@\252\012\377D\202:LL\274'\010\222\304\265\360\324V", 64 },
{ ";I\027SS_\355\250\257M\025\034\252\332C*}=A{S\012\267\020", 24, "h\324z\036\2161^\373N\027iO\210.\344\361\370\213\300\274\204!q6\277rja\216tk\243\371#\353\201\272t\312j\206+L\005*fh\033?B\323K\213\300u\310", 9000, "\323\004\241\010\242'?&\207\347n\2659\262c\327\356\373Af{\363k\244u\315\271\257\215\002&#\350\244\253\345\004\362\245\341!\370\367\235L\324t\325V\232i\261\177\3241\010~\310\347z:\263\177\211", 64 },
{ "\331\363[@JRZ\206\223\334\330\027\234\035\3774\273l\316\322]\310\212`", 24, "\250\0109m\246\376;\177\2612T<\274\327\2363\344\324U\343\343\340\206%;\347()\364\322}?\376\214?\246\361\005#\273\020r\200\260\3608\335\217\017\202\212F7\202\325\353\323\367\305\034M\033\303{", 9000, "\205\373\010\365Z\241;\3701a\253D\025\351\374\254eX\244\037?u\372f\346\231g-t\274\325h\030\365X\363\322N\011@\270#\027\212\271\307\221\302\275(\033{\221\270^\264ku\017H\367H\201\002", 64 },
{ ".\354\201\342\256\244\227\276\215j(\026Va\3359\206l\377\020\253\376vu", 24, "\014\346\240i\217\206\263\300Aq\336\242;,,\240\035-\253\3070\367B\352\325\042\366\351\013\200\134\372\245\227u\233B\212\016\244.\021\362!\214\221\016%\224A\231\004f/\346\343|\007\3014K\334\015\2660\302\332\243\330\331\277\225", 9000, "?\341\377#\006\027\300O\217\020\267]\3708K\301b\177Flug\301\212T{\304\255>\260\357\266\2368\336^\134\326\335\0268\357\214\230R&&\372\223\315\212\374\341\320\234\224\203\017\310f\254\017\365\371", 64 },
{ "\035Uw\245\207fy\341\213Cf\313\250\356\333#\365\330\025\214V\365V\315C\301\312A;\265\324\333", 32, "\237\306\371M\211\275\020}", 100, "\277\325\220\301\016\372\256@NS\004\207\201\3778`\215_\211w%.\337\374\353\367\220Z\272\373\326]\275\224,^\036\311a\206\211\260\005\317U\0154\001\237\273\305\316\033uu\251Q\213z\351x\036\243\265", 64 },
{ "I\333\366\014@\0225Jgoz\373\270\002\020\037(\012\177V$\232\250(\264;\320\371!\324p\235", 32, "p\340\214\234\324\205\224\324\020h\221\357Ej\330J", 100, "\317]\000c\226\304\271\261\023h\365\3636ZV\016\353\356\222y4 \340\013\223\223\301\356<\004\234+\300\201V\230\370\375z(\177m\364\306\351\231s\254\360\227T\351ebLA\316\207\011\273\353n\323c", 64 },
{ "\342\206\301N\363g\353|\226Wd\356\240\3630,z\343\225\024\031\252a\275Jg\337\361\000\224_\273", 32, "F\342{{\365w\331/Pi,}$\303\260\344\265,\032\134r\362s?", 100, "A_o\223\300\360\016\264Z\223&\300D\2500\310\316U\347\004/\226\364\336\353\034\217\011](\237r\356hd\245\205k\037\252\042/n\241'eZ\316\310K\233\017{\247\234\303/\205,J\373l\362.", 64 },
{ "k\007z\262\2607\030\372\326\240\273\317\332\2406\031\203\014\211KOT\330H\001\356@\360:6\310\336", 32, "\301\261#\301\224\212~\323\326\237\037\202\036N\342\034\323\034\332\245s\002&n\035\265)kU\314+\244", 100, ":\276\200\342\261\1345\243N\265\304\334\375\364\323\371\304\213KB\336\372i$5\205\344\313\012.X\273\021\306n\222\025\224\207\321\365\265\333\304\363\225C\256Yf$\235\340d\026\027\207\216\267\006\361\030\353@", 64 },
{ "\212nj\377V\332\013\370O\246\366+\370\264\321V\252\246\341\232\000\250t\341\241y\217\2764\213\234\203", 32, "\210\370\011\356\265\343X\235\3101\255m],h\253[\347{\134B\360x\215\222\324\275=\212}\363\247\326\004m\034\003C\241t", 100, "pc\205\224\356\344\247b\310\251\222\224\357\315\277]\000\272/\303T'\371\336\221u\370\355*\264\226~L\357\004\237\345\215\236\224\310n\032n\345\357\347\204\231\2543\020\234\032\042'\014\361,o\134\305\2233", 64 },
{ "\227\222\262P\202\346\315\316\216#\250\032\346\007U\375-\317j\020<\220F\344\215X\234\004\374uM#", 32, "\215\215\254\311\351\001\253\313\331\364\304\315\032\276r6(\261\325\224\346 d\357\257\013\240T%\314\305\270\200\350\204\343\276\371\021\011\206\221(\310!+\034)", 100, "1W\302\356\244\310\375,&oW\334\355\230ipU/\026\236\352\250X\010p\335c$\032V=\375\316\037T&ja1{\225\262\177\313M\360Q\313\220\177M\307/.6\206\333\256@<[\331x\212", 64 },
{ "\016j\376}|\201\341\346\214\014}\023\353||\360K`\336\205\261\336\015J\243MP\341-Z\016\224", 32, "\013\350b=%\356\202\247\222\201\3362\222gr\331Lf\201\340=\365\002?>\011h\246\306C\361\274\306mK\002\005Z\230\267\372\0364\342\254<\032'\215FR\231\210re\035", 100, "Fr\342\330}\351*D4\314\003G\366\270z\016\345\233\241\331\225j\262\324\362o\016\306\205\272\333J\255\350G\001\365\225\2548c\202\036\275\353\375-\031\032\023m\220u\337\236\265f\357\033O\341\332\235\246", 64 },
{ "\037h\035C\201\200\227\347\245\205a\334g\343\330F\330\267\276\254\350\234=\317$\220e_?7\014\020", 32, "\363\34664\0316\003!\264\262\016C\225\026-\230(\363\007(R\347\013\014\012\304\244S\032\367\203\336x\251^\365\200\004G\354Vv\236\277S_2\363\260MU+\240\263p[\274\357\343\227\264TN\244", 100, "=\304\257c\200^\221\207\253\275\301\300\245\370\303\326Lt\026\235\337\334K\026B/&\0273\352q\024Pf\377\305\326\015\353\217~:\223bxyC\036/\021\134@\324,\337@O\024\356\252\352\314\001w", 64 },
{ "<ck\222`\012f$\315\356\376\035O3\007\231*\320\3771\321\367\265\277f\026\235]\212\346p\265", 32, "\200\2359\362\263\334\216\034\256\314aK_\026R#\204M=Z\317\042\245?7\321\243\270\004\253#\227z\207+\236\236u\031e\235\242}(\342B\332\316\013\276\2202V\344\351\240\371\3477;\356I\345\265\024\202%\214\001x\317Z", 100, ";\323\242\262\007t\327f\312\341,)\203'4\316s\215\367\234u26\257=\344\364G_\314\026v\266\211@\303\374\253\363]c\177.\322)\372\264\267\300\277\011\270\233\134\243\207\221\034Y\255[!\227\243", 64 },
{ "\247C\355@\333R\261b=\000\350\037f\035=\316Y\036\001wPf\235`\276\212\2444|%i\355", 32, "&\223g:#\333D\303", 200, "\012gG7\364~|\311\306\274\255\333}\234H\031\200\377\023BQ\276y\366\134\317\366\277\332U\253\277o\300R1\332\276\200\036\365\332:\033-\203W\006\362.\002\267\360.)`\354agA\235\260\263\347", 64 },
{ "\215j\251\011\356\335\233\360\027\313J\233k\222\335\311\263Tl#\376J\2344\220\265'\220\037T\314\253", 32, "\370\034\005\326VK-\357s}\236dX\264\024c", 200, "v\356E\210\252B\031\264\265\202\247H\252>\350B\315\204\370D;A\224\200\004{,\202\302Ba\310=\214\012U\002\007\265h\007\262ou\251f\372\337\227\012\310\357\277\346\321\351\236?\310\303.\263\377`", 64 },
{ "\372\252\370u<\365\355\222\214g\324\027\302\020\214\357\013;\334A\042\331\227\267c\3001\035\215^\245\316", 32, "8Kt_\242\015\235\007d\013\376\241ml\211Bf\225k\357\226\031\042m", 200, "\214\323$\343\001&.\301\226\220\260R\263\253\207\226\321.\276E\233\267\351BW\230\365sc\273\034\005\342\006\033\2051\227*1\017\216\221\024\276Db\222\212Y\032\017X\333\320\210\177\356U\366\321\256\002\216", 64 },
{ "\203\000$\374>\2270*\334\000*\254(8\020o\311\213!\000\253q\333`r<\201IS\020\217\246", 32, "d\315\226\314\202\321\343\360\351\203\033\343\312\315\245\024x\351\274&\032\034\364m\241}\376}T\253]d", 200, "}1)\202\266\331\2179l!M\277\251\265=\3449\310\220\346\310w\330\210\026\305\251\375*\207\233\276s\277\273\202o\326wes\224\023\3222\223\365\304\375\371K\274\344t+S\314M\217d\320\221I'", 64 },
{ "\2519\015GJ\241\362a*\252\307\253B+\226\204\226\320\276TlW]xHr\244L\354<1\363", 32, "1\207\307\303\232\276\322\277\037}b\023\256\211A\371\333\220\217\342\216\304\011`\3450\270\207\343\365\277\311\301\351p\002\223\011\372\362", 200, "\354\034\351Z\226\347\033\212*\253\011X\355\254\336s\363\365\257]/\202\256c\305\203X>\251\027A\233\357s5\337\022wW\240A2\351\271v'D\376\205[\246\313\361\375\301\251\307c\202\365tf\000\305", 64 },
{ "+we\241*9\342\353\272\365\313\366\241\031\272\231R=\310#\372'\322s\014\253y\372ym\314\260", 32, "\230\327\217\225\203D\015\036\364D'2\042,\001&W\310\326*\375n\255\2530*\323\210~\203\361\234m\375\215\2151\342`\360\353\224\224\2510cW\260", 200, "\017\317\2567\134\357G\343 f\3122\011\377\334R<\365j\230\021_N\230\235\006\245\035\274\037-P\012P\225D\024\021Zy\256o\223\242\030\032Y\024\213z\265\012\374c\325\342\2735\370+\274\360&\020", 64 },
{ "\234T\251\237\350\325\232\3613\253\322p\252\327Y\212\213,\374\326\203\235\037\274\203\2665kO\025\356\012", 32, "\263Bg\330\260$a\243\027$\303M\2553\2347Qm^8\2041\011`\216@\013\011}\302%\352\360\316\352\370\003\220?\321F,\236\360\362F\327\350R@\327\247d\325\272I", 200, "\244\015\341\362\031\363\032!/\221\207\204\325\303\254xl=\267\373\336\357-\322\304o#\314\027Q\015G~\012\211l\314\265\3305T\005\247\324\000\2406vp\372t\352\204u\374O\347\032\010h\277[8\257", 64 },
{ "\257\330\002\330n\015\300\364\026\251V\016\3308\231\221\207m\003\024CL\271\251\364\324r\036\313[u&", 32, "\240\032\225W\314\311S\204\0351\027\177\361\367eO\224\260\214\274\266Yj\275#V\265\32533\244\00139m\356\256\363\312\221\015u\334\036r\205q\300\024\264\002\311\277Z\271\333\006a\326\206M\357\253B", 200, "\270\367\357\237\004\177T\024\266\332\342 g\261\336\024 \035\243\255a\336\2006Uq\217-\362\372\037S\301\314\314\327+n\252\235c\004\042\020f\311\337\177\211S\266]\346\033\210\244\254\377\333\305\314\007\355\311", 64 },
{ "\224!/\213\360\357\220!5,h\322LnTY\025{\334XqV\236qY\026A'`\021\364/", 32, "\247\213\203\223K\362\366\255\020\217\2265\222%\030T\265\313:SW\237Y\346\256\324\012\2358\235\257J\276\034\031a`\337\202\317\352Z\017\323\303 \264\042\016\015\012\253\004\264$i:F+\003\301\266)\270Im\234@\271\014\026\312", 200, "\207\261\336J\2314\262\330\025I\012\316}\354|\357\033t\006\361\326\333\232\031\325y\003K\277\3518\334\301\357\365\234\301.w\230K\256\201\266\350@~\340\222\310\014\376\355Fk\257x\242D\374\037gxU", 64 },
{ "_\005\231\003\225\334q\370mQ\321\252X\031\265=I\224{\343u)\217\201\370J?\364\013\315D\177", 32, "Q,\356e\355p<b", 300, "G\004\232 C\216\210\013!\042\243O\204(B\302\252\030\254;\030\2248\267U\364\304<\006\302\323P\006w\311\364\261\354I\302\036\370jnL\313\2700\273M\306\311\005T\255n\363+\355Wz\270\275\355", 64 },
{ "\374`\241\254\336\034\021\310z\030\203\033\352|\027\301\242\216&E_D\224\373-\0137\314i\023\377\245", 32, "\020\334$L\013D\217\205?\230\230\264\364@\324\363", 300, "\256\342+/\370e\321\252\275\015\2036\020\307\266\213\026\300\034\353\255\263B\334\305\367\323\276\246\336\346E\000\030\010\246)\2521\267\321\342\330nuVb\214\355\311a,\334\033\267\274Z\033@\012\326#\001F", 64 },
{ "|\341\014\005(\367\003\373\213\017\321\0056|\006w{t\2053Y\224\202y\230\006\221\017^\330\333\021", 32, "\315cD\364\265\351I\036\0256Y\035\243A=b\360\025\251\357r=C\027", 300, "!D\236+\010\242\301\363\225\3330z\332\347\277\367\201m\355\225\004\013 B\346\376\340\350\255^\326e]\254\367\246\264\2143\260!\030\363]\341l\247)\252\327Z\205Xp\2570Y\233\325\303MB\200\235", 64 },
{ "\2568\003\323g\134\242o\362\201\313i\372w\372\003LYKt\032\203\3145\257\001Sc% e\277", 32, "\322\325-\363E\042t{I.\033\016\210zJ(\310\264\245uT1\2043W\331\315\352<\356\261\271", 300, "A\200\233\372\306\134\034\2735\352\317D\244\234\307\015\014\212.n\312Q\231I\031\240Y\265z)\236I\374+r\2048\316\263\364\320\205\202\342Fi=\244\205\032\037\007n\211\302\005\017(\261v\042\007\361\257", 64 },
{ "JU\366K\332-\204l\206\252M\3202c0\344\035\226XM\327\331\032sMmp6\232m\212\355", 32, "\205\300\243}\267\302\364\034\210\246\012\177\342\015\345\337\262\362e\021\224j\370\032z\241.\042\037\013\245\015I\037\326\272\134\335~@", 300, "\214\355e\010dE\015\265`\2106\023[\322\361\366\1341!|w\007\024\235\217\036\005r=\313\3310o\345\134~\327l\255>\312\232\311\270O\333\024g\301vY\364\032\351\352Nw\320\247!\241\367\003\006", 64 },
{ "92\200 \224\243\3026Vp\376\270X,\300V\315\265\270$H`\262\324\271\337\320\253\367P\2525", 32, "\360\371\017\302\303~\016~\334\013(|S\017\315\2465\264\227\3060\334\014w6\235C\256I\346\022Z\012O\023\221\262\252\355\237\346\323F\3111>L.", 300, "\274\0251\006\345\321\275[id\316<\370{\026\210\350KjB\324,lS:\345O\263\301\355J\364\346\271/\3262\223j\347\231\245\234\022\241\254h\002\265\234J\275\2521V\325Xg)\215\300VFN", 64 },
{ "\224-3\372E\373y\366q6\375r\201\250\276\235\212\276R\275\347\317\331I\2572\031{k\354Sm", 32, "\335\213\324\011\243y'\302X`\317 \300nj\240\002\355\177\322\003\350\004\250\3265\333L\210\134\354\260\327Qty\007\033\337\350\234\216\340)\230/\321!|\361\2669\246\335\266\360", 300, "\240\270\256\340\027\016\010W\030L\305\234~\362\011C\234\022\267g\207\301\246p\216`\234>\245`0n\231\326\303\032\2464.\215\310\347\236\237i\220 \336i/\275q\315\205\034$Y\307\2310\326\276\252\224", 64 },
{ "\347w?8\316\356\356u\030FA\011cQ0\032\301{\322z\364\007\344\244P\003\312t\271\370\022g", 32, "\270\003\340}\246\274jA\267\033\366Z\275\177\227\331\205%v\323\260-\012\340\015?t\2752'i\302z\212\300\332\317\231\234\220\015\241\035\3523g\025\263\244\042y\340\274\322a\252\005\251\336:\275B\020E", 300, "v7\377au\016Z%\270\215\300\011\237\324S\021\207\014\357<\335-p\306\034\224\362Dn\331cK@Ji\354\217\324p\324\212\310\313Ho.\224\340\031/H\373*\335\033\357\253\037\222\204\234\265\037-", 64 },
{ "\255\002vG\234h\247N\257\033\370\323\353\003Z\352.\361\373!\003\304Z\374R\012\265\255K\273\223\005", 32, "\335'+\321\275\250\200\315\216I\235\253\307\266\310\357G\004\372\301\311\031\352y\004\247\252\277\325$-,\340\352j3\331\042\360S:}>\276\313:%N*\226\273\311\264\363W\217yBLK\225?\343W\020\360\261\347?\267\344\203", 300, "\212\336y\264\270\212\272\345y\231nX\323\343t\236|\334\370\346<\347\322[\013Z\036\200\267\333t\014\3361\347O\210\357\206\031?\314Q!\275\310)%_\325T9\376\204\260\241\223\003\363\334{K\360f", 64 },
{ "\257\324S\205\231\324\023n\317*\321\373\341\307p\302\300A\251\304\014\325\276&p=\307#\341\220\274\000", 32, "\203%ft\036\202Iv", 400, "5\213\375C\213\233\346\347\003\243\243\304\255\035\213xV\007\275\042\013\265\015\231\267\322\021~rZ\271\227~\010 T\277rS^\326\211\305\032]4\023G\224K%x\005\312\3131No\177\230O#\0423", 64 },
{ "\234$\001\017m\223\035\315\265X\360u&\202D&\321\020\216\334\261\236QA\302\004D\367R\302\255\341", 32, "\247\334\314\177\366|5\235\231h\323\217\332\364O\016", 400, ";\015\000\340\014\206\252\307\206\376\314v$\224x/\033g\027S\003\262\270\273bT\036\020\001!\261\003h\314u\003T\014\030\037V\202\005\327\216\324\213\336\020\303Le\3237B\012\374B\310\035\322\320\006\324", 64 },
{ "!B\007Pw^\277\024m\232\342jH\2722\376\326+?\3568\217WT\037\273\037\311\352\240\007\273", 32, "\374Vhd\263\246\255W\226\015\276h\241\253.\274*\012o\003D1\360\021", 400, "\0119\322\250\350\027\226G\260\203 \316\245\027[lV\313\005d6K/\217}L\353\337\273*\250]J~\223\320\266\331\225\222p\262\027\007\227DV\223\340\332\305|\211\303~N\211~\353U\340\324\261\042", 64 },
{ "`m\302\221<\360\306\306)\220)\2751sl\022\216\363\233*\257\000\251^m\006\261\367k\007\355?", 32, "\300_\016\250\265\234\3131\241\030\033L\253F\003B|\272\250\021\242z\235\011c\013\231ty\277M\027", 400, "Rb\332\252\340\0128\177\311\030p\330\0265\337\206\212\217\213\322c\240\370\200\016\370hC\012\026HB\275W\255l\316\354}\225\354M\310A(\307\372_\254\260mY\277\032\375F[{\323P\030\273\321.", 64 },
{ "\020\301r\264\274\330C\264`DH\360>V\370\005\234\013\270\273\223\234\02137\345\275{\042\326\236X", 32, "\274(\277C\310%D\305\035zk\212\360\020\324\324\223\212\234+\312$Y\221\250\006\357\325F>9\212\313n\250\2323\314\343 ", 400, "\276\012\347\225\301\271\344\223V\3001\004\212\033y\001\351\313vU\331\021C\036\360\343!\324\321%\222sh\221\232\313lo\3063\2471\354\335s\256\237.\241\267\323\247\261\340=\272\370c\276\336\134\214>\204", 64 },
{ "H\325\277\243\331\206\273\317R\005\324\030^,\370t\276j\0003\230~\370i\346\363!\223\273\244d\333", 32, "\367\241s\025\264\023%I\355:^XHr\003\230\177\331\245\347\025\372\234i\325\350-_\177\375\323\370#\320\332\320\311\241nED;\134\370:\012\026=", 400, "5\325\243\265{\033-\344\370u\020\1342B\017r\301\277\134+4\016\001+_T\367\354\012\325\311\257\023\200s \262[7jy,@\205\254\364\350\033\212\223\275\236\332o\031\350\026c\366%\377\272\333,", 64 },
{ "\012rD\010t\322\202\251\355\253W<\201J\363\312\206\323\337dN\244V\025zG\324\375\361\207RK", 32, "\207\227\350\201v\263\376\206\215\360\221\3046\022\217\002+\022[0\216G\225bQ)s\204\321,\225\352\256`!\250\333\216\364\217\30602i\017\262\013\352\326\301\250\022\244iLf", 400, "\034\033\242g\257\230{\316\363{U\253\0049\000\257\265\264\030\264\011E\320J1<\274)\201[c\252\323\266\353\222\022Jy\366\301\024\252\024m\272\261\307=\2047\371Ril\222/\230eL\003\325c\276", 64 },
{ "\207xrV%\324mBu\004\356\222\302;`T\347\0040\302\356\324\012\335\015#\324\330\214\335\221\205", 32, "\346)|\356\355q\266\340?\377\220\364\361\022\004\274eTvh>@\231\205\003\3354\234\001\337\260\031\225\3546C0i-\377\3657\021\340\354\225\352@\314\313\336\035\313\014\347\327\320\250\314\276\247#\356`", 400, "\341\017\177\253\177\265\002.\322\235\224\177\244$k\307H\245&fLi\354|u\241^^\0231#\300\317<\316\230\254\0302\264\134\011\016\275\356)\307\374\365\313\324\311\267\246\236\371Sl\366\327\254\333c!", 64 },
{ "\024\201\3045\325ty\362\270\271\253!\260hE4\220W\255\240\277\377\326\320\202\206t\264I\324\215\204", 32, "_\271\352z\017\375Q\326\256`\372g=\274\261c\367\033#\275\356\0242\315<\220[#\023\371\2636\3131\360:\324\375\242 mC\227\315\220\302\006#\204\273\011\252\245\002\026\030&_\241:T\215(\002\372\213\252\331lX\017\370", 400, "\242\304\265c@\230\004N\354\001\252\263\211\037\201\276-]\015g\365\204\323\252\355\272\3165iB\364\357HS\345\253\303+\006\251g]\370\323\204\267\346\031[#`\225\343\272\201\253Rxn\347l-\3050", 64 },
{ "A\316\347I\012\032\011\224\206\310LF}\377\212\035q.\031\206\241Tt\346\252\220(o\223\272\325\257", 32, "\011\025\200\201\221V\177\373", 500, "C\275\213\366A\324\330s\323\322\231\342\353\355F\226Z\253T| f\331\134\377\337K\325 ^[#\275\012\231\325\032\362S\371\027\312\223*\356\222\364\226\042\311\006\260s\360\236\034\253\310\357\365\265h\374\236", 64 },
{ "663\230\3430\362\027D#\210\010\013P\017\224>\020\005\216\272m\006\035\225\355Zly\221\005\223", 32, "\335\374\334\026Y\254Z\211\272\353\306L\354)\251\002", 500, "\022e\035\371\012\311q\335%W\011\312B\377\263=\376\214'\275}K\254\221R\205\321\212'X\221\354\337_e\327\362\372\323\320\311\300b\263\253\273\020\305\302\251\002\266\005|F\245g_?<\361\314P\201", 64 },
{ "\031\236|\263)\012v8?A\033\332\003\363\2020sLS\230&\353B\031\242\010\245=\027\217\037p", 32, "\012]\202\012\2107`\233\373\265r\217\234\273\213|M|\315\357Yue\327", 500, "g,v\236\024\021\267gL{\262\341\213\346\356B\250a\361\354\276\267-\313\201d\211[\001bu\314`T\036\134\212\022\330o\366_\254\3731\354\024Z\300\272\250>%Y&Y\354v\271K<\316\246H", 64 },
{ "\301\031\014\272\325+ \361B\361\360\204\343A\230\220l\221\017\337\250\316\134T\351\211\037eO\305.x", 32, "J\244-\214\267\363s8\302\242\237\204\351\274q\204\3478\227z\263\311u\312~\336\317\250\241\341\206q", 500, "\316\205\233\374\320\350\232\001\355\277E\227\230:\372q\230\024\373y\356\264\306F3\2551\320\246\275\025\036\206{\323\264\272f\276\330\1778\262?\235\204\363\363\261w\030\251\242\347}\002\305\223|)\340{\264\257", 64 },
{ "\364wG\247F\300\250\203\364rB\337\311\272Td\221\207\034\251\303\265\217\014\273P\034\377\342\254\363\037", 32, "\361\134\360\257\305\010\030w\345\030Y\244\236\002ge\324\326\340\276\022\362\335\353\366\362\205\307\020A\232\274\034\240\366\274\310C\242v", 500, "\260\311x\272\213L,\223\333U\363\022\355\366?\231Fr\227\025\253\321\203\025\013M(\033\300\302\226\256\272\344\370\217\034\256o\376\325[\004\035\007\004M\220\005\334y\234O\367\334wp\2750'\032y\306T", 64 },
{ "t\246\251p\322\247`B\337\225i\007\362\317\201\023\010\263H]\373\344\226\005\304^@z\226\210>\250", 32, "\315\310T\325\200ys9\324G\3320\034J\376\024\366\365\310\351\350\221\362\251u\372\334xiUD\205Q\247\206\276\232\204\015\2034\264\347x\303\270\375[", 500, ">F\372\306+\2150\024\263\031\340\226\215d\350\373!\237\272\263\340\362aBZ\354\263N\377!r\351\307\223\257\215\224\322\305\253j\016\201W\303\3706\177%\262$\212\334P\015uwj#\267\037(\254\204", 64 },
{ "\351\275\340\351\264\341\017\033f|\233\331pOK\277)\013\354\312\356\211\344@(\320\321\322,\367Z\212", 32, "\360\340\021bp\367\336\246\352\231\244.\232\370M\257\204\033/v\236\226I\215\033\243}#e\362\030>g\361\242'\334\220\177\003t\353<\370\023f\034\354\177\017\267\013\335\315\350\355", 500, "\001\266i\240c\265i\314\204Y\252!\335\042\373\211\332U\303(\273\304m\261\020l!\360\300\006\376j8\2547E\037+\242yO8\002\377]\256\245Q\032}R\343\311\344H\353/\227\3566\270V\263D", 64 },
{ "\217\025\363\021\024\006\013\355\005N2/\250-+\3704\354M\001t\245\000\233\361j\324:\340\266D\036", 32, "\177\226\351\134a]/i\247`\370\346\243\006Q8\302\211r\021gQb\006\244s\350\273\303\202\220\236\341:\372\026\335_\247f\203\254\303\010\231\035gG\252e\375 \326H\3469\270\014d\215\273{yw", 500, "\270\334>\273H\035}\215\322\350,\353r\212\020\362Hd\033\214\021g}\366\352\346\2725K\022K\217\220z\221n;M5\024\012\310\225Uv\377.\203\260\026W\351\000\263\003\266\017\202\324x\313~/\302", 64 },
{ "\214k\277\217\215\031\022\204\207\011_E\321BRrkE\020\015\375\223\367\346\370\013f2\306R\217\356", 32, "\307\337r\321\366\245\307A\013\015t\352\362\006?\245 \333\334\264f\260N\250\225\341\030J\334`#\263j\275\231WU8\366\203K\223\365X,\266?n(_v\347\303\305|\316\207\013\042\251\233\232\011\324\3714g\010#C\241\336", 500, "\007YI\203\310+\236\336\020\221YU\351\376\232\266DF@Y\006\226\242\256\270r\303eO'\366?+\323\032\225\345\320\015\227rsge\317\260\342jp\231\372\306nG\350Mx/\337f\2757\0121", 64 },
{ "\134\355\220\225k\203\013\271o\037N\364\237\343\352c\336:\335n0\213\247\365K\204A\253\005\205\211=", 32, "u\267\316\322\344I\327a", 600, "\263OO\366\217\232\213i\216se\234\231\2740!\311#\256~2\267\134\025\367\310\020\3541-T\223\227\025\010\276\212c~\265Sf1\200\017MO\002\006\352\374\316}\313\032\317\221\007\322]S\224jl", 64 },
{ "\014\274\263\346f\231?\005\223\3336\036u\301z\361\324\277\351\013\320\244\247_\365\315n\222\345s\023\134", 32, "\336I\3260\310g\341\234\3012\376\205\002\301f\311", 600, "\362\246 u\364\216c\037\232*\037\253\031\335\347\022[\007\256j\303O\225\270\204/\031E\244\253FdC\272\305\233i\343\357\327b\273\241j\243\261\321\255\345\304\365\363\337\277\222(&hL\325\361\011J\266", 64 },
{ "YC\314\276\211\370\003\272\320\325\232?v\203\001\274\2738qt\256\330\365\276Ad)\256$5\353v", 32, "g\346W\016*\233\311\344_\267D\346\261\322>\031\274J\300A:\355\232\330", 600, "\304\2457j\205\3131Z\021oA\234FI\254(O\026\334N\017\324\206\033_C\375\231$\314\270\212\245aV\035+\220GC\264\035@\241\231\0124\235\014<\334j\257d9\355\301(\236\226\210$\235\230", 64 },
{ "\207j\363\010\013\313\273v\326\270\265e\260\033\313\3237\211*tQ\366\215\216J\212\235\324 W\035\033", 32, "\303\374\023\372y\363\307\320(w\236\200H]\371\262\010\006\020\361M\030\346\222\361\216S!bc\3612", 600, "Y\301\037?z\341Y\350_\374@\210\324\274\014f\377\317\023\303lOh\032\253\035\332\217|\375.m\203\031\361^\320v\323^ s\031\347\215Z\012Zj\335\206\363\024:F\310\035\211\255\216\301\203\251M", 64 },
{ "\216PY\256\343yt=H\205\303\011\353\232\340\2630^\021\365\266\004r\001\307wV\251a3k\370", 32, "I\256\322\255a<l\3439N\224\314\377\232J\032\350\351n\356tKV\267=;\304\353\3357P\216n\024\233\342\031#\234\225", 600, "\357\177\2642\031G!\365r\307\365\342\013YA\347$\250\315\324N\263EI\262\250\266\006\305n\241\347\202\036Q-\134M\2663hh\327\201k46\345\373\362\256\333\314\322\236e\340\325\337\322\002x\021j", 64 },
{ "\316\332=j\346D\326Ma\303\263\332\341\337\005\243\3549f%}\366\323%\351\261\312K\234\234t\362", 32, "\042z\332/\2006}\3233tJ\021\377\266\214\306\314T*\252\342v\316Ru\036\240\341\236\034M\022YY\226\0212@\243_\374\346\004f\262z\311C", 600, "\245\305,%L\261C\022\251\134\323/=\231R\024\350D\233\202\351\235\247\243V\031FL\033\277\246\003\037Y0\375\276\314\233\224\323\350d\210\211\201\254\341 \343\352\276\267,4\335\210'\223\207R)l_", 64 },
{ "\242\231\024'\371J\340\326\256\221\320\223\177\234\306\245,\035\201\261\361m\344\360\001\276t\254\363\247\260\002", 32, "\305\014\300v\224\372\353d\240P\006uq\230\354\031\245\335\317\022h64\332$\021\350\367sz4\326n\315\257\370r\275\374\334%\011{\305\376\201t\256\023\376\025B\222\266\206\134", 600, "Y\264|\001\365\341\327\351:\014/ftNl\243\365NC\345\032\256\042\343E\227Y\253\177\223*l\331\340h\257\377\206\035\261\134\310c\021\246\363\000\250OQ\211\011\233\007\300\375\207\312\212\351\226\205\312*", 64 },
{ "L)\226\364\250lr\252\205d\356\000\333\3306\004\323\034\022A\375\033\337\306\345\327B\373\232\306jJ", 32, "_\134\277<e}4\373W\363=\010[\237\011\323~\304\201K\237:k\321\315\004\347\377@dY\270\015F r\007tQ\335\023\377\016\360PR\240\306\0210 \357\234\357\0243\011\222|\037&\344(\323", 600, "\375\134}\265=n\252h\020\275\246B\346z\012\203o\226io\037\202\234\371\022l\352\350\356\216\017+\225z\350\315\244\323\224\314\241\006\275\344\031\273\373\365\303\330\005\362)y\213Wx\265\351\211&\354\267<", 64 },
{ "\303\217\343`\352]\360\222\315\247\371\372\345\263XT\3216,j\220\240\225*\257\031\225\205[,Y\246", 32, "\314\325\324\200\024\204y\312\373M\244_\255J\322\217\244@\223\306\350)Z\021{v\352!g\273B\360h\357^I\236\343\305,<mB\273\011Xp\267\247\311\312\347$*XM7k*\201\324\230|\336e\300\214\350<\225\006\367", 600, "\236\037\004M\014+2\027@k\240\336;S\303\366\011\024\363 \325\301``\301,o\177x\346c\306\263\354\364\177\352\024*_oHB\007\275\223\036\231\005\231\216&kz\354\255\007\356\237\337\014V\245\213", 64 },
{ "|\227`~\012\236[\232\253\2406\326\003\213\215\313\255\222>tb\305@\004Z\352H\032\205\212\254\215", 32, "vU\273'/j`\351", 700, "\360\255\227x\024|z\360JY\364\273B\240\037+\027\376\346\207?\030A`K\216Ba\366\241^A\030n\027\363\225\301z]Y_e\012\273*0\222\274\242\313Q\003\201\336\034\210T\361\2268E\243\303", 64 },
{ "\352J\265\255z\256\252C\363\273\332\3044\351\214\311\012\2516~\226\355\225/\347T\264\260A\330\377\355", 32, "dv\016\032\340<\207.\260\037\354\234Csm\337", 700, "\360|\337\257\240\016)LW\230]\035T\016\001\256\252Ew\222\016\003{yE\025^A\274\377\346\265\370W\361\336`\352\0118~\241\356BW\272\315\260P\240\273\273v\322.P\322\301\177\033`\317\244\346", 64 },
{ "Q\026o\230\010\276b\336kNrzjJ\021D\302\364'\353'1\202\345\207\203\207\201\034\203\000\257", 32, "lwS\255\204\030M\357jIx\363\301\271q\304!r\215s\356\322\340$", 700, "Fx\263\350\210|\223Thrl\326\215A\366u\2168z\225U\255\314_v\020\017\314\025U\304S\023}N\021\363a\314\267G\2444\205C\200\011^Q\253{\216}[zfQG<\232\242r\314\334", 64 },
{ "Y+b\271\212\342\325\025\343\277\012\223\0121\243d\004\240\342<\205\013f0k\307\254\335\014e\364\261", 32, "\343j4%\254\352o \0116ksr)-\341\366\366P)\021\362\305\305\003T\204\302\317\312\313f", 700, "\016r\343>\207\376\003\177dw\037AN\262\334\017Y\236\374L\253<,\226\027d\317;\250`\216\326\334d\251\355\300i3eV\241Iy\220\001\356\035\364[\303\220:\242|eN\313\354\3039\3309\272", 64 },
{ "\354\261t\321\217\227\3512\321}N\214E\257\251~\006\014\372\200R\017\261\007\021\220\371\370@@P\222", 32, "\277\301+;*+3M\352\373\365\246\304\356\250nf\320-\241\325\244\306\357kXYX\325R/u\326*\277\265<\200\360\270", 700, "\265%\225}\007\257W\255.\306\000\201U>\271\330F*\253DD\317\021aj\374\223`3\367f;\026\010\342f\0150o\232\303\015\377\017\205\357%\277]\277\216m&\236\344\366\313?\373P\214\223\000\324", 64 },
{ "\310F\324\335\367\301A4\252\337\342\331\016\000\241V\341>\237\034C\204\301\276\255e\276q\341\3778\301", 32, "\214\222\134\343\224:\336\012B\323z\310\262\021\205\225\216<\313|\227L\267\024^s\316\257\014\2259\261\371tB\242\373\366\232\374\353\336[\343\026k\307\256", 700, "u:_q\370\012\235@\315X|\367\377C\217\353(\3051a\251\001\003\226\205\342\227\212\306\337$\274\201\212P\315\017\221\347\006\021\230\354\266\200.v\213\361'\320\227\331Wi\034\374\346)\332\273O\372\225", 64 },
{ "o\210\323\375q@\013U\011)\020\252TE\206\233\306\2058\324\371\354P\374?\212\235e;r\207\261", 32, "U[{7\230\215\213\276\344\336\223\322,P\214\360\205\007\202\276e\005\025H\2048\212\247Vq\232q\303\272r\273\001=\201\261\265I\311\266\323\206\203\207J\212\323\200A\375!\276", 700, "\211B\011\227\272\0275k\016\015\266\202B\0301\223\226@\037\005\377H#\302~B\020|\002\226\015\242C\342\273T\306\245\376\307\320I\301f\021f\316[_Q\356\210M!\271m\011p\027\361x\316\353]", 64 },
{ "\033\310\253\302A\013u\205\252\020.\233;\372vs\243\275\351 \015G\220l);\265\245\362c0[", 32, "\306\233y\253,\303\222I\343\335\211\242\243\026\320\253\177\211x\215\033\234\177*\333\343~\215\364\333t\326\005\240\256\300\362\015\022\344\212+)\237\277k\354;FFL\323\373\2342\022\001\254S\353\265\253\323\363", 700, "(#\342K\312\320\243\035\234y\366\000\333\023\256\305\042\361u\035\026\201?\252}Y\015=\203\332\235;&\344\027\235f\353\252\235\257Z\042k\377:\346\365l\236\335\035\274X\237WL\342\237U.y\003H", 64 },
{ "\003!:\341;,\031hr\233W\265|O\015!eO\352\272\355\210\304\360\3318q\004pw)\364", 32, "\317\243\314\370\315\317\025\017\002\273\020\344\354\222^\007\217\245\336\362\002\307c\207\376\236[\373`\257\226\332\025\202\246\010\230>\311|#\273\134\322A\364y\354V\021*=\344\326jb_:Z\221\214\203\011\277h\042v\212\211\241\303r", 700, "\252'\212\362^\0326\2114\216J#\367z\024KZIf{~\375\345C\302\307\236\030\002\262\346\012\033\317\272\230\244\320\220\272\242*\021\327\240>k`\222\263DT\231\204';\301i\027.\302\223\320\236", 64 },
{ "\321\334^\2313\347D\003\200\003RyA\002\241\321b\264d\337k]\005\260\265\226\001\017\3361$\341", 32, "6\327\246\342\376\260\013\303", 800, "\304\350\334c\025Q\240R\263\243M\320\011D\351\230\375\257Q\134\346V\303\267i\362\221\277?\323\363\207?`Qx\023\356H*wm\032\343F\017\304\033\327\204\242\2064^\214\204n3\000oqF3\347", 64 },
{ "<\204\330om\325\200\322\261\262\343\010\364z\017\317\223\366\313\311'\263\344V\270\134\2008\005'\267K", 32, "\015<\014\200\270\270\134\036\277\352\025\350Gk,\301", 800, "\331[p+\273\317\247\205\026\353\262\311\226D0Q\273U\014\366Rc\371\346>\255\206Z\253\260\267\226\200\321\357\134\3309\002X\014\015\241Wu2Y2$\331\265M\267\377\262\255r\252-\021d\201\341\217", 64 },
{ "\206\362\247\200tY~\344\264,\2113{Myk\366\370\3025\310_\343g6 \261nK ~\310", 32, "\323\372Uv{\243\026\035\350\261\323(B\257.\334v\024K\016\334\227\034\266", 800, "]\275\033\351\007\357\036\375\264\375$\360\322{\213Jaxg\027\21729\251\357\274\246\222\267K\271\351\237\321o\2451\035\310\2423\267|\272~\254\222\030\356c\003\240\337\373\231\033\270\340\277\240\3505V`", 64 },
{ "y\207\206\361\236\374\200\304St\364<fC\306\355 \306\234\022\223:\3310\342\030\214\234\275<\356\000", 32, "i\236X\220\025\3665\010J\230#\007\227\017Z;H\2152c\246$9\347\222\215\200y0\015P.", 800, "\234P\243\025Z-\322\006\333\226r\260\336\323\231\374\204Z\012o\320\335W83\020\205Z\344H\207\332\331\331\215;\322\031H\267j>l\263z\244\375\270!\355\334\370\205\372(\027#\320!xij\313\314", 64 },
{ "\200\364\370;\271\323\015f\203%k\217\262E?*\305\243\211S\370\010fV\255\271IA\312sL\303", 32, "P'\305'\353+.\324[\364\241]\231\231_\215\357\004\345\322\2315\250F\335I\3471u\026\325{\204\241l\235\365\233\357x", 800, "\226v\235\300y\206\023\337\027\266B+1\377\312\214/\027\343m~\036\361\222R\024}\337S$\003\001\330\317cW\200iKJ\362sy\227\307\2670S\341;\252dE\343\217\375\270\206\373,1\020\352\312", 64 },
{ "ZN\344\3253\000'\217\224\223\206\257\3662\321\235j\204K\236\264'\312\030\327\276*\363\001q\272\223", 32, "\246\017~\226\231#gE\374\224\224E\374d\367\301\027\336XL\242+-\247\227\020F\215e\354\020i\272\214\271F>v\030\230t\007n\263\301\275\231\214", 800, "\332\003m>\274\2375.p0[\0234\037\245\256\227\2617%2\374u/\201,\316\324\200\323\225a\242\023c\332\233\211\342\254\011\230\032AV\235`\246PC\222\301\222/\342\354\261\251;\3505\357ey", 64 },
{ "\371\374\236\365\2432\210\021\205\300A[\365\017\207\2611\252\236`\015\031\205\326E\324\010\253\037\312\267\304", 32, "e\316\2516%\025\333\014\300QA\220O\343\366\001J5\251\353\300\262\262A\2748-R\025\027\263\227z\231E}Z\207\017\250\365\030\001\344\231\376\002j!\375\317\206 \347\3046", 800, "S]:v\220\373\206M\244y$\240\260>\030q\335+\206\205\305\361\251\326\0039<X\246f\272\026\304\346\373X2\321;\013\252\233\360\351\242r6Iy\230x\010L\336-Y\211\234\306$\346\344\241\300", 64 },
{ "\311\245\037\240\343\023\324LW\311\013\250\035\275\332\230G\317\255\267\0206\374m\275\375\336\005!\342Q\241", 32, "\361\016\341\005\310\206e\336E\256\223\266N\236L\033\035\3649\261\260h\202\303\2130\024\250L\036M\266\257Y_\203\211\311F\233\306\272\304\327\022!\267w\037\003\357\277\356\377NP\237\263\367\313\233\371Y\236", 800, ">\332.\034X\250x\004O\016\221\022\027\001\022\221,r\377F\262M\307=\033\042\341\312\014/\024v\224\265\200R\363\223|\360\235\200qp\225$o\201\020\2500\375\024^\217d\347*\355\257\211L \007", 64 },
{ "\206\307\0424\261\034\255\242\033\233\205VS*\003W8\226n\302\042\263\366YL\343\033\256'R\007\331", 32, "\035\241\217\002\364\341\305\313Cu\347@)\020\376\336\372\375\257Y3\202\237\266\365)J\270\351\265\310\212v$\201\207_@u\013\301\177j94\202\304k\345W_\324\310z\215_\304\2554U\236\245\314\330\313r\271\001\335\0075\322", 800, "\237\225\217\301\200\264\242I\240Z}\303\365n\227ps\365\302\013U3\373\311\273`KQ\354\360\335\212p\227\245h\332\225\374\375\374\300\261#[\240\246y\212\013\332/\342\212ns\243'\243\036\023\375\002[", 64 },
{ "d\375\042\033\372\337\277O4\004\270\037G|\234oY\032\214\211|6\374\374\207\221\205\261Z\034h\362", 32, "\332jcz)%\345\206", 900, "\312\233\266M|)\265Y\277UY\323MYj\034\203\011\353\215\361\247:(/o\270\321\362\034&\302$\2402\277\260\262\371\231\030\204\373\230;\276\371\000\323\302\025\314\027\205\035\2404\257]Kyl\363\203", 64 },
{ "\272\211\350\227\343N9\013\232\254RC\003\362)-M\324)\211\002\343l\331\300\177`\255\373\017r[", 32, "O[\2002X\323wW\374\204vg\355\270\003t", 900, "\243FM\260\206\333G\331\341\347\337\336\001;rr\306\343\211\360\272'g\207>'\224\334\2664nLA\311\221\321\030\024\015\036\246[\224\364P\270\223q\221QN\254\272+]\246G\337z@\211FQ~", 64 },
{ "x\357\024\247\310&1j\252\035r\024\301\217\241\012\336\300[\342\201\312\335<\307y(\273\321Wp\323", 32, "u#j\303\340\326h\242\367\023&\377\334M\201\202Y\342F\205\241\357\220\036", 900, "1\343\316\341e\365\233Z\355\313\013\021\302@\027\274\223\342\331\367\343z\353R\276r [\273\344\332~\015\311\255\324\325\014i\266dH\357s\3040\304\002\355\257\274\022\212\346\27511\300\272\215\210m\042|", 64 },
{ "Y}\011\134e\265|\3432\274gZi\334\340\320\011E\360\353\033\374\373\004\023n\025Z\325j\036\003", 32, "~\034V#\3239\346\017\020m\212/\203\370\372'\341\005\021\246\304\341v\352\275\224\036M\313S\211\257", 900, "\377\374\030KE\325Clh$K|\350#Ns\267X\3442\031%\270\012\024\17744_P\317Y\244\316s[\240\312\347F\305Q\322\021\013D\350\022V\014\2677\017q\306\361\222\260\306\037\257\236\010\263", 64 },
{ "\301\271z:r\325\332&s\200|W\361\220\270V\327\337\376\266Q\343/Z\224\245\021\226f\012\227\321", 32, "\1342m}<\220\234r\367W?\235p\234k\216.Z\260Q\304\212u\006\323\317\3103\300&@\257\354\276\245\311_9\004\252", 900, "\351\010\311ad_\347\271\204\243\007\377\311\236C\027,\215e\200\030\024=:B\253fp,1C\221\311d\214l \317T\027\376\030\320\204o:\362\235h\270\366\353\001eJu\004\202\300`\215%\355\201", 64 },
{ "\241\371#\267\251}\342\250k\275/\364dhP\000\340rX\010\006f\241\371\377>>\032\370\265h\253", 32, "\333/\273\006\213P\330\305\304\357\357\324.A!\002\250\210brD\302{\026n\007\350}\327,\371\260\240\322\253Q\243\266\254\037\001fm\233\257Z\315-", 900, "\030{p\375!\357\134*\353\017C%\217C+\225m\005_\206+\004 J:N\370\367\2041o7\241\236\222\261 \313\222\177\340\134\376r;l\224cC\035v?\022\316\321D \372K\214\317\216A>", 64 },
{ "\014b\217 (,\360\311\026\343\360yQ\215\363?\030\3467f\352\251%4\361Pt\037\261\371\014b", 32, "\032\257\353]'\003&l`\315\012\274\356L\346\001\255\303\3150{?/K\270\305\346\2311$O\244C--\351\004\206n\327S\217[\134\274c\372P}\243\355A\354\266\207\006", 900, "\007t\223\367\034\352H\312\205\030\314|\272\240\360\362\006\002(@\261\224\004\225\204Q,{qhp\240\271S\340B\015C\376f/\370B&Gf\024\022\312M\262O\316\177 \325i>\274\377E&\220\220", 64 },
{ "=`\230\314\234r\206\304\134\367\363!\023\2774\301\323\026\011\366\265\265/(\343!\007\335\242\214P\012", 32, "e\024\351\002y\227a\260\331\026\213Y\267\251\310*\230\030W\214p\255\230u\001j\3704\315\375MSX\030c\336\306w\325\346\262\2640\255\2465\253\3334\337Nex\234\334\216\316\314|-\257\017\022(", 900, "t\221\347C\244\016:\216QD[$r\347\227\325\256\343P\203.\012\277\3216N\241\351!\037\211\322U\017h\021\042\352\030\221=\317r\306 \367G\372\270\214\004\000\207n1\3646\344\034\371R\215K\305", 64 },
{ "\355\361\227|\310\247\256\014p\026\017\037?\364\277\355\314\030\236\306\032\306\240\321%\262\256\265\244Y\216\252", 32, "\263\354<\350\215\312\311\366\242xX'\234\312}f$>Ez\327\023x\320\355\331'\372uF\231\257\251^\034\364d\230\022\304\245\322\261>\325,\273\357\303\311N\3374~\323Q\014\342b\342\025\226y\307\245\026\231Q\266dm\215", 900, "\325\361\300\010\312\311\037\017Mh\310]\254@NC\324\205+Y6\027\362'b`x\353\007\211\035\264b\005\225|&\321AH+W\007z\377#\361\274\265:\371=\257\225\361ec]\315\203Jv\203R", 64 },
{ "\242\341U\355j\004k\356\204\330\351ufb\327\337\357A\223\341\233\3668\220\352\134\247\202\373\006\310\323", 32, "]\331\327\016\205\272\246\206", 1000, "?\230\007\216(\272\307M\015J\344W\242_\233\230\2201\243iM\254\362+\254\333\3658I'\335\241\377\2061\013d\212T<\327\201\257*U=\014\226\321\251\227y\370y\016\216=C\363$j\272\241\365", 64 },
{ "\017\376\364^4\254p\016=\353\344\366\352\006\227)\030\357\004\263R\373\177#\211 \335V*[\344\257", 32, "\3722\017\275\232\262\323fcgiW\232\224\262f", 1000, "\373P\274\357\005\026n\3021wkI\355\325\026\376\021<E\344\0372\020\277\014\351\314\011\312J\317\3756\321\216:\353\270\271+\003k\020\275\022\370j\3327\3621g%\362D4V\205\255\326\311\214\246^", 64 },
{ "9\243\362\223\261\241\356\331\2720`\272\252?\334nJ\263\210`\347\203s)\023\315\005\354\340\232+\307", 32, "JFS\355;\213\234\354\267\337U\326\012\231H\355}s\316Mc\371\335h", 1000, "\343k?& \367a{\302\031\024T \034\223m\134\217\245\015\250\037_!\134\317\346Tr9\025\206\250\032\366\274yg\243j6\243\370\236X\365\0050\376\357\302\224\006B\026\034Sa\200\262jg\224\246", 64 },
{ "m\363\264.\272\327\200\261,h\203\315\002\005\017\205\201\217\252\020\2113\363$\262\177%\360n\326\030\010", 32, "\025\271-\275,\260h\337}\257Z\021\213\330m\354\220\370\216\211J\335\206KY]\027T\226\2063\363", 1000, "\215psKGX\266\370\313\377\372\340Q\013\2700\034\273U$\033\022v\326r\015D\315\365\340\331\2533n~\010\342Jj\356d\351?\011Xr\306\277\374\002r\350\325\234m\322\223\275\042^\042]\022>", 64 },
{ "\042t\014\315\227K\273\323\237\220!\270\0172O?\2645\030\265J\325F\343!\241\344\323\301\241\024\272", 32, "\316\027A>\233\225\212m0\037Z\277d-f\017\200\303z\334Y@\261\230\254XT\227P\301\260\014\242\266\244\262f\334\365\324", 1000, "q2\353W\236\364\266\204\340G2\337\224;\220\223/|\2132\202%\215+\362\023\340>\210\360]\217n\374'\353-\010\217\000\212U\335,\012*_\325\001\370\037\322\007uCu\037\331\242\212eb\343\035", 64 },
{ "|{v\001\223\245`d\005\263$\321\225f\344\340\010,\305\273\025$\370\275<\315\373j\304\226\350\233", 32, "\224\263<\367\330\351A*\260\300\235\337))y\221\367\306\373G\324\266\227\372\027g\013OH\321f\326\025\333\334|\013\002e\005\025\205\004j\212\206\244\216", 1000, "\341\371\031\340\344\313\002M\255\020I\333\324\265\242ra\371mhr\017\214\366\274\337\200l\336R\305\276F\024\264\035:'Hg\231\245\217\350\306\251\376\032\310\010\311\250\013\354Tr\017c\367\241\300\031h\211", 64 },
{ "\303\341\317.\250\305\257\235F\324\011OjZ2\312s\224st\2041KS\233H\022gm\354\276<", 32, "%\264\212\004p\266<\314:\376\324\250\341\3151\251 F~\223\267\032\252\245\370\001[\257~v\363\242\253\240g\042j\306\233\336\312\042\345\257:\266Rc?\011$\344\313\267t|", 1000, ">a>\272\354,h\337\205\232\204Z\212\230\257e\307D\322\263\2539,\264\271!\034Rg=\201\334~\201\252@etE\326\241Q3f\205\314cc\237\216\373\272>,\0112\010\273 \307\332z\223\274", 64 },
{ "\211\211\354\215f\332\255Z\340\337P\031\217G\266c\200J\323\042\361\250[\210\022\007R\341A\017xD", 32, "\256\303\241\352Ij\317\253XL\262\221\031\375S\343\275\225\301\033\356\264\332'\014\004\326\230\036\275\002\325\260\301-2\223\247\0041m\251\210a\356\251\274\324\204\361AP,\312\025\247^\363t[\350\223WY", 1000, "\311\035\334V-zy\017\370\244\203\300W_f\2177\002\237T;\301\261\221G[S.\037\2030`1\321\010\300(b~\371\217\034\301\276\250\023\2462\342\374\332`\372\204x\035\247\012\237ju\275\224\362", 64 },
{ " \313\304\230\206\234\222pk\244\005\2711u \340 \223\322\345\002w\275\020\324\316\224\325\036r\223;", 32, "\372\344\357\324a\333\254c\215i\177\320\300\242\020\025[\005\3252;b\277&@I\270\015}F.;\242\304!\177\343\012=U\253\253o[qR\371\201n\357\361\330\277\253\346\177^\332\042\322$\201\377\340.IOk\273\363\005w", 1000, "\310\012_\254\372k\220\263\272\361\134l,\345/\371\371\357\237\301>\205\237\237m\036\272~^L\355\0210X\221x\331\0256LD\264(1f\357\014#?w\034\023'\210&\355\261\235\361^\004\277\313\014", 64 },
{ "\373\253'\357\233\227]\260\212\305\037\273`\364\001\032H\177\203\342\012\022\225\2572o`\240\277|\275M", 32, "U7%\340\031!\012%", 2000, "\024\2525\230j}\315\267\244\345e6oY\226\027\347\017\336\134\316\355*\252F,\034\247\267\270'\017\245\201I\2735\205^\205!\205\312\221\352\216\270\274\222\276\011 |-E\301#\240ifGA\375\210", 64 },
{ "\207K/>\226\027\221N{?\037s\003\323&S\243\355$R\361\254Q\026R9\2540\231Zx\374", 32, "\314\260\226\231\312\037\245u\230\345]T&\037>\375", 2000, "\010\267\374\351\370\303s,\323\030N\244\353\252e\275\205\253\206TL\340\3205E\004\253\204f\220\362\330\231\037?\204'D\274+\367\363\316\340\340x:\230\254\313U\016\347\023|G?\363\017\037M\177l\321", 64 },
{ "\215\3425\215\223\0224\311Y\251\213\337\240nw\233\343\320\335\244U!\300\023\023\347\012w1\222\011\263", 32, "\010uJ\261\030JR\357vV\257Wd\012\004i\257\351\360\266\303\200/\256", 2000, "\211\243QK\231\376\321\212\322\350\321*\245~\311+6S\013E$\351\217\227\224\217B\006\230\212\251L\264\245.ZJ\350$!u\000Q]\021}`\022\370U\364\224\215\274%\353\333Ys\177*\265#\314", 64 },
{ "O\2649\000z2\177w\372mk@\345\277\270$\231\330\246\001\334\350\271-\264\343\307\342Nw\231\221", 32, "\201VZ\223\246\217\224\263\241AO\325\367\251\031\322\221\200g\354BM\2600\340x\276\307\246zIT", 2000, "\316\341$\022\261\303\322yZh\227\205\310(\347\233\326g\031\220>\011\226.\352J\242\311\274\247\211\010\355\336\220\214,\2440\214\311\241\253I\042^\257\361\336\241\360\177UB\356G^\325\203A\3040,\042", 64 },
{ "\177\016\252\362g\010?|\0168\364*!(\042\343\015]m\253>\012\012/\3471\205\015\321\014jh", 32, "%$\263U\023\275\273\230SxJ\363o\373\241JK\234\252<)\207\026\302\267\215\016C\357\014V(\021J\336pq%\360\214", 2000, "\301\365\314\263\264K\025\305[161\030\015\211\207\0358h\020\231\042\351\031\323\253wC\320\330\351\205Nm\216\024\033\201e\324\037\354\006Z\331\305O\335\272\333\233\243\262\271b\023/\342\320l\177\311L\000", 64 },
{ "L\027CQ\252\262\232\343\237\205\245\344C\014F4\134\210\345\213G\256.~;\240\252<\332\202(\032", 32, "\313\376\250X\267T\235\320\236T\242[\255'\0117\207\332 \2130\242kz\246}\336\321\022_\316\377\323}\340_H.\001\337\327\205\372q\022\355\013m", 2000, "\302\002\343\242\245\365L\016\366\205WD\242\015\330\375\300\357\357\020\206\344j\237\022\002\036\247\265>\350\036\212\027\242\325\2135a\320\312\344\330O\366\335=h\253\330b\216\221\017\031\026\027\233 \260\254\204\345#", 64 },
{ "\013\207\005\265\235\252\020\354d\367\342\006\341\2004\311\021l\000\256\246\241\342v\342\026B\225\333&\214L", 32, "xW\265\230\242\345\002d\230\216\315\347!\232\272\3751J7\3271\011;-\3309:\207\374\204\244\203\244\333\026\011\344\366\134\364j\324\004y4\347^\005\313\202)_\030\217\236\355", 2000, "F<\236\376\203\266\204\306\361\367/\001:\220\350a\366\035\326\374\332\244\304`\202\367oA\335\331\013\330\204\361\353$\347\206\345\231\005\231l\215\013L\351\302\267]\244\006\335\374G\342\311)\245q\301B_I", 64 },
{ "\241\021vc\346\211\270V\212A\302t8\233G\232&c\001_\263\211k\232~\241\001</\001\362\022", 32, "\246_\022\207>\305z;}\204\371F<\200\350\260%E\036\374\013Nu\200\242>\321\234\316Y\232\375\220\036\243C\250)N\375\341\3775\336\357@O\232\304\225gH\351\270\316\003V\364\003\206;\352.\320", 2000, "\360\350\222\354\320\364\042y\245\343W\2413\024\250\221\377\245\325GH\277ZAu\274\026\265\275\231\304\2722.\010np\217\302f#\346Z\347]@\216a\302\177F\233k?\326\337x\301}\230ek\300\332", 64 },
{ "\030\344U\2107\244N\237\230d\255\376\324\213\343l\224\201\325\027Xb\201sH\200\245\263\244\035\005\300", 32, "]\371\274\014\217\177([--\347Z{\021\350\330\301\134\255n/&@N/\177?\2006\2026\360\241'\3025\215\362\253\322\027\034\201mA\353>3\247\366d\327\007g\335Z\367|L\026\234\301\340\016\325\204\261\244i\036\016*", 2000, "\225q\223-\325\221\257:\351t\266\032n\250\357\002\350\003:\020\242\302\236\311\245zi(\333\010B.\311\256>\265Uue7B\030-\243((%\332\362\303D\325\242\314\243\321g\264\201\331\001@\207{", 64 },
{ ".\356\217\343\212\004\001a\027\213\207[,\042\231Xj\221\315\276HB\037F+\372B\251|\265t\026", 32, "\330R]2\031E\351U", 3000, "Z\271\372U\365\246\007\342\272\236\251\271%V\347\027Q\303\237\356\304\242\220\231\026GJ\011\031R>\252Y\223\014\017]\311\365\265>8\370\211\323\014\2027\225\304\030\273\000[Jj\204\015\025c\211\302\361\331", 64 },
{ "\333?\003\246\275\035\007?\027Y\354w\012\344f$\3309\030Rf\263\366\306\350]\332\002\221\346/t", 32, "\361A\234}\315\361C\366\227\177h\325\235'\001\205", 3000, "f\367\374\346\006B\013x%\010]\371I]\256F\042\264\334\233#'\013\271|\347\355I?#7\266\257\253\353\027\217\025\276/G\334\020'\271\004>A\033\233WM\237\377S)\347}\2357\252=\277\313", 64 },
{ "\334\276\227$\003\200y\2567l0kC1\3330\310*x>V\273\021\015\305\246=\250\353\361Y\221", 32, "\364\023\034&\371R\363\231\003\342\350\236\0131\333u\266\314\327\266-8\243\374", 3000, "(\004s\333p/\003\201\333\376F\024K\313\004\374\371\310W{\037\313\377J!\304[\303:\3329\340\200E\204\177\212p\235^\221pu~\270\361Jvl\267;W\225\034\311Lm\371Yl\301Q\032f", 64 },
{ "\221\326\310\317\321-OH\334\006\007P\374uz\213\300\226h\231G\2220E\237\235\323\030\235=\316\267", 32, "ZO\241\0178\261\034\025\311\353E=t\353\331\003\364\243}\005\343\364\006\340\024t\341w\310\303\235\035", 3000, "\363Nm\010\373\315G\216_\354\021\200I\242]\014y\026u\301\346?\273/\304\213z\264\231e\322\304\010\217\205\303\204\277.\234\371\22699L\242\342\313\027\210\316\026z\252\215\235\307\347\361\002\306\037D\302", 64 },
{ "\032\370|S\365\270uTK\326O\353r\255\271\034#\327\307\370\242\262\374\266\312\263#\277J\215\251\362", 32, "\301\225\303\340w\312\303}~\011+\261z\216\320\220c\237\250\037\011\253\300%\267\011q\224\266z\271\025m\266\361|\341\374\301\007", 3000, "\364\037VE\343\326\327v\222\042\300\250\272Mr\036\023\270~o\316\314?Z\321\232c\261\374Rq\020~\032\344\333\134\272\223)\035\005Di\205\345\012;\3076\227\205Y/Z\350\016\236\317J\253\323`=", 64 },
{ "\245\223u0\342\000R\223\240\033e\340**\244\254K\302\031\363\177`M\240$\247\361\317Y\220\227\344", 32, "\372U\371\002\134:\304\002\023\314\037x\372\231\375\241\210\360\224_}r\334\302+\372t\2741I6\035\232\226\036\336\012\211\316\260\205\220\3374\316\256m\343", 3000, "\273\361\376/\034`\322Sy\031\333*\033\134U~$b\362\363\236\361$\313H\022\243\203\306\352\314\375\204\347\223S\246\314\230jB,%\241\000\335\237\364I\000\215\266\300DR\211`\322\271\306\026.\215\341", 64 },
{ "\273G\256e\220\336\234\0325]\177\324\012\204\230\031\322\023<\020~;\347J\355\027\244\032\342\304\340t", 32, "A\350>\021x_\311\275\017\322!\315\376\357\177t\236\001~\355\315Tg\344_\012\002j\2454\002 \233\012&\212g\224\221m\242\315\353\250e\322o\004L\005<)\220 \177R", 3000, "S:z\324\320\361s\320>bW\326\0118\026b\316[\021\265\375\273\021\343\031\205u7-.\307+\360W\237\321\236 z_\347H\256q\255\022\242%\2746\032\251B\224\2446^\266\261\177|\272\010\246", 64 },
{ "\367>aQ\260\374\262\260\020\201%\260[M\244G3\337H\200\025g:\002\275@\373H\364Q\030x", 32, "\321~\273\020-L\224;2\342G\223\025\235i {\256\342 =\316e\376\014\215\221\034\252\235\25762\007\210\3158\257(\235\277i\350\272\011\016\231fb\007\243)\307\376\2409\234\011\034\207\262\307\026\230", 3000, "\307\312QT\215\034\320`\314\352\251]\210w&\203\004\2716\352\251\311\311\261\001\220\276\224\301Y\020\241\245\364L\305\335NP#$]\251\023}z\304\351\304?\214\000\354r\323\000\300\220\003\343@Q4\366", 64 },
{ "1\211\332\336\2713\223\3103\310\247]\376\015\275K\036\233\266\036\275\362\211\343\013\312\134b\306v\227\272", 32, "\134\253eO\347\267\226\220n\360+a\374\362a\314\202\304\221oy\275\020\367\201}:Eu\214\303\2002[\2270jFO\245\237<\241\323N\032\200>\314\330\261V\342\364\361S\243\215.H\012gTu\345\212M\026\024q\236\337", 3000, "m\324)\245\253\323\022\134HK\340v\314\270\315)~Y5y\270,T\3453\366\376\360 @\234\362\006\012\216\210\216.\360G\233.\326\363\253\006\031\277q\303&\215O\203\257\214\002\037\223\365\023\022\303\361", 64 },
{ "v\352_\013\314\201C\025V\042\015h\374\375\272=\361\320\337\302i<\264\275H\002\2622\321\3266\265", 32, "\361H\3748\322\242\2249", 4000, "\025\332a\365\371\230\207\270h\260\011d5`\307%\235\311\354\337r\012P\323\005\214\330\202aT\356\202\225(Z1'\237\246\177:I_]@\327\317\332\266E\241\233h$\312q\217\325\256\230L>\353k", 64 },
{ ")2\223N,\364T\011\236\322\2671\214\240\220\306m,Xt\322\025\241\013\276'/\027\022A}\367", 32, "Pv\327\262\275\253WCP\010\004\341,\227\242\263", 4000, "\206\345\207oIg\320\275\200\246~\243\233S\303\330a(\301\367;wh\212\016\243\335/\034\202\201yN\352\200A\261;\226\277\222\230\256\243\342\021\340#\006T7=\324=\013\231\376\255\216\025\251C\224!", 64 },
{ "A\375*|\023?\215\251\2717\204\366\2310\356\004%\206\331\326]\022-\234\372q\243\371\231\314\207W", 32, "\031\003f\276o\314\232\2038@\307#z\312\222\376\007\376\351\346[g\005i", 4000, "\252e\003QJl\010#\235*5+8\210)A\251\250\032<6\003\215\221\364k\211\233\312\225\356\026f\220\254\303H0k\201\2565Adv\236\247Dt\3735](\3508\2602\315\035V\240\247\013\266", 64 },
{ "_\026N\013=\247\000\330\377\233a0!\007H\0054\021\337\027\242\315\361\004\373\360t\216\203\240qa", 32, "<\252\210&-\264*1\312\334\235q\316\011\024-Cm2bX&\356\033\233\207\001&\277t\311\325", 4000, "\002R\002W\3036\276\213w8\007Y\362\377y~#\347\207+\216\225\2272\271Jh9\354*\016\361\2554\233\263\025\353\267\015\026K\016Y\340\340\377\304\015=iz\341-\275q\315Ed2n:~4", 64 },
{ "\217\243/\333S*\205\365\302\330HZ\235\347C\007\003m\364\015,\316\032$\036\274\225\317\010,\244\213", 32, ":\226<BnxW\025\357\300\377\342}s\014\2531\030\337\275\034\324lj\373\242\134\011\331\212\003hxeX\267\332\372\267P", 4000, ";\005\007\365\022.\212\307GD1\023|),\226\325\225b\256\3054\247\235F\232\033\233::k H1\001\340k\213\3640m2\274\361\0317v\002\215jkv\330\001D\312\322\345\025*\245C\321h", 64 },
{ "\213\25132\207OJ0!'\2722\341r\340x\314\332\330\365g8\254\260\270M\334\302\311\3033\364", 32, "u\204\234\237r#\231\267\314>\370{n\035?\032\006(\257\302\366\036\301\275HI\342\230\303 \230\301\230\226k_2Ur\210=O\3602\253\277s\205", 4000, "\266x72y\026W\037Yu\222\207\244(0K\340\305\233\310s\021\011\275\022\004\213|\210D\002\240S\276\207\000\207v'\206w\271\320\362\302{q\231\355ff\361\374B\022\363\272;\223\316|[\301\217", 64 },
{ "Yf\027I8L\371^\314Y\006*BK\36582A\221\252\030\322\352D_\266ux\377\035\367\023", 32, "\362d\335&o`\242r@\363\2426n}\234\004t\275\213\254\236\020\341\021\304.\042\321\361'o.\002\223[\266\224\233?%\004\337\240\340<\323\267\3039\220u\334\330\242\3239", 4000, "d\315\310\234\260\364\012\230\023\235\2756I\352\305\247_F\260\3602\350\324\2067\353\341-\232\020?\247\302\014\232\253\006S\016\241\320\251\000\022!DA\022\011P\356\372qL\277\263o\303\242\007\347\225\370\331", 64 },
{ "@>\004\006\352\316\314\230\032\255\237\021\276h\037i\032/=^<}}R\313\265\001\270n\267\274\340", 32, "3\245B\276\234\220I\261\336\323\014\353\325?6\360_O/I#\270S\362\331\270\200\360\242Mp\213\361\356;2\316\304\251\227\003\352\327\027\003\271\026\275\230\237\233'\316\003\332j\260\032\014\323\243SO\006", 4000, "_\347Q\374R\016[\274\365~\217(\266\016\364\253\306\365~W\335\223:`Q\301L>\033\344(\253\027\211\372\352.\355\251\233\005\036\225\134\220\034\357'<\031\227\223f\253\240[>\031\344\300+\025\243\365", 64 },
{ "\017\024\253{G\272\276x`\224}\324\216\324W\363\357o\266{Z\347\200\342*s;\3159\036\320]", 32, "/\203\306Y\243\30672\2236\257\335\233\352,W\351R2\004\237n\325y*\3525\371!^r\222\364A\217\311\370\301\3677A#9\212\030q\220r\042\321\031\303\036\003\235\274F\252\134\327XKI\344\370\215\266\316\013\3704\352", 4000, "\216o\275\201\220\001\2209\010\241\307\260\352\274\220\020\004\352`'\3552\372T\204{M\221\202oy\226\223lhIe%\260\325\303\314BX\347\331\316TN\311\332\177\251;W12\006X\376\307\235^\227", 64 },
{ "\375\367\261\310P\032\253\300s\271\362\034Q\000\267\231wh\274[\367N\031\272\313\333Lg\016\233\032\246", 32, "w4\376Oe\334\337(", 5000, "\265\320\254NT0=/r<\341)\226*\376\345\364\004\134\201\024m\020\375Z\216t\212l\313G-\232%\321\272\256\336W$\371\310]m\335\334\242\306\241\367\220\263}F0\216\267\364\341D^\212\251\341", 64 },
{ "\341\3615\215\010Wr\235\353\224\272`%vA\336\2122KT\237t\233\321(\213\316$\340\206\237\001", 32, "\337\362\246Z\225\307J\215c\244\007W\221/m\027", 5000, "z\033/\267\300\001z\320\334\020\034\255m\3321\364d\227\012\247\032\017\370C\031\340$\307TCn\004Y$\017\220\371\274/\350\306\303\002\012,]T\034\301\017\3459\365\252\032\321\316j\231\245\341\322%)", 64 },
{ "\355p\310\241\334\272\230LP\241\235\324\302\312\202\002bm#\375\324\314\266L\212\016\340x\0370\333\304", 32, "\031\3057\204`\205\372\200;\320i\264\027I\007\027\267*-\365K\134\243Y", 5000, "mB\302\302\253l\313x;_y\012{\273N\340\303ohA\210TQ\310\321[lK\015lWL/\252\134iB\224a\265\207+[\016\241\330\005DRam\250\335}\356wZ\006\015\256\226a\216h", 64 },
{ "\240\367\032Y\306a\312*U\314\322\335\022\016\377\213jMmr\244\042\274\257)\267\220\3307\221\033A", 32, "\027\277\033\343S\023\203\300\354nzy\226\254a\307\2146\215\033 p\256\342 \016B1\015C\027\266", 5000, "j=:\035`\342S/}\343\240\311\033N\227\377\327\270|\215\353\241\310\206\042\265\367\206\243\222\315\023a\303\274G\037\245\345\323H`\010\231\344\342\351X\001^r\353\314 &\234\024\002\242\317\021\254\340.", 64 },
{ "\250\277w^\361\217\026b\210\177\306\3461%\252=\266\234A\211\002q\264\357e\232\3257;\036-\362", 32, "\261\363r\305^\275\322\224\3328\261\352\242\275\201O\317\275{\020\263{YD\241%2;\340\352?\366t\300\272h\351W\303+", 5000, "d\364y\350\264o\356\017\320\011\2317\326\027\254\033V\326/\200\276\374\360d\321\265\015\212_x\017\246bE\003\256\337F\265\260X!N\354\031o\216\335O\3278\202\027\222\266\262\356\311]Ok5=m", 64 },
{ "\374;\134\361\232\355\314\370sC\252\275N\372\2732\335\213*\232*\310\352\0312\0047\3758\230\022\010", 32, "\332\205i\265\023\022\002\372\234S\253,W*\303^o\204\316\360\332\353\237[x\030\210\2003eBX\342u\224\363\232Q\262\220\212`$\026l\207\330\302", 5000, "d\021\307\254\221XR\257$\322]9\306}\306aqr\333\224\337M\266\245-\001\2148\203\346\002\032\031ax2\336\230\024W8p\346\310\300!\213\203\241\306|\222\206i.\272\251\026\022O\007\207\262?", 64 },
{ "\204K\335O\134`\227I\204P\241\370G\324\350\313\305\346X\221\312\313S:\371t\341\011\275\327\301W", 32, ";h\002\331bk\375\014\232b:\334\367\341\361h\261\005\266\265\316!$N/i\201\002\272\005\351\212\031<\332Y3A\243\036\303\254\255\317\317\0356\020LD\210\337aU\007\023", 5000, "\002\036\314;\347rW\266\310(9\304\223\015\220\367\334~\3175W\354\233(\372\177n\304)\270\221\352\233\256[\370\320\222\042\202!\265\201\251\262\214m\234N\352\371\314\2724\201\001\272\3643\347\265/d\205", 64 },
{ "I\304\026\242\014M\013\255)\257wq\205\273\337\252\256\2626\233faR\365\262\257\010\010\333@~\322", 32, "\377\235?i\251n\222\2608\250N\304r\353\331\313Byx\236u\212\340\322\243\376y=fv\367\244\303\232A\214\244*p\253\333\134\335\250X\223\320\325R\311\243G\2524\337\344\134I\340E=\253\300\301", 5000, "\335\011\020j[V\242\266q\257^\2139\027XpWl\367G+\224\210\371\320\002\2170\007\223\361s\271\033\374\134\301A\320\234N\357\252:\343\275\025'\012\035]\311/H\341\315\310\303\310}Q\021\375r", 64 },
{ "Dml\351(\305\351#\355\004||\231$h\227j\361\3136\210l\375T\213\315\375\234~dF.", 32, "n\353',\204G\017\242\020\255N\026Io\221\224v$\324I(\246\016\036\035\374[\343\260]\326\021\013ne\371\356\301D\350\030k+\357nGJ\270E\262\035\351R\303\010f\233\246>\326\355|:\2552\003\021\234>dr\313", 5000, "\220\243\001\307\364\032\262\304\372\017\266%r\204;\301!\374\042[+,Z\321\373\020S\014\243s\305\335r\331\350\370\216\277\267\224GT\035\301\030\261\237kge\006\017|z\220\224\274\033\215\201\301\026uJ", 64 },
{ "\270\0170\011\344\012A%\357\323\236(t.v\263l\231\00450?bA\325*?<\251j\256\230", 32, ";\354h\272\035\251\026\346", 6000, "<\220\344\337G\206\302WjF\342\302\323\276\371\3105d\240\376QF\003 VL\024\357\217%\237\331\360g\326\362\224p\322\032\204Y\254\230\227A\2048\201\023AaN\363\264h\347F\222'\232\352\356\042", 64 },
{ "+\2547\326e\016\371\243\360E\373\0228\222sO\203\374\322\204\247\240\320f\227\201\364\371\223\323\216-", 32, "\215L\237\227\342\276aw\036\025\374\246\201\030\010\352", 6000, "oT:^\276\374\027\266\300\375v`Yz\330\206\325[~/\134\364o*hW\371\213\375w&\275\006\011\361\037!j\370\317\337\301\346\234\341\354\225\321\264\305\346iz\313&\324|O\305\317\2629?\022", 64 },
{ "\354\332\023}\256\222\332\241 \362\302\351MG\3479\276\332\334\023\362\271\253\211u\275\200\334/\246\013\244", 32, "\266\243\134H\272\356\332/\011\305Q\357n\371\354\001\020\307\177\333\037\362\315\242", 6000, "\306\231\246\333A\300/\22328l\017\305+\010\037\256\341\202\313pq9'X\264(Z\246m\177\300.\352 \372\20368*\274p\305\033\2251ar\211.\2624,\326B\031\134\335o\033\310\037\2469", 64 },
{ "\327'\333\2626\365\015l\373\244\377\016\314T\205\023\255T\244\217\346\304s\275\370\134o\226\241\000\3653", 32, "\204\340\237\333\347B Zh\352@\2206\262\303\002|\312\203\327\333<\372o\200\035\276G\210S\134Z", 6000, "\334B\327\177g\003$\351\375\134F\266\375\211\212\241\366y\323\375\373_\267\215l[\203\305\370\216\202$p>\241\264\377\032\022\211I\257,:&\317f\245\242w\364*q\037.\347\276\277\275\244\205?\034\317", 64 },
{ "\234>s\026\201USYC\367\314\261\324w\355\264\037\377\236\274\021\3211\006\372\354\201\250o\20011", 32, "'&A<4\356\331\213\213y\222#=_(\361\346\226\350\3564\177\261\024\350\3528 \331\235g?\007\361rYB\003\220}", 6000, "\304\232K\203\301\022\0351\220\354\260\350\311\321\337\023\264\354\256\365\333\215\373\325\201\274\204\216\310=\252y\006I7\250Y\210\204\226N]\036h<\016@\231$\234\134\271\357\307\225\273\331\245\272\2650\357q\203", 64 },
{ "\351\000z&j\354\276\2739+7\300\022\264\327\244\275\345\003\365>\204;\276\217\307)`XP:\345", 32, "\234\365\001{\277}\042\367\222\230\030\327\264\201\016>\241\001\037\336\340z%>\324\032#\352\204\351\212eC\304\027i\205\362\215Sn\226i\215\313\374\210\354", 6000, "?A\017\245L]\214\344\373i?\212\306\252\013Lg\277\015\256\260\001\306C\375\354D\025L\134\337\263\363\025V\336\227\013\237\353>F]_\035\314D\240ES\253\357\210\344\014r\220!\222\220\010\374-\265", 64 },
{ "T\217D\316|\373{}\037\354\234\177S\327\270\016-\231\316RE2\376E\030\245't\005)<\200", 32, "2\316\204\337k\213\260o\273\020-\351q,\220\202]e+\376ci\312\367L'\331\237\035\024\025,|\323\220z\332\211B\314\226\261E:.\002\0238\376\315\320\274.&\233\036", 6000, "\312X.<\3273\237\320\2349\267Rg'\337\230\326~\223\323}\204\010\005\352\035\221\223\244\374\262D;O\2356i0\311\333\360W\203%\321m\037\3220\267\0162\254w\0161\342\320\031u\206\032\370\271", 64 },
{ "D\243\026\222\253]\312\252\020% ^w\024\024\377\312~Q\221\334t\215\377\365#\353\305\340\273\341\364", 32, "r\012Vc\246\013\020\364\221>\227\273DJc\233\2373F\235\001\307G\223\210\260\033\236\361\365J\037K$\372\245\270\370\2402x|\360\033,\002b\307#\305\026\345\2572\325\241\321Sk#\364\035\342\363", 6000, "\342\3053\272\022\221\021F\344AvW~\350\355\314\342|\303\324\315\002U\311\236\315#\2776)\3219\033.T?0\035\264\207\350d\247\247\042w\365\371\262\217\2051\001E}\201\301\034\025\177\016\314\246\312", 64 },
{ ";\370<_m\217w\363\0054hx\333\347:\247\033\337\364\363n\370\042\244\303\014\306G\322\027\323U", 32, "4\331\020,\014\345\314\367~DR7\345\013\2001P\261\273\333\257\306\373\300\033\361\257\256\271\362\302\134\342<\320\301\224\034\034g\033\206\022\005\220N\260\014\207\347\265|\206'Q\323\214\276\305\357\356O\355Gr>\237\204Z\371\354\375", 6000, "\027\304\207\017\213\207_\0117\262Yu\004\012J.\274\307xu\273\372V\004z\243P\007n\363n\222:A\311\351\031\212\2748f\352@\217\347;[@\177:\023nq\260\221n\244\014\246*\361\033\212\042", 64 },
{ "~_\236f\256=\004\026S\320\325Tz\237U\327d2#w\202)Ir\003%\220>$u4\215", 32, "\372v\342\354;>9\312", 7000, "\134\017I=\243`|\314\225\014\263\254K\014r\372l4R\015<\3138'3Pw\214\3051 J!^G\364l\334\037\314\177m\220\247\321\001\307P\317B;\316\037BC\246\310@\250\250\367V\031\223", 64 },
{ "\371\311\302+J{\330+%\236\312\021P\377\377I\235\356\2664\000[\270Q\042\022\357\235\374\307.=", 32, "r\244\035~\327Y\310\266#\364\324D\203hd\266", 7000, "\272\304O|Wj\3136{g_+\347\355j\265/\300!lR+\341\231\2032\322:\032\272\350\331J\347Q\203DQc'4\335@i\347\334}))a\004(\313\255\3220\206\000\346\014\206\206\365\012", 64 },
{ "4\203\215\242\377.\236%\324\260\315@\275i\310C\241U\350\363\3107\337\371\2607\223\036\015:tQ", 32, "y;\315-J\314\274\357\264\210\020\222\007\240\272N\015\331\370\037\334Y\267\016", 7000, "\351\334\341R\305\301\022\273C8\001\000\270i\226\343\304\016z\322d\370_Q\377\2671\215Zu\376nS\245\030Za\374\353\255\305H\024\202\024\0110\037i9\003\363\337\377\304\214\331\207\366\226W\012\307\376", 64 },
{ "l?\242\3334\336\353R\233b\216|C!\013\000\022\274^$xfn\231\237!\037\357k\351\345\374", 32, "\005\276\347\3550\023\213\226w\2313\312\351\253PuJ+\027\003!\255\322\340\006\334__\017\317!\341", 7000, "=\015\237\267?\333$u\274\201\353e\204.Zls}H\344O\020!W\036@\222\362Qp\013\212\225T\274\265\256\024\2221#v\245\254\203K\202\020\355\0118\262\001\333\346\364\332\240\347\017\3227>\245", 64 },
{ "\027\344\376D\230{\335\276\012\027xc\247h\300\221\253\2004\231N\337XVPH\350\177\202\324\336(", 32, "\014;\3008\375\017N\372G\354\331\201\031\263A\027a\351\315\256\344rE\326P\247G\375\2502\262\375\353\344NA\035\317i\212", 7000, "Y\222\200\251;I<\227Q]\356\335\317\263\351\231\042Q\322s\313n\006-P'RKDZ\330\237q\213\332\374c\266\022\352,y6\231\226\001\233\354\027\245k22\312\331^i\026\2764\244\353\306\251", 64 },
{ "\267\366\277\006\327\363\330(~,Wd\275\303A\203\315\016\230\333\327X=*\326yB\364\213v&%", 32, "\274M\257\261N\266.k\356\343p \331wdX\324>\366a\031\362\207\3732\323\302\255\013\212r\003\321:d\220\200PI\010\0029HA\011\003\326\220", 7000, "i\364Q(V\223\200\223\340\007\374\330&H\342E\032\215\2515\3556X\022\215O\365\363\264\247Vwu>\371\320\332j\305\354\267R\323\022\274\232\216\262\361\301\225\3124\004\215=\236\237\341\347\365z(/", 64 },
{ ";~ \241\225\021\325\357\016\232\310=\214\261\3451\270\316\233-\303g\361\216\033Nxz\377\361.\236", 32, "\272x^\233\036p\375\304\204\200\034\306\224\352\307g\361\310\003K\224\276\211%\202\336\346;c\207\240A\021\005\206\255\006%6\312\233G\017,3\230\310\301\202\226A% \0341\353", 7000, "\331\326\014\373X\343aJI\247Cn-?\201B\223\271R\230\015\346\204\350\350w\012Y\373\240\265\020\274\232\000\366\207s\263\360\323\0254S\226i\007\371]\354\314\015aV>\337\303\260f\030\275\214\233\372", 64 },
{ "zt\362W\316\317\032\273\343zzZ\207)ZLm\224\345=\350_\361:\033X\324`\305\306\202-", 32, "\010\306xU:i\204\2235\375\346w6Q?\036\010M\267\275\265\240\223[p\022\255\213K-iKnR\263oP\263\002\036\331\200J\363\365\314\214\036\026\343\304\316\352=a\211\274*I\340.\266\015\265", 7000, "\337\242\214[V\263\350\233\377\006\301\201\275G-\365;\260\241\030\035\355\010\242k\361,\271\344\377bB<\304\242h\357\015\225\313\203\266b\031\322\270\235\376\365\351h\212b\2250\317\2567\254\033\223PLq", 64 },
{ "\004\221\352\003\252\354\313\377UT\030\207\205\362+\004\033\015\2140\004\261Yr\001\340jA2\241\2625", 32, "\256\300\3735\301\013\223\035\221Hl\304mj\340\375\215\254\337\0332\3472\274\254g(.\323\322g\0122\177\347\377\343\353\271t\010R\024\215\331\033\0027e\237\305{U\034k\357\220S\240v ;R\266\177\344p|Tw,\230", 7000, "\335\227U\002aP\016>\270\376g\266\312\211+\305&\013\273\312\262\364\365*\002\227\256/tg\007\341\3777 \351\323\337\031\246\025\227\301!\330\221\032;tX\007\030\004\353\004oX\277j\250\257\323J\230", 64 },
{ "\347\324\310U\204\323j\341\215\317&\325zo\327\025D\024&\352'gZ+>w5\256x\3500\353", 32, "\311b;\237!Zc\350", 8000, "\032\210\262\273W\324\134P\216\315\300\312\325\270\346\032^\031\022\260\372u\313\336\234\315h\005\264\2010\373$4u/\271\311VX\226V\304\261\042B\241A\227}\265jR@O\3651\364!\012w\246\335\200", 64 },
{ "Dn\207\341\204X\030\206\355vO@\340B\275\354\000\023\311\265\225T\237m\013\364\034\247\353\217\316w", 32, "\372\366\303\033\331\272uy\262\371j\302\256\356\334\257", 8000, "\250KJ\204a\031\225\204\016\325x\310?\230\013\2070\322\302\263\231r\264\001\240VR\237\270F#\330\353!\337\330V\256\223\357\262\030\2421\205\037x\272\305L\350Z\031\245W|\360\325\305w\223\020oc", 64 },
{ "\355\015e\250>p\225X\225*\011\316{\311\244f\364g\372\300\336\351=\216-W\324\257\316\373i\376", 32, "\226l\330`I\331\035r\203A\354~\251\373^yQK\322\343.Z E", 8000, "70`<\225^\221|\350*\017|\244\004`\317\221\134\376\352}%\245\324\360\216IY\042\311l|\201\350\230\210{\346\034\271\264R,&#\001\337\261[I\357kBl\336\335\213T\352;\015\024\301\033", 64 },
{ "\317|uV\275\303X\214t\250w\274\335\0028z\376\025\223^2\326F\250i\006\024\006Jm\303\017", 32, "\012\375\360\206\245\022J<\212H\177\267\247\370gr\326\322\251\011\324\331\010B^_IC\317JP\327", 8000, "`n\314\361\221\2161\263%w}y\006-\323\010S\354\240\332\026l)\325\266\023\013\036.\273\000u\247'\273Y\316j,ap\345\206*\264\324inn\022\203tj\260pb\023\210c\306R\234-\320", 64 },
{ "\231\230\221\276\330\2648\017\330v\311\346E\364\272<\037\243'\355\356\252*\210f\006\036\206Z\346[I", 32, "/Ws\213\262\202\020\005n\351i\334\233\303\375~\374\341\251]\227\247aeU\246H\263\031\035\015[\250\316\205\031{\222\016\205", 8000, "T(\016UCC$\370\236\251|\013s\237\023\325G\014\327\376Q\013\306\244*\233E;\014\264sZ\2449\242!m\200\243\264\342M\257\0350\370\357\224\373\262\201K\023\204\334\320\340\016y\272P\311A\217", 64 },
{ "\372\310Z\030\0367\234\257\361J\306F\267\310\216\2069+\013\224\275T/S\257\3554e\177P\243\134", 32, "p\237\036hc\362\305I\350\222\316\022\310v\240\240rE\200\277\241\212\245\330\260\035y_i\374\332\240\304\031w-QX\357\022Q\025\343n\371\273D\201", 8000, "c&\346\353\305F\004P\307\212\3268\356\255\252\225vy\214\213%\340Zz\242\252\301\263R\344qUhOG\334\363\177\203\030\014m\241\306\313\366m<\322\241\254{\334A\007\371\035\0210\211\320\357\042\014", 64 },
{ "\274\023\233g\226\220\266b~\011M\215\240\304:\345\216)\2338O\031\205c2nj\364\332\245\252\275", 32, "\023x\251\256\246*\363\004nr\336\240\357\031\011\315J\210\243:\023f\263\202H\333u0s\323\345\2516i\212\012>d\344\004\231:\217\371%P3\004\333\225M\037\321\036'z", 8000, "\305\373\334\202\333DvE\007\302L\246\273O1\312\006\327\203m 1\227\322\262\275\262$}\343n\377\275\325\034\323c\242\337e\352\247\217\264\200\276l\203\207*MG\245wI`4\261\200\025w\277\374\273", 64 },
{ "\310M\231/BX\015\3022,D\221\343\336{AB\373\305\232\223~\332\001$p%\236\311?\307\255", 32, "\346\237C\3322L\307\240\003+\342@\244\356\210\3652@\231uyajh\3672)\3133k\015\247\011\221\360\256$}G\232\326\344sB9\266\326a\273\276\273t\134\330Q)\2555O\212\204\207K\251", 8000, "Fg\027\253\252e\334-\306!7\300\374\277\235\274\261\350\005D\327\262\302\037\025\016\306|p3+\031\230\216\224\362\370&34\314\240LA\326\010\307b\371\177Pw\310\2605\210\275\305q$YPw\024", 64 },
{ "\243%\302\344P\210:6\271\3316\330|\234\377\325x\317\255\356u\266\204_\264\232\306\221H\235\323\233", 32, "\203\355\374\337L8\346\314\340\310\310)iB\261\313\303`\254\263\356\011\360LVf[\240\372\033\263\031 \237\361\263\264\007\257\323\224\205\207\366)\344\220\270H\216\005K\310\200\256~\341w\352\365m\305\316\231\315!\354\232\270\030\327\027", 8000, "/p\266KV\336\250\270\214\3752\255>\253\011\261\353Lu\022y\313+\300v\201\005^\333\310\370\016\375x\023N\340v&\222\042\353W'\277\014\226ss\240\314T/\020\347\2303\225i\337\255\217\275\310", 64 },
{ "\020\352\211\2704\337\355MK\251\237\315\207w=\345M\253j\013Q\312A\323v\256\212\273\346\314\206Z", 32, "\356\327\312\324\304XV\042", 9000, "<\252\305rA1WHK\030\310K\220\312\214/\225\222#\211\020y5J.\373.\375\250\246\344=U\326_\322\205\303\357\316\212*2\252\1347yP)/y\330\030q(;\275\222\316B\345N/'", 64 },
{ "\246\200\343|\000\363\320\004c1/\252 \230\027f\221\010\300L8<\315\333\014\000~\013=\224m`", 32, "\344h\347\244\325\331\22483=Nft\360\302\261", 9000, "\330Y+Q\337\302\005\230&\257\271\201\020\266\346rXi\310\342\234l\365\374}\242\365&\377\214Fn\240\315\272\026\322\326\2318\332\325\001\362\007G\316\346T\001\225\273\377\042\345?\377\330\302\361:\354Q\270", 64 },
{ "\300^\277,{\327^\347;\023\366\331\344\214@\224\226/\231\304z\212\024\264\343\305u\353Y\301\305\031", 32, "e0H}\001o\0238|<\317\200\275\255I\300\2211SZ\350\024\010x", 9000, "\346\352\302\366Gt<\261;\010((\022\360\232w\323\024~\3107\323\001\003\331X\006\245\235\364V\302\000\233~9\370\225\340\312\2120\011\362\274W\036\272\270\3168\311d\366\361\270\254E\363Zg\001\326\227", 64 },
{ "\302\3170F\365\303\367\304\340\000\332\3223F|\363\231o\336\315\010\334\000\327\225,\300\205\214\301\272)", 32, "\017\015*/]\217\334\262S\312\317\235r\371m\225\273\013\215N\360\016\324\003 \257\222\315\371\014\326t", 9000, "Q\213LROW\365\360C\375\251\233\235\237\273f\370\333&Qv\035\231bj|\2621\134\365\213\254\264\221\377N\321\305\036\272\236I\331K\375 \276\212\177R(T\370\030\376\322\201!a\230\014g2\330", 64 },
{ "VW\226?\011\206\237\332\316^\201\211F\363\242#\2414\260\034f\253F\020\015\356\022\026\030wy\207", 32, "\134X>oO\341\2221p\023\236\217\357\355\213qc\222\237$q\311\271\224\317\005\354\243\010'\365\246Q\371)N_\226\353m", 9000, "\310Z1\202\257\017\276\0118bF\322\213U\222~\243\033\323[\324\371\365(\344R\363\347\313\342\255\033\320\316\374]\207\371\004\353e\311+\316`%p\236\327\326o\017\235yu\234=+\216\303\3420\246\333", 64 },
{ "\265\321\227\226\355\037\225\225f\000`\331\364x_h\261\236\302F\356\277\305\203\337n\324\242XlX\276", 32, "\353\325\230[\314*\371$\233U\335d\302\356+M+\217K\255:\305i\217\315U5dmm1r\034`^\033\200\311\366\323\244\254\134\354*.C\261", 9000, "\203\205\206;\334K\261)~\005a\365\232$.\246\250\333\351\036\237\227T\326\007\266\277\337\267\012i\252\277<v\304j\372=\202\312\335\262\355\200z\004\215\216\037_$\334d\020\323\2272\316j>f/\367", 64 },
{ "g\342u\261\360\205W\253\3757\224>\2007\261$\321\326[A\030Nl>\300\255\270\310j\230\000\317", 32, "\205R\344\134\355S;_$R9\207\216\351\035\355\344\246\230\347\305\225y\365'\264\273\273\002\3004\3074\321%j\237\246\352\345Y(\224\334\371\274\012WL\232$z\246\331m\020", 9000, "\042\307\336\011n\273.\027\006Z\200\335\244N)\210\325\177M\000\270U\2167\007\331\217\002u\262\030\257\223\325]\371WI\207\226\211\331s\007.\224P\3330\023E\273\3256\324\2250|h\332\134\306M}", 64 },
{ "\205\222\255d0\015\236\365\024\002w\355:\025Q\206(\000\014\315*`6\343\233\217\377\036\227\231\001\310", 32, "\031\345\002\252\206*\014\226\235[\012\333\340K\207$\010\010\332s8*\346|\245\323h}^\202`\233\200\2460\304H9\031H\2321x\013\033\363\322=B\223\224\321\2335\204\262#%\245#N\236\205\360", 9000, "\376\304\247X\265W\252\204.\025\177:\360\227\0259$\005h\205\364\030o\324p\023\206\006\325\302B:\311\252\240\015\253\000\370\313\007\002\276:\037/\001\240-T\241\221\007\247`Z\012|M\027\316\2303\004", 64 },
{ "\262\332x\2240\1348{\351ow\377\220.\005\010\351\313\365w\310\006\042\312O\234\256\254I\225P\236", 32, "\003\262\327\213\033E\352\255k\031x_V1\330\217\232\333TCjCG\257\222\207\302aA_&\303\022\242T2V\301l\230U=\204\255\013?9\212W\217R\254\246\264J\310\243\340\215\276\324\264\211\371H~d\334V\0048\210", 9000, "\2428\360\032\336\004$\015\303\304\203\271/\302\252\361\204\366\314\201\231\324\323\340\031E\355\205\372\201?JX\264\256\177\242L\362\001oc\310\134{pO\232\234\200x03\270\364@\346\134\214\330\202\010\254\350", 64 },
{ "`\210\003\226\023\271\363\251\376u\032@4R\227A\233\177\204+\331D\302jJ\035I~\033Va\334\306\134\337\3708\3159\374", 40, "g:\354\200:\353\237\314", 100, "\247\204y~\264\003\374\263YbJ1\265\256\370b\020\377?\034\240{\014\275Z\011\347\213\206\356\037Q\010^\306\207Q9\021\374q\270\242DI\034-\232o=\212\202\134\037+\305pB\2152CI\275[", 64 },
{ "\330\3067\035\364 \2267\266\226]\315\242\015X{\270Vn9\260\277\277\375a\014\251k2P\003f{Z\037[t|o=", 40, "\375\276EL5\306\235A\371\032\272\364\014\340\014\374", 100, "8\255\030MN[\002\3162\250\340\323\262\011O\0374\012V'\303a\010\026\372\337\022p\002\321*\032\255\205\217\377`\264\015\255\217\005\300`\352\261\313\370`\217en.\252\205V_\331b\261\302g\333\273", 64 },
{ "\247\3113>'\341Z\226\015E\235\221\200}d\217\021\263\134r\205NX\241\366\014\257\243\261y\212r\263D\272\243\021\207\235\216", 40, "(\213\353B\221\216\0302\003R}\310}\331\006\343\001\333\326\236\017x3\005", 100, "\261\201\255\301\037\027-\004\242}\361\027\264\250\210r\231\274=d\010\371\2662\357\017\233d\224\230\0300\356\273\264\245\212A*%\333 \326(c#\273X\026\312\226\317\031X\257,\353\213\307\254\304\337C\326", 64 },
{ "\024B\327M\362\134\210]Iu3\223\322\277\361\3646\276H\263\030\2348XC\271\206d5\242\231\263*\334w\317\015\376\002\014", 40, "\321\357!\351~\005{\304\267\313\205\027\005\307\232a\367\212r\302\306\032\231\26567\246\356\227!R2", 100, "`\236%\333\327{\331~X\022m\274\337\203\257\326\012\247\021\326\270l\3271W\244A:T\261\250\252n\230\327\231\305v\024\245\371\377\346\007\305\204\360\215\252\267G\007\005_E\0221\223\340\3714\243\220\303", 64 },
{ "\002\325\230\270\245\022\320|\042<\274\236\243{IF\255\2123~1\324NX\343\212\002\230+,\321\253\320\334\246\273\264\265\215\350", 40, "M\361.*\033\362\022\226*k\333\225B\320\377\266\011\307\034w4s\274\316\217\034\221W\373\003\256\244\210e\260\242)\206\254\223", 100, "\371d\211g\2024\010\257M\023f\177\247\376\000e\036\353\372\375%l4\272\370\026\343\330\240\022L\214y\025\235\360\0213\014\375B\326\331\300G\336\212}\342*,\254~\001B\204\370\200d\254 \303E\367", 64 },
{ "\243\035i\361t\264\370\31688\017\261Ph\267\224\271\357Y4\035gZ\2631\021\253\236\364\311\031E\364K\240\313xi\253o", 40, "\313h\035\345a9\260^n\335\014\337v'\371\330D\215`\332|1\357\023\253\215\213X,\215h\306X\244C\232\236h\256\372\247\020N\275\020d\360\005", 100, "{\320\345i\277g\336.\253(|\256\347\302\022\260\330\315\247j3\217\257\236\260\302\024\204\000,+}I\202Ow\321\205\013\315\324\001\332\331\003\367E%C\205\354\345\366E\314\351\032\340\314\2568\233=#", 64 },
{ "R.\220Q\306\005\331\013_\274\263\364\305\363\253ut\215T\042\354}\011\014\256\254J\245c\353f/R3s\342$<\205\366", 40, "\042L;\375\240\241\376\322\232GY\375\004PV\261\331}\305#d=\210T\261\233\246\322\377\365\350\365\304\202\256\264\003WX\021=\273\247;\007\215\377Y\360\212\004\324\2525\260\223", 100, "]\370(3IL\232v\357\336\347\350j\3428=\337\205g\331\211=w\023\373\311q\321fM\372\134\037o\312\270\207E\232$\246\224\0069q\245;_U\256\207\246\224~\265lfX\217+\241\177\012\000", 64 },
{ "\005F\364\361\037\250}\236\013\315z\330\022B\011U\222\372\236Z\033ZH|G\313j\247\263\363\222\350\362\243~;8\203\276Y", 40, "'\006e\223)\331-D/\272>1\236\236\202\360\034\015\253\305\312\036\202;\306\254\036\313)\235\011\217\270y\235 9'\355cs5\311\300I\042\235ls}\202\364\002\303S\223L\3528\262\305\001\203\011", 100, "NY\261\274\311\225i^\034\326=\353\301\204\312\357y\263r\031\234\240O<%\253\221\022\321\264\015rH\311\327\302\201yi\304\360\3748z\036\022\205\236W\026\023\006\256B\227mJ\234\231\263\253\3368\202", 64 },
{ "\006\336\254*o{\322\024\361\337\007S\353\357\243\370\244\033\261\024`\3159\311\001\027:\342h\275)R#_S\030\217V\336\024", 40, "\001/Wmb8\260\026\246\270#\346W\360\277/\347\177\233\322t%|\226\334\261~\001tJE\326+\204X\304\324&\036\134\252\004\362\020Y\347V\245\015\023\332EQ\345U\002F\321\202T\012\356\313\235f\206h\356]+\314\324", 100, "I\177\227\177z\320<g\030\252m\320\377\232\350U\255\333\271-\033\377\001?\302\021\012\016\377\317\342H\337X\0059\312r\346!<\362\023\264\275~\313]l\373\333\231\000Q\373i`8\016\017\255!\001\312", 64 },
{ "\271\341\030C\026\343P\310\2118\241\324\361X'\023\251h\2657\300\276t\032'\034m\210\014\350\217\345\227\275B\177\035u\255\214", 40, "\263\305_\247\272\021A\323", 200, "\247\225P5\302)JX\034\322\3619\251u\325\245\224\23119X\365\364K\037\321Z]\363O*\227\034\350<\020\036\331B\327\346\345\310\0214d\325T/\233\351B\134\371\304\210\362\236 \327z\321\301\014", 64 },
{ "\350\221\234\275\355Q\240\246I\234\215\374\264#\204\352(abs\220?\017\221\331\340\277\243vt%\366\334\233~n\30314\321", 40, "?\223\034\316]\373\026TS\035\231\031\220\323E\375", 200, ">\023\255\352\036\233\272\216\032\231\236\236\220\034\304\263\006x\212\004\340~\371a\034\375R\254T\321\237,\351>\367Be\335\020d\343\363\216\271\011!\344\345\271\325u\006Jdv\004\350\277\301g\007\211_\336", 64 },
{ "\011d*\215\352[\313\3051?\362\360c\277?7\1771\306\221\271\022\275\205Y1E\240M\214T\225R\363\010\3130!*y", 40, "\310l3\2262\346\215Z\223\005\236\302\241\025~\276'\334r<\030Ou\273", 200, "\022\251\266\330\274\244\022\001\042g?\014Q\334^\032\320\203\004\023\231VI\236\351\032\234\200\220\272}/\255\356\322C\342\315\340mR/\024\003WvC\362}0\204\274x\315u\216\014\203\337\353\0350\216\241", 64 },
{ "N{\366HE\323\251BA2\337\035lQ9y\377\206_\354\217\210\210\237\301\277Tm\234\001\033\237\200\261:\314$\007Ro", 40, "\226L\252\227\244 P\217\303\022\353\351\357u|\367X\206\134h\354]\006\257\247b\277ug\266\371\305", 200, "\331\343\322@\363\303\324CF\204on\225pD1\260\342\250h\337\376<\376oqrOrC\260,\014\330\234@ \363\236v\206\201;\335\020+\253#\232x\267-\035\035P\010G\277\322\200d\241d\337", 64 },
{ "RjMU\235u\300\005\020s\3026\244C \010T\277\204\025}6\221\260t\030\347\262y\246\004\004\022nP\003E\224B\275", 40, "\361|Oc\337\006\334\314}y\037}5'L\363\3776(W\331\015+\005y\211\036X\006\33121\012Y\017\011c\016\353\025", 200, "<V\312\266\223u5\270\312\347H\210\237^\213q\031\042!J\257\320pXe\326f}~\035\322I\247\313\012\307 \0022\215\224)j_\365\336\245\214S\244+p\345[\322\231\236\277\345\272\034X\350'", 64 },
{ ".\316\012\350\042\022\257=/.\310\354\276\336K\326A\233\223k\213!fb\242\371\230\312\276\026\316\016\361\361\134\246\206}\234(", 40, "\235\225\015\206\365)\227E}\330P\262\013\322,\010Px\034\020`5@\325\373\316\266X\010\200\177\307\367\260sK\316\352\226\363\003\300\253Y\200\363\253t", 200, "\255\273_\317K\352/\277\221\035\005\010\365L\216\031\246\206\253\251\23277\36755\200E\367\311z.1F\244\374Z~do\335%\312\217\272oVa\273\301\323\000\376\251\037\326f\306\243\134 \225\212a", 64 },
{ "Y\244\247|\340\205\376\355\004&H\253\342C\372\257\252\025\376\260\225-\320\264\257I\316\256G\327\231a\271\361\022\324o\257V\257", 40, "G=BUR/\221e\200\374\316\371\350\027\0341|\363\134\241\254\213%\003\042\321\253\370m\243V:\024\262\011\270\347\026\331\321\375R\271\222\025u9[)\364\357\357X\227\210\305", 200, "$E\233\337\202\243\311\237\356\201U\332\222\364Z\240\337n2\374\250K\202~&s\306\332\011}b\303\340\353!\250\313\311\254\324\350\230Q\273o-`6\333\207l\035\261}7\331G\365\237KT2o\033", 64 },
{ "..m\365n\264\333\204p\263\221?\362\372O\301~D\227U;\234^\036\300m\363uZ\361~\201\363\344\030\251l\337J\361", 40, "\217)\332X\242\356+\313*\202\256\021\353\232`\314\310\277\267jk\255\274\350\275\267E:\313\255\274\347\177 \033#\205\235c,\216\223\241\377r\262\336\366n\247\375\024N\322$a`\304\022wk\200\020\303", 200, "\035\363\013AGy7\304H<?I\036c\254\026\334fMb\276\304 X\210\267\2552fS\223\244i\210\242\356w\364\015\211W\042K\232H0\001aH\336.\370\003\251\001\225\212\376O\314u:\254V", 64 },
{ "\347+$\314\2676\026\335\340\275j\342*\246\313\245=\323\226\320}\367[\335)\226a\336q\365G\350\337MI\274\223l`Q", 40, "N0\357I\034\2230\216U\320\267\013`\013\277\216!\032:5\261\024\004\370U\260&\202jDN\233l\271\337\022\217\350\327\272\263[\272\351\004\313\304G\267Q\366\202\275\350\332\372\022\357^\265F\227\272\332\337o\021\205\231\261?#", 200, "mEe\243\363\344R?R\035\316\212C\033*\351\322\221\210\037\177\221/r\204\022\313}\273ju\227\275\310\304\362\206\263\011\233\234\012\227\300\225\330\331\322\317N\244=\217\134\201\004Uf\042\002\233\352;\032", 64 },
{ "C\267\015\266Lr.!\374\322\330<)\373\221i\226\253\033\272\267C\027\034\005H\350\247\204\020,\264.<\364\211'\015\310\274", 40, "\323LJm\012t\260\336", 300, "2\257x\276`\036_k\257Lf{\232UyO\312=\306\310\036n-\235\321\335\330\037\334\202\376@Z\200p\236\037\251\253\021\031k*\201\373\205\3369\321\0278\234\371g\357\216\350&D\325\012\373=\022", 64 },
{ "6\362\372EM\003q\252w\004\001\335\303\002\0256\271\030\306\3062\324\020\373\026~\010|\264\2616\263\013\240\036\270\304\030@&", 40, "\036\023\276\377\200\3138Eq,\226#>\037^\036", 300, "^b\177X\310\203*\016\340f\343R\233\025\025\222\017l|R\203\227F\217\311@\261\207\325\013\273\042\375\260\256b\333\036\221\220\026\377\223X\336\243\217\235h\006\3110\231R\314\247\3401q\365>dA\010", 64 },
{ "\350$\307\023\016\225\330\3677\315F]9\3447F\306\036?w\000w\266\266\214\244|w\354\204*9~\331y\262x4\237E", 40, "\023*\200k:\322 \321O\214W\374R\223>\232G\202\230\223u\231.\266", 300, "z\223\217\302\200\321_U\300\304W\241/a~\367X\24385\244\207\224M/\255,\232\252\366C\377>5\312\210\273k\001\377\353>g\204\032>\017\303\207#1\021\373\257\031(M*\014 h\334P\370", 64 },
{ "\341\320\235C\357(E\316\332\224\353$\002\330\352{m\215\310l%\255\247\035>fQN\270\217\001\211\355\265@\2036W\263\210", 40, "\232\001\020\307\220Q\244C\312\213%\0206bK~y\272Bh\302\323D8OE\205\323\356\003\235\300", 300, "\227\366^\335\033\330\023e+w\242!B*~t\226\326\322\201\020\251\025O\336 \302\354\355b=\3732,\304\311\025\005y\032\376\005y\347I\031\260\336\360puq/\340\235\325(\337\023\344y\225Hs", 64 },
{ "E,\342\3250\250\275N5\307?b\016f\215\200E7\3260\2062z\026X\243R\245A\210R\014\262\240r\305Z\303\211\042", 40, "\213n0gD'Y$\2742\031\330\027\247\253\343Y\345\263Y\335\354\270\0275\205`\015\227\002\3527\336\367\354\337\024\204v0", 300, "\305\042\312\304t\351\241\223H<~\212\257N\201\022\363\032~\231\241\373\300L\344\333\302F\272\233\306\037\231\260\236\243\326\035\370lOM[v6N\214\042\362D\224\001\372\316Z\372\220t\177\301>\020}2", 64 },
{ "&\3372)\301\232E\222\030&{\236\272\013\210\011\034%1\352s\310\341^\310\251\352\177\257l*\3071}\343\011\317\377\012\221", 40, "\332%\357\310,%\202/Ei\2600\0219\256\305\225}\344F\273*\231\272\317\004@G\334\242\311\270F\0232\240\264\003\234JL\304P\2627\271\234U", 300, "\017\356\256\272\201\031Kf\300\365Z\246\362Z\2765b\346\272c\011\222\241\033\337L\356\323h\034%\001\270\020\016u5\251\030\013u\343%\361%c\005d\242\340p\224L\255\261\370\025\216=9S\225\027X", 64 },
{ "\023\225\225\225a\205\3544\023J\002\345\037\024\217$\252P\240\347\025-\206\0266wn\353*Jx\327\323\213qo\322~JV", 40, "<\225(\247f\351\21182x\003\036Z\333I\376\347\211\037\340{\241\0017jPQ\037\206N(\365\354$$\001X\253\3713\253?\263.W?]\260\327')\347\200\240%\354", 300, "\362wD\306Q!\204\002\0347J\363\256\214\210\3030\266\007\3170\323\346\375\301n+\300\010\025\345\010\0316\363\344%*\377\360\260#\212Ut\324\347\334;\011\356(&A\207\0332\013\320\3060\367\271\333", 64 },
{ "\267\244\274\263\273\230jf&\202Y\220\226\354\216\363\010\031\206\326p\363ux\3536%.~<\213\324;vCi\0217\004\311", 40, "\230\250\225\200\265%,\326\017\035?\274\237{D\272\224\303\3037ea\205:\042\022B1\272\017\275G\263\317\344 \306\204\233\244\273\254\235m/1\317\223\344Uf \273\372.\305\306?\005\011[\217\302p", 300, "\360\214I\303\037J\034r\211\204\333\023u\217\274\134\373G\024\327Z\016\331\022\210aOM\014\212\226\240\257N\215nH\266\343\006e?X\244\370&-\313|\252%\353\351{\345\340\004\345\271\004Q\314^0", 64 },
{ "G.\325\033\317\202j\005\253z1\227\033\207\2061<0\003\311+\3337L9\264\004h&\027@:\030H\331\313/N\270/", 40, "\006\032\324w1\247)\271\337H\335\312\316\2467\214\042\207\245\373\361\250J\207\354c\253f\371\001\276o\343\300h\010A\300\366\331\301NI\255\322\270\350lf\246\020\257\263m\231\311H\3175{>\257\223\313\262Y\245\254hghv", 300, "d8\023\233e\020}\215\007\036\002\367H\003\367\336\010\260\364\255 \360\200\223\265\252\203y\315\322\013\252\376E-gi\000IY\325\367\353)\322\311g\023\301\245\245\134\223n\211\324\245\301coXc.\320", 64 },
{ "\302\347\272e\366\307\3749\015< ^\330\275\344*\370\033\274_\361\227=-\350d\340[V\025#\225\255\017\252g\325;H9", 40, "\272w\001\242\254\207\370\351", 400, "\304>v\275T\012F\025\366\200\362K'\263v\211\232\267oM$\337\134R~&\262\205IM\300\372\3549\014\177\267H{!\241$\234S=t\355T\247O|?\310\247U\263\326y\000\221\214\2404\266", 64 },
{ "8\217\216\363!u\361\212Kw?\134\251\346\316\012\000\0055\042g\230\010T\374\365y\312\213\333\307z\022\363\313\330d\354\226\325", 40, "\331\326\007\325[\226\374\225\250\021\225\214\012c\240\310", 400, "\016e\302\330?9\223s=\3620\302X\221\336==v\365\351iF\340\227\223;?b\005;\010\201)\327\262\006\247\0077\345\224\250=\026\341tP\303-+M\025\014[\367\007\022w\013k\374\032\234&", 64 },
{ "\027\271\230\271\345\254vz%`\006\201P\331\3222-\323\374\222[S!\003\011\323\231\262+\325\224\250=|\277 \201\254\201_", 40, "\010\214t\242\242\352\314\021\304\320\367\322I\3120\314Ry:\334u\354\272\370", 400, "\334\230\272\330r `\333\030E^\250m\023}\302\022\025th\024\364UC7b\001\301\023d\272\265\207.\037\377\371\011\362\344\270o\2101Bk@\340\332\351\253\257yp\361\377\331v\016\3105\020\363\317", 64 },
{ "B>\351\352\241\021\035\330U73\250J\266\243\374+\340\306\337\263\316\377{U\331\250\304\033jy\0032\216\021\211\345N)d", 40, "\250,\252\367X\257\022\264\331\373\042\223\226Z\021PQ`d\021\371\201\227w\374r\2028\033\3662\377", 400, "\315j\243\042p\000\266\016]BH\350\270\356\257\236\013\214'\347\347\001\010\341v\357\271\355avY<Q]8\337\036\343\017\035\247\2306X\011#\210\315i\036\032\265T\306\320$\226k\276\322\305\262\334\257", 64 },
{ "`\320>\354\250\367\032\260:dRv\377\134?Abn\262\026\020\010\371\255#\227F\035\326,lx\251+D\372E.\263A", 40, "\350\3618b\270\207+:1\033\366\322`\321,\240\244/TDD\315\362\335\354\231\327\333hI\365~\270\271\244\374EU\237\270", 400, "jY\035\262\337\213\327\204\367\352u\230\024\020\021/\027\261\021\037D\2740\354\276G\035\222~\037\3065\201\002\350\042\371\276ye\020\253^B0\234\237v\363\252\267\221\305\373\336\016\034\351\236\243\215\375\236\305", 64 },
{ "\270\322\236\314\345\206Gv@\370=\210\267\316\245\215!F\264\211I7\032\231\225\360?\020\375\256\371\0020V\204&\134\273yk", 40, "\265\257\037\360V\302\357\200\373\024R1X\211!\362\327\027\275\134>X\371\334W9jt=1\331r\241\0138\265\344{hWe^?rZ\301\305\375", 400, "o\212\230=\031.r\255\037}3Q\3413\237%\320\323\362\260/\014\377w\312\370!\236\335\371\010\377\240hR\252\254\016\000\030\332\004\243\305G\371\024<\025r\243X\312\371\320p%n\340K\317\346\2710", 64 },
{ "v\203'\352\031\202O\037i\246\205\355\211^AW\331\251g\257\356vw5\003v\247\304\225\310\232\206\373kqS\360'\252\255", 40, "\252\275\277Tw\316\320$\304s>\372\236\264\330\354\341\314\275\315\034E\240f\001\330=ZK\001\026b\317\333\007\224\230\272\020\366\314\332\027\265\221\033\244\034fA\323\214\032\227\010\225", 400, "\327\262\021>\322}w \177&\302\357\351\356\350\345\217\300\004\24057\0254*\367\365a\200\263\353\000\134h!\226O\243\202\231I+\003\006\244JK\210\005\336\363\032\352\242\206\330\266JQL\013\356\356\307", 64 },
{ "@\257T\377\244\313W+}\242\241gP_\252\2466u\016U\335\230\344\210S\323\030\01608\237\351`\320\332a\3702t\327", 40, "lB;^\004{\301\301\2000\367\227\226\026\222cQl\322\225\374\221\351\277\134\301\023,\002_c[V\333\010z\271\200tQP\237;\277\213\265C6\3474\361=cs\267\200\247\012h\253\233\017k\025", 400, "b\016\304n\314l\007\256\316\042\300\033\006\033\356\305@\237H\356s\026u\276\013Z\016%g\340\344a\0330W\004\244 \241K\216\255V\345\360;\026+u\340\374\006$\201\371\004X\274\332\360D\233s\011", 64 },
{ "h\026\013#^#\3608\361\241y\335\311\364\257\251\0033\202s.0\032I\254\256\250\305[L\332x\032\035M\275\373#41", 40, "n\272\237\200{L\204\300\313\253c\332\220c\225\325\024\243\266$$\364s\344\271\327\270i\245\375\002yu\245`\250\042!\341\200\025\017\203w\253\002{9i~Y\337\316\215G\222\273\031\200\005\221)\370\004e\200\313\2531\335*)", 400, "]J\212\037\332v\225s\225A\361\336b\015`X\010\301\352C\225\020\333\215\226\354\264\205/\034\033\345Q\316\310\311\335\025@\323\376L\373\365N\014\207\333\377\373\030c?\263o \270y1\327'\011\275\300", 64 },
{ "\037$\023\200l\203\315\362\001r:\251Y\265N\006\033\223\177\266\276}\235\042.{\340@(\361\042u\250\364\374/\017\225\203?", 40, "o'P\035\276\332b\015", 500, "\027+\241\256=XP\216\265\203C\372\367\026_g\042W\277\042\017Q\200\260\363\021\031\370\017\354\214H#\247\233\012\244*\277\325fi\261\344\005\026\206\262v->\344\340\332\367C6RpF\273Y(c", 64 },
{ "i\356+\334\331\004\246\024\364t\321l&\254\240['=B^\351Y\222e\332\267\227++\320,\351\315$\025H4\036\307\305", 40, "\232%\344]\343?\304T\007\016\323\211\341\264\350\003", 500, "\376%\230\250'\221\371L\315\021\017^\256\034\273;\335\337\360p\305k\331\256\370\021\371\230kZk\234\353\026\227\340\313{\203\206r\032\034\034\374J\025\352\015\335 \373V\365\347\024\005\276*\363\021\331\3446", 64 },
{ "B\276J\227\335\347dq0\204\341\373\352\264v$\311g\306b\314,\252a\030^,\333\202\327\353(\245l\240\313\267B\243s", 40, "]r\312\3217\237OJfZR\274\021\261Q (\244\241\013bm\306\001", 500, "\020\307H\233\2222\307\276\233\134\220Sc\226&\230\273\353\315\265\004*\253\030\222\031\016\203\022`\242\360/}\301z\226\270\231L\203\346\034sh\201\216\030\201 \223j\341Y\337\350\366\256\347\301X\372V?", 64 },
{ "\367\373\350:\033`v#:q\264G\032\235Y\3419(\211bK\002\012\317\237\217\261\277|\367'F\225\346\322M\262oO\032", 40, "\017q*\266,_U\373\216\351\001\035\3237u\354\251^r\022'X\237\206\230]\331{@%\301\311", 500, "\211\366\134\340\227K~6!L>7(#\032\2176\230\000J\344\321\013\371A6\206#^\350/N\021\341\365V\211\230;\266v\013\327\000\221X\360\025ag]\344\011\002\322\357\363\254\270\324j\333e\232", 64 },
{ "`r\253B\0145\341=\303\240Yp%\023\256\003\232\354\212!F\246Q\232\207\224\337\347Z\216\261\235\244c\332\242w\206-\337", 40, "Z\216\370\311}==\002\367]w65\340\302\340\221\002\032@\302\210AP\273\215\335\322Q>\011I[\004\231\241\310\246\022\322", 500, "H:DD\322bY\205\003\134,\367\345\265\352\021\331\375\007\261\2251\334{g\336\022bso\015\203\277\312\264)\005\2372(\335RK\225^qM]\2626j\266\324\006\023n\371\321\340\260\354/\357\225", 64 },
{ "\036;{cq\252\200V\205y\367HY\042\373\323<\235\252F4\31601v\341\235\005%\204x&\177\316.\222\032\214\357>", 40, "\023\321:\305B\361\352\322\345J\042\202\333Q\214c\007-\026MN\352\252\231t\205\012Y\365\340=\212\374\245\275\021\177?g)\006c\0104%6A/", 500, "\250\303\354\237a\347#'\230\270\035^\357\275\231\254\000\001z\315{\312@u\365s\310x\326z=\007S\213\336\026`}/\324\220\275\217\232\323\321\273Z@\027\317|\223\011e,2\023P\021^\325\000b", 64 },
{ "*z\225F\206\0151/t\213\026\2309~\313\313\374\205\235*\342\026\003\267\347\223\333\034:N\2051\001O\3031\207\375H\265", 40, "/?\0267\245\223\272\370\225Ad\214,H\332\265\376'\377NE\035bP\342\311\030\202\031\311\014\340\276\266 bW]\373\255+W\316\020\211,\277S\035c\020%\365g\350\271", 500, "\031Q\035\3656\223\042s\342\21538\340\235\226v\014\357\260\013\363\201g\241\271\226\213\220\316Zj\000\306\000\220\021V\027\250\230\302\265'\255\235\334N\230\355\251\326&\207\307;4\2550p\377d\315\342\222", 64 },
{ "\247g\321K\211\224K\024H-}\217\260\373\332\325;L/e.\307e-,\013\263n\255\271\312\213\231\241\266\264\264\010\220\177", 40, "\026\227\357\264\367\222d\234F\311\363\371\316:,\366\007\007\240b\272\361\244\215\007U$PW\007\321jGm\033]M)@\326\234\341K~G\005$\024MU\266f\333\247\374\002_\34273\020\301\036D", 500, "\2177\022\2258\227\032v\042f\134\2542D\314\315\271\320\315\026M<\2708r|@c!\351E%\035@v~j\245m\276a\367\364\311\237\016\370Zy\352k\230\322\315\355a\3212\367\252'8\027\010", 64 },
{ "1\010\366:\322\246\037\312\007Jc|d\302)\233\366\134\224\351\272\237\3669\305\247T}\245*\3402m\241\214\035\365\341\274U", 40, "\260\042\205\205\337\006\014\3020%\243\020\221J\361\352\337\003\317\352-\006\303\032\353\333\030:y)aP\003\206\376K\313>\332,\340\202\245\331\333\034Hd\342q\315m\002\256M@4\340:99o6\013\3201\253\355\347R;\022", 500, "f_\215\220\321\254\317rr\306_[\007H\267\334\332\271P\270\220\360mbZ?\012\220\322\357\351e\330E\250N\251\256/?z\261J\276\013\226%\224.4\327\367\310.\320\324bk#x\250P\205`", 64 },
{ "\205\310\260\004\314\016\205\266\337>I\276\336XNQ\371\2057\001oj0|\033\022u\255\233\250\307R#\220_u\021\350\222\317", 40, "\321\234C\254C=\026\005", 600, "\230m\022Q\007v\331W\031'/0\0336\235\241\254g\231v\367\244\013[8\007\016\351\200\371\305b\203\231r\241\324\363/\246\256\222\234\001\223\325\231\267\245\005Pav\241\257\323\265\254\355\134\250\224\033\245", 64 },
{ "\032G5\256\134!\321-\371\005\331b3\321\321\351'%v\361\316\2378\213\356\032{o\042\220\355\006z\277\351\332\342\304\3146", 40, "\200h\016\361\347\034\302\327\3315\371\344:\203\331W", 600, "X\275\364\247\307\262\230\202f\255^X\225\330\225\254\223\203iL\037Gq\001M\304{&\330\342\354\002\322\252\001\301=\231\313[)\236v\012CT\2719\340S~\371\001=\312\234H\323\217\343\020\022m\237", 64 },
{ "18\333\277\367\221\366w\230\253K\012\351\2526\234^\270/\247JD\204,\034\361!Y\266\336\274\354\322\226R6\030\207\305\304", 40, "g\241\307h\373\326X\200\134\002s\362C\011\230-\012\277-\011\377\001\274`", 600, "\236\207\032|\264\025\321-\203\236Ug\306\360\366\262L\022\333\370s\207O]\344+\326\334U\266\340\310>=\360re\227\017Nz\026\216\331\204n$\007\365\323\257>\334;M\213\024\320\252_E\010$\042", 64 },
{ "|\017\325Z\222\240\336\245\247\207\000\326`\221e\2770\360\226\232$\274\375(B\024\264\336t`SwhX\354|D\327Z\236", 40, "\356^\021\042^\200\272j:Z\377\216\247KVH\334\241\263\307\220\223Gi\337r\001Q\246\261 \207", 600, "\323\247\260\306\013&\234n\235\213;{\234\276\241\016\270\012\006\340:6\337g+\234\0264cV\367\307\361\341Iqu\210\307\370\0056\002\343Oy\264w\230X\3239H\024\207\027\377\315\204\333\340\302\220\250", 64 },
{ "}\017\344\277/u\246\350\315\226\323\033\277\356o\024h\004\234\343\036\005\014s\265\375\023\001\363\206d\265a\266\374\036\344\200*\364", 40, ":\361\031\206\006\321\276\321\206^*\330\027\257:\204i\311\012\233\3404\236\0040Zk\326\007\013\015\310\022\367i\313)m\341\026", 600, "\236\317\231\200E\323\025aM\347\231R\345\020\324\364\254\367{\024F~]c\204\350G\364\364\204\355k'4k\343\221\034W}TL\311B\027T\246\353\311\333|\340\2266\231\017\323\307\254\337A\007\373\333", 64 },
{ "\247KD\327\323`\024v \344}H4C;\307#J*\323\314\021\362/\214\254ED\201\042:\341\204\313\231U<Y\266W", 40, "\324\336h\314\262\251<Q\007P\374\310\233\224\3674H{O.\022q\221\213\363\347\252\352\2307%\226\326-\003T\365\030\344SLe@\305S\024|\037", 600, "\017Q\207\261\035x^\263F\023\134N\036]rHf\035\334\207\200\262;o\216\365\3141\026\254\350\253\276\226\350\215eM\224Y\273\001\204\345\376\257?\023c'\237\000\363I\231}\313\351qWH\016\022\361", 64 },
{ "6\012.\223\353\036\330\263\337?\033\315?\016\341\331\360\036\237\134\011s\227\366w_\346Q\355/\254\370.F\237{\372/)\243", 40, "[\015\033 U\365\014z\026A\357\177\013\266K\355|\361Z\302\377{\277\206\0261\022*\266\036\263\314\375\332t\011Sk\354\007\346r\001\201r\256\333\204m\210hf\202\217E\345", 600, "\202\327\336)u\223h\241\021\317\261H\227\225\256\351C)\364{T\013\035\322E\256\300\003EtS\3749\316$\323\027\361O\276\230\255A\231\324 \320&\254\313\027B;C\034Aq\347\023\207\242\340m\334", 64 },
{ "\331C\247\317\363x\301d\000LXa\313\324\301I\342\010\300N\345*n\332\260\007@\265ZS\026t7MMS\037\277\270+", 40, "7\303e\337\354\025\007@4\274\017V\334\304\353A\343\267\233\313\203\011\010v\204)\341V\246\204\002\352\322\012\326\224(\250)p\256EF3\315+\265\374\224\265,\352YI\277f\261atO\376TH,", 600, "@\215\3746\033\370\2115\003:&\015\3407l\334\377?lH\372E\264X\214\304\177'\320\314\215\214\272\343\244\242\263\273j\360X\022_){\232P\372\005\310\324\323\235\034\357\2550i\004\266\211\346)0", 64 },
{ "\203A\344a\377W\007z\276F\237(\217\033x\177E%\302\014\277\336\204ggrR\262y\267\314\355\202U\315\2747\205*{", 40, "\221+\350\220N/\347VK3b\0372n\352E\325\361\013\235\010\253@\352?\262\246\265\232\250\222gV[\011\236\331\353\030\330b\021\016\205Po\011\2661)\242\333o\217\025\316c\316\262\036\331\253\202\267\225\337\211\031\256\230\232]", 600, "\002&\314\231R\247\361\236\177\243\250\007\341\257\005{\324\353\221\327\220\206\217\312\375*@h\254\264(\355'<o\224Pi\314}\367\202\017\323\322\303h-\301\013\350\364')\265\270\012H\374(\302\004\233\373", 64 },
{ "\272{e\323\3454kl\257\2049\003\026\001\362)^\023\226%\327\206\177\317\301i\346$+\373\304\252|\232\227)9\234\222I", 40, "h\347P\235\022\335\355K", 700, "\373\3774\354pl\302{\007\015\347!\226\236G\221|\306\236\004\023A\017a4\345\0151\300\027\276=oA\324W\305\221L\377\257|\374\252v\221\211\273HTc\325\335\010E3u\010\134\354l\032$\337", 64 },
{ "5\321\353\336\306P\201\015\200\3739#Ae\376h;\213\224\207\257\027\031\231cv\332\261\017Ti\275\000\256h\227\230o\361E", 40, "\372\263\224\037\247g~\373L\273\134\335\006\263\212\263", 700, "CH\344 \327_\261H\217[\211\024D\277\307\243E\037\267\324\211&|\243\317\257\376@%\032\242[\312\222\271!\355\324\015\272\207\275\256\371\036\264!\254\363\000\002\366\315\3555)\014\345\345\250\205f\224\247", 64 },
{ "C\205I\257]\201\265\013\325[\333\327\003Ow~\315\025\365\027\231\276K\254mJ\262\204\363\321\217\035\277\305\031\343\014\377\253\375", 40, "\351gQ\345\255\300\323\213,o\374\341\353\374\2231\371^\342\017n\326\313\015", 700, "\225\365\267B\337\243x\035\213\034\253\266\316\250\034`?\311\346$\012w\311\032 \202F\013oE\356\216-@\321\276\035R\357\267\315\016=\361{,\307~|\205\315_\236&\034\345\257_\205\214|\331\267\232", 64 },
{ "$\373\272\306\024\335\367;\275P~\253\307\370\024\233\334ntaS9\036\361\267]v\260\276\042\226\334\376\244\011\344\232\012b\365", 40, "\322e\315\334\202\261\001\255t\245\202\354\270\363\240R\271-\244\366*\371\372\330\361\265\353=\037:Eg", 700, "\263\244\240\304c\2666\007\217\370\313\315/\346o\260}\021M\305\270W\014\024\344\306\036\036\335\360\024\326\313A\377\223\013\371\270\232e9\357F\224sG`\346\300\266\312\204\203\002\321D\343E\377\2241C\036", 64 },
{ "\027\001\004+[S\204D\251\324\001\365P5\250t<Q\247$\272\0121\024\217$\363f\370%\244\035\253x6\262\270~-\212", 40, "\017\032\304\352\351F\355\032%*d#/OL\030%pjcK\230\215\232:\321{\360\240\310z\204\3463\202V\266\023MG", 700, "\351\033?=\272L\2303_\277C\326\005\316\300\035\212\346\321 \012\302:tB\341\264\325e\373\341<M\034\375V[\010\263_XV\355\242\015\3505\004*Y\322\367t\240\351G\203\250g\267e\001\354\221", 64 },
{ "E\013c*#?\370\020q\3402\241s\315\262\370\337;6\252\263\232r\024j\346\276\3650d\007\260\005\022O10\367\344\227", 40, "9\314\020d1.8;\376M\272\307\246\310fF\325Y\254\2016w\250\276f+\340\042w\237\335\337\222y\3719\010:\331;\251\244PK5\007w\003", 700, "\334\311\244\277\321\266fr\301\304\353OK\217'\134\210\377}\205\276\027\257\253\0365A\313\370@:1C\254\3006\015vz\215*\2777\003c^4ok;\304\343\216\357\322\241\020\314bW\316\364\012Z", 64 },
{ "\315\342\314\275'! \250\013\374\300\014_\347\020\326\310\206!\353`\374`\323R\375\314\035\365\222\262gf\307C\004bqR\030", 40, "\033v\004\311\315\205_\211L\340C\356>;\351\362\336\362\024\223^\341L\0328\350\235\247\342\371\254'\257J\357\323\2046\362\363\247\260 V\025w\244\253\246\177&n\275\212.V", 700, "\310\245K\3722\340P\316g\224`\021\2139\225\207\324\277\251{;\036\376\001c\235\342[E\314\007\324\217J\316\331y\216\216\305O\210\374\277\3710\227\276/\033i\205\316\247/\215\256\330\037\271\273\251\310 ", 64 },
{ "\250\003\231s\236\374(\2562\314\007\365\037&\2730O\376=k\236#mm\035J\315\333\335\022\377\236\2177\304\266\177\037\352\201", 40, "\207\207\017\306y\205G\030\023\012\312-\215g\345\252\016\244Z\215\200b\021\201D\253\306\001|\024\227\363V\313~`\207o\003\263\207^\246\345\025\262\252\036~\262\304\350kvD\365|\377\301\346(\252}D", 700, "\002\345y\325*\313\214\003-7\371d\134\220\017\215j\246\304iH\271Sx)q\275n\016\361L\253\213\362\206\367\022\017\375\272Q\245\220\353.\264\011?\257\311\233\013\3441\005\370]Z\235@\200\010\231h", 64 },
{ "\266\361)\254\304\357\342\2513\207\262ND\246\022\210\234\262\013m\331tD\036\216\256W\221\337tW\201\245\254\035.\252j\037\246", 40, "\317\036!DOSD\017\215RzN\235\344\266R\320\275,R\030\356\3542\241\217\346\310\002\020\264\260\235A\022\016\037\247\027zb\236\023\323{\301\205\323B\342B[-2\312\363 \217~\216\332\347\317\355vnZ:T6/M", 700, "\254\355\201.s;\233PQ\344\304\255\230\272\016s\332\341\035\014\023C\254\352\2167\010R\037\253\025\325PV\305k\336\364\316\347\370\375\317\247\274\3319\015\375*\265U\222g\00126Y\265\220\331W\026\300", 64 },
{ "\236\003\332\3109\303\331\310\316\216\276\331\011\305\003\217\316R\343oW\036\362\015\321\205`\224:#cpm8v\202\200z.\316", 40, "\226\1340\320oh\347\016", 800, "N\251K\255\026\242\251J\361\374\033\356\007.\006\205\035\317\006\202\272[&<\255\244D&D\032\017m\307\345 \001\016\272k\024\134\252-$\346Y\330\031\035W\250\031~>,\346</\265d\254\272A\022", 64 },
{ "\003\307z\220f`Al\264A\241\224\354\237,S\2351\2305\376\241\000\241\274\246'\134Ym\222\355w\250\215\206\263\024\276\203", 40, "h\256\023\227\233\265\305sH\021\306\012\3042\020\325", 800, "\007\235\346g}\177\221\322\004\250\373 \244\336\026\255e\200\007\010\211\0311\243>\260\242\352\001'Iw1\363\365\223\255\3738\276\344\202\325\042C\2714\252\254\273\215\244\250q;\375\344?\201\233a\334\332]", 64 },
{ "\272\210\031:*\250\216=\324\274\240L\340\220#\351\042s\203zR\2328\367\012\014\265&\372\225p\204S\310vFS\360\221\304", 40, "\244D\351Q\254>(\306\235&\226\314|\306\211\364\010\247\323\361\356\247\224\340", 800, "\360\245`M\036\222\270\011\207\000\377,LH\254<Um8\272\256\252T\321\021\203?<q\013\366\301\012\262\232\265\370!\250\032\344+\207~\245\367(\206\016m\270\271\367\262\011\326\306\212o\276#\332\255\345", 64 },
{ "H\327\332%K\321OtRX\306\004\201\2110\233\222y\265w\351\317\304-cK\206\017\206/\323\023\2258h\335\321\035I\262", 40, "\206'/\005j\365\334\211\342\215+Jp>\217\034\273\023[\367C^\366<\213\302\352u\035\355\367H", 800, "m\230\007Ou^\233\342\007\326MA\333J\010\256^\336\231mw\3463S\203\035~63\363\222U\201\375\311:\032\3244T\316Z\031\345\021;\356\222\010\245\262\214\204\316\273\320\266\036^\371W\005\372[", 64 },
{ "\025U\274\365\264D\325M\362\270\031\134\277y\240\201\017\367\011=\234B\206\216\275Z_:\310\022\034\226#\276\311z\356^\006m", 40, "\375\252kc`9\356\355\347\361w<iK\313\220\254\276\371L\272!.\212\214\342\177\346\376wm\223\024]K\340\256\204\2421", 800, "&\355\250\033\263\244\250\314\275Sk\021\306L\370\025b[\202\254\312\357\213}N\223\351[wL\327\207\035\362\354@u\345VG\250\271\364_\243\311\256x\372\234!wF\042\260\177{\214\242A\214\301\357U", 64 },
{ "k\260/(;\016]&wH\037\213\042\300+VD\313\256l\3041\276\371\002Y\223\003\000\211\347?c'Hu\177u\033\350", 40, "\027\245\352\266M\245\221\263\035\270Z\275\014\210D\261\246\317p\271\331\364,U\235\337\007\201\021 ]\222\334\023\303\314m\321\342\020*\376\3037P$\265\224", 800, "\363\342\216\273\307z\253\373\247\247jh\273\305\007(A=\035X\327Bi-l\233\320\340\032}\312)\216\313\315\277a\224\357\237\216\274R\000p\347s\236\232Jm\345L\227B\022\237F\005*\037-s\344", 64 },
{ "\206\334\365y\204xn\223\304\375\304\360\234[\226BS\134\364\3620e{}\306\230\030\134\374.\215H\347s\017\217[\327O\025", 40, "\356I\212\244\276\271}/\042rU\350YEiM\337\303 \220\230\230\360\223\352\246\025\256\365\007\002&\274/\342`\362Y1d\222D?\231\336\264\350\346\177Q\264\326\324\326\034\371", 800, "\250\307\350\317 \245\254\016\234%:d\323\367\351`\277\252\007_\224\264\344\374\371\253+r\204\343\311\337\024\326U\3339\351g\202\037\017\204\016\212\223 \337\212\250\033g\030\016e\323>v4~\324\024\324\242", 64 },
{ "\2277\226\352\341\316T\3078\305\005\370\357\257\3065\270d\027\031\200I\245\016\243JC_\301\332\230p\323\345\274\252U\345\364\374", 40, "\321\257\023dE\264\202\246\274\342\024Y\307\377L~\244N\254\213\202\027\2641>\015\235\205\020\010/\333\275Z\350\030\305\006\3614\266\034\244\251\211X\241\217\212M\315\310K\252\374\351]f\267$X_\266\242", 800, "\303W\001v\301H\013*\303D\267\013\246\003\333Nr\213\363\214\023\231\300\334B\271\240\020A\214+\321\006\250\037\251p\230\373\020\262\333\255\210\251\031\013\206\366\000\246%\005\250\266\006I\274\257\337\031n\250D", 64 },
{ "v\036\315v\000\305_\303\343^\006?L$\025\304Xr\014\203'\257y\2462\274p\251\351\221,\211\001\313\024\234ua2S", 40, "\004\222\311 d\350\256\035pO'\302\255\260%5\210j\277T6a%\251F\017\013\300|]e\360\317\0245\037B\216\276mMZo\247\340\021\017~\305\326\242=OJu]shHr\212Y\254\304Gl\236\332\2600\042\216", 800, "\323\004MM>\322@<\321\23672O#\360\030\234\335~\352\345;\016\301^\237\304\260T\274\304\010\247\356iT\207kU\207\134\353\235\251 \377\270M\303#\300\274m\3151k\2259\240\327t\275\371d", 64 },
{ "\272\246\030\303\247i@\262\342\042sn<rR\310\330>\0006\222\247\366\013\002\205\034\363\246b\237\226\032\377\226\244r\243\377\362", 40, "1\324K\006\307I\330R", 900, "\215G|*\014\234\000^>$\313\363p\327\250QD\343\337\232D\042\256\331-\303LE\3602\0019\3137]\337\006\352\017\026 }Q\035\036\325\261\246\320\027+\357\007HP\200+\345\264\300\362\026\374\320", 64 },
{ "P\255'\277m\2654\026\225\362y\206\002\311\313\032J\213\315.R\201\375\025rP\236\254\333\357*\221,Nk\025\004\014\005\271", 40, "\322\002\261\273*\303\310\2203\375\240s\317\027\206\265", 900, "\311{\342#h\025\214A0\351T\253.\361\350w\200\336\367\331\241\023\006\201\375U\264\376,AL\276\373\360y\266\243\017\253\252'\232\346#\207\223\254\023\002Q);r\223\271\025\322\035\336\266\001*}\314", 64 },
{ "\375\021:w<-\363\227v\242\220s\343\37651\006\257x\331\004\213\363\336\266w9I\336\323QCN\216\354\215\306>[ ", 40, "Xm?\205\340\010\207\256\003#g\224\331\333XE\251\303\331Gr\025N\217", 900, "\316YO\221\237+`\004\0179 \317\322\220\374<\266rl\377\246\331T~3\235\304\014\023\335.'\273\034W\340\226\235\244 \033~J\222\021\240\014\327rD\007\235lR\022\321u\264~Yd\337\014\200", 64 },
{ "\035\264\036.]6\335\000\277zG\326\304\363\236\012\215\227\334\226 \375\220\325g\312D^jv\014\011\001>\263\364\330\260\271U", 40, "+\134<\316[s\224\272\360\201\201\031#\233n\261\317\205v\363\230\262^\215\213b\2162\244r\322Q", 900, "\373fya$\300>\001=\340\335\240\200T\321(\317\310\227xM\241q\237\305\351\335\253r\027/s\277vc\212\232w\332\026W\362:\361=\302\377\350\317\227\365+\223\033g\337\347p\344\273\012\366\317\345", 64 },
{ "\007Z\255E%IM\035\302\343\304d\276\354\312\042\211\015\266>|0Z\377\320m\303\254\334\231\206\266eFw\314\025\2734n", 40, "\354\272\341\373\202=\177\030\134A\224\256\246\217\336,\207\375\230\241D{\035\222q\275\220:o\240\321\375fP\303\375&Ak\205", 900, "7>\250Ar\323b\375\207\336\000\003\257\204\244\203\0137b\213\042\260\134<\372m\333*\3515\200\024\211\313\365y\345\276$\016\276\276\253\032Y\321\237x\367\000u\245\026s\015\014\326+\347\245j\251\221\236", 64 },
{ "\234\012J\305\000\361\2322b\357\3757\252\2230^Y=\310\353|\002>\013\257eF\230\200s\275V\214X\222\272|_j\215", 40, "\266\305(\042U\226dza\035\006h@\035t\335L\247#\360IqL\260\307\347\2761~_\316\032U7\206\255_\222\205\301\207\324\325<\222y\373\335", 900, "\373q\021\255\334\2365\216.\366\206i\034\217\256\227\210\3675\314\274\3716G\032\360\030$S\270\313Y\314k\022y\2272M\033C\277\003\221\334:h\001x\306\302yx\221\217\016\277;\012N\261%\211\240", 64 },
{ ">\346'MZ\252D.\350\326\241\240\2335cH\334\261f\371\224\236\032\375e\312b~\0165\324[\012\134\215=<O\243o", 40, "A?a4\221\216\211o`V15\375xM\205\306\134\367gH\331=\034\273o\3366Z\206\216\134&9\216\233i\003\275Q(\31463\033\356\3222\033X\033\245\177>\277$", 900, "\027@\215A\225!\233*\003m\364\006\373+L\031^\007-l\010\242\377\242Y6aa\235\313\265\260\262b4\325\305T4\203\011\315\320\336_>\004\342\264\353O\351\266O\226;\313U\214\353\362RI\277", 64 },
{ "\223)\222Fg\257\022\2141\375\232Q\356\251\270A\021\237u\213C\010\371\243\250Z\233&\002\334-|\3267\340\026\354\276k\221", 40, "\243\370\024\263dz\312\234+\326\225\267g\254\317\205\346\350\303L\311\026\225\024\042\20679\266RG=\022\273\276\021\342\324\336\314\353\232M,M\334\025T\035\340\210\225\357\316)\374\265l\031\215\222\011\201K", 900, " \321\337\221\312.4*\351\042\242\026\134\221\002f#u\342\266\033\015\007\335\230\205\037E\016\324P\273\013q'\210\002\344AE6\206P\323N\221\260\362%\346\301t\246It\230RY\366\020\220\334K\017", 64 },
{ "V\215\330\206\025D\027\363\346\134\010\376\201\305\275_\366\034\344i\231\017\236\007\006\330s\351\033\336\011g\325<mk\325#\215\232", 40, "\250\34170\264nk+\035\033L\023\210\015\344:\244\177\275T\356\371\367\377\241\315{G\021:\265\3209}!\2077\2657\322\331E5\0370\273\373dl\320\216\353\371\035\244\201\220\2469\206\231h\034j(j\002\340\232\230\273\017", 900, "X\2529\243\373P7\177\260\350\242\023/\373aE\036(\330\333mw\237\372\014I\200\251\345\341zI\031\207\262\025\315\217l\274u}\335\363\2123$\017\264\265[3\320\266\275\223\205,\345\036\134\305U~", 64 },
{ "+\377\033\222\206,\265\206\231\274\207\004#\235\344m\025\352\362\332\210^\332B\226\212j[\023_\350y\363\012D\226\134\303\242\347", 40, "\012\325e>\037\3173\023", 1000, "\211\272(\272\325\230{{\033k\220\260\341\026\225m\365\201|\276)\374\355\255\221\223\352;\235M\001\010\006\023tE<\340?o\001\246\226\232\012\343\306\234\001Iq\371\373r9\021\032\016:i\277\351C[", 64 },
{ "d\211\205{8\004\024\223f\011\313y\323\344\034\326\362\304X\320\241sG\235W\201\352\340u\215$\271\330\320\376\267\237 \324s", 40, "\310\034\021\375\023\330\206\027\323\1773D*N\003\317", 1000, "Pf\365\012\011i[?I\015%\343W\233\027\345\005\345\344\024\271\203\355\311fS\212\012\3022\021k\366\316\200[\250]\377.J\322u{\341\313`\323.i&*\037\327(\325\237\372\377\015)C\3507", 64 },
{ "\263\011\250\275\025\371Z\0101]\350mf\343\257p(\232p\375\013\350\2748J\327\024W\310-Xo\033.I\213\263\307T\350", 40, "/|\3329\253\374\350\017{\246Y\213\340\232J\226\261|A6\2306\220\267", 1000, "r>\177\026\256\271\343\015\236\212\217l\216R\0140pA\371\321\027:<\005\270,%\364\263#\221\274\344{8(;cR\346\302,<\035jG\247B\242\213\301\310\334\025\257\026B5[\023U\235\231\021", 64 },
{ "6P\203\023g\301\004\023\216)\306^h}\224-\020u\277\202\005\215\326q&\301\305-\001\313DU\343i8LJ\261%#", 40, "H\373x\252\220\007\246\251\353b\013S\223\314\364\017\305\326\341\347|\003\361\2411\215\363\2177\362}\333", 1000, "\035G\260X5\372\306\321\216\255\336\177\226.\2416j\302\315\220\270\2442\343(\236\017\376t\344\377\355!y\236L;\352\200\2603e\255$f\305\304\025\024\034\320+\000g>\371.)d&\201\225\211\001", 64 },
{ "\275\267\241\311\255\003A\347la\224=\205\012\312\320\315nNQ`B:8E9\257z\261\210\251#\003\321\007\360b\210\352t", 40, "\326\364~\371\340\012\011\247\221\223\373H\221g16\321\317\335\271\264\263:\217\201\373Cy6\344bG\315J\376?@\353\341?", 1000, "\334g[\011\227?\316|\030~\233Q\030\326\237 \244\376\016\026C~E\032_\022S\214\317\331L\270\3726\030\306\333\344ce\006\016\371\254\251\254m\254\225\305\277\301\000\257\035\363\340\321\350\211\332\000\023\304", 64 },
{ "\313\260\003\264?r\237\205$\220~n\016n\036\252\311\2724\241_\356}\362G\340K\373m\034\233\362\000\373\2329\204\253?q", 40, "\213\252\265?\016+v\221\020\234\261\012\254\305\200\326\027~a[\252^\024\350<\334\205\253%v\362\277Z\327\356\305/\253\215\010\261\221\276\224\306\355\237\033", 1000, "O\257}r\305\306\214\240p\023N\367u\336\275Q\340\011\005\377}\001\203\231}SE\221\303{\251\310\027\200\326\026\300\204p3\2726\212\224\355\237u\200\233\004\215dNd\243~\254\216\323\361\201\233\220\277", 64 },
{ "\217\252\036 M-\337\272Pzu\215\221?!\253\134\220\3331\320\352\2520,\232z\372\304\3133X\320\270ba\042\363\222\335", 40, "\331E\026\277\027J\200\301MA\345>\306@*L~\347-X\242\361\035\042\251\230\177\334Q\235\330\371c\322\300\242*c\322\364>|\250[\326\350\022\241\216\303\243\221\267\206\253\225", 1000, "\312G{\134\201\277o\201EE`\260E=~dQ& \212|O!\2507\177\336\274\220\0060G\354\316\006\243o\254lC\231\371\002v\004\013\234\251;\361wZ\210(JFj[\210\360t\263\363t", 64 },
{ "c\346\307Q\376\034zU\020%+\207\274\361.\222\231W\233\034\024\371\302\335\243\214\034\215\244\0076W\3629\367e\233\031Z\032", 40, "\042\006\220\030}-~\351a~\0349\354\270\336#c\301/\347X\014o\256\265>\357\004~\002\261q\215\012\042\025\370\260Q\236\324\262\356C\207\010\245\376*+\031P\320j\277.\234\231\377~+\003\022\356", 1000, "\233i\253\245\234\027Pe\201\215\321l\262\350\352\271\202\232\307\004\000Aaj\327W\265\372 \210\211 S;\037M\037/p\341\267\246\017\273R%\003\316\313\226\342\365\012\347\000\274\001\331\022z\313\2502\310", 64 },
{ "'\241\373B\206`\215\306\266\042\273F\242\205\356L\323\370\370N^\332\331\312=|\015B%o\004\337\361\346`\372\001\325\314J", 40, "\273\037G\277\315+\250\305\332`Q}ou\247\2227\357\012\336\255\366\303\027\330\247N\262\212n\277\213\241o\0010\231Z\210+\312\277\021\246\010m\211\377\001\376\325\234\303\033W\3723\222\240\351&\215\005\214\220K\257\3311%g%", 1000, "\276\005n\341E@}\262\034\244t\311O&\246;9s\034a\342\211H\004\275d){G\013\374\207|\271\023\316\303\365\337DdUY\337V\0375_\320\221\337c\202Evx\024\032\266\221\274\213\031\025", 64 },
{ "m\134\004\204\357\247%}5\327hN\356!\226\021\240\014\006\222\300\202\233H\366\245\235`\263Ua\000\220K\361\222\315\030\030V", 40, "Q\241\243\224|\243\305\211", 2000, "\320DN\260\222\254\336<\304\3538\324(\233\233\242\274S\372\224\216]\267\042\340\251\375S\213\335\217\243\3523\356c\325R\255\011\002\347\022\236fb4\242\363~n\301\226P\255\237P\030\362\324\252$\372\204", 64 },
{ "\342\007S\226t\2532\237\254u\361MMY\246\177\214i\256\343M\246\362\204\355'\335#\264\276\315[\321\236!!G\134\273\217", 40, "\246 y\253.\353\205\022se\355\015\273\352iI", 2000, "\201\303L9\227\266\301\245\372\243\036\235\016@,\027\370\223a;\331>\271^9\342P(\003\344\227\265=\032\033\022\224\0165\337\002\375>A\316\203<\222mp\016\0243\3068/\353\367\306\270\306%\177H", 64 },
{ "/\252\340\020\222?k\371?|p\371-\271\012O\002\255O\316\240&\303.\226U\204\347Zp\352\355!X\221\225\034\205\355\331", 40, "\241/\342\261\015ZAZM\217\316\374\357\212c\330+\203$\375\255\2075\341", 2000, "9\213W0\242u\022^\357\327Z[m\023\177\310\237\346J\340#(?4&\031y\310\005\34293\232o$?~\200\277O\255&=\360x\310\336\304\314Y5\214?2\313\034(\312\375\350\012=\334\263", 64 },
{ "\2058\365\033v\273$a\001\305%}QW\037\376\212\377!\005Z\347\366\375\010\253t\032\240\012P\247TC\267\330Y\335\206z", 40, "N\027>D\017\2778\324\346\012\264?\222w\276\202\207#\367:\206.\0313E\363\330\275.\265x7", 2000, "\254L\354\232\275\274\246|\323\213\236X=9'\332\233uX\333deG\013\217\262y\223\314\007\350\331S\244\356m75\016\015\314\331\334i\350za\010*\360\373\206;\272\003\336|\007\226!L_C\252", 64 },
{ "H\004\267\271\232\367\366y\362\342,\221$\037/82, \256\014`1\226\215\035\303%#p5\303\015\376\333\362\371\352\342\310", 40, "\022\3154\234\374[\232 \030HA~S\321\207\265\272\330z\236\356\212\360\236\323\215\373\231_\273Gk\220\256\331\264\005\230\267H", 2000, "<\360\033NOuN\014\207)\325@\302\0262\210\355!\367\033\302\253wN\372\370?|\217m\215\234\242e\243\004z\010:\330\032\315/y\326\213\267U1\362\242O5_=\264J\253\377\364\032\035W\375", 64 },
{ "R\225J\021F\232\376(\260\300\0304y\230%\327\352%\352\204\211\013\362\265\375Jc\0326A\206\0357\042\005G\025\354\253\006", 40, "\232\212\252\221\374`\030(\227%{\023\327~$BM\376\226?\177T\3368\353\214\321\216b\367\353S\366\042\177\330;\341\230\353\214\363\235\324\005s\234E", 2000, "O\021\336_6\247)\246\005CX\031\302\346\241\035\365CQ\310\037\274\265\377\247\235\257&\254J\315\250'\210\356hl>\027\246\013)\350p\004\267'=\025\236;\220\002x'\035Ij0\373\265\013\357\023", 64 },
{ "\374:\010\203(\0329\201D\346\246`\372\311\221\036C\256\030\024\335?\312\277\340l\344D\307\254\246\342+3;\312\301O\235\303", 40, "\237\233\317JL\336\027\026lj\264A\012)\005\225\210!b\267fn0\264e\2521Ko\235zd8]\031\213@\230T\3726\256\304\213K\211\231s\307\015\031!\237\020\233w", 2000, "S2\030\011\244\331Oq/{\000\330\177v-1X)\207\226}8\020\032H\310\000\215m\214;\011g\215\233\033\000\222\201\317c\237\2358T`:@\234\316\034\007A\337^\235\315lW\256A\214\237l", 64 },
{ "\270\224\207\301\240\001`\311\327\371\211\2550\254>\220%k\025d\306xg\250\276\322\245;\326N\237\311\276-\372\321l\214\321D", 40, "l+#\215\304\301\264\331\303\363\021\304\237\366gT\333\340\240\302{\200\370\207\221\205F\243\375t\357w\303<\371GM\237\006\352Q\344lg\266q\020\223X\274\023>\302\007\371CI\240e1U&u\223", 2000, "\017\360_\264\037\250\221\031\134\274\315\265\177\377m\355\205\246\202{\016|\214OI/\327\205\270\017\220G\3402n\014\233\236i\017Z{\036b\356\340O\033~\037\362\306\253j\324I'\265L\211wO\000\237", 64 },
{ "HU\270>(\233{\312\014\211\005\242\206\341\027\033\347\217KY\260\231\255\010\207\340\030s\037\340'\031\003\231\267W\031)\324\270", 40, "\304\232F#\277'\371\351GwI\343\233\374\2569\004Q\336\322z\305'\243n\270\023\377\330h\375\235\365F)\244yq\027\276\223'*\033\311\362h\221\322g\300\356+\241\300\365\301K_\231\363\005?[L\374\227\255j\216H\347", 2000, "\377)\253\322@\211\324\134CI\333\034>>m\374\270\207\375\025\372\367$2\235\337|\331t\251 \244\370\271F\012\341\250$\0221\210\276 \026\134\031\224\360k,8\034\262\013\360\225\260\352\031\240@\303\243", 64 },
{ "v\014\202\367\330\015\0016v\220\351\311\003u\263\236\205\251\334\260\257\203\020\300\204\332\245\257-\350\3476\303\325\377t#<[%", 40, "\346x\031\351=\212\362\002", 3000, "\236f'\326l\345\210x9\310\206\304Qb\247\335\351\246\310\255\200\007\373\301\272{Z\360h7W\005\355e{n\312\226\203/\357}\332o\314\2270\026'\357\342\012\331\376\000E\337U\374&\256\367\252`", 64 },
{ "tHN\335\351\026j\345\347\265\303js&\276\000\027`A\251\242\263\016 #\267\313\272\242\275\024\3430\333ah\276\342C.", 40, "\334\020y\342a\350!Y\332p\012a\247\217\223t", 3000, "\343ur\205\201\3444\263\011\373snRl\207\002\211\2332\260\302{\022\250t\210\250\030\177\277\304[\315}Fzi\333\210\303\234\010\337\244\216\360V\007*\305\243\327\371\007[\330J \027\257\1770:\001", 64 },
{ "\020((\271~1\371\354\134\256\025\362\323\332\010\200\010i]3Fw\003\324\237\250\301\247p\311\240\342G\335\255\006s\265\351\373", 40, "y\365\011\223\001\346\262\360#\245\027\313\026i\213Q\372\031\005\017sr\242\221", 3000, "\042?\357Y\375x\355a\024\200\003Y\245\356A0\267k^\203 \224\232I\260\304UQp\355D\233\253\326T\353\271\022l\377\247\300\307\351c\177\233v\002\266\336>\035\2711\307WM\321\377\000\371\007D", 64 },
{ "J\236\237\344\246\252\331\360~/\033\032kpw\321\235\036-}\233)\250Z\017\316W\3158\042\334(\216\227\373\324V\374QL", 40, "\216G\344\346]\013\356|g\005\363k\250\360\255E\225\263\327n\332\225\253\033\364\222.4#^-\355", 3000, "\324\224\245<*\230=\324Mf\352\224:\004\024\031\255qI\327\377'\327\223F\007\264v\037\367p7\301\366\253\225\266y\320\025=AZ\373\310\034\326n\311\272\270t%X\253\232\372\357X\270\205\201\376\036", 64 },
{ "\350\312\011|2E\205K3\036eK\177\355\265M\344\001\255\277(\231\376CG\301'\237\346pN]&\177\273\000R\015\336\353", 40, "Ui\256\334\260\242}$\372\237U*\265\020\023\264\027\247\367T\234\351MN>\0126lLv\360\016\223j\343\220\034\325\374\365", 3000, "#\012 \354\261\226\226=\251\271l{\001\013\301\260\012W\247\020\366\204*\341\352R\371\353\010\036V\375\037\345o\244*,\000\262\013Y\375\311,\033@R\3140\037\264L\031\360\020\354A\210\213\022\201\336M", 64 },
{ ",\347+3\364\305P\245\223\300<\323C=\213*S\373\0163>T\357\360\304[\202*P\004\004\224\33585\3249\332\032\253", 40, "Gs\271\225\331\274\026?XX\021\254<W\334\015p\261\224=\275\364\245\357\252\2220\042\230\265$\022k\315;\010h\316\027\234\211\316o\011\334`|\312", 3000, ">\205\205Mrn\341s_\217\006\000\134\375:\301\334!\341\322\202\262\002\332\365\257O1B\305\376]\016\021l2\225\277\025I\012U\321\363\221\002\206,y\210\224\217g>\0258\254\261M\340\3714\274\013", 64 },
{ "\277\313O\320\373~\303\235\255\327\022\212&z\367\015r\270i\332A\222\320q\215\025\263\233\215\371Rc\337\012W\360t>\202\337", 40, "\005\271\372\326x{W\034\256\244\343\013\305\332\342\036R>\205'Im?z\350\014\006W\227\032\022\235S\352\025@O\036^\002\364\333G\373\242\201R\325\214\011W3\325$G\024", 3000, "\033\333ct\032Lr+\011C5\034>k5JL/l\003y$\225\022~3\347I\361fd\321\376\351\366\004'\365if\320\014\362\007\377\204\313\254\347\210]\033\331\025\005\243\255\271\037 \243\2633\254", 64 },
{ "\022 \253~\327\267\303s\016\037\331T\333zT=\330}-1\364\022\343\360D\307\377<\232\364Z\001\205\360\236\030\376\2163\243", 40, "I\222\331\177\265\220\372\015\351\001\220\213'{\334\362G\365\252s\201&#\263\357&\366D\302\023k\360#\2510bJ\342e\306\220\005T#\323\365`\013aQ%j\223\275\335|\363\200\304]m\212\251\304", 3000, "#U.\217\271\211\346\352y\3342\365DQ\035\374r\207\331\356u\346\211\246\255\347s\011\252/\374'\357\002\227zv{y\211Rz\300\206\254U\225>\207b\011\222f\313\005\374\202\010\272\313\032\242'i", 64 },
{ "\221\335\035[!\200\342\272\204\016\320H\250x\225\264Y\371rO]{\247I\316\020\314\376\256\267\331\302\311?\300[TGK\302", 40, "\214\217\316\227\270t6\374\010\211\320\217\213\220\023\004\305O\251m\306(\222\361\037\001r\3364\331\376u\203\344\273\342\266\224\201\215%\230=\235\341\331X\255\232\021\304\227\346V\340\331y\272\3321\216lKo\310\233\202\301\200Uk\355", 3000, "\222~6LF\263sIa\313\266\021\262\264 \250\012\2010\247\336\275\011zySN\270~\272\025N\025wT)%\206t\312@\253\352\033;Eby\270\231\025\207\362\363\356\3531\304\244*\364!\361s", 64 },
{ ";\244\030\035\035\032\256BP)X\202\277\214|]c\002\361r\214\220\367\037hU\347V\241\314\012\250\250\321p \032\254\335\031", 40, "\377\311\272\264\0173\245+", 4000, "\317\333,\233.\220\351\334\236B\341\200\252\021\306\254\001\355u\307\262\022\275_\236h\035\322|\370\346n\004\303\205)\037)\321\253\267\221\236\2446\252\226\250\334\225s\2761\334\244=\323\376\240\364\237\037\206~", 64 },
{ ".\362\232\346\221\3370e\363\2018S\366n\220\212CM\354K\015L\214\205\271\215\301J\003Q\240=f\001\240\036\027\363\245\210", 40, "\270$\3356\362\262.g\261\204\001\177tH\303\223", 4000, "\365S+K\204p\330\243\342\230\343\225\342\266\277\306\0113\001\027\214\326\2070r\334h\256\361$5O\033ze\336#\242\260W\321\311\211\020\262\342v~G-\223S\267\263\372J\305Kw\247\274\354\233Q", 64 },
{ "\221^\330\236-6\207\017\240\250:\317\255\035\234\362o_\344:w\334\236i'JH\304V\320`\255;\363\011H^\207J8", 40, "\305OM\233\221\204\0010\314d-}Z\376pSi\022\323\313\023\370\346\024", 4000, "\315\312\356\271\366\301\134=4\222\013qYj\206\352|\015J\312C\206\327t\305D\225X\324f\337v``\035u|\317\206\342\000\367E\233]M\372\351\134\304A\245\271\206~\301\362p#F`|+\206", 64 },
{ "RL\275F\026S\037q\0277\023\207\253\245s\301\363\002=m\307i\003\337\313\026\336x=\017A\212\343\206tGb\346,^", 40, "\262\215\200|\220`FH\353\321[\022\211\321\357\207\355\352\361LY\3416\032.pv$\202\200\311,", 4000, "\327\303\255\024\231\307\253\007\274%9\207\240SxB\223\037\367\203\246O\316\351\271\260<\312\223\305r\025\366(\214\276\334u\266\274\023}\343)Sr\332\206\224\333\375x\354\020D\243\013Z\374:\263d\355\230", 64 },
{ "zoK\020E\344\266\327\350\326\301\042ay\277/\027;k\036\210\343[\377\014W\307\277H#%\023d\323\255\373\3728\355\334", 40, "\224{J\344\244\356]\345\376\235\2521|D\210u\376\0337\367\245\343\360\035w\342y\351\340\030]Ys\320\3052H\036\253j", 4000, "kX\307\311\033v\211\230i\303S\020\231\313\334e\251p\010QnHK\261)\001W`\275\261:\347\345N\232\346m^\042\336oI\216\342JB\245\347W\227\234K\264\330\376\373\003\301\277Z\007k\311\003", 64 },
{ ";\346\033\200\372(h;\347\364\342\013\240\320J\254\311\313\326\332\207\020\012\276SlpS\221\206(\276*\012]2\264\357\353\333", 40, "#\233j\343\021\317\331\033\241\204O\326\207\375!\221\247<\271\237p\343R\253\017&\327\356\221[\255i\251.g\212Q\014\320\276~\244\005\3155k\251\010", 4000, "\276\001\247\265\317\006\331\235\337\310\301\212m\344\013v:K\337\134\360t\024\012\244\023\311u[C\303\324\033\351E\015]\234\363\351>}D7gL\324\364\244\306f\267\235\377\231z(I\214g\346\240\3447", 64 },
{ "}\251_'\352\042\262{u\213e\353\301&,\023\227\327\006\206\356\215\016\233\255B\015\033\211l\015\360\237\322\225\013zx|t", 40, "F'm\243\321/\261\3521 \366\342n\017\322k\333Q\026\010o\306\004x\254a,C\364\201\027\231\232\215\353\003ZS\227$Xk%\313\201tX\327\216|\275\242\313s\320d", 4000, "\217g3\243_\275\301\025G\345\354\363\253\220/\024lL/\351p\337\302&\263\011\300&\23191\345uu\345\301\230\337\362\042\360\352rZ>\312M:\355]`\360\273\205\223D \002\042\221\003\306tH", 64 },
{ "\245HR\177'\360\330\340\032[\203\254Z(,\272G\360\223\201\306\364\234'\010u\217\013\273\227\026\037\251\221\007\246 )[\235", 40, "\371\255\347\205\201U;\255\350_(\222q\235\261p\376\325\326&\203\042\224\3215Jy\352:\205\362\211f@l\221\015E\002P\207\252\200\233B\207\3329\202\042\256\001_\334h\023\001\003\374\216\237\353qJ", 4000, "\311\262\026\036\313\3243&UG\006\336\224\261\001\353\210\355\032\2372W\316Sw{\254\267\315\234\263\024\365\256\220\021\220A\231F\001A1\347\255q\224\305\220'[0\315Q\240a\221\236*\221\034\376i\313", 64 },
{ "j \331\356\021\266\302\373\305\037\234\305y\013\367\372i\222\236#\253E\221\215\222\022\223\007\203\134\207a\300\321\017\346\222?=v", 40, "\336\220\315rU\233\013\342D\314f\016\037\230\372\007'\003\361\037\234Q\221pf\356\017\203\010\264\321\370\211\360\251V\353\236\232l\220@\004\027\334b\366\265\006p\225JW\236\227\251fiN\232\233\200o\234|\274\015\265\317\001\200\012", 4000, "~M\276\371\346\345\324\242\202\212\337\025\277\227\024+\037\371P\263U\015\016\007\362\177T\370Y\346w\025h1I\307F\364\303<\023F\014\350\221\215H\276\353\206J\244kT\031r\330\246\016hj\250x/", 64 },
{ "\302E\227\301\254y7\247\337\332\015I\243\021\025-\320\361\315\262\377\327Q\277\367Y\203=\011\366u\362\006Ci\374\323\203B\236", 40, "\003V\223D\273\375{V", 5000, "\231\305\276)\251'^7\336\227\212\234\230\350\034\353\304=\215\033\230~\340,\261\351\317\246I.\212\023\217?_\225\012z\002\356\201v\215rA_6o\214/\264\347\006W:\006v\030\212=o\327\226+", 64 },
{ "4\314(\203E\260'\215c\345\331\341\017V\311\346\006;\013e\312\022\215\021D]Y\251D\227\027\366c_\276V\022\037\340\264", 40, "\2103\375Ru\276NAI\345\254\036/\252w2", 5000, "\214\345$\014\000\333\027\204>\326p\320-\020En\034\371+\207\023\327<\314\266\312\277\010\353H\2049\037J3\220\247\3302=\032'\205-}\005BB\372\355\371X\365\325}A\025&!.\311\252|\236", 64 },
{ "_[\347\031\345\200`\000t\302\207\327=\366\270/\322\350;\007\221\207A\027\256\250\364\313\355\370T\240\317Xb\224\363e\313b", 40, "\337\303I\267n\336+\240\134\243_\351\3100\317ZF\016\302m\263\220\302_", 5000, "\213\263Za\221\346\370\303+R\024\335\214C\222\372\332u\313\252#\347\353\006\332 \010\324\034\276\310\321\2165\2403\016\342\306\322\026Y\134~&g\367[\346\021t\221X\035\223\317t\270j\212\211\334\003Q", 64 },
{ "\361m\332Y\307\254=\374\376\312Km\012\013\312\012\206\210B\313j\227:\323&\233>\240\314\211\353\226%\322\035 +\346\305\302", 40, "\211\014jR\233\265\360\224\042\274\034\326y\311\310\200\016\376\356\301\216\205\353+6V\302q\276\247\253\240", 5000, "\201\205\336\014]\323\211\027\312]\276\307\034f\002g\035\310\214)\310d=\376\334\221\252\271L\014\307\202\373\357\226i\0365\210H\0201\260\227\277\2070\222\354\230\277\265\341\251\037\030?\270L\300I\342\030k", 64 },
{ "\302\265\353\372,\300O\312\032\035\205\376^\333?\330\362ZW\004\004\030\264\036J\255\341^b^\024\177\035_\0129\230\335\206o", 40, "\347/\326gV\324l\210\233\301\013\375\3151\314T%\271J\374\327\331\177!\035\312m:\376\247-\271k$JE\262\243}f", 5000, "\042bQM\317\245\256\010YW\336e_\023\354\372\206v=Y_\033!R\342\2103\331\374\204\034\016k\324H\374o\332\032*\012\014\031d\255k\324\300VI\351\244I\230\027\025\357G\206\300\000\222Mk", 64 },
{ "u\263\272CY\021`n\345\307\203\030\012\357T)\377\317\357f\025\361\015\337QM\253\215\367\022\217_\275a\244=/\205\360)", 40, "0M\352w 0\255\033\242penz\365\252O\327\002e\241\263_\015%xG\333g\344}\340\243v|\377\240e\011\354\203\316\352\377T\2143-\370", 5000, "49\310^\216\307t%\355\337\227\301\342\365\302\225MG\223\201-e\203\370Q\376\205w]\264\250)\010\002\367\213\303\256\363\265z\364)\201\276f\006\002\366\2458})4F\250\364\233m)\207 R9", 64 },
{ "6\353u\336\003\275APas\275*\356\210\325\270\274Z\303`N\022\261m\250\235\247\205\344\033\003\343\322o\000;\335R\023\273", 40, "N&{\2130%\355\335\335H\033\2166L\222\371o\374\246\012\033\256\301\235\271\314\345\206V\267?\013~\030\032)k(5\362\267\377#\276xRs\377\205\322\006!\225z\314~", 5000, "\256\213v\006\364ft\342-\254t#\024\244\020\015xM\036\337}\036\267\313C#*N\210\207d\351NG\037s\250\336\257v'\333F\253\244\242\207?\227\317h\337\025\344\2602.G\325:\214\337\373\202", 64 },
{ "\261q\320\011;tg\211\011\333\365\306pUw\272\271\276Tm4\370\373FXt\201\262\031\270\3704\177\0214J0\234\235\324", 40, "\316\264\004\246\371=\031\371*xZ\010\256\245*\355\022\012\260\231h\026z\214\363\277\372\250\302X>\016`\336\345\007\304/ >\234\217\330[\362Z]\343\275e\341\257t\316\232\235 \320\273\004f\261$5", 5000, "?*\034kY\205\002\241\226\003-\242e\003$\020?\345\005\311y\237>1\241\3324s\363\230\356:\206n\042\257\326\366\276n/\177\360\217\322z\335\016\203\353\356\037\213+iH\374\350\371\346y{\177\304", 64 },
{ "\027\252\311\265\024\350\347@\042Uh\245\021_\024;\241\265\2175\345hmj\365\325\300\362\000o\205u;x{cX\313\004\351", 40, "?\177\260\340\0031\020n\352t\261\032\361g\275\207`o\246\031\226\020\361$\352)oN\334\330,_S\2148\005E8\016\263\354i\243\322`\032\024w\307\225\011\275^i\312\032Y-,;\333c\375aX\002\214\327w\374\253\240", 5000, "\252\310U\245\245\134N\247\374z\317DEN;+\342h\231n\000h\015\032S;\333\245\244\201\340-\235\015\332\015\277\253\377\200\271\203\223p\204\252\341\264<\231\134\300\224c/\366u\253f9\337j\200\224", 64 },
{ "\001\257f\007F!\225t\202w\366\277\211\232 \202\246n\204\200pgdp7\365\033#\221\341\023\310\230\216\013\245#\201\365\274", 40, "\372\277\012\266\031\334\375\215", 6000, "\273HFL\315W\015\217\2275\377\356*\225\2074\351p\227\035\365\271\016\312=\373\220\251be\344\345\223\363\261\035e\330\2327\377z\226\355\015\242\314V\326\331Skm\311\323\252Y\3536?.\334\013(", 64 },
{ "\200\313\010\003\253\353HE\362\346\303J\205\346\232R\2477C\217\312&\023\244{\324A\310\2625\260\370\303o\353\360\262\267\236y", 40, "('z_\337\037M9\2131\036\204r[i1", 6000, "7\134(\341\220\2024\317Zm7\323Jg\267\274\376x7\377\253\016\254\366\213\363\24001\236\245'dr(\303\311#\015\335\223\273\342\323\353;\372\342\252\026\372\023tW\241\240\364\357\306!\3761\201\010", 64 },
{ "d\345L\034\356D\017-\277,\007n:5\226\014\227\210jN\000e\020\307C?K\267\323\010\011\257\347\277\350\032^\017\227]", 40, "\3435\273ab+KN\264O\201\211\242\325\251\233\311Hi\363\007=U\026", 6000, "\016u\265\242\011RP\313\341\316\345\370\303\365\327+\225\205\352\312\221g\001/\266\027\312\333!\247\361z\277\336\303\000A1\3715\341\262\374\224y{\223\013+'UB\242u\003R\217\311\316\042N\231\265\033", 64 },
{ "K\264\033\201\243)o'2\253\305C\007\355O\353r\310h\321\256zd>.\221\0330\244j\3349\015\240\225\317\347\344\260\220", 40, "/T!4a/\015v\243}\342\211f\274p\314q\267M\2352v\251\236r\015\327u\211\343\212w", 6000, "\037\211\024g\307|V\037\007O4\006\262\227\335\3174\306\011\015\230\277\022\207\374x\014\234\234_V\026.\352\232\231h,\236\205\035\333\271\227\335]\373\020\320\262\263\216\372\243_lA\244IEK\251}\272", 64 },
{ "\003\006I\015\227\203\320\264\024k\261\002\261k\375`\001\247\333\260\307\364\351\217\3228\377\342)\243\213\3446\351\266)\355\232\353\271", 40, "\245\033r\214\247\344II\366\256@\036\015\015{\260[\270\227\253\254\350\265\355\024\247&g~E\301\015\027\006D\346`\243\317=", 6000, "J\334\343\350\306\134w\367\333\377\220\004\201\025b\236\245J-\005\370\004\235[:\3718\222G8\027\036\215R\021\317\012\013\321MF+R_\341\004\206#\230\134\346\025\353=\026\200\216\256\203\342@\344\251\244", 64 },
{ "*\266\352zh\265\215\235\307~\357~&\262\354\232I\235\376\233;\3240\273r\243#^\003\354\0300\267\325\035bB\346\355\274", 40, "\270\274{\245'\246\304\0049\366\304\300\227^\302\024-\2140\261\236\323\273%:O\022\013\250I\354\275\223\372\037\270\177\301\304f4\2508\252\247\005pb", 6000, "\2323\251\356eT\177\244\020\004\264\251\320\327\0007:\037\322\227b\253Z\010z\305\204Z*\303(-v2W\266u\001\256\373\352~\017\215>\316\340&\333\331\206\030W\366\336D\3000\235Ma\270\031\003", 64 },
{ "\257\247u\250\333z\015\007\221\013\031nz\017\272\216C4I$\361h\310N\324\260D\223|\213\252\237l\007\300\361\2308\033\265", 40, "\300\351\273P\263c\222\222=\356r\337%\037a \226\002\355\330A\207\033\306z\214I\374qc\342\347\251Cp\237\204\322\253\214\010\221\361\324\351\314\030\0330\266\202\002=A\320D", 6000, "A\371[p\255$\364]A\313\177\322\346\354\270\250h\364\347m0 [*\376\213%\211\025L\263!\224\307ZR\263&\202\324n!\223\3475\374:s\2036\225'\347\356\025N\207\375\337r\011b\037\274", 64 },
{ "\251(R\225\234\026\3011t)IIC\345\235a\345\203\270\201\226\235\000y\024\356\240D\325f\210\200#\332\333\277\266p`\254", 40, "\375\010\333?yf\325\367e\202l70+\257\312\3228CX\2546\235q\203\245\134bk\316/\202O\0152\320D\002\3327\037\013\007>\222\247\351\334\2152\316\310H\304\251\200h\230\360\277Bh#D", 6000, "\030s0\2213\201\230\035\216*s\037\014}d\272{\006\372\177\237\036&\246Ylz\255\345\373s\042\333\034\005\244\235M%_[\026^\361\217\3119[\030\004\311e\205\316\003@\010\322I\017A%\246\370", 64 },
{ "\012'`d\013B\231\266\374\302\004\336\016\202\214\333\0120\246?\302\270a\242\003\334\343\022\341\241\352q/\273\323;z\012\355\306", 40, ")mKR[\252\253\024\321\034\236\033\306\243\360\320\331\300\261\346W\361_\263\226\310\013\346\010:\037\200\333\3300\313\255g\223l\177<\306&#7S\216\325\346\335\027\244s ~#\256\224#\011\214\342G\350\015\021\315\307\335\214\027", 6000, "\023\220\224\005&\237LK\2207\363\221\020\037dL,\0230(\230\017x\375*\272\344\031\351\247\012|g\364\342\022\220\2566\221H\020\200\350\211\011I2\341\3277\3609\250\3164\332\377\370\241\227'\243\340", 64 },
{ "\262\362R(~\026\210J(H\232\034\237\314\321\227\376\272\252\242\226\002<Eo\245[\272\201s\312IKt\341\362\277j\372?", 40, "\253FT\2072\260\012\021", 7000, "\361\330\260\377\214\211\335\310\2328\330?_/\030=\365ec\213>7uC\035\042\242R\377Pl\016\220T\242H\030i\320\215$\254`f\333>\024(\322\364H!\0008NK\000quQ>\027\363\013", 64 },
{ "\230,\310\226\255\024)\207\357`x\314\210l\252\361CC\240|\363t\322X'8Xbz\231\245d\000\003\025]\260;\350\245", 40, "\255\007Y\022Gk\265r\304]\207W\352\027TC", 7000, "\355\353\317\011\342\342f\336v\370\313[a\363\352\234?\371\234\254*\017%=\032}\257\375<\355\000\232q\305I%\327\017\300\032\253md\250\037\032\306\241\320t\211+\231\364\247\375\314[\204'j\322\272\022", 64 },
{ "B ko\350vU=\244~\353q\233\037@\022\215\273J\313\235\376\001\241\237\341\330\000\310\371J#)\335\262\245\000\207\325\023", 40, "\320\265\271\302]5\246-:J\0011Q\355#\373\271]\236;:l.\244", 7000, "HS\236-\206\233bC-0\327\311'=\206\014-\343gW\021\232P\246L\020:C\226\252(,\134M\240FIa[\260\277\225\015\275\376\000\273X\213\033p\241\371b\212\356\272\316\253\204LuK=", 64 },
{ "\210\323\042\001Y\3122\230\004\020\236g\001\016)\260\323.\204Xj2\360\320\343\357aW\214n1`:\277\352\264\376\356\367\227", 40, "X\014\020\274\005N\342\004\211j5=\2640\262B[?U9\334\020\277\341\255\234:mzGD\270", 7000, "\035$\354\365k%\310\367W\3049\001f(\207s\242\376\026\361v&\226\042\361\247\201x\322\212\233$\210\227\214\250I\346\236p\370lp\012a\215\351\217\304:\326(1\013\017\257\243\352!d\261j#'", 64 },
{ "~@<\225p\276\020\313]\245\331^8\017\204>\310\231E)\346\006_\362\236\331\253}x6\316O\237\271\216\000\253\304\371E", 40, "BD\027\320\345\300\267\013H\342\332\216.\227\247G \212\367\207\017i\365\257\212\317\333\351\217<\361b\010Xy|l\037\216^", 7000, ";t\042r\011\377\204\033\036\235%.\271~\235q\355F\264\215\236\250w\022#\255u1\252M\376\267z\337\004\236\346\203.sqh\223\025\002\033BE\204h\317\317x\026K\332;\372\357G\203\362\346\275", 64 },
{ "\027\231\333\257\306\3570\325\033\266\036\204\206#\030\006nT \255\356\277B\331\201\340A{\212ttQ\177y\374\353\254\025\274`", 40, "\321\005\246\023\042\306\027\177Hv\351W\025\0158\315s'\022KX\036~\367<P\203)d\365\013)Z|\317\321\214h\310\274\005`\345\022\304\262R\372", 7000, "\201nK\001\254\2440\024\271I8\334\331W\224dI\042\207\241c8\326 b\202Uk\353i\300do\205\246bF&\316B\375\341\227P\250\372\324\016h\361_\0304i\271a\231a\366n\000\235\245\217", 64 },
{ "\366\322\352PF\300b\247:\201\300\264\312b\320\271Dv\240pz\372\2741\236\364\006z\247\012|\004F\357\267O\261\370\3171", 40, "R\207Q\367X)\022\370\037\245\233}\307\007\3326H\322Z\216\333K\373\334\366\220\362\356}\263\002;\302\346\326\331\245!\315S\252\263j\343\323\331\3619\134\3739\017\317/\241^", 7000, "\371K'\333\224E\026\035\020\033@\315\214\02337\2348\03679\355J\247U\005\033\315\026\201R\333X|uM\0343T\257\277\276\215*\247\002\245\372\264jh\030\307M\037\351\355M\226\017\2357\364~", 64 },
{ "l\272/po\312\302\256\357x\350\335\260T)\224\274@$\263\331\361\275^x\015\256{\007Bf\265+a\257\314\222\261_\313", 40, "H\314\240>/4\247\223\377^z\324_Q\233\206\023\355H\265l0RkB^\241\207\250\366\240\320\340@\376\362\270;\267#\363\277q=%\365I\261\310\3268\201\324x\257\350c\250\256\311\355\2006\366", 7000, "\350\312+\222.\134\265\366+j\362t\042\317\014\307\2450\236\361/\207\324\362\222\360\262Q,I\254s\370\277w\346\203\261s\302\376\300\030\321\224\327\003\371U\016.$\274\256\362\004\016\312A\236O\242i\235", 64 },
{ "\035\376\031\3777\014\372b\372\316\207\314\334\245\242\374\022\233v\226\227A\303B\245\367\006U\032R\006\032\357\205\345\275Xe\344\001", 40, "v\277\337qw\301\203B\207\372N_\216\332\311p\0101\134\035O\232b\314\331\362z\036\005\327\205R\261\024&dSW\255\252\370\315UY\2716\335-DH\260\222\3627\371o\217\313\236\323\365H\310@\226\032\031\256\347lN\302", 7000, "iz\243\257\217P\205\341\3410t\250\341\244k\351\022\334\311\347I\221\216\244h\352\242y\355\253\374y\323\237g3\235J\232D}\333\310\217p\220\231\304U\026Kf\350\013\365\251\042\275\334\306e9\234e", 64 },
{ "so|\334\340\356\262\312\334\317@GX{l\234\03104Tw!'\332\237a\270\271\0246\333\31447M)3?\036\357", 40, "\357\2626\371\375L\006Q", 8000, "[\347\034s\255S\2004\012\233*\013c_\343\277\213p\314r\274@\373\230\252):;+\007\232D\276\3402\372\300\330\3713\307\227\303H`\376c<<\306\252\251\0241]u\256u\272U\332@l\330", 64 },
{ "\222y\345\357\037\366\020t\321\270\236H\262\273]\244@\253o\365\224\376,tN\245?^\216\034{\361\240`\022\001Q\354\362\357", 40, "\356\310w\353\307t\362\346'\204\202.\277\207\310\341", 8000, "\350\247\235\274\265\301\315\232Fj\366\3460\255\225*C\203G\033\320]\311j\273\264B\276\202\370\274&O\303\374\327$\373\023%7kX\0061\212\274\252\3371\332\213\232\313Cn\353\364U\326\215\352\347*", 64 },
{ "I\221@)\032\264\220^\211\253\025\222\202\236z\335\177\333\225\247\134\321\377\217\321\224\024Ve\304\364\302G3(3Y\266\221\020", 40, "%\242\270\266\326\262\215|\351\353\370B\336\312g\222\343\227\366z\341\036\207=", 8000, "\234D\201\323^\351\320\034\2358\026\360\032fU\357\030\234P\354\247/N\250J\355\011&;\277\134Z\024\343o\262\270\206m\253\254\366\375:<r\020\314\277\277\302\262cQ\202\3358\311D\253\365\342,6", 64 },
{ "\346\273\005\267\036\367\210\203EO\307\327\260\221\314W\202A\307\042p\230\322\030\025/\235\270k\212\203\245&bl\232\326\274\353y", 40, "\204\002BA5L\033g\373\203\354c\134sb\350\004\264\267\034T\034.\306\005\353\032p\357$A'", 8000, "E\312\203\323\236\305,\225\377\343s^\354\025\325\241~\035\230q\316`C\200\371{\361\240E_\270\206T\231\323\202YXHA\377G\251\230\343\012d\007F\035\230U\014\025&NIa\241\376\005C0%", 64 },
{ "\373\256X\365\013-\301\314y\357x\002\354\235\366\272n\021d\325\341\026y\346\271*\020\317-\371\337\301\034L\305r\024v\270\331", 40, "\202P\205\367\346\016C\300&\257\346U\357'\274Y\213\310\321Jp\275\242\335W\2311\260\200\233\243v\357T\313\030\355\224\250\261", 8000, "\256q\200&n\301\330\300\200\3450\2610\0228\313\027\363\334\344\317\252\314V9x\232\356/j\034\000\305\236\366\306\307d#\253\240}\023GC\032n\211\277)\242l\022\026g\246\276Jp<\201\323\312\310", 64 },
{ "\262\211\011\232\006h\205;M\216\327\373\207\327\363\226\342J\264g\256\236\300\014\025\370;\331\222\364\275\272\373\343/\242\264\303\264y", 40, "\016G\014\037\307$v)\231\306\230\231r\213*Q\227<*\351\177\134\334q\321:\351m/\024\241\365*\213\254=7\006:\230\3223\325\326\216\364OY", 8000, "\0362 \353t\315\311\345\034&\016O\365`\026\037s\257\323\345\333\366\352\257M\250,\036\343\017'\323R=\204\021)\240\022sG~\263\335t|\035I@\270xf\003\356\023\340\024\311\211\205s\231\202\024", 64 },
{ "\227x\225\261F\374\302\015\3003\374\331^a\216^\256\265\235\211pgp*\027gk\360\366\350\326$6\365zv\341\373\377\222", 40, "m\303\220\336\354\350\224\231\023?\036\003K\337\255\265A(}\042OL\255\2240\036a\362\263K[\227m\005\346\232,\330+k\244e\251\134\267ys\271o`\316\211H\011J\352", 8000, "\347'\275\025\366\230\006\302@\225\011\011V\330\035\321\212u\361\356\335;\337\300c\2342\267_:v\005t\325C\343\242\251\271,\315'\312\361\200b\271\352a\370=\001\303\251f\371\016\030x1z\216O&", 64 },
{ "\213\253\240\373\200\317\021}\006\021)\366\0036\301+\004:btw\240\307\214q\256T\341:\241TS\025\026\343\027_\033J\015", 40, "\214\302^\251(i\006\315\207\265E\011\033+\224K]\013\303F\307\252u\303\015buJ\250\177R\215\034\353\021\334\216\004\332\266\353s\321\334\327\237\200\022}\033\324\215C\222\263\134f\334\253\274\254\306\027\241", 8000, "\363\346tc#\372H\351\342\372\202Q\005\031\372#\260\274p\354Q\206\210\372m\360s\257\223\363@l\337\201\244\371\255\220\017n\262\253kV\315@\324\240\267\301\250\2674\036\334\352'\372\311\211/\340\325<", 64 },
{ "~\320\005c\367`g+om\315GD\257LX\006L\025\342mD\304\353\333\273*w\207\002\010>\265$\034\321\200\011\261\347", 40, "x\373\357\225\035v\364\3700:\356eB\206\206\266\037L\356ip\301@eI\027\371\253X]]\326$\245D\357\322\007G\214\347\374\350~@h2o\021\001\251\247\224\030\250;}a8\256\247\005$\206\242.\212\261 ^\341\004", 8000, "pQ\266K\355\240CT\242N\326\002\026\241\300w\220\240\026NkK6\201\010N@\177\315\324\276\214\210\333\200\240:iX\216\206\252yy\322\333\330\317_+\235\273\317g\220\134 \203\302D\254$\360N", 64 },
{ "\207\356hc\332\311\262\221\017!\224L`\234\322g\242;\311\030t\240\371\247\304_\367\262\204xz=\306\351\367\007\3268\002\022", 40, "\024\231\371\007*\236k\272", 9000, "\232\035\200\0108\362\327\310\016\210h\244bi\365}v\342\243\034=\366\313\310Is\364\332\360\216\247\231g\352\322\364~R\360v\370\225\225{\034\007\325\305\231\025%\327O\231\272\3101\011\341\356\357\322\204\243", 64 },
{ "\347\232\037t\232\325\134\270\246\231:\000\216\341\364\327\243\233\336\374\233\254:f\234;\261\023T\211^\023\274e\277\331\224\254\361\022", 40, "\231\374k\017\264\022Z\310E\224\373\215G0\323l", 9000, "\242]\315\226Pn@\346\220\257~\134\340\031\325w\0057P\354Z\227\213\004w\255\215\244\305&\020\324\220`NY\262\227B\261\357\337\347\035\35701,jH\237\031\0423\262\321\344W\307\242\042\204\370?", 64 },
{ "\351\222\0071B\005V\022\340\224\323\035\331ry\303\333\214g\374WJ\346\310N\034\027\371H\021K\261b|\212\221k!\227\374", 40, "\235\3570\3671\254\004\034^:g3\274\230\042\314F\310\274\355\226\001\253\315", 9000, "#\335\027Q\374\272[\264x\366?\330\347\372N\366b\336\306[<5\314J\333%\223\321\016\266\333x\251\036W\266\336v\212\332\333\3400\006\302 \334\370{h\015n\374Q\276\026M\244P\026\253\352`\206", 64 },
{ "A9\335N\304O\264hp\360\036V\277c{\356\037$S\331\272\246\023#\254\341\345\252\372{\213q\005a\022\202 \336G\032", 40, "r\333\017\004\376\276\347\351F\362\241\221\026\211HC\374\032\022\004\0101dU\326(\343*y\2774\370", 9000, "cux \267k\007\254\005\211\304\235G\336\200\207\003tZ\010 WP<\360\3709\037\367\233\377\222\360\210\325Q\351\002/\325\134\234O\275~\363\355:_\267\006\316\362n\012\225\265\210i\2451\355\327Q", 64 },
{ "~\327n\210\367Y\1346o\001\235@\031\265\026\331\247;\262v\347,=\310\212}d\327A+V\372\246\011\034F\307r\021\236", 40, "=\232\244p\320Q\003B\224,\020}\340\267\270o\2408\321\256\261\360\332\211\346qM\345\276\004lS\270\010\336|\274\215\224\257", 9000, "\255\314\336\220vu\346\367\321\212W5\010+J\134\275\310\202\350\334\214\252,f\205t\2525\252\344\344\023\277G`<\353=1h\257\326U\025SY\027\352 x\340\026\272\363[\016{B\364T\347\337\025", 64 },
{ "&\007\346\021Eya_^(\217&\372\222\020X\246\367Q\015o,y\240\273\357\352\345\321\005\264p\031\034}e\244\274\003\247", 40, "\341E\304{\336\344\364w\231.Q)\334c\3024\305V\375jvam\004:\235\312\305t{T\205w\313\374\021\345\251\023l\264\036\325u\375\352\3710", 9000, "M\2779\257\330,\023S\354jg\345M\306tTW\036)\015%{\313\032\005\261_\377\370w\220\360N\266\366H\222U;\032`\031\261xzOS\356~\327\232\030\017\321!\334.\216\271\203\205\246\304]", 64 },
{ "\214e\042X\244P>-7\351\310\252\242\311\223\032PFX\215,\333\313\036N\0322\322\325\3340\366\242\226\366K\345y~\306", 40, "\134\307Ui \271\307\301p\225)\267\024\373\303\363v\214\002\017\270#\300\321\024e\025\371\025\305Y\252w;;\327\357\337\351\2130\244,\252\005\316D2\375\261\034^\367Ar\002", 9000, "_\227\217\237;:(\330\254\277(\202\301\303W>\346\372x\012#8\272\244G\371\134\214S\301\252\010\241\315\313\362\027\035\203\023zUV%\347\337\354,\225\375\345\275e]U\234.\007\023-\320o\272X", 64 },
{ "\254|F\033\270\264\331\247\266.9\233\013\212\036\3258H\203}\237\003\267O\325\317\336\375XC\220\362n\241d0\256\012E%", 40, "\340$\356g^;\224Y\340\2251\367\212\235\134\264\216\316\023\316;s\3010\272\340\242\313\244\206\310\354J\305\264\021\334\265\216g\331\304E\212r\010\341\224D\252d0\333F\246\212)\220\313\007W\2412\323", 9000, "\207w8\211 T\261\360\276u.\263)\252\303\233\270\317p\352\213G;\021-\025\2572C\250U\260\031\263\025?\343\216bs\042'\341[\007\242\337\342\022\374\207\237L\266\005\3305\305\366\335\231SDx", 64 },
{ "\212\341\3665{\373\267\340\360b/\234\313\327\235N\242%\334\246\274\216\024\350\304\134\271\321\0316P\013$\332\370\346\010r\351\326", 40, "\372\263P1\315\027\012\301u)\234\334\365\211\333\310g\303\203\240a\312_\276\2755\333\324r\275l\014\2311\356,\017\272\010t\033\354$\010\347`\321\235A\221\311\205\327\276\310\257\305h\262\245\315\204\366\334\013\313\363\027\303\216\202\015", 9000, "\257\316\015\202\024\245\365\303#%\303\351L\327\332L^\317j\370\250\261\337\177\277\276\321\302\246i\275\270\324\311\224\264\252\024\346\262Q9^\001\205\223l\250\343\007+\372\344w\270\350\372\350\326K\015v\346\014", 64 },
{ "\031tE\340P\214\336\351\311:\226@\254\206?MP\247\224d\271\251\266y_\036\371_\134\275\227\333\311\235Sb\307;\272\024\303\302\373\007M\3414\037", 48, "\021\201\255\007\253>\337z", 100, "\177?Y\235<\025\237c-q\203\035K\253_\276bE\236?L\220\016\237d\317W\376\337C}|\370d\000\004\304\331sJ\264\251\345\322\011\033\352k\341\272\323-\003\313ss\020F\201\021Yy\274\370", 64 },
{ "\361\225EV\034Lo\324\302\177\265\004\352\340\300\271K\372\263'b=\021\014<\244\035I\231\276\270\273o#\334P\227\317\364\026W\316\267\033\030L;\331", 48, "\347\276C\014\313y\201\013\217\230|\315\356=\256\213", 100, "\373\302\027\231[\013&'\375J2)\3601\356\260\356\226\377q?9\342\027\023\255\346\2219\302\301\256k\004\224\005\361\027\301d\255\322g\375\177\033\302\226V\232Iu\300\000W\364\010'd\033'\002\271\243", 64 },
{ "\232)\225y\274\233\203\256O[*\212\311\217Cr\005\332\031]I\212H\327\370e\203k;\340G\263>\321x\214s\350\262{\276\042f\370n-\325c", 48, "\317\277C\314B3!\207\217\214Y4m#\202\036\011\264\206\310L,}\225", 100, "U\263q5\313\207\331.v\021z\020I\204g\322\255+\326<\304@d\256d\020\203\205\342m\237!\337\005\261\353\302\216\215)\334\235-t\203\303\324P\3069d\314\253\301u\223\223\303\224yA\325\311\206", 64 },
{ "gk\0051\366\256\225\374T*:8\016\307\211\042\332\356\020\206?\014\353 UK\256\300)\371\274\356c\374\250\042\311\377\275\242\334\276\247\311\015\001\321g", 48, "K\346\020\021 \322\220\223\362\0178i\341\312b\223\200\241\310\011\027\020bR\343G\305\211\220\340\315\004", 100, "\3516\020\200.\042\206\302\212K\340\037\370\271@x\0013\251\301\012k\272\352wA\216\006y\270%.\343?\341\237\253A\236\232\377\217\240(\002W\345\311.Z\327\224K\304\015\251\200\252C\021\316]X\307", 64 },
{ "\241\243\332j\033\357\354S\364\247\334i\302\264[>8\351\326;A\030\003F\270\016S\320\014*\013\3555\320\270D\226\371`v\003\357\331\326\306\231\311&", 48, "\026|\301 \027`\301\032\2317\230\246\376\352>R D\250\263!\250^Q]H8\322\217\2377N@\341$\273\341\031\306\357", 100, "\377\025\011\030Ve\223\272K\275\230\002&=V\271\2043\243\013\004\270\016\201\377z1\335\241\005q\035\016\016-\314XR\177\3371N\252RR\206v\351\032q\370\207\321\033*\3410\277yjA\320\236X", 64 },
{ "\304\2053\034\271~\263W\025\300\311\253\321\265\201\303s\336s\262\230\212-\374\3737\336\331\0256\205\226o sp\264\274B\267\356\034\362\0130B\255R", 48, "\376\306\264\014\224\245\200\022\344\367\353\213s\376J\261U\200Q\371\330!\263\206\360\251\351_\0140\205\004\255\257\205\261\017\243[U\351\372~:\0350\211~", 100, "\272a\373KE\010KD\001\361\134\311\345Z\005\341H\036\035\324.r\233O\037;\217Z>\273\355\267\035=\204\215\017%\270,\256&p\212YI\356\246RL(\025Y\026Yd\237\264p\364\244\134\011\361", 64 },
{ "\246nj~QCr|u\223\234\331<-\226\320|\356\360\236j\273hr\021R4\254\034\345\032\025\262\037\042S\274\216\236%\375\361\224\006\243\357f\335", 48, "\200\025\363A\033\210\2445\333\263&\244\002R\026\227\221\024\177\236\201\2766^.\250\262\240W:\352\334F\233\210Hf\022\273\305-\273\312\246\274\256\257v\344\361\346\333\233\216\375\033", 100, "\336\007\257\321\234\327\323\354\251\223\244\266\331&\032\352\220\335ZJ\000\002\222y-\022\3648\256'\355\003\256\333\211\276\321fY'u\252\017\202U\353\0123G\012R\002\206\374\023\026\341@\356\202\330\243\357\017", 64 },
{ "\334^\236\035+\253\251\261\313#*C\273\226\221\266\223W:\322f\340F\234\241\277\031\002\263\340\347\271\017<\025\261\334<AU\315OIv\344:\024\037", 48, "\202+\226\014pS\017\366B\211R'\301n\242}\231GsMa\363Dn\233\001s\230z\037\232\3155\002\317\362nu\341z\375\346\370YV\325\217\306\042\004\2313\0246\225\202d\266\025_\375[&\302", 100, "\3634:\235n\204\257I\263Rg\300\006c\262\350\226\015\004\312\373\326\263G\261\234\265\014_\020\334,\372\243\204\003\017\204>G\313\035\343\042~\342\320\221\2420\042<2ZN\227Z}\221\231\216\134\334\263", 64 },
{ "\322<\332T\271\207f\242\337\256P\376\331\274\220E\351\251\331b\324{\261\315\353\237~\267\134O0P\244\205\334D@AR\020Q\305!\217}\204'\034", 48, "\134\277\013\215[R+\223V;yS\134\334~\311\351\017\321\246k\0349\207\300\221\332T1\227z7\256\003\371Wh\313]m\037G)4\257\177\031\373I\353\227\355\3219\365g4\010\362\243O\251\333\342\015\300\227\205M-\303\261", 100, "Z\032\013\325z\312$7B\024\241\035?$5\005\374h\300b\267\375Ah\251\311\210l\200\323M\333}\203XIf@\367\222\261\357T\301\256(\004'60\334\304\255\237h\300\361, \336\331(\364\335", 64 },
{ "\333'(\350\331\304A]*\271\315\031\002\372\361\011\035\211\317'\010\355\320.\376\265\262\343F\222A\006\312\037k\224_\327\003\312\256x\337>\304\205\2778", 48, "\215a\037X\3719K(", 200, "\203\363`'\026\233\226/+\260O%\306s\361\015\257\363w\326\042\212\250V\025\023\271\344\351/73\211\206G\2627\355Y8p\324\224\335\242\213\247DJ&\343\031]\362\343cQ\360D_\031\300A\005", 64 },
{ "y\042\366\351\206\036<\213\015Y\013Jb\245,\200bcRZ\253\013\034\346\276,\352\221\365{m\215\255(\251\274aA\231Qo\314\220\000\215[\025_", 48, "/\272\034\233d\274\376i\001\316s5,.qf", 200, "\301\322mH\217C4\207\042\375a\020[\315#$\336\264\012-\236\372\247A\323p\016\370e#6\221\224w\305\331l;A\233\374\311\231\030\236\244\022\002\336\313\202\300\333@)\316\325\042\017Wl\010\352\244", 64 },
{ "\243\034\205\371_\266\334W\037\345\300+@*7\033DN+\025\366\316\235\3720\177\267J\007\004\3030a\356\245!{/Ph8\223\037 %;\320~", 48, "\211\332\202T\321|k\027\207d!\223x\036*O\210U\005\032m\245\306\276", 200, "\214$\026\211\256*\222r|\334\364\000\232\005/I\277\030\015\264\336\344\000q7\235G\327\274AKx\221\257:\004\244:?\030\257^r:\251\312vj\036V\304\231K\317\325\215\015\202?\305\357\225\311\223", 64 },
{ "BS\204Y\226\027rk\273\322\022uFq2\343\324\373x~?\026\003\350$\370\276\242\314\374\177\325Z'\035uh\2213\204Z\314\340\243\221=g\037", 48, "<\225\331HzR\273\272\323c\203\312Z\302\344\226q\305\0241AE\042\251\336\274r<+_X\244", 200, "k\042\212\314OLc\3329\373a\353\256\316\2749>=\244P\260\134x,w\006\203\000L\004\230\223\025&)\241:\255\226\210\265K~)%\134a^\236\215I\023\3725\346Z\327\204\221\350\032\334\376\355", 64 },
{ "\025B\316\263\210\305R\004\013\362\2013\345)\237\023\006uR\305a\366\347\310\001\215\246\021|\014\006~\340\274\335\302\017~\350C\310\0151\204&\015_\332", 48, "\243j\023\234O\272\233|\212\264\2748\340\023\240\360j\314,\213H\367\344=\320\205\336\312\333O\314\344\002\230\316\362e\347\033x", 200, "\341u\033\206O\346\300\206_!\331>\002\203\273\352\351i\007\272\371 \2139:\353\231\255\015\223\262\035\355\375W\213\004\237>&f\042xi\242\266\365g,h\350\324\007\271dt\350\323\267\317\232\346G\247", 64 },
{ "3\303\365\236\271x\021y\227j\002\351\255\225&+{\221\326cUA\331\315\012\325X\035.\014\037\215ng$\370\345gG`\004\353\305\366\226\350\344t", 48, "\366@\247\226\256\020\017\215w\241/F-\033\315\347\204\250\252/\277\336\337\022\211\365\314\036\204z\261\226T\016o2\361}\321A\256\017\270>c\216\010\231", 200, "i\350\326-\342\324\032\205\034>U\346\2228q\207\207Z~\315\375\253\317\222>\373\035\212\021Kiq\316\352\036\3025\037\220\011g7!NHAO\332\257\220\304\206\202\236\246c*\3167\227\024\234U\207", 64 },
{ "\311\3651R\231\201cT@H_\210\352\224;\273)\3454n\213R\377\022Z\244[\222z!\234\004\3760\3162m\310\333}\022\353J\016Vb\367\245", 48, "\267G\341\021\361\231D\345\301\325\277\376g\305\256\2147\271\202Q\320\341\034M\333\251wz\247'\274\311\373\037\263\250\345\233\004\337\345l\325\321\266\370k\222\017M\030'n\033\210\363", 200, "zq/h\233Q\377\001\007i\020d\371\241\217\354\307\022$h\236\210\210\042\233\370=\246\323\236o\222\337;\316\213+\332\251\343\020\320\006\003g\013\025\230\250p\263\252\367\362+L\304\213\356\222P\317\024:", 64 },
{ "\030\263\375\013(\031\042\343_\203P#\310\021v\261LD\272\340\025\214\214\257\216\345\030Y\373\011\303ei\005Ni\351\274\301\233&\177\315\327b\2152\234", 48, "a\314:\244\203,G\3300\354O\351\365^}-C\261\323\264D\347T\032\343\306\260`\217\365\377\355\272\031\010+\354#hm\032\030\317\231\311^k\307x\273(b\377\216P<TW$\307\261\237\033\024", 200, "Y\247\035I`\256\255\214\310\241\015\026lS\012\221$\306\301,\236\243\244\267\356R\371\361\252j\232\336v_\134\241\036\347\177\030\232\341m\275\321\004V\302\004\257\313\326\252\213\273\017\022DjThp\310\010", 64 },
{ "\331\034\367\005\345\315\220R\216\265\011\251M\376\301\344\245\215\3747\243\374\013]\342?6\325\027\222\317\322\364\214^D\351\235\374\205E\246\303\346\235\375z\301", 48, "Gk)\360\264'\264\352\010Bk4\207\214\377,\246is' \336\2467\257?\244\336&OU\324\227\206n\231\205\277x\244@\220\273\017\323\200\026\230\310\177rx\346g?\275\036\255\303\350\010\231\302\306AI\313\177\256Q\225Z", 200, "\302\317\001\330\016\375\277\254\207G\265}y\242.\311\275\323n\344\030)\007\207\222\321\245\013\026Gm\327\301\261\013\350>S~\213(\2049B\331\031\210LR\030\304\017\276\033\231\243\013\005l\213\356\371\250\373", 64 },
{ "7\203E@\331\362\342v\215H\331TC\026\203\3529\3126%u\000\371\243Y\356\345\012\216r\010U&\255\250\230\374j}w3X\344i\005\375\251\357", 48, ">yI\373BV\344\272", 300, "\320!\237\325\213\376WNEzz\377\263\027\376o3\337\275\021\042{\031\275b_\276\037\255\362r\273\033\333i\032\235\331P1\022\222\366o\002\026J\272\254=<@\325\333\310\314s\206\322\222\217\003\261\253", 64 },
{ "\243^\316\005Lgw%\224?\224\312\327\213`#t<Ws\267i\355X\350v\335\376\200Q\042)^\303\242l\2570\031s;\323\331T\317\355\204\325", 48, "\354j\360L\225\263z\373\344\214\303\232\025H,\222", 300, "K0o\374\235z\027\311o\303\233)\230s\322\354\0076\334\302\232\002\324E\323\027\354\025E9\363Z\016\340(>\212\016z_\253\334M\004\366-u\001\213\210W\276\351\230\026\356k\214\001d\010\332\000\364", 64 },
{ "\023\134;\300q\314\030\265\207\212\361\313\372\264\332X\243\264(\256(v\253}o\177\213\311\032\257\255o\323\372\201~\315\211.0\271\302T\340\353\267\235i", 48, "D\212\335qs\015\003\036\222\2433\1777Y\304\203\010\354\344\224\211\225HU", 300, "\026\377.\360\022\037?\020\355S-R\016\007eQ\037\346\240\011\256f\247\220\275\316\322P\235,A\003\203\356\265_\013\263v\001\205\033\240\332T0.KQ#\023<\363\321\365'\214[\3431\021\042=4", 64 },
{ "i\370\260\321E#\005\300\262\243\307\235l\134\036\300\246\317i\303\357nc\011\026\244]\323\336m0\254\343\222\036\242\316(v\253,1\013\272?\226\316\324", 48, "j\207\261d\374\353\025\324%B\3405\277\242\221vw\362.\371z\231\256\3656\205\235\025\247w\010:", 300, "\202\272\354t-\235\251\270+\342\276\221\177\315'\300\0139\257\362K\010G\350Xq\252.\007\000\277GU`\221}\36154\027\004\330\017\336\350\015\255=\330\274.\340\231\257\002-\005\315c\221\270eo\001", 64 },
{ "\227a8\244\377H\027\274=\343\334\340\007\366\363\017\202\216F\330\274\351\376`\326\326\301\273\230\217H\2314\242\370tSFKZ\373)5\235\231\360IQ", 48, "\221G\231\014\177\335\260\337>\302c\361z\357(x\252\023\245\026:\242\377\016\036G\020nv\134\305W\010\007\214\201\300\242\370+", 300, "\220\134\335]\016y\345X\015\331\252Rtn\202p\360\370\363T],\265\246J\003\327pw\327d8Z\201u\023\316O\310\034fG\034\273\266S:q3\013 \322$\313\0035\371)\307\320\277\352\3237", 64 },
{ "\377\223\322V\2421\377\021;\314A\312\013I\002`*\005\206\310`P\212\210r\267\352y\207'\001Le+\177\035\215\362%\227$\023\366\367riop", 48, "\010\213-\360\006\216\252\220\242C\241m\001\005D\017\274\206\220\007\004\134\273\213\303U\274K+\276:\212\011\275\027\024\212\032xet\2322Ml\3006\003", 300, "E\007\311b\314\240\305\203G\221|\007\203x\245u\261\042^\000\237o\205\252\002\272\343\372\376u\360\217iWRTE\0233]\250\267^\036\237\341\255o`\301\177\3269cM\253\235\232N\342g\007\021\032", 64 },
{ "W(\0051\335}\220:N\267EJ\316{\242\334\006M\0343\347-\217\364=\314@\270\274\035w\242\304h\301*P\177\252\346\310\022m\237\017T\271\376", 48, "\310\204\034\365\366\004\3349\213\306;\215D\255\214<4\317@\274\261\272\343B\343\034Q\374\315?1Q\317\037*\002\306\244)\203~\005`\256\335\375\316l\322R\234B\214\265\370\203", 300, "\035\014\134\361\032l~\346\263\261\204\352\2608\012\261\3559D.\014\342\134\253\335\266\000(\003\300\022\200\003\037L\343{\201\364\242o\342\301F\367\222B\211\325\226\027[n\363(\273\341x\330H\256\346l\307", 64 },
{ "\273\305O\363\244\251\012RTN[O<\200:x\371\134\252Z-\221\030'\217\032\222\177\253\321M\321\257\226G\365\335\203\347(7\310\005\262\312\366+o", 48, "C+k\220G\014P\262P\347\343w|\262\376\021\241Zp\200}\206I\310\364Ex\343z\255\263\240\267\005\274c \276\236i\031/<\200R\307B9\207zRU\307X\005\251v:H*w\033M\310", 300, "u\315O\345\351-\037:C:\266\343\334P\352\377\020XX\206\343s\306\331\260\215\015\362m\000\233H\035\271{\272\374\232\253\035y\320\270\015\367\240\304\372\277\021\356\237\376\276\355\273\370p\322\304\314N\212\031", 64 },
{ "\037\377\234r\001=\326\224fV\371b\277dT\313\211\342\022\3301O\023\333\325E+^j*\266w*\016\355\217-\210\315\314\323Io\260\254\200\027f", 48, "\366\1344\335j\302\272\357\030\213\010)Z\200\303\256\252\002\236w\375t\206\272\002X\364\277\214\017g\016\213'\346|em\277\271\303\262\277\236\217\012\220\210\225R\325\363n\042\031]\245\323\355w\002\305:\324u\376\225\332\300\247\300\244", 300, "\310\366\343\314Ew\224/\024\374\010F\315\303\005\266A\346Nh\271h\027\273aL\371\024L\276\035\327\3775\001\361\247?\035\366+\361\331\021\250f\343^\231\015\334\265-\015\207\324\377\213\242\235\225\325\342\202", 64 },
{ "q\216\352\220\031\240\322?\257\356\011\021A\025\366\2248gI\362\345l\024zM\215h`\360\354\042pW\242\201\177\372\324c6@~vf]m\315\270", 48, "\336\322H\015\245\215L\261", 400, "~5\026|\306\036\242\241X8\335\301_\333\342R\256W\361\337\3755R\0067\014v\203\345r?\350\365$+\365\326\353\241\351\345Q\377\203v\333g\251\260\265\235#\250Zzu\364/\322\342:9\020\312", 64 },
{ "\254\002\323B\222\254\231\261\351\216\333\242\326`\343\223\134\243\236\217\030\311;q\323\257\337\267U\336\270\255\321\247s\042Ys\326u\324R\344\335\020\241m\256", 48, "\325\331%W\363v\345W\025DJ\267 \364vS", 400, "\235\322\177\312r]1sV{\202',\003\364\230X\005\316\021\301r9\323\214g\223\357\322i\210\355\032\205+Kh\037\247\216\360\247\024 \372\023\263[\266\033\213I\335\234u\030\007\311>\312\004\247\377\242", 64 },
{ "\265\265e\302\307_\364\373\276.\2365g\272\004q$\030v\017r^\333\333\354<\302\020\343\232\376\215\031\2677a:\213\231\277S\232\261\017\010\042\241\361", 48, "\012\336\215\206T\254~\376\336\370\250_\362\017\336G\370\026Q\214\302\3651~", 400, "\025\0248\217\317\026\016\213\3650\257\203??\206\015\310\034y(5\365\265\277\344\342~w\336\220\004\335>\2166D\002a?\017\341\373\345K\274l\336f\304k!W\344\377\315O\023\217\303\243\366%\200p", 64 },
{ "\340\263\354\340u\240\277Vg\021\256\236\340\215\342u\323\230\306\225)CE\013\330 v.\005\216\3626\007P\342\134bF5\277\021o\030\020\042\341W\333", 48, "\333\203@\327\021g\014\204\347\341G\300/D\226\363\366,m.\212\204gyyv\224\277\376\3474\224", 400, "\366K\013\224\363[\340\332\217\030\377~\236\344\251\241I\015DV>v\244\2319\254}\316\010\270\375Zob\025\354f\262\240}\231\316\310D\347\216\342\332\266\340\007\246\213\215!\022d\352rC\345w\320\301", 64 },
{ "n\331\266k\177\321H\344\257\006M\206\270\313\010\035\226\3450z\345\235\213D\010\342,Dk\233\344x\2470y'^\353Y\264\177\012\220^\231\037'\322", 48, "#sr\373\330\006SzghX\015\241\336\340[\246\235\345\273x\303\020<\357\377\347t\222\323L\333\302\354}e\342\2500\232", 400, "#F\335T+\356\202S\240\036\262\301\212\035M\211\303\254\212a\313\270\263m\360\274\325#\225\241\222\333\010\244n\202\334e\353C%\364\3125\340\226\006\336Y0.\272qy\375\202g}\330\300\234\347\333[", 64 },
{ ",\250f`d\312\224o\3502_\307\205q\231(\032\260\346\356&\274\224\201}\307?8-\241\270?lF\177\230d\313T\3034[-\000\2478J\232", 48, "\304]\024\312\306\300\227\350o}\211g\265Y\375\353\245\026\033S;\350\247n\326{7\340\352\260\366\257\206P\207\204#%\032IA\325\250\210DYAO", 400, "b\273\002\314\350|E\207\361\362C\215{\200\037\315\253\034K\275\201\273\217UQ\364\223\326s\215\330e\014V\241\376?\315k\134a\360\241M\317\266\312F?\032\332\036\347\312\216\341\362\031Wy\234\026d\323", 64 },
{ "&\334>B\230\255\211J\214\377\011\243\316\006\240J\320l\007\353\335\343\332\3404\031\3302j\330\214(%<i\254\232G\206-~Vw\361*\226x\042", 48, "\256l\314+\350\021\200V\202k^y)\036!I\252\346\317\202\302\252!\232f\2167\316\232\254\272\027c{\265\006HYxl\320,\324ge5\012T\243\305\333\331\034*cf", 400, "i\253!cG\312\257\317\2517\221\337\022>\210wa_\021M\016\363x|\351\264q\252\247\037q\204\260\252\207\363\334\022\305\303(\014\254kh^\3033>1\257\232\267K9\321\252bj\231~\300\363O", 64 },
{ "]\332?$\004\366\254\016\341:E\226x\306E/\020G\020m\026I\377\276\3517\331,\215\3616G\214\242\004\244\3532@\323\011\366\223\017}\327l\241", 48, "k\306\002\317\350d\233|\226J1\304\207_\012\134p\265/\324X\377c\323\247\315\353\213(y\011k\316R4\002\010~\355B\343\004\233A\361\215\202\360\350\225l\272\237\037\231\370M\014\272\350\376\373\304\016", 400, "F\306+R\313\313\356T]\265Q\302M\033,\302]0N\336\324\247\376\036r\200\000\177XH^\326}\032F\301(\267\322\005\317\210\276\345\360>b\311k#\236\232\230\001\261\334i\324dovY\276\016", 64 },
{ "\3002\251i\014\011\374s\231\015kG\350\042\210\134\315G\301Y\247\360({\214\233\265?\262\235.f\354\001a\177\025\002\333,\253Fk\246)\033\265\247", 48, "\022\026\023\327;\252\020\230\316\273D 2\2074-\332\305\324H\236-\376\243\023\200h\235[|\245\033\311\025`9iw\356\330`\366\252\305\342\013\202\201\363K\0048\177\274[\013\0050\026\226\353S#\354\016\326y`\273cA\014", 400, "\321\352\231\215\0032\300\237\2400\015\276\334=\241\211\220\025q\201q\375\205!\314\036'\032\215\205\0041\245\032j\220j\274\233\237\177\034~%s%\317\265\037|>\037\247\021$\255\305\244@\304\227iJ\024", 64 },
{ "\347\261\210\236[\316\372Q\373\250a]\234\250\256`\354\007u3\325\363(w\237\356*\212\012\367S\302\3633\016<\201\267\275C9\355\313\366oT\233F", 48, "(\350\024\322\324\365?V", 500, "\216\260OQ\232\243\336\366\227\227.6\271\255:\375d\272\255:\262<\376P\2549\0140v\276p\355\312\315q>cW\004\256k\177\200\352\373\134\035\230+\275E\242\341Z\331a9\305wnc\033;\341", 64 },
{ "\332\321\232\255=\252\364\2101\220\275\324\022)\272.,\207\005\354\260\373*Tp\332\213\002\2209\302\225\377UN\371\226\271\347\035\344\016\314$Z\005IB", 48, "h\225/\013\200\311\354\235\201\312\212<\310i8\015", 500, "u/#\332\222d\355\2471*\030bp\331$Q\254[\252\232\223\365b\243\274\216)\302u\244,U\317b\015~\307\343\032\351\333\025\243L\201\256B\223l\013\200\267M\035D\346\203\324\301\037Q\000\007\226", 64 },
{ "\345\3040\031\263\343t\315q<\316_\202\027\247X\240_\301\275;\203\244\363\257\257\200fm\334\370L\216<5\313?\305\211W\262\001\314\212D\237X\332", 48, "\367\215)\3624\242s0\026R7H\242O\221v9\316\236L\321h\321A", 500, "\246\314\355\264\242\254\245\2515~\235\036jS\276\307\364\204'\272I\310UY\256\300(\276R\313\336\007__\031E\240\300/\355\302\253+<slD\374\134\334\217D\017\277\213\313\012\257\345\264u#\230+", 64 },
{ ")<\202\025c\336\000\134\314\322\362R]\267\016\315M\024L0A\212`\3066\241\331\332\360Z\346\026[\374\224\322\252\356f\034\275,j>Z\213\244\262", 48, "Ub\241\246\347Ra\255\251\336\265#K\007\226\252\220\300\013\207\037\330\325\347\332U}\377\031|\270\341", 500, "R\2132\007\270\222\307\022\200\364k\005H\305g\371d\243R\215Q\235\024\006\352t\320-\317\356\374?\367kW\353\006\253\355\220Z;\227t\306)\034\134\314=/\376\206\200$\226\211\007`\374\323\215\365X", 64 },
{ "pJ\004^n@\211\310I\346\177\373 \366+\036w\030\022\211v\316\257E!\344\2632\234\355T\216\003\336\213f\262<,\302J\302\304\363@\224\310\267", 48, "\343%\240\355?TI\033n\020\017\177\317\256\325N\015\251|\011\347z\200<\271\3260\213\260EV\312\327\030\313\357We\033\313", 500, "\342\014o\300\351l\227\010\364\241!v7\252\370\325\202\325\002R\347\264VT\022\361z\303\310\036\203Q[\357\367r\262\375I\245\377.\221\320\023P\336\377W\273c.\3756c\277\273\233:p\330\325\042\226", 64 },
{ "\210ll\2324T\257k\254\312\330\015\341S\301\377\355\212D\265\014N\260\202v\254\306.\371\264\264\347\270%\313\241\307\030\250\240S\340I\010\261\026+\322", 48, "AU6\242\222QF\265\340\334z~\264\340\232k\011bK\313\377|!\377\355p7\241[\302d\274Gb\032G\266\017O\250\373I\2458\340\012\217\025", 500, "\247\301.V\025C\231\205\373Jnl\326\2618\212\313m\210y,G\020\007\354oQ&|\270i\031B%#\232\311\3333\353_.gQ&[\010\262\2363N\321@\376\034\000\213\023\236\305\000\311\226\042", 64 },
{ "0\326\250\274~\355\236\276X#\262\307\275K(e/\257\266\344\212\234\325h>\322\321\023 d\0236\203\2079> 3\345 z\343\362\271\335\0155x", 48, "\005\230c\213\230{\007i'\013\361ABj\027h\264o\307+\004\374\233\223\332\025m\134<\250\242\257\267\024\215\243\025\030\210\324\024\030\243\3245\001\021\335\3000\274\211\364\033\3308", 500, "\341\304\000\2766\033v\3629UDS\225wg\213\331\360\244\367\252\372\034L\373\307\273\377IP\207\247V\273AK\324V\234\263_\263\263\036\004 uH\202\340\213b\236\254\336\375\203\017\247\362\016q\220\346", 64 },
{ "\237V\2613\263e\030*\265P\032\345\337d\301\335\255\030\217|Q?\026\346Tz\012\015\367 Z\312\344\201$\240\235\031\377|5H\345\215\301\015t\327", 48, "\301z|\375\223\324\351Y\177\325\372\031\244#\227v\311\322\316\306?v.F\037\221G\233\346?\377\200\237\224\343\011\353_\362M\042\301yi\030\260\201=\177\351\260\264w\005\250\214v\205\354\336\010\363\365\004", 500, "\362n\263\316\332^\2014\345\205\300\305\365\376BY\376\236\024idk\032\355u\271yaJ\333\351M\347\331v\015\223#\016\375W\237\025t\030bT\005\316\010\270\024uaW\226\247\213\355K\371\241\031\023", 64 },
{ "Z\324<}Z\312\004\205\034\362\365\225\212^\232\177\257\300(r\267\030\0117\335\270\354\312+4Y\241\042E\315\212\020\033\211]\004&v\306\303\361\277B", 48, "\225h<\331\365\310\362\347oq\354\022\333\021m\232\204a\007(xP;T\302\262q\275\200\206\300\255\206\220\213\354@\333e\033\2401w\241\242\347\264\001.B\042\036}9%Ni\253\205\235\271Z\3507\304U\265\254\3725\236\265", 500, "Z\277\007\350\355e\223\237o\254\371!\243\351\042\350-\016\364\233\247&P3\341\350\205;\247\273O\252Xre\372\362\263\344)SN%\251AF\012\235L\305\222\031nq\017\334HWP\231+\304\036\221", 64 },
{ "\362+\275\020l\220-\027\255\302\003\212L\352\300\371/\042\321y\361\331\224\037X\325Gbd\042V\262\370\177\271\357\314\251BP*S\262\244\014\351{\334", 48, "W\333\001kC\344\327Z", 600, "\347\012+?\027\303\377<\247Y\200\360m\247\332\272\226\273\256\033\254\001\362\266)N\265pVX\033\241\251oI\333\3353\200\270\035\237\265!\026\353Z\030\364m-up;`H\263F\321\233\321!k-", 64 },
{ "\314\311#\207T?\270\042x\212\336\253\220\025\372\314\334\237\020_\254?\312\352\344\320.\333p/\273\351[d\250\012O\361\354\035>\343\327y\251)\254\274", 48, "&\315\257\244q\375jM\260\011\013F\216\326\2114", 600, "\015\316\321x\304\314s\252G\345O~\354c\271\254\371j\002B\317\007\357\345\362\273\230\326\230\320,'\203\335\330f\346%\360\372\257q'\005\177)\240?\240\230\200\364j\027\235\200\266(r-\335\027u^", 64 },
{ "\243V\242\374-\376|\230y\305\314\334\337$\3249bK\360\3320\310\022i)rK\332\206\315a\303\345\011$\261\036\277\001\015$\373n\020\2140\377\351", 48, "Fw\252\245@00\247\345\207\201\236\374\007\267:\260.\202\035\320*\372\234", 600, "q\272\365\007\204%\247\323+\300\214X\374(\236\020\377\277S}\222\304R\016\303\332\033*\2563:f\000\262\215\343G\327\363T:\010\301g\033$\251\307\264\230m\315\226\271\234\343\363\374\010`\012\247\377\263", 64 },
{ "LB\232)\011\316\200\323\234>\215\367\321E\017V\134,\200&a\236\134\370k,\365\350%B\026\275E\006-\031\360>e{\262\303\365Ta:8\033", 48, "zBr\3266zM\310\350\035\361M3\205\357\300\213\215a\306h\365\250\202g\337\241z\275\364\210\301", 600, "\304uC\301t;\321(/WD\0335d\3120\024f<\312g\372\000\032L\337\234#0f%\230\366(e\271\255\024\335\021\215Y\336\373\340O\034\301\256\032\223\330#\342p\325\222<\244\306>(\2753", 64 },
{ ")C1;*\260\313J\252\203\034\314F\371\345\214<m\227\372pAl\327\203[\326\014\236\356\371\354'\005W\301\317\310\310\232; \210t\246\370^\223", 48, "\0036\217t\366`]\266\222\267\001(mr\245r\350\037\202Wr\027\266\031l\243\274\332\357\376\273\211\027\213s\3266E\343H", 600, "\303$\034\015\336\257!\303\352Z\200{\305+\305\375;a\331>\330\210\235\317js3\232\207r\320\036/\034\241\260\014\233~#\375\214\013q\327\025\365\001j\213+v\015t\257\303\352\352*H\257K\306\216", 64 },
{ "\224\321t\031\261\362I\335m.\206\266\227}\223^i\236\276\262\233}\222\306\252\002\206,v\216\257 h\022YL\003\277I\266+p\000P\226\340[A", 48, "(\273\350\346\347k\353\022\022\201\352e\134\317\042\230\031\255\036\317\313?\042g`\231DS \025D\042\350\243\327\210\134\0016\042L\023e=\335\033+!", 600, "\233\23450\212\372m\212\331\233w\270\032\374\373j\002^<\316.\261Ps\247\3500w{\351d^\320\330\254\352\347\233\333\203\364\347\201\260\007\225\274\027\343\311\226T\221\207\265 ;\003\271~\275\237*\260", 64 },
{ "\247\241R\241\303x\201\231\303\2228\270\210\225h\230S\206\376\017\210\256V\215\371\223\031\226\017e\357+\244h\227\273$7\223G\233\322E!\200tB\221", 48, "\324\341\244\226\271\020\034\217\024\010\352\015$\273X\277\302\375\004\011I}?\001\230@\313 \225u\357\312\022\011_t\036\204\012\252\023\345\244\336%\370\243\376i\3665\015Z\357\134\202", 600, "\036\224U\257a\306\355\351O<\372\250\351\014\302\360\020~\361\242\030%\270\033\301\310\014\256\301#\204\341\004\272*lP\351\340\017\274\004\321=\203\271\363\004V\311.>\322\362\365U4\346`0\321\220\276\343", 64 },
{ "\342\223\355\255m\206H\340-\134\367\357\363\242Cy\207\362s\033a\367\377$\332g=7%;\321_u\213%\325,oO\334\256?\241\1770\270\005<", 48, "T\221\256#\230\334^\234\246t\301\256\2019\004\260\240n\374{\006<\375u\020-\361\264\303CW\027c%kF\004\316lf\313\222zr\365\025FC\246\343\351I\330\233\001\345\371i\266s\033c\237+", 600, "\225nTZQ\036\2149\344\253\357\027H5.\276\235\365\252\224:C\014W\303q\257\006\315\004w`r\233l\026S\013\230G\247\035\343_\021\134H@I(\303\257m\356\353\361\354L'A\355V4\362", 64 },
{ "\212\030\031\247\326%\221\3514+@B\027\306\333\274\374\005.oX&e\354\326\255\345\253a\360\232\356\257\343K\374\237\317\023\270\244R(\352\303\034\012@", 48, "\367\231Q\247&y!h\315\323\315Ie\352\330\336\205\332t+t\001c\016c\302pPW\325\313\352Y\007I\320\364\0059x\24245!\0176\275\360\306\276\340\303\011*S\207\275\232\275\006\370\003\300x\313y\301\272\310\364\356\246", 600, "\323\242vD\355X\240\211\213V\235\204oP\327\200\224\365\3275OO\006\232\360\263\273~\255\323\3613\362\365]\255\250r\010\352\366\0308\010\341\310Z\2400\206\242\373V\236\230z\333\241\032\032\303A\234\001", 64 },
{ "\244\324\240 =\357~\230\377N93\227\276\357\224\031 \366o\371\377G\251d\012\013\346\236\351\375\342\227\271\271\346\373\366w\042W\322\310\235\005]B\241", 48, "1\246T\373\275\002\241\246", 700, "1\030\274\257\036\365<E\251m\356.\206\206\364\333\267\271,\205[\367r`X\365a\230\011\0321.N\025\270\204Tv\250\350\014\246\214\260H\265\264_\253b\134\016\042\360\210\362El)\2119!\003j", 64 },
{ "\327\023\345\310\322\203\277\0165\330\354\030C\204\241\036?G\016PU^\223\377\372*WR\215V\3168\226\243J\201\250=\210\037\034\345?\264\306\236\322I", 48, "+/\303EY,\264\024\254\332\223|\371\210f\362", 700, "Ds\250\230\265\306\352\303=\314\020\221\203\330\331\230H\300\015\251YD\037\042\353(\001\262\223\333L6<Z\336\242\037\004\311\012\303OJ\371Ht\261\255\355\371Zq\335\022\364I\330\333#f\272\027\233U", 64 },
{ "\210\036\031\220\267\013=\3369\021\202\220\203R\241a$52\0239\243\365\371\277g\272E\345\241\262\350s\371z\365\364\022\200\322\027\203\345\251\012\232\020F", 48, "\337\345\207>\235S\230\232\301\331\344\261-\205\274\244\257j\007PX\017\037\032", 700, "\360\017\002l\347\336\213\357\000\240t\330\006%\301\341\215f\3521\365i\345\270@\372iT2]\342\345e\311u\3417\274\014\263\261\373\3254\221f\275\343u\321\365\210\365\277y\365]\340\372;\363G|\232", 64 },
{ "\357\217\262f\233\325\3650r\024\267\274\264\221\023\377i\273MUv\215\236I\345\302<\273\325\316\265\274]1RH\270yM\021\000.\332`\247\207=G", 48, "~\214\270*\361C\037\207|x\267\021\333\027\363\3306I_\376\345\355\0267{\042\375\006ap\227\005", 700, "s,\213\3052}\245\352r\353E;\351~U|\333O\276,k\240\177e+\242\024:;^\012\255K4\245\212\042\376\037\245\033\355\042\236p\207\273\3456\257u\005\227\024q\237\312\232lArBH~", 64 },
{ "\0018\243Y\355)\330\007|\373bm\266\337CI\333(\346\235\332\177s\201\340\232;WlO\013\353Iy,\270\300\012\356\357\345\264\321_4\330j\357", 48, "\363uu\356\257\354\022\002\327@\005\344\314H`\250\265\134\005b\3403Y\023\364\333\210\264\2741\351\2079\216\225EJ`&\035", 700, "&$\224\203[\324\0071\206R\231K]\245\215\015\256\376o=Z\223}\262\233\370\370\361\020\012n\377\024c\263O\306\030\004Az\242:\320\316\020\263\037E2\234C\227q\220\232\201Og\247?\265\276\244", 64 },
{ "\217\033d4\231CTki\200\177\035l\364I\370<v\0300\330\334\013\315/^\2334t\315\334\367\247\361\034'\342!\241\006\277\363\252\364E&\335\317", 48, "\260\023\306\245~\274-GK\326\326S\267\212\200\350\260\215\004\310\361\367\212\341\373\035\004\247\212\317X{\211\260\243R\320<\326(\247G\034@\016?\267]", 700, "\200\000\202\325yun\304\207\241\211\237G\340\0352[v\225\042\310d:\345\024[\327t_A\252oi\250\030\376\344}\277\023Ob\013Xiq\226\223\223 Lq\241d\220\323\311\274E\273eL\313c", 64 },
{ "\205H*\371U\266\223\300\330\251\236\305\214u@/\134\366)&\307\033\017#>\042|\360\030.\343\314\311\316\366D\235\355!\316\020 0}\034\030\267\317", 48, "\004\335P\231\267X\217\216c\347\303-\007u\023{\357^\212\255\231TN'\337\374\264\036i\305\220\327[\372h?\321\331\227\012\200\257zc\340\004\221\211\246)\257/^\243u\301", 700, "h\237\233f\334\277-\365e:I\267\2437p\204\350\331\350i\005\267\272\370\257\232\315,,\332\351\315\360K\177\3314\013\341\334\227Wi\252\333;m|:\012%;\210\230\353\030\305<\215\220F\005\343\234", 64 },
{ ")\022\305\306\361\300\211\276\342\335^\263\360\257\015\345\322\2214Z^B\211\002P\343\367=\241\217Z}\023\355`3\221\323H\031\214\307\323O\002\374\221U", 48, "\006\025\224\362\004\313\003\032\304\331\345\373/\372\376\0053\377+\356\314nzI\366\307asa\023\353\227\261^\377\212\353\004j:\377\237\264\203n\326\314\362Jy\320O\217@\227\200B3\021\371Q9\267\033", 700, "\212\261\233,\042\243\250\260\355d\326\256f~\343\274<\225E\277\310a\237\267\276v\312\232U\272\257\177\226\2462]\262\037\365\304\355\336\354\203g\035\311\265\035\206\017My}Lk\222\034K\362\362I\222:", 64 },
{ "\020\240\200\016Q\273\3750\000\0070i&bR*\375`a\224\005v3\030\01362\037\302n7\217\364`\307}[7\352\375\235\134\215\023\333\2273/", 48, "\300\322E\333\374O\2276{!\326/\355\277I{Q\341\031\024`\222\337w.\200\252\003=}\203\315\224\033\034\042\325\311\334Z\215\360\234\221\262D\206\257v<R\331\275\240\215>XN4\360\263\311Nf[x\366\320\205\257\015\201", 700, "k\031\342\357\021U\327\031O\214o\214\265\014|[h{\220S2\275\005j\016\025\230\222\235\002\221\012L\260\234\200`\324\370\134\275V\355}\261\344\306p8\241 \311D\336\341\236\256\243k\312%\225\042Y", 64 },
{ "B';u\226\317C\307z\011\313\345\012=\3379\372M\200\331G\325o\372\014\367\221\001sf\275\355\201\221\033\042{\247tU\347Nf\025\301U\341\267", 48, "\303\2054\237\224\337+\267", 800, "\300:\200 \244\004l1U*\251\235N\006-\263\037\216\257\277\235\366\214\330\256\134)\373\377\242:{\337>\376!\022\037\232R\333(\221\313\353m\322\371\321\236q\373\272\313d\320\355\213]47\243\243\004", 64 },
{ "\224\334X\314\371p\0310\2779rv\320JV\271\217\361\014)\367\024\365\345\006\254\224\254W\342\265\223{Q\2174~\372\312@g\003\015\314\365\242~\347", 48, "[\336y+B\026\336\220\304F\220x\357\277`\042", 800, "\306)\375$\247\2557\307\213\245\306I~\020G6+\374\250\231?L\275\030@\245\200\274\245\265T#F\3222?\224h\216Z\334\334\2002|\266\333\363\203R\033\316\243\021\217G\215^\005\356@\230\260\277", 64 },
{ "\234\214!\015\311\276(\370\327\340\215r\272\251I\025\366\347\373^\240u\274\212|\317(\271\205\217e\277\373\252\243\223\346 \316\347\3356\321*\035\212\332\212", 48, "\261+\374\0333,\372Jz\034\222\345\233=\235G\300\307\257\244\333\253&g", 800, "Ty+\353m6\340\005A\316\257\336{Sd\2755\205\275u<\274\232\356)\333\134\006n\244\357\347\317\226\271\305\237@\347\202\020\316\256\353\247^\373=-\253bQ\001\370\376i\203\216\265\215\375\2636S", 64 },
{ "\000\315\257\224\310\010\271\202m9\212\034.2\305:\316t\375q\212+\355\260A/\022\032\014\225\350\277\007M\273&\002\3738L\353}\016!\134c\037C", 48, "\333\257kres\311,\263\242\350B\203\361\204\322\216\207j\246d\267\037\342e\235\031\302\320\374c\376", 800, "\211\301\301\237\314\002\205\216\030{\015\274h}D\216/\262\314s\331\206P\275\332F\372\264\300U\216\034O\330\202\362`\3476\000d\337\037\032w\327\365#\233\377Wfo\361\376\244\302\177\361o\370Q\270\354", 64 },
{ "\222ma\214\201\372YU\315 \371\0023\242\340\235G\361+\3025<\313E\235\276*yi7\277\213\3009\210\265\223\334\355\344s\322\224\240\312\263B\210", 48, "\367f\326\215\006\346%L\022U\305AI\343\307\223G\372[\320\012\017\205>\031\243\313jp\223\250m\213v\251V\177\276~#", 800, "\344\224\222\246h\225\325\010\301W\042\033i[\354'|\366\036\244lc\270J\217%\351\032\257,\177J\031Q\017\007\270@\254&,\336\317\312Z\321}\010\332p\200\237\014\247F\277\042Og\304\247\227\177\367", 64 },
{ "\305T\312l\0366\032\354\011\006}\324s\203\365#\335 \324\375\305{\340D}\300\247'\254\303`\310s\266\023\003|[\367\371dw\2262F\361uh", 48, "I\225\007Fu-^\010b\363\356\312\306\034\002E\024\262\3241\377V\270MZ\334\270\314^Lm%\011R\3446\244\261\335\355%J\342;\301\353\337\237", 800, "\241\377\320\274$n\333@\2541*\312\320\245\211dJb: \266;\370[\2713\306\253\275_\217Ex\306{\271x\025\236\253c\024\311t*\336~)\355\026\016\014\022\000T\335\340[\360\264z\016|\323", 64 },
{ "u\217]\362\346\353\367\227:b\317t\237a\344\024\267rn\332'\001\364n\042ar\020\134\357\134\314N:\264-c\306\012\331\342sRH\334\213\242.", 48, "\352\134\314`%\177\025\022\230|\001\026\271\314-\001e\006\360\250i\214\201\261Y\313\325]\354j\3024J\364\327\304\302\340\242\373.\263\246: \026\376)\265\210\031\212\365i\254\201", 800, "\366/U'\255>-\370\322\007\215^\264\321\302\234s\010\275\234\321H\316A\236ES\026\341\361\212\251\214is\367yj\316l\2133D\347\346=p\006\254\007\256\016\021}\367M\013<\374T\210$\357\005", 64 },
{ "6s3\342\014\013\351\345\270\270\207\354\004l\213aV\227<9\267v\223\260N@\376y\3072\273\333\274\353Ni\231e\372\316\022\031\375b\365\336\042\023", 48, "\367\231as\364\300q\204At\274\235\343:\205`\017#\210fhG\367@\333\007\3350<\303t\377\025[F\036\235\214\246\326\024\312\257\372\003\232\201\013\212\220\354<\377\251\315\314\2205\360\304\020\233Z\215", 800, "\241\341\300\227\005\242I\331\031\003L\263Z\361Bp\262k\134u\330 };\234f\203H\217\033k=\301N`vwY1\017j\331\177$|\360j\014\021]*s\177~\223\237$Oe\037\216T\321y", 64 },
{ "M|\210\012\365\274\254wp+\240G\372\252TY\020\227j\022\025en\0219)\235\020\314\364`#RV\236\261\342R\211\312\034.\3324P\0170\342", 48, "{\031t\3021\3312grv\026\210\373\311\024\024\271q\246\333'^\307\355\253\207\256\345\351\365\030\377\374\366\355D\332 '[`\177 e\354_4\242\316\221^\0170\315$\336\355#\037\343\215\224\244RL>\245\234\247\244\272\243", 800, "\304\257D\322\243\321\011:2U\022\270D,\375\011\236\265\262\331a0G\230\003L\302\241\220\217P\332\244\364\016\037k\222\375\200\277\321\332\3647\033\360A\261\365\013Q\337\036\355\2522N\263 \000:\2164", 64 },
{ "^\372x\204\356\231\244)r\277\370\0230\001\365\232\216\214f\3107\302K\351\020J\252@=\377\261\247cy\177yz\211\035\354w-\347\313\327\363\253w", 48, "\261\352\305:|I$\225", 900, "p\326+\010W\257\325\370`Y\007P\030\035`\373\3055\215\031\346u\033\230\025\367xs\007j\272\266\260\357\265w\365\017\264\353)\364;\275\026\215p\0212r\206\277\260\207\272\373p\245\363<\224\247\300\375", 64 },
{ "\306N\274\353\353\372z\375Gg\351\310\0275\021O\333fd\031\246M\223\211$Pt\320\253<\226rG6\333n\030\330<\265\243.1tM\035R\276", 48, "=6\352\317\376%,\275\010\326Y\005~\330\214\350", 900, "\012\237\260X\323\007\306\233\331h\3306VN\350\366\337d\232c\364\370\360\253~\017|=K#\251p{<Y\001\250\016\324\034m\251\332\247\341Z\253\272}\010kE\342( \303\367\315\270n\336q\225\357", 64 },
{ "\017\022\307QF\026\277\346\3408\263\230\263j\257k-\247\354{\020\337*\337\017\340|\002\2542\244\024Q\243\257\201\232u\243+\013\030\330Wa\2631*", 48, "\254\366\243\320\356/\367\316\025\264\305\010\200\241\257\320)\264^\273/\367\014\341", 900, "D\021\265}\250\3378w\241\036d\274K;\374\037\320`\246\343\237}vi>\327\260<\230\021\330N\036'\233\200Y\2201\303\177\247\224\316\236\243\2265g<\374\363#,A\340\332\326\036\1347\373\372\346", 64 },
{ "\354t\342\3266db\242\371\260\214\214:1v{\305\361\203\325\006\360\237\220>$\341\235@\201s\345\304E$\305\021eRg\007w\272\037\252v(\334", 48, "\221\370\256\213ef\313\016\345)\3576\021\026\302\365\037\134\353c\340DhGJ6\042\355\375\3328\377", 900, "\345l\321\036\300%\257\015@E^\357Q\275\266>\303\007\334\324\323\032\346\302n\345\214w\311\031\300WU\201\030x3\361iP<\012\321\360\314\017\245\351H\3768P5Y\255b(\367\377\225QD\244G", 64 },
{ "\212h\203\333I\202:\236Ev\276F\360I?\017\270\313\366\342\033Q\204\013\025\020\255\271\261N\327-\327H\134Of\300z!\252\020\205\330\352\3010\273", 48, "\352\304i\241\366\217\357\216\232b p\017l\214\224\346\260\014\320&@\264m\367'C*\363\343\316\223:i\032\357\312R\333q", 900, "\334\371GE\312\010\314\257m\035k\020\026\204\266\255\300\251C\343\243fR\303D^\302\365B\014\266J\034\227\214 2\215\374g\012\361\261\247E#\327\314\331\326\224\023\267\015\266\212*\371\346\014\305b\342\020", 64 },
{ "\251\205\204\301\302\247\005<\367\134\236\323C>\205\277\311\327\013\270\256s\364\212\366{|\252\374%\311\335C]W\215\312$\377\205\206\325\231z\220\370\367\355", 48, "\222\334\262\311]\217\213J\362\262\354\035\236\301\316\300l\210\205X\233\026\034\253\372a\037\025\035\235\311\224\313lf\316\346{\300\225dB\217\267Q\303\265\277", 900, "/r\256\217\345a\345|\227\372\323\205\274i\013\367\222\222w&R4\216\337k\271\345\342\371\345\205-\263\333\263$\217\204\347%2\206?\347\216\020]\202\240\011\276A\232\031:\252\257{\245\340\177\005\017F", 64 },
{ "o\203@)\270@p\026\240\016>\025e+\365\367\243h\253K\134\252_|Z\247\311\374\331\220!\304v\203~Y[\001\314\316&\235\3662~'T\313", 48, "3Z\266`\240\015h\363\033;H\005f\316\213\360w\276Ic\224N\006\026\241R\345\252\317M\256.\217T[9yc\2416\220q h\214X\303@\264\352X\033\013i'4", 900, "qY~e81x\267\010\355\256\346=\217E\3054\367\033\223\305\265\240iW\205p\016[\367\253\201<I\014\002\012\232\314\342Kk.\006\033\025\212\306\257\201VC\215\315\211\345\010S~\230\011\306\336\232", 64 },
{ ",\001y/\340\256\035g8\377\042\253\220k\304\360\314\232'\302\352\004\304\215T\233\241\231\221\220R\230\332\212\214\036\310-\004\344\213\260$\013\014\236\262o", 48, "\220\277\016\213X\031\232\241\275O\313\2761\201tm\004\346\257-jr\326\207\2622\271\305\301\036Y \005\324Lt\274\234KR\366\025z3!/\244%9\372\316)\337\320q\322\034\370J\313D\011\325y", 900, "\013W)@\026\234j\033\211\263\042\252\344\244'T\030,\315\236\354\262\232\271\015\324\267\214\030jV\003\034\300\376\023$\031\334p\252\2203E|l!5'\213\201\226\005\336\303\232!\317\223\024\020\265\314E", 64 },
{ "Py\305\207\302\350\255Ah\004\361:\243\340Gw\317e\204\246Ts\335=\240\346\326\024K%\003>\253{\327\375\3426\226_\315\323\340:,\321I\253", 48, "\210\226\334JU\226\325\266\244\370\345\005\026\340\004\024\034\261\250\302\343\237j\246\213\011\250\262\351(\221\017\263\346\252z\023\353[\234\217\022\263\270v@\042\021\360\264Qq\266\347\007\352\253Df\025*/\233(\030\261]\035\305\365;\216", 900, "\262)_\014[\213/Ped\016\343\251\006\032W\376\035\321\022f\030\360J\212\031\327\301:\342\020\324M\347\250;@\032\342As`\272\006\261\364i\333\230d\341y\361\356\001\347G\341\026C\374S\244\323", 64 },
{ "\337\340\0338\311BN\317'\345\351\252$3\346\367\035a\346\204V\341\244P\333\351?\304\014\356V}7\274\235\011\272\134\337\023Z%RB\214\360\035\236", 48, "\342_\030\013\242\335\241\032", 1000, "\233\012\250\243\257`\267\003\230\221o\226{\3123\032L\3124\301\353\317Ky\215\320\342\013\035\236)f\025\214\315Uh\015\217\266\012\006W\021\003\210\327\263_\021}]=M\357\3613T\325\017\272m\235\341", 64 },
{ "\337\245B\343\267\275\006*\002n,!?\206\365z)\211\020$I\326fA\217\335^0o\335f\351\004\364\177E\244\016\325%\036\342*Z='\332\303", 48, "\231\263\316\356f\366(\017.\272Af\207\263\015\237", 1000, "\366\331\243\333\005*o\210hM\134\333\007\216\207\134\001\346y\272kq\013\256\340x\260!Hb-\276^\343\243\223\015=\001\271\3758\021Y-nX|\361;|.g\352\265\341\367\236\042\324\201*\177r", 64 },
{ "4J'\377v0\337*\246\270\014'\357>%\333\012\352\014b'e\277R!{\340\020\305\377\017\242\357\331-\042\324\042I\225\306\316i\242)\026\212\234", 48, "\370U\302\377X\352\001(\222\226\2464\316>\362\240[CF\230@\021o\215", 1000, "\003\013u\035\376g\025\240h=6\312\213\361\342_\366\363\230\237\217\246b}6\221\002~.u\315tI\200\263\370\270\200I\351\234+\266Q,}\022c\007\317\274\352&\257\317\234\276tRI\013s\221\215", 64 },
{ "\254\355jOV%\361 (\374W\3124aq@;\207s\010\270rU\204\001N\023m\340\312p*Z\245Zt\333Kr\223\347\200a\355j\020K-", 48, "x>\324'\200\030\360\316\304\012AL|\0303!\237(\245\212P-C=S\375\037i\225\324\362\265", 1000, "3\026>\262\353\324\014S\233\316\233\302v\2516:e#\262W\273Jb}po\305MV\036\035C\355\371\317\304\306\326\026j-\345\241hW+\234B\375}f\273\244V\321;\220\343\272\376\365\214k\267", 64 },
{ "\220\006\340z8\343\225\036\035\177:\232\026\227\343\356\342\3432\360\362R\213Y\225\217\330P<8A\277\307TOY1}\311\304\263\343\342V0\000\012\223", 48, "GG\036J\266\271\226\234\207\222\0130\014\300\244\263\233\267\215\331a\216Yxas\224\376\222\023i\317]\134\3245\306~\251/", 1000, "\363\205\315\022\320\352![\327\042\242\255v\343\252\252\243\324F\244DmR\207\347\340\215\020\224n\212\270\267{s\243d\203}\2477\342\033V\265<\270\306\020w'\330\027\301\023\006\026P\025\005\260\002\251\027", 64 },
{ "\025@\366W\027\237i\355\013\010\332\335\263P\237\354Z\243\240\335\322\204\025\275\007\037n\304\266W\366+\321S\005\216\273[,\244v\026\372\021n\326J\323", 48, "\0339-$\266`\367\240\245\215\206\027\372x\252`\265\177.<\227\306\365\031\275\001\373\011*Nt\2434x\312\2426\344hK\336\275\240$l{\211O", 1000, "\030\363\332\336\2309\300\376\2105K\232]U\260\214I\315\372\310\005s\134\2602\367<\325\362\001uy\274\024\251\241\320\205\0200+\020\372\020\2508=\036l\371u\206\377W\306\233\317\011\034\007\335\252\262;", 64 },
{ "\306z\302\361)\273\335\030\357Y\233 \371\307\225\013\357;(\372\177\311J\0321\030\215\300\334\016`Hp\000\031.\2527\270\223\320\243\022\255i\303/*", 48, "[\227\377\230I+\177\3633\223\205\206\332fx\307n\311?\330\333\017\314\311\260R\325\327YOA\323\267\227Z\271\255\217\363\310+'\377p\376t\011\032\024\370\265\036R\242\373\015", 1000, ",\020\2650\007=\026=\341\204a\301\0055I\266./[\231o\215T\212=UyCm\037$\370\020\360\003\335(=\205\355^\235\317n\035/\224\204EDe\277\373\240\312\267\007$\177Eo1\2219", 64 },
{ ":b\302_(\317\016\2317B\264\327)\3143:\022\342\006\301+\232\213\330\306\230\374~\370\240\012kE\341s\335aW\251/\312+JW\027\263U\006", 48, "\3375\236Q1\357\250\336\333\006\021\304\360r\200C\021U5\340\010\245:\277\253D\271\370\334\030V\225\262\314\017r\3349\253\023p\324tn\325\244\207\271\017\030\260@cQ$\243\015U\004K\013U\354\033", 1000, "ic\217\365m#\204\032\232\010E\014\365\342\0233\020&\275\373\222\234\363\325\332\243\372\333\243D/B$\315\301\012\242b\274\2227=\267\332\014\2423ex(\366\000\246\373\345\022\210\275+)\220#\360\023", 64 },
{ "D\315\013V\224+\374\237n\031\224'\255\013\232c\253\306\375>\262\021\031S\226\201\306k\376-w\361\307Z\310/+\217\354\275E\343\300v\012\244x\210", 48, "\020\347@\330\323d\010JOB\256\253\246u\216\337Xc\021x\267\205(\267\223\270\243O\207#\314\321?\373\013=#\364NbI1\376\353 y\200\2405J\271??\212\311\0110\343]-\367\367\2138%\310\037\307}:\331M", 1000, "\213.\303\017\302d\026\245\260\374\325\377\261\222z\035\373;\026\230BxS\007\270\331\223 \337\311O\003D\374\306\323 Q)1+\357N\200\264M]\376\207\335\007\025g\263`\004\363'Q\252\376d\277\373", 64 },
{ "i\013]{\003\324\227Q)^>C#/Z\262\301\265\302H\322\351\253\270I\351\306jdR\201\307\204\023S\317+\362\215\225\275\217\312\245\335\263\002B", 48, "\347\245d\24117\217X", 2000, "\252\021\376z\035ajL[#\211I\212d}|;\340\330\020n\263\233\030\267\304\317\027\377\177\336\263\343\360\0338\274\357V&\232\302u\306Ni\245i7*\221\366\360\201;\363\003\3616V\250:\221\342", 64 },
{ "!\264\005\243\327 -\361\350q\242\274\342\2628\340\356)<\202FZ\323w\270h\033\004\207!\005\362G\227\033t\377\376\243%\177\216\024\370\372h\330\246", 48, "\352\242o\245'\2623\223\200\042(Y\230L\320\226", 2000, "\355\002\347<.\274\221\344h\015\206\006(\237\036<\355\002\272X\346\332!\255\233\012\273F\243\202\252\042\004\204\344\021\253{&<z.\254hr\037\370\315\304\311\011\233\347\013\027<k\213/\373\261\247O\333", 64 },
{ "l\274\276*e8\254J\371\240\245R\276\010\023\212M\353\255L\374\355p;Z\340e\364\024\310Q\355&\357\332C\327R\374\030*\030\365$\214\251\262\265", 48, "\013:\341#F[\241\251\0339q\334\014\322\373\242qr\222\010\253p\307*", 2000, "\306\301\274D\315\206\245#\224\343\326\363&K\334\011M\347\003\346\005\212M\011\276l\0209\340\203\336\264\223\272\353\261\362\342\377\002\261!D\252$>\375\217v\242\265h\341\224\011#\273\333\253\265\262\030\330E", 64 },
{ "M\340\026\216z\244\214\273\267\211\2041%:\240t\355\224~\333\021\361;\271p8\025\220\007\377\356\333\213\206\037\014\320\253\034x\011oC\231\344\305ja", 48, "V\300$\325:\253Z\302E\030\214R4\216\327\232\315\2723\253\363\006\213\320\217\274\240\331\372\305s\227", 2000, "\300\357\340\235\202\210\212\275\015\205?\025\231\247\274\210H\300\263\317\2613\260\221h\271O\255?e\364\355\312\320\366\300'Y\321N2\317\253Ya\236)G\221Z\325\307g;\354k\014\271\354\365/\332b\374", 64 },
{ "\375\212C\210Q\364\343)\3230\344U\330u\321J\021\357\233|%z\031\015\224\241\327m\017\327\222\002\233\261!*\363\227\262,\331\352\026\015X\204\276U", 48, "\353\2518\267\016r\004l\332\207\315\035\225Q\350.\006l\206\032'\016\333\214\320\363\351+\376w5\2366\373\012RQk\240\376", 2000, "[\320\320>\243{\326ur\261\213\262\233\332D(\015:f\345\350\311\373\331f\264=\035\377F\014\354\0119\003e\335\251\014Y\342h\2705e\257\012\253\330D\355\226\312\220\255\263\316\253\274IF\256\302\356", 64 },
{ "\233L\025j\314\030PY\235@\036B\204\001\210\244\2427)\011\255m<\372 :\324\337Vp\024g\214\254\042\336\240j\367\322\003\367+\266(eK\206", 48, "\012b\352\220P\200x\257\204\203\205h.\013!\247\214\243x\255\203\215\375\200\042\217g\262Gn\275\245\222\217C\304\222\326\020\026\304\270}\031\202\310\003\001", 2000, "\215\256n\367\035\246VM[\303\337\002;\371u1j\3772\365\025Om\376\344\206\203\247Z-aS\367\315f\306j\272\034zt\223\313\317\267x\015K\304\321\024\340\214e\252\014\225\346\021\311\266y\377G", 64 },
{ "PP\000\272\244\310c\353\031@\350dg\375\031\012\334\360l\235Z\306\031\201\024A\311\376\023C\261xB/\247Kx\210-5\042\234B\261U\025\235F", 48, "c\314\347\257\272\001\350w\215\300\317Z\254\214\231\266&\201v\245!a\032\305\253h\316\363NG\326r\271F\324\370\312'f\001~Lw\337\375\333\257\225\002l\315\022\134\305\246\300", 2000, "F\355\345\302=rO0\210\341-\350\007}5\237]\220\200\010\001\312N\215Y\252\374&\343a\011\012\030\017\220\324\377VB\224\315\307.\351\310}\372\321rl\277oX>\311T\007\321\312\377\036\211^\250", 64 },
{ "\357Q\2640\367\013[\237\343\200\235(\262\251\2104[\000J\360\000\337\260\264\205/\273\016\033\005\373\036\336{~4{L_\017eNq\302\342\023\270\350", 48, "\035\320\035\370\304\326\354$\262\261\351a\327\357&\263gU\030y}\207^\200\217\270\316rL\335\304\012;e\250by\134H\042\325G\326\314\360\211\262\355\020\275m^\031;\350\020=\367$)\024\305#\042", 2000, "\275UOs\241\037c\027[@\215b\316\014\2558]G\202\346o\365\223\301+\226a\361\303\012\031m\304\244\371'\212\034-\036Q\264\374\317\241G\001f\211z\306O\225\360/B\366\0345\376\301\332\354\253", 64 },
{ "\241\344U\007\300\201.$O@f\017\377\351>\243\003G\317\366\271\324\000\012B\235u\021\217\332\226\032N\2350\350\223\241g\303S\312\264\372>\012\257\213", 48, "\033L\372\351F\221i\236\310\273\3213\354\232_TrQ\266\310[\225J\034\220\354\236\205\360K\271\223\320\273\002\205@\313\335eI\267\232\246\236\3417\266\210\246c\244=\260\314\365]\367\312\246\010\202\372\015H\354\336\337)$f2", 2000, "\3719\006\261\234\375]Z\246B\227ji\320]\221@\263\354;\223\373B\252\216T\375\271\263\220\366\353\266\260\016\241y\261\217\2078\300\263 \204\331b\000\304kQ\233\363\250\030\306%\263\217]r\276\217\376", 64 },
{ "\011\251\033\027W\032\0163\012\321\2718\307\354N\317\266+\246\213\235\254d\323\344\203\001T\2328\303\001\340\213\032\251\253\022\007H\223\334\250^\267e\357\214", 48, "\242\250(\362\371\203\3470", 3000, "\042jz{\220q\271\020]\035\344V\275\242\245H\266\275\212<\0156\354\231\375\252\263\362l\037\365\361\002\315\262m\246l\241c\270|\220\254\317v\042k-\255h\006\332\232\305l\243\316+\344\324U\200N", 64 },
{ "\350\372\007\023\273Z\254\346\261\245&\340\367v\216\222\034\012u\277\003`\227\271Cu\015d\332D;\000Y\247{\273\313\250\003\024WVV8\262\325\314\237", 48, "\365\245\257\230\323\214\245\206\206c\036\016\026L0\313", 3000, "\230\372\346\242a\010!u\234Fd\303\013\324&\361L\036\033\344\240$\260\013A}\304\010b\323\321\177\031\326Ti\042q\312\276\223\242\254 \042\366\264\306o\274\247\310\367\005u\0322\2355|r\250\357\313", 64 },
{ "p\327\375E\323.;\341\267\210\266\314\244\010\210n\353\204\352\260\221\357N_\042s\242\006\374\315a\013\276m\015\316\012H\257\307C|\215*\224c\235\341", 48, "\304\250-\345$'x\301i!= \226\320V\310\361z\213p^\225\033]", 3000, "\232\022\311\007\230\342#z\334\363\375\304\274\337\346\272i\321\333\304\301\320\341N\377\270u0!my\300\311\023\3241\255\277s\206-&\245t\245$\375^\347#Gg\332\015~%*\243fL\236x_\317", 64 },
{ "\011\241]\247\315\307\354\015\314\272\351hk\3047U\354O\260n5\374V\023\366\353XmY\257\270+\276\364\370\333\273\213\257\216\2041\267\2101\320\221i", 48, "N\200\330\312\255\302\343\305\340N\326\361U\305c\242s(8\370d\276\306u\2260U\214_\215\367>", 3000, "\255\011'p\346%'UV\324\025/\215\356\265\262N(`w'\023\371\010\005C\272\370\331\325\222\307~\374L\016\042\027>\244\355{\001\227\246?\2450`\222\264d4Le\242o\323>\271\344\264\237\326", 64 },
{ "\022B[x\327\005\226EU*\134\207%J9\322\366\315\277q\036\275;\027\277px\362\012y]/w\035;\014*\255i\356\364\034\272/ \217\234\346", 48, "\210\320K\265\034C\207t\341\010j\232\321\037\012\214\344\320\233v/z\244\206\375\325\303\327\324\325\350r\313\243\321\332<-\260\016", 3000, ")\377\352\240]\226\024\322\357[P\205j\005\234AS\2677\036 vu\034q5\250G\325:P9\311\021\344\177]\214\307\342\016\374p\234[\2658\370\351\267\237n\340\355EM%b\317efO\005\230", 64 },
{ "\037\032\0421\375.\312\217\315%\333}%\301R\310To\202s\210\221\3768\216\022LG\216 \236\267\025\222\177\240=\014\013m\377-\271\253}\362> ", 48, "d\302P_\366e\211,\215\037\344^St-9a$\030\033A\235\004T~}5\344\260)*\205\031\312\215\305\221\330\3048IJ1\352\351\271d\225", 3000, "he\347\374\343\203\012\310T\325/\311of%\225\362s^\023\021\027dh\004\210\207\245ou\033\207\036\215:\006\015\3118{\272I\014{4\247\373\231g\306m\022\221\227)\211s\370\026|\000\261\035h", 64 },
{ "\325\337\347\355~\224n\005\241p+e\350\351\034b;oP\302\025\342\211_\254\374t,#\241jSh]\366[\003\2036\310\2625\354\224+\276\207%", 48, "\015\371\213\314\256\360\017\223+\036\362\003S#\004\032\256\260\301\321\352A\357?NTh{Q\235\027\272\252I\216d\332\0320W\224\0204%\372!\265\313;\344\2342\365\3002\225", 3000, "\004\331\012\301k\262\314'@+*\314+\134!c\306\224\030\310\241\013=\017J\234\207Gr\304\212\220\032g\232\315Z~qg\217\336\2405se\260\355\177\302u\134\370\251l\213\342\325\207\207h\362 \017", 64 },
{ "\2202=\274\020\024\341re\233w\032m3\255\235\237\234\253\224=V`\344\002\214C\036J\364B\261v\211L\236\246a2\365+a\212\300\375\3218\244", 48, "a\177\237Z\273m\345Q\025%2\012+\265\024\252\357\037f\271i%x6'\276\211*\373bKs\331\252E~\211>\010\215\020\013\256\322\205N\323\337$\251\342\017\306F\033=bu\331K\251\214\203/", 3000, "\035\344A\362\262 GZ\226\226b(\332\021>\336I\375\360\241\373QhAXD\247SM\300\205\362z\327\330s\017\351\257i\036\001\324\255IgD\3202\227\021\300\274\232\223\370\202i\033\311\260I\266\376", 64 },
{ "\034\210\177n\354\347\241t\016\207;\333n\370w\247\036\226\214\1346\362\015[x^(\2728j\264\006\225D\240\217,\315\235=\246\250\012\3513~\335\355", 48, "F|\371\315\340\304\207u\251\277/\356\375\342\305\036\023\245\250g~\346\306X .\024\010\250:q\310\0231\307\020A\204P\351\004H$h\327W\015\024Z\027hi\226\323\232F\312\231\211\321\367\235\340\0053f\345s\031\315\237\004", 3000, "\342\210\306\337\352@7g\277\0363\037\232\2449W\324\213\345'6\016\325\354\247<\253[%\224\3461\3136\267D\373~o\255\344\215\211hX\313\200\217\240n&:Q]\257\343&\323\321J&\247~\256", 64 },
{ "8\374\360\327\244\242\3112V\356\023\253\201\343J\333\370k\247\304~\341G\326E\021o\333\262\016-\233\134#E\3341bpM\001aD\246\230\027\003q", 48, "+\355\360\253\224iM\011", 4000, "\203\026BJ\336\023^h\371\300\255\212\342\245<v/\024\012\220xn\212\272'\301{y\020\202\013\370\300\216\267\020\345o\316\202}OR\374a\376\204\304\020\3279-Kba\371\033\247\013\254\261vq\024", 64 },
{ "\357\023\232*\001\372\2751\230{\316\033\000\0006F\201\364\364u\217\326)S}+M\012\240\230\0128O\317\351\322\3323Y_\224\367\232\371\304\022l|", 48, "\336\226\337\332\234~\346\022X\371\312-\022\247\342\365", 4000, "%\217\250\325izsgW[\271K{\023\001\035y+M\033\221\374\302.\355\366\270'?\331\222\323\353k\207\213#\372\206\315M\004\235\134\332\225'\042\234\233E\2252\2318\016\277\134m\234~R\016\210", 64 },
{ "\205\033\342\032\242\024\211-\314G}\227\251\023\004P[\277\240\311<\257X\337\032\276\302\3136P\000\265\201\233\3301[,\225\355\206\357S\320\016D.Z", 48, "\324\363IS\003\357[4\372k\037K\325\035\253ZE\233\301\212\213\003t;", 4000, "G\351\236\245\016\345\371\320\225\202;1u\201`\333\042\016\362x\355\317\177|\003\365\306\334\346K\312CFV\250\031\367*\367X\376\377\246\374Y:\260r\236BF\372\314H\345\0215Qx`\273\241\220\250", 64 },
{ "\364\027mR\260\232XLw^\364\256\271\344'\301\223\216'e\021\220d\255\202\255\016+\210\206\244\0261\313h\034\371:\377lP\273\025Lx\247[\365", 48, "\317~\373\314\230\331\321\003'\012\363\274\343\370s\350\324\321\256\206i\323\315\273VE\310\032j\223\312\037", 4000, "i?\351\304\337\377&C\367bm\253^m\335\311~|Rj\244\225L\302\237j\311\330\2759\234\276\343\241FmO\024d\247\301 \314\011\303Gu\177J\311\3435\272\004oB\2203\325h\212\235\001\370", 64 },
{ "\246\201\265\310\201(\371\206\011\310od\207'\360\134\226\366\025\316J\217\005]\357\240\020\331\242\042\366x\253t\343-\017\245\261\373Z\327;\023\205\233\360,", 48, "I$\373e\314\232)\033\256\376\322\324\234\213%cb\266\313\271\003\235\011-s\360\310\033\225\326\263\211-\2736\337\341V\307\302", 4000, "\012\003[\344\302\016B\006\036\370\247n\236\325\204{\312e\304\321\320\342\031\353\326\231\212\010\237\007B\334\245l0W/\327\342^\331\312\2517\261,\215\027\310\010\343\2025\3477\013\271)\345\177G\3765,", 64 },
{ "\231]\314\344\213\022\042\205z\247\246{e5\362\243\330?\032<9\244\374\270yP\025\261L\014\223J\0228\270\352&\034\307\231\202\337\031)\356\201\032\012", 48, "z\200\004\375\370\325\264\223,\022\271\014d\354\005\320*}\206\375/\365\306\333&\032\255\337\276g!\007\034uIhI\311\247\312\244;\307\204\317\306y\277", 4000, "\327\177\031G\255\205\003\021\034\242\022\201X\002\200]@^\322mi\245\320p]L`\266\252\302\343j\134s`ku:\360\367DHnT\2411}\346(\022\036\315\266\362\347SKdh\213'\204 \016", 64 },
{ "\223&t\237.\0160\037h<\244\272\326lA\017\006\301\367c\042>\242\212$\313\275\010\022q\317\023=M?\245\3243f\242^)V\011\001'\321v", 48, "R\134\353\337\330,\216\250\301*\3737\0046d$\362\331\335\366\362HZ\236\213p\247\214\241\134\225\304\016\200p\234B%\332\372D\377u6\226\017g\354\233\232\014\2565\2067+", 4000, "'\035y~\311L\376\346\274\277s\377c\376_lgN\042X\313\265\257\207\042.\264\262\016\023\006R\326\332<\000\013[\001\023I\224\134\007|\277\203,\322\353cF \331E\021\331l\217!\220\221$\365", 64 },
{ "F=\037\315#\006\331\015D\027\243}\342\276\200\275\364Q\265,l\353\350\011\021\234U\026\333\260\372\274bM\244\323\344\001dt\347~\265PFr\301\252", 48, "\007\302\227'\205~H\223\003<\261\020D\200\337\311K\216\017y\360\204\337pxm\323Po-\275\304\207\032\314V\310\247X\254|s~\313\335@}i\371\226\254\374\304C\215|\327<\023S\2637\330:", 4000, "\012\324\351\266\333\245\343\256\371\303x\256\005v\321&\235(\235\235B\240z\352\335\266\204\344H\312\030\306\221,u\021\343 \365\005\204\023\330\001\202\271v\355\215\254\363j\254'\327X1\360\201\252o\034LU", 64 },
{ "\023\234F\343\274\225qk\015\243\251\233\275\030\345\306\312\253\305\027a5@i\226\232J<x:*\325\334\230\306jb\273\315R\210\231\302\223\370\216\007i", 48, ")C\310h\001\024\202\337\375t2\222;9\225Ut\204G\017\012p}\134E[\376B\371\233+=Jqj\215\210L\367\334\366\241\374\017\036\032\201\324\003h\345\022!\370oW{7\212\377@\374\264\363\330-\013\2515f\242\327", 4000, "\200H\231]z\021\355\235\325%\2032\355\177\341\361\262?I\042\314\031w\306Z\203\342\265q\266\010\376\257V\377\364\326J\314\302\032\357F\207\371h#\276\266IU.z\242\036\2219\332\303\035\343\042\003@", 64 },
{ "\243`q\363\217\265\014\242\232\340\356\222\246\3719\025,kK\360\210\012\226z\370,pV!\375?\225;q2\340\213Z\261b\203&\314,\177\264\260n", 48, "5J\251t2B\353\337", 5000, "\3733\350Za}\257\370\210\310u\363e\234\216F\255\222\205\230\212\367m\303\3756`\015\023v<\203\215\240\360)\275\370\274\213*%m0\350z\354_\3135\261]\265tV\134\255\377\357\314r\324\217\226", 64 },
{ "!\351\373\2400\311\327\326\217fW[J\246\207\300Zb\352\320\366i\234Sk\275\372(\343!\261\227\273\305r9\372\000$\270}\304\020<_\231W\232", 48, "!Q\264\271\377\245NB\344d\203\015\206\306o\005", 5000, "\356\265\266\204\011\266\353\022\304\037xoV\320\350\3215\373\350\305f\020q\307X3\202\356)\346-\375\017n\265f\376(\015\262\366b\3703\024'\265A\242iA\363\134%\011r\344\261\012\340O\031f\232", 64 },
{ "\241\315913\212\201\274\363\366\203rR\0043Z.[\204,{\321\210{M\212\000\310a@\2032\303F\256\251J\320;CQ\022}\225D\202\367\327", 48, "\016t\343\351\005\223\2432\311\257\2026H\004\2600/\324\353v\331\305\335\373", 5000, "\032\352i\346\351\034\370P\347\257\331Lvi\315h\226\026\352\026/w+\021\022\204\010?\201\010\343X4}\361X\372\275m&\312Z\330g\003\236mP\026\022E\356\031\300]@.Z\33603\352G\355", 64 },
{ "\337)\013{\377\265{\015\2248\250\226\241\243\237\004\266\374\037\033>\343\242g|qW\267\315:\377kB\352h\357|\252+\362O\376\305!1\015\320\235", 48, "Kr\275\216o\247\366\204\374\356\325\271$P\244\030\0234\347\212\332\246\337\236I\273\134\210<\006\266\263", 5000, "\370\355\024\360\323t\303\313J\336\317\261\275\231\002\363\366\250\222]\007\367\367\240\245\271\177SZ\273\025\034\326qy\234H\007\261P1\345\241\327\313,\2257\004\345\255\036\2435\220\244L\024gF\326\210;\016", 64 },
{ "\213c\353\311\230pI\234N\210\337s\351<{\011\206\001=\331\330^\024\341\004\202\351\210\330_\264\334E\233\376,\002=U}r\014\246\210\254\272`t", 48, "q\237\222\276+\321|\252\350S>\357%2U\365\355\314\213\272\2704\037\276\346j\342\352\226\225\366\273\030\353=\236\234M\230;", 5000, "\324\240\327/UF\025\207\247\256\031\207\333\020K\320\331\0038\221\217n)\032\310$\235\345\027\373\233\247$^\206[\274\211Z9\245\002\344\010\345\277K\300\201{\317\304\204e2\027&\301[\213}\020\270g", 64 },
{ "\352l\231\276\004\222(\213@-\210\331gUw\021\350\216'\036V\204\271\373[6e,\225\246\3039\030d!,\222\226/Q#\351HUT\325\245B", 48, "z\356\375_\243'\235\334\0145\211\240\031&Y\256\211\205T\210\024K\262N\235\021?\211\014\305]\345\271\337\341\213p}=\306\027\203\220\303\273TQ\315", 5000, "K\037\010^\360\223\277'\320\341!N\015q\037- 2\363\277F\177\304n\221E\272}\364\231\333\340\003\030H\014\027\213I}87\214\2126\204\272\235\326\232\0349\371\312\311\334\262\341\257\356\034\034\233\042", 64 },
{ "\323\332\347\327&\217\310\364'\3106\2004\223\013\330\317\201v\306\357{\246H\315\260c\274\334O\356\374\234\272\021\311a\251\233nN\252\326\226\343r\276G", 48, "\245\374\354p\243\215\017\253\253q?\323m\006\333\335\311\223IC\033z&\370\177\245\363\042\202*\363\0069\216\343\353eY;=C\013\274\022z\233\011]\374\352\250\366\317\267\3122", 5000, "s\376^^}\223\305-\342\007\035\301):\022)k\266\363\037kcv_}\310\345\223\324\361q\355G\300\365\242\266u\213\275\252\246\022Tha*\002\262&\330\005\366&\011\223\025\217\347\035\134\2571\365", 64 },
{ "'\355\206\021\304B\220,\312,1\246/\371@>\275\032\265\313\014\223\366\343\310|\000\210\331<7\375.k\236>D\325@+ {\017\254\343\255\267\272", 48, "\365\271\004\226\353\033n\356\215F\020R\271\301r\254\335\357\251\256\211\021\015R \375L\372[\327&\266\207\350\304\230\226\246\276\333G\240M\234\316!\361]\313\017V\316\300XIM^\366\234\252\042.\227\007", 5000, "\030\024\256\214\270\375'\000z\200#\000\342\203\321\267I\351\212,\357\3654\231\213`\264[`K\347\224sC\321\303d\347S\245\336\241\330-:Bxe\370\002\264\265&\335=F{\362\025P\324\214OQ", 64 },
{ "]0\343\335\304\302\210y\374P\037\267j\222\3041\375eq\216\007\265{\327k\025\205QV\274\002C\300\272@\262\316\304\302\260\024|\237\261U\274;\304", 48, "\346\021\323\003\216\205t\265\022\345\335W\352\347\346\324F6E\227\201;\012\262\372\304\255dPhVx\277}\011.\001\255\004\232\356\031\300\313\247Q\034`\225#\025qq\231\207nM\222\370\207mI\216k\227D{\304\342?\322\367", 5000, "\264\246\376Y\226\205\015\312\251\312=\370Y\213\241'\375\372\275\202\011Cg\307j\320\312\2272\377\302\240\232u-oE\244\222A\036\0045\322\221%#\212\036\014\263\302\366\326\333\376\035aT+C\244\302\335", 64 },
{ "&\314\267\351\254\337\360\243|\246g\134p7\225-\222\352\376\325\207\333Q\306\217\230x\247]\134\375\037\273\360\373B\235\241\333\236U\007\315\005\250\345O\035", 48, "t\335\342\323\366\315\332\216", 6000, "\340\342\325\222\362\036\255\2425Ep\336H\004\027\315\256\270\275+Q\224\273\256\230\036\303\351\035\220\023\326#\270\342\265\2144!\320+U=\200C\326\367\012\343-^r\305(\255\311\2550b\014\013,C1", 64 },
{ "r\226\021\010\302\035\242\206Iv\266,\365u\252\220\200\200\311N\366G\25216.Y5j\234\023W\006\326:\254\007\222n\314\037\334^\244@\020\2737", 48, "J\220\003R\307\360\321\302\352\204\255\226\271O\352\332", 6000, "\374\236\255\373E\223\332\214\005\205\320\376\311\314\214\366\326Q\314z\220\264\035\263\031\201q\360\007L\235\205\014\307\256\241\342\230\027?+\364\001\263\362\346\016\355\300P\033\201\365enL\223\010]`\262Lh\210", 64 },
{ "L;\320\273\354\350\215;4\315j\215\244\020Ym8Y\220\042\235*\315\303\340\317\301g\231nx\226e\253\344\033\317'\241~%\252\241\225n\375\016\361", 48, "\017\357\243\317\226\303r\217\325\237t\264\2722\236:\221ov\211q\316\304'", 6000, "\337\331f_H\255\303\312P^^\373PR&\322\000\3774\337{\251u\2611,\232a-\021P(xPMnO\335\3768n\246\207\307\015w\367\326\210\022\303\013\242u\316\325\254\373\363\223\340\235\3568", 64 },
{ "\026z\355g\254\372\266\217i\200|\033\341+\333\302w\014e\257a\261\235\233=\360\325\206\361\007\245;\004P6\201\307\272\3722i\333Y\365\2472\004\357", 48, "\203g \356\266\241!\202M\221\302\274\374\222\227\2624=\3567(\304T\030 \034[\042\313\321,\353", 6000, "^\326\234H\2378\261\330\300\316=_\220\206\013N\342\376\352m\316\311VD\021\237\273\213/\341\362\341>\246\200\037\375b\013D\242\226I\324\253w\266\036Q\015\366\032\030\337\033\042,\033\020\002\254\354\032\242", 64 },
{ "\343\340C\210\270\266$\260:&\177c[$\253\002\002~\312\023_QP\314T\343c\260\322\315\325Z\001\311\313\260v6\367J<$\023\231\263B~\321", 48, "|\254\3234\277\240\314|\231\223\315%\307N\027i\3460\277\353\341\257oJ\350\007\313[b\264\373\320\352\013\323D\310w\374L", 6000, "\276?Q\275\236*\251p\201\300\011\221f\203b\316\220/SF\371TjN\241\354hM\244\263\336\360>)Q\3546\312\022\247k\042\207=\216I\230\324\242\202\242\372gw\034Gk\357Z6\277\370\336/", 64 },
{ "R\361\275*\210\356\262[\2123\366\242\260\237^\2774\177V!\237\033\303\032\034\206\256\346\021\357u'\215M\241\026\305\350\3443\015&\003_n\247d\327", 48, "\311\353\274\027EKE\022\363\277+\202P\324{V\201?\220(\266,\344\216w\024l\263LYKx\214s$\3730\354M\002\371\234\015\201\305\035\012M", 6000, "\344,\004\363\340\373>(\311\007)\224J\235\227\177\373$m\252\205G\011\205\301\276\222j\245\360\316\262\214%\220\272Q\311\246\373\335\343\026\317%\245\223\330*\005\025\215\304)\370\031\363$<\030\217\347\302\035", 64 },
{ "\342\000.k!\021\356\317\366\030e\177\037^\321B\177\272(3\267]\3522!\323\025\263B\365L\343\245\343\277BdJ\334G\255\230H\354'S\316\227", 48, "9\223\367\206\021\213\002\275\002\235\362\017\016\306\277J\314\357\220{O\1340\026\233\310\267g\276\322\205\023\347\343\357\024\361\263\354>\324\226\336\303\243Xr\3423\324\245\243\034}fL", 6000, "\277j\214\037\253\214\326\003\337pzF\020\200\307\210\002T\256\214\340\356\266Z\261\262\220D<V\266\316T\361\0337\273\337bj\215b\251\004B\310\037\216(\272\363PV;<\256\227S\350,\017\373\042\263", 64 },
{ "\201\211{\341a\230\360U^G\377\226\217);\202\371\230a[+N\361\005\035\261\365\021\322\023H\256\346\261:\3271\342\367~m\350K\372\275P\255\305", 48, "\323\277v\210ie=\134!\314X\220\223\236\370\033\213.\2469\331W\262A\275\364\015MK\347\357\2207HDR.\300`yx\270\042\351m\235\356\255\033m+t\240\310z\225\263\327\177#\037\236\372\302", 6000, "<zB\316/\266k\375g)\2221\310\273\203\030Z\270\326&?\235d\260\326\001l^\267\2221\230\227,np\1345\220\330$\340\307\315;\373\252\372\250\342j\341\025\201=\236\300=c\034W\375{\243", 64 },
{ "\362\024\344Z%\336\260\242&f\027\317\242g[Q\261\012\337\274\273Y\227\277\342\202\011\341\030\363M\347-\271R\312\315G\203\276\327\212 \035\361\016\324\363", 48, "\030@\373\337\177T\302\006\362\220\253\315\232\217\237H~\336\212\017\320\226w\014\314\232\252\315\351|\215\263\357\016\025?\200\241O\375q\362\3135O\366/\270\202v>\264\003\315\362$W\333\271D\305\223A\330[\302\240q\251\211\350\235", 6000, "W<\311\356\037\256j\327\035\206b\373\235\343\260\363$\224\3011U\214\334\247\035\241\037\326V\235\270^\346\375\375\251\042w \222\302\0153\202\017>Fi`\345\210Zt\014+\305u\204`\004\326hI\306", 64 },
{ "\207\335.W\320\222^,#\374\342\226\224\016\236\210Xx*5R\005\0368G%\357?|\305\355@L\032\372|j\020\376\251\275\336\351\230%{Q\222", 48, "\204\232\373f\211Nj\361", 7000, "\312\237\260\312r\315\032\210jz\302I\276\243\250\265/\027u\037?4(i\216\025G\352\033\272\362D8\230\304\304D\007C\223\335v+wm\371>\244\313\275\223\226\255O\273\265\322\302\026\266\210\033,\032", 64 },
{ "\351\315\015\007s\036N?;K\276\313\305\027\3443\241`\3168\353\264\273\021N\000x5m\020%O\372\011d\210MeY\303\316<8\033\026\027\330\274", 48, "L\250\331\250\232\324\035\255\344\227\313\334\367T\221\343", 7000, "\345O\261\350\203\357\344\350bs\264=\3658\343\337\373H\266BtY\252\352a?1\330\244\323\366w\357`\327\316\312\253\327Z\277\032\330!)Y\277\270\214Hh\372\277\371t\017\365j\246\204Cn\257\277", 64 },
{ "\015\316\026\222\224Vf0\216\243\304\215\330\317\303\245\261~\333zMF\362\033q\266\2464\351#\206\247\244\002d\315H\356IV\200\226\352\023\230Lr\220", 48, "\201\320\347\200BI\226\316\323f^=n}\360o\302\253\021\364_\017#\230", 7000, "\263\315,\274\011\320\250\250\204a%qyyc\203\305\334;\271;\226\307\342\337\331\311\252\211\374O\211\222\3216\275\355\335Ct-\357nS:W\367/o\330\263\026\033\026\220CmA\011gr@\025\270", 64 },
{ "XxQ`/\267\322\333\311\314\2604r\247.,N%,<\343{\260]\203\213\224\341e\267\016&\300%\223\372\306\356\344\036m5\376\277_\307\215\365", 48, "a\322\236\225\2352\213D\371F;T\265`6*\242\252\354\005\254\235\222x[\026\373{\347\364S\311", 7000, "\037\000\251\334x\275\265\323,\026\256\3703\206\375:x!\373\337\270\306\005\202\315\354\015\3161B,\235m\366\267\037\374h\273jgM\244+@\366H\217=\223E*\203 \372p\214B`\372\223\250\355(", 64 },
{ "\320r\000A\354\217\332}\235\330O\006~\362\321\212\242!\204\377\275y\337[Mv\355f\370\334\365\207\260\247\262a\355\353\306\323\207\305:\356\023aE\227", 48, "\006\374\337\262\336\367\244\022\313\134\371\266\263\003\206\301\262\300\260\217!N\274\352Z\031\267\376\264\305\024]\027XK\006J\244o<", 7000, "\275\245\364\263\007\213\236a\353{\250\227\231\027\263\320\254\216\376Z\275\260\311\251\001O-\266\364h;\001\236oZ\035\211rI X\234?i;\013\330\267\254\223\310\001\367\327\216lU\371\212\277=x\334t", 64 },
{ "4\253\333\315\017d3=\373D4DP\354\305eE\237uAh\337\2405\362\3017E\345\377\225\222\345\321kD\240\365\222\334IZr\011\277a\307T", 48, "\017\205\042\033O\271\030)}c*\006\037j~\34208\276\254\373\233V\266Y\317\2051\215\277i\003U\375>\320\234\334$`\271\301\251Ir=]\025", 7000, ".\331\203H\033\314\212\327R\264g\305d\305\252IS\300\202\265\017[\263cj\353\222\274\363\302\245\326q\270LV\257\262\177t4*\177\213\365\347,Xx\027]\325w\210\362u\205\334\305`_\343W\251", 64 },
{ "\302\357\007k\362\234\310_\213K6\226\006\311\313\342\227\347\226y\210\253\273\302i)R\305\001\365o \335\206\030<\352\311\030hL\361\320\342\2430p\201", 48, "\216v\267\216\340\203`\177\232F>^~\357\222'\013#\032?*?\025(\206I\307R\227N\235\214r\266\202@\242\202\215C\356\246'\014\005-{I\331\367\240Z\224\227\247\360", 7000, "#o&\232\242\232\323\234\371`y\242\302\373\002\276\300\013\255\272\225\242\261\223\354Vvt?\372\034\265v\357\375\206`]\236\376jl\202H\207\272\250E\304\005q\357\220\300\335A\266\316\314(\377\000$\204", 64 },
{ "\221\031\331\246\220\371y\353t\234h}\010\235\134\014\244k\273\274@\224|&\273R\254\223\012>D\333\025\273\262\012\222\370\255\201s\234\262>\311\345y$", 48, "\252Q&V\341\266\330\215E\337c\302yt\227\314\264\036c8\356\240\026-\250\0220\271\203\311\326\260\320\262\007\375q\242\200\323\345\042|\304\367I\231\202\333'$S\245\252G,X\343QRK\3553X", 7000, "\027\3340\256v\217\244\245}\245B\350s\270pF+\037t\340\3040P\325\224\2044\006,b'T\235\013:\367\273\336\255\227\230Ao\243\355\251^\324\370\325\307J\202\275\004\371\256\321\260\305hIF\023", 64 },
{ "\325S\032^\015G\353\362^AO\356\302\266\246\251\226/6\276\271\210T\320t\252\362\034\314\366z(q\005\031\033\342A;M\235q(\005\265_\332%", 48, ".\022\232\355\300\311\020\276\304\300\331\006\273\224\244\305Bx\306\317\245%2\331\266\201zR\376oei~\325\255\025\366\320\356(\315\216\024\345\001\021O\2571G\222\244t\012\230]\327%n\353\253\3527l f\356G\364\345\213\315", 7000, "\324!\305T\363L\134\004I]\010Z\335\242p\250\335x\240J\277U\270\231\027c =\335UU\365\266g4\003\360\025*xa\304\264\017-\311\204\236\355\341\273\212\252\320%G\356\240\344\034T\267?\217", 64 },
{ "\326+\305]3\260\0238\247\332\3650\203\234\222\232\272b\202\012\022-\363Z\022\313\261/\375\242\323\227\327\203\033R\322\221I\232\274D\002\305\207*\320\207", 48, "\322K\205\015w\314\267\314", 8000, "89A2\310\212\272\365\307\347\023%\263+\263\307~8\240\335\350\374\013\000\304\370m\244\346\311yH\273\020\002\237\366\362\346$\021\027\320\277\327\361\353^Y\024~\1340\037\203\002\035wS\273R\244\274a", 64 },
{ "\356~cy\304\371+X^9\335\304\257\0078\262\274\237\212\326RZ\213enC\237\225$X,\265\177\226\2052\275\025QU\002\203\204'8E\230\277", 48, "\362\356$\042\252\310\332\267\355\011\303\374\341\317\023\351", 8000, "\022\336\207\312\365\207\005\232<\303THN\303x\275\201\251\320EQ\363\337\253\242H\227+\346\003W\235\321,\3438\227\205\244_\376\252k|\004\373\370\271ZY\341\332t%\235\304;.\377\343\352\310\230\334", 64 },
{ "\203\020KLv\231\231l\311\355\270[\202H\231\350(N\333=\223\020$\271\350V\005\361!\254L~^\011\003>\223\313\216\314\334\363G~Nw\001\315", 48, "\200\016!Cw\267\245}\322\354U_*\331\015)\375}\273\2213\373\314\005", 8000, "\307\340\243\202o\300\337\213+\0209\266\311\252\251\036\371\2202T\000\037\220t\224\255gD\362a\327\314fU\246\237s\006\237\376\246'm\0250\370\206\373\234\247je\347J\256\036\004\003fB\247O\011~", 64 },
{ "\002\342c*n\2159\201\361\007\267\221\245k5/!R\224\257\201Z\352\271\256!gJ\3163\323\204),L\204\256\257L\233\221\310\326\357\016\334B@", 48, "\255\352\265\017\375\006\365\360\372M\376\355@By#\313\251\177Q\277.\235\015\230\261\015\002h\220[\315", 8000, "\314\310\364C[\214\206\177\205\313l\373\357\226N\226O\231\005\221\251'6\257\036\234\014w0Y?\330\017\024\030\245@\015\232\373\323\361\2165\360\273n\311\203\207\313t\012\360?n\012\374\370\2178y\250\340", 64 },
{ "F\220,\342\271\325\224T\276\021\206\271\276\014\204\027*\002T\030\003%\251\226N2\007\274\235dKT\341\320B;\220\042\021\220\240\313\025@\213\361|B", 48, "\2715\352\303y\267\260F3\042o\376\220\241\370\322+x>\006}\011\237\26568B\355.\333\217\220]\352\205\314Z\033\024\230", 8000, "\325\200\311\010\255\014\015\012\0312\227\023t0\010\257\036\321\035Ub\356\313\263rW\246\023\370\021\134d9\251\225\366\253\324\035i\003\312u=9[|F\375\343i\251\274m\2166\2128\355Kr\021\036e", 64 },
{ "\3470~>\252\201\367\3254\2660`|\260\265\263\306!\004t\241Z\312[\234\240\316\272\001fLF^,k\034|(\360\201W\351=`a\2559+", 48, "\203>\324\207\242&;\023\272Y\300+\357\321r~\302i\341\336\335Y\271Be\313\260\345#\315\361\373C\207M^\013\276h\231{{B\255\376}\237}", 8000, "\023\012\014{u\274J\027\303\022\322HV!\015\321\376\204\332\301\306\001sN\366]\215\276\237\206\257\314\245\004:\225\260\221\327^0J\351+|\334\376\323\002\355\302\310\000\012\361\252\307\334%\303\340~h\336", 64 },
{ "\322\200B\315\306\217\003;o\030\200\3471%$\366\005,\332wno\352\224f\360E6\215\240\374o\212\302\352\366\321\310};R\334r\265\307\356\0129", 48, "\301H\225\260?'\355,T\004\020\030a\360\221\340\207\021o\014\027\246I\262\351\226\342Y8\017\3427[\372M\316e\034\343]\335}\334s\343\006\322\255\345k>$\317\243j+", 8000, "\331n\235\013o8\255r\261\356\317\262\206\337\206BU\272\272\042\207\372}H\252\332\331\337\033\001\336\372\364\023q\360\313\020\250k\315\365.\134\201\316,\2169\3411i\357^I\204\325\374Qk7\315\205Z", 64 },
{ "\240\276\020c\257\224(\207\033\214\361\277K5S\241\177xl\335\266\325\221[\005\220\031\376\264\277Ip]\251t\220\240a/\260,\277n\365\254=OO", 48, "\231\006\313\201\376O(1j,HT\376\334\306\242>b\356\347\360\350\353\326\033\206\252\277\021\216P\037iN\014\341\371i`ZR4\016<\215\245\013\020\255@\002\267\035D\352k{&\2365\273[`C", 8000, "\264\261\232\201\346\355\306\350\271{^\217\276\005\237S\202\320\020\322\205\334Q\345z\210\357P\217y\216\2704\015\357'\254\021\234Jo\355\322\037\0423\363\027o\227\345\316\3609\372\310$\307\236\370\322K\213\252", 64 },
{ "{\262\366\317\260L\3010\312\213I\2542\251:\314\317^B\355\011|[o'\316\312\300?\221\021\331H[\253\2024,2\362\332\021\374g\252\221\375\213", 48, "r\254\355+\274N\204\306\266\333\332\003\272Jrn\324\352r,\322\376\253\363\031K\201\312\004\277\356V\212\231R+\306\230\341\242P\306U\014\357\227\220\306B\302\230S\211\030H\240\311\214\247x\340\033\032\302\134J~\212)}\315\324", 8000, "\336?\2265r#\010\232\375\031y\371Z\024&\357\366 \263\024i\234\316\233]\243\222\353T\224\002\005\015`L\227]V\361\256\012\203u\004\002\312KT\003]\241hy\001\306X<\211H\332>\357\210`", 64 },
{ "\327L!\213\262\001-_\342\022\310\370-\277\240\035m\200\025\343Ae\202\257N\004\355\017\307\362^\035\325\356\277\013\271\001\320\266nda3\313\346\336\337", 48, "\303\376\271%f\011Q\244", 9000, "2t\312O\303\020s+ \231\346^\312\273\000\330N\206\362\226\254\206\362\315)f\357\316\034\002\005 \250\306\354=\336\247o\313\312a7`_\242c\356o>l^\034\267\032/d\302Ru|X\331\272", 64 },
{ "N\326Q\311\276\010\312\331\314\341\234\342@{YA\252\3404\314\031\2613P\020\011\330\310 \224\177\030\032\247\262w\321\2302\370D\006\235\027\360j\034\042", 48, "\365\031\352lZZ\210\223\223\202\302\3472'\215e", 9000, "Q\271\224\222e\316A\255Z\177l\026\030NT\242\263\3773\025]\376l, Jk\134\221\025\316!yj\270R\242q>\260\277A\213Yr4\211\354\345qH\200\134\304j\026\030\275vG\042`\205\234", 64 },
{ "\201\345\257gf\2623\322\007\016\3369\245$\351\216z\224\311\217;s\202/\002J\364mr\312\262\315\270ytO\001+$\273\205Y\327\212r\322\177\230", 48, "d\210\377\354v3\326\227\321\200\315\340K\022\035\2222<)\035\336\325,\376", 9000, "\013}\246\202pG\243\307! \277\177z8\307~\303G\223L\317\225\312y}\320;\033\206\360\243\227\035\374\253b\252\035\235c9\200\347@\262\231\313\330\301v4\222n\273\221M\016\025\326\331(\243B\316", 64 },
{ "\205\031N\267\2314.\365h\210\246\265\323(\221\367f\211\300&\303D\036\251\024\331g\354\344>\001/BJ \246\226\003C\260hj!\210\343&r1", 48, "2\315\225\207\307C\267e\233\013\261r\234Sz\255 #\316_\267\355\345#\361d\376X\304S\330r", 9000, "J\222\216Z\305\020u%\261\3464\220[\353\254\271t\377\2558\313\312\262\302\341\001r\037\335\261E\210P\010\365Xe\2034B\377\254\003\256$\307s\213\000\033\371\377?0\255\031\225GGO\274\370W;", 64 },
{ "\346 \313`\013\340\264\251M\026\365\376\001\371\362]\244\256\335\203d\355 H\355Vt\305\235\034b5.d\210\211H\317\000\001O\370\177\317k\355\277\015", 48, "8Y\351\207Y\302\312\327\343C\206\335\011)'G\206\272\366\206\037\320-l\275.$[D<\312\330\032\232\236\037\265\361\243U", 9000, "!\217x\241we\322\037-\177\375B\222Na\017\376\224{z\250\254\235N\263\355\351\215\223D\006J\366\262\342\277v\262\335\334\2752\336O\360\250\256\324\300+\257sA\257\205x\375w\271\016\263R3\006", 64 },
{ "\214\275\361}?2\257\011a\256\243\362\270\356i\270\260-|c\227\311\0175\226C\355O\006\201R4\027a@\004tpx\271\256\371FR\016C\012d", 48, "\264OAA\274\375l\304\035\255\222\230\340KX\003\237\270\240s\134\035\213\360`#\253\256\222\346c\234!\311?\245\036\2402\225\267\033\214\002\251\266\325\363", 9000, "\221\257\256\354\355@5\025\375\014\230\203\257\005z\235\355<\316\312\201\306\265\264\376\233\001\315a\340\033B\260u3>\350~\360q\017\233\367\2368+\210+W*B8ZA\225i\313\364\3755\260,\355\021", 64 },
{ "\024+ob\033o\000\317G\244\001\341j$\271i\270\323\214\227\313\362\022\236\230\333\002I\374\206(o\355\352\223M\367\360\015\134rl\207\275\345$%\261", 48, "\014\212\304\314\363\206\374\206\042f\035Po\265S7\011\337U\275Y\3268\271!y\255\222w`\321-(\245\314\275\326I\204\004l\251\312\3308r5mWq\302y\031\204Zd", 9000, "\007\242\343\025\014\305\013\374\007u\334'\006@\026\301D\330\241\252;00g\200\326\300S\335\327\212h\316izd;\272R\225\037\003\032\272\362\201\351\012\370&\356]m\024-\260\270\250\205\1340\374\277\311", 64 },
{ "JO\370\260\3003\320v\033\332\353\250\340\303H\305\276\010\002|\236DK\246\312B\2345\0427~\244\341\021-\226\260\022\134\225\134\134\342X\216\320>f", 48, "o{\276\324v\343\323_\217\010\307,\371\337e\310\260Kmn\277\351\034\022\260M\226I\275\241)1uFY\372N\375\037T\234\340P\355\276\313+]p\035@\0068\301\215\207\020Xry\302\267\265\212", 9000, "N\005L\3772Y\243bo4^\207\034@Nvf\310\340\342\306\254\3429X\207uVK;\210\346\206.\042\271\013\337M\341d\352\234\335\020\371\316\034\271\134\350-\343\263\234\014#\301/\215'\017Vi", 64 },
{ "\312\367\010X(\322\245\2355IP{\034\252p\332\316\012\224\311\245\366\216\355\261@\042C\341\134\273\021|\351\223\221\375\336\255t\011\022\372\216\370\333pN", 48, "h\201\327\177\322\026\243\273\335\206c\260\337\2178J\247\022X&\314\347\356\2576Z\371\012\036L{/\324\205C\227\352A\017\346(\001p\322\354|\306i93\274\360\214\302M\331\134y\375\021$\376]\021\333\272R\335\261=?U", 9000, "D\220\257\020#\326,%A^M)\203C\031\323\315\212*\366upkT\346(\276\340\033\351O\236T$D\030\345f\340d\370\000\325\263\372\336\246:q2\253\216\236\316\222|\273\215c\013\035\341\346\326", 64 },
{ "\012\0021\2554K\025.\250L\177\034\021\271+\217\314\267\312\217/\201jW\304\134,w\371\030\026~b\345\252\032*l\307A\344tG\201\0277\272B2\274\342[\213\353\232\225", 56, "|\330\307\300\344TdF", 100, "f\325\322\343\327\376\252L'bX\232\025\242\260ML\370L\351\012\200\235s\234\346\035\254\214\346}H\307_\350_)Z\252dw\017a\003\323\320\2130I|r\263\260\252\250 *\314\275\316W\213\365T", 64 },
{ "\265\277&3\336\000p\271\375\024\027\035\316\001\254\254\335?\211A\257\330\023z\275P\334^M\355I\361a\372n\220\236\333\226w#_\241\242\004\355\220\377\317\0139!]l\232\354", 56, "\303\322\337A\240\361\204\250#\325**!30\366", 100, "\261F\372\232\217\353R_7M\315\363WC\340/\014\244\373\0326\330\231}\007Yn\031\274Bp\310\200,\253\020Gq\225\237\366\265\032w\213&\343\345\320HG\004\237\312\256\225({\042\352\220\364=\232", 64 },
{ "ZM\361\367F\257\262^\035/\022\245j\330\256\256\347\246\267\320Tb\231-\224\322\223\264qk\035\0316\326\236\010L\300w\326\031\376\304\246\022\335\200SQ\234\031\023\320\271\030R", 56, "\263\213\022g_7\373\002\213\266\332\344m\215X\035]K\200g\014I\251\370", 100, "\260\220\236&>k\310I\270&\302\250\246%\326x\371\213F#\265\251\221\023l\347\253`\253W1\240\300{;\200\264\213\251\003\240O=\214\240\001\214\227%\271P\275 ;}\216\031{3\237\203c\212e", 64 },
{ "*\255\343C\246<&\316 i\270\001\022~\347X \214,\255R\322\223\023\317rk\231{10\012\002a\235\263&f\344\364\326\017ZN\325\377\330\323!f\314\236\372\246\371[", 56, "\254_I-'\322\233$\007\235\371\306\023\012Q\300\036\341L\233N\324\325p\317L+\013v\311\316\354", 100, ":\233\376\345\015\356\005GU\306t\212\010\042\276\274\263\205\221\353\365\320\315\330Ew\340\020\032\003\367\345\366\016\276\134B\0347%\134\2110 r\272\031\277\024\257\321\222?[T\270\251&\200\013!\206\036F", 64 },
{ "\2373\301v\271\235\276\027\036\310\364\032\002\3031\342\220\363\343\355\315\227\032\177\264\224A\240\010\310\332m\376F\330\212\003\253\264\022'\2329\350\372\007\367\237\363\031c\312\357\015\036\247", 56, "\306\020\351%\320Q\236\371\241\204D\020\273\264\325\322\347\276\202k\347\225\312\270'\364\244\267\253\324\256)\361\362\363T\020#\177I", 100, "\307\203\024\042X\2128R\350\013i`\227\217kE@i\275/\371\365\352F\3261\013\203\253\226\024I\214\005\340\266\0024;\021.\004\325\353\333\340\353,\253V\204w!z\360gV{(\200\200\243\203\203", 64 },
{ "x\012\013\003e\212\033\346\266y:=\322\266\034\021%h\337\263\305%\212\214\345\2142&\347\316o\331\277\344\134`\245[\256\222\134\241\323\006H0\333R\345C\035X\036\011w\343", 56, "\324+\317\332\345%*uC*\367\331\231\375:\012\344\322L8\036H2=\370\337\011\254\313<\231\341Y\037_\203bY\235\316\245D\261\275\260\277v\321", 100, "w\371\345\322vt\024H\034uV\345\273\201Y\263\336\317\352m\326\023\373\210\205\270\270\365:e:\232\341\034\340\315\362\300Z\252\227o\244\260\005s\014\373\344V\010@S\0163s\304\373)\026\215S\030u", 64 },
{ "/\357:\266A\017\267\203\302\030\374\011\337yPe\211\002\325\371PI\036[s&\315\007\363\326\227\224h\202\345\241p\236\263\207R\233\223\255\237\201O\213\300\230h\027\372\270\342\252", 56, "\021\037\205\367\202\371=\373\311$\3276\204w8{\322\326`\222N>)\236\250\236K\333\005\134\243\255 \214\375V\204\343\333\201\031pG\236\212+A\321{\222\231\350t_\262\243", 100, "_1\033g\364\204\217\016J\201\3137(\240K\200a\241d\3443\377\266\017\3118\3247\255\343=\251\042\343>sFI(\237\022\034]\007\002\301B\376\020XE+w\344lm\273j]\236\234+q\007", 64 },
{ "\200\315o\042J-\2216|\324{\301\366\352(\313\215\277\202\134&\354^Z~\224\360\030E\341\262\274>\234x\005\201\350j?\363\275\3310\334\303h\247\214d\251f\322\270_\261", 56, "\003Z\010\015'\3659\371\213a\032\026wr\275]\201oD;'z\336H\360\362\262&\312\372%L:\271\254U\252\177l\015jR\256Z\202\341\342^\344:\321\016\310\225W\246\350\031\260Or\247>\312", 100, "g\260\207\013\373\201\012\363\253\001Q\004\347Brs\317\333\350$\016\325\000$5\347\373\235\020\212Xaz\2310\362\310\304|\342\302qdi\272\020j\370R+ \275\357\327l\233\357p\214\020\025n\260\234", 64 },
{ "\027\214X%t|\276uD\2646Sa\0229U\342\263\204\215\017\265\220\262nl&S\323\335\272c\313\016E\343\327{q\010u\215\271\336\350\236{\010\333`t\321\303\330\243H", 56, "\030F\023\257\276\014@tb9U;z\250\262Q\352\317\240\320\222L\177H\371\213?\334@\277$\3062\006\347)q\340\356OjJ\177q\250]C@>Bp\275f\372\203g\200N*\234.h\256\201\251\312\260\363\211\334\207\332", 100, "?L\013\234\225\011\245S\276\333\202\356\012\347X\343\223\312\310lx\307\243L!t}l\322\360KFqu\263Wy\362!\323\373}\316\276\374\350\202\361\036 \336\237x{N3\261\373\037\303\013;\254\302", 64 },
{ "\201\024\017\256\016\004\012\266\346{\253~\241+K\242\032\340T\200\207:G\234+\336\266\321\374\240\371\313\213\322{\2001a\314vkv\253\270\347\306\241\377u\233o\340r{u\215", 56, "\351\256\262\270j\374*\375", 200, "\225\256W=\253\033\267\207\010~\367W0\375\035C/g9|\3500\237\011}\277\313\023\032\003\017~0\032w\037\327z\257\221\371\272\000\030V\257Z\203p\324\202Bc\262\302\360\266A\027\255\347\016x\277", 64 },
{ "\361\362)H\255\223\262f!\237q}\211a\313\340\013\273\255\244\177\005&\226\216{$5\206z'&\232\273/\370G\216\201\034\205\307\236\330\2132\033\210\257\235\001j\026]^\365", 56, "=\364\001\274f\263e\006b(p\2263\035\205\231", 200, "1\337w.o\2238@\015\221\025g\241\342x\236\342\034jT!\003\023\003\3037\255lvx\252R\377bt\037\010-\263\316\326`rBb\353\202W\270\365\234\250\251\253\013\303\357\007\352Uz)\037~", 64 },
{ "\257\277\134)\332\355d1d2+\353\373\030\375\367\033\252\200\240K`9I5\357-\216\020'p\315c#\221\222\2375\036}T?Q\357?\370\234\226d\015\014\024\362.\230\225", 56, ">\316\225q:\330\227\235\001[\025\200\360Q\020W\213\035\005d\232\310\003\362", 200, "*\337\342 5\215V\033\277\266\235S\275G\3654\274g\323\377\200\327\221\3660\342\337\242\365\025\322\264q\257\354\307z\242\355\276GS$NM\373\212|J\211E\027\234k\215F\241\214\351j\323\227\243R", 64 },
{ ":\334\025\003\012\272\216\010\265\303dz\332\270\244\370\337\337\362]\320\001\374\247\375\211\236K\236\233/\016R\356\242\030k\224\005o\322+_\241\013\337D\345\325\246\277S\245\335\262\370", 56, "$Z\306*\301\024\365\341\272\252\241\256\004f\260\313~`\253\227\307\015.@td\027\352\023\303\037\245", 200, "\205|\242\366\361\322\316\360\003\330?\212\227d\011\367\306H\364]\321\015\013\233Cy\236\301E Y&\336\013\265hE~_d\207V\367\270\362\211\377\351\012\020\037H\323\321\356\272 \345TK%P\317U", 64 },
{ "\231\277x%\233\335%\020O\317\273|\332\300\025Z\375`\254Y\001\374F\277\347R9Jp\257\355\305\314+\222mhE\134\364\261Y\220\253T\016\341\230\220\2049\350T.36", 56, "\273\270\005p7\266fex%\352{\216\324\317\230\347\201-p%\273\305h\030\324\317\005\012XQ\252\204\004b~%\300\350\322", 200, "\225\266#V\362>\224s\003\004\343\234\013\364\250\2561`dF\270+\257\226\314\007\014X\302{;$\376\376b\034\300\350J4U\207w`\200y\011V<6U\217\274\320\134\036\231.\263$\003@6E", 64 },
{ "\335h\233\222\333\376\221l\310\277Qr\311\245\030\026\231~\264\376\374\010\010\352l\367\014\346\2428\204\207r\034\236\367|\202\311\014\200]\042\350\230\014\042\227\315\304\006d\037\354\022\236", 56, "\327q\034X\210F\233\134\316\225\3179\216\311\335\262\213\011+\300\242*\324]~n\300\330\301z\345\267\350M\012\036\267\222\221u\317]*\271\271\350`\027", 200, "X\025\236k\211#\272\010w\252OD(\042\234\244\252b\004\014\017G\377\206\201\367\311\346\225\347\271\013\253\022\224\375:\015M\030a\337+\371\301Y\342][\245V\202F\373\230\325\246\301\030\307\016\316\367z", 64 },
{ "\321h\237?\226|\246\300\002<w\226F(\252\261\020<{\230w\235*7,C\331\272\007\375Tl\010\360\240C\267\007u\037\220\322\356\271\333+\352;\336_\277|\030&\035K", 56, "\304\304t\314\323)\354-\225\204\037\225\365\001\227]\242\264\3710}G\042\032r>\2461\036r\302\201\347G!\345\243\352\230\212N\212\301io\002\265\224\234r\234)\014$\371_", 200, "\265\256\260C\322\362\025UZ\373\310\042#\355V\2627\214vv\031;\305\177\026\337\033\004\255\344\201\006J\232a\227\215\134\263M+\277vvF\263B\244\366\224\321\200\336\360\273\332\030\273a\177\343WQs", 64 },
{ "\237\177\212\014\014k\321\033U\252tY\371\002#\332.\271\206._\341A5L\365\305\026\303\231k\362\200\314)\236\250\351\212b\3224P\225\361\332\247\275F\321\310]\330\213\341\210", 56, "(\233\022(\235Z\311\220\371\003\035\315$T\361\220s\035$X\370\271\260.\013s\012/k\001s\246\001\216\221\346+\324\262\363\030\331\230#\370\246Z\004\036z\310\034\301\026$W$\322\356\270\315\241Xt", 200, "BP\254{+\275\311\2262%\303\320\352\313\334\326\347\013\025\272.\332`*\242\302\315ABZ\372\211}\352fy\377\276?tQ\002\320s\033d\343\351\036t\033E\326\336\315\335v\310\037\203}}\017\223", 64 },
{ "T\375L\020\260q\210a\271\242\270\231'\317f\366\331\017\022\004\253\275~]S\012\253\010\022\265\134\035\332\351a\371\362d\376\021\006\300\205\010\264$\027V\322;[}2\023\346\364", 56, "~\323Y\311\222IiD\042\377EK3\021\217\306\235\250U/\033\236B\236j\032\134\302\006\304\006pm\2145cN\234aR\017$\356-wwH$^\001\015\317n\014x~;~\312\335\256\227u\237\342\312\217\323\335\250\023\331", 200, "\002s\037\213\325\205)\134>\016\217\302\001+\004B}\232\304\333\211\213\312\037?\020\374\302f\256\204aY\275j\277\020^\005\256F)G\360\212\240v\012\327\257+X\324~M\245\320d\340\360y\357\312?", 64 },
{ "r]\363\000hr\356vY\302\354\336\273d\322\265\201X\323\205\361\277\230\224\273b\320\354\336\241ff\322\356\376\256S\025\375\012d\376J\327\360\263\250\363\265\031\217|\005\217\177\330", 56, "\035\205\201\0145\016\364\255", 300, "\234W/lg\273Pn\323\134\015\0159\035\264\330S\345T$8\376C\327\255\367-\310'\253\355wbj\016\305Yo'$`\327\177\315\254k\317|\270\300\201\016\270T\361\334\237\302\356\262\025\361\365<", 64 },
{ "[\362\344]**s\334`9nhC\212\320(%\224\341\366\347\206\215\337\211N\346I0R5hZeU-\3144\351U\364\272\004\231\316l0\3422D\346\376]3\211\224", 56, "4\2300\026\333\211\255'B\033\267\363\204|`~", 300, ")\333\035#\321\025a\0216\306|\273\331\025\302\306\342\231\036C\012A\240\356\364\001\030y\032\023x\031i*\346\341;\212\261\263\212\274a\017\352gM/)hN\232\262\031\371\267%\032\271@\017\313\342i", 64 },
{ "\0232\236\245\236\367\265U\031\235si\306\327\024\240\2143\261\213\265\377k{\225\2673\026\037G\007{Q\013\2020<\375\340/>\2354p\030\315\354p\375\267\321\266P\2365Z", 56, "\262\3702\216=e\326f\231R\303z\255r\345%/\315\316\340\2004\300T", 300, "\273\376\362\0214\002\345.\313\332\230g(?\206\3403]yk\360\025\233\373H\016$\354\003\240\313\304y\373\326\210[-~\360\200C\023\340\247p\323\224\3437\022\322\255i\364\317\217\354\301\015-\020yA", 64 },
{ "T\317^\247\304\021a\362a\235R{\266[\323\3054\252\276\036\005\327\342vn\134V\340\336\257\005\327\253\236qt\253\356f\003y\333\302\217\224m\030\264I!\207V\271fXn", 56, "\336\036\015\030\323t\010\037h2V\2514\2561\325>\3605\3354\226\363\310$\355@\261\324\321\333\272", 300, "(\202\245\265$K\256\300\037%\010\230\337\266\334\305\207\016\340J\314\233\315\313\257o\363\346\253\306W\245ID\315+\321\247O\240\007\273LG\203\2564\351\371\342\326\210\234\360\356\236\300\037\256\317\313\273\363\374", 64 },
{ "\351{\362n\251\033=\004\304\323\332\276\304\306>\375\250\360\207\263\0359\033\244}\370\0060y\275lA\037Go\351\265>\345\270:\346\011\223\356\233\003\242{\371V\372\030\011\235M", 56, "\205\300\276\134\262\237\230\026U\042O4\354Z\324\017x\370\326~\240{i\211k\326\014\350\350\223<\011\233q\315\271)\201\002V", 300, "\250\302W`\353 ;\013\354EmG\210E\344\244\346\343\303\364s3\207\352\262\012L\200c\342\275_xF\301\302!\030\310\277\305\031p;\327R4]\241\012H]\374y\271\273;\331t\323E\211\346\223", 64 },
{ "\373\344\235\025\313\213\037\314sE\305\217\201\207\200\255>\016\002s\270\276|\2027*t\223\211\253\350\310D\202\223Q\202\273\211\341\214>,|\334\327\375\016\242\004,J\351\207\320B", 56, "\242X\031e\233f\003@\274\340z\364f\303\215\301>\234\335\243\243\334\341\254\004M\006\275\276\266\300mx\346D(\303\207\042\263\300\306\372\240I\252\016\324", 300, "\263\336h\205\364\347\361\237\246\230\226\032\372\2349\331k@\276\255Bc\217\012\0247z\304i\353\367\206\310\311\366SzJc\232\255l1\317\025\2470\235\324>E\367\200\024\027\212H\276\310\370Z\237\227{", 64 },
{ "\242\220\207S\211\213\272\343\333L\223p\271#0\016\251\363%\213\347\017\204;R<E\204\261\204\260\205\375e3\177\203\224Hp\377<\216\361x\236d\251\001\022i\265\026\264L\321", 56, "\202v\374\247?\356Q\037\272*C[jDkw\321\233\222\244=\206D\3264\326JS\363! \025\316\211x\374\036\273\266\212\2716\332GM\275\263\352je\005\3318\315\335Q", 300, "~\201\352\3747\372\036\276\201'\037tI\014\261^a\324s]\007\251/\276\002w7\333IO\3128)R\032\012S\263\023/i5\3013\240\253\201sj\344\214C)\361\011k\327\232\267\000%\333R\004", 64 },
{ "\017\301-\345\223\003T\010)\134\275\373Ww\257q\2155K\324\250\200\334\315\007\246\350B\263\216\202l\304R%z!\372\370\264\332\331\324B\340\024\264\274\015\202+\033oj\354 ", 56, "\22616;\243%\012\376\342\271\275\015d\222/\327\257\215\335\253\211\373\341\324'\304\031Qh\241\353zP\266\305D\3150?l_\242\344@\354\0059iI^\265\211\343\257\205;\234\263r\224\016)\277\013", 300, "\330\007\326/\254\033\134f\373[\322\022?UM\013\355\337\313\264\2425'\231\312\341p\350!\333\370\360.z\200\030`\365\011\221\371\017\305/\203\265\007J\374\012\242\341Q\030\330\245BYW\311G\0362\345", 64 },
{ "r\272\266\025)\000\216.\306\327b\326\376\307\364\317\304\313\034\242\304\263\321x\202~\302\002\201\212\370\213\240\335\364\012}h\001L>U\010\270\216\250S@\223\243%\234\013\311'\350", 56, "\272\221\362\224\225\266O-\360\335\247\377\371\205d\236\270=;\2716\353\305B\2476\243K\034\222\007\265\025\314\307\264\230\303g}[\271\253\211\271\012\303v\301\273\214\331\236\267`\366\255\321\241(\342Y\004\224\011\210a\315:\324\264\277", 300, "Pp\361\036\353\372\221[\013\324D\014\252\0254[\234\345Z\245\367\311\234L)\373\242\273\024\233\376S+\3751\373R\030\223!>H\260\010`\015\355\361F\372\263\343G\030\375\222p|\265/_h+&", 64 },
{ "\326.\362@\324h\237\007\317\030\307\035\215[\2572\312\232`\302\265\017\2659-\314\364\241\346\2323\251\225\204\235$OT\271\340\231\377\210\211\254O\013\036\340t\324~\350\346\305t", 56, "\362\042\271\224\360\031\217F", 400, "-\033\3460\367 `g#\240ShxVOKzW\261\330X2\333\232\370\251\274\325i\327\354-\222\257\2552:\373\305\330O\007\227\015\350\014}G\2259\021\320'\261[Gp%?Qy\014\321\240", 64 },
{ "\004\307GI[\200\276k\233\014\225.\363xI\373Z\327\356\255AK\356]\366vV\202\377\213C\2176-\223Ty\221YWH\232\332\364H\236c&\367\375\243^\222\035:\337", 56, "\035\241\360U\224\261\261G\020\334;\225\277L\333|", 400, "\302%ni\223\031M}\257R\257\022N\314\205\367*'\177n^\272\300*_c\320b\134\251\230\346\021*\225X\245\017\336|\134}\177\277\315\310*A\247@\330:\000\370}=\034\010\203\376\373\023\236@", 64 },
{ "\010\202\234\205\036)bJ\310\323\276\032\230%\177\200'S\377vNv\3722\217f\265XA\177\366\223\034\042s\377\317\330\371b\014\333x\240f\366\011R%Dc\366\207K\200\333", 56, "GU\2662\202\205[B\0369\034\035\232c\322W\201\372)%CIV\374", 400, "AvE*\202\274k\201o-{!IEA1,\204\352\330WY\042W+\223\2136\365\300W\324z\355-\303[\013\0224x\222>\025\014H\007\360\234\266w\310@\276\344w \301\200W}\037N\303", 64 },
{ "\234\364\262\000\230\271b\374\255a\300\224e\024\336\346\326\220\022g?H\2258oY6d\335j\004\376\257\254],\005\0062\227\017@Dr\331\027\204\331\012#\303\012=\225\035\363", 56, "\2467\305\015/+\364L\303\350oz\253\3162\204@\375\370\257\233\305W\345-\004O\277\267\227\312v", 400, "\240k\030R\020\201\027\303\363\242$3\312Y\307\276\010\231\333A;e?\005\023Pu\036[w\277\317\300\006\262\277\276(y\334\201D\253\226Q\3711\036H\134\320\253\301\017\225\224j\371\033\320\304\336\035&", 64 },
{ "\037\257\213\333f05\350\261v\2161\360\355\200\033\025~\206\226\363\011\331\343G\013\207O\364U\250\211\216\242\017\242\021\3148?!\024\261\211\200\265\036&\000\3374\207\022\221v\221", 56, "\256\337=\015;6\264Z\355\255\277\257\252\030\273O\375H\350\027\234|jK\222\234\331\033\2259\134\250\011f\267 gd\264\203", 400, "\317X\2557\226\351\276\234\3122\235,.\265\247\003jFE\300\0035\373\3407\001g\202W\337\335\325w\252P\030\272\356f\267\344\276M\205\334\024n(\350_(E\335|\224\303\220\020\232\2223\272\2260", 64 },
{ "M\242\373\013\256\274i\320D\361\373`\235\216\204\374\312Jz\270\266U(W\265|\013\316\254\253?\242\357\134\020\274\352\266:nT\210r\234\034wm:J\257\264\360\023*\015r", 56, "a\273=\277\347*\301~9\022d\027};\355]\344\377\274\236\334H~\304B\202^+\240\367\335\356\204\255+\356\356-\311\371\212\324\201.-B\273&", 400, "\020[1\211\376r{\005\214\205\254G\247V\341\010X\012\020P\235jo\256\032\216\312\002\024\210\034\015\305i\246\031\023\020j\021K\257\025U\352\027\232\357\313\240B\034\214x\305l\233\345|~+\312\233\264", 64 },
{ "\217\266\276\265'6J\215~\014/\3073\036\225JL\323\226?\272\134\216\323p\306\315\353SM\245\364\222\260W\362\242\215\031\221\276N\366E\216\177\042\366%\004\006\030~\345\374\345", 56, "\223\210\035l]P\232\362\025\350\241S\232\012\010J\023\321\374\340\247\014tWQ\307\227\307Q\243\231JO\005\312\010nt\2361\022'8U\017b\261\261%\2319\265.Gix", 400, "\333\355\310\265i%\210\022^\370\231\221\3660_\212\042\274\336\030x\267za\216\260\257c:\251vJ{\340\3651e\013\312>\016C\016V\277=\327\233\363z\244\201\317\247u\344\235\356\212\373\255x\134q", 64 },
{ "\004\033\236\331\011'\042\323i\013\333\304e\236\371\260s8zb\252\200u\025\313D\207H\267V\215\177r\205\3439`UY\370z\033^1\322@\276,A\004Q#\371U\016\006", 56, "\001\265\022Z\004\037e;`\2647\326\311\272\316\232F\267|\344j~\373\340\306\372\263\325 \031wp\234\034\236\025\023[7\352~\330\031uU\356bF\236l%\350^\200\312\012\240\025\351x\007{\247\270", 400, "\372\2501\204\346\276.\2567i\242\306\303\001EZ\342m$\357\302JAt3\201\316\346f2Ut\322B!$\217\332B\216o_T\020\264\035\316\340\2001\243\012\364C\232\224\373\245\260\316\330g)A", 64 },
{ "\213\223\354\023\313j\023\220q~\260\252\263\027\300\332\0118\026\252\311\332\326\212U\301\033\303Y\017\017\244\217s\307\2501\026\007$K9\260\277\361\0043j\350\220\2632\006\211\332\007", 56, "h\026\365iw\313\2138\012\2264\351\335\014\2474d\362C_\024\225\024JXC\305$\215Z\375\373-\236\227VE\254\022\267\363r\372\317\265\325\376\013\241:\256r%\256\326\272\236EA~\261\2327\005?]\316\207ZxfR", 400, "\204u1w\363K\350\277\343\042\223/\257\031nS\341.\313G\374\342,\030]C\324En\373h\031\267\237wB\2101U\314\375\023i&V%@6\310\360\252\214\335\353*\314\225\036\037\273\203\221\312\344", 64 },
{ "8\240\204\313Z\214\303\037\032\177\020\331rM\221\265\375\375\342\313\224\205\347O\206\322\354\267\351\207\346\347k \353\272G\241E\326\336\240:K~%i\372\2757\341z\202\212\030\210", 56, "B\313\0113B\2333\215", 500, "8\362\033\014\244Aj\352OV\203\261\267\326E1\034\316R\217\026')\262}0#\220\273\377eN\224\375}z\320\226\031\315\042p\377\015\232\341\261hC\304W\322e\204\210\001*T,\323\343\223m6", 64 },
{ "\371\222\270\331L\332\315O\2555\300\244\374Uf\224\242z\202\202e\232\205\234L\316\372\320\025\230\031\366M`\357d7\312\022\300\260\341\016\324\313\354\317VH=\265\343H\312d#", 56, "!\006\353F\360\305\222\013\012\364SEB\373\245!", 500, "\220\303\300\031\253\227e\134\203\326\373\024\247\231\262\276]\355\361\027\331\241\307\373\346?eKjt\347\371\357\205\345\313VJ3\363\252F\007\177&#\354\240\351=\010BtFa3Z+\232\042[4$D", 64 },
{ "R\265\240lF\235\024\367Z\231\263\251\216\332\252\303m[\316=\3151j\322\3674\307!\006\356\2235\237\027c\301\344\377\230T\372\346]~Bxm9\020-\234\244\3047\010\320", 56, "*\374\372\266\201`\266q @\376w\353S\356q*A\306\230\376\301|\012", 500, "\367nb\322\341vl<\003a\327\016\340z\3251\262\025>K*c\314c\345R\24464\324\306\264\267\330\352RN\3539-\342?;n\373\013 \240\042\351J\247\001\265K\264r\232b\021\277y\325\371", 64 },
{ "\370\336\306 \221D/\203,\255 `\010\026\322)\320\374V,\204$\2301vdmC\351jXg\225\013cB\250\272\352.\2229\222\236\177\313\206\250Y\341\330\354\313`\217\225", 56, "\377\260~\010\305\305\317\244\3077\342\345j\263\042\013\016\134]\233\263\2756\341\234\031\215\227\211\213\326\036", 500, "\315\244lW\361Y\243\037\271\365\225oJ\214\345\303\276=\210wA\243\020H\347\205\223sB#\307~\325\364\325E\201`\017\2369\223\0229\032\177\206r\024!j\020U\231R\362C\226\000%G#\353j", 64 },
{ "\316&\225G\355\351\364B\251hv\363\000\324{>\214W\000\3614\306\205\177\302\363,\216\346\250\215\200%\335Yo\020\017\3641\377GhM\233\366Hg\354~ \031\242q-\234", 56, "a\217\345\023\221\220\317\354\275\235\300\00708\375&\267x\03222\374\236\307:zY\200\265\352qk\334\024\010\240\332\300\031y", 500, "_R\245\215_hC\024\037\024\3230j#7\210\334\245\0162\236\010zL}8\306\006\024\373\356h\317\026\364\345<r\250z\007sS\033\257\017+\3245\270\263}\014||GsYK\233\356\211'\312", 64 },
{ "\350\205\324D}\357\233ZW\247\277\315\335\301m\313\211\254\221\234\317\205\236\337I\250^\354\242\006b\3752\266\316\316\310\365\317\020\033?{\267V`\232\255\226\0333p\032A<\201", 56, "oR\311\013AY\374\330\252\350\364\341\222\342\037Z\273\014fet\016\030\037\316&\366\360\033\345\277Fb\352\002$Y\307\017:h2\364)\205\234\357\025", 500, "Z\006\244\336\245\201\255\361\210\324T\301F\204\270\037\001\270)Ha\336\255\346\202Y8\372D\342\372\354Q\014j\254\023!H\210\024o\242\004\353\375$J\213\221\364}F\020\312\237^\357\313R^\276\342\177", 64 },
{ "\352(\177\002\336\371'\034\021\246\3708\220tv\325\243\224\320\343\370BLL\356\134\023\356\271\201=\223\320\020\024M\233P\377\376\330\326\003\217\247\256d\204\2611\0142\326\237\313\273", 56, "\253\255\305\215\376\251\002\033\224\247\353\235p1\324^0\215J\2769\364B\241(\263da\317%\372P\326.\242A\352J\220\320W\224\230\275\3619\241o\201F\206\255Y7\304h", 500, "\265\325a$6\262\355h\243\225\302\211m\323\201\2703\230\255\210\337S.\302\002v\270\233\353\335\344\035\264..\336\201b\352sb\370\222\227\256\022\316bc<3;\274\231\257\031\037\275\206\202\227\304\214z", 64 },
{ "\242\022<?\216\255\332\362\353\342Qf\335R\030\200\302\023x\247\224\225#\225\376*\032v\007P$\266w\274\232\021\330\3334\377\375\360\277\330b\006\206\304-\334\372\222\314\026*\330", 56, "I\311\017\202\030\344\204k\206\226Y\350\275b+wu\342S\320\036\025D\330\215$\222\372\256\011\030te\343\3403\352R\237qj\231\331\020n@\325%\357\010\253\356\377\247\264\265\347\362j\320\017\202\226\010", 500, "\254g\373!\203\263\013]\2700#dr\225\320_q\004\215RP\2773r\342\366/e\262n\232\252s\371D\263\024[\243f\333F\247_%W\336\011\335\205\207/HhC\337\272\370\242\313L\376\024\372", 64 },
{ "\220\353\227\035+\226 \217\372F\356%y\231\335\214!\340\235%ucM\307\250|k\376\251Q\244\335W\376\346\312\002`b\261\021Qo/\030\361S\261Q\330(#Mc\364\330", 56, "\273\213\274U\371\241\270\314\332\271\034\221\235\326\374\337~\315\373\376\241%\204\300F\025W\226\032\005\333\322 \0135L\233\340y@\210=\250\314\236\006h\2274d\301\014\346\237U\243\034\364\256\234%\367>~\341p\024*B\243\277a", 500, "c\247\212b\321\262\346\313\253N\321\345\201\206\334\254[\373L\225\200\353\000\201\313\234i4\230r\223\225\371\033\203\327ZZ*\320\017\345`\302&pa\332\2166\245\0213S=_\021y\001\274\341*\337\015", 64 },
{ "9\331\351&r\205\345X\365\201a\003T\207\241\036\347@&\221\200\242\042\237\000\277$2>\006\324;\255$\273\354\310\177\254\134\273\360--\330?\347\042\356cf(\260v&d", 56, "\204i\217\313o\315\006\017", 600, "r\332';\213H87i?\177:\367\356\233:\224vY\254\355\366u\01143\356\001Pj\3678\256\305\270\273\352\323\303\242g\006\342|\226\374\252\233<R\376\234\242\264\343\350\0028$t\275\342\321\367", 64 },
{ "\357\267)\355\357/\241\260K(\232j3z\022\373\236\004N\233\224\010\377\300}}\016\027\214\3340\026\343\262\232\222\237A\277\031\330y+\026li\323\332\004\314J\310\000\313\016\014", 56, "\263_g\016Bk\261\020\204\236IKM5\327\251", 600, "9\375%)H\274\355\031-\255&\374\206\027\277\314\314\366L\326\336n\032\367\2477\340O.\351\233\305\202\000\376\307\272\007\210~\134*7\134-\366\341\345\250\330\301\261\031\272P8\346h\302d\023&(G", 64 },
{ "\213\333zW\216\235UX\210\032\034\250P\370\270\217Y\361\211\210\263M\324 \205N\006p\235\010\350\320([;\341I,\034\025Vp\263\014q\245\0148_3\256\246\177O\273Z", 56, "\231\301m\336\271\2521\254\262\035\354\027VR\232d\306]d\036\362/\245\255", 600, "\031\236\356\222s\347'#\201Bs$}Hn\012\3701\225rI\276\247\305\006\240\317\245>\276\250]\324rF\024\032\301\273\256\255m\377NO\265\304\367\203\321\266\310\356\342s\225\032\357+\312\213Uw?", 64 },
{ "\270U\034\335n\235\270\363\250U\320\023\007\303\222'\272\216\363\242\032\275SG\210\330\3754Lc\222\350\134/h\332\371<\224WF\223o\263;\233\353\345\025\350\256\364\327\224\335&", 56, "t4 \226\006\027QS\313\233i\310X\355\276a\331\261\266\2512.=\2357\312\322G\247k\357\302", 600, "$i.\353\372\375\260\262\325\351\0369\026\030\134G<g\370\012\322,P\027\015*Pz\224PUUy\263\344\333%t\367IU\304\277\010\250\025\241\333\226\037\220\026\350H\331>a\203\275,cf\355\334", 64 },
{ "\346m\257\241#\351\207\231\301\364,(\240\272$\033\314\033\026\012~\303ZxP\361\313v9^\334n\030\017U\352\351\352\322\352\355\341\27733\330\042w\027>\247z\005\371\006\226", 56, "-\243o\371d\035\335%L\226\267O x\350\304>\214\256\213\3356:\351\277g\306 \353\221\270\345\301#\037\001\320\260B1", 600, "z\134\243\023\005\301\366\210{\310{\356\254\207t\205;\342d\330\226\274E\005\016\011A\322\242J@\327\364\026\313\016\332\201/\240\024-\004\016\304\264\222\326t\315p\274Z\242b\337\254\3725\377|jIs", 64 },
{ "\250\225i\221wd\264\223\242\322\230Yb\362 \310l\376\353\231\016\230tp*\264\300H0\207\354\033\273@\342\207\220\006*\351\355uc\024\243\257\315\234n0M\342\373\310\033\220", 56, "O\306[7\256]\327\010\244\317`{\320\370\317\362\252\320\237\2253$;\334\266\210\327\350-\033\232A\342e\325\367\3747\222J\230\227\201q\210\315\2072", 600, "WI\236\335P\013\367\250i?\134\202\362\205u\302\026\257\265\341\343\012\007\202\211w\335\314&\321\374\271*-\014\002\214\264\367\270\326\240\3664\325\377y\372\350\244\300\304\300E\201\357\015\375\234S\264\316\271k", 64 },
{ "\317\372\363\304\351\254J\322\330\333\343\342\273X\005eNe\311hQ#\025f\372U\2062\241vTFe\223M\342\232\340\204X\226,\307\327\301\007o\231\023\316 K\347\320\323\260", 56, "9\313\372\250|\034*S\357j\353rj\312\220/\363\032E\263s}\324\261\237S\371\347\017\337\355\250\243\214\347\031\340\346\305\0070\227\371\005A]\231\020\011+\330\310\016\221\337\373", 600, "P\263ay~\314\235\215\300\223\357\3164\035\273M\211\010\315\323\305\374\366\305\2254\345\242\245\243\334\301\202\315K>\361Y\231\214\3736\2526\205\345\362\360s\261jP9=\305\247jDcM\302x\300\203", 64 },
{ "\231\020r\351\222\326\232\3676\363\365e,\345\2735M\305\206D\233\364\004\226\3011\021\350\335\274\332\211\220\244\333\322\233\346\235s\230\331\243\006\272\3071\273\012q\001<\330g\274S", 56, "\005|\314\037\367\277\250\037\357\241\001\177\015\223_\344\034\206\232\015f\365@(7\315$C \236\352Y\245\335\335\273\023\256\224)\3341f\177\240\264O\340s\023\007\2762\203\345\237P\274c\231\226\352\340e", 600, "\305\321\337W\216\330\313m\207O\363\360>\272\366\260\357\323\363\276*U\254\015\2625^\222KpA\305\272\325Q\033HRv\005\257\244\2535\350`\230\367iE\007\035L\370\245\351\376\271\324Z\322b2j", 64 },
{ "\037N\217\212|}\007S\020\333\014\232\251p\372\303K\221\012\246vM2a\015R@\352\207\222L\305,:Z>\366\315\011\337\235\231\005\360\201I4\250\134wA56\272\360l", 56, "4H\225\022^\246\212\243\273\232\202\355\2763\021%\027B`\263\237\262\2154\204\243\206\216V\322\234-s\2118\231\217\231su\271\350O{H\210\3771\336\23025\202\035\033G\3415\002\222o\205h\214\270\205\3148\274b\345U", 600, "Z\265\226\035a\361\003\364\343\370\313*\260FA\335\363\252,1\224\300\031\306\215\323\230\017\032\272\275\001\3052'^Ip\223Y\367\322)\211+\206F\244}\377n\323d\322\301\237\014\223\330\215\205eY\243", 64 },
{ "\376\017\306\373\021\035\314L\023y\325\312\233V\010\210O\177\307pK\372\207\214\273@\320\333\265C\262\224\276,\265\324\311\325\347M\324\362\034\255\025\015\351\325\232\007\216~e?\275\346", 56, ")\344;\206@JMm", 700, "}\216\030\376\247\240\353\010H\313\326\233H\314\300!\3035\032\213\011\273\247\336\015\031\356\221\021\0135IP\004(o\353\266\302\042\345 YNx\2168G\260\000\021\300\230C\263\364\246;\312X\357r'c", 64 },
{ "\200}\3266\3355np\266\024\225\022\220\024\033\35004_\227|\244KK\035z\330\025Z\252\2433\267\366\014,\242\227Xu\243\224\202\134g\364)\343\250\254\027g,h\261\352", 56, "\277m\222\260 \221%\375l R\023\037;\012\211", 700, "\033\343\371\36231\001\307\257\236\264\211\022\323\322\317\274\255\223t^D2\042AS\201w\316\313\346\001z\177\364\274\345\3602L@\330-=\373\251\213\244\304\334\2513\257\244\241C6\257\272p\275\262\320\305", 64 },
{ "\033B\026\222C\254\310\342\304\321\016z\205k\224\252a\000!\200M/Rt\250\353\020D@\255\215\020\246\203\347\014\306k\006\331\301\256\317\275-\012i\355\305\031O\330\225\210\235\341", 56, "\231R0\266\357i\320z\241\257\006\001\305\255t-u.\024\024h\362\303\010", 700, "l7\324@z\220\002\376\016\346\267K\353\372\312\024\27406r\310@\274?bUR\323\257\255\326v\236\242M-\017\002~\264\374\225\260\317\347Q\223\304\343\177\020\302\300\246\200~H7\244\304\200\024f\003", 64 },
{ "=L6\333n4<\267\177\003I\226I-\012\004QV\006}~[{\361\215\263\0223\317\247\322\323\201=G8EC>\001WD\264\246\006'\035\264\255z3~\014\243C}", 56, "z\321\231E(\307\255J'\354)|=\027\244u]\012\375\005\317556\351\3456p\3569\0200", 700, "\211\261\347\230\222\312FWB\3207\257cP%+\2160\254bX\311\00638\260\344\215s\317\267\252\241\240\352\305\334\261\261\305\232\272\272\263\021\304 \261O\321\304m\371\007\265\024V\231~t\017s\321R", 64 },
{ "\300\241\015\235w\211\316\205@\320[\230\373\257\343\177\202i1\227\325\276\376%8\257j\345d\332\205\261\374\2751\206b$\306H9x\306\323\257V\024\272\177I0\353\201\277\306V", 56, "\011\254kz\217>\305\2321\3031@m\376\376\331\021]ASZ\036\237\020\231p\263\203\263\024\372\347\264\3618\205\253\207.\306", 700, "\263\200\330C\011\000e\325XDU\233\255\324k\014\243\360i\027/\302?\241y\367<\021\315\177\032\347\277+\000\033\227\015\223\322\367\252K=\326\373\226O6+\334\250\207}?\001%\272\204\235`D\346\306", 64 },
{ "\347\317\361o\3477X\336\203\206l\366'\212M\042\375\364\374\035\233\025\042\360\344O\241^\341O\015\016\212\341q\233\0156\312u\261\320\253!Kh\314\253\250\302\253\262\005\252\375\376", 56, ",<\3611.\312\336\360\214\022\202T_\330\303!\021\017\016\332\373\032\360\346\307\023\225u\264\236\254\323\336\275JbO\345\304\361\306\026A\032\010\252y\364", 700, "S\323\226+\001\343\205\255/\035F'B\134\273\312\365\350r\203\200\035\340,K\243:7\254\373\340\261\237\317\323\264%\310'\270P\345CE\042K\214\233X\215\214V\233@\330o\351\030A\300\224\326\305\213", 64 },
{ "\307Ss\376.\010\032\270o\023\363\303X\345wR*f\355\2278\346\215\271\311\202\333q\372\007G\033W|\326_\222X\205l\305\372\205\246|\306\240\265\320\207\235\222\335N\233\032", 56, "\226\277\036\252Q\033'F5l\212t\261+'Ty\015L%\006\013\2471\216e\352'T\323\344\346+\362\005\270a\027\220.\242iw\336\030@\321\340\213\371\035\255}\351\330V", 700, "\223\2313\331\263\312\244\352\354\370\016\224\316\224u\3119\012\364\327\273k\037v\311h\317\221\340\275\241\231\026\265\354,-\211$\356s\213\243| \3423a@%5\276\267\3574g;\003\216\264\374\235\370\012", 64 },
{ "\234\134l\273=\360GI\370\350U\324J\330\251Y\315\012EX\346\230\245\201-X\2156;\026r\345Q\226G\304\134\317\322\274\3055\246\2700S{\373\343C\012\366\322\231g\333", 56, "\300\372X\134wN\035\301\010o\270S\177rmj\031\356I\241\024\362\326T\031\373\025\227\310uC\233+59\216{\016\345\226\353\220aN\351!M\332\311S}\365\377\303p\302\215\307h\206\275!k\304", 700, "\233\354\022\017M\373\371\232\003P\033\216\242\3115x=k\226Cn, \327\207\227_\010\035\276j\210\304\210\260\027\237\036\021'\032\367o\2638\346^ *\233P\372C\005\355\266\326g\376\370d\177\376\315", 64 },
{ "\236E\212\232\211L2\265\264\007\242Y\311g\321\356\341A\250\210)v\245\204\226F\020\222\354+#\042\020\233\016\335\042\350\275\313\316U>\253\373R\255\033l\000-\2604\320HL", 56, "&\326\306\023(\224\272\353Oz\021\030VyE\204C\242\325]{qB\202\337\360\302`\210\243\376\213\316\277\2300\375\251\326j=u\033y\366\256\370\320wh7\364R\270\274\200\351'\221\367H\226\355h\250pg4\305\303~\366", 700, "\010\357\316\342\301\241\177Bj\225\314Z\344\334M\326\214cK\222\035\347I\200!G\030\276k\252\322\263\333\320\310\214_\346\033{s\2359j\010\024!\361\350\275\365\025\372\354\360=2)\323[\200\260\261\367", 64 },
{ "\331t\327\313EYj\302\250;|\000\346\337_S1\026V!\360\364\236\033\0107,n8\264\214\0155\204\260ov2\215\317u{\030\036k\314\033\217W\002\314r\006CC*", 56, "=\006\361\134\010a\223\010", 800, "\367\243k\353\347\331\003\316gv\237)tH\371#\370\312W>\217\306&\306[\2226\016\350\2446$\350G\267l\253\303\335\205\020\000\004\314\376(\252\224\373\203\031\335\021n\361 \016\274\223\036f\035\335\261", 64 },
{ "\226\220\3256G:\242\225\364\205Qg-\354\372d\363\256XO\242\275\032\325\014a\277i\010\263Y\221\343\0047\034\231>\222\306\306\227\313\022\260QNjw\303\231O\243=\342>", 56, "H7\265\214\251:\317#Z\272Y\221\240P\025\257", 800, "T\304\334j\357\322[\306\257\254\275\360\371#fRz\253\372G\017\002\246\355\222|\300\271L\303\025NgC\025-\261\220k:\022\352\207\264*\363NB\310\010,$\333\245\351\246\352\300\376\365M\013\240'", 64 },
{ "-\007\335\006p\013v\225\356\002\334\371uL\313\233c\317\220\307+\017\262Z}k\352\334\202\016\251g\204\224\006\356j1-\214z_\272\372\274\224\342\2422.\022\352I\246\303\262", 56, "sC\344\326\346\214\034\354UQLk\364\300}\2477/\373\327\346\210o\033", 800, "\012\223\220\202\003\013-\365\262\214*\345#'\246^9c\311\347\373\031\2731cL\230\034\340\177\213Va\002:\006\357XW+@\334\326\015qN\026\256C-\275W\215\245Euc\026\374q\307(\202\211", 64 },
{ "92\235\215|\036EF\211\322\350\247vP\177\347\305E&u\033\2126Dz\351?\000\134\212\302\215\322\327e\374\227\356_\322\346\275\236\042\351oU\031\011UN\344\323\363\006\201", 56, "\320\011L\355\260\334\247\227`h\265 )E\350h\337\014X\334\357\352\372\260\242\013\257\317:+u\226", 800, "\177\255\370z>\216\202\260\030\342L\331\252~\027\211\035\261\325\321\3237,!\237mQ\371\377\270\221\337F\321@Qr\315\322\312o\233\311\0226\331\311\220\250\3133\335\030v\015\261\325i\362w\3025\256\263", 64 },
{ "*\004^\322\344\321\374\214\034\274\267t\232P\373\214NJ\201BN \373vS\220\027\244m\236\255+!9\006\332\274\036Z\265\321\262\371n\042\317\345\347\3353\247\310!6M\004", 56, "\215\025t\202\003\320\234\240\002=\302\266\002v=\233]:\032#hM\237Y\362\222\366\3609Q\026\330\334\344A\027\025\271\034/", 800, "\362\042\0257\314\336J\177\213+\211\335<l\205\3046\274\305;;\372#\370\204\346_\320\306\322o\032\273\227~\017\025\370;6q\372\322\0074\215\201Y\344\300j\373W!\3409\017Ne\366\237:Z\011", 64 },
{ "\021\224\336;\367\315-\007/I0.N\000\226\376\311\215\203=\225\267\177\245\315r\305z\371\215\214p\346\373\301!Z\253\245\177Z\350\212{\016\373Wv\202\321J5z\232v\302", 56, "\360!\367\327\302Q\327k\207D.\210\212\012\254{1\310\215\212B|W\317\005\267\257\311d\243Q\245Z\364\270/\341\355\037M2\036\260\310K\257\263\237", 800, "\364\342\201\226\254\257f\342:{\004\355>\345\350\350\260[\317\263d2\316|v\332G\021a\210\006\034\274m\006\210\3024gM\022\354bU\323\255\014#F\011nM\303\352\350_\257L\321\242B`\256\340", 64 },
{ "L\204\346D{!\253\215\200\270p\012\237;<\264(;&m\0102{\025W\277Q7\224\354\342\2443\300nD\364\222\026'\0215e\346\234?\320K\203\2238@#\345\030\007", 56, "O\271c\371\326\253\036\205%\331\031\241?GB\177!\334\254f\303?\361\251\245\303&]ES\300;q\016\267(`\272\327\311\206\327+\017\241n$\225\210\216)\032(\230\327\360", 800, "\134vO?\214\307\042]\0237\300\314EL\026\236\320\035\311\217~\247#L\2044\032\3064K\375\312\004\0045\215\361\372vq lX\234\205Z\265\300\211\313\341\335w\025Is\230\307\035\257\351\316\337C", 64 },
{ "\377U\373\2454QB\021\242&\356&\003\375\232\177\205tY\242\033\352\222\312\271\331\315\350\313C\014\310\010\223\360*\266\031\025$\030\275\215\177*S\177\017R\261C\341F\261\363A", 56, "\345f\014\024\251\226\271\255Q\361\034s0\251\035\322U8\360\036\266\301\327\276\002W\362\210\305\253:\360\022\213n\361rW\021\353RjyW\035\206\35532\371\334\350<\245\020\375\315C\037<Gw\003M", 800, "\000\134\317g \344o\221\374\373\213\216\042[GQ%l\220\2163k\320\255\237\253\361\272\250J\220\225\322\042\220d\203\221O\327\214\256\027\023Fp$\004<\361U\317\247\235\332\203\035\332\315\026\262\312\266[", 64 },
{ "5m\017\256L\271\334A\266.?B\177\334\202\206\014+\031\3066\211\247\272\242\314\264\035\356\350\333\134\326\301<s\242\246#.\200\275\025^\301\351\247\377h\362\366B\245\016#\327", 56, "HpKx\255\377\325\037\333\220S\006\276N\352|\264\264t\327\310\342\042!\277\276\010\307%\214\366\247E\205\267\312\007\006r\362\027\273\242\240>J\357 \362\026\222\377\327\332\015\276Z\362'\030:c\022\242\346`3WEx\304*", 800, "g#\2761Y\327J\204\256\311\322\357P\261\342\247`c\240\247\217(<\235\314&\032\000\312\331o|\345\004H\257\042,\264\212\007j\323\334189\313\000\026\257\276\204\027oK\227M\353M\313\177\265^", 64 },
{ "\220\033\242\276\005!h\264\205\376\341\025\311\036k\222\327Z\014\236T\253&6\303\023z1\252\263\355^g\205\020\007+'\200\253\207\340\301\252\341\023\016j\301y\374i\227\320\3376", 56, "\035\321\264\204E\217A~", 900, "Vnq\035\354?\010\220\305M\311\232I\216\374\255\027rE\002\356\033\366\276\021\270\344\215,S\306\370M\332\377\320\376G6\210$\373\220\346@!\031bv\202\021%\177\364\274\203`\332@\276\233\006\245F", 64 },
{ "\024\234\347M\376u\337\222\007\262P\325@C%\0125\337\272\317\215\377d>\211\373\241\2224e\025\352\356,\036\335qw\227\376\274\345d\362\332\335\010%\226\342\276\315\312\037\237\341", 56, "@\361\335l\273\026\232(\007\257K\251\361\351B\314", 900, "\232\213\314\327f\002\000\256\230\244\372c\004\211`*\242\352\214\000\007 \200\306\201\305z\227\222\263!\035TU_\301\332\341\221\321E\223\032\363\370\327\377\300\327$\237\312\325\235\026\372\320\014nCrB:*", 64 },
{ "\340\017\331\257F\302X\231b)\377\022!\347l\274\246W\312\3279\367\325\223)\246\264\223\276\350x\246^\264}\324t\301-1\042\234\263\001tO\355uG\243X\225\373\0003M", 56, "\017\260\272\262\357A\271\024X\257\014g\360\256\235\265\301\302O\022\266\003\134\022", 900, ")9\026y\321\012i]E\347\224\332\210Fl\202\025\230\032\000\374\2748\272\007$\353y\264\000{\267\134\204\210\320\011\372x\343@q\254d\3541\334\020\042\010G\003\215\023\330B\33484\372[\272\273\032", 64 },
{ "PK'7\267K\226\322\360\027\207!\2054\016\277p\240j\225\321\204\330\216-*\352V\357\226\177\214\015\312\314\240J\042R\374hh\255\031\022-\377\001^q)L[(\036 ", 56, "\305k\374\025\247\372\352\370\350v\033\271\243\311`\205+]\336R\257\210-4d\302(&H>)o", 900, ":P\335\271b\336\203-u\005\341\313\242\377\314>\015h\021\177O\351\350\320\362*;\2159\322\266CS\253\207G\000@\323\240o\267\011\321:\361\222u\015\346\343\301n\211\375\344\271\302\210\376\342\034\254\223", 64 },
{ "\310\330\242\212\3177\277R\322C\331\374\3326\273\314(>0\320\357\042N\012\024\244`zh\202\376+\270\036\226\026\340L\251\017\200\347\341\205\2739\235\240\034\250\210R\334\320r\241", 56, "4\273\344\355\336\027\241C\220\271\006\026\270\213~\365\236\230\230\217\042\217\317\021)j/\2372(\215\007\266\305{d\370X\272\015", 900, "\242\250\134\3703\336)l\255mX\014\020-BG\206%\351B\244\231$z\260x\276\220}\020\334\310\270\243\036?\223\020\222H\201\326\203\372\252\236\246\355\010*\030\252\003&\036K\324\201\256\262\230U\2049", 64 },
{ "&\221\233\226\351{\314\244R\254\337\341\265v\251H%\373\210W\042\367\220\2458L\214[IM\253\234\315\370\010\0253\366\205\236\244R\207\212\302\206\221\326\351\031\336[lmq\244", 56, "\360\345\305\014\367\322\302-\3147E\243\001\352\002v\326\365\203l\367\0347\375\206z\004s\003\367\201.i\350\331\315\213\236\321\223\2241&\355T\251\366\134", 900, "S})\307C\037\213\352h\346\177\2231\021DQ\000\355\245PH\325\263\376\275U\2040\335\033\333b\306n\002\365~\330<8\024\341\205*:w\305\026X\205Kcyg;\032N\037\274U9\210\264C", 64 },
{ "\324&\3775\250\242o9}\324w$\015O\0148\311\203\332\360\210\352\006k\027\323A\035\207\21014g\021=\230C\317\201\214\035\257\2402*\371s$Y\232\2459>\271\331\023", 56, "\201\234\241T/\225\007\206\237\356Jw\252u\2178\360\372\224\005\217\335\037&)\200k\256]\177\011\013\267KB\314\367\334\305\301\344'\255\373\310jk\371\010\321\134\032\241\241\364{", 900, "\001\351\012\372\250>\310\370\301rr\023\027\025\2269\340\330\321\374I\007\210\042\253M\227\353\361\361\240\323\310l\263\351\204\015A\225A=w~\022\027\357\007\252L1Hd\253<K\203\336\255\343F\240\017\015", 64 },
{ "\211\277\364H\333J\012\304\247;\331\324\210n0\033`\362pE\316\264\322J\267\335\334k\366\341R\365-\0253R\371\037\347\326\324\306\366[\002\365x\204s~LR\235\267\244\355", 56, "\012d\3716\364\026x8\341\317\243\337\313\376\363\211\353\002.\2776\027Y\042\027\371\317VC\306\343\007Jq=\204+Q9\311$\307\134\370\020x\032\2024\022~R:\364lp\302\205\254\335\314=\271\275", 900, "\014q_[!\315\261\274\025\234\243I\304\204\206\337\301\237\244\254\350'\2567\030\264\300\310\271\375\334>\010\214\325\225\034{\005\263\032\033\303i\253\325\021\352\037\236tv\313;)\257\337\270\004\042\340\015L0", 64 },
{ "M\362\244pg1R\245\331\215k\033p\253J\254\362h\362\353~\310\265\210P\277q\330KR\001\303I\223\000\031\345\336L\3653\200\360\273\376\315CN\320=\224\355\345\263\255\216", 56, "\225\250\341^\2263=\270r\030\310{\014\263\222\356\031I\256\1349#\372\347[\363\026\376\231\331\3770\304\331\350%j\344\3715\325\231F_\273\361\237_\225\351\007\031\177\330t\010\206\206\003\343\307\036\310x\226=\031\355|0\255\371", 900, "\375)M\213\204\314\340(\310\013\374\254\344\220\223F\366\003q\303\220h\237\273\320\273U0\3758]\300\042X\221\347\346\012g\263{\353\353\013@\217J<\015\337\013\254\020ruo\310\247W\304g\312\322\350", 64 },
{ "[xF\003\370\236\377\362\276Q\310l\336o\001[0\335\005=\271\226%a\012#8\346\3715s\015\2753\344\340\030\352\264\021\347\311\226\007\315\251\354,-\351\015|F\313gB", 56, "AH\260\363\312\212\224j", 1000, "W\256\352\317P\3549\250_cu0\352\016\305\025\235\306\016\2440W\317\253\011G\365\343\220\317\00560xW\014\377\230fQ\271E]\3461\354\245)\002\233\031c\317{\300\212C|\021\213\370\025W\225", 64 },
{ "x\340\224\033,\037\317Y\242=F\270H08\371\347\210<\350\316p{\213\333\032R\372n\263Fx\000\305H\302\023yO[\254^\365\360M4\337\360\202*\206zg\355\306\005", 56, "P\256\0302\023P\212-\015\302\334l\225\376\307_", 1000, "^\260\023\024\340\263v\275\345\340z!\263S\231?\301\016:Vym\254\015\245\251\321\303\032\247~]N\023\022\372\332\317\362s\312\233z/\031kFT\220\033\317 f9\275\031\213\233\237\014K\232\032\357", 64 },
{ "\357\254\354\376k\307\337\363jbe0\030\3037\307M\334\220\214\350\367]\234^\326,\371\306\201\251\256:1\306\010\300\346O\233\236}p\037E\031\035\360\262\021\243\260\331,-\326", 56, "@-\204\272E\361g\205\037\222\362\361\0137\363\365\010\305\265!\030EE\325", 1000, "\272\356p\267:\251\314(\371\261\3726\356\257\274\305\263\2266QE\313#)\215\010)\342\323\273wKL\300\012\010\036\241\006O9\202\266\207p\307b\301\352\234~$\335\236M\302WEqS\272\317\300\004", 64 },
{ "\354\325X\031\235d\376>\373\207\010\011\3468\2300\273;&\343\367\336\332\212\025\355\016M\000\303i\326uW\227\3625\2214d\202]\015\261zt\212\275#}\363\347j\177\226,", 56, "\364\232I0`\373\306\273\247P^\2322\311\355G\207HQD^\3420\333\336\322\361\017!\247\306\244", 1000, "u\336*z\365\035(2x\346\345[\305\035P9tR\237Z\2155\260X\201R\367\350\362\264\276\306&82\321\363\003+\2172g\305\336\307\346\201\032\335\233\232\000-{\012\254(\256Su&O\260\223", 64 },
{ "A$E\354\351\002<\012j\265\273q\042e\337\317L\005k\370\346\020\014\352u\357M6\276\337\334FD\342e\335\247\262z\246\335\015\336\277\014':\263\344\313\326k\203z?\304", 56, "',Rr\221\027^\012sf\321\001\027\340\303B\305\3400\317\013i\222\235E\320,\252\177\275\330\214\344\336m-'\012v\005", 1000, "\013\222\350\277#\344j\322rT\223\033\217\340]\247\235#\372\300\360\026z\004\026\267I\201\240\215\0025\320\202O\326\005g\032\221E\327\253\257$\357|\216\315Y\351\235I\015*\251\372\272|\375\374\262Zx", 64 },
{ ":\234E\033\211\333\024\266\034[\244X\012\237+\343+\361{\177\244,\3540Re\012\337o\365Z\272e\020t\260\244I\353\267\311\005\015t;\023\035j\246G\0349\346Nd\255", 56, "\212\265\352\026e\2642BJ\250\324\003\336\042\247\320?C\302\227\327\037\317}\276\372\2069\363\025uf\373\333SS\2317\241\213b\026\215-\275\003\353\005", 1000, "]\351\274\246#\301@[\363\331j\241\371\037\334\363\323\307\200\227xT9\227\333\326\001\033jU \011\3063\232\276\015\357Z\333-\300\022\0266:\345\241\237\015\012@t{\315\355K\305\342\023\200.\374\277", 64 },
{ "\230\354\247\310*\307w`<^i?\212\264~\317UY\213\013\303\024\357\233\016\207\312\3043\025\341\361\222+\333\375>F\026\330F\330@\220\216\314\350\231\214\253}\266\221\211\260l", 56, "#C\261\327n\205\266O\013\321\006\257\303'|\253\025\341@,hd\311\030 \317\355^\346KO\262\303\202\002j?V]\001\201\327h\020%XV\221u\227}E0\275\344\034", 1000, "\360\364\326R\272l;dB\247@\272\217\237p\337\322iONk\241F\364\225I/+\352\273\202e\306h\2742\244G\341\325\023\217(\033V\220\311\266\200\010\325\373iA\327\334\340^\203\357s\312\314\374", 64 },
{ "\042\362a\336\307\035\016\376\022AR\316\306:g6\025\316\365\267c]l\365\360\312L\234\021\032\353e\211\213@\366\231\3673\013)U\241^\255\370>\035\351\302\3778\020\264+\000", 56, "&D\222\354\376\333t z\037{=\346z9\354\213y\340H\377M\015\354\036W\361\214=\371\201\336\017\2402\244Sg\313N\2702\362&\037\374+\371\015\255\325\263\261\303ML`\374\016\245*\272\347v", 1000, "*\257\371@pwa\351oY\230\231\034<\205\372\023\224\034\345\372\337\021!\316\271*/9\301\307\363\275\320s\230a\315\345\225\343\336\030\306s\361<DYo\222i\255\221\3436\322 ?S\026H\232\376", 64 },
{ "\272b\240]W\237ll\355\244\233Su\240\027B\320\207\230\333Q\330\016:\012\212\232\220\255\325MKD\367\316\217\336\237\347O\307\352\251l\364\241\3603\320E]\254\305\201RB", 56, "2\314\263\253\025\002\232'\207\034\205\224\242f\375\023\201\304\3579\2566\237()K]\032\317/\321\374{D\313\020\214\240\270\234K\245N\2420\345\273\247\256\2761\365\256\323\007\206\214\013D\007\333{'L\310\226\311\222J\263\243\260", 1000, "\037\010>z\004\301\350\365<\014hb\262\210\340\230W\372\215\245N\225\374\242_\371\134+E\240\307\026\032\257Re<4\373\216\272\336|2\332\325\204\276\333\004\2112D\322{fC\025Z\346Z\205\345O", 64 },
{ "V\227\252\273\367\350U\350`\241\303\266\211\362\001\336\202?\340[\265\201'IR/\201`\372\203\010\250\342'?k\326y\322\242\355Qt\373G\331/\207\240]\347\216\032\205n+", 56, "\341\340\034\243\201>\0261", 2000, "\371\025\042&H)`)\277\361\026\201\356\310d\000Rr\232_\365\341\020l\304Ja\225N\253w\003T\023m\362mCz\225\317\301%\017\016m\276\233*\251W&\335G\017sm\266\015\343w3\002>", 64 },
{ "\000\270B\346\340\316\355\311\177\227\314E\361\013[_\241\226m\370\213o\014Zm\375\343n\035\327.)\221}\006\257P\0222\027\364\007\301<i\321'a\224\266\254e7\275:\017", 56, "\032\275\247\042D\011\331z\317?Y\244\207(\363D", 2000, ":\330\255S\227\134\212\322\342\322\306{\320b\332c\276a\354\227\020~(x\347\310h\302\341V\003\033\365\305\360\327\301.\224\267\327R\347\306\203\251\2065\225\364G\000\371\332\241A3yI\315\223\364S\203", 64 },
{ "\335\367Ji:\237\005\331\300\304\012\306\273~\350\273\003\036\213:G\337J\336\207\302\270\204\213\012d\375\220\370\3761\030\273\202\000\202!V\303\246\241\255\027\335\275\022\242(\230:\034", 56, "\253\002Y\336\007,\012\036Q\250nml\274.M\033\134-\214\301-\007\270", 2000, "\346W;x\262`y\011\252\314\241\267\312\254\032>\333\231\201\336\371\010\006\207\244\373\336\001\237s\262\261Tj\030J&\214&\202\220:\2579\346\273f\305\344\362\361|\330\335\261\227\017\3607H#\260:~", 64 },
{ "\0161\342:\237\241\016n\241C\335\323\233\376\240\230^\303\263u\336\344\012\360\306\003%\313\345\275\311\252_\016\252:\374\233\031\330\037\001@\304w\200rE\020\025g\341\270\327\314\350", 56, "\301\2278=\351>po\352?\306\024\230\005\246\345\035S\213\035\343\275y\307\370\3432\264q\376t\366", 2000, "\312\034|dHb\251\354\355\247\345\323\315x\273\234\035:}\376\322Y\376\267\306\202g\010u\324\037Q\206\023\305.\004\251Q\256^Ov\261/\233h\004#e\356\375\2403\355\303\334*l\356aj\222|", 64 },
{ "5\221Z\313\212\034\230J\210\243(\250\274\347$kN\323\213\327m\134n\277\263\313\017:e\353\211\223f?\364\255\252\306a\272\333\241\342\373\200\007\240\260\270\177\226<\022G\347r", 56, "\301\012\025e\324\275\356\211/\024\333\010m\340\215$\313\227\353Er\2542!\356x\343\022H^\244\340iQ\315\310\205\373GP", 2000, "\005L\2216\245Z\244\305\303*1y\216\265Iv\251\357}\252\021\266 \360\357\250\2561<\360\252'\367R'}s\300\222\272\222\362\273\213\211\342\217*\331\202\363y\320\252\024\005+\027\362\204\225\333T\350", 64 },
{ "\357e H\330\351\0252zv\002\251-\312\306\276\001o,\362\311\252#\251\333Y\224\264\350\010QK\305\252\267<\365E\344I\027\320V\015\307\262\3329\372\000\024\014\205\275\233\345", 56, "\346\346E;a\347\331\341\314\242\273<\275-\342<\231\250\306)\017\336\244\360:MN\220\017\231\220\261,\245\310}g$G\222\012\300{\225\364\3515\204", 2000, ":\310E5\210~\277\205\206yLcX3R\005\244\000\301NzZ\320\305DY\370,\357\3507P\255\3762\377\260\230\372$\214\261\230?\322\366M\256Lq\314HtP\300L\335\327\363\2175\256\375\035", 64 },
{ "\007\213\376-\304!\347$\204\002I&\3417\027Y;\243$$ \001\007U4J\216\000\331\274\277\232\212'Ay\275\022q^\200\000\017]\320\030\353h\266u\321\372$+&\025", 56, "\243\006g!5q\241;\2612\306Y\356\231\337.k\003\374<\016\275\210\354+\265\336\224\372\004\371\022\036\214\275?f\207\215jk\262W\241U&\006<@\341\024\015I0\034\025", 2000, "P\3443\025\023\014W\177\273\201\340\036\256\201\006\034\204\354\344\237\315\026\230\345l\014 \274\271\331\011\317#r\327G\327\277\024.,\001\323\250\251\326\025\334N f\2664P\025Cf5\312#\033?C\271", 64 },
{ "q\020\016\307\224Z^B\014_V\3456\313\214\221\342\016\374e\207u\306%K\237\276\263\307q\250\240\302~\316\361\031\204\233\2503\261\200\321P\302I\333\372\305\357e<\017R\246", 56, "\215\246*\011\312\342\002\335~z\276\261\301\255\3702\235\375>\201\246\003s97\301\217\361$]~\357\357bpKD\177\276\330Mw\323I\327\300\241\360\010%\363\021D\377\031P`o\367s\210WiN", 2000, "\367\263X\322\212v\325\010\275\376\215ME\303\356Y\010\203_n-\256\242M\346\203\275\334'dq\207h\351\337N _\215\034\021,R2\245\311c\306r]WS\341Y\253.\235h4)t\334\024i", 64 },
{ "\3623\374\265\252\037\207\364r\177\021\313\267\213\015\3318\010\357\361U\227\224\025=\324\274\353`\315\230\325\232\303\004V@f}~S\344p(Q\312b\353\320\326\271\365y\255\020\262", 56, "\222\356\231\372'#\017\236-\027\216\245Nl\375\225\375\202\340\326,\244\254z\316\221t\222\246\314)\2123\266E.\241\257\262\337\353\300D\007^'\035\253I\366\344\274\025\247\371\373a18/\336\037r\201VG\204\012\222Oo\327", 2000, "\024#\307\016\202=\367\037\325C\340\037\311cRcb\024\335\241\363\221eM\037\377\021\301I\333zO>Z#\225\234\267>\177\223\331\002\266\352`\261\321$>bF\370\203\267;\204\267N\234\341c\306N", 64 },
{ "\240\275Z\322\373\303\225\042$\375\346=\213\374\323s0\245L\216\317 \333\302\032\301\334\036\266tNG*ra\263\216\352\324\323u\362-3\205\275\215\333\012\243\225\344\225\253'C", 56, "\220\021w\353\360\341\226\261", 3000, "\015Y\222H\035\213\232=\031\203\016/s\025\216v\004\0029\010\303\245R\026OES1\004\265\376\027\235b\212\2678%\261\351!\025y\317f\227a\350(q\236\270{~v\015\314\3720)z\260\021q", 64 },
{ "gG}W\3018\377\3466b\377\031\366Z\026\034\331\252\004\307\312\014+\347\211\336\012\365\371%\301\000h\324\372\327\231\254D\272x\231\350\256\224\262\363\330\2503>\3134\007\042\035", 56, "d\243\237!U\333\364}1\256\205\030*d[\337", 3000, "]\371\224\340\342\265\361\332\335j\025z;65\363\3553\360\205\210\311\212\241\375h\321\343\010\216\025_\204\324\244\240\003J\301\034Xa}\252\365\010\232\351k\371\363|\216\360O\360\217:\016\207\214\036\375q", 64 },
{ "}\367\206\346f\344\015=\277\240>\323\225\254\033\221\006\240K\373r\332/\360\254\315\022\355\220n]6\316qtg\373jU\211\037!\215F\301p\017\276\014\002H\301\016\011f\240", 56, "\271\340\234\017\256B\004\215X\303_\374\266l\030\302{\307BX\006Z\304\206", 3000, "\014s\2215%\226\346\340D\357\201B\3052\350\376\267\376Cy*\355,\001}%g\3242\134\012\364\251\263p\033E\275\273\215\257\243\025\013\236\033:^hC\357&\237\371\277U\265!H\242\277UIp", 64 },
{ "\004\001=O\220Z\0158\002\250\257\3670\334\230\320\032\324\353\207\026\005\235q,\224J7\350\002\327\316\134!\3016Cn6W\3303\212d\323]bF\366|\246\015\254\225\031\277", 56, "\245(~\264\367\030+\313\250>.\277')/IC\314O\012Sa\335\212\022\276\216\255 \343\341n", 3000, "\033N+$\021\002\355\346\300`\017\223\346c\340$\347\252hPO\370\352A\263\333\322\333\003\375\361m)y\003a\310\347\250\224zSE\271`\320\264\332\322\275\012\256\001\3303\365\343\2637\360m3\033\215", 64 },
{ "wXw\343\314\327\210\242\014(tHaGv\251\302/\202\002\006\335\343T\0174\134\244!\203E\311e\351O\316\013\371\252\372\336\334!\240\367b){\315\2225\257\374?\261\366", 56, "]U\025\035Q}x\210\277\245\337\232\231\333\370\326R\002\367\301z*0,\206=\275A{\011\317\243F\034&\232BT&\374", 3000, "X\277\340\267#\363\323&\376\305SZ\000gE\345o\254\245P\202{\306\026\263\001\2752\011\237\031\345\1778\202\033\334\003\303R\234Z\370\244\217\352\247\226\0127\134>\267R\236\371\344\361(\332\221\315\371I", 64 },
{ "`l\246Lx\0077\366bz\205m\211\202M\321\010R\2037\231\324\262`\034i4\306\020\372\232\240.P$\346\001[\035\225\324mh\023\343\344F\3255\004\256@Mvy\331", 56, "zMu\372:U\247\274pU\027\342\003e\227\367'\031;\036:\031Pq\265>,n\200\263\322\343\020z5\357\306\326\2322\251\304\262\357\236<\264\233", 3000, "j\233\005\346w\271\237\255\003\303\210G\024\326\336'U\324x\031\014P\241x\376\215UWh,\246\312n3\355\336\347\365\027\204~P\276\234\277\240(\233`<\377\134\235\306\317\322t8\312L)07\322", 64 },
{ "h\207V\216\261y\03652<9\227\226&p\356%W\201P7Q\327\364\247F\011\000A\356\231\263$\305\364I\257[\303 \213\352\024oa\276 \340\252\311\364\305\005FD1", 56, "\335\026^\034r\361H1\305`\226r\300\236\216\325'\321\311r\214X}\234^u\326\246|f\034Q\2267[\303J\374\203\320\255BIy@\373\345\214:]EX\262\0339\253", 3000, "E\036*~\347y6)@\261\301\345]\353\273\240B\016\177_\254\357J_\004\366e#\3220\266\306\343\013k\254\230\202\023y\232\335\257PV\227\211C`\364\244f\361Z\367\324\223\321`\024G\3558F", 64 },
{ "\344u\365\374\030\266/\336\313\036%\372I\235\031=\263S\274\1342X\346\342\034OE\2356\342\320\2411\026\240\361\037\005\026\024\331w\307\017\333\242d\231\243\231/H\242\326%X", 56, "x\372l(*&\215\213\342\307\332\300\230N\016\251\301[(j\007\037\373c\033\225P\255\264\010E%\217\252\344\376s\257\014DZ]J\302\345\212@\364\234\276Z\262>,\336\352*#\352\366\236\351\276\307", 3000, "\203\221Z\042(\206fN:\251B\354\270\033/X\270\247N.\231e\211!\232\244;<I0\325\302\367g#\372c\262\253\014w\205r\203h^\344\221Y\214\177|\350\0002\336\312\311\317\212\241|f\262", 64 },
{ "\002\350!k\207\037\025\225S\030X\367\326e\306\367\215\310\210\007\177A_\235\230L@\240\0255\350\356\215\332\244\005\236\215\300\376\022\207\232HQ\324\331J!\315# |}J\331", 56, "\307v(*\375\230\257b\236\360\343$\250\207\217\353\346\012X\327\372\036\340\036W\006/\322\221d}=c\010Xkb[@\362\352\266\306\342)\221t=q&C\217vC\317\245\3122\301\346O ~N\301XWf\265Z2\362", 3000, "\372\310\353\350\242\014\235c\016\324!N\375\201|~\310\342J.\260#\026\300P\035\347\011\3375\312\222\333\223\340I\227\351j\200\355+\332\223\012\227\353\302\204\265\372\206\337\300\331A{\241\341\307A\010Z\304", 64 },
{ "\370\345\2043\373\003\330\362e\024\333\365\220\301\253u\274\272+\241\346m\256S\214\034&23\274\007\223\013KJ\233\037\374\360\327\376c\326\266\012\042\221!\215\205\257\223\261\247\000I", 56, "\260 \215p\2676n\344", 4000, "v\023x\204\270\222'\026\207b\303MY\214\026\362\2718q`\013L\351$4s9\202\031\357\250\261\227Po\376\374\307C\220\247c\234\233\211q\214ZkA\345\354\0126\257F\302\275\011+\275\361\323?", 64 },
{ " \332\231m\244ZM\200\247\272\252S*\246z\363\203\245\375\312>\346%\016\037H\177\257S\301>f\222\232i\304\324\276\301\340\315\274\215\0334\016\216\335\306\370R\321W\267\220\241", 56, "h,\323\026\342C\263L\032\201\322\314,s\342\275", 4000, "\346\360\263\27733\200,\206\350I\346\223\022\365:{cS\036QA3/K\361\015\321~C\134N\223w+F\227\020\213t\310e8\355\235CJEN\213\036,~0GA\331\301\326t\300a\234@", 64 },
{ "L\200\264\320\356\273-!-n\350\372\134\316\366\352\011\272\313\246}\2614\134.$\212\227b\244\333M\004kU{\372\177\342\221\227\267\301\245\202\375w\032!\352\177\014u(\354\207", 56, "\361\360\352=\212)6\356\022\223U\036\002o\321\301\246\310\341\340\225\201\341\252", 4000, "O\235\310\355\252X\357\363oKwU\363\212YD@\010\370\343KV\251\304.\376K\2662\255\262C\366\246\321\332\0244)C\316\010\023\042\240j\313p\231\217&\331\371\014\015\221\325\243\311ld8\264\274", 64 },
{ "Q\357\325\337/\371\325\311\232\367\304Z\340D!\216\222\222+\027\031\306\265\3344i\371\134\312?6\360\300\213\326\017\2600\316\022\202\266\014\012\000<\243\224\200\325\314\340t,\367g", 56, "d\330\321\026/\236J\314\253\311.\012Qo\025\042\344\240\362\324]\330\230\356\205\307%\00267\042\345", 4000, "n \363\265\2479\017\026\366M\036\375\370+A\024\3402\376\221{MY\243\270\264\265\042\304\134O\3327\016\330%wc\013j\016\226Z\317h$\257\351\260\361AM\013\207\0366X\2763\025\212Y\354\310", 64 },
{ "\372\353S\251N*\232\367m\316PS\270aDC\335\0057\230\276\213\354\347\353K\350\024\215\321\227\300%;\023\377\352'\017Y\177C\017\024\200K\323G\037\307:\224\340^%\341", 56, "\253\254\011\237Q\270,\360\004\332\343\026\314\360\214\227\261}\240\006\300\276\374U\0244e\3052\365\307\250\276\210\263pWU\224\372", 4000, "S\263\011c\272Q\306e\3023j\203>\261\036\274\031U8*}\365\317\253\023\255\030^J\277\331J\340]\367hpR\215\345\316{\042rr\217\236\322tB\317=\215D\274\271\371\357V\2648\236\314K", 64 },
{ "\242\270$R\263\302\200C \233E\245^\326\265B9/6\274\201\002\223\356\263X\350\354\260\002\026]$5b\042:\257\361\004\224\207\030L\277\247\314\331\032\017n\266aP\364z", 56, "\362&\253\330W'\233\343\317%>-\037\363\223=\300(\336\20214D\240a\224R\321M\013O\221h\203\333T,\302\274\261Uz\325\276\313\346\374\033", 4000, "\204\302-S\030\327`\373\222\224v\027\247`\266\267!\216\237\241l\313\264\313}'E]r`iU\302'\037\024\375\023&i\201\305\341|\3779\305\007L\035\230\355f\357\026`\031,\031\364\3145\032r", 64 },
{ "\273\3718\272\222\2369\211\313>\0044q\202B_\272?,:\023\313o 9ps\021m\016sc\034\312\341\202\255u\002Z\013T`!1\030>\245\2315H\177\260RJ\356", 56, "\3327\347\342\334\316\323\037n<\265\305\022\026(U\273U\321\226\303\223F\302u\024\212]\022\344\334\232\264\035E\017\254\322.\334\377\333\232\005\331\367tpQ\036\377\341\305Ng[", 4000, "\326\271\016\214\230]\256\374\2779\365\367\251\315\366\330\373<\312iV\334\202\270|\323\326{\316\301K\330\322\342*/$=\222\211\255p\315\341\306\212\011:=\264\201r`Y\201\2273\0016>C\344?\236", 64 },
{ "7\227m\350\134\343\031f7W\004y\036\335\331Ukv*\021\231\007_8t\346\034\230\310\231\026\201\021\320\254x\200wvx\314;&\230\134\0238\205\246^j\004\240\274.Y", 56, "\201\252\334L\253x\376\302\371\036\331\347?0\006\203\256\023\370\355\360\320\024\312\2233\315\307\254l\325\270<5\010\200>l,\341\305\024\352rF*\250\375\202\341{f\303w'\276\354\347\254W\367SV\243", 4000, "\007\253\010\274\354\376#>\2160\217\243{\006:\323\322\316\042\031\353\272\0423\236\335\0314\376\315\212u\360\037\323c\363i$Kj\242]\377\241\254\004\022Z\304\220\362$4\304\343(\245JI;\032:-", 64 },
{ "MXy\263-\363Z\231\232\325\335\271\357W\351tO\264\344\224L\367\236j\344f\313z\312\221\327\355B\3645\205L\314\242\200\017\034\217L%R|TC\241\3047Cg7i", 56, "\026\030Fd\201\364\332\313\27178\215[\022(P4\342Yv|\365\021$\371\342\367\037\220\015\331:\036\345\320!\004\3219\010\023\205R\307\232g6\031`\277\376E\335\255\035\3158e\020-\220\374([\253@\340\203T\320T\222", 4000, "\027h(\353S4\375u\200\241]h\361\360\032d\321\241\301Y\036W0\342\355\214h\253D\033r\330\266U\373\260\356\3252\301\254|\030\233\371\351\271\024\205\207\301?\206\206n\341\202\266\360\324o\373|\004", 64 },
{ "\3277m\327|\262tWVH\216\335G\001\243%\017\322\014\233\370\351e\006\320q\332\366\031N\021T\353j\237\134\371\206\300u\246\343&\020\272[p\251?\012\312\364:\317\342\021", 56, "\212\214\351\233\011\003)\246", 5000, ">\3518\336\250\245\307\302\214\245BYr\177\036,b!E\347\326U6\343\016\373\000C\325\347\367h\000\346w\310\200\042^\276\270%p\260kv\351@\243\026\204\216&q\034K\336\315\332\276\215\352@G", 64 },
{ "\315\332\254\231\206\366c'\237\317\177\274\326\3667\2059\214\225\255\344\206\372\010;\324[\030_pcwg\211\245g\373]X\3327C\205@6x\352(\322\351@\210e\323\237A", 56, "\327\342Ar\347I\232%-B\371\343=\376*\304", 5000, "\343\315\026K\336]\324\3025\256\241%\210}\360pQkbb\030 SL\037\362\033\223\227c\342\247\004\203\277\334)\212GEoh'\327T\327zM\354.\007[E\035\030@\306\365\344!F\204Q\253", 64 },
{ "\231\366\007m:\350\322^\246Z:\010%^\223Uc>\203\023\307\213HY\322\336{\275\262\033\203\207\336GBWB\263\346\214eR\354\273cA\342V\303\230\336\224\212\354\230\215", 56, "E\334\345\266\361\317'G\003\260Ur\377\207f%\276[Y\336\270\034\025\263", 5000, "Uz\2652\273=\0142y8\270q\025\016\351!\314\341]\224U\004m\377_\376\0246\363\3174c\334\223Fs,VZ\016\014Xt-z\242i\372\3237\034k\360\303\011\262_2\007j\327$\032J", 64 },
{ "\315G(\317@x\334\042\352I\265i\264\330\245\234i\007\357Bs\262u\250\275\330\2619\277\004\337\256~T\351:\376\312cD\2108+r\003?\333,>\316\214V\313\315}\024", 56, "\201F\214g\330\034\200\011\016g%i:\334\340)\213\377f>\355\237\344\350*\314D?\376B\031\342", 5000, "\206k\367\203\251N\301q\007V\375J\326\344U.j3\347I{r)\377-h]\134#\275\305\0064c\330~\042\335\207\360\326\333\235e\023|\242\243\242:3\313OZ\240\237\021\344/\317\3008e\217", 64 },
{ "\222\356l\3701\326\313:\246\207\316k\257\360\365\302 G\011\221!\244W\325\237\225\275\242z*a!\346\001\303\334\224\202P\367\220EF\271]U\265\223\375k\366&\015j?\220", 56, "m52\324\242\260GB\307\210\314=\254=\273\244\271\313;*l\0268\203<\307\315\312\345\324S8\310`u\206#\312CU", 5000, "7\31302\342em\337\264\377\024&i\030x@\331\020\317M\332H\357\243\025\033\215\373V'6C\025\235{\027k\204\234m=#\3557\313\035\313K\3265P\226?q\215\231\004\3079G\2557+\277", 64 },
{ "\226\373\245\177k\214Mg\014\217m\351x@\230\2028\315y\262^)>\376\002\214-\3059T\005b\300\010i5\302v\211-\215\324\222'\375\321\016\035\325\013b\033\242A\305i", 56, "Ap\266 s\336[SZ9\213>d(\362r(\022g\234\230\024\255)\364\373\215\222=\320\271\344=\012`\207E5\321\372\326\006\203G\334\331\334\033", 5000, "\364\006]2x\254\337\245\262\307S\262\342\024n8\306'\316@\024W\021\023\255\275q\337\354\274\373\337\3661%8\035\210X\350\000\030\233\344\330\223\032T\302*b}\264\020\327T\021=\211\274 C\304\030", 64 },
{ "z0G\264\233\315\322w\013\330pI\203e\364\345H\0253QO+\233K\247\030\312)X\015\361&\177\011\362w\227%w\026\006\017\303\210\356|\237c\330\217\341\317\022\203\275\355", 56, "\002N90\334\2248\025\372\377\270e\217\177~\022\236\326\204\204\241\027\372\317\341\267E\321{]\035\010K\350\307O\376\357k(\032\353Ss\331+\003\272\227U\020Q\015\3475\211", 5000, "\036gd\256\314\235\332\200\031Mj\321\212\277s\242\212y\260\274\351R\344\306\271\260\251\225X\304\375O\311tD\323\355\354\335\356\371\242\210\372\214\321D\352\275=#\033\330\002wY\037\351W\317g\241P\266", 64 },
{ "J\315\270(J\265\215\324wO\210\3715\354\340\262\266\275\305\007xC\334a\347\356\011&\3040\220\314d\342IP\364\035\236\200\247\236\213\013\276r\036b\034'\373\253\263\025\270\247", 56, "\357L\364\021\202#\030\377a\303\301\252\345\012\036\322\030\250\334\361L\014EO\253\2407\362[|\360\207)\3719\022\363\023\200\252\036\322\026c\354\351\214\373k\351w\237\237\320\316\247MiI\232L\204\264g", 5000, "\037\300n\247=\220\010\004>\324\254\342o\310\320\305\313u\337\240\023^hu\377\250|\342_\006\017\266\366\353\251\373,\341\332\264-\253\364\265\320\212\021\021\252\035B\252\313\372\214fV\214\2120\202T\224=", 64 },
{ ".\364\006\326rx9x\200|\254\252\003%\344un3\024v?D\274$\201\256\336\272\357\324\032\236\307\335\320\220=\272\134]\2768\256$\211\270\013\311\314,\013\222c\315\362f", 56, "\370\015s\034K{\276\233R\352\313\025\300*7\010e\0249F\020)\232T_G\037W\226\320\215\301\204\247\266!\010\3077\206,\270\371z\037\215\353\204\331\316t\220\323~\257\036\372`(\305U1\177\205-\350~cf\226\370\322", 5000, "~0-!\013\375'\213\234~\210\307c\206\216\016&\2051\003\201\000\317_\2407\223G'F\222\370-A)j\205Iuc\363H\017\316\255\236t\005\244\273\030\3047\024\376$$\030\331\003\224\332\012\347", 64 },
{ "\265i\217\357\251$\334\0375\021h\372pW\343\302\015\004\303\330Kt\260\023\217\327\3469\225A\256\236$\246\004\361 \333\033\262%|\262\310\312\211\321\362{\270\207\020]Q\213\247", 56, "\0379\366\2507\005\313e", 6000, "\202\242\214\005`\305n\003\017\252Z\374\202\256\201R?:4\370\220H\042wiM \337\264G:c^\260%@\361\177\033\342\223\356G\2627\252,\201\341;\035\361\015\360\361U\326\212\207\236\017v\342F", 64 },
{ "8.g=\300]\3713\257:\002\227\211\204\307h\332\007'\304\347\274\271\243|\356pR\203Dg{g\034Y\255\325\031\273\204@\212\224GL\020t\3531\303\231:\042\025\203\371", 56, "c\272\265\314\257\347\241c\3479\007\344\302m\325\240", 6000, "\242\2346\366\377T\302\300\331\244\254~O\336o*\342\215\252\261\252K\031m\356\327\3763\213?\345\020\026\035\234\230\357W\235+\215\026z\274P\256O\2303\203%%2Z\237\220&\027\267\371\203\036\276e", 64 },
{ "\2669\264\317\377=\221E\245\027\210r\351\2560 ~2\263]S\005\224\300\206\3775\217\226\357K\027\362\320\212e\241&3w{[\344{U\221\330\242\240X\015\312\245\346\225\217", 56, "\024\226\020\220P\001}\367\223|\347h\300!\204\314\366Vo\037U6Q\360", 6000, "{\005\313E\205\0010v\224\343\220\036\002\365a\312\337A\226ws\026\003\333\342e\351\015O\234i=\355\204\271\221\306\023\366\256\375\365e\227>\013\022<\227\264\357\310[\224\305\211 \206\366\372\333e\350>", 64 },
{ "\341\373\346\376\351}\267\354v\235\244py\242\263\367\364\240\253\027Y\240\233\346t\334r\331\211\033q\302\330[K\374\257\002h\013\007Q\233\272b\233\205zL\353\210\234h\344$\231", 56, "a<\337v>4\001\017Li!\364_\365%\224b\335\340\255}O\321\243\322\033\266\270\371\027\272\220", 6000, "\230w\354\334c\222L\007\012\314\231>\355+?!\216\005V\3243?\014\267A\3444\240\0165[+\242J-\261\214\323\371\007o\356\240\362\007\216\2034%\225V\347RF\275\341P*\034\036\200\257\351s", 64 },
{ "\005g\321\231 \371\325C}-Q\261\261\263VDt\323\261o\206y\253\235 \272}v\262&Q#\233>*r\335{I\225w\015bt\306\226%f\027\277\350\361\373J\304\277", 56, "jv\354\235Jn\361q<\366\253.1\343\216\323\354K\253\023\2310n\237\352\272t\327hO\211U_\333\375\274\215f\231.", 6000, "(\252\210\221r<A\353\002=\2742\241Y7>\307[{\004V\233\313Ab\022\227F%\2334\231\016 _\307\000`C\012c\303\266\213t\260\203\000N\365\002\372}\217\001\233\226\327K\332\332q_l", 64 },
{ "\232*y&!\3075^\025\241.\2739{\274\351\310\252\236;\307Hj\002\042#\311\360\251\036\200\250\245\306\012V\377%<\134\370\0221\334n\376,\373\006\375\273\327%S\331\211", 56, "\206\223\357_\031\324\205D\332\203\312\005\304^J4\042lk\323\222\215\235n\331\350 T\260{\236\344,\227\256V\316{\273\034C;\026\343L\031\207\341", 6000, "\213q\256\366\276\227\372\017\204\037#\0034M\233\177\347\250\265B\316xv\373\371\326\260z^r\334g3\244k_\321\243z\220\356\304\026Z)\300\377\323F\302\200\026\265Q\220\376=\025,\211Is\302\264", 64 },
{ "u\243\362\207\275\261\325\345e\024R\034\212\007\252\352\324\225\024l1h\361\331_PQ\270\030aR'G\314\312e\2649O\362z\030\303\204w|\352\342\317\313^\377>*\256\263", 56, "\355\254\364\372\037\042?\221\206\351\017\326\231\365\326\035\222\214]w\246\227\016/\370\271\312\312<\266'\367H4^3F\006\034\373\353\001\233K\031\310\036\341\316\373Y\0211\201\314u", 6000, "\252u\356\0018\177ui\252x\250\037\343 1\276b\011\327/o7+\204\372)Dp\361\042\267L\375{\330\006\201@\357\261\017\315\223RD\332]\247}\231\134\022i{D,\232\227\010\364\274\355\315Z", 64 },
{ "\224G\316\306\324\260\011\215\134\312H\020\222'\036.\211{\211c\357.\270J\272u\217\205,\2230G\273\277\214/\026!\227N\212$\211m\313\372\311F9\231\320\210s\372\264\204", 56, "\272\026n\216\027U\033R\203\262\220\250u\214\312\246S?M\204\334>\237M\277\003\035F\317y\022\006\004}\250\233\237i-\233b\011\370C\211\303X\212\003&\265\224L\177\042p\236\3318/\020\271\261?", 6000, "\134`\303\203\364\271\322$|\256\366P\007\202\226\031\220\025\360/\267\324\273\005\356D\015\207~\356\342-\215\212`\004\033R\215\312\273CWY\000\004W\015\320#\245\202\223\327\373\205V9\241\374\034\022\3159", 64 },
{ "\340\363\363\362\356\304o\2367\377V\014\243\003;\373`%\351\020,H\302\260\232{\260\343\327\340\265\0227A\367\313\221\002\205\242\205G\232*\001\276o\305&b\030m\007\351\027@", 56, "\004\207\302\232q\277;i\254\333!w1\033h\0278\304<\022\035\353\034\010\300\267\232\317\012Pb\207\232\342O\217\005\006\217\273\210iPc\325\252/\003\244\224_!\232\315\266{\023\227E(<\261\024JI8r\210\2710\373Z", 6000, "\334\3669t\257\252\235p\023\211U\354\343\2348\367R\003\274b \134>\313Eh\271i\205\265\000I\354\275\230\017'\271\273J\301\274\233\225xm\222\260\003s'\317\364J\373j\034\014x\250\276\276\376\016", 64 },
{ "w\240a\223(u\245\026J\256\255\306\377\243k\225\340\221i\216\216\302\262\025\341\270U\305\372j\371\305\254\374\334\3327\037\260\012\322\342t\007\214 UMsD\134\250ZS\373\016", 56, "\374\012\220Y\213\257\2431", 7000, ":\234\204\235\271=\021\351\317\3118\177\035\330\377\03744\241q\343\275mE<\376\302\361M\255X\356\275]U\202\346\364\010R\220\374\3200r\023#\236\214\370\134\340\026\244\370\204\324V\212]TL#\251", 64 },
{ "5\251\013\363\345(\332(V5\024,\253\357jM%\002fY\334#K4I\234\274s\233\210\217C\334rz+h\036\300t\226\307\207\245\034F*\235\326\330\011\337\226;\006\244", 56, "\207\350\215\302z\042\273.\320\233\020\200\262\021\331;", 7000, "\346\262\214\322\240\221\245s\337\350\3267Ls.\2127Q\272FR\255\366\374\303\025\231\352&\244\220\337\272]\010\037\226g\001\237\235wp\226\205\337v5\263\253\034EU\272\033\234f^]\237\042M\253\321", 64 },
{ "\343i\022\337+\261\334\250\377\356\317\356Mr\345\361%w\312-bn\326\333\244\177p\301\034\363R/o\305\337w\244\357\233\303\372a\314\3338\3169\011\232\006\317\254\010\035\345G", 56, "\374\240\034\270<\0135\004\003\342X\001\361\307C'\202)\033J\377\231\224z", 7000, "\032J\134\325\346\021T-T\311V\221M\261V\015\2547_\276\042\373X/l\322\321Z\255\371\225\271_\211?\206\316\322\300\015\366\011\366\352\277\215\271c\315\306\134\335\201\031]\353I\332&l\315\302\322U", 64 },
{ "\361\230\217,A\213\276\331\303XzY\367o}\366v\031q\3678\303$\216\277,\217CA<\320\234\035\211\004\033H5\271a\257c\017\254\367\351\235\031KvH\304c\241r\307", 56, "\272\240\335\247\215\351!B\254\027cB\021\030\233w\330\227\344\010_L\226\271\357\036G\242\322}\012b", 7000, "\371?.\335\334\200\306\013\030\243\232\271\360\252\345\372\305p13c\314\327\363pv\232-\273\334jp\352Y)u\305\260m\252?M\272p\377\257\012\244J\020|\212\357\232\337\026\234\245Z\350U$\305l", 64 },
{ "\332\245\264\301\004:\003\263\257\003\277\233\207\246\365u\003F3\221;\300{\371\274\012#\242S\017\236[\006\004\327r!\363I\275\365\356\016\215\025\243\341r\201\016\036\207\306kv\021", 56, "H\314\335L'\331N\267[oM\222#x\031S\3512\206K\204$\252B\204\255\363\371s\372\034\257\334\202\003o\211\320\227\005", 7000, "W\004\203\264\313o\310\202\2079\240\353\344\271\2138\034\377\350\002\226\0277#f\224s\226\274G\225\035\214Sda\326\026$k\042u+\272\004(\341\006\343(\365k\315C;gl\331\364ZS\014\022s", 64 },
{ "#\221p\356\360\223\223'\034\026\030\236\253(\267\033HF\324\300\371\367$\013\210\275\022\252l\203\002\232ojEe\240\204\272\24594\313\241\320\221f\216\022\357\004\320p\252\214Q", 56, "\042\224\324R\270g<z?5\270x\202(\320\245\013\341\247,,Y\264\215\316\265W.\367\317`k\373\206O\341\201<\342\227\273\245\205\300\310A\265'", 7000, "\3255.;\376Z\302\003\350\276!\3163\035\014\012\332\241\277g|\316\232X}\247\242\344\3514\356n\335G\243\207\245f\277\015}\261gg\345\010\270\266\310\344k\377\367\337\014\201g\256\314\324\207s\223\202", 64 },
{ "~R\300o\037d@.\235\022,\305^\010C\034\207+\200\227\037\015\2074\017O\026z\251(\330c\205\200!AHDI\0017\011\315\315\342~\233\021X\177\263\347\203\325\272\363", 56, "F\375T\324\220|O\214\203q.v\211\265k\356\342\335}\255\236N\031\311^9\250]\334\255+\342\250Fgw\037\343\177\203pW\002\254!kO\3749\027M\256j\0325\225", 7000, "\252\3305\010\001\336\361\236\030\244\244\322\254\204\270\202\263\134Z\042\235\267\220=1\013\300\310\022\215\204}#\007v\303\203\310\310n\322\030\243\2415O\302\006\314\362\271\222\207m\353_\332\366\300\002\221#\323\267", 64 },
{ "\355S\325\002\033\230\364\010\366\016\351\201\0243\266\235\264f\003\251d>\373r\243\251\005Fl\020G\233='r\255y}\004\246qg\272@pa\253\332[A+\203+\227Q\350", 56, "\367&v\332\237\321\250\311\225\235/W\272S\301\016@\326\302^\213\034\276\235O\324\005ZM~\373\273\274\301k\313W$b\215\307GW\354\023\331\352\256\332\177n\337&\3119,\356\270\042ZJ\016\206\277", 7000, "\215\036n\277\322\242\306\231gd{g\313l\203\014\256\215\335\214\036p\316\327\237\000\000\364)R\222\316\234\030\017\204\344Y*#\230\033\250!Q\275\332'p\343#D4\250.\300\234\271\032\236u\372\3566", 64 },
{ "\304\313M\022(7c\037\226\260\033\216.g\001\242\2649\367\230\314\317b\005t\341\267#\315:\336\312\261\265\220\015A\2417\002\324\021\323$d\214\257SW\351\336\027\323\367\307\333", 56, "\134]4>Dc\364\251\357\246=;\245\301\335H\001=\247\267t\345\374\013>\340|\340\371\3316q\013C+\356\2779\257\366G\206\346\213\201\254\256>\234\241=\362*\242\303L\207e\341RY\035O\013\266=\233\260\347.7K", 7000, "w\217\204\232\275\237\303G.\343`\214\304\241\322\205\340\342\251)]\306\215\021\031q\373\037U{\037\362\355\343\001A)\337,\222\014\221\231\255\203\272$\365\343\233O\231k\2148&\262u\032\204\326&\001\302", 64 },
{ "i\344*\341C\203y\320W\001f'3\024\375o\222%\314\224\225\314}\213\200\217\314s\333\243/h/5\210\340M\241:\240\225|,W\313\260\250*?\210\347;\232\210\270\233", 56, "\355\247{\345\203\211\353\330", 8000, "\013\202O0\212\372\013\263\373\377\240\212%\277)\275*\276\021\341a\351_\313\2053\217\012*\210\334\023\232z]<\017-}\313\002pMJ\370^\261\245s\004\342\316\232\250\015F\332 \253\027\313\210%V", 64 },
{ "\204\312\321\371\353.\037+\256\220Q\266\226\203$a|;\020\262\301\357W\242I\313\201\223\007x2\017\363=\005\212\253\0135\220\002\037\264\0072\251\256)\346\323g\005\255\340\020\241", 56, "\005\233\241\260k\013\253\216fx\234Jq\311%K", 8000, "\277d\331>\026\270R\316\032\001\263`\347\017w[\020\201\020\021hI\007n\353\256j*\303\2069\016\335b\236\376%r\250\200\212\203\004\236{\350\326L\232hvu\234\232\376\134\267h\246\312\304l\326\332", 64 },
{ "\026+7)l@\230\345\361\206\201\314A`\274\231\370\365\300\033 \367\273\324\226.XZ\003\206!U\3673\371\205\042\324\314\331\340D\350*BoD\357\357W\233\036\243\230\006s", 56, "!\272B\012\3167\023\1341\240\341b\270\301\356\333\350|\252J\364\323\204\031", 8000, "\3419L\027\255\212\337\020P\242\036?\037_\306 m\257\243\017\042j\224\036\365[0}>\226\0314\372\236\343\331d\336\3056D\327nP\310\347\024\031\005*U\025X\004x\332x\240\032\003\004Q\250\236", 64 },
{ "\005\327.\210\317\303\217\314\266\376Z\216\271\252V&\314\021\307bb\010\026\315\004\327\370\015\362A\277\317\307\202\014\035\315\2031\303$\341\275\241\3575n(\357\271\355z\312R\233\361", 56, "\206\306%\304F\216\250\010\260\330\263'o\266\221\373\012I7\311\357\261\273\2506~\217l\246X\372\277", 8000, "\365\200\304y\350\342\307J\247\222M\210\251c+\345\006\230\221h\226\247\373L\212\230\375\243G\224\232\021\022j\261\243\255\230\011\201.s`\325\003\032\237\305\247H},Tu\376,(\310\365\177\007\376\001\273", 64 },
{ "\343\204\321&\260i\336\353\031\313\254j\371#\035\010\304\330\004\331\227[\206\357d\177\205\036\371\267\214\376g\254\215\321i\031\312nR\363Iml\363\323\343\320d\260\343q\375\015}", 56, "k\213\314\005\244\252\010\220A\232`*v\276#\376\206\201\344\331\363&\276s\353F|\2328\203\2217\203\020\256\2654\222\024M", 8000, " [Wz\347\360`\373\002\177\270KD\001\337\200\322\351uWf\264\331\005\276}1;\252\325\000\225\233\236\260\3426\024t\221x\226\024\134\313S\375zf\240\221\202\361\010\367\007?\242\240\372\320\003\354\322", 64 },
{ "\273\306\042\266\301\276\015\366\257V?Za\314\002\353\015\227\312\034\250\344`_[A\371\246\276\362t\023i\361(\363@ f\024M>_\007\272.\225\026\271\005T\042\004\021~\345", 56, "\004o^\305\371\003\222\212\020\013/,\263@A\363\345\010I\373\374\244UU\206 \306M\042o3\216\375d\003H2\034\210}U\015P\221yPa\234", 8000, "\274\240\337\035\373\013\333-\251\025n\350<3\352\010\002\331\257K\307\015vW\177\033N]\020J\200\215\226\320M5\317\030\353\0259\302\344\262R]EI\252\301J\266(S\345\351]Z\206bS\011\024\251", 64 },
{ "\303\311}s\360\326\304\311\252\003\356\334\004,T\025x\011\304l\260\357\243QW\014\330\231 F\343\177_2\323\0069\035\003\357\221(!\214\032\3234\016\216]f\374H\254\250}", 56, "\3039\277\272\024\260z\270b\325\027\026j\255\233\221\005c\234\311\217<\030\334\134n\030\314O\263\206\305\370j\025\247\337\347\357\376\216o\243\017\255\007J\037\306\375Q\032\370NA\344", 8000, " \301\0206&\260h\2467\031\331\261 \357\331@\205R<f\312\223\213#!\015tF\221^`*&\247cH\237\2449\303J*z|\306\007\360V}\256\002`$\263\331\025Z\022%(Wt\320\016", 64 },
{ "G8e\021\244L\350ju\373R\2218\240\274\015}\246~\343gIV\177\362\0013\366l\305\216\364\225N(H\311\303\005\001\015,n)\310\024\363X}EH\007\216\232-\246", 56, "\005\366\311\342\271\275\331I]\026\307\036\245-\340\366\213J\254\3375\226\305\246\315\376\343+U\360\236\231\015E\260\256\241\354\371\204y\223\210&(4'\256D],e\213\350\302\026\224\017\235\006\025\277-\316", 8000, "\251\015\235R?\347\252\222}\207\257\225\233\314\3006\330\215\345\331\001\330<\216\263\326xw\225\274\023\216\214\352\270\363\312\276\352A\324Q\010\265\272\033\006L\0016\221\200\340O\006Y\345q2\241*7\256\220", 64 },
{ "S\322s\224\035\253\236\346\253\303\0233\212wR\257\216e\263\353LU=v4X\365p\314\261\274\225|\014\223\022>\267\302\356\247\372T\336\000\322\034H.\276S\217\010\014\1341", 56, "\372\0219I\011a\260\233%\216\365\330Z n\326\235U\347q\022F\336\320\221\342\002\250\357\240{\355\271:\306\200\267\210M\330L?\336\013\364G=\316!:~'\321\361\233\220\2210'\247|GB&?\334M\022\334\211\031Z", 8000, "\373\274\245a\037\033!Dp]\3008qd_\324\230\200\320R\360\243[-\242_\342\365\023\021!\033\346\347\345\232\203\365\007\215r\324XG\274\322\310\214\336\334\211\245\257\355\226\201Z\323\3741\337 \237@", 64 },
{ "\370\221a9\304\262cxsb\235\211j\215\035\007\367\226\360\207XE\335\321y\216.\373X\005\364_-H.\271\037\033\354\276\2456:#\334`\235j\363\342h\227\353\373[\254", 56, "s\321\003c\253\276\2318", 9000, "G\032f_\366\311\216\232\014\241\207J]\022\006kT\322\317Z/%J\346\333Rfv&\025y\201\257\262\327R\236\312\235\317*\212\210\245y\330\244\227\233\014m\344c\356\332\314_V\0037\347\206\012\224", 64 },
{ "\201\277`\274\035\031Q\005\203\236\273\347\220\035\376#\340\367W\371v[[]\337s\207\265\363\035o\317Vp\344-\302o]\365\236u|Q+\313\211\231^\015\275\302\355\025\012\276", 56, "bY\344y\232N\353{\216\223\325V\377k\015\253", 9000, "\017Qz\026\032\317\311\344\330\216\374\250\300*\025\247\003\001\000\245\212\310sh:\030\243\030\222\004$\261\000\345\253,.]\360\337\035\374\242(\322G\177\345\357\274|)oyC\224\303\330\351a\344D\031\203", 64 },
{ "\305V\021]v\311\360M+\335\017\306\216.\271\223#u\270OyKv\223\272\257W\300;\036\022\317\246&\250Vbb\253\2122\225\300\360\266j\203J\251\314g\220\206gh\222", 56, "C\377\366\0061I|\266\311\017.\363B/\353Dr\347\231\237\301\342\323\302", 9000, "?\033~\211\011\320U\277}ye\350\012H\024\340*h\203\015\374\244-\324q4mR\207n\321\3211\213\260\311\023/\215\013\374\311\026\256\304O\200\177\375\272\021\214\227\005X2\355\330\207\276n\244<\271", 64 },
{ "r+^\375\266{\207\022v/\232\354\272P\265P\035;\264\325.m`\017o\334\333\226\344\017\375y\376E\321\002?\134\372\036$!\035\331\341\224A=\272;)\277\374\361\3567", 56, "b\254\231v\245\267\217\012\314\266g\273\016\356\241\326N\370\343\360/(\256;\321\030G\376g\2359\007", 9000, "\023\243\234BS\134|\237\3667\244\015\265\022V\002\022\000\343z9g\230\024\331\367\015\012\253\305Z\204\220\333\255\340\027\273\260we\030\037Yq'\037\000h\361\374\207\363\204\276\210\352\343\237\225v\020rv", 64 },
{ "\027\222\301V4\241\222\007\360uI\254\010\331xKUH7\005y\274)\241#h\340\351\346z\225\325\333/\357\354k5Nh\212O\345\215\3552OT\302M\351q\307k\272\003", 56, "\251\362\353\331h\224\336\274W\373]\345#t+\011\300\316\241%\351\232I\220u\277\037\020W\205- \253=\317\304Qgk\354", 9000, ":\356\247\042\033t\204R\017-\263\025@7\201M6\035\021\002.\031h\002\011@\307\247\033L3\227\311E_\271\232\305\224\020\3421A\000H\355\276\011\321\042Y\333=2\325l\361>\315\323\267\3218^", 64 },
{ "L\244\250\363\025\235\235\255\3260\225\365\243\352\213>\241\320\374\321\361&,\371:5\200<#]\371\042\213\300\266\026\240I\213\320\215\224\340\030$9\212T\212GM\331\004\006\345\252", 56, "xU\307)\357\312eO-\325\035\206\250\257\222x\010K(\375\343\032:\033?\351\200\004\221\322\011\024\270\367\212\001)M\247j\015\240\234\2002Y,\265", 9000, "\034\034%B\001tR\035$c\227\2621\004K\323\375N\200,Y\220@\212\372E\325\353?\343]R'~\364\305\236)\255\255\227\211\244\221\210\345\366\026\357\321\307\372\224\001\347\253\351\207\300\257\3543u\300", 64 },
{ "\312`\215\377\377\310\2070\277u \261;l\210-j\210\314\315\213]\335)D\375\273\345\026R\361\250o#\377\303E\030\373e\226ts]\256\177V\335\234\215\237\241d$\327\222", 56, "\347\305\001\344\333E\371{1/\335\261_\226:>U\241v~\364\216\220!\242\367\340g`M&\2664=Fj+\321f>\220\2262\300~\376\201{\341\002\3340\334\353\307\320", 9000, "\027\247P\003\356C\302\177\266j\361\206\263\033\246\011\300W2n\315\227\346\242\2635\226\233P\236B#\351\027\221a\3401$\211\033\342\225\320\241\202\005\373\272\301\342\177G\335`4\233\345z0\2748\230L", 64 },
{ "\346\322=WAC\245\211P\230\220\321`\342\223\247\231\376\006\341\300\265\266-\335@\201\362GRT\360\214\030\247\134\024r\324\3549\254\330[j*\226\234\223\210\314\024\272!\366C", 56, "Y\212p\006\011X\241\036_B\261\231\267\205P\302\2753\212|\263\307gv\235\314+y\317\217%\243\373\3167\354\213G>\360\212xj\134\362}\306#\260\337\244\177\310\365K\375\036\002\036x\025*\374\367", 9000, "^\235\352\306\347\325!\351L8\006\321\215\263\002\366\322\031\314\224\240 P\2427\010@\325\360\003\231\324\264+\357\2474\372\347(t\042)v/\331%\3149\000$9\326\276\233,5\322\017\134\324\022\205J", 64 },
{ "u4J\310\363\243\365\026\024j\324\372\221U\200\235\246\214\236L\300I\270\240w\274#P%\003\323\213\337t\331S^$6\230\374\005yX\374\231\035\225\025?\330\015\015\313P\271", 56, "\036\017\3424\334d\301\015\373x\265\231\300u\306\301d\332\320\350^\011DI\015\033\372\027\352\004\271H%~^W\275\367.\251\206\240\012s\211\211wkK\231\203.\204\021\364,\207\023Z\225\015c5\036\232\030\217\034\027\021\036\042", 9000, "\316\333\210\302\331v\257J\252\034;\332;\344\350\374\266\332\210?7<\307\227\211\342c\016\010\026\367cS\346\370!\266\257\031\341\337\243y\004(\307\0169\301a\313\216\327_\321\261\017\241\021\276\002\240\020|", 64 },
diff --git a/tests/sys/kqueue/libkqueue/config.h b/tests/sys/kqueue/libkqueue/config.h
index 41a67837efe8..e15fb73e55ef 100644
--- a/tests/sys/kqueue/libkqueue/config.h
+++ b/tests/sys/kqueue/libkqueue/config.h
@@ -1,14 +1,13 @@
-/* $FreeBSD$ */
#define HAVE_ERR_H 1
#define HAVE_SYS_EVENT_H 1
#define HAVE_EV_DISPATCH 1
#define HAVE_EV_RECEIPT 1
#undef HAVE_NOTE_TRUNCATE
#define HAVE_EVFILT_TIMER 1
#define HAVE_EVFILT_USER 1
#define WITH_NATIVE_KQUEUE_BUGS 0
#define PROGRAM "libkqueue-test"
#define VERSION "0.1"
#define TARGET "freebsd"
#define CFLAGS "-g -O0 -Wall -Werror"
diff --git a/tests/sys/mqueue/mqtest1.c b/tests/sys/mqueue/mqtest1.c
index 3accb286ae98..78acde1122ce 100644
--- a/tests/sys/mqueue/mqtest1.c
+++ b/tests/sys/mqueue/mqtest1.c
@@ -1,57 +1,56 @@
-/* $FreeBSD$ */
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <mqueue.h>
#include <signal.h>
#include <stdio.h>
#include "freebsd_test_suite/macros.h"
#define MQNAME "/mytstqueue1"
int
main(void)
{
struct mq_attr attr, attr2;
struct sigevent sigev;
mqd_t mq;
int status;
PLAIN_REQUIRE_KERNEL_MODULE("mqueuefs", 0);
attr.mq_maxmsg = 2;
attr.mq_msgsize = 100;
mq = mq_open(MQNAME, O_CREAT | O_RDWR | O_EXCL, 0666, &attr);
if (mq == (mqd_t)-1)
err(1, "mq_open");
status = mq_unlink(MQNAME);
if (status)
err(1, "mq_unlink");
status = mq_getattr(mq, &attr2);
if (status)
err(1, "mq_getattr");
if (attr.mq_maxmsg != attr2.mq_maxmsg)
err(1, "mq_maxmsg changed");
if (attr.mq_msgsize != attr2.mq_msgsize)
err(1, "mq_msgsize changed");
sigev.sigev_notify = SIGEV_SIGNAL;
sigev.sigev_signo = SIGRTMIN;
status = mq_notify(mq, &sigev);
if (status)
err(1, "mq_notify");
status = mq_notify(mq, &sigev);
if (status == 0)
err(1, "mq_notify 2");
else if (errno != EBUSY)
err(1, "mq_notify 3");
status = mq_notify(mq, NULL);
if (status)
err(1, "mq_notify 4");
status = mq_close(mq);
if (status)
err(1, "mq_close");
return (0);
}
diff --git a/tests/sys/mqueue/mqtest2.c b/tests/sys/mqueue/mqtest2.c
index 067e6190d22f..08d4d9a8003a 100644
--- a/tests/sys/mqueue/mqtest2.c
+++ b/tests/sys/mqueue/mqtest2.c
@@ -1,101 +1,100 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/wait.h>
#include <err.h>
#include <fcntl.h>
#include <mqueue.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "freebsd_test_suite/macros.h"
#define MQNAME "/mytstqueue2"
#define LOOPS 1000
#define PRIO 10
static void
alarmhandler(int sig __unused)
{
write(1, "timeout\n", 8);
_exit(1);
}
int
main(void)
{
struct mq_attr attr;
mqd_t mq;
int status;
pid_t pid;
PLAIN_REQUIRE_KERNEL_MODULE("mqueuefs", 0);
mq_unlink(MQNAME);
attr.mq_maxmsg = 5;
attr.mq_msgsize = 128;
mq = mq_open(MQNAME, O_CREAT | O_RDWR | O_EXCL, 0666, &attr);
if (mq == (mqd_t)-1)
err(1, "mq_open");
status = mq_getattr(mq, &attr);
if (status)
err(1, "mq_getattr");
pid = fork();
if (pid == 0) { /* child */
char *buf;
int j, i;
unsigned int prio;
mq_close(mq);
signal(SIGALRM, alarmhandler);
mq = mq_open(MQNAME, O_RDWR);
if (mq == (mqd_t)-1)
err(1, "child: mq_open");
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
alarm(3);
status = mq_receive(mq, buf, attr.mq_msgsize, &prio);
if (status == -1)
err(2, "child: mq_receive");
for (i = 0; i < attr.mq_msgsize; ++i)
if (buf[i] != i)
err(3, "child: message data corrupted");
if (prio != PRIO)
err(4, "child: priority is incorrect: %d",
prio);
}
alarm(0);
free(buf);
mq_close(mq);
return (0);
} else if (pid == -1) {
err(1, "fork()");
} else {
char *buf;
int i, j;
signal(SIGALRM, alarmhandler);
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
for (i = 0; i < attr.mq_msgsize; ++i)
buf[i] = i;
alarm(3);
status = mq_send(mq, buf, attr.mq_msgsize, PRIO);
if (status)
err(1, "mq_send");
}
alarm(3);
wait(&status);
alarm(0);
}
status = mq_close(mq);
if (status)
err(1, "mq_close");
mq_unlink(MQNAME);
return (0);
}
diff --git a/tests/sys/mqueue/mqtest3.c b/tests/sys/mqueue/mqtest3.c
index 3e20c4d458d1..65b8f4fcc2b9 100644
--- a/tests/sys/mqueue/mqtest3.c
+++ b/tests/sys/mqueue/mqtest3.c
@@ -1,118 +1,117 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/select.h>
#include <sys/wait.h>
#include <err.h>
#include <fcntl.h>
#include <mqueue.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "freebsd_test_suite/macros.h"
#define MQNAME "/mytstqueue3"
#define LOOPS 1000
#define PRIO 10
static void
sighandler(int sig __unused)
{
write(1, "timeout\n", 8);
_exit(1);
}
int
main(void)
{
fd_set set;
struct mq_attr attr;
int status;
mqd_t mq;
pid_t pid;
PLAIN_REQUIRE_KERNEL_MODULE("mqueuefs", 0);
mq_unlink(MQNAME);
attr.mq_maxmsg = 5;
attr.mq_msgsize = 128;
mq = mq_open(MQNAME, O_CREAT | O_RDWR | O_EXCL, 0666, &attr);
if (mq == (mqd_t)-1)
err(1, "mq_open()");
status = mq_getattr(mq, &attr);
if (status)
err(1, "mq_getattr()");
pid = fork();
if (pid == 0) { /* child */
char *buf;
int j, i;
unsigned int prio;
mq_close(mq);
signal(SIGALRM, sighandler);
mq = mq_open(MQNAME, O_RDWR);
if (mq == (mqd_t)-1)
err(1, "child process: mq_open");
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
FD_ZERO(&set);
FD_SET(mq_getfd_np(mq), &set);
alarm(3);
status = select(mq_getfd_np(mq) + 1, &set, NULL,
NULL, NULL);
if (status != 1)
err(1, "child process: select()");
status = mq_receive(mq, buf, attr.mq_msgsize, &prio);
if (status == -1)
err(2, "child process: mq_receive");
for (i = 0; i < attr.mq_msgsize; ++i)
if (buf[i] != i)
err(3, "message data corrupted");
if (prio != PRIO)
err(4, "priority is incorrect: %d", prio);
}
alarm(0);
free(buf);
mq_close(mq);
return (0);
} else if (pid == -1) {
err(1, "fork()");
} else {
char *buf;
int i, j;
signal(SIGALRM, sighandler);
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
for (i = 0; i < attr.mq_msgsize; ++i) {
buf[i] = i;
}
alarm(3);
FD_ZERO(&set);
FD_SET(mq_getfd_np(mq), &set);
status = select(mq_getfd_np(mq) + 1, NULL, &set,
NULL, NULL);
if (status != 1)
err(1, "select()");
status = mq_send(mq, buf, attr.mq_msgsize, PRIO);
if (status) {
kill(pid, SIGKILL);
err(2, "mq_send()");
}
}
alarm(3);
wait(&status);
alarm(0);
}
status = mq_close(mq);
if (status)
err(1, "mq_close");
mq_unlink(MQNAME);
return (0);
}
diff --git a/tests/sys/mqueue/mqtest4.c b/tests/sys/mqueue/mqtest4.c
index b0b395298ef8..99841c670b5c 100644
--- a/tests/sys/mqueue/mqtest4.c
+++ b/tests/sys/mqueue/mqtest4.c
@@ -1,120 +1,119 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/event.h>
#include <sys/select.h>
#include <sys/wait.h>
#include <err.h>
#include <fcntl.h>
#include <mqueue.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "freebsd_test_suite/macros.h"
#define MQNAME "/mytstqueue4"
#define LOOPS 1000
#define PRIO 10
static void
sighandler(int sig __unused)
{
write(1, "timeout\n", 8);
_exit(1);
}
int
main(void)
{
struct kevent kev;
struct mq_attr attr;
mqd_t mq;
int kq, status;
pid_t pid;
PLAIN_REQUIRE_KERNEL_MODULE("mqueuefs", 0);
mq_unlink(MQNAME);
attr.mq_maxmsg = 5;
attr.mq_msgsize = 128;
mq = mq_open(MQNAME, O_CREAT | O_RDWR | O_EXCL, 0666, &attr);
if (mq == (mqd_t) -1)
err(1, "mq_open()");
status = mq_getattr(mq, &attr);
if (status)
err(1, "mq_getattr()");
pid = fork();
if (pid == 0) { /* child */
char *buf;
int j, i;
unsigned int prio;
mq_close(mq);
kq = kqueue();
mq = mq_open(MQNAME, O_RDWR);
if (mq == (mqd_t)-1)
err(1, "child: mq_open");
EV_SET(&kev, mq_getfd_np(mq), EVFILT_READ, EV_ADD, 0, 0, 0);
status = kevent(kq, &kev, 1, NULL, 0, NULL);
if (status == -1)
err(1, "child: kevent");
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
alarm(3);
status = kevent(kq, NULL, 0, &kev, 1, NULL);
if (status != 1)
err(1, "child: kevent 2");
status = mq_receive(mq, buf, attr.mq_msgsize, &prio);
if (status == -1)
err(2, "child: mq_receive");
for (i = 0; i < attr.mq_msgsize; ++i)
if (buf[i] != i)
err(3, "child: message data corrupted");
if (prio != PRIO)
err(4, "child: priority is incorrect: %d",
prio);
}
alarm(0);
free(buf);
mq_close(mq);
return (0);
} else if (pid == -1) {
err(1, "fork()");
} else {
char *buf;
int i, j;
signal(SIGALRM, sighandler);
kq = kqueue();
EV_SET(&kev, mq_getfd_np(mq), EVFILT_WRITE, EV_ADD, 0, 0, 0);
status = kevent(kq, &kev, 1, NULL, 0, NULL);
if (status == -1)
err(1, "kevent");
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
for (i = 0; i < attr.mq_msgsize; ++i) {
buf[i] = i;
}
alarm(3);
status = kevent(kq, NULL, 0, &kev, 1, NULL);
if (status != 1)
err(1, "child: kevent 2");
status = mq_send(mq, buf, attr.mq_msgsize, PRIO);
if (status) {
err(2, "mq_send()");
}
}
free(buf);
alarm(3);
wait(&status);
alarm(0);
}
status = mq_close(mq);
if (status)
err(1, "mq_close");
mq_unlink(MQNAME);
return (0);
}
diff --git a/tests/sys/mqueue/mqtest5.c b/tests/sys/mqueue/mqtest5.c
index 0c8aa895ead2..f48ef1121289 100644
--- a/tests/sys/mqueue/mqtest5.c
+++ b/tests/sys/mqueue/mqtest5.c
@@ -1,128 +1,127 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/event.h>
#include <sys/select.h>
#include <sys/wait.h>
#include <err.h>
#include <fcntl.h>
#include <mqueue.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "freebsd_test_suite/macros.h"
#define MQNAME "/mytstqueue5"
#define LOOPS 1000
#define PRIO 10
static void
sighandler(int sig __unused)
{
write(1, "timeout\n", 8);
_exit(1);
}
int
main(void)
{
int status;
struct mq_attr attr;
struct sigaction sa;
sigset_t set;
siginfo_t info;
mqd_t mq;
pid_t pid;
PLAIN_REQUIRE_KERNEL_MODULE("mqueuefs", 0);
mq_unlink(MQNAME);
sigemptyset(&set);
sigaddset(&set, SIGRTMIN);
sigprocmask(SIG_BLOCK, &set, NULL);
sigemptyset(&sa.sa_mask);
sa.sa_flags = SA_SIGINFO;
sa.sa_sigaction = (void *) SIG_DFL;
sigaction(SIGRTMIN, &sa, NULL);
attr.mq_maxmsg = 5;
attr.mq_msgsize = 128;
mq = mq_open(MQNAME, O_CREAT | O_RDWR | O_EXCL, 0666, &attr);
if (mq == (mqd_t)-1)
err(1, "mq_open()");
status = mq_getattr(mq, &attr);
if (status)
err(1, "mq_getattr()");
pid = fork();
if (pid == 0) { /* child */
int prio, j, i;
char *buf;
struct sigevent sigev;
signal(SIGALRM, sighandler);
sigev.sigev_notify = SIGEV_SIGNAL;
sigev.sigev_signo = SIGRTMIN;
sigev.sigev_value.sival_int = 2;
mq_close(mq);
mq = mq_open(MQNAME, O_RDWR | O_NONBLOCK);
if (mq == (mqd_t)-1)
err(1, "child: mq_open");
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
alarm(3);
status = mq_notify(mq, &sigev);
if (status)
err(1, "child: mq_notify");
status = sigwaitinfo(&set, &info);
if (status == -1)
err(1, "child: sigwaitinfo");
if (info.si_value.sival_int != 2)
err(1, "child: sival_int");
status = mq_receive(mq, buf, attr.mq_msgsize, &prio);
if (status == -1)
err(2, "child: mq_receive");
for (i = 0; i < attr.mq_msgsize; ++i)
if (buf[i] != i)
err(3, "child: message data corrupted");
if (prio != PRIO)
err(4, "child: priority is incorrect: %d",
prio);
}
alarm(0);
free(buf);
mq_close(mq);
return (0);
} else if (pid == -1) {
err(1, "fork()");
} else {
char *buf;
int i, j;
signal(SIGALRM, sighandler);
buf = malloc(attr.mq_msgsize);
for (j = 0; j < LOOPS; ++j) {
for (i = 0; i < attr.mq_msgsize; ++i) {
buf[i] = i;
}
alarm(3);
status = mq_send(mq, buf, attr.mq_msgsize, PRIO);
if (status) {
kill(pid, SIGKILL);
err(2, "mq_send()");
}
}
alarm(3);
wait(&status);
alarm(0);
}
status = mq_close(mq);
if (status)
err(1, "mq_close");
mq_unlink(MQNAME);
return (0);
}
diff --git a/tests/sys/pjdfstest/config.h b/tests/sys/pjdfstest/config.h
index 450581c4b7e0..76dd4028fcaf 100644
--- a/tests/sys/pjdfstest/config.h
+++ b/tests/sys/pjdfstest/config.h
@@ -1,206 +1,205 @@
-/* $FreeBSD$ */
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.ac by autoheader. */
/* Define to 1 if NFSv4 ACL support is available */
#define HAS_NFSV4_ACL_SUPPORT 1
/* Define to 1 if you have the `acl_create_entry_np' function. */
#define HAVE_ACL_CREATE_ENTRY_NP 1
/* Define to 1 if you have the `acl_from_text' function. */
#define HAVE_ACL_FROM_TEXT 1
/* Define to 1 if you have the `acl_get_entry' function. */
#define HAVE_ACL_GET_ENTRY 1
/* Define to 1 if you have the `acl_get_file' function. */
#define HAVE_ACL_GET_FILE 1
/* Define to 1 if you have the `acl_set_file' function. */
#define HAVE_ACL_SET_FILE 1
/* Define if bindat exists */
#define HAVE_BINDAT 1
/* Define if chflags exists */
#define HAVE_CHFLAGS 1
/* Define if chflagsat exists */
#define HAVE_CHFLAGSAT 1
/* Define if connectat exists */
#define HAVE_CONNECTAT 1
/* Define if faccessat exists */
#define HAVE_FACCESSAT 1
/* Define if fchflags exists */
#define HAVE_FCHFLAGS 1
/* Define if fchmodat exists */
#define HAVE_FCHMODAT 1
/* Define if fchownat exists */
#define HAVE_FCHOWNAT 1
/* Define if fstatat exists */
#define HAVE_FSTATAT 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define if lchflags exists */
#define HAVE_LCHFLAGS 1
/* Define if lchmod exists */
#define HAVE_LCHMOD 1
/* Define if linkat exists */
#define HAVE_LINKAT 1
/* Define if lpathconf exists */
#define HAVE_LPATHCONF 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define if mkdirat exists */
#define HAVE_MKDIRAT 1
/* Define if mkfifoat exists */
#define HAVE_MKFIFOAT 1
/* Define if mknodat exists */
#define HAVE_MKNODAT 1
/* Define if openat exists */
#define HAVE_OPENAT 1
/* Define if posix_fallocate exists */
#define HAVE_POSIX_FALLOCATE 1
/* Define if readlinkat exists */
#define HAVE_READLINKAT 1
/* Define if renameat exists */
#define HAVE_RENAMEAT 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if `st_atim' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_ATIM 1
/* Define to 1 if `st_atimespec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_ATIMESPEC 1
/* Define to 1 if `st_birthtim' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_BIRTHTIM 1
/* Define to 1 if `st_birthtime' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_BIRTHTIME 1
/* Define to 1 if `st_birthtimespec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC 1
/* Define to 1 if `st_ctim' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_CTIM 1
/* Define to 1 if `st_ctimespec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_CTIMESPEC 1
/* Define to 1 if `st_mtim' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_MTIM 1
/* Define to 1 if `st_mtimespec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_MTIMESPEC 1
/* Define if symlinkat exists */
#define HAVE_SYMLINKAT 1
/* Define to 1 if sys/acl.h is available */
#define HAVE_SYS_ACL_H 1
/* Define to 1 if you have the <sys/mkdev.h> header file. */
/* #undef HAVE_SYS_MKDEV_H */
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define if utimensat exists */
#define HAVE_UTIMENSAT 1
/* Name of package */
#define PACKAGE "pjdfstest"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT ""
/* Define to the full name of this package. */
#define PACKAGE_NAME "pjdfstest"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "pjdfstest 0.1"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "pjdfstest"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "0.1"
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Enable extensions on AIX 3, Interix. */
#ifndef _ALL_SOURCE
# define _ALL_SOURCE 1
#endif
/* Enable GNU extensions on systems that have them. */
#ifndef _GNU_SOURCE
# define _GNU_SOURCE 1
#endif
/* Enable threading extensions on Solaris. */
#ifndef _POSIX_PTHREAD_SEMANTICS
# define _POSIX_PTHREAD_SEMANTICS 1
#endif
/* Enable extensions on HP NonStop. */
#ifndef _TANDEM_SOURCE
# define _TANDEM_SOURCE 1
#endif
/* Enable general extensions on Solaris. */
#ifndef __EXTENSIONS__
# define __EXTENSIONS__ 1
#endif
/* Version number of package */
#define VERSION "0.1"
/* Define to 1 if on MINIX. */
/* #undef _MINIX */
/* Define to 2 if the system does not provide POSIX.1 features except with
this defined. */
/* #undef _POSIX_1_SOURCE */
/* Define to 1 if you need to in order for `stat' and other things to work. */
/* #undef _POSIX_SOURCE */
diff --git a/tools/diag/dumpvfscache/dumpvfscache.c b/tools/diag/dumpvfscache/dumpvfscache.c
index 3f5eb5793a8a..44c2021a5a42 100644
--- a/tools/diag/dumpvfscache/dumpvfscache.c
+++ b/tools/diag/dumpvfscache/dumpvfscache.c
@@ -1,137 +1,136 @@
-/* $FreeBSD$ */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fcntl.h>
#include <kvm.h>
#include <nlist.h>
#include <sysexits.h>
#include <sys/uio.h>
#include <sys/namei.h>
#include <sys/param.h>
#include <sys/queue.h>
#include <sys/time.h>
#include <sys/vnode.h>
/*----------------------------------*/
static u_int crc16_table[16] = {
0x0000, 0xCC01, 0xD801, 0x1400,
0xF001, 0x3C00, 0x2800, 0xE401,
0xA001, 0x6C00, 0x7800, 0xB401,
0x5000, 0x9C01, 0x8801, 0x4400
};
/* XXX Taken from sys/kern/vfs_cache.c */
struct namecache {
LIST_ENTRY(namecache) nc_hash;
LIST_ENTRY(namecache) nc_src;
TAILQ_ENTRY(namecache) nc_dst;
struct vnode *nc_dvp;
struct vnode *nc_vp;
u_char nc_flag;
u_char nc_nlen;
char nc_name[0];
};
static u_short
wlpsacrc(u_char *buf, u_int len)
{
u_short crc = 0;
int i, r1;
for (i = 0; i < len; i++, buf++) {
/* lower 4 bits */
r1 = crc16_table[crc & 0xF];
crc = (crc >> 4) & 0x0FFF;
crc = crc ^ r1 ^ crc16_table[*buf & 0xF];
/* upper 4 bits */
r1 = crc16_table[crc & 0xF];
crc = (crc >> 4) & 0x0FFF;
crc = crc ^ r1 ^ crc16_table[(*buf >> 4) & 0xF];
}
return(crc);
}
/*----------------------------------*/
struct nlist nl[] = {
{ "_nchash", 0},
{ "_nchashtbl", 0},
{ 0, 0 },
};
int histo[2047];
int histn[2047];
int *newbucket;
int
main(int argc, char **argv)
{
int nchash, i, j, k, kn;
int nb, p1, p2;
u_long p;
LIST_HEAD(nchashhead, namecache) *nchashtbl;
struct namecache *nc;
struct vnode vn;
kvm_t *kvm = kvm_open(NULL, NULL, NULL, O_RDONLY, argv[0]);
if (kvm == NULL)
return(EX_OSERR);
printf("kvm: %p\n", kvm);
printf("kvm_nlist: %d\n", kvm_nlist(kvm, nl));
kvm_read(kvm, nl[0].n_value, &nchash, sizeof nchash);
nchash++;
nchashtbl = malloc(nchash * sizeof *nchashtbl);
nc = malloc(sizeof *nc + NAME_MAX);
newbucket = malloc(nchash * sizeof (int));
memset(newbucket, 0, nchash * sizeof (int));
kvm_read(kvm, nl[1].n_value, &p, sizeof p);
kvm_read(kvm, p, nchashtbl, nchash * sizeof *nchashtbl);
for (i=0; i < nchash; i++) {
#if 0
printf("%d\n", i);
#endif
nb=0;
p = (u_long)LIST_FIRST(nchashtbl+i);
while (p) {
nb++;
kvm_read(kvm, p, nc, sizeof *nc + NAME_MAX);
kvm_read(kvm, (u_long)nc->nc_dvp, &vn, sizeof vn);
nc->nc_name[nc->nc_nlen] = '\0';
for (j=k=kn=0;nc->nc_name[j];j++) {
k+= nc->nc_name[j];
kn <<= 1;
kn+= nc->nc_name[j];
}
/*
kn = k;
*/
kn = wlpsacrc(nc->nc_name,nc->nc_nlen);
/* kn += (u_long)vn.v_data >> 8; */
/* kn += (u_long)nc->nc_dvp >> 7; */
kn += vn.v_id;
kn &= (nchash - 1);
newbucket[kn]++;
#if 1
printf("%4d dvp %08x hash %08x vp %08x id %08x name <%s>\n",
i,nc->nc_dvp, k, nc->nc_vp, vn.v_id, nc->nc_name);
#endif
p = (u_long)LIST_NEXT(nc, nc_hash);
}
histo[nb]++;
}
for (i=0; i < nchash; i++) {
histn[newbucket[i]]++;
}
p1=p2 = 0;
for (i=0;i<30;i++) {
p1 += histo[i] * i;
p2 += histn[i] * i;
if (histo[i] || histn[i])
printf("H%02d %4d %4d / %4d %4d\n",i,histo[i], p1 , histn[i], p2);
}
return (0);
}
diff --git a/tools/kerneldoc/subsys/notreviewed.dox b/tools/kerneldoc/subsys/notreviewed.dox
index bcc4bed1f61a..29a868e27c1f 100644
--- a/tools/kerneldoc/subsys/notreviewed.dox
+++ b/tools/kerneldoc/subsys/notreviewed.dox
@@ -1,14 +1,13 @@
-/* $FreeBSD$ */
/** @mainpage
* <b>IMPORTANT:</b> This API documentation may contain both functions which
* are public and functions that are for internal use only. Since we have not
* reviewed every part of the documentation yet, <i>some internal functions
* are not marked as such</i>. Until we finish reviewing the API documentation
* and add appropriate comments to functions which are only for internal use,
* you should take this into account. In case you want to use a function of
* this kernel subsystem in another kernel subsystem you should search for
* precedence of use outside this subsystem. If the function is not used
* outside this subsystem you should ask on the mailinglists about it, else
* you risk breaking something.
*/
diff --git a/tools/regression/ccd/layout/a.c b/tools/regression/ccd/layout/a.c
index 33eea10f2a3c..0feb1f28c093 100644
--- a/tools/regression/ccd/layout/a.c
+++ b/tools/regression/ccd/layout/a.c
@@ -1,16 +1,15 @@
-/* $FreeBSD$ */
#include <unistd.h>
static uint32_t buf[512/4];
main()
{
u_int u = 0;
while (1) {
buf[0] = u++;
if (512 != write(1, buf, sizeof buf))
break;
}
exit (0);
}
diff --git a/tools/regression/ccd/layout/b.c b/tools/regression/ccd/layout/b.c
index 5b4ae8ed6a9e..eea078db37d2 100644
--- a/tools/regression/ccd/layout/b.c
+++ b/tools/regression/ccd/layout/b.c
@@ -1,19 +1,18 @@
-/* $FreeBSD$ */
#include <unistd.h>
#include <fcntl.h>
static uint32_t buf[512/4];
main()
{
u_int u = 0;
while (1) {
if (512 != read(0, buf, sizeof buf))
break;
printf("%u %u\n", u++, buf[0]);
}
exit (0);
}
diff --git a/tools/regression/p1003_1b/main.c b/tools/regression/p1003_1b/main.c
index 5cf3183955f8..7333b64bd455 100644
--- a/tools/regression/p1003_1b/main.c
+++ b/tools/regression/p1003_1b/main.c
@@ -1,80 +1,79 @@
-/* $FreeBSD$ */
#include <sys/param.h>
#include <stdio.h>
#include <string.h>
int fifo(int argc, char *argv[]);
int memlock(int argc, char *argv[]);
int p26(int argc, char *argv[]);
int sched(int argc, char *argv[]);
int yield(int argc, char *argv[]);
static struct {
const char *t;
int (*f)(int, char *[]);
int works;
} tab[] = {
{ "fifo", fifo, 1 },
{ "memlock", memlock, 0 },
{ "p26", p26, 1 },
{ "sched", sched, 1 },
{ "yield", yield, 1 },
};
static int usage(int argc, char *argv[])
{
int i;
if (argc > 1)
fprintf(stderr, "%s is unknown\n", argv[1]);
fprintf(stderr, "usage: %s [-a] or one of [", argv[0]);
for (i = 0; i < (sizeof(tab) / sizeof(tab[0])); i++)
fprintf(stderr, "%s%s", (i)? " | " : "", tab[i].t);
fprintf(stderr, "]\n");
return -1;
}
int main(int argc, char *argv[])
{
int i;
if (argc == 2 && strcmp(argv[1], "-a") == 0) {
#if 1
fprintf(stderr,
"-a should but doesn't really work"
" (my notes say \"because things detach\");\n"
"meanwhile do these individual tests and look"
" for a non-zero exit code:\n");
for (i = 0; i < nitems(tab); i++)
if (tab[i].works)
fprintf(stderr, "p1003_1b %s\n", tab[i].t);
return -1;
#else
{
int r;
for (i = 0; i < nitems(tab); i++) {
if (tab[i].works) {
if ( (r =
(*tab[i].f)(argc - 1, argv + 1)) ) {
fprintf(stderr,
"%s failed\n", tab[i].t);
return r;
}
}
}
return 0;
}
#endif
}
if (argc > 1) {
for (i = 0; i < nitems(tab); i++)
if (strcmp(tab[i].t, argv[1]) == 0)
return (*tab[i].f)(argc - 1, argv + 1);
}
return usage(argc, argv);
}
diff --git a/tools/regression/poll/pipepoll.c b/tools/regression/poll/pipepoll.c
index 5ca064bf6bf3..9fcf450adeba 100644
--- a/tools/regression/poll/pipepoll.c
+++ b/tools/regression/poll/pipepoll.c
@@ -1,321 +1,320 @@
-/* $FreeBSD$ */
#include <sys/poll.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <err.h>
#include <fcntl.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define FIFONAME "fifo.tmp"
#define FT_END 3
#define FT_FIFO 2
#define FT_PIPE 0
#define FT_SOCKETPAIR 1
static int filetype;
static const char *
decode_events(int events)
{
char *ncresult;
const char *result;
switch (events) {
case POLLIN:
result = "POLLIN";
break;
case POLLHUP:
result = "POLLHUP";
break;
case POLLIN | POLLHUP:
result = "POLLIN | POLLHUP";
break;
default:
asprintf(&ncresult, "%#x", events);
result = ncresult;
break;
}
return (result);
}
static void
report_state(const char *state)
{
printf(" %s state %s: ",
filetype == FT_PIPE ? "Pipe" :
filetype == FT_SOCKETPAIR ? "Sock" : "FIFO",
state);
}
static void
report(int num, const char *state, int expected, int got, int res,
int res_expected)
{
if (res != res_expected) {
printf("not ok %-2d", num);
report_state(state);
printf("poll result %d expected %d. ",
res, res_expected);
} else {
if (expected == got)
printf("ok %-2d ", num);
else
printf("not ok %-2d", num);
report_state(state);
}
printf("expected %s; got %s\n", decode_events(expected),
decode_events(got));
fflush(stdout);
}
static pid_t cpid;
static pid_t ppid;
static volatile sig_atomic_t state;
static void
catch(int sig __unused)
{
state++;
}
static void
child(int fd, int num)
{
struct pollfd pfd;
int fd2, res;
char buf[256];
if (filetype == FT_FIFO) {
fd = open(FIFONAME, O_RDONLY | O_NONBLOCK);
if (fd < 0)
err(1, "open for read");
}
pfd.fd = fd;
pfd.events = POLLIN;
if (filetype == FT_FIFO) {
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "0", 0, pfd.revents, res, 0);
}
kill(ppid, SIGUSR1);
usleep(1);
while (state != 1)
;
if (filetype != FT_FIFO) {
/*
* The connection cannot be reestablished. Use the code that
* delays the read until after the writer disconnects since
* that case is more interesting.
*/
state = 4;
goto state4;
}
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "1", 0, pfd.revents, res, 0);
kill(ppid, SIGUSR1);
usleep(1);
while (state != 2)
;
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "2", POLLIN, pfd.revents, res, 1);
if (read(fd, buf, sizeof buf) != 1)
err(1, "read");
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "2a", 0, pfd.revents, res, 0);
kill(ppid, SIGUSR1);
usleep(1);
while (state != 3)
;
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "3", POLLHUP, pfd.revents, res, 1);
kill(ppid, SIGUSR1);
/*
* Now we expect a new writer, and a new connection too since
* we read all the data. The only new point is that we didn't
* start quite from scratch since the read fd is not new. Check
* startup state as above, but don't do the read as above.
*/
usleep(1);
while (state != 4)
;
state4:
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "4", 0, pfd.revents, res, 0);
kill(ppid, SIGUSR1);
usleep(1);
while (state != 5)
;
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "5", POLLIN, pfd.revents, res, 1);
kill(ppid, SIGUSR1);
usleep(1);
while (state != 6)
;
/*
* Now we have no writer, but should still have data from the old
* writer. Check that we have both a data-readable condition and a
* hangup condition, and that the data can be read in the usual way.
* Since Linux does this, programs must not quit reading when they
* see POLLHUP; they must see POLLHUP without POLLIN (or another
* input condition) before they decide that there is EOF. gdb-6.1.1
* is an example of a broken program that quits on POLLHUP only --
* see its event-loop.c.
*/
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "6", POLLIN | POLLHUP, pfd.revents, res, 1);
if (read(fd, buf, sizeof buf) != 1)
err(1, "read");
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "6a", POLLHUP, pfd.revents, res, 1);
if (filetype == FT_FIFO) {
/*
* Check that POLLHUP is sticky for a new reader and for
* the old reader.
*/
fd2 = open(FIFONAME, O_RDONLY | O_NONBLOCK);
if (fd2 < 0)
err(1, "open for read");
pfd.fd = fd2;
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "6b", POLLHUP, pfd.revents, res, 1);
pfd.fd = fd;
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "6c", POLLHUP, pfd.revents, res, 1);
close(fd2);
if ((res = poll(&pfd, 1, 0)) < 0)
err(1, "poll");
report(num++, "6d", POLLHUP, pfd.revents, res, 1);
}
close(fd);
kill(ppid, SIGUSR1);
exit(0);
}
static void
parent(int fd)
{
usleep(1);
while (state != 1)
;
if (filetype == FT_FIFO) {
fd = open(FIFONAME, O_WRONLY | O_NONBLOCK);
if (fd < 0)
err(1, "open for write");
}
kill(cpid, SIGUSR1);
usleep(1);
while (state != 2)
;
if (write(fd, "", 1) != 1)
err(1, "write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 3)
;
if (close(fd) != 0)
err(1, "close for write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 4)
;
if (filetype != FT_FIFO)
return;
fd = open(FIFONAME, O_WRONLY | O_NONBLOCK);
if (fd < 0)
err(1, "open for write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 5)
;
if (write(fd, "", 1) != 1)
err(1, "write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 6)
;
if (close(fd) != 0)
err(1, "close for write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 7)
;
}
int
main(void)
{
int fd[2], num;
num = 1;
printf("1..20\n");
fflush(stdout);
signal(SIGUSR1, catch);
ppid = getpid();
for (filetype = 0; filetype < FT_END; filetype++) {
switch (filetype) {
case FT_FIFO:
if (mkfifo(FIFONAME, 0666) != 0)
err(1, "mkfifo");
fd[0] = -1;
fd[1] = -1;
break;
case FT_SOCKETPAIR:
if (socketpair(AF_UNIX, SOCK_STREAM, AF_UNSPEC,
fd) != 0)
err(1, "socketpair");
break;
case FT_PIPE:
if (pipe(fd) != 0)
err(1, "pipe");
break;
}
state = 0;
switch (cpid = fork()) {
case -1:
err(1, "fork");
case 0:
(void)close(fd[1]);
child(fd[0], num);
break;
default:
(void)close(fd[0]);
parent(fd[1]);
break;
}
num += filetype == FT_FIFO ? 12 : 4;
}
(void)unlink(FIFONAME);
return (0);
}
diff --git a/tools/regression/poll/pipeselect.c b/tools/regression/poll/pipeselect.c
index fe6e8ed33daa..7e16ec071ede 100644
--- a/tools/regression/poll/pipeselect.c
+++ b/tools/regression/poll/pipeselect.c
@@ -1,318 +1,317 @@
-/* $FreeBSD$ */
#include <sys/socket.h>
#include <sys/select.h>
#include <sys/stat.h>
#include <err.h>
#include <fcntl.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define FIFONAME "fifo.tmp"
#define FT_END 3
#define FT_FIFO 2
#define FT_PIPE 0
#define FT_SOCKETPAIR 1
#define SETUP(fd, rfds, tv) do { \
FD_ZERO(&(rfds)); \
FD_SET((fd), &(rfds)); \
(tv).tv_sec = 0; \
(tv).tv_usec = 0; \
} while (0)
static int filetype;
static const char *
decode_events(int events)
{
return (events ? "set" : "clear");
}
static void
report(int num, const char *state, int expected, int got)
{
if (!expected == !got)
printf("ok %-2d ", num);
else
printf("not ok %-2d", num);
printf(" %s state %s: expected %s; got %s\n",
filetype == FT_PIPE ? "Pipe" :
filetype == FT_SOCKETPAIR ? "Sock" : "FIFO",
state, decode_events(expected), decode_events(got));
fflush(stdout);
}
static pid_t cpid;
static pid_t ppid;
static volatile sig_atomic_t state;
static void
catch(int sig)
{
state++;
}
static void
child(int fd, int num)
{
fd_set rfds;
struct timeval tv;
int fd1, fd2;
char buf[256];
if (filetype == FT_FIFO) {
fd = open(FIFONAME, O_RDONLY | O_NONBLOCK);
if (fd < 0)
err(1, "open for read");
}
if (fd >= FD_SETSIZE)
errx(1, "fd = %d too large for select()", fd);
if (filetype == FT_FIFO) {
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
/*
* This state (a reader for which there has never been a
* writer) is reported quite differently for select() than
* for poll(). select() must see a ready-to-read descriptor
* since read() will see EOF and not block; it cannot
* distinguish this state from the one of a reader for which
* there has been a writer but all writers have gone away
* and all data has been read. poll() and distinguish these
* states by returning POLLHUP only for the latter; it does
* this, although this makes it inconsistent with the
* blockability of read() in the former.
*/
report(num++, "0", 1, FD_ISSET(fd, &rfds));
}
kill(ppid, SIGUSR1);
usleep(1);
while (state != 1)
;
if (filetype != FT_FIFO) {
/*
* The connection cannot be reestablished. Use the code that
* delays the read until after the writer disconnects since
* that case is more interesting.
*/
state = 4;
goto state4;
}
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "1", 0, FD_ISSET(fd, &rfds));
kill(ppid, SIGUSR1);
usleep(1);
while (state != 2)
;
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "2", 1, FD_ISSET(fd, &rfds));
if (read(fd, buf, sizeof buf) != 1)
err(1, "read");
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "2a", 0, FD_ISSET(fd, &rfds));
kill(ppid, SIGUSR1);
usleep(1);
while (state != 3)
;
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "3", 1, FD_ISSET(fd, &rfds));
kill(ppid, SIGUSR1);
/*
* Now we expect a new writer, and a new connection too since
* we read all the data. The only new point is that we didn't
* start quite from scratch since the read fd is not new. Check
* startup state as above, but don't do the read as above.
*/
usleep(1);
while (state != 4)
;
state4:
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "4", 0, FD_ISSET(fd, &rfds));
kill(ppid, SIGUSR1);
usleep(1);
while (state != 5)
;
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "5", 1, FD_ISSET(fd, &rfds));
kill(ppid, SIGUSR1);
usleep(1);
while (state != 6)
;
/*
* Now we have no writer, but should still have data from the old
* writer. Check that we have a data-readable condition, and that
* the data can be read in the usual way.
*/
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "6", 1, FD_ISSET(fd, &rfds));
if (read(fd, buf, sizeof buf) != 1)
err(1, "read");
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "6a", 1, FD_ISSET(fd, &rfds));
if (filetype == FT_FIFO) {
/*
* Check that the readable-data condition is sticky for a
* new reader and for the old reader. We really only have
* a hangup condition, but select() can only see this as
* a readable-data condition for null data. select()
* cannot distinguish this state from the initial state
* where there is a reader but has never been a writer, so
* the following tests (to follow the pattern in pipepoll.c)
* essentially test state 0 again.
*/
fd2 = open(FIFONAME, O_RDONLY | O_NONBLOCK);
if (fd2 < 0)
err(1, "open for read");
fd1 = fd;
fd = fd2;
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "6b", 1, FD_ISSET(fd, &rfds));
fd = fd1;
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "6c", 1, FD_ISSET(fd, &rfds));
close(fd2);
SETUP(fd, rfds, tv);
if (select(fd + 1, &rfds, NULL, NULL, &tv) < 0)
err(1, "select");
report(num++, "6d", 1, FD_ISSET(fd, &rfds));
}
close(fd);
kill(ppid, SIGUSR1);
exit(0);
}
static void
parent(int fd)
{
usleep(1);
while (state != 1)
;
if (filetype == FT_FIFO) {
fd = open(FIFONAME, O_WRONLY | O_NONBLOCK);
if (fd < 0)
err(1, "open for write");
}
kill(cpid, SIGUSR1);
usleep(1);
while (state != 2)
;
if (write(fd, "", 1) != 1)
err(1, "write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 3)
;
if (close(fd) != 0)
err(1, "close for write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 4)
;
if (filetype != FT_FIFO)
return;
fd = open(FIFONAME, O_WRONLY | O_NONBLOCK);
if (fd < 0)
err(1, "open for write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 5)
;
if (write(fd, "", 1) != 1)
err(1, "write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 6)
;
if (close(fd) != 0)
err(1, "close for write");
kill(cpid, SIGUSR1);
usleep(1);
while (state != 7)
;
}
int
main(void)
{
int fd[2], num;
num = 1;
printf("1..20\n");
fflush(stdout);
signal(SIGUSR1, catch);
ppid = getpid();
for (filetype = 0; filetype < FT_END; filetype++) {
switch (filetype) {
case FT_FIFO:
if (mkfifo(FIFONAME, 0666) != 0)
err(1, "mkfifo");
fd[0] = -1;
fd[1] = -1;
break;
case FT_SOCKETPAIR:
if (socketpair(AF_UNIX, SOCK_STREAM, AF_UNSPEC,
fd) != 0)
err(1, "socketpair");
break;
case FT_PIPE:
if (pipe(fd) != 0)
err(1, "pipe");
break;
}
state = 0;
switch (cpid = fork()) {
case -1:
err(1, "fork");
case 0:
(void)close(fd[1]);
child(fd[0], num);
break;
default:
(void)close(fd[0]);
parent(fd[1]);
break;
}
num += filetype == FT_FIFO ? 12 : 4;
}
(void)unlink(FIFONAME);
return (0);
}
diff --git a/tools/regression/poll/sockpoll.c b/tools/regression/poll/sockpoll.c
index 31ebcaf9bcb2..ea3c91c3affb 100644
--- a/tools/regression/poll/sockpoll.c
+++ b/tools/regression/poll/sockpoll.c
@@ -1,245 +1,244 @@
-/* $FreeBSD$ */
#define _GNU_SOURCE /* expose POLLRDHUP when testing on Linux */
#include <sys/socket.h>
#include <sys/stat.h>
#include <err.h>
#include <fcntl.h>
#include <poll.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
static void
append(char *out, size_t out_size, const char *s)
{
size_t size = strlen(out);
snprintf(out + size, out_size - size, "%s", s);
}
static void
decode_events(int events, char *out, size_t out_size)
{
int unknown;
out[0] = 0;
if (events == 0) {
append(out, out_size, "0");
return;
}
#define DECODE_FLAG(x) \
if (events & (x)) { \
if (out[0] != 0) \
append(out, out_size, " | "); \
append(out, out_size, #x); \
}
/* Show the expected flags by name. */
DECODE_FLAG(POLLIN);
DECODE_FLAG(POLLOUT);
DECODE_FLAG(POLLHUP);
#ifndef POLLRDHUP
#define KNOWN_FLAGS (POLLIN | POLLOUT | POLLHUP)
#else
DECODE_FLAG(POLLRDHUP);
#define KNOWN_FLAGS (POLLIN | POLLOUT | POLLHUP | POLLRDHUP);
#endif
/* Show any unexpected bits as hex. */
unknown = events & ~KNOWN_FLAGS;
if (unknown != 0) {
char buf[80];
snprintf(buf, sizeof(buf), "%s%x", out[0] != 0 ? " | " : "",
unknown);
append(out, out_size, buf);
}
}
static void
report(int num, const char *state, int expected, int got)
{
char expected_str[80];
char got_str[80];
decode_events(expected, expected_str, sizeof(expected_str));
decode_events(got, got_str, sizeof(got_str));
if (expected == got)
printf("ok %-2d ", num);
else
printf("not ok %-2d", num);
printf(" state %s: expected %s; got %s\n",
state, expected_str, got_str);
fflush(stdout);
}
static int
set_nonblocking(int sck)
{
int flags;
flags = fcntl(sck, F_GETFL, 0);
flags |= O_NONBLOCK;
if (fcntl(sck, F_SETFL, flags))
return -1;
return 0;
}
static char largeblock[1048576]; /* should be more than AF_UNIX sockbuf size */
static int fd[2];
static struct pollfd pfd0;
static struct pollfd pfd1;
void
setup(void)
{
if (socketpair(AF_UNIX, SOCK_STREAM, 0, fd) != 0)
err(1, "socketpair");
if (set_nonblocking(fd[0]) == -1)
err(1, "fcntl");
if (set_nonblocking(fd[1]) == -1)
err(1, "fcntl");
pfd0.fd = fd[0];
pfd0.events = POLLIN | POLLOUT;
pfd1.fd = fd[1];
pfd1.events = POLLIN | POLLOUT;
}
int
main(void)
{
int num;
num = 1;
printf("1..18\n");
fflush(stdout);
/* Large write with close */
setup();
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "initial 0", POLLOUT, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "initial 1", POLLOUT, pfd1.revents);
if (write(fd[0], largeblock, sizeof(largeblock)) == -1)
err(1, "write");
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "after large write", 0, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after large write", POLLIN | POLLOUT, pfd1.revents);
close(fd[0]);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after close", POLLIN | POLLHUP, pfd1.revents);
if (read(fd[1], largeblock, sizeof(largeblock)) == -1)
err(1, "read");
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after reading input", POLLHUP, pfd1.revents);
close(fd[1]);
/* With shutdown(SHUT_WR) */
setup();
if (shutdown(fd[0], SHUT_WR) == -1)
err(1, "shutdown");
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "after shutdown(SHUT_WR)", POLLOUT, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after shutdown(SHUT_WR)", POLLIN | POLLOUT, pfd1.revents);
switch (read(fd[1], largeblock, sizeof(largeblock))) {
case 0:
break;
case -1:
err(1, "read after other side shutdown");
break;
default:
errx(1, "kernel made up data that was never written");
}
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after reading EOF", POLLIN | POLLOUT, pfd1.revents);
if (write(fd[1], largeblock, sizeof(largeblock)) == -1)
err(1, "write");
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "after data from other side", POLLIN | POLLOUT, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "after writing", POLLIN, pfd1.revents);
if (shutdown(fd[1], SHUT_WR) == -1)
err(1, "shutdown second");
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "after second shutdown", POLLIN | POLLHUP, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "after second shutdown", POLLHUP, pfd1.revents);
close(fd[0]);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "after close", POLLHUP, pfd1.revents);
close(fd[1]);
/*
* With shutdown(SHUT_RD)
* Note that shutdown(SHUT_WR) is passed to the peer, but
* shutdown(SHUT_RD) is not.
*/
setup();
if (shutdown(fd[0], SHUT_RD) == -1)
err(1, "shutdown");
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "after shutdown(SHUT_RD)", POLLIN | POLLOUT, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after shutdown(SHUT_RD)", POLLOUT, pfd1.revents);
if (shutdown(fd[0], SHUT_WR) == -1)
err(1, "shutdown");
if (poll(&pfd0, 1, 0) == -1)
err(1, "poll");
report(num++, "after shutdown(SHUT_WR)", POLLHUP, pfd0.revents);
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after shutdown(SHUT_WR)", POLLIN | POLLOUT, pfd1.revents);
close(fd[0]);
close(fd[1]);
#ifdef POLLRDHUP
setup();
pfd1.events |= POLLRDHUP;
if (shutdown(fd[0], SHUT_RD) == -1)
err(1, "shutdown");
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after shutdown(SHUT_RD)", POLLOUT, pfd1.revents);
if (write(fd[0], "x", 1) != 1)
err(1, "write");
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after write", POLLIN | POLLOUT, pfd1.revents);
if (shutdown(fd[0], SHUT_WR) == -1)
err(1, "shutdown");
if (poll(&pfd1, 1, 0) == -1)
err(1, "poll");
report(num++, "other side after shutdown(SHUT_WR)", POLLIN | POLLOUT | POLLRDHUP, pfd1.revents);
close(fd[0]);
close(fd[1]);
#endif
return (0);
}
diff --git a/tools/regression/posixsem2/semtest.c b/tools/regression/posixsem2/semtest.c
index 0879ff9fda78..5ff2d3e9a888 100644
--- a/tools/regression/posixsem2/semtest.c
+++ b/tools/regression/posixsem2/semtest.c
@@ -1,137 +1,136 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/mman.h>
#include <semaphore.h>
#include <stdio.h>
#include <stdlib.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <unistd.h>
#define SEM_NAME "/semtst"
int test_unnamed(void);
int test_named(void);
int test_named2(void);
int
test_unnamed(void)
{
sem_t *s;
pid_t pid;
int status;
printf("testing unnamed process-shared semaphore\n");
s = (sem_t *)mmap(NULL, sizeof(sem_t), PROT_READ|PROT_WRITE, MAP_ANON|MAP_SHARED,
-1, 0);
if (s == MAP_FAILED)
err(1, "mmap failed");
if (sem_init(s, 1, 0))
err(2, "sem_init failed");
if ((pid = fork()) == 0) {
printf("child: sem_wait()\n");
if (sem_wait(s))
err(3, "sem_wait failed");
printf("child: sem_wait() returned\n");
exit(0);
} else {
sleep(1);
printf("parent: sem_post()\n");
if (sem_post(s))
err(4, "sem_post failed");
waitpid(pid, &status, 0);
if (WIFEXITED(status) && WEXITSTATUS(status) == 0)
printf("OK.\n");
else
printf("Failure.");
}
return (0);
}
int
test_named(void)
{
sem_t *s, *s2;
pid_t pid;
int status;
printf("testing named process-shared semaphore\n");
sem_unlink(SEM_NAME);
s = sem_open(SEM_NAME, O_CREAT, 0777, 0);
if (s == SEM_FAILED)
err(1, "sem_open failed");
s2 = sem_open(SEM_NAME, O_CREAT, 0777, 0);
if (s2 == SEM_FAILED)
err(2, "second sem_open call failed");
if (s != s2)
errx(3,
"two sem_open calls for same semaphore do not return same address");
if (sem_close(s2))
err(4, "sem_close failed");
if ((pid = fork()) == 0) {
printf("child: sem_wait()\n");
if (sem_wait(s))
err(5, "sem_wait failed");
printf("child: sem_wait() returned\n");
exit(0);
} else {
sleep(1);
printf("parent: sem_post()\n");
if (sem_post(s))
err(6, "sem_post failed");
waitpid(pid, &status, 0);
if (WIFEXITED(status) && WEXITSTATUS(status) == 0)
printf("OK.\n");
else
printf("Failure.");
}
if (sem_close(s))
err(7, "sem_close failed");
return (0);
}
int
test_named2(void)
{
sem_t *s, *s2, *s3;
printf("testing named process-shared semaphore, O_EXCL cases\n");
sem_unlink(SEM_NAME);
s = sem_open(SEM_NAME, O_CREAT | O_EXCL, 0777, 0);
if (s == SEM_FAILED)
err(1, "sem_open failed");
s2 = sem_open(SEM_NAME, O_CREAT | O_EXCL, 0777, 0);
if (s2 != SEM_FAILED)
errx(2, "second sem_open call wrongly succeeded");
if (errno != EEXIST)
err(3, "second sem_open call failed with wrong errno");
s3 = sem_open(SEM_NAME, 0);
if (s3 == SEM_FAILED)
err(4, "third sem_open call failed");
if (s != s3)
errx(5,
"two sem_open calls for same semaphore do not return same address");
if (sem_close(s3))
err(6, "sem_close failed");
if (sem_close(s))
err(7, "sem_close failed");
printf("OK.\n");
return (0);
}
int
main(void)
{
test_unnamed();
test_named();
test_named2();
return (0);
}
diff --git a/tools/regression/pthread/unwind/Test.cpp b/tools/regression/pthread/unwind/Test.cpp
index 46e451c390b6..bad63be44798 100644
--- a/tools/regression/pthread/unwind/Test.cpp
+++ b/tools/regression/pthread/unwind/Test.cpp
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
static int destructed;
static int destructed2;
class Test {
public:
Test() { printf("Test::Test()\n"); }
~Test() { printf("Test::~Test()\n"); destructed = 1; }
};
void
cleanup_handler(void *arg __unused)
{
destructed2 = 1;
printf("%s()\n", __func__);
}
void
check_destruct(void)
{
if (!destructed)
printf("Bug, object destructor is not called\n");
else
printf("OK\n");
}
void
check_destruct2(void)
{
if (!destructed)
printf("Bug, object destructor is not called\n");
else if (!destructed2)
printf("Bug, cleanup handler is not called\n");
else
printf("OK\n");
}
diff --git a/tools/regression/pthread/unwind/catch_pthread_exit.cpp b/tools/regression/pthread/unwind/catch_pthread_exit.cpp
index db0e875ccaeb..b5074cd4beb1 100644
--- a/tools/regression/pthread/unwind/catch_pthread_exit.cpp
+++ b/tools/regression/pthread/unwind/catch_pthread_exit.cpp
@@ -1,35 +1,34 @@
-/* $FreeBSD$ */
/* try to catch thread exiting, and rethrow the exception */
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
static int caught;
static void *
thr_routine(void *arg __unused)
{
try {
pthread_exit(NULL);
} catch (...) {
caught = 1;
printf("thread exiting exception caught\n");
/* rethrow */
throw;
}
}
int
main()
{
pthread_t td;
pthread_create(&td, NULL, thr_routine, NULL);
pthread_join(td, NULL);
if (caught)
printf("OK\n");
else
printf("failure\n");
return (0);
}
diff --git a/tools/regression/pthread/unwind/cond_wait_cancel.cpp b/tools/regression/pthread/unwind/cond_wait_cancel.cpp
index 4dfa57746552..d241b55909b6 100644
--- a/tools/regression/pthread/unwind/cond_wait_cancel.cpp
+++ b/tools/regression/pthread/unwind/cond_wait_cancel.cpp
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/* Test stack unwinding for pthread_cond_wait function */
#include <pthread.h>
#include <stdio.h>
#include <semaphore.h>
#include <unistd.h>
#include "Test.cpp"
static pthread_mutex_t mtx;
static pthread_cond_t cv;
static void *
thr(void *arg __unused)
{
Test t;
pthread_mutex_lock(&mtx);
pthread_cond_wait(&cv, &mtx);
pthread_mutex_unlock(&mtx);
printf("Bug, thread shouldn't be here.\n");
return (0);
}
int
main()
{
pthread_t td;
pthread_mutex_init(&mtx, NULL);
pthread_cond_init(&cv, NULL);
pthread_create(&td, NULL, thr, NULL);
sleep(1);
pthread_cancel(td);
pthread_join(td, NULL);
check_destruct();
return (0);
}
diff --git a/tools/regression/pthread/unwind/main_thread_exit.cpp b/tools/regression/pthread/unwind/main_thread_exit.cpp
index 182c194b07af..c3ee859a5f0f 100644
--- a/tools/regression/pthread/unwind/main_thread_exit.cpp
+++ b/tools/regression/pthread/unwind/main_thread_exit.cpp
@@ -1,18 +1,17 @@
-/* $FreeBSD$ */
/* check unwinding for main thread */
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include "Test.cpp"
int
main()
{
Test test;
atexit(check_destruct);
pthread_exit((void *)1);
return (0);
}
diff --git a/tools/regression/pthread/unwind/sem_wait_cancel.cpp b/tools/regression/pthread/unwind/sem_wait_cancel.cpp
index 2086de6037cb..45f881c521fe 100644
--- a/tools/regression/pthread/unwind/sem_wait_cancel.cpp
+++ b/tools/regression/pthread/unwind/sem_wait_cancel.cpp
@@ -1,35 +1,34 @@
-/* $FreeBSD$ */
/* Test stack unwinding for libc's sem */
#include <pthread.h>
#include <stdio.h>
#include <semaphore.h>
#include <unistd.h>
#include "Test.cpp"
static sem_t sem;
static void *
thr(void *arg __unused)
{
Test t;
sem_wait(&sem);
printf("Bug, thread shouldn't be here.\n");
return (0);
}
int
main()
{
pthread_t td;
sem_init(&sem, 0, 0);
pthread_create(&td, NULL, thr, NULL);
sleep(1);
pthread_cancel(td);
pthread_join(td, NULL);
check_destruct();
return (0);
}
diff --git a/tools/regression/pthread/unwind/thread_normal_exit.cpp b/tools/regression/pthread/unwind/thread_normal_exit.cpp
index 70768265be70..3549db432f38 100644
--- a/tools/regression/pthread/unwind/thread_normal_exit.cpp
+++ b/tools/regression/pthread/unwind/thread_normal_exit.cpp
@@ -1,28 +1,27 @@
-/* $FreeBSD$ */
/* test stack unwinding for a new thread */
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include "Test.cpp"
static void *
thr_routine(void *arg __unused)
{
Test test;
pthread_exit(NULL);
printf("Bug, thread shouldn't be here\n");
}
int
main()
{
pthread_t td;
pthread_create(&td, NULL, thr_routine, NULL);
pthread_join(td, NULL);
check_destruct();
return (0);
}
diff --git a/tools/regression/sigqueue/sigqtest1/sigqtest1.c b/tools/regression/sigqueue/sigqtest1/sigqtest1.c
index f0201c37af86..074f140f11c8 100644
--- a/tools/regression/sigqueue/sigqtest1/sigqtest1.c
+++ b/tools/regression/sigqueue/sigqtest1/sigqtest1.c
@@ -1,52 +1,51 @@
-/* $FreeBSD$ */
#include <err.h>
#include <errno.h>
#include <signal.h>
#include <stdio.h>
#include <unistd.h>
int received;
void
handler(int sig, siginfo_t *si, void *ctx)
{
if (si->si_code != SI_QUEUE)
errx(1, "si_code != SI_QUEUE");
if (si->si_value.sival_int != received)
errx(1, "signal is out of order");
received++;
}
int
main()
{
struct sigaction sa;
union sigval val;
int ret;
int i;
sigset_t set;
sa.sa_flags = SA_SIGINFO;
sigemptyset(&sa.sa_mask);
sa.sa_sigaction = handler;
sigaction(SIGRTMIN, &sa, NULL);
sigemptyset(&set);
sigaddset(&set, SIGRTMIN);
sigprocmask(SIG_BLOCK, &set, NULL);
i = 0;
for (;;) {
val.sival_int = i;
ret = sigqueue(getpid(), SIGRTMIN, val);
if (ret == -1) {
if (errno != EAGAIN) {
errx(1, "errno != EAGAIN");
}
break;
}
i++;
}
sigprocmask(SIG_UNBLOCK, &set, NULL);
if (received != i)
errx(1, "error, signal lost");
printf("OK\n");
}
diff --git a/tools/regression/sigqueue/sigqtest2/sigqtest2.c b/tools/regression/sigqueue/sigqtest2/sigqtest2.c
index 50b579d0a42c..50ab140dbd9a 100644
--- a/tools/regression/sigqueue/sigqtest2/sigqtest2.c
+++ b/tools/regression/sigqueue/sigqtest2/sigqtest2.c
@@ -1,103 +1,102 @@
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/wait.h>
#include <err.h>
#include <errno.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int stop_received;
int exit_received;
int cont_received;
void
job_handler(int sig, siginfo_t *si, void *ctx)
{
int status;
int ret;
if (si->si_code == CLD_STOPPED) {
printf("%d: stop received\n", si->si_pid);
stop_received = 1;
kill(si->si_pid, SIGCONT);
} else if (si->si_code == CLD_EXITED) {
printf("%d: exit received\n", si->si_pid);
ret = waitpid(si->si_pid, &status, 0);
if (ret == -1)
errx(1, "waitpid");
if (!WIFEXITED(status))
errx(1, "!WIFEXITED(status)");
exit_received = 1;
} else if (si->si_code == CLD_CONTINUED) {
printf("%d: cont received\n", si->si_pid);
cont_received = 1;
}
}
void
job_control_test(void)
{
struct sigaction sa;
pid_t pid;
int count = 10;
sigemptyset(&sa.sa_mask);
sa.sa_flags = SA_SIGINFO;
sa.sa_sigaction = job_handler;
sigaction(SIGCHLD, &sa, NULL);
stop_received = 0;
cont_received = 0;
exit_received = 0;
fflush(stdout);
pid = fork();
if (pid == 0) {
printf("child %d\n", getpid());
kill(getpid(), SIGSTOP);
sleep(2);
exit(1);
}
while (!(cont_received && stop_received && exit_received)) {
sleep(1);
if (--count == 0)
break;
}
if (!(cont_received && stop_received && exit_received))
errx(1, "job signals lost");
printf("job control test OK.\n");
}
void
rtsig_handler(int sig, siginfo_t *si, void *ctx)
{
}
int
main()
{
struct sigaction sa;
sigset_t set;
union sigval val;
/* test job control with empty signal queue */
job_control_test();
/* now full fill signal queue in kernel */
sigemptyset(&sa.sa_mask);
sa.sa_flags = SA_SIGINFO;
sa.sa_sigaction = rtsig_handler;
sigaction(SIGRTMIN, &sa, NULL);
sigemptyset(&set);
sigaddset(&set, SIGRTMIN);
sigprocmask(SIG_BLOCK, &set, NULL);
val.sival_int = 1;
while (sigqueue(getpid(), SIGRTMIN, val))
;
/* signal queue is fully filled, test the job control again. */
job_control_test();
return (0);
}
diff --git a/tools/regression/tls/libxx/xx.c b/tools/regression/tls/libxx/xx.c
index 6d1e73f79a05..bc81531e2ce0 100644
--- a/tools/regression/tls/libxx/xx.c
+++ b/tools/regression/tls/libxx/xx.c
@@ -1,12 +1,11 @@
-/* $FreeBSD$ */
extern int __thread yy1;
int __thread xx1 = 1;
int __thread xx2 = 2;
int __thread xxa[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int
xxyy()
{
return yy1;
}
diff --git a/tools/regression/tls/libyy/yy.c b/tools/regression/tls/libyy/yy.c
index c00cb8770ec4..e7265829b93a 100644
--- a/tools/regression/tls/libyy/yy.c
+++ b/tools/regression/tls/libyy/yy.c
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
int __thread yy1 = 101;
diff --git a/tools/regression/tls/ttls1/ttls1.c b/tools/regression/tls/ttls1/ttls1.c
index 9c514aeecf7a..24e4b1636e7d 100644
--- a/tools/regression/tls/ttls1/ttls1.c
+++ b/tools/regression/tls/ttls1/ttls1.c
@@ -1,15 +1,14 @@
-/* $FreeBSD$ */
#include <stdio.h>
extern int __thread xx1;
extern int __thread xx2;
extern int __thread xxa[];
int __thread a[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
extern int xxyy();
int main(int argc, char** argv)
{
printf("xx1=%d, xx2=%d, xxa[5]=%d, a[5]=%d, xxyy()=%d\n",
xx1, xx2, xxa[5], a[5], xxyy());
}
diff --git a/tools/regression/tls/ttls2/ttls2.c b/tools/regression/tls/ttls2/ttls2.c
index 15eb640e3e3c..6fe316e15128 100644
--- a/tools/regression/tls/ttls2/ttls2.c
+++ b/tools/regression/tls/ttls2/ttls2.c
@@ -1,42 +1,41 @@
-/* $FreeBSD$ */
#include <pthread.h>
#include <stdio.h>
#include <unistd.h>
int __thread i;
void *
foo1(void *arg)
{
printf("thread %p, &i = %p\n", pthread_self(), &i);
for (i = 0; i < 10; i++) {
printf("thread %p, i = %d\n", pthread_self(), i);
sleep(1);
}
return (NULL);
}
void *
foo2(void *arg)
{
printf("thread %p, &i = %p\n", pthread_self(), &i);
for (i = 10; i > 0; i--) {
printf("thread %p, i = %d\n", pthread_self(), i);
sleep(1);
}
return (NULL);
}
int
main(int argc, char** argv)
{
pthread_t t1, t2;
pthread_create(&t1, 0, foo1, 0);
pthread_create(&t2, 0, foo2, 0);
pthread_join(t1, 0);
pthread_join(t2, 0);
return (0);
}
diff --git a/tools/test/malloc/main.c b/tools/test/malloc/main.c
index 5fef9a92f4da..7c5bf14924de 100644
--- a/tools/test/malloc/main.c
+++ b/tools/test/malloc/main.c
@@ -1,58 +1,57 @@
-/* $FreeBSD$ */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
u_long NBUCKETS = 2000;
u_long NOPS = 200000;
u_long NSIZE = (16*1024);
char **foo;
int
main(int argc, char **argv)
{
u_long i,j,k;
if (argc > 1) NOPS = strtoul(argv[1],0,0);
if (argc > 2) NBUCKETS = strtoul(argv[2],0,0);
if (argc > 3) NSIZE = strtoul(argv[3],0,0);
printf("BRK(0)=%p ", sbrk(0));
foo = malloc(sizeof(*foo) * NBUCKETS);
memset(foo, 0, sizeof(*foo) * NBUCKETS);
for (i = 1; i <= 4096; i *= 2) {
for (j = 0; j < 40960/i && j < NBUCKETS; j++) {
foo[j] = malloc(i);
}
for (j = 0; j < 40960/i && j < NBUCKETS; j++) {
free(foo[j]);
foo[j] = NULL;
}
}
for (i = 0; i < NOPS; i++) {
j = random() % NBUCKETS;
k = random() % NSIZE;
foo[j] = realloc(foo[j], k & 1 ? 0 : k);
if (k & 1 || k == 0) {
/*
* Workaround because realloc return bogus pointer rather than
* NULL if passed zero length.
*/
foo[j] = NULL;
}
if (foo[j])
foo[j][0] = 1;
}
printf("BRK(1)=%p ", sbrk(0));
for (j = 0; j < NBUCKETS; j++) {
if (foo[j]) {
free(foo[j]);
foo[j] = NULL;
}
}
printf("BRK(2)=%p NOPS=%lu NBUCKETS=%lu NSIZE=%lu\n",
sbrk(0), NOPS, NBUCKETS, NSIZE);
return 0;
}
diff --git a/tools/tools/ath/ath_ee_9287_print/9287.h b/tools/tools/ath/ath_ee_9287_print/9287.h
index 4cfc4241fdf3..ff14b72c8a91 100644
--- a/tools/tools/ath/ath_ee_9287_print/9287.h
+++ b/tools/tools/ath/ath_ee_9287_print/9287.h
@@ -1,15 +1,14 @@
-/* $FreeBSD$ */
#ifndef __9287_H__
#define __9287_H__
extern void eeprom_9287_base_print(uint16_t *buf);
extern void eeprom_9287_custdata_print(uint16_t *buf);
extern void eeprom_9287_modal_print(uint16_t *buf);
extern void eeprom_9287_calfreqpiers_print(uint16_t *buf);
extern void eeprom_9287_ctl_print(uint16_t *buf);
extern void eeprom_9287_print_targets(uint16_t *buf);
extern void eeprom_9287_print_edges(uint16_t *buf);
extern void eeprom_9287_print_other(uint16_t *buf);
#endif
diff --git a/tools/tools/ath/ath_ee_9287_print/eeprom.h b/tools/tools/ath/ath_ee_9287_print/eeprom.h
index a5fc76a9b58d..3eb8e0da912d 100644
--- a/tools/tools/ath/ath_ee_9287_print/eeprom.h
+++ b/tools/tools/ath/ath_ee_9287_print/eeprom.h
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#ifndef __EEPROM_H__
#define __EEPROM_H__
extern void load_eeprom_dump(const char *file, uint16_t *buf);
#endif
diff --git a/tools/tools/ath/ath_ee_v4k_print/eeprom.h b/tools/tools/ath/ath_ee_v4k_print/eeprom.h
index a5fc76a9b58d..3eb8e0da912d 100644
--- a/tools/tools/ath/ath_ee_v4k_print/eeprom.h
+++ b/tools/tools/ath/ath_ee_v4k_print/eeprom.h
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#ifndef __EEPROM_H__
#define __EEPROM_H__
extern void load_eeprom_dump(const char *file, uint16_t *buf);
#endif
diff --git a/tools/tools/ath/ath_ee_v4k_print/v4k.h b/tools/tools/ath/ath_ee_v4k_print/v4k.h
index efe2dc945b86..356312dc1aa8 100644
--- a/tools/tools/ath/ath_ee_v4k_print/v4k.h
+++ b/tools/tools/ath/ath_ee_v4k_print/v4k.h
@@ -1,15 +1,14 @@
-/* $FreeBSD$ */
#ifndef __V4K_H__
#define __V4K_H__
extern void eeprom_v4k_base_print(uint16_t *buf);
extern void eeprom_v4k_custdata_print(uint16_t *buf);
extern void eeprom_v4k_modal_print(uint16_t *buf);
extern void eeprom_v4k_calfreqpiers_print(uint16_t *buf);
extern void eeprom_v4k_ctl_print(uint16_t *buf);
extern void eeprom_v4k_print_targets(uint16_t *buf);
extern void eeprom_v4k_print_edges(uint16_t *buf);
extern void eeprom_v4k_print_other(uint16_t *buf);
#endif
diff --git a/tools/tools/crypto/cryptokeytest.c b/tools/tools/crypto/cryptokeytest.c
index 5f0ad74b8eba..d455e7140047 100644
--- a/tools/tools/crypto/cryptokeytest.c
+++ b/tools/tools/crypto/cryptokeytest.c
@@ -1,270 +1,269 @@
-/* $FreeBSD$ */
/*
* The big num stuff is a bit broken at the moment and I've not yet fixed it.
* The symtom is that odd size big nums will fail. Test code below (it only
* uses modexp currently).
*
* --Jason L. Wright
*/
#include <sys/types.h>
#include <sys/endian.h>
#include <sys/ioctl.h>
#include <sys/time.h>
#include <crypto/cryptodev.h>
#include <err.h>
#include <fcntl.h>
#include <paths.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <openssl/bn.h>
#include <openssl/err.h>
int crid = CRYPTO_FLAG_HARDWARE;
int verbose = 0;
static int
devcrypto(void)
{
static int fd = -1;
if (fd < 0) {
fd = open(_PATH_DEV "crypto", O_RDWR, 0);
if (fd < 0)
err(1, _PATH_DEV "crypto");
if (fcntl(fd, F_SETFD, 1) == -1)
err(1, "fcntl(F_SETFD) (devcrypto)");
}
return fd;
}
static int
crlookup(const char *devname)
{
struct crypt_find_op find;
find.crid = -1;
strlcpy(find.name, devname, sizeof(find.name));
if (ioctl(devcrypto(), CIOCFINDDEV, &find) == -1)
err(1, "ioctl(CIOCFINDDEV)");
return find.crid;
}
static const char *
crfind(int crid)
{
static struct crypt_find_op find;
bzero(&find, sizeof(find));
find.crid = crid;
if (ioctl(devcrypto(), CIOCFINDDEV, &find) == -1)
err(1, "ioctl(CIOCFINDDEV)");
return find.name;
}
/*
* Convert a little endian byte string in 'p' that is 'plen' bytes long to a
* BIGNUM. A new BIGNUM is allocated. Returns NULL on failure.
*/
static BIGNUM *
le_to_bignum(BIGNUM *res, const void *p, int plen)
{
res = BN_lebin2bn(p, plen, res);
if (res == NULL)
ERR_print_errors_fp(stderr);
return (res);
}
/*
* Convert a BIGNUM to a little endian byte string. Space for BN_num_bytes(n)
* is allocated.
* Returns NULL on failure.
*/
static void *
bignum_to_le(const BIGNUM *n)
{
int blen, error;
void *rd;
blen = BN_num_bytes(n);
if (blen == 0)
return (NULL);
rd = malloc(blen);
if (rd == NULL)
return (NULL);
error = BN_bn2lebinpad(n, rd, blen);
if (error < 0) {
ERR_print_errors_fp(stderr);
free(rd);
return (NULL);
}
return (rd);
}
static int
UB_mod_exp(BIGNUM *res, const BIGNUM *a, const BIGNUM *b, const BIGNUM *c)
{
struct crypt_kop kop;
void *ale, *ble, *cle;
int crypto_fd = devcrypto();
if ((ale = bignum_to_le(a)) == NULL)
err(1, "bignum_to_le, a");
if ((ble = bignum_to_le(b)) == NULL)
err(1, "bignum_to_le, b");
if ((cle = bignum_to_le(c)) == NULL)
err(1, "bignum_to_le, c");
bzero(&kop, sizeof(kop));
kop.crk_op = CRK_MOD_EXP;
kop.crk_iparams = 3;
kop.crk_oparams = 1;
kop.crk_crid = crid;
kop.crk_param[0].crp_p = ale;
kop.crk_param[0].crp_nbits = BN_num_bytes(a) * 8;
kop.crk_param[1].crp_p = ble;
kop.crk_param[1].crp_nbits = BN_num_bytes(b) * 8;
kop.crk_param[2].crp_p = cle;
kop.crk_param[2].crp_nbits = BN_num_bytes(c) * 8;
kop.crk_param[3].crp_p = cle;
kop.crk_param[3].crp_nbits = BN_num_bytes(c) * 8;
if (ioctl(crypto_fd, CIOCKEY2, &kop) == -1)
err(1, "CIOCKEY2");
if (verbose)
printf("device = %s\n", crfind(kop.crk_crid));
explicit_bzero(ale, BN_num_bytes(a));
free(ale);
explicit_bzero(ble, BN_num_bytes(b));
free(ble);
if (kop.crk_status != 0) {
printf("error %d\n", kop.crk_status);
explicit_bzero(cle, BN_num_bytes(c));
free(cle);
return (-1);
} else {
res = le_to_bignum(res, cle, BN_num_bytes(c));
explicit_bzero(cle, BN_num_bytes(c));
free(cle);
if (res == NULL)
err(1, "le_to_bignum");
return (0);
}
return (0);
}
static void
show_result(const BIGNUM *a, const BIGNUM *b, const BIGNUM *c,
const BIGNUM *sw, const BIGNUM *hw)
{
printf("\n");
printf("A = ");
BN_print_fp(stdout, a);
printf("\n");
printf("B = ");
BN_print_fp(stdout, b);
printf("\n");
printf("C = ");
BN_print_fp(stdout, c);
printf("\n");
printf("sw= ");
BN_print_fp(stdout, sw);
printf("\n");
printf("hw= ");
BN_print_fp(stdout, hw);
printf("\n");
printf("\n");
}
static void
testit(void)
{
BIGNUM *a, *b, *c, *r1, *r2;
BN_CTX *ctx;
ctx = BN_CTX_new();
a = BN_new();
b = BN_new();
c = BN_new();
r1 = BN_new();
r2 = BN_new();
BN_pseudo_rand(a, 1023, 0, 0);
BN_pseudo_rand(b, 1023, 0, 0);
BN_pseudo_rand(c, 1024, 0, 0);
if (BN_cmp(a, c) > 0) {
BIGNUM *rem = BN_new();
BN_mod(rem, a, c, ctx);
UB_mod_exp(r2, rem, b, c);
BN_free(rem);
} else {
UB_mod_exp(r2, a, b, c);
}
BN_mod_exp(r1, a, b, c, ctx);
if (BN_cmp(r1, r2) != 0) {
show_result(a, b, c, r1, r2);
}
BN_free(r2);
BN_free(r1);
BN_free(c);
BN_free(b);
BN_free(a);
BN_CTX_free(ctx);
}
static void
usage(const char* cmd)
{
printf("usage: %s [-d dev] [-v] [count]\n", cmd);
printf("count is the number of bignum ops to do\n");
printf("\n");
printf("-d use specific device\n");
printf("-v be verbose\n");
exit(-1);
}
int
main(int argc, char *argv[])
{
int c, i;
while ((c = getopt(argc, argv, "d:v")) != -1) {
switch (c) {
case 'd':
crid = crlookup(optarg);
break;
case 'v':
verbose = 1;
break;
default:
usage(argv[0]);
}
}
argc -= optind, argv += optind;
for (i = 0; i < 1000; i++) {
fprintf(stderr, "test %d\n", i);
testit();
}
return (0);
}
diff --git a/tools/tools/iwi/iwistats.c b/tools/tools/iwi/iwistats.c
index 1034dac7701f..31ccf13e8d46 100644
--- a/tools/tools/iwi/iwistats.c
+++ b/tools/tools/iwi/iwistats.c
@@ -1,129 +1,128 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2005
* Damien Bergamini <damien.bergamini@free.fr>. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice unmodified, this list of conditions, and the following
* disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/types.h>
#include <sys/sysctl.h>
#include <err.h>
#include <stdio.h>
#include <sysexits.h>
static void get_statistics(const char *);
int
main(int argc, char **argv)
{
get_statistics((argc > 1) ? argv[1] : "iwi0");
return EX_OK;
}
static const struct statistic {
int index;
const char *desc;
} tbl[] = {
{ 1, "Current transmission rate" },
{ 2, "Fragmentation threshold" },
{ 3, "RTS threshold" },
{ 4, "Number of frames submitted for transfer" },
{ 5, "Number of frames transmitted" },
{ 6, "Number of unicast frames transmitted" },
{ 7, "Number of unicast 802.11b frames transmitted at 1Mb/s" },
{ 8, "Number of unicast 802.11b frames transmitted at 2Mb/s" },
{ 9, "Number of unicast 802.11b frames transmitted at 5.5Mb/s" },
{ 10, "Number of unicast 802.11b frames transmitted at 11Mb/s" },
{ 19, "Number of unicast 802.11g frames transmitted at 1Mb/s" },
{ 20, "Number of unicast 802.11g frames transmitted at 2Mb/s" },
{ 21, "Number of unicast 802.11g frames transmitted at 5.5Mb/s" },
{ 22, "Number of unicast 802.11g frames transmitted at 6Mb/s" },
{ 23, "Number of unicast 802.11g frames transmitted at 9Mb/s" },
{ 24, "Number of unicast 802.11g frames transmitted at 11Mb/s" },
{ 25, "Number of unicast 802.11g frames transmitted at 12Mb/s" },
{ 26, "Number of unicast 802.11g frames transmitted at 18Mb/s" },
{ 27, "Number of unicast 802.11g frames transmitted at 24Mb/s" },
{ 28, "Number of unicast 802.11g frames transmitted at 36Mb/s" },
{ 29, "Number of unicast 802.11g frames transmitted at 48Mb/s" },
{ 30, "Number of unicast 802.11g frames transmitted at 54Mb/s" },
{ 31, "Number of multicast frames transmitted" },
{ 32, "Number of multicast 802.11b frames transmitted at 1Mb/s" },
{ 33, "Number of multicast 802.11b frames transmitted at 2Mb/s" },
{ 34, "Number of multicast 802.11b frames transmitted at 5.5Mb/s" },
{ 35, "Number of multicast 802.11b frames transmitted at 11Mb/s" },
{ 44, "Number of multicast 802.11g frames transmitted at 1Mb/s" },
{ 45, "Number of multicast 802.11g frames transmitted at 2Mb/s" },
{ 46, "Number of multicast 802.11g frames transmitted at 5.5Mb/s" },
{ 47, "Number of multicast 802.11g frames transmitted at 6Mb/s" },
{ 48, "Number of multicast 802.11g frames transmitted at 9Mb/s" },
{ 49, "Number of multicast 802.11g frames transmitted at 11Mb/s" },
{ 50, "Number of multicast 802.11g frames transmitted at 12Mb/s" },
{ 51, "Number of multicast 802.11g frames transmitted at 18Mb/s" },
{ 52, "Number of multicast 802.11g frames transmitted at 24Mb/s" },
{ 53, "Number of multicast 802.11g frames transmitted at 36Mb/s" },
{ 54, "Number of multicast 802.11g frames transmitted at 48Mb/s" },
{ 55, "Number of multicast 802.11g frames transmitted at 54Mb/s" },
{ 56, "Number of transmission retries" },
{ 57, "Number of transmission failures" },
{ 58, "Number of CRC errors" },
{ 61, "Number of full scans" },
{ 62, "Number of partial scans" },
{ 64, "Number of bytes transmitted" },
{ 65, "Current RSSI" },
{ 66, "Number of beacons received" },
{ 67, "Number of beacons missed" },
{ -1, NULL }
};
static void
get_statistics(const char *iface)
{
static uint32_t stats[256];
const struct statistic *stat;
char oid[32];
size_t len;
int ifaceno;
if (sscanf(iface, "iwi%u", &ifaceno) != 1)
errx(EX_DATAERR, "Invalid interface name '%s'", iface);
len = sizeof(stats);
(void)snprintf(oid, sizeof(oid), "dev.iwi.%u.stats", ifaceno);
if (sysctlbyname(oid, stats, &len, NULL, 0) == -1)
err(EX_OSERR, "Can't retrieve statistics");
for (stat = tbl; stat->index != -1; stat++)
(void)printf("%-60s[%u]\n", stat->desc, stats[stat->index]);
}
diff --git a/tools/tools/kttcp/kttcp.c b/tools/tools/kttcp/kttcp.c
index 44c6613fa90b..52dc1eff7bc5 100644
--- a/tools/tools/kttcp/kttcp.c
+++ b/tools/tools/kttcp/kttcp.c
@@ -1,307 +1,306 @@
-/* $FreeBSD$ */
/* $NetBSD: kttcp.c,v 1.5 2002/07/11 23:32:35 simonb Exp $ */
/*
* Copyright (c) 2002 Wasabi Systems, Inc.
* All rights reserved.
*
* Written by Frank van der Linden and Jason R. Thorpe
* for Wasabi Systems, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the NetBSD Project by
* Wasabi Systems, Inc.
* 4. The name of Wasabi Systems, Inc. may not be used to endorse
* or promote products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <errno.h>
#include <netdb.h>
#include <unistd.h>
#include <stdio.h>
#include <err.h>
#include <fcntl.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include "kttcpio.h"
#define KTTCP_PORT "22222"
#define KTTCP_XMITSIZE (10*1024*1024)
#define KTTCP_SOCKBUF_DEFAULT 65536
#define KTTCP_DEVICE "/dev/kttcp"
static void
usage(void)
{
fprintf(stderr,
"usage: kttcp -r [-b sockbufsize] [-p port] [-q] [-v]\n"
" [-4] [-6]\n"
" kttcp -t [-b sockbufsize] [-n bytes] [-q] [-v] [-p port]\n"
" [-4] [-6] host\n"
);
exit(1);
}
static unsigned long long
get_bytes(const char *str)
{
unsigned long long bytes;
char *cp;
bytes = strtoull(str, &cp, 10);
if (bytes == ULLONG_MAX && errno == ERANGE)
err(1, "%s", str);
if (cp[0] != '\0') {
if (cp[1] != '\0')
errx(1, "invalid byte count: %s", str);
if (cp[0] == 'k' || cp[0] == 'K')
bytes *= 1024;
else if (cp[0] == 'm' || cp[0] == 'M')
bytes *= 1024 * 1024;
else if (cp[0] == 'g' || cp[0] == 'G')
bytes *= 1024 * 1024 * 1024;
else
errx(1, "invalid byte count modifier: %s", str);
}
return (bytes);
}
int
main(int argc, char *argv[])
{
int c, error, s, verbose, s2, kfd;
int xmitset, family;
int bufsize;
int ai_flag;
char *host;
char *portstr;
struct kttcp_io_args kio;
struct addrinfo hints, *addr, *res;
struct sockaddr_storage ss;
struct rusage rustart, ruend;
struct timeval tvtmp;
unsigned long long ull, usecs, bytespersec, bitspersec, xmitsize;
char connecthost[NI_MAXHOST];
socklen_t slen;
const int one = 1;
u_long cmd;
cmd = 0;
portstr = KTTCP_PORT;
verbose = 1;
xmitset = 0;
bufsize = KTTCP_SOCKBUF_DEFAULT;
xmitsize = KTTCP_XMITSIZE;
family = PF_UNSPEC;
while ((c = getopt(argc, argv, "46b:n:p:qrtvw:")) != -1) {
switch (c) {
case '4':
if (family != PF_UNSPEC)
usage();
family = PF_INET;
break;
case '6':
if (family != PF_UNSPEC)
usage();
family = PF_INET6;
break;
case 'b':
ull = get_bytes(optarg);
if (ull > INT_MAX)
errx(1,
"invalid socket buffer size: %s\n", optarg);
bufsize = ull;
break;
case 'n':
xmitsize = get_bytes(optarg);
xmitset = 1;
break;
case 'p':
portstr = optarg;
break;
case 'q':
verbose = 0;
break;
case 'r':
if (cmd != 0)
usage();
cmd = KTTCP_IO_RECV;
break;
case 't':
if (cmd != 0)
usage();
cmd = KTTCP_IO_SEND;
break;
case 'v':
verbose = 2;
break;
case '?':
default:
usage();
}
}
if (cmd == 0)
usage();
argc -= optind;
argv += optind;
if (cmd == KTTCP_IO_SEND) {
if (xmitsize <= 0 || argc < 1)
usage();
host = argv[0];
ai_flag = 0;
} else {
if (xmitset == 0)
xmitsize = KTTCP_MAX_XMIT;
host = NULL;
ai_flag = AI_PASSIVE;
}
if ((kfd = open(KTTCP_DEVICE, O_RDWR, 666)) == -1)
err(2, "open %s", KTTCP_DEVICE);
memset(&hints, 0, sizeof hints);
hints.ai_flags = ai_flag;
hints.ai_socktype = SOCK_STREAM;
hints.ai_family = family;
error = getaddrinfo(host, portstr, &hints, &addr);
if (error != 0)
errx(2, "%s", gai_strerror(error));
s = -1;
for (res = addr; res != NULL; res = res->ai_next) {
s = socket(res->ai_family, res->ai_socktype, res->ai_protocol);
if (s >= 0)
break;
}
if (res == NULL)
err(2, "can't create socket");
printf("kttcp: socket buffer size: %d\n", bufsize);
if (cmd == KTTCP_IO_SEND) {
if (connect(s, res->ai_addr, res->ai_addrlen) < 0)
err(2, "connect");
if (verbose) {
getnameinfo(res->ai_addr, res->ai_addrlen,
connecthost, sizeof connecthost, NULL, 0,
NI_NUMERICHOST);
printf("kttcp: connected to %s\n", connecthost);
}
if (setsockopt(s, SOL_SOCKET, SO_SNDBUF, &bufsize, sizeof (int))
< 0)
err(2, "setsockopt sndbuf");
kio.kio_socket = s;
} else {
if (setsockopt(s, SOL_SOCKET, SO_REUSEADDR, &one,
sizeof (int)) < 0)
err(2, "setsockopt reuseaddr");
if (bind(s, res->ai_addr, res->ai_addrlen) < 0)
err(2, "bind");
if (listen(s, 1) < 0)
err(2, "listen");
if (verbose)
printf("kttcp: listening on port %s\n", portstr);
slen = sizeof ss;
s2 = accept(s, (struct sockaddr *)&ss, &slen);
if (s2 < 0)
err(2, "accept");
if (verbose) {
getnameinfo((struct sockaddr *)&ss, ss.ss_len,
connecthost, sizeof connecthost, NULL, 0,
NI_NUMERICHOST);
printf("kttcp: connect from %s\n", connecthost);
}
if (setsockopt(s2, SOL_SOCKET, SO_RCVBUF, &bufsize,
sizeof (int)) < 0)
err(2, "setsockopt rcvbuf");
kio.kio_socket = s2;
}
kio.kio_totalsize = xmitsize;
getrusage(RUSAGE_SELF, &rustart);
if (ioctl(kfd, cmd, &kio) == -1)
err(2, "kttcp i/o command");
getrusage(RUSAGE_SELF, &ruend);
usecs = (unsigned long long)kio.kio_elapsed.tv_sec * 1000000;
usecs += kio.kio_elapsed.tv_usec;
bytespersec = kio.kio_bytesdone * 1000000LL / usecs;
bitspersec = bytespersec * NBBY;
printf("kttcp: %llu bytes in %ld.%03ld real seconds ==> %llu bytes/sec\n",
kio.kio_bytesdone, kio.kio_elapsed.tv_sec,
kio.kio_elapsed.tv_usec / 1000, bytespersec);
if (verbose > 1) {
timersub(&ruend.ru_stime, &rustart.ru_stime, &tvtmp);
bytespersec = kio.kio_bytesdone * 1000000LL /
(tvtmp.tv_sec * 1000000ULL + tvtmp.tv_usec);
printf("kttcp: %llu bytes in %ld.%03ld CPU seconds ==> %llu bytes/CPU sec\n",
kio.kio_bytesdone, tvtmp.tv_sec, tvtmp.tv_usec / 1000, bytespersec);
}
printf(" %g (%g) Megabits/sec\n",
((double) bitspersec / 1024.0) / 1024.0,
((double) bitspersec / 1000.0) / 1000.0);
timersub(&ruend.ru_utime, &rustart.ru_utime, &tvtmp);
/* XXX
* sometimes, this ends up as -1 * hz!?
*/
if (tvtmp.tv_sec < 0)
tvtmp.tv_sec = tvtmp.tv_usec = 0;
printf(" %ld.%02lduser", tvtmp.tv_sec, tvtmp.tv_usec / 10000);
ull = tvtmp.tv_sec * 1000000ULL + tvtmp.tv_usec;
timersub(&ruend.ru_stime, &rustart.ru_stime, &tvtmp);
printf(" %ld.%02ldsys", tvtmp.tv_sec, tvtmp.tv_usec / 10000);
ull += tvtmp.tv_sec * 1000000ULL + tvtmp.tv_usec;
printf(" %lld.%lldreal", usecs / 1000000, (usecs % 1000000) / 10000);
printf(" %lld%%", ull * 100 / usecs);
printf("\n");
close(kio.kio_socket);
if (cmd == KTTCP_IO_RECV)
close(s);
close(kfd);
freeaddrinfo(addr);
return 0;
}
diff --git a/tools/tools/kttcp/sys/kttcp.c b/tools/tools/kttcp/sys/kttcp.c
index 09739600feaf..2adca499b4d1 100644
--- a/tools/tools/kttcp/sys/kttcp.c
+++ b/tools/tools/kttcp/sys/kttcp.c
@@ -1,274 +1,273 @@
-/* $FreeBSD$ */
/* $NetBSD: kttcp.c,v 1.3 2002/07/03 19:36:52 thorpej Exp $ */
/*
* Copyright (c) 2002 Wasabi Systems, Inc.
* All rights reserved.
*
* Written by Frank van der Linden and Jason R. Thorpe for
* Wasabi Systems, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the NetBSD Project by
* Wasabi Systems, Inc.
* 4. The name of Wasabi Systems, Inc. may not be used to endorse
* or promote products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* kttcp.c --
*
* This module provides kernel support for testing network
* throughput from the perspective of the kernel. It is
* similar in spirit to the classic ttcp network benchmark
* program, the main difference being that with kttcp, the
* kernel is the source and sink of the data.
*
* Testing like this is useful for a few reasons:
*
* 1. This allows us to know what kind of performance we can
* expect from network applications that run in the kernel
* space, such as the NFS server or the NFS client. These
* applications don't have to move the data to/from userspace,
* and so benchmark programs which run in userspace don't
* give us an accurate model.
*
* 2. Since data received is just thrown away, the receiver
* is very fast. This can provide better exercise for the
* sender at the other end.
*
* 3. Since the NetBSD kernel currently uses a run-to-completion
* scheduling model, kttcp provides a benchmark model where
* preemption of the benchmark program is not an issue.
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/malloc.h>
#include <sys/mbuf.h>
#include <sys/sysctl.h>
#include <sys/file.h>
#include <sys/filedesc.h>
#include <sys/errno.h>
#include <sys/uio.h>
#include <sys/conf.h>
#include <sys/kernel.h>
#include <sys/fcntl.h>
#include <sys/protosw.h>
#include <sys/socketvar.h>
#include <sys/socket.h>
#include <sys/mbuf.h>
#include <sys/resourcevar.h>
#include <sys/proc.h>
#include <sys/module.h>
#include "kttcpio.h"
#ifndef timersub
#define timersub(tvp, uvp, vvp) \
do { \
(vvp)->tv_sec = (tvp)->tv_sec - (uvp)->tv_sec; \
(vvp)->tv_usec = (tvp)->tv_usec - (uvp)->tv_usec; \
if ((vvp)->tv_usec < 0) { \
(vvp)->tv_sec--; \
(vvp)->tv_usec += 1000000; \
} \
} while (0)
#endif
static int kttcp_send(struct thread *p, struct kttcp_io_args *);
static int kttcp_recv(struct thread *p, struct kttcp_io_args *);
static d_open_t kttcpopen;
static d_ioctl_t kttcpioctl;
static struct cdevsw kttcp_cdevsw = {
.d_open = kttcpopen,
.d_ioctl = kttcpioctl,
.d_name = "kttcp",
.d_maj = MAJOR_AUTO,
.d_version = D_VERSION,
};
static int
kttcpopen(struct cdev *dev, int flag, int mode, struct thread *td)
{
/* Always succeeds. */
return (0);
}
static int
kttcpioctl(struct cdev *dev, u_long cmd, caddr_t data, int flag, struct thread *td)
{
int error;
if ((flag & FWRITE) == 0)
return EPERM;
switch (cmd) {
case KTTCP_IO_SEND:
error = kttcp_send(td, (struct kttcp_io_args *) data);
break;
case KTTCP_IO_RECV:
error = kttcp_recv(td, (struct kttcp_io_args *) data);
break;
default:
return EINVAL;
}
return error;
}
static int nbyte = 65536;
static int
kttcp_send(struct thread *td, struct kttcp_io_args *kio)
{
struct file *fp;
int error;
struct timeval t0, t1;
unsigned long long len = 0;
struct uio auio;
struct iovec aiov;
bzero(&aiov, sizeof(aiov));
bzero(&auio, sizeof(auio));
auio.uio_iov = &aiov;
auio.uio_segflg = UIO_NOCOPY;
error = fget(td, kio->kio_socket, &fp);
if (error != 0)
return error;
if ((fp->f_flag & FWRITE) == 0) {
fdrop(fp, td);
return EBADF;
}
if (fp->f_type == DTYPE_SOCKET) {
len = kio->kio_totalsize;
microtime(&t0);
do {
nbyte = MIN(len, (unsigned long long)nbyte);
aiov.iov_len = nbyte;
auio.uio_resid = nbyte;
auio.uio_offset = 0;
error = sosend((struct socket *)fp->f_data, NULL,
&auio, NULL, NULL, 0, td);
len -= auio.uio_offset;
} while (error == 0 && len != 0);
microtime(&t1);
} else
error = EFTYPE;
fdrop(fp, td);
if (error != 0)
return error;
timersub(&t1, &t0, &kio->kio_elapsed);
kio->kio_bytesdone = kio->kio_totalsize - len;
return 0;
}
static int
kttcp_recv(struct thread *td, struct kttcp_io_args *kio)
{
struct file *fp;
int error;
struct timeval t0, t1;
unsigned long long len = 0;
struct uio auio;
struct iovec aiov;
bzero(&aiov, sizeof(aiov));
bzero(&auio, sizeof(auio));
auio.uio_iov = &aiov;
auio.uio_segflg = UIO_NOCOPY;
error = fget(td, kio->kio_socket, &fp);
if (error != 0)
return error;
if ((fp->f_flag & FWRITE) == 0) {
fdrop(fp, td);
return EBADF;
}
if (fp->f_type == DTYPE_SOCKET) {
len = kio->kio_totalsize;
microtime(&t0);
do {
nbyte = MIN(len, (unsigned long long)nbyte);
aiov.iov_len = nbyte;
auio.uio_resid = nbyte;
auio.uio_offset = 0;
error = soreceive((struct socket *)fp->f_data,
NULL, &auio, NULL, NULL, NULL);
len -= auio.uio_offset;
} while (error == 0 && len > 0 && auio.uio_offset != 0);
microtime(&t1);
if (error == EPIPE)
error = 0;
} else
error = EFTYPE;
fdrop(fp, td);
if (error != 0)
return error;
timersub(&t1, &t0, &kio->kio_elapsed);
kio->kio_bytesdone = kio->kio_totalsize - len;
return 0;
}
static struct cdev *kttcp_dev;
/*
* Initialization code, both for static and dynamic loading.
*/
static int
kttcpdev_modevent(module_t mod, int type, void *unused)
{
switch (type) {
case MOD_LOAD:
kttcp_dev = make_dev(&kttcp_cdevsw, 0,
UID_ROOT, GID_WHEEL, 0666,
"kttcp");
return 0;
case MOD_UNLOAD:
/*XXX disallow if active sessions */
destroy_dev(kttcp_dev);
return 0;
}
return EINVAL;
}
static moduledata_t kttcpdev_mod = {
"kttcpdev",
kttcpdev_modevent,
0
};
MODULE_VERSION(kttcpdev, 1);
DECLARE_MODULE(kttcpdev, kttcpdev_mod, SI_SUB_PSEUDO, SI_ORDER_ANY);
diff --git a/tools/tools/kttcp/sys/kttcpio.h b/tools/tools/kttcp/sys/kttcpio.h
index 1375f6ef6c9d..6b0756528a27 100644
--- a/tools/tools/kttcp/sys/kttcpio.h
+++ b/tools/tools/kttcp/sys/kttcpio.h
@@ -1,59 +1,58 @@
-/* $FreeBSD$ */
/* $NetBSD$ */
/*
* Copyright (c) 2002 Wasabi Systems, Inc.
* All rights reserved.
*
* Written by Frank van der Linden and Jason R. Thorpe for
* Wasabi Systems, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the NetBSD Project by
* Wasabi Systems, Inc.
* 4. The name of Wasabi Systems, Inc. may not be used to endorse
* or promote products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifndef _DEV_KTTCPIO_H_
#define _DEV_KTTCPIO_H_
#include <sys/ioccom.h>
#include <sys/time.h>
struct kttcp_io_args {
unsigned long long kio_totalsize;/* i/o total size (IN) */
unsigned long long kio_bytesdone;/* i/o actually completed (OUT) */
struct timeval kio_elapsed; /* elapsed time (OUT) */
int kio_socket; /* socket to use for i/o (IN) */
int kio_protovers; /* KTTCP protocol version */
};
#define KTTCP_IO_SEND _IOWR('K', 0, struct kttcp_io_args)
#define KTTCP_IO_RECV _IOWR('K', 1, struct kttcp_io_args)
#define KTTCP_MAX_XMIT 0x7fffffffLL /* XXX can't handle > 31 bits */
#endif /* _DEV_KTTCPIO_H_ */
diff --git a/tools/tools/mctest/mctest.h b/tools/tools/mctest/mctest.h
index 955464c8795a..019b8b5efef7 100644
--- a/tools/tools/mctest/mctest.h
+++ b/tools/tools/mctest/mctest.h
@@ -1,33 +1,32 @@
//
// Copyright (c) 2008, George V. Neville-Neil
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
// OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// 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
// SUCH DAMAGE.
//
//
-// $FreeBSD$
//
const char* DEFAULT_GROUP = "239.255.255.1";
const int SERVER_PORT = 9999;
const int DEFAULT_PORT = 6666;
const int TIMEOUT = 10;
diff --git a/tools/tools/ncpus/ncpus.c b/tools/tools/ncpus/ncpus.c
index 0f4498f095ba..85023e11c696 100644
--- a/tools/tools/ncpus/ncpus.c
+++ b/tools/tools/ncpus/ncpus.c
@@ -1,16 +1,15 @@
-/* $FreeBSD$ */
#include <stdio.h>
extern int acpi_detect(void);
extern int biosmptable_detect(void);
int
main(void)
{
printf("acpi: %d\n", acpi_detect());
#if defined(__amd64__) || defined(__i386__)
printf("mptable: %d\n", biosmptable_detect());
#endif
return 0;
}
diff --git a/tools/tools/netmap/ctrs.h b/tools/tools/netmap/ctrs.h
index eb4c4c9d4bfd..29e054442db0 100644
--- a/tools/tools/netmap/ctrs.h
+++ b/tools/tools/netmap/ctrs.h
@@ -1,116 +1,115 @@
#ifndef CTRS_H_
#define CTRS_H_
-/* $FreeBSD$ */
#include <sys/time.h>
/* counters to accumulate statistics */
struct my_ctrs {
uint64_t pkts, bytes, events;
uint64_t drop, drop_bytes;
uint64_t min_space;
struct timeval t;
uint32_t oq_n; /* number of elements in overflow queue (used in lb) */
};
/* very crude code to print a number in normalized form.
* Caller has to make sure that the buffer is large enough.
*/
static const char *
norm2(char *buf, double val, const char *fmt, int normalize)
{
const char *units[] = { "", "K", "M", "G", "T" };
u_int i;
if (normalize)
for (i = 0; val >=1000 && i < sizeof(units)/sizeof(const char *) - 1; i++)
val /= 1000;
else
i=0;
sprintf(buf, fmt, val, units[i]);
return buf;
}
static __inline const char *
norm(char *buf, double val, int normalize)
{
if (normalize)
return norm2(buf, val, "%.3f %s", normalize);
else
return norm2(buf, val, "%.0f %s", normalize);
}
static __inline int
timespec_ge(const struct timespec *a, const struct timespec *b)
{
if (a->tv_sec > b->tv_sec)
return (1);
if (a->tv_sec < b->tv_sec)
return (0);
if (a->tv_nsec >= b->tv_nsec)
return (1);
return (0);
}
static __inline struct timespec
timeval2spec(const struct timeval *a)
{
struct timespec ts = {
.tv_sec = a->tv_sec,
.tv_nsec = a->tv_usec * 1000
};
return ts;
}
static __inline struct timeval
timespec2val(const struct timespec *a)
{
struct timeval tv = {
.tv_sec = a->tv_sec,
.tv_usec = a->tv_nsec / 1000
};
return tv;
}
static __inline struct timespec
timespec_add(struct timespec a, struct timespec b)
{
struct timespec ret = { a.tv_sec + b.tv_sec, a.tv_nsec + b.tv_nsec };
if (ret.tv_nsec >= 1000000000) {
ret.tv_sec++;
ret.tv_nsec -= 1000000000;
}
return ret;
}
static __inline struct timespec
timespec_sub(struct timespec a, struct timespec b)
{
struct timespec ret = { a.tv_sec - b.tv_sec, a.tv_nsec - b.tv_nsec };
if (ret.tv_nsec < 0) {
ret.tv_sec--;
ret.tv_nsec += 1000000000;
}
return ret;
}
static __inline uint64_t
wait_for_next_report(struct timeval *prev, struct timeval *cur,
int report_interval)
{
struct timeval delta;
delta.tv_sec = report_interval/1000;
delta.tv_usec = (report_interval%1000)*1000;
if (select(0, NULL, NULL, NULL, &delta) < 0 && errno != EINTR) {
perror("select");
abort();
}
gettimeofday(cur, NULL);
timersub(cur, prev, &delta);
return delta.tv_sec* 1000000 + delta.tv_usec;
}
#endif /* CTRS_H_ */
diff --git a/tools/tools/netmap/lb.c b/tools/tools/netmap/lb.c
index 66d7aab8f6e1..b45e5274553c 100644
--- a/tools/tools/netmap/lb.c
+++ b/tools/tools/netmap/lb.c
@@ -1,1094 +1,1093 @@
/*
* Copyright (C) 2017 Corelight, Inc. and Universita` di Pisa. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <ctype.h>
#include <errno.h>
#include <inttypes.h>
#include <libnetmap.h>
#include <netinet/in.h> /* htonl */
#include <pthread.h>
#include <signal.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <sys/ioctl.h>
#include <sys/poll.h>
#include <unistd.h>
#include "pkt_hash.h"
#include "ctrs.h"
/*
* use our version of header structs, rather than bringing in a ton
* of platform specific ones
*/
#ifndef ETH_ALEN
#define ETH_ALEN 6
#endif
struct compact_eth_hdr {
unsigned char h_dest[ETH_ALEN];
unsigned char h_source[ETH_ALEN];
u_int16_t h_proto;
};
struct compact_ip_hdr {
u_int8_t ihl:4, version:4;
u_int8_t tos;
u_int16_t tot_len;
u_int16_t id;
u_int16_t frag_off;
u_int8_t ttl;
u_int8_t protocol;
u_int16_t check;
u_int32_t saddr;
u_int32_t daddr;
};
struct compact_ipv6_hdr {
u_int8_t priority:4, version:4;
u_int8_t flow_lbl[3];
u_int16_t payload_len;
u_int8_t nexthdr;
u_int8_t hop_limit;
struct in6_addr saddr;
struct in6_addr daddr;
};
#define MAX_IFNAMELEN 64
#define MAX_PORTNAMELEN (MAX_IFNAMELEN + 40)
#define DEF_OUT_PIPES 2
#define DEF_EXTRA_BUFS 0
#define DEF_BATCH 2048
#define DEF_WAIT_LINK 2
#define DEF_STATS_INT 600
#define BUF_REVOKE 150
#define STAT_MSG_MAXSIZE 1024
static struct {
char ifname[MAX_IFNAMELEN + 1];
char base_name[MAX_IFNAMELEN + 1];
int netmap_fd;
uint16_t output_rings;
uint16_t num_groups;
uint32_t extra_bufs;
uint16_t batch;
int stdout_interval;
int syslog_interval;
int wait_link;
bool busy_wait;
} glob_arg;
/*
* the overflow queue is a circular queue of buffers
*/
struct overflow_queue {
char name[MAX_IFNAMELEN + 16];
struct netmap_slot *slots;
uint32_t head;
uint32_t tail;
uint32_t n;
uint32_t size;
};
static struct overflow_queue *freeq;
static inline int
oq_full(struct overflow_queue *q)
{
return q->n >= q->size;
}
static inline int
oq_empty(struct overflow_queue *q)
{
return q->n <= 0;
}
static inline void
oq_enq(struct overflow_queue *q, const struct netmap_slot *s)
{
if (unlikely(oq_full(q))) {
D("%s: queue full!", q->name);
abort();
}
q->slots[q->tail] = *s;
q->n++;
q->tail++;
if (q->tail >= q->size)
q->tail = 0;
}
static inline struct netmap_slot
oq_deq(struct overflow_queue *q)
{
struct netmap_slot s = q->slots[q->head];
if (unlikely(oq_empty(q))) {
D("%s: queue empty!", q->name);
abort();
}
q->n--;
q->head++;
if (q->head >= q->size)
q->head = 0;
return s;
}
static volatile int do_abort = 0;
static uint64_t dropped = 0;
static uint64_t forwarded = 0;
static uint64_t received_bytes = 0;
static uint64_t received_pkts = 0;
static uint64_t non_ip = 0;
static uint32_t freeq_n = 0;
struct port_des {
char interface[MAX_PORTNAMELEN];
struct my_ctrs ctr;
unsigned int last_sync;
uint32_t last_tail;
struct overflow_queue *oq;
struct nmport_d *nmd;
struct netmap_ring *ring;
struct group_des *group;
};
static struct port_des *ports;
/* each group of pipes receives all the packets */
struct group_des {
char pipename[MAX_IFNAMELEN];
struct port_des *ports;
int first_id;
int nports;
int last;
int custom_port;
};
static struct group_des *groups;
/* statistcs */
struct counters {
struct timeval ts;
struct my_ctrs *ctrs;
uint64_t received_pkts;
uint64_t received_bytes;
uint64_t non_ip;
uint32_t freeq_n;
int status __attribute__((aligned(64)));
#define COUNTERS_EMPTY 0
#define COUNTERS_FULL 1
};
static struct counters counters_buf;
static void *
print_stats(void *arg)
{
int npipes = glob_arg.output_rings;
int sys_int = 0;
(void)arg;
struct my_ctrs cur, prev;
struct my_ctrs *pipe_prev;
pipe_prev = calloc(npipes, sizeof(struct my_ctrs));
if (pipe_prev == NULL) {
D("out of memory");
exit(1);
}
char stat_msg[STAT_MSG_MAXSIZE] = "";
memset(&prev, 0, sizeof(prev));
while (!do_abort) {
int j, dosyslog = 0, dostdout = 0, newdata;
uint64_t pps = 0, dps = 0, bps = 0, dbps = 0, usec = 0;
struct my_ctrs x;
counters_buf.status = COUNTERS_EMPTY;
newdata = 0;
memset(&cur, 0, sizeof(cur));
sleep(1);
if (counters_buf.status == COUNTERS_FULL) {
__sync_synchronize();
newdata = 1;
cur.t = counters_buf.ts;
if (prev.t.tv_sec || prev.t.tv_usec) {
usec = (cur.t.tv_sec - prev.t.tv_sec) * 1000000 +
cur.t.tv_usec - prev.t.tv_usec;
}
}
++sys_int;
if (glob_arg.stdout_interval && sys_int % glob_arg.stdout_interval == 0)
dostdout = 1;
if (glob_arg.syslog_interval && sys_int % glob_arg.syslog_interval == 0)
dosyslog = 1;
for (j = 0; j < npipes; ++j) {
struct my_ctrs *c = &counters_buf.ctrs[j];
cur.pkts += c->pkts;
cur.drop += c->drop;
cur.drop_bytes += c->drop_bytes;
cur.bytes += c->bytes;
if (usec) {
x.pkts = c->pkts - pipe_prev[j].pkts;
x.drop = c->drop - pipe_prev[j].drop;
x.bytes = c->bytes - pipe_prev[j].bytes;
x.drop_bytes = c->drop_bytes - pipe_prev[j].drop_bytes;
pps = (x.pkts*1000000 + usec/2) / usec;
dps = (x.drop*1000000 + usec/2) / usec;
bps = ((x.bytes*1000000 + usec/2) / usec) * 8;
dbps = ((x.drop_bytes*1000000 + usec/2) / usec) * 8;
}
pipe_prev[j] = *c;
if ( (dosyslog || dostdout) && newdata )
snprintf(stat_msg, STAT_MSG_MAXSIZE,
"{"
"\"ts\":%.6f,"
"\"interface\":\"%s\","
"\"output_ring\":%" PRIu16 ","
"\"packets_forwarded\":%" PRIu64 ","
"\"packets_dropped\":%" PRIu64 ","
"\"data_forward_rate_Mbps\":%.4f,"
"\"data_drop_rate_Mbps\":%.4f,"
"\"packet_forward_rate_kpps\":%.4f,"
"\"packet_drop_rate_kpps\":%.4f,"
"\"overflow_queue_size\":%" PRIu32
"}", cur.t.tv_sec + (cur.t.tv_usec / 1000000.0),
ports[j].interface,
j,
c->pkts,
c->drop,
(double)bps / 1024 / 1024,
(double)dbps / 1024 / 1024,
(double)pps / 1000,
(double)dps / 1000,
c->oq_n);
if (dosyslog && stat_msg[0])
syslog(LOG_INFO, "%s", stat_msg);
if (dostdout && stat_msg[0])
printf("%s\n", stat_msg);
}
if (usec) {
x.pkts = cur.pkts - prev.pkts;
x.drop = cur.drop - prev.drop;
x.bytes = cur.bytes - prev.bytes;
x.drop_bytes = cur.drop_bytes - prev.drop_bytes;
pps = (x.pkts*1000000 + usec/2) / usec;
dps = (x.drop*1000000 + usec/2) / usec;
bps = ((x.bytes*1000000 + usec/2) / usec) * 8;
dbps = ((x.drop_bytes*1000000 + usec/2) / usec) * 8;
}
if ( (dosyslog || dostdout) && newdata )
snprintf(stat_msg, STAT_MSG_MAXSIZE,
"{"
"\"ts\":%.6f,"
"\"interface\":\"%s\","
"\"output_ring\":null,"
"\"packets_received\":%" PRIu64 ","
"\"packets_forwarded\":%" PRIu64 ","
"\"packets_dropped\":%" PRIu64 ","
"\"non_ip_packets\":%" PRIu64 ","
"\"data_forward_rate_Mbps\":%.4f,"
"\"data_drop_rate_Mbps\":%.4f,"
"\"packet_forward_rate_kpps\":%.4f,"
"\"packet_drop_rate_kpps\":%.4f,"
"\"free_buffer_slots\":%" PRIu32
"}", cur.t.tv_sec + (cur.t.tv_usec / 1000000.0),
glob_arg.ifname,
received_pkts,
cur.pkts,
cur.drop,
counters_buf.non_ip,
(double)bps / 1024 / 1024,
(double)dbps / 1024 / 1024,
(double)pps / 1000,
(double)dps / 1000,
counters_buf.freeq_n);
if (dosyslog && stat_msg[0])
syslog(LOG_INFO, "%s", stat_msg);
if (dostdout && stat_msg[0])
printf("%s\n", stat_msg);
prev = cur;
}
free(pipe_prev);
return NULL;
}
static void
free_buffers(void)
{
int i, tot = 0;
struct port_des *rxport = &ports[glob_arg.output_rings];
/* build a netmap free list with the buffers in all the overflow queues */
for (i = 0; i < glob_arg.output_rings + 1; i++) {
struct port_des *cp = &ports[i];
struct overflow_queue *q = cp->oq;
if (!q)
continue;
while (q->n) {
struct netmap_slot s = oq_deq(q);
uint32_t *b = (uint32_t *)NETMAP_BUF(cp->ring, s.buf_idx);
*b = rxport->nmd->nifp->ni_bufs_head;
rxport->nmd->nifp->ni_bufs_head = s.buf_idx;
tot++;
}
}
D("added %d buffers to netmap free list", tot);
for (i = 0; i < glob_arg.output_rings + 1; ++i) {
nmport_close(ports[i].nmd);
}
}
static void sigint_h(int sig)
{
(void)sig; /* UNUSED */
do_abort = 1;
signal(SIGINT, SIG_DFL);
}
static void
usage(void)
{
printf("usage: lb [options]\n");
printf("where options are:\n");
printf(" -h view help text\n");
printf(" -i iface interface name (required)\n");
printf(" -p [prefix:]npipes add a new group of output pipes\n");
printf(" -B nbufs number of extra buffers (default: %d)\n", DEF_EXTRA_BUFS);
printf(" -b batch batch size (default: %d)\n", DEF_BATCH);
printf(" -w seconds wait for link up (default: %d)\n", DEF_WAIT_LINK);
printf(" -W enable busy waiting. this will run your CPU at 100%%\n");
printf(" -s seconds seconds between syslog stats messages (default: 0)\n");
printf(" -o seconds seconds between stdout stats messages (default: 0)\n");
exit(0);
}
static int
parse_pipes(const char *spec)
{
const char *end = index(spec, ':');
static int max_groups = 0;
struct group_des *g;
ND("spec %s num_groups %d", spec, glob_arg.num_groups);
if (max_groups < glob_arg.num_groups + 1) {
size_t size = sizeof(*g) * (glob_arg.num_groups + 1);
groups = realloc(groups, size);
if (groups == NULL) {
D("out of memory");
return 1;
}
}
g = &groups[glob_arg.num_groups];
memset(g, 0, sizeof(*g));
if (end != NULL) {
if (end - spec > MAX_IFNAMELEN - 8) {
D("name '%s' too long", spec);
return 1;
}
if (end == spec) {
D("missing prefix before ':' in '%s'", spec);
return 1;
}
strncpy(g->pipename, spec, end - spec);
g->custom_port = 1;
end++;
} else {
/* no prefix, this group will use the
* name of the input port.
* This will be set in init_groups(),
* since here the input port may still
* be uninitialized
*/
end = spec;
}
if (*end == '\0') {
g->nports = DEF_OUT_PIPES;
} else {
g->nports = atoi(end);
if (g->nports < 1) {
D("invalid number of pipes '%s' (must be at least 1)", end);
return 1;
}
}
glob_arg.output_rings += g->nports;
glob_arg.num_groups++;
return 0;
}
/* complete the initialization of the groups data structure */
static void
init_groups(void)
{
int i, j, t = 0;
struct group_des *g = NULL;
for (i = 0; i < glob_arg.num_groups; i++) {
g = &groups[i];
g->ports = &ports[t];
for (j = 0; j < g->nports; j++)
g->ports[j].group = g;
t += g->nports;
if (!g->custom_port)
strcpy(g->pipename, glob_arg.base_name);
for (j = 0; j < i; j++) {
struct group_des *h = &groups[j];
if (!strcmp(h->pipename, g->pipename))
g->first_id += h->nports;
}
}
g->last = 1;
}
/* To support packets that span multiple slots (NS_MOREFRAG) we
* need to make sure of the following:
*
* - all fragments of the same packet must go to the same output pipe
* - when dropping, all fragments of the same packet must be dropped
*
* For the former point we remember and reuse the last hash computed
* in each input ring, and only update it when NS_MOREFRAG was not
* set in the last received slot (this marks the start of a new packet).
*
* For the latter point, we only update the output ring head pointer
* when an entire packet has been forwarded. We keep a shadow_head
* pointer to know where to put the next partial fragment and,
* when the need to drop arises, we roll it back to head.
*/
struct morefrag {
uint16_t last_flag; /* for input rings */
uint32_t last_hash; /* for input rings */
uint32_t shadow_head; /* for output rings */
};
/* push the packet described by slot rs to the group g.
* This may cause other buffers to be pushed down the
* chain headed by g.
* Return a free buffer.
*/
static uint32_t
forward_packet(struct group_des *g, struct netmap_slot *rs)
{
uint32_t hash = rs->ptr;
uint32_t output_port = hash % g->nports;
struct port_des *port = &g->ports[output_port];
struct netmap_ring *ring = port->ring;
struct overflow_queue *q = port->oq;
struct morefrag *mf = (struct morefrag *)ring->sem;
uint16_t curmf = rs->flags & NS_MOREFRAG;
/* Move the packet to the output pipe, unless there is
* either no space left on the ring, or there is some
* packet still in the overflow queue (since those must
* take precedence over the new one)
*/
if (mf->shadow_head != ring->tail && (q == NULL || oq_empty(q))) {
struct netmap_slot *ts = &ring->slot[mf->shadow_head];
struct netmap_slot old_slot = *ts;
ts->buf_idx = rs->buf_idx;
ts->len = rs->len;
ts->flags = rs->flags | NS_BUF_CHANGED;
ts->ptr = rs->ptr;
mf->shadow_head = nm_ring_next(ring, mf->shadow_head);
if (!curmf) {
ring->head = mf->shadow_head;
}
ND("curmf %2x ts->flags %2x shadow_head %3u head %3u tail %3u",
curmf, ts->flags, mf->shadow_head, ring->head, ring->tail);
port->ctr.bytes += rs->len;
port->ctr.pkts++;
forwarded++;
return old_slot.buf_idx;
}
/* use the overflow queue, if available */
if (q == NULL || oq_full(q)) {
uint32_t scan;
/* no space left on the ring and no overflow queue
* available: we are forced to drop the packet
*/
/* drop previous fragments, if any */
for (scan = ring->head; scan != mf->shadow_head;
scan = nm_ring_next(ring, scan)) {
struct netmap_slot *ts = &ring->slot[scan];
dropped++;
port->ctr.drop_bytes += ts->len;
}
mf->shadow_head = ring->head;
dropped++;
port->ctr.drop++;
port->ctr.drop_bytes += rs->len;
return rs->buf_idx;
}
oq_enq(q, rs);
/*
* we cannot continue down the chain and we need to
* return a free buffer now. We take it from the free queue.
*/
if (oq_empty(freeq)) {
/* the free queue is empty. Revoke some buffers
* from the longest overflow queue
*/
uint32_t j;
struct port_des *lp = &ports[0];
uint32_t max = lp->oq->n;
/* let lp point to the port with the longest queue */
for (j = 1; j < glob_arg.output_rings; j++) {
struct port_des *cp = &ports[j];
if (cp->oq->n > max) {
lp = cp;
max = cp->oq->n;
}
}
/* move the oldest BUF_REVOKE buffers from the
* lp queue to the free queue
*
* We cannot revoke a partially received packet.
* To make thinks simple we make sure to leave
* at least NETMAP_MAX_FRAGS slots in the queue.
*/
for (j = 0; lp->oq->n > NETMAP_MAX_FRAGS && j < BUF_REVOKE; j++) {
struct netmap_slot tmp = oq_deq(lp->oq);
dropped++;
lp->ctr.drop++;
lp->ctr.drop_bytes += tmp.len;
oq_enq(freeq, &tmp);
}
ND(1, "revoked %d buffers from %s", j, lq->name);
}
return oq_deq(freeq).buf_idx;
}
int main(int argc, char **argv)
{
int ch;
uint32_t i;
int rv;
int poll_timeout = 10; /* default */
glob_arg.ifname[0] = '\0';
glob_arg.output_rings = 0;
glob_arg.batch = DEF_BATCH;
glob_arg.wait_link = DEF_WAIT_LINK;
glob_arg.busy_wait = false;
glob_arg.syslog_interval = 0;
glob_arg.stdout_interval = 0;
while ( (ch = getopt(argc, argv, "hi:p:b:B:s:o:w:W")) != -1) {
switch (ch) {
case 'i':
D("interface is %s", optarg);
if (strlen(optarg) > MAX_IFNAMELEN - 8) {
D("ifname too long %s", optarg);
return 1;
}
if (strncmp(optarg, "netmap:", 7) && strncmp(optarg, "vale", 4)) {
sprintf(glob_arg.ifname, "netmap:%s", optarg);
} else {
strcpy(glob_arg.ifname, optarg);
}
break;
case 'p':
if (parse_pipes(optarg)) {
usage();
return 1;
}
break;
case 'B':
glob_arg.extra_bufs = atoi(optarg);
D("requested %d extra buffers", glob_arg.extra_bufs);
break;
case 'b':
glob_arg.batch = atoi(optarg);
D("batch is %d", glob_arg.batch);
break;
case 'w':
glob_arg.wait_link = atoi(optarg);
D("link wait for up time is %d", glob_arg.wait_link);
break;
case 'W':
glob_arg.busy_wait = true;
break;
case 'o':
glob_arg.stdout_interval = atoi(optarg);
break;
case 's':
glob_arg.syslog_interval = atoi(optarg);
break;
case 'h':
usage();
return 0;
break;
default:
D("bad option %c %s", ch, optarg);
usage();
return 1;
}
}
if (glob_arg.ifname[0] == '\0') {
D("missing interface name");
usage();
return 1;
}
if (glob_arg.num_groups == 0)
parse_pipes("");
if (glob_arg.syslog_interval) {
setlogmask(LOG_UPTO(LOG_INFO));
openlog("lb", LOG_CONS | LOG_PID | LOG_NDELAY, LOG_LOCAL1);
}
uint32_t npipes = glob_arg.output_rings;
pthread_t stat_thread;
ports = calloc(npipes + 1, sizeof(struct port_des));
if (!ports) {
D("failed to allocate the stats array");
return 1;
}
struct port_des *rxport = &ports[npipes];
rxport->nmd = nmport_prepare(glob_arg.ifname);
if (rxport->nmd == NULL) {
D("cannot parse %s", glob_arg.ifname);
return (1);
}
/* extract the base name */
strncpy(glob_arg.base_name, rxport->nmd->hdr.nr_name, MAX_IFNAMELEN);
init_groups();
memset(&counters_buf, 0, sizeof(counters_buf));
counters_buf.ctrs = calloc(npipes, sizeof(struct my_ctrs));
if (!counters_buf.ctrs) {
D("failed to allocate the counters snapshot buffer");
return 1;
}
rxport->nmd->reg.nr_extra_bufs = glob_arg.extra_bufs;
if (nmport_open_desc(rxport->nmd) < 0) {
D("cannot open %s", glob_arg.ifname);
return (1);
}
D("successfully opened %s", glob_arg.ifname);
uint32_t extra_bufs = rxport->nmd->reg.nr_extra_bufs;
struct overflow_queue *oq = NULL;
/* reference ring to access the buffers */
rxport->ring = NETMAP_RXRING(rxport->nmd->nifp, 0);
if (!glob_arg.extra_bufs)
goto run;
D("obtained %d extra buffers", extra_bufs);
if (!extra_bufs)
goto run;
/* one overflow queue for each output pipe, plus one for the
* free extra buffers
*/
oq = calloc(npipes + 1, sizeof(struct overflow_queue));
if (!oq) {
D("failed to allocated overflow queues descriptors");
goto run;
}
freeq = &oq[npipes];
rxport->oq = freeq;
freeq->slots = calloc(extra_bufs, sizeof(struct netmap_slot));
if (!freeq->slots) {
D("failed to allocate the free list");
}
freeq->size = extra_bufs;
snprintf(freeq->name, MAX_IFNAMELEN, "free queue");
/*
* the list of buffers uses the first uint32_t in each buffer
* as the index of the next buffer.
*/
uint32_t scan;
for (scan = rxport->nmd->nifp->ni_bufs_head;
scan;
scan = *(uint32_t *)NETMAP_BUF(rxport->ring, scan))
{
struct netmap_slot s;
s.len = s.flags = 0;
s.ptr = 0;
s.buf_idx = scan;
ND("freeq <- %d", s.buf_idx);
oq_enq(freeq, &s);
}
if (freeq->n != extra_bufs) {
D("something went wrong: netmap reported %d extra_bufs, but the free list contained %d",
extra_bufs, freeq->n);
return 1;
}
rxport->nmd->nifp->ni_bufs_head = 0;
run:
atexit(free_buffers);
int j, t = 0;
for (j = 0; j < glob_arg.num_groups; j++) {
struct group_des *g = &groups[j];
int k;
for (k = 0; k < g->nports; ++k) {
struct port_des *p = &g->ports[k];
snprintf(p->interface, MAX_PORTNAMELEN, "%s%s{%d/xT@%d",
(strncmp(g->pipename, "vale", 4) ? "netmap:" : ""),
g->pipename, g->first_id + k,
rxport->nmd->reg.nr_mem_id);
D("opening pipe named %s", p->interface);
p->nmd = nmport_open(p->interface);
if (p->nmd == NULL) {
D("cannot open %s", p->interface);
return (1);
} else if (p->nmd->mem != rxport->nmd->mem) {
D("failed to open pipe #%d in zero-copy mode, "
"please close any application that uses either pipe %s}%d, "
"or %s{%d, and retry",
k + 1, g->pipename, g->first_id + k, g->pipename, g->first_id + k);
return (1);
} else {
struct morefrag *mf;
D("successfully opened pipe #%d %s (tx slots: %d)",
k + 1, p->interface, p->nmd->reg.nr_tx_slots);
p->ring = NETMAP_TXRING(p->nmd->nifp, 0);
p->last_tail = nm_ring_next(p->ring, p->ring->tail);
mf = (struct morefrag *)p->ring->sem;
mf->last_flag = 0; /* unused */
mf->last_hash = 0; /* unused */
mf->shadow_head = p->ring->head;
}
D("zerocopy %s",
(rxport->nmd->mem == p->nmd->mem) ? "enabled" : "disabled");
if (extra_bufs) {
struct overflow_queue *q = &oq[t + k];
q->slots = calloc(extra_bufs, sizeof(struct netmap_slot));
if (!q->slots) {
D("failed to allocate overflow queue for pipe %d", k);
/* make all overflow queue management fail */
extra_bufs = 0;
}
q->size = extra_bufs;
snprintf(q->name, sizeof(q->name), "oq %s{%4d", g->pipename, k);
p->oq = q;
}
}
t += g->nports;
}
if (glob_arg.extra_bufs && !extra_bufs) {
if (oq) {
for (i = 0; i < npipes + 1; i++) {
free(oq[i].slots);
oq[i].slots = NULL;
}
free(oq);
oq = NULL;
}
D("*** overflow queues disabled ***");
}
sleep(glob_arg.wait_link);
/* start stats thread after wait_link */
if (pthread_create(&stat_thread, NULL, print_stats, NULL) == -1) {
D("unable to create the stats thread: %s", strerror(errno));
return 1;
}
struct pollfd pollfd[npipes + 1];
memset(&pollfd, 0, sizeof(pollfd));
signal(SIGINT, sigint_h);
/* make sure we wake up as often as needed, even when there are no
* packets coming in
*/
if (glob_arg.syslog_interval > 0 && glob_arg.syslog_interval < poll_timeout)
poll_timeout = glob_arg.syslog_interval;
if (glob_arg.stdout_interval > 0 && glob_arg.stdout_interval < poll_timeout)
poll_timeout = glob_arg.stdout_interval;
/* initialize the morefrag structures for the input rings */
for (i = rxport->nmd->first_rx_ring; i <= rxport->nmd->last_rx_ring; i++) {
struct netmap_ring *rxring = NETMAP_RXRING(rxport->nmd->nifp, i);
struct morefrag *mf = (struct morefrag *)rxring->sem;
mf->last_flag = 0;
mf->last_hash = 0;
mf->shadow_head = 0; /* unused */
}
while (!do_abort) {
u_int polli = 0;
for (i = 0; i < npipes; ++i) {
struct netmap_ring *ring = ports[i].ring;
int pending = nm_tx_pending(ring);
/* if there are packets pending, we want to be notified when
* tail moves, so we let cur=tail
*/
ring->cur = pending ? ring->tail : ring->head;
if (!glob_arg.busy_wait && !pending) {
/* no need to poll, there are no packets pending */
continue;
}
pollfd[polli].fd = ports[i].nmd->fd;
pollfd[polli].events = POLLOUT;
pollfd[polli].revents = 0;
++polli;
}
pollfd[polli].fd = rxport->nmd->fd;
pollfd[polli].events = POLLIN;
pollfd[polli].revents = 0;
++polli;
ND(5, "polling %d file descriptors", polli);
rv = poll(pollfd, polli, poll_timeout);
if (rv <= 0) {
if (rv < 0 && errno != EAGAIN && errno != EINTR)
RD(1, "poll error %s", strerror(errno));
goto send_stats;
}
/* if there are several groups, try pushing released packets from
* upstream groups to the downstream ones.
*
* It is important to do this before returned slots are reused
* for new transmissions. For the same reason, this must be
* done starting from the last group going backwards.
*/
for (i = glob_arg.num_groups - 1U; i > 0; i--) {
struct group_des *g = &groups[i - 1];
for (j = 0; j < g->nports; j++) {
struct port_des *p = &g->ports[j];
struct netmap_ring *ring = p->ring;
uint32_t last = p->last_tail,
stop = nm_ring_next(ring, ring->tail);
/* slight abuse of the API here: we touch the slot
* pointed to by tail
*/
for ( ; last != stop; last = nm_ring_next(ring, last)) {
struct netmap_slot *rs = &ring->slot[last];
// XXX less aggressive?
rs->buf_idx = forward_packet(g + 1, rs);
rs->flags = NS_BUF_CHANGED;
rs->ptr = 0;
}
p->last_tail = last;
}
}
if (oq) {
/* try to push packets from the overflow queues
* to the corresponding pipes
*/
for (i = 0; i < npipes; i++) {
struct port_des *p = &ports[i];
struct overflow_queue *q = p->oq;
uint32_t k;
int64_t lim;
struct netmap_ring *ring;
struct netmap_slot *slot;
struct morefrag *mf;
if (oq_empty(q))
continue;
ring = p->ring;
mf = (struct morefrag *)ring->sem;
lim = ring->tail - mf->shadow_head;
if (!lim)
continue;
if (lim < 0)
lim += ring->num_slots;
if (q->n < lim)
lim = q->n;
for (k = 0; k < lim; k++) {
struct netmap_slot s = oq_deq(q), tmp;
tmp.ptr = 0;
slot = &ring->slot[mf->shadow_head];
tmp.buf_idx = slot->buf_idx;
oq_enq(freeq, &tmp);
*slot = s;
slot->flags |= NS_BUF_CHANGED;
mf->shadow_head = nm_ring_next(ring, mf->shadow_head);
if (!(slot->flags & NS_MOREFRAG))
ring->head = mf->shadow_head;
}
}
}
/* push any new packets from the input port to the first group */
int batch = 0;
for (i = rxport->nmd->first_rx_ring; i <= rxport->nmd->last_rx_ring; i++) {
struct netmap_ring *rxring = NETMAP_RXRING(rxport->nmd->nifp, i);
struct morefrag *mf = (struct morefrag *)rxring->sem;
//D("prepare to scan rings");
int next_head = rxring->head;
struct netmap_slot *next_slot = &rxring->slot[next_head];
const char *next_buf = NETMAP_BUF(rxring, next_slot->buf_idx);
while (!nm_ring_empty(rxring)) {
struct netmap_slot *rs = next_slot;
struct group_des *g = &groups[0];
++received_pkts;
received_bytes += rs->len;
// CHOOSE THE CORRECT OUTPUT PIPE
// If the previous slot had NS_MOREFRAG set, this is another
// fragment of the last packet and it should go to the same
// output pipe as before.
if (!mf->last_flag) {
// 'B' is just a hashing seed
mf->last_hash = pkt_hdr_hash((const unsigned char *)next_buf, 4, 'B');
}
mf->last_flag = rs->flags & NS_MOREFRAG;
rs->ptr = mf->last_hash;
if (rs->ptr == 0) {
non_ip++; // XXX ??
}
// prefetch the buffer for the next round
next_head = nm_ring_next(rxring, next_head);
next_slot = &rxring->slot[next_head];
next_buf = NETMAP_BUF(rxring, next_slot->buf_idx);
__builtin_prefetch(next_buf);
rs->buf_idx = forward_packet(g, rs);
rs->flags = NS_BUF_CHANGED;
rxring->head = rxring->cur = next_head;
batch++;
if (unlikely(batch >= glob_arg.batch)) {
ioctl(rxport->nmd->fd, NIOCRXSYNC, NULL);
batch = 0;
}
ND(1,
"Forwarded Packets: %"PRIu64" Dropped packets: %"PRIu64" Percent: %.2f",
forwarded, dropped,
((float)dropped / (float)forwarded * 100));
}
}
send_stats:
if (counters_buf.status == COUNTERS_FULL)
continue;
/* take a new snapshot of the counters */
gettimeofday(&counters_buf.ts, NULL);
for (i = 0; i < npipes; i++) {
struct my_ctrs *c = &counters_buf.ctrs[i];
*c = ports[i].ctr;
/*
* If there are overflow queues, copy the number of them for each
* port to the ctrs.oq_n variable for each port.
*/
if (ports[i].oq != NULL)
c->oq_n = ports[i].oq->n;
}
counters_buf.received_pkts = received_pkts;
counters_buf.received_bytes = received_bytes;
counters_buf.non_ip = non_ip;
if (freeq != NULL)
counters_buf.freeq_n = freeq->n;
__sync_synchronize();
counters_buf.status = COUNTERS_FULL;
}
/*
* If freeq exists, copy the number to the freeq_n member of the
* message struct, otherwise set it to 0.
*/
if (freeq != NULL) {
freeq_n = freeq->n;
} else {
freeq_n = 0;
}
pthread_join(stat_thread, NULL);
printf("%"PRIu64" packets forwarded. %"PRIu64" packets dropped. Total %"PRIu64"\n", forwarded,
dropped, forwarded + dropped);
return 0;
}
diff --git a/tools/tools/netmap/pkt_hash.c b/tools/tools/netmap/pkt_hash.c
index eb9704fd2058..0016544f9090 100644
--- a/tools/tools/netmap/pkt_hash.c
+++ b/tools/tools/netmap/pkt_hash.c
@@ -1,399 +1,398 @@
/*
** Copyright (c) 2015, Asim Jamshed, Robin Sommer, Seth Hall
** and the International Computer Science Institute. All rights reserved.
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions are met:
**
** (1) Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
**
** (2) Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
**
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
** AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
** LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
** CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
** SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
** INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
** CONTRACT, STRICT 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 SUCH DAMAGE.
**/
-/* $FreeBSD$ */
/* for func prototypes */
#include "pkt_hash.h"
/* Make Linux headers choose BSD versions of some of the data structures */
#define __FAVOR_BSD
/* for types */
#include <sys/types.h>
/* for [n/h]to[h/n][ls] */
#include <netinet/in.h>
/* iphdr */
#include <netinet/ip.h>
/* ipv6hdr */
#include <netinet/ip6.h>
/* tcphdr */
#include <netinet/tcp.h>
/* udphdr */
#include <netinet/udp.h>
/* eth hdr */
#include <net/ethernet.h>
/* for memset */
#include <string.h>
#include <stdio.h>
#include <assert.h>
//#include <libnet.h>
/*---------------------------------------------------------------------*/
/**
* * The cache table is used to pick a nice seed for the hash value. It is
* * built only once when sym_hash_fn is called for the very first time
* */
static void
build_sym_key_cache(uint32_t *cache, int cache_len)
{
static const uint8_t key[] = { 0x50, 0x6d };
uint32_t result = (((uint32_t)key[0]) << 24) |
(((uint32_t)key[1]) << 16) |
(((uint32_t)key[0]) << 8) |
((uint32_t)key[1]);
uint32_t idx = 32;
int i;
for (i = 0; i < cache_len; i++, idx++) {
uint8_t shift = (idx % 8);
uint32_t bit;
cache[i] = result;
bit = ((key[(idx/8) & 1] << shift) & 0x80) ? 1 : 0;
result = ((result << 1) | bit);
}
}
static void
build_byte_cache(uint32_t byte_cache[256][4])
{
#define KEY_CACHE_LEN 96
int i, j, k;
uint32_t key_cache[KEY_CACHE_LEN];
build_sym_key_cache(key_cache, KEY_CACHE_LEN);
for (i = 0; i < 4; i++) {
for (j = 0; j < 256; j++) {
uint8_t b = j;
byte_cache[j][i] = 0;
for (k = 0; k < 8; k++) {
if (b & 0x80)
byte_cache[j][i] ^= key_cache[8 * i + k];
b <<= 1U;
}
}
}
}
/*---------------------------------------------------------------------*/
/**
** Computes symmetric hash based on the 4-tuple header data
**/
static uint32_t
sym_hash_fn(uint32_t sip, uint32_t dip, uint16_t sp, uint32_t dp)
{
uint32_t rc = 0;
static int first_time = 1;
static uint32_t byte_cache[256][4];
uint8_t *sip_b = (uint8_t *)&sip,
*dip_b = (uint8_t *)&dip,
*sp_b = (uint8_t *)&sp,
*dp_b = (uint8_t *)&dp;
if (first_time) {
build_byte_cache(byte_cache);
first_time = 0;
}
rc = byte_cache[sip_b[3]][0] ^
byte_cache[sip_b[2]][1] ^
byte_cache[sip_b[1]][2] ^
byte_cache[sip_b[0]][3] ^
byte_cache[dip_b[3]][0] ^
byte_cache[dip_b[2]][1] ^
byte_cache[dip_b[1]][2] ^
byte_cache[dip_b[0]][3] ^
byte_cache[sp_b[1]][0] ^
byte_cache[sp_b[0]][1] ^
byte_cache[dp_b[1]][2] ^
byte_cache[dp_b[0]][3];
return rc;
}
static uint32_t decode_gre_hash(const uint8_t *, uint8_t, uint8_t);
/*---------------------------------------------------------------------*/
/**
** Parser + hash function for the IPv4 packet
**/
static uint32_t
decode_ip_n_hash(const struct ip *iph, uint8_t hash_split, uint8_t seed)
{
uint32_t rc = 0;
if (iph->ip_hl < 5 || iph->ip_hl * 4 > iph->ip_len) {
rc = 0;
} else if (hash_split == 2) {
rc = sym_hash_fn(ntohl(iph->ip_src.s_addr),
ntohl(iph->ip_dst.s_addr),
ntohs(0xFFFD) + seed,
ntohs(0xFFFE) + seed);
} else {
const struct tcphdr *tcph = NULL;
const struct udphdr *udph = NULL;
switch (iph->ip_p) {
case IPPROTO_TCP:
tcph = (const struct tcphdr *)((const uint8_t *)iph + (iph->ip_hl<<2));
rc = sym_hash_fn(ntohl(iph->ip_src.s_addr),
ntohl(iph->ip_dst.s_addr),
ntohs(tcph->th_sport) + seed,
ntohs(tcph->th_dport) + seed);
break;
case IPPROTO_UDP:
udph = (const struct udphdr *)((const uint8_t *)iph + (iph->ip_hl<<2));
rc = sym_hash_fn(ntohl(iph->ip_src.s_addr),
ntohl(iph->ip_dst.s_addr),
ntohs(udph->uh_sport) + seed,
ntohs(udph->uh_dport) + seed);
break;
case IPPROTO_IPIP:
/* tunneling */
rc = decode_ip_n_hash((const struct ip *)((const uint8_t *)iph + (iph->ip_hl<<2)),
hash_split, seed);
break;
case IPPROTO_GRE:
rc = decode_gre_hash((const uint8_t *)iph + (iph->ip_hl<<2),
hash_split, seed);
break;
case IPPROTO_ICMP:
case IPPROTO_ESP:
case IPPROTO_PIM:
case IPPROTO_IGMP:
default:
/*
** the hash strength (although weaker but) should still hold
** even with 2 fields
**/
rc = sym_hash_fn(ntohl(iph->ip_src.s_addr),
ntohl(iph->ip_dst.s_addr),
ntohs(0xFFFD) + seed,
ntohs(0xFFFE) + seed);
break;
}
}
return rc;
}
/*---------------------------------------------------------------------*/
/**
** Parser + hash function for the IPv6 packet
**/
static uint32_t
decode_ipv6_n_hash(const struct ip6_hdr *ipv6h, uint8_t hash_split, uint8_t seed)
{
uint32_t saddr, daddr;
uint32_t rc = 0;
/* Get only the first 4 octets */
saddr = ipv6h->ip6_src.s6_addr[0] |
(ipv6h->ip6_src.s6_addr[1] << 8) |
(ipv6h->ip6_src.s6_addr[2] << 16) |
(ipv6h->ip6_src.s6_addr[3] << 24);
daddr = ipv6h->ip6_dst.s6_addr[0] |
(ipv6h->ip6_dst.s6_addr[1] << 8) |
(ipv6h->ip6_dst.s6_addr[2] << 16) |
(ipv6h->ip6_dst.s6_addr[3] << 24);
if (hash_split == 2) {
rc = sym_hash_fn(ntohl(saddr),
ntohl(daddr),
ntohs(0xFFFD) + seed,
ntohs(0xFFFE) + seed);
} else {
const struct tcphdr *tcph = NULL;
const struct udphdr *udph = NULL;
switch(ntohs(ipv6h->ip6_ctlun.ip6_un1.ip6_un1_nxt)) {
case IPPROTO_TCP:
tcph = (const struct tcphdr *)(ipv6h + 1);
rc = sym_hash_fn(ntohl(saddr),
ntohl(daddr),
ntohs(tcph->th_sport) + seed,
ntohs(tcph->th_dport) + seed);
break;
case IPPROTO_UDP:
udph = (const struct udphdr *)(ipv6h + 1);
rc = sym_hash_fn(ntohl(saddr),
ntohl(daddr),
ntohs(udph->uh_sport) + seed,
ntohs(udph->uh_dport) + seed);
break;
case IPPROTO_IPIP:
/* tunneling */
rc = decode_ip_n_hash((const struct ip *)(ipv6h + 1),
hash_split, seed);
break;
case IPPROTO_IPV6:
/* tunneling */
rc = decode_ipv6_n_hash((const struct ip6_hdr *)(ipv6h + 1),
hash_split, seed);
break;
case IPPROTO_GRE:
rc = decode_gre_hash((const uint8_t *)(ipv6h + 1), hash_split, seed);
break;
case IPPROTO_ICMP:
case IPPROTO_ESP:
case IPPROTO_PIM:
case IPPROTO_IGMP:
default:
/*
** the hash strength (although weaker but) should still hold
** even with 2 fields
**/
rc = sym_hash_fn(ntohl(saddr),
ntohl(daddr),
ntohs(0xFFFD) + seed,
ntohs(0xFFFE) + seed);
}
}
return rc;
}
/*---------------------------------------------------------------------*/
/**
* * A temp solution while hash for other protocols are filled...
* * (See decode_vlan_n_hash & pkt_hdr_hash functions).
* */
static uint32_t
decode_others_n_hash(const struct ether_header *ethh, uint8_t seed)
{
uint32_t saddr, daddr, rc;
saddr = ethh->ether_shost[5] |
(ethh->ether_shost[4] << 8) |
(ethh->ether_shost[3] << 16) |
(ethh->ether_shost[2] << 24);
daddr = ethh->ether_dhost[5] |
(ethh->ether_dhost[4] << 8) |
(ethh->ether_dhost[3] << 16) |
(ethh->ether_dhost[2] << 24);
rc = sym_hash_fn(ntohl(saddr),
ntohl(daddr),
ntohs(0xFFFD) + seed,
ntohs(0xFFFE) + seed);
return rc;
}
/*---------------------------------------------------------------------*/
/**
** Parser + hash function for VLAN packet
**/
static inline uint32_t
decode_vlan_n_hash(const struct ether_header *ethh, uint8_t hash_split, uint8_t seed)
{
uint32_t rc = 0;
const struct vlanhdr *vhdr = (const struct vlanhdr *)(ethh + 1);
switch (ntohs(vhdr->proto)) {
case ETHERTYPE_IP:
rc = decode_ip_n_hash((const struct ip *)(vhdr + 1),
hash_split, seed);
break;
case ETHERTYPE_IPV6:
rc = decode_ipv6_n_hash((const struct ip6_hdr *)(vhdr + 1),
hash_split, seed);
break;
case ETHERTYPE_ARP:
default:
/* others */
rc = decode_others_n_hash(ethh, seed);
break;
}
return rc;
}
/*---------------------------------------------------------------------*/
/**
** General parser + hash function...
**/
uint32_t
pkt_hdr_hash(const unsigned char *buffer, uint8_t hash_split, uint8_t seed)
{
uint32_t rc = 0;
const struct ether_header *ethh = (const struct ether_header *)buffer;
switch (ntohs(ethh->ether_type)) {
case ETHERTYPE_IP:
rc = decode_ip_n_hash((const struct ip *)(ethh + 1),
hash_split, seed);
break;
case ETHERTYPE_IPV6:
rc = decode_ipv6_n_hash((const struct ip6_hdr *)(ethh + 1),
hash_split, seed);
break;
case ETHERTYPE_VLAN:
rc = decode_vlan_n_hash(ethh, hash_split, seed);
break;
case ETHERTYPE_ARP:
default:
/* others */
rc = decode_others_n_hash(ethh, seed);
break;
}
return rc;
}
/*---------------------------------------------------------------------*/
/**
** Parser + hash function for the GRE packet
**/
static uint32_t
decode_gre_hash(const uint8_t *grehdr, uint8_t hash_split, uint8_t seed)
{
uint32_t rc = 0;
int len = 4 + 2 * (!!(*grehdr & 1) + /* Checksum */
!!(*grehdr & 2) + /* Routing */
!!(*grehdr & 4) + /* Key */
!!(*grehdr & 8)); /* Sequence Number */
uint16_t proto = ntohs(*(const uint16_t *)(const void *)(grehdr + 2));
switch (proto) {
case ETHERTYPE_IP:
rc = decode_ip_n_hash((const struct ip *)(grehdr + len),
hash_split, seed);
break;
case ETHERTYPE_IPV6:
rc = decode_ipv6_n_hash((const struct ip6_hdr *)(grehdr + len),
hash_split, seed);
break;
case 0x6558: /* Transparent Ethernet Bridging */
rc = pkt_hdr_hash(grehdr + len, hash_split, seed);
break;
default:
/* others */
break;
}
return rc;
}
/*---------------------------------------------------------------------*/
diff --git a/tools/tools/netmap/pkt_hash.h b/tools/tools/netmap/pkt_hash.h
index 7371f074079f..1f73ff97ecb0 100644
--- a/tools/tools/netmap/pkt_hash.h
+++ b/tools/tools/netmap/pkt_hash.h
@@ -1,79 +1,78 @@
/*
** Copyright (c) 2015, Asim Jamshed, Robin Sommer, Seth Hall
** and the International Computer Science Institute. All rights reserved.
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions are met:
**
** (1) Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
**
** (2) Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
**
**
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
** AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
** ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
** LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
** CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
** SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
** INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
** CONTRACT, STRICT 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 SUCH DAMAGE.
**/
-/* $FreeBSD$ */
#ifndef LB_PKT_HASH_H
#define LB_PKT_HASH_H
/*---------------------------------------------------------------------*/
/**
** Packet header hashing function utility - This file contains functions
** that parse the packet headers and computes hash functions based on
** the header fields. Please see pkt_hash.c for more details...
**/
/*---------------------------------------------------------------------*/
/* for type def'n */
#include <stdint.h>
/*---------------------------------------------------------------------*/
#ifdef __GNUC__
#define likely(x) __builtin_expect(!!(x), 1)
#define unlikely(x) __builtin_expect(!!(x), 0)
#else
#define likely(x) (x)
#define unlikely(x) (x)
#endif
#define HTONS(n) (((((unsigned short)(n) & 0xFF)) << 8) | \
(((unsigned short)(n) & 0xFF00) >> 8))
#define NTOHS(n) (((((unsigned short)(n) & 0xFF)) << 8) | \
(((unsigned short)(n) & 0xFF00) >> 8))
#define HTONL(n) (((((unsigned long)(n) & 0xFF)) << 24) | \
((((unsigned long)(n) & 0xFF00)) << 8) | \
((((unsigned long)(n) & 0xFF0000)) >> 8) | \
((((unsigned long)(n) & 0xFF000000)) >> 24))
#define NTOHL(n) (((((unsigned long)(n) & 0xFF)) << 24) | \
((((unsigned long)(n) & 0xFF00)) << 8) | \
((((unsigned long)(n) & 0xFF0000)) >> 8) | \
((((unsigned long)(n) & 0xFF000000)) >> 24))
/*---------------------------------------------------------------------*/
typedef struct vlanhdr {
uint16_t pri_cfi_vlan;
uint16_t proto;
} vlanhdr;
/*---------------------------------------------------------------------*/
/**
** Analyzes the packet header of computes a corresponding
** hash function.
**/
uint32_t
pkt_hdr_hash(const unsigned char *buffer,
uint8_t hash_split,
uint8_t seed);
/*---------------------------------------------------------------------*/
#endif /* LB_PKT_HASH_H */
diff --git a/tools/tools/usbtest/usb_control_ep_test.c b/tools/tools/usbtest/usb_control_ep_test.c
index 4ee3bf3e05b6..1ffb89e42728 100644
--- a/tools/tools/usbtest/usb_control_ep_test.c
+++ b/tools/tools/usbtest/usb_control_ep_test.c
@@ -1,673 +1,672 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2007-2022 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <err.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include <sys/sysctl.h>
#include <sys/time.h>
#include <libusb20.h>
#include <libusb20_desc.h>
#include <dev/usb/usb_endian.h>
#include <dev/usb/usb.h>
#include <dev/usb/usb_cdc.h>
#include "usbtest.h"
static void
set_ctrl_ep_fail(int bus, int dev, int ds_fail, int ss_fail)
{
int error;
error = sysctlbyname("hw.usb.ctrl_bus_fail", NULL, NULL,
&bus, sizeof(bus));
if (error != 0)
goto emissing;
error = sysctlbyname("hw.usb.ctrl_dev_fail", NULL, NULL,
&dev, sizeof(dev));
if (error != 0)
goto emissing;
error = sysctlbyname("hw.usb.ctrl_ds_fail", NULL, NULL,
&ds_fail, sizeof(ds_fail));
if (error != 0)
goto emissing;
error = sysctlbyname("hw.usb.ctrl_ss_fail", NULL, NULL,
&ss_fail, sizeof(ss_fail));
if (error != 0)
goto emissing;
return;
emissing:
printf("Cannot set USB sysctl, missing USB_REQ_DEBUG option?\n");
}
void
usb_control_ep_error_test(struct uaddr uaddr)
{
struct LIBUSB20_CONTROL_SETUP_DECODED req;
struct libusb20_device *pdev;
uint8_t buffer[256];
int error;
int fail = 0;
int bus;
int dev;
int cfg;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
error = libusb20_dev_open(pdev, 0);
if (error) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
bus = libusb20_dev_get_bus_number(pdev);
dev = libusb20_dev_get_address(pdev);
for (cfg = 0; cfg != 255; cfg++) {
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &req);
req.bmRequestType = 0x80; /* read */
req.bRequest = 0x06; /* descriptor */
req.wValue = 0x0200 | cfg; /* config descriptor */
req.wIndex = 0;
req.wLength = 255;
printf("Test #%d.1/3 ...\n", cfg);
set_ctrl_ep_fail(-1,-1,0,0);
error = libusb20_dev_request_sync(pdev, &req, buffer,
NULL, 1000, 0);
if (error != 0) {
printf("Last configuration index is: %d\n", cfg - 1);
break;
}
printf("Test #%d.2/3 ...\n", cfg);
set_ctrl_ep_fail(bus,dev,1,1);
error = libusb20_dev_request_sync(pdev, &req, buffer,
NULL, 1000, 0);
set_ctrl_ep_fail(-1,-1,0,0);
error = libusb20_dev_request_sync(pdev, &req, buffer,
NULL, 1000, 0);
if (error != 0) {
printf("Cannot fetch descriptor (unexpected)\n");
fail++;
}
printf("Test #%d.3/3 ...\n", cfg);
set_ctrl_ep_fail(bus,dev,0,1);
error = libusb20_dev_request_sync(pdev, &req, buffer,
NULL, 1000, 0);
set_ctrl_ep_fail(-1,-1,0,0);
error = libusb20_dev_request_sync(pdev, &req, buffer,
NULL, 1000, 0);
if (error != 0) {
printf("Cannot fetch descriptor (unexpected)\n");
fail++;
}
}
libusb20_dev_close(pdev);
libusb20_dev_free(pdev);
printf("Test completed detecting %d failures\nDone\n\n", fail);
}
void
usb_get_string_desc_test(struct uaddr uaddr)
{
struct libusb20_device *pdev;
uint32_t x;
uint32_t y;
uint32_t valid;
uint8_t *buf;
int error;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
error = libusb20_dev_open(pdev, 0);
if (error) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
buf = malloc(256);
if (buf == NULL) {
printf("Cannot allocate memory\n");
libusb20_dev_free(pdev);
return;
}
valid = 0;
printf("Starting string descriptor test for "
"VID=0x%04x PID=0x%04x\n", uaddr.vid, uaddr.pid);
for (x = 0; x != 256; x++) {
if (libusb20_dev_check_connected(pdev) != 0) {
printf("Device disconnected\n");
break;
}
printf("%d .. ", (int)x);
fflush(stdout);
error = libusb20_dev_req_string_simple_sync(pdev, x, buf, 255);
if (error == 0) {
printf("\nINDEX=%d, STRING='%s' (Default language)\n", (int)x, buf);
fflush(stdout);
} else {
continue;
}
valid = 0;
for (y = 0; y != 65536; y++) {
if (libusb20_dev_check_connected(pdev) != 0) {
printf("Device disconnected\n");
break;
}
error = libusb20_dev_req_string_sync(pdev, x, y, buf, 256);
if (error == 0)
valid++;
}
printf("String at INDEX=%d responds to %d "
"languages\n", (int)x, (int)valid);
}
printf("\nDone\n");
free(buf);
libusb20_dev_free(pdev);
}
void
usb_port_reset_test(struct uaddr uaddr, uint32_t duration)
{
struct timeval sub_tv;
struct timeval ref_tv;
struct timeval res_tv;
struct libusb20_device *pdev;
int error;
int iter;
int errcnt;
time_t last_sec;
/* sysctl() - no set config */
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
error = libusb20_dev_open(pdev, 0);
if (error) {
libusb20_dev_free(pdev);
printf("Could not open USB device\n");
return;
}
iter = 0;
errcnt = 0;
gettimeofday(&ref_tv, 0);
last_sec = ref_tv.tv_sec;
while (1) {
gettimeofday(&sub_tv, 0);
if (last_sec != sub_tv.tv_sec) {
printf("STATUS: ID=%u, ERR=%u\n",
(int)iter, (int)errcnt);
fflush(stdout);
last_sec = sub_tv.tv_sec;
}
timersub(&sub_tv, &ref_tv, &res_tv);
if ((res_tv.tv_sec < 0) || (res_tv.tv_sec >= (int)duration))
break;
if (libusb20_dev_reset(pdev)) {
errcnt++;
usleep(50000);
}
if (libusb20_dev_check_connected(pdev) != 0) {
printf("Device disconnected\n");
break;
}
iter++;
}
libusb20_dev_reset(pdev);
libusb20_dev_free(pdev);
}
void
usb_set_config_test(struct uaddr uaddr, uint32_t duration)
{
struct libusb20_device *pdev;
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
int x;
int error;
int failed;
int exp;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
error = libusb20_dev_open(pdev, 0);
if (error) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
failed = 0;
printf("Starting set config test for "
"VID=0x%04x PID=0x%04x\n", uaddr.vid, uaddr.pid);
for (x = 255; x > -1; x--) {
error = libusb20_dev_set_config_index(pdev, x);
if (error == 0) {
if (x == 255) {
printf("Unconfiguring USB device "
"was successful\n");
} else {
printf("Setting configuration %d "
"was successful\n", x);
}
} else {
failed++;
}
}
ddesc = libusb20_dev_get_device_desc(pdev);
if (ddesc != NULL)
exp = ddesc->bNumConfigurations + 1;
else
exp = 1;
printf("\n\n"
"Set configuration summary\n"
"Valid count: %d/%d %s\n"
"Failed count: %d\n",
256 - failed, exp,
(exp == (256 - failed)) ? "(expected)" : "(unexpected)",
failed);
libusb20_dev_free(pdev);
}
void
usb_get_descriptor_test(struct uaddr uaddr, uint32_t duration)
{
struct libusb20_device *pdev;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
libusb20_dev_free(pdev);
}
void
usb_suspend_resume_test(struct uaddr uaddr, uint32_t duration)
{
struct timeval sub_tv;
struct timeval ref_tv;
struct timeval res_tv;
struct libusb20_device *pdev;
time_t last_sec;
int iter;
int error;
int ptimo;
int errcnt;
int power_old;
ptimo = 1; /* second(s) */
error = sysctlbyname("hw.usb.power_timeout", NULL, NULL,
&ptimo, sizeof(ptimo));
if (error != 0) {
printf("WARNING: Could not set power "
"timeout to 1 (error=%d) \n", errno);
}
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
error = libusb20_dev_open(pdev, 0);
if (error) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
power_old = libusb20_dev_get_power_mode(pdev);
printf("Starting suspend and resume "
"test for VID=0x%04x PID=0x%04x\n", uaddr.vid, uaddr.pid);
iter = 0;
errcnt = 0;
gettimeofday(&ref_tv, 0);
last_sec = ref_tv.tv_sec;
while (1) {
if (libusb20_dev_check_connected(pdev) != 0) {
printf("Device disconnected\n");
break;
}
gettimeofday(&sub_tv, 0);
if (last_sec != sub_tv.tv_sec) {
printf("STATUS: ID=%u, ERR=%u\n",
(int)iter, (int)errcnt);
fflush(stdout);
last_sec = sub_tv.tv_sec;
}
timersub(&sub_tv, &ref_tv, &res_tv);
if ((res_tv.tv_sec < 0) || (res_tv.tv_sec >= (int)duration))
break;
error = libusb20_dev_set_power_mode(pdev, (iter & 1) ?
LIBUSB20_POWER_ON : LIBUSB20_POWER_SAVE);
if (error)
errcnt++;
/* wait before switching power mode */
usleep(4100000 +
(((uint32_t)usb_ts_rand_noise()) % 2000000U));
iter++;
}
/* restore default power mode */
libusb20_dev_set_power_mode(pdev, power_old);
libusb20_dev_free(pdev);
}
void
usb_set_and_clear_stall_test(struct uaddr uaddr)
{
struct libusb20_device *pdev;
struct libusb20_transfer *pxfer;
int iter;
int error;
int errcnt;
int ep;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
error = libusb20_dev_open(pdev, 1);
if (error) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
printf("Starting set and clear stall test "
"for VID=0x%04x PID=0x%04x\n", uaddr.vid, uaddr.pid);
iter = 0;
errcnt = 0;
for (ep = 2; ep != 32; ep++) {
struct LIBUSB20_CONTROL_SETUP_DECODED setup_set_stall;
struct LIBUSB20_CONTROL_SETUP_DECODED setup_get_status;
uint8_t epno = ((ep / 2) | ((ep & 1) << 7));
uint8_t buf[1];
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &setup_set_stall);
setup_set_stall.bmRequestType = 0x02; /* write endpoint */
setup_set_stall.bRequest = 0x03; /* set feature */
setup_set_stall.wValue = 0x00; /* UF_ENDPOINT_HALT */
setup_set_stall.wIndex = epno;
setup_set_stall.wLength = 0;
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &setup_get_status);
setup_get_status.bmRequestType = 0x82; /* read endpoint */
setup_get_status.bRequest = 0x00; /* get status */
setup_get_status.wValue = 0x00;
setup_get_status.wIndex = epno;
setup_get_status.wLength = 1;
if (libusb20_dev_check_connected(pdev) != 0) {
printf("Device disconnected\n");
break;
}
pxfer = libusb20_tr_get_pointer(pdev, 0);
error = libusb20_tr_open(pxfer, 1, 1, epno);
if (error != 0) {
printf("Endpoint 0x%02x does not exist "
"in current setting. (%s, ignored)\n",
epno, libusb20_strerror(error));
continue;
}
printf("Stalling endpoint 0x%02x\n", epno);
/* set stall */
error = libusb20_dev_request_sync(pdev,
&setup_set_stall, NULL, NULL, 250, 0);
if (error != 0) {
printf("Endpoint 0x%02x does not allow "
"setting of stall. (%s)\n",
epno, libusb20_strerror(error));
errcnt++;
}
/* get EP status */
buf[0] = 0;
error = libusb20_dev_request_sync(pdev,
&setup_get_status, buf, NULL, 250, 0);
if (error != 0) {
printf("Endpoint 0x%02x does not allow "
"reading status. (%s)\n",
epno, libusb20_strerror(error));
errcnt++;
} else {
if (!(buf[0] & 1)) {
printf("Endpoint 0x%02x status is "
"not set to stalled\n", epno);
errcnt++;
}
}
buf[0] = 0;
error = libusb20_tr_bulk_intr_sync(pxfer, buf, 1, NULL, 250);
if (error != LIBUSB20_TRANSFER_STALL) {
printf("Endpoint 0x%02x does not appear to "
"have stalled. Missing stall PID!\n", epno);
errcnt++;
}
printf("Unstalling endpoint 0x%02x\n", epno);
libusb20_tr_clear_stall_sync(pxfer);
/* get EP status */
buf[0] = 0;
error = libusb20_dev_request_sync(pdev,
&setup_get_status, buf, NULL, 250, 0);
if (error != 0) {
printf("Endpoint 0x%02x does not allow "
"reading status. (%s)\n",
epno, libusb20_strerror(error));
errcnt++;
} else {
if (buf[0] & 1) {
printf("Endpoint 0x%02x status is "
"still stalled\n", epno);
errcnt++;
}
}
libusb20_tr_close(pxfer);
iter++;
}
libusb20_dev_free(pdev);
printf("\n"
"Test summary\n"
"============\n"
"Endpoints tested: %d\n"
"Errors: %d\n", iter, errcnt);
}
void
usb_set_alt_interface_test(struct uaddr uaddr)
{
struct libusb20_device *pdev;
struct libusb20_config *config;
int iter;
int error;
int errcnt;
int n;
int m;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
printf("Starting set alternate setting test "
"for VID=0x%04x PID=0x%04x\n", uaddr.vid, uaddr.pid);
config = libusb20_dev_alloc_config(pdev,
libusb20_dev_get_config_index(pdev));
if (config == NULL) {
printf("Could not get configuration descriptor\n");
libusb20_dev_free(pdev);
return;
}
iter = 0;
errcnt = 0;
for (n = 0; n != config->num_interface; n++) {
/* detach kernel driver */
libusb20_dev_detach_kernel_driver(pdev, n);
error = libusb20_dev_open(pdev, 0);
if (error)
printf("ERROR could not open device\n");
/* Try the alternate settings */
for (m = 0; m != config->interface[n].num_altsetting; m++) {
iter++;
if (libusb20_dev_set_alt_index(pdev, n, m + 1)) {
printf("ERROR on interface %d alt %d\n", n, m + 1);
errcnt++;
}
}
/* Restore to default */
iter++;
if (libusb20_dev_set_alt_index(pdev, n, 0)) {
printf("ERROR on interface %d alt %d\n", n, 0);
errcnt++;
}
libusb20_dev_close(pdev);
}
libusb20_dev_free(pdev);
printf("\n"
"Test summary\n"
"============\n"
"Interfaces tested: %d\n"
"Errors: %d\n", iter, errcnt);
}
diff --git a/tools/tools/usbtest/usb_modem_test.c b/tools/tools/usbtest/usb_modem_test.c
index 0ac7ac594601..eb264df7dfed 100644
--- a/tools/tools/usbtest/usb_modem_test.c
+++ b/tools/tools/usbtest/usb_modem_test.c
@@ -1,585 +1,584 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2007-2022 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <err.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include <sys/sysctl.h>
#include <sys/time.h>
#include <libusb20.h>
#include <libusb20_desc.h>
#include <dev/usb/usb_endian.h>
#include <dev/usb/usb.h>
#include <dev/usb/usb_cdc.h>
#include "usbtest.h"
static struct modem {
struct libusb20_transfer *xfer_in;
struct libusb20_transfer *xfer_out;
struct libusb20_device *usb_dev;
struct bps rx_bytes;
struct bps tx_bytes;
uint32_t c0;
uint32_t c1;
uint32_t out_state;
uint32_t in_last;
uint32_t in_synced;
uint32_t duration;
uint32_t errors;
uint8_t use_vendor_specific;
uint8_t loop_data;
uint8_t modem_at_mode;
uint8_t data_stress_test;
uint8_t control_ep_test;
uint8_t usb_iface;
uint8_t random_tx_length;
uint8_t random_tx_delay;
} modem;
static void
set_defaults(struct modem *p)
{
memset(p, 0, sizeof(*p));
p->data_stress_test = 1;
p->control_ep_test = 1;
p->duration = 60; /* seconds */
}
void
do_bps(const char *desc, struct bps *bps, uint32_t len)
{
bps->bytes += len;
}
static void
modem_out_state(uint8_t *buf)
{
if (modem.modem_at_mode) {
switch (modem.out_state & 3) {
case 0:
*buf = 'A';
break;
case 1:
*buf = 'T';
break;
case 2:
*buf = '\r';
break;
default:
*buf = '\n';
modem.c0++;
break;
}
modem.out_state++;
} else {
*buf = modem.out_state;
modem.out_state++;
modem.out_state %= 255;
}
}
static void
modem_in_state(uint8_t buf, uint32_t counter)
{
if ((modem.in_last == 'O') && (buf == 'K')) {
modem.c1++;
modem.in_last = buf;
} else if (buf == modem.in_last) {
modem.c1++;
modem.in_last++;
modem.in_last %= 255;
if (modem.in_synced == 0) {
if (modem.errors < 64) {
printf("Got sync\n");
}
modem.in_synced = 1;
}
} else {
if (modem.in_synced) {
if (modem.errors < 64) {
printf("Lost sync @ %d, 0x%02x != 0x%02x\n",
counter % 512, buf, modem.in_last);
}
modem.in_synced = 0;
modem.errors++;
}
modem.in_last = buf;
modem.in_last++;
modem.in_last %= 255;
}
}
static void
modem_write(uint8_t *buf, uint32_t len)
{
uint32_t n;
for (n = 0; n != len; n++) {
modem_out_state(buf + n);
}
do_bps("transmitted", &modem.tx_bytes, len);
}
static void
modem_read(uint8_t *buf, uint32_t len)
{
uint32_t n;
for (n = 0; n != len; n++) {
modem_in_state(buf[n], n);
}
do_bps("received", &modem.rx_bytes, len);
}
static void
usb_modem_control_ep_test(struct modem *p, uint32_t duration, uint8_t flag)
{
struct timeval sub_tv;
struct timeval ref_tv;
struct timeval res_tv;
struct LIBUSB20_CONTROL_SETUP_DECODED setup;
struct usb_cdc_abstract_state ast;
struct usb_cdc_line_state ls;
uint16_t feature = UCDC_ABSTRACT_STATE;
uint16_t state = UCDC_DATA_MULTIPLEXED;
uint8_t iface_no;
uint8_t buf[4];
int id = 0;
int iter = 0;
time_t last_sec;
iface_no = p->usb_iface - 1;
gettimeofday(&ref_tv, 0);
last_sec = ref_tv.tv_sec;
printf("\nTest=%d\n", (int)flag);
while (1) {
gettimeofday(&sub_tv, 0);
if (last_sec != sub_tv.tv_sec) {
printf("STATUS: ID=%u, COUNT=%u tests/sec ERR=%u\n",
(int)id,
(int)iter,
(int)p->errors);
fflush(stdout);
last_sec = sub_tv.tv_sec;
id++;
iter = 0;
}
timersub(&sub_tv, &ref_tv, &res_tv);
if ((res_tv.tv_sec < 0) || (res_tv.tv_sec >= (int)duration))
break;
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &setup);
if (flag & 1) {
setup.bmRequestType = UT_READ_CLASS_INTERFACE;
setup.bRequest = 0x03;
setup.wValue = 0x0001;
setup.wIndex = iface_no;
setup.wLength = 0x0002;
if (libusb20_dev_request_sync(p->usb_dev, &setup, buf, NULL, 250, 0)) {
p->errors++;
}
}
if (flag & 2) {
setup.bmRequestType = UT_WRITE_CLASS_INTERFACE;
setup.bRequest = UCDC_SET_COMM_FEATURE;
setup.wValue = feature;
setup.wIndex = iface_no;
setup.wLength = UCDC_ABSTRACT_STATE_LENGTH;
USETW(ast.wState, state);
if (libusb20_dev_request_sync(p->usb_dev, &setup, &ast, NULL, 250, 0)) {
p->errors++;
}
}
if (flag & 4) {
USETDW(ls.dwDTERate, 115200);
ls.bCharFormat = UCDC_STOP_BIT_1;
ls.bParityType = UCDC_PARITY_NONE;
ls.bDataBits = 8;
setup.bmRequestType = UT_WRITE_CLASS_INTERFACE;
setup.bRequest = UCDC_SET_LINE_CODING;
setup.wValue = 0;
setup.wIndex = iface_no;
setup.wLength = sizeof(ls);
if (libusb20_dev_request_sync(p->usb_dev, &setup, &ls, NULL, 250, 0)) {
p->errors++;
}
}
iter++;
}
printf("\nModem control endpoint test done!\n");
}
static void
usb_modem_data_stress_test(struct modem *p, uint32_t duration)
{
struct timeval sub_tv;
struct timeval ref_tv;
struct timeval res_tv;
time_t last_sec;
uint8_t in_pending = 0;
uint8_t in_ready = 0;
uint8_t out_pending = 0;
uint32_t id = 0;
uint32_t in_max;
uint32_t out_max;
uint32_t io_max;
uint8_t *in_buffer = 0;
uint8_t *out_buffer = 0;
gettimeofday(&ref_tv, 0);
last_sec = ref_tv.tv_sec;
printf("\n");
in_max = libusb20_tr_get_max_total_length(p->xfer_in);
out_max = libusb20_tr_get_max_total_length(p->xfer_out);
/* get the smallest buffer size and use that */
io_max = (in_max < out_max) ? in_max : out_max;
if (in_max != out_max)
printf("WARNING: Buffer sizes are un-equal: %u vs %u\n", in_max, out_max);
in_buffer = malloc(io_max);
if (in_buffer == NULL)
goto fail;
out_buffer = malloc(io_max);
if (out_buffer == NULL)
goto fail;
while (1) {
gettimeofday(&sub_tv, 0);
if (last_sec != sub_tv.tv_sec) {
printf("STATUS: ID=%u, RX=%u bytes/sec, TX=%u bytes/sec, ERR=%d\n",
(int)id,
(int)p->rx_bytes.bytes,
(int)p->tx_bytes.bytes,
(int)p->errors);
p->rx_bytes.bytes = 0;
p->tx_bytes.bytes = 0;
fflush(stdout);
last_sec = sub_tv.tv_sec;
id++;
}
timersub(&sub_tv, &ref_tv, &res_tv);
if ((res_tv.tv_sec < 0) || (res_tv.tv_sec >= (int)duration))
break;
libusb20_dev_process(p->usb_dev);
if (!libusb20_tr_pending(p->xfer_in)) {
if (in_pending) {
if (libusb20_tr_get_status(p->xfer_in) == 0) {
modem_read(in_buffer, libusb20_tr_get_length(p->xfer_in, 0));
} else {
p->errors++;
usleep(10000);
}
in_pending = 0;
in_ready = 1;
}
if (p->loop_data == 0) {
libusb20_tr_setup_bulk(p->xfer_in, in_buffer, io_max, 0);
libusb20_tr_start(p->xfer_in);
in_pending = 1;
in_ready = 0;
}
}
if (!libusb20_tr_pending(p->xfer_out)) {
uint32_t len;
uint32_t dly;
if (out_pending) {
if (libusb20_tr_get_status(p->xfer_out) != 0) {
p->errors++;
usleep(10000);
}
}
if (p->random_tx_length) {
len = ((uint32_t)usb_ts_rand_noise()) % ((uint32_t)io_max);
} else {
len = io_max;
}
if (p->random_tx_delay) {
dly = ((uint32_t)usb_ts_rand_noise()) % 16000U;
} else {
dly = 0;
}
if (p->loop_data != 0) {
if (in_ready != 0) {
len = libusb20_tr_get_length(p->xfer_in, 0);
memcpy(out_buffer, in_buffer, len);
in_ready = 0;
} else {
len = io_max + 1;
}
if (!libusb20_tr_pending(p->xfer_in)) {
libusb20_tr_setup_bulk(p->xfer_in, in_buffer, io_max, 0);
libusb20_tr_start(p->xfer_in);
in_pending = 1;
}
} else {
modem_write(out_buffer, len);
}
if (len <= io_max) {
libusb20_tr_setup_bulk(p->xfer_out, out_buffer, len, 0);
if (dly != 0)
usleep(dly);
libusb20_tr_start(p->xfer_out);
out_pending = 1;
}
}
libusb20_dev_wait_process(p->usb_dev, 500);
if (libusb20_dev_check_connected(p->usb_dev) != 0) {
printf("Device disconnected\n");
break;
}
}
libusb20_tr_stop(p->xfer_in);
libusb20_tr_stop(p->xfer_out);
printf("\nData stress test done!\n");
fail:
if (in_buffer)
free(in_buffer);
if (out_buffer)
free(out_buffer);
}
static void
exec_host_modem_test(struct modem *p, struct uaddr uaddr)
{
struct libusb20_device *pdev;
uint8_t ntest = 0;
uint8_t x;
uint8_t in_ep;
uint8_t out_ep;
uint8_t iface;
int error;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
if (p->use_vendor_specific)
find_usb_endpoints(pdev, 255, 255, 255, 0, &iface, &in_ep, &out_ep, 0);
else
find_usb_endpoints(pdev, 2, 2, 1, 0, &iface, &in_ep, &out_ep, 1);
if ((in_ep == 0) || (out_ep == 0)) {
printf("Could not find USB endpoints\n");
libusb20_dev_free(pdev);
return;
}
printf("Attaching to: %s @ iface %d\n",
libusb20_dev_get_desc(pdev), iface);
if (libusb20_dev_open(pdev, 2)) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
if (libusb20_dev_detach_kernel_driver(pdev, iface)) {
printf("WARNING: Could not detach kernel driver\n");
}
p->xfer_in = libusb20_tr_get_pointer(pdev, 0);
error = libusb20_tr_open(p->xfer_in, 65536 / 4, 1, in_ep);
if (error) {
printf("Could not open USB endpoint %d\n", in_ep);
libusb20_dev_free(pdev);
return;
}
p->xfer_out = libusb20_tr_get_pointer(pdev, 1);
error = libusb20_tr_open(p->xfer_out, 65536 / 4, 1, out_ep);
if (error) {
printf("Could not open USB endpoint %d\n", out_ep);
libusb20_dev_free(pdev);
return;
}
p->usb_dev = pdev;
p->usb_iface = iface;
p->errors = 0;
if (p->control_ep_test)
ntest += 7;
if (p->data_stress_test)
ntest += 1;
if (ntest == 0) {
printf("No tests selected\n");
} else {
if (p->control_ep_test) {
for (x = 1; x != 8; x++) {
usb_modem_control_ep_test(p,
(p->duration + ntest - 1) / ntest, x);
}
}
if (p->data_stress_test) {
usb_modem_data_stress_test(p,
(p->duration + ntest - 1) / ntest);
}
}
printf("\nDone\n");
libusb20_dev_free(pdev);
}
void
show_host_modem_test(uint8_t level, struct uaddr uaddr, uint32_t duration)
{
uint8_t retval;
set_defaults(&modem);
modem.duration = duration;
while (1) {
retval = usb_ts_show_menu(level, "Modem Test Parameters",
" 1) Execute Data Stress Test: <%s>\n"
" 2) Execute Modem Control Endpoint Test: <%s>\n"
" 3) Use random transmit length: <%s>\n"
" 4) Use random transmit delay: <%s> ms\n"
" 5) Use vendor specific interface: <%s>\n"
"10) Loop data: <%s>\n"
"13) Set test duration: <%d> seconds\n"
"20) Reset parameters\n"
"30) Start test (VID=0x%04x, PID=0x%04x)\n"
"40) Select another device\n"
" x) Return to previous menu \n",
(modem.data_stress_test ? "YES" : "NO"),
(modem.control_ep_test ? "YES" : "NO"),
(modem.random_tx_length ? "YES" : "NO"),
(modem.random_tx_delay ? "16" : "0"),
(modem.use_vendor_specific ? "YES" : "NO"),
(modem.loop_data ? "YES" : "NO"),
(int)(modem.duration),
(int)uaddr.vid, (int)uaddr.pid);
switch (retval) {
case 0:
break;
case 1:
modem.data_stress_test ^= 1;
break;
case 2:
modem.control_ep_test ^= 1;
break;
case 3:
modem.random_tx_length ^= 1;
break;
case 4:
modem.random_tx_delay ^= 1;
break;
case 5:
modem.use_vendor_specific ^= 1;
modem.control_ep_test = 0;
break;
case 10:
modem.loop_data ^= 1;
break;
case 13:
modem.duration = get_integer();
break;
case 20:
set_defaults(&modem);
break;
case 30:
exec_host_modem_test(&modem, uaddr);
break;
case 40:
show_host_device_selection(level + 1, &uaddr);
break;
default:
return;
}
}
}
diff --git a/tools/tools/usbtest/usb_msc_test.c b/tools/tools/usbtest/usb_msc_test.c
index 8a67d040f63c..713da381820e 100644
--- a/tools/tools/usbtest/usb_msc_test.c
+++ b/tools/tools/usbtest/usb_msc_test.c
@@ -1,1330 +1,1329 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2007-2022 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <err.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include <sys/sysctl.h>
#include <sys/time.h>
#include <libusb20.h>
#include <libusb20_desc.h>
#include <dev/usb/usb_endian.h>
#include "usbtest.h"
#include "usb_msc_test.h"
/* Command Block Wrapper */
typedef struct {
uDWord dCBWSignature;
#define CBWSIGNATURE 0x43425355
uDWord dCBWTag;
uDWord dCBWDataTransferLength;
uByte bCBWFlags;
#define CBWFLAGS_OUT 0x00
#define CBWFLAGS_IN 0x80
uByte bCBWLUN;
uByte bCDBLength;
#define CBWCDBLENGTH 16
uByte CBWCDB[CBWCDBLENGTH];
} umass_bbb_cbw_t;
#define UMASS_BBB_CBW_SIZE 31
/* Command Status Wrapper */
typedef struct {
uDWord dCSWSignature;
#define CSWSIGNATURE 0x53425355
#define CSWSIGNATURE_IMAGINATION_DBX1 0x43425355
#define CSWSIGNATURE_OLYMPUS_C1 0x55425355
uDWord dCSWTag;
uDWord dCSWDataResidue;
uByte bCSWStatus;
#define CSWSTATUS_GOOD 0x0
#define CSWSTATUS_FAILED 0x1
#define CSWSTATUS_PHASE 0x2
} umass_bbb_csw_t;
#define UMASS_BBB_CSW_SIZE 13
#define SC_READ_6 0x08
#define SC_READ_10 0x28
#define SC_READ_12 0xa8
#define SC_WRITE_6 0x0a
#define SC_WRITE_10 0x2a
#define SC_WRITE_12 0xaa
static struct stats {
uint64_t xfer_error;
uint64_t xfer_success;
uint64_t xfer_reset;
uint64_t xfer_rx_bytes;
uint64_t xfer_tx_bytes;
uint64_t data_error;
} stats;
static uint32_t xfer_current_id;
static uint32_t xfer_wrapper_sig;
static uint32_t block_size = 512;
static struct libusb20_transfer *xfer_in;
static struct libusb20_transfer *xfer_out;
static struct libusb20_device *usb_pdev;
static uint8_t usb_iface;
static int sense_recurse;
/*
* SCSI commands sniffed off the wire - LUN maybe needs to be
* adjusted! Refer to "dev/usb/storage/ustorage_fs.c" for more
* information.
*/
static uint8_t mode_sense_6[0x6] = {0x1a, 0, 0x3f, 0, 0x0c};
static uint8_t read_capacity[0xA] = {0x25,};
static uint8_t request_sense[0xC] = {0x03, 0, 0, 0, 0x12};
static uint8_t test_unit_ready[0x6] = {0};
static uint8_t mode_page_inquiry[0x6] = {0x12, 1, 0x80, 0, 0xff, 0};
static uint8_t request_invalid[0xC] = {0xEA, 0, 0, 0, 0};
static uint8_t prevent_removal[0x6] = {0x1E, 0, 0, 0, 1};
static uint8_t read_toc[0xA] = {0x43, 0x02, 0, 0, 0, 0xAA, 0, 0x0C};
#define TIMEOUT_FILTER(x) (x)
static void usb_request_sense(uint8_t lun);
static void
do_msc_reset(uint8_t lun)
{
struct LIBUSB20_CONTROL_SETUP_DECODED setup;
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &setup);
setup.bmRequestType = LIBUSB20_REQUEST_TYPE_CLASS |
LIBUSB20_RECIPIENT_INTERFACE;
setup.bRequest = 0xFF; /* BBB reset */
setup.wValue = 0;
setup.wIndex = usb_iface;
setup.wLength = 0;
if (libusb20_dev_request_sync(usb_pdev, &setup, NULL, NULL, 5000, 0)) {
printf("ERROR: %s\n", __FUNCTION__);
stats.xfer_error++;
}
libusb20_tr_clear_stall_sync(xfer_in);
libusb20_tr_clear_stall_sync(xfer_out);
stats.xfer_reset++;
usb_request_sense(lun);
}
static uint8_t
do_msc_cmd(uint8_t *pcmd, uint8_t cmdlen, void *pdata, uint32_t datalen,
uint8_t isread, uint8_t isshort, uint8_t lun, uint8_t flags)
{
umass_bbb_cbw_t cbw;
umass_bbb_csw_t csw;
struct libusb20_transfer *xfer_io;
uint32_t actlen;
uint32_t timeout;
int error;
memset(&cbw, 0, sizeof(cbw));
USETDW(cbw.dCBWSignature, xfer_wrapper_sig);
USETDW(cbw.dCBWTag, xfer_current_id);
xfer_current_id++;
USETDW(cbw.dCBWDataTransferLength, datalen);
cbw.bCBWFlags = (isread ? CBWFLAGS_IN : CBWFLAGS_OUT);
cbw.bCBWLUN = lun;
cbw.bCDBLength = cmdlen;
bcopy(pcmd, cbw.CBWCDB, cmdlen);
actlen = 0;
timeout = ((datalen + 299999) / 300000) * 1000;
timeout += 5000;
if ((error = libusb20_tr_bulk_intr_sync(xfer_out,
&cbw, sizeof(cbw), &actlen, TIMEOUT_FILTER(1000)))) {
printf("ERROR: CBW reception: %d\n", error);
do_msc_reset(lun);
return (1);
}
if (actlen != sizeof(cbw)) {
printf("ERROR: CBW length: %d != %d\n",
actlen, (int)sizeof(cbw));
do_msc_reset(lun);
return (1);
}
if (flags & 1)
datalen /= 2;
if (datalen != 0) {
xfer_io = isread ? xfer_in : xfer_out;
if ((error = libusb20_tr_bulk_intr_sync(xfer_io,
pdata, datalen, &actlen, TIMEOUT_FILTER(timeout)))) {
printf("ERROR: Data transfer: %d\n", error);
do_msc_reset(lun);
return (1);
}
if ((actlen != datalen) && (!isshort)) {
printf("ERROR: Short data: %d of %d bytes\n",
actlen, datalen);
do_msc_reset(lun);
return (1);
}
}
actlen = 0;
timeout = 8;
do {
error = libusb20_tr_bulk_intr_sync(xfer_in, &csw,
sizeof(csw), &actlen, TIMEOUT_FILTER(1000));
if (error) {
if (error == LIBUSB20_TRANSFER_TIMED_OUT) {
printf("TIMEOUT: Trying to get CSW again. "
"%d tries left.\n", timeout);
} else {
break;
}
} else {
break;
}
} while (--timeout);
if (error) {
libusb20_tr_clear_stall_sync(xfer_in);
error = libusb20_tr_bulk_intr_sync(xfer_in, &csw,
sizeof(csw), &actlen, TIMEOUT_FILTER(1000));
if (error) {
libusb20_tr_clear_stall_sync(xfer_in);
printf("ERROR: Could not read CSW: Stalled or "
"timeout (%d).\n", error);
do_msc_reset(lun);
return (1);
}
}
if (UGETDW(csw.dCSWSignature) != CSWSIGNATURE) {
printf("ERROR: Wrong CSW signature\n");
do_msc_reset(lun);
return (1);
}
if (actlen != sizeof(csw)) {
printf("ERROR: Wrong CSW length: %d != %d\n",
actlen, (int)sizeof(csw));
do_msc_reset(lun);
return (1);
}
if (csw.bCSWStatus != 0) {
printf("ERROR: CSW status: %d\n", (int)csw.bCSWStatus);
return (1);
} else {
stats.xfer_success++;
return (0);
}
}
static void
do_msc_shorter_cmd(uint8_t lun)
{
uint8_t buffer[sizeof(umass_bbb_cbw_t)];
int actlen;
int error;
int x;
memset(buffer, 0, sizeof(buffer));
for (x = 0; x != (sizeof(buffer) - 1); x++) {
error = libusb20_tr_bulk_intr_sync(xfer_out,
buffer, x, &actlen, 250);
printf("Sent short %d of %d bytes wrapper block, "
"status = %d\n", x, (int)(sizeof(buffer) - 1),
error);
do_msc_reset(lun);
if (error != 0) {
printf("ERROR: Too short command wrapper "
"was not accepted\n");
stats.xfer_error++;
break;
}
}
}
static uint8_t
do_read_10(uint32_t lba, uint32_t len, void *buf, uint8_t lun)
{
static uint8_t cmd[10];
uint8_t retval;
cmd[0] = SC_READ_10;
len /= block_size;
cmd[2] = lba >> 24;
cmd[3] = lba >> 16;
cmd[4] = lba >> 8;
cmd[5] = lba >> 0;
cmd[7] = len >> 8;
cmd[8] = len;
retval = do_msc_cmd(cmd, 10, buf, len * block_size, 1, 0, lun, 0);
if (retval) {
printf("ERROR: %s\n", __FUNCTION__);
stats.xfer_error++;
}
return (retval);
}
static uint8_t
do_write_10(uint32_t lba, uint32_t len, void *buf, uint8_t lun)
{
static uint8_t cmd[10];
uint8_t retval;
uint8_t abort;
cmd[0] = SC_WRITE_10;
abort = len & 1;
len /= block_size;
cmd[2] = lba >> 24;
cmd[3] = lba >> 16;
cmd[4] = lba >> 8;
cmd[5] = lba >> 0;
cmd[7] = len >> 8;
cmd[8] = len;
retval = do_msc_cmd(cmd, 10, buf, (len * block_size), 0, 0, lun, abort);
if (retval) {
printf("ERROR: %s\n", __FUNCTION__);
stats.xfer_error++;
}
return (retval);
}
static void
do_io_test(struct usb_msc_params *p, uint8_t lun, uint32_t lba_max,
uint8_t *buffer, uint8_t *reference)
{
uint32_t io_offset;
uint32_t io_size;
uint32_t temp;
uint8_t do_read;
uint8_t retval;
switch (p->io_mode) {
case USB_MSC_IO_MODE_WRITE_ONLY:
do_read = 0;
break;
case USB_MSC_IO_MODE_READ_WRITE:
do_read = (usb_ts_rand_noise() & 1);
break;
default:
do_read = 1;
break;
}
switch (p->io_offset) {
case USB_MSC_IO_OFF_RANDOM:
io_offset = usb_ts_rand_noise();
break;
default:
io_offset = 0;
break;
}
switch (p->io_delay) {
case USB_MSC_IO_DELAY_RANDOM_10MS:
usleep(((uint32_t)usb_ts_rand_noise()) % 10000U);
break;
case USB_MSC_IO_DELAY_RANDOM_100MS:
usleep(((uint32_t)usb_ts_rand_noise()) % 100000U);
break;
case USB_MSC_IO_DELAY_FIXED_10MS:
usleep(10000);
break;
case USB_MSC_IO_DELAY_FIXED_100MS:
usleep(100000);
break;
default:
break;
}
switch (p->io_size) {
case USB_MSC_IO_SIZE_RANDOM:
io_size = ((uint32_t)usb_ts_rand_noise()) & 65535U;
break;
case USB_MSC_IO_SIZE_INCREASING:
io_size = (xfer_current_id & 65535U);
break;
case USB_MSC_IO_SIZE_FIXED_1BLK:
io_size = 1;
break;
case USB_MSC_IO_SIZE_FIXED_2BLK:
io_size = 2;
break;
case USB_MSC_IO_SIZE_FIXED_4BLK:
io_size = 4;
break;
case USB_MSC_IO_SIZE_FIXED_8BLK:
io_size = 8;
break;
case USB_MSC_IO_SIZE_FIXED_16BLK:
io_size = 16;
break;
case USB_MSC_IO_SIZE_FIXED_32BLK:
io_size = 32;
break;
case USB_MSC_IO_SIZE_FIXED_64BLK:
io_size = 64;
break;
case USB_MSC_IO_SIZE_FIXED_128BLK:
io_size = 128;
break;
case USB_MSC_IO_SIZE_FIXED_256BLK:
io_size = 256;
break;
case USB_MSC_IO_SIZE_FIXED_512BLK:
io_size = 512;
break;
case USB_MSC_IO_SIZE_FIXED_1024BLK:
io_size = 1024;
break;
default:
io_size = 1;
break;
}
if (io_size == 0)
io_size = 1;
io_offset %= lba_max;
temp = (lba_max - io_offset);
if (io_size > temp)
io_size = temp;
if (do_read) {
retval = do_read_10(io_offset, io_size * block_size,
buffer + (io_offset * block_size), lun);
if (retval == 0) {
if (bcmp(buffer + (io_offset * block_size),
reference + (io_offset * block_size),
io_size * block_size)) {
printf("ERROR: Data comparison failure\n");
stats.data_error++;
retval = 1;
}
}
stats.xfer_rx_bytes += (io_size * block_size);
} else {
retval = do_write_10(io_offset, io_size * block_size,
reference + (io_offset * block_size), lun);
stats.xfer_tx_bytes += (io_size * block_size);
}
if ((stats.xfer_error + stats.data_error +
stats.xfer_reset) >= p->max_errors) {
printf("Maximum number of errors exceeded\n");
p->done = 1;
}
}
static void
usb_request_sense(uint8_t lun)
{
uint8_t dummy_buf[255];
if (sense_recurse)
return;
sense_recurse++;
do_msc_cmd(request_sense, sizeof(request_sense),
dummy_buf, 255, 1, 1, lun, 0);
sense_recurse--;
}
static void
usb_msc_test(struct usb_msc_params *p)
{
struct stats last_stat;
struct timeval sub_tv;
struct timeval ref_tv;
struct timeval res_tv;
uint8_t *buffer = NULL;
uint8_t *reference = NULL;
uint32_t dummy_buf[65536 / 4];
uint32_t lba_max;
uint32_t x;
uint32_t y;
uint32_t capacity_lba;
uint32_t capacity_bs;
time_t last_sec;
uint8_t lun;
int tries;
memset(&last_stat, 0, sizeof(last_stat));
switch (p->io_lun) {
case USB_MSC_IO_LUN_0:
lun = 0;
break;
case USB_MSC_IO_LUN_1:
lun = 1;
break;
case USB_MSC_IO_LUN_2:
lun = 2;
break;
case USB_MSC_IO_LUN_3:
lun = 3;
break;
default:
lun = 0;
break;
}
p->done = 0;
sense_recurse = p->try_sense_on_error ? 0 : 1;
printf("Resetting device ...\n");
do_msc_reset(lun);
printf("Testing SCSI commands ...\n");
if (p->try_all_lun) {
printf("Requesting sense from LUN 0..255 ... ");
for (x = y = 0; x != 256; x++) {
if (do_msc_cmd(mode_sense_6, sizeof(mode_sense_6),
dummy_buf, 255, 1, 1, x, 0))
y++;
if (libusb20_dev_check_connected(usb_pdev) != 0) {
printf(" disconnect ");
break;
}
}
printf("Passed=%d, Failed=%d\n", 256 - y, y);
}
do_msc_cmd(mode_sense_6, sizeof(mode_sense_6),
dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(request_sense, sizeof(request_sense),
dummy_buf, 255, 1, 1, lun, 0);
for (tries = 0; tries != 4; tries++) {
memset(dummy_buf, 0, sizeof(dummy_buf));
if (do_msc_cmd(read_capacity, sizeof(read_capacity),
dummy_buf, 255, 1, 1, lun, 0) != 0) {
printf("Cannot read disk capacity (%u / 4)\n", tries);
if (tries == 3)
return;
usleep(50000);
continue;
} else {
break;
}
}
capacity_lba = be32toh(dummy_buf[0]);
capacity_bs = be32toh(dummy_buf[1]);
printf("Disk reports a capacity of LBA=%u and BS=%u\n",
capacity_lba, capacity_bs);
block_size = capacity_bs;
if (capacity_bs > 65535) {
printf("Blocksize is too big\n");
return;
}
if (capacity_bs < 1) {
printf("Blocksize is too small\n");
return;
}
if (capacity_bs != 512)
printf("INFO: Blocksize is not 512 bytes\n");
if (p->try_shorter_wrapper_block) {
printf("Trying too short command wrapper:\n");
do_msc_shorter_cmd(lun);
}
if (p->try_invalid_scsi_command) {
int status;
for (tries = 0; tries != 4; tries++) {
printf("Trying invalid SCSI command: ");
status = do_msc_cmd(request_invalid,
sizeof(request_invalid), dummy_buf,
255, 1, 1, lun, 0);
printf("Result%s as expected\n", status ? "" : " NOT");
usleep(50000);
}
}
if (p->try_invalid_wrapper_block) {
int status;
for (tries = 0; tries != 4; tries++) {
printf("Trying invalid USB wrapper block signature: ");
xfer_wrapper_sig = 0x55663322;
status = do_msc_cmd(read_capacity,
sizeof(read_capacity), dummy_buf,
255, 1, 1, lun, 0);
printf("Result%s as expected\n", status ? "" : " NOT");
xfer_wrapper_sig = CBWSIGNATURE;
usleep(50000);
}
}
do_msc_cmd(request_sense, sizeof(request_sense), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(read_capacity, sizeof(read_capacity), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(request_sense, sizeof(request_sense), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(request_sense, sizeof(request_sense), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(request_sense, sizeof(request_sense), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(request_sense, sizeof(request_sense), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(test_unit_ready, sizeof(test_unit_ready), 0, 0, 1, 1, lun, 0);
do_msc_cmd(read_capacity, sizeof(read_capacity), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(mode_page_inquiry, sizeof(mode_page_inquiry), dummy_buf, 255, 1, 1, lun, 0);
do_msc_cmd(mode_page_inquiry, sizeof(mode_page_inquiry), dummy_buf, 255, 1, 1, lun, 0);
if (do_msc_cmd(prevent_removal, sizeof(prevent_removal),
0, 0, 1, 1, lun, 0)) {
printf("INFO: Prevent medium removal failed\n");
}
if (do_msc_cmd(read_toc, sizeof(read_toc),
dummy_buf, 255, 1, 1, lun, 0)) {
printf("INFO: Read Table Of Content failed\n");
}
if (p->try_last_lba) {
for (y = 0, x = (1UL << 31); x; x >>= 1) {
if (do_read_10(x | y, block_size, dummy_buf, lun) == 0)
y |= x;
}
printf("Highest readable LBA: %u (%s), "
"Capacity is %u MBytes\n", y,
(capacity_lba != y) ? "WRONG" : "OK",
(int)((((uint64_t)(y) * (uint64_t)block_size) +
(uint64_t)block_size) / 1000000ULL));
} else {
y = capacity_lba;
printf("Highest readable LBA: %u (not "
"verified), Capacity is %u MBytes\n", y,
(int)((((uint64_t)(y) * (uint64_t)block_size) +
(uint64_t)block_size) / 1000000ULL));
}
if (y != 0xFFFFFFFFU)
y++;
lba_max = y;
switch (p->io_area) {
case USB_MSC_IO_AREA_1MB:
lba_max = 1024;
break;
case USB_MSC_IO_AREA_16MB:
lba_max = 1024 * 16;
break;
case USB_MSC_IO_AREA_256MB:
lba_max = 1024 * 256;
break;
case USB_MSC_IO_AREA_COMPLETE:
default:
break;
}
if (lba_max > 65535)
lba_max = 65535;
printf("Highest testable LBA: %u\n", (int)lba_max);
buffer = malloc(block_size * lba_max);
if (buffer == NULL) {
printf("ERROR: Could not allocate memory\n");
goto fail;
}
reference = malloc(block_size * lba_max);
if (reference == NULL) {
printf("ERROR: Could not allocate memory\n");
goto fail;
}
retry_read_init:
printf("Setting up initial data pattern, "
"LBA limit = %u ... ", lba_max);
switch (p->io_mode) {
case USB_MSC_IO_MODE_WRITE_ONCE_READ_ONLY:
case USB_MSC_IO_MODE_WRITE_ONLY:
case USB_MSC_IO_MODE_READ_WRITE:
switch (p->io_pattern) {
case USB_MSC_IO_PATTERN_FIXED:
for (x = 0; x != (block_size * lba_max); x += 8) {
reference[x + 0] = x >> 24;
reference[x + 1] = x >> 16;
reference[x + 2] = x >> 8;
reference[x + 3] = x >> 0;
reference[x + 4] = 0xFF;
reference[x + 5] = 0x00;
reference[x + 6] = 0xFF;
reference[x + 7] = 0x00;
}
if (do_write_10(0, lba_max * block_size,
reference, lun)) {
printf("FAILED\n");
lba_max /= 2;
if (lba_max)
goto retry_read_init;
goto fail;
}
printf("SUCCESS\n");
break;
case USB_MSC_IO_PATTERN_RANDOM:
for (x = 0; x != (block_size * lba_max); x++) {
reference[x] = usb_ts_rand_noise() % 255U;
}
if (do_write_10(0, lba_max * block_size,
reference, lun)) {
printf("FAILED\n");
lba_max /= 2;
if (lba_max)
goto retry_read_init;
goto fail;
}
printf("SUCCESS\n");
break;
default:
if (do_read_10(0, lba_max * block_size,
reference, lun)) {
printf("FAILED\n");
lba_max /= 2;
if (lba_max)
goto retry_read_init;
goto fail;
}
printf("SUCCESS\n");
break;
}
break;
default:
if (do_read_10(0, lba_max * block_size, reference, lun)) {
printf("FAILED\n");
lba_max /= 2;
if (lba_max)
goto retry_read_init;
goto fail;
}
printf("SUCCESS\n");
break;
}
if (p->try_abort_data_write) {
if (do_write_10(0, (2 * block_size) | 1, reference, lun))
printf("Aborted data write failed (OK)!\n");
else
printf("Aborted data write did not fail (ERROR)!\n");
if (do_read_10(0, (2 * block_size), reference, lun))
printf("Post-aborted data read failed (ERROR)\n");
else
printf("Post-aborted data read success (OK)!\n");
}
printf("Starting test ...\n");
gettimeofday(&ref_tv, 0);
last_sec = ref_tv.tv_sec;
printf("\n");
while (1) {
gettimeofday(&sub_tv, 0);
if (last_sec != sub_tv.tv_sec) {
printf("STATUS: ID=%u, RX=%u bytes/sec, "
"TX=%u bytes/sec, ERR=%u, RST=%u, DERR=%u\n",
(int)xfer_current_id,
(int)(stats.xfer_rx_bytes -
last_stat.xfer_rx_bytes),
(int)(stats.xfer_tx_bytes -
last_stat.xfer_tx_bytes),
(int)(stats.xfer_error),
(int)(stats.xfer_reset),
(int)(stats.data_error));
fflush(stdout);
last_sec = sub_tv.tv_sec;
last_stat = stats;
}
timersub(&sub_tv, &ref_tv, &res_tv);
if ((res_tv.tv_sec < 0) || (res_tv.tv_sec >= (int)p->duration))
break;
do_io_test(p, lun, lba_max, buffer, reference);
if (libusb20_dev_check_connected(usb_pdev) != 0) {
printf("Device disconnected\n");
break;
}
if (p->done) {
printf("Maximum number of errors exceeded\n");
break;
}
}
printf("\nTest done!\n");
fail:
if (buffer)
free(buffer);
if (reference)
free(reference);
}
void
show_host_device_selection(uint8_t level, struct uaddr *puaddr)
{
struct libusb20_backend *pbe;
struct libusb20_device *pdev;
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
struct uaddr uaddr[USB_DEVICES_MAX];
int index;
int sel;
const char *ptr;
top:
pbe = libusb20_be_alloc_default();
pdev = NULL;
index = 0;
printf("\n[] Select USB device:\n");
while ((pdev = libusb20_be_device_foreach(pbe, pdev))) {
if (libusb20_dev_get_mode(pdev) != LIBUSB20_MODE_HOST)
continue;
if (index < USB_DEVICES_MAX) {
ddesc = libusb20_dev_get_device_desc(pdev);
ptr = libusb20_dev_get_desc(pdev);
printf("%s%d) %s\n", indent[level], index, ptr);
uaddr[index].vid = ddesc->idVendor;
uaddr[index].pid = ddesc->idProduct;
uaddr[index].bus = libusb20_dev_get_bus_number(pdev);
uaddr[index].addr = libusb20_dev_get_address(pdev);
index++;
} else {
break;
}
}
printf("%sr) Refresh device list\n", indent[level]);
printf("%sx) Return to previous menu\n", indent[level]);
/* release data */
libusb20_be_free(pbe);
sel = get_integer();
if (sel == -2)
goto top;
if ((sel < 0) || (sel >= index)) {
memset(puaddr, 0, sizeof(*puaddr));
} else {
*puaddr = uaddr[sel];
}
}
struct libusb20_device *
find_usb_device(struct uaddr uaddr)
{
struct libusb20_backend *pbe = libusb20_be_alloc_default();
struct libusb20_device *pdev = NULL;
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
while ((pdev = libusb20_be_device_foreach(pbe, pdev))) {
if (libusb20_dev_get_mode(pdev) != LIBUSB20_MODE_HOST)
continue;
ddesc = libusb20_dev_get_device_desc(pdev);
if ((uaddr.vid == ddesc->idVendor) &&
(uaddr.pid == ddesc->idProduct) &&
(uaddr.addr == 0 ||
(uaddr.addr == libusb20_dev_get_address(pdev) &&
uaddr.bus == libusb20_dev_get_bus_number(pdev)))) {
libusb20_be_dequeue_device(pbe, pdev);
break;
}
}
/* release data */
libusb20_be_free(pbe);
return (pdev);
}
void
find_usb_endpoints(struct libusb20_device *pdev, uint8_t class,
uint8_t subclass, uint8_t protocol, uint8_t alt_setting,
uint8_t *pif, uint8_t *in_ep, uint8_t *out_ep, uint8_t next_if)
{
struct libusb20_config *pcfg;
struct libusb20_interface *iface;
struct libusb20_endpoint *ep;
uint8_t x;
uint8_t y;
uint8_t z;
*in_ep = 0;
*out_ep = 0;
*pif = 0;
pcfg = libusb20_dev_alloc_config(pdev,
libusb20_dev_get_config_index(pdev));
if (pcfg == NULL)
return;
for (x = 0; x != pcfg->num_interface; x++) {
y = alt_setting;
iface = (pcfg->interface + x);
if ((iface->desc.bInterfaceClass == class) &&
(iface->desc.bInterfaceSubClass == subclass ||
subclass == 255) &&
(iface->desc.bInterfaceProtocol == protocol ||
protocol == 255)) {
if (next_if) {
x++;
if (x == pcfg->num_interface)
break;
iface = (pcfg->interface + x);
}
*pif = x;
for (z = 0; z != iface->num_endpoints; z++) {
ep = iface->endpoints + z;
/* BULK only */
if ((ep->desc.bmAttributes & 3) != 2)
continue;
if (ep->desc.bEndpointAddress & 0x80)
*in_ep = ep->desc.bEndpointAddress;
else
*out_ep = ep->desc.bEndpointAddress;
}
break;
}
}
free(pcfg);
}
static void
exec_host_msc_test(struct usb_msc_params *p, struct uaddr uaddr)
{
struct libusb20_device *pdev;
uint8_t in_ep;
uint8_t out_ep;
uint8_t iface;
int error;
memset(&stats, 0, sizeof(stats));
xfer_current_id = 0;
xfer_wrapper_sig = CBWSIGNATURE;
pdev = find_usb_device(uaddr);
if (pdev == NULL) {
printf("USB device not found\n");
return;
}
find_usb_endpoints(pdev, 8, 6, 0x50, 0, &iface, &in_ep, &out_ep, 0);
if ((in_ep == 0) || (out_ep == 0)) {
printf("Could not find USB endpoints\n");
libusb20_dev_free(pdev);
return;
}
printf("Attaching to: %s @ iface %d\n",
libusb20_dev_get_desc(pdev), iface);
if (libusb20_dev_open(pdev, 2)) {
printf("Could not open USB device\n");
libusb20_dev_free(pdev);
return;
}
if (libusb20_dev_detach_kernel_driver(pdev, iface)) {
printf("WARNING: Could not detach kernel driver\n");
}
xfer_in = libusb20_tr_get_pointer(pdev, 0);
error = libusb20_tr_open(xfer_in, 65536, 1, in_ep);
if (error) {
printf("Could not open USB endpoint %d\n", in_ep);
libusb20_dev_free(pdev);
return;
}
xfer_out = libusb20_tr_get_pointer(pdev, 1);
error = libusb20_tr_open(xfer_out, 65536, 1, out_ep);
if (error) {
printf("Could not open USB endpoint %d\n", out_ep);
libusb20_dev_free(pdev);
return;
}
usb_pdev = pdev;
usb_iface = iface;
usb_msc_test(p);
libusb20_dev_free(pdev);
}
static void
set_defaults(struct usb_msc_params *p)
{
memset(p, 0, sizeof(*p));
p->duration = 60; /* seconds */
p->try_invalid_scsi_command = 1;
p->try_invalid_wrapper_block = 1;
p->try_last_lba = 1;
p->max_errors = -1;
}
static const char *
get_io_mode(const struct usb_msc_params *p)
{
; /* indent fix */
switch (p->io_mode) {
case USB_MSC_IO_MODE_READ_ONLY:
return ("Read Only");
case USB_MSC_IO_MODE_WRITE_ONCE_READ_ONLY:
return ("Write Once, Read Only");
case USB_MSC_IO_MODE_WRITE_ONLY:
return ("Write Only");
case USB_MSC_IO_MODE_READ_WRITE:
return ("Read and Write");
default:
return ("Unknown");
}
}
static const char *
get_io_pattern(const struct usb_msc_params *p)
{
; /* indent fix */
switch (p->io_pattern) {
case USB_MSC_IO_PATTERN_FIXED:
return ("Fixed");
case USB_MSC_IO_PATTERN_RANDOM:
return ("Random");
case USB_MSC_IO_PATTERN_PRESERVE:
return ("Preserve");
default:
return ("Unknown");
}
}
static const char *
get_io_size(const struct usb_msc_params *p)
{
; /* indent fix */
switch (p->io_size) {
case USB_MSC_IO_SIZE_RANDOM:
return ("Random");
case USB_MSC_IO_SIZE_INCREASING:
return ("Increasing");
case USB_MSC_IO_SIZE_FIXED_1BLK:
return ("Single block");
case USB_MSC_IO_SIZE_FIXED_2BLK:
return ("2 blocks");
case USB_MSC_IO_SIZE_FIXED_4BLK:
return ("4 blocks");
case USB_MSC_IO_SIZE_FIXED_8BLK:
return ("8 blocks");
case USB_MSC_IO_SIZE_FIXED_16BLK:
return ("16 blocks");
case USB_MSC_IO_SIZE_FIXED_32BLK:
return ("32 blocks");
case USB_MSC_IO_SIZE_FIXED_64BLK:
return ("64 blocks");
case USB_MSC_IO_SIZE_FIXED_128BLK:
return ("128 blocks");
case USB_MSC_IO_SIZE_FIXED_256BLK:
return ("256 blocks");
case USB_MSC_IO_SIZE_FIXED_512BLK:
return ("512 blocks");
case USB_MSC_IO_SIZE_FIXED_1024BLK:
return ("1024 blocks");
default:
return ("Unknown");
}
}
static const char *
get_io_delay(const struct usb_msc_params *p)
{
; /* indent fix */
switch (p->io_delay) {
case USB_MSC_IO_DELAY_NONE:
return ("None");
case USB_MSC_IO_DELAY_RANDOM_10MS:
return ("Random 10ms");
case USB_MSC_IO_DELAY_RANDOM_100MS:
return ("Random 100ms");
case USB_MSC_IO_DELAY_FIXED_10MS:
return ("Fixed 10ms");
case USB_MSC_IO_DELAY_FIXED_100MS:
return ("Fixed 100ms");
default:
return ("Unknown");
}
}
static const char *
get_io_offset(const struct usb_msc_params *p)
{
; /* indent fix */
switch (p->io_offset) {
case USB_MSC_IO_OFF_START_OF_DISK:
return ("Start Of Disk");
case USB_MSC_IO_OFF_RANDOM:
return ("Random Offset");
default:
return ("Unknown");
}
}
static const char *
get_io_area(const struct usb_msc_params *p)
{
; /* indent fix */
switch (p->io_area) {
case USB_MSC_IO_AREA_COMPLETE:
return ("Complete Disk");
case USB_MSC_IO_AREA_1MB:
return ("First MegaByte");
case USB_MSC_IO_AREA_16MB:
return ("First 16 MegaBytes");
case USB_MSC_IO_AREA_256MB:
return ("First 256 MegaBytes");
default:
return ("Unknown");
}
}
void
show_host_msc_test(uint8_t level, struct uaddr uaddr, uint32_t duration)
{
struct usb_msc_params params;
uint8_t retval;
set_defaults(&params);
params.duration = duration;
while (1) {
retval = usb_ts_show_menu(level,
"Mass Storage Test Parameters",
" 1) Toggle I/O mode: <%s>\n"
" 2) Toggle I/O size: <%s>\n"
" 3) Toggle I/O delay: <%s>\n"
" 4) Toggle I/O offset: <%s>\n"
" 5) Toggle I/O area: <%s>\n"
" 6) Toggle I/O pattern: <%s>\n"
" 7) Toggle try invalid SCSI command: <%s>\n"
" 8) Toggle try invalid wrapper block: <%s>\n"
" 9) Toggle try invalid MaxPacketSize: <%s>\n"
"10) Toggle try last Logical Block Address: <%s>\n"
"11) Toggle I/O lun: <%d>\n"
"12) Set maximum number of errors: <%d>\n"
"13) Set test duration: <%d> seconds\n"
"14) Toggle try aborted write transfer: <%s>\n"
"15) Toggle request sense on error: <%s>\n"
"16) Toggle try all LUN: <%s>\n"
"17) Toggle try too short wrapper block: <%s>\n"
"20) Reset parameters\n"
"30) Start test (VID=0x%04x, PID=0x%04x)\n"
"40) Select another device\n"
" x) Return to previous menu \n",
get_io_mode(&params),
get_io_size(&params),
get_io_delay(&params),
get_io_offset(&params),
get_io_area(&params),
get_io_pattern(&params),
(params.try_invalid_scsi_command ? "YES" : "NO"),
(params.try_invalid_wrapper_block ? "YES" : "NO"),
(params.try_invalid_max_packet_size ? "YES" : "NO"),
(params.try_last_lba ? "YES" : "NO"),
params.io_lun,
(int)params.max_errors,
(int)params.duration,
(params.try_abort_data_write ? "YES" : "NO"),
(params.try_sense_on_error ? "YES" : "NO"),
(params.try_all_lun ? "YES" : "NO"),
(params.try_shorter_wrapper_block ? "YES" : "NO"),
uaddr.vid, uaddr.pid);
switch (retval) {
case 0:
break;
case 1:
params.io_mode++;
params.io_mode %= USB_MSC_IO_MODE_MAX;
break;
case 2:
params.io_size++;
params.io_size %= USB_MSC_IO_SIZE_MAX;
break;
case 3:
params.io_delay++;
params.io_delay %= USB_MSC_IO_DELAY_MAX;
break;
case 4:
params.io_offset++;
params.io_offset %= USB_MSC_IO_OFF_MAX;
break;
case 5:
params.io_area++;
params.io_area %= USB_MSC_IO_AREA_MAX;
break;
case 6:
params.io_pattern++;
params.io_pattern %= USB_MSC_IO_PATTERN_MAX;
break;
case 7:
params.try_invalid_scsi_command ^= 1;
break;
case 8:
params.try_invalid_wrapper_block ^= 1;
break;
case 9:
params.try_invalid_max_packet_size ^= 1;
break;
case 10:
params.try_last_lba ^= 1;
break;
case 11:
params.io_lun++;
params.io_lun %= USB_MSC_IO_LUN_MAX;
break;
case 12:
params.max_errors = get_integer();
break;
case 13:
params.duration = get_integer();
break;
case 14:
params.try_abort_data_write ^= 1;
break;
case 15:
params.try_sense_on_error ^= 1;
break;
case 16:
params.try_all_lun ^= 1;
break;
case 17:
params.try_shorter_wrapper_block ^= 1;
break;
case 20:
set_defaults(&params);
break;
case 30:
exec_host_msc_test(&params, uaddr);
break;
case 40:
show_host_device_selection(level + 1, &uaddr);
break;
default:
return;
}
}
}
diff --git a/tools/tools/usbtest/usb_msc_test.h b/tools/tools/usbtest/usb_msc_test.h
index 4c6a4c4bcf5b..5718e6cd513f 100644
--- a/tools/tools/usbtest/usb_msc_test.h
+++ b/tools/tools/usbtest/usb_msc_test.h
@@ -1,121 +1,120 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2010 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _USB_MSC_TEST_H_
#define _USB_MSC_TEST_H_
enum {
USB_MSC_IO_MODE_READ_ONLY,
USB_MSC_IO_MODE_WRITE_ONCE_READ_ONLY,
USB_MSC_IO_MODE_WRITE_ONLY,
USB_MSC_IO_MODE_READ_WRITE,
USB_MSC_IO_MODE_MAX,
};
enum {
USB_MSC_IO_PATTERN_FIXED,
USB_MSC_IO_PATTERN_RANDOM,
USB_MSC_IO_PATTERN_PRESERVE,
USB_MSC_IO_PATTERN_MAX,
};
enum {
USB_MSC_IO_SIZE_RANDOM,
USB_MSC_IO_SIZE_INCREASING,
USB_MSC_IO_SIZE_FIXED_1BLK,
USB_MSC_IO_SIZE_FIXED_2BLK,
USB_MSC_IO_SIZE_FIXED_4BLK,
USB_MSC_IO_SIZE_FIXED_8BLK,
USB_MSC_IO_SIZE_FIXED_16BLK,
USB_MSC_IO_SIZE_FIXED_32BLK,
USB_MSC_IO_SIZE_FIXED_64BLK,
USB_MSC_IO_SIZE_FIXED_128BLK,
USB_MSC_IO_SIZE_FIXED_256BLK,
USB_MSC_IO_SIZE_FIXED_512BLK,
USB_MSC_IO_SIZE_FIXED_1024BLK,
USB_MSC_IO_SIZE_MAX,
};
enum {
USB_MSC_IO_DELAY_NONE,
USB_MSC_IO_DELAY_RANDOM_10MS,
USB_MSC_IO_DELAY_RANDOM_100MS,
USB_MSC_IO_DELAY_FIXED_10MS,
USB_MSC_IO_DELAY_FIXED_100MS,
USB_MSC_IO_DELAY_MAX,
};
enum {
USB_MSC_IO_OFF_START_OF_DISK,
USB_MSC_IO_OFF_RANDOM,
USB_MSC_IO_OFF_MAX,
};
enum {
USB_MSC_IO_AREA_COMPLETE,
USB_MSC_IO_AREA_1MB,
USB_MSC_IO_AREA_16MB,
USB_MSC_IO_AREA_256MB,
USB_MSC_IO_AREA_MAX,
};
enum {
USB_MSC_IO_LUN_0,
USB_MSC_IO_LUN_1,
USB_MSC_IO_LUN_2,
USB_MSC_IO_LUN_3,
USB_MSC_IO_LUN_MAX,
};
struct usb_msc_params {
uint32_t duration;
uint32_t max_errors;
/* See "USB_MSC_XXX" enums */
uint8_t io_mode;
uint8_t io_size;
uint8_t io_delay;
uint8_t io_offset;
uint8_t io_area;
uint8_t io_pattern;
uint8_t io_lun;
/* booleans */
uint8_t try_invalid_scsi_command;
uint8_t try_invalid_wrapper_block;
uint8_t try_invalid_max_packet_size;
uint8_t try_shorter_wrapper_block;
uint8_t try_last_lba;
uint8_t try_abort_data_write;
uint8_t try_sense_on_error;
uint8_t try_all_lun;
uint8_t done;
};
#endif /* _USB_MSC_TEST_H_ */
diff --git a/tools/tools/usbtest/usbtest.c b/tools/tools/usbtest/usbtest.c
index 40d67589c5a9..adb46ef44b34 100644
--- a/tools/tools/usbtest/usbtest.c
+++ b/tools/tools/usbtest/usbtest.c
@@ -1,812 +1,811 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2010-2022 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdint.h>
#include <err.h>
#include <string.h>
#include <errno.h>
#include <stdarg.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/sysctl.h>
#include <dev/usb/usb_ioctl.h>
#include "usbtest.h"
#include <g_keyboard.h>
#include <g_mouse.h>
#include <g_modem.h>
#include <g_audio.h>
static uint8_t usb_ts_select[USB_TS_MAX_LEVELS];
const char *indent[USB_TS_MAX_LEVELS] = {
" ",
" ",
" ",
" ",
" ",
" ",
" ",
" ",
};
/* a perceptual white noise generator (after HPS' invention) */
int32_t
usb_ts_rand_noise(void)
{
uint32_t temp;
const uint32_t prime = 0xFFFF1D;
static uint32_t noise_rem = 1;
if (noise_rem & 1) {
noise_rem += prime;
}
noise_rem /= 2;
temp = noise_rem;
/* unsigned to signed conversion */
temp ^= 0x800000;
if (temp & 0x800000) {
temp |= (-0x800000);
}
return temp;
}
uint8_t
usb_ts_show_menu(uint8_t level, const char *title, const char *fmt,...)
{
va_list args;
uint8_t x;
uint8_t retval;
char *pstr;
char buf[16];
char menu[80 * 20];
va_start(args, fmt);
vsnprintf(menu, sizeof(menu), fmt, args);
va_end(args);
printf("[");
for (x = 0; x != level; x++) {
if ((x + 1) == level)
printf("%d", usb_ts_select[x]);
else
printf("%d.", usb_ts_select[x]);
}
printf("] - %s:\n\n", title);
x = 1;
for (pstr = menu; *pstr; pstr++) {
if (x != 0) {
printf("%s", indent[level]);
x = 0;
}
printf("%c", *pstr);
if (*pstr == '\n')
x = 1;
}
printf("\n>");
if (fgets(buf, sizeof(buf), stdin) == NULL)
err(1, "Cannot read input");
if (buf[0] == 'x')
retval = 255;
else
retval = atoi(buf);
usb_ts_select[level] = retval;
return (retval);
}
void
get_string(char *ptr, int size)
{
printf("\nEnter string>");
if (fgets(ptr, size, stdin) == NULL)
err(1, "Cannot read input");
ptr[size - 1] = 0;
size = strlen(ptr);
/* strip trailing newline, if any */
if (size == 0)
return;
else if (ptr[size - 1] == '\n')
ptr[size - 1] = 0;
}
int
get_integer(void)
{
char buf[32];
printf("\nEnter integer value>");
if (fgets(buf, sizeof(buf), stdin) == NULL)
err(1, "Cannot read input");
if (strcmp(buf, "x\n") == 0)
return (-1);
if (strcmp(buf, "r\n") == 0)
return (-2);
return ((int)strtol(buf, 0, 0));
}
static void
set_template(int template)
{
int error;
error = sysctlbyname("hw.usb.template", NULL, NULL,
&template, sizeof(template));
if (error != 0) {
printf("WARNING: Could not set USB template "
"to %d (error=%d)\n", template, errno);
}
}
static void
show_default_audio_select(uint8_t level)
{
int error;
int retval;
int mode = 0;
int pattern_interval = 128;
int throughput = 0;
size_t len;
char pattern[G_AUDIO_MAX_STRLEN] = {"0123456789abcdef"};
set_template(USB_TEMP_AUDIO);
while (1) {
error = sysctlbyname("hw.usb.g_audio.mode", NULL, NULL,
&mode, sizeof(mode));
if (error != 0) {
printf("WARNING: Could not set audio mode "
"to %d (error=%d)\n", mode, errno);
}
error = sysctlbyname("hw.usb.g_audio.pattern_interval", NULL, NULL,
&pattern_interval, sizeof(pattern_interval));
if (error != 0) {
printf("WARNING: Could not set pattern interval "
"to %d (error=%d)\n", pattern_interval, errno);
}
len = sizeof(throughput);
error = sysctlbyname("hw.usb.g_audio.throughput",
&throughput, &len, 0, 0);
if (error != 0) {
printf("WARNING: Could not get throughput "
"(error=%d)\n", errno);
}
error = sysctlbyname("hw.usb.g_audio.pattern", NULL, NULL,
&pattern, strlen(pattern));
if (error != 0) {
printf("WARNING: Could not set audio pattern "
"to '%s' (error=%d)\n", pattern, errno);
}
retval = usb_ts_show_menu(level, "Default Audio Settings",
"1) Set Silent mode %s\n"
"2) Set Dump mode %s\n"
"3) Set Loop mode %s\n"
"4) Set Pattern mode %s\n"
"5) Change DTMF pattern: '%s'\n"
"6) Change pattern advance interval: %d ms\n"
"x) Return to previous menu\n"
"s: Ready for enumeration\n"
"t: Throughput: %d bytes/second\n",
(mode == G_AUDIO_MODE_SILENT) ? "(selected)" : "",
(mode == G_AUDIO_MODE_DUMP) ? "(selected)" : "",
(mode == G_AUDIO_MODE_LOOP) ? "(selected)" : "",
(mode == G_AUDIO_MODE_PATTERN) ? "(selected)" : "",
pattern, pattern_interval, throughput);
switch (retval) {
case 0:
break;
case 1:
mode = G_AUDIO_MODE_SILENT;
break;
case 2:
mode = G_AUDIO_MODE_DUMP;
break;
case 3:
mode = G_AUDIO_MODE_LOOP;
break;
case 4:
mode = G_AUDIO_MODE_PATTERN;
break;
case 5:
get_string(pattern, sizeof(pattern));
break;
case 6:
pattern_interval = get_integer();
break;
default:
return;
}
}
}
static void
show_device_audio_select(uint8_t level)
{
uint8_t retval;
while (1) {
retval = usb_ts_show_menu(level, "Select Audio Device Model",
"1) Generic Audio Device\n"
"x) Return to previous menu\n");
switch (retval) {
case 0:
break;
case 1:
show_default_audio_select(level + 1);
break;
default:
return;
}
}
}
static void
show_device_msc_select(uint8_t level)
{
set_template(USB_TEMP_MSC);
}
static void
show_device_ethernet_select(uint8_t level)
{
set_template(USB_TEMP_CDCE);
}
static void
show_default_keyboard_select(uint8_t level)
{
int error;
int retval;
int mode = 0;
int interval = 1023;
char pattern[G_KEYBOARD_MAX_STRLEN] = {"abcdefpattern"};
set_template(USB_TEMP_KBD);
while (1) {
error = sysctlbyname("hw.usb.g_keyboard.mode", NULL, NULL,
&mode, sizeof(mode));
if (error != 0) {
printf("WARNING: Could not set keyboard mode "
" to %d (error=%d) \n", mode, errno);
}
error = sysctlbyname("hw.usb.g_keyboard.key_press_interval", NULL, NULL,
&interval, sizeof(interval));
if (error != 0) {
printf("WARNING: Could not set key press interval "
"to %d (error=%d)\n", interval, errno);
}
error = sysctlbyname("hw.usb.g_keyboard.key_press_pattern", NULL, NULL,
&pattern, strlen(pattern));
if (error != 0) {
printf("WARNING: Could not set key pattern "
"to '%s' (error=%d)\n", pattern, errno);
}
retval = usb_ts_show_menu(level, "Default Keyboard Settings",
"1) Set silent mode %s\n"
"2) Set pattern mode %s\n"
"3) Change pattern: '%s'\n"
"4) Change key press interval: %d ms\n"
"x) Return to previous menu\n"
"s: Ready for enumeration\n",
(mode == G_KEYBOARD_MODE_SILENT) ? "(selected)" : "",
(mode == G_KEYBOARD_MODE_PATTERN) ? "(selected)" : "",
pattern, interval);
switch (retval) {
case 0:
break;
case 1:
mode = G_KEYBOARD_MODE_SILENT;
break;
case 2:
mode = G_KEYBOARD_MODE_PATTERN;
break;
case 3:
get_string(pattern, sizeof(pattern));
break;
case 4:
interval = get_integer();
break;
default:
return;
}
}
}
static void
show_device_keyboard_select(uint8_t level)
{
uint8_t retval;
while (1) {
retval = usb_ts_show_menu(level, "Select Keyboard Model",
"1) Generic Keyboard \n"
"x) Return to previous menu \n");
switch (retval) {
case 0:
break;
case 1:
show_default_keyboard_select(level + 1);
break;
default:
return;
}
}
}
static void
show_default_mouse_select(uint8_t level)
{
int error;
int retval;
int mode = 0;
int cursor_interval = 128;
int cursor_radius = 75;
int button_interval = 0;
set_template(USB_TEMP_MOUSE);
while (1) {
error = sysctlbyname("hw.usb.g_mouse.mode", NULL, NULL,
&mode, sizeof(mode));
if (error != 0) {
printf("WARNING: Could not set mouse mode "
"to %d (error=%d)\n", mode, errno);
}
error = sysctlbyname("hw.usb.g_mouse.cursor_update_interval", NULL, NULL,
&cursor_interval, sizeof(cursor_interval));
if (error != 0) {
printf("WARNING: Could not set cursor update interval "
"to %d (error=%d)\n", cursor_interval, errno);
}
error = sysctlbyname("hw.usb.g_mouse.button_press_interval", NULL, NULL,
&button_interval, sizeof(button_interval));
if (error != 0) {
printf("WARNING: Could not set button press interval "
"to %d (error=%d)\n", button_interval, errno);
}
error = sysctlbyname("hw.usb.g_mouse.cursor_radius", NULL, NULL,
&cursor_radius, sizeof(cursor_radius));
if (error != 0) {
printf("WARNING: Could not set cursor radius "
"to %d (error=%d)\n", cursor_radius, errno);
}
retval = usb_ts_show_menu(level, "Default Mouse Settings",
"1) Set Silent mode %s\n"
"2) Set Circle mode %s\n"
"3) Set Square mode %s\n"
"4) Set Spiral mode %s\n"
"5) Change cursor radius: %d pixels\n"
"6) Change cursor update interval: %d ms\n"
"7) Change button[0] press interval: %d ms\n"
"x) Return to previous menu\n"
"s: Ready for enumeration\n",
(mode == G_MOUSE_MODE_SILENT) ? "(selected)" : "",
(mode == G_MOUSE_MODE_CIRCLE) ? "(selected)" : "",
(mode == G_MOUSE_MODE_BOX) ? "(selected)" : "",
(mode == G_MOUSE_MODE_SPIRAL) ? "(selected)" : "",
cursor_radius, cursor_interval, button_interval);
switch (retval) {
case 0:
break;
case 1:
mode = G_MOUSE_MODE_SILENT;
break;
case 2:
mode = G_MOUSE_MODE_CIRCLE;
break;
case 3:
mode = G_MOUSE_MODE_BOX;
break;
case 4:
mode = G_MOUSE_MODE_SPIRAL;
break;
case 5:
cursor_radius = get_integer();
break;
case 6:
cursor_interval = get_integer();
break;
case 7:
button_interval = get_integer();
break;
default:
return;
}
}
}
static void
show_device_mouse_select(uint8_t level)
{
uint8_t retval;
while (1) {
retval = usb_ts_show_menu(level, "Select Mouse Model",
"1) Generic Mouse\n"
"x) Return to previous menu\n");
switch (retval) {
case 0:
break;
case 1:
show_default_mouse_select(level + 1);
break;
default:
return;
}
}
}
static void
show_device_mtp_select(uint8_t level)
{
set_template(USB_TEMP_MTP);
}
static void
show_default_modem_select(uint8_t level)
{
int error;
int retval;
int mode = 0;
int pattern_interval = 128;
int throughput = 0;
size_t len;
char pattern[G_MODEM_MAX_STRLEN] = {"abcdefpattern"};
set_template(USB_TEMP_MODEM);
while (1) {
error = sysctlbyname("hw.usb.g_modem.mode", NULL, NULL,
&mode, sizeof(mode));
if (error != 0) {
printf("WARNING: Could not set modem mode "
"to %d (error=%d)\n", mode, errno);
}
error = sysctlbyname("hw.usb.g_modem.pattern_interval", NULL, NULL,
&pattern_interval, sizeof(pattern_interval));
if (error != 0) {
printf("WARNING: Could not set pattern interval "
"to %d (error=%d)\n", pattern_interval, errno);
}
len = sizeof(throughput);
error = sysctlbyname("hw.usb.g_modem.throughput",
&throughput, &len, 0, 0);
if (error != 0) {
printf("WARNING: Could not get throughput "
"(error=%d)\n", errno);
}
error = sysctlbyname("hw.usb.g_modem.pattern", NULL, NULL,
&pattern, strlen(pattern));
if (error != 0) {
printf("WARNING: Could not set modem pattern "
"to '%s' (error=%d)\n", pattern, errno);
}
retval = usb_ts_show_menu(level, "Default Modem Settings",
"1) Set Silent mode %s\n"
"2) Set Dump mode %s\n"
"3) Set Loop mode %s\n"
"4) Set Pattern mode %s\n"
"5) Change test pattern: '%s'\n"
"6) Change data transmit interval: %d ms\n"
"x) Return to previous menu\n"
"s: Ready for enumeration\n"
"t: Throughput: %d bytes/second\n",
(mode == G_MODEM_MODE_SILENT) ? "(selected)" : "",
(mode == G_MODEM_MODE_DUMP) ? "(selected)" : "",
(mode == G_MODEM_MODE_LOOP) ? "(selected)" : "",
(mode == G_MODEM_MODE_PATTERN) ? "(selected)" : "",
pattern, pattern_interval, throughput);
switch (retval) {
case 0:
break;
case 1:
mode = G_MODEM_MODE_SILENT;
break;
case 2:
mode = G_MODEM_MODE_DUMP;
break;
case 3:
mode = G_MODEM_MODE_LOOP;
break;
case 4:
mode = G_MODEM_MODE_PATTERN;
break;
case 5:
get_string(pattern, sizeof(pattern));
break;
case 6:
pattern_interval = get_integer();
break;
default:
return;
}
}
}
static void
show_device_modem_select(uint8_t level)
{
uint8_t retval;
while (1) {
retval = usb_ts_show_menu(level, "Select Modem Model",
"1) Generic Modem\n"
"x) Return to previous menu\n");
switch (retval) {
case 0:
break;
case 1:
show_default_modem_select(level + 1);
break;
default:
return;
}
}
}
static void
show_device_generic_select(uint8_t level)
{
}
static void
show_device_select(uint8_t level)
{
uint8_t retval;
while (1) {
retval = usb_ts_show_menu(level, "Select Device Mode Test Group",
"1) Audio (UAUDIO)\n"
"2) Mass Storage (MSC)\n"
"3) Ethernet (CDCE)\n"
"4) Keyboard Input Device (UKBD)\n"
"5) Mouse Input Device (UMS)\n"
"6) Message Transfer Protocol (MTP)\n"
"7) Modem (CDC)\n"
"8) Generic Endpoint Loopback (GENERIC)\n"
"x) Return to previous menu\n");
switch (retval) {
case 0:
break;
case 1:
show_device_audio_select(level + 1);
break;
case 2:
show_device_msc_select(level + 1);
break;
case 3:
show_device_ethernet_select(level + 1);
break;
case 4:
show_device_keyboard_select(level + 1);
break;
case 5:
show_device_mouse_select(level + 1);
break;
case 6:
show_device_mtp_select(level + 1);
break;
case 7:
show_device_modem_select(level + 1);
break;
case 8:
show_device_generic_select(level + 1);
break;
default:
return;
}
}
}
static void
show_host_select(uint8_t level)
{
int force_fs = 0;
int error;
uint32_t duration = 60;
struct uaddr uaddr = {};
uint8_t retval;
while (1) {
error = sysctlbyname("hw.usb.ehci.no_hs", NULL, NULL,
&force_fs, sizeof(force_fs));
if (error != 0) {
printf("WARNING: Could not set non-FS mode "
"to %d (error=%d)\n", force_fs, errno);
}
retval = usb_ts_show_menu(level, "Select Host Mode Test (via LibUSB)",
" 1) Select USB device (VID=0x%04x, PID=0x%04x, ugen%u.%u)\n"
" 2) Manually enter USB vendor and product ID\n"
" 3) Force FULL speed operation: <%s>\n"
" 4) Mass Storage (UMASS)\n"
" 5) Modem (UMODEM)\n"
"10) Start String Descriptor Test\n"
"11) Start Port Reset Test\n"
"12) Start Set Config Test\n"
"13) Start Get Descriptor Test\n"
"14) Start Suspend and Resume Test\n"
"15) Start Set and Clear Endpoint Stall Test\n"
"16) Start Set Alternate Interface Setting Test\n"
"17) Start Invalid Control Request Test\n"
"30) Duration: <%d> seconds\n"
"x) Return to previous menu\n",
uaddr.vid, uaddr.pid, uaddr.bus, uaddr.addr,
force_fs ? "YES" : "NO",
(int)duration);
switch (retval) {
case 0:
break;
case 1:
show_host_device_selection(level + 1, &uaddr);
break;
case 2:
/* only match VID and PID */
uaddr.vid = get_integer() & 0xFFFF;
uaddr.pid = get_integer() & 0xFFFF;
uaddr.bus = 0;
uaddr.addr = 0;
break;
case 3:
force_fs ^= 1;
break;
case 4:
show_host_msc_test(level + 1, uaddr, duration);
break;
case 5:
show_host_modem_test(level + 1, uaddr, duration);
break;
case 10:
usb_get_string_desc_test(uaddr);
break;
case 11:
usb_port_reset_test(uaddr, duration);
break;
case 12:
usb_set_config_test(uaddr, duration);
break;
case 13:
usb_get_descriptor_test(uaddr, duration);
break;
case 14:
usb_suspend_resume_test(uaddr, duration);
break;
case 15:
usb_set_and_clear_stall_test(uaddr);
break;
case 16:
usb_set_alt_interface_test(uaddr);
break;
case 17:
usb_control_ep_error_test(uaddr);
break;
case 30:
duration = get_integer();
break;
default:
return;
}
}
}
static void
show_mode_select(uint8_t level)
{
uint8_t retval;
while (1) {
retval = usb_ts_show_menu(level, "Select Computer Mode",
"1) This computer is Running the Device Side\n"
"2) This computer is Running the Host Side\n"
"x) Return to previous menu\n");
switch (retval) {
case 0:
break;
case 1:
show_device_select(level + 1);
break;
case 2:
show_host_select(level + 1);
break;
default:
return;
}
}
}
int
main(int argc, char **argv)
{
show_mode_select(1);
return (0);
}
diff --git a/tools/tools/usbtest/usbtest.h b/tools/tools/usbtest/usbtest.h
index f274bebc848b..efe484bc7d37 100644
--- a/tools/tools/usbtest/usbtest.h
+++ b/tools/tools/usbtest/usbtest.h
@@ -1,69 +1,68 @@
-/* $FreeBSD$ */
/*-
* Copyright (c) 2010-2022 Hans Petter Selasky
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _USBTEST_H_
#define _USBTEST_H_
#define USB_DEVICES_MAX 128
#define USB_TS_MAX_LEVELS 8
struct libusb20_device;
struct bps {
uint32_t bytes;
time_t time;
};
struct uaddr {
uint16_t vid;
uint16_t pid;
uint8_t bus;
uint8_t addr;
};
extern void usb_get_string_desc_test(struct uaddr);
extern void usb_port_reset_test(struct uaddr, uint32_t);
extern void usb_set_config_test(struct uaddr, uint32_t);
extern void usb_get_descriptor_test(struct uaddr, uint32_t);
extern void usb_control_ep_error_test(struct uaddr);
extern void usb_set_and_clear_stall_test(struct uaddr);
extern void usb_set_alt_interface_test(struct uaddr);
extern void usb_suspend_resume_test(struct uaddr, uint32_t);
extern void do_bps(const char *, struct bps *, uint32_t len);
extern const char *indent[USB_TS_MAX_LEVELS];
extern void show_host_msc_test(uint8_t, struct uaddr, uint32_t);
extern void show_host_modem_test(uint8_t, struct uaddr, uint32_t);
extern void show_host_device_selection(uint8_t, struct uaddr *);
extern struct libusb20_device *find_usb_device(struct uaddr);
extern void find_usb_endpoints(struct libusb20_device *, uint8_t, uint8_t,
uint8_t, uint8_t, uint8_t *, uint8_t *, uint8_t *, uint8_t);
extern void get_string(char *, int);
extern int get_integer(void);
extern uint8_t usb_ts_show_menu(uint8_t, const char *, const char *,...);
extern int32_t usb_ts_rand_noise(void);
#endif /* _USBTEST_H_ */
diff --git a/tools/tools/vhba/faulty/vhba_faulty.c b/tools/tools/vhba/faulty/vhba_faulty.c
index 49cbb4b1065e..28d0dffecc8d 100644
--- a/tools/tools/vhba/faulty/vhba_faulty.c
+++ b/tools/tools/vhba/faulty/vhba_faulty.c
@@ -1,349 +1,348 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* "Faulty" Device. Victimize random commands with a Selection Timeout.
*/
#include "vhba.h"
#define MAX_TGT VHBA_MAXTGT
#define MAX_LUN 4
#define DISK_SIZE 32
#define DISK_SHIFT 9
#define DISK_NBLKS ((DISK_SIZE << 20) >> DISK_SHIFT)
#define PSEUDO_SPT 64
#define PSEUDO_HDS 64
#define PSEUDO_SPC (PSEUDO_SPT * PSEUDO_HDS)
typedef struct {
vhba_softc_t * vhba;
uint8_t * disk;
size_t disk_size;
uint32_t ctr;
uint32_t dead;
struct task qt;
} faulty_t;
static void vhba_task(void *, int);
static void faulty_act(faulty_t *, struct ccb_scsiio *);
void
vhba_init(vhba_softc_t *vhba)
{
static faulty_t vhbastatic;
vhbastatic.vhba = vhba;
vhbastatic.disk_size = DISK_SIZE << 20;
vhbastatic.disk = malloc(vhbastatic.disk_size, M_DEVBUF, M_WAITOK|M_ZERO);
vhba->private = &vhbastatic;
vhbastatic.ctr = (arc4random() & 0xffff) + 1;
TASK_INIT(&vhbastatic.qt, 0, vhba_task, &vhbastatic);
}
void
vhba_fini(vhba_softc_t *vhba)
{
faulty_t *vhbas = vhba->private;
vhba->private = NULL;
free(vhbas->disk, M_DEVBUF);
}
void
vhba_kick(vhba_softc_t *vhba)
{
faulty_t *vhbas = vhba->private;
taskqueue_enqueue(taskqueue_swi, &vhbas->qt);
}
static void
vhba_task(void *arg, int pending)
{
faulty_t *vhbas = arg;
struct ccb_hdr *ccbh;
mtx_lock(&vhbas->vhba->lock);
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->actv)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->actv, ccbh, sim_links.tqe);
faulty_act(vhbas, (struct ccb_scsiio *)ccbh);
if (--vhbas->ctr == 0) {
vhbas->dead = 1;
vhbas->ctr = (arc4random() & 0xff) + 1;
}
}
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->done)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->done, ccbh, sim_links.tqe);
xpt_done((union ccb *)ccbh);
}
mtx_unlock(&vhbas->vhba->lock);
}
static void
faulty_act(faulty_t *vhbas, struct ccb_scsiio *csio)
{
char junk[128];
cam_status camstatus;
uint8_t *cdb, *ptr, status;
uint32_t data_len;
uint64_t off;
data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
if (csio->ccb_h.target_id >= MAX_TGT) {
vhba_set_status(&csio->ccb_h, CAM_SEL_TIMEOUT);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (vhbas->dead) {
vhbas->dead = 0;
vhba_set_status(&csio->ccb_h, CAM_SEL_TIMEOUT);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (csio->ccb_h.target_lun >= MAX_LUN && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
switch (cdb[0]) {
case MODE_SENSE:
case MODE_SENSE_10:
{
unsigned int nbyte;
uint8_t page = cdb[2] & SMS_PAGE_CODE;
uint8_t pgctl = cdb[2] & SMS_PAGE_CTRL_MASK;
switch (page) {
case SMS_FORMAT_DEVICE_PAGE:
case SMS_GEOMETRY_PAGE:
case SMS_CACHE_PAGE:
case SMS_CONTROL_MODE_PAGE:
case SMS_ALL_PAGES_PAGE:
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
memset(junk, 0, sizeof (junk));
if (cdb[1] & SMS_DBD) {
ptr = &junk[4];
} else {
ptr = junk;
ptr[3] = 8;
ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
ptr[8] = (DISK_NBLKS >> 24) & 0xff;
ptr[9] = (DISK_NBLKS >> 16) & 0xff;
ptr[10] = (DISK_NBLKS >> 8) & 0xff;
ptr[11] = DISK_NBLKS & 0xff;
ptr += 12;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_FORMAT_DEVICE_PAGE) {
ptr[0] = SMS_FORMAT_DEVICE_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
/* tracks per zone */
/* ptr[2] = 0; */
/* ptr[3] = 0; */
/* alternate sectors per zone */
/* ptr[4] = 0; */
/* ptr[5] = 0; */
/* alternate tracks per zone */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* alternate tracks per logical unit */
/* ptr[8] = 0; */
/* ptr[9] = 0; */
/* sectors per track */
ptr[10] = (PSEUDO_SPT >> 8) & 0xff;
ptr[11] = PSEUDO_SPT & 0xff;
/* data bytes per physical sector */
ptr[12] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[13] = (1 << DISK_SHIFT) & 0xff;
/* interleave */
/* ptr[14] = 0; */
/* ptr[15] = 1; */
/* track skew factor */
/* ptr[16] = 0; */
/* ptr[17] = 0; */
/* cylinder skew factor */
/* ptr[18] = 0; */
/* ptr[19] = 0; */
/* SSRC, HSEC, RMB, SURF */
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_GEOMETRY_PAGE) {
ptr[0] = SMS_GEOMETRY_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
uint32_t cyl = (DISK_NBLKS + ((PSEUDO_SPC - 1))) / PSEUDO_SPC;
/* number of cylinders */
ptr[2] = (cyl >> 24) & 0xff;
ptr[3] = (cyl >> 16) & 0xff;
ptr[4] = cyl & 0xff;
/* number of heads */
ptr[5] = PSEUDO_HDS;
/* starting cylinder- write precompensation */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* ptr[8] = 0; */
/* starting cylinder- reduced write current */
/* ptr[9] = 0; */
/* ptr[10] = 0; */
/* ptr[11] = 0; */
/* drive step rate */
/* ptr[12] = 0; */
/* ptr[13] = 0; */
/* landing zone cylinder */
/* ptr[14] = 0; */
/* ptr[15] = 0; */
/* ptr[16] = 0; */
/* RPL */
/* ptr[17] = 0; */
/* rotational offset */
/* ptr[18] = 0; */
/* medium rotation rate - 7200 RPM */
ptr[20] = 0x1c;
ptr[21] = 0x20;
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CACHE_PAGE) {
ptr[0] = SMS_CACHE_PAGE;
ptr[1] = 18;
ptr[2] = 1 << 2;
ptr += 20;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CONTROL_MODE_PAGE) {
ptr[0] = SMS_CONTROL_MODE_PAGE;
ptr[1] = 10;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
ptr[3] = 1 << 4; /* unrestricted reordering allowed */
ptr[8] = 0x75; /* 30000 ms */
ptr[9] = 0x30;
}
ptr += 12;
}
nbyte = (char *)ptr - &junk[0];
ptr[0] = nbyte - 4;
if (cdb[0] == MODE_SENSE) {
data_len = min(cdb[4], csio->dxfer_len);
} else {
uint16_t tw = (cdb[7] << 8) | cdb[8];
data_len = min(tw, csio->dxfer_len);
}
data_len = min(data_len, nbyte);
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
}
case READ_6:
case READ_10:
case READ_12:
case READ_16:
case WRITE_6:
case WRITE_10:
case WRITE_12:
case WRITE_16:
if (vhba_rwparm(cdb, &off, &data_len, DISK_NBLKS, DISK_SHIFT)) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
if (data_len) {
if ((cdb[0] & 0xf) == 8) {
memcpy(csio->data_ptr, &vhbas->disk[off], data_len);
} else {
memcpy(&vhbas->disk[off], csio->data_ptr, data_len);
}
csio->resid = csio->dxfer_len - data_len;
} else {
csio->resid = csio->dxfer_len;
}
break;
case READ_CAPACITY:
if (cdb[2] || cdb[3] || cdb[4] || cdb[5]) {
vhba_fill_sense(csio, SSD_KEY_UNIT_ATTENTION, 0x24, 0x0);
break;
}
if (cdb[8] & 0x1) { /* PMI */
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
} else {
uint64_t last_blk = DISK_NBLKS - 1;
if (last_blk < 0xffffffffULL) {
csio->data_ptr[0] = (last_blk >> 24) & 0xff;
csio->data_ptr[1] = (last_blk >> 16) & 0xff;
csio->data_ptr[2] = (last_blk >> 8) & 0xff;
csio->data_ptr[3] = (last_blk) & 0xff;
} else {
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
}
}
csio->data_ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
csio->data_ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
csio->data_ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
csio->data_ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
break;
default:
vhba_default_cmd(csio, MAX_LUN, NULL);
break;
}
if (csio->scsi_status != SCSI_STATUS_OK) {
camstatus = CAM_SCSI_STATUS_ERROR;
if (csio->scsi_status == SCSI_STATUS_CHECK_COND) {
camstatus |= CAM_AUTOSNS_VALID;
}
} else {
csio->scsi_status = SCSI_STATUS_OK;
camstatus = CAM_REQ_CMP;
}
vhba_set_status(&csio->ccb_h, camstatus);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
}
DEV_MODULE(vhba_faulty, vhba_modprobe, NULL);
diff --git a/tools/tools/vhba/lots/vhba_lots.c b/tools/tools/vhba/lots/vhba_lots.c
index 07126663c42d..24d336c75d63 100644
--- a/tools/tools/vhba/lots/vhba_lots.c
+++ b/tools/tools/vhba/lots/vhba_lots.c
@@ -1,335 +1,334 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* VHBA device that just reate boatloads of devices.
*/
#include "vhba.h"
#define MAX_TGT VHBA_MAXTGT
#define MAX_LUN 32
#define DISK_SIZE 32
#define DISK_SHIFT 9
#define DISK_NBLKS ((DISK_SIZE << 20) >> DISK_SHIFT)
#define PSEUDO_SPT 64
#define PSEUDO_HDS 64
#define PSEUDO_SPC (PSEUDO_SPT * PSEUDO_HDS)
typedef struct {
vhba_softc_t * vhba;
uint8_t * disk;
size_t disk_size;
struct task qt;
} vhbalots_t;
static void vhba_task(void *, int);
static void vhbalots_act(vhbalots_t *, struct ccb_scsiio *);
void
vhba_init(vhba_softc_t *vhba)
{
static vhbalots_t vhbas;
vhbas.vhba = vhba;
vhbas.disk_size = DISK_SIZE << 20;
vhbas.disk = malloc(vhbas.disk_size, M_DEVBUF, M_WAITOK|M_ZERO);
vhba->private = &vhbas;
TASK_INIT(&vhbas.qt, 0, vhba_task, &vhbas);
}
void
vhba_fini(vhba_softc_t *vhba)
{
vhbalots_t *vhbas = vhba->private;
vhba->private = NULL;
free(vhbas->disk, M_DEVBUF);
}
void
vhba_kick(vhba_softc_t *vhba)
{
vhbalots_t *vhbas = vhba->private;
taskqueue_enqueue(taskqueue_swi, &vhbas->qt);
}
static void
vhba_task(void *arg, int pending)
{
vhbalots_t *vhbas = arg;
struct ccb_hdr *ccbh;
mtx_lock(&vhbas->vhba->lock);
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->actv)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->actv, ccbh, sim_links.tqe);
vhbalots_act(vhbas, (struct ccb_scsiio *)ccbh);
}
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->done)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->done, ccbh, sim_links.tqe);
xpt_done((union ccb *)ccbh);
}
mtx_unlock(&vhbas->vhba->lock);
}
static void
vhbalots_act(vhbalots_t *vhbas, struct ccb_scsiio *csio)
{
char junk[128];
uint8_t *cdb, *ptr, status;
uint32_t data_len;
uint64_t off;
data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
if (csio->ccb_h.target_id >= MAX_TGT) {
csio->ccb_h.status = CAM_SEL_TIMEOUT;
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (csio->ccb_h.target_lun >= MAX_LUN && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
switch (cdb[0]) {
case MODE_SENSE:
case MODE_SENSE_10:
{
unsigned int nbyte;
uint8_t page = cdb[2] & SMS_PAGE_CODE;
uint8_t pgctl = cdb[2] & SMS_PAGE_CTRL_MASK;
switch (page) {
case SMS_FORMAT_DEVICE_PAGE:
case SMS_GEOMETRY_PAGE:
case SMS_CACHE_PAGE:
case SMS_CONTROL_MODE_PAGE:
case SMS_ALL_PAGES_PAGE:
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
memset(junk, 0, sizeof (junk));
if (cdb[1] & SMS_DBD) {
ptr = &junk[4];
} else {
ptr = junk;
ptr[3] = 8;
ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
ptr[8] = (DISK_NBLKS >> 24) & 0xff;
ptr[9] = (DISK_NBLKS >> 16) & 0xff;
ptr[10] = (DISK_NBLKS >> 8) & 0xff;
ptr[11] = DISK_NBLKS & 0xff;
ptr += 12;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_FORMAT_DEVICE_PAGE) {
ptr[0] = SMS_FORMAT_DEVICE_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
/* tracks per zone */
/* ptr[2] = 0; */
/* ptr[3] = 0; */
/* alternate sectors per zone */
/* ptr[4] = 0; */
/* ptr[5] = 0; */
/* alternate tracks per zone */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* alternate tracks per logical unit */
/* ptr[8] = 0; */
/* ptr[9] = 0; */
/* sectors per track */
ptr[10] = (PSEUDO_SPT >> 8) & 0xff;
ptr[11] = PSEUDO_SPT & 0xff;
/* data bytes per physical sector */
ptr[12] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[13] = (1 << DISK_SHIFT) & 0xff;
/* interleave */
/* ptr[14] = 0; */
/* ptr[15] = 1; */
/* track skew factor */
/* ptr[16] = 0; */
/* ptr[17] = 0; */
/* cylinder skew factor */
/* ptr[18] = 0; */
/* ptr[19] = 0; */
/* SSRC, HSEC, RMB, SURF */
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_GEOMETRY_PAGE) {
ptr[0] = SMS_GEOMETRY_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
uint32_t cyl = (DISK_NBLKS + ((PSEUDO_SPC - 1))) / PSEUDO_SPC;
/* number of cylinders */
ptr[2] = (cyl >> 24) & 0xff;
ptr[3] = (cyl >> 16) & 0xff;
ptr[4] = cyl & 0xff;
/* number of heads */
ptr[5] = PSEUDO_HDS;
/* starting cylinder- write precompensation */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* ptr[8] = 0; */
/* starting cylinder- reduced write current */
/* ptr[9] = 0; */
/* ptr[10] = 0; */
/* ptr[11] = 0; */
/* drive step rate */
/* ptr[12] = 0; */
/* ptr[13] = 0; */
/* landing zone cylinder */
/* ptr[14] = 0; */
/* ptr[15] = 0; */
/* ptr[16] = 0; */
/* RPL */
/* ptr[17] = 0; */
/* rotational offset */
/* ptr[18] = 0; */
/* medium rotation rate - 7200 RPM */
ptr[20] = 0x1c;
ptr[21] = 0x20;
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CACHE_PAGE) {
ptr[0] = SMS_CACHE_PAGE;
ptr[1] = 18;
ptr[2] = 1 << 2;
ptr += 20;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CONTROL_MODE_PAGE) {
ptr[0] = SMS_CONTROL_MODE_PAGE;
ptr[1] = 10;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
ptr[3] = 1 << 4; /* unrestricted reordering allowed */
ptr[8] = 0x75; /* 30000 ms */
ptr[9] = 0x30;
}
ptr += 12;
}
nbyte = (char *)ptr - &junk[0];
ptr[0] = nbyte - 4;
if (cdb[0] == MODE_SENSE) {
data_len = min(cdb[4], csio->dxfer_len);
} else {
uint16_t tw = (cdb[7] << 8) | cdb[8];
data_len = min(tw, csio->dxfer_len);
}
data_len = min(data_len, nbyte);
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
}
case READ_6:
case READ_10:
case READ_12:
case READ_16:
case WRITE_6:
case WRITE_10:
case WRITE_12:
case WRITE_16:
if (vhba_rwparm(cdb, &off, &data_len, DISK_NBLKS, DISK_SHIFT)) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
if (data_len) {
if ((cdb[0] & 0xf) == 8) {
memcpy(csio->data_ptr, &vhbas->disk[off], data_len);
} else {
memcpy(&vhbas->disk[off], csio->data_ptr, data_len);
}
csio->resid = csio->dxfer_len - data_len;
} else {
csio->resid = csio->dxfer_len;
}
break;
case READ_CAPACITY:
if (cdb[2] || cdb[3] || cdb[4] || cdb[5]) {
vhba_fill_sense(csio, SSD_KEY_UNIT_ATTENTION, 0x24, 0x0);
break;
}
if (cdb[8] & 0x1) { /* PMI */
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
} else {
uint64_t last_blk = DISK_NBLKS - 1;
if (last_blk < 0xffffffffULL) {
csio->data_ptr[0] = (last_blk >> 24) & 0xff;
csio->data_ptr[1] = (last_blk >> 16) & 0xff;
csio->data_ptr[2] = (last_blk >> 8) & 0xff;
csio->data_ptr[3] = (last_blk) & 0xff;
} else {
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
}
}
csio->data_ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
csio->data_ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
csio->data_ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
csio->data_ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
break;
default:
vhba_default_cmd(csio, MAX_LUN, NULL);
break;
}
csio->ccb_h.status &= ~CAM_STATUS_MASK;
if (csio->scsi_status != SCSI_STATUS_OK) {
csio->ccb_h.status |= CAM_SCSI_STATUS_ERROR;
if (csio->scsi_status == SCSI_STATUS_CHECK_COND) {
csio->ccb_h.status |= CAM_AUTOSNS_VALID;
}
} else {
csio->scsi_status = SCSI_STATUS_OK;
csio->ccb_h.status |= CAM_REQ_CMP;
}
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
}
DEV_MODULE(vhba_lots, vhba_modprobe, NULL);
diff --git a/tools/tools/vhba/medium/vhba_medium.c b/tools/tools/vhba/medium/vhba_medium.c
index 2fc9f926af78..2a1f61dc6861 100644
--- a/tools/tools/vhba/medium/vhba_medium.c
+++ b/tools/tools/vhba/medium/vhba_medium.c
@@ -1,337 +1,336 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* A VHBA device that has a medium number of device.
*/
#include "vhba.h"
#define MAX_TGT 4
#define MAX_LUN 10
#define DISK_SIZE 32
#define DISK_SHIFT 9
#define DISK_NBLKS ((DISK_SIZE << 20) >> DISK_SHIFT)
#define PSEUDO_SPT 64
#define PSEUDO_HDS 64
#define PSEUDO_SPC (PSEUDO_SPT * PSEUDO_HDS)
typedef struct {
vhba_softc_t * vhba;
uint8_t * disk;
size_t disk_size;
struct task qt;
} vhbamedium_t;
static void vhba_task(void *, int);
static void vhbamedium_act(vhbamedium_t *, struct ccb_scsiio *);
void
vhba_init(vhba_softc_t *vhba)
{
static vhbamedium_t vhbas;
vhbas.vhba = vhba;
vhbas.disk_size = DISK_SIZE << 20;
vhbas.disk = malloc(vhbas.disk_size, M_DEVBUF, M_WAITOK|M_ZERO);
vhba->private = &vhbas;
TASK_INIT(&vhbas.qt, 0, vhba_task, &vhbas);
}
void
vhba_fini(vhba_softc_t *vhba)
{
vhbamedium_t *vhbas = vhba->private;
vhba->private = NULL;
free(vhbas->disk, M_DEVBUF);
}
void
vhba_kick(vhba_softc_t *vhba)
{
vhbamedium_t *vhbas = vhba->private;
taskqueue_enqueue(taskqueue_swi, &vhbas->qt);
}
static void
vhba_task(void *arg, int pending)
{
vhbamedium_t *vhbas = arg;
struct ccb_hdr *ccbh;
mtx_lock(&vhbas->vhba->lock);
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->actv)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->actv, ccbh, sim_links.tqe);
vhbamedium_act(vhbas, (struct ccb_scsiio *)ccbh);
}
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->done)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->done, ccbh, sim_links.tqe);
xpt_done((union ccb *)ccbh);
}
mtx_unlock(&vhbas->vhba->lock);
}
static void
vhbamedium_act(vhbamedium_t *vhbas, struct ccb_scsiio *csio)
{
char junk[128];
uint8_t *cdb, *ptr, status;
uint32_t data_len;
uint64_t off;
data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
if (csio->ccb_h.target_id >= MAX_TGT) {
csio->ccb_h.status = CAM_SEL_TIMEOUT;
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (csio->ccb_h.target_lun >= MAX_LUN && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
switch (cdb[0]) {
case MODE_SENSE:
case MODE_SENSE_10:
{
unsigned int nbyte;
uint8_t page = cdb[2] & SMS_PAGE_CODE;
uint8_t pgctl = cdb[2] & SMS_PAGE_CTRL_MASK;
switch (page) {
case SMS_FORMAT_DEVICE_PAGE:
case SMS_GEOMETRY_PAGE:
case SMS_CACHE_PAGE:
case SMS_CONTROL_MODE_PAGE:
case SMS_ALL_PAGES_PAGE:
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
memset(junk, 0, sizeof (junk));
if (cdb[1] & SMS_DBD) {
ptr = &junk[4];
} else {
ptr = junk;
ptr[3] = 8;
ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
ptr[8] = (DISK_NBLKS >> 24) & 0xff;
ptr[9] = (DISK_NBLKS >> 16) & 0xff;
ptr[10] = (DISK_NBLKS >> 8) & 0xff;
ptr[11] = DISK_NBLKS & 0xff;
ptr += 12;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_FORMAT_DEVICE_PAGE) {
ptr[0] = SMS_FORMAT_DEVICE_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
/* tracks per zone */
/* ptr[2] = 0; */
/* ptr[3] = 0; */
/* alternate sectors per zone */
/* ptr[4] = 0; */
/* ptr[5] = 0; */
/* alternate tracks per zone */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* alternate tracks per logical unit */
/* ptr[8] = 0; */
/* ptr[9] = 0; */
/* sectors per track */
ptr[10] = (PSEUDO_SPT >> 8) & 0xff;
ptr[11] = PSEUDO_SPT & 0xff;
/* data bytes per physical sector */
ptr[12] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[13] = (1 << DISK_SHIFT) & 0xff;
/* interleave */
/* ptr[14] = 0; */
/* ptr[15] = 1; */
/* track skew factor */
/* ptr[16] = 0; */
/* ptr[17] = 0; */
/* cylinder skew factor */
/* ptr[18] = 0; */
/* ptr[19] = 0; */
/* SSRC, HSEC, RMB, SURF */
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_GEOMETRY_PAGE) {
ptr[0] = SMS_GEOMETRY_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
uint32_t cyl = (DISK_NBLKS + ((PSEUDO_SPC - 1))) / PSEUDO_SPC;
/* number of cylinders */
ptr[2] = (cyl >> 24) & 0xff;
ptr[3] = (cyl >> 16) & 0xff;
ptr[4] = cyl & 0xff;
/* number of heads */
ptr[5] = PSEUDO_HDS;
/* starting cylinder- write precompensation */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* ptr[8] = 0; */
/* starting cylinder- reduced write current */
/* ptr[9] = 0; */
/* ptr[10] = 0; */
/* ptr[11] = 0; */
/* drive step rate */
/* ptr[12] = 0; */
/* ptr[13] = 0; */
/* landing zone cylinder */
/* ptr[14] = 0; */
/* ptr[15] = 0; */
/* ptr[16] = 0; */
/* RPL */
/* ptr[17] = 0; */
/* rotational offset */
/* ptr[18] = 0; */
/* medium rotation rate - 7200 RPM */
ptr[20] = 0x1c;
ptr[21] = 0x20;
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CACHE_PAGE) {
ptr[0] = SMS_CACHE_PAGE;
ptr[1] = 18;
ptr[2] = 1 << 2;
ptr += 20;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CONTROL_MODE_PAGE) {
ptr[0] = SMS_CONTROL_MODE_PAGE;
ptr[1] = 10;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
ptr[3] = 1 << 4; /* unrestricted reordering allowed */
ptr[8] = 0x75; /* 30000 ms */
ptr[9] = 0x30;
}
ptr += 12;
}
nbyte = (char *)ptr - &junk[0];
ptr[0] = nbyte - 4;
if (cdb[0] == MODE_SENSE) {
data_len = min(cdb[4], csio->dxfer_len);
} else {
uint16_t tw = (cdb[7] << 8) | cdb[8];
data_len = min(tw, csio->dxfer_len);
}
data_len = min(data_len, nbyte);
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
}
case READ_6:
case READ_10:
case READ_12:
case READ_16:
case WRITE_6:
case WRITE_10:
case WRITE_12:
case WRITE_16:
if (vhba_rwparm(cdb, &off, &data_len, DISK_NBLKS, DISK_SHIFT)) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
if (data_len) {
if ((cdb[0] & 0xf) == 8) {
memcpy(csio->data_ptr, &vhbas->disk[off], data_len);
} else {
memcpy(&vhbas->disk[off], csio->data_ptr, data_len);
}
csio->resid = csio->dxfer_len - data_len;
} else {
csio->resid = csio->dxfer_len;
}
break;
break;
case READ_CAPACITY:
if (cdb[2] || cdb[3] || cdb[4] || cdb[5]) {
vhba_fill_sense(csio, SSD_KEY_UNIT_ATTENTION, 0x24, 0x0);
break;
}
if (cdb[8] & 0x1) { /* PMI */
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
} else {
uint64_t last_blk = DISK_NBLKS - 1;
if (last_blk < 0xffffffffULL) {
csio->data_ptr[0] = (last_blk >> 24) & 0xff;
csio->data_ptr[1] = (last_blk >> 16) & 0xff;
csio->data_ptr[2] = (last_blk >> 8) & 0xff;
csio->data_ptr[3] = (last_blk) & 0xff;
} else {
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
}
}
csio->data_ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
csio->data_ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
csio->data_ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
csio->data_ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
break;
default:
vhba_default_cmd(csio, MAX_LUN, NULL);
break;
}
csio->ccb_h.status &= ~CAM_STATUS_MASK;
if (csio->scsi_status != SCSI_STATUS_OK) {
csio->ccb_h.status |= CAM_SCSI_STATUS_ERROR;
if (csio->scsi_status == SCSI_STATUS_CHECK_COND) {
csio->ccb_h.status |= CAM_AUTOSNS_VALID;
}
} else {
csio->scsi_status = SCSI_STATUS_OK;
csio->ccb_h.status |= CAM_REQ_CMP;
}
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
}
DEV_MODULE(vhba_mediaum, vhba_modprobe, NULL);
diff --git a/tools/tools/vhba/mptest/vhba_mptest.c b/tools/tools/vhba/mptest/vhba_mptest.c
index 9a2ec850e509..44e59c4d2008 100644
--- a/tools/tools/vhba/mptest/vhba_mptest.c
+++ b/tools/tools/vhba/mptest/vhba_mptest.c
@@ -1,459 +1,458 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* "Faulty" Multipath Device. Creates to devices to be set up as multipath,
* makes one or both of them non existent (or re existent) on demand.
*/
#include "vhba.h"
#include <sys/sysctl.h>
static int vhba_stop_lun;
static int vhba_start_lun = 0;
static int vhba_notify_stop = 1;
static int vhba_notify_start = 1;
static int vhba_inject_hwerr = 0;
SYSCTL_INT(_debug, OID_AUTO, vhba_stop_lun, CTLFLAG_RW, &vhba_stop_lun, 0, "stop lun bitmap");
SYSCTL_INT(_debug, OID_AUTO, vhba_start_lun, CTLFLAG_RW, &vhba_start_lun, 0, "start lun bitmap");
SYSCTL_INT(_debug, OID_AUTO, vhba_notify_stop, CTLFLAG_RW, &vhba_notify_stop, 1, "notify when luns go away");
SYSCTL_INT(_debug, OID_AUTO, vhba_notify_start, CTLFLAG_RW, &vhba_notify_start, 1, "notify when luns arrive");
SYSCTL_INT(_debug, OID_AUTO, vhba_inject_hwerr, CTLFLAG_RW, &vhba_inject_hwerr, 0, "inject hardware error on lost luns");
#define MAX_TGT 1
#define MAX_LUN 2
#define VMP_TIME hz
#define DISK_SIZE 32
#define DISK_SHIFT 9
#define DISK_NBLKS ((DISK_SIZE << 20) >> DISK_SHIFT)
#define PSEUDO_SPT 64
#define PSEUDO_HDS 64
#define PSEUDO_SPC (PSEUDO_SPT * PSEUDO_HDS)
typedef struct {
vhba_softc_t * vhba;
uint8_t * disk;
size_t disk_size;
int luns[2];
struct callout tick;
struct task qt;
TAILQ_HEAD(, ccb_hdr) inproc;
int nact, nact_high;
} mptest_t;
static timeout_t vhba_iodelay;
static timeout_t vhba_timer;
static void vhba_task(void *, int);
static void mptest_act(mptest_t *, struct ccb_scsiio *);
void
vhba_init(vhba_softc_t *vhba)
{
static mptest_t vhbastatic;
vhbastatic.vhba = vhba;
vhbastatic.disk_size = DISK_SIZE << 20;
vhbastatic.disk = malloc(vhbastatic.disk_size, M_DEVBUF, M_WAITOK|M_ZERO);
vhba->private = &vhbastatic;
callout_init_mtx(&vhbastatic.tick, &vhba->lock, 0);
callout_reset(&vhbastatic.tick, VMP_TIME, vhba_timer, vhba);
TAILQ_INIT(&vhbastatic.inproc);
TASK_INIT(&vhbastatic.qt, 0, vhba_task, &vhbastatic);
vhbastatic.luns[0] = 1;
vhbastatic.luns[1] = 1;
}
void
vhba_fini(vhba_softc_t *vhba)
{
mptest_t *vhbas = vhba->private;
callout_stop(&vhbas->tick);
vhba->private = NULL;
free(vhbas->disk, M_DEVBUF);
}
void
vhba_kick(vhba_softc_t *vhba)
{
mptest_t *vhbas = vhba->private;
taskqueue_enqueue(taskqueue_swi, &vhbas->qt);
}
static void
vhba_task(void *arg, int pending)
{
mptest_t *vhbas = arg;
struct ccb_hdr *ccbh;
int nadded = 0;
mtx_lock(&vhbas->vhba->lock);
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->actv)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->actv, ccbh, sim_links.tqe);
mptest_act(vhbas, (struct ccb_scsiio *)ccbh);
nadded++;
ccbh->sim_priv.entries[0].ptr = vhbas;
callout_handle_init(&ccbh->timeout_ch);
}
if (nadded) {
vhba_kick(vhbas->vhba);
} else {
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->done)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->done, ccbh, sim_links.tqe);
xpt_done((union ccb *)ccbh);
}
}
mtx_unlock(&vhbas->vhba->lock);
}
static void
mptest_act(mptest_t *vhbas, struct ccb_scsiio *csio)
{
char junk[128];
cam_status camstatus;
uint8_t *cdb, *ptr, status;
uint32_t data_len, blkcmd;
uint64_t off;
blkcmd = data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
if (csio->ccb_h.target_id >= MAX_TGT) {
vhba_set_status(&csio->ccb_h, CAM_SEL_TIMEOUT);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (vhba_inject_hwerr && csio->ccb_h.target_lun < MAX_LUN && vhbas->luns[csio->ccb_h.target_lun] == 0) {
vhba_fill_sense(csio, SSD_KEY_HARDWARE_ERROR, 0x44, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if ((csio->ccb_h.target_lun >= MAX_LUN || vhbas->luns[csio->ccb_h.target_lun] == 0) && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
switch (cdb[0]) {
case MODE_SENSE:
case MODE_SENSE_10:
{
unsigned int nbyte;
uint8_t page = cdb[2] & SMS_PAGE_CODE;
uint8_t pgctl = cdb[2] & SMS_PAGE_CTRL_MASK;
switch (page) {
case SMS_FORMAT_DEVICE_PAGE:
case SMS_GEOMETRY_PAGE:
case SMS_CACHE_PAGE:
case SMS_CONTROL_MODE_PAGE:
case SMS_ALL_PAGES_PAGE:
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
memset(junk, 0, sizeof (junk));
if (cdb[1] & SMS_DBD) {
ptr = &junk[4];
} else {
ptr = junk;
ptr[3] = 8;
ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
ptr[8] = (DISK_NBLKS >> 24) & 0xff;
ptr[9] = (DISK_NBLKS >> 16) & 0xff;
ptr[10] = (DISK_NBLKS >> 8) & 0xff;
ptr[11] = DISK_NBLKS & 0xff;
ptr += 12;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_FORMAT_DEVICE_PAGE) {
ptr[0] = SMS_FORMAT_DEVICE_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
/* tracks per zone */
/* ptr[2] = 0; */
/* ptr[3] = 0; */
/* alternate sectors per zone */
/* ptr[4] = 0; */
/* ptr[5] = 0; */
/* alternate tracks per zone */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* alternate tracks per logical unit */
/* ptr[8] = 0; */
/* ptr[9] = 0; */
/* sectors per track */
ptr[10] = (PSEUDO_SPT >> 8) & 0xff;
ptr[11] = PSEUDO_SPT & 0xff;
/* data bytes per physical sector */
ptr[12] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[13] = (1 << DISK_SHIFT) & 0xff;
/* interleave */
/* ptr[14] = 0; */
/* ptr[15] = 1; */
/* track skew factor */
/* ptr[16] = 0; */
/* ptr[17] = 0; */
/* cylinder skew factor */
/* ptr[18] = 0; */
/* ptr[19] = 0; */
/* SSRC, HSEC, RMB, SURF */
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_GEOMETRY_PAGE) {
ptr[0] = SMS_GEOMETRY_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
uint32_t cyl = (DISK_NBLKS + ((PSEUDO_SPC - 1))) / PSEUDO_SPC;
/* number of cylinders */
ptr[2] = (cyl >> 24) & 0xff;
ptr[3] = (cyl >> 16) & 0xff;
ptr[4] = cyl & 0xff;
/* number of heads */
ptr[5] = PSEUDO_HDS;
/* starting cylinder- write precompensation */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* ptr[8] = 0; */
/* starting cylinder- reduced write current */
/* ptr[9] = 0; */
/* ptr[10] = 0; */
/* ptr[11] = 0; */
/* drive step rate */
/* ptr[12] = 0; */
/* ptr[13] = 0; */
/* landing zone cylinder */
/* ptr[14] = 0; */
/* ptr[15] = 0; */
/* ptr[16] = 0; */
/* RPL */
/* ptr[17] = 0; */
/* rotational offset */
/* ptr[18] = 0; */
/* medium rotation rate - 7200 RPM */
ptr[20] = 0x1c;
ptr[21] = 0x20;
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CACHE_PAGE) {
ptr[0] = SMS_CACHE_PAGE;
ptr[1] = 18;
ptr[2] = 1 << 2;
ptr += 20;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CONTROL_MODE_PAGE) {
ptr[0] = SMS_CONTROL_MODE_PAGE;
ptr[1] = 10;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
ptr[3] = 1 << 4; /* unrestricted reordering allowed */
ptr[8] = 0x75; /* 30000 ms */
ptr[9] = 0x30;
}
ptr += 12;
}
nbyte = (char *)ptr - &junk[0];
ptr[0] = nbyte - 4;
if (cdb[0] == MODE_SENSE) {
data_len = min(cdb[4], csio->dxfer_len);
} else {
uint16_t tw = (cdb[7] << 8) | cdb[8];
data_len = min(tw, csio->dxfer_len);
}
data_len = min(data_len, nbyte);
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
}
case READ_6:
case READ_10:
case READ_12:
case READ_16:
case WRITE_6:
case WRITE_10:
case WRITE_12:
case WRITE_16:
if (vhba_rwparm(cdb, &off, &data_len, DISK_NBLKS, DISK_SHIFT)) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
blkcmd++;
if (++vhbas->nact > vhbas->nact_high) {
vhbas->nact_high = vhbas->nact;
printf("%s: high block count now %d\n", __func__, vhbas->nact);
}
if (data_len) {
if ((cdb[0] & 0xf) == 8) {
memcpy(csio->data_ptr, &vhbas->disk[off], data_len);
} else {
memcpy(&vhbas->disk[off], csio->data_ptr, data_len);
}
csio->resid = csio->dxfer_len - data_len;
} else {
csio->resid = csio->dxfer_len;
}
break;
case READ_CAPACITY:
if (cdb[2] || cdb[3] || cdb[4] || cdb[5]) {
vhba_fill_sense(csio, SSD_KEY_UNIT_ATTENTION, 0x24, 0x0);
break;
}
if (cdb[8] & 0x1) { /* PMI */
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
} else {
uint64_t last_blk = DISK_NBLKS - 1;
if (last_blk < 0xffffffffULL) {
csio->data_ptr[0] = (last_blk >> 24) & 0xff;
csio->data_ptr[1] = (last_blk >> 16) & 0xff;
csio->data_ptr[2] = (last_blk >> 8) & 0xff;
csio->data_ptr[3] = (last_blk) & 0xff;
} else {
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
}
}
csio->data_ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
csio->data_ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
csio->data_ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
csio->data_ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
break;
default:
vhba_default_cmd(csio, MAX_LUN, NULL);
break;
}
if (csio->scsi_status != SCSI_STATUS_OK) {
camstatus = CAM_SCSI_STATUS_ERROR;
if (csio->scsi_status == SCSI_STATUS_CHECK_COND) {
camstatus |= CAM_AUTOSNS_VALID;
}
} else {
csio->scsi_status = SCSI_STATUS_OK;
camstatus = CAM_REQ_CMP;
}
vhba_set_status(&csio->ccb_h, camstatus);
if (blkcmd) {
int ticks;
struct timeval t;
TAILQ_INSERT_TAIL(&vhbas->inproc, &csio->ccb_h, sim_links.tqe);
t.tv_sec = 0;
t.tv_usec = (500 + arc4random());
if (t.tv_usec > 10000) {
t.tv_usec = 10000;
}
ticks = tvtohz(&t);
csio->ccb_h.timeout_ch = timeout(vhba_iodelay, &csio->ccb_h, ticks);
} else {
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
}
}
static void
vhba_iodelay(void *arg)
{
struct ccb_hdr *ccbh = arg;
mptest_t *vhbas = ccbh->sim_priv.entries[0].ptr;
mtx_lock(&vhbas->vhba->lock);
TAILQ_REMOVE(&vhbas->inproc, ccbh, sim_links.tqe);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, ccbh, sim_links.tqe);
vhbas->nact -= 1;
vhba_kick(vhbas->vhba);
mtx_unlock(&vhbas->vhba->lock);
}
static void
vhba_timer(void *arg)
{
int lun;
vhba_softc_t *vhba = arg;
mptest_t *vhbas = vhba->private;
if (vhba_stop_lun) {
lun = (vhba_stop_lun & 1)? 0 : 1;
if (lun == 0 || lun == 1) {
if (vhbas->luns[lun]) {
struct cam_path *tp;
if (vhba_notify_stop) {
if (xpt_create_path(&tp, xpt_periph, cam_sim_path(vhba->sim), 0, lun) != CAM_REQ_CMP) {
goto out;
}
vhbas->luns[lun] = 0;
xpt_async(AC_LOST_DEVICE, tp, NULL);
xpt_free_path(tp);
} else {
vhbas->luns[lun] = 0;
}
}
}
vhba_stop_lun &= ~(1 << lun);
} else if (vhba_start_lun) {
lun = (vhba_start_lun & 1)? 0 : 1;
if (lun == 0 || lun == 1) {
if (vhbas->luns[lun] == 0) {
if (vhba_notify_start) {
union ccb *ccb;
ccb = xpt_alloc_ccb_nowait();
if (ccb == NULL) {
goto out;
}
if (xpt_create_path(&ccb->ccb_h.path, xpt_periph, cam_sim_path(vhba->sim), CAM_TARGET_WILDCARD, CAM_LUN_WILDCARD) != CAM_REQ_CMP) {
xpt_free_ccb(ccb);
goto out;
}
vhbas->luns[lun] = 1;
xpt_rescan(ccb);
} else {
vhbas->luns[lun] = 1;
}
}
}
vhba_start_lun &= ~(1 << lun);
}
out:
callout_reset(&vhbas->tick, VMP_TIME, vhba_timer, vhba);
}
DEV_MODULE(vhba_mptest, vhba_modprobe, NULL);
diff --git a/tools/tools/vhba/opt_cam.h b/tools/tools/vhba/opt_cam.h
index da23dbe43a4f..e69de29bb2d1 100644
--- a/tools/tools/vhba/opt_cam.h
+++ b/tools/tools/vhba/opt_cam.h
@@ -1 +0,0 @@
-/* $FreeBSD$ */
diff --git a/tools/tools/vhba/rptluns/vhba_rptluns.c b/tools/tools/vhba/rptluns/vhba_rptluns.c
index 28424c4facd3..8af132d7087b 100644
--- a/tools/tools/vhba/rptluns/vhba_rptluns.c
+++ b/tools/tools/vhba/rptluns/vhba_rptluns.c
@@ -1,366 +1,365 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* A VHBA device to test REPORT LUN functionality.
*/
#include "vhba.h"
#define MAX_TGT 1
#define MAX_LUN 1024
#define DISK_SIZE 32
#define DISK_SHIFT 9
#define DISK_NBLKS ((DISK_SIZE << 20) >> DISK_SHIFT)
#define PSEUDO_SPT 64
#define PSEUDO_HDS 64
#define PSEUDO_SPC (PSEUDO_SPT * PSEUDO_HDS)
typedef struct {
vhba_softc_t * vhba;
uint8_t * disk;
size_t disk_size;
struct task qt;
uint8_t rpbitmap[MAX_LUN >> 3];
} vhbarptluns_t;
static void vhba_task(void *, int);
static void vhbarptluns_act(vhbarptluns_t *, struct ccb_scsiio *);
void
vhba_init(vhba_softc_t *vhba)
{
static vhbarptluns_t vhbas;
struct timeval now;
int i;
vhbas.vhba = vhba;
vhbas.disk_size = DISK_SIZE << 20;
vhbas.disk = malloc(vhbas.disk_size, M_DEVBUF, M_WAITOK|M_ZERO);
vhba->private = &vhbas;
printf("setting luns");
getmicrotime(&now);
if (now.tv_usec & 0x1) {
vhbas.rpbitmap[0] |= 1;
}
for (i = 1; i < 8; i++) {
if (arc4random() & 1) {
printf(" %d", i);
vhbas.rpbitmap[0] |= (1 << i);
}
}
for (i = 8; i < MAX_LUN; i++) {
if ((arc4random() % i) == 0) {
vhbas.rpbitmap[i >> 3] |= (1 << (i & 0x7));
printf(" %d", i);
}
}
printf("\n");
TASK_INIT(&vhbas.qt, 0, vhba_task, &vhbas);
}
void
vhba_fini(vhba_softc_t *vhba)
{
vhbarptluns_t *vhbas = vhba->private;
vhba->private = NULL;
free(vhbas->disk, M_DEVBUF);
}
void
vhba_kick(vhba_softc_t *vhba)
{
vhbarptluns_t *vhbas = vhba->private;
taskqueue_enqueue(taskqueue_swi, &vhbas->qt);
}
static void
vhba_task(void *arg, int pending)
{
vhbarptluns_t *vhbas = arg;
struct ccb_hdr *ccbh;
mtx_lock(&vhbas->vhba->lock);
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->actv)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->actv, ccbh, sim_links.tqe);
vhbarptluns_act(vhbas, (struct ccb_scsiio *)ccbh);
}
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->done)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->done, ccbh, sim_links.tqe);
xpt_done((union ccb *)ccbh);
}
mtx_unlock(&vhbas->vhba->lock);
}
static void
vhbarptluns_act(vhbarptluns_t *vhbas, struct ccb_scsiio *csio)
{
char junk[128];
uint8_t *cdb, *ptr, status;
uint32_t data_len;
uint64_t off;
int i, attached_lun = 0;
data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
if (csio->ccb_h.target_id >= MAX_TGT) {
csio->ccb_h.status = CAM_SEL_TIMEOUT;
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (csio->ccb_h.target_lun < MAX_LUN) {
i = csio->ccb_h.target_lun & 0x7;
if (vhbas->rpbitmap[csio->ccb_h.target_lun >> 3] & (1 << i)) {
attached_lun = 1;
}
}
if (attached_lun == 0 && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
switch (cdb[0]) {
case MODE_SENSE:
case MODE_SENSE_10:
{
unsigned int nbyte;
uint8_t page = cdb[2] & SMS_PAGE_CODE;
uint8_t pgctl = cdb[2] & SMS_PAGE_CTRL_MASK;
switch (page) {
case SMS_FORMAT_DEVICE_PAGE:
case SMS_GEOMETRY_PAGE:
case SMS_CACHE_PAGE:
case SMS_CONTROL_MODE_PAGE:
case SMS_ALL_PAGES_PAGE:
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
memset(junk, 0, sizeof (junk));
if (cdb[1] & SMS_DBD) {
ptr = &junk[4];
} else {
ptr = junk;
ptr[3] = 8;
ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
ptr[8] = (DISK_NBLKS >> 24) & 0xff;
ptr[9] = (DISK_NBLKS >> 16) & 0xff;
ptr[10] = (DISK_NBLKS >> 8) & 0xff;
ptr[11] = DISK_NBLKS & 0xff;
ptr += 12;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_FORMAT_DEVICE_PAGE) {
ptr[0] = SMS_FORMAT_DEVICE_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
/* tracks per zone */
/* ptr[2] = 0; */
/* ptr[3] = 0; */
/* alternate sectors per zone */
/* ptr[4] = 0; */
/* ptr[5] = 0; */
/* alternate tracks per zone */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* alternate tracks per logical unit */
/* ptr[8] = 0; */
/* ptr[9] = 0; */
/* sectors per track */
ptr[10] = (PSEUDO_SPT >> 8) & 0xff;
ptr[11] = PSEUDO_SPT & 0xff;
/* data bytes per physical sector */
ptr[12] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[13] = (1 << DISK_SHIFT) & 0xff;
/* interleave */
/* ptr[14] = 0; */
/* ptr[15] = 1; */
/* track skew factor */
/* ptr[16] = 0; */
/* ptr[17] = 0; */
/* cylinder skew factor */
/* ptr[18] = 0; */
/* ptr[19] = 0; */
/* SSRC, HSEC, RMB, SURF */
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_GEOMETRY_PAGE) {
ptr[0] = SMS_GEOMETRY_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
uint32_t cyl = (DISK_NBLKS + ((PSEUDO_SPC - 1))) / PSEUDO_SPC;
/* number of cylinders */
ptr[2] = (cyl >> 24) & 0xff;
ptr[3] = (cyl >> 16) & 0xff;
ptr[4] = cyl & 0xff;
/* number of heads */
ptr[5] = PSEUDO_HDS;
/* starting cylinder- write precompensation */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* ptr[8] = 0; */
/* starting cylinder- reduced write current */
/* ptr[9] = 0; */
/* ptr[10] = 0; */
/* ptr[11] = 0; */
/* drive step rate */
/* ptr[12] = 0; */
/* ptr[13] = 0; */
/* landing zone cylinder */
/* ptr[14] = 0; */
/* ptr[15] = 0; */
/* ptr[16] = 0; */
/* RPL */
/* ptr[17] = 0; */
/* rotational offset */
/* ptr[18] = 0; */
/* medium rotation rate - 7200 RPM */
ptr[20] = 0x1c;
ptr[21] = 0x20;
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CACHE_PAGE) {
ptr[0] = SMS_CACHE_PAGE;
ptr[1] = 18;
ptr[2] = 1 << 2;
ptr += 20;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CONTROL_MODE_PAGE) {
ptr[0] = SMS_CONTROL_MODE_PAGE;
ptr[1] = 10;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
ptr[3] = 1 << 4; /* unrestricted reordering allowed */
ptr[8] = 0x75; /* 30000 ms */
ptr[9] = 0x30;
}
ptr += 12;
}
nbyte = (char *)ptr - &junk[0];
ptr[0] = nbyte - 4;
if (cdb[0] == MODE_SENSE) {
data_len = min(cdb[4], csio->dxfer_len);
} else {
uint16_t tw = (cdb[7] << 8) | cdb[8];
data_len = min(tw, csio->dxfer_len);
}
data_len = min(data_len, nbyte);
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
}
case READ_6:
case READ_10:
case READ_12:
case READ_16:
case WRITE_6:
case WRITE_10:
case WRITE_12:
case WRITE_16:
if (vhba_rwparm(cdb, &off, &data_len, DISK_NBLKS, DISK_SHIFT)) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
if (data_len) {
if ((cdb[0] & 0xf) == 8) {
memcpy(csio->data_ptr, &vhbas->disk[off], data_len);
} else {
memcpy(&vhbas->disk[off], csio->data_ptr, data_len);
}
csio->resid = csio->dxfer_len - data_len;
} else {
csio->resid = csio->dxfer_len;
}
break;
break;
case READ_CAPACITY:
if (cdb[2] || cdb[3] || cdb[4] || cdb[5]) {
vhba_fill_sense(csio, SSD_KEY_UNIT_ATTENTION, 0x24, 0x0);
break;
}
if (cdb[8] & 0x1) { /* PMI */
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
} else {
uint64_t last_blk = DISK_NBLKS - 1;
if (last_blk < 0xffffffffULL) {
csio->data_ptr[0] = (last_blk >> 24) & 0xff;
csio->data_ptr[1] = (last_blk >> 16) & 0xff;
csio->data_ptr[2] = (last_blk >> 8) & 0xff;
csio->data_ptr[3] = (last_blk) & 0xff;
} else {
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
}
}
csio->data_ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
csio->data_ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
csio->data_ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
csio->data_ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
break;
default:
vhba_default_cmd(csio, MAX_LUN, vhbas->rpbitmap);
break;
}
csio->ccb_h.status &= ~CAM_STATUS_MASK;
if (csio->scsi_status != SCSI_STATUS_OK) {
csio->ccb_h.status |= CAM_SCSI_STATUS_ERROR;
if (csio->scsi_status == SCSI_STATUS_CHECK_COND) {
csio->ccb_h.status |= CAM_AUTOSNS_VALID;
}
} else {
csio->scsi_status = SCSI_STATUS_OK;
csio->ccb_h.status |= CAM_REQ_CMP;
}
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
}
DEV_MODULE(vhba_rtpluns, vhba_modprobe, NULL);
diff --git a/tools/tools/vhba/simple/vhba_simple.c b/tools/tools/vhba/simple/vhba_simple.c
index bc40bea77f8d..0a87dc811341 100644
--- a/tools/tools/vhba/simple/vhba_simple.c
+++ b/tools/tools/vhba/simple/vhba_simple.c
@@ -1,337 +1,336 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* "Simple" VHBA device
*/
#include "vhba.h"
#define MAX_TGT 1
#define MAX_LUN 1
#define DISK_SIZE 32
#define DISK_SHIFT 9
#define DISK_NBLKS ((DISK_SIZE << 20) >> DISK_SHIFT)
#define PSEUDO_SPT 64
#define PSEUDO_HDS 64
#define PSEUDO_SPC (PSEUDO_SPT * PSEUDO_HDS)
typedef struct {
vhba_softc_t * vhba;
uint8_t * disk;
size_t disk_size;
struct task qt;
} vhbasimple_t;
static void vhba_task(void *, int);
static void vhbasimple_act(vhbasimple_t *, struct ccb_scsiio *);
void
vhba_init(vhba_softc_t *vhba)
{
static vhbasimple_t vhbas;
vhbas.vhba = vhba;
vhbas.disk_size = DISK_SIZE << 20;
vhbas.disk = malloc(vhbas.disk_size, M_DEVBUF, M_WAITOK|M_ZERO);
vhba->private = &vhbas;
TASK_INIT(&vhbas.qt, 0, vhba_task, &vhbas);
}
void
vhba_fini(vhba_softc_t *vhba)
{
vhbasimple_t *vhbas = vhba->private;
vhba->private = NULL;
free(vhbas->disk, M_DEVBUF);
}
void
vhba_kick(vhba_softc_t *vhba)
{
vhbasimple_t *vhbas = vhba->private;
taskqueue_enqueue(taskqueue_swi, &vhbas->qt);
}
static void
vhba_task(void *arg, int pending)
{
vhbasimple_t *vhbas = arg;
struct ccb_hdr *ccbh;
mtx_lock(&vhbas->vhba->lock);
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->actv)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->actv, ccbh, sim_links.tqe);
vhbasimple_act(vhbas, (struct ccb_scsiio *)ccbh);
}
while ((ccbh = TAILQ_FIRST(&vhbas->vhba->done)) != NULL) {
TAILQ_REMOVE(&vhbas->vhba->done, ccbh, sim_links.tqe);
xpt_done((union ccb *)ccbh);
}
mtx_unlock(&vhbas->vhba->lock);
}
static void
vhbasimple_act(vhbasimple_t *vhbas, struct ccb_scsiio *csio)
{
char junk[128];
uint8_t *cdb, *ptr, status;
uint32_t data_len;
uint64_t off;
data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
if (csio->ccb_h.target_id >= MAX_TGT) {
csio->ccb_h.status = CAM_SEL_TIMEOUT;
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
if (csio->ccb_h.target_lun >= MAX_LUN && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
switch (cdb[0]) {
case MODE_SENSE:
case MODE_SENSE_10:
{
unsigned int nbyte;
uint8_t page = cdb[2] & SMS_PAGE_CODE;
uint8_t pgctl = cdb[2] & SMS_PAGE_CTRL_MASK;
switch (page) {
case SMS_FORMAT_DEVICE_PAGE:
case SMS_GEOMETRY_PAGE:
case SMS_CACHE_PAGE:
case SMS_CONTROL_MODE_PAGE:
case SMS_ALL_PAGES_PAGE:
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
return;
}
memset(junk, 0, sizeof (junk));
if (cdb[1] & SMS_DBD) {
ptr = &junk[4];
} else {
ptr = junk;
ptr[3] = 8;
ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
ptr[8] = (DISK_NBLKS >> 24) & 0xff;
ptr[9] = (DISK_NBLKS >> 16) & 0xff;
ptr[10] = (DISK_NBLKS >> 8) & 0xff;
ptr[11] = DISK_NBLKS & 0xff;
ptr += 12;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_FORMAT_DEVICE_PAGE) {
ptr[0] = SMS_FORMAT_DEVICE_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
/* tracks per zone */
/* ptr[2] = 0; */
/* ptr[3] = 0; */
/* alternate sectors per zone */
/* ptr[4] = 0; */
/* ptr[5] = 0; */
/* alternate tracks per zone */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* alternate tracks per logical unit */
/* ptr[8] = 0; */
/* ptr[9] = 0; */
/* sectors per track */
ptr[10] = (PSEUDO_SPT >> 8) & 0xff;
ptr[11] = PSEUDO_SPT & 0xff;
/* data bytes per physical sector */
ptr[12] = ((1 << DISK_SHIFT) >> 8) & 0xff;
ptr[13] = (1 << DISK_SHIFT) & 0xff;
/* interleave */
/* ptr[14] = 0; */
/* ptr[15] = 1; */
/* track skew factor */
/* ptr[16] = 0; */
/* ptr[17] = 0; */
/* cylinder skew factor */
/* ptr[18] = 0; */
/* ptr[19] = 0; */
/* SSRC, HSEC, RMB, SURF */
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_GEOMETRY_PAGE) {
ptr[0] = SMS_GEOMETRY_PAGE;
ptr[1] = 24;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
uint32_t cyl = (DISK_NBLKS + ((PSEUDO_SPC - 1))) / PSEUDO_SPC;
/* number of cylinders */
ptr[2] = (cyl >> 24) & 0xff;
ptr[3] = (cyl >> 16) & 0xff;
ptr[4] = cyl & 0xff;
/* number of heads */
ptr[5] = PSEUDO_HDS;
/* starting cylinder- write precompensation */
/* ptr[6] = 0; */
/* ptr[7] = 0; */
/* ptr[8] = 0; */
/* starting cylinder- reduced write current */
/* ptr[9] = 0; */
/* ptr[10] = 0; */
/* ptr[11] = 0; */
/* drive step rate */
/* ptr[12] = 0; */
/* ptr[13] = 0; */
/* landing zone cylinder */
/* ptr[14] = 0; */
/* ptr[15] = 0; */
/* ptr[16] = 0; */
/* RPL */
/* ptr[17] = 0; */
/* rotational offset */
/* ptr[18] = 0; */
/* medium rotation rate - 7200 RPM */
ptr[20] = 0x1c;
ptr[21] = 0x20;
}
ptr += 26;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CACHE_PAGE) {
ptr[0] = SMS_CACHE_PAGE;
ptr[1] = 18;
ptr[2] = 1 << 2;
ptr += 20;
}
if (page == SMS_ALL_PAGES_PAGE || page == SMS_CONTROL_MODE_PAGE) {
ptr[0] = SMS_CONTROL_MODE_PAGE;
ptr[1] = 10;
if (pgctl != SMS_PAGE_CTRL_CHANGEABLE) {
ptr[3] = 1 << 4; /* unrestricted reordering allowed */
ptr[8] = 0x75; /* 30000 ms */
ptr[9] = 0x30;
}
ptr += 12;
}
nbyte = (char *)ptr - &junk[0];
ptr[0] = nbyte - 4;
if (cdb[0] == MODE_SENSE) {
data_len = min(cdb[4], csio->dxfer_len);
} else {
uint16_t tw = (cdb[7] << 8) | cdb[8];
data_len = min(tw, csio->dxfer_len);
}
data_len = min(data_len, nbyte);
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
}
case READ_6:
case READ_10:
case READ_12:
case READ_16:
case WRITE_6:
case WRITE_10:
case WRITE_12:
case WRITE_16:
if (vhba_rwparm(cdb, &off, &data_len, DISK_NBLKS, DISK_SHIFT)) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
if (data_len) {
if ((cdb[0] & 0xf) == 8) {
memcpy(csio->data_ptr, &vhbas->disk[off], data_len);
} else {
memcpy(&vhbas->disk[off], csio->data_ptr, data_len);
}
csio->resid = csio->dxfer_len - data_len;
} else {
csio->resid = csio->dxfer_len;
}
break;
break;
case READ_CAPACITY:
if (cdb[2] || cdb[3] || cdb[4] || cdb[5]) {
vhba_fill_sense(csio, SSD_KEY_UNIT_ATTENTION, 0x24, 0x0);
break;
}
if (cdb[8] & 0x1) { /* PMI */
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
} else {
uint64_t last_blk = DISK_NBLKS - 1;
if (last_blk < 0xffffffffULL) {
csio->data_ptr[0] = (last_blk >> 24) & 0xff;
csio->data_ptr[1] = (last_blk >> 16) & 0xff;
csio->data_ptr[2] = (last_blk >> 8) & 0xff;
csio->data_ptr[3] = (last_blk) & 0xff;
} else {
csio->data_ptr[0] = 0xff;
csio->data_ptr[1] = 0xff;
csio->data_ptr[2] = 0xff;
csio->data_ptr[3] = 0xff;
}
}
csio->data_ptr[4] = ((1 << DISK_SHIFT) >> 24) & 0xff;
csio->data_ptr[5] = ((1 << DISK_SHIFT) >> 16) & 0xff;
csio->data_ptr[6] = ((1 << DISK_SHIFT) >> 8) & 0xff;
csio->data_ptr[7] = ((1 << DISK_SHIFT)) & 0xff;
break;
default:
vhba_default_cmd(csio, MAX_LUN, NULL);
break;
}
csio->ccb_h.status &= ~CAM_STATUS_MASK;
if (csio->scsi_status != SCSI_STATUS_OK) {
csio->ccb_h.status |= CAM_SCSI_STATUS_ERROR;
if (csio->scsi_status == SCSI_STATUS_CHECK_COND) {
csio->ccb_h.status |= CAM_AUTOSNS_VALID;
}
} else {
csio->scsi_status = SCSI_STATUS_OK;
csio->ccb_h.status |= CAM_REQ_CMP;
}
TAILQ_INSERT_TAIL(&vhbas->vhba->done, &csio->ccb_h, sim_links.tqe);
}
DEV_MODULE(vhba_simple, vhba_modprobe, NULL);
diff --git a/tools/tools/vhba/vhba.c b/tools/tools/vhba/vhba.c
index 3fdfe355d9c7..fcb4ffc002b1 100644
--- a/tools/tools/vhba/vhba.c
+++ b/tools/tools/vhba/vhba.c
@@ -1,431 +1,430 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* Virtual HBA infrastructure, to be used for testing as well as other cute hacks.
*/
#include "vhba.h"
static vhba_softc_t *vhba;
#ifndef VHBA_MOD
#define VHBA_MOD "vhba"
#endif
static void vhba_action(struct cam_sim *, union ccb *);
static void vhba_poll(struct cam_sim *);
static int
vhba_attach(vhba_softc_t *vhba)
{
TAILQ_INIT(&vhba->actv);
TAILQ_INIT(&vhba->done);
vhba->devq = cam_simq_alloc(VHBA_MAXCMDS);
if (vhba->devq == NULL) {
return (ENOMEM);
}
vhba->sim = cam_sim_alloc(vhba_action, vhba_poll, VHBA_MOD, vhba, 0, &vhba->lock, VHBA_MAXCMDS, VHBA_MAXCMDS, vhba->devq);
if (vhba->sim == NULL) {
cam_simq_free(vhba->devq);
return (ENOMEM);
}
vhba_init(vhba);
mtx_lock(&vhba->lock);
if (xpt_bus_register(vhba->sim, 0, 0) != CAM_SUCCESS) {
cam_sim_free(vhba->sim, TRUE);
mtx_unlock(&vhba->lock);
return (EIO);
}
mtx_unlock(&vhba->lock);
return (0);
}
static void
vhba_detach(vhba_softc_t *vhba)
{
/*
* We can't be called with anything queued up.
*/
vhba_fini(vhba);
xpt_bus_deregister(cam_sim_path(vhba->sim));
cam_sim_free(vhba->sim, TRUE);
}
static void
vhba_poll(struct cam_sim *sim)
{
vhba_softc_t *vhba = cam_sim_softc(sim);
vhba_kick(vhba);
}
static void
vhba_action(struct cam_sim *sim, union ccb *ccb)
{
struct ccb_trans_settings *cts;
vhba_softc_t *vhba;
vhba = cam_sim_softc(sim);
if (vhba->private == NULL) {
ccb->ccb_h.status = CAM_REQ_CMP_ERR;
xpt_done(ccb);
return;
}
switch (ccb->ccb_h.func_code) {
case XPT_SCSI_IO:
ccb->ccb_h.status &= ~CAM_STATUS_MASK;
ccb->ccb_h.status |= CAM_REQ_INPROG;
TAILQ_INSERT_TAIL(&vhba->actv, &ccb->ccb_h, sim_links.tqe);
vhba_kick(vhba);
return;
case XPT_RESET_DEV:
ccb->ccb_h.status = CAM_REQ_CMP;
break;
case XPT_GET_TRAN_SETTINGS:
cts = &ccb->cts;
cts->protocol_version = SCSI_REV_SPC3;
cts->protocol = PROTO_SCSI;
cts->transport_version = 0;
cts->transport = XPORT_PPB;
ccb->ccb_h.status = CAM_REQ_CMP;
break;
case XPT_CALC_GEOMETRY:
cam_calc_geometry(&ccb->ccg, 1);
break;
case XPT_RESET_BUS: /* Reset the specified bus */
ccb->ccb_h.status = CAM_REQ_CMP;
break;
case XPT_PATH_INQ: /* Path routing inquiry */
{
struct ccb_pathinq *cpi = &ccb->cpi;
cpi->version_num = 1;
cpi->max_target = VHBA_MAXTGT - 1;
cpi->max_lun = 16383;
cpi->hba_misc = PIM_NOBUSRESET;
cpi->initiator_id = cpi->max_target + 1;
cpi->transport = XPORT_PPB;
cpi->base_transfer_speed = 1000000;
cpi->protocol = PROTO_SCSI;
cpi->protocol_version = SCSI_REV_SPC3;
strlcpy(cpi->sim_vid, "FreeBSD", SIM_IDLEN);
strlcpy(cpi->hba_vid, "FakeHBA", HBA_IDLEN);
strlcpy(cpi->dev_name, cam_sim_name(sim), DEV_IDLEN);
cpi->unit_number = cam_sim_unit(sim);
cpi->ccb_h.status = CAM_REQ_CMP;
break;
}
default:
ccb->ccb_h.status = CAM_REQ_INVALID;
break;
}
xpt_done(ccb);
}
/*
* Common support
*/
void
vhba_fill_sense(struct ccb_scsiio *csio, uint8_t key, uint8_t asc, uint8_t ascq)
{
csio->ccb_h.status = CAM_SCSI_STATUS_ERROR|CAM_AUTOSNS_VALID;
csio->scsi_status = SCSI_STATUS_CHECK_COND;
csio->sense_data.error_code = SSD_ERRCODE_VALID|SSD_CURRENT_ERROR;
csio->sense_data.flags = key;
csio->sense_data.extra_len = 10;
csio->sense_data.add_sense_code = asc;
csio->sense_data.add_sense_code_qual = ascq;
csio->sense_len = sizeof (csio->sense_data);
}
int
vhba_rwparm(uint8_t *cdb, uint64_t *offset, uint32_t *tl, uint64_t nblks, uint32_t blk_shift)
{
uint32_t cnt;
uint64_t lba;
switch (cdb[0]) {
case WRITE_16:
case READ_16:
cnt = (((uint32_t)cdb[10]) << 24) |
(((uint32_t)cdb[11]) << 16) |
(((uint32_t)cdb[12]) << 8) |
((uint32_t)cdb[13]);
lba = (((uint64_t)cdb[2]) << 56) |
(((uint64_t)cdb[3]) << 48) |
(((uint64_t)cdb[4]) << 40) |
(((uint64_t)cdb[5]) << 32) |
(((uint64_t)cdb[6]) << 24) |
(((uint64_t)cdb[7]) << 16) |
(((uint64_t)cdb[8]) << 8) |
((uint64_t)cdb[9]);
break;
case WRITE_12:
case READ_12:
cnt = (((uint32_t)cdb[6]) << 16) |
(((uint32_t)cdb[7]) << 8) |
((u_int32_t)cdb[8]);
lba = (((uint32_t)cdb[2]) << 24) |
(((uint32_t)cdb[3]) << 16) |
(((uint32_t)cdb[4]) << 8) |
((uint32_t)cdb[5]);
break;
case WRITE_10:
case READ_10:
cnt = (((uint32_t)cdb[7]) << 8) |
((u_int32_t)cdb[8]);
lba = (((uint32_t)cdb[2]) << 24) |
(((uint32_t)cdb[3]) << 16) |
(((uint32_t)cdb[4]) << 8) |
((uint32_t)cdb[5]);
break;
case WRITE_6:
case READ_6:
cnt = cdb[4];
if (cnt == 0) {
cnt = 256;
}
lba = (((uint32_t)cdb[1] & 0x1f) << 16) |
(((uint32_t)cdb[2]) << 8) |
((uint32_t)cdb[3]);
break;
default:
return (-1);
}
if (lba + cnt > nblks) {
return (-1);
}
*tl = cnt << blk_shift;
*offset = lba << blk_shift;
return (0);
}
void
vhba_default_cmd(struct ccb_scsiio *csio, lun_id_t max_lun, uint8_t *sparse_lun_map)
{
char junk[128];
const uint8_t niliqd[SHORT_INQUIRY_LENGTH] = {
0x7f, 0x0, SCSI_REV_SPC3, 0x2, 32, 0, 0, 0x32,
'P', 'A', 'N', 'A', 'S', 'A', 'S', ' ',
'N', 'U', 'L', 'L', ' ', 'D', 'E', 'V',
'I', 'C', 'E', ' ', ' ', ' ', ' ', ' ',
'0', '0', '0', '1'
};
const uint8_t iqd[SHORT_INQUIRY_LENGTH] = {
0, 0x0, SCSI_REV_SPC3, 0x2, 32, 0, 0, 0x32,
'P', 'A', 'N', 'A', 'S', 'A', 'S', ' ',
'V', 'I', 'R', 'T', ' ', 'M', 'E', 'M',
'O', 'R', 'Y', ' ', 'D', 'I', 'S', 'K',
'0', '0', '0', '1'
};
const uint8_t vp0data[6] = { 0, 0, 0, 0x2, 0, 0x80 };
const uint8_t vp80data[36] = { 0, 0x80, 0, 0x20 };
int i, attached_lun;
uint8_t *cdb, *ptr, status;
uint32_t data_len, nlun;
data_len = 0;
status = SCSI_STATUS_OK;
memset(&csio->sense_data, 0, sizeof (csio->sense_data));
cdb = csio->cdb_io.cdb_bytes;
attached_lun = 1;
if (csio->ccb_h.target_lun >= max_lun) {
attached_lun = 0;
} else if (sparse_lun_map) {
i = csio->ccb_h.target_lun & 0x7;
if ((sparse_lun_map[csio->ccb_h.target_lun >> 3] & (1 << i)) == 0) {
attached_lun = 0;
}
}
if (attached_lun == 0 && cdb[0] != INQUIRY && cdb[0] != REPORT_LUNS && cdb[0] != REQUEST_SENSE) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x25, 0x0);
return;
}
switch (cdb[0]) {
case REQUEST_SENSE:
data_len = csio->dxfer_len;
if (cdb[4] < csio->dxfer_len)
data_len = cdb[4];
if (data_len) {
memset(junk, 0, sizeof (junk));
junk[0] = SSD_ERRCODE_VALID|SSD_CURRENT_ERROR;
junk[2] = SSD_KEY_NO_SENSE;
junk[7] = 10;
memcpy(csio->data_ptr, junk,
(data_len > sizeof junk)? sizeof junk : data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
case INQUIRY:
i = 0;
if ((cdb[1] & 0x1f) == SI_EVPD) {
if ((cdb[2] != 0 && cdb[2] != 0x80) || cdb[3] || cdb[5]) {
i = 1;
}
} else if ((cdb[1] & 0x1f) || cdb[2] || cdb[3] || cdb[5]) {
i = 1;
}
if (i) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
if (attached_lun == 0) {
if (cdb[1] & 0x1f) {
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x24, 0x0);
break;
}
memcpy(junk, niliqd, sizeof (niliqd));
data_len = sizeof (niliqd);
} else if (cdb[1] & 0x1f) {
if (cdb[2] == 0) {
memcpy(junk, vp0data, sizeof (vp0data));
data_len = sizeof (vp0data);
} else {
memcpy(junk, vp80data, sizeof (vp80data));
snprintf(&junk[4], sizeof (vp80data) - 4, "TGT%dLUN%d", csio->ccb_h.target_id, csio->ccb_h.target_lun);
for (i = 0; i < sizeof (vp80data); i++) {
if (junk[i] == 0) {
junk[i] = ' ';
}
}
}
data_len = sizeof (vp80data);
} else {
memcpy(junk, iqd, sizeof (iqd));
data_len = sizeof (iqd);
}
if (data_len > cdb[4]) {
data_len = cdb[4];
}
if (data_len) {
memcpy(csio->data_ptr, junk, data_len);
}
csio->resid = csio->dxfer_len - data_len;
break;
case TEST_UNIT_READY:
case SYNCHRONIZE_CACHE:
case START_STOP:
case RESERVE:
case RELEASE:
break;
case REPORT_LUNS:
if (csio->dxfer_len) {
memset(csio->data_ptr, 0, csio->dxfer_len);
}
ptr = NULL;
for (nlun = i = 0; i < max_lun; i++) {
if (sparse_lun_map) {
if ((sparse_lun_map[i >> 3] & (1 << (i & 0x7))) == 0) {
continue;
}
}
ptr = &csio->data_ptr[8 + ((nlun++) << 3)];
if ((ptr + 8) > &csio->data_ptr[csio->dxfer_len]) {
continue;
}
if (i >= 256) {
ptr[0] = 0x40 | ((i >> 8) & 0x3f);
}
ptr[1] = i;
}
junk[0] = (nlun << 3) >> 24;
junk[1] = (nlun << 3) >> 16;
junk[2] = (nlun << 3) >> 8;
junk[3] = (nlun << 3);
memset(junk+4, 0, 4);
if (csio->dxfer_len) {
u_int amt;
amt = MIN(csio->dxfer_len, 8);
memcpy(csio->data_ptr, junk, amt);
amt = MIN((nlun << 3) + 8, csio->dxfer_len);
csio->resid = csio->dxfer_len - amt;
}
break;
default:
vhba_fill_sense(csio, SSD_KEY_ILLEGAL_REQUEST, 0x20, 0x0);
break;
}
}
void
vhba_set_status(struct ccb_hdr *ccbh, cam_status status)
{
ccbh->status &= ~CAM_STATUS_MASK;
ccbh->status |= status;
if (status != CAM_REQ_CMP) {
if ((ccbh->status & CAM_DEV_QFRZN) == 0) {
ccbh->status |= CAM_DEV_QFRZN;
xpt_freeze_devq(ccbh->path, 1);
}
}
}
int
vhba_modprobe(module_t mod, int cmd, void *arg)
{
int error = 0;
switch (cmd) {
case MOD_LOAD:
vhba = malloc(sizeof (*vhba), M_DEVBUF, M_WAITOK|M_ZERO);
mtx_init(&vhba->lock, "vhba", NULL, MTX_DEF);
error = vhba_attach(vhba);
if (error) {
mtx_destroy(&vhba->lock);
free(vhba, M_DEVBUF);
}
break;
case MOD_UNLOAD:
mtx_lock(&vhba->lock);
if (TAILQ_FIRST(&vhba->done) || TAILQ_FIRST(&vhba->actv)) {
error = EBUSY;
mtx_unlock(&vhba->lock);
break;
}
vhba_detach(vhba);
mtx_unlock(&vhba->lock);
mtx_destroy(&vhba->lock);
free(vhba, M_DEVBUF);
break;
default:
error = EOPNOTSUPP;
break;
}
return (error);
}
diff --git a/tools/tools/vhba/vhba.h b/tools/tools/vhba/vhba.h
index c09bd000de3e..9e9ca0e7eabe 100644
--- a/tools/tools/vhba/vhba.h
+++ b/tools/tools/vhba/vhba.h
@@ -1,116 +1,115 @@
/*-
* Copyright (c) 2010 by Panasas, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice immediately at the beginning of the file, without modification,
* this list of conditions, and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* Virtual HBA defines
*/
#include <sys/cdefs.h>
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/endian.h>
#include <sys/lock.h>
#include <sys/kernel.h>
#include <sys/queue.h>
#include <sys/queue.h>
#include <sys/malloc.h>
#include <sys/taskqueue.h>
#include <sys/mutex.h>
#include <sys/condvar.h>
#include <sys/proc.h>
#include <machine/bus.h>
#include <machine/cpu.h>
#include <machine/stdarg.h>
#include <cam/cam.h>
#include <cam/cam_debug.h>
#include <cam/cam_ccb.h>
#include <cam/cam_sim.h>
#include <cam/cam_xpt.h>
#include <cam/cam_xpt_sim.h>
#include <cam/cam_debug.h>
#include <cam/scsi/scsi_all.h>
#include <cam/scsi/scsi_message.h>
#include <sys/unistd.h>
#include <sys/kthread.h>
#include <sys/conf.h>
#include <sys/module.h>
#include <sys/ioccom.h>
#include <sys/devicestat.h>
#include <cam/cam_periph.h>
#include <cam/cam_xpt_periph.h>
#define VHBA_MAXTGT 64
#define VHBA_MAXCMDS 256
typedef struct {
struct mtx lock;
struct cam_sim * sim;
struct cam_devq * devq;
TAILQ_HEAD(, ccb_hdr) actv;
TAILQ_HEAD(, ccb_hdr) done;
void * private;
} vhba_softc_t;
/*
* Each different instantiation of a fake HBA needs to
* provide these as function entry points. It's responsible
* for setting up some thread or regular timeout that will
* dequeue things from the actv queue and put done items
* on the done queue.
*/
void vhba_init(vhba_softc_t *);
void vhba_fini(vhba_softc_t *);
void vhba_kick(vhba_softc_t *);
/*
* Support functions
*/
void vhba_fill_sense(struct ccb_scsiio *, uint8_t, uint8_t, uint8_t);
int vhba_rwparm(uint8_t *, uint64_t *, uint32_t *, uint64_t, uint32_t);
void vhba_default_cmd(struct ccb_scsiio *, lun_id_t, uint8_t *);
void vhba_set_status(struct ccb_hdr *, cam_status);
/*
* Common module loader function
*/
int vhba_modprobe(module_t, int, void *);
/*
* retrofits
*/
#ifndef MODE_SENSE
#define MODE_SENSE 0x1a
#endif
#ifndef SMS_FORMAT_DEVICE_PAGE
#define SMS_FORMAT_DEVICE_PAGE 0x03
#endif
#ifndef SMS_GEOMETRY_PAGE
#define SMS_GEOMETRY_PAGE 0x04
#endif
diff --git a/tools/tools/zfsboottest/zfsboottest.c b/tools/tools/zfsboottest/zfsboottest.c
index 88f946e9d3fe..5ee239789b57 100644
--- a/tools/tools/zfsboottest/zfsboottest.c
+++ b/tools/tools/zfsboottest/zfsboottest.c
@@ -1,222 +1,221 @@
/*-
* Copyright (c) 2010 Doug Rabson
* Copyright (c) 2011 Andriy Gapon
* Copyright (c) 2011 Pawel Jakub Dawidek <pawel@dawidek.net>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/param.h>
#include <sys/disk.h>
#include <sys/queue.h>
#include <sys/stat.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <md5.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdlib.h>
#include <unistd.h>
#define NBBY 8
int
pager_output(const char *line)
{
fprintf(stderr, "%s", line);
return (0);
}
uint64_t
ldi_get_size(void *priv)
{
struct stat sb;
int fd;
fd = *(int *)priv;
if (fstat(fd, &sb) != 0)
return (0);
if (S_ISCHR(sb.st_mode) && ioctl(fd, DIOCGMEDIASIZE, &sb.st_size) != 0)
return (0);
return (sb.st_size);
}
#define ZFS_TEST
#define printf(...) fprintf(stderr, __VA_ARGS__)
#include "libzfs.h"
#include "zfsimpl.c"
#undef printf
static int
vdev_read(vdev_t *vdev, void *priv, off_t off, void *buf, size_t bytes)
{
int fd = *(int *)priv;
if (pread(fd, buf, bytes, off) != bytes)
return (-1);
return (0);
}
static int
zfs_read(spa_t *spa, dnode_phys_t *dn, void *buf, size_t size, off_t off)
{
const znode_phys_t *zp = (const znode_phys_t *) dn->dn_bonus;
size_t n;
int rc;
n = size;
if (off + n > zp->zp_size)
n = zp->zp_size - off;
rc = dnode_read(spa, dn, off, buf, n);
if (rc != 0)
return (-rc);
return (n);
}
int
main(int argc, char** argv)
{
char buf[512], hash[33];
MD5_CTX ctx;
struct stat sb;
struct zfsmount zfsmnt;
dnode_phys_t dn;
#if 0
uint64_t rootobj;
#endif
spa_t *spa;
off_t off;
ssize_t n;
int i, failures, *fd;
zfs_init();
if (argc == 1) {
static char *av[] = {
"zfsboottest",
"/dev/gpt/system0",
"/dev/gpt/system1",
"-",
"/boot/loader",
"/boot/support.4th",
"/boot/kernel/kernel",
NULL,
};
argc = sizeof(av) / sizeof(av[0]) - 1;
argv = av;
}
for (i = 1; i < argc; i++) {
if (strcmp(argv[i], "-") == 0)
break;
}
fd = malloc(sizeof(fd[0]) * (i - 1));
if (fd == NULL)
errx(1, "Unable to allocate memory.");
for (i = 1; i < argc; i++) {
if (strcmp(argv[i], "-") == 0)
break;
fd[i - 1] = open(argv[i], O_RDONLY);
if (fd[i - 1] == -1) {
warn("open(%s) failed", argv[i]);
continue;
}
if (vdev_probe(vdev_read, NULL, &fd[i - 1], NULL) != 0) {
warnx("vdev_probe(%s) failed", argv[i]);
close(fd[i - 1]);
}
}
STAILQ_FOREACH(spa, &zfs_pools, spa_link) {
if (zfs_spa_init(spa)) {
fprintf(stderr, "can't init pool %s\n", spa->spa_name);
exit(1);
}
}
spa_all_status();
spa = STAILQ_FIRST(&zfs_pools);
if (spa == NULL) {
fprintf(stderr, "no pools\n");
exit(1);
}
#if 0
uint64_t rootobj;
if (zfs_get_root(spa, &rootobj)) {
fprintf(stderr, "can't get root\n");
exit(1);
}
if (zfs_mount(spa, rootobj, &zfsmnt)) {
#else
if (zfs_mount(spa, 0, &zfsmnt)) {
fprintf(stderr, "can't mount\n");
exit(1);
#endif
}
printf("\n");
for (++i, failures = 0; i < argc; i++) {
if (zfs_lookup(&zfsmnt, argv[i], &dn)) {
fprintf(stderr, "%s: can't lookup\n", argv[i]);
failures++;
continue;
}
if (zfs_dnode_stat(spa, &dn, &sb)) {
fprintf(stderr, "%s: can't stat\n", argv[i]);
failures++;
continue;
}
off = 0;
MD5Init(&ctx);
do {
n = sb.st_size - off;
n = n > sizeof(buf) ? sizeof(buf) : n;
n = zfs_read(spa, &dn, buf, n, off);
if (n < 0) {
fprintf(stderr, "%s: zfs_read failed\n",
argv[i]);
failures++;
break;
}
MD5Update(&ctx, buf, n);
off += n;
} while (off < sb.st_size);
if (off < sb.st_size)
continue;
MD5End(&ctx, hash);
printf("%s %s\n", hash, argv[i]);
}
return (failures == 0 ? 0 : 1);
}
diff --git a/usr.bin/bc/bc.library b/usr.bin/bc/bc.library
index 8b92d25c95f8..9cd67e4e6f60 100644
--- a/usr.bin/bc/bc.library
+++ b/usr.bin/bc/bc.library
@@ -1,274 +1,273 @@
-/* $FreeBSD$ */
/* $OpenBSD: bc.library,v 1.4 2012/03/14 07:35:53 otto Exp $ */
/*
* Copyright (C) Caldera International Inc. 2001-2002.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code and documentation must retain the above
* copyright notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed or owned by Caldera
* International, Inc.
* 4. Neither the name of Caldera International, Inc. nor the names of other
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
* INTERNATIONAL, INC. AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE FOR ANY DIRECT,
* INDIRECT INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT 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 SUCH DAMAGE.
*/
/*
* @(#)bc.library 5.1 (Berkeley) 4/17/91
*/
scale = 20
define e(x) {
auto a, b, c, d, e, g, t, w, y, r
r = ibase
ibase = A
t = scale
scale = 0
if (x > 0) scale = (0.435*x)/1
scale = scale + t + length(scale + t) + 1
w = 0
if (x < 0) {
x = -x
w = 1
}
y = 0
while (x > 2) {
x = x/2
y = y + 1
}
a = 1
b = 1
c = b
d = 1
e = 1
for (a = 1; 1 == 1; a++) {
b = b*x
c = c*a + b
d = d*a
g = c/d
if (g == e) {
g = g/1
while (y--) {
g = g*g
}
scale = t
ibase = r
if (w == 1) return (1/g)
return (g/1)
}
e = g
}
}
define l(x) {
auto a, b, c, d, e, f, g, u, s, t, r
r = ibase
ibase = A
if (x <= 0) {
a = (1 - 10^scale)
ibase = r
return (a)
}
t = scale
f = 1
if (x < 1) {
s = scale(x)
} else {
s = length(x)-scale(x)
}
scale = 0
a = (2.31*s)/1 /* estimated integer part of the answer */
s = t + length(a) + 2 /* estimated length of the answer */
while (x > 2) {
scale = 0
scale = (length(x) + scale(x))/2 + 1
if (scale < s) scale = s
x = sqrt(x)
f = f*2
}
while (x < .5) {
scale = 0
scale = scale(x)/2 + 1
if (scale < s) scale = s
x = sqrt(x)
f = f*2
}
scale = 0
scale = t + length(f) + length((1.05*(t+length(f))/1)) + 1
u = (x - 1)/(x + 1)
s = u*u
scale = t + 2
b = 2*f
c = b
d = 1
e = 1
for (a = 3; 1 == 1 ; a = a + 2) {
b = b*s
c = c*a + d*b
d = d*a
g = c/d
if (g == e) {
scale = t
ibase = r
return (u*c/d)
}
e = g
}
}
define s(x) {
auto a, b, c, s, t, y, p, n, i, r
r = ibase
ibase = A
t = scale
y = x/.7853
s = t + length(y) - scale(y)
if (s < t) s = t
scale = s
p = a(1)
scale = 0
if (x >= 0) n = (x/(2*p) + 1)/2
if (x < 0) n = (x/(2*p) - 1)/2
x = x - 4*n*p
if (n % 2 != 0) x = -x
scale = t + length(1.2*t) - scale(1.2*t)
y = -x*x
a = x
b = 1
s = x
for (i =3 ; 1 == 1; i = i + 2) {
a = a*y
b = b*i*(i - 1)
c = a/b
if (c == 0) {
scale = t
ibase = r
return (s/1)
}
s = s + c
}
}
define c(x) {
auto t, r
r = ibase
ibase = A
t = scale
scale = scale + 1
x = s(x + 2*a(1))
scale = t
ibase = r
return (x/1)
}
define a(x) {
auto a, b, c, d, e, f, g, s, t, r
if (x == 0) return(0)
r = ibase
ibase = A
if (x == 1) {
if (scale < 52) {
a = .7853981633974483096156608458198757210492923498437764/1
ibase = r
return (a)
}
}
t = scale
f = 1
while (x > .5) {
scale = scale + 1
x = -(1 - sqrt(1. + x*x))/x
f = f*2
}
while (x < -.5) {
scale = scale + 1
x = -(1 - sqrt(1. + x*x))/x
f = f*2
}
s = -x*x
b = f
c = f
d = 1
e = 1
for (a = 3; 1 == 1; a = a + 2) {
b = b*s
c = c*a + d*b
d = d*a
g = c/d
if (g == e) {
ibase = r
scale = t
return (x*c/d)
}
e = g
}
}
define j(n,x) {
auto a, b, c, d, e, g, i, s, k, t, r
r = ibase
ibase = A
t = scale
k = 1.36*x + 1.16*t - n
k = length(k) - scale(k)
if (k > 0) scale = scale + k
s = -x*x/4
if (n < 0) {
n = -n
x = -x
}
a = 1
c = 1
for (i = 1; i <= n; i++) {
a = a*x
c = c*2*i
}
b = a
d = 1
e = 1
for (i = 1; 1; i++) {
a = a*s
b = b*i*(n + i) + a
c = c*i*(n + i)
g = b/c
if (g == e) {
ibase = r
scale = t
return (g/1)
}
e = g
}
}
/* vim: set filetype=bc shiftwidth=8 noexpandtab: */
diff --git a/usr.bin/bc/extern.h b/usr.bin/bc/extern.h
index 7909a17ddeb2..98adf069f9b1 100644
--- a/usr.bin/bc/extern.h
+++ b/usr.bin/bc/extern.h
@@ -1,47 +1,46 @@
-/* $FreeBSD$ */
/* $OpenBSD: extern.h,v 1.12 2014/04/17 19:07:14 otto Exp $ */
/*
* Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdbool.h>
#include <stdio.h>
struct lvalue {
ssize_t load;
ssize_t store;
};
int yylex(void);
void yyerror(const char *);
void fatal(const char *);
void abort_line(int);
struct termios;
int gettty(struct termios *);
void tstpcont(int);
unsigned char bc_eof(EditLine *, int);
extern int lineno;
extern int fileindex;
extern int sargc;
extern const char **sargv;
extern const char *filename;
extern bool interactive;
extern EditLine *el;
extern History *hist;
extern HistEvent he;
extern char *cmdexpr;
extern struct termios ttysaved;
diff --git a/usr.bin/bc/pathnames.h b/usr.bin/bc/pathnames.h
index defb766f7169..cf1c13a6c702 100644
--- a/usr.bin/bc/pathnames.h
+++ b/usr.bin/bc/pathnames.h
@@ -1,21 +1,20 @@
-/* $FreeBSD$ */
/* $OpenBSD: pathnames.h,v 1.1 2003/09/25 19:32:44 otto Exp $ */
/*
* Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#define _PATH_LIBB "/usr/share/misc/bc.library"
#define _PATH_DC "/usr/bin/dc"
diff --git a/usr.bin/bc/tty.c b/usr.bin/bc/tty.c
index f5d72fc9c817..3b2a04077040 100644
--- a/usr.bin/bc/tty.c
+++ b/usr.bin/bc/tty.c
@@ -1,65 +1,64 @@
-/* $FreeBSD$ */
/* $OpenBSD: tty.c,v 1.3 2015/09/05 09:49:24 jsg Exp $ */
/*
* Copyright (c) 2013, Otto Moerbeek <otto@drijf.net>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <errno.h>
#include <signal.h>
#include <histedit.h>
#include <termios.h>
#include "extern.h"
struct termios ttysaved, ttyedit;
static int
settty(struct termios *t)
{
int ret;
while ((ret = tcsetattr(0, TCSADRAIN, t)) == -1 && errno == EINTR)
continue;
return ret;
}
int
gettty(struct termios *t)
{
int ret;
while ((ret = tcgetattr(0, t)) == -1 && errno == EINTR)
continue;
return ret;
}
/* ARGSUSED */
void
tstpcont(int sig)
{
int save_errno = errno;
if (sig == SIGTSTP) {
signal(SIGCONT, tstpcont);
gettty(&ttyedit);
settty(&ttysaved);
} else {
signal(SIGTSTP, tstpcont);
settty(&ttyedit);
}
signal(sig, SIG_DFL);
kill(0, sig);
errno = save_errno;
}
diff --git a/usr.bin/bmake/config.h b/usr.bin/bmake/config.h
index 6c053cf96cfd..d8573c66656a 100644
--- a/usr.bin/bmake/config.h
+++ b/usr.bin/bmake/config.h
@@ -1,395 +1,394 @@
-/* $FreeBSD$ */
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.in by autoheader. */
/* Define if building universal (internal helper macro) */
/* #undef AC_APPLE_UNIVERSAL_BUILD */
/* Path of default shell */
/* #undef DEFSHELL_CUSTOM */
/* Shell spec to use by default */
/* #undef DEFSHELL_INDEX */
/* Path of default shell */
/* #undef DEFSHELL_PATH */
/* Define to 1 if you have the <ar.h> header file. */
#define HAVE_AR_H 1
/* Define to 1 if you have the declaration of `sys_siglist', and to 0 if you
don't. */
#define HAVE_DECL_SYS_SIGLIST 1
/* Define to 1 if you have the <dirent.h> header file, and it defines `DIR'.
*/
#define HAVE_DIRENT_H 1
/* Define to 1 if you have the `dirname' function. */
#define HAVE_DIRNAME 1
/* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */
/* #undef HAVE_DOPRNT */
/* Define to 1 if you have the `err' function. */
#define HAVE_ERR 1
/* Define to 1 if you have the `errx' function. */
#define HAVE_ERRX 1
/* Define to 1 if you have the <err.h> header file. */
#define HAVE_ERR_H 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if you have the `getcwd' function. */
#define HAVE_GETCWD 1
/* Define to 1 if you have the `getenv' function. */
#define HAVE_GETENV 1
/* Define to 1 if you have the `getopt' function. */
#define HAVE_GETOPT 1
/* Define to 1 if you have the `getwd' function. */
#define HAVE_GETWD 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the `killpg' function. */
#define HAVE_KILLPG 1
/* Define to 1 if you have the <libgen.h> header file. */
#define HAVE_LIBGEN_H 1
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define to 1 if the system has the type `long long int'. */
#define HAVE_LONG_LONG_INT 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `mmap' function. */
#define HAVE_MMAP 1
/* Define to 1 if you have the <ndir.h> header file, and it defines `DIR'. */
/* #undef HAVE_NDIR_H */
/* Define to 1 if you have the <paths.h> header file. */
#define HAVE_PATHS_H 1
/* Define to 1 if you have the <poll.h> header file. */
#define HAVE_POLL_H 1
/* Define to 1 if you have the `putenv' function. */
#define HAVE_PUTENV 1
/* Define to 1 if you have the <ranlib.h> header file. */
#define HAVE_RANLIB_H 1
/* Define to 1 if you have the `realpath' function. */
#define HAVE_REALPATH 1
/* Define to 1 if you have the `select' function. */
#define HAVE_SELECT 1
/* Define to 1 if you have the `setenv' function. */
#define HAVE_SETENV 1
/* Define to 1 if you have the `setpgid' function. */
#define HAVE_SETPGID 1
/* Define to 1 if you have the `setrlimit' function. */
#define HAVE_SETRLIMIT 1
/* Define to 1 if you have the `setsid' function. */
#define HAVE_SETSID 1
/* Define to 1 if you have the `sigaction' function. */
#define HAVE_SIGACTION 1
/* Define to 1 if you have the `sigaddset' function. */
#define HAVE_SIGADDSET 1
/* Define to 1 if you have the `sigpending' function. */
#define HAVE_SIGPENDING 1
/* Define to 1 if you have the `sigprocmask' function. */
#define HAVE_SIGPROCMASK 1
/* Define to 1 if you have the `sigsetmask' function. */
#define HAVE_SIGSETMASK 1
/* Define to 1 if you have the `sigsuspend' function. */
#define HAVE_SIGSUSPEND 1
/* Define to 1 if you have the `sigvec' function. */
#define HAVE_SIGVEC 1
/* Define to 1 if the system has the type `sig_atomic_t'. */
#define HAVE_SIG_ATOMIC_T 1
/* Define to 1 if you have the `snprintf' function. */
#define HAVE_SNPRINTF 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strerror' function. */
#define HAVE_STRERROR 1
/* Define to 1 if you have the `stresep' function. */
/* #undef HAVE_STRESEP */
/* Define to 1 if you have the `strftime' function. */
#define HAVE_STRFTIME 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the `strsep' function. */
#define HAVE_STRSEP 1
/* Define to 1 if you have the `strtod' function. */
#define HAVE_STRTOD 1
/* Define to 1 if you have the `strtol' function. */
#define HAVE_STRTOL 1
/* Define to 1 if you have the `strtoll' function. */
#define HAVE_STRTOLL 1
/* Define to 1 if you have the `strtoul' function. */
#define HAVE_STRTOUL 1
/* Define to 1 if `st_rdev' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_RDEV 1
/* Define to 1 if your `struct stat' has `st_rdev'. Deprecated, use
`HAVE_STRUCT_STAT_ST_RDEV' instead. */
#define HAVE_ST_RDEV 1
/* Define to 1 if you have the `sysctl' function. */
#define HAVE_SYSCTL 1
/* Define to 1 if you have the <sys/dir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_DIR_H */
/* Define to 1 if you have the <sys/mman.h> header file. */
#define HAVE_SYS_MMAN_H 1
/* Define to 1 if you have the <sys/ndir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_NDIR_H */
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/sysctl.h> header file. */
#define HAVE_SYS_SYSCTL_H 1
/* Define to 1 if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/uio.h> header file. */
#define HAVE_SYS_UIO_H 1
/* Define to 1 if you have <sys/wait.h> that is POSIX.1 compatible. */
#define HAVE_SYS_WAIT_H 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `unsetenv' function. */
#define HAVE_UNSETENV 1
/* Define to 1 if the system has the type `unsigned long long int'. */
#define HAVE_UNSIGNED_LONG_LONG_INT 1
/* Define to 1 if you have the <utime.h> header file. */
#define HAVE_UTIME_H 1
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the <vfork.h> header file. */
/* #undef HAVE_VFORK_H */
/* Define to 1 if you have the `vprintf' function. */
#define HAVE_VPRINTF 1
/* Define to 1 if you have the `vsnprintf' function. */
#define HAVE_VSNPRINTF 1
/* Define to 1 if you have the `wait3' function. */
#define HAVE_WAIT3 1
/* Define to 1 if you have the `wait4' function. */
#define HAVE_WAIT4 1
/* Define to 1 if you have the `waitpid' function. */
#define HAVE_WAITPID 1
/* Define to 1 if you have the `warn' function. */
#define HAVE_WARN 1
/* Define to 1 if you have the `warnx' function. */
#define HAVE_WARNX 1
/* Define to 1 if `fork' works. */
#define HAVE_WORKING_FORK 1
/* Define to 1 if `vfork' works. */
#define HAVE_WORKING_VFORK 1
/* define if your compiler has __attribute__ */
#define HAVE___ATTRIBUTE__ 1
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "sjg@NetBSD.org"
/* Define to the full name of this package. */
#define PACKAGE_NAME "bmake"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "bmake 20211020"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "bmake"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "20211020"
/* Define as the return type of signal handlers (`int' or `void'). */
#define RETSIGTYPE void
/* Define to 1 if the `S_IS*' macros in <sys/stat.h> do not work properly. */
/* #undef STAT_MACROS_BROKEN */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define to 1 if you can safely include both <sys/time.h> and <time.h>. */
#define TIME_WITH_SYS_TIME 1
/* Define to 1 if your <sys/time.h> declares `struct tm'. */
/* #undef TM_IN_SYS_TIME */
/* Enable extensions on AIX 3, Interix. */
#ifndef _ALL_SOURCE
# define _ALL_SOURCE 1
#endif
/* Enable GNU extensions on systems that have them. */
#ifndef _GNU_SOURCE
# define _GNU_SOURCE 1
#endif
/* Enable threading extensions on Solaris. */
#ifndef _POSIX_PTHREAD_SEMANTICS
# define _POSIX_PTHREAD_SEMANTICS 1
#endif
/* Enable extensions on HP NonStop. */
#ifndef _TANDEM_SOURCE
# define _TANDEM_SOURCE 1
#endif
/* Enable general extensions on Solaris. */
#ifndef __EXTENSIONS__
# define __EXTENSIONS__ 1
#endif
/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most
significant byte first (like Motorola and SPARC, unlike Intel). */
#if defined AC_APPLE_UNIVERSAL_BUILD
# if defined __BIG_ENDIAN__
# define WORDS_BIGENDIAN 1
# endif
#else
# ifndef WORDS_BIGENDIAN
/* # undef WORDS_BIGENDIAN */
# endif
#endif
/* Define to 1 if on MINIX. */
/* #undef _MINIX */
/* Define to 2 if the system does not provide POSIX.1 features except with
this defined. */
/* #undef _POSIX_1_SOURCE */
/* Define to 1 if you need to in order for `stat' and other things to work. */
/* #undef _POSIX_SOURCE */
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT32_T */
/* C99 function name */
/* #undef __func__ */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define to the type of a signed integer type of width exactly 64 bits if
such a type exists and the standard includes do not define it. */
/* #undef int64_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef mode_t */
/* Define to `long int' if <sys/types.h> does not define. */
/* #undef off_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* type that signal handlers can safely frob */
/* #undef sig_atomic_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to the type of an unsigned integer type of width exactly 32 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint32_t */
/* Define as `fork' if `vfork' does not work. */
/* #undef vfork */
diff --git a/usr.bin/compress/doc/revision.log b/usr.bin/compress/doc/revision.log
index 2d5d9d9c82b4..8fbaa00f1c46 100644
--- a/usr.bin/compress/doc/revision.log
+++ b/usr.bin/compress/doc/revision.log
@@ -1,118 +1,117 @@
-/* $FreeBSD$ */
/*
* $Header: compress.c,v 4.0 85/07/30 12:50:00 joe Release $
*
* Revision 4.0 85/07/30 12:50:00 joe
* Removed ferror() calls in output routine on every output except first.
* Prepared for release to the world.
*
* Revision 3.6 85/07/04 01:22:21 joe
* Remove much wasted storage by overlaying hash table with the tables
* used by decompress: tab_suffix[1<<BITS], stack[8000]. Updated USERMEM
* computations. Fixed dump_tab() DEBUG routine.
*
* Revision 3.5 85/06/30 20:47:21 jaw
* Change hash function to use exclusive-or. Rip out hash cache. These
* speedups render the megamemory version defunct, for now. Make decoder
* stack global. Parts of the RCS trunks 2.7, 2.6, and 2.1 no longer apply.
*
* Revision 3.4 85/06/27 12:00:00 ken
* Get rid of all floating-point calculations by doing all compression ratio
* calculations in fixed point.
*
* Revision 3.3 85/06/24 21:53:24 joe
* Incorporate portability suggestion for M_XENIX. Got rid of text on #else
* and #endif lines. Cleaned up #ifdefs for vax and interdata.
*
* Revision 3.2 85/06/06 21:53:24 jaw
* Incorporate portability suggestions for Z8000, IBM PC/XT from mailing list.
* Default to "quiet" output (no compression statistics).
*
* Revision 3.1 85/05/12 18:56:13 jaw
* Integrate decompress() stack speedups (from early pointer mods by McKie).
* Repair multi-file USERMEM gaffe. Unify 'force' flags to mimic semantics
* of SVR2 'pack'. Streamline block-compress table clear logic. Increase
* output byte count by magic number size.
*
* Revision 3.0 84/11/27 11:50:00 petsd!joe
* Set HSIZE depending on BITS. Set BITS depending on USERMEM. Unrolled
* loops in clear routines. Added "-C" flag for 2.0 compatibility. Used
* unsigned compares on Perkin-Elmer. Fixed foreground check.
*
* Revision 2.7 84/11/16 19:35:39 ames!jaw
* Cache common hash codes based on input statistics; this improves
* performance for low-density raster images. Pass on #ifdef bundle
* from Turkowski.
*
* Revision 2.6 84/11/05 19:18:21 ames!jaw
* Vary size of hash tables to reduce time for small files.
* Tune PDP-11 hash function.
*
* Revision 2.5 84/10/30 20:15:14 ames!jaw
* Junk chaining; replace with the simpler (and, on the VAX, faster)
* double hashing, discussed within. Make block compression standard.
*
* Revision 2.4 84/10/16 11:11:11 ames!jaw
* Introduce adaptive reset for block compression, to boost the rate
* another several percent. (See mailing list notes.)
*
* Revision 2.3 84/09/22 22:00:00 petsd!joe
* Implemented "-B" block compress. Implemented REVERSE sorting of tab_next.
* Bug fix for last bits. Changed fwrite to putchar loop everywhere.
*
* Revision 2.2 84/09/18 14:12:21 ames!jaw
* Fold in news changes, small machine typedef from thomas,
* #ifdef interdata from joe.
*
* Revision 2.1 84/09/10 12:34:56 ames!jaw
* Configured fast table lookup for 32-bit machines.
* This cuts user time in half for b <= FBITS, and is useful for news batching
* from VAX to PDP sites. Also sped up decompress() [fwrite->putc] and
* added signal catcher [plus beef in writeerr()] to delete effluvia.
*
* Revision 2.0 84/08/28 22:00:00 petsd!joe
* Add check for foreground before prompting user. Insert maxbits into
* compressed file. Force file being uncompressed to end with ".Z".
* Added "-c" flag and "zcat". Prepared for release.
*
* Revision 1.10 84/08/24 18:28:00 turtlevax!ken
* Will only compress regular files (no directories), added a magic number
* header (plus an undocumented -n flag to handle old files without headers),
* added -f flag to force overwriting of possibly existing destination file,
* otherwise the user is prompted for a response. Will tack on a .Z to a
* filename if it doesn't have one when decompressing. Will only replace
* file if it was compressed.
*
* Revision 1.9 84/08/16 17:28:00 turtlevax!ken
* Removed scanargs(), getopt(), added .Z extension and unlimited number of
* filenames to compress. Flags may be clustered (-Ddvb12) or separated
* (-D -d -v -b 12), or combination thereof. Modes and other status is
* copied with copystat(). -O bug for 4.2 seems to have disappeared with
* 1.8.
*
* Revision 1.8 84/08/09 23:15:00 joe
* Made it compatible with vax version, installed jim's fixes/enhancements
*
* Revision 1.6 84/08/01 22:08:00 joe
* Sped up algorithm significantly by sorting the compress chain.
*
* Revision 1.5 84/07/13 13:11:00 srd
* Added C version of vax asm routines. Changed structure to arrays to
* save much memory. Do unsigned compares where possible (faster on
* Perkin-Elmer)
*
* Revision 1.4 84/07/05 03:11:11 thomas
* Clean up the code a little and lint it. (Lint complains about all
* the regs used in the asm, but I'm not going to "fix" this.)
*
* Revision 1.3 84/07/05 02:06:54 thomas
* Minor fixes.
*
* Revision 1.2 84/07/05 00:27:27 thomas
* Add variable bit length output.
*
*/
static char rcs_ident[] =
"$Header: compress.c,v 4.0 85/07/30 12:50:00 joe Release $";
diff --git a/usr.bin/dc/bcode.h b/usr.bin/dc/bcode.h
index d23efd9fb026..b03f11999a9a 100644
--- a/usr.bin/dc/bcode.h
+++ b/usr.bin/dc/bcode.h
@@ -1,104 +1,103 @@
-/* $FreeBSD$ */
/* $OpenBSD: bcode.h,v 1.7 2012/11/07 11:06:14 otto Exp $ */
/*
* Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <openssl/bn.h>
struct number {
BIGNUM *number;
u_int scale;
};
enum stacktype {
BCODE_NONE,
BCODE_NUMBER,
BCODE_STRING
};
enum bcode_compare {
BCODE_EQUAL,
BCODE_NOT_EQUAL,
BCODE_LESS,
BCODE_NOT_LESS,
BCODE_GREATER,
BCODE_NOT_GREATER
};
struct array;
struct value {
union {
struct number *num;
char *string;
} u;
struct array *array;
enum stacktype type;
};
struct array {
struct value *data;
size_t size;
};
struct stack {
struct value *stack;
ssize_t size;
ssize_t sp;
};
struct source;
struct vtable {
int (*readchar)(struct source *);
void (*unreadchar)(struct source *);
char *(*readline)(struct source *);
void (*free)(struct source *);
};
struct source {
union {
struct {
u_char *buf;
size_t pos;
} string;
FILE *stream;
} u;
struct vtable *vtable;
int lastchar;
};
void init_bmachine(bool);
void reset_bmachine(struct source *);
u_int bmachine_scale(void);
void scale_number(BIGNUM *, int);
void normalize(struct number *, u_int);
void eval(void);
void pn(const char *, const struct number *);
void pbn(const char *, const BIGNUM *);
void negate(struct number *);
void split_number(const struct number *, BIGNUM *, BIGNUM *);
void bmul_number(struct number *, struct number *,
struct number *, u_int scale);
static __inline u_int
max(u_int a, u_int b)
{
return (a > b ? a : b);
}
diff --git a/usr.bin/dc/extern.h b/usr.bin/dc/extern.h
index 38f0c8c714ef..86ab2d80dd6f 100644
--- a/usr.bin/dc/extern.h
+++ b/usr.bin/dc/extern.h
@@ -1,64 +1,63 @@
-/* $FreeBSD$ */
/* $OpenBSD: extern.h,v 1.4 2014/12/01 13:13:00 deraadt Exp $ */
/*
* Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdbool.h>
#include "bcode.h"
/* inout.c */
void src_setstream(struct source *, FILE *);
void src_setstring(struct source *, char *);
struct number *readnumber(struct source *, u_int, u_int);
void printnumber(FILE *, const struct number *, u_int);
char *read_string(struct source *);
void print_value(FILE *, const struct value *, const char *, u_int);
void print_ascii(FILE *, const struct number *);
/* mem.c */
struct number *new_number(void);
void free_number(struct number *);
struct number *div_number(struct number *, struct number *, u_int scale);
struct number *dup_number(const struct number *);
void *bmalloc(size_t);
void *breallocarray(void *, size_t, size_t);
char *bstrdup(const char *p);
void bn_check(int);
void bn_checkp(const void *);
/* stack.c */
void stack_init(struct stack *);
void stack_free_value(struct value *);
struct value *stack_dup_value(const struct value *, struct value *);
void stack_swap(struct stack *);
size_t stack_size(const struct stack *);
void stack_dup(struct stack *);
void stack_pushnumber(struct stack *, struct number *);
void stack_pushstring(struct stack *stack, char *);
void stack_push(struct stack *, struct value *);
void stack_set_tos(struct stack *, struct value *);
struct value *stack_tos(const struct stack *);
struct value *stack_pop(struct stack *);
struct number *stack_popnumber(struct stack *);
char *stack_popstring(struct stack *);
void stack_clear(struct stack *);
void stack_print(FILE *, const struct stack *, const char *,
u_int base);
void frame_assign(struct stack *, size_t, const struct value *);
struct value *frame_retrieve(const struct stack *, size_t);
/* void frame_free(struct stack *); */
diff --git a/usr.bin/fortune/strfile/strfile.h b/usr.bin/fortune/strfile/strfile.h
index 5d4f87558411..40a2a4e80ec9 100644
--- a/usr.bin/fortune/strfile/strfile.h
+++ b/usr.bin/fortune/strfile/strfile.h
@@ -1,54 +1,53 @@
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Ken Arnold.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)strfile.h 8.1 (Berkeley) 5/31/93
*/
-/* $FreeBSD$ */
#include <sys/types.h>
#define STR_ENDSTRING(line,tbl) \
(((unsigned char)(line)[0]) == (tbl).str_delim && (line)[1] == '\n')
typedef struct { /* information table */
#define VERSION 1
uint32_t str_version; /* version number */
uint32_t str_numstr; /* # of strings in the file */
uint32_t str_longlen; /* length of longest string */
uint32_t str_shortlen; /* length of shortest string */
#define STR_RANDOM 0x1 /* randomized pointers */
#define STR_ORDERED 0x2 /* ordered pointers */
#define STR_ROTATED 0x4 /* rot-13'd text */
#define STR_COMMENTS 0x8 /* embedded comments */
uint32_t str_flags; /* bit field for flags */
unsigned char stuff[4]; /* 64-bit aligned space */
#define str_delim stuff[0] /* delimiting character */
} STRFILE;
diff --git a/usr.bin/ftp/tnftp_config.h b/usr.bin/ftp/tnftp_config.h
index 75bfb7542c01..f551312f64a0 100644
--- a/usr.bin/ftp/tnftp_config.h
+++ b/usr.bin/ftp/tnftp_config.h
@@ -1,514 +1,513 @@
-/* $FreeBSD$ */
/* tnftp_config.h. Generated from tnftp_config.h.in by configure. */
/* tnftp_config.h.in. Generated from configure.ac by autoheader. */
/* Define to 1 if the `closedir' function returns void instead of `int'. */
/* #undef CLOSEDIR_VOID */
/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP
systems. This function is required for `alloca.c' support on those systems.
*/
/* #undef CRAY_STACKSEG_END */
/* Define to 1 if using `alloca.c'. */
/* #undef C_ALLOCA */
/* Define to 1 if the `getpgrp' function requires zero arguments. */
#define GETPGRP_VOID 1
/* Define to 1 if `TIOCGWINSZ' requires <sys/ioctl.h>. */
/* #undef GWINSZ_IN_SYS_IOCTL */
/* Define to 1 if you have `alloca', as a function or macro. */
#define HAVE_ALLOCA 1
/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
*/
/* #undef HAVE_ALLOCA_H */
/* Define to 1 if you have the <arpa/ftp.h> header file. */
#define HAVE_ARPA_FTP_H 1
/* Define to 1 if you have the <arpa/inet.h> header file. */
#define HAVE_ARPA_INET_H 1
/* Define to 1 if you have the <arpa/nameser.h> header file. */
#define HAVE_ARPA_NAMESER_H 1
/* Define to 1 if you have the declaration of `AF_INET6', and to 0 if you
don't. */
#define HAVE_DECL_AF_INET6 1
/* Define to 1 if you have the declaration of `AI_NUMERICHOST', and to 0 if
you don't. */
#define HAVE_DECL_AI_NUMERICHOST 1
/* Define to 1 if you have the declaration of `dirname', and to 0 if you
don't. */
#define HAVE_DECL_DIRNAME 1
/* Define to 1 if you have the declaration of `fclose', and to 0 if you don't.
*/
#define HAVE_DECL_FCLOSE 1
/* Define to 1 if you have the declaration of `getpass', and to 0 if you
don't. */
#define HAVE_DECL_GETPASS 1
/* Define to 1 if you have the declaration of `h_errno', and to 0 if you
don't. */
#define HAVE_DECL_H_ERRNO 1
/* Define to 1 if you have the declaration of `NS_IN6ADDRSZ', and to 0 if you
don't. */
#define HAVE_DECL_NS_IN6ADDRSZ 1
/* Define to 1 if you have the declaration of `optarg', and to 0 if you don't.
*/
#define HAVE_DECL_OPTARG 1
/* Define to 1 if you have the declaration of `optind', and to 0 if you don't.
*/
#define HAVE_DECL_OPTIND 1
/* Define to 1 if you have the declaration of `pclose', and to 0 if you don't.
*/
#define HAVE_DECL_PCLOSE 1
/* Define to 1 if you have the declaration of `strptime', and to 0 if you
don't. */
#define HAVE_DECL_STRPTIME 1
/* Define to 1 if you have the <dirent.h> header file, and it defines `DIR'.
*/
#define HAVE_DIRENT_H 1
/* Define to 1 if you have the `dirname' function. */
#define HAVE_DIRNAME 1
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the `err' function. */
#define HAVE_ERR 1
/* Define to 1 if you have the <err.h> header file. */
#define HAVE_ERR_H 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if you have the `fgetln' function. */
#define HAVE_FGETLN 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if fseeko (and presumably ftello) exists and is declared. */
#define HAVE_FSEEKO 1
/* Define to 1 if you have the `getaddrinfo' function. */
#define HAVE_GETADDRINFO 1
/* Define to 1 if you have the `getcwd' function. */
#define HAVE_GETCWD 1
/* Define to 1 if you have the `gethostbyaddr' function. */
#define HAVE_GETHOSTBYADDR 1
/* Define to 1 if you have the `gethostbyname' function. */
#define HAVE_GETHOSTBYNAME 1
/* Define to 1 if you have the `gethostbyname2' function. */
#define HAVE_GETHOSTBYNAME2 1
/* Define to 1 if you have the `gethostname' function. */
#define HAVE_GETHOSTNAME 1
/* Define to 1 if you have the `getnameinfo' function. */
#define HAVE_GETNAMEINFO 1
/* Define to 1 if you have the `getpass' function. */
#define HAVE_GETPASS 1
/* Define to 1 if you have the `getpassphrase' function. */
/* #undef HAVE_GETPASSPHRASE */
/* Define to 1 if you have the `getpgrp' function. */
#define HAVE_GETPGRP 1
/* Define to 1 if you have the `gettimeofday' function. */
#define HAVE_GETTIMEOFDAY 1
/* Define to 1 if you have the `inet_ntop' function. */
#define HAVE_INET_NTOP 1
/* Define to 1 if you have the `inet_pton' function. */
#define HAVE_INET_PTON 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if the system has the type `in_port_t'. */
#define HAVE_IN_PORT_T 1
/* Define to 1 if you have the `isascii' function. */
#define HAVE_ISASCII 1
/* Define to 1 if you have the <libgen.h> header file. */
#define HAVE_LIBGEN_H 1
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define to 1 if the system has the type `long double'. */
#define HAVE_LONG_DOUBLE 1
/* Define to 1 if the system has the type `long long int'. */
#define HAVE_LONG_LONG_INT 1
/* Define to 1 if you have the <malloc.h> header file. */
/* #undef HAVE_MALLOC_H */
/* Define to 1 if you have the `memchr' function. */
#define HAVE_MEMCHR 1
/* Define to 1 if you have the `memmove' function. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `memset' function. */
#define HAVE_MEMSET 1
/* Define to 1 if you have the `mkstemp' function. */
#define HAVE_MKSTEMP 1
/* Define to 1 if you have the <ndir.h> header file, and it defines `DIR'. */
/* #undef HAVE_NDIR_H */
/* Define to 1 if you have the <netdb.h> header file. */
#define HAVE_NETDB_H 1
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if you have the <netinet/in_systm.h> header file. */
#define HAVE_NETINET_IN_SYSTM_H 1
/* Define to 1 if you have the <netinet/ip.h> header file. */
#define HAVE_NETINET_IP_H 1
/* Define to 1 if you have the <paths.h> header file. */
#define HAVE_PATHS_H 1
/* Define if we have poll() and it is not emulated. */
#define HAVE_POLL 1
/* Define to 1 if you have the <poll.h> header file. */
#define HAVE_POLL_H 1
/* Define if `long long' is supported and *printf() supports %lld or %qd to
print them. */
#define HAVE_PRINTF_LONG_LONG 1
/* Define if *printf() uses %qd to print `long long' (otherwise uses %lld). */
/* #undef HAVE_PRINTF_QD */
/* Define to 1 if you have the <pwd.h> header file. */
#define HAVE_PWD_H 1
/* Define to 1 if you have the `realpath' function. */
#define HAVE_REALPATH 1
/* Define to 1 if you have the `regcomp' function. */
#define HAVE_REGCOMP 1
/* Define to 1 if you have the <regex.h> header file. */
#define HAVE_REGEX_H 1
/* Define to 1 if you have the <resolv.h> header file. */
#define HAVE_RESOLV_H 1
/* Define to 1 if the system has the type `sa_family_t'. */
#define HAVE_SA_FAMILY_T 1
/* Define to 1 if you have the `select' function. */
#define HAVE_SELECT 1
/* Define to 1 if you have the <setjmp.h> header file. */
#define HAVE_SETJMP_H 1
/* Define to 1 if you have the `setlocale' function. */
#define HAVE_SETLOCALE 1
/* Define to 1 if you have the `setprogname' function. */
#define HAVE_SETPROGNAME 1
/* Define to 1 if you have the <signal.h> header file. */
#define HAVE_SIGNAL_H 1
/* Define to 1 if you have the `sl_init' function. */
#define HAVE_SL_INIT 1
/* Define to 1 if you have the `snprintf' function. */
#define HAVE_SNPRINTF 1
/* Define to 1 if you have the `socket' function. */
#define HAVE_SOCKET 1
/* Define to 1 if the system has the type `socklen_t'. */
#define HAVE_SOCKLEN_T 1
/* Define to 1 if you have the <stddef.h> header file. */
#define HAVE_STDDEF_H 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strcasecmp' function. */
#define HAVE_STRCASECMP 1
/* Define to 1 if you have the `strchr' function. */
#define HAVE_STRCHR 1
/* Define to 1 if you have the `strcoll' function and it is properly defined.
*/
#define HAVE_STRCOLL 1
/* Define to 1 if you have the `strcspn' function. */
#define HAVE_STRCSPN 1
/* Define to 1 if you have the `strdup' function. */
#define HAVE_STRDUP 1
/* Define to 1 if you have the `strerror' function. */
#define HAVE_STRERROR 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcat' function. */
#define HAVE_STRLCAT 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the `strncasecmp' function. */
#define HAVE_STRNCASECMP 1
/* Define to 1 if you have the `strpbrk' function. */
#define HAVE_STRPBRK 1
/* Define to 1 if you have the `strptime' function. */
#define HAVE_STRPTIME 1
/* Define to 1 if you have the `strrchr' function. */
#define HAVE_STRRCHR 1
/* Define to 1 if you have the `strsep' function. */
#define HAVE_STRSEP 1
/* Define to 1 if you have the `strstr' function. */
#define HAVE_STRSTR 1
/* Define to 1 if you have the `strtol' function. */
#define HAVE_STRTOL 1
/* Define to 1 if you have the `strtoll' function. */
#define HAVE_STRTOLL 1
/* Define to 1 if you have the `strtoul' function. */
#define HAVE_STRTOUL 1
/* Define to 1 if the system has the type `struct addrinfo'. */
#define HAVE_STRUCT_ADDRINFO 1
/* Define to 1 if `struct dirent' is a member of `d_namlen'. */
#define HAVE_STRUCT_DIRENT_D_NAMLEN 1
/* Define to 1 if the system has the type `struct pollfd'. */
#define HAVE_STRUCT_POLLFD 1
/* Define to 1 if the system has the type `struct sockaddr_in6'. */
#define HAVE_STRUCT_SOCKADDR_IN6 1
/* Define to 1 if `struct sockaddr_in' is a member of `sin_len'. */
#define HAVE_STRUCT_SOCKADDR_IN_SIN_LEN 1
/* Define to 1 if `struct sockaddr' is a member of `sa_len'. */
#define HAVE_STRUCT_SOCKADDR_SA_LEN 1
/* Define to 1 if you have the `strunvis' function. */
#define HAVE_STRUNVIS 1
/* Define to 1 if you have the `strvis' function. */
#define HAVE_STRVIS 1
/* Define to 1 if you have the <sys/dir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_DIR_H */
/* Define to 1 if you have the <sys/ioctl.h> header file. */
#define HAVE_SYS_IOCTL_H 1
/* Define to 1 if you have the <sys/ndir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_NDIR_H */
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/poll.h> header file. */
#define HAVE_SYS_POLL_H 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/syslimits.h> header file. */
#define HAVE_SYS_SYSLIMITS_H 1
/* Define to 1 if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/wait.h> header file. */
#define HAVE_SYS_WAIT_H 1
/* Define to 1 if you have the <termcap.h> header file. */
#define HAVE_TERMCAP_H 1
/* Define to 1 if you have the <termios.h> header file. */
#define HAVE_TERMIOS_H 1
/* Define to 1 if you have the `timegm' function. */
#define HAVE_TIMEGM 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `usleep' function. */
#define HAVE_USLEEP 1
/* Define to 1 if you have the `utime' function. */
#define HAVE_UTIME 1
/* Define to 1 if you have the `utimes' function. */
#define HAVE_UTIMES 1
/* Define to 1 if you have the <utime.h> header file. */
#define HAVE_UTIME_H 1
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the <vfork.h> header file. */
/* #undef HAVE_VFORK_H */
/* Define to 1 if you have the <vis.h> header file. */
#define HAVE_VIS_H 1
/* Define to 1 if `fork' works. */
#define HAVE_WORKING_FORK 1
/* Define to 1 if `vfork' works. */
#define HAVE_WORKING_VFORK 1
/* Name of package */
#define PACKAGE "tnftp"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "lukem@NetBSD.org"
/* Define to the full name of this package. */
#define PACKAGE_NAME "tnftp"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "tnftp 20100108"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "tnftp"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "20100108"
/* Define as the return type of signal handlers (`int' or `void'). */
#define RETSIGTYPE void
/* If using the C implementation of alloca, define if you know the
direction of stack growth for your system; otherwise it will be
automatically deduced at runtime.
STACK_DIRECTION > 0 => grows toward higher addresses
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown */
/* #undef STACK_DIRECTION */
/* Define to 1 if the `S_IS*' macros in <sys/stat.h> do not work properly. */
/* #undef STAT_MACROS_BROKEN */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define to 1 if you can safely include both <sys/time.h> and <time.h>. */
#define TIME_WITH_SYS_TIME 1
/* Define to 1 if your <sys/time.h> declares `struct tm'. */
/* #undef TM_IN_SYS_TIME */
/* Define if using (Dante) SOCKS5 proxy. */
/* #undef USE_SOCKS */
/* Version number of package */
#define VERSION "20100108"
/* Number of bits in a file offset, on hosts where this is settable. */
/* #undef _FILE_OFFSET_BITS */
/* Define to 1 to make fseeko visible on some hosts (e.g. glibc 2.2). */
/* #undef _LARGEFILE_SOURCE */
/* Define for large files, on AIX-style hosts. */
/* #undef _LARGE_FILES */
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT32_T */
/* Define to `long int' if <sys/types.h> does not define. */
/* #undef off_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to the type of an unsigned integer type of width exactly 32 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint32_t */
/* Define as `fork' if `vfork' does not work. */
/* #undef vfork */
/* Define if using IPv6 support. */
/* Commented out so this can be selected fromt he Makefile -gavin */
/* #define USE_INET6 1 */
#define USE_GLOB_H 1
diff --git a/usr.bin/gcore/elf32core.c b/usr.bin/gcore/elf32core.c
index 196ba9f1cec0..292ff59b98b1 100644
--- a/usr.bin/gcore/elf32core.c
+++ b/usr.bin/gcore/elf32core.c
@@ -1,11 +1,10 @@
-/* $FreeBSD$ */
#ifndef __LP64__
#error "this file must be compiled for LP64."
#endif
#define __ELF_WORD_SIZE 32
#define _MACHINE_ELF_WANT_32BIT
#define ELFCORE_COMPAT_32 1
#include "elfcore.c"
diff --git a/usr.bin/grep/file.c b/usr.bin/grep/file.c
index 1710b5aacdb3..12c524188583 100644
--- a/usr.bin/grep/file.c
+++ b/usr.bin/grep/file.c
@@ -1,250 +1,249 @@
/* $NetBSD: file.c,v 1.5 2011/02/16 18:35:39 joerg Exp $ */
-/* $FreeBSD$ */
/* $OpenBSD: file.c,v 1.11 2010/07/02 20:48:48 nicm Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
* Copyright (C) 2008-2010 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2010 Dimitry Andric <dimitry@andric.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/param.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <wchar.h>
#include <wctype.h>
#include "grep.h"
#define MAXBUFSIZ (32 * 1024)
#define LNBUFBUMP 80
static char *buffer;
static char *bufpos;
static size_t bufrem;
static size_t fsiz;
static char *lnbuf;
static size_t lnbuflen;
static inline int
grep_refill(struct file *f)
{
ssize_t nr;
if (filebehave == FILE_MMAP)
return (0);
bufpos = buffer;
bufrem = 0;
nr = read(f->fd, buffer, MAXBUFSIZ);
if (nr < 0)
return (-1);
bufrem = nr;
return (0);
}
static inline int
grep_lnbufgrow(size_t newlen)
{
if (lnbuflen < newlen) {
lnbuf = grep_realloc(lnbuf, newlen);
lnbuflen = newlen;
}
return (0);
}
char *
grep_fgetln(struct file *f, struct parsec *pc)
{
char *p;
size_t len;
size_t off;
ptrdiff_t diff;
/* Fill the buffer, if necessary */
if (bufrem == 0 && grep_refill(f) != 0)
goto error;
if (bufrem == 0) {
/* Return zero length to indicate EOF */
pc->ln.len= 0;
return (bufpos);
}
/* Look for a newline in the remaining part of the buffer */
if ((p = memchr(bufpos, fileeol, bufrem)) != NULL) {
++p; /* advance over newline */
len = p - bufpos;
if (grep_lnbufgrow(len + 1))
goto error;
memcpy(lnbuf, bufpos, len);
bufrem -= len;
bufpos = p;
pc->ln.len = len;
lnbuf[len] = '\0';
return (lnbuf);
}
/* We have to copy the current buffered data to the line buffer */
for (len = bufrem, off = 0; ; len += bufrem) {
/* Make sure there is room for more data */
if (grep_lnbufgrow(len + LNBUFBUMP))
goto error;
memcpy(lnbuf + off, bufpos, len - off);
/* With FILE_MMAP, this is EOF; there's no more to refill */
if (filebehave == FILE_MMAP) {
bufrem -= len;
break;
}
off = len;
/* Fetch more to try and find EOL/EOF */
if (grep_refill(f) != 0)
goto error;
if (bufrem == 0)
/* EOF: return partial line */
break;
if ((p = memchr(bufpos, fileeol, bufrem)) == NULL)
continue;
/* got it: finish up the line (like code above) */
++p;
diff = p - bufpos;
len += diff;
if (grep_lnbufgrow(len + 1))
goto error;
memcpy(lnbuf + off, bufpos, diff);
bufrem -= diff;
bufpos = p;
break;
}
pc->ln.len = len;
lnbuf[len] = '\0';
return (lnbuf);
error:
pc->ln.len = 0;
return (NULL);
}
/*
* Opens a file for processing.
*/
struct file *
grep_open(const char *path)
{
struct file *f;
f = grep_malloc(sizeof *f);
memset(f, 0, sizeof *f);
if (path == NULL) {
/* Processing stdin implies --line-buffered. */
lbflag = true;
f->fd = STDIN_FILENO;
} else if ((f->fd = open(path, O_RDONLY)) == -1)
goto error1;
if (filebehave == FILE_MMAP) {
struct stat st;
if (fstat(f->fd, &st) == -1 || !S_ISREG(st.st_mode))
filebehave = FILE_STDIO;
else {
int flags = MAP_PRIVATE | MAP_NOCORE | MAP_NOSYNC;
#ifdef MAP_PREFAULT_READ
flags |= MAP_PREFAULT_READ;
#endif
fsiz = st.st_size;
buffer = mmap(NULL, fsiz, PROT_READ, flags,
f->fd, (off_t)0);
if (buffer == MAP_FAILED)
filebehave = FILE_STDIO;
else {
bufrem = st.st_size;
bufpos = buffer;
madvise(buffer, st.st_size, MADV_SEQUENTIAL);
}
}
}
if ((buffer == NULL) || (buffer == MAP_FAILED))
buffer = grep_malloc(MAXBUFSIZ);
/* Fill read buffer, also catches errors early */
if (bufrem == 0 && grep_refill(f) != 0)
goto error2;
/* Check for binary stuff, if necessary */
if (binbehave != BINFILE_TEXT && fileeol != '\0' &&
memchr(bufpos, '\0', bufrem) != NULL)
f->binary = true;
return (f);
error2:
close(f->fd);
error1:
free(f);
return (NULL);
}
/*
* Closes a file.
*/
void
grep_close(struct file *f)
{
close(f->fd);
/* Reset read buffer and line buffer */
if (filebehave == FILE_MMAP) {
munmap(buffer, fsiz);
buffer = NULL;
}
bufpos = buffer;
bufrem = 0;
free(lnbuf);
lnbuf = NULL;
lnbuflen = 0;
}
diff --git a/usr.bin/grep/grep.c b/usr.bin/grep/grep.c
index f9e8b9e5a2a5..c29a03f07702 100644
--- a/usr.bin/grep/grep.c
+++ b/usr.bin/grep/grep.c
@@ -1,727 +1,726 @@
/* $NetBSD: grep.c,v 1.6 2011/04/18 03:48:23 joerg Exp $ */
-/* $FreeBSD$ */
/* $OpenBSD: grep.c,v 1.42 2010/07/02 22:18:03 tedu Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
* Copyright (C) 2008-2009 Gabor Kovesdan <gabor@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/stat.h>
#include <sys/types.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <getopt.h>
#include <limits.h>
#include <libgen.h>
#include <locale.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "grep.h"
const char *errstr[] = {
"",
/* 1*/ "(standard input)",
/* 2*/ "unknown %s option",
/* 3*/ "usage: %s [-abcDEFGHhIiLlmnOoPqRSsUVvwxz] [-A num] [-B num] [-C num]\n",
/* 4*/ "\t[-e pattern] [-f file] [--binary-files=value] [--color=when]\n",
/* 5*/ "\t[--context=num] [--directories=action] [--label] [--line-buffered]\n",
/* 6*/ "\t[--null] [pattern] [file ...]\n",
/* 7*/ "Binary file %s matches\n",
/* 8*/ "%s (BSD grep, GNU compatible) %s\n",
};
/* Flags passed to regcomp() and regexec() */
int cflags = REG_NOSUB | REG_NEWLINE;
int eflags = REG_STARTEND;
bool matchall;
/* Searching patterns */
unsigned int patterns;
static unsigned int pattern_sz;
struct pat *pattern;
regex_t *r_pattern;
/* Filename exclusion/inclusion patterns */
unsigned int fpatterns, dpatterns;
static unsigned int fpattern_sz, dpattern_sz;
struct epat *dpattern, *fpattern;
/* For regex errors */
char re_error[RE_ERROR_BUF + 1];
/* Command-line flags */
long long Aflag; /* -A x: print x lines trailing each match */
long long Bflag; /* -B x: print x lines leading each match */
bool Hflag; /* -H: always print file name */
bool Lflag; /* -L: only show names of files with no matches */
bool bflag; /* -b: show block numbers for each match */
bool cflag; /* -c: only show a count of matching lines */
bool hflag; /* -h: don't print filename headers */
bool iflag; /* -i: ignore case */
bool lflag; /* -l: only show names of files with matches */
bool mflag; /* -m x: stop reading the files after x matches */
long long mcount; /* count for -m */
long long mlimit; /* requested value for -m */
char fileeol; /* indicator for eol */
bool nflag; /* -n: show line numbers in front of matching lines */
bool oflag; /* -o: print only matching part */
bool qflag; /* -q: quiet mode (don't output anything) */
bool sflag; /* -s: silent mode (ignore errors) */
bool vflag; /* -v: only show non-matching lines */
bool wflag; /* -w: pattern must start and end on word boundaries */
bool xflag; /* -x: pattern must match entire line */
bool lbflag; /* --line-buffered */
bool nullflag; /* --null */
char *label; /* --label */
const char *color; /* --color */
int grepbehave = GREP_BASIC; /* -EFGP: type of the regex */
int binbehave = BINFILE_BIN; /* -aIU: handling of binary files */
int filebehave = FILE_STDIO;
int devbehave = DEV_READ; /* -D: handling of devices */
int dirbehave = DIR_READ; /* -dRr: handling of directories */
int linkbehave = LINK_READ; /* -OpS: handling of symlinks */
bool dexclude, dinclude; /* --exclude-dir and --include-dir */
bool fexclude, finclude; /* --exclude and --include */
enum {
BIN_OPT = CHAR_MAX + 1,
COLOR_OPT,
HELP_OPT,
MMAP_OPT,
LINEBUF_OPT,
LABEL_OPT,
NULL_OPT,
R_EXCLUDE_OPT,
R_INCLUDE_OPT,
R_DEXCLUDE_OPT,
R_DINCLUDE_OPT
};
static inline const char *init_color(const char *);
/* Housekeeping */
bool file_err; /* file reading error */
/*
* Prints usage information and returns 2.
*/
static void
usage(void)
{
fprintf(stderr, errstr[3], getprogname());
fprintf(stderr, "%s", errstr[4]);
fprintf(stderr, "%s", errstr[5]);
fprintf(stderr, "%s", errstr[6]);
exit(2);
}
static const char *optstr = "0123456789A:B:C:D:EFGHILOPSRUVabcd:e:f:hilm:nopqrsuvwxyz";
static const struct option long_options[] =
{
{"binary-files", required_argument, NULL, BIN_OPT},
{"help", no_argument, NULL, HELP_OPT},
{"mmap", no_argument, NULL, MMAP_OPT},
{"line-buffered", no_argument, NULL, LINEBUF_OPT},
{"label", required_argument, NULL, LABEL_OPT},
{"null", no_argument, NULL, NULL_OPT},
{"color", optional_argument, NULL, COLOR_OPT},
{"colour", optional_argument, NULL, COLOR_OPT},
{"exclude", required_argument, NULL, R_EXCLUDE_OPT},
{"include", required_argument, NULL, R_INCLUDE_OPT},
{"exclude-dir", required_argument, NULL, R_DEXCLUDE_OPT},
{"include-dir", required_argument, NULL, R_DINCLUDE_OPT},
{"after-context", required_argument, NULL, 'A'},
{"text", no_argument, NULL, 'a'},
{"before-context", required_argument, NULL, 'B'},
{"byte-offset", no_argument, NULL, 'b'},
{"context", optional_argument, NULL, 'C'},
{"count", no_argument, NULL, 'c'},
{"devices", required_argument, NULL, 'D'},
{"directories", required_argument, NULL, 'd'},
{"extended-regexp", no_argument, NULL, 'E'},
{"regexp", required_argument, NULL, 'e'},
{"fixed-strings", no_argument, NULL, 'F'},
{"file", required_argument, NULL, 'f'},
{"basic-regexp", no_argument, NULL, 'G'},
{"no-filename", no_argument, NULL, 'h'},
{"with-filename", no_argument, NULL, 'H'},
{"ignore-case", no_argument, NULL, 'i'},
{"files-with-matches", no_argument, NULL, 'l'},
{"files-without-match", no_argument, NULL, 'L'},
{"max-count", required_argument, NULL, 'm'},
{"line-number", no_argument, NULL, 'n'},
{"only-matching", no_argument, NULL, 'o'},
{"quiet", no_argument, NULL, 'q'},
{"silent", no_argument, NULL, 'q'},
{"recursive", no_argument, NULL, 'r'},
{"no-messages", no_argument, NULL, 's'},
{"binary", no_argument, NULL, 'U'},
{"unix-byte-offsets", no_argument, NULL, 'u'},
{"invert-match", no_argument, NULL, 'v'},
{"version", no_argument, NULL, 'V'},
{"word-regexp", no_argument, NULL, 'w'},
{"line-regexp", no_argument, NULL, 'x'},
{"null-data", no_argument, NULL, 'z'},
{NULL, no_argument, NULL, 0}
};
/*
* Adds a searching pattern to the internal array.
*/
static void
add_pattern(char *pat, size_t len)
{
/* Check if we can do a shortcut */
if (len == 0) {
matchall = true;
return;
}
/* Increase size if necessary */
if (patterns == pattern_sz) {
pattern_sz *= 2;
pattern = grep_realloc(pattern, ++pattern_sz *
sizeof(struct pat));
}
if (len > 0 && pat[len - 1] == '\n')
--len;
/* pat may not be NUL-terminated */
pattern[patterns].pat = grep_malloc(len + 1);
memcpy(pattern[patterns].pat, pat, len);
pattern[patterns].len = len;
pattern[patterns].pat[len] = '\0';
++patterns;
}
/*
* Adds a file include/exclude pattern to the internal array.
*/
static void
add_fpattern(const char *pat, int mode)
{
/* Increase size if necessary */
if (fpatterns == fpattern_sz) {
fpattern_sz *= 2;
fpattern = grep_realloc(fpattern, ++fpattern_sz *
sizeof(struct epat));
}
fpattern[fpatterns].pat = grep_strdup(pat);
fpattern[fpatterns].mode = mode;
++fpatterns;
}
/*
* Adds a directory include/exclude pattern to the internal array.
*/
static void
add_dpattern(const char *pat, int mode)
{
/* Increase size if necessary */
if (dpatterns == dpattern_sz) {
dpattern_sz *= 2;
dpattern = grep_realloc(dpattern, ++dpattern_sz *
sizeof(struct epat));
}
dpattern[dpatterns].pat = grep_strdup(pat);
dpattern[dpatterns].mode = mode;
++dpatterns;
}
/*
* Reads searching patterns from a file and adds them with add_pattern().
*/
static void
read_patterns(const char *fn)
{
struct stat st;
FILE *f;
char *line;
size_t len;
ssize_t rlen;
if (strcmp(fn, "-") == 0)
f = stdin;
else if ((f = fopen(fn, "r")) == NULL)
err(2, "%s", fn);
if ((fstat(fileno(f), &st) == -1) || (S_ISDIR(st.st_mode))) {
fclose(f);
return;
}
len = 0;
line = NULL;
while ((rlen = getline(&line, &len, f)) != -1) {
if (line[0] == '\0')
continue;
add_pattern(line, line[0] == '\n' ? 0 : (size_t)rlen);
}
free(line);
if (ferror(f))
err(2, "%s", fn);
if (strcmp(fn, "-") != 0)
fclose(f);
}
static inline const char *
init_color(const char *d)
{
char *c;
c = getenv("GREP_COLOR");
return (c != NULL && c[0] != '\0' ? c : d);
}
int
main(int argc, char *argv[])
{
char **aargv, **eargv, *eopts;
char *ep;
const char *pn;
long long l;
unsigned int aargc, eargc, i;
int c, lastc, needpattern, newarg, prevoptind;
bool matched;
setlocale(LC_ALL, "");
/*
* Check how we've bene invoked to determine the behavior we should
* exhibit. In this way we can have all the functionalities in one
* binary without the need of scripting and using ugly hacks.
*/
pn = getprogname();
switch (pn[0]) {
case 'e':
grepbehave = GREP_EXTENDED;
break;
case 'f':
grepbehave = GREP_FIXED;
break;
case 'r':
dirbehave = DIR_RECURSE;
Hflag = true;
break;
}
lastc = '\0';
newarg = 1;
prevoptind = 1;
needpattern = 1;
fileeol = '\n';
eopts = getenv("GREP_OPTIONS");
/* support for extra arguments in GREP_OPTIONS */
eargc = 0;
if (eopts != NULL && eopts[0] != '\0') {
char *str;
/* make an estimation of how many extra arguments we have */
for (unsigned int j = 0; j < strlen(eopts); j++)
if (eopts[j] == ' ')
eargc++;
eargv = (char **)grep_malloc(sizeof(char *) * (eargc + 1));
eargc = 0;
/* parse extra arguments */
while ((str = strsep(&eopts, " ")) != NULL)
if (str[0] != '\0')
eargv[eargc++] = grep_strdup(str);
aargv = (char **)grep_calloc(eargc + argc + 1,
sizeof(char *));
aargv[0] = argv[0];
for (i = 0; i < eargc; i++)
aargv[i + 1] = eargv[i];
for (int j = 1; j < argc; j++, i++)
aargv[i + 1] = argv[j];
aargc = eargc + argc;
} else {
aargv = argv;
aargc = argc;
}
while (((c = getopt_long(aargc, aargv, optstr, long_options, NULL)) !=
-1)) {
switch (c) {
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
if (newarg || !isdigit(lastc))
Aflag = 0;
else if (Aflag > LLONG_MAX / 10 - 1) {
errno = ERANGE;
err(2, NULL);
}
Aflag = Bflag = (Aflag * 10) + (c - '0');
break;
case 'C':
if (optarg == NULL) {
Aflag = Bflag = 2;
break;
}
/* FALLTHROUGH */
case 'A':
/* FALLTHROUGH */
case 'B':
errno = 0;
l = strtoll(optarg, &ep, 10);
if (errno == ERANGE || errno == EINVAL)
err(2, NULL);
else if (ep[0] != '\0') {
errno = EINVAL;
err(2, NULL);
} else if (l < 0) {
errno = EINVAL;
err(2, "context argument must be non-negative");
}
if (c == 'A')
Aflag = l;
else if (c == 'B')
Bflag = l;
else
Aflag = Bflag = l;
break;
case 'a':
binbehave = BINFILE_TEXT;
break;
case 'b':
bflag = true;
break;
case 'c':
cflag = true;
break;
case 'D':
if (strcasecmp(optarg, "skip") == 0)
devbehave = DEV_SKIP;
else if (strcasecmp(optarg, "read") == 0)
devbehave = DEV_READ;
else
errx(2, errstr[2], "--devices");
break;
case 'd':
if (strcasecmp("recurse", optarg) == 0) {
Hflag = true;
dirbehave = DIR_RECURSE;
} else if (strcasecmp("skip", optarg) == 0)
dirbehave = DIR_SKIP;
else if (strcasecmp("read", optarg) == 0)
dirbehave = DIR_READ;
else
errx(2, errstr[2], "--directories");
break;
case 'E':
grepbehave = GREP_EXTENDED;
break;
case 'e':
{
char *token;
char *string = optarg;
while ((token = strsep(&string, "\n")) != NULL)
add_pattern(token, strlen(token));
}
needpattern = 0;
break;
case 'F':
grepbehave = GREP_FIXED;
break;
case 'f':
read_patterns(optarg);
needpattern = 0;
break;
case 'G':
grepbehave = GREP_BASIC;
break;
case 'H':
Hflag = true;
break;
case 'h':
Hflag = false;
hflag = true;
break;
case 'I':
binbehave = BINFILE_SKIP;
break;
case 'i':
case 'y':
iflag = true;
cflags |= REG_ICASE;
break;
case 'L':
lflag = false;
Lflag = true;
break;
case 'l':
Lflag = false;
lflag = true;
break;
case 'm':
mflag = true;
errno = 0;
mlimit = mcount = strtoll(optarg, &ep, 10);
if (((errno == ERANGE) && (mcount == LLONG_MAX)) ||
((errno == EINVAL) && (mcount == 0)))
err(2, NULL);
else if (ep[0] != '\0') {
errno = EINVAL;
err(2, NULL);
}
break;
case 'n':
nflag = true;
break;
case 'O':
linkbehave = LINK_EXPLICIT;
break;
case 'o':
oflag = true;
cflags &= ~REG_NOSUB;
break;
case 'p':
linkbehave = LINK_SKIP;
break;
case 'q':
qflag = true;
break;
case 'S':
linkbehave = LINK_READ;
break;
case 'R':
case 'r':
dirbehave = DIR_RECURSE;
Hflag = true;
break;
case 's':
sflag = true;
break;
case 'U':
binbehave = BINFILE_BIN;
break;
case 'u':
case MMAP_OPT:
filebehave = FILE_MMAP;
break;
case 'V':
printf(errstr[8], getprogname(), VERSION);
exit(0);
case 'v':
vflag = true;
break;
case 'w':
wflag = true;
cflags &= ~REG_NOSUB;
break;
case 'x':
xflag = true;
cflags &= ~REG_NOSUB;
break;
case 'z':
fileeol = '\0';
cflags &= ~REG_NEWLINE;
break;
case BIN_OPT:
if (strcasecmp("binary", optarg) == 0)
binbehave = BINFILE_BIN;
else if (strcasecmp("without-match", optarg) == 0)
binbehave = BINFILE_SKIP;
else if (strcasecmp("text", optarg) == 0)
binbehave = BINFILE_TEXT;
else
errx(2, errstr[2], "--binary-files");
break;
case COLOR_OPT:
color = NULL;
if (optarg == NULL || strcasecmp("auto", optarg) == 0 ||
strcasecmp("tty", optarg) == 0 ||
strcasecmp("if-tty", optarg) == 0) {
char *term;
term = getenv("TERM");
if (isatty(STDOUT_FILENO) && term != NULL &&
strcasecmp(term, "dumb") != 0)
color = init_color("01;31");
} else if (strcasecmp("always", optarg) == 0 ||
strcasecmp("yes", optarg) == 0 ||
strcasecmp("force", optarg) == 0) {
color = init_color("01;31");
} else if (strcasecmp("never", optarg) != 0 &&
strcasecmp("none", optarg) != 0 &&
strcasecmp("no", optarg) != 0)
errx(2, errstr[2], "--color");
cflags &= ~REG_NOSUB;
break;
case LABEL_OPT:
label = optarg;
break;
case LINEBUF_OPT:
lbflag = true;
break;
case NULL_OPT:
nullflag = true;
break;
case R_INCLUDE_OPT:
finclude = true;
add_fpattern(optarg, INCL_PAT);
break;
case R_EXCLUDE_OPT:
fexclude = true;
add_fpattern(optarg, EXCL_PAT);
break;
case R_DINCLUDE_OPT:
dinclude = true;
add_dpattern(optarg, INCL_PAT);
break;
case R_DEXCLUDE_OPT:
dexclude = true;
add_dpattern(optarg, EXCL_PAT);
break;
case HELP_OPT:
default:
usage();
}
lastc = c;
newarg = optind != prevoptind;
prevoptind = optind;
}
aargc -= optind;
aargv += optind;
/* xflag takes precedence, don't confuse the matching bits. */
if (wflag && xflag)
wflag = false;
/* Fail if we don't have any pattern */
if (aargc == 0 && needpattern)
usage();
/* Process patterns from command line */
if (aargc != 0 && needpattern) {
char *token;
char *string = *aargv;
while ((token = strsep(&string, "\n")) != NULL)
add_pattern(token, strlen(token));
--aargc;
++aargv;
}
switch (grepbehave) {
case GREP_BASIC:
break;
case GREP_FIXED:
/*
* regex(3) implementations that support fixed-string searches generally
* define either REG_NOSPEC or REG_LITERAL. Set the appropriate flag
* here. If neither are defined, GREP_FIXED later implies that the
* internal literal matcher should be used. Other cflags that have
* the same interpretation as REG_NOSPEC and REG_LITERAL should be
* similarly added here, and grep.h should be amended to take this into
* consideration when defining WITH_INTERNAL_NOSPEC.
*/
#if defined(REG_NOSPEC)
cflags |= REG_NOSPEC;
#elif defined(REG_LITERAL)
cflags |= REG_LITERAL;
#endif
break;
case GREP_EXTENDED:
cflags |= REG_EXTENDED;
break;
default:
/* NOTREACHED */
usage();
}
r_pattern = grep_calloc(patterns, sizeof(*r_pattern));
#ifdef WITH_INTERNAL_NOSPEC
if (grepbehave != GREP_FIXED) {
#else
{
#endif
/* Check if cheating is allowed (always is for fgrep). */
for (i = 0; i < patterns; ++i) {
c = regcomp(&r_pattern[i], pattern[i].pat, cflags);
if (c != 0) {
regerror(c, &r_pattern[i], re_error,
RE_ERROR_BUF);
errx(2, "%s", re_error);
}
}
}
if (lbflag)
setlinebuf(stdout);
if ((aargc == 0 || aargc == 1) && !Hflag)
hflag = true;
initqueue();
if (aargc == 0 && dirbehave != DIR_RECURSE)
exit(!procfile("-"));
if (dirbehave == DIR_RECURSE)
matched = grep_tree(aargv);
else
for (matched = false; aargc--; ++aargv) {
if ((finclude || fexclude) && !file_matching(*aargv))
continue;
if (procfile(*aargv))
matched = true;
}
if (Lflag)
matched = !matched;
/*
* Calculate the correct return value according to the
* results and the command line option.
*/
exit(matched ? (file_err ? (qflag ? 0 : 2) : 0) : (file_err ? 2 : 1));
}
diff --git a/usr.bin/grep/grep.h b/usr.bin/grep/grep.h
index 3ac05f75fa8b..02f612aecf1f 100644
--- a/usr.bin/grep/grep.h
+++ b/usr.bin/grep/grep.h
@@ -1,160 +1,159 @@
/* $NetBSD: grep.h,v 1.5 2011/02/27 17:33:37 joerg Exp $ */
/* $OpenBSD: grep.h,v 1.15 2010/04/05 03:03:55 tedu Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
* Copyright (c) 2008-2009 Gabor Kovesdan <gabor@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <bzlib.h>
#include <limits.h>
#include <regex.h>
#include <stdbool.h>
#include <stdio.h>
#include <zlib.h>
extern const char *errstr[];
#define VERSION "2.6.0-FreeBSD"
#define GREP_FIXED 0
#define GREP_BASIC 1
#define GREP_EXTENDED 2
#if !defined(REG_NOSPEC) && !defined(REG_LITERAL)
#define WITH_INTERNAL_NOSPEC
#endif
#define BINFILE_BIN 0
#define BINFILE_SKIP 1
#define BINFILE_TEXT 2
#define FILE_STDIO 0
#define FILE_MMAP 1
#define DIR_READ 0
#define DIR_SKIP 1
#define DIR_RECURSE 2
#define DEV_READ 0
#define DEV_SKIP 1
#define LINK_READ 0
#define LINK_EXPLICIT 1
#define LINK_SKIP 2
#define EXCL_PAT 0
#define INCL_PAT 1
#define MAX_MATCHES 32
struct file {
int fd;
bool binary;
};
struct str {
off_t boff;
off_t off;
size_t len;
char *dat;
char *file;
int line_no;
};
struct pat {
char *pat;
int len;
};
struct epat {
char *pat;
int mode;
};
/*
* Parsing context; used to hold things like matches made and
* other useful bits
*/
struct parsec {
regmatch_t matches[MAX_MATCHES]; /* Matches made */
/* XXX TODO: This should be a chunk, not a line */
struct str ln; /* Current line */
size_t lnstart; /* Position in line */
size_t matchidx; /* Latest match index */
int printed; /* Metadata printed? */
bool binary; /* Binary file? */
bool cntlines; /* Count lines? */
};
/* Flags passed to regcomp() and regexec() */
extern int cflags, eflags;
/* Command line flags */
extern bool Eflag, Fflag, Gflag, Hflag, Lflag,
bflag, cflag, hflag, iflag, lflag, mflag, nflag, oflag,
qflag, sflag, vflag, wflag, xflag;
extern bool dexclude, dinclude, fexclude, finclude, lbflag, nullflag;
extern long long Aflag, Bflag;
extern long long mcount;
extern long long mlimit;
extern char fileeol;
extern char *label;
extern const char *color;
extern int binbehave, devbehave, dirbehave, filebehave, grepbehave, linkbehave;
extern bool file_err, matchall;
extern unsigned int dpatterns, fpatterns, patterns;
extern struct pat *pattern;
extern struct epat *dpattern, *fpattern;
extern regex_t *er_pattern, *r_pattern;
/* For regex errors */
#define RE_ERROR_BUF 512
extern char re_error[RE_ERROR_BUF + 1]; /* Seems big enough */
/* util.c */
bool file_matching(const char *fname);
bool procfile(const char *fn);
bool grep_tree(char **argv);
void *grep_malloc(size_t size);
void *grep_calloc(size_t nmemb, size_t size);
void *grep_realloc(void *ptr, size_t size);
char *grep_strdup(const char *str);
void grep_printline(struct str *line, int sep);
/* queue.c */
void initqueue(void);
bool enqueue(struct str *x);
void printqueue(void);
void clearqueue(void);
/* file.c */
void grep_close(struct file *f);
struct file *grep_open(const char *path);
char *grep_fgetln(struct file *f, struct parsec *pc);
diff --git a/usr.bin/grep/queue.c b/usr.bin/grep/queue.c
index bcaa959f406c..1b74c1799991 100644
--- a/usr.bin/grep/queue.c
+++ b/usr.bin/grep/queue.c
@@ -1,146 +1,145 @@
/* $NetBSD: queue.c,v 1.5 2011/08/31 16:24:57 plunky Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
* All rights reserved.
* Copyright (c) 2020 Kyle Evans <kevans@FreeBSD.org>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* A really poor man's queue. It does only what it has to and gets out of
* Dodge. It is used in place of <sys/queue.h> to get a better performance.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/param.h>
#include <sys/queue.h>
#include <stdlib.h>
#include <string.h>
#include "grep.h"
typedef struct str qentry_t;
static long long filled;
static qentry_t *qend, *qpool;
/*
* qnext is the next entry to populate. qlist is where the list actually
* starts, for the purposes of printing.
*/
static qentry_t *qlist, *qnext;
void
initqueue(void)
{
qlist = qnext = qpool = grep_calloc(Bflag, sizeof(*qpool));
qend = qpool + (Bflag - 1);
}
static qentry_t *
advqueue(qentry_t *itemp)
{
if (itemp == qend)
return (qpool);
return (itemp + 1);
}
/*
* Enqueue another line; return true if we've dequeued a line as a result
*/
bool
enqueue(struct str *x)
{
qentry_t *item;
bool rotated;
item = qnext;
qnext = advqueue(qnext);
rotated = false;
if (filled < Bflag) {
filled++;
} else if (filled == Bflag) {
/* We had already filled up coming in; just rotate. */
qlist = advqueue(qlist);
rotated = true;
free(item->dat);
}
/* len + 1 for NUL-terminator */
item->dat = grep_malloc(sizeof(char) * x->len + 1);
item->len = x->len;
item->line_no = x->line_no;
item->boff = x->boff;
item->off = x->off;
memcpy(item->dat, x->dat, x->len);
item->dat[x->len] = '\0';
item->file = x->file;
return (rotated);
}
void
printqueue(void)
{
qentry_t *item;
item = qlist;
do {
/* Buffer must have ended early. */
if (item->dat == NULL)
break;
grep_printline(item, '-');
free(item->dat);
item->dat = NULL;
item = advqueue(item);
} while (item != qlist);
qlist = qnext = qpool;
filled = 0;
}
void
clearqueue(void)
{
qentry_t *item;
item = qlist;
do {
free(item->dat);
item->dat = NULL;
item = advqueue(item);
} while (item != qlist);
qlist = qnext = qpool;
filled = 0;
}
diff --git a/usr.bin/grep/util.c b/usr.bin/grep/util.c
index eba060ba6cdc..723b41e8798a 100644
--- a/usr.bin/grep/util.c
+++ b/usr.bin/grep/util.c
@@ -1,795 +1,794 @@
/* $NetBSD: util.c,v 1.9 2011/02/27 17:33:37 joerg Exp $ */
-/* $FreeBSD$ */
/* $OpenBSD: util.c,v 1.39 2010/07/02 22:18:03 tedu Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
* Copyright (C) 2008-2010 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2017 Kyle Evans <kevans@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/stat.h>
#include <sys/types.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <fnmatch.h>
#include <fts.h>
#include <libgen.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <wchar.h>
#include <wctype.h>
#include "grep.h"
static bool first_match = true;
/*
* Match printing context
*/
struct mprintc {
long long tail; /* Number of trailing lines to record */
int last_outed; /* Number of lines since last output */
bool doctx; /* Printing context? */
bool printmatch; /* Printing matches? */
bool same_file; /* Same file as previously printed? */
};
static void procmatch_match(struct mprintc *mc, struct parsec *pc);
static void procmatch_nomatch(struct mprintc *mc, struct parsec *pc);
static bool procmatches(struct mprintc *mc, struct parsec *pc, bool matched);
#ifdef WITH_INTERNAL_NOSPEC
static int litexec(const struct pat *pat, const char *string,
size_t nmatch, regmatch_t pmatch[]);
#endif
static bool procline(struct parsec *pc);
static void printline(struct parsec *pc, int sep);
static void printline_metadata(struct str *line, int sep);
bool
file_matching(const char *fname)
{
char *fname_base, *fname_buf;
bool ret;
ret = finclude ? false : true;
fname_buf = strdup(fname);
if (fname_buf == NULL)
err(2, "strdup");
fname_base = basename(fname_buf);
for (unsigned int i = 0; i < fpatterns; ++i) {
if (fnmatch(fpattern[i].pat, fname, 0) == 0 ||
fnmatch(fpattern[i].pat, fname_base, 0) == 0)
/*
* The last pattern matched wins exclusion/inclusion
* rights, so we can't reasonably bail out early here.
*/
ret = (fpattern[i].mode != EXCL_PAT);
}
free(fname_buf);
return (ret);
}
static inline bool
dir_matching(const char *dname)
{
bool ret;
ret = dinclude ? false : true;
for (unsigned int i = 0; i < dpatterns; ++i) {
if (dname != NULL && fnmatch(dpattern[i].pat, dname, 0) == 0)
/*
* The last pattern matched wins exclusion/inclusion
* rights, so we can't reasonably bail out early here.
*/
ret = (dpattern[i].mode != EXCL_PAT);
}
return (ret);
}
/*
* Processes a directory when a recursive search is performed with
* the -R option. Each appropriate file is passed to procfile().
*/
bool
grep_tree(char **argv)
{
FTS *fts;
FTSENT *p;
int fts_flags;
bool matched, ok;
const char *wd[] = { ".", NULL };
matched = false;
/* This switch effectively initializes 'fts_flags' */
switch(linkbehave) {
case LINK_EXPLICIT:
fts_flags = FTS_COMFOLLOW;
break;
case LINK_SKIP:
fts_flags = FTS_PHYSICAL;
break;
default:
fts_flags = FTS_LOGICAL;
}
fts_flags |= FTS_NOSTAT | FTS_NOCHDIR;
fts = fts_open((argv[0] == NULL) ?
__DECONST(char * const *, wd) : argv, fts_flags, NULL);
if (fts == NULL)
err(2, "fts_open");
while (errno = 0, (p = fts_read(fts)) != NULL) {
switch (p->fts_info) {
case FTS_DNR:
/* FALLTHROUGH */
case FTS_ERR:
file_err = true;
if(!sflag)
warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
break;
case FTS_D:
/* FALLTHROUGH */
case FTS_DP:
if (dexclude || dinclude)
if (!dir_matching(p->fts_name) ||
!dir_matching(p->fts_path))
fts_set(fts, p, FTS_SKIP);
break;
case FTS_DC:
/* Print a warning for recursive directory loop */
warnx("warning: %s: recursive directory loop",
p->fts_path);
break;
default:
/* Check for file exclusion/inclusion */
ok = true;
if (fexclude || finclude)
ok &= file_matching(p->fts_path);
if (ok && procfile(p->fts_path))
matched = true;
break;
}
}
if (errno != 0)
err(2, "fts_read");
fts_close(fts);
return (matched);
}
static void
procmatch_match(struct mprintc *mc, struct parsec *pc)
{
if (mc->doctx) {
if (!first_match && (!mc->same_file || mc->last_outed > 0))
printf("--\n");
if (Bflag > 0)
printqueue();
mc->tail = Aflag;
}
/* Print the matching line, but only if not quiet/binary */
if (mc->printmatch) {
printline(pc, ':');
while (pc->matchidx >= MAX_MATCHES) {
/* Reset matchidx and try again */
pc->matchidx = 0;
if (procline(pc) == !vflag)
printline(pc, ':');
else
break;
}
first_match = false;
mc->same_file = true;
mc->last_outed = 0;
}
}
static void
procmatch_nomatch(struct mprintc *mc, struct parsec *pc)
{
/* Deal with any -A context as needed */
if (mc->tail > 0) {
grep_printline(&pc->ln, '-');
mc->tail--;
if (Bflag > 0)
clearqueue();
} else if (Bflag == 0 || (Bflag > 0 && enqueue(&pc->ln)))
/*
* Enqueue non-matching lines for -B context. If we're not
* actually doing -B context or if the enqueue resulted in a
* line being rotated out, then go ahead and increment
* last_outed to signify a gap between context/match.
*/
++mc->last_outed;
}
/*
* Process any matches in the current parsing context, return a boolean
* indicating whether we should halt any further processing or not. 'true' to
* continue processing, 'false' to halt.
*/
static bool
procmatches(struct mprintc *mc, struct parsec *pc, bool matched)
{
if (mflag && mcount <= 0) {
/*
* We already hit our match count, but we need to keep dumping
* lines until we've lost our tail.
*/
grep_printline(&pc->ln, '-');
mc->tail--;
return (mc->tail != 0);
}
/*
* XXX TODO: This should loop over pc->matches and handle things on a
* line-by-line basis, setting up a `struct str` as needed.
*/
/* Deal with any -B context or context separators */
if (matched) {
procmatch_match(mc, pc);
/* Count the matches if we have a match limit */
if (mflag) {
/* XXX TODO: Decrement by number of matched lines */
mcount -= 1;
if (mcount <= 0)
return (mc->tail != 0);
}
} else if (mc->doctx)
procmatch_nomatch(mc, pc);
return (true);
}
/*
* Opens a file and processes it. Each file is processed line-by-line
* passing the lines to procline().
*/
bool
procfile(const char *fn)
{
struct parsec pc;
struct mprintc mc;
struct file *f;
struct stat sb;
mode_t s;
int lines;
bool line_matched;
if (strcmp(fn, "-") == 0) {
fn = label != NULL ? label : errstr[1];
f = grep_open(NULL);
} else {
if (stat(fn, &sb) == 0) {
/* Check if we need to process the file */
s = sb.st_mode & S_IFMT;
if (dirbehave == DIR_SKIP && s == S_IFDIR)
return (false);
if (devbehave == DEV_SKIP && (s == S_IFIFO ||
s == S_IFCHR || s == S_IFBLK || s == S_IFSOCK))
return (false);
}
f = grep_open(fn);
}
if (f == NULL) {
file_err = true;
if (!sflag)
warn("%s", fn);
return (false);
}
pc.ln.file = grep_strdup(fn);
pc.ln.line_no = 0;
pc.ln.len = 0;
pc.ln.boff = 0;
pc.ln.off = -1;
pc.binary = f->binary;
pc.cntlines = false;
memset(&mc, 0, sizeof(mc));
mc.printmatch = true;
if ((pc.binary && binbehave == BINFILE_BIN) || cflag || qflag ||
lflag || Lflag)
mc.printmatch = false;
if (mc.printmatch && (Aflag != 0 || Bflag != 0))
mc.doctx = true;
if (mc.printmatch && (Aflag != 0 || Bflag != 0 || mflag || nflag))
pc.cntlines = true;
mcount = mlimit;
for (lines = 0; lines == 0 || !(lflag || qflag); ) {
/*
* XXX TODO: We need to revisit this in a chunking world. We're
* not going to be doing per-line statistics because of the
* overhead involved. procmatches can figure that stuff out as
* needed. */
/* Reset per-line statistics */
pc.printed = 0;
pc.matchidx = 0;
pc.lnstart = 0;
pc.ln.boff = 0;
pc.ln.off += pc.ln.len + 1;
/* XXX TODO: Grab a chunk */
if ((pc.ln.dat = grep_fgetln(f, &pc)) == NULL ||
pc.ln.len == 0)
break;
if (pc.ln.len > 0 && pc.ln.dat[pc.ln.len - 1] == fileeol)
--pc.ln.len;
pc.ln.line_no++;
/* Return if we need to skip a binary file */
if (pc.binary && binbehave == BINFILE_SKIP) {
grep_close(f);
free(pc.ln.file);
free(f);
return (0);
}
if (mflag && mcount <= 0) {
/*
* Short-circuit, already hit match count and now we're
* just picking up any remaining pieces.
*/
if (!procmatches(&mc, &pc, false))
break;
continue;
}
line_matched = procline(&pc) == !vflag;
if (line_matched)
++lines;
/* Halt processing if we hit our match limit */
if (!procmatches(&mc, &pc, line_matched))
break;
}
if (Bflag > 0)
clearqueue();
grep_close(f);
if (cflag && !qflag) {
if (!hflag)
printf("%s:", pc.ln.file);
printf("%u\n", lines);
}
if (lflag && !qflag && lines != 0)
printf("%s%c", fn, nullflag ? 0 : '\n');
if (Lflag && !qflag && lines == 0)
printf("%s%c", fn, nullflag ? 0 : '\n');
if (lines != 0 && !cflag && !lflag && !Lflag &&
binbehave == BINFILE_BIN && f->binary && !qflag)
printf(errstr[7], fn);
free(pc.ln.file);
free(f);
return (lines != 0);
}
#ifdef WITH_INTERNAL_NOSPEC
/*
* Internal implementation of literal string search within a string, modeled
* after regexec(3), for use when the regex(3) implementation doesn't offer
* either REG_NOSPEC or REG_LITERAL. This does not apply in the default FreeBSD
* config, but in other scenarios such as building against libgnuregex or on
* some non-FreeBSD OSes.
*/
static int
litexec(const struct pat *pat, const char *string, size_t nmatch,
regmatch_t pmatch[])
{
char *(*strstr_fn)(const char *, const char *);
char *sub, *subject;
const char *search;
size_t idx, n, ofs, stringlen;
if (cflags & REG_ICASE)
strstr_fn = strcasestr;
else
strstr_fn = strstr;
idx = 0;
ofs = pmatch[0].rm_so;
stringlen = pmatch[0].rm_eo;
if (ofs >= stringlen)
return (REG_NOMATCH);
subject = strndup(string, stringlen);
if (subject == NULL)
return (REG_ESPACE);
for (n = 0; ofs < stringlen;) {
search = (subject + ofs);
if ((unsigned long)pat->len > strlen(search))
break;
sub = strstr_fn(search, pat->pat);
/*
* Ignoring the empty string possibility due to context: grep optimizes
* for empty patterns and will never reach this point.
*/
if (sub == NULL)
break;
++n;
/* Fill in pmatch if necessary */
if (nmatch > 0) {
pmatch[idx].rm_so = ofs + (sub - search);
pmatch[idx].rm_eo = pmatch[idx].rm_so + pat->len;
if (++idx == nmatch)
break;
ofs = pmatch[idx].rm_so + 1;
} else
/* We only needed to know if we match or not */
break;
}
free(subject);
if (n > 0 && nmatch > 0)
for (n = idx; n < nmatch; ++n)
pmatch[n].rm_so = pmatch[n].rm_eo = -1;
return (n > 0 ? 0 : REG_NOMATCH);
}
#endif /* WITH_INTERNAL_NOSPEC */
#define iswword(x) (iswalnum((x)) || (x) == L'_')
/*
* Processes a line comparing it with the specified patterns. Each pattern
* is looped to be compared along with the full string, saving each and every
* match, which is necessary to colorize the output and to count the
* matches. The matching lines are passed to printline() to display the
* appropriate output.
*/
static bool
procline(struct parsec *pc)
{
regmatch_t pmatch, lastmatch, chkmatch;
wchar_t wbegin, wend;
size_t st, nst;
unsigned int i;
int r = 0, leflags = eflags;
size_t startm = 0, matchidx;
unsigned int retry;
bool lastmatched, matched;
matchidx = pc->matchidx;
/* Null pattern shortcuts. */
if (matchall) {
if (xflag && pc->ln.len == 0) {
/* Matches empty lines (-x). */
return (true);
} else if (!wflag && !xflag) {
/* Matches every line (no -w or -x). */
return (true);
}
/*
* If we only have the NULL pattern, whether we match or not
* depends on if we got here with -w or -x. If either is set,
* the answer is no. If we have other patterns, we'll defer
* to them.
*/
if (patterns == 0) {
return (!(wflag || xflag));
}
} else if (patterns == 0) {
/* Pattern file with no patterns. */
return (false);
}
matched = false;
st = pc->lnstart;
nst = 0;
/* Initialize to avoid a false positive warning from GCC. */
lastmatch.rm_so = lastmatch.rm_eo = 0;
/* Loop to process the whole line */
while (st <= pc->ln.len) {
lastmatched = false;
startm = matchidx;
retry = 0;
if (st > 0 && pc->ln.dat[st - 1] != fileeol)
leflags |= REG_NOTBOL;
/* Loop to compare with all the patterns */
for (i = 0; i < patterns; i++) {
pmatch.rm_so = st;
pmatch.rm_eo = pc->ln.len;
#ifdef WITH_INTERNAL_NOSPEC
if (grepbehave == GREP_FIXED)
r = litexec(&pattern[i], pc->ln.dat, 1, &pmatch);
else
#endif
r = regexec(&r_pattern[i], pc->ln.dat, 1, &pmatch,
leflags);
if (r != 0)
continue;
/* Check for full match */
if (xflag && (pmatch.rm_so != 0 ||
(size_t)pmatch.rm_eo != pc->ln.len))
continue;
/* Check for whole word match */
if (wflag) {
wbegin = wend = L' ';
if (pmatch.rm_so != 0 &&
sscanf(&pc->ln.dat[pmatch.rm_so - 1],
"%lc", &wbegin) != 1)
r = REG_NOMATCH;
else if ((size_t)pmatch.rm_eo !=
pc->ln.len &&
sscanf(&pc->ln.dat[pmatch.rm_eo],
"%lc", &wend) != 1)
r = REG_NOMATCH;
else if (iswword(wbegin) ||
iswword(wend))
r = REG_NOMATCH;
/*
* If we're doing whole word matching and we
* matched once, then we should try the pattern
* again after advancing just past the start of
* the earliest match. This allows the pattern
* to match later on in the line and possibly
* still match a whole word.
*/
if (r == REG_NOMATCH &&
(retry == pc->lnstart ||
(unsigned int)pmatch.rm_so + 1 < retry))
retry = pmatch.rm_so + 1;
if (r == REG_NOMATCH)
continue;
}
lastmatched = true;
lastmatch = pmatch;
if (matchidx == 0)
matched = true;
/*
* Replace previous match if the new one is earlier
* and/or longer. This will lead to some amount of
* extra work if -o/--color are specified, but it's
* worth it from a correctness point of view.
*/
if (matchidx > startm) {
chkmatch = pc->matches[matchidx - 1];
if (pmatch.rm_so < chkmatch.rm_so ||
(pmatch.rm_so == chkmatch.rm_so &&
(pmatch.rm_eo - pmatch.rm_so) >
(chkmatch.rm_eo - chkmatch.rm_so))) {
pc->matches[matchidx - 1] = pmatch;
nst = pmatch.rm_eo;
}
} else {
/* Advance as normal if not */
pc->matches[matchidx++] = pmatch;
nst = pmatch.rm_eo;
}
/* avoid excessive matching - skip further patterns */
if ((color == NULL && !oflag) || qflag || lflag ||
matchidx >= MAX_MATCHES) {
pc->lnstart = nst;
lastmatched = false;
break;
}
}
/*
* Advance to just past the start of the earliest match, try
* again just in case we still have a chance to match later in
* the string.
*/
if (!lastmatched && retry > pc->lnstart) {
st = retry;
continue;
}
/* XXX TODO: We will need to keep going, since we're chunky */
/* One pass if we are not recording matches */
if (!wflag && ((color == NULL && !oflag) || qflag || lflag || Lflag))
break;
/* If we didn't have any matches or REG_NOSUB set */
if (!lastmatched || (cflags & REG_NOSUB))
nst = pc->ln.len;
if (!lastmatched)
/* No matches */
break;
else if (st == nst && lastmatch.rm_so == lastmatch.rm_eo)
/* Zero-length match -- advance one more so we don't get stuck */
nst++;
/* Advance st based on previous matches */
st = nst;
pc->lnstart = st;
}
/* Reflect the new matchidx in the context */
pc->matchidx = matchidx;
return matched;
}
/*
* Safe malloc() for internal use.
*/
void *
grep_malloc(size_t size)
{
void *ptr;
if ((ptr = malloc(size)) == NULL)
err(2, "malloc");
return (ptr);
}
/*
* Safe calloc() for internal use.
*/
void *
grep_calloc(size_t nmemb, size_t size)
{
void *ptr;
if ((ptr = calloc(nmemb, size)) == NULL)
err(2, "calloc");
return (ptr);
}
/*
* Safe realloc() for internal use.
*/
void *
grep_realloc(void *ptr, size_t size)
{
if ((ptr = realloc(ptr, size)) == NULL)
err(2, "realloc");
return (ptr);
}
/*
* Safe strdup() for internal use.
*/
char *
grep_strdup(const char *str)
{
char *ret;
if ((ret = strdup(str)) == NULL)
err(2, "strdup");
return (ret);
}
/*
* Print an entire line as-is, there are no inline matches to consider. This is
* used for printing context.
*/
void grep_printline(struct str *line, int sep) {
printline_metadata(line, sep);
fwrite(line->dat, line->len, 1, stdout);
putchar(fileeol);
}
static void
printline_metadata(struct str *line, int sep)
{
bool printsep;
printsep = false;
if (!hflag) {
if (!nullflag) {
fputs(line->file, stdout);
printsep = true;
} else {
printf("%s", line->file);
putchar(0);
}
}
if (nflag) {
if (printsep)
putchar(sep);
printf("%d", line->line_no);
printsep = true;
}
if (bflag) {
if (printsep)
putchar(sep);
printf("%lld", (long long)(line->off + line->boff));
printsep = true;
}
if (printsep)
putchar(sep);
}
/*
* Prints a matching line according to the command line options.
*/
static void
printline(struct parsec *pc, int sep)
{
size_t a = 0;
size_t i, matchidx;
regmatch_t match;
/* If matchall, everything matches but don't actually print for -o */
if (oflag && matchall)
return;
matchidx = pc->matchidx;
/* --color and -o */
if ((oflag || color) && matchidx > 0) {
/* Only print metadata once per line if --color */
if (!oflag && pc->printed == 0)
printline_metadata(&pc->ln, sep);
for (i = 0; i < matchidx; i++) {
match = pc->matches[i];
/* Don't output zero length matches */
if (match.rm_so == match.rm_eo)
continue;
/*
* Metadata is printed on a per-line basis, so every
* match gets file metadata with the -o flag.
*/
if (oflag) {
pc->ln.boff = match.rm_so;
printline_metadata(&pc->ln, sep);
} else
fwrite(pc->ln.dat + a, match.rm_so - a, 1,
stdout);
if (color)
fprintf(stdout, "\33[%sm\33[K", color);
fwrite(pc->ln.dat + match.rm_so,
match.rm_eo - match.rm_so, 1, stdout);
if (color)
fprintf(stdout, "\33[m\33[K");
a = match.rm_eo;
if (oflag)
putchar('\n');
}
if (!oflag) {
if (pc->ln.len - a > 0)
fwrite(pc->ln.dat + a, pc->ln.len - a, 1,
stdout);
putchar('\n');
}
} else
grep_printline(&pc->ln, sep);
pc->printed++;
}
diff --git a/usr.bin/gzip/unpack.c b/usr.bin/gzip/unpack.c
index 408ba4dfd259..110500ac21d6 100644
--- a/usr.bin/gzip/unpack.c
+++ b/usr.bin/gzip/unpack.c
@@ -1,335 +1,334 @@
-/* $FreeBSD$ */
/* $NetBSD: unpack.c,v 1.3 2017/08/04 07:27:08 mrg Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Xin LI <delphij@FreeBSD.org>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/* This file is #included by gzip.c */
/*
* pack(1) file format:
*
* The first 7 bytes is the header:
* 00, 01 - Signature (US, RS), we already validated it earlier.
* 02..05 - Uncompressed size
* 06 - Level for the huffman tree (<=24)
*
* pack(1) will then store symbols (leaf) nodes count in each huffman
* tree levels, each level would consume 1 byte (See [1]).
*
* After the symbol count table, there is the symbol table, storing
* symbols represented by corresponding leaf node. EOB is not being
* explicitly transmitted (not necessary anyway) in the symbol table.
*
* Compressed data goes after the symbol table.
*
* NOTES
*
* [1] If we count EOB into the symbols, that would mean that we will
* have at most 256 symbols in the huffman tree. pack(1) rejects empty
* file and files that just repeats one character, which means that we
* will have at least 2 symbols. Therefore, pack(1) would reduce the
* last level symbol count by 2 which makes it a number in
* range [0..254], so all levels' symbol count would fit into 1 byte.
*/
#define PACK_HEADER_LENGTH 7
#define HTREE_MAXLEVEL 24
/*
* unpack descriptor
*
* Represent the huffman tree in a similar way that pack(1) would
* store in a packed file. We store all symbols in a linear table,
* and store pointers to each level's first symbol. In addition to
* that, maintain two counts for each level: inner nodes count and
* leaf nodes count.
*/
typedef struct {
int symbol_size; /* Size of the symbol table */
int treelevels; /* Levels for the huffman tree */
int *symbolsin; /* Table of leaf symbols count in each
* level */
int *inodesin; /* Table of internal nodes count in
* each level */
char *symbol; /* The symbol table */
char *symbol_eob; /* Pointer to the EOB symbol */
char **tree; /* Decoding huffman tree (pointers to
* first symbol of each tree level */
off_t uncompressed_size; /* Uncompressed size */
FILE *fpIn; /* Input stream */
FILE *fpOut; /* Output stream */
} unpack_descriptor_t;
/*
* Release resource allocated to an unpack descriptor.
*
* Caller is responsible to make sure that all of these pointers are
* initialized (in our case, they all point to valid memory block).
* We don't zero out pointers here because nobody else would ever
* reference the memory block without scrubbing them.
*/
static void
unpack_descriptor_fini(unpack_descriptor_t *unpackd)
{
free(unpackd->symbolsin);
free(unpackd->inodesin);
free(unpackd->symbol);
free(unpackd->tree);
fclose(unpackd->fpIn);
fclose(unpackd->fpOut);
}
/*
* Recursively fill the internal node count table
*/
static void
unpackd_fill_inodesin(const unpack_descriptor_t *unpackd, int level)
{
/*
* The internal nodes would be 1/2 of total internal nodes and
* leaf nodes in the next level. For the last level there
* would be no internal node by definition.
*/
if (level < unpackd->treelevels) {
unpackd_fill_inodesin(unpackd, level + 1);
unpackd->inodesin[level] = (unpackd->inodesin[level + 1] +
unpackd->symbolsin[level + 1]) / 2;
} else
unpackd->inodesin[level] = 0;
}
/*
* Update counter for accepted bytes
*/
static void
accepted_bytes(off_t *bytes_in, off_t newbytes)
{
if (bytes_in != NULL)
(*bytes_in) += newbytes;
}
/*
* Read file header and construct the tree. Also, prepare the buffered I/O
* for decode routine.
*
* Return value is uncompressed size.
*/
static void
unpack_parse_header(int in, int out, char *pre, size_t prelen, off_t *bytes_in,
unpack_descriptor_t *unpackd)
{
unsigned char hdr[PACK_HEADER_LENGTH]; /* buffer for header */
ssize_t bytesread; /* Bytes read from the file */
int i, j, thisbyte;
/* Prepend the header buffer if we already read some data */
if (prelen != 0)
memcpy(hdr, pre, prelen);
/* Read in and fill the rest bytes of header */
bytesread = read(in, hdr + prelen, PACK_HEADER_LENGTH - prelen);
if (bytesread < 0)
maybe_err("Error reading pack header");
infile_newdata(bytesread);
accepted_bytes(bytes_in, PACK_HEADER_LENGTH);
/* Obtain uncompressed length (bytes 2,3,4,5) */
unpackd->uncompressed_size = 0;
for (i = 2; i <= 5; i++) {
unpackd->uncompressed_size <<= 8;
unpackd->uncompressed_size |= hdr[i];
}
/* Get the levels of the tree */
unpackd->treelevels = hdr[6];
if (unpackd->treelevels > HTREE_MAXLEVEL || unpackd->treelevels < 1)
maybe_errx("Huffman tree has insane levels");
/* Let libc take care for buffering from now on */
if ((unpackd->fpIn = fdopen(in, "r")) == NULL)
maybe_err("Can not fdopen() input stream");
if ((unpackd->fpOut = fdopen(out, "w")) == NULL)
maybe_err("Can not fdopen() output stream");
/* Allocate for the tables of bounds and the tree itself */
unpackd->inodesin =
calloc(unpackd->treelevels, sizeof(*(unpackd->inodesin)));
unpackd->symbolsin =
calloc(unpackd->treelevels, sizeof(*(unpackd->symbolsin)));
unpackd->tree =
calloc(unpackd->treelevels, (sizeof(*(unpackd->tree))));
if (unpackd->inodesin == NULL || unpackd->symbolsin == NULL ||
unpackd->tree == NULL)
maybe_err("calloc");
/* We count from 0 so adjust to match array upper bound */
unpackd->treelevels--;
/* Read the levels symbol count table and calculate total */
unpackd->symbol_size = 1; /* EOB */
for (i = 0; i <= unpackd->treelevels; i++) {
if ((thisbyte = fgetc(unpackd->fpIn)) == EOF)
maybe_err("File appears to be truncated");
unpackd->symbolsin[i] = (unsigned char)thisbyte;
unpackd->symbol_size += unpackd->symbolsin[i];
}
accepted_bytes(bytes_in, unpackd->treelevels);
if (unpackd->symbol_size > 256)
maybe_errx("Bad symbol table");
infile_newdata(unpackd->treelevels);
/* Allocate for the symbol table, point symbol_eob at the beginning */
unpackd->symbol_eob = unpackd->symbol = calloc(1, unpackd->symbol_size);
if (unpackd->symbol == NULL)
maybe_err("calloc");
/*
* Read in the symbol table, which contain [2, 256] symbols.
* In order to fit the count in one byte, pack(1) would offset
* it by reducing 2 from the actual number from the last level.
*
* We adjust the last level's symbol count by 1 here, because
* the EOB symbol is not being transmitted explicitly. Another
* adjustment would be done later afterward.
*/
unpackd->symbolsin[unpackd->treelevels]++;
for (i = 0; i <= unpackd->treelevels; i++) {
unpackd->tree[i] = unpackd->symbol_eob;
for (j = 0; j < unpackd->symbolsin[i]; j++) {
if ((thisbyte = fgetc(unpackd->fpIn)) == EOF)
maybe_errx("Symbol table truncated");
*unpackd->symbol_eob++ = (char)thisbyte;
}
infile_newdata(unpackd->symbolsin[i]);
accepted_bytes(bytes_in, unpackd->symbolsin[i]);
}
/* Now, take account for the EOB symbol as well */
unpackd->symbolsin[unpackd->treelevels]++;
/*
* The symbolsin table has been constructed now.
* Calculate the internal nodes count table based on it.
*/
unpackd_fill_inodesin(unpackd, 0);
}
/*
* Decode huffman stream, based on the huffman tree.
*/
static void
unpack_decode(const unpack_descriptor_t *unpackd, off_t *bytes_in)
{
int thislevel, thiscode, thisbyte, inlevelindex;
int i;
off_t bytes_out = 0;
const char *thissymbol; /* The symbol pointer decoded from stream */
/*
* Decode huffman. Fetch every bytes from the file, get it
* into 'thiscode' bit-by-bit, then output the symbol we got
* when one has been found.
*
* Assumption: sizeof(int) > ((max tree levels + 1) / 8).
* bad things could happen if not.
*/
thislevel = 0;
thiscode = thisbyte = 0;
while ((thisbyte = fgetc(unpackd->fpIn)) != EOF) {
accepted_bytes(bytes_in, 1);
infile_newdata(1);
check_siginfo();
/*
* Split one bit from thisbyte, from highest to lowest,
* feed the bit into thiscode, until we got a symbol from
* the tree.
*/
for (i = 7; i >= 0; i--) {
thiscode = (thiscode << 1) | ((thisbyte >> i) & 1);
/* Did we got a symbol? (referencing leaf node) */
if (thiscode >= unpackd->inodesin[thislevel]) {
inlevelindex =
thiscode - unpackd->inodesin[thislevel];
if (inlevelindex > unpackd->symbolsin[thislevel])
maybe_errx("File corrupt");
thissymbol =
&(unpackd->tree[thislevel][inlevelindex]);
if ((thissymbol == unpackd->symbol_eob) &&
(bytes_out == unpackd->uncompressed_size))
goto finished;
fputc((*thissymbol), unpackd->fpOut);
bytes_out++;
/* Prepare for next input */
thislevel = 0; thiscode = 0;
} else {
thislevel++;
if (thislevel > unpackd->treelevels)
maybe_errx("File corrupt");
}
}
}
finished:
if (bytes_out != unpackd->uncompressed_size)
maybe_errx("Premature EOF");
}
/* Handler for pack(1)'ed file */
static off_t
unpack(int in, int out, char *pre, size_t prelen, off_t *bytes_in)
{
unpack_descriptor_t unpackd;
in = dup(in);
if (in == -1)
maybe_err("dup");
out = dup(out);
if (out == -1)
maybe_err("dup");
unpack_parse_header(in, out, pre, prelen, bytes_in, &unpackd);
unpack_decode(&unpackd, bytes_in);
unpack_descriptor_fini(&unpackd);
/* If we reached here, the unpack was successful */
return (unpackd.uncompressed_size);
}
diff --git a/usr.bin/iconv/iconv.c b/usr.bin/iconv/iconv.c
index ba099f8af520..54a464de273a 100644
--- a/usr.bin/iconv/iconv.c
+++ b/usr.bin/iconv/iconv.c
@@ -1,250 +1,249 @@
-/* $FreeBSD$ */
/* $NetBSD: iconv.c,v 1.16 2009/02/20 15:28:21 yamt Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/capsicum.h>
#include <capsicum_helpers.h>
#include <err.h>
#include <errno.h>
#include <getopt.h>
#include <iconv.h>
#include <limits.h>
#include <locale.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
static int do_conv(FILE *, iconv_t, bool, bool);
static int do_list(unsigned int, const char * const *, void *);
static void usage(void) __dead2;
static const struct option long_options[] = {
{"from-code", required_argument, NULL, 'f'},
{"list", no_argument, NULL, 'l'},
{"silent", no_argument, NULL, 's'},
{"to-code", required_argument, NULL, 't'},
{NULL, no_argument, NULL, 0}
};
static void
usage(void)
{
(void)fprintf(stderr,
"Usage:\t%1$s [-cs] -f <from_code> -t <to_code> [file ...]\n"
"\t%1$s -f <from_code> [-cs] [-t <to_code>] [file ...]\n"
"\t%1$s -t <to_code> [-cs] [-f <from_code>] [file ...]\n"
"\t%1$s -l\n", getprogname());
exit(1);
}
#define INBUFSIZE 1024
#define OUTBUFSIZE (INBUFSIZE * 2)
static int
do_conv(FILE *fp, iconv_t cd, bool silent, bool hide_invalid)
{
char inbuf[INBUFSIZE], outbuf[OUTBUFSIZE], *in, *out;
unsigned long long invalids;
size_t inbytes, outbytes, ret;
/*
* Don't touch ICONV_SET_DISCARD_ILSEQ if -c wasn't specified. It may
* be that the user has specified //IGNORE in the -t specification, and
* we don't want to clobber that.
*/
if (hide_invalid) {
int arg = (int)hide_invalid;
if (iconvctl(cd, ICONV_SET_DISCARD_ILSEQ, (void *)&arg) == -1)
err(EXIT_FAILURE, "iconvctl(DISCARD_ILSEQ, %d)", arg);
}
invalids = 0;
while ((inbytes = fread(inbuf, 1, INBUFSIZE, fp)) > 0) {
in = inbuf;
while (inbytes > 0) {
size_t inval;
out = outbuf;
outbytes = OUTBUFSIZE;
ret = __iconv(cd, &in, &inbytes, &out, &outbytes,
0, &inval);
invalids += inval;
if (outbytes < OUTBUFSIZE)
(void)fwrite(outbuf, 1, OUTBUFSIZE - outbytes,
stdout);
if (ret == (size_t)-1 && errno != E2BIG) {
if (errno != EINVAL || in == inbuf)
err(EXIT_FAILURE, "iconv()");
/* incomplete input character */
(void)memmove(inbuf, in, inbytes);
ret = fread(inbuf + inbytes, 1,
INBUFSIZE - inbytes, fp);
if (ret == 0) {
fflush(stdout);
if (feof(fp))
errx(EXIT_FAILURE,
"unexpected end of file; "
"the last character is "
"incomplete.");
else
err(EXIT_FAILURE, "fread()");
}
in = inbuf;
inbytes += ret;
}
}
}
/* reset the shift state of the output buffer */
outbytes = OUTBUFSIZE;
out = outbuf;
ret = iconv(cd, NULL, NULL, &out, &outbytes);
if (ret == (size_t)-1)
err(EXIT_FAILURE, "iconv()");
if (outbytes < OUTBUFSIZE)
(void)fwrite(outbuf, 1, OUTBUFSIZE - outbytes, stdout);
if (invalids > 0 && !silent)
warnx("warning: invalid characters: %llu", invalids);
return (invalids > 0);
}
static int
do_list(unsigned int n, const char * const *list, void *data __unused)
{
unsigned int i;
for(i = 0; i < n; i++) {
printf("%s", list[i]);
if (i < n - 1)
printf(" ");
}
printf("\n");
return (1);
}
int
main(int argc, char **argv)
{
iconv_t cd;
FILE *fp;
const char *opt_f, *opt_t;
int ch, i, res;
bool opt_c = false, opt_s = false;
opt_f = opt_t = "";
setlocale(LC_ALL, "");
setprogname(argv[0]);
while ((ch = getopt_long(argc, argv, "csLlf:t:",
long_options, NULL)) != -1) {
switch (ch) {
case 'c':
opt_c = true;
break;
case 's':
opt_s = true;
break;
case 'l':
/* list */
if (opt_s || opt_c || strcmp(opt_f, "") != 0 ||
strcmp(opt_t, "") != 0) {
warnx("-l is not allowed with other flags.");
usage();
}
iconvlist(do_list, NULL);
return (EXIT_SUCCESS);
case 'f':
/* from */
if (optarg != NULL)
opt_f = optarg;
break;
case 't':
/* to */
if (optarg != NULL)
opt_t = optarg;
break;
default:
usage();
}
}
argc -= optind;
argv += optind;
if ((strcmp(opt_f, "") == 0) && (strcmp(opt_t, "") == 0))
usage();
if (caph_limit_stdio() < 0)
err(EXIT_FAILURE, "capsicum");
/*
* Cache NLS data, for strerror, for err(3), before entering capability
* mode.
*/
caph_cache_catpages();
/*
* Cache iconv conversion handle before entering sandbox.
*/
cd = iconv_open(opt_t, opt_f);
if (cd == (iconv_t)-1)
err(EXIT_FAILURE, "iconv_open(%s, %s)", opt_t, opt_f);
if (argc == 0) {
if (caph_enter() < 0)
err(EXIT_FAILURE, "unable to enter capability mode");
res = do_conv(stdin, cd, opt_s, opt_c);
} else {
res = 0;
for (i = 0; i < argc; i++) {
fp = (strcmp(argv[i], "-") != 0) ?
fopen(argv[i], "r") : stdin;
if (fp == NULL)
err(EXIT_FAILURE, "Cannot open `%s'",
argv[i]);
/* Enter Capsicum sandbox for final input file. */
if (i + 1 == argc && caph_enter() < 0)
err(EXIT_FAILURE,
"unable to enter capability mode");
res |= do_conv(fp, cd, opt_s, opt_c);
(void)fclose(fp);
/* Reset iconv descriptor state. */
(void)iconv(cd, NULL, NULL, NULL, NULL);
}
}
iconv_close(cd);
return (res == 0 ? EXIT_SUCCESS : EXIT_FAILURE);
}
diff --git a/usr.bin/indent/tests/binary.0 b/usr.bin/indent/tests/binary.0
index b2adc1fe6428..0c5ebf7e8f89 100644
--- a/usr.bin/indent/tests/binary.0
+++ b/usr.bin/indent/tests/binary.0
@@ -1,10 +1,9 @@
-/* $FreeBSD$ */
#define b00101010 -1
void t(void) {
unsigned a[] = {0b00101010, 0x00005678, 02, 17U};
float x[] = {.7f, 0.7f};
unsigned long ul[] = {0b00001111UL, 0x01010101UL, 02UL, 17UL};
if (0 b00101010)
return;
}
diff --git a/usr.bin/indent/tests/binary.0.stdout b/usr.bin/indent/tests/binary.0.stdout
index 5bb9a31a3832..6118ac505550 100644
--- a/usr.bin/indent/tests/binary.0.stdout
+++ b/usr.bin/indent/tests/binary.0.stdout
@@ -1,12 +1,11 @@
-/* $FreeBSD$ */
#define b00101010 -1
void
t(void)
{
unsigned a[] = {0b00101010, 0x00005678, 02, 17U};
float x[] = {.7f, 0.7f};
unsigned long ul[] = {0b00001111UL, 0x01010101UL, 02UL, 17UL};
if (0 b00101010)
return;
}
diff --git a/usr.bin/indent/tests/comments.0 b/usr.bin/indent/tests/comments.0
index 7b65c2eb552b..4a627b9f39ec 100644
--- a/usr.bin/indent/tests/comments.0
+++ b/usr.bin/indent/tests/comments.0
@@ -1,52 +1,51 @@
-/* $FreeBSD$ */
typedef enum x {
aaaaaaaaaaaaaaaaaaaaaa = 1 << 0, /* test a */
bbbbbbbbbbbbbbbbb = 1 << 1, /* test b */
cccccccccccccc = 1 << 1, /* test c */
dddddddddddddddddddddddddddddd = 1 << 2 /* test d */
} x;
/* See r303597, r303598, r309219, and r309343 */
void t(void) {
/*
* Old indent wrapped the URL near where this sentence ends.
*
* https://www.freebsd.org/cgi/man.cgi?query=indent&apropos=0&sektion=0&manpath=FreeBSD+12-current&arch=default&format=html
*/
/*
* Old indent did not wrap to column 78
*
* aaaaaa bbbbbb cccccc dddddd eeeeee ffffff ggggg hhhhh iiiii jjjj kk
*/
/*
* Old indent unnecessarily removed the star comment continuation on the next line.
*
* *test*
*/
/* r309219 Go through linked list, freeing from the malloced (t[-1]) address. */
/* r309343 */
}
int c(void)
{
if (1) { /*- a christmas tree *
***
***** */
/*- another one *
***
***** */
7;
}
if (1) /*- a christmas tree *
***
***** */
/*- another one *
***
***** */
1;
}
diff --git a/usr.bin/indent/tests/comments.0.pro b/usr.bin/indent/tests/comments.0.pro
index cac04fc8b8ea..ce818772931d 100644
--- a/usr.bin/indent/tests/comments.0.pro
+++ b/usr.bin/indent/tests/comments.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-bbb
diff --git a/usr.bin/indent/tests/comments.0.stdout b/usr.bin/indent/tests/comments.0.stdout
index 8ca5aa518c5e..5c4fc6824a0c 100644
--- a/usr.bin/indent/tests/comments.0.stdout
+++ b/usr.bin/indent/tests/comments.0.stdout
@@ -1,60 +1,59 @@
-/* $FreeBSD$ */
typedef enum x {
aaaaaaaaaaaaaaaaaaaaaa = 1 << 0, /* test a */
bbbbbbbbbbbbbbbbb = 1 << 1, /* test b */
cccccccccccccc = 1 << 1, /* test c */
dddddddddddddddddddddddddddddd = 1 << 2 /* test d */
} x;
/* See r303597, r303598, r309219, and r309343 */
void
t(void)
{
/*
* Old indent wrapped the URL near where this sentence ends.
*
* https://www.freebsd.org/cgi/man.cgi?query=indent&apropos=0&sektion=0&manpath=FreeBSD+12-current&arch=default&format=html
*/
/*
* Old indent did not wrap to column 78
*
* aaaaaa bbbbbb cccccc dddddd eeeeee ffffff ggggg hhhhh iiiii jjjj
* kk
*/
/*
* Old indent unnecessarily removed the star comment continuation on
* the next line.
*
* *test*
*/
/*
* r309219 Go through linked list, freeing from the malloced (t[-1])
* address.
*/
/* r309343 */
}
int
c(void)
{
if (1) { /*- a christmas tree *
***
***** */
/*- another one *
***
***** */
7;
}
if (1) /*- a christmas tree *
***
***** */
/*- another one *
***
***** */
1;
}
diff --git a/usr.bin/indent/tests/cs.0 b/usr.bin/indent/tests/cs.0
index 449eadf3ae0e..129feeeeae4b 100644
--- a/usr.bin/indent/tests/cs.0
+++ b/usr.bin/indent/tests/cs.0
@@ -1,4 +1,3 @@
-/* $FreeBSD$ */
void t(void) {
int a = (double) 8;
}
diff --git a/usr.bin/indent/tests/cs.0.pro b/usr.bin/indent/tests/cs.0.pro
index 01e5f8671c2d..b0d3b81a79c5 100644
--- a/usr.bin/indent/tests/cs.0.pro
+++ b/usr.bin/indent/tests/cs.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-cs
diff --git a/usr.bin/indent/tests/cs.0.stdout b/usr.bin/indent/tests/cs.0.stdout
index 1849b2833793..177882470c02 100644
--- a/usr.bin/indent/tests/cs.0.stdout
+++ b/usr.bin/indent/tests/cs.0.stdout
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
void
t(void)
{
int a = (double) 8;
}
diff --git a/usr.bin/indent/tests/declarations.0 b/usr.bin/indent/tests/declarations.0
index 6d668b13c57f..706352ee2e37 100644
--- a/usr.bin/indent/tests/declarations.0
+++ b/usr.bin/indent/tests/declarations.0
@@ -1,79 +1,78 @@
-/* $FreeBSD$ */
/* See r303570 */
typedef void (*voidptr) (int *);
static const struct
{
double x;
double y, z;
} n[m + 1] =
{
{
.0,
.9,
5
}
};
typedef struct Complex
{
double x;
double y;
} Complex;
void
t1 (char *a, int b,
void (*fn)(void))
{}
void t2 (char *x, int y)
{
int a,
b,
c;
int
*d,
*e,
*f;
int (*g)(),
(*h)(),
(*i)();
int j,
k,
l;
int m
,n
,o
;
int chars[ /* push the comma beyond column 74 .... */ ], x;
}
const int int_minimum_size =
MAXALIGN(offsetof(int, test)) + MAXIMUM_ALIGNOF;
int *int_create(void)
{
}
static
_attribute_printf(1, 2)
void
print_error(const char *fmt,...)
{
}
static LIST_HEAD(, alq) ald_active;
static int ald_shutingdown = 0;
struct thread *ald_thread;
static int
do_execve(td, args, mac_p)
struct thread *td;
struct image_args *args;
struct mac *mac_p;
{
}
diff --git a/usr.bin/indent/tests/declarations.0.stdout b/usr.bin/indent/tests/declarations.0.stdout
index a164ec2753c8..f807c559c6ea 100644
--- a/usr.bin/indent/tests/declarations.0.stdout
+++ b/usr.bin/indent/tests/declarations.0.stdout
@@ -1,73 +1,72 @@
-/* $FreeBSD$ */
/* See r303570 */
typedef void (*voidptr) (int *);
static const struct {
double x;
double y, z;
} n[m + 1] =
{
{
.0,
.9,
5
}
};
typedef struct Complex {
double x;
double y;
} Complex;
void
t1(char *a, int b,
void (*fn) (void))
{
}
void
t2(char *x, int y)
{
int a, b, c;
int
*d, *e, *f;
int (*g) (), (*h) (), (*i) ();
int j, k, l;
int m
,n
,o
;
int chars[ /* push the comma beyond column 74 .... */ ],
x;
}
const int int_minimum_size =
MAXALIGN(offsetof(int, test)) + MAXIMUM_ALIGNOF;
int *
int_create(void)
{
}
static
_attribute_printf(1, 2)
void
print_error(const char *fmt,...)
{
}
static LIST_HEAD(, alq) ald_active;
static int ald_shutingdown = 0;
struct thread *ald_thread;
static int
do_execve(td, args, mac_p)
struct thread *td;
struct image_args *args;
struct mac *mac_p;
{
}
diff --git a/usr.bin/indent/tests/elsecomment.0 b/usr.bin/indent/tests/elsecomment.0
index 61066c22b586..f8aa05c77d82 100644
--- a/usr.bin/indent/tests/elsecomment.0
+++ b/usr.bin/indent/tests/elsecomment.0
@@ -1,42 +1,41 @@
-/* $FreeBSD$ */
/* See r303484 and r309342 */
void t(void) {
/* The two if statements below excercise two different code paths. */
if (1) /* a */ int a; else /* b */ int b;
if (1) /* a */
int a;
else /* b */
int b;
if (1) {
}
/* Old indent would remove the 3 blank lines above, awaiting "else". */
if (1) {
int a;
}
else if (0) {
int b;
}
/* test */
else
;
if (1)
;
else /* Old indent would get very confused here */
/* We also mustn't assume that there's only one comment */
/* before the left brace. */
{
}
}
diff --git a/usr.bin/indent/tests/elsecomment.0.pro b/usr.bin/indent/tests/elsecomment.0.pro
index 892386ffbf45..84cf83a1ea27 100644
--- a/usr.bin/indent/tests/elsecomment.0.pro
+++ b/usr.bin/indent/tests/elsecomment.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-bl
diff --git a/usr.bin/indent/tests/elsecomment.0.stdout b/usr.bin/indent/tests/elsecomment.0.stdout
index 7de23be0894d..349f168d7e0a 100644
--- a/usr.bin/indent/tests/elsecomment.0.stdout
+++ b/usr.bin/indent/tests/elsecomment.0.stdout
@@ -1,47 +1,46 @@
-/* $FreeBSD$ */
/* See r303484 and r309342 */
void
t(void)
{
/* The two if statements below excercise two different code paths. */
if (1) /* a */
int a;
else /* b */
int b;
if (1) /* a */
int a;
else /* b */
int b;
if (1)
{
}
/* Old indent would remove the 3 blank lines above, awaiting "else". */
if (1)
{
int a;
} else if (0)
{
int b;
}
/* test */
else
;
if (1)
;
else /* Old indent would get very confused here */
/* We also mustn't assume that there's only one comment */
/* before the left brace. */
{
}
}
diff --git a/usr.bin/indent/tests/f_decls.0 b/usr.bin/indent/tests/f_decls.0
index a463d3c46a5d..dc175af40904 100644
--- a/usr.bin/indent/tests/f_decls.0
+++ b/usr.bin/indent/tests/f_decls.0
@@ -1,29 +1,28 @@
-/* $FreeBSD$ */
char * x(void)
{
type identifier;
type *pointer;
unused * value;
(void)unused * value;
dmax = (double)3 * 10.0;
dmin = (double)dmax * 10.0;
davg = (double)dmax * dmin;
return NULL;
}
int *
y(void) {
}
int
z(void) {
}
int x;
int *y;
int * * * * z;
diff --git a/usr.bin/indent/tests/f_decls.0.stdout b/usr.bin/indent/tests/f_decls.0.stdout
index 534d4ac8160a..1e95f9ae7e03 100644
--- a/usr.bin/indent/tests/f_decls.0.stdout
+++ b/usr.bin/indent/tests/f_decls.0.stdout
@@ -1,32 +1,31 @@
-/* $FreeBSD$ */
char *
x(void)
{
type identifier;
type *pointer;
unused *value;
(void)unused * value;
dmax = (double)3 * 10.0;
dmin = (double)dmax * 10.0;
davg = (double)dmax * dmin;
return NULL;
}
int *
y(void)
{
}
int
z(void)
{
}
int x;
int *y;
int ****z;
diff --git a/usr.bin/indent/tests/float.0 b/usr.bin/indent/tests/float.0
index ea146e23d8a7..8ea2b41b7cc2 100644
--- a/usr.bin/indent/tests/float.0
+++ b/usr.bin/indent/tests/float.0
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
void t(void) {
unsigned long x = 314UL;
double y[] = {0x1P+9F, 0.3, .1, 1.2f, 0xa.p01f, 3.14f, 2.L};
int z = 0b0101;
DO_NOTHING;
x._y = 5;
}
diff --git a/usr.bin/indent/tests/float.0.stdout b/usr.bin/indent/tests/float.0.stdout
index 891b03648655..52bba26c2a3f 100644
--- a/usr.bin/indent/tests/float.0.stdout
+++ b/usr.bin/indent/tests/float.0.stdout
@@ -1,10 +1,9 @@
-/* $FreeBSD$ */
void
t(void)
{
unsigned long x = 314UL;
double y[] = {0x1P+9F, 0.3, .1, 1.2f, 0xa.p01f, 3.14f, 2.L};
int z = 0b0101;
DO_NOTHING;
x._y = 5;
}
diff --git a/usr.bin/indent/tests/label.0 b/usr.bin/indent/tests/label.0
index 7798a4d5c24e..d4c54446e0bf 100644
--- a/usr.bin/indent/tests/label.0
+++ b/usr.bin/indent/tests/label.0
@@ -1,13 +1,12 @@
-/* $FreeBSD$ */
/* See r303489 */
void t(void) {
switch (1)
{
case 1: /* test */
case 2: /* test */
}
CLEANUP:
;
V: ;
U: ;
}
diff --git a/usr.bin/indent/tests/label.0.pro b/usr.bin/indent/tests/label.0.pro
index b5afc20b7c06..09d814950dfa 100644
--- a/usr.bin/indent/tests/label.0.pro
+++ b/usr.bin/indent/tests/label.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-nut
diff --git a/usr.bin/indent/tests/label.0.stdout b/usr.bin/indent/tests/label.0.stdout
index 22ec12272af3..ab1b985e9687 100644
--- a/usr.bin/indent/tests/label.0.stdout
+++ b/usr.bin/indent/tests/label.0.stdout
@@ -1,14 +1,13 @@
-/* $FreeBSD$ */
/* See r303489 */
void
t(void)
{
switch (1) {
case 1: /* test */
case 2: /* test */
}
CLEANUP:
;
V: ;
U: ;
}
diff --git a/usr.bin/indent/tests/list_head.0 b/usr.bin/indent/tests/list_head.0
index 3a186ca33e07..ec17a7bc1c9a 100644
--- a/usr.bin/indent/tests/list_head.0
+++ b/usr.bin/indent/tests/list_head.0
@@ -1,16 +1,15 @@
-/* $FreeBSD$ */
/* See r309380 */
static int
do_execve(td, args, mac_p)
struct thread *td;
struct image_args *args;
struct mac *mac_p;
{
}
static LIST_HEAD(, alq) ald_active;
static int ald_shuttingdown = 0;
struct thread *ald_thread;
diff --git a/usr.bin/indent/tests/list_head.0.stdout b/usr.bin/indent/tests/list_head.0.stdout
index b6f076241a0d..b74117a097e6 100644
--- a/usr.bin/indent/tests/list_head.0.stdout
+++ b/usr.bin/indent/tests/list_head.0.stdout
@@ -1,14 +1,13 @@
-/* $FreeBSD$ */
/* See r309380 */
static int
do_execve(td, args, mac_p)
struct thread *td;
struct image_args *args;
struct mac *mac_p;
{
}
static LIST_HEAD(, alq) ald_active;
static int ald_shuttingdown = 0;
struct thread *ald_thread;
diff --git a/usr.bin/indent/tests/ncs.0 b/usr.bin/indent/tests/ncs.0
index 449eadf3ae0e..129feeeeae4b 100644
--- a/usr.bin/indent/tests/ncs.0
+++ b/usr.bin/indent/tests/ncs.0
@@ -1,4 +1,3 @@
-/* $FreeBSD$ */
void t(void) {
int a = (double) 8;
}
diff --git a/usr.bin/indent/tests/ncs.0.pro b/usr.bin/indent/tests/ncs.0.pro
index dc0abae9150c..3f2185b2863a 100644
--- a/usr.bin/indent/tests/ncs.0.pro
+++ b/usr.bin/indent/tests/ncs.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-ncs
diff --git a/usr.bin/indent/tests/ncs.0.stdout b/usr.bin/indent/tests/ncs.0.stdout
index 78f3b287574c..e7ad0b5dbf12 100644
--- a/usr.bin/indent/tests/ncs.0.stdout
+++ b/usr.bin/indent/tests/ncs.0.stdout
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
void
t(void)
{
int a = (double)8;
}
diff --git a/usr.bin/indent/tests/offsetof.0 b/usr.bin/indent/tests/offsetof.0
index 078db19c2913..c1870fa0daa3 100644
--- a/usr.bin/indent/tests/offsetof.0
+++ b/usr.bin/indent/tests/offsetof.0
@@ -1,5 +1,4 @@
-/* $FreeBSD$ */
/* See r303718 */
void t(void) {
int n = malloc(offsetof(struct s, f) + 1);
}
diff --git a/usr.bin/indent/tests/offsetof.0.stdout b/usr.bin/indent/tests/offsetof.0.stdout
index 199bf0fa0755..dedf90e8ab3a 100644
--- a/usr.bin/indent/tests/offsetof.0.stdout
+++ b/usr.bin/indent/tests/offsetof.0.stdout
@@ -1,7 +1,6 @@
-/* $FreeBSD$ */
/* See r303718 */
void
t(void)
{
int n = malloc(offsetof(struct s, f) + 1);
}
diff --git a/usr.bin/indent/tests/parens.0 b/usr.bin/indent/tests/parens.0
index 40d8de39169c..5293ad7666a9 100644
--- a/usr.bin/indent/tests/parens.0
+++ b/usr.bin/indent/tests/parens.0
@@ -1,27 +1,26 @@
-/* $FreeBSD$ */
typedef void (*xxxxxxxxxxx) (int,
char);
typedef char (*xxxxxxxxxxxxxxxxxxxxxxxxxxxx) (int *,
unsigned *,
char,
float *);
void
test(void)
{
char chars[secondf(firstf(B),
*here)];
float xxx = yyyyyyyyyyyyyy(zzzzzzzzzzzzz(p1,
(p2),
p3));
if (1) {
char *xxx = firstf(secondf2(p1,
p2));
}
rb->allocfunc(1);
rb2.allocfunc(7);
}
diff --git a/usr.bin/indent/tests/parens.0.pro b/usr.bin/indent/tests/parens.0.pro
index 95ac30fab36d..e860911a1173 100644
--- a/usr.bin/indent/tests/parens.0.pro
+++ b/usr.bin/indent/tests/parens.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-ts4 -i4 -di12 -Tallocfunc
diff --git a/usr.bin/indent/tests/parens.0.stdout b/usr.bin/indent/tests/parens.0.stdout
index 7041bf1f05c2..99433239bc30 100644
--- a/usr.bin/indent/tests/parens.0.stdout
+++ b/usr.bin/indent/tests/parens.0.stdout
@@ -1,27 +1,26 @@
-/* $FreeBSD$ */
typedef void (*xxxxxxxxxxx) (int,
char);
typedef char (*xxxxxxxxxxxxxxxxxxxxxxxxxxxx) (int *,
unsigned *,
char,
float *);
void
test(void)
{
char chars[secondf(firstf(B),
*here)];
float xxx = yyyyyyyyyyyyyy(zzzzzzzzzzzzz(p1,
(p2),
p3));
if (1) {
char *xxx = firstf(secondf2(p1,
p2));
}
rb->allocfunc(1);
rb2.allocfunc(7);
}
diff --git a/usr.bin/indent/tests/pcs.0 b/usr.bin/indent/tests/pcs.0
index aed296b1ca16..9fd8aad863a1 100644
--- a/usr.bin/indent/tests/pcs.0
+++ b/usr.bin/indent/tests/pcs.0
@@ -1,7 +1,6 @@
-/* $FreeBSD$ */
#include <stdio.h>
int main(void) {
puts("Hello");
return 0;
}
diff --git a/usr.bin/indent/tests/pcs.0.pro b/usr.bin/indent/tests/pcs.0.pro
index 41027f063dfa..60d7c2ccd850 100644
--- a/usr.bin/indent/tests/pcs.0.pro
+++ b/usr.bin/indent/tests/pcs.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-pcs
diff --git a/usr.bin/indent/tests/pcs.0.stdout b/usr.bin/indent/tests/pcs.0.stdout
index c96fb5442ae6..013082de8b38 100644
--- a/usr.bin/indent/tests/pcs.0.stdout
+++ b/usr.bin/indent/tests/pcs.0.stdout
@@ -1,9 +1,8 @@
-/* $FreeBSD$ */
#include <stdio.h>
int
main(void)
{
puts ("Hello");
return 0;
}
diff --git a/usr.bin/indent/tests/struct.0 b/usr.bin/indent/tests/struct.0
index 83142bfb1972..784d387cc717 100644
--- a/usr.bin/indent/tests/struct.0
+++ b/usr.bin/indent/tests/struct.0
@@ -1,21 +1,20 @@
-/* $FreeBSD$ */
int f(struct x *a);
/* See r303485 */
void
t(void)
{
static const struct {
int a;
int b;
} c[] = {
{ D, E },
{ F, G }
};
}
void u(struct x a) {
int b;
struct y c = (struct y *)&a;
}
diff --git a/usr.bin/indent/tests/struct.0.stdout b/usr.bin/indent/tests/struct.0.stdout
index 38613128654f..55b559ab9d6b 100644
--- a/usr.bin/indent/tests/struct.0.stdout
+++ b/usr.bin/indent/tests/struct.0.stdout
@@ -1,23 +1,22 @@
-/* $FreeBSD$ */
int f(struct x *a);
/* See r303485 */
void
t(void)
{
static const struct {
int a;
int b;
} c[] = {
{D, E},
{F, G}
};
}
void
u(struct x a)
{
int b;
struct y c = (struct y *)&a;
}
diff --git a/usr.bin/indent/tests/surplusbad.0 b/usr.bin/indent/tests/surplusbad.0
index 07d07026db0e..f9f2bf80c24a 100644
--- a/usr.bin/indent/tests/surplusbad.0
+++ b/usr.bin/indent/tests/surplusbad.0
@@ -1,9 +1,8 @@
-/* $FreeBSD$ */
/* See r303599 */
#if defined(__i386__)
int a;
#elif defined(__amd64__)
int b;
#else
#error "Port me"
#endif
diff --git a/usr.bin/indent/tests/surplusbad.0.pro b/usr.bin/indent/tests/surplusbad.0.pro
index 77c3a28ceb07..b3fe0943ec66 100644
--- a/usr.bin/indent/tests/surplusbad.0.pro
+++ b/usr.bin/indent/tests/surplusbad.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-bad
diff --git a/usr.bin/indent/tests/surplusbad.0.stdout b/usr.bin/indent/tests/surplusbad.0.stdout
index b288970fb93e..2f5856bc4092 100644
--- a/usr.bin/indent/tests/surplusbad.0.stdout
+++ b/usr.bin/indent/tests/surplusbad.0.stdout
@@ -1,9 +1,8 @@
-/* $FreeBSD$ */
/* See r303599 */
#if defined(__i386__)
int a;
#elif defined(__amd64__)
int b;
#else
#error "Port me"
#endif
diff --git a/usr.bin/indent/tests/types_from_file.0 b/usr.bin/indent/tests/types_from_file.0
index 6efca24fe1b4..c7673f55a0fc 100644
--- a/usr.bin/indent/tests/types_from_file.0
+++ b/usr.bin/indent/tests/types_from_file.0
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
/* See r303735 */
void t(a *x, b *y, c *z);
diff --git a/usr.bin/indent/tests/types_from_file.0.pro b/usr.bin/indent/tests/types_from_file.0.pro
index eeca804be089..255b8817589b 100644
--- a/usr.bin/indent/tests/types_from_file.0.pro
+++ b/usr.bin/indent/tests/types_from_file.0.pro
@@ -1,2 +1 @@
-/* $FreeBSD$ */
-Utypes_from_file.0.list
diff --git a/usr.bin/indent/tests/types_from_file.0.stdout b/usr.bin/indent/tests/types_from_file.0.stdout
index 8776ca6ba886..dca345ffafbf 100644
--- a/usr.bin/indent/tests/types_from_file.0.stdout
+++ b/usr.bin/indent/tests/types_from_file.0.stdout
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
/* See r303735 */
void t(a *x, b *y, c * z);
diff --git a/usr.bin/indent/tests/wchar.0 b/usr.bin/indent/tests/wchar.0
index 9910e77857f2..699703903373 100644
--- a/usr.bin/indent/tests/wchar.0
+++ b/usr.bin/indent/tests/wchar.0
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
/* See r309220 */
#include <wchar.h>
wchar_t *x = L"test";
wchar_t y = L't';
diff --git a/usr.bin/indent/tests/wchar.0.stdout b/usr.bin/indent/tests/wchar.0.stdout
index 92774abfdd31..a901b043328e 100644
--- a/usr.bin/indent/tests/wchar.0.stdout
+++ b/usr.bin/indent/tests/wchar.0.stdout
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
/* See r309220 */
#include <wchar.h>
wchar_t *x = L"test";
wchar_t y = L't';
diff --git a/usr.bin/lex/config.h b/usr.bin/lex/config.h
index 525a1cbf4eee..941a74d9d71c 100644
--- a/usr.bin/lex/config.h
+++ b/usr.bin/lex/config.h
@@ -1,267 +1,266 @@
/* src/config.h. Generated from config.h.in by configure. */
/* src/config.h.in. Generated from configure.ac by autoheader. */
-/* $FreeBSD$ */
/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP
systems. This function is required for `alloca.c' support on those systems.
*/
/* #undef CRAY_STACKSEG_END */
/* Define to 1 if using `alloca.c'. */
/* #undef C_ALLOCA */
/* Define to 1 if translation of program messages to the user's native
language is requested. */
/* #undef ENABLE_NLS */
/* Define to 1 if you have `alloca', as a function or macro. */
#define HAVE_ALLOCA 1
/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
*/
/* #undef HAVE_ALLOCA_H */
/* Define to 1 if you have the `available.' function. */
/* #undef HAVE_AVAILABLE_ */
/* Define to 1 if you have the `by' function. */
/* #undef HAVE_BY */
/* Define to 1 if you have the MacOS X function CFLocaleCopyCurrent in the
CoreFoundation framework. */
/* #undef HAVE_CFLOCALECOPYCURRENT */
/* Define to 1 if you have the MacOS X function CFPreferencesCopyAppValue in
the CoreFoundation framework. */
/* #undef HAVE_CFPREFERENCESCOPYAPPVALUE */
/* Define if the GNU dcgettext() function is already present or preinstalled.
*/
/* #undef HAVE_DCGETTEXT */
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the `dnl' function. */
/* #undef HAVE_DNL */
/* Define to 1 if you have the `dup2' function. */
#define HAVE_DUP2 1
/* Define to 1 if you have the `enabled' function. */
/* #undef HAVE_ENABLED */
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if you have the `function.' function. */
/* #undef HAVE_FUNCTION_ */
/* Define if the GNU gettext() function is already present or preinstalled. */
/* #undef HAVE_GETTEXT */
/* Define to 1 if you have the `have' function. */
/* #undef HAVE_HAVE */
/* Define if you have the iconv() function and it works. */
/* #undef HAVE_ICONV */
/* Define to 1 if you have the `if' function. */
/* #undef HAVE_IF */
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the `is' function. */
/* #undef HAVE_IS */
/* Define to 1 if you have the <libintl.h> header file. */
/* #undef HAVE_LIBINTL_H */
/* Define to 1 if you have the `m' library (-lm). */
#define HAVE_LIBM 1
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define to 1 if you have the <locale.h> header file. */
#define HAVE_LOCALE_H 1
/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
to 0 otherwise. */
#define HAVE_MALLOC 1
/* Define to 1 if you have the <malloc.h> header file. */
#define HAVE_MALLOC_H 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `memset' function. */
#define HAVE_MEMSET 1
/* Define to 1 if you have the `Needed' function. */
/* #undef HAVE_NEEDED */
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if you have the `NLS' function. */
/* #undef HAVE_NLS */
/* Define to 1 if you have the `not' function. */
/* #undef HAVE_NOT */
/* Define to 1 if you have the `only' function. */
/* #undef HAVE_ONLY */
/* Define to 1 if you have the `OpenBSD' function. */
/* #undef HAVE_OPENBSD */
/* Define to 1 if you have the `pow' function. */
#define HAVE_POW 1
/* Define to 1 if you have the <pthread.h> header file. */
#define HAVE_PTHREAD_H 1
/* Define to 1 if your system has a GNU libc compatible `realloc' function,
and to 0 otherwise. */
#define HAVE_REALLOC 1
/* Define to 1 if you have the `reallocarray' function. */
#define HAVE_REALLOCARRAY 1
/* Define to 1 if you have the `regcomp' function. */
#define HAVE_REGCOMP 1
/* Define to 1 if you have the <regex.h> header file. */
#define HAVE_REGEX_H 1
/* Define to 1 if you have the `replacement' function. */
/* #undef HAVE_REPLACEMENT */
/* Define to 1 if you have the `setlocale' function. */
#define HAVE_SETLOCALE 1
/* Define to 1 if stdbool.h conforms to C99. */
#define HAVE_STDBOOL_H 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strcasecmp' function. */
#define HAVE_STRCASECMP 1
/* Define to 1 if you have the `strchr' function. */
#define HAVE_STRCHR 1
/* Define to 1 if you have the `strdup' function. */
#define HAVE_STRDUP 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strtol' function. */
#define HAVE_STRTOL 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/wait.h> header file. */
#define HAVE_SYS_WAIT_H 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `Used' function. */
/* #undef HAVE_USED */
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the <vfork.h> header file. */
/* #undef HAVE_VFORK_H */
/* Define to 1 if you have the `We' function. */
/* #undef HAVE_WE */
/* Define to 1 if `fork' works. */
#define HAVE_WORKING_FORK 1
/* Define to 1 if `vfork' works. */
#define HAVE_WORKING_VFORK 1
/* Define to 1 if the system has the type `_Bool'. */
#define HAVE__BOOL 1
/* Define to the sub-directory where libtool stores uninstalled libraries. */
#define LT_OBJDIR ".libs/"
/* Define to the m4 executable name. */
#define M4 "m4"
/* Name of package */
#define PACKAGE "flex"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "flex-help@lists.sourceforge.net"
/* Define to the full name of this package. */
#define PACKAGE_NAME "the fast lexical analyser generator"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "the fast lexical analyser generator 2.6.4"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "flex"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "2.6.4"
/* If using the C implementation of alloca, define if you know the
direction of stack growth for your system; otherwise it will be
automatically deduced at runtime.
STACK_DIRECTION > 0 => grows toward higher addresses
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown */
/* #undef STACK_DIRECTION */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Version number of package */
#define VERSION "2.6.4"
/* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a
`char[]'. */
#define YYTEXT_POINTER 1
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to rpl_malloc if the replacement function should be used. */
/* #undef malloc */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* Define to rpl_realloc if the replacement function should be used. */
/* #undef realloc */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define as `fork' if `vfork' does not work. */
/* #undef vfork */
diff --git a/usr.bin/mkcsmapper/ldef.h b/usr.bin/mkcsmapper/ldef.h
index 0aedc564c036..c5b10a87cd26 100644
--- a/usr.bin/mkcsmapper/ldef.h
+++ b/usr.bin/mkcsmapper/ldef.h
@@ -1,43 +1,42 @@
-/* $FreeBSD$ */
/* $NetBSD: ldef.h,v 1.2 2006/09/09 14:35:17 tnozaki Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/types.h>
typedef struct {
u_int32_t begin;
u_int32_t end;
u_int32_t width;
} linear_zone_t;
extern int debug;
extern int linenumber;
extern int yyerror(const char *);
extern int yylex(void);
diff --git a/usr.bin/mkcsmapper/lex.l b/usr.bin/mkcsmapper/lex.l
index adbdf78ff7b1..74d86f90e25f 100644
--- a/usr.bin/mkcsmapper/lex.l
+++ b/usr.bin/mkcsmapper/lex.l
@@ -1,111 +1,110 @@
-/* $FreeBSD$ */
/* $NetBSD: lex.l,v 1.4 2006/02/09 22:03:15 dogcow Exp $ */
%{
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "ldef.h"
#include "yacc.h"
#define YY_DECL int yylex(void)
int linenumber = 1;
%}
%option noinput
%option nounput
%x COMMENT
%%
[ \t]+ { }
#.*[\n]|"//".*[\n]|[\n] { linenumber++; return (R_LN); }
"/*" { BEGIN COMMENT; }
<COMMENT>"*/" { BEGIN 0; }
<COMMENT>[\n] { linenumber++; }
<COMMENT>. { }
<COMMENT><<EOF>> {
yyerror("unexpected file end (unterminated comment)\n");
exit(1);
}
"="|"/"|"-" { return ((int)yytext[0]); }
([1-9][0-9]*)|(0[0-9]*)|(0[xX][0-9A-Fa-f]+) {
yylval.i_value = strtoul(yytext, NULL, 0);
return (L_IMM);
}
"TYPE" { return (R_TYPE); }
"NAME" { return (R_NAME); }
"SRC_ZONE" { return (R_SRC_ZONE); }
"DST_INVALID" { return (R_DST_INVALID); }
"DST_ILSEQ" { return (R_DST_ILSEQ); }
"DST_UNIT_BITS" { return (R_DST_UNIT_BITS); }
"BEGIN_MAP" { return (R_BEGIN_MAP); }
"END_MAP" { return (R_END_MAP); }
"INVALID" { return (R_INVALID); }
"ILSEQ" { return (R_ILSEQ); }
"OOB_MODE" { return (R_OOB_MODE); }
"ROWCOL" { return (R_ROWCOL); }
\"([^\"\n]*(\\\")?)*\"|\'([^\'\n]*(\\\')?)*\' {
size_t len;
len = strlen(yytext);
yylval.s_value = malloc(len - 1);
strlcpy(yylval.s_value, yytext + 1, len - 1);
return (L_STRING);
}
[^ =/\-0-9\t\n][^ \t\n]* {
yylval.s_value = strdup(yytext);
return (L_STRING);
}
%%
#ifndef yywrap
int
yywrap(void)
{
return (1);
}
#endif
diff --git a/usr.bin/mkcsmapper/yacc.y b/usr.bin/mkcsmapper/yacc.y
index 8d67be70beec..f048881b5b38 100644
--- a/usr.bin/mkcsmapper/yacc.y
+++ b/usr.bin/mkcsmapper/yacc.y
@@ -1,730 +1,729 @@
-/* $FreeBSD$ */
/* $NetBSD: yacc.y,v 1.11 2016/06/28 09:22:16 wiz Exp $ */
%{
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003, 2006 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <assert.h>
#include <err.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>
#include "ldef.h"
#ifndef __packed
#define __packed
#endif
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_mapper_std_file.h"
#include "citrus_region.h"
#include "citrus_db_factory.h"
#include "citrus_db_hash.h"
#include "citrus_lookup_factory.h"
#include "citrus_pivot_factory.h"
extern FILE *yyin;
int debug = 0;
static linear_zone_t rowcol[_CITRUS_MAPPER_STD_ROWCOL_MAX];
static char *map_name;
static char *output = NULL;
static void *table = NULL;
static size_t rowcol_len = 0;
static size_t table_size;
static u_int32_t done_flag = 0;
static u_int32_t dst_ilseq, dst_invalid, dst_unit_bits, oob_mode;
static u_int32_t rowcol_bits = 0, rowcol_mask = 0;
static u_int32_t src_next;
static int map_type;
static void (*putfunc)(void *, size_t, u_int32_t) = NULL;
#define DF_TYPE 0x00000001
#define DF_NAME 0x00000002
#define DF_SRC_ZONE 0x00000004
#define DF_DST_INVALID 0x00000008
#define DF_DST_ILSEQ 0x00000010
#define DF_DST_UNIT_BITS 0x00000020
#define DF_OOB_MODE 0x00000040
static void dump_file(void);
static void setup_map(void);
static void set_type(int);
static void set_name(char *);
static void set_src_zone(u_int32_t);
static void set_dst_invalid(u_int32_t);
static void set_dst_ilseq(u_int32_t);
static void set_dst_unit_bits(u_int32_t);
static void set_oob_mode(u_int32_t);
static int check_src(u_int32_t, u_int32_t);
static void store(const linear_zone_t *, u_int32_t, int);
static void put8(void *, size_t, u_int32_t);
static void put16(void *, size_t, u_int32_t);
static void put32(void *, size_t, u_int32_t);
static void set_range(u_int32_t, u_int32_t);
static void set_src(linear_zone_t *, u_int32_t, u_int32_t);
%}
%union {
u_int32_t i_value;
char *s_value;
linear_zone_t lz_value;
}
%token R_TYPE R_NAME R_SRC_ZONE R_DST_UNIT_BITS
%token R_DST_INVALID R_DST_ILSEQ
%token R_BEGIN_MAP R_END_MAP R_INVALID R_ROWCOL
%token R_ILSEQ R_OOB_MODE
%token R_LN
%token <i_value> L_IMM
%token <s_value> L_STRING
%type <lz_value> src
%type <i_value> dst types oob_mode_sel zone
%%
file : property mapping lns
{ dump_file(); }
property : /* empty */
| property R_LN
| property name
| property type
| property src_zone
| property dst_invalid
| property dst_ilseq
| property dst_unit_bits
| property oob_mode
name : R_NAME L_STRING { set_name($2); $2 = NULL; }
type : R_TYPE types { set_type($2); }
types : R_ROWCOL { $$ = R_ROWCOL; }
range : L_IMM '-' L_IMM { set_range($1, $3); }
ranges : /* empty */
| ranges range '/'
src_zone : R_SRC_ZONE zone { set_src_zone($2); }
zone : range {
$$ = 32;
}
| range '/' range '/' ranges L_IMM {
$$ = $6;
}
dst_invalid : R_DST_INVALID L_IMM { set_dst_invalid($2); }
dst_ilseq : R_DST_ILSEQ L_IMM { set_dst_ilseq($2); }
dst_unit_bits : R_DST_UNIT_BITS L_IMM { set_dst_unit_bits($2); }
oob_mode : R_OOB_MODE oob_mode_sel { set_oob_mode($2); }
oob_mode_sel : R_INVALID { $$ = _CITRUS_MAPPER_STD_OOB_NONIDENTICAL; }
| R_ILSEQ { $$ = _CITRUS_MAPPER_STD_OOB_ILSEQ; }
mapping : begin_map map_elems R_END_MAP
begin_map : R_BEGIN_MAP lns { setup_map(); }
map_elems : /* empty */
| map_elems map_elem lns
map_elem : src '=' dst
{ store(&$1, $3, 0); }
| src '=' L_IMM '-'
{ store(&$1, $3, 1); }
dst : L_IMM
{
$$ = $1;
}
| R_INVALID
{
$$ = dst_invalid;
}
| R_ILSEQ
{
$$ = dst_ilseq;
}
src : /* empty */
{
set_src(&$$, src_next, src_next);
}
| L_IMM
{
set_src(&$$, $1, $1);
}
| L_IMM '-' L_IMM
{
set_src(&$$, $1, $3);
}
| '-' L_IMM
{
set_src(&$$, src_next, $2);
}
lns : R_LN
| lns R_LN
%%
static void
warning(const char *s)
{
fprintf(stderr, "%s in %d\n", s, linenumber);
}
int
yyerror(const char *s)
{
warning(s);
exit(1);
}
void
put8(void *ptr, size_t ofs, u_int32_t val)
{
*((u_int8_t *)ptr + ofs) = val;
}
void
put16(void *ptr, size_t ofs, u_int32_t val)
{
u_int16_t oval = htons(val);
memcpy((u_int16_t *)ptr + ofs, &oval, 2);
}
void
put32(void *ptr, size_t ofs, u_int32_t val)
{
u_int32_t oval = htonl(val);
memcpy((u_int32_t *)ptr + ofs, &oval, 4);
}
static void
alloc_table(void)
{
linear_zone_t *p;
size_t i;
uint32_t val = 0;
i = rowcol_len;
p = &rowcol[--i];
table_size = p->width;
while (i > 0) {
p = &rowcol[--i];
table_size *= p->width;
}
table = (void *)malloc(table_size * dst_unit_bits / 8);
if (table == NULL) {
perror("malloc");
exit(1);
}
switch (oob_mode) {
case _CITRUS_MAPPER_STD_OOB_NONIDENTICAL:
val = dst_invalid;
break;
case _CITRUS_MAPPER_STD_OOB_ILSEQ:
val = dst_ilseq;
break;
default:
break;
}
for (i = 0; i < table_size; i++)
(*putfunc)(table, i, val);
}
static void
setup_map(void)
{
if ((done_flag & DF_SRC_ZONE)==0) {
fprintf(stderr, "SRC_ZONE is mandatory.\n");
exit(1);
}
if ((done_flag & DF_DST_UNIT_BITS)==0) {
fprintf(stderr, "DST_UNIT_BITS is mandatory.\n");
exit(1);
}
if ((done_flag & DF_DST_INVALID) == 0)
dst_invalid = 0xFFFFFFFF;
if ((done_flag & DF_DST_ILSEQ) == 0)
dst_ilseq = 0xFFFFFFFE;
if ((done_flag & DF_OOB_MODE) == 0)
oob_mode = _CITRUS_MAPPER_STD_OOB_NONIDENTICAL;
alloc_table();
}
static void
create_rowcol_info(struct _region *r)
{
void *ptr;
size_t i, len, ofs;
ofs = 0;
ptr = malloc(_CITRUS_MAPPER_STD_ROWCOL_INFO_SIZE);
if (ptr == NULL)
err(EXIT_FAILURE, "malloc");
put32(ptr, ofs, rowcol_bits); ofs++;
put32(ptr, ofs, dst_invalid); ofs++;
/* XXX: keep backward compatibility */
switch (rowcol_len) {
case 1:
put32(ptr, ofs, 0); ofs++;
put32(ptr, ofs, 0); ofs++;
/*FALLTHROUGH*/
case 2:
len = 0;
break;
default:
len = rowcol_len;
}
for (i = 0; i < rowcol_len; ++i) {
put32(ptr, ofs, rowcol[i].begin); ofs++;
put32(ptr, ofs, rowcol[i].end); ofs++;
}
put32(ptr, ofs, dst_unit_bits); ofs++;
put32(ptr, ofs, len); ofs++;
_region_init(r, ptr, ofs * 4);
}
static void
create_rowcol_ext_ilseq_info(struct _region *r)
{
void *ptr;
size_t ofs;
ofs = 0;
ptr = malloc(_CITRUS_MAPPER_STD_ROWCOL_EXT_ILSEQ_SIZE);
if (ptr == NULL)
err(EXIT_FAILURE, "malloc");
put32(ptr, ofs, oob_mode); ofs++;
put32(ptr, ofs, dst_ilseq); ofs++;
_region_init(r, ptr, _CITRUS_MAPPER_STD_ROWCOL_EXT_ILSEQ_SIZE);
}
#define CHKERR(ret, func, a) \
do { \
ret = func a; \
if (ret) \
errx(EXIT_FAILURE, "%s: %s", #func, strerror(ret)); \
} while (/*CONSTCOND*/0)
static void
dump_file(void)
{
struct _db_factory *df;
struct _region data;
void *serialized;
FILE *fp;
size_t size;
int ret;
/*
* build database
*/
CHKERR(ret, _db_factory_create, (&df, _db_hash_std, NULL));
/* store type */
CHKERR(ret, _db_factory_addstr_by_s,
(df, _CITRUS_MAPPER_STD_SYM_TYPE, _CITRUS_MAPPER_STD_TYPE_ROWCOL));
/* store info */
create_rowcol_info(&data);
CHKERR(ret, _db_factory_add_by_s,
(df, _CITRUS_MAPPER_STD_SYM_INFO, &data, 1));
/* ilseq extension */
create_rowcol_ext_ilseq_info(&data);
CHKERR(ret, _db_factory_add_by_s,
(df, _CITRUS_MAPPER_STD_SYM_ROWCOL_EXT_ILSEQ, &data, 1));
/* store table */
_region_init(&data, table, table_size*dst_unit_bits/8);
CHKERR(ret, _db_factory_add_by_s,
(df, _CITRUS_MAPPER_STD_SYM_TABLE, &data, 1));
/*
* dump database to file
*/
fp = output ? fopen(output, "wb") : stdout;
if (fp == NULL) {
perror("fopen");
exit(1);
}
/* dump database body */
size = _db_factory_calc_size(df);
serialized = malloc(size);
_region_init(&data, serialized, size);
CHKERR(ret, _db_factory_serialize,
(df, _CITRUS_MAPPER_STD_MAGIC, &data));
if (fwrite(serialized, size, 1, fp) != 1)
err(EXIT_FAILURE, "fwrite");
fclose(fp);
}
static void
/*ARGSUSED*/
set_type(int type)
{
if (done_flag & DF_TYPE) {
warning("TYPE is duplicated. ignored this one");
return;
}
map_type = type;
done_flag |= DF_TYPE;
}
static void
/*ARGSUSED*/
set_name(char *str)
{
if (done_flag & DF_NAME) {
warning("NAME is duplicated. ignored this one");
return;
}
map_name = str;
done_flag |= DF_NAME;
}
static void
set_src_zone(u_int32_t val)
{
linear_zone_t *p;
size_t i;
if (done_flag & DF_SRC_ZONE) {
warning("SRC_ZONE is duplicated. ignored this one");
return;
}
rowcol_bits = val;
/* sanity check */
switch (rowcol_bits) {
case 8: case 16: case 32:
if (rowcol_len <= 32 / rowcol_bits)
break;
/*FALLTHROUGH*/
default:
goto bad;
}
rowcol_mask = 1u << (rowcol_bits - 1);
rowcol_mask |= rowcol_mask - 1;
for (i = 0; i < rowcol_len; ++i) {
p = &rowcol[i];
if (p->end > rowcol_mask)
goto bad;
}
done_flag |= DF_SRC_ZONE;
return;
bad:
yyerror("Illegal argument for SRC_ZONE");
}
static void
set_dst_invalid(u_int32_t val)
{
if (done_flag & DF_DST_INVALID) {
warning("DST_INVALID is duplicated. ignored this one");
return;
}
dst_invalid = val;
done_flag |= DF_DST_INVALID;
}
static void
set_dst_ilseq(u_int32_t val)
{
if (done_flag & DF_DST_ILSEQ) {
warning("DST_ILSEQ is duplicated. ignored this one");
return;
}
dst_ilseq = val;
done_flag |= DF_DST_ILSEQ;
}
static void
set_oob_mode(u_int32_t val)
{
if (done_flag & DF_OOB_MODE) {
warning("OOB_MODE is duplicated. ignored this one");
return;
}
oob_mode = val;
done_flag |= DF_OOB_MODE;
}
static void
set_dst_unit_bits(u_int32_t val)
{
if (done_flag & DF_DST_UNIT_BITS) {
warning("DST_UNIT_BITS is duplicated. ignored this one");
return;
}
switch (val) {
case 8:
putfunc = &put8;
dst_unit_bits = val;
break;
case 16:
putfunc = &put16;
dst_unit_bits = val;
break;
case 32:
putfunc = &put32;
dst_unit_bits = val;
break;
default:
yyerror("Illegal argument for DST_UNIT_BITS");
}
done_flag |= DF_DST_UNIT_BITS;
}
static int
check_src(u_int32_t begin, u_int32_t end)
{
linear_zone_t *p;
size_t i;
u_int32_t m, n;
if (begin > end)
return (1);
if (begin < end) {
m = begin & ~rowcol_mask;
n = end & ~rowcol_mask;
if (m != n)
return (1);
}
for (i = rowcol_len * rowcol_bits, p = &rowcol[0]; i > 0; ++p) {
i -= rowcol_bits;
m = (begin >> i) & rowcol_mask;
if (m < p->begin || m > p->end)
return (1);
}
if (begin < end) {
n = end & rowcol_mask;
--p;
if (n < p->begin || n > p->end)
return (1);
}
return (0);
}
static void
store(const linear_zone_t *lz, u_int32_t dst, int inc)
{
linear_zone_t *p;
size_t i, ofs;
u_int32_t n;
ofs = 0;
for (i = rowcol_len * rowcol_bits, p = &rowcol[0]; i > 0; ++p) {
i -= rowcol_bits;
n = ((lz->begin >> i) & rowcol_mask) - p->begin;
ofs = (ofs * p->width) + n;
}
n = lz->width;
while (n-- > 0) {
(*putfunc)(table, ofs++, dst);
if (inc)
dst++;
}
}
static void
set_range(u_int32_t begin, u_int32_t end)
{
linear_zone_t *p;
if (rowcol_len >= _CITRUS_MAPPER_STD_ROWCOL_MAX)
goto bad;
p = &rowcol[rowcol_len++];
if (begin > end)
goto bad;
p->begin = begin, p->end = end;
p->width = end - begin + 1;
return;
bad:
yyerror("Illegal argument for SRC_ZONE");
}
static void
set_src(linear_zone_t *lz, u_int32_t begin, u_int32_t end)
{
if (check_src(begin, end) != 0)
yyerror("illegal zone");
lz->begin = begin, lz->end = end;
lz->width = end - begin + 1;
src_next = end + 1;
}
static void
do_mkdb(FILE *in)
{
FILE *out;
int ret;
/* dump DB to file */
out = output ? fopen(output, "wb") : stdout;
if (out == NULL)
err(EXIT_FAILURE, "fopen");
ret = _lookup_factory_convert(out, in);
fclose(out);
if (ret && output)
unlink(output); /* dump failure */
}
static void
do_mkpv(FILE *in)
{
FILE *out;
int ret;
/* dump pivot to file */
out = output ? fopen(output, "wb") : stdout;
if (out == NULL)
err(EXIT_FAILURE, "fopen");
ret = _pivot_factory_convert(out, in);
fclose(out);
if (ret && output)
unlink(output); /* dump failure */
if (ret)
errx(EXIT_FAILURE, "%s\n", strerror(ret));
}
static void
usage(void)
{
fprintf(stderr, "Usage: %s [-d] [-m|-p] [-o outfile] [infile]\n",
getprogname());
exit(EXIT_FAILURE);
}
int
main(int argc, char **argv)
{
FILE *in = NULL;
int ch, mkdb = 0, mkpv = 0;
while ((ch = getopt(argc, argv, "do:mp")) != EOF) {
switch (ch) {
case 'd':
debug = 1;
break;
case 'o':
output = strdup(optarg);
break;
case 'm':
mkdb = 1;
break;
case 'p':
mkpv = 1;
break;
default:
usage();
}
}
argc -= optind;
argv += optind;
switch (argc) {
case 0:
in = stdin;
break;
case 1:
in = fopen(argv[0], "r");
if (!in)
err(EXIT_FAILURE, "%s", argv[0]);
break;
default:
usage();
}
if (mkdb)
do_mkdb(in);
else if (mkpv)
do_mkpv(in);
else {
yyin = in;
yyparse();
}
return (0);
}
diff --git a/usr.bin/mkesdb/ldef.h b/usr.bin/mkesdb/ldef.h
index e543936683f9..27ef9663f06e 100644
--- a/usr.bin/mkesdb/ldef.h
+++ b/usr.bin/mkesdb/ldef.h
@@ -1,41 +1,40 @@
-/* $FreeBSD$ */
/* $NetBSD: ldef.h,v 1.2 2005/06/27 01:23:59 fvdl Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
extern int linenumber;
extern int yyerror(const char *);
extern int yylex(void);
struct named_csid {
STAILQ_ENTRY(named_csid) ci_entry;
char *ci_symbol;
u_int32_t ci_csid;
};
STAILQ_HEAD(named_csid_list, named_csid);
diff --git a/usr.bin/mkesdb/lex.l b/usr.bin/mkesdb/lex.l
index 3d6b8368b369..2b17a337d6e7 100644
--- a/usr.bin/mkesdb/lex.l
+++ b/usr.bin/mkesdb/lex.l
@@ -1,104 +1,103 @@
-/* $FreeBSD$ */
/* $NetBSD: lex.l,v 1.3 2006/02/09 22:03:15 dogcow Exp $ */
%{
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/endian.h>
#include <sys/queue.h>
#include <sys/types.h>
#include <assert.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "ldef.h"
#include "yacc.h"
#define YY_DECL int yylex(void)
int linenumber = 1;
%}
%option noinput
%option nounput
%x COMMENT
%%
[ \t]+ { }
#.*[\n]|"//".*[\n]|[\n] { linenumber++; return (R_LN); }
"/*" { BEGIN COMMENT; }
<COMMENT>"*/" { BEGIN 0; }
<COMMENT>[\n] { linenumber++; }
<COMMENT>. { }
<COMMENT><<EOF>> {
yyerror("unexpected file end (unterminated comment)\n");
exit(1);
}
([1-9][0-9]*)|(0[0-9]*)|(0[xX][0-9A-Fa-f]+) {
yylval.i_value = strtoul(yytext, NULL, 0);
return (L_IMM);
}
"NAME" { return (R_NAME); }
"ENCODING" { return (R_ENCODING); }
"VARIABLE" { return (R_VARIABLE); }
"DEFCSID" { return (R_DEFCSID); }
"INVALID" { return (R_INVALID); }
\"([^\"\n]*(\\\")?)*\"|\'([^\'\n]*(\\\')?)*\' {
size_t len;
len = strlen(yytext);
yylval.s_value = malloc(len - 1);
strlcpy(yylval.s_value, yytext + 1, len - 1);
return (L_STRING);
}
[^ =/\-0-9\t\n][^ \t\n]* {
yylval.s_value = strdup(yytext);
return (L_STRING);
}
%%
#ifndef yywrap
int
yywrap(void)
{
return (1);
}
#endif
diff --git a/usr.bin/mkesdb/yacc.y b/usr.bin/mkesdb/yacc.y
index 4b3f9c7d382f..9f1781f31b59 100644
--- a/usr.bin/mkesdb/yacc.y
+++ b/usr.bin/mkesdb/yacc.y
@@ -1,334 +1,333 @@
-/* $FreeBSD$ */
/* $NetBSD: yacc.y,v 1.4 2005/06/02 02:09:25 lukem Exp $ */
%{
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c)2003 Citrus Project,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#include <sys/types.h>
#include <sys/queue.h>
#include <assert.h>
#include <err.h>
#include <errno.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "citrus_namespace.h"
#include "citrus_types.h"
#include "citrus_region.h"
#include "citrus_esdb_file.h"
#include "citrus_db_hash.h"
#include "citrus_db_factory.h"
#include "citrus_lookup_factory.h"
#include "ldef.h"
extern FILE *yyin;
static struct named_csid_list named_csids;
static char *encoding, *name, *output = NULL, *variable;
static u_int32_t invalid;
static int debug = 0, num_csids = 0, use_invalid = 0;
static void dump_file(void);
static void register_named_csid(char *, u_int32_t);
static void set_invalid(u_int32_t);
static void set_prop_string(const char *, char **, char **);
%}
%union {
u_int32_t i_value;
char *s_value;
}
%token R_NAME R_ENCODING R_VARIABLE R_DEFCSID R_INVALID
%token R_LN
%token <i_value> L_IMM
%token <s_value> L_STRING
%%
file : property
{ dump_file(); }
property : /* empty */
| property R_LN
| property name R_LN
| property encoding R_LN
| property variable R_LN
| property defcsid R_LN
| property invalid R_LN
name : R_NAME L_STRING
{
set_prop_string("NAME", &name, &$2);
}
encoding : R_ENCODING L_STRING
{
set_prop_string("ENCODING", &encoding, &$2);
}
variable : R_VARIABLE L_STRING
{
set_prop_string("VARIABLE", &variable, &$2);
}
defcsid : R_DEFCSID L_STRING L_IMM
{
register_named_csid($2, $3);
$2 = NULL;
}
invalid : R_INVALID L_IMM
{
set_invalid($2);
}
%%
int
yyerror(const char *s)
{
fprintf(stderr, "%s in %d\n", s, linenumber);
return (0);
}
#define CHKERR(ret, func, a) \
do { \
ret = func a; \
if (ret) \
errx(EXIT_FAILURE, "%s: %s", #func, strerror(ret)); \
} while (/*CONSTCOND*/0)
static void
dump_file(void)
{
struct _db_factory *df;
struct _region data;
struct named_csid *csid;
FILE *fp;
char buf[100];
void *serialized;
size_t size;
int i, ret;
ret = 0;
if (!name) {
fprintf(stderr, "NAME is mandatory.\n");
ret = 1;
}
if (!encoding) {
fprintf(stderr, "ENCODING is mandatory.\n");
ret = 1;
}
if (ret)
exit(1);
/*
* build database
*/
CHKERR(ret, _db_factory_create, (&df, _db_hash_std, NULL));
/* store version */
CHKERR(ret, _db_factory_add32_by_s, (df, _CITRUS_ESDB_SYM_VERSION,
_CITRUS_ESDB_VERSION));
/* store encoding */
CHKERR(ret, _db_factory_addstr_by_s, (df, _CITRUS_ESDB_SYM_ENCODING,
encoding));
/* store variable */
if (variable)
CHKERR(ret, _db_factory_addstr_by_s,
(df, _CITRUS_ESDB_SYM_VARIABLE, variable));
/* store invalid */
if (use_invalid)
CHKERR(ret, _db_factory_add32_by_s, (df,
_CITRUS_ESDB_SYM_INVALID, invalid));
/* store num of charsets */
CHKERR(ret, _db_factory_add32_by_s, (df, _CITRUS_ESDB_SYM_NUM_CHARSETS,
num_csids));
i = 0;
STAILQ_FOREACH(csid, &named_csids, ci_entry) {
snprintf(buf, sizeof(buf), _CITRUS_ESDB_SYM_CSNAME_PREFIX "%d",
i);
CHKERR(ret, _db_factory_addstr_by_s,
(df, buf, csid->ci_symbol));
snprintf(buf, sizeof(buf), _CITRUS_ESDB_SYM_CSID_PREFIX "%d",
i);
CHKERR(ret, _db_factory_add32_by_s, (df, buf, csid->ci_csid));
i++;
}
/*
* dump database to file
*/
fp = output ? fopen(output, "wb") : stdout;
if (fp == NULL) {
perror("fopen");
exit(1);
}
/* dump database body */
size = _db_factory_calc_size(df);
serialized = malloc(size);
_region_init(&data, serialized, size);
CHKERR(ret, _db_factory_serialize, (df, _CITRUS_ESDB_MAGIC, &data));
if (fwrite(serialized, size, 1, fp) != 1)
err(EXIT_FAILURE, "fwrite");
fclose(fp);
}
static void
set_prop_string(const char *res, char **store, char **data)
{
char buf[256];
if (*store) {
snprintf(buf, sizeof(buf),
"%s is duplicated. ignored the one", res);
yyerror(buf);
return;
}
*store = *data;
*data = NULL;
}
static void
set_invalid(u_int32_t inv)
{
invalid = inv;
use_invalid = 1;
}
static void
register_named_csid(char *sym, u_int32_t val)
{
struct named_csid *csid;
STAILQ_FOREACH(csid, &named_csids, ci_entry) {
if (strcmp(csid->ci_symbol, sym) == 0) {
yyerror("multiply defined CSID");
exit(1);
}
}
csid = malloc(sizeof(*csid));
if (csid == NULL) {
perror("malloc");
exit(1);
}
csid->ci_symbol = sym;
csid->ci_csid = val;
STAILQ_INSERT_TAIL(&named_csids, csid, ci_entry);
num_csids++;
}
static void
do_mkdb(FILE *in)
{
FILE *out;
int ret;
/* dump DB to file */
out = output ? fopen(output, "wb") : stdout;
if (out == NULL)
err(EXIT_FAILURE, "fopen");
ret = _lookup_factory_convert(out, in);
fclose(out);
if (ret && output)
unlink(output); /* dump failure */
if (ret)
errx(EXIT_FAILURE, "%s\n", strerror(ret));
}
static void
usage(void)
{
errx(EXIT_FAILURE,
"usage:\n"
"\t%s [-d] [-o outfile] [infile]\n"
"\t%s -m [-d] [-o outfile] [infile]",
getprogname(), getprogname());
}
int
main(int argc, char **argv)
{
FILE *in = NULL;
int ch, mkdb = 0;
while ((ch = getopt(argc, argv, "do:m")) != EOF) {
switch (ch) {
case 'd':
debug = 1;
break;
case 'o':
output = strdup(optarg);
break;
case 'm':
mkdb = 1;
break;
default:
usage();
}
}
argc -= optind;
argv += optind;
switch (argc) {
case 0:
in = stdin;
break;
case 1:
in = fopen(argv[0], "r");
if (!in)
err(EXIT_FAILURE, "%s", argv[0]);
break;
default:
usage();
}
if (mkdb)
do_mkdb(in);
else {
STAILQ_INIT(&named_csids);
yyin = in;
yyparse();
}
return (0);
}
diff --git a/usr.bin/sdiff/extern.h b/usr.bin/sdiff/extern.h
index 2f240912ddc1..c9ebaef7d22c 100644
--- a/usr.bin/sdiff/extern.h
+++ b/usr.bin/sdiff/extern.h
@@ -1,12 +1,11 @@
/* $OpenBSD: extern.h,v 1.5 2009/06/07 13:29:50 ray Exp $ */
-/* $FreeBSD$ */
/*
* Written by Raymond Lai <ray@cyth.net>.
* Public domain.
*/
extern FILE *outfp; /* file to save changes to */
extern const char *tmpdir;
int eparse(const char *, const char *, const char *);
diff --git a/usr.bin/sort/bwstring.h b/usr.bin/sort/bwstring.h
index efc0c8b4fe28..c9a7d6778fd6 100644
--- a/usr.bin/sort/bwstring.h
+++ b/usr.bin/sort/bwstring.h
@@ -1,143 +1,142 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#if !defined(__BWSTRING_H__)
#define __BWSTRING_H__
#include <stdbool.h>
#include <stdio.h>
#include <errno.h>
#include <sysexits.h>
#include <wchar.h>
#include "sort.h"
#include "mem.h"
extern bool byte_sort;
/* wchar_t is of 4 bytes: */
#define SIZEOF_WCHAR_STRING(LEN) ((LEN)*sizeof(wchar_t))
struct wstr {
size_t len;
wchar_t str[];
};
struct cstr {
size_t len;
char str[];
};
/*
* Binary "wide" string
*/
struct bwstring
{
union {
struct wstr wdata;
struct cstr cdata;
};
};
typedef void *bwstring_iterator;
#define BWSLEN(s) ((mb_cur_max == 1) ? (s)->cdata.len : (s)->wdata.len)
struct bwstring *bwsalloc(size_t sz);
size_t bwsrawlen(const struct bwstring *bws);
const void* bwsrawdata(const struct bwstring *bws);
void bws_setlen(struct bwstring *bws, size_t newlen);
size_t bws_memsize(const struct bwstring *bws);
double bwstod(struct bwstring *s0, bool *empty);
int bws_month_score(const struct bwstring *s0);
struct bwstring *ignore_leading_blanks(struct bwstring *str);
struct bwstring *ignore_nonprinting(struct bwstring *str);
struct bwstring *dictionary_order(struct bwstring *str);
struct bwstring *ignore_case(struct bwstring *str);
void bwsprintf(FILE*, struct bwstring*, const char *prefix, const char *suffix);
void bws_disorder_warnx(struct bwstring *s, const char *fn, size_t pos);
struct bwstring *bwsdup(const struct bwstring *s);
struct bwstring *bwssbdup(const wchar_t *str, size_t size);
struct bwstring *bwscsbdup(const unsigned char *str, size_t size);
void bwsfree(const struct bwstring *s);
struct bwstring *bwsnocpy(struct bwstring *dst, const struct bwstring *src, size_t offset, size_t size);
int bwscmp(const struct bwstring *bws1, const struct bwstring *bws2, size_t offset);
int bwsncmp(const struct bwstring *bws1, const struct bwstring *bws2, size_t offset, size_t len);
int bwscoll(const struct bwstring *bws1, const struct bwstring *bws2, size_t offset);
size_t bwsfwrite(struct bwstring *bws, FILE *f, bool zero_ended);
static inline bwstring_iterator
bws_begin(struct bwstring *bws)
{
return ((bwstring_iterator)bws->wdata.str);
}
static inline bwstring_iterator
bws_end(struct bwstring *bws)
{
return ((mb_cur_max == 1) ?
(bwstring_iterator) (bws->cdata.str + bws->cdata.len) :
(bwstring_iterator) (bws->wdata.str + bws->wdata.len));
}
static inline bwstring_iterator
bws_iterator_inc(bwstring_iterator iter, size_t pos)
{
if (mb_cur_max == 1)
return ((unsigned char *) iter) + pos;
else
return ((wchar_t*) iter) + pos;
}
static inline wchar_t
bws_get_iter_value(bwstring_iterator iter)
{
if (mb_cur_max == 1)
return *((unsigned char *) iter);
else
return *((wchar_t*) iter);
}
int
bws_iterator_cmp(bwstring_iterator iter1, bwstring_iterator iter2, size_t len);
#define BWS_GET(bws, pos) ((mb_cur_max == 1) ? (bws->cdata.str[(pos)]) : bws->wdata.str[(pos)])
void initialise_months(void);
#endif /* __BWSTRING_H__ */
diff --git a/usr.bin/sort/coll.h b/usr.bin/sort/coll.h
index 6a7b9dd50007..0ae1f20eab38 100644
--- a/usr.bin/sort/coll.h
+++ b/usr.bin/sort/coll.h
@@ -1,182 +1,181 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#if !defined(__COLL_H__)
#define __COLL_H__
#include "bwstring.h"
#include "sort.h"
/*
* Sort hint data for -n
*/
struct n_hint
{
unsigned long long n1;
unsigned char si;
bool empty;
bool neg;
};
/*
* Sort hint data for -g
*/
struct g_hint
{
double d;
bool nan;
bool notnum;
};
/*
* Sort hint data for -M
*/
struct M_hint
{
int m;
};
/*
* Sort hint data for -R
*
* This stores the first 12 bytes of the digest rather than the full output to
* avoid increasing the size of the 'key_hint' object via the 'v' union.
*/
struct R_hint
{
unsigned char cached[12];
};
/*
* Status of a sort hint object
*/
typedef enum
{
HS_ERROR = -1, HS_UNINITIALIZED = 0, HS_INITIALIZED = 1
} hint_status;
/*
* Sort hint object
*/
struct key_hint
{
hint_status status;
union
{
struct n_hint nh;
struct g_hint gh;
struct M_hint Mh;
struct R_hint Rh;
} v;
};
/*
* Key value
*/
struct key_value
{
struct bwstring *k; /* key string */
struct key_hint hint[0]; /* key sort hint */
} __packed;
/*
* Set of keys container object.
*/
struct keys_array
{
struct key_value key[0];
};
/*
* Parsed -k option data
*/
struct key_specs
{
struct sort_mods sm;
size_t c1;
size_t c2;
size_t f1;
size_t f2;
bool pos1b;
bool pos2b;
};
/*
* Single entry in sort list.
*/
struct sort_list_item
{
struct bwstring *str;
struct keys_array ka;
};
/*
* Function type, used to compare two list objects
*/
typedef int (*listcoll_t)(struct sort_list_item **ss1, struct sort_list_item **ss2);
extern struct key_specs *keys;
extern size_t keys_num;
/*
* Main localised symbols. These must be wint_t as they may hold WEOF.
*/
extern wint_t symbol_decimal_point;
extern wint_t symbol_thousands_sep;
extern wint_t symbol_negative_sign;
extern wint_t symbol_positive_sign;
/* funcs */
cmpcoll_t get_sort_func(struct sort_mods *sm);
struct keys_array *keys_array_alloc(void);
size_t keys_array_size(void);
struct key_value *get_key_from_keys_array(struct keys_array *ka, size_t ind);
void set_key_on_keys_array(struct keys_array *ka, struct bwstring *s, size_t ind);
void clean_keys_array(const struct bwstring *s, struct keys_array *ka);
struct sort_list_item *sort_list_item_alloc(void);
void sort_list_item_set(struct sort_list_item *si, struct bwstring *str);
void sort_list_item_clean(struct sort_list_item *si);
size_t sort_list_item_size(struct sort_list_item *si);
int preproc(struct bwstring *s, struct keys_array *ka);
int top_level_str_coll(const struct bwstring *, const struct bwstring *);
int key_coll(struct keys_array *ks1, struct keys_array *ks2, size_t offset);
int str_list_coll(struct bwstring *str1, struct sort_list_item **ss2);
int list_coll_by_str_only(struct sort_list_item **ss1, struct sort_list_item **ss2);
int list_coll(struct sort_list_item **ss1, struct sort_list_item **ss2);
int list_coll_offset(struct sort_list_item **ss1, struct sort_list_item **ss2, size_t offset);
listcoll_t get_list_call_func(size_t offset);
#endif /* __COLL_H__ */
diff --git a/usr.bin/sort/file.h b/usr.bin/sort/file.h
index fc3b7261fe79..c3f7bb23f200 100644
--- a/usr.bin/sort/file.h
+++ b/usr.bin/sort/file.h
@@ -1,128 +1,127 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#if !defined(__SORT_FILE_H__)
#define __SORT_FILE_H__
#include "coll.h"
#include "sort.h"
#define SORT_DEFAULT 0
#define SORT_QSORT 1
#define SORT_MERGESORT 2
#define SORT_HEAPSORT 3
#define SORT_RADIXSORT 4
#define DEFAULT_SORT_ALGORITHM SORT_HEAPSORT
#define DEFAULT_SORT_FUNC heapsort
/*
* List of data to be sorted.
*/
struct sort_list
{
struct sort_list_item **list;
unsigned long long memsize;
size_t count;
size_t size;
size_t sub_list_pos;
};
/*
* File reader object
*/
struct file_reader;
/*
* List of files to be sorted
*/
struct file_list
{
const char * *fns;
size_t count;
size_t sz;
bool tmp;
};
/* memory */
/**/
extern unsigned long long free_memory;
extern unsigned long long available_free_memory;
/* Are we using mmap ? */
extern bool use_mmap;
/* temporary file dir */
extern const char *tmpdir;
/*
* Max number of simultaneously open files (including the output file).
*/
extern size_t max_open_files;
/*
* Compress program
*/
extern const char* compress_program;
/* funcs */
struct file_reader *file_reader_init(const char *fsrc);
struct bwstring *file_reader_readline(struct file_reader *fr);
void file_reader_free(struct file_reader *fr);
void init_tmp_files(void);
void clear_tmp_files(void);
char *new_tmp_file_name(void);
void tmp_file_atexit(const char *tmp_file);
void file_list_init(struct file_list *fl, bool tmp);
void file_list_add(struct file_list *fl, const char *fn, bool allocate);
void file_list_populate(struct file_list *fl, int argc, char **argv, bool allocate);
void file_list_clean(struct file_list *fl);
int check(const char *);
void merge_files(struct file_list *fl, const char *fn_out);
FILE *openfile(const char *, const char *);
void closefile(FILE *, const char *);
int procfile(const char *fn, struct sort_list *list, struct file_list *fl);
void sort_list_init(struct sort_list *l);
void sort_list_add(struct sort_list *l, struct bwstring *str);
void sort_list_clean(struct sort_list *l);
void sort_list_dump(struct sort_list *l, const char *fn);
void sort_list_to_file(struct sort_list *list, const char *outfile);
#endif /* __SORT_FILE_H__ */
diff --git a/usr.bin/sort/mem.h b/usr.bin/sort/mem.h
index a6c1af1be5bb..4e733efd0f61 100644
--- a/usr.bin/sort/mem.h
+++ b/usr.bin/sort/mem.h
@@ -1,48 +1,47 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#if !defined(__SORT_MEM_H__)
#define __SORT_MEM_H__
#include <errno.h>
#include <stdbool.h>
#include <stdlib.h>
/*
* mem.c
*/
void *sort_calloc(size_t, size_t);
void *sort_malloc(size_t);
void sort_free(const void *ptr);
void *sort_realloc(void *, size_t);
char *sort_strdup(const char *);
#endif /* __SORT_MEM_H__ */
diff --git a/usr.bin/sort/radixsort.h b/usr.bin/sort/radixsort.h
index e3b694167635..4388cfc2951a 100644
--- a/usr.bin/sort/radixsort.h
+++ b/usr.bin/sort/radixsort.h
@@ -1,40 +1,39 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* Copyright (C) 2012 Gabor Kovesdan <gabor@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#if !defined(__SORT_RADIX_H__)
#define __SORT_RADIX_H__
#include "coll.h"
#include "sort.h"
void rxsort(struct sort_list_item **base, size_t nmemb);
#endif /* __SORT_RADIX_H__ */
diff --git a/usr.bin/sort/sort.h b/usr.bin/sort/sort.h
index c1a17df1044c..449d2a59ed3e 100644
--- a/usr.bin/sort/sort.h
+++ b/usr.bin/sort/sort.h
@@ -1,137 +1,136 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2009 Gabor Kovesdan <gabor@FreeBSD.org>
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#if !defined(__BSD_SORT_H__)
#define __BSD_SORT_H__
#include <errno.h>
#include <stdbool.h>
#include <stdio.h>
#include <sysexits.h>
#include <wchar.h>
#include <sys/types.h>
#include <md5.h>
#define VERSION "2.3-FreeBSD"
#ifdef WITHOUT_NLS
#define getstr(n) nlsstr[n]
#else
#include <nl_types.h>
extern nl_catd catalog;
#define getstr(n) \
(catalog == (nl_catd)-1 ? nlsstr[n] : catgets(catalog, 1, n, nlsstr[n]))
#endif
extern const char *nlsstr[];
#if defined(SORT_THREADS)
#define MT_SORT_THRESHOLD (10000)
extern unsigned int ncpu;
extern size_t nthreads;
#endif
/*
* If true, we output some debug information.
*/
extern bool debug_sort;
/*
* MD5 context for random hash function
*/
extern MD5_CTX md5_ctx;
/*
* sort.c
*/
/*
* This structure holds main sort options which are NOT affecting the sort ordering.
*/
struct sort_opts
{
wint_t field_sep;
int sort_method;
bool cflag;
bool csilentflag;
bool kflag;
bool mflag;
bool sflag;
bool uflag;
bool zflag;
bool tflag;
bool complex_sort;
};
/*
* Key value structure forward declaration
*/
struct key_value;
/*
* Cmp function
*/
typedef int (*cmpcoll_t)(struct key_value *kv1, struct key_value *kv2, size_t offset);
/*
* This structure holds "sort modifiers" - options which are affecting the sort ordering.
*/
struct sort_mods
{
cmpcoll_t func;
bool bflag;
bool dflag;
bool fflag;
bool gflag;
bool iflag;
bool Mflag;
bool nflag;
bool rflag;
bool Rflag;
bool Vflag;
bool hflag;
};
extern bool need_hint;
extern struct sort_opts sort_opts_vals;
extern struct sort_mods * const default_sort_mods;
/*
* Cached value of MB_CUR_MAX. Because MB_CUR_MAX is used often throughout the program,
* this avoids frequent calls to __mb_cur_max.
*/
extern size_t mb_cur_max;
#endif /* __BSD_SORT_H__ */
diff --git a/usr.bin/sort/vsort.h b/usr.bin/sort/vsort.h
index b2f78538fdf2..28904e595980 100644
--- a/usr.bin/sort/vsort.h
+++ b/usr.bin/sort/vsort.h
@@ -1,39 +1,38 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 2012 Oleg Moskalenko <mom040267@gmail.com>
* Copyright (C) 2012 Gabor Kovesdan <gabor@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _VSORT_H_
#define _VSORT_H_
#include "bwstring.h"
int vcmp(struct bwstring *s1, struct bwstring *s2);
#endif
diff --git a/usr.bin/svn/expat.h b/usr.bin/svn/expat.h
index a501ce30cac1..90ad709a2b5c 100644
--- a/usr.bin/svn/expat.h
+++ b/usr.bin/svn/expat.h
@@ -1,4 +1,3 @@
-/* $FreeBSD$ */
/* Hack to avoid changing vendor code */
#include <bsdxml.h>
diff --git a/usr.bin/svn/lib/libapr/apr.h b/usr.bin/svn/lib/libapr/apr.h
index 8120937d50d3..63193760719c 100644
--- a/usr.bin/svn/lib/libapr/apr.h
+++ b/usr.bin/svn/lib/libapr/apr.h
@@ -1,679 +1,678 @@
-/* $FreeBSD$ */
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef APR_H
#define APR_H
/* GENERATED FILE WARNING! DO NOT EDIT apr.h
*
* You must modify apr.h.in instead.
*
* And please, make an effort to stub apr.hw and apr.hnw in the process.
*/
/**
* @file apr.h
* @brief APR Platform Definitions
* @remark This is a generated header generated from include/apr.h.in by
* ./configure, or copied from include/apr.hw or include/apr.hnw
* for Win32 or Netware by those build environments, respectively.
*/
/**
* @defgroup APR Apache Portability Runtime library
* @{
*/
/**
* @defgroup apr_platform Platform Definitions
* @{
* @warning
* <strong><em>The actual values of macros and typedefs on this page<br>
* are platform specific and should NOT be relied upon!</em></strong>
*/
/* So that we can use inline on some critical functions, and use
* GNUC attributes (such as to get -Wall warnings for printf-like
* functions). Only do this in gcc 2.7 or later ... it may work
* on earlier stuff, but why chance it.
*
* We've since discovered that the gcc shipped with NeXT systems
* as "cc" is completely broken. It claims to be __GNUC__ and so
* on, but it doesn't implement half of the things that __GNUC__
* means. In particular it's missing inline and the __attribute__
* stuff. So we hack around it. PR#1613. -djg
*/
#if !defined(__GNUC__) || __GNUC__ < 2 || \
(__GNUC__ == 2 && __GNUC_MINOR__ < 7) ||\
defined(NEXT)
#ifndef __attribute__
#define __attribute__(__x)
#endif
#define APR_INLINE
#define APR_HAS_INLINE 0
#else
#define APR_INLINE __inline__
#define APR_HAS_INLINE 1
#endif
#define APR_HAVE_ARPA_INET_H 1
#define APR_HAVE_CONIO_H 0
#define APR_HAVE_CRYPT_H 0
#define APR_HAVE_CTYPE_H 1
#define APR_HAVE_DIRENT_H 1
#define APR_HAVE_ERRNO_H 1
#define APR_HAVE_FCNTL_H 1
#define APR_HAVE_IO_H 0
#define APR_HAVE_LIMITS_H 1
#define APR_HAVE_NETDB_H 1
#define APR_HAVE_NETINET_IN_H 1
#define APR_HAVE_NETINET_SCTP_H 1
#define APR_HAVE_NETINET_SCTP_UIO_H 1
#define APR_HAVE_NETINET_TCP_H 1
#define APR_HAVE_PROCESS_H 0
#define APR_HAVE_PTHREAD_H 1
#define APR_HAVE_SEMAPHORE_H 1
#define APR_HAVE_SIGNAL_H 1
#define APR_HAVE_STDARG_H 1
#define APR_HAVE_STDINT_H 1
#define APR_HAVE_STDIO_H 1
#define APR_HAVE_STDLIB_H 1
#define APR_HAVE_STRING_H 1
#define APR_HAVE_STRINGS_H 1
#define APR_HAVE_INTTYPES_H 1
#define APR_HAVE_SYS_IOCTL_H 1
#define APR_HAVE_SYS_SENDFILE_H 0
#define APR_HAVE_SYS_SIGNAL_H 1
#define APR_HAVE_SYS_SOCKET_H 1
#define APR_HAVE_SYS_SOCKIO_H 1
#define APR_HAVE_SYS_SYSLIMITS_H 1
#define APR_HAVE_SYS_TIME_H 1
#define APR_HAVE_SYS_TYPES_H 1
#define APR_HAVE_SYS_UIO_H 1
#define APR_HAVE_SYS_UN_H 1
#define APR_HAVE_SYS_WAIT_H 1
#define APR_HAVE_TIME_H 1
#define APR_HAVE_UNISTD_H 1
#define APR_HAVE_WINDOWS_H 0
#define APR_HAVE_WINSOCK2_H 0
/** @} */
/** @} */
/* We don't include our conditional headers within the doxyblocks
* or the extern "C" namespace
*/
#if APR_HAVE_WINDOWS_H && defined(WIN32)
/* If windows.h was already included, our preferences don't matter.
* If not, include a restricted set of windows headers to our tastes.
*/
#ifndef _WINDOWS_
#ifndef WIN32_LEAN_AND_MEAN
#define WIN32_LEAN_AND_MEAN
#endif
#ifndef _WIN32_WINNT
/* Restrict the server to a subset of Windows XP header files by default
*/
#define _WIN32_WINNT 0x0501
#endif
#ifndef NOUSER
#define NOUSER
#endif
#ifndef NOMCX
#define NOMCX
#endif
#ifndef NOIME
#define NOIME
#endif
#include <windows.h>
/*
* Add a _very_few_ declarations missing from the restricted set of headers
* (If this list becomes extensive, re-enable the required headers above!)
* winsock headers were excluded by WIN32_LEAN_AND_MEAN, so include them now
*/
#define SW_HIDE 0
#ifndef _WIN32_WCE
#include <winsock2.h>
#include <ws2tcpip.h>
#include <mswsock.h>
#else
#include <winsock.h>
#endif
#endif /* ndef _WINDOWS_ */
#endif /* APR_HAVE_WINDOWS_H */
#if APR_HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#if APR_HAVE_SYS_SOCKET_H
#include <sys/socket.h>
#endif
#if APR_HAVE_STDINT_H
#ifdef __cplusplus
/* C99 7.18.4 requires that stdint.h only exposes INT64_C
* and UINT64_C for C++ implementations if this is defined: */
#ifndef __STDC_CONSTANT_MACROS
#define __STDC_CONSTANT_MACROS
#endif
/* C++ needs this too for PRI*NN formats: */
#ifndef __STDC_FORMAT_MACROS
#define __STDC_FORMAT_MACROS
#endif
#endif /* __cplusplus */
#include <stdint.h>
#endif
#if APR_HAVE_INTTYPES_H
#include <inttypes.h>
#endif
#if APR_HAVE_SYS_WAIT_H
#include <sys/wait.h>
#endif
#ifdef OS2
#define INCL_DOS
#define INCL_DOSERRORS
#include <os2.h>
#endif
/* header files for PATH_MAX, _POSIX_PATH_MAX */
#if APR_HAVE_LIMITS_H
#include <limits.h>
#else
#if APR_HAVE_SYS_SYSLIMITS_H
#include <sys/syslimits.h>
#endif
#endif
/* __APPLE__ is now the official pre-defined macro for macOS */
#ifdef __APPLE__
#undef DARWIN
#undef DARWIN_10
#define DARWIN
#define DARWIN_10
#endif /* __APPLE__ */
#ifdef __cplusplus
extern "C" {
#endif
/**
* @addtogroup apr_platform
* @ingroup APR
* @{
*/
#define APR_HAVE_SHMEM_MMAP_TMP 1
#define APR_HAVE_SHMEM_MMAP_SHM 1
#define APR_HAVE_SHMEM_MMAP_ZERO 1
#define APR_HAVE_SHMEM_SHMGET_ANON 1
#define APR_HAVE_SHMEM_SHMGET 1
#define APR_HAVE_SHMEM_MMAP_ANON 1
#define APR_HAVE_SHMEM_BEOS 0
#define APR_USE_SHMEM_MMAP_TMP 0
#define APR_USE_SHMEM_MMAP_SHM 0
#define APR_USE_SHMEM_MMAP_ZERO 0
#define APR_USE_SHMEM_SHMGET_ANON 0
#define APR_USE_SHMEM_SHMGET 1
#define APR_USE_SHMEM_MMAP_ANON 1
#define APR_USE_SHMEM_BEOS 0
#define APR_USE_FLOCK_SERIALIZE 1
#define APR_USE_SYSVSEM_SERIALIZE 0
#define APR_USE_POSIXSEM_SERIALIZE 0
#define APR_USE_FCNTL_SERIALIZE 0
#define APR_USE_PROC_PTHREAD_SERIALIZE 0
#define APR_USE_PTHREAD_SERIALIZE 1
#define APR_HAS_FLOCK_SERIALIZE 1
#define APR_HAS_SYSVSEM_SERIALIZE 1
#define APR_HAS_POSIXSEM_SERIALIZE 1
#define APR_HAS_FCNTL_SERIALIZE 1
#define APR_HAS_PROC_PTHREAD_SERIALIZE 1
#define APR_PROCESS_LOCK_IS_GLOBAL 0
#define APR_HAVE_CORKABLE_TCP 1
#define APR_HAVE_GETRLIMIT 1
#define APR_HAVE_IN_ADDR 1
#define APR_HAVE_INET_ADDR 1
#define APR_HAVE_INET_NETWORK 1
#define APR_HAVE_IPV6 1
#define APR_HAVE_SOCKADDR_UN 1
#define APR_HAVE_MEMMOVE 1
#define APR_HAVE_SETRLIMIT 1
#define APR_HAVE_SIGACTION 1
#define APR_HAVE_SIGSUSPEND 1
#define APR_HAVE_SIGWAIT 1
#define APR_HAVE_SA_STORAGE 1
#define APR_HAVE_STRCASECMP 1
#define APR_HAVE_STRDUP 1
#define APR_HAVE_STRICMP 0
#define APR_HAVE_STRNCASECMP 1
#define APR_HAVE_STRNICMP 0
#define APR_HAVE_STRSTR 1
#define APR_HAVE_MEMCHR 1
#define APR_HAVE_STRUCT_RLIMIT 1
#define APR_HAVE_UNION_SEMUN 0
#define APR_HAVE_SCTP 1
#define APR_HAVE_IOVEC 1
/* APR Feature Macros */
#define APR_HAS_SHARED_MEMORY 1
#define APR_HAS_THREADS 1
#define APR_HAS_SENDFILE 1
#define APR_HAS_MMAP 1
#define APR_HAS_FORK 1
#define APR_HAS_RANDOM 1
#define APR_HAS_OTHER_CHILD 1
#define APR_HAS_DSO 1
#define APR_HAS_SO_ACCEPTFILTER 1
#define APR_HAS_UNICODE_FS 0
#define APR_HAS_PROC_INVOKED 0
#define APR_HAS_USER 1
#define APR_HAS_LARGE_FILES 0
#define APR_HAS_XTHREAD_FILES 0
#define APR_HAS_OS_UUID 1
#define APR_HAS_TIMEDLOCKS 1
#define APR_PROCATTR_USER_SET_REQUIRES_PASSWORD 0
/* APR sets APR_FILES_AS_SOCKETS to 1 on systems where it is possible
* to poll on files/pipes.
*/
#define APR_FILES_AS_SOCKETS 1
/* This macro indicates whether or not EBCDIC is the native character set.
*/
#define APR_CHARSET_EBCDIC 0
/* If we have a TCP implementation that can be "corked", what flag
* do we use?
*/
#define APR_TCP_NOPUSH_FLAG TCP_NOPUSH
/* Is the TCP_NODELAY socket option inherited from listening sockets?
*/
#define APR_TCP_NODELAY_INHERITED 1
/* Is the O_NONBLOCK flag inherited from listening sockets?
*/
#define APR_O_NONBLOCK_INHERITED 1
/* Typedefs that APR needs. */
typedef unsigned char apr_byte_t;
typedef short apr_int16_t;
typedef unsigned short apr_uint16_t;
typedef int apr_int32_t;
typedef unsigned int apr_uint32_t;
#include <sys/_types.h>
#ifdef __LP64__
#define APR_SIZEOF_VOIDP 8
#else
#define APR_SIZEOF_VOIDP 4
#endif
/*
* Darwin 10's default compiler (gcc42) builds for both 64 and
* 32 bit architectures unless specifically told not to.
* In those cases, we need to override types depending on how
* we're being built at compile time.
* NOTE: This is an ugly work-around for Darwin's
* concept of universal binaries, a single package
* (executable, lib, etc...) which contains both 32
* and 64 bit versions. The issue is that if APR is
* built universally, if something else is compiled
* against it, some bit sizes will depend on whether
* it is 32 or 64 bit. This is determined by the __LP64__
* flag. Since we need to support both, we have to
* handle OS X unqiuely.
*/
#ifdef DARWIN_10
#undef APR_SIZEOF_VOIDP
#undef APR_INT64_C
#undef APR_UINT64_C
#ifdef __LP64__
typedef long apr_int64_t;
typedef unsigned long apr_uint64_t;
#define APR_SIZEOF_VOIDP 8
#define APR_INT64_C(v) (v ## L)
#define APR_UINT64_C(v) (v ## UL)
#else
typedef long long apr_int64_t;
typedef unsigned long long apr_uint64_t;
#define APR_SIZEOF_VOIDP 4
#define APR_INT64_C(v) (v ## LL)
#define APR_UINT64_C(v) (v ## ULL)
#endif
#else
typedef __int64_t apr_int64_t;
typedef __uint64_t apr_uint64_t;
/* Mechanisms to properly type numeric literals */
#define APR_INT64_C(val) INT64_C(val)
#define APR_UINT64_C(val) UINT64_C(val)
#endif
typedef size_t apr_size_t;
typedef ssize_t apr_ssize_t;
typedef off_t apr_off_t;
typedef socklen_t apr_socklen_t;
typedef __ino_t apr_ino_t;
#if APR_SIZEOF_VOIDP == 8
typedef apr_uint64_t apr_uintptr_t;
#else
typedef apr_uint32_t apr_uintptr_t;
#endif
/* Are we big endian? */
#if _BYTE_ORDER == _LITTLE_ENDIAN
#define APR_IS_BIGENDIAN 0
#elif _BYTE_ORDER == _BIG_ENDIAN
#define APR_IS_BIGENDIAN 1
#else
#error Unknown byte order.
#endif
#ifdef INT16_MIN
#define APR_INT16_MIN INT16_MIN
#else
#define APR_INT16_MIN (-0x7fff - 1)
#endif
#ifdef INT16_MAX
#define APR_INT16_MAX INT16_MAX
#else
#define APR_INT16_MAX (0x7fff)
#endif
#ifdef UINT16_MAX
#define APR_UINT16_MAX UINT16_MAX
#else
#define APR_UINT16_MAX (0xffff)
#endif
#ifdef INT32_MIN
#define APR_INT32_MIN INT32_MIN
#else
#define APR_INT32_MIN (-0x7fffffff - 1)
#endif
#ifdef INT32_MAX
#define APR_INT32_MAX INT32_MAX
#else
#define APR_INT32_MAX 0x7fffffff
#endif
#ifdef UINT32_MAX
#define APR_UINT32_MAX UINT32_MAX
#else
#define APR_UINT32_MAX (0xffffffffU)
#endif
#ifdef INT64_MIN
#define APR_INT64_MIN INT64_MIN
#else
#define APR_INT64_MIN (APR_INT64_C(-0x7fffffffffffffff) - 1)
#endif
#ifdef INT64_MAX
#define APR_INT64_MAX INT64_MAX
#else
#define APR_INT64_MAX APR_INT64_C(0x7fffffffffffffff)
#endif
#ifdef UINT64_MAX
#define APR_UINT64_MAX UINT64_MAX
#else
#define APR_UINT64_MAX APR_UINT64_C(0xffffffffffffffff)
#endif
#define APR_SIZE_MAX (~((apr_size_t)0))
/* Definitions that APR programs need to work properly. */
/**
* APR public API wrap for C++ compilers.
*/
#ifdef __cplusplus
#define APR_BEGIN_DECLS extern "C" {
#define APR_END_DECLS }
#else
#define APR_BEGIN_DECLS
#define APR_END_DECLS
#endif
/**
* Thread callbacks from APR functions must be declared with APR_THREAD_FUNC,
* so that they follow the platform's calling convention.
* <PRE>
*
* void* APR_THREAD_FUNC my_thread_entry_fn(apr_thread_t *thd, void *data);
*
* </PRE>
*/
#define APR_THREAD_FUNC
#if defined(DOXYGEN) || !defined(WIN32)
/**
* The public APR functions are declared with APR_DECLARE(), so they may
* use the most appropriate calling convention. Public APR functions with
* variable arguments must use APR_DECLARE_NONSTD().
*
* @remark Both the declaration and implementations must use the same macro.
*
* <PRE>
* APR_DECLARE(rettype) apr_func(args)
* </PRE>
* @see APR_DECLARE_NONSTD @see APR_DECLARE_DATA
* @remark Note that when APR compiles the library itself, it passes the
* symbol -DAPR_DECLARE_EXPORT to the compiler on some platforms (e.g. Win32)
* to export public symbols from the dynamic library build.\n
* The user must define the APR_DECLARE_STATIC when compiling to target
* the static APR library on some platforms (e.g. Win32.) The public symbols
* are neither exported nor imported when APR_DECLARE_STATIC is defined.\n
* By default, compiling an application and including the APR public
* headers, without defining APR_DECLARE_STATIC, will prepare the code to be
* linked to the dynamic library.
*/
#define APR_DECLARE(type) type
/**
* The public APR functions using variable arguments are declared with
* APR_DECLARE_NONSTD(), as they must follow the C language calling convention.
* @see APR_DECLARE @see APR_DECLARE_DATA
* @remark Both the declaration and implementations must use the same macro.
* <PRE>
*
* APR_DECLARE_NONSTD(rettype) apr_func(args, ...);
*
* </PRE>
*/
#define APR_DECLARE_NONSTD(type) type
/**
* The public APR variables are declared with AP_MODULE_DECLARE_DATA.
* This assures the appropriate indirection is invoked at compile time.
* @see APR_DECLARE @see APR_DECLARE_NONSTD
* @remark Note that the declaration and implementations use different forms,
* but both must include the macro.
*
* <PRE>
*
* extern APR_DECLARE_DATA type apr_variable;\n
* APR_DECLARE_DATA type apr_variable = value;
*
* </PRE>
*/
#define APR_DECLARE_DATA
#elif defined(APR_DECLARE_STATIC)
#define APR_DECLARE(type) type __stdcall
#define APR_DECLARE_NONSTD(type) type __cdecl
#define APR_DECLARE_DATA
#elif defined(APR_DECLARE_EXPORT)
#define APR_DECLARE(type) __declspec(dllexport) type __stdcall
#define APR_DECLARE_NONSTD(type) __declspec(dllexport) type __cdecl
#define APR_DECLARE_DATA __declspec(dllexport)
#else
#define APR_DECLARE(type) __declspec(dllimport) type __stdcall
#define APR_DECLARE_NONSTD(type) __declspec(dllimport) type __cdecl
#define APR_DECLARE_DATA __declspec(dllimport)
#endif
/* Define APR_SSIZE_T_FMT.
* If ssize_t is an integer we define it to be "d",
* if ssize_t is a long int we define it to be "ld",
* if ssize_t is neither we declare an error here.
* I looked for a better way to define this here, but couldn't find one, so
* to find the logic for this definition search for "ssize_t_fmt" in
* configure.in.
*/
#ifdef __LP64__
#define APR_SSIZE_T_FMT "ld"
/* And APR_SIZE_T_FMT */
#define APR_SIZE_T_FMT "lu"
/* And APR_OFF_T_FMT */
#define APR_OFF_T_FMT "ld"
/* And APR_PID_T_FMT */
#define APR_PID_T_FMT "d"
/* And APR_INT64_T_FMT */
#define APR_INT64_T_FMT "ld"
/* And APR_UINT64_T_FMT */
#define APR_UINT64_T_FMT "lu"
/* And APR_UINT64_T_HEX_FMT */
#define APR_UINT64_T_HEX_FMT "lx"
#else
#define APR_SSIZE_T_FMT "d"
#define APR_SIZE_T_FMT "u"
#define APR_OFF_T_FMT APR_INT64_T_FMT
#define APR_PID_T_FMT "d"
#define APR_INT64_T_FMT "lld"
#define APR_UINT64_T_FMT "llu"
#define APR_UINT64_T_HEX_FMT "llx"
#endif
/*
* Ensure we work with universal binaries on Darwin
*/
#ifdef DARWIN_10
#undef APR_HAS_LARGE_FILES
#undef APR_SIZEOF_VOIDP
#undef APR_INT64_T_FMT
#undef APR_UINT64_T_FMT
#undef APR_UINT64_T_HEX_FMT
#ifdef __LP64__
#define APR_HAS_LARGE_FILES 0
#define APR_SIZEOF_VOIDP 8
#define APR_INT64_T_FMT "ld"
#define APR_UINT64_T_FMT "lu"
#define APR_UINT64_T_HEX_FMT "lx"
#else
#define APR_HAS_LARGE_FILES 1
#define APR_SIZEOF_VOIDP 4
#define APR_INT64_T_FMT "lld"
#define APR_UINT64_T_FMT "llu"
#define APR_UINT64_T_HEX_FMT "llx"
#endif
#undef APR_IS_BIGENDIAN
#ifdef __BIG_ENDIAN__
#define APR_IS_BIGENDIAN 1
#else
#define APR_IS_BIGENDIAN 0
#endif
#undef APR_OFF_T_FMT
#define APR_OFF_T_FMT "lld"
#endif /* DARWIN_10 */
/* Does the proc mutex lock threads too */
#define APR_PROC_MUTEX_IS_GLOBAL 0
/* Local machine definition for console and log output. */
#define APR_EOL_STR "\n"
#if APR_HAVE_SYS_WAIT_H
#ifdef WEXITSTATUS
#define apr_wait_t int
#else
#define apr_wait_t union wait
#define WEXITSTATUS(status) (int)((status).w_retcode)
#define WTERMSIG(status) (int)((status).w_termsig)
#endif /* !WEXITSTATUS */
#elif defined(__MINGW32__)
typedef int apr_wait_t;
#endif /* HAVE_SYS_WAIT_H */
#if defined(PATH_MAX)
#define APR_PATH_MAX PATH_MAX
#elif defined(_POSIX_PATH_MAX)
#define APR_PATH_MAX _POSIX_PATH_MAX
#else
#error no decision has been made on APR_PATH_MAX for your platform
#endif
#define APR_DSOPATH "LD_LIBRARY_PATH"
/** @} */
/* Definitions that only Win32 programs need to compile properly. */
/* XXX These simply don't belong here, perhaps in apr_portable.h
* based on some APR_HAVE_PID/GID/UID?
*/
#ifdef __MINGW32__
#ifndef __GNUC__
typedef int pid_t;
#endif
typedef int uid_t;
typedef int gid_t;
#endif
#ifdef __cplusplus
}
#endif
#endif /* APR_H */
diff --git a/usr.bin/svn/lib/libapr/apr_escape_test_char.h b/usr.bin/svn/lib/libapr/apr_escape_test_char.h
index a1f2cc2e3690..35693599479a 100644
--- a/usr.bin/svn/lib/libapr/apr_escape_test_char.h
+++ b/usr.bin/svn/lib/libapr/apr_escape_test_char.h
@@ -1,27 +1,26 @@
-/* $FreeBSD$ */
/* this file is automatically generated by gen_test_char, do not edit. "make include/private/apr_escape_test_char.h" to regenerate. */
#define T_ESCAPE_SHELL_CMD (1)
#define T_ESCAPE_PATH_SEGMENT (2)
#define T_OS_ESCAPE_PATH (4)
#define T_ESCAPE_ECHO (8)
#define T_ESCAPE_URLENCODED (16)
#define T_ESCAPE_XML (32)
#define T_ESCAPE_LDAP_DN (64)
#define T_ESCAPE_LDAP_FILTER (128)
static const unsigned char test_char_table[256] = {
224,222,222,222,222,222,222,222,222,222,223,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,6,16,127,22,17,22,49,17,
145,145,129,80,80,0,0,18,0,0,0,0,0,0,0,0,0,0,16,87,
119,16,119,23,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,23,223,23,23,0,23,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,23,23,23,17,222,222,222,222,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,
222,222,222,222,222,222,222,222,222,222,222,222,222,222,222,222
};
diff --git a/usr.bin/svn/lib/libapr/apr_private.h b/usr.bin/svn/lib/libapr/apr_private.h
index 496837a8f862..3dbbc4da8973 100644
--- a/usr.bin/svn/lib/libapr/apr_private.h
+++ b/usr.bin/svn/lib/libapr/apr_private.h
@@ -1,1084 +1,1083 @@
-/* $FreeBSD$ */
/* include/arch/unix/apr_private.h. Generated from apr_private.h.in by configure. */
/* include/arch/unix/apr_private.h.in. Generated from configure.in by autoheader. */
#ifndef APR_PRIVATE_H
#define APR_PRIVATE_H
/* Define if building universal (internal helper macro) */
/* #undef AC_APPLE_UNIVERSAL_BUILD */
/* Define if apr_allocator should use guard pages */
/* #undef APR_ALLOCATOR_GUARD_PAGES */
/* Define if apr_allocator should use mmap */
/* #undef APR_ALLOCATOR_USES_MMAP */
/* Define as function which can be used for conversion of strings to
apr_int64_t */
#define APR_INT64_STRFN strtol
/* Define as function used for conversion of strings to apr_off_t */
#define APR_OFF_T_STRFN strtol
/* Define if pool functions should abort if concurrent usage is detected */
/* #undef APR_POOL_CONCURRENCY_CHECK */
/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP
systems. This function is required for `alloca.c' support on those systems.
*/
/* #undef CRAY_STACKSEG_END */
/* Define to 1 if using `alloca.c'. */
/* #undef C_ALLOCA */
/* Define to path of random device */
/* #undef DEV_RANDOM */
/* Define if struct dirent has an inode member */
#define DIRENT_INODE d_fileno
/* Define if struct dirent has a d_type member */
#define DIRENT_TYPE d_type
/* Define if DSO support uses dlfcn.h */
#define DSO_USE_DLFCN 1
/* Define if DSO support uses dyld.h */
/* #undef DSO_USE_DYLD */
/* Define if DSO support uses shl_load */
/* #undef DSO_USE_SHL */
/* Define to list of paths to EGD sockets */
/* #undef EGD_DEFAULT_SOCKET */
/* Define if fcntl locks affect threads within the process */
/* #undef FCNTL_IS_GLOBAL */
/* Define if fcntl returns EACCES when F_SETLK is already held */
/* #undef FCNTL_TRYACQUIRE_EACCES */
/* Define if flock locks affect threads within the process */
/* #undef FLOCK_IS_GLOBAL */
/* Define if gethostbyaddr is thread safe */
/* #undef GETHOSTBYADDR_IS_THREAD_SAFE */
/* Define if gethostbyname is thread safe */
/* #undef GETHOSTBYNAME_IS_THREAD_SAFE */
/* Define if gethostbyname_r has the glibc style */
#define GETHOSTBYNAME_R_GLIBC2 1
/* Define if gethostbyname_r has the hostent_data for the third argument */
/* #undef GETHOSTBYNAME_R_HOSTENT_DATA */
/* Define if getservbyname is thread safe */
/* #undef GETSERVBYNAME_IS_THREAD_SAFE */
/* Define if getservbyname_r has the glibc style */
#define GETSERVBYNAME_R_GLIBC2 1
/* Define if getservbyname_r has the OSF/1 style */
/* #undef GETSERVBYNAME_R_OSF1 */
/* Define if getservbyname_r has the Solaris style */
/* #undef GETSERVBYNAME_R_SOLARIS */
/* Define if accept4 function is supported */
#define HAVE_ACCEPT4 1
/* Define to 1 if you have the `acquire_sem' function. */
/* #undef HAVE_ACQUIRE_SEM */
/* Define to 1 if you have the `acquire_sem_etc' function. */
/* #undef HAVE_ACQUIRE_SEM_ETC */
/* Define if async i/o supports message q's */
/* #undef HAVE_AIO_MSGQ */
/* Define to 1 if you have `alloca', as a function or macro. */
#define HAVE_ALLOCA 1
/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
*/
/* #undef HAVE_ALLOCA_H */
/* Define to 1 if you have the `arc4random_buf' function. */
#define HAVE_ARC4RANDOM_BUF 1
/* Define to 1 if you have the <arpa/inet.h> header file. */
#define HAVE_ARPA_INET_H 1
/* Define if compiler provides atomic builtins */
#if !defined(__mips__) && !defined(__arm__)
#define HAVE_ATOMIC_BUILTINS 1
#endif
/* Define if BONE_VERSION is defined in sys/socket.h */
/* #undef HAVE_BONE_VERSION */
/* Define to 1 if you have the <ByteOrder.h> header file. */
/* #undef HAVE_BYTEORDER_H */
/* Define to 1 if you have the `calloc' function. */
#define HAVE_CALLOC 1
/* Define to 1 if you have the <conio.h> header file. */
/* #undef HAVE_CONIO_H */
/* Define to 1 if you have the `create_area' function. */
/* #undef HAVE_CREATE_AREA */
/* Define to 1 if you have the `create_sem' function. */
/* #undef HAVE_CREATE_SEM */
/* Define to 1 if you have the <crypt.h> header file. */
/* #undef HAVE_CRYPT_H */
/* Define to 1 if you have the <ctype.h> header file. */
#define HAVE_CTYPE_H 1
/* Define to 1 if you have the declaration of `SYS_getrandom', and to 0 if you
don't. */
#define HAVE_DECL_SYS_GETRANDOM 1
/* Define to 1 if you have the declaration of `sys_siglist', and to 0 if you
don't. */
#define HAVE_DECL_SYS_SIGLIST 1
/* Define to 1 if you have the <dirent.h> header file. */
#define HAVE_DIRENT_H 1
/* Define to 1 if you have the <dir.h> header file. */
/* #undef HAVE_DIR_H */
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the <dl.h> header file. */
/* #undef HAVE_DL_H */
/* Define if dup3 function is supported */
#define HAVE_DUP3 1
/* Define if EGD is supported */
/* #undef HAVE_EGD */
/* Define if the epoll interface is supported */
/* #undef HAVE_EPOLL */
/* Define if epoll_create1 function is supported */
/* #undef HAVE_EPOLL_CREATE1 */
/* Define to 1 if you have the <errno.h> header file. */
#define HAVE_ERRNO_H 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if you have the `fdatasync' function. */
#define HAVE_FDATASYNC 1
/* Define to 1 if you have the `flock' function. */
#define HAVE_FLOCK 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define if F_SETLK is defined in fcntl.h */
#define HAVE_F_SETLK 1
/* Define if getaddrinfo accepts the AI_ADDRCONFIG flag */
#define HAVE_GAI_ADDRCONFIG 1
/* Define to 1 if you have the `gai_strerror' function. */
#define HAVE_GAI_STRERROR 1
/* Define if getaddrinfo exists and works well enough for APR */
#define HAVE_GETADDRINFO 1
/* Define to 1 if you have the `getenv' function. */
#define HAVE_GETENV 1
/* Define to 1 if you have the `getgrgid_r' function. */
#define HAVE_GETGRGID_R 1
/* Define to 1 if you have the `getgrnam_r' function. */
#define HAVE_GETGRNAM_R 1
/* Define to 1 if you have the `gethostbyaddr_r' function. */
#define HAVE_GETHOSTBYADDR_R 1
/* Define to 1 if you have the `gethostbyname_r' function. */
#define HAVE_GETHOSTBYNAME_R 1
/* Define to 1 if you have the `getifaddrs' function. */
#define HAVE_GETIFADDRS 1
/* Define if getnameinfo exists */
#define HAVE_GETNAMEINFO 1
/* Define to 1 if you have the `getpass' function. */
#define HAVE_GETPASS 1
/* Define to 1 if you have the `getpassphrase' function. */
/* #undef HAVE_GETPASSPHRASE */
/* Define to 1 if you have the `getpwnam_r' function. */
#define HAVE_GETPWNAM_R 1
/* Define to 1 if you have the `getpwuid_r' function. */
#define HAVE_GETPWUID_R 1
/* Define to 1 if you have the `getrandom' function. */
#define HAVE_GETRANDOM 1
/* Define to 1 if you have the `getrlimit' function. */
#define HAVE_GETRLIMIT 1
/* Define to 1 if you have the `getservbyname_r' function. */
#define HAVE_GETSERVBYNAME_R 1
/* Define to 1 if you have the `gmtime_r' function. */
#define HAVE_GMTIME_R 1
/* Define to 1 if you have the <grp.h> header file. */
#define HAVE_GRP_H 1
/* Define if hstrerror is present */
/* #undef HAVE_HSTRERROR */
/* Define to 1 if you have the `if_indextoname' function. */
#define HAVE_IF_INDEXTONAME 1
/* Define to 1 if you have the `if_nametoindex' function. */
#define HAVE_IF_NAMETOINDEX 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the <io.h> header file. */
/* #undef HAVE_IO_H */
/* Define to 1 if you have the `isinf' function. */
#define HAVE_ISINF 1
/* Define to 1 if you have the `isnan' function. */
#define HAVE_ISNAN 1
/* Define to 1 if you have the <kernel/OS.h> header file. */
/* #undef HAVE_KERNEL_OS_H */
/* Define to 1 if you have the `kqueue' function. */
#define HAVE_KQUEUE 1
/* Define to 1 if you have the <langinfo.h> header file. */
#define HAVE_LANGINFO_H 1
/* Define to 1 if you have the `bsd' library (-lbsd). */
/* #undef HAVE_LIBBSD */
/* Define to 1 if you have the `sendfile' library (-lsendfile). */
/* #undef HAVE_LIBSENDFILE */
/* Define to 1 if you have the `truerand' library (-ltruerand). */
/* #undef HAVE_LIBTRUERAND */
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* Define to 1 if you have the <linux/random.h> header file. */
/* #undef HAVE_LINUX_RANDOM_H */
/* Define to 1 if you have the `localtime_r' function. */
#define HAVE_LOCALTIME_R 1
/* Define if LOCK_EX is defined in sys/file.h */
#define HAVE_LOCK_EX 1
/* Define to 1 if you have the <mach-o/dyld.h> header file. */
/* #undef HAVE_MACH_O_DYLD_H */
/* Define to 1 if you have the <malloc.h> header file. */
/* #undef HAVE_MALLOC_H */
/* Define if MAP_ANON is defined in sys/mman.h */
#define HAVE_MAP_ANON 1
/* Define to 1 if you have the <memcheck.h> header file. */
/* #undef HAVE_MEMCHECK_H */
/* Define to 1 if you have the `memchr' function. */
#define HAVE_MEMCHR 1
/* Define to 1 if you have the `memmove' function. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `mkstemp' function. */
#define HAVE_MKSTEMP 1
/* Define to 1 if you have the `mkstemp64' function. */
/* #undef HAVE_MKSTEMP64 */
/* Define to 1 if you have the `mmap' function. */
#define HAVE_MMAP 1
/* Define to 1 if you have the `mmap64' function. */
/* #undef HAVE_MMAP64 */
/* Define to 1 if you have the `mprotect' function. */
#define HAVE_MPROTECT 1
/* Define to 1 if you have the `munmap' function. */
#define HAVE_MUNMAP 1
/* Define to 1 if you have the <netdb.h> header file. */
#define HAVE_NETDB_H 1
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if you have the <netinet/sctp.h> header file. */
#define HAVE_NETINET_SCTP_H 1
/* Define to 1 if you have the <netinet/sctp_uio.h> header file. */
#define HAVE_NETINET_SCTP_UIO_H 1
/* Defined if netinet/tcp.h is present */
#define HAVE_NETINET_TCP_H 1
/* Define to 1 if you have the <net/errno.h> header file. */
/* #undef HAVE_NET_ERRNO_H */
/* Define to 1 if you have the <net/if.h> header file. */
#define HAVE_NET_IF_H 1
/* Define to 1 if you have the `nl_langinfo' function. */
#define HAVE_NL_LANGINFO 1
/* Define to 1 if you have the <os2.h> header file. */
/* #undef HAVE_OS2_H */
/* Define to 1 if you have the <osreldate.h> header file. */
#define HAVE_OSRELDATE_H 1
/* Define to 1 if you have the <OS.h> header file. */
/* #undef HAVE_OS_H */
/* Define to 1 if you have the `poll' function. */
#define HAVE_POLL 1
/* Define if POLLIN is defined */
#define HAVE_POLLIN 1
/* Define to 1 if you have the <poll.h> header file. */
#define HAVE_POLL_H 1
/* Define to 1 if you have the `port_create' function. */
/* #undef HAVE_PORT_CREATE */
/* Define to 1 if you have the <process.h> header file. */
/* #undef HAVE_PROCESS_H */
/* Define to 1 if you have the `pthread_attr_setguardsize' function. */
#define HAVE_PTHREAD_ATTR_SETGUARDSIZE 1
/* Define to 1 if you have the `pthread_condattr_setpshared' function. */
#define HAVE_PTHREAD_CONDATTR_SETPSHARED 1
/* Define to 1 if you have the <pthread.h> header file. */
#define HAVE_PTHREAD_H 1
/* Define to 1 if you have the `pthread_key_delete' function. */
#define HAVE_PTHREAD_KEY_DELETE 1
/* Define to 1 if you have the `pthread_mutexattr_setpshared' function. */
#define HAVE_PTHREAD_MUTEXATTR_SETPSHARED 1
/* Define if recursive pthread mutexes are available */
#define HAVE_PTHREAD_MUTEX_RECURSIVE 1
/* Define if cross-process robust mutexes are available */
#define HAVE_PTHREAD_MUTEX_ROBUST 1
/* Define if non-posix/portable cross-process robust mutexes are available */
/* #undef HAVE_PTHREAD_MUTEX_ROBUST_NP */
/* Define to 1 if you have the `pthread_mutex_timedlock' function. */
#define HAVE_PTHREAD_MUTEX_TIMEDLOCK 1
/* Define if PTHREAD_PROCESS_SHARED is defined in pthread.h */
#define HAVE_PTHREAD_PROCESS_SHARED 1
/* Define if pthread rwlocks are available */
#define HAVE_PTHREAD_RWLOCKS 1
/* Define to 1 if you have the `pthread_rwlock_init' function. */
#define HAVE_PTHREAD_RWLOCK_INIT 1
/* Define to 1 if you have the `pthread_yield' function. */
#define HAVE_PTHREAD_YIELD 1
/* Define to 1 if you have the `putenv' function. */
#define HAVE_PUTENV 1
/* Define to 1 if you have the <pwd.h> header file. */
#define HAVE_PWD_H 1
/* Define to 1 if you have the `readdir64_r' function. */
/* #undef HAVE_READDIR64_R */
/* Define to 1 if you have the <sched.h> header file. */
/* #undef HAVE_SCHED_H */
/* Define to 1 if you have the `sched_yield' function. */
/* #undef HAVE_SCHED_YIELD */
/* Define to 1 if you have the <semaphore.h> header file. */
#define HAVE_SEMAPHORE_H 1
/* Define to 1 if you have the `semctl' function. */
#define HAVE_SEMCTL 1
/* Define to 1 if you have the `semget' function. */
#define HAVE_SEMGET 1
/* Define to 1 if you have the `semop' function. */
#define HAVE_SEMOP 1
/* Define to 1 if you have the `semtimedop' function. */
/* #undef HAVE_SEMTIMEDOP */
/* Define to 1 if you have the `sem_close' function. */
#define HAVE_SEM_CLOSE 1
/* Define to 1 if you have the `sem_post' function. */
#define HAVE_SEM_POST 1
/* Define to 1 if you have the `sem_timedwait' function. */
#define HAVE_SEM_TIMEDWAIT 1
/* Define if SEM_UNDO is defined in sys/sem.h */
#define HAVE_SEM_UNDO 1
/* Define to 1 if you have the `sem_unlink' function. */
#define HAVE_SEM_UNLINK 1
/* Define to 1 if you have the `sem_wait' function. */
#define HAVE_SEM_WAIT 1
/* Define to 1 if you have the `sendfile' function. */
#define HAVE_SENDFILE 1
/* Define to 1 if you have the `sendfile64' function. */
/* #undef HAVE_SENDFILE64 */
/* Define to 1 if you have the `sendfilev' function. */
/* #undef HAVE_SENDFILEV */
/* Define to 1 if you have the `sendfilev64' function. */
/* #undef HAVE_SENDFILEV64 */
/* Define to 1 if you have the `send_file' function. */
/* #undef HAVE_SEND_FILE */
/* Define to 1 if you have the `setenv' function. */
#define HAVE_SETENV 1
/* Define to 1 if you have the `setrlimit' function. */
#define HAVE_SETRLIMIT 1
/* Define to 1 if you have the `setsid' function. */
#define HAVE_SETSID 1
/* Define to 1 if you have the `set_h_errno' function. */
/* #undef HAVE_SET_H_ERRNO */
/* Define to 1 if you have the `shmat' function. */
#define HAVE_SHMAT 1
/* Define to 1 if you have the `shmctl' function. */
#define HAVE_SHMCTL 1
/* Define to 1 if you have the `shmdt' function. */
#define HAVE_SHMDT 1
/* Define to 1 if you have the `shmget' function. */
#define HAVE_SHMGET 1
/* Define to 1 if you have the `shm_open' function. */
#define HAVE_SHM_OPEN 1
/* Define to 1 if you have the `shm_unlink' function. */
#define HAVE_SHM_UNLINK 1
/* Define to 1 if you have the `sigaction' function. */
#define HAVE_SIGACTION 1
/* Define to 1 if you have the <signal.h> header file. */
#define HAVE_SIGNAL_H 1
/* Define to 1 if you have the `sigsuspend' function. */
#define HAVE_SIGSUSPEND 1
/* Define to 1 if you have the `sigwait' function. */
#define HAVE_SIGWAIT 1
/* Whether you have socklen_t */
#define HAVE_SOCKLEN_T 1
/* Define if the SOCK_CLOEXEC flag is supported */
#define HAVE_SOCK_CLOEXEC 1
/* Define if SO_ACCEPTFILTER is defined in sys/socket.h */
#define HAVE_SO_ACCEPTFILTER 1
/* Define to 1 if you have the <stdarg.h> header file. */
#define HAVE_STDARG_H 1
/* Define to 1 if you have the <stddef.h> header file. */
#define HAVE_STDDEF_H 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdio.h> header file. */
#define HAVE_STDIO_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strcasecmp' function. */
#define HAVE_STRCASECMP 1
/* Define to 1 if you have the `strdup' function. */
#define HAVE_STRDUP 1
/* Define to 1 if you have the `strerror_r' function. */
#define HAVE_STRERROR_R 1
/* Define to 1 if you have the `stricmp' function. */
/* #undef HAVE_STRICMP */
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strncasecmp' function. */
#define HAVE_STRNCASECMP 1
/* Define to 1 if you have the `strnicmp' function. */
/* #undef HAVE_STRNICMP */
/* Define to 1 if you have the `strstr' function. */
#define HAVE_STRSTR 1
/* Define if struct impreq was found */
#define HAVE_STRUCT_IPMREQ 1
/* Define to 1 if `st_atimensec' is a member of `struct stat'. */
/* #undef HAVE_STRUCT_STAT_ST_ATIMENSEC */
/* Define to 1 if `st_atime_n' is a member of `struct stat'. */
/* #undef HAVE_STRUCT_STAT_ST_ATIME_N */
/* Define to 1 if `st_atim.tv_nsec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_ATIM_TV_NSEC 1
/* Define to 1 if `st_blocks' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_BLOCKS 1
/* Define to 1 if `st_ctimensec' is a member of `struct stat'. */
/* #undef HAVE_STRUCT_STAT_ST_CTIMENSEC */
/* Define to 1 if `st_ctime_n' is a member of `struct stat'. */
/* #undef HAVE_STRUCT_STAT_ST_CTIME_N */
/* Define to 1 if `st_ctim.tv_nsec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_CTIM_TV_NSEC 1
/* Define to 1 if `st_mtimensec' is a member of `struct stat'. */
/* #undef HAVE_STRUCT_STAT_ST_MTIMENSEC */
/* Define to 1 if `st_mtime_n' is a member of `struct stat'. */
/* #undef HAVE_STRUCT_STAT_ST_MTIME_N */
/* Define to 1 if `st_mtim.tv_nsec' is a member of `struct stat'. */
#define HAVE_STRUCT_STAT_ST_MTIM_TV_NSEC 1
/* Define to 1 if `tm_gmtoff' is a member of `struct tm'. */
#define HAVE_STRUCT_TM_TM_GMTOFF 1
/* Define to 1 if `__tm_gmtoff' is a member of `struct tm'. */
/* #undef HAVE_STRUCT_TM___TM_GMTOFF */
/* Define to 1 if you have the <sysapi.h> header file. */
/* #undef HAVE_SYSAPI_H */
/* Define to 1 if you have the <sysgtime.h> header file. */
/* #undef HAVE_SYSGTIME_H */
/* Define to 1 if you have the <sys/file.h> header file. */
#define HAVE_SYS_FILE_H 1
/* Define to 1 if you have the <sys/ioctl.h> header file. */
#define HAVE_SYS_IOCTL_H 1
/* Define to 1 if you have the <sys/ipc.h> header file. */
#define HAVE_SYS_IPC_H 1
/* Define to 1 if you have the <sys/mman.h> header file. */
#define HAVE_SYS_MMAN_H 1
/* Define to 1 if you have the <sys/mutex.h> header file. */
#define HAVE_SYS_MUTEX_H 1
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/poll.h> header file. */
#define HAVE_SYS_POLL_H 1
/* Define to 1 if you have the <sys/random.h> header file. */
#define HAVE_SYS_RANDOM_H 1
/* Define to 1 if you have the <sys/resource.h> header file. */
#define HAVE_SYS_RESOURCE_H 1
/* Define to 1 if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define to 1 if you have the <sys/sem.h> header file. */
#define HAVE_SYS_SEM_H 1
/* Define to 1 if you have the <sys/sendfile.h> header file. */
/* #undef HAVE_SYS_SENDFILE_H */
/* Define to 1 if you have the <sys/shm.h> header file. */
#define HAVE_SYS_SHM_H 1
/* Define to 1 if you have the <sys/signal.h> header file. */
#define HAVE_SYS_SIGNAL_H 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/sockio.h> header file. */
#define HAVE_SYS_SOCKIO_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/syscall.h> header file. */
#define HAVE_SYS_SYSCALL_H 1
/* Define to 1 if you have the <sys/sysctl.h> header file. */
#define HAVE_SYS_SYSCTL_H 1
/* Define to 1 if you have the <sys/syslimits.h> header file. */
#define HAVE_SYS_SYSLIMITS_H 1
/* Define to 1 if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/uio.h> header file. */
#define HAVE_SYS_UIO_H 1
/* Define to 1 if you have the <sys/un.h> header file. */
#define HAVE_SYS_UN_H 1
/* Define to 1 if you have the <sys/uuid.h> header file. */
/* #undef HAVE_SYS_UUID_H */
/* Define to 1 if you have the <sys/wait.h> header file. */
#define HAVE_SYS_WAIT_H 1
/* Define if TCP_CORK is defined in netinet/tcp.h */
/* #undef HAVE_TCP_CORK */
/* Define if TCP_NODELAY and TCP_CORK can be enabled at the same time */
/* #undef HAVE_TCP_NODELAY_WITH_CORK */
/* Define if TCP_NOPUSH is defined in netinet/tcp.h */
#define HAVE_TCP_NOPUSH 1
/* Define to 1 if you have the <termios.h> header file. */
#define HAVE_TERMIOS_H 1
/* Define to 1 if you have the <time.h> header file. */
#define HAVE_TIME_H 1
/* Define to 1 if you have the <tpfeq.h> header file. */
/* #undef HAVE_TPFEQ_H */
/* Define to 1 if you have the <tpfio.h> header file. */
/* #undef HAVE_TPFIO_H */
/* Define if truerand is supported */
/* #undef HAVE_TRUERAND */
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the <unix.h> header file. */
/* #undef HAVE_UNIX_H */
/* Define to 1 if you have the `unsetenv' function. */
#define HAVE_UNSETENV 1
/* Define to 1 if you have the `utime' function. */
#define HAVE_UTIME 1
/* Define to 1 if you have the `utimes' function. */
#define HAVE_UTIMES 1
/* Define to 1 if you have the `uuid_create' function. */
#define HAVE_UUID_CREATE 1
/* Define to 1 if you have the `uuid_generate' function. */
/* #undef HAVE_UUID_GENERATE */
/* Define to 1 if you have the <uuid.h> header file. */
#define HAVE_UUID_H 1
/* Define to 1 if you have the <uuid/uuid.h> header file. */
/* #undef HAVE_UUID_UUID_H */
/* Compile in valgrind support */
/* #undef HAVE_VALGRIND */
/* Define to 1 if you have the <valgrind.h> header file. */
/* #undef HAVE_VALGRIND_H */
/* Define if C compiler supports VLA */
#define HAVE_VLA 1
/* Define to 1 if you have the `waitpid' function. */
#define HAVE_WAITPID 1
/* Define to 1 if you have the <windows.h> header file. */
/* #undef HAVE_WINDOWS_H */
/* Define to 1 if you have the <winsock2.h> header file. */
/* #undef HAVE_WINSOCK2_H */
/* Define to 1 if you have the `writev' function. */
#define HAVE_WRITEV 1
/* Define for z/OS pthread API nuances */
/* #undef HAVE_ZOS_PTHREADS */
/* Define to the sub-directory where libtool stores uninstalled libraries. */
#define LT_OBJDIR ".libs/"
/* Define if EAI_ error codes from getaddrinfo are negative */
/* #undef NEGATIVE_EAI */
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT ""
/* Define to the full name of this package. */
#define PACKAGE_NAME ""
/* Define to the full name and version of this package. */
#define PACKAGE_STRING ""
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME ""
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION ""
/* Define if POSIX semaphores affect threads within the process */
/* #undef POSIXSEM_IS_GLOBAL */
/* Define on PowerPC 405 where errata 77 applies */
/* #undef PPC405_ERRATA */
/* Define if pthread_attr_getdetachstate() has one arg */
/* #undef PTHREAD_ATTR_GETDETACHSTATE_TAKES_ONE_ARG */
/* Define if pthread_getspecific() has two args */
/* #undef PTHREAD_GETSPECIFIC_TAKES_TWO_ARGS */
/* Modern readdir is thread safe */
#define READDIR_IS_THREAD_SAFE 1
/* Define to 1 if the `setpgrp' function takes no argument. */
/* #undef SETPGRP_VOID */
/* */
/* #undef SIGWAIT_TAKES_ONE_ARG */
/* The size of `char', as computed by sizeof. */
#define SIZEOF_CHAR 1
/* The size of ino_t */
#if __FreeBSD__ >= 12
#define SIZEOF_INO_T 8
#else
#define SIZEOF_INO_T 4
#endif
/* The size of `int', as computed by sizeof. */
#define SIZEOF_INT 4
/* The size of `long', as computed by sizeof. */
#define SIZEOF_LONG 8
/* The size of `long long', as computed by sizeof. */
#define SIZEOF_LONG_LONG 8
/* The size of off_t */
#define SIZEOF_OFF_T 8
/* The size of pid_t */
#define SIZEOF_PID_T 4
/* The size of `short', as computed by sizeof. */
#define SIZEOF_SHORT 2
/* The size of size_t */
#define SIZEOF_SIZE_T 8
/* The size of ssize_t */
#define SIZEOF_SSIZE_T 8
/* The size of struct iovec */
#define SIZEOF_STRUCT_IOVEC 16
/* The size of `void*', as computed by sizeof. */
#define SIZEOF_VOIDP 8
/* If using the C implementation of alloca, define if you know the
direction of stack growth for your system; otherwise it will be
automatically deduced at runtime.
STACK_DIRECTION > 0 => grows toward higher addresses
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown */
/* #undef STACK_DIRECTION */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define if strerror returns int */
#define STRERROR_R_RC_INT 1
/* Define if SysV semaphores affect threads within the process */
/* #undef SYSVSEM_IS_GLOBAL */
/* Define system call of random */
#define SYS_RANDOM "getrandom"
/* Define if use of generic atomics is requested */
/* #undef USE_ATOMICS_GENERIC */
/* Define if BeOS Semaphores will be used */
/* #undef USE_BEOSSEM */
/* Define if SVR4-style fcntl() will be used */
/* #undef USE_FCNTL_SERIALIZE */
/* Define if 4.2BSD-style flock() will be used */
#define USE_FLOCK_SERIALIZE 1
/* Define if pthread pshared mutex will be used */
/* #undef USE_PROC_PTHREAD_SERIALIZE */
/* Define if BeOS areas will be used */
/* #undef USE_SHMEM_BEOS */
/* Define if BeOS areas will be used */
/* #undef USE_SHMEM_BEOS_ANON */
/* Define if 4.4BSD-style mmap() via MAP_ANON will be used */
#define USE_SHMEM_MMAP_ANON 1
/* Define if mmap() via POSIX.1 shm_open() on temporary file will be used */
/* #undef USE_SHMEM_MMAP_SHM */
/* Define if Classical mmap() on temporary file will be used */
/* #undef USE_SHMEM_MMAP_TMP */
/* Define if SVR4-style mmap() on /dev/zero will be used */
/* #undef USE_SHMEM_MMAP_ZERO */
/* Define if OS/2 DosAllocSharedMem() will be used */
/* #undef USE_SHMEM_OS2 */
/* Define if OS/2 DosAllocSharedMem() will be used */
/* #undef USE_SHMEM_OS2_ANON */
/* Define if SysV IPC shmget() will be used */
#define USE_SHMEM_SHMGET 1
/* Define if SysV IPC shmget() will be used */
/* #undef USE_SHMEM_SHMGET_ANON */
/* Define if Windows shared memory will be used */
/* #undef USE_SHMEM_WIN32 */
/* Define if Windows CreateFileMapping() will be used */
/* #undef USE_SHMEM_WIN32_ANON */
/* Enable extensions on AIX 3, Interix. */
#ifndef _ALL_SOURCE
# define _ALL_SOURCE 1
#endif
/* Enable GNU extensions on systems that have them. */
#ifndef _GNU_SOURCE
# define _GNU_SOURCE 1
#endif
/* Enable threading extensions on Solaris. */
#ifndef _POSIX_PTHREAD_SEMANTICS
# define _POSIX_PTHREAD_SEMANTICS 1
#endif
/* Enable extensions on HP NonStop. */
#ifndef _TANDEM_SOURCE
# define _TANDEM_SOURCE 1
#endif
/* Enable general extensions on Solaris. */
#ifndef __EXTENSIONS__
# define __EXTENSIONS__ 1
#endif
/* Define if SysV IPC semget() will be used */
/* #undef USE_SYSVSEM_SERIALIZE */
/* Define if apr_wait_for_io_or_timeout() uses poll(2) */
#define WAITIO_USES_POLL 1
/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most
significant byte first (like Motorola and SPARC, unlike Intel). */
#if defined AC_APPLE_UNIVERSAL_BUILD
# if defined __BIG_ENDIAN__
# define WORDS_BIGENDIAN 1
# endif
#else
# ifndef WORDS_BIGENDIAN
/* # undef WORDS_BIGENDIAN */
# endif
#endif
/* Define to 1 if on MINIX. */
/* #undef _MINIX */
/* Define to 2 if the system does not provide POSIX.1 features except with
this defined. */
/* #undef _POSIX_1_SOURCE */
/* Define to 1 if you need to in order for `stat' and other things to work. */
/* #undef _POSIX_SOURCE */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef gid_t */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define to `long int' if <sys/types.h> does not define. */
/* #undef off_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef ssize_t */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef uid_t */
/* switch this on if we have a BeOS version below BONE */
#if defined(BEOS) && !defined(HAVE_BONE_VERSION)
#define BEOS_R5 1
#else
#define BEOS_BONE 1
#endif
/*
* Darwin 10's default compiler (gcc42) builds for both 64 and
* 32 bit architectures unless specifically told not to.
* In those cases, we need to override types depending on how
* we're being built at compile time.
* NOTE: This is an ugly work-around for Darwin's
* concept of universal binaries, a single package
* (executable, lib, etc...) which contains both 32
* and 64 bit versions. The issue is that if APR is
* built universally, if something else is compiled
* against it, some bit sizes will depend on whether
* it is 32 or 64 bit. This is determined by the __LP64__
* flag. Since we need to support both, we have to
* handle OS X unqiuely.
*/
#ifdef DARWIN_10
#define APR_OFF_T_STRFN strtol
#define APR_INT64_STRFN strtol
#define SIZEOF_LONG 8
#define SIZEOF_SIZE_T 8
#define SIZEOF_SSIZE_T 8
#define SIZEOF_VOIDP 8
#define SIZEOF_STRUCT_IOVEC 16
#ifdef __LP64__
#define APR_INT64_STRFN strtol
#define SIZEOF_LONG 8
#define SIZEOF_SIZE_T 8
#define SIZEOF_SSIZE_T 8
#define SIZEOF_VOIDP 8
#define SIZEOF_STRUCT_IOVEC 16
#else
#define APR_INT64_STRFN strtol
#define SIZEOF_LONG 8
#define SIZEOF_SIZE_T 8
#define SIZEOF_SSIZE_T 8
#define SIZEOF_VOIDP 8
#define SIZEOF_STRUCT_IOVEC 16
#endif
#define APR_OFF_T_STRFN strtol
#define APR_OFF_T_STRFN strtol
/* #undef SETPGRP_VOID */
#ifdef __DARWIN_UNIX03
#define SETPGRP_VOID 1
#else
/* #undef SETPGRP_VOID */
#endif
#endif /* DARWIN_10 */
/*
* Include common private declarations.
*/
#include "../apr_private_common.h"
#endif /* APR_PRIVATE_H */
diff --git a/usr.bin/svn/lib/libapr_util/apr_ldap.h b/usr.bin/svn/lib/libapr_util/apr_ldap.h
index 27a96de7087c..bd328537c988 100644
--- a/usr.bin/svn/lib/libapr_util/apr_ldap.h
+++ b/usr.bin/svn/lib/libapr_util/apr_ldap.h
@@ -1,198 +1,197 @@
-/* $FreeBSD$ */
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* apr_ldap.h is generated from apr_ldap.h.in by configure -- do not edit apr_ldap.h
*/
/**
* @file apr_ldap.h
* @brief APR-UTIL LDAP
*/
#ifndef APU_LDAP_H
#define APU_LDAP_H
/**
* @defgroup APR_Util_LDAP LDAP
* @ingroup APR_Util
* @{
*/
/* this will be defined if LDAP support was compiled into apr-util */
#define APR_HAS_LDAP 0
/* identify the LDAP toolkit used */
#define APR_HAS_NETSCAPE_LDAPSDK 0
#define APR_HAS_SOLARIS_LDAPSDK 0
#define APR_HAS_NOVELL_LDAPSDK 0
#define APR_HAS_MOZILLA_LDAPSDK 0
#define APR_HAS_OPENLDAP_LDAPSDK 0
#define APR_HAS_MICROSOFT_LDAPSDK 0
#define APR_HAS_TIVOLI_LDAPSDK 0
#define APR_HAS_ZOS_LDAPSDK 0
#define APR_HAS_OTHER_LDAPSDK 0
/*
* Handle the case when LDAP is enabled
*/
#if APR_HAS_LDAP
/*
* The following #defines are DEPRECATED and should not be used for
* anything. They remain to maintain binary compatibility.
* The original code defined the OPENLDAP SDK as present regardless
* of what really was there, which was way bogus. In addition, the
* apr_ldap_url_parse*() functions have been rewritten specifically for
* APR, so the APR_HAS_LDAP_URL_PARSE macro is forced to zero.
*/
#if APR_HAS_TIVOLI_LDAPSDK
#define APR_HAS_LDAP_SSL 0
#else
#define APR_HAS_LDAP_SSL 1
#endif
#define APR_HAS_LDAP_URL_PARSE 0
#if APR_HAS_OPENLDAP_LDAPSDK && !defined(LDAP_DEPRECATED)
/* Ensure that the "deprecated" interfaces are still exposed
* with OpenLDAP >= 2.3; these were exposed by default in earlier
* releases. */
#define LDAP_DEPRECATED 1
#endif
/*
* Include the standard LDAP header files.
*/
/*
* Detected standard functions
*/
#define APR_HAS_LDAPSSL_CLIENT_INIT 0
#define APR_HAS_LDAPSSL_CLIENT_DEINIT 0
#define APR_HAS_LDAPSSL_ADD_TRUSTED_CERT 0
#define APR_HAS_LDAP_START_TLS_S 0
#define APR_HAS_LDAP_SSLINIT 0
#define APR_HAS_LDAPSSL_INIT 0
#define APR_HAS_LDAPSSL_INSTALL_ROUTINES 0
/*
* Make sure the secure LDAP port is defined
*/
#ifndef LDAPS_PORT
#define LDAPS_PORT 636 /* ldaps:/// default LDAP over TLS port */
#endif
/*
* For ldap function calls that input a size limit on the number of returned elements
* Some SDKs do not have the define for LDAP_DEFAULT_LIMIT (-1) or LDAP_NO_LIMIT (0)
* LDAP_DEFAULT_LIMIT is preferred as it allows inheritance from whatever the SDK
* or process is configured for.
*/
#ifdef LDAP_DEFAULT_LIMIT
#define APR_LDAP_SIZELIMIT LDAP_DEFAULT_LIMIT
#else
#ifdef LDAP_NO_LIMIT
#define APR_LDAP_SIZELIMIT LDAP_NO_LIMIT
#endif
#endif
#ifndef APR_LDAP_SIZELIMIT
#define APR_LDAP_SIZELIMIT 0 /* equivalent to LDAP_NO_LIMIT, and what goes on the wire */
#endif
/*
* z/OS is missing some defines
*/
#ifndef LDAP_VERSION_MAX
#define LDAP_VERSION_MAX LDAP_VERSION
#endif
#if APR_HAS_ZOS_LDAPSDK
#define LDAP_VENDOR_NAME "IBM z/OS"
#endif
/* Note: Macros defining const casting has been removed in APR v1.0,
* pending real support for LDAP v2.0 toolkits.
*
* In the mean time, please use an LDAP v3.0 toolkit.
*/
#if LDAP_VERSION_MAX <= 2
#error Support for LDAP v2.0 toolkits has been removed from apr-util. Please use an LDAP v3.0 toolkit.
#endif
#ifdef __cplusplus
extern "C" {
#endif /* __cplusplus */
/**
* This structure allows the C LDAP API error codes to be returned
* along with plain text error messages that explain to us mere mortals
* what really happened.
*/
typedef struct apr_ldap_err_t {
const char *reason;
const char *msg;
int rc;
} apr_ldap_err_t;
#ifdef __cplusplus
}
#endif
/* The MS SDK returns LDAP_UNAVAILABLE when the backend has closed the connection
* between LDAP calls. Protect with APR_HAS_MICROSOFT_LDAPSDK in case someone
* manually chooses another SDK on Windows
*/
#if APR_HAS_MICROSOFT_LDAPSDK
#define APR_LDAP_IS_SERVER_DOWN(s) ((s) == LDAP_SERVER_DOWN \
|| (s) == LDAP_UNAVAILABLE)
#else
#define APR_LDAP_IS_SERVER_DOWN(s) ((s) == LDAP_SERVER_DOWN)
#endif
/* These symbols are not actually exported in a DSO build, but mapped into
* a private exported function array for apr_ldap_stub to bind dynamically.
* Rename them appropriately to protect the global namespace.
*/
#ifdef APU_DSO_LDAP_BUILD
#define apr_ldap_info apr__ldap_info
#define apr_ldap_init apr__ldap_init
#define apr_ldap_ssl_init apr__ldap_ssl_init
#define apr_ldap_ssl_deinit apr__ldap_ssl_deinit
#define apr_ldap_get_option apr__ldap_get_option
#define apr_ldap_set_option apr__ldap_set_option
#define apr_ldap_rebind_init apr__ldap_rebind_init
#define apr_ldap_rebind_add apr__ldap_rebind_add
#define apr_ldap_rebind_remove apr__ldap_rebind_remove
#define APU_DECLARE_LDAP(type) type
#else
#define APU_DECLARE_LDAP(type) APU_DECLARE(type)
#endif
#include "apr_ldap_url.h"
#include "apr_ldap_init.h"
#include "apr_ldap_option.h"
#include "apr_ldap_rebind.h"
#endif /* APR_HAS_LDAP */
/** @} */
#endif /* APU_LDAP_H */
diff --git a/usr.bin/svn/lib/libapr_util/apu.h b/usr.bin/svn/lib/libapr_util/apu.h
index 875e28c05e74..5964b627a00e 100644
--- a/usr.bin/svn/lib/libapr_util/apu.h
+++ b/usr.bin/svn/lib/libapr_util/apu.h
@@ -1,131 +1,130 @@
-/* $FreeBSD$ */
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* apu.h is generated from apu.h.in by configure -- do not edit apu.h
*/
/* @file apu.h
* @brief APR-Utility main file
*/
/**
* @defgroup APR_Util APR Utility Functions
* @{
*/
#ifndef APU_H
#define APU_H
/**
* APU_DECLARE_EXPORT is defined when building the APR-UTIL dynamic library,
* so that all public symbols are exported.
*
* APU_DECLARE_STATIC is defined when including the APR-UTIL public headers,
* to provide static linkage when the dynamic library may be unavailable.
*
* APU_DECLARE_STATIC and APU_DECLARE_EXPORT are left undefined when
* including the APR-UTIL public headers, to import and link the symbols from
* the dynamic APR-UTIL library and assure appropriate indirection and calling
* conventions at compile time.
*/
#if defined(DOXYGEN) || !defined(WIN32)
/**
* The public APR-UTIL functions are declared with APU_DECLARE(), so they may
* use the most appropriate calling convention. Public APR functions with
* variable arguments must use APU_DECLARE_NONSTD().
*
* @fn APU_DECLARE(rettype) apr_func(args);
*/
#define APU_DECLARE(type) type
/**
* The public APR-UTIL functions using variable arguments are declared with
* APU_DECLARE_NONSTD(), as they must use the C language calling convention.
*
* @fn APU_DECLARE_NONSTD(rettype) apr_func(args, ...);
*/
#define APU_DECLARE_NONSTD(type) type
/**
* The public APR-UTIL variables are declared with APU_DECLARE_DATA.
* This assures the appropriate indirection is invoked at compile time.
*
* @fn APU_DECLARE_DATA type apr_variable;
* @note APU_DECLARE_DATA extern type apr_variable; syntax is required for
* declarations within headers to properly import the variable.
*/
#define APU_DECLARE_DATA
#elif defined(APU_DECLARE_STATIC)
#define APU_DECLARE(type) type __stdcall
#define APU_DECLARE_NONSTD(type) type __cdecl
#define APU_DECLARE_DATA
#elif defined(APU_DECLARE_EXPORT)
#define APU_DECLARE(type) __declspec(dllexport) type __stdcall
#define APU_DECLARE_NONSTD(type) __declspec(dllexport) type __cdecl
#define APU_DECLARE_DATA __declspec(dllexport)
#else
#define APU_DECLARE(type) __declspec(dllimport) type __stdcall
#define APU_DECLARE_NONSTD(type) __declspec(dllimport) type __cdecl
#define APU_DECLARE_DATA __declspec(dllimport)
#endif
#if !defined(WIN32) || defined(APU_MODULE_DECLARE_STATIC)
/**
* Declare a dso module's exported module structure as APU_MODULE_DECLARE_DATA.
*
* Unless APU_MODULE_DECLARE_STATIC is defined at compile time, symbols
* declared with APU_MODULE_DECLARE_DATA are always exported.
* @code
* module APU_MODULE_DECLARE_DATA mod_tag
* @endcode
*/
#define APU_MODULE_DECLARE_DATA
#else
#define APU_MODULE_DECLARE_DATA __declspec(dllexport)
#endif
/*
* we always have SDBM (it's in our codebase)
*/
#define APU_HAVE_SDBM 1
#define APU_HAVE_GDBM 0
#define APU_HAVE_NDBM 0
#define APU_HAVE_DB 0
#if APU_HAVE_DB
#define APU_HAVE_DB_VERSION 0
#endif
#define APU_HAVE_PGSQL 0
#define APU_HAVE_MYSQL 0
#define APU_HAVE_SQLITE3 0
#define APU_HAVE_SQLITE2 0
#define APU_HAVE_ORACLE 0
#define APU_HAVE_ODBC 0
#define APU_HAVE_CRYPTO 1
#define APU_HAVE_OPENSSL 1
#define APU_HAVE_NSS 0
#define APU_HAVE_COMMONCRYPTO 0
#define APU_HAVE_APR_ICONV 0
#ifndef APU_HAVE_ICONV
#define APU_HAVE_ICONV 0
#endif
#define APR_HAS_XLATE (APU_HAVE_APR_ICONV || APU_HAVE_ICONV)
#endif /* APU_H */
/** @} */
diff --git a/usr.bin/svn/lib/libapr_util/apu_config.h b/usr.bin/svn/lib/libapr_util/apu_config.h
index 1e709f71da7e..d886d5eeea02 100644
--- a/usr.bin/svn/lib/libapr_util/apu_config.h
+++ b/usr.bin/svn/lib/libapr_util/apu_config.h
@@ -1,183 +1,182 @@
-/* $FreeBSD$ */
/* include/private/apu_config.h. Generated from apu_config.h.in by configure. */
/* include/private/apu_config.h.in. Generated from configure.in by autoheader. */
/* Define if the system crypt() function is threadsafe */
/* #undef APU_CRYPT_THREADSAFE */
/* Define to 1 if modular components are built as DSOs */
/* #undef APU_DSO_BUILD */
/* Define to be absolute path to DSO directory */
/* #undef APU_DSO_LIBDIR */
/* Define if the inbuf parm to iconv() is const char ** */
/* #undef APU_ICONV_INBUF_CONST */
/* Define that OpenSSL uses const buffers */
#define CRYPTO_OPENSSL_CONST_BUFFERS 1
/* Define if crypt_r has uses CRYPTD */
/* #undef CRYPT_R_CRYPTD */
/* Define if crypt_r uses struct crypt_data */
/* #undef CRYPT_R_STRUCT_CRYPT_DATA */
/* Define if CODESET is defined in langinfo.h */
#define HAVE_CODESET 1
/* Define to 1 if you have the <CommonCrypto/CommonKeyDerivation.h> header
file. */
/* #undef HAVE_COMMONCRYPTO_COMMONKEYDERIVATION_H */
/* Define to 1 if you have the `crypt_r' function. */
/* #undef HAVE_CRYPT_R */
/* Define to 1 if you have the declaration of `EVP_PKEY_CTX_new', and to 0 if
you don't. */
#define HAVE_DECL_EVP_PKEY_CTX_NEW 1
/* Define if expat.h is available */
#define HAVE_EXPAT_H 1
/* Define to 1 if you have the <iconv.h> header file. */
/* #undef HAVE_ICONV_H */
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the <langinfo.h> header file. */
#define HAVE_LANGINFO_H 1
/* Define to 1 if you have the <lber.h> header file. */
/* #undef HAVE_LBER_H */
/* Defined if ldap.h is present */
/* #undef HAVE_LDAP_H */
/* Define to 1 if you have the <ldap_ssl.h> header file. */
/* #undef HAVE_LDAP_SSL_H */
/* Define to 1 if you have the <libpq-fe.h> header file. */
/* #undef HAVE_LIBPQ_FE_H */
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define if memset_s function is supported */
#define HAVE_MEMSET_S 1
/* Define to 1 if you have the <mysql.h> header file. */
/* #undef HAVE_MYSQL_H */
/* Define to 1 if you have the <mysql/mysql.h> header file. */
/* #undef HAVE_MYSQL_MYSQL_H */
/* Define to 1 if you have the <mysql/my_global.h> header file. */
/* #undef HAVE_MYSQL_MY_GLOBAL_H */
/* Define to 1 if you have the <mysql/my_sys.h> header file. */
/* #undef HAVE_MYSQL_MY_SYS_H */
/* Define to 1 if you have the <my_global.h> header file. */
/* #undef HAVE_MY_GLOBAL_H */
/* Define to 1 if you have the <my_sys.h> header file. */
/* #undef HAVE_MY_SYS_H */
/* Define to 1 if you have the `nl_langinfo' function. */
#define HAVE_NL_LANGINFO 1
/* Define to 1 if you have the <nss.h> header file. */
/* #undef HAVE_NSS_H */
/* Define to 1 if you have the <nss/nss.h> header file. */
/* #undef HAVE_NSS_NSS_H */
/* Define to 1 if you have the <nss/pk11pub.h> header file. */
/* #undef HAVE_NSS_PK11PUB_H */
/* Define to 1 if you have the <oci.h> header file. */
/* #undef HAVE_OCI_H */
/* Define to 1 if you have the <odbc/sql.h> header file. */
/* #undef HAVE_ODBC_SQL_H */
/* Define to 1 if you have the <openssl/x509.h> header file. */
#define HAVE_OPENSSL_X509_H 1
/* Define to 1 if you have the <pk11pub.h> header file. */
/* #undef HAVE_PK11PUB_H */
/* Define to 1 if you have the <postgresql/libpq-fe.h> header file. */
/* #undef HAVE_POSTGRESQL_LIBPQ_FE_H */
/* Define to 1 if you have the <prerror.h> header file. */
/* #undef HAVE_PRERROR_H */
/* Define to 1 if you have the <sqlite3.h> header file. */
/* #undef HAVE_SQLITE3_H */
/* Define to 1 if you have the <sqlite.h> header file. */
/* #undef HAVE_SQLITE_H */
/* Define to 1 if you have the <sql.h> header file. */
/* #undef HAVE_SQL_H */
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define if compiler handles weak symbols */
#define HAVE_WEAK_SYMBOLS 1
/* Define if xmlparse/xmlparse.h is available */
/* #undef HAVE_XMLPARSE_XMLPARSE_H */
/* Define if xmltok/xmlparse.h is available */
/* #undef HAVE_XMLTOK_XMLPARSE_H */
/* Define if xml/xmlparse.h is available */
/* #undef HAVE_XML_XMLPARSE_H */
/* Define if ldap_set_rebind_proc takes three arguments */
/* #undef LDAP_SET_REBIND_PROC_THREE */
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT ""
/* Define to the full name of this package. */
#define PACKAGE_NAME ""
/* Define to the full name and version of this package. */
#define PACKAGE_STRING ""
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME ""
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION ""
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
diff --git a/usr.bin/svn/lib/libapr_util/apu_select_dbm.h b/usr.bin/svn/lib/libapr_util/apu_select_dbm.h
index cf756e9603a3..09a5d4c0bb47 100644
--- a/usr.bin/svn/lib/libapr_util/apu_select_dbm.h
+++ b/usr.bin/svn/lib/libapr_util/apu_select_dbm.h
@@ -1,30 +1,29 @@
-/* $FreeBSD$ */
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef APU_SELECT_DBM_H
#define APU_SELECT_DBM_H
/*
** The following macros control what features APRUTIL will use
*/
#define APU_USE_SDBM 1
#define APU_USE_NDBM 0
#define APU_USE_GDBM 0
#define APU_USE_DB 0
#endif /* !APU_SELECT_DBM_H */
diff --git a/usr.bin/svn/lib/libapr_util/apu_want.h b/usr.bin/svn/lib/libapr_util/apu_want.h
index 7d6316c55391..0f2a0653e69a 100644
--- a/usr.bin/svn/lib/libapr_util/apu_want.h
+++ b/usr.bin/svn/lib/libapr_util/apu_want.h
@@ -1,53 +1,52 @@
-/* $FreeBSD$ */
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "apu.h" /* configuration data */
/**
* @file apu_want.h
* @brief APR Standard Headers Support
*
* <PRE>
* Features:
*
* APU_WANT_DB: <db.h>
*
* Typical usage:
*
* #define APU_WANT_DB
* #include "apu_want.h"
*
* The appropriate headers will be included.
*
* Note: it is safe to use this in a header (it won't interfere with other
* headers' or source files' use of apu_want.h)
* </PRE>
*/
/* --------------------------------------------------------------------- */
#ifdef APU_WANT_DB
#if APU_HAVE_DB
#include <db.h>
#endif
#undef APU_WANT_DB
#endif
/* --------------------------------------------------------------------- */
diff --git a/usr.bin/svn/lib/libapr_util/expat.h b/usr.bin/svn/lib/libapr_util/expat.h
index 6ab04ef19656..1c237cb196be 100644
--- a/usr.bin/svn/lib/libapr_util/expat.h
+++ b/usr.bin/svn/lib/libapr_util/expat.h
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
/* Hack to avoid changing vendor code */
#include <bsdxml.h>
diff --git a/usr.bin/svn/svn_private_config.h b/usr.bin/svn/svn_private_config.h
index d748e077183c..fd06ec15e86c 100644
--- a/usr.bin/svn/svn_private_config.h
+++ b/usr.bin/svn/svn_private_config.h
@@ -1,319 +1,318 @@
-/* $FreeBSD$ */
/* subversion/svn_private_config.h.tmp. Generated from svn_private_config.h.in by configure. */
/* subversion/svn_private_config.h.in. Generated from configure.ac by autoheader. */
/* The fs type to use by default */
#define DEFAULT_FS_TYPE "fsfs"
/* The http library to use by default */
#define DEFAULT_HTTP_LIBRARY "serf"
/* Define to 1 if Ev2 implementations should be used. */
/* #undef ENABLE_EV2_IMPL */
/* Define to 1 if translation of program messages to the user's native
language is requested. */
/* #undef ENABLE_NLS */
/* Define to 1 if you have the `bind_textdomain_codeset' function. */
/* #undef HAVE_BIND_TEXTDOMAIN_CODESET */
/* define if the Boost library is available */
/* #undef HAVE_BOOST */
/* define if the Boost::Unit_Test_Framework library is available */
/* #undef HAVE_BOOST_UNIT_TEST_FRAMEWORK */
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */
/* #undef HAVE_DOPRNT */
/* Define to 1 if you have the <elf.h> header file. */
#define HAVE_ELF_H 1
/* Define to 1 if you have the `getpid' function. */
#define HAVE_GETPID 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the `iconv' library (-liconv). */
/* #undef HAVE_LIBICONV */
/* Define to 1 if you have the `socket' library (-lsocket). */
/* #undef HAVE_LIBSOCKET */
/* Define to 1 if you have the <magic.h> header file. */
/* #undef HAVE_MAGIC_H */
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the <py3c.h> header file. */
/* #undef HAVE_PY3C_H */
/* Define to 1 if you have the `rb_errinfo' function. */
/* #undef HAVE_RB_ERRINFO */
/* Define to 1 if you have the `readlink' function. */
#define HAVE_READLINK 1
/* Define to 1 if you have the <serf.h> header file. */
#define HAVE_SERF_H 1
/* Define to 1 if you have the <stdbool.h> header file. */
#define HAVE_STDBOOL_H 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `symlink' function. */
#define HAVE_SYMLINK 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/utsname.h> header file. */
#define HAVE_SYS_UTSNAME_H 1
/* Define to 1 if you have the `tcgetattr' function. */
#define HAVE_TCGETATTR 1
/* Define to 1 if you have the `tcsetattr' function. */
#define HAVE_TCSETATTR 1
/* Defined if we have a usable termios library. */
#define HAVE_TERMIOS_H 1
/* Define to 1 if you have the `uname' function. */
#define HAVE_UNAME 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `vprintf' function. */
#define HAVE_VPRINTF 1
/* Define to 1 if you have the <zlib.h> header file. */
/* #undef HAVE_ZLIB_H */
/* Define to the sub-directory where libtool stores uninstalled libraries. */
#define LT_OBJDIR ".libs/"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "http://subversion.apache.org/"
/* Define to the full name of this package. */
#define PACKAGE_NAME "subversion"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "subversion 1.14.1"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "subversion"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "1.14.1"
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Defined to build against httpd 2.4 with broken auth */
/* #undef SVN_ALLOW_BROKEN_HTTPD_AUTH */
/* Defined to be the path to the installed binaries */
#define SVN_BINDIR "/usr/bin"
/* Defined to the config.guess name of the build system */
#define SVN_BUILD_HOST "bikeshed-rgb-freebsd"
/* Defined to the config.guess name of the build target */
#define SVN_BUILD_TARGET "bikeshed-rgb-freebsd"
/* The path of a default editor for the client. */
/* #undef SVN_CLIENT_EDITOR */
/* Defined if the full version matching rules are disabled */
/* #undef SVN_DISABLE_FULL_VERSION_MATCH */
/* Defined if plaintext password/passphrase storage is disabled */
/* #undef SVN_DISABLE_PLAINTEXT_PASSWORD_STORAGE */
/* Shared library file name suffix format */
/* #undef SVN_DSO_SUFFIX_FMT */
/* The desired major version for the Berkeley DB */
#define SVN_FS_WANT_DB_MAJOR 4
/* The desired minor version for the Berkeley DB */
#define SVN_FS_WANT_DB_MINOR 0
/* The desired patch version for the Berkeley DB */
#define SVN_FS_WANT_DB_PATCH 14
/* Define if compiler provides atomic builtins */
/* #undef SVN_HAS_ATOMIC_BUILTINS */
/* Is GNOME Keyring support enabled? */
/* #undef SVN_HAVE_GNOME_KEYRING */
/* Is GPG Agent support enabled? */
#define SVN_HAVE_GPG_AGENT 1
/* Is Mac OS KeyChain support enabled? */
/* #undef SVN_HAVE_KEYCHAIN_SERVICES */
/* Defined if KF5 available */
/* #undef SVN_HAVE_KF5 */
/* Defined if KWallet support is enabled */
/* #undef SVN_HAVE_KWALLET */
/* Defined if libmagic support is enabled */
#define SVN_HAVE_LIBMAGIC 1
/* Is libsecret support enabled? */
/* #undef SVN_HAVE_LIBSECRET */
/* Is Mach-O low-level _dyld API available? */
/* #undef SVN_HAVE_MACHO_ITERATE */
/* Is Mac OS property list API available? */
/* #undef SVN_HAVE_MACOS_PLIST */
/* Defined if apr_memcache (standalone or in apr-util) is present */
#define SVN_HAVE_MEMCACHE 1
/* Defined if Expat 1.0 or 1.1 was found */
/* #undef SVN_HAVE_OLD_EXPAT */
/* Defined if Cyrus SASL v2 is present on the system */
/* #undef SVN_HAVE_SASL */
/* Defined if support for Serf is enabled */
#define SVN_HAVE_SERF 1
/* Define to use internal LZ4 code */
#define SVN_INTERNAL_LZ4 1
/* Define to use internal UTF8PROC code */
#define SVN_INTERNAL_UTF8PROC 1
/* Defined if libsvn_fs should link against libsvn_fs_base */
/* #undef SVN_LIBSVN_FS_LINKS_FS_BASE */
/* Defined if libsvn_fs should link against libsvn_fs_fs */
#define SVN_LIBSVN_FS_LINKS_FS_FS 1
/* Defined if libsvn_fs should link against libsvn_fs_x */
#define SVN_LIBSVN_FS_LINKS_FS_X 1
/* Defined if libsvn_ra should link against libsvn_ra_local */
#define SVN_LIBSVN_RA_LINKS_RA_LOCAL 1
/* Defined if libsvn_ra should link against libsvn_ra_serf */
#define SVN_LIBSVN_RA_LINKS_RA_SERF 1
/* Defined if libsvn_ra should link against libsvn_ra_svn */
#define SVN_LIBSVN_RA_LINKS_RA_SVN 1
/* Defined to be the path to the installed locale dirs */
#define SVN_LOCALE_DIR "NONE/share/locale"
/* Defined to be the null device for the system */
#define SVN_NULL_DEVICE_NAME "/dev/null"
/* Defined to be the path separator used on your local filesystem */
#define SVN_PATH_LOCAL_SEPARATOR '/'
/* Subversion library major verson */
#define SVN_SOVERSION 0
/* Defined if svn should use the amalgamated version of sqlite */
/* #undef SVN_SQLITE_INLINE */
/* Defined if svn should try to load DSOs */
/* #undef SVN_USE_DSO */
/* Defined to build with patched httpd 2.4 and working auth */
/* #undef SVN_USE_FORCE_AUTHN */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
#ifdef SVN_WANT_BDB
#define APU_WANT_DB
#endif
/* Indicate to translators that string X should be translated. Do not look
up the translation at run time; just expand to X. This macro is suitable
for use where a constant string is required at compile time. */
#define N_(x) x
/* Indicate to translators that we have decided the string X should not be
translated. Expand to X. */
#define U_(x) x
#ifdef ENABLE_NLS
#include <locale.h>
#include <libintl.h>
/* Indicate to translators that string X should be translated. At run time,
look up and return the translation of X. */
#define _(x) dgettext(PACKAGE_NAME, x)
/* Indicate to translators that strings X1 and X2 are singular and plural
forms of the same message, and should be translated. At run time, return
an appropriate translation depending on the number N. */
#define Q_(x1, x2, n) dngettext(PACKAGE_NAME, x1, x2, n)
#else
#define _(x) (x)
#define Q_(x1, x2, n) (((n) == 1) ? x1 : x2)
#define gettext(x) (x)
#define dgettext(domain, x) (x)
#endif
/* compiler hints */
#if defined(__GNUC__) && (__GNUC__ >= 3)
# define SVN__PREDICT_FALSE(x) (__builtin_expect(x, 0))
# define SVN__PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
#else
# define SVN__PREDICT_FALSE(x) (x)
# define SVN__PREDICT_TRUE(x) (x)
#endif
#if defined(SVN_DEBUG)
# define SVN__FORCE_INLINE
# define SVN__PREVENT_INLINE
#elif defined(__GNUC__)
# define SVN__FORCE_INLINE APR_INLINE __attribute__ ((always_inline))
# define SVN__PREVENT_INLINE __attribute__ ((noinline))
#else
# define SVN__FORCE_INLINE APR_INLINE
# define SVN__PREVENT_INLINE
#endif
/* Macro used to specify that a variable is intentionally left unused.
Supresses compiler warnings about the variable being unused. */
#define SVN_UNUSED(v) ( (void)(v) )
diff --git a/usr.bin/tip/tip/pathnames.h b/usr.bin/tip/tip/pathnames.h
index a42aed3f7368..8a2f9195032f 100644
--- a/usr.bin/tip/tip/pathnames.h
+++ b/usr.bin/tip/tip/pathnames.h
@@ -1,43 +1,42 @@
/* $OpenBSD: pathnames.h,v 1.3 2003/06/03 02:56:18 millert Exp $ */
/* $NetBSD: pathnames.h,v 1.3 1994/12/08 09:30:59 jtc Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)pathnames.h 8.1 (Berkeley) 6/6/93
*/
#include <paths.h>
#define _PATH_ACULOG "/var/log/aculog"
#define _PATH_LOCKDIRNAME "/var/spool/lock/LCK..%s"
#define _PATH_PHONES "/etc/phones"
#define _PATH_REMOTE "/etc/remote"
diff --git a/usr.bin/tip/tip/tip.h b/usr.bin/tip/tip/tip.h
index 51178cb08365..3da2f76cfe39 100644
--- a/usr.bin/tip/tip/tip.h
+++ b/usr.bin/tip/tip/tip.h
@@ -1,360 +1,359 @@
/* $OpenBSD: tip.h,v 1.27 2006/08/18 03:06:18 jason Exp $ */
/* $NetBSD: tip.h,v 1.7 1997/04/20 00:02:46 mellon Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* @(#)tip.h 8.1 (Berkeley) 6/6/93
*/
/*
* tip - terminal interface program
*/
#include <sys/types.h>
#include <sys/file.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <sys/ioctl.h>
#include <termios.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pwd.h>
#include <ctype.h>
#include <setjmp.h>
#include <unistd.h>
#include <errno.h>
#include <limits.h>
#ifndef EXTERN
#define EXTERN extern
#endif
/*
* Remote host attributes
*/
EXTERN char *DV; /* UNIX device(s) to open */
EXTERN char *EL; /* chars marking an EOL */
EXTERN char *CM; /* initial connection message */
EXTERN char *IE; /* EOT to expect on input */
EXTERN char *OE; /* EOT to send to complete FT */
EXTERN char *CU; /* call unit if making a phone call */
EXTERN char *AT; /* acu type */
EXTERN char *PN; /* phone number(s) */
EXTERN char *DI; /* disconnect string */
EXTERN char *PA; /* parity to be generated */
EXTERN char *PH; /* phone number file */
EXTERN char *RM; /* remote file name */
EXTERN char *HO; /* host name */
EXTERN long BR; /* line speed for conversation */
EXTERN long FS; /* frame size for transfers */
EXTERN short DU; /* this host is dialed up */
EXTERN short HW; /* this device is hardwired, see hunt.c */
EXTERN char *ES; /* escape character */
EXTERN char *EX; /* exceptions */
EXTERN char *FO; /* force (literal next) char*/
EXTERN char *RC; /* raise character */
EXTERN char *RE; /* script record file */
EXTERN char *PR; /* remote prompt */
EXTERN long DL; /* line delay for file transfers to remote */
EXTERN long CL; /* char delay for file transfers to remote */
EXTERN long ET; /* echocheck timeout */
EXTERN long LD; /* line disc */
EXTERN short HD; /* this host is half duplex - do local echo */
/*
* String value table
*/
typedef
struct {
char *v_name; /* whose name is it */
char v_type; /* for interpreting set's */
char v_access; /* protection of touchy ones */
char *v_abrev; /* possible abbreviation */
char *v_value; /* casted to a union later */
}
value_t;
#define STRING 01 /* string valued */
#define BOOL 02 /* true-false value */
#define NUMBER 04 /* numeric value */
#define CHAR 010 /* character value */
#define WRITE 01 /* write access to variable */
#define READ 02 /* read access */
#define CHANGED 01 /* low bit is used to show modification */
#define PUBLIC 1 /* public access rights */
#define PRIVATE 03 /* private to definer */
#define ROOT 05 /* root defined */
#define TRUE 1
#define FALSE 0
#define ENVIRON 020 /* initialize out of the environment */
#define IREMOTE 040 /* initialize out of remote structure */
#define INIT 0100 /* static data space used for initialization */
#define TMASK 017
/*
* Definition of ACU line description
*/
typedef
struct {
char *acu_name;
int (*acu_dialer)(char *, char *);
void (*acu_disconnect)(void);
void (*acu_abort)(void);
}
acu_t;
#define equal(a, b) (strcmp(a,b)==0)/* A nice function to string compare */
/*
* variable manipulation stuff --
* if we defined the value entry in value_t, then we couldn't
* initialize it in vars.c, so we cast it as needed to keep lint
* happy.
*/
#define value(v) vtable[v].v_value
#define lvalue(v) (long)vtable[v].v_value
#define number(v) ((long)(v))
#define boolean(v) ((short)(long)(v))
#define character(v) ((char)(long)(v))
#define address(v) ((long *)(v))
#define setnumber(v,n) do { (v) = (char *)(long)(n); } while (0)
#define setboolean(v,n) do { (v) = (char *)(long)(n); } while (0)
#define setcharacter(v,n) do { (v) = (char *)(long)(n); } while (0)
#define setaddress(v,n) do { (v) = (char *)(n); } while (0)
/*
* Escape command table definitions --
* lookup in this table is performed when ``escapec'' is recognized
* at the beginning of a line (as defined by the eolmarks variable).
*/
typedef
struct {
char e_char; /* char to match on */
char e_flags; /* experimental, privileged */
char *e_help; /* help string */
void (*e_func)(int); /* command */
}
esctable_t;
#define NORM 00 /* normal protection, execute anyone */
#define EXP 01 /* experimental, mark it with a `*' on help */
#define PRIV 02 /* privileged, root execute only */
extern int vflag; /* verbose during reading of .tiprc file */
extern int noesc; /* no escape `~' char */
extern value_t vtable[]; /* variable table */
#ifndef ACULOG
#define logent(a, b, c, d)
#define loginit()
#endif
/*
* Definition of indices into variable table so
* value(DEFINE) turns into a static address.
*/
#define BEAUTIFY 0
#define BAUDRATE 1
#define DIALTIMEOUT 2
#define EOFREAD 3
#define EOFWRITE 4
#define EOL 5
#define ESCAPE 6
#define EXCEPTIONS 7
#define FORCE 8
#define FRAMESIZE 9
#define HOST 10
#define LOG 11
#define PHONES 12
#define PROMPT 13
#define RAISE 14
#define RAISECHAR 15
#define RECORD 16
#define REMOTE 17
#define SCRIPT 18
#define TABEXPAND 19
#define VERBOSE 20
#define SHELL 21
#define HOME 22
#define ECHOCHECK 23
#define DISCONNECT 24
#define TAND 25
#define LDELAY 26
#define CDELAY 27
#define ETIMEOUT 28
#define RAWFTP 29
#define HALFDUPLEX 30
#define LECHO 31
#define PARITY 32
#define HARDWAREFLOW 33
#define LINEDISC 34
#define DC 35
#define NOVAL ((value_t *)NULL)
#define NOACU ((acu_t *)NULL)
#define NOSTR ((char *)NULL)
#define NOFILE ((FILE *)NULL)
#define NOPWD ((struct passwd *)0)
EXTERN struct termios term; /* current mode of terminal */
EXTERN struct termios defterm; /* initial mode of terminal */
EXTERN struct termios defchars; /* current mode with initial chars */
EXTERN int gotdefterm;
EXTERN FILE *fscript; /* FILE for scripting */
EXTERN int fildes[2]; /* file transfer synchronization channel */
EXTERN int repdes[2]; /* read process synchronization channel */
EXTERN int FD; /* open file descriptor to remote host */
EXTERN int AC; /* open file descriptor to dialer (v831 only) */
EXTERN int vflag; /* print .tiprc initialization sequence */
EXTERN int noesc; /* no `~' escape char */
EXTERN int sfd; /* for ~< operation */
EXTERN pid_t tipin_pid; /* pid of tipin */
EXTERN pid_t tipout_pid; /* pid of tipout */
EXTERN uid_t uid, euid; /* real and effective user id's */
EXTERN gid_t gid, egid; /* real and effective group id's */
EXTERN int stop; /* stop transfer session flag */
EXTERN int quit; /* same; but on other end */
EXTERN int intflag; /* recognized interrupt */
EXTERN int stoprompt; /* for interrupting a prompt session */
EXTERN int timedout; /* ~> transfer timedout */
EXTERN int cumode; /* simulating the "cu" program */
EXTERN int bits8; /* terminal is 8-bit mode */
#define STRIP_PAR (bits8 ? 0377 : 0177)
EXTERN char fname[PATH_MAX]; /* file name buffer for ~< */
EXTERN char copyname[PATH_MAX]; /* file name buffer for ~> */
EXTERN char ccc; /* synchronization character */
EXTERN char *uucplock; /* name of lock file for uucp's */
EXTERN int odisc; /* initial tty line discipline */
extern int disc; /* current tty discpline */
extern char *__progname; /* program name */
char *con(void);
char *ctrl(char);
char *expand(char *);
char *getremote(char *);
char *interp(char *);
int any(int, char *);
int biz22w_dialer(char *, char *);
int biz22f_dialer(char *, char *);
int biz31w_dialer(char *, char *);
int biz31f_dialer(char *, char *);
int cour_dialer(char *, char *);
int df02_dialer(char *, char *);
int df03_dialer(char *, char *);
int dn_dialer(char *, char *);
int hay_dialer(char *, char *);
int prompt(char *, char *, size_t);
size_t size(char *);
int t3000_dialer(char *, char *);
int ttysetup(int);
int uu_lock(char *);
int uu_unlock(char *);
int v3451_dialer(char *, char *);
int v831_dialer(char *, char *);
int ven_dialer(char *, char *);
int vstring(char *, char *);
long hunt(char *);
void biz22_disconnect(void);
void biz22_abort(void);
void biz31_disconnect(void);
void biz31_abort(void);
void chdirectory(int);
void cleanup(int);
void consh(int);
void cour_abort(void);
void cour_disconnect(void);
void cu_put(int);
void cu_take(int);
void cumain(int, char **);
void daemon_uid(void);
void df_abort(void);
void df_disconnect(void);
void disconnect(char *);
void dn_abort(void);
void dn_disconnect(void);
void finish(int);
void genbrk(int);
void getfl(int);
void hay_abort(void);
void hay_disconnect(void);
void help(int);
void listvariables(int);
void logent(char *, char *, char *, char *);
void loginit(void);
void parwrite(int, char *, size_t);
void pipefile(int);
void pipeout(int);
void raw(void);
void sendfile(int);
void setparity(char *);
void setscript(void);
void shell(int);
void shell_uid(void);
void suspend(int);
void t3000_disconnect(void);
void t3000_abort(void);
void timeout(int);
void tipabort(char *);
void tipout(void);
void user_uid(void);
void unexcl(void);
void unraw(void);
void v3451_abort(void);
void v3451_disconnect(void);
void v831_disconnect(void);
void v831_abort(void);
void variable(int);
void ven_disconnect(void);
void ven_abort(void);
void vinit(void);
void vlex(char *);
diff --git a/usr.bin/top/display.h b/usr.bin/top/display.h
index 76e88acb4d88..6e930f5ae6eb 100644
--- a/usr.bin/top/display.h
+++ b/usr.bin/top/display.h
@@ -1,42 +1,41 @@
-/* $FreeBSD$ */
/* constants needed for display.c */
#define MT_standout 1
#define MT_delayed 2
#include <sys/time.h>
struct statics;
int display_updatecpus(struct statics *statics);
void clear_message(void);
int display_resize(void);
void i_header(const char *text);
void display_header(int t);
int display_init(struct statics *statics);
void i_arc(int *stats);
void i_battery(int nbat, int batt);
void i_carc(int *stats);
void i_cpustates(int *states);
void i_loadave(int mpid, double *avenrun);
void i_memory(int *stats);
void i_message(void);
void i_process(int line, char *thisline);
void i_procstates(int total, int *brkdn);
void i_swap(int *stats);
void i_timeofday(time_t *tod);
void i_uptime(struct timeval *bt, time_t *tod);
void new_message(int type, const char *msgfmt, ...);
int readline(char *buffer, int size, int numeric);
char *trim_header(const char *text);
void u_arc(int *stats);
void u_carc(int *stats);
void u_cpustates(int *states);
void u_endscreen(int hi);
void u_header(const char *text);
void u_loadave(int mpid, double *avenrun);
void u_memory(int *stats);
void u_message(void);
void u_process(int line, char *newline);
void u_procstates(int total, int *brkdn);
void u_swap(int *stats);
void z_cpustates(void);
diff --git a/usr.bin/usbhidaction/usbhidaction.c b/usr.bin/usbhidaction/usbhidaction.c
index 847f7daa0466..c12adfa81e8a 100644
--- a/usr.bin/usbhidaction/usbhidaction.c
+++ b/usr.bin/usbhidaction/usbhidaction.c
@@ -1,520 +1,519 @@
/* $NetBSD: usbhidaction.c,v 1.8 2002/06/11 06:06:21 itojun Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2000, 2002 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Lennart Augustsson <lennart@augustsson.net>.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <err.h>
#include <fcntl.h>
#include <limits.h>
#include <unistd.h>
#include <sys/types.h>
#include <dev/usb/usbhid.h>
#include <usbhid.h>
#include <syslog.h>
#include <signal.h>
#include <errno.h>
#include <sys/stat.h>
static int verbose = 0;
static int isdemon = 0;
static int reparse = 1;
static const char * pidfile = "/var/run/usbaction.pid";
struct command {
struct command *next;
int line;
struct hid_item item;
int value;
int lastseen;
int lastused;
int debounce;
char anyvalue;
char *name;
char *action;
};
static struct command *commands;
#define SIZE 4000
void usage(void);
struct command *parse_conf(const char *, report_desc_t, int, int);
void docmd(struct command *, int, const char *, int, char **);
void freecommands(struct command *);
static void
sighup(int sig __unused)
{
reparse = 1;
}
int
main(int argc, char **argv)
{
const char *conf = NULL;
const char *dev = NULL;
const char *table = NULL;
int fd, fp, ch, n, val, i;
size_t sz, sz1;
int demon, ignore, dieearly;
report_desc_t repd;
char buf[100];
char devnamebuf[PATH_MAX];
struct command *cmd;
int reportid = -1;
demon = 1;
ignore = 0;
dieearly = 0;
while ((ch = getopt(argc, argv, "c:def:ip:r:t:v")) != -1) {
switch(ch) {
case 'c':
conf = optarg;
break;
case 'd':
demon ^= 1;
break;
case 'e':
dieearly = 1;
break;
case 'i':
ignore++;
break;
case 'f':
dev = optarg;
break;
case 'p':
pidfile = optarg;
break;
case 'r':
reportid = atoi(optarg);
break;
case 't':
table = optarg;
break;
case 'v':
demon = 0;
verbose++;
break;
case '?':
default:
usage();
}
}
argc -= optind;
argv += optind;
if (conf == NULL || dev == NULL)
usage();
hid_init(table);
if (dev[0] != '/') {
snprintf(devnamebuf, sizeof(devnamebuf), "/dev/%s%s",
isdigit(dev[0]) ? "uhid" : "", dev);
dev = devnamebuf;
}
fd = open(dev, O_RDWR);
if (fd < 0)
err(1, "%s", dev);
repd = hid_get_report_desc(fd);
if (repd == NULL)
err(1, "hid_get_report_desc() failed");
commands = parse_conf(conf, repd, reportid, ignore);
sz = (size_t)hid_report_size(repd, hid_input, -1);
if (verbose)
printf("report size %zu\n", sz);
if (sz > sizeof buf)
errx(1, "report too large");
(void)signal(SIGHUP, sighup);
if (demon) {
fp = open(pidfile, O_WRONLY|O_CREAT, S_IRUSR|S_IRGRP|S_IROTH);
if (fp < 0)
err(1, "%s", pidfile);
if (daemon(0, 0) < 0)
err(1, "daemon()");
snprintf(buf, sizeof(buf), "%ld\n", (long)getpid());
sz1 = strlen(buf);
if (write(fp, buf, sz1) < 0)
err(1, "%s", pidfile);
close(fp);
isdemon = 1;
}
for(;;) {
n = read(fd, buf, sz);
if (verbose > 2) {
printf("read %d bytes:", n);
for (i = 0; i < n; i++)
printf(" %02x", buf[i]);
printf("\n");
}
if (n < 0) {
if (verbose)
err(1, "read");
else
exit(1);
}
#if 0
if (n != sz) {
err(2, "read size");
}
#endif
for (cmd = commands; cmd; cmd = cmd->next) {
if (cmd->item.report_ID != 0 &&
buf[0] != cmd->item.report_ID)
continue;
if (cmd->item.flags & HIO_VARIABLE)
val = hid_get_data(buf, &cmd->item);
else {
uint32_t pos = cmd->item.pos;
for (i = 0; i < cmd->item.report_count; i++) {
val = hid_get_data(buf, &cmd->item);
if (val == cmd->value)
break;
cmd->item.pos += cmd->item.report_size;
}
cmd->item.pos = pos;
val = (i < cmd->item.report_count) ?
cmd->value : -1;
}
if (cmd->value != val && cmd->anyvalue == 0)
goto next;
if ((cmd->debounce == 0) ||
((cmd->debounce == 1) && ((cmd->lastseen == -1) ||
(cmd->lastseen != val)))) {
docmd(cmd, val, dev, argc, argv);
goto next;
}
if ((cmd->debounce > 1) &&
((cmd->lastused == -1) ||
(abs(cmd->lastused - val) >= cmd->debounce))) {
docmd(cmd, val, dev, argc, argv);
cmd->lastused = val;
goto next;
}
next:
cmd->lastseen = val;
}
if (dieearly)
exit(0);
if (reparse) {
struct command *cmds =
parse_conf(conf, repd, reportid, ignore);
if (cmds) {
freecommands(commands);
commands = cmds;
}
reparse = 0;
}
}
exit(0);
}
void
usage(void)
{
fprintf(stderr, "Usage: %s [-deiv] -c config_file -f hid_dev "
"[-p pidfile] [-t tablefile]\n", getprogname());
exit(1);
}
static int
peek(FILE *f)
{
int c;
c = getc(f);
if (c != EOF)
ungetc(c, f);
return c;
}
struct command *
parse_conf(const char *conf, report_desc_t repd, int reportid, int ignore)
{
FILE *f;
char *p;
int line;
char buf[SIZE], name[SIZE], value[SIZE], debounce[SIZE], action[SIZE];
char usbuf[SIZE], coll[SIZE], *tmp;
struct command *cmd, *cmds;
struct hid_data *d;
struct hid_item h;
int inst, cinst, u, lo, hi, range, t;
f = fopen(conf, "r");
if (f == NULL)
err(1, "%s", conf);
cmds = NULL;
for (line = 1; ; line++) {
if (fgets(buf, sizeof buf, f) == NULL)
break;
if (buf[0] == '#' || buf[0] == '\n')
continue;
p = strchr(buf, '\n');
while (p && isspace(peek(f))) {
if (fgets(p, sizeof buf - strlen(buf), f) == NULL)
break;
p = strchr(buf, '\n');
}
if (p)
*p = 0;
if (sscanf(buf, "%s %s %s %[^\n]",
name, value, debounce, action) != 4) {
if (isdemon) {
syslog(LOG_WARNING, "config file `%s', line %d"
", syntax error: %s", conf, line, buf);
freecommands(cmds);
return (NULL);
} else {
errx(1, "config file `%s', line %d,"
", syntax error: %s", conf, line, buf);
}
}
tmp = strchr(name, '#');
if (tmp != NULL) {
*tmp = 0;
inst = atoi(tmp + 1);
} else
inst = 0;
cmd = malloc(sizeof *cmd);
if (cmd == NULL)
err(1, "malloc failed");
cmd->next = cmds;
cmds = cmd;
cmd->line = line;
if (strcmp(value, "*") == 0) {
cmd->anyvalue = 1;
} else {
cmd->anyvalue = 0;
if (sscanf(value, "%d", &cmd->value) != 1) {
if (isdemon) {
syslog(LOG_WARNING,
"config file `%s', line %d, "
"bad value: %s (should be * or a number)\n",
conf, line, value);
freecommands(cmds);
return (NULL);
} else {
errx(1, "config file `%s', line %d, "
"bad value: %s (should be * or a number)\n",
conf, line, value);
}
}
}
if (sscanf(debounce, "%d", &cmd->debounce) != 1) {
if (isdemon) {
syslog(LOG_WARNING,
"config file `%s', line %d, "
"bad value: %s (should be a number >= 0)\n",
conf, line, debounce);
freecommands(cmds);
return (NULL);
} else {
errx(1, "config file `%s', line %d, "
"bad value: %s (should be a number >= 0)\n",
conf, line, debounce);
}
}
coll[0] = 0;
cinst = 0;
for (d = hid_start_parse(repd, 1 << hid_input, reportid);
hid_get_item(d, &h); ) {
if (verbose > 2)
printf("kind=%d usage=%x\n", h.kind, h.usage);
if (h.flags & HIO_CONST)
continue;
switch (h.kind) {
case hid_input:
if (h.usage_minimum != 0 ||
h.usage_maximum != 0) {
lo = h.usage_minimum;
hi = h.usage_maximum;
range = 1;
} else {
lo = h.usage;
hi = h.usage;
range = 0;
}
for (u = lo; u <= hi; u++) {
if (coll[0]) {
snprintf(usbuf, sizeof usbuf,
"%s.%s:%s", coll+1,
hid_usage_page(HID_PAGE(u)),
hid_usage_in_page(u));
} else {
snprintf(usbuf, sizeof usbuf,
"%s:%s",
hid_usage_page(HID_PAGE(u)),
hid_usage_in_page(u));
}
if (verbose > 2)
printf("usage %s\n", usbuf);
t = strlen(usbuf) - strlen(name);
if (t > 0) {
if (strcmp(usbuf + t, name))
continue;
if (usbuf[t - 1] != '.')
continue;
} else if (strcmp(usbuf, name))
continue;
if (inst == cinst++)
goto foundhid;
}
break;
case hid_collection:
snprintf(coll + strlen(coll),
sizeof coll - strlen(coll), ".%s:%s",
hid_usage_page(HID_PAGE(h.usage)),
hid_usage_in_page(h.usage));
break;
case hid_endcollection:
if (coll[0])
*strrchr(coll, '.') = 0;
break;
default:
break;
}
}
if (ignore) {
if (verbose)
warnx("ignore item '%s'", name);
continue;
}
if (isdemon) {
syslog(LOG_WARNING, "config file `%s', line %d, HID "
"item not found: `%s'\n", conf, line, name);
freecommands(cmds);
return (NULL);
} else {
errx(1, "config file `%s', line %d, HID item "
"not found: `%s'\n", conf, line, name);
}
foundhid:
hid_end_parse(d);
cmd->lastseen = -1;
cmd->lastused = -1;
cmd->item = h;
cmd->name = strdup(name);
cmd->action = strdup(action);
if (range) {
if (cmd->value == 1)
cmd->value = u - lo;
else
cmd->value = -1;
}
if (verbose)
printf("PARSE:%d %s, %d, '%s'\n", cmd->line, name,
cmd->value, cmd->action);
}
fclose(f);
return (cmds);
}
void
docmd(struct command *cmd, int value, const char *hid, int argc, char **argv)
{
char cmdbuf[SIZE], *p, *q;
size_t len;
int n, r;
for (p = cmd->action, q = cmdbuf; *p && q < &cmdbuf[SIZE-1]; ) {
if (*p == '$') {
p++;
len = &cmdbuf[SIZE-1] - q;
if (isdigit(*p)) {
n = strtol(p, &p, 10) - 1;
if (n >= 0 && n < argc) {
strncpy(q, argv[n], len);
q += strlen(q);
}
} else if (*p == 'V') {
p++;
snprintf(q, len, "%d", value);
q += strlen(q);
} else if (*p == 'N') {
p++;
strncpy(q, cmd->name, len);
q += strlen(q);
} else if (*p == 'H') {
p++;
strncpy(q, hid, len);
q += strlen(q);
} else if (*p) {
*q++ = *p++;
}
} else {
*q++ = *p++;
}
}
*q = 0;
if (verbose)
printf("system '%s'\n", cmdbuf);
r = system(cmdbuf);
if (verbose > 1 && r)
printf("return code = 0x%x\n", r);
}
void
freecommands(struct command *cmd)
{
struct command *next;
while (cmd) {
next = cmd->next;
free(cmd);
cmd = next;
}
}
diff --git a/usr.bin/usbhidctl/usbhid.c b/usr.bin/usbhidctl/usbhid.c
index 984cdebc3289..5226958da3eb 100644
--- a/usr.bin/usbhidctl/usbhid.c
+++ b/usr.bin/usbhidctl/usbhid.c
@@ -1,533 +1,532 @@
/* $NetBSD: usbhid.c,v 1.14 2000/07/03 02:51:37 matt Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 1998 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Lennart Augustsson (augustss@netbsd.org).
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <fcntl.h>
#include <unistd.h>
#include <err.h>
#include <ctype.h>
#include <errno.h>
#include <usbhid.h>
#include <dev/usb/usbhid.h>
static struct variable {
char *name;
int instance;
int val;
struct hid_item h;
struct variable *next;
} *vars;
static int verbose = 0;
static int noname = 0;
static int hexdump = 0;
static int wflag = 0;
static int zflag = 0;
static void usage(void);
static void dumpitem(const char *label, struct hid_item *h);
static void dumpitems(report_desc_t r);
static void prdata(u_char *buf, struct hid_item *h);
static void dumpdata(int f, report_desc_t r, int loop);
static void writedata(int f, report_desc_t r);
static void
parceargs(report_desc_t r, int all, int nnames, char **names)
{
struct hid_data *d;
struct hid_item h;
char colls[1000];
char hname[1000], *tmp1, *tmp2;
struct variable *var, **pnext;
int i, instance, cp, t;
pnext = &vars;
if (all) {
if (wflag)
errx(1, "Must not specify -w to read variables");
cp = 0;
for (d = hid_start_parse(r,
1<<hid_input | 1<<hid_output | 1<<hid_feature, -1);
hid_get_item(d, &h); ) {
if (h.kind == hid_collection) {
cp += sprintf(&colls[cp], "%s%s:%s",
cp != 0 ? "." : "",
hid_usage_page(HID_PAGE(h.usage)),
hid_usage_in_page(h.usage));
} else if (h.kind == hid_endcollection) {
tmp1 = strrchr(colls, '.');
if (tmp1 != NULL) {
cp -= strlen(tmp1);
tmp1[0] = 0;
} else {
cp = 0;
colls[0] = 0;
}
}
if ((h.kind != hid_input && h.kind != hid_output &&
h.kind != hid_feature) || (h.flags & HIO_CONST))
continue;
var = malloc(sizeof(*var));
memset(var, 0, sizeof(*var));
asprintf(&var->name, "%s%s%s:%s",
colls, colls[0] != 0 ? "." : "",
hid_usage_page(HID_PAGE(h.usage)),
hid_usage_in_page(h.usage));
var->h = h;
*pnext = var;
pnext = &var->next;
}
hid_end_parse(d);
return;
}
for (i = 0; i < nnames; i++) {
var = malloc(sizeof(*var));
memset(var, 0, sizeof(*var));
tmp1 = tmp2 = strdup(names[i]);
strsep(&tmp2, "=");
var->name = strsep(&tmp1, "#");
if (tmp1 != NULL)
var->instance = atoi(tmp1);
if (tmp2 != NULL) {
if (!wflag)
errx(1, "Must specify -w to write variables");
var->val = atoi(tmp2);
} else
if (wflag)
errx(1, "Must not specify -w to read variables");
*pnext = var;
pnext = &var->next;
instance = 0;
cp = 0;
for (d = hid_start_parse(r,
1<<hid_input | 1<<hid_output | 1<<hid_feature, -1);
hid_get_item(d, &h); ) {
if (h.kind == hid_collection) {
cp += sprintf(&colls[cp], "%s%s:%s",
cp != 0 ? "." : "",
hid_usage_page(HID_PAGE(h.usage)),
hid_usage_in_page(h.usage));
} else if (h.kind == hid_endcollection) {
tmp1 = strrchr(colls, '.');
if (tmp1 != NULL) {
cp -= strlen(tmp1);
tmp1[0] = 0;
} else {
cp = 0;
colls[0] = 0;
}
}
if ((h.kind != hid_input && h.kind != hid_output &&
h.kind != hid_feature) || (h.flags & HIO_CONST))
continue;
snprintf(hname, sizeof(hname), "%s%s%s:%s",
colls, colls[0] != 0 ? "." : "",
hid_usage_page(HID_PAGE(h.usage)),
hid_usage_in_page(h.usage));
t = strlen(hname) - strlen(var->name);
if (t > 0) {
if (strcmp(hname + t, var->name) != 0)
continue;
if (hname[t - 1] != '.')
continue;
} else if (strcmp(hname, var->name) != 0)
continue;
if (var->instance != instance++)
continue;
var->h = h;
break;
}
hid_end_parse(d);
if (var->h.usage == 0)
errx(1, "Unknown item '%s'", var->name);
}
}
static void
usage(void)
{
fprintf(stderr,
"usage: %s -f device "
"[-l] [-n] [-r] [-t tablefile] [-v] [-x] [-z] name ...\n",
getprogname());
fprintf(stderr,
" %s -f device "
"[-l] [-n] [-r] [-t tablefile] [-v] [-x] [-z] -a\n",
getprogname());
fprintf(stderr,
" %s -f device "
"[-t tablefile] [-v] [-z] -w name=value\n",
getprogname());
exit(1);
}
static void
dumpitem(const char *label, struct hid_item *h)
{
if ((h->flags & HIO_CONST) && !verbose)
return;
printf("%s rid=%d pos=%d size=%d count=%d page=%s usage=%s%s%s", label,
h->report_ID, h->pos, h->report_size, h->report_count,
hid_usage_page(HID_PAGE(h->usage)),
hid_usage_in_page(h->usage),
h->flags & HIO_CONST ? " Const" : "",
h->flags & HIO_VARIABLE ? "" : " Array");
printf(", logical range %d..%d",
h->logical_minimum, h->logical_maximum);
if (h->physical_minimum != h->physical_maximum)
printf(", physical range %d..%d",
h->physical_minimum, h->physical_maximum);
if (h->unit)
printf(", unit=0x%02x exp=%d", h->unit, h->unit_exponent);
printf("\n");
}
static const char *
hid_collection_type(int32_t type)
{
static char num[8];
switch (type) {
case 0: return ("Physical");
case 1: return ("Application");
case 2: return ("Logical");
case 3: return ("Report");
case 4: return ("Named_Array");
case 5: return ("Usage_Switch");
case 6: return ("Usage_Modifier");
}
snprintf(num, sizeof(num), "0x%02x", type);
return (num);
}
static void
dumpitems(report_desc_t r)
{
struct hid_data *d;
struct hid_item h;
int size;
for (d = hid_start_parse(r, ~0, -1); hid_get_item(d, &h); ) {
switch (h.kind) {
case hid_collection:
printf("Collection type=%s page=%s usage=%s\n",
hid_collection_type(h.collection),
hid_usage_page(HID_PAGE(h.usage)),
hid_usage_in_page(h.usage));
break;
case hid_endcollection:
printf("End collection\n");
break;
case hid_input:
dumpitem("Input ", &h);
break;
case hid_output:
dumpitem("Output ", &h);
break;
case hid_feature:
dumpitem("Feature", &h);
break;
}
}
hid_end_parse(d);
size = hid_report_size(r, hid_input, -1);
printf("Total input size %d bytes\n", size);
size = hid_report_size(r, hid_output, -1);
printf("Total output size %d bytes\n", size);
size = hid_report_size(r, hid_feature, -1);
printf("Total feature size %d bytes\n", size);
}
static void
prdata(u_char *buf, struct hid_item *h)
{
u_int data;
int i, pos;
pos = h->pos;
for (i = 0; i < h->report_count; i++) {
data = hid_get_data(buf, h);
if (i > 0)
printf(" ");
if (h->logical_minimum < 0)
printf("%d", (int)data);
else
printf("%u", data);
if (hexdump)
printf(" [0x%x]", data);
h->pos += h->report_size;
}
h->pos = pos;
}
static void
dumpdata(int f, report_desc_t rd, int loop)
{
struct variable *var;
int dlen, havedata, i, match, r, rid, use_rid;
u_char *dbuf;
enum hid_kind kind;
kind = zflag ? 3 : 0;
rid = -1;
use_rid = !!hid_get_report_id(f);
do {
if (kind < 3) {
if (++rid >= 256) {
rid = 0;
kind++;
}
if (kind >= 3)
rid = -1;
for (var = vars; var; var = var->next) {
if (rid == var->h.report_ID &&
kind == var->h.kind)
break;
}
if (var == NULL)
continue;
}
dlen = hid_report_size(rd, kind < 3 ? kind : hid_input, rid);
if (dlen <= 0)
continue;
dbuf = malloc(dlen);
memset(dbuf, 0, dlen);
if (kind < 3) {
dbuf[0] = rid;
r = hid_get_report(f, kind, dbuf, dlen);
if (r < 0)
warn("hid_get_report(rid %d)", rid);
havedata = !r && (rid == 0 || dbuf[0] == rid);
if (rid != 0)
dbuf[0] = rid;
} else {
r = read(f, dbuf, dlen);
if (r < 1)
err(1, "read error");
havedata = 1;
}
if (verbose) {
printf("Got %s report %d (%d bytes):",
kind == hid_output ? "output" :
kind == hid_feature ? "feature" : "input",
use_rid ? dbuf[0] : 0, dlen);
if (havedata) {
for (i = 0; i < dlen; i++)
printf(" %02x", dbuf[i]);
}
printf("\n");
}
match = 0;
for (var = vars; var; var = var->next) {
if ((kind < 3 ? kind : hid_input) != var->h.kind)
continue;
if (var->h.report_ID != 0 &&
dbuf[0] != var->h.report_ID)
continue;
match = 1;
if (!noname)
printf("%s=", var->name);
if (havedata)
prdata(dbuf, &var->h);
printf("\n");
}
if (match)
printf("\n");
free(dbuf);
} while (loop || kind < 3);
}
static void
writedata(int f, report_desc_t rd)
{
struct variable *var;
int dlen, i, r, rid;
u_char *dbuf;
enum hid_kind kind;
kind = 0;
rid = 0;
for (kind = 0; kind < 3; kind ++) {
for (rid = 0; rid < 256; rid ++) {
for (var = vars; var; var = var->next) {
if (rid == var->h.report_ID && kind == var->h.kind)
break;
}
if (var == NULL)
continue;
dlen = hid_report_size(rd, kind, rid);
if (dlen <= 0)
continue;
dbuf = malloc(dlen);
memset(dbuf, 0, dlen);
dbuf[0] = rid;
if (!zflag && hid_get_report(f, kind, dbuf, dlen) == 0) {
if (verbose) {
printf("Got %s report %d (%d bytes):",
kind == hid_input ? "input" :
kind == hid_output ? "output" : "feature",
rid, dlen);
for (i = 0; i < dlen; i++)
printf(" %02x", dbuf[i]);
printf("\n");
}
} else if (!zflag) {
warn("hid_get_report(rid %d)", rid);
if (verbose) {
printf("Can't get %s report %d (%d bytes). "
"Will be initialized with zeros.\n",
kind == hid_input ? "input" :
kind == hid_output ? "output" : "feature",
rid, dlen);
}
}
for (var = vars; var; var = var->next) {
if (rid != var->h.report_ID || kind != var->h.kind)
continue;
hid_set_data(dbuf, &var->h, var->val);
}
if (verbose) {
printf("Setting %s report %d (%d bytes):",
kind == hid_output ? "output" :
kind == hid_feature ? "feature" : "input",
rid, dlen);
for (i = 0; i < dlen; i++)
printf(" %02x", dbuf[i]);
printf("\n");
}
r = hid_set_report(f, kind, dbuf, dlen);
if (r != 0)
warn("hid_set_report(rid %d)", rid);
free(dbuf);
}
}
}
int
main(int argc, char **argv)
{
report_desc_t r;
char *table = 0;
char devnam[100], *dev = NULL;
int f;
int all = 0;
int ch;
int repdump = 0;
int loop = 0;
while ((ch = getopt(argc, argv, "af:lnrt:vwxz")) != -1) {
switch(ch) {
case 'a':
all++;
break;
case 'f':
dev = optarg;
break;
case 'l':
loop ^= 1;
break;
case 'n':
noname++;
break;
case 'r':
repdump++;
break;
case 't':
table = optarg;
break;
case 'v':
verbose++;
break;
case 'w':
wflag = 1;
break;
case 'x':
hexdump = 1;
break;
case 'z':
zflag = 1;
break;
case '?':
default:
usage();
}
}
argc -= optind;
argv += optind;
if (dev == NULL)
usage();
if (argc == 0 && !all && !repdump)
usage();
if (dev[0] != '/') {
if (isdigit(dev[0]))
snprintf(devnam, sizeof(devnam), "/dev/uhid%s", dev);
else
snprintf(devnam, sizeof(devnam), "/dev/%s", dev);
dev = devnam;
}
hid_init(table);
f = open(dev, O_RDWR);
if (f < 0)
err(1, "%s", dev);
r = hid_get_report_desc(f);
if (r == 0)
errx(1, "USB_GET_REPORT_DESC");
if (repdump) {
printf("Report descriptor:\n");
dumpitems(r);
}
if (argc != 0 || all) {
parceargs(r, all, argc, argv);
if (wflag)
writedata(f, r);
else
dumpdata(f, r, loop);
}
hid_dispose_report_desc(r);
exit(0);
}
diff --git a/usr.bin/vi/config.h b/usr.bin/vi/config.h
index 2b4348870db4..8041fb76dce9 100644
--- a/usr.bin/vi/config.h
+++ b/usr.bin/vi/config.h
@@ -1,28 +1,27 @@
-/* $FreeBSD$ */
/* Define when using wide characters */
#define USE_WIDECHAR
/* Define when iconv can be used */
/* #undef USE_ICONV */
/* Define when the 2nd argument of iconv(3) is not const */
/* #undef ICONV_TRADITIONAL */
/* Define if you have <libutil.h> */
#define HAVE_LIBUTIL_H
/* Define if you have <ncurses.h> */
#define HAVE_NCURSES_H
/* Define if you have <ncursesw/ncurses.h> */
/* #undef HAVE_NCURSESW_NCURSES_H */
/* Define if you have <pty.h> */
/* #undef HAVE_PTY_H */
/* Define if you have <term.h> */
#define HAVE_TERM_H
/* Define if struct dirent has field d_namlen */
#define HAVE_DIRENT_D_NAMLEN
diff --git a/usr.bin/vi/ex/version.h b/usr.bin/vi/ex/version.h
index f14fc879222e..657da969e721 100644
--- a/usr.bin/vi/ex/version.h
+++ b/usr.bin/vi/ex/version.h
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
#define VI_VERSION "2.2.0 (2020-08-01)"
diff --git a/usr.bin/vi/pathnames.h b/usr.bin/vi/pathnames.h
index f788c05bb5eb..f1c706f5ecbd 100644
--- a/usr.bin/vi/pathnames.h
+++ b/usr.bin/vi/pathnames.h
@@ -1,27 +1,26 @@
-/* $FreeBSD$ */
/* Read standard system paths first. */
#include <paths.h>
#ifndef _PATH_EXRC
#define _PATH_EXRC ".exrc"
#endif
#ifndef _PATH_MSGCAT
#define _PATH_MSGCAT "/usr/share/vi/catalog/"
#endif
#ifndef _PATH_NEXRC
#define _PATH_NEXRC ".nexrc"
#endif
/* On linux _PATH_PRESERVE is only writable by root */
#define NVI_PATH_PRESERVE "/var/tmp/vi.recover/"
#ifndef _PATH_SYSEXRC
#define _PATH_SYSEXRC "/etc/vi.exrc"
#endif
#ifndef _PATH_TAGS
#define _PATH_TAGS "tags"
#endif
diff --git a/usr.bin/wall/ttymsg.h b/usr.bin/wall/ttymsg.h
index 1915720087e6..be97592f5e1c 100644
--- a/usr.bin/wall/ttymsg.h
+++ b/usr.bin/wall/ttymsg.h
@@ -1,5 +1,4 @@
-/* $FreeBSD$ */
#define TTYMSG_IOV_MAX 32
const char *ttymsg(struct iovec *, int, const char *, int);
diff --git a/usr.bin/yacc/config.h b/usr.bin/yacc/config.h
index cff3a544de22..cf7e27051509 100644
--- a/usr.bin/yacc/config.h
+++ b/usr.bin/yacc/config.h
@@ -1,108 +1,107 @@
-/* $FreeBSD$ */
/* config.h. Generated automatically by configure. */
/* config_h.in. Generated automatically from configure.in by autoheader. */
/* Define to noreturn-attribute for gcc */
/* #undef GCC_NORETURN */
/* Define to 1 if the compiler supports gcc-like printf attribute. */
/* #undef GCC_PRINTF */
/* Define to printf-attribute for gcc */
/* #undef GCC_PRINTFLIKE */
/* Define to 1 if the compiler supports gcc-like scanf attribute. */
/* #undef GCC_SCANF */
/* Define to sscanf-attribute for gcc */
/* #undef GCC_SCANFLIKE */
/* Define to unused-attribute for gcc */
/* #undef GCC_UNUSED */
/* Define if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define if you have the `getopt' function. */
#define HAVE_GETOPT 1
/* Define if you have the <getopt.h> header file. */
#define HAVE_GETOPT_H 1
/* Define to 1 if getopt variables are declared in header */
#define HAVE_GETOPT_HEADER 1
/* Define if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define if you have the `dbmalloc' library (-ldbmalloc). */
/* #undef HAVE_LIBDBMALLOC */
/* Define if you have the `dmalloc' library (-ldmalloc). */
/* #undef HAVE_LIBDMALLOC */
/* Define if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if mkstemp() is available and working. */
#define HAVE_MKSTEMP 1
/* Define if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define if you have the `vsnprintf' function. */
#define HAVE_VSNPRINTF 1
/* Define to maximum table size (default: 32500) */
/* #undef MAXTABLE */
/* Define to 1 if filesystem supports mixed-case filenames. */
#define MIXEDCASE_FILENAMES 1
/* Define to 1 if we must include getopt.h */
/* #undef NEED_GETOPT_H */
/* Define to 1 if you want to perform memory-leak testing. */
/* #undef NO_LEAKS */
/* Define if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define to the system name. */
#define SYSTEM_NAME "freebsd13.2"
/* "Define to 1 if you want to use dbmalloc for testing." */
/* #undef USE_DBMALLOC */
/* "Define to 1 if you want to use dmalloc for testing." */
/* #undef USE_DMALLOC */
/* "Define to 1 if you want to use valgrind for testing." */
/* #undef USE_VALGRIND */
/* Define to 1 to enable backtracking extension */
/* #undef YYBTYACC */
/* Define to 1 if you want to perform memory-leak testing. */
/* #undef YY_NO_LEAKS */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef mode_t */
diff --git a/usr.sbin/apmd/contrib/pccardq.c b/usr.sbin/apmd/contrib/pccardq.c
index aebd1d544470..acdeaaecb261 100644
--- a/usr.sbin/apmd/contrib/pccardq.c
+++ b/usr.sbin/apmd/contrib/pccardq.c
@@ -1,286 +1,285 @@
-/* $FreeBSD$ */
#include <err.h>
#include <errno.h>
#include <limits.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/un.h>
const char *const pccardd_file = "/var/tmp/.pccardd";
const char *prog = "pccardq";
const char *tmp_dir = "/tmp";
unsigned slot_map = ~0;
void
usage(void)
{
fprintf(stderr, "usage: %s [-a] [-n] [-s slot]\n", prog);
}
int
proc_arg(int ac, char **av)
{
int rc = -1;
int ch;
char *p = strrchr(av[0], '/');
prog = p ? p + 1 : av[0];
tmp_dir = getenv("TMPDIR") ? getenv("TMPDIR") : tmp_dir;
while ((ch = getopt(ac, av, "ans:")) != -1) {
switch (ch) {
case 'a':
slot_map = ~0;
break;
case 'n':
slot_map = 0;
break;
case 's':
{
int n = atoi(optarg);
if (n < 0 || n >= CHAR_BIT * sizeof slot_map) {
warnc(0, "Invalid slot number.");
usage();
goto out;
}
if (slot_map == ~0)
slot_map = 0;
slot_map |= 1 << n;
}
break;
default:
usage();
goto out;
}
}
rc = 0;
out:
return rc;
}
int
connect_to_pccardd(char **path)
{
int so = -1;
int pccardd_len;
struct sockaddr_un pccardq;
struct sockaddr_un pccardd;
if ((so = socket(PF_UNIX, SOCK_DGRAM, 0)) < 0) {
warn("socket");
goto err;
}
snprintf(pccardq.sun_path, sizeof pccardq.sun_path,
"%s/%s%ld%ld", tmp_dir, prog, (long) getpid(), (long) time(0));
pccardq.sun_family = AF_UNIX;
pccardq.sun_len = offsetof(struct sockaddr_un, sun_path) + strlen(pccardq.sun_path);
if (bind(so, (struct sockaddr *) &pccardq, pccardq.sun_len) < 0) {
warn("bind: %s", pccardq.sun_path);
goto err;
}
if ((*path = strdup(pccardq.sun_path)) == NULL) {
warn("strdup");
goto err;
}
pccardd_len = strlen(pccardd_file) + 1;
if (pccardd_len > sizeof pccardd.sun_path) {
warnc(0, "%s: too long", pccardd_file);
goto err;
}
pccardd.sun_len = offsetof(struct sockaddr_un, sun_path) + pccardd_len;
pccardd.sun_family = AF_UNIX;
strcpy(pccardd.sun_path, pccardd_file);
if (connect(so, (struct sockaddr *) &pccardd, pccardd.sun_len) < 0) {
warn("connect: %s", pccardd_file);
goto err;
}
return so;
err:
if (so >= 0)
close(so);
return -1;
}
int
get_slot_number(int so)
{
char buf[8];
int rv;
int nslot;
if ((rv = write(so, "S", 1)) < 1) {
warn("write");
goto err;
} else if (rv != 1) {
warnc(0, "write: fail.");
goto err;
}
if ((rv = read(so, buf, sizeof buf)) < 0) {
warn("read");
goto err;
}
buf[sizeof buf - 1] = 0;
if (sscanf(buf, "%d", &nslot) != 1) {
warnc(0, "Invalid response.");
goto err;
}
return nslot;
err:
return -1;
}
enum {
SLOT_EMPTY = 0,
SLOT_FILLED = 1,
SLOT_INACTIVE = 2,
SLOT_UNDEFINED = 9
};
int
get_slot_info(int so, int slot, char **manuf, char **version, char
**device, int *state)
{
int rc = -1;
int rv;
static char buf[1024];
int slen;
char *s;
char *sl;
char *_manuf;
char *_version;
char *_device;
if ((slen = snprintf(buf, sizeof buf, "N%d", slot)) < 0) {
warnc(0, "write");
goto err;
}
if ((rv = write(so, buf, slen)) < 0) {
warn("write");
goto err;
} else if (rv != slen) {
warnc(0, "write");
goto err;
}
if ((rv = read(so, buf, sizeof buf)) < 0) {
warn("read");
goto err;
}
s = buf;
if ((sl = strsep(&s, "~")) == NULL)
goto parse_err;
if (atoi(sl) != slot)
goto parse_err;
if ((_manuf = strsep(&s, "~")) == NULL)
goto parse_err;
if ((_version = strsep(&s, "~")) == NULL)
goto parse_err;
if ((_device = strsep(&s, "~")) == NULL)
goto parse_err;
if (sscanf(s, "%1d", state) != 1)
goto parse_err;
if (s != NULL && strchr(s, '~') != NULL)
goto parse_err;
if ((*manuf = strdup(_manuf)) == NULL) {
warn("strdup");
goto err;
}
if ((*version = strdup(_version)) == NULL) {
warn("strdup");
goto err;
}
if ((*device = strdup(_device)) == NULL) {
warn("strdup");
goto err;
}
if (*manuf == NULL || *version == NULL || *device == NULL) {
warn("strdup");
goto err;
}
rc = 0;
err:
return rc;
parse_err:
warnc(0, "Invalid response: %*s", rv, buf);
return rc;
}
const char *
strstate(int state)
{
switch (state) {
case 0:
return "empty";
case 1:
return "filled";
case 2:
return "inactive";
default:
return "unknown";
}
}
int
main(int ac, char **av)
{
char *path = NULL;
int so = -1;
int nslot;
int i;
if (proc_arg(ac, av) < 0)
goto out;
if ((so = connect_to_pccardd(&path)) < 0)
goto out;
if ((nslot = get_slot_number(so)) < 0)
goto out;
if (slot_map == 0) {
printf("%d\n", nslot);
} else {
for (i = 0; i < nslot; i++) {
if ((slot_map & (1 << i))) {
char *manuf;
char *version;
char *device;
int state;
if (get_slot_info(so, i, &manuf, &version, &device,
&state) < 0)
goto out;
if (manuf == NULL || version == NULL || device == NULL)
goto out;
printf("%d~%s~%s~%s~%s\n",
i, manuf, version, device, strstate(state));
free(manuf);
free(version);
free(device);
}
}
}
out:
if (path) {
unlink(path);
free(path);
}
if (so >= 0)
close(so);
exit(0);
}
diff --git a/usr.sbin/bluetooth/btpand/bnep.c b/usr.sbin/bluetooth/btpand/bnep.c
index 9c53a5ff2519..5fdcd9407525 100644
--- a/usr.sbin/bluetooth/btpand/bnep.c
+++ b/usr.sbin/bluetooth/btpand/bnep.c
@@ -1,758 +1,757 @@
/* $NetBSD: bnep.c,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: bnep.c,v 1.1 2008/08/17 13:20:57 plunky Exp $");
#include <sys/uio.h>
#define L2CAP_SOCKET_CHECKED
#include <bluetooth.h>
#include <sdp.h>
#include <stdarg.h>
#include <string.h>
#include <unistd.h>
#include "btpand.h"
#include "bnep.h"
static bool bnep_recv_extension(packet_t *);
static size_t bnep_recv_control(channel_t *, uint8_t *, size_t, bool);
static size_t bnep_recv_control_command_not_understood(channel_t *, uint8_t *, size_t);
static size_t bnep_recv_setup_connection_req(channel_t *, uint8_t *, size_t);
static size_t bnep_recv_setup_connection_rsp(channel_t *, uint8_t *, size_t);
static size_t bnep_recv_filter_net_type_set(channel_t *, uint8_t *, size_t);
static size_t bnep_recv_filter_net_type_rsp(channel_t *, uint8_t *, size_t);
static size_t bnep_recv_filter_multi_addr_set(channel_t *, uint8_t *, size_t);
static size_t bnep_recv_filter_multi_addr_rsp(channel_t *, uint8_t *, size_t);
static bool bnep_pfilter(channel_t *, packet_t *);
static bool bnep_mfilter(channel_t *, packet_t *);
static uint8_t NAP_UUID[] = {
0x00, 0x00, 0x11, 0x16,
0x00, 0x00,
0x10, 0x00,
0x80, 0x00,
0x00, 0x80, 0x5f, 0x9b, 0x34, 0xfb
};
static uint8_t GN_UUID[] = {
0x00, 0x00, 0x11, 0x17,
0x00, 0x00,
0x10, 0x00,
0x80, 0x00,
0x00, 0x80, 0x5f, 0x9b, 0x34, 0xfb,
};
static uint8_t PANU_UUID[] = {
0x00, 0x00, 0x11, 0x15,
0x00, 0x00,
0x10, 0x00,
0x80, 0x00,
0x00, 0x80, 0x5f, 0x9b, 0x34, 0xfb
};
/*
* receive BNEP packet
* return true if packet is to be forwarded
*/
bool
bnep_recv(packet_t *pkt)
{
size_t len;
uint8_t type;
if (pkt->len < 1)
return false;
type = pkt->ptr[0];
packet_adj(pkt, 1);
switch (BNEP_TYPE(type)) {
case BNEP_GENERAL_ETHERNET:
if (pkt->len < (ETHER_ADDR_LEN * 2) + ETHER_TYPE_LEN) {
log_debug("dropped short packet (type 0x%2.2x)", type);
return false;
}
pkt->dst = pkt->ptr;
packet_adj(pkt, ETHER_ADDR_LEN);
pkt->src = pkt->ptr;
packet_adj(pkt, ETHER_ADDR_LEN);
pkt->type = pkt->ptr;
packet_adj(pkt, ETHER_TYPE_LEN);
break;
case BNEP_CONTROL:
len = bnep_recv_control(pkt->chan, pkt->ptr, pkt->len, false);
if (len == 0)
return false;
packet_adj(pkt, len);
break;
case BNEP_COMPRESSED_ETHERNET:
if (pkt->len < ETHER_TYPE_LEN) {
log_debug("dropped short packet (type 0x%2.2x)", type);
return false;
}
pkt->dst = pkt->chan->laddr;
pkt->src = pkt->chan->raddr;
pkt->type = pkt->ptr;
packet_adj(pkt, ETHER_TYPE_LEN);
break;
case BNEP_COMPRESSED_ETHERNET_SRC_ONLY:
if (pkt->len < ETHER_ADDR_LEN + ETHER_TYPE_LEN) {
log_debug("dropped short packet (type 0x%2.2x)", type);
return false;
}
pkt->dst = pkt->chan->laddr;
pkt->src = pkt->ptr;
packet_adj(pkt, ETHER_ADDR_LEN);
pkt->type = pkt->ptr;
packet_adj(pkt, ETHER_TYPE_LEN);
break;
case BNEP_COMPRESSED_ETHERNET_DST_ONLY:
if (pkt->len < ETHER_ADDR_LEN + ETHER_TYPE_LEN) {
log_debug("dropped short packet (type 0x%2.2x)", type);
return false;
}
pkt->dst = pkt->ptr;
packet_adj(pkt, ETHER_ADDR_LEN);
pkt->src = pkt->chan->raddr;
pkt->type = pkt->ptr;
packet_adj(pkt, ETHER_TYPE_LEN);
break;
default:
/*
* Any packet containing a reserved BNEP
* header packet type SHALL be dropped.
*/
log_debug("dropped packet with reserved type 0x%2.2x", type);
return false;
}
if (BNEP_TYPE_EXT(type)
&& !bnep_recv_extension(pkt))
return false; /* invalid extensions */
if (BNEP_TYPE(type) == BNEP_CONTROL
|| pkt->chan->state != CHANNEL_OPEN)
return false; /* no forwarding */
return true;
}
static bool
bnep_recv_extension(packet_t *pkt)
{
exthdr_t *eh;
size_t len, size;
uint8_t type;
do {
if (pkt->len < 2)
return false;
type = pkt->ptr[0];
size = pkt->ptr[1];
if (pkt->len < size + 2)
return false;
switch (type) {
case BNEP_EXTENSION_CONTROL:
len = bnep_recv_control(pkt->chan, pkt->ptr + 2, size, true);
if (len != size)
log_err("ignored spurious data in exthdr");
break;
default:
/* Unknown extension headers in data packets */
/* SHALL be forwarded irrespective of any */
/* network protocol or multicast filter settings */
/* and any local filtering policy. */
eh = malloc(sizeof(exthdr_t));
if (eh == NULL) {
log_err("exthdr malloc() failed: %m");
break;
}
eh->ptr = pkt->ptr;
eh->len = size;
STAILQ_INSERT_TAIL(&pkt->extlist, eh, next);
break;
}
packet_adj(pkt, size + 2);
} while (BNEP_TYPE_EXT(type));
return true;
}
static size_t
bnep_recv_control(channel_t *chan, uint8_t *ptr, size_t size, bool isext)
{
uint8_t type;
size_t len;
if (size-- < 1)
return 0;
type = *ptr++;
switch (type) {
case BNEP_CONTROL_COMMAND_NOT_UNDERSTOOD:
len = bnep_recv_control_command_not_understood(chan, ptr, size);
break;
case BNEP_SETUP_CONNECTION_REQUEST:
if (isext)
return 0; /* not allowed in extension headers */
len = bnep_recv_setup_connection_req(chan, ptr, size);
break;
case BNEP_SETUP_CONNECTION_RESPONSE:
if (isext)
return 0; /* not allowed in extension headers */
len = bnep_recv_setup_connection_rsp(chan, ptr, size);
break;
case BNEP_FILTER_NET_TYPE_SET:
len = bnep_recv_filter_net_type_set(chan, ptr, size);
break;
case BNEP_FILTER_NET_TYPE_RESPONSE:
len = bnep_recv_filter_net_type_rsp(chan, ptr, size);
break;
case BNEP_FILTER_MULTI_ADDR_SET:
len = bnep_recv_filter_multi_addr_set(chan, ptr, size);
break;
case BNEP_FILTER_MULTI_ADDR_RESPONSE:
len = bnep_recv_filter_multi_addr_rsp(chan, ptr, size);
break;
default:
len = 0;
break;
}
if (len == 0)
bnep_send_control(chan, BNEP_CONTROL_COMMAND_NOT_UNDERSTOOD, type);
return len;
}
static size_t
bnep_recv_control_command_not_understood(channel_t *chan, uint8_t *ptr, size_t size)
{
uint8_t type;
if (size < 1)
return 0;
type = *ptr++;
log_err("received Control Command Not Understood (0x%2.2x)", type);
/* we didn't send any reserved commands, just cut them off */
channel_close(chan);
return 1;
}
static size_t
bnep_recv_setup_connection_req(channel_t *chan, uint8_t *ptr, size_t size)
{
uint8_t off;
int src, dst, rsp;
size_t len;
if (size < 1)
return 0;
len = *ptr++;
if (size < (len * 2 + 1))
return 0;
if (chan->state != CHANNEL_WAIT_CONNECT_REQ
&& chan->state != CHANNEL_OPEN) {
log_debug("ignored");
return (len * 2 + 1);
}
if (len == 2)
off = 2;
else if (len == 4)
off = 0;
else if (len == 16)
off = 0;
else {
rsp = BNEP_SETUP_INVALID_UUID_SIZE;
goto done;
}
if (memcmp(ptr, NAP_UUID + off, len) == 0)
dst = SDP_SERVICE_CLASS_NAP;
else if (memcmp(ptr, GN_UUID + off, len) == 0)
dst = SDP_SERVICE_CLASS_GN;
else if (memcmp(ptr, PANU_UUID + off, len) == 0)
dst = SDP_SERVICE_CLASS_PANU;
else
dst = 0;
if (dst != service_class) {
rsp = BNEP_SETUP_INVALID_DST_UUID;
goto done;
}
ptr += len;
if (memcmp(ptr, NAP_UUID + off, len) == 0)
src = SDP_SERVICE_CLASS_NAP;
else if (memcmp(ptr, GN_UUID + off, len) == 0)
src = SDP_SERVICE_CLASS_GN;
else if (memcmp(ptr, PANU_UUID + off, len) == 0)
src = SDP_SERVICE_CLASS_PANU;
else
src = 0;
if ((dst != SDP_SERVICE_CLASS_PANU && src != SDP_SERVICE_CLASS_PANU)
|| src == 0) {
rsp = BNEP_SETUP_INVALID_SRC_UUID;
goto done;
}
rsp = BNEP_SETUP_SUCCESS;
chan->state = CHANNEL_OPEN;
channel_timeout(chan, 0);
done:
log_debug("addr %s response 0x%2.2x",
ether_ntoa((struct ether_addr *)chan->raddr), rsp);
bnep_send_control(chan, BNEP_SETUP_CONNECTION_RESPONSE, rsp);
return (len * 2 + 1);
}
static size_t
bnep_recv_setup_connection_rsp(channel_t *chan, uint8_t *ptr, size_t size)
{
int rsp;
if (size < 2)
return 0;
rsp = be16dec(ptr);
if (chan->state != CHANNEL_WAIT_CONNECT_RSP) {
log_debug("ignored");
return 2;
}
log_debug("addr %s response 0x%2.2x",
ether_ntoa((struct ether_addr *)chan->raddr), rsp);
if (rsp == BNEP_SETUP_SUCCESS) {
chan->state = CHANNEL_OPEN;
channel_timeout(chan, 0);
} else {
channel_close(chan);
}
return 2;
}
static size_t
bnep_recv_filter_net_type_set(channel_t *chan, uint8_t *ptr, size_t size)
{
pfilter_t *pf;
int i, nf, rsp;
size_t len;
if (size < 2)
return 0;
len = be16dec(ptr);
ptr += 2;
if (size < (len + 2))
return 0;
if (chan->state != CHANNEL_OPEN) {
log_debug("ignored");
return (len + 2);
}
nf = len / 4;
pf = malloc(nf * sizeof(pfilter_t));
if (pf == NULL) {
rsp = BNEP_FILTER_TOO_MANY_FILTERS;
goto done;
}
log_debug("nf = %d", nf);
for (i = 0; i < nf; i++) {
pf[i].start = be16dec(ptr);
ptr += 2;
pf[i].end = be16dec(ptr);
ptr += 2;
if (pf[i].start > pf[i].end) {
free(pf);
rsp = BNEP_FILTER_INVALID_RANGE;
goto done;
}
log_debug("pf[%d] = %#4.4x, %#4.4x", i, pf[i].start, pf[i].end);
}
if (chan->pfilter)
free(chan->pfilter);
chan->pfilter = pf;
chan->npfilter = nf;
rsp = BNEP_FILTER_SUCCESS;
done:
log_debug("addr %s response 0x%2.2x",
ether_ntoa((struct ether_addr *)chan->raddr), rsp);
bnep_send_control(chan, BNEP_FILTER_NET_TYPE_RESPONSE, rsp);
return (len + 2);
}
static size_t
bnep_recv_filter_net_type_rsp(channel_t *chan, uint8_t *ptr, size_t size)
{
int rsp;
if (size < 2)
return 0;
if (chan->state != CHANNEL_OPEN) {
log_debug("ignored");
return 2;
}
rsp = be16dec(ptr);
log_debug("addr %s response 0x%2.2x",
ether_ntoa((struct ether_addr *)chan->raddr), rsp);
/* we did not send any filter_net_type_set message */
return 2;
}
static size_t
bnep_recv_filter_multi_addr_set(channel_t *chan, uint8_t *ptr, size_t size)
{
mfilter_t *mf;
int i, nf, rsp;
size_t len;
if (size < 2)
return 0;
len = be16dec(ptr);
ptr += 2;
if (size < (len + 2))
return 0;
if (chan->state != CHANNEL_OPEN) {
log_debug("ignored");
return (len + 2);
}
nf = len / (ETHER_ADDR_LEN * 2);
mf = malloc(nf * sizeof(mfilter_t));
if (mf == NULL) {
rsp = BNEP_FILTER_TOO_MANY_FILTERS;
goto done;
}
log_debug("nf = %d", nf);
for (i = 0; i < nf; i++) {
memcpy(mf[i].start, ptr, ETHER_ADDR_LEN);
ptr += ETHER_ADDR_LEN;
memcpy(mf[i].end, ptr, ETHER_ADDR_LEN);
ptr += ETHER_ADDR_LEN;
if (memcmp(mf[i].start, mf[i].end, ETHER_ADDR_LEN) > 0) {
free(mf);
rsp = BNEP_FILTER_INVALID_RANGE;
goto done;
}
log_debug("pf[%d] = "
"%2.2x:%2.2x:%2.2x:%2.2x:%2.2x:%2.2x, "
"%2.2x:%2.2x:%2.2x:%2.2x:%2.2x:%2.2x", i,
mf[i].start[0], mf[i].start[1], mf[i].start[2],
mf[i].start[3], mf[i].start[4], mf[i].start[5],
mf[i].end[0], mf[i].end[1], mf[i].end[2],
mf[i].end[3], mf[i].end[4], mf[i].end[5]);
}
if (chan->mfilter)
free(chan->mfilter);
chan->mfilter = mf;
chan->nmfilter = nf;
rsp = BNEP_FILTER_SUCCESS;
done:
log_debug("addr %s response 0x%2.2x",
ether_ntoa((struct ether_addr *)chan->raddr), rsp);
bnep_send_control(chan, BNEP_FILTER_MULTI_ADDR_RESPONSE, rsp);
return (len + 2);
}
static size_t
bnep_recv_filter_multi_addr_rsp(channel_t *chan, uint8_t *ptr, size_t size)
{
int rsp;
if (size < 2)
return false;
if (chan->state != CHANNEL_OPEN) {
log_debug("ignored");
return 2;
}
rsp = be16dec(ptr);
log_debug("addr %s response 0x%2.2x",
ether_ntoa((struct ether_addr *)chan->raddr), rsp);
/* we did not send any filter_multi_addr_set message */
return 2;
}
void
bnep_send_control(channel_t *chan, unsigned type, ...)
{
packet_t *pkt;
uint8_t *p;
va_list ap;
assert(chan->state != CHANNEL_CLOSED);
pkt = packet_alloc(chan);
if (pkt == NULL)
return;
p = pkt->ptr;
va_start(ap, type);
*p++ = BNEP_CONTROL;
*p++ = (uint8_t)type;
switch(type) {
case BNEP_CONTROL_COMMAND_NOT_UNDERSTOOD:
*p++ = va_arg(ap, int);
break;
case BNEP_SETUP_CONNECTION_REQUEST:
*p++ = va_arg(ap, int);
be16enc(p, va_arg(ap, int));
p += 2;
be16enc(p, va_arg(ap, int));
p += 2;
break;
case BNEP_SETUP_CONNECTION_RESPONSE:
case BNEP_FILTER_NET_TYPE_RESPONSE:
case BNEP_FILTER_MULTI_ADDR_RESPONSE:
be16enc(p, va_arg(ap, int));
p += 2;
break;
case BNEP_FILTER_NET_TYPE_SET: /* TODO */
case BNEP_FILTER_MULTI_ADDR_SET: /* TODO */
default:
log_err("Can't send control type 0x%2.2x", type);
break;
}
va_end(ap);
pkt->len = p - pkt->ptr;
channel_put(chan, pkt);
packet_free(pkt);
}
/*
* BNEP send packet routine
* return true if packet can be removed from queue
*/
bool
bnep_send(channel_t *chan, packet_t *pkt)
{
struct iovec iov[2];
uint8_t *p, *type, *proto;
exthdr_t *eh;
bool src, dst;
size_t nw;
if (pkt->type == NULL) {
iov[0].iov_base = pkt->ptr;
iov[0].iov_len = pkt->len;
iov[1].iov_base = NULL;
iov[1].iov_len = 0;
} else {
p = chan->sendbuf;
dst = (memcmp(pkt->dst, chan->raddr, ETHER_ADDR_LEN) != 0);
src = (memcmp(pkt->src, chan->laddr, ETHER_ADDR_LEN) != 0);
type = p;
p += 1;
if (dst && src)
*type = BNEP_GENERAL_ETHERNET;
else if (dst && !src)
*type = BNEP_COMPRESSED_ETHERNET_DST_ONLY;
else if (!dst && src)
*type = BNEP_COMPRESSED_ETHERNET_SRC_ONLY;
else /* (!dst && !src) */
*type = BNEP_COMPRESSED_ETHERNET;
if (dst) {
memcpy(p, pkt->dst, ETHER_ADDR_LEN);
p += ETHER_ADDR_LEN;
}
if (src) {
memcpy(p, pkt->src, ETHER_ADDR_LEN);
p += ETHER_ADDR_LEN;
}
proto = p;
memcpy(p, pkt->type, ETHER_TYPE_LEN);
p += ETHER_TYPE_LEN;
STAILQ_FOREACH(eh, &pkt->extlist, next) {
if (p + eh->len > chan->sendbuf + chan->mtu)
break;
*type |= BNEP_EXT;
type = p;
memcpy(p, eh->ptr, eh->len);
p += eh->len;
}
*type &= ~BNEP_EXT;
iov[0].iov_base = chan->sendbuf;
iov[0].iov_len = (p - chan->sendbuf);
if ((chan->npfilter == 0 || bnep_pfilter(chan, pkt))
&& (chan->nmfilter == 0 || bnep_mfilter(chan, pkt))) {
iov[1].iov_base = pkt->ptr;
iov[1].iov_len = pkt->len;
} else if (be16dec(proto) == ETHERTYPE_VLAN
&& pkt->len >= ETHER_VLAN_ENCAP_LEN) {
iov[1].iov_base = pkt->ptr;
iov[1].iov_len = ETHER_VLAN_ENCAP_LEN;
} else {
iov[1].iov_base = NULL;
iov[1].iov_len = 0;
memset(proto, 0, ETHER_TYPE_LEN);
}
}
if (iov[0].iov_len + iov[1].iov_len > chan->mtu) {
log_err("packet exceeded MTU (dropped)");
return false;
}
nw = writev(chan->fd, iov, __arraycount(iov));
return (nw > 0);
}
static bool
bnep_pfilter(channel_t *chan, packet_t *pkt)
{
int proto, i;
proto = be16dec(pkt->type);
if (proto == ETHERTYPE_VLAN) { /* IEEE 802.1Q tag header */
if (pkt->len < 4)
return false;
proto = be16dec(pkt->ptr + 2);
}
for (i = 0; i < chan->npfilter; i++) {
if (chan->pfilter[i].start <= proto
&& chan->pfilter[i].end >=proto)
return true;
}
return false;
}
static bool
bnep_mfilter(channel_t *chan, packet_t *pkt)
{
int i;
if (!ETHER_IS_MULTICAST(pkt->dst))
return true;
for (i = 0; i < chan->nmfilter; i++) {
if (memcmp(pkt->dst, chan->mfilter[i].start, ETHER_ADDR_LEN) >= 0
&& memcmp(pkt->dst, chan->mfilter[i].end, ETHER_ADDR_LEN) <= 0)
return true;
}
return false;
}
diff --git a/usr.sbin/bluetooth/btpand/bnep.h b/usr.sbin/bluetooth/btpand/bnep.h
index e8c85c7b6353..7a187e551eed 100644
--- a/usr.sbin/bluetooth/btpand/bnep.h
+++ b/usr.sbin/bluetooth/btpand/bnep.h
@@ -1,74 +1,73 @@
/* $NetBSD: bnep.h,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* Constants defined in the Bluetooth Network Encapsulation
* Protocol (BNEP) specification v1.0
*/
#define BNEP_MTU_MIN 1691
#define BNEP_EXT 0x80
#define BNEP_TYPE(x) ((x) & 0x7f)
#define BNEP_TYPE_EXT(x) (((x) & BNEP_EXT) == BNEP_EXT)
/* BNEP packet types */
#define BNEP_GENERAL_ETHERNET 0x00
#define BNEP_CONTROL 0x01
#define BNEP_COMPRESSED_ETHERNET 0x02
#define BNEP_COMPRESSED_ETHERNET_SRC_ONLY 0x03
#define BNEP_COMPRESSED_ETHERNET_DST_ONLY 0x04
/* BNEP extension header types */
#define BNEP_EXTENSION_CONTROL 0x00
/* BNEP control types */
#define BNEP_CONTROL_COMMAND_NOT_UNDERSTOOD 0x00
#define BNEP_SETUP_CONNECTION_REQUEST 0x01
#define BNEP_SETUP_CONNECTION_RESPONSE 0x02
#define BNEP_FILTER_NET_TYPE_SET 0x03
#define BNEP_FILTER_NET_TYPE_RESPONSE 0x04
#define BNEP_FILTER_MULTI_ADDR_SET 0x05
#define BNEP_FILTER_MULTI_ADDR_RESPONSE 0x06
/* BNEP setup response codes */
#define BNEP_SETUP_SUCCESS 0x0000
#define BNEP_SETUP_INVALID_SRC_UUID 0x0001
#define BNEP_SETUP_INVALID_DST_UUID 0x0002
#define BNEP_SETUP_INVALID_UUID_SIZE 0x0003
#define BNEP_SETUP_NOT_ALLOWED 0x0004
/* BNEP filter return codes */
#define BNEP_FILTER_SUCCESS 0x0000
#define BNEP_FILTER_UNSUPPORTED_REQUEST 0x0001
#define BNEP_FILTER_INVALID_RANGE 0x0002
#define BNEP_FILTER_TOO_MANY_FILTERS 0x0003
#define BNEP_FILTER_SECURITY_FAILURE 0x0004
diff --git a/usr.sbin/bluetooth/btpand/btpand.c b/usr.sbin/bluetooth/btpand/btpand.c
index 6e215fe32269..a0f380918bf1 100644
--- a/usr.sbin/bluetooth/btpand/btpand.c
+++ b/usr.sbin/bluetooth/btpand/btpand.c
@@ -1,296 +1,295 @@
/* $NetBSD: btpand.c,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__COPYRIGHT("@(#) Copyright (c) 2008 Iain Hibbert. All rights reserved.");
__RCSID("$NetBSD: btpand.c,v 1.1 2008/08/17 13:20:57 plunky Exp $");
#include <sys/wait.h>
#define L2CAP_SOCKET_CHECKED
#include <bluetooth.h>
#include <err.h>
#include <fcntl.h>
#include <paths.h>
#include <sdp.h>
#include <stdio.h>
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "btpand.h"
/* global variables */
const char * control_path; /* -c <path> */
const char * interface_name; /* -i <ifname> */
const char * service_name; /* -s <service> */
uint16_t service_class;
bdaddr_t local_bdaddr; /* -d <addr> */
bdaddr_t remote_bdaddr; /* -a <addr> */
uint16_t l2cap_psm; /* -p <psm> */
int l2cap_mode; /* -m <mode> */
int server_limit; /* -n <limit> */
static const struct {
const char * name;
uint16_t class;
const char * desc;
} services[] = {
{ "PANU", SDP_SERVICE_CLASS_PANU, "Personal Area Networking User" },
{ "NAP", SDP_SERVICE_CLASS_NAP, "Network Access Point" },
{ "GN", SDP_SERVICE_CLASS_GN, "Group Network" },
};
static void main_exit(int);
static void main_detach(void);
static void usage(void);
int
main(int argc, char *argv[])
{
unsigned long ul;
char * ep;
int ch, status;
while ((ch = getopt(argc, argv, "a:c:d:i:l:m:p:S:s:")) != -1) {
switch (ch) {
case 'a': /* remote address */
if (!bt_aton(optarg, &remote_bdaddr)) {
struct hostent *he;
if ((he = bt_gethostbyname(optarg)) == NULL)
errx(EXIT_FAILURE, "%s: %s",
optarg, hstrerror(h_errno));
bdaddr_copy(&remote_bdaddr,
(bdaddr_t *)he->h_addr);
}
break;
case 'c': /* control socket path */
control_path = optarg;
break;
case 'd': /* local address */
if (!bt_devaddr(optarg, &local_bdaddr)) {
struct hostent *he;
if ((he = bt_gethostbyname(optarg)) == NULL)
errx(EXIT_FAILURE, "%s: %s",
optarg, hstrerror(h_errno));
bdaddr_copy(&local_bdaddr,
(bdaddr_t *)he->h_addr);
}
break;
case 'i': /* tap interface name */
if (strchr(optarg, '/') == NULL) {
asprintf(&ep, "/dev/%s", optarg);
interface_name = ep;
} else
interface_name = optarg;
break;
case 'l': /* limit server sessions */
ul = strtoul(optarg, &ep, 10);
if (*optarg == '\0' || *ep != '\0' || ul == 0)
errx(EXIT_FAILURE, "%s: invalid session limit",
optarg);
server_limit = ul;
break;
case 'm': /* link mode */
warnx("Setting link mode is not yet supported");
break;
case 'p': /* protocol/service multiplexer */
ul = strtoul(optarg, &ep, 0);
if (*optarg == '\0' || *ep != '\0'
|| ul > 0xffff || L2CAP_PSM_INVALID(ul))
errx(EXIT_FAILURE, "%s: invalid PSM", optarg);
l2cap_psm = ul;
break;
case 's': /* service */
case 'S': /* service (no SDP) */
for (ul = 0; strcasecmp(optarg, services[ul].name); ul++) {
if (ul == __arraycount(services))
errx(EXIT_FAILURE, "%s: unknown service", optarg);
}
if (ch == 's')
service_name = services[ul].name;
service_class = services[ul].class;
break;
default:
usage();
/* NOTREACHED */
}
}
argc -= optind;
argv += optind;
/* validate options */
if (bdaddr_any(&local_bdaddr) || service_class == 0)
usage();
if (!bdaddr_any(&remote_bdaddr) && (server_limit != 0 ||
control_path != NULL || (service_name != NULL && l2cap_psm != 0)))
usage();
/* default options */
if (interface_name == NULL)
interface_name = "/dev/tap";
if (l2cap_psm == 0)
l2cap_psm = L2CAP_PSM_BNEP;
if (bdaddr_any(&remote_bdaddr) && server_limit == 0) {
if (service_class == SDP_SERVICE_CLASS_PANU)
server_limit = 1;
else
server_limit = 7;
}
#ifdef L2CAP_LM_MASTER
if (server_limit > 1 && service_class != SDP_SERVICE_CLASS_PANU)
l2cap_mode |= L2CAP_LM_MASTER;
#endif
/*
* fork() now so that the setup can be done in the child process
* (as kqueue is not inherited) but block in the parent until the
* setup is finished so we can return an error if necessary.
*/
switch(fork()) {
case -1: /* bad */
err(EXIT_FAILURE, "fork() failed");
case 0: /* child */
signal(SIGPIPE, SIG_IGN);
openlog(getprogname(), LOG_NDELAY | LOG_PERROR | LOG_PID, LOG_DAEMON);
channel_init();
server_init();
event_init();
client_init();
tap_init();
main_detach();
event_dispatch();
break;
default: /* parent */
signal(SIGUSR1, main_exit);
wait(&status);
if (WIFEXITED(status))
exit(WEXITSTATUS(status));
break;
}
err(EXIT_FAILURE, "exiting");
}
static void
main_exit(int s)
{
/* child is all grown up */
_exit(EXIT_SUCCESS);
}
static void
main_detach(void)
{
int fd;
if (kill(getppid(), SIGUSR1) == -1)
log_err("Could not signal main process: %m");
if (setsid() == -1)
log_err("setsid() failed");
fd = open(_PATH_DEVNULL, O_RDWR, 0);
if (fd == -1) {
log_err("Could not open %s", _PATH_DEVNULL);
} else {
(void)dup2(fd, STDIN_FILENO);
(void)dup2(fd, STDOUT_FILENO);
(void)dup2(fd, STDERR_FILENO);
close(fd);
}
}
static void
usage(void)
{
const char *p = getprogname();
int n = strlen(p);
fprintf(stderr,
"usage: %s [-i ifname] [-m mode] -a address -d device\n"
" %*s {-s service | -S service [-p psm]}\n"
" %s [-c path] [-i ifname] [-l limit] [-m mode] [-p psm] -d device\n"
" %*s {-s service | -S service}\n"
"\n"
"Where:\n"
"\t-a address remote bluetooth device\n"
"\t-c path SDP server socket\n"
"\t-d device local bluetooth device\n"
"\t-i ifname tap interface\n"
"\t-l limit limit server sessions\n"
"\t-m mode L2CAP link mode (NOT YET SUPPORTED)\n"
"\t-p psm L2CAP PSM\n"
"\t-S service service name (no SDP)\n"
"\t-s service service name\n"
"\n"
"Known services:\n"
"", p, n, "", p, n, "");
for (n = 0; n < __arraycount(services); n++)
fprintf(stderr, "\t%s\t%s\n", services[n].name, services[n].desc);
exit(EXIT_FAILURE);
}
diff --git a/usr.sbin/bluetooth/btpand/btpand.h b/usr.sbin/bluetooth/btpand/btpand.h
index db09b581822f..a3beb7f211da 100644
--- a/usr.sbin/bluetooth/btpand/btpand.h
+++ b/usr.sbin/bluetooth/btpand/btpand.h
@@ -1,214 +1,213 @@
/* $NetBSD: btpand.h,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <net/if.h>
#include <net/ethernet.h>
#include <assert.h>
#include <bluetooth.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include "event.h"
#ifndef __arraycount
#define __arraycount(__x) (int)(sizeof((__x)) / sizeof((__x)[0]))
#endif
#ifndef L2CAP_PSM_INVALID
#define L2CAP_PSM_INVALID(psm) (((psm) & 0x0101) != 0x0001)
#endif
#ifndef L2CAP_PSM_BNEP
#define L2CAP_PSM_BNEP 15
#endif
typedef struct channel channel_t;
typedef struct pfilter pfilter_t;
typedef struct mfilter mfilter_t;
typedef struct packet packet_t;
typedef struct pkthdr pkthdr_t;
typedef struct pktlist pktlist_t;
typedef struct exthdr exthdr_t;
typedef struct extlist extlist_t;
LIST_HEAD(chlist, channel);
STAILQ_HEAD(extlist, exthdr);
STAILQ_HEAD(pktlist, pkthdr);
enum channel_state {
CHANNEL_CLOSED,
CHANNEL_WAIT_CONNECT_REQ,
CHANNEL_WAIT_CONNECT_RSP,
CHANNEL_OPEN,
};
#define CHANNEL_MAXQLEN 128
/* BNEP or tap channel */
struct channel {
enum channel_state state;
bool oactive;
uint8_t laddr[ETHER_ADDR_LEN];
uint8_t raddr[ETHER_ADDR_LEN];
size_t mru;
size_t mtu;
int npfilter;
pfilter_t * pfilter;
int nmfilter;
mfilter_t * mfilter;
pktlist_t pktlist;
int qlen;
int fd;
struct event rd_ev;
struct event wr_ev;
uint8_t * sendbuf;
bool (*send)(channel_t *, packet_t *);
bool (*recv)(packet_t *);
int tick;
struct pidfh *pfh;
int refcnt;
LIST_ENTRY(channel) next;
};
/* network protocol type filter */
struct pfilter {
uint16_t start;
uint16_t end;
};
/* multicast address filter */
struct mfilter {
uint8_t start[ETHER_ADDR_LEN];
uint8_t end[ETHER_ADDR_LEN];
};
/* packet data buffer */
struct packet {
channel_t * chan; /* source channel */
uint8_t * dst; /* dest address */
uint8_t * src; /* source address */
uint8_t * type; /* protocol type */
uint8_t * ptr; /* data pointer */
size_t len; /* data length */
int refcnt; /* reference count */
extlist_t extlist;/* extension headers */
uint8_t buf[0]; /* data starts here */
};
/* extension header */
struct exthdr {
STAILQ_ENTRY(exthdr) next;
uint8_t * ptr;
uint8_t len;
};
/* packet header */
struct pkthdr {
STAILQ_ENTRY(pkthdr) next;
packet_t * data;
};
/* global variables */
extern const char * control_path;
extern const char * service_name;
extern const char * interface_name;
extern bdaddr_t local_bdaddr;
extern bdaddr_t remote_bdaddr;
extern uint16_t l2cap_psm;
extern int l2cap_mode;
extern uint16_t service_class;
extern int server_limit;
/*
* Bluetooth addresses are stored the other way around than
* Ethernet addresses even though they are of the same family
*/
static inline void
b2eaddr(void *dst, bdaddr_t *src)
{
uint8_t *d = dst;
int i;
for (i = 0; i < ETHER_ADDR_LEN; i++)
d[i] = src->b[ETHER_ADDR_LEN - i - 1];
}
#define log_err(fmt, args...) syslog(LOG_ERR, fmt , ##args)
#define log_info(fmt, args...) syslog(LOG_INFO, fmt , ##args)
#define log_notice(fmt, args...) syslog(LOG_NOTICE, fmt , ##args)
#define log_debug(fmt, args...) syslog(LOG_DEBUG, "%s: " fmt, __func__ , ##args)
/* bnep.c */
bool bnep_send(channel_t *, packet_t *);
bool bnep_recv(packet_t *);
void bnep_send_control(channel_t *, unsigned, ...);
/* channel.c */
void channel_init(void);
channel_t * channel_alloc(void);
bool channel_open(channel_t *, int);
void channel_close(channel_t *);
void channel_free(channel_t *);
void channel_timeout(channel_t *, int);
void channel_put(channel_t *, packet_t *);
/* client.c */
void client_init(void);
/* packet.c */
packet_t * packet_alloc(channel_t *);
void packet_free(packet_t *);
void packet_adj(packet_t *, size_t);
pkthdr_t * pkthdr_alloc(packet_t *);
void pkthdr_free(pkthdr_t *);
/* server.c */
void server_init(void);
void server_update(int);
/* tap.c */
void tap_init(void);
diff --git a/usr.sbin/bluetooth/btpand/channel.c b/usr.sbin/bluetooth/btpand/channel.c
index abc912db7af3..960b1ae30152 100644
--- a/usr.sbin/bluetooth/btpand/channel.c
+++ b/usr.sbin/bluetooth/btpand/channel.c
@@ -1,337 +1,336 @@
/* $NetBSD: channel.c,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: channel.c,v 1.1 2008/08/17 13:20:57 plunky Exp $");
#include <sys/param.h>
#include <sys/ioctl.h>
#include <libutil.h>
#include <unistd.h>
#define L2CAP_SOCKET_CHECKED
#include "btpand.h"
static struct chlist channel_list;
static int channel_count;
static int channel_tick;
static void channel_start(int, short, void *);
static void channel_read(int, short, void *);
static void channel_dispatch(packet_t *);
static void channel_watchdog(int, short, void *);
void
channel_init(void)
{
LIST_INIT(&channel_list);
}
channel_t *
channel_alloc(void)
{
channel_t *chan;
chan = malloc(sizeof(channel_t));
if (chan == NULL) {
log_err("%s() failed: %m", __func__);
return NULL;
}
memset(chan, 0, sizeof(channel_t));
STAILQ_INIT(&chan->pktlist);
chan->state = CHANNEL_CLOSED;
LIST_INSERT_HEAD(&channel_list, chan, next);
server_update(++channel_count);
return chan;
}
bool
channel_open(channel_t *chan, int fd)
{
int n;
assert(chan->refcnt == 0);
assert(chan->state != CHANNEL_CLOSED);
if (chan->mtu > 0) {
chan->sendbuf = malloc(chan->mtu);
if (chan->sendbuf == NULL) {
log_err("Could not malloc channel sendbuf: %m");
return false;
}
}
n = 1;
if (ioctl(fd, FIONBIO, &n) == -1) {
log_err("Could not set non-blocking IO: %m");
return false;
}
event_set(&chan->rd_ev, fd, EV_READ | EV_PERSIST, channel_read, chan);
if (event_add(&chan->rd_ev, NULL) == -1) {
log_err("Could not add channel read event: %m");
return false;
}
event_set(&chan->wr_ev, fd, EV_WRITE, channel_start, chan);
chan->refcnt++;
chan->fd = fd;
log_debug("(fd#%d)", chan->fd);
return true;
}
void
channel_close(channel_t *chan)
{
pkthdr_t *ph;
assert(chan->state != CHANNEL_CLOSED);
log_debug("(fd#%d)", chan->fd);
chan->state = CHANNEL_CLOSED;
event_del(&chan->rd_ev);
event_del(&chan->wr_ev);
close(chan->fd);
chan->refcnt--;
chan->tick = 0;
while ((ph = STAILQ_FIRST(&chan->pktlist)) != NULL) {
STAILQ_REMOVE_HEAD(&chan->pktlist, next);
pkthdr_free(ph);
chan->qlen--;
}
if (chan->pfh != NULL) {
pidfile_remove(chan->pfh);
chan->pfh = NULL;
}
if (chan->refcnt == 0)
channel_free(chan);
}
void
channel_free(channel_t *chan)
{
assert(chan->refcnt == 0);
assert(chan->state == CHANNEL_CLOSED);
assert(chan->qlen == 0);
assert(STAILQ_EMPTY(&chan->pktlist));
LIST_REMOVE(chan, next);
free(chan->pfilter);
free(chan->mfilter);
free(chan->sendbuf);
free(chan);
server_update(--channel_count);
if (server_limit == 0) {
log_info("connection closed, exiting");
exit(EXIT_SUCCESS);
}
}
static void
channel_start(int fd, short ev, void *arg)
{
channel_t *chan = arg;
pkthdr_t *ph;
chan->oactive = true;
while (chan->qlen > 0) {
ph = STAILQ_FIRST(&chan->pktlist);
channel_timeout(chan, 10);
if (chan->send(chan, ph->data) == false) {
if (event_add(&chan->wr_ev, NULL) == -1) {
log_err("Could not add channel write event: %m");
channel_close(chan);
}
return;
}
STAILQ_REMOVE_HEAD(&chan->pktlist, next);
pkthdr_free(ph);
chan->qlen--;
}
channel_timeout(chan, 0);
chan->oactive = false;
}
static void
channel_read(int fd, short ev, void *arg)
{
channel_t *chan = arg;
packet_t *pkt;
ssize_t nr;
pkt = packet_alloc(chan);
if (pkt == NULL) {
channel_close(chan);
return;
}
nr = read(fd, pkt->buf, chan->mru);
if (nr == -1) {
log_err("channel read error: %m");
packet_free(pkt);
channel_close(chan);
return;
}
if (nr == 0) { /* EOF */
log_debug("(fd#%d) EOF", fd);
packet_free(pkt);
channel_close(chan);
return;
}
pkt->len = nr;
if (chan->recv(pkt) == true)
channel_dispatch(pkt);
packet_free(pkt);
}
static void
channel_dispatch(packet_t *pkt)
{
channel_t *chan;
/*
* This is simple routing. I'm not sure if its allowed by
* the PAN or BNEP specifications, but it seems logical
* to send unicast packets to connected destinations where
* possible.
*/
if (!ETHER_IS_MULTICAST(pkt->dst)) {
LIST_FOREACH(chan, &channel_list, next) {
if (chan == pkt->chan
|| chan->state != CHANNEL_OPEN)
continue;
if (memcmp(pkt->dst, chan->raddr, ETHER_ADDR_LEN) == 0) {
if (chan->qlen > CHANNEL_MAXQLEN)
log_notice("Queue overflow");
else
channel_put(chan, pkt);
return;
}
}
}
LIST_FOREACH(chan, &channel_list, next) {
if (chan == pkt->chan
|| chan->state != CHANNEL_OPEN)
continue;
if (chan->qlen > CHANNEL_MAXQLEN) {
log_notice("Queue overflow");
continue;
}
channel_put(chan, pkt);
}
}
void
channel_put(channel_t *chan, packet_t *pkt)
{
pkthdr_t *ph;
ph = pkthdr_alloc(pkt);
if (ph == NULL)
return;
chan->qlen++;
STAILQ_INSERT_TAIL(&chan->pktlist, ph, next);
if (!chan->oactive)
channel_start(chan->fd, EV_WRITE, chan);
}
/*
* Simple watchdog timer, only ticks when it is required and
* closes the channel down if it times out.
*/
void
channel_timeout(channel_t *chan, int to)
{
static struct event ev;
if (to == 0)
chan->tick = 0;
else
chan->tick = (channel_tick + to) % 60;
if (channel_tick == 0) {
evtimer_set(&ev, channel_watchdog, &ev);
channel_watchdog(0, 0, &ev);
}
}
static void
channel_watchdog(int fd, short ev, void *arg)
{
static struct timeval tv = { .tv_sec = 1 };
channel_t *chan, *next;
int tick;
tick = (channel_tick % 60) + 1;
channel_tick = 0;
next = LIST_FIRST(&channel_list);
while ((chan = next) != NULL) {
next = LIST_NEXT(chan, next);
if (chan->tick == tick)
channel_close(chan);
else if (chan->tick != 0)
channel_tick = tick;
}
if (channel_tick != 0 && evtimer_add(arg, &tv) < 0) {
log_err("Could not add watchdog event: %m");
exit(EXIT_FAILURE);
}
}
diff --git a/usr.sbin/bluetooth/btpand/client.c b/usr.sbin/bluetooth/btpand/client.c
index e4aa0aec9430..ecef7e9c3c14 100644
--- a/usr.sbin/bluetooth/btpand/client.c
+++ b/usr.sbin/bluetooth/btpand/client.c
@@ -1,230 +1,229 @@
/* $NetBSD: client.c,v 1.2 2008/12/06 20:01:14 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: client.c,v 1.2 2008/12/06 20:01:14 plunky Exp $");
#define L2CAP_SOCKET_CHECKED
#include <bluetooth.h>
#include <errno.h>
#include <sdp.h>
#include <unistd.h>
#include "btpand.h"
#include "bnep.h"
#include "sdp.h"
static void client_query(void);
void
client_init(void)
{
struct sockaddr_l2cap sa;
channel_t *chan;
socklen_t len;
int fd, n;
uint16_t mru, mtu;
if (bdaddr_any(&remote_bdaddr))
return;
if (service_name)
client_query();
fd = socket(PF_BLUETOOTH, SOCK_SEQPACKET, BLUETOOTH_PROTO_L2CAP);
if (fd == -1) {
log_err("Could not open L2CAP socket: %m");
exit(EXIT_FAILURE);
}
memset(&sa, 0, sizeof(sa));
sa.l2cap_family = AF_BLUETOOTH;
sa.l2cap_len = sizeof(sa);
sa.l2cap_bdaddr_type = BDADDR_BREDR;
sa.l2cap_cid = 0;
bdaddr_copy(&sa.l2cap_bdaddr, &local_bdaddr);
if (bind(fd, (struct sockaddr *)&sa, sizeof(sa)) == -1) {
log_err("Could not bind client socket: %m");
exit(EXIT_FAILURE);
}
mru = BNEP_MTU_MIN;
if (setsockopt(fd, SOL_L2CAP, SO_L2CAP_IMTU, &mru, sizeof(mru)) == -1) {
log_err("Could not set L2CAP IMTU (%d): %m", mru);
exit(EXIT_FAILURE);
}
log_info("Opening connection to service 0x%4.4x at %s",
service_class, bt_ntoa(&remote_bdaddr, NULL));
sa.l2cap_psm = htole16(l2cap_psm);
bdaddr_copy(&sa.l2cap_bdaddr, &remote_bdaddr);
if (connect(fd, (struct sockaddr *)&sa, sizeof(sa)) == -1) {
log_err("Could not connect: %m");
exit(EXIT_FAILURE);
}
len = sizeof(mru);
if (getsockopt(fd, SOL_L2CAP, SO_L2CAP_IMTU, &mru, &len) == -1) {
log_err("Could not get IMTU: %m");
exit(EXIT_FAILURE);
}
if (mru < BNEP_MTU_MIN) {
log_err("L2CAP IMTU too small (%d)", mru);
exit(EXIT_FAILURE);
}
len = sizeof(n);
if (getsockopt(fd, SOL_SOCKET, SO_RCVBUF, &n, &len) == -1) {
log_err("Could not read SO_RCVBUF");
exit(EXIT_FAILURE);
}
if (n < (mru * 10)) {
n = mru * 10;
if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &n, sizeof(n)) == -1)
log_info("Could not increase SO_RCVBUF (from %d)", n);
}
len = sizeof(mtu);
if (getsockopt(fd, SOL_L2CAP, SO_L2CAP_OMTU, &mtu, &len) == -1) {
log_err("Could not get L2CAP OMTU: %m");
exit(EXIT_FAILURE);
}
if (mtu < BNEP_MTU_MIN) {
log_err("L2CAP OMTU too small (%d)", mtu);
exit(EXIT_FAILURE);
}
len = sizeof(n);
if (getsockopt(fd, SOL_SOCKET, SO_SNDBUF, &n, &len) == -1) {
log_err("Could not get socket send buffer size: %m");
close(fd);
return;
}
if (n < (mtu * 2)) {
n = mtu * 2;
if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &n, sizeof(n)) == -1) {
log_err("Could not set socket send buffer size (%d): %m", n);
close(fd);
return;
}
}
n = mtu;
if (setsockopt(fd, SOL_SOCKET, SO_SNDLOWAT, &n, sizeof(n)) == -1) {
log_err("Could not set socket low water mark (%d): %m", n);
close(fd);
return;
}
chan = channel_alloc();
if (chan == NULL)
exit(EXIT_FAILURE);
chan->send = bnep_send;
chan->recv = bnep_recv;
chan->mru = mru;
chan->mtu = mtu;
b2eaddr(chan->raddr, &remote_bdaddr);
b2eaddr(chan->laddr, &local_bdaddr);
chan->state = CHANNEL_WAIT_CONNECT_RSP;
channel_timeout(chan, 10);
if (!channel_open(chan, fd))
exit(EXIT_FAILURE);
bnep_send_control(chan, BNEP_SETUP_CONNECTION_REQUEST,
2, service_class, SDP_SERVICE_CLASS_PANU);
}
static void
client_query(void)
{
uint8_t buffer[512];
sdp_attr_t attr;
uint32_t range;
void *ss;
int rv;
uint8_t *seq0, *seq1;
attr.flags = SDP_ATTR_INVALID;
attr.attr = 0;
attr.vlen = sizeof(buffer);
attr.value = buffer;
range = SDP_ATTR_RANGE(SDP_ATTR_PROTOCOL_DESCRIPTOR_LIST,
SDP_ATTR_PROTOCOL_DESCRIPTOR_LIST);
ss = sdp_open(&local_bdaddr, &remote_bdaddr);
if (ss == NULL || (errno = sdp_error(ss)) != 0) {
log_err("%s: %m", service_name);
exit(EXIT_FAILURE);
}
log_info("Searching for %s service at %s",
service_name, bt_ntoa(&remote_bdaddr, NULL));
rv = sdp_search(ss, 1, &service_class, 1, &range, 1, &attr);
if (rv != 0) {
log_err("%s: %s", service_name, strerror(sdp_error(ss)));
exit(EXIT_FAILURE);
}
sdp_close(ss);
if (attr.flags != SDP_ATTR_OK
|| attr.attr != SDP_ATTR_PROTOCOL_DESCRIPTOR_LIST) {
log_err("%s service not found", service_name);
exit(EXIT_FAILURE);
}
/*
* we expect the following protocol descriptor list
*
* seq len
* seq len
* uuid value == L2CAP
* uint16 value16 => PSM
* seq len
* uuid value == BNEP
*/
if (_sdp_get_seq(&attr.value, attr.value + attr.vlen, &seq0)
&& _sdp_get_seq(&seq0, attr.value, &seq1)
&& _sdp_match_uuid16(&seq1, seq0, SDP_UUID_PROTOCOL_L2CAP)
&& _sdp_get_uint16(&seq1, seq0, &l2cap_psm)
&& _sdp_get_seq(&seq0, attr.value, &seq1)
&& _sdp_match_uuid16(&seq1, seq0, SDP_UUID_PROTOCOL_BNEP)) {
log_info("Found PSM %d for service %s", l2cap_psm, service_name);
return;
}
log_err("%s query failed", service_name);
exit(EXIT_FAILURE);
}
diff --git a/usr.sbin/bluetooth/btpand/event.c b/usr.sbin/bluetooth/btpand/event.c
index f87084add858..61825b63a3fc 100644
--- a/usr.sbin/bluetooth/btpand/event.c
+++ b/usr.sbin/bluetooth/btpand/event.c
@@ -1,312 +1,311 @@
/*
* event.h
*/
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Maksim Yevmenkin <m_evmenkin@yahoo.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* Hack to provide libevent (see devel/libevent port) like API.
* Should be removed if FreeBSD ever decides to import libevent into base.
*/
#include <sys/select.h>
#include <sys/time.h>
#include <sys/queue.h>
#include <assert.h>
#include <stdarg.h>
#include <stdio.h>
#include <string.h>
#include <syslog.h>
#include "event.h"
#define L2CAP_SOCKET_CHECKED
#include "btpand.h"
#define __event_link(ev) \
do { \
TAILQ_INSERT_TAIL(&pending, ev, next); \
ev->flags |= EV_PENDING; \
} while (0)
static void tv_add(struct timeval *, struct timeval const *);
static void tv_sub(struct timeval *, struct timeval const *);
static int tv_cmp(struct timeval const *, struct timeval const *);
static int __event_dispatch(void);
static void __event_add_current(struct event *);
static void __event_del_current(struct event *);
static TAILQ_HEAD(, event) pending;
static TAILQ_HEAD(, event) current;
void
event_init(void)
{
TAILQ_INIT(&pending);
}
int
event_dispatch(void)
{
while (__event_dispatch() == 0)
;
return (-1);
}
static int
__event_dispatch(void)
{
fd_set r, w;
int nfd;
struct event *ev;
struct timeval now, timeout, t;
FD_ZERO(&r);
FD_ZERO(&w);
nfd = 0;
gettimeofday(&now, NULL);
timeout.tv_sec = 10; /* arbitrary */
timeout.tv_usec = 0;
TAILQ_INIT(&current);
/*
* Build fd_set's
*/
event_log_debug("%s: building fd set...", __func__);
while (!TAILQ_EMPTY(&pending)) {
ev = TAILQ_FIRST(&pending);
event_del(ev);
if (ev->flags & EV_HAS_TIMEOUT) {
if (tv_cmp(&now, &ev->expire) >= 0)
t.tv_sec = t.tv_usec = 0;
else {
t = ev->expire;
tv_sub(&t, &now);
}
if (tv_cmp(&t, &timeout) < 0)
timeout = t;
}
if (ev->fd >= 0) {
if (ev->flags & EV_READ) {
FD_SET(ev->fd, &r);
nfd = (nfd > ev->fd) ? nfd : ev->fd;
}
if (ev->flags & EV_WRITE) {
FD_SET(ev->fd, &w);
nfd = (nfd > ev->fd) ? nfd : ev->fd;
}
}
__event_add_current(ev);
}
event_log_debug("%s: waiting for events...", __func__);
nfd = select(nfd + 1, &r, &w, NULL, &timeout);
if (nfd < 0)
return (-1);
/*
* Process current pending
*/
event_log_debug("%s: processing events...", __func__);
gettimeofday(&now, NULL);
while (!TAILQ_EMPTY(&current)) {
ev = TAILQ_FIRST(&current);
__event_del_current(ev);
/* check if fd is ready for reading/writing */
if (nfd > 0 && ev->fd >= 0) {
if (FD_ISSET(ev->fd, &r) || FD_ISSET(ev->fd, &w)) {
if (ev->flags & EV_PERSIST) {
if (ev->flags & EV_HAS_TIMEOUT)
event_add(ev, &ev->timeout);
else
event_add(ev, NULL);
}
nfd --;
event_log_debug("%s: calling %p(%d, %p), " \
"ev=%p", __func__, ev->cb, ev->fd,
ev->cbarg, ev);
(ev->cb)(ev->fd,
(ev->flags & (EV_READ|EV_WRITE)),
ev->cbarg);
continue;
}
}
/* if event has no timeout - just requeue */
if ((ev->flags & EV_HAS_TIMEOUT) == 0) {
event_add(ev, NULL);
continue;
}
/* check if event has expired */
if (tv_cmp(&now, &ev->expire) >= 0) {
if (ev->flags & EV_PERSIST)
event_add(ev, &ev->timeout);
event_log_debug("%s: calling %p(%d, %p), ev=%p",
__func__, ev->cb, ev->fd, ev->cbarg, ev);
(ev->cb)(ev->fd,
(ev->flags & (EV_READ|EV_WRITE)),
ev->cbarg);
continue;
}
assert((ev->flags & (EV_PENDING|EV_CURRENT)) == 0);
__event_link(ev);
}
return (0);
}
void
__event_set(struct event *ev, int fd, short flags,
void (*cb)(int, short, void *), void *cbarg)
{
ev->fd = fd;
ev->flags = flags;
ev->cb = cb;
ev->cbarg = cbarg;
}
int
__event_add(struct event *ev, const struct timeval *timeout)
{
assert((ev->flags & (EV_PENDING|EV_CURRENT)) == 0);
if (timeout != NULL) {
gettimeofday(&ev->expire, NULL);
tv_add(&ev->expire, timeout);
ev->timeout = *timeout;
ev->flags |= EV_HAS_TIMEOUT;
} else
ev->flags &= ~EV_HAS_TIMEOUT;
__event_link(ev);
return (0);
}
int
__event_del(struct event *ev)
{
assert((ev->flags & EV_CURRENT) == 0);
if ((ev->flags & EV_PENDING) != 0) {
TAILQ_REMOVE(&pending, ev, next);
ev->flags &= ~EV_PENDING;
}
return (0);
}
static void
__event_add_current(struct event *ev)
{
assert((ev->flags & (EV_PENDING|EV_CURRENT)) == 0);
TAILQ_INSERT_TAIL(&current, ev, next);
ev->flags |= EV_CURRENT;
}
static void
__event_del_current(struct event *ev)
{
assert((ev->flags & (EV_CURRENT|EV_PENDING)) == EV_CURRENT);
TAILQ_REMOVE(&current, ev, next);
ev->flags &= ~EV_CURRENT;
}
static void
tv_add(struct timeval *a, struct timeval const *b)
{
a->tv_sec += b->tv_sec;
a->tv_usec += b->tv_usec;
if(a->tv_usec >= 1000000) {
a->tv_usec -= 1000000;
a->tv_sec += 1;
}
}
static void
tv_sub(struct timeval *a, struct timeval const *b)
{
if (a->tv_usec < b->tv_usec) {
a->tv_usec += 1000000;
a->tv_sec -= 1;
}
a->tv_usec -= b->tv_usec;
a->tv_sec -= b->tv_sec;
}
static int
tv_cmp(struct timeval const *a, struct timeval const *b)
{
if (a->tv_sec > b->tv_sec)
return (1);
if (a->tv_sec < b->tv_sec)
return (-1);
if (a->tv_usec > b->tv_usec)
return (1);
if (a->tv_usec < b->tv_usec)
return (-1);
return (0);
}
diff --git a/usr.sbin/bluetooth/btpand/event.h b/usr.sbin/bluetooth/btpand/event.h
index e7a0341ceec8..dd588e86f6bf 100644
--- a/usr.sbin/bluetooth/btpand/event.h
+++ b/usr.sbin/bluetooth/btpand/event.h
@@ -1,149 +1,148 @@
/*
* event.h
*/
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2009 Maksim Yevmenkin <m_evmenkin@yahoo.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
/*
* Hack to provide libevent (see devel/libevent port) like API.
* Should be removed if FreeBSD ever decides to import libevent into base.
*/
#ifndef _EVENT_H_
#define _EVENT_H_ 1
#define EV_READ 0x02
#define EV_WRITE 0x04
#define EV_PERSIST 0x10 /* Persistent event */
#define EV_PENDING (1 << 13) /* internal use only! */
#define EV_HAS_TIMEOUT (1 << 14) /* internal use only! */
#define EV_CURRENT (1 << 15) /* internal use only! */
struct event
{
int fd;
short flags;
void (*cb)(int, short, void *);
void *cbarg;
struct timeval timeout;
struct timeval expire;
#ifdef EVENT_DEBUG
char const *files[3];
int lines[3];
#endif
TAILQ_ENTRY(event) next;
};
void event_init (void);
int event_dispatch (void);
void __event_set (struct event *, int, short,
void (*)(int, short, void *), void *);
int __event_add (struct event *, struct timeval const *);
int __event_del (struct event *);
#ifdef EVENT_DEBUG
#define event_log_err(fmt, args...) syslog(LOG_ERR, fmt, ##args)
#define event_log_info(fmt, args...) syslog(LOG_INFO, fmt, ##args)
#define event_log_notice(fmt, args...) syslog(LOG_NOTICE, fmt, ##args)
#define event_log_debug(fmt, args...) syslog(LOG_DEBUG, fmt, ##args)
#define event_set(ev, fd, flags, cb, cbarg) \
_event_set(__FILE__, __LINE__, ev, fd, flags, cb, cbarg)
#define event_add(ev, timeout) \
_event_add(__FILE__, __LINE__, ev, timeout)
#define event_del(ev) \
_event_del(__FILE__, __LINE__, ev)
#define evtimer_set(ev, cb, cbarg) \
_event_set(__FILE__, __LINE__, ev, -1, 0, cb, cbarg)
#define evtimer_add(ev, timeout) \
_event_add(__FILE__, __LINE__, ev, timeout)
static inline void
_event_set(char const *file, int line, struct event *ev, int fd, short flags,
void (*cb)(int, short, void *), void *cbarg)
{
event_log_debug("set %s:%d ev=%p, fd=%d, flags=%#x, cb=%p, cbarg=%p",
file, line, ev, fd, flags, cb, cbarg);
ev->files[0] = file;
ev->lines[0] = line;
__event_set(ev, fd, flags, cb, cbarg);
}
static inline int
_event_add(char const *file, int line, struct event *ev,
struct timeval const *timeout) {
event_log_debug("add %s:%d ev=%p, fd=%d, flags=%#x, cb=%p, cbarg=%p, " \
"timeout=%p", file, line, ev, ev->fd, ev->flags, ev->cb,
ev->cbarg, timeout);
ev->files[1] = file;
ev->lines[1] = line;
return (__event_add(ev, timeout));
}
static inline int
_event_del(char const *file, int line, struct event *ev)
{
event_log_debug("del %s:%d ev=%p, fd=%d, flags=%#x, cb=%p, cbarg=%p",
file, line, ev, ev->fd, ev->flags, ev->cb, ev->cbarg);
ev->files[2] = file;
ev->lines[2] = line;
return (__event_del(ev));
}
#else
#define event_log_err(fmt, args...)
#define event_log_info(fmt, args...)
#define event_log_notice(fmt, args...)
#define event_log_debug(fmt, args...)
#define event_set(ev, fd, flags, cb, cbarg) \
__event_set(ev, fd, flags, cb, cbarg)
#define event_add(ev, timeout) \
__event_add(ev, timeout)
#define event_del(ev) \
__event_del(ev)
#define evtimer_set(ev, cb, cbarg) \
__event_set(ev, -1, 0, cb, cbarg)
#define evtimer_add(ev, timeout) \
__event_add(ev, timeout)
#endif /* EVENT_DEBUG */
#endif /* ndef _EVENT_H_ */
diff --git a/usr.sbin/bluetooth/btpand/packet.c b/usr.sbin/bluetooth/btpand/packet.c
index 266dee3c1baa..3051b0fbaecd 100644
--- a/usr.sbin/bluetooth/btpand/packet.c
+++ b/usr.sbin/bluetooth/btpand/packet.c
@@ -1,113 +1,112 @@
/* $NetBSD: packet.c,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: packet.c,v 1.1 2008/08/17 13:20:57 plunky Exp $");
#define L2CAP_SOCKET_CHECKED
#include "btpand.h"
packet_t *
packet_alloc(channel_t *chan)
{
packet_t *pkt;
pkt = malloc(sizeof(packet_t) + chan->mru);
if (pkt == NULL) {
log_err("%s() failed: %m", __func__);
return NULL;
}
memset(pkt, 0, sizeof(packet_t));
STAILQ_INIT(&pkt->extlist);
pkt->ptr = pkt->buf;
pkt->chan = chan;
chan->refcnt++;
return pkt;
}
void
packet_free(packet_t *pkt)
{
exthdr_t *eh;
if (pkt->refcnt-- > 0)
return;
while ((eh = STAILQ_FIRST(&pkt->extlist)) != NULL) {
STAILQ_REMOVE_HEAD(&pkt->extlist, next);
free(eh);
}
pkt->chan->refcnt--;
if (pkt->chan->refcnt == 0)
channel_free(pkt->chan);
free(pkt);
}
void
packet_adj(packet_t *pkt, size_t size)
{
assert(pkt->refcnt == 0);
assert(pkt->len >= size);
pkt->ptr += size;
pkt->len -= size;
}
pkthdr_t *
pkthdr_alloc(packet_t *pkt)
{
pkthdr_t *ph;
ph = malloc(sizeof(pkthdr_t));
if (ph == NULL) {
log_err("%s() failed: %m", __func__);
return NULL;
}
ph->data = pkt;
pkt->refcnt++;
return ph;
}
void
pkthdr_free(pkthdr_t *ph)
{
packet_free(ph->data);
free(ph);
}
diff --git a/usr.sbin/bluetooth/btpand/sdp.c b/usr.sbin/bluetooth/btpand/sdp.c
index 3029713f7de2..a21710781cf2 100644
--- a/usr.sbin/bluetooth/btpand/sdp.c
+++ b/usr.sbin/bluetooth/btpand/sdp.c
@@ -1,212 +1,211 @@
/* $NetBSD: sdp.c,v 1.2 2008/12/06 20:01:14 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: sdp.c,v 1.2 2008/12/06 20:01:14 plunky Exp $");
#include <string.h>
#define L2CAP_SOCKET_CHECKED
#include "sdp.h"
/*
* SDP data stream manipulation routines
*/
/* Bluetooth Base UUID */
static const uuid_t BASE_UUID = {
0x00000000,
0x0000,
0x1000,
0x80,
0x00,
{ 0x00, 0x80, 0x5f, 0x9b, 0x34, 0xfb }
};
/*
* _sdp_match_uuid16(ptr, limit, uuid)
*
* examine SDP data stream at ptr for a UUID, and return
* true if it matches the supplied short alias bluetooth UUID.
* limit is the first address past the end of valid data.
*/
bool
_sdp_match_uuid16(uint8_t **ptr, uint8_t *limit, uint16_t uuid)
{
uint8_t *p = *ptr;
uuid_t u1, u2;
memcpy(&u1, &BASE_UUID, sizeof(uuid_t));
u1.time_low = uuid;
if (!_sdp_get_uuid(&p, limit, &u2)
|| !uuid_equal(&u1, &u2, NULL))
return false;
*ptr = p;
return true;
}
/*
* _sdp_get_uuid(ptr, limit, uuid)
*
* examine SDP data stream at ptr for a UUID, and extract
* to given storage, advancing ptr.
* limit is the first address past the end of valid data.
*/
bool
_sdp_get_uuid(uint8_t **ptr, uint8_t *limit, uuid_t *uuid)
{
uint8_t *p = *ptr;
if (p + 1 > limit)
return false;
switch (*p++) {
case SDP_DATA_UUID16:
if (p + 2 > limit)
return false;
memcpy(uuid, &BASE_UUID, sizeof(uuid_t));
uuid->time_low = be16dec(p);
p += 2;
break;
case SDP_DATA_UUID32:
if (p + 4 > limit)
return false;
memcpy(uuid, &BASE_UUID, sizeof(uuid_t));
uuid->time_low = be32dec(p);
p += 4;
break;
case SDP_DATA_UUID128:
if (p + 16 > limit)
return false;
uuid_dec_be(p, uuid);
p += 16;
break;
default:
return false;
}
*ptr = p;
return true;
}
/*
* _sdp_get_seq(ptr, limit, seq)
*
* examine SDP data stream at ptr for a sequence. return
* seq pointer if found and advance ptr to next object.
* limit is the first address past the end of valid data.
*/
bool
_sdp_get_seq(uint8_t **ptr, uint8_t *limit, uint8_t **seq)
{
uint8_t *p = *ptr;
int32_t l;
if (p + 1 > limit)
return false;
switch (*p++) {
case SDP_DATA_SEQ8:
if (p + 1 > limit)
return false;
l = *p;
p += 1;
break;
case SDP_DATA_SEQ16:
if (p + 2 > limit)
return false;
l = be16dec(p);
p += 2;
break;
case SDP_DATA_SEQ32:
if (p + 4 > limit)
return false;
l = be32dec(p);
p += 4;
break;
default:
return false;
}
if (p + l > limit)
return false;
*seq = p;
*ptr = p + l;
return true;
}
/*
* _sdp_get_uint16(ptr, limit, value)
*
* examine SDP data stream at ptr for a uint16_t, and
* extract to given storage, advancing ptr.
* limit is the first address past the end of valid data.
*/
bool
_sdp_get_uint16(uint8_t **ptr, uint8_t *limit, uint16_t *value)
{
uint8_t *p = *ptr;
uint16_t v;
if (p + 1 > limit)
return false;
switch (*p++) {
case SDP_DATA_UINT16:
if (p + 2 > limit)
return false;
v = be16dec(p);
p += 2;
break;
default:
return false;
}
*value = v;
*ptr = p;
return true;
}
diff --git a/usr.sbin/bluetooth/btpand/sdp.h b/usr.sbin/bluetooth/btpand/sdp.h
index 1b9337a857b7..66c5c601bd1a 100644
--- a/usr.sbin/bluetooth/btpand/sdp.h
+++ b/usr.sbin/bluetooth/btpand/sdp.h
@@ -1,40 +1,39 @@
/* $NetBSD: sdp.h,v 1.2 2008/12/06 20:01:15 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <bluetooth.h>
#include <sdp.h>
#include <stdbool.h>
#include <uuid.h>
bool _sdp_match_uuid16(uint8_t **, uint8_t *, uint16_t);
bool _sdp_get_uuid(uint8_t **, uint8_t *, uuid_t *);
bool _sdp_get_seq(uint8_t **, uint8_t *, uint8_t **);
bool _sdp_get_uint16(uint8_t **, uint8_t *, uint16_t *);
diff --git a/usr.sbin/bluetooth/btpand/server.c b/usr.sbin/bluetooth/btpand/server.c
index d6bec1fb614b..f0967d058ca4 100644
--- a/usr.sbin/bluetooth/btpand/server.c
+++ b/usr.sbin/bluetooth/btpand/server.c
@@ -1,295 +1,294 @@
/* $NetBSD: server.c,v 1.2 2009/01/24 17:29:28 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: server.c,v 1.2 2009/01/24 17:29:28 plunky Exp $");
#include <sys/ioctl.h>
#define L2CAP_SOCKET_CHECKED
#include <bluetooth.h>
#include <inttypes.h>
#include <errno.h>
#include <sdp.h>
#include <unistd.h>
#include "btpand.h"
#include "bnep.h"
static struct event server_ev;
static int server_fd;
static int server_avail;
static void * server_ss;
static uint32_t server_handle;
static void server_open(void);
static void server_close(void);
static void server_read(int, short, void *);
static void server_register(void);
void
server_init(void)
{
server_fd = -1;
}
/*
* The server_update() function is called whenever the channel count is
* changed. We maintain the SDP record and open or close the server socket
* as required.
*/
void
server_update(int count)
{
if (server_limit == 0)
return;
log_debug("count %d", count);
server_avail = UINT8_MAX - (count - 1) * UINT8_MAX / server_limit;
log_info("Service Availability: %d/%d", server_avail, UINT8_MAX);
if (server_avail == 0 && server_fd != -1)
server_close();
if (server_avail > 0 && server_fd == -1)
server_open();
if (service_name)
server_register();
}
static void
server_open(void)
{
struct sockaddr_l2cap sa;
uint16_t mru;
server_fd = socket(PF_BLUETOOTH, SOCK_SEQPACKET, BLUETOOTH_PROTO_L2CAP);
if (server_fd == -1) {
log_err("Could not open L2CAP socket: %m");
exit(EXIT_FAILURE);
}
memset(&sa, 0, sizeof(sa));
sa.l2cap_family = AF_BLUETOOTH;
sa.l2cap_len = sizeof(sa);
sa.l2cap_psm = htole16(l2cap_psm);
sa.l2cap_bdaddr_type = BDADDR_BREDR;
sa.l2cap_cid = 0;
bdaddr_copy(&sa.l2cap_bdaddr, &local_bdaddr);
if (bind(server_fd, (struct sockaddr *)&sa, sizeof(sa)) == -1) {
log_err("Could not bind server socket: %m");
exit(EXIT_FAILURE);
}
mru = BNEP_MTU_MIN;
if (setsockopt(server_fd, SOL_L2CAP,
SO_L2CAP_IMTU, &mru, sizeof(mru)) == -1) {
log_err("Could not set L2CAP IMTU (%d): %m", mru);
exit(EXIT_FAILURE);
}
if (listen(server_fd, 0) == -1) {
log_err("Could not listen on server socket: %m");
exit(EXIT_FAILURE);
}
event_set(&server_ev, server_fd, EV_READ | EV_PERSIST, server_read, NULL);
if (event_add(&server_ev, NULL) == -1) {
log_err("Could not add server event: %m");
exit(EXIT_FAILURE);
}
log_info("server socket open");
}
static void
server_close(void)
{
event_del(&server_ev);
close(server_fd);
server_fd = -1;
log_info("server socket closed");
}
/*
* handle connection request
*/
static void
server_read(int s, short ev, void *arg)
{
struct sockaddr_l2cap ra, la;
channel_t *chan;
socklen_t len;
int fd, n;
uint16_t mru, mtu;
len = sizeof(ra);
fd = accept(s, (struct sockaddr *)&ra, &len);
if (fd == -1)
return;
n = 1;
if (ioctl(fd, FIONBIO, &n) == -1) {
log_err("Could not set NonBlocking IO: %m");
close(fd);
return;
}
len = sizeof(mru);
if (getsockopt(fd, SOL_L2CAP, SO_L2CAP_IMTU, &mru, &len) == -1) {
log_err("Could not get L2CAP IMTU: %m");
close(fd);
return;
}
if(mru < BNEP_MTU_MIN) {
log_err("L2CAP IMTU too small (%d)", mru);
close(fd);
return;
}
len = sizeof(n);
if (getsockopt(fd, SOL_SOCKET, SO_RCVBUF, &n, &len) == -1) {
log_err("Could not read SO_RCVBUF");
close(fd);
return;
}
if (n < (mru * 10)) {
n = mru * 10;
if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &n, sizeof(n)) == -1)
log_info("Could not increase SO_RCVBUF (from %d)", n);
}
len = sizeof(mtu);
if (getsockopt(fd, SOL_L2CAP, SO_L2CAP_OMTU, &mtu, &len) == -1) {
log_err("Could not get L2CAP OMTU: %m");
close(fd);
return;
}
if (mtu < BNEP_MTU_MIN) {
log_err("L2CAP OMTU too small (%d)", mtu);
close(fd);
return;
}
len = sizeof(n);
if (getsockopt(fd, SOL_SOCKET, SO_SNDBUF, &n, &len) == -1) {
log_err("Could not get socket send buffer size: %m");
close(fd);
return;
}
if (n < (mtu * 2)) {
n = mtu * 2;
if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &n, sizeof(n)) == -1) {
log_err("Could not set socket send buffer size (%d): %m", n);
close(fd);
return;
}
}
n = mtu;
if (setsockopt(fd, SOL_SOCKET, SO_SNDLOWAT, &n, sizeof(n)) == -1) {
log_err("Could not set socket low water mark (%d): %m", n);
close(fd);
return;
}
len = sizeof(la);
if (getsockname(fd, (struct sockaddr *)&la, &len) == -1) {
log_err("Could not get socket address: %m");
close(fd);
return;
}
log_info("Accepted connection from %s", bt_ntoa(&ra.l2cap_bdaddr, NULL));
chan = channel_alloc();
if (chan == NULL) {
close(fd);
return;
}
chan->send = bnep_send;
chan->recv = bnep_recv;
chan->mru = mru;
chan->mtu = mtu;
b2eaddr(chan->raddr, &ra.l2cap_bdaddr);
b2eaddr(chan->laddr, &la.l2cap_bdaddr);
chan->state = CHANNEL_WAIT_CONNECT_REQ;
channel_timeout(chan, 10);
if (!channel_open(chan, fd)) {
chan->state = CHANNEL_CLOSED;
channel_free(chan);
close(fd);
return;
}
}
static void
server_register(void)
{
sdp_nap_profile_t p;
int rv;
if (server_ss == NULL) {
server_ss = sdp_open_local(control_path);
if (server_ss == NULL || sdp_error(server_ss) != 0) {
log_err("failed to contact SDP server");
return;
}
}
memset(&p, 0, sizeof(p));
p.psm = l2cap_psm;
p.load_factor = server_avail;
p.security_description = (l2cap_mode == 0 ? 0x0000 : 0x0001);
if (server_handle)
rv = sdp_change_service(server_ss, server_handle,
(uint8_t *)&p, sizeof(p));
else
rv = sdp_register_service(server_ss, service_class,
&local_bdaddr, (uint8_t *)&p, sizeof(p), &server_handle);
if (rv != 0) {
errno = sdp_error(server_ss);
log_err("%s: %m", service_name);
exit(EXIT_FAILURE);
}
}
diff --git a/usr.sbin/bluetooth/btpand/tap.c b/usr.sbin/bluetooth/btpand/tap.c
index c880775ed888..011ae3989154 100644
--- a/usr.sbin/bluetooth/btpand/tap.c
+++ b/usr.sbin/bluetooth/btpand/tap.c
@@ -1,170 +1,169 @@
/* $NetBSD: tap.c,v 1.1 2008/08/17 13:20:57 plunky Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Iain Hibbert
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#include <sys/cdefs.h>
__RCSID("$NetBSD: tap.c,v 1.1 2008/08/17 13:20:57 plunky Exp $");
#include <sys/types.h>
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/uio.h>
#include <net/if_tap.h>
#include <fcntl.h>
#include <libutil.h>
#include <paths.h>
#include <stdio.h>
#include <unistd.h>
#define L2CAP_SOCKET_CHECKED
#include "btpand.h"
static bool tap_send(channel_t *, packet_t *);
static bool tap_recv(packet_t *);
void
tap_init(void)
{
channel_t *chan;
struct ifreq ifr;
int fd, s;
char pidfile[PATH_MAX];
fd = open(interface_name, O_RDWR);
if (fd == -1) {
log_err("Could not open \"%s\": %m", interface_name);
exit(EXIT_FAILURE);
}
memset(&ifr, 0, sizeof(ifr));
if (ioctl(fd, TAPGIFNAME, &ifr) == -1) {
log_err("Could not get interface name: %m");
exit(EXIT_FAILURE);
}
s = socket(AF_INET, SOCK_DGRAM, 0);
if (s == -1) {
log_err("Could not open PF_LINK socket: %m");
exit(EXIT_FAILURE);
}
ifr.ifr_addr.sa_family = AF_LINK;
ifr.ifr_addr.sa_len = ETHER_ADDR_LEN;
b2eaddr(ifr.ifr_addr.sa_data, &local_bdaddr);
if (ioctl(s, SIOCSIFLLADDR, &ifr) == -1) {
log_err("Could not set %s physical address: %m", ifr.ifr_name);
exit(EXIT_FAILURE);
}
if (ioctl(s, SIOCGIFFLAGS, &ifr) == -1) {
log_err("Could not get interface flags: %m");
exit(EXIT_FAILURE);
}
if ((ifr.ifr_flags & IFF_UP) == 0) {
ifr.ifr_flags |= IFF_UP;
if (ioctl(s, SIOCSIFFLAGS, &ifr) == -1) {
log_err("Could not set IFF_UP: %m");
exit(EXIT_FAILURE);
}
}
close(s);
log_info("Using interface %s with addr %s", ifr.ifr_name,
ether_ntoa((struct ether_addr *)&ifr.ifr_addr.sa_data));
chan = channel_alloc();
if (chan == NULL)
exit(EXIT_FAILURE);
chan->send = tap_send;
chan->recv = tap_recv;
chan->mru = ETHER_HDR_LEN + ETHER_MAX_LEN;
memcpy(chan->raddr, ifr.ifr_addr.sa_data, ETHER_ADDR_LEN);
memcpy(chan->laddr, ifr.ifr_addr.sa_data, ETHER_ADDR_LEN);
chan->state = CHANNEL_OPEN;
if (!channel_open(chan, fd))
exit(EXIT_FAILURE);
snprintf(pidfile, sizeof(pidfile), "%s/%s.pid",
_PATH_VARRUN, ifr.ifr_name);
chan->pfh = pidfile_open(pidfile, 0600, NULL);
if (chan->pfh == NULL)
log_err("can't create pidfile");
else if (pidfile_write(chan->pfh) < 0) {
log_err("can't write pidfile");
pidfile_remove(chan->pfh);
chan->pfh = NULL;
}
}
static bool
tap_send(channel_t *chan, packet_t *pkt)
{
struct iovec iov[4];
ssize_t nw;
iov[0].iov_base = pkt->dst;
iov[0].iov_len = ETHER_ADDR_LEN;
iov[1].iov_base = pkt->src;
iov[1].iov_len = ETHER_ADDR_LEN;
iov[2].iov_base = pkt->type;
iov[2].iov_len = ETHER_TYPE_LEN;
iov[3].iov_base = pkt->ptr;
iov[3].iov_len = pkt->len;
/* tap device write never fails */
nw = writev(chan->fd, iov, __arraycount(iov));
assert(nw > 0);
return true;
}
static bool
tap_recv(packet_t *pkt)
{
if (pkt->len < ETHER_HDR_LEN)
return false;
pkt->dst = pkt->ptr;
packet_adj(pkt, ETHER_ADDR_LEN);
pkt->src = pkt->ptr;
packet_adj(pkt, ETHER_ADDR_LEN);
pkt->type = pkt->ptr;
packet_adj(pkt, ETHER_TYPE_LEN);
return true;
}
diff --git a/usr.sbin/cron/cron/externs.h b/usr.sbin/cron/cron/externs.h
index 8b1ff71b36e2..1e9a75ed9a85 100644
--- a/usr.sbin/cron/cron/externs.h
+++ b/usr.sbin/cron/cron/externs.h
@@ -1,143 +1,142 @@
-/* $FreeBSD$ */
/* Copyright 1993,1994 by Paul Vixie
* All rights reserved
*
* Distribute freely, except: don't remove my name from the source or
* documentation (don't take credit for my work), mark your changes (don't
* get me blamed for your possible bugs), don't alter or remove this
* notice. May be sold if buildable source is provided to buyer. No
* warrantee of any kind, express or implied, is included with this
* software; use at your own risk, responsibility for damages (if any) to
* anyone resulting from the use of this software rests entirely with the
* user.
*
* Send bug reports, bug fixes, enhancements, requests, flames, etc., and
* I'll try to keep a version up to date. I can be reached as follows:
* Paul Vixie <paul@vix.com> uunet!decwrl!vixie!paul
*/
#if defined(POSIX) || defined(ATT)
# include <stdlib.h>
# include <unistd.h>
# include <string.h>
# include <dirent.h>
# define DIR_T struct dirent
# define WAIT_T int
# define WAIT_IS_INT 1
extern char *tzname[2];
# define TZONE(tm) tzname[(tm).tm_isdst]
#endif
#if defined(UNIXPC)
# undef WAIT_T
# undef WAIT_IS_INT
# define WAIT_T union wait
#endif
#if defined(POSIX)
# define SIG_T sig_t
# define TIME_T time_t
# define PID_T pid_t
#endif
#if defined(ATT)
# define SIG_T void
# define TIME_T long
# define PID_T int
#endif
#if !defined(POSIX) && !defined(ATT)
/* classic BSD */
extern time_t time();
extern unsigned sleep();
extern struct tm *localtime();
extern struct passwd *getpwnam();
extern int errno;
extern void perror(), exit(), free();
extern char *getenv(), *strcpy(), *strchr(), *strtok();
extern void *malloc(), *realloc();
# define SIG_T void
# define TIME_T long
# define PID_T int
# define WAIT_T union wait
# define DIR_T struct direct
# include <sys/dir.h>
# define TZONE(tm) (tm).tm_zone
#endif
/* getopt() isn't part of POSIX. some systems define it in <stdlib.h> anyway.
* of those that do, some complain that our definition is different and some
* do not. to add to the misery and confusion, some systems define getopt()
* in ways that we cannot predict or comprehend, yet do not define the adjunct
* external variables needed for the interface.
*/
#if (!defined(BSD) || (BSD < 198911)) && !defined(ATT) && !defined(UNICOS)
int getopt(int, char * const *, const char *);
#endif
#if (!defined(BSD) || (BSD < 199103))
extern char *optarg;
extern int optind, opterr, optopt;
#endif
#if WAIT_IS_INT
# ifndef WEXITSTATUS
# define WEXITSTATUS(x) (((x) >> 8) & 0xff)
# endif
# ifndef WTERMSIG
# define WTERMSIG(x) ((x) & 0x7f)
# endif
# ifndef WCOREDUMP
# define WCOREDUMP(x) ((x) & 0x80)
# endif
#else /*WAIT_IS_INT*/
# ifndef WEXITSTATUS
# define WEXITSTATUS(x) ((x).w_retcode)
# endif
# ifndef WTERMSIG
# define WTERMSIG(x) ((x).w_termsig)
# endif
# ifndef WCOREDUMP
# define WCOREDUMP(x) ((x).w_coredump)
# endif
#endif /*WAIT_IS_INT*/
#ifndef WIFSIGNALED
#define WIFSIGNALED(x) (WTERMSIG(x) != 0)
#endif
#ifndef WIFEXITED
#define WIFEXITED(x) (WTERMSIG(x) == 0)
#endif
#ifdef NEED_STRCASECMP
extern int strcasecmp(char *, char *);
#endif
#ifdef NEED_STRDUP
extern char *strdup(char *);
#endif
#ifdef NEED_STRERROR
extern char *strerror(int);
#endif
#ifdef NEED_FLOCK
extern int flock(int, int);
# define LOCK_SH 1
# define LOCK_EX 2
# define LOCK_NB 4
# define LOCK_UN 8
#endif
#ifdef NEED_SETSID
extern int setsid(void);
#endif
#ifdef NEED_GETDTABLESIZE
extern int getdtablesize(void);
#endif
#ifdef NEED_SETENV
extern int setenv(char *, char *, int);
#endif
diff --git a/usr.sbin/crunch/crunchide/extern.h b/usr.sbin/crunch/crunchide/extern.h
index b5f9165a1e1b..86e96ae47be5 100644
--- a/usr.sbin/crunch/crunchide/extern.h
+++ b/usr.sbin/crunch/crunchide/extern.h
@@ -1,45 +1,44 @@
/* $NetBSD: extern.h,v 1.5 1998/05/06 13:16:57 mycroft Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1997 Christopher G. Demetriou. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Christopher G. Demetriou
* for the NetBSD Project.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifdef NLIST_ELF32
int check_elf32(int, const char *);
int hide_elf32(int, const char *);
#endif
#ifdef NLIST_ELF64
int check_elf64(int, const char *);
int hide_elf64(int, const char *);
#endif
int in_keep_list(const char *symbol);
diff --git a/usr.sbin/dumpcis/cardinfo.h b/usr.sbin/dumpcis/cardinfo.h
index 5cd810dabbd9..d58199158c4d 100644
--- a/usr.sbin/dumpcis/cardinfo.h
+++ b/usr.sbin/dumpcis/cardinfo.h
@@ -1,207 +1,206 @@
/*
* Include file for PCMCIA user process interface
*
*-------------------------------------------------------------------------
*/
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1995 Andrew McRae. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#ifndef _PCCARD_CARDINFO_H_
#define _PCCARD_CARDINFO_H_
#ifndef _KERNEL
#include <sys/types.h>
#endif
#include <sys/ioccom.h>
#define PIOCGSTATE _IOR('P', 1, struct slotstate) /* Get slot state */
#define PIOCGMEM _IOWR('P', 2, struct mem_desc) /* Get memory map */
#define PIOCSMEM _IOW('P', 3, struct mem_desc) /* Set memory map */
#define PIOCGIO _IOWR('P', 4, struct io_desc) /* Get I/O map */
#define PIOCSIO _IOW('P', 5, struct io_desc) /* Set I/O map */
#define PIOCSDRV _IOWR('P', 6, struct dev_desc) /* Set driver */
#define PIOCRWFLAG _IOW('P', 7, int) /* Set flags for drv use */
#define PIOCRWMEM _IOWR('P', 8, unsigned long) /* Set mem for drv use */
#define PIOCSPOW _IOW('P', 9, struct power) /* Set power structure */
#define PIOCSVIR _IOW('P', 10, int) /* Virtual insert/remove */
#define PIOCSBEEP _IOW('P', 11, int) /* Select Beep */
#define PIOCSRESOURCE _IOWR('P', 12, struct pccard_resource) /* get resource info */
/*
* Debug codes.
*/
#define PIOCGREG _IOWR('P',100, struct pcic_reg) /* get reg */
#define PIOCSREG _IOW('P', 101, struct pcic_reg) /* Set reg */
/*
* Slot states for PIOCGSTATE
*
* Here's a state diagram of all the possible states:
*
* power x 1
* -------------------
* / \
* / v
* resume +----------+ power x 0 +----------+
* ------->| inactive |<--------------| filled |
* / +----------+ +----------+
* / / \ ^ |
* nil <--------- \ insert or | | suspend or
* suspend \ power x 1 | | eject
* \ | v
* \ +----------+
* ----------->| empty |
* eject +----------+
*
* Note, the above diagram is for the state. On suspend, the laststate
* gets set to suspend to tell pccardd what happened. Also the nil state
* means that when the no state change has happened. Note: if you eject
* while suspended in the inactive state, you will return to the
* empty state if you do not insert a new card and to the inactive state
* if you do insert a new card.
*
* Some might argue that inactive should be sticky forever and
* eject/insert shouldn't take it out of that state. They might be
* right. On the other hand, some would argue that eject resets all
* state. They might be right. They both can't be right. The above
* represents a reasonable compromise between the two.
*
* Some bridges allow one to query to see if the card was changed while
* we were suspended. Others do not. We make no use of this functionality
* at this time.
*/
enum cardstate { noslot, empty, suspend, filled, inactive };
/*
* Descriptor structure for memory map.
*/
struct mem_desc {
int window; /* Memory map window number (0-4) */
int flags; /* Flags - see below */
caddr_t start; /* System memory start */
int size; /* Size of memory area */
unsigned long card; /* Card memory address */
};
#define MDF_16BITS 0x01 /* Memory is 16 bits wide */
#define MDF_ZEROWS 0x02 /* Set no wait states for memory */
#define MDF_WS0 0x04 /* Wait state flags */
#define MDF_WS1 0x08
#define MDF_ATTR 0x10 /* Memory is attribute memory */
#define MDF_WP 0x20 /* Write protect memory */
#define MDF_ACTIVE 0x40 /* Context active (read-only) */
/*
* Descriptor structure for I/O map
*/
struct io_desc {
int window; /* I/O map number (0-1) */
int flags; /* Flags - see below */
int start; /* I/O port start */
int size; /* Number of port addresses */
};
#define IODF_WS 0x01 /* Set wait states for 16 bit I/O access */
#define IODF_16BIT 0x02 /* I/O access are 16 bit */
#define IODF_CS16 0x04 /* Allow card selection of 16 bit access */
#define IODF_ZEROWS 0x08 /* No wait states for 8 bit I/O */
#define IODF_ACTIVE 0x10 /* Context active (read-only) */
/*
* Device descriptor for allocation of driver.
*/
#define DEV_MISC_LEN 36
#define DEV_MAX_CIS_LEN 40
struct dev_desc {
char name[16]; /* Driver name */
int unit; /* Driver unit number */
unsigned long mem; /* Memory address of driver */
int memsize; /* Memory size (if used) */
int iobase; /* base of I/O ports */
int iosize; /* Length of I/O ports */
int irqmask; /* Interrupt number(s) to allocate */
int flags; /* Device flags */
uint8_t misc[DEV_MISC_LEN]; /* For any random info */
uint8_t manufstr[DEV_MAX_CIS_LEN];
uint8_t versstr[DEV_MAX_CIS_LEN];
uint8_t cis3str[DEV_MAX_CIS_LEN];
uint8_t cis4str[DEV_MAX_CIS_LEN];
uint32_t manufacturer; /* Manufacturer ID */
uint32_t product; /* Product ID */
uint32_t prodext; /* Product ID (extended) */
};
#define DEV_DESC_HAS_SIZE 1
struct pcic_reg {
unsigned char reg;
unsigned char value;
};
/*
* Slot information. Used to read current status of slot.
*/
struct slotstate {
enum cardstate state; /* Current state of slot */
enum cardstate laststate; /* Previous state of slot */
int maxmem; /* Max allowed memory windows */
int maxio; /* Max allowed I/O windows */
int irqs; /* Bitmap of IRQs allowed */
int flags; /* Capability flags */
};
/*
* The power values are in volts * 10, e.g. 5V is 50, 3.3V is 33.
*/
struct power {
int vcc;
int vpp;
};
/*
* The PC-Card resource IOC_GET_RESOURCE_RANGE
*/
struct pccard_resource {
int type;
u_long size;
u_long min;
u_long max;
u_long resource_addr;
};
/*
* Other system limits
*/
#define MAXSLOT 16
#define NUM_MEM_WINDOWS 10
#define NUM_IO_WINDOWS 6
#define CARD_DEVICE "/dev/card%d" /* String for snprintf */
#define PCCARD_MEMSIZE (4*1024)
#endif /* !_PCCARD_CARDINFO_H_ */
diff --git a/usr.sbin/fifolog/flint.lnt b/usr.sbin/fifolog/flint.lnt
index 87e0c86cef07..f12bb6fbd975 100644
--- a/usr.sbin/fifolog/flint.lnt
+++ b/usr.sbin/fifolog/flint.lnt
@@ -1,55 +1,54 @@
-// $FreeBSD$
// FlexeLint file for fifolog tools
//
//
//-passes=3
//-ffc
//
//// GCC
//-cgnu
//+d__FreeBSD__=7
//+d__GNUC__=4
//+d__GNUC_MINOR__=2
//+d__FreeBSD_cc_version=700003
//+d__attribute__()=
//-d__builtin_va_list=void* // used by stdarg.h
//// -d__builtin_stdarg_start()=_to_semi // ditto
//// -d__builtin_va_start(a,b)=((void)(b),(a)=0) // ditto
//// -d__builtin_va_end()=_to_semi // ditto
//+rw(__inline) // enable the (non-standard) __inline keyword
//+rw(__inline__) // enable the (non-standard) __inline__ keyword
//
//+d"__unused=/*lint -e{715} -e{818} */"
//
//-e537 // Repeated include file
//-elib(652) // #define of symbol '...' declared previously
//-function(exit,__assert)
//-function(exit,err)
//-function(exit,errx)
//-e716 // while(1) ...
//-e717 // do ... while(0)
//
//// Ignore return values
-esym(534, memset)
-esym(534, memcpy)
-esym(534, strcpy)
//-esym(534, printf)
-esym(534, time)
-esym(534, fprintf)
//-esym(534, vfprintf)
//
//+libh(fifolog.h)
//+libh(miniobj.h)
//+libh(libfifolog.h)
//
//-e713 // loss of precision sign/unsigned
//-e732 // loss of sign
//-e734 // loss of precision assignment
//-e737 // loss of sign in promotion int->unsigned
//-e573 // sign/unsign mix in divide
-e712 // Loss of precision (___) (___ to ___)
-e713 // Loss of precision (___) (___ to ___)
-e716 // while(1) ...
-e732 // Loss of sign (___) (___ to ___)
-e747 // Significant prototype coercion (___) ___ to ___
diff --git a/usr.sbin/kbdcontrol/path.h b/usr.sbin/kbdcontrol/path.h
index e1fa341e0c78..12ea4a5b3f66 100644
--- a/usr.sbin/kbdcontrol/path.h
+++ b/usr.sbin/kbdcontrol/path.h
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define KEYMAP_PATH "/usr/share/syscons/keymaps/"
#define FONT_PATH "/usr/share/syscons/fonts/"
#define SCRNMAP_PATH "/usr/share/syscons/scrnmaps/"
#define VT_KEYMAP_PATH "/usr/share/vt/keymaps/"
#define VT_FONT_PATH "/usr/share/vt/fonts/"
diff --git a/usr.sbin/kldxref/ef.h b/usr.sbin/kldxref/ef.h
index 0b13b5570f9f..f10af49fafba 100644
--- a/usr.sbin/kldxref/ef.h
+++ b/usr.sbin/kldxref/ef.h
@@ -1,73 +1,72 @@
-/* $FreeBSD$ */
#ifndef _EF_H_
#define _EF_H_
#define EFT_KLD 1
#define EFT_KERNEL 2
#define EF_RELOC_REL 1
#define EF_RELOC_RELA 2
#define EF_GET_TYPE(ef) \
(ef)->ef_ops->get_type((ef)->ef_ef)
#define EF_CLOSE(ef) \
(ef)->ef_ops->close((ef)->ef_ef)
#define EF_READ(ef, offset, len, dest) \
(ef)->ef_ops->read((ef)->ef_ef, offset, len, dest)
#define EF_READ_ENTRY(ef, offset, len, ptr) \
(ef)->ef_ops->read_entry((ef)->ef_ef, offset, len, ptr)
#define EF_SEG_READ(ef, offset, len, dest) \
(ef)->ef_ops->seg_read((ef)->ef_ef, offset, len, dest)
#define EF_SEG_READ_REL(ef, offset, len, dest) \
(ef)->ef_ops->seg_read_rel((ef)->ef_ef, offset, len, dest)
#define EF_SEG_READ_STRING(ef, offset, len, dest) \
(ef)->ef_ops->seg_read_string((ef)->ef_ef, offset, len, dest)
#define EF_SEG_READ_ENTRY(ef, offset, len, ptr) \
(ef)->ef_ops->seg_read_entry((ef)->kf_ef, offset, len, ptr)
#define EF_SEG_READ_ENTRY_REL(ef, offset, len, ptr) \
(ef)->ef_ops->seg_read_entry_rel((ef)->ef_ef, offset, len, ptr)
#define EF_SYMADDR(ef, symidx) \
(ef)->ef_ops->symaddr((ef)->ef_ef, symidx)
#define EF_LOOKUP_SET(ef, name, startp, stopp, countp) \
(ef)->ef_ops->lookup_set((ef)->ef_ef, name, startp, stopp, countp)
#define EF_LOOKUP_SYMBOL(ef, name, sym) \
(ef)->ef_ops->lookup_symbol((ef)->ef_ef, name, sym)
/* XXX, should have a different name. */
typedef struct ef_file *elf_file_t;
struct elf_file_ops {
int (*get_type)(elf_file_t ef);
int (*close)(elf_file_t ef);
int (*read)(elf_file_t ef, Elf_Off offset, size_t len, void* dest);
int (*read_entry)(elf_file_t ef, Elf_Off offset, size_t len,
void **ptr);
int (*seg_read)(elf_file_t ef, Elf_Off offset, size_t len, void *dest);
int (*seg_read_rel)(elf_file_t ef, Elf_Off offset, size_t len,
void *dest);
int (*seg_read_string)(elf_file_t, Elf_Off offset, size_t len,
char *dest);
int (*seg_read_entry)(elf_file_t ef, Elf_Off offset, size_t len,
void**ptr);
int (*seg_read_entry_rel)(elf_file_t ef, Elf_Off offset, size_t len,
void**ptr);
Elf_Addr (*symaddr)(elf_file_t ef, Elf_Size symidx);
int (*lookup_set)(elf_file_t ef, const char *name, long *startp,
long *stopp, long *countp);
int (*lookup_symbol)(elf_file_t ef, const char* name, Elf_Sym** sym);
};
struct elf_file {
elf_file_t ef_ef;
struct elf_file_ops *ef_ops;
};
__BEGIN_DECLS
int ef_open(const char *filename, struct elf_file *ef, int verbose);
int ef_obj_open(const char *filename, struct elf_file *ef, int verbose);
int ef_reloc(struct elf_file *ef, const void *reldata, int reltype,
Elf_Off relbase, Elf_Off dataoff, size_t len, void *dest);
__END_DECLS
#endif /* _EF_H_*/
diff --git a/usr.sbin/mailwrapper/pathnames.h b/usr.sbin/mailwrapper/pathnames.h
index 5511d1eccff9..ba87ef75947a 100644
--- a/usr.sbin/mailwrapper/pathnames.h
+++ b/usr.sbin/mailwrapper/pathnames.h
@@ -1,37 +1,36 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1998
* Perry E. Metzger. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgment:
* This product includes software developed for the NetBSD Project
* by Perry E. Metzger.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#define _PATH_MAILERCONF "/etc/mail/mailer.conf"
#define _PATH_DEFAULTMTA "/usr/libexec/sendmail/sendmail"
diff --git a/usr.sbin/makefs/msdos.h b/usr.sbin/makefs/msdos.h
index d9f1cc4cdb11..1e844203376e 100644
--- a/usr.sbin/makefs/msdos.h
+++ b/usr.sbin/makefs/msdos.h
@@ -1,61 +1,60 @@
-/* $FreeBSD$ */
/* $NetBSD: msdos.h,v 1.3 2015/10/16 16:40:02 christos Exp $ */
/*-
* Copyright (c) 2013 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Christos Zoulas.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
#ifndef _MAKEFS_MSDOS_H
#define _MAKEFS_MSDOS_H
#define NOCRED NULL
#define MSDOSFS_DPRINTF(args) do { \
if (debug & DEBUG_MSDOSFS) \
printf args; \
} while (0);
struct vnode;
struct denode;
struct fsnode;
struct msdosfsmount;
struct componentname {
char *cn_nameptr;
size_t cn_namelen;
};
int msdosfs_fsiflush(struct msdosfsmount *);
struct msdosfsmount *msdosfs_mount(struct vnode *);
int msdosfs_root(struct msdosfsmount *, struct vnode *);
struct denode *msdosfs_mkfile(const char *, struct denode *, fsnode *);
struct denode *msdosfs_mkdire(const char *, struct denode *, fsnode *);
#endif
diff --git a/usr.sbin/makefs/msdos/direntry.h b/usr.sbin/makefs/msdos/direntry.h
index 9cc601d5e96c..9d6c65dfcc7d 100644
--- a/usr.sbin/makefs/msdos/direntry.h
+++ b/usr.sbin/makefs/msdos/direntry.h
@@ -1,146 +1,145 @@
-/* $FreeBSD$ */
/* $NetBSD: direntry.h,v 1.14 1997/11/17 15:36:32 ws Exp $ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (C) 1994, 1995, 1997 Wolfgang Solfrank.
* Copyright (C) 1994, 1995, 1997 TooLs GmbH.
* All rights reserved.
* Original code by Paul Popelka (paulp@uts.amdahl.com) (see below).
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by TooLs GmbH.
* 4. The name of TooLs GmbH may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Written by Paul Popelka (paulp@uts.amdahl.com)
*
* You can do anything you want with this software, just don't say you wrote
* it, and don't remove this notice.
*
* This software is provided "as is".
*
* The author supplies this software to be publicly redistributed on the
* understanding that the author is not responsible for the correct
* functioning of this software in any circumstances and is not liable for
* any damages caused by this software.
*
* October 1992
*/
#ifndef _FS_MSDOSFS_DIRENTRY_H_
#define _FS_MSDOSFS_DIRENTRY_H_
/*
* Structure of a dos directory entry.
*/
struct direntry {
uint8_t deName[11]; /* filename, blank filled */
#define SLOT_EMPTY 0x00 /* slot has never been used */
#define SLOT_E5 0x05 /* the real value is 0xe5 */
#define SLOT_DELETED 0xe5 /* file in this slot deleted */
uint8_t deAttributes; /* file attributes */
#define ATTR_NORMAL 0x00 /* normal file */
#define ATTR_READONLY 0x01 /* file is readonly */
#define ATTR_HIDDEN 0x02 /* file is hidden */
#define ATTR_SYSTEM 0x04 /* file is a system file */
#define ATTR_VOLUME 0x08 /* entry is a volume label */
#define ATTR_DIRECTORY 0x10 /* entry is a directory name */
#define ATTR_ARCHIVE 0x20 /* file is new or modified */
uint8_t deLowerCase; /* NT VFAT lower case flags */
#define LCASE_BASE 0x08 /* filename base in lower case */
#define LCASE_EXT 0x10 /* filename extension in lower case */
uint8_t deCHundredth; /* hundredth of seconds in CTime */
uint8_t deCTime[2]; /* create time */
uint8_t deCDate[2]; /* create date */
uint8_t deADate[2]; /* access date */
uint8_t deHighClust[2]; /* high bytes of cluster number */
uint8_t deMTime[2]; /* last update time */
uint8_t deMDate[2]; /* last update date */
uint8_t deStartCluster[2]; /* starting cluster of file */
uint8_t deFileSize[4]; /* size of file in bytes */
};
/*
* Structure of a Win95 long name directory entry
*/
struct winentry {
uint8_t weCnt;
#define WIN_LAST 0x40
#define WIN_CNT 0x3f
uint8_t wePart1[10];
uint8_t weAttributes;
#define ATTR_WIN95 0x0f
uint8_t weReserved1;
uint8_t weChksum;
uint8_t wePart2[12];
uint16_t weReserved2;
uint8_t wePart3[4];
};
#define WIN_CHARS 13 /* Number of chars per winentry */
/*
* Maximum number of winentries for a filename.
*/
#define WIN_MAXSUBENTRIES 20
/*
* Maximum filename length in Win95
* Note: Must be < sizeof(dirent.d_name)
*/
#define WIN_MAXLEN 255
/*
* This is the format of the contents of the deTime field in the direntry
* structure.
* We don't use bitfields because we don't know how compilers for
* arbitrary machines will lay them out.
*/
#define DT_2SECONDS_MASK 0x1F /* seconds divided by 2 */
#define DT_2SECONDS_SHIFT 0
#define DT_MINUTES_MASK 0x7E0 /* minutes */
#define DT_MINUTES_SHIFT 5
#define DT_HOURS_MASK 0xF800 /* hours */
#define DT_HOURS_SHIFT 11
/*
* This is the format of the contents of the deDate field in the direntry
* structure.
*/
#define DD_DAY_MASK 0x1F /* day of month */
#define DD_DAY_SHIFT 0
#define DD_MONTH_MASK 0x1E0 /* month */
#define DD_MONTH_SHIFT 5
#define DD_YEAR_MASK 0xFE00 /* year - 1980 */
#define DD_YEAR_SHIFT 9
int unix2dosfn(const u_char *un, u_char dn[12], size_t unlen, u_int gen);
int unix2winfn(const u_char *un, size_t unlen, struct winentry *wep, int cnt,
int chksum);
int winChkName(const u_char *un, size_t unlen, struct winentry *wep,
int chksum);
uint8_t winChksum(uint8_t *name);
int winSlotCnt(const u_char *un, size_t unlen);
#endif /* !_FS_MSDOSFS_DIRENTRY_H_ */
diff --git a/usr.sbin/makefs/msdos/msdosfs_fat.c b/usr.sbin/makefs/msdos/msdosfs_fat.c
index f8744419f0cc..bb5eea457516 100644
--- a/usr.sbin/makefs/msdos/msdosfs_fat.c
+++ b/usr.sbin/makefs/msdos/msdosfs_fat.c
@@ -1,1054 +1,1053 @@
-/* $FreeBSD$ */
/* $NetBSD: msdosfs_fat.c,v 1.28 1997/11/17 15:36:49 ws Exp $ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (C) 1994, 1995, 1997 Wolfgang Solfrank.
* Copyright (C) 1994, 1995, 1997 TooLs GmbH.
* All rights reserved.
* Original code by Paul Popelka (paulp@uts.amdahl.com) (see below).
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by TooLs GmbH.
* 4. The name of TooLs GmbH may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Written by Paul Popelka (paulp@uts.amdahl.com)
*
* You can do anything you want with this software, just don't say you wrote
* it, and don't remove this notice.
*
* This software is provided "as is".
*
* The author supplies this software to be publicly redistributed on the
* understanding that the author is not responsible for the correct
* functioning of this software in any circumstances and is not liable for
* any damages caused by this software.
*
* October 1992
*/
#include <sys/param.h>
#include <sys/errno.h>
#include <assert.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include <strings.h>
#include "ffs/buf.h"
#include <fs/msdosfs/bpb.h>
#include "msdos/direntry.h"
#include <fs/msdosfs/denode.h>
#include <fs/msdosfs/fat.h>
#include <fs/msdosfs/msdosfsmount.h>
#include "makefs.h"
#include "msdos.h"
#define FULL_RUN ((u_int)0xffffffff)
#define SYNCHRONOUS_WRITES(pmp) 1
static int chainalloc(struct msdosfsmount *pmp, u_long start,
u_long count, u_long fillwith, u_long *retcluster,
u_long *got);
static int chainlength(struct msdosfsmount *pmp, u_long start,
u_long count);
static void fatblock(struct msdosfsmount *pmp, u_long ofs, u_long *bnp,
u_long *sizep, u_long *bop);
static int fatchain(struct msdosfsmount *pmp, u_long start, u_long count,
u_long fillwith);
static void fc_lookup(struct denode *dep, u_long findcn, u_long *frcnp,
u_long *fsrcnp);
static void updatefats(struct msdosfsmount *pmp, struct buf *bp,
u_long fatbn);
static __inline void
usemap_alloc(struct msdosfsmount *pmp, u_long cn);
static __inline void
usemap_free(struct msdosfsmount *pmp, u_long cn);
static int clusteralloc1(struct msdosfsmount *pmp, u_long start,
u_long count, u_long fillwith, u_long *retcluster,
u_long *got);
static void
fatblock(struct msdosfsmount *pmp, u_long ofs, u_long *bnp, u_long *sizep,
u_long *bop)
{
u_long bn, size;
bn = ofs / pmp->pm_fatblocksize * pmp->pm_fatblocksec;
size = MIN(pmp->pm_fatblocksec, pmp->pm_FATsecs - bn)
* DEV_BSIZE;
bn += pmp->pm_fatblk + pmp->pm_curfat * pmp->pm_FATsecs;
if (bnp)
*bnp = bn;
if (sizep)
*sizep = size;
if (bop)
*bop = ofs % pmp->pm_fatblocksize;
}
/*
* Map the logical cluster number of a file into a physical disk sector
* that is filesystem relative.
*
* dep - address of denode representing the file of interest
* findcn - file relative cluster whose filesystem relative cluster number
* and/or block number are/is to be found
* bnp - address of where to place the filesystem relative block number.
* If this pointer is null then don't return this quantity.
* cnp - address of where to place the filesystem relative cluster number.
* If this pointer is null then don't return this quantity.
* sp - pointer to returned block size
*
* NOTE: Either bnp or cnp must be non-null.
* This function has one side effect. If the requested file relative cluster
* is beyond the end of file, then the actual number of clusters in the file
* is returned in *cnp. This is useful for determining how long a directory is.
* If cnp is null, nothing is returned.
*/
int
pcbmap(struct denode *dep, u_long findcn, daddr_t *bnp, u_long *cnp, int *sp)
{
int error;
u_long i;
u_long cn;
u_long prevcn = 0; /* XXX: prevcn could be used uninitialized */
u_long byteoffset;
u_long bn;
u_long bo;
struct buf *bp = NULL;
u_long bp_bn = -1;
struct msdosfsmount *pmp = dep->de_pmp;
u_long bsize;
assert(bnp != NULL || cnp != NULL || sp != NULL);
cn = dep->de_StartCluster;
/*
* The "file" that makes up the root directory is contiguous,
* permanently allocated, of fixed size, and is not made up of
* clusters. If the cluster number is beyond the end of the root
* directory, then return the number of clusters in the file.
*/
if (cn == MSDOSFSROOT) {
if (dep->de_Attributes & ATTR_DIRECTORY) {
if (de_cn2off(pmp, findcn) >= dep->de_FileSize) {
if (cnp)
*cnp = de_bn2cn(pmp, pmp->pm_rootdirsize);
return (E2BIG);
}
if (bnp)
*bnp = pmp->pm_rootdirblk + de_cn2bn(pmp, findcn);
if (cnp)
*cnp = MSDOSFSROOT;
if (sp)
*sp = MIN(pmp->pm_bpcluster,
dep->de_FileSize - de_cn2off(pmp, findcn));
return (0);
} else { /* just an empty file */
if (cnp)
*cnp = 0;
return (E2BIG);
}
}
/*
* All other files do I/O in cluster sized blocks
*/
if (sp)
*sp = pmp->pm_bpcluster;
/*
* Rummage around in the FAT cache, maybe we can avoid tromping
* through every FAT entry for the file. And, keep track of how far
* off the cache was from where we wanted to be.
*/
i = 0;
fc_lookup(dep, findcn, &i, &cn);
/*
* Handle all other files or directories the normal way.
*/
for (; i < findcn; i++) {
/*
* Stop with all reserved clusters, not just with EOF.
*/
if ((cn | ~pmp->pm_fatmask) >= CLUST_RSRVD)
goto hiteof;
byteoffset = FATOFS(pmp, cn);
fatblock(pmp, byteoffset, &bn, &bsize, &bo);
if (bn != bp_bn) {
if (bp)
brelse(bp);
error = bread(pmp->pm_devvp, bn, bsize, NOCRED, &bp);
if (error) {
brelse(bp);
return (error);
}
bp_bn = bn;
}
prevcn = cn;
if (bo >= bsize) {
if (bp)
brelse(bp);
return (EIO);
}
if (FAT32(pmp))
cn = getulong(bp->b_data + bo);
else
cn = getushort(bp->b_data + bo);
if (FAT12(pmp) && (prevcn & 1))
cn >>= 4;
cn &= pmp->pm_fatmask;
/*
* Force the special cluster numbers
* to be the same for all cluster sizes
* to let the rest of msdosfs handle
* all cases the same.
*/
if ((cn | ~pmp->pm_fatmask) >= CLUST_RSRVD)
cn |= ~pmp->pm_fatmask;
}
if (!MSDOSFSEOF(pmp, cn)) {
if (bp)
brelse(bp);
if (bnp)
*bnp = cntobn(pmp, cn);
if (cnp)
*cnp = cn;
fc_setcache(dep, FC_LASTMAP, i, cn);
return (0);
}
hiteof:;
if (cnp)
*cnp = i;
if (bp)
brelse(bp);
/* update last file cluster entry in the FAT cache */
fc_setcache(dep, FC_LASTFC, i - 1, prevcn);
return (E2BIG);
}
/*
* Find the closest entry in the FAT cache to the cluster we are looking
* for.
*/
static void
fc_lookup(struct denode *dep, u_long findcn, u_long *frcnp, u_long *fsrcnp)
{
int i;
u_long cn;
struct fatcache *closest = NULL;
for (i = 0; i < FC_SIZE; i++) {
cn = dep->de_fc[i].fc_frcn;
if (cn != FCE_EMPTY && cn <= findcn) {
if (closest == NULL || cn > closest->fc_frcn)
closest = &dep->de_fc[i];
}
}
if (closest) {
*frcnp = closest->fc_frcn;
*fsrcnp = closest->fc_fsrcn;
}
}
/*
* Purge the FAT cache in denode dep of all entries relating to file
* relative cluster frcn and beyond.
*/
void
fc_purge(struct denode *dep, u_int frcn)
{
int i;
struct fatcache *fcp;
fcp = dep->de_fc;
for (i = 0; i < FC_SIZE; i++, fcp++) {
if (fcp->fc_frcn >= frcn)
fcp->fc_frcn = FCE_EMPTY;
}
}
/*
* Update the FAT.
* If mirroring the FAT, update all copies, with the first copy as last.
* Else update only the current FAT (ignoring the others).
*
* pmp - msdosfsmount structure for filesystem to update
* bp - addr of modified FAT block
* fatbn - block number relative to begin of filesystem of the modified FAT block.
*/
static void
updatefats(struct msdosfsmount *pmp, struct buf *bp, u_long fatbn)
{
struct buf *bpn;
int cleanfat, i;
#ifdef MSDOSFS_DEBUG
printf("updatefats(pmp %p, bp %p, fatbn %lu)\n", pmp, bp, fatbn);
#endif
if (pmp->pm_flags & MSDOSFS_FATMIRROR) {
/*
* Now copy the block(s) of the modified FAT to the other copies of
* the FAT and write them out. This is faster than reading in the
* other FATs and then writing them back out. This could tie up
* the FAT for quite a while. Preventing others from accessing it.
* To prevent us from going after the FAT quite so much we use
* delayed writes, unless they specified "synchronous" when the
* filesystem was mounted. If synch is asked for then use
* bwrite()'s and really slow things down.
*/
if (fatbn != pmp->pm_fatblk || FAT12(pmp))
cleanfat = 0;
else if (FAT16(pmp))
cleanfat = 16;
else
cleanfat = 32;
for (i = 1; i < pmp->pm_FATs; i++) {
fatbn += pmp->pm_FATsecs;
/* getblk() never fails */
bpn = getblk(pmp->pm_devvp, fatbn, bp->b_bcount,
0, 0, 0);
memcpy(bpn->b_data, bp->b_data, bp->b_bcount);
/* Force the clean bit on in the other copies. */
if (cleanfat == 16)
((uint8_t *)bpn->b_data)[3] |= 0x80;
else if (cleanfat == 32)
((uint8_t *)bpn->b_data)[7] |= 0x08;
if (SYNCHRONOUS_WRITES(pmp))
bwrite(bpn);
else
bdwrite(bpn);
}
}
/*
* Write out the first (or current) FAT last.
*/
if (SYNCHRONOUS_WRITES(pmp))
bwrite(bp);
else
bdwrite(bp);
}
/*
* Updating entries in 12 bit FATs is a pain in the butt.
*
* The following picture shows where nibbles go when moving from a 12 bit
* cluster number into the appropriate bytes in the FAT.
*
* byte m byte m+1 byte m+2
* +----+----+ +----+----+ +----+----+
* | 0 1 | | 2 3 | | 4 5 | FAT bytes
* +----+----+ +----+----+ +----+----+
*
* +----+----+----+ +----+----+----+
* | 3 0 1 | | 4 5 2 |
* +----+----+----+ +----+----+----+
* cluster n cluster n+1
*
* Where n is even. m = n + (n >> 2)
*
*/
static __inline void
usemap_alloc(struct msdosfsmount *pmp, u_long cn)
{
assert(cn <= pmp->pm_maxcluster);
assert((pmp->pm_flags & MSDOSFSMNT_RONLY) == 0);
assert((pmp->pm_inusemap[cn / N_INUSEBITS] & (1 << (cn % N_INUSEBITS)))
== 0);
assert(pmp->pm_freeclustercount > 0);
pmp->pm_inusemap[cn / N_INUSEBITS] |= 1U << (cn % N_INUSEBITS);
pmp->pm_freeclustercount--;
pmp->pm_flags |= MSDOSFS_FSIMOD;
}
static __inline void
usemap_free(struct msdosfsmount *pmp, u_long cn)
{
assert(cn <= pmp->pm_maxcluster);
assert((pmp->pm_flags & MSDOSFSMNT_RONLY) == 0);
assert((pmp->pm_inusemap[cn / N_INUSEBITS] & (1 << (cn % N_INUSEBITS)))
!= 0);
pmp->pm_freeclustercount++;
pmp->pm_flags |= MSDOSFS_FSIMOD;
pmp->pm_inusemap[cn / N_INUSEBITS] &= ~(1U << (cn % N_INUSEBITS));
}
void
clusterfree(struct msdosfsmount *pmp, u_long cluster)
{
int error;
u_long oldcn;
error = fatentry(FAT_GET_AND_SET, pmp, cluster, &oldcn, MSDOSFSFREE);
if (error != 0)
return;
/*
* If the cluster was successfully marked free, then update
* the count of free clusters, and turn off the "allocated"
* bit in the "in use" cluster bit map.
*/
usemap_free(pmp, cluster);
}
/*
* Get or Set or 'Get and Set' the cluster'th entry in the FAT.
*
* function - whether to get or set a FAT entry
* pmp - address of the msdosfsmount structure for the filesystem
* whose FAT is to be manipulated.
* cn - which cluster is of interest
* oldcontents - address of a word that is to receive the contents of the
* cluster'th entry if this is a get function
* newcontents - the new value to be written into the cluster'th element of
* the FAT if this is a set function.
*
* This function can also be used to free a cluster by setting the FAT entry
* for a cluster to 0.
*
* All copies of the FAT are updated if this is a set function. NOTE: If
* fatentry() marks a cluster as free it does not update the inusemap in
* the msdosfsmount structure. This is left to the caller.
*/
int
fatentry(int function, struct msdosfsmount *pmp, u_long cn, u_long *oldcontents,
u_long newcontents)
{
int error;
u_long readcn;
u_long bn, bo, bsize, byteoffset;
struct buf *bp;
#ifdef MSDOSFS_DEBUG
printf("fatentry(func %d, pmp %p, clust %lu, oldcon %p, newcon %lx)\n",
function, pmp, cn, oldcontents, newcontents);
#endif
#ifdef DIAGNOSTIC
/*
* Be sure they asked us to do something.
*/
if ((function & (FAT_SET | FAT_GET)) == 0) {
#ifdef MSDOSFS_DEBUG
printf("fatentry(): function code doesn't specify get or set\n");
#endif
return (EINVAL);
}
/*
* If they asked us to return a cluster number but didn't tell us
* where to put it, give them an error.
*/
if ((function & FAT_GET) && oldcontents == NULL) {
#ifdef MSDOSFS_DEBUG
printf("fatentry(): get function with no place to put result\n");
#endif
return (EINVAL);
}
#endif
/*
* Be sure the requested cluster is in the filesystem.
*/
if (cn < CLUST_FIRST || cn > pmp->pm_maxcluster)
return (EINVAL);
byteoffset = FATOFS(pmp, cn);
fatblock(pmp, byteoffset, &bn, &bsize, &bo);
error = bread(pmp->pm_devvp, bn, bsize, NOCRED, &bp);
if (error) {
brelse(bp);
return (error);
}
if (function & FAT_GET) {
if (FAT32(pmp))
readcn = getulong(bp->b_data + bo);
else
readcn = getushort(bp->b_data + bo);
if (FAT12(pmp) & (cn & 1))
readcn >>= 4;
readcn &= pmp->pm_fatmask;
/* map reserved FAT entries to same values for all FATs */
if ((readcn | ~pmp->pm_fatmask) >= CLUST_RSRVD)
readcn |= ~pmp->pm_fatmask;
*oldcontents = readcn;
}
if (function & FAT_SET) {
switch (pmp->pm_fatmask) {
case FAT12_MASK:
readcn = getushort(bp->b_data + bo);
if (cn & 1) {
readcn &= 0x000f;
readcn |= newcontents << 4;
} else {
readcn &= 0xf000;
readcn |= newcontents & 0xfff;
}
putushort(bp->b_data + bo, readcn);
break;
case FAT16_MASK:
putushort(bp->b_data + bo, newcontents);
break;
case FAT32_MASK:
/*
* According to spec we have to retain the
* high order bits of the FAT entry.
*/
readcn = getulong(bp->b_data + bo);
readcn &= ~FAT32_MASK;
readcn |= newcontents & FAT32_MASK;
putulong(bp->b_data + bo, readcn);
break;
}
updatefats(pmp, bp, bn);
bp = NULL;
pmp->pm_fmod = 1;
}
if (bp)
brelse(bp);
return (0);
}
/*
* Update a contiguous cluster chain
*
* pmp - mount point
* start - first cluster of chain
* count - number of clusters in chain
* fillwith - what to write into FAT entry of last cluster
*/
static int
fatchain(struct msdosfsmount *pmp, u_long start, u_long count, u_long fillwith)
{
int error;
u_long bn, bo, bsize, byteoffset, readcn, newc;
struct buf *bp;
#ifdef MSDOSFS_DEBUG
printf("fatchain(pmp %p, start %lu, count %lu, fillwith %lx)\n",
pmp, start, count, fillwith);
#endif
/*
* Be sure the clusters are in the filesystem.
*/
if (start < CLUST_FIRST || start + count - 1 > pmp->pm_maxcluster)
return (EINVAL);
while (count > 0) {
byteoffset = FATOFS(pmp, start);
fatblock(pmp, byteoffset, &bn, &bsize, &bo);
error = bread(pmp->pm_devvp, bn, bsize, NOCRED, &bp);
if (error) {
brelse(bp);
return (error);
}
while (count > 0) {
start++;
newc = --count > 0 ? start : fillwith;
switch (pmp->pm_fatmask) {
case FAT12_MASK:
readcn = getushort(bp->b_data + bo);
if (start & 1) {
readcn &= 0xf000;
readcn |= newc & 0xfff;
} else {
readcn &= 0x000f;
readcn |= newc << 4;
}
putushort(bp->b_data + bo, readcn);
bo++;
if (!(start & 1))
bo++;
break;
case FAT16_MASK:
putushort(bp->b_data + bo, newc);
bo += 2;
break;
case FAT32_MASK:
readcn = getulong(bp->b_data + bo);
readcn &= ~pmp->pm_fatmask;
readcn |= newc & pmp->pm_fatmask;
putulong(bp->b_data + bo, readcn);
bo += 4;
break;
}
if (bo >= bsize)
break;
}
updatefats(pmp, bp, bn);
}
pmp->pm_fmod = 1;
return (0);
}
/*
* Check the length of a free cluster chain starting at start.
*
* pmp - mount point
* start - start of chain
* count - maximum interesting length
*/
static int
chainlength(struct msdosfsmount *pmp, u_long start, u_long count)
{
u_long idx, max_idx;
u_int map;
u_long len;
if (start > pmp->pm_maxcluster)
return (0);
max_idx = pmp->pm_maxcluster / N_INUSEBITS;
idx = start / N_INUSEBITS;
start %= N_INUSEBITS;
map = pmp->pm_inusemap[idx];
map &= ~((1 << start) - 1);
if (map) {
len = ffs(map) - 1 - start;
len = MIN(len, count);
if (start + len > pmp->pm_maxcluster)
len = pmp->pm_maxcluster - start + 1;
return (len);
}
len = N_INUSEBITS - start;
if (len >= count) {
len = count;
if (start + len > pmp->pm_maxcluster)
len = pmp->pm_maxcluster - start + 1;
return (len);
}
while (++idx <= max_idx) {
if (len >= count)
break;
map = pmp->pm_inusemap[idx];
if (map) {
len += ffs(map) - 1;
break;
}
len += N_INUSEBITS;
}
len = MIN(len, count);
if (start + len > pmp->pm_maxcluster)
len = pmp->pm_maxcluster - start + 1;
return (len);
}
/*
* Allocate contiguous free clusters.
*
* pmp - mount point.
* start - start of cluster chain.
* count - number of clusters to allocate.
* fillwith - put this value into the FAT entry for the
* last allocated cluster.
* retcluster - put the first allocated cluster's number here.
* got - how many clusters were actually allocated.
*/
static int
chainalloc(struct msdosfsmount *pmp, u_long start, u_long count,
u_long fillwith, u_long *retcluster, u_long *got)
{
int error;
u_long cl, n;
assert((pmp->pm_flags & MSDOSFSMNT_RONLY) == 0);
for (cl = start, n = count; n-- > 0;)
usemap_alloc(pmp, cl++);
pmp->pm_nxtfree = start + count;
if (pmp->pm_nxtfree > pmp->pm_maxcluster)
pmp->pm_nxtfree = CLUST_FIRST;
pmp->pm_flags |= MSDOSFS_FSIMOD;
error = fatchain(pmp, start, count, fillwith);
if (error != 0) {
for (cl = start, n = count; n-- > 0;)
usemap_free(pmp, cl++);
return (error);
}
#ifdef MSDOSFS_DEBUG
printf("clusteralloc(): allocated cluster chain at %lu (%lu clusters)\n",
start, count);
#endif
if (retcluster)
*retcluster = start;
if (got)
*got = count;
return (0);
}
/*
* Allocate contiguous free clusters.
*
* pmp - mount point.
* start - preferred start of cluster chain.
* count - number of clusters requested.
* fillwith - put this value into the FAT entry for the
* last allocated cluster.
* retcluster - put the first allocated cluster's number here.
* got - how many clusters were actually allocated.
*/
int
clusteralloc(struct msdosfsmount *pmp, u_long start, u_long count,
u_long fillwith, u_long *retcluster, u_long *got)
{
int error;
error = clusteralloc1(pmp, start, count, fillwith, retcluster, got);
return (error);
}
static int
clusteralloc1(struct msdosfsmount *pmp, u_long start, u_long count,
u_long fillwith, u_long *retcluster, u_long *got)
{
u_long idx;
u_long len, newst, foundl, cn, l;
u_long foundcn = 0; /* XXX: foundcn could be used uninitialized */
u_int map;
MSDOSFS_DPRINTF(("clusteralloc(): find %lu clusters\n", count));
if (start) {
if ((len = chainlength(pmp, start, count)) >= count)
return (chainalloc(pmp, start, count, fillwith, retcluster, got));
} else
len = 0;
newst = pmp->pm_nxtfree;
foundl = 0;
for (cn = newst; cn <= pmp->pm_maxcluster;) {
idx = cn / N_INUSEBITS;
map = pmp->pm_inusemap[idx];
map |= (1U << (cn % N_INUSEBITS)) - 1;
if (map != FULL_RUN) {
cn = idx * N_INUSEBITS + ffs(map ^ FULL_RUN) - 1;
if ((l = chainlength(pmp, cn, count)) >= count)
return (chainalloc(pmp, cn, count, fillwith, retcluster, got));
if (l > foundl) {
foundcn = cn;
foundl = l;
}
cn += l + 1;
continue;
}
cn += N_INUSEBITS - cn % N_INUSEBITS;
}
for (cn = 0; cn < newst;) {
idx = cn / N_INUSEBITS;
map = pmp->pm_inusemap[idx];
map |= (1U << (cn % N_INUSEBITS)) - 1;
if (map != FULL_RUN) {
cn = idx * N_INUSEBITS + ffs(map ^ FULL_RUN) - 1;
if ((l = chainlength(pmp, cn, count)) >= count)
return (chainalloc(pmp, cn, count, fillwith, retcluster, got));
if (l > foundl) {
foundcn = cn;
foundl = l;
}
cn += l + 1;
continue;
}
cn += N_INUSEBITS - cn % N_INUSEBITS;
}
if (!foundl)
return (ENOSPC);
if (len)
return (chainalloc(pmp, start, len, fillwith, retcluster, got));
else
return (chainalloc(pmp, foundcn, foundl, fillwith, retcluster, got));
}
/*
* Free a chain of clusters.
*
* pmp - address of the msdosfs mount structure for the filesystem
* containing the cluster chain to be freed.
* startcluster - number of the 1st cluster in the chain of clusters to be
* freed.
*/
int
freeclusterchain(struct msdosfsmount *pmp, u_long cluster)
{
int error;
struct buf *bp = NULL;
u_long bn, bo, bsize, byteoffset;
u_long readcn, lbn = -1;
while (cluster >= CLUST_FIRST && cluster <= pmp->pm_maxcluster) {
byteoffset = FATOFS(pmp, cluster);
fatblock(pmp, byteoffset, &bn, &bsize, &bo);
if (lbn != bn) {
if (bp)
updatefats(pmp, bp, lbn);
error = bread(pmp->pm_devvp, bn, bsize, NOCRED, &bp);
if (error) {
brelse(bp);
return (error);
}
lbn = bn;
}
usemap_free(pmp, cluster);
switch (pmp->pm_fatmask) {
case FAT12_MASK:
readcn = getushort(bp->b_data + bo);
if (cluster & 1) {
cluster = readcn >> 4;
readcn &= 0x000f;
readcn |= MSDOSFSFREE << 4;
} else {
cluster = readcn;
readcn &= 0xf000;
readcn |= MSDOSFSFREE & 0xfff;
}
putushort(bp->b_data + bo, readcn);
break;
case FAT16_MASK:
cluster = getushort(bp->b_data + bo);
putushort(bp->b_data + bo, MSDOSFSFREE);
break;
case FAT32_MASK:
cluster = getulong(bp->b_data + bo);
putulong(bp->b_data + bo,
(MSDOSFSFREE & FAT32_MASK) | (cluster & ~FAT32_MASK));
break;
}
cluster &= pmp->pm_fatmask;
if ((cluster | ~pmp->pm_fatmask) >= CLUST_RSRVD)
cluster |= pmp->pm_fatmask;
}
if (bp)
updatefats(pmp, bp, bn);
return (0);
}
/*
* Read in FAT blocks looking for free clusters. For every free cluster
* found turn off its corresponding bit in the pm_inusemap.
*/
int
fillinusemap(struct msdosfsmount *pmp)
{
struct buf *bp;
u_long bn, bo, bsize, byteoffset, cn, readcn;
int error;
bp = NULL;
/*
* Mark all clusters in use, we mark the free ones in the FAT scan
* loop further down.
*/
for (cn = 0; cn < (pmp->pm_maxcluster + N_INUSEBITS) / N_INUSEBITS; cn++)
pmp->pm_inusemap[cn] = FULL_RUN;
/*
* Figure how many free clusters are in the filesystem by ripping
* through the FAT counting the number of entries whose content is
* zero. These represent free clusters.
*/
pmp->pm_freeclustercount = 0;
for (cn = 0; cn <= pmp->pm_maxcluster; cn++) {
byteoffset = FATOFS(pmp, cn);
bo = byteoffset % pmp->pm_fatblocksize;
if (bo == 0) {
/* Read new FAT block */
if (bp != NULL)
brelse(bp);
fatblock(pmp, byteoffset, &bn, &bsize, NULL);
error = bread(pmp->pm_devvp, bn, bsize, NOCRED, &bp);
if (error != 0)
return (error);
}
if (FAT32(pmp))
readcn = getulong(bp->b_data + bo);
else
readcn = getushort(bp->b_data + bo);
if (FAT12(pmp) && (cn & 1))
readcn >>= 4;
readcn &= pmp->pm_fatmask;
/*
* Check if the FAT ID matches the BPB's media descriptor and
* all other bits are set to 1.
*/
if (cn == 0 && readcn != ((pmp->pm_fatmask & 0xffffff00) |
pmp->pm_bpb.bpbMedia)) {
#ifdef MSDOSFS_DEBUG
printf("mountmsdosfs(): Media descriptor in BPB"
"does not match FAT ID\n");
#endif
brelse(bp);
return (EINVAL);
} else if (readcn == CLUST_FREE)
usemap_free(pmp, cn);
}
if (bp != NULL)
brelse(bp);
for (cn = pmp->pm_maxcluster + 1; cn < (pmp->pm_maxcluster +
N_INUSEBITS) / N_INUSEBITS; cn++)
pmp->pm_inusemap[cn / N_INUSEBITS] |= 1U << (cn % N_INUSEBITS);
return (0);
}
/*
* Allocate a new cluster and chain it onto the end of the file.
*
* dep - the file to extend
* count - number of clusters to allocate
* bpp - where to return the address of the buf header for the first new
* file block
* ncp - where to put cluster number of the first newly allocated cluster
* If this pointer is 0, do not return the cluster number.
* flags - see fat.h
*
* NOTE: This function is not responsible for turning on the DE_UPDATE bit of
* the de_flag field of the denode and it does not change the de_FileSize
* field. This is left for the caller to do.
*/
int
extendfile(struct denode *dep, u_long count, struct buf **bpp, u_long *ncp,
int flags)
{
int error;
u_long frcn;
u_long cn, got;
struct msdosfsmount *pmp = dep->de_pmp;
struct buf *bp;
/*
* Don't try to extend the root directory
*/
if (dep->de_StartCluster == MSDOSFSROOT
&& (dep->de_Attributes & ATTR_DIRECTORY)) {
#ifdef MSDOSFS_DEBUG
printf("extendfile(): attempt to extend root directory\n");
#endif
return (ENOSPC);
}
/*
* If the "file's last cluster" cache entry is empty, and the file
* is not empty, then fill the cache entry by calling pcbmap().
*/
if (dep->de_fc[FC_LASTFC].fc_frcn == FCE_EMPTY &&
dep->de_StartCluster != 0) {
error = pcbmap(dep, 0xffff, 0, &cn, 0);
/* we expect it to return E2BIG */
if (error != E2BIG)
return (error);
}
dep->de_fc[FC_NEXTTOLASTFC].fc_frcn =
dep->de_fc[FC_LASTFC].fc_frcn;
dep->de_fc[FC_NEXTTOLASTFC].fc_fsrcn =
dep->de_fc[FC_LASTFC].fc_fsrcn;
while (count > 0) {
/*
* Allocate a new cluster chain and cat onto the end of the
* file. If the file is empty we make de_StartCluster point
* to the new block. Note that de_StartCluster being 0 is
* sufficient to be sure the file is empty since we exclude
* attempts to extend the root directory above, and the root
* dir is the only file with a startcluster of 0 that has
* blocks allocated (sort of).
*/
if (dep->de_StartCluster == 0)
cn = 0;
else
cn = dep->de_fc[FC_LASTFC].fc_fsrcn + 1;
error = clusteralloc(pmp, cn, count, CLUST_EOFE, &cn, &got);
if (error)
return (error);
count -= got;
/*
* Give them the filesystem relative cluster number if they want
* it.
*/
if (ncp) {
*ncp = cn;
ncp = NULL;
}
if (dep->de_StartCluster == 0) {
dep->de_StartCluster = cn;
frcn = 0;
} else {
error = fatentry(FAT_SET, pmp,
dep->de_fc[FC_LASTFC].fc_fsrcn,
0, cn);
if (error) {
clusterfree(pmp, cn);
return (error);
}
frcn = dep->de_fc[FC_LASTFC].fc_frcn + 1;
}
/*
* Update the "last cluster of the file" entry in the
* denode's FAT cache.
*/
fc_setcache(dep, FC_LASTFC, frcn + got - 1, cn + got - 1);
if ((flags & DE_CLEAR) &&
(dep->de_Attributes & ATTR_DIRECTORY)) {
while (got-- > 0) {
bp = getblk(pmp->pm_devvp,
cntobn(pmp, cn++),
pmp->pm_bpcluster, 0, 0, 0);
clrbuf(bp);
if (bpp) {
*bpp = bp;
bpp = NULL;
} else {
bdwrite(bp);
}
}
}
}
return (0);
}
diff --git a/usr.sbin/makefs/msdos/msdosfs_lookup.c b/usr.sbin/makefs/msdos/msdosfs_lookup.c
index cebaad69e7d4..cb5178d2ab20 100644
--- a/usr.sbin/makefs/msdos/msdosfs_lookup.c
+++ b/usr.sbin/makefs/msdos/msdosfs_lookup.c
@@ -1,298 +1,297 @@
-/* $FreeBSD$ */
/* $NetBSD: msdosfs_lookup.c,v 1.37 1997/11/17 15:36:54 ws Exp $ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (C) 1994, 1995, 1997 Wolfgang Solfrank.
* Copyright (C) 1994, 1995, 1997 TooLs GmbH.
* All rights reserved.
* Original code by Paul Popelka (paulp@uts.amdahl.com) (see below).
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by TooLs GmbH.
* 4. The name of TooLs GmbH may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*-
* Written by Paul Popelka (paulp@uts.amdahl.com)
*
* You can do anything you want with this software, just don't say you wrote
* it, and don't remove this notice.
*
* This software is provided "as is".
*
* The author supplies this software to be publicly redistributed on the
* understanding that the author is not responsible for the correct
* functioning of this software in any circumstances and is not liable for
* any damages caused by this software.
*
* October 1992
*/
#include <sys/param.h>
#include <sys/errno.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include "ffs/buf.h"
#include <fs/msdosfs/bpb.h>
#include "msdos/direntry.h"
#include <fs/msdosfs/denode.h>
#include <fs/msdosfs/fat.h>
#include <fs/msdosfs/msdosfsmount.h>
#include "makefs.h"
#include "msdos.h"
/*
* dep - directory entry to copy into the directory
* ddep - directory to add to
* depp - return the address of the denode for the created directory entry
* if depp != 0
* cnp - componentname needed for Win95 long filenames
*/
int
createde(struct denode *dep, struct denode *ddep, struct denode **depp,
struct componentname *cnp)
{
int error;
u_long dirclust, diroffset;
struct direntry *ndep;
struct msdosfsmount *pmp = ddep->de_pmp;
struct buf *bp;
daddr_t bn;
int blsize;
MSDOSFS_DPRINTF(("createde(dep %p, ddep %p, depp %p, cnp %p)\n",
dep, ddep, depp, cnp));
/*
* If no space left in the directory then allocate another cluster
* and chain it onto the end of the file. There is one exception
* to this. That is, if the root directory has no more space it
* can NOT be expanded. extendfile() checks for and fails attempts
* to extend the root directory. We just return an error in that
* case.
*/
if (ddep->de_fndoffset >= ddep->de_FileSize) {
diroffset = ddep->de_fndoffset + sizeof(struct direntry)
- ddep->de_FileSize;
dirclust = de_clcount(pmp, diroffset);
error = extendfile(ddep, dirclust, 0, 0, DE_CLEAR);
if (error) {
(void)detrunc(ddep, ddep->de_FileSize, 0, NULL);
return error;
}
/*
* Update the size of the directory
*/
ddep->de_FileSize += de_cn2off(pmp, dirclust);
}
/*
* We just read in the cluster with space. Copy the new directory
* entry in. Then write it to disk. NOTE: DOS directories
* do not get smaller as clusters are emptied.
*/
error = pcbmap(ddep, de_cluster(pmp, ddep->de_fndoffset),
&bn, &dirclust, &blsize);
if (error)
return error;
diroffset = ddep->de_fndoffset;
if (dirclust != MSDOSFSROOT)
diroffset &= pmp->pm_crbomask;
if ((error = bread(pmp->pm_devvp, bn, blsize, NOCRED, &bp)) != 0) {
return error;
}
ndep = bptoep(pmp, bp, ddep->de_fndoffset);
DE_EXTERNALIZE(ndep, dep);
/*
* Now write the Win95 long name
*/
if (ddep->de_fndcnt > 0) {
uint8_t chksum = winChksum(ndep->deName);
const u_char *un = (const u_char *)cnp->cn_nameptr;
int unlen = cnp->cn_namelen;
int cnt = 1;
while (--ddep->de_fndcnt >= 0) {
if (!(ddep->de_fndoffset & pmp->pm_crbomask)) {
if ((error = bwrite(bp)) != 0)
return error;
ddep->de_fndoffset -= sizeof(struct direntry);
error = pcbmap(ddep,
de_cluster(pmp,
ddep->de_fndoffset),
&bn, 0, &blsize);
if (error)
return error;
error = bread(pmp->pm_devvp, bn, blsize,
NOCRED, &bp);
if (error) {
return error;
}
ndep = bptoep(pmp, bp, ddep->de_fndoffset);
} else {
ndep--;
ddep->de_fndoffset -= sizeof(struct direntry);
}
if (!unix2winfn(un, unlen, (struct winentry *)ndep,
cnt++, chksum))
break;
}
}
if ((error = bwrite(bp)) != 0)
return error;
/*
* If they want us to return with the denode gotten.
*/
if (depp) {
if (dep->de_Attributes & ATTR_DIRECTORY) {
dirclust = dep->de_StartCluster;
if (FAT32(pmp) && dirclust == pmp->pm_rootdirblk)
dirclust = MSDOSFSROOT;
if (dirclust == MSDOSFSROOT)
diroffset = MSDOSFSROOT_OFS;
else
diroffset = 0;
}
return deget(pmp, dirclust, diroffset, 0, depp);
}
return 0;
}
/*
* Read in the disk block containing the directory entry (dirclu, dirofs)
* and return the address of the buf header, and the address of the
* directory entry within the block.
*/
int
readep(struct msdosfsmount *pmp, u_long dirclust, u_long diroffset,
struct buf **bpp, struct direntry **epp)
{
int error;
daddr_t bn;
int blsize;
blsize = pmp->pm_bpcluster;
if (dirclust == MSDOSFSROOT
&& de_blk(pmp, diroffset + blsize) > pmp->pm_rootdirsize)
blsize = de_bn2off(pmp, pmp->pm_rootdirsize) & pmp->pm_crbomask;
bn = detobn(pmp, dirclust, diroffset);
if ((error = bread(pmp->pm_devvp, bn, blsize, NOCRED, bpp)) != 0) {
*bpp = NULL;
return (error);
}
if (epp)
*epp = bptoep(pmp, *bpp, diroffset);
return (0);
}
/*
* Read in the disk block containing the directory entry dep came from and
* return the address of the buf header, and the address of the directory
* entry within the block.
*/
int
readde(struct denode *dep, struct buf **bpp, struct direntry **epp)
{
return (readep(dep->de_pmp, dep->de_dirclust, dep->de_diroffset,
bpp, epp));
}
/*
* Create a unique DOS name in dvp
*/
int
uniqdosname(struct denode *dep, struct componentname *cnp, u_char *cp)
{
struct msdosfsmount *pmp = dep->de_pmp;
struct direntry *dentp;
int gen;
int blsize;
u_long cn;
daddr_t bn;
struct buf *bp;
int error;
if (pmp->pm_flags & MSDOSFSMNT_SHORTNAME)
return (unix2dosfn((const u_char *)cnp->cn_nameptr, cp,
cnp->cn_namelen, 0) ? 0 : EINVAL);
for (gen = 1;; gen++) {
/*
* Generate DOS name with generation number
*/
if (!unix2dosfn((const u_char *)cnp->cn_nameptr, cp,
cnp->cn_namelen, gen))
return gen == 1 ? EINVAL : EEXIST;
/*
* Now look for a dir entry with this exact name
*/
for (cn = error = 0; !error; cn++) {
if ((error = pcbmap(dep, cn, &bn, 0, &blsize)) != 0) {
if (error == E2BIG) /* EOF reached and not found */
return 0;
return error;
}
error = bread(pmp->pm_devvp, bn, blsize, NOCRED, &bp);
if (error) {
return error;
}
for (dentp = (struct direntry *)bp->b_data;
(char *)dentp < bp->b_data + blsize;
dentp++) {
if (dentp->deName[0] == SLOT_EMPTY) {
/*
* Last used entry and not found
*/
brelse(bp);
return 0;
}
/*
* Ignore volume labels and Win95 entries
*/
if (dentp->deAttributes & ATTR_VOLUME)
continue;
if (!bcmp(dentp->deName, cp, 11)) {
error = EEXIST;
break;
}
}
brelse(bp);
}
}
}
diff --git a/usr.sbin/ndp/ndp.c b/usr.sbin/ndp/ndp.c
index 5097c156e624..5e79666e6c38 100644
--- a/usr.sbin/ndp/ndp.c
+++ b/usr.sbin/ndp/ndp.c
@@ -1,1490 +1,1489 @@
-/* $FreeBSD$ */
/* $KAME: ndp.c,v 1.104 2003/06/27 07:48:39 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* Copyright (c) 1984, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Sun Microsystems, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* Based on:
* "@(#) Copyright (c) 1984, 1993\n\
* The Regents of the University of California. All rights reserved.\n";
*
* "@(#)arp.c 8.2 (Berkeley) 1/2/94";
*/
/*
* ndp - display, set, delete and flush neighbor cache
*/
#include <sys/param.h>
#include <sys/file.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <sys/time.h>
#include <sys/queue.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/if_types.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/if_ether.h>
#include <netinet/icmp6.h>
#include <netinet6/in6_var.h>
#include <netinet6/nd6.h>
#include <arpa/inet.h>
#include <ctype.h>
#include <netdb.h>
#include <errno.h>
#include <nlist.h>
#include <stdio.h>
#include <string.h>
#include <paths.h>
#include <err.h>
#include <stdlib.h>
#include <fcntl.h>
#include <unistd.h>
#include <libxo/xo.h>
#include "gmt2local.h"
#define NEXTADDR(w, s) \
if (rtm->rtm_addrs & (w)) { \
bcopy((char *)&s, cp, sizeof(s)); \
cp += SA_SIZE(&s); \
}
static pid_t pid;
static int nflag;
static int tflag;
static int32_t thiszone; /* time difference with gmt */
static int s = -1;
static int repeat = 0;
static char host_buf[NI_MAXHOST]; /* getnameinfo() */
static char ifix_buf[IFNAMSIZ]; /* if_indextoname() */
static int file(char *);
static void getsocket(void);
static int set(int, char **);
static void get(char *);
static int delete(char *);
static void dump(struct sockaddr_in6 *, int);
static struct in6_nbrinfo *getnbrinfo(struct in6_addr *, int, int);
static char *ether_str(struct sockaddr_dl *);
static int ndp_ether_aton(char *, u_char *);
static void usage(void);
static int rtmsg(int);
static void ifinfo(char *, int, char **);
static void rtrlist(void);
static void plist(void);
static void pfx_flush(void);
static void rtr_flush(void);
static void harmonize_rtr(void);
#ifdef SIOCSDEFIFACE_IN6 /* XXX: check SIOCGDEFIFACE_IN6 as well? */
static void getdefif(void);
static void setdefif(char *);
#endif
static char *sec2str(time_t);
static void ts_print(const struct timeval *);
static const char *rtpref_str[] = {
"medium", /* 00 */
"high", /* 01 */
"rsv", /* 10 */
"low" /* 11 */
};
#define NDP_XO_VERSION "1"
int
main(int argc, char **argv)
{
int ch, mode = 0;
char *arg = NULL;
pid = getpid();
thiszone = gmt2local(0);
argc = xo_parse_args(argc, argv);
if (argc < 0)
exit(1);
xo_set_version(NDP_XO_VERSION);
xo_open_container("ndp");
while ((ch = getopt(argc, argv, "acd:f:Ii:nprstA:HPR")) != -1)
switch (ch) {
case 'a':
case 'c':
case 'p':
case 'r':
case 'H':
case 'P':
case 'R':
case 's':
case 'I':
if (mode) {
usage();
/*NOTREACHED*/
}
mode = ch;
arg = NULL;
break;
case 'f':
exit(file(optarg) ? 1 : 0);
case 'd':
case 'i':
if (mode) {
usage();
/*NOTREACHED*/
}
mode = ch;
arg = optarg;
break;
case 'n':
nflag = 1;
break;
case 't':
tflag = 1;
break;
case 'A':
if (mode) {
usage();
/*NOTREACHED*/
}
mode = 'a';
repeat = atoi(optarg);
if (repeat < 0) {
usage();
/*NOTREACHED*/
}
break;
default:
usage();
}
argc -= optind;
argv += optind;
switch (mode) {
case 'a':
case 'c':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
dump(0, mode == 'c');
break;
case 'd':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
xo_open_list("neighbor-cache");
delete(arg);
xo_close_list("neighbor-cache");
break;
case 'I':
#ifdef SIOCSDEFIFACE_IN6 /* XXX: check SIOCGDEFIFACE_IN6 as well? */
if (argc > 1) {
usage();
/*NOTREACHED*/
} else if (argc == 1) {
if (strcmp(*argv, "delete") == 0 ||
if_nametoindex(*argv))
setdefif(*argv);
else
xo_errx(1, "invalid interface %s", *argv);
}
getdefif(); /* always call it to print the result */
break;
#else
xo_errx(1, "not supported yet");
/*NOTREACHED*/
#endif
case 'p':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
plist();
break;
case 'i':
ifinfo(arg, argc, argv);
break;
case 'r':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
rtrlist();
break;
case 's':
if (argc < 2 || argc > 4)
usage();
exit(set(argc, argv) ? 1 : 0);
case 'H':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
harmonize_rtr();
break;
case 'P':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
pfx_flush();
break;
case 'R':
if (argc != 0) {
usage();
/*NOTREACHED*/
}
rtr_flush();
break;
case 0:
if (argc != 1) {
usage();
/*NOTREACHED*/
}
get(argv[0]);
break;
}
xo_close_container("ndp");
xo_finish();
exit(0);
}
/*
* Process a file to set standard ndp entries
*/
static int
file(char *name)
{
FILE *fp;
int i, retval;
char line[100], arg[5][50], *args[5], *p;
if ((fp = fopen(name, "r")) == NULL)
xo_err(1, "cannot open %s", name);
args[0] = &arg[0][0];
args[1] = &arg[1][0];
args[2] = &arg[2][0];
args[3] = &arg[3][0];
args[4] = &arg[4][0];
retval = 0;
while (fgets(line, sizeof(line), fp) != NULL) {
if ((p = strchr(line, '#')) != NULL)
*p = '\0';
for (p = line; isblank(*p); p++);
if (*p == '\n' || *p == '\0')
continue;
i = sscanf(line, "%49s %49s %49s %49s %49s",
arg[0], arg[1], arg[2], arg[3], arg[4]);
if (i < 2) {
xo_warnx("bad line: %s", line);
retval = 1;
continue;
}
if (set(i, args))
retval = 1;
}
fclose(fp);
return (retval);
}
static void
getsocket()
{
if (s < 0) {
s = socket(PF_ROUTE, SOCK_RAW, 0);
if (s < 0) {
xo_err(1, "socket");
/* NOTREACHED */
}
}
}
static struct sockaddr_in6 so_mask = {
.sin6_len = sizeof(so_mask),
.sin6_family = AF_INET6
};
static struct sockaddr_in6 blank_sin = {
.sin6_len = sizeof(blank_sin),
.sin6_family = AF_INET6
};
static struct sockaddr_in6 sin_m;
static struct sockaddr_dl blank_sdl = {
.sdl_len = sizeof(blank_sdl),
.sdl_family = AF_LINK
};
static struct sockaddr_dl sdl_m;
static time_t expire_time;
static int flags, found_entry;
static struct {
struct rt_msghdr m_rtm;
char m_space[512];
} m_rtmsg;
/*
* Set an individual neighbor cache entry
*/
static int
set(int argc, char **argv)
{
register struct sockaddr_in6 *sin = &sin_m;
register struct sockaddr_dl *sdl;
register struct rt_msghdr *rtm = &(m_rtmsg.m_rtm);
struct addrinfo hints, *res;
int gai_error;
u_char *ea;
char *host = argv[0], *eaddr = argv[1];
getsocket();
argc -= 2;
argv += 2;
sdl_m = blank_sdl;
sin_m = blank_sin;
bzero(&hints, sizeof(hints));
hints.ai_family = AF_INET6;
gai_error = getaddrinfo(host, NULL, &hints, &res);
if (gai_error) {
xo_warnx("%s: %s", host, gai_strerror(gai_error));
return 1;
}
sin->sin6_addr = ((struct sockaddr_in6 *)res->ai_addr)->sin6_addr;
sin->sin6_scope_id =
((struct sockaddr_in6 *)res->ai_addr)->sin6_scope_id;
ea = (u_char *)LLADDR(&sdl_m);
if (ndp_ether_aton(eaddr, ea) == 0)
sdl_m.sdl_alen = 6;
flags = expire_time = 0;
while (argc-- > 0) {
if (strncmp(argv[0], "temp", 4) == 0) {
struct timeval now;
gettimeofday(&now, 0);
expire_time = now.tv_sec + 20 * 60;
} else if (strncmp(argv[0], "proxy", 5) == 0)
flags |= RTF_ANNOUNCE;
argv++;
}
if (rtmsg(RTM_GET) < 0) {
xo_errx(1, "RTM_GET(%s) failed", host);
/* NOTREACHED */
}
sin = (struct sockaddr_in6 *)(rtm + 1);
sdl = (struct sockaddr_dl *)(ALIGN(sin->sin6_len) + (char *)sin);
if (IN6_ARE_ADDR_EQUAL(&sin->sin6_addr, &sin_m.sin6_addr)) {
if (sdl->sdl_family == AF_LINK &&
!(rtm->rtm_flags & RTF_GATEWAY)) {
switch (sdl->sdl_type) {
case IFT_ETHER: case IFT_FDDI: case IFT_ISO88023:
case IFT_ISO88024: case IFT_ISO88025:
case IFT_L2VLAN: case IFT_BRIDGE:
goto overwrite;
}
}
xo_warnx("cannot configure a new entry");
return 1;
}
overwrite:
if (sdl->sdl_family != AF_LINK) {
xo_warnx("cannot intuit interface index and type for %s", host);
return (1);
}
sdl_m.sdl_type = sdl->sdl_type;
sdl_m.sdl_index = sdl->sdl_index;
return (rtmsg(RTM_ADD));
}
/*
* Display an individual neighbor cache entry
*/
static void
get(char *host)
{
struct sockaddr_in6 *sin = &sin_m;
struct addrinfo hints, *res;
int gai_error;
sin_m = blank_sin;
bzero(&hints, sizeof(hints));
hints.ai_family = AF_INET6;
gai_error = getaddrinfo(host, NULL, &hints, &res);
if (gai_error) {
xo_warnx("%s: %s", host, gai_strerror(gai_error));
return;
}
sin->sin6_addr = ((struct sockaddr_in6 *)res->ai_addr)->sin6_addr;
sin->sin6_scope_id =
((struct sockaddr_in6 *)res->ai_addr)->sin6_scope_id;
dump(sin, 0);
if (found_entry == 0) {
getnameinfo((struct sockaddr *)sin, sin->sin6_len, host_buf,
sizeof(host_buf), NULL ,0,
(nflag ? NI_NUMERICHOST : 0));
xo_errx(1, "%s (%s) -- no entry", host, host_buf);
}
}
/*
* Delete a neighbor cache entry
*/
static int
delete(char *host)
{
struct sockaddr_in6 *sin = &sin_m;
register struct rt_msghdr *rtm = &m_rtmsg.m_rtm;
register char *cp = m_rtmsg.m_space;
struct sockaddr_dl *sdl;
struct addrinfo hints, *res;
int gai_error;
getsocket();
sin_m = blank_sin;
bzero(&hints, sizeof(hints));
hints.ai_family = AF_INET6;
gai_error = getaddrinfo(host, NULL, &hints, &res);
if (gai_error) {
xo_warnx("%s: %s", host, gai_strerror(gai_error));
return 1;
}
sin->sin6_addr = ((struct sockaddr_in6 *)res->ai_addr)->sin6_addr;
sin->sin6_scope_id =
((struct sockaddr_in6 *)res->ai_addr)->sin6_scope_id;
if (rtmsg(RTM_GET) < 0) {
xo_errx(1, "RTM_GET(%s) failed", host);
/* NOTREACHED */
}
sin = (struct sockaddr_in6 *)(rtm + 1);
sdl = (struct sockaddr_dl *)(ALIGN(sin->sin6_len) + (char *)sin);
if (IN6_ARE_ADDR_EQUAL(&sin->sin6_addr, &sin_m.sin6_addr)) {
if (sdl->sdl_family == AF_LINK &&
!(rtm->rtm_flags & RTF_GATEWAY)) {
goto delete;
}
xo_warnx("delete: cannot delete non-NDP entry");
return 1;
}
delete:
if (sdl->sdl_family != AF_LINK) {
xo_warnx("cannot locate %s", host);
return (1);
}
/*
* need to reinit the field because it has rt_key
* but we want the actual address
*/
NEXTADDR(RTA_DST, sin_m);
rtm->rtm_flags |= RTF_LLDATA;
if (rtmsg(RTM_DELETE) == 0) {
getnameinfo((struct sockaddr *)sin,
sin->sin6_len, host_buf,
sizeof(host_buf), NULL, 0,
(nflag ? NI_NUMERICHOST : 0));
xo_open_instance("neighbor-cache");
char *ifname = if_indextoname(sdl->sdl_index, ifix_buf);
if (ifname == NULL) {
strlcpy(ifix_buf, "?", sizeof(ifix_buf));
ifname = ifix_buf;
}
char abuf[INET6_ADDRSTRLEN];
inet_ntop(AF_INET6, &sin->sin6_addr, abuf, sizeof(abuf));
xo_emit("{:hostname/%s}{d:/ (%s) deleted\n}", host, host_buf);
xo_emit("{e:address/%s}{e:interface/%s}", abuf, ifname);
xo_close_instance("neighbor-cache");
}
return 0;
}
#define W_ADDR 36
#define W_LL 17
#define W_IF 6
/*
* Dump the entire neighbor cache
*/
static void
dump(struct sockaddr_in6 *addr, int cflag)
{
int mib[6];
size_t needed;
char *lim, *buf, *next;
struct rt_msghdr *rtm;
struct sockaddr_in6 *sin;
struct sockaddr_dl *sdl;
struct timeval now;
time_t expire;
int addrwidth;
int llwidth;
int ifwidth;
char flgbuf[8];
char *ifname;
/* Print header */
if (!tflag && !cflag) {
char xobuf[200];
snprintf(xobuf, sizeof(xobuf),
"{T:/%%-%d.%ds} {T:/%%-%d.%ds} {T:/%%%d.%ds} {T:/%%-9.9s} {T:%%1s} {T:%%5s}\n",
W_ADDR, W_ADDR, W_LL, W_LL, W_IF, W_IF);
xo_emit(xobuf, "Neighbor", "Linklayer Address", "Netif", "Expire", "S", "Flags");
}
xo_open_list("neighbor-cache");
again:;
mib[0] = CTL_NET;
mib[1] = PF_ROUTE;
mib[2] = 0;
mib[3] = AF_INET6;
mib[4] = NET_RT_FLAGS;
#ifdef RTF_LLINFO
mib[5] = RTF_LLINFO;
#else
mib[5] = 0;
#endif
if (sysctl(mib, 6, NULL, &needed, NULL, 0) < 0)
xo_err(1, "sysctl(PF_ROUTE estimate)");
if (needed > 0) {
if ((buf = malloc(needed)) == NULL)
xo_err(1, "malloc");
if (sysctl(mib, 6, buf, &needed, NULL, 0) < 0)
xo_err(1, "sysctl(PF_ROUTE, NET_RT_FLAGS)");
lim = buf + needed;
} else
buf = lim = NULL;
for (next = buf; next && next < lim; next += rtm->rtm_msglen) {
int isrouter = 0, prbs = 0;
rtm = (struct rt_msghdr *)next;
sin = (struct sockaddr_in6 *)(rtm + 1);
sdl = (struct sockaddr_dl *)((char *)sin +
ALIGN(sin->sin6_len));
/*
* Some OSes can produce a route that has the LINK flag but
* has a non-AF_LINK gateway (e.g. fe80::xx%lo0 on FreeBSD
* and BSD/OS, where xx is not the interface identifier on
* lo0). Such routes entry would annoy getnbrinfo() below,
* so we skip them.
* XXX: such routes should have the GATEWAY flag, not the
* LINK flag. However, there is rotten routing software
* that advertises all routes that have the GATEWAY flag.
* Thus, KAME kernel intentionally does not set the LINK flag.
* What is to be fixed is not ndp, but such routing software
* (and the kernel workaround)...
*/
if (sdl->sdl_family != AF_LINK)
continue;
if (!(rtm->rtm_flags & RTF_HOST))
continue;
if (addr) {
if (IN6_ARE_ADDR_EQUAL(&addr->sin6_addr,
&sin->sin6_addr) == 0 ||
addr->sin6_scope_id != sin->sin6_scope_id)
continue;
found_entry = 1;
} else if (IN6_IS_ADDR_MULTICAST(&sin->sin6_addr))
continue;
if (IN6_IS_ADDR_LINKLOCAL(&sin->sin6_addr) ||
IN6_IS_ADDR_MC_LINKLOCAL(&sin->sin6_addr)) {
/* XXX: should scope id be filled in the kernel? */
if (sin->sin6_scope_id == 0)
sin->sin6_scope_id = sdl->sdl_index;
}
getnameinfo((struct sockaddr *)sin, sin->sin6_len, host_buf,
sizeof(host_buf), NULL, 0, (nflag ? NI_NUMERICHOST : 0));
if (cflag) {
#ifdef RTF_WASCLONED
if (rtm->rtm_flags & RTF_WASCLONED)
delete(host_buf);
#elif defined(RTF_CLONED)
if (rtm->rtm_flags & RTF_CLONED)
delete(host_buf);
#else
if (rtm->rtm_flags & RTF_PINNED)
continue;
delete(host_buf);
#endif
continue;
}
gettimeofday(&now, 0);
if (tflag)
ts_print(&now);
addrwidth = strlen(host_buf);
if (addrwidth < W_ADDR)
addrwidth = W_ADDR;
llwidth = strlen(ether_str(sdl));
if (W_ADDR + W_LL - addrwidth > llwidth)
llwidth = W_ADDR + W_LL - addrwidth;
ifname = if_indextoname(sdl->sdl_index, ifix_buf);
if (ifname == NULL) {
strlcpy(ifix_buf, "?", sizeof(ifix_buf));
ifname = ifix_buf;
}
ifwidth = strlen(ifname);
if (W_ADDR + W_LL + W_IF - addrwidth - llwidth > ifwidth)
ifwidth = W_ADDR + W_LL + W_IF - addrwidth - llwidth;
xo_open_instance("neighbor-cache");
/* Compose format string for libxo, as it doesn't support *.* */
char xobuf[200];
snprintf(xobuf, sizeof(xobuf),
"{:address/%%-%d.%ds/%%s} {:mac-address/%%-%d.%ds/%%s} {:interface/%%%d.%ds/%%s}",
addrwidth, addrwidth, llwidth, llwidth, ifwidth, ifwidth);
xo_emit(xobuf, host_buf, ether_str(sdl), ifname);
/* Print neighbor discovery specific information */
expire = rtm->rtm_rmx.rmx_expire;
int expire_in = expire - now.tv_sec;
if (expire > now.tv_sec)
xo_emit("{d:/ %-9.9s}{e:expires_sec/%d}", sec2str(expire_in), expire_in);
else if (expire == 0)
xo_emit("{d:/ %-9.9s}{en:permanent/true}", "permanent");
else
xo_emit("{d:/ %-9.9s}{e:expires_sec/%d}", "expired", expire_in);
char *lle_state = "";
switch (rtm->rtm_rmx.rmx_state) {
case ND6_LLINFO_NOSTATE:
lle_state = "N";
break;
#ifdef ND6_LLINFO_WAITDELETE
case ND6_LLINFO_WAITDELETE:
lle_state = "W";
break;
#endif
case ND6_LLINFO_INCOMPLETE:
lle_state = "I";
break;
case ND6_LLINFO_REACHABLE:
lle_state = "R";
break;
case ND6_LLINFO_STALE:
lle_state = "S";
break;
case ND6_LLINFO_DELAY:
lle_state = "D";
break;
case ND6_LLINFO_PROBE:
lle_state = "P";
break;
default:
lle_state = "?";
break;
}
xo_emit(" {:neighbor-state/%s}", lle_state);
isrouter = rtm->rtm_flags & RTF_GATEWAY;
prbs = rtm->rtm_rmx.rmx_pksent;
/*
* other flags. R: router, P: proxy, W: ??
*/
if ((rtm->rtm_addrs & RTA_NETMASK) == 0) {
snprintf(flgbuf, sizeof(flgbuf), "%s%s",
isrouter ? "R" : "",
(rtm->rtm_flags & RTF_ANNOUNCE) ? "p" : "");
} else {
#if 0 /* W and P are mystery even for us */
sin = (struct sockaddr_in6 *)
(sdl->sdl_len + (char *)sdl);
snprintf(flgbuf, sizeof(flgbuf), "%s%s%s%s",
isrouter ? "R" : "",
!IN6_IS_ADDR_UNSPECIFIED(&sin->sin6_addr) ? "P" : "",
(sin->sin6_len != sizeof(struct sockaddr_in6)) ? "W" : "",
(rtm->rtm_flags & RTF_ANNOUNCE) ? "p" : "");
#else
snprintf(flgbuf, sizeof(flgbuf), "%s%s",
isrouter ? "R" : "",
(rtm->rtm_flags & RTF_ANNOUNCE) ? "p" : "");
#endif
}
xo_emit(" {:nd-flags/%s}", flgbuf);
if (prbs)
xo_emit("{d:/ %d}", prbs);
xo_emit("\n");
xo_close_instance("neighbor-cache");
}
if (buf != NULL)
free(buf);
if (repeat) {
xo_emit("\n");
xo_flush();
sleep(repeat);
goto again;
}
xo_close_list("neighbor-cache");
}
static struct in6_nbrinfo *
getnbrinfo(struct in6_addr *addr, int ifindex, int warning)
{
static struct in6_nbrinfo nbi;
int sock;
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0)
xo_err(1, "socket");
bzero(&nbi, sizeof(nbi));
if_indextoname(ifindex, nbi.ifname);
nbi.addr = *addr;
if (ioctl(sock, SIOCGNBRINFO_IN6, (caddr_t)&nbi) < 0) {
if (warning)
xo_warn("ioctl(SIOCGNBRINFO_IN6)");
close(sock);
return(NULL);
}
close(sock);
return(&nbi);
}
static char *
ether_str(struct sockaddr_dl *sdl)
{
static char hbuf[NI_MAXHOST];
if (sdl->sdl_alen == ETHER_ADDR_LEN) {
strlcpy(hbuf, ether_ntoa((struct ether_addr *)LLADDR(sdl)),
sizeof(hbuf));
} else if (sdl->sdl_alen) {
int n = sdl->sdl_nlen > 0 ? sdl->sdl_nlen + 1 : 0;
snprintf(hbuf, sizeof(hbuf), "%s", link_ntoa(sdl) + n);
} else
snprintf(hbuf, sizeof(hbuf), "(incomplete)");
return(hbuf);
}
static int
ndp_ether_aton(char *a, u_char *n)
{
int i, o[6];
i = sscanf(a, "%x:%x:%x:%x:%x:%x", &o[0], &o[1], &o[2],
&o[3], &o[4], &o[5]);
if (i != 6) {
xo_warnx("invalid Ethernet address '%s'", a);
return (1);
}
for (i = 0; i < 6; i++)
n[i] = o[i];
return (0);
}
static void
usage()
{
printf("usage: ndp [-nt] hostname\n");
printf(" ndp [-nt] -a | -c | -p | -r | -H | -P | -R\n");
printf(" ndp [-nt] -A wait\n");
printf(" ndp [-nt] -d hostname\n");
printf(" ndp [-nt] -f filename\n");
printf(" ndp [-nt] -i interface [flags...]\n");
#ifdef SIOCSDEFIFACE_IN6
printf(" ndp [-nt] -I [interface|delete]\n");
#endif
printf(" ndp [-nt] -s nodename etheraddr [temp] [proxy]\n");
exit(1);
}
static int
rtmsg(int cmd)
{
static int seq;
int rlen;
register struct rt_msghdr *rtm = &m_rtmsg.m_rtm;
register char *cp = m_rtmsg.m_space;
register int l;
errno = 0;
if (cmd == RTM_DELETE)
goto doit;
bzero((char *)&m_rtmsg, sizeof(m_rtmsg));
rtm->rtm_flags = flags;
rtm->rtm_version = RTM_VERSION;
switch (cmd) {
default:
xo_errx(1, "internal wrong cmd");
case RTM_ADD:
rtm->rtm_addrs |= RTA_GATEWAY;
if (expire_time) {
rtm->rtm_rmx.rmx_expire = expire_time;
rtm->rtm_inits = RTV_EXPIRE;
}
rtm->rtm_flags |= (RTF_HOST | RTF_STATIC | RTF_LLDATA);
/* FALLTHROUGH */
case RTM_GET:
rtm->rtm_addrs |= RTA_DST;
}
NEXTADDR(RTA_DST, sin_m);
NEXTADDR(RTA_GATEWAY, sdl_m);
rtm->rtm_msglen = cp - (char *)&m_rtmsg;
doit:
l = rtm->rtm_msglen;
rtm->rtm_seq = ++seq;
rtm->rtm_type = cmd;
if ((rlen = write(s, (char *)&m_rtmsg, l)) < 0) {
if (errno != ESRCH || cmd != RTM_DELETE) {
xo_err(1, "writing to routing socket");
/* NOTREACHED */
}
}
do {
l = read(s, (char *)&m_rtmsg, sizeof(m_rtmsg));
} while (l > 0 && (rtm->rtm_type != cmd || rtm->rtm_seq != seq ||
rtm->rtm_pid != pid));
if (l < 0)
xo_warn("read from routing socket");
return (0);
}
static void
ifinfo(char *ifname, int argc, char **argv)
{
struct in6_ndireq nd;
int i, sock;
u_int32_t newflags;
#ifdef IPV6CTL_USETEMPADDR
u_int8_t nullbuf[8];
#endif
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
xo_err(1, "socket");
/* NOTREACHED */
}
bzero(&nd, sizeof(nd));
strlcpy(nd.ifname, ifname, sizeof(nd.ifname));
if (ioctl(sock, SIOCGIFINFO_IN6, (caddr_t)&nd) < 0) {
xo_err(1, "ioctl(SIOCGIFINFO_IN6)");
/* NOTREACHED */
}
#define ND nd.ndi
newflags = ND.flags;
for (i = 0; i < argc; i++) {
int clear = 0;
char *cp = argv[i];
if (*cp == '-') {
clear = 1;
cp++;
}
#define SETFLAG(s, f) do { \
if (strcmp(cp, (s)) == 0) { \
if (clear) \
newflags &= ~(f); \
else \
newflags |= (f); \
} \
} while (0)
/*
* XXX: this macro is not 100% correct, in that it matches "nud" against
* "nudbogus". But we just let it go since this is minor.
*/
#define SETVALUE(f, v) do { \
char *valptr; \
unsigned long newval; \
v = 0; /* unspecified */ \
if (strncmp(cp, f, strlen(f)) == 0) { \
valptr = strchr(cp, '='); \
if (valptr == NULL) \
xo_err(1, "syntax error in %s field", (f)); \
errno = 0; \
newval = strtoul(++valptr, NULL, 0); \
if (errno) \
xo_err(1, "syntax error in %s's value", (f)); \
v = newval; \
} \
} while (0)
SETFLAG("disabled", ND6_IFF_IFDISABLED);
SETFLAG("nud", ND6_IFF_PERFORMNUD);
#ifdef ND6_IFF_ACCEPT_RTADV
SETFLAG("accept_rtadv", ND6_IFF_ACCEPT_RTADV);
#endif
#ifdef ND6_IFF_AUTO_LINKLOCAL
SETFLAG("auto_linklocal", ND6_IFF_AUTO_LINKLOCAL);
#endif
#ifdef ND6_IFF_NO_PREFER_IFACE
SETFLAG("no_prefer_iface", ND6_IFF_NO_PREFER_IFACE);
#endif
SETVALUE("basereachable", ND.basereachable);
SETVALUE("retrans", ND.retrans);
SETVALUE("curhlim", ND.chlim);
ND.flags = newflags;
if (ioctl(sock, SIOCSIFINFO_IN6, (caddr_t)&nd) < 0) {
xo_err(1, "ioctl(SIOCSIFINFO_IN6)");
/* NOTREACHED */
}
#undef SETFLAG
#undef SETVALUE
}
if (!ND.initialized) {
xo_errx(1, "%s: not initialized yet", ifname);
/* NOTREACHED */
}
if (ioctl(sock, SIOCGIFINFO_IN6, (caddr_t)&nd) < 0) {
xo_err(1, "ioctl(SIOCGIFINFO_IN6)");
/* NOTREACHED */
}
xo_open_container("ifinfo");
xo_emit("{e:interface/%s}", ifname);
xo_emit("linkmtu={:linkmtu/%d}", ND.linkmtu);
xo_emit(", maxmtu={:maxmtu/%d}", ND.maxmtu);
xo_emit(", curhlim={:curhlim/%d}", ND.chlim);
xo_emit("{d:/, basereachable=%ds%dms}{e:basereachable_ms/%u}",
ND.basereachable / 1000, ND.basereachable % 1000, ND.basereachable);
xo_emit("{d:/, reachable=%ds}{e:reachable_ms/%u}", ND.reachable, ND.reachable * 1000);
xo_emit("{d:/, retrans=%ds%dms}{e:retrans_ms/%u}", ND.retrans / 1000, ND.retrans % 1000,
ND.retrans);
#ifdef IPV6CTL_USETEMPADDR
memset(nullbuf, 0, sizeof(nullbuf));
if (memcmp(nullbuf, ND.randomid, sizeof(nullbuf)) != 0) {
int j;
u_int8_t *rbuf;
for (i = 0; i < 3; i++) {
const char *txt, *field;
switch (i) {
case 0:
txt = "\nRandom seed(0): ";
field = "seed_0";
rbuf = ND.randomseed0;
break;
case 1:
txt = "\nRandom seed(1): ";
field = "seed_1";
rbuf = ND.randomseed1;
break;
case 2:
txt = "\nRandom ID: ";
field = "random_id";
rbuf = ND.randomid;
break;
default:
xo_errx(1, "impossible case for tempaddr display");
}
char abuf[20], xobuf[200];
for (j = 0; j < 8; j++)
snprintf(&abuf[j * 2], sizeof(abuf), "%02X", rbuf[j]);
snprintf(xobuf, sizeof(xobuf), "%s{:%s/%%s}", txt, field);
xo_emit(xobuf, abuf);
}
}
#endif /* IPV6CTL_USETEMPADDR */
if (ND.flags) {
xo_emit("\nFlags: {e:flags/%u}", ND.flags);
xo_open_list("flags_pretty");
#ifdef ND6_IFF_IFDISABLED
if ((ND.flags & ND6_IFF_IFDISABLED))
xo_emit("{l:%s} ", "disabled");
#endif
if ((ND.flags & ND6_IFF_PERFORMNUD))
xo_emit("{l:%s} ", "nud");
#ifdef ND6_IFF_ACCEPT_RTADV
if ((ND.flags & ND6_IFF_ACCEPT_RTADV))
xo_emit("{l:%s} ", "accept_rtadv");
#endif
#ifdef ND6_IFF_AUTO_LINKLOCAL
if ((ND.flags & ND6_IFF_AUTO_LINKLOCAL))
xo_emit("{l:%s} ", "auto_linklocal");
#endif
#ifdef ND6_IFF_NO_PREFER_IFACE
if ((ND.flags & ND6_IFF_NO_PREFER_IFACE))
xo_emit("{l:%s} ", "no_prefer_iface");
#endif
xo_close_list("flags");
}
xo_emit("\n");
#undef ND
xo_close_container("ifinfo");
close(sock);
}
#ifndef ND_RA_FLAG_RTPREF_MASK /* XXX: just for compilation on *BSD release */
#define ND_RA_FLAG_RTPREF_MASK 0x18 /* 00011000 */
#endif
static void
rtrlist()
{
int mib[] = { CTL_NET, PF_INET6, IPPROTO_ICMPV6, ICMPV6CTL_ND6_DRLIST };
char *buf;
struct in6_defrouter *p, *ep;
size_t l;
struct timeval now;
if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), NULL, &l, NULL, 0) < 0) {
xo_err(1, "sysctl(ICMPV6CTL_ND6_DRLIST)");
/*NOTREACHED*/
}
if (l == 0)
return;
buf = malloc(l);
if (!buf) {
xo_err(1, "malloc");
/*NOTREACHED*/
}
if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), buf, &l, NULL, 0) < 0) {
xo_err(1, "sysctl(ICMPV6CTL_ND6_DRLIST)");
/*NOTREACHED*/
}
xo_open_list("router-list");
ep = (struct in6_defrouter *)(buf + l);
for (p = (struct in6_defrouter *)buf; p < ep; p++) {
int rtpref;
char abuf[INET6_ADDRSTRLEN], *paddr;
if (getnameinfo((struct sockaddr *)&p->rtaddr,
p->rtaddr.sin6_len, host_buf, sizeof(host_buf), NULL, 0,
(nflag ? NI_NUMERICHOST : 0)) != 0)
strlcpy(host_buf, "?", sizeof(host_buf));
if (nflag)
paddr = host_buf;
else {
inet_ntop(AF_INET6, &p->rtaddr.sin6_addr, abuf, sizeof(abuf));
paddr = abuf;
}
xo_open_instance("router-list");
xo_emit("{:hostname/%s}{e:address/%s} if={:interface/%s}",
host_buf, paddr,
if_indextoname(p->if_index, ifix_buf));
xo_open_list("flags_pretty");
char rflags[6] = {}, *pflags = rflags;
if (p->flags & ND_RA_FLAG_MANAGED) {
*pflags++ = 'M';
xo_emit("{el:%s}", "managed");
}
if (p->flags & ND_RA_FLAG_OTHER) {
*pflags++ = 'O';
xo_emit("{el:%s}", "other");
}
#ifdef DRAFT_IETF_6MAN_IPV6ONLY_FLAG
if (p->flags & ND_RA_FLAG_IPV6_ONLY) {
*pflags++ = 'S';
xo_emit("{el:%s}", "ipv6only");
}
#endif
xo_close_list("flags_pretty");
xo_emit(", flags={:flags/%s}", rflags);
rtpref = ((p->flags & ND_RA_FLAG_RTPREF_MASK) >> 3) & 0xff;
xo_emit(", pref={:preference/%s}", rtpref_str[rtpref]);
gettimeofday(&now, 0);
if (p->expire == 0)
xo_emit(", expire=Never\n{en:permanent/true}");
else
xo_emit("{d:/, expire=%s\n}{e:expires_sec/%ld}",
sec2str(p->expire - now.tv_sec),
(long)p->expire - now.tv_sec);
xo_close_instance("router-list");
}
free(buf);
xo_close_list("router-list");
}
static void
plist()
{
int mib[] = { CTL_NET, PF_INET6, IPPROTO_ICMPV6, ICMPV6CTL_ND6_PRLIST };
char *buf;
struct in6_prefix *p, *ep, *n;
struct sockaddr_in6 *advrtr;
size_t l;
struct timeval now;
const int niflags = NI_NUMERICHOST;
int ninflags = nflag ? NI_NUMERICHOST : 0;
char namebuf[NI_MAXHOST];
if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), NULL, &l, NULL, 0) < 0) {
xo_err(1, "sysctl(ICMPV6CTL_ND6_PRLIST)");
/*NOTREACHED*/
}
buf = malloc(l);
if (!buf) {
xo_err(1, "malloc");
/*NOTREACHED*/
}
if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), buf, &l, NULL, 0) < 0) {
xo_err(1, "sysctl(ICMPV6CTL_ND6_PRLIST)");
/*NOTREACHED*/
}
xo_open_list("prefix-list");
ep = (struct in6_prefix *)(buf + l);
for (p = (struct in6_prefix *)buf; p < ep; p = n) {
advrtr = (struct sockaddr_in6 *)(p + 1);
n = (struct in6_prefix *)&advrtr[p->advrtrs];
xo_open_instance("prefix-list");
if (getnameinfo((struct sockaddr *)&p->prefix,
p->prefix.sin6_len, namebuf, sizeof(namebuf),
NULL, 0, niflags) != 0)
strlcpy(namebuf, "?", sizeof(namebuf));
xo_emit("{:prefix/%s%s%d} if={:interface/%s}\n", namebuf, "/",
p->prefixlen, if_indextoname(p->if_index, ifix_buf));
gettimeofday(&now, 0);
/*
* meaning of fields, especially flags, is very different
* by origin. notify the difference to the users.
*/
char flags[10] = {}, *pflags = flags;
xo_open_list("flags_pretty");
if (p->raflags.onlink) {
*pflags++ = 'L';
xo_emit("{el:%s}", "ra_onlink");
}
if (p->raflags.autonomous) {
*pflags++ = 'A';
xo_emit("{el:%s}", "ra_autonomous");
}
if (p->flags & NDPRF_ONLINK) {
*pflags++ = 'O';
xo_emit("{el:%s}", "is_onlink");
}
if (p->flags & NDPRF_DETACHED) {
*pflags++ = 'D';
xo_emit("{el:%s}", "is_detached");
}
#ifdef NDPRF_HOME
if (p->flags & NDPRF_HOME) {
*pflags++ = 'H';
xo_emit("{el:%s}", "is_home");
}
#endif
xo_close_list("flags_pretty");
xo_emit("flags={:flags/%s}", flags);
int expire_in = p->expire - now.tv_sec;
if (p->vltime == ND6_INFINITE_LIFETIME)
xo_emit(" vltime=infinity{e:valid-lifetime/%lu}",
(unsigned long)p->vltime);
else
xo_emit(" vltime={:valid-lifetime/%lu}",
(unsigned long)p->vltime);
if (p->pltime == ND6_INFINITE_LIFETIME)
xo_emit(", pltime=infinity{e:preferred-lifetime/%lu}",
(unsigned long)p->pltime);
else
xo_emit(", pltime={:preferred-lifetime/%lu}",
(unsigned long)p->pltime);
if (p->expire == 0)
xo_emit(", expire=Never{en:permanent/true}");
else if (p->expire >= now.tv_sec)
xo_emit(", expire=%s{e:expires_sec/%d}",
sec2str(expire_in), expire_in);
else
xo_emit(", expired{e:expires_sec/%d}", expire_in);
xo_emit(", ref={:refcount/%d}", p->refcnt);
xo_emit("\n");
/*
* "advertising router" list is meaningful only if the prefix
* information is from RA.
*/
if (p->advrtrs) {
int j;
struct sockaddr_in6 *sin6;
sin6 = advrtr;
xo_emit(" advertised by\n");
xo_open_list("advertising-routers");
for (j = 0; j < p->advrtrs; j++) {
struct in6_nbrinfo *nbi;
xo_open_instance("advertising-routers");
if (getnameinfo((struct sockaddr *)sin6,
sin6->sin6_len, namebuf, sizeof(namebuf),
NULL, 0, ninflags) != 0)
strlcpy(namebuf, "?", sizeof(namebuf));
char abuf[INET6_ADDRSTRLEN];
inet_ntop(AF_INET6, &sin6->sin6_addr, abuf,
sizeof(abuf));
xo_emit(" {:hostname/%s}{e:address/%s}",
namebuf, abuf);
nbi = getnbrinfo(&sin6->sin6_addr,
p->if_index, 0);
const char *state = "";
if (nbi) {
switch (nbi->state) {
case ND6_LLINFO_REACHABLE:
case ND6_LLINFO_STALE:
case ND6_LLINFO_DELAY:
case ND6_LLINFO_PROBE:
state = "reachable";
break;
default:
state = "unreachable";
}
} else
state = "no neighbor state";
xo_emit(" ({:state/%s})\n", state);
sin6++;
xo_close_instance("advertising-routers");
}
xo_close_list("advertising-routers");
} else
xo_emit(" No advertising router\n");
xo_close_instance("prefix-list");
}
free(buf);
xo_close_list("prefix-list");
}
static void
pfx_flush()
{
char dummyif[IFNAMSIZ+8];
int sock;
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0)
xo_err(1, "socket");
strlcpy(dummyif, "lo0", sizeof(dummyif)); /* dummy */
if (ioctl(sock, SIOCSPFXFLUSH_IN6, (caddr_t)&dummyif) < 0)
xo_err(1, "ioctl(SIOCSPFXFLUSH_IN6)");
close(sock);
}
static void
rtr_flush()
{
char dummyif[IFNAMSIZ+8];
int sock;
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0)
xo_err(1, "socket");
strlcpy(dummyif, "lo0", sizeof(dummyif)); /* dummy */
if (ioctl(sock, SIOCSRTRFLUSH_IN6, (caddr_t)&dummyif) < 0)
xo_err(1, "ioctl(SIOCSRTRFLUSH_IN6)");
close(sock);
}
static void
harmonize_rtr()
{
char dummyif[IFNAMSIZ+8];
int sock;
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0)
xo_err(1, "socket");
strlcpy(dummyif, "lo0", sizeof(dummyif)); /* dummy */
if (ioctl(sock, SIOCSNDFLUSH_IN6, (caddr_t)&dummyif) < 0)
xo_err(1, "ioctl(SIOCSNDFLUSH_IN6)");
close(sock);
}
#ifdef SIOCSDEFIFACE_IN6 /* XXX: check SIOCGDEFIFACE_IN6 as well? */
static void
setdefif(char *ifname)
{
struct in6_ndifreq ndifreq;
unsigned int ifindex;
int sock;
if (strcasecmp(ifname, "delete") == 0)
ifindex = 0;
else {
if ((ifindex = if_nametoindex(ifname)) == 0)
xo_err(1, "failed to resolve i/f index for %s", ifname);
}
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0)
xo_err(1, "socket");
strlcpy(ndifreq.ifname, "lo0", sizeof(ndifreq.ifname)); /* dummy */
ndifreq.ifindex = ifindex;
if (ioctl(sock, SIOCSDEFIFACE_IN6, (caddr_t)&ndifreq) < 0)
xo_err(1, "ioctl(SIOCSDEFIFACE_IN6)");
close(sock);
}
static void
getdefif()
{
struct in6_ndifreq ndifreq;
char ifname[IFNAMSIZ+8];
int sock;
if ((sock = socket(AF_INET6, SOCK_DGRAM, 0)) < 0)
xo_err(1, "socket");
memset(&ndifreq, 0, sizeof(ndifreq));
strlcpy(ndifreq.ifname, "lo0", sizeof(ndifreq.ifname)); /* dummy */
if (ioctl(sock, SIOCGDEFIFACE_IN6, (caddr_t)&ndifreq) < 0)
xo_err(1, "ioctl(SIOCGDEFIFACE_IN6)");
if (ndifreq.ifindex == 0)
xo_emit("No default interface.\n");
else {
if ((if_indextoname(ndifreq.ifindex, ifname)) == NULL)
xo_err(1, "failed to resolve ifname for index %lu",
ndifreq.ifindex);
xo_emit("ND default interface = {:default-interface/%s}\n", ifname);
}
close(sock);
}
#endif /* SIOCSDEFIFACE_IN6 */
static char *
sec2str(time_t total)
{
static char result[256];
int days, hours, mins, secs;
int first = 1;
char *p = result;
char *ep = &result[sizeof(result)];
int n;
days = total / 3600 / 24;
hours = (total / 3600) % 24;
mins = (total / 60) % 60;
secs = total % 60;
if (days) {
first = 0;
n = snprintf(p, ep - p, "%dd", days);
if (n < 0 || n >= ep - p)
return "?";
p += n;
}
if (!first || hours) {
first = 0;
n = snprintf(p, ep - p, "%dh", hours);
if (n < 0 || n >= ep - p)
return "?";
p += n;
}
if (!first || mins) {
first = 0;
n = snprintf(p, ep - p, "%dm", mins);
if (n < 0 || n >= ep - p)
return "?";
p += n;
}
snprintf(p, ep - p, "%ds", secs);
return(result);
}
/*
* Print the timestamp
* from tcpdump/util.c
*/
static void
ts_print(const struct timeval *tvp)
{
int sec;
/* Default */
sec = (tvp->tv_sec + thiszone) % 86400;
xo_emit("{:tv_sec/%lld}{:tv_usec/%lld}%02d:%02d:%02d.%06u ",
tvp->tv_sec, tvp->tv_usec,
sec / 3600, (sec % 3600) / 60, sec % 60, (u_int32_t)tvp->tv_usec);
}
#undef NEXTADDR
diff --git a/usr.sbin/ntp/config.h b/usr.sbin/ntp/config.h
index 94cc3d5233b5..4ca72b0ab8d7 100644
--- a/usr.sbin/ntp/config.h
+++ b/usr.sbin/ntp/config.h
@@ -1,1833 +1,1832 @@
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.ac by autoheader. */
-/* $FreeBSD$ */
/* Define if building universal (internal helper macro) */
/* #undef AC_APPLE_UNIVERSAL_BUILD */
/* Is adjtime() accurate? */
/* #undef ADJTIME_IS_ACCURATE */
/* Support NTP Autokey protocol? */
/* #define AUTOKEY 1 */
/* why not HAVE_P_S? */
/* #undef CALL_PTHREAD_SETCONCURRENCY */
/* ACTS modem service */
#define CLOCK_ACTS 1
/* Arbiter 1088A/B GPS receiver */
#define CLOCK_ARBITER 1
/* ARCRON support? */
#define CLOCK_ARCRON_MSF 1
/* Austron 2200A/2201A GPS receiver? */
#define CLOCK_AS2201 1
/* PPS interface? */
#define CLOCK_ATOM 1
/* Datum/Bancomm bc635/VME interface? */
/* #undef CLOCK_BANC */
/* Chronolog K-series WWVB receiver? */
#define CLOCK_CHRONOLOG 1
/* CHU modem/decoder */
#define CLOCK_CHU 1
/* Diems Computime Radio Clock? */
/* #undef CLOCK_COMPUTIME */
/* Datum Programmable Time System? */
#define CLOCK_DATUM 1
/* ELV/DCF7000 clock? */
/* #undef CLOCK_DCF7000 */
/* Dumb generic hh:mm:ss local clock? */
#define CLOCK_DUMBCLOCK 1
/* Forum Graphic GPS datating station driver? */
#define CLOCK_FG 1
/* GPSD JSON receiver */
#define CLOCK_GPSDJSON 1
/* TrueTime GPS receiver/VME interface? */
/* #undef CLOCK_GPSVME */
/* Heath GC-1000 WWV/WWVH receiver? */
#define CLOCK_HEATH 1
/* HOPF 6021 clock? */
/* #undef CLOCK_HOPF6021 */
/* HOPF PCI clock device? */
#define CLOCK_HOPF_PCI 1
/* HOPF serial clock device? */
#define CLOCK_HOPF_SERIAL 1
/* HP 58503A GPS receiver? */
#define CLOCK_HPGPS 1
/* IRIG audio decoder? */
#define CLOCK_IRIG 1
/* JJY receiver? */
#define CLOCK_JJY 1
/* Rockwell Jupiter GPS clock? */
#define CLOCK_JUPITER 1
/* Leitch CSD 5300 Master Clock System Driver? */
#define CLOCK_LEITCH 1
/* local clock reference? */
#define CLOCK_LOCAL 1
/* Meinberg clocks */
#define CLOCK_MEINBERG 1
/* Magnavox MX4200 GPS receiver */
/* #undef CLOCK_MX4200 */
/* NeoClock4X */
#define CLOCK_NEOCLOCK4X 1
/* NMEA GPS receiver */
#define CLOCK_NMEA 1
/* Motorola UT Oncore GPS */
#define CLOCK_ONCORE 1
/* Palisade clock */
#define CLOCK_PALISADE 1
/* PARSE driver interface */
#define CLOCK_PARSE 1
/* Conrad parallel port radio clock */
#define CLOCK_PCF 1
/* PCL 720 clock support */
/* #undef CLOCK_PPS720 */
/* PST/Traconex 1020 WWV/WWVH receiver */
#define CLOCK_PST 1
/* DCF77 raw time code */
#define CLOCK_RAWDCF 1
/* RCC 8000 clock */
/* #undef CLOCK_RCC8000 */
/* RIPE NCC Trimble clock */
/* #undef CLOCK_RIPENCC */
/* Schmid DCF77 clock */
/* #undef CLOCK_SCHMID */
/* SEL240X protocol */
/* #undef CLOCK_SEL240X */
/* clock thru shared memory */
#define CLOCK_SHM 1
/* Spectracom 8170/Netclock/2 WWVB receiver */
#define CLOCK_SPECTRACOM 1
/* KSI/Odetics TPRO/S GPS receiver/IRIG interface */
/* #undef CLOCK_TPRO */
/* Trimble GPS receiver/TAIP protocol */
/* #undef CLOCK_TRIMTAIP */
/* Trimble GPS receiver/TSIP protocol */
/* #undef CLOCK_TRIMTSIP */
/* Kinemetrics/TrueTime receivers */
#define CLOCK_TRUETIME 1
/* Spectracom TSYNC timing board */
/* #undef CLOCK_TSYNCPCI */
/* TrueTime 560 IRIG-B decoder? */
/* #undef CLOCK_TT560 */
/* Ultralink M320 WWVB receiver? */
#define CLOCK_ULINK 1
/* VARITEXT clock */
/* #undef CLOCK_VARITEXT */
/* WHARTON 400A Series clock */
/* #undef CLOCK_WHARTON_400A */
/* WWV audio driver */
#define CLOCK_WWV 1
/* Zyfer GPStarplus */
#define CLOCK_ZYFER 1
/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP
systems. This function is required for `alloca.c' support on those systems.
*/
/* #undef CRAY_STACKSEG_END */
/* Define to 1 if using `alloca.c'. */
/* #undef C_ALLOCA */
/* Enable debugging code? */
/* #undef DEBUG */
/* Enable processing time debugging? */
/* #undef DEBUG_TIMING */
/* Declaration style */
/* #undef DECL_ADJTIME_0 */
/* Declaration style */
/* #undef DECL_BCOPY_0 */
/* Declaration style */
/* #undef DECL_BZERO_0 */
/* Declaration style */
/* #undef DECL_CFSETISPEED_0 */
/* Declare errno? */
/* #undef DECL_ERRNO */
/* Declaration style */
/* #undef DECL_HSTRERROR_0 */
/* Declare h_errno? */
#define DECL_H_ERRNO 1
/* Declaration style */
/* #undef DECL_INET_NTOA_0 */
/* Declaration style */
/* #undef DECL_IOCTL_0 */
/* Declaration style */
/* #undef DECL_IPC_0 */
/* Declaration style */
/* #undef DECL_MEMMOVE_0 */
/* Declaration style */
/* #undef DECL_MKSTEMP_0 */
/* Declaration style */
/* #undef DECL_MKTEMP_0 */
/* Declaration style */
/* #undef DECL_NLIST_0 */
/* Declaration style */
/* #undef DECL_PLOCK_0 */
/* Declaration style */
/* #undef DECL_RENAME_0 */
/* Declaration style */
/* #undef DECL_SELECT_0 */
/* Declaration style */
/* #undef DECL_SETITIMER_0 */
/* Declaration style */
/* #undef DECL_SETPRIORITY_0 */
/* Declaration style */
/* #undef DECL_SETPRIORITY_1 */
/* Declaration style */
/* #undef DECL_SIGVEC_0 */
/* Declaration style */
/* #undef DECL_STDIO_0 */
/* Declaration style */
/* #undef DECL_STIME_0 */
/* Declaration style */
/* #undef DECL_STIME_1 */
/* Declaration style */
/* #undef DECL_STRERROR_0 */
/* Declaration style */
/* #undef DECL_STRTOL_0 */
/* Declare syscall()? */
/* #undef DECL_SYSCALL */
/* Declaration style */
/* #undef DECL_SYSLOG_0 */
/* Declaration style */
/* #undef DECL_TIMEOFDAY_0 */
/* Declaration style */
/* #undef DECL_TIME_0 */
/* Declaration style */
/* #undef DECL_TOLOWER_0 */
/* Declaration style */
/* #undef DECL_TOUPPER_0 */
/* What is the fallback value for HZ? */
#define DEFAULT_HZ 100
/* Default number of megabytes for RLIMIT_MEMLOCK */
#define DFLT_RLIMIT_MEMLOCK -1
/* Default number of 4k pages for RLIMIT_STACK */
#define DFLT_RLIMIT_STACK 50
/* Directory separator character, usually / or \\ */
#define DIR_SEP '/'
/* use old autokey session key behavior? */
/* #undef DISABLE_BUG1243_FIX */
/* synch TODR hourly? */
/* #undef DOSYNCTODR */
/* The number of minutes in a DST adjustment */
#define DSTMINUTES 60
/* support dynamic interleave? */
#define DYNAMIC_INTERLEAVE 0
/* number of args to el_init() */
#define EL_INIT_ARGS 4
/* Provide the explicit 127.0.0.0/8 martian filter? */
#define ENABLE_BUG3020_FIX 1
/* Enable CMAC support? */
#define ENABLE_CMAC 1
/* nls support in libopts */
/* #undef ENABLE_NLS */
/* force ntpdate to step the clock if !defined(STEP_SLEW) ? */
/* #undef FORCE_NTPDATE_STEP */
/* What is getsockname()'s socklen type? */
#define GETSOCKNAME_SOCKLEN_TYPE socklen_t
/* Do we have a routing socket (rt_msghdr or rtattr)? */
#define HAS_ROUTING_SOCKET 1
/* via __adjtimex */
/* #undef HAVE_ADJTIMEX */
/* Define to 1 if you have `alloca', as a function or macro. */
#define HAVE_ALLOCA 1
/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
*/
/* #undef HAVE_ALLOCA_H */
/* Define to 1 if you have the `arc4random_buf' function. */
#define HAVE_ARC4RANDOM_BUF 1
/* Define to 1 if you have the <arpa/nameser.h> header file. */
#define HAVE_ARPA_NAMESER_H 1
/* Define to 1 if you have the `atomic_thread_fence' function. */
/* #undef HAVE_ATOMIC_THREAD_FENCE */
/* Do we have audio support? */
#define HAVE_AUDIO /**/
/* Define to 1 if you have the <bstring.h> header file. */
/* #undef HAVE_BSTRING_H */
/* Define to 1 if you have the `canonicalize_file_name' function. */
/* #undef HAVE_CANONICALIZE_FILE_NAME */
/* Define to 1 if you have the `chmod' function. */
#define HAVE_CHMOD 1
/* Do we have the CIOGETEV ioctl (SunOS, Linux)? */
/* #undef HAVE_CIOGETEV */
/* Define to 1 if you have the `clock_getres' function. */
#define HAVE_CLOCK_GETRES 1
/* Define to 1 if you have the `clock_gettime' function. */
#define HAVE_CLOCK_GETTIME 1
/* Define to 1 if you have the `clock_settime' function. */
#define HAVE_CLOCK_SETTIME 1
/* Define to 1 if you have the <cthreads.h> header file. */
/* #undef HAVE_CTHREADS_H */
/* Define to 1 if you have the `daemon' function. */
#define HAVE_DAEMON 1
/* Define to 1 if you have the declaration of `siglongjmp', and to 0 if you
don't. */
#define HAVE_DECL_SIGLONGJMP 1
/* Define to 1 if you have the declaration of `sigsetjmp', and to 0 if you
don't. */
#define HAVE_DECL_SIGSETJMP 1
/* Define to 1 if you have the declaration of `strerror_r', and to 0 if you
don't. */
#define HAVE_DECL_STRERROR_R 1
/* Define to 1 if you have the <dirent.h> header file, and it defines `DIR'.
*/
#define HAVE_DIRENT_H 1
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Use Rendezvous/DNS-SD registration */
/* #undef HAVE_DNSREGISTRATION */
/* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */
/* #undef HAVE_DOPRNT */
/* Can we drop root privileges? */
#define HAVE_DROPROOT
/* Define to 1 if you have the <errno.h> header file. */
#define HAVE_ERRNO_H 1
/* Define to 1 if you have the `EVP_MD_do_all_sorted' function. */
#define HAVE_EVP_MD_DO_ALL_SORTED 1
/* Define to 1 if you have the `fchmod' function. */
#define HAVE_FCHMOD 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if you have the `finite' function. */
/* #undef HAVE_FINITE */
/* Define to 1 if you have the `fnmatch' function. */
#define HAVE_FNMATCH 1
/* Define to 1 if you have the <fnmatch.h> header file. */
#define HAVE_FNMATCH_H 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if you have the `fstat' function. */
#define HAVE_FSTAT 1
/* Define to 1 if you have the `getbootfile' function. */
#define HAVE_GETBOOTFILE 1
/* Define to 1 if you have the `getclock' function. */
/* #undef HAVE_GETCLOCK */
/* Define to 1 if you have the `getdtablesize' function. */
#define HAVE_GETDTABLESIZE 1
/* Define to 1 if you have the `getifaddrs' function. */
#define HAVE_GETIFADDRS 1
/* Define to 1 if you have the `getpassphrase' function. */
/* #undef HAVE_GETPASSPHRASE */
/* Define to 1 if you have the `getrusage' function. */
#define HAVE_GETRUSAGE 1
/* Define to 1 if you have the `getuid' function. */
#define HAVE_GETUID 1
/* if you have GNU Pth */
/* #undef HAVE_GNU_PTH */
/* Define to 1 if you have the <histedit.h> header file. */
#define HAVE_HISTEDIT_H 1
/* Define to 1 if you have the <history.h> header file. */
/* #undef HAVE_HISTORY_H */
/* Obvious */
#define HAVE_HZ_IN_STRUCT_CLOCKINFO 1
/* Define to 1 if you have the <ieeefp.h> header file. */
#define HAVE_IEEEFP_H 1
/* have iflist_sysctl? */
#define HAVE_IFLIST_SYSCTL 1
/* Define to 1 if you have the `if_nametoindex' function. */
#define HAVE_IF_NAMETOINDEX 1
/* inline keyword or macro available */
#define HAVE_INLINE 1
/* Define to 1 if the system has the type `int16_t'. */
#define HAVE_INT16_T 1
/* Define to 1 if the system has the type `int32'. */
/* #undef HAVE_INT32 */
/* int32 type in DNS headers, not others. */
/* #undef HAVE_INT32_ONLY_WITH_DNS */
/* Define to 1 if the system has the type `int32_t'. */
#define HAVE_INT32_T 1
/* Define to 1 if the system has the type `int8_t'. */
#define HAVE_INT8_T 1
/* Define to 1 if the system has the type `intmax_t'. */
/* #undef HAVE_INTMAX_T */
/* Define to 1 if the system has the type `intptr_t'. */
#define HAVE_INTPTR_T 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the `isfinite' function. */
#define HAVE_ISFINITE 1
/* Define to 1 if you have the <kvm.h> header file. */
#define HAVE_KVM_H 1
/* Define to 1 if you have the `kvm_open' function. */
/* #undef HAVE_KVM_OPEN */
/* Define to 1 if you have the `gen' library (-lgen). */
/* #undef HAVE_LIBGEN */
/* Define to 1 if you have the <libgen.h> header file. */
#define HAVE_LIBGEN_H 1
/* Define to 1 if you have the `intl' library (-lintl). */
/* #undef HAVE_LIBINTL */
/* Define to 1 if you have the <libintl.h> header file. */
/* #undef HAVE_LIBINTL_H */
/* Define to 1 if you have the <libscf.h> header file. */
/* #undef HAVE_LIBSCF_H */
/* Define to 1 if you have the <limits.h> header file. */
#define HAVE_LIMITS_H 1
/* using Linux pthread? */
/* #undef HAVE_LINUXTHREADS */
/* Do we have Linux capabilities? */
/* #undef HAVE_LINUX_CAPABILITIES */
/* Define to 1 if you have the <linux/if_addr.h> header file. */
/* #undef HAVE_LINUX_IF_ADDR_H */
/* if you have LinuxThreads */
/* #undef HAVE_LINUX_THREADS */
/* Define to 1 if you have the `localeconv' function. */
/* #undef HAVE_LOCALECONV */
/* Define to 1 if you have the <locale.h> header file. */
/* #undef HAVE_LOCALE_H */
/* Define to 1 if the system has the type `long double'. */
/* #undef HAVE_LONG_DOUBLE */
/* Define to 1 if the system has the type `long long'. */
#define HAVE_LONG_LONG 1
/* Define to 1 if the system has the type `long long int'. */
/* #undef HAVE_LONG_LONG_INT */
/* if you have SunOS LWP package */
/* #undef HAVE_LWP */
/* Define to 1 if you have the <lwp/lwp.h> header file. */
/* #undef HAVE_LWP_LWP_H */
/* Define to 1 if you have the <machine/inline.h> header file. */
/* #undef HAVE_MACHINE_INLINE_H */
/* Define to 1 if you have the <machine/soundcard.h> header file. */
/* #undef HAVE_MACHINE_SOUNDCARD_H */
/* define if you have Mach Cthreads */
/* #undef HAVE_MACH_CTHREADS */
/* Define to 1 if you have the <mach/cthreads.h> header file. */
/* #undef HAVE_MACH_CTHREADS_H */
/* Define to 1 if you have the <math.h> header file. */
#define HAVE_MATH_H 1
/* Define to 1 if you have the `MD5Init' function. */
#define HAVE_MD5INIT 1
/* Define to 1 if you have the <md5.h> header file. */
#define HAVE_MD5_H 1
/* Define to 1 if you have the `memlk' function. */
/* #undef HAVE_MEMLK */
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `mkstemp' function. */
#define HAVE_MKSTEMP 1
/* Define to 1 if you have the `mktime' function. */
#define HAVE_MKTIME 1
/* Define to 1 if you have the `mlockall' function. */
#define HAVE_MLOCKALL 1
/* Define to 1 if you have the `mmap' function. */
#define HAVE_MMAP 1
/* Define to 1 if you have the `nanosleep' function. */
#define HAVE_NANOSLEEP 1
/* Define to 1 if you have the <ndir.h> header file, and it defines `DIR'. */
/* #undef HAVE_NDIR_H */
/* Define to 1 if you have the <netdb.h> header file. */
#define HAVE_NETDB_H 1
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if you have the <netinet/in_system.h> header file. */
/* #undef HAVE_NETINET_IN_SYSTEM_H */
/* Define to 1 if you have the <netinet/in_systm.h> header file. */
#define HAVE_NETINET_IN_SYSTM_H 1
/* Define to 1 if you have the <netinet/in_var.h> header file. */
#define HAVE_NETINET_IN_VAR_H 1
/* Define to 1 if you have the <netinet/ip.h> header file. */
#define HAVE_NETINET_IP_H 1
/* NetInfo support? */
/* #undef HAVE_NETINFO */
/* Define to 1 if you have the <netinfo/ni.h> header file. */
/* #undef HAVE_NETINFO_NI_H */
/* Define to 1 if you have the <net/if6.h> header file. */
/* #undef HAVE_NET_IF6_H */
/* Define to 1 if you have the <net/if.h> header file. */
#define HAVE_NET_IF_H 1
/* Define to 1 if you have the <net/if_var.h> header file. */
#define HAVE_NET_IF_VAR_H 1
/* Define to 1 if you have the <net/route.h> header file. */
#define HAVE_NET_ROUTE_H 1
/* Define to 1 if you have the `nice' function. */
#define HAVE_NICE 1
/* Define to 1 if you have the <nlist.h> header file. */
#define HAVE_NLIST_H 1
/* via __adjtimex */
#define HAVE_NTP_ADJTIME 1
/* via __ntp_gettime */
#define HAVE_NTP_GETTIME 1
/* Do we want support for Samba's signing daemon? */
#define HAVE_NTP_SIGND 1
/* if you have NT Event Log */
/* #undef HAVE_NT_EVENT_LOG */
/* if you have NT Service Manager */
/* #undef HAVE_NT_SERVICE_MANAGER */
/* if you have NT Threads */
/* #undef HAVE_NT_THREADS */
/* Define to 1 if you have the <openssl/cmac.h> header file. */
#define HAVE_OPENSSL_CMAC_H 1
/* Define to 1 if you have the <openssl/hmac.h> header file. */
#define HAVE_OPENSSL_HMAC_H 1
/* Define to 1 if the system has the type `pid_t'. */
#define HAVE_PID_T 1
/* Define to 1 if you have the `plock' function. */
/* #undef HAVE_PLOCK */
/* Define to 1 if you have the <poll.h> header file. */
#define HAVE_POLL_H 1
/* Do we have the PPS API per the Draft RFC? */
#define HAVE_PPSAPI 1
/* Define to 1 if you have the <priv.h> header file. */
/* #undef HAVE_PRIV_H */
/* Define if you have POSIX threads libraries and header files. */
/* #undef HAVE_PTHREAD */
/* define to pthreads API spec revision */
#define HAVE_PTHREADS 10
/* Define to 1 if you have the `pthread_attr_getstacksize' function. */
#define HAVE_PTHREAD_ATTR_GETSTACKSIZE 1
/* Define to 1 if you have the `pthread_attr_setstacksize' function. */
#define HAVE_PTHREAD_ATTR_SETSTACKSIZE 1
/* define if you have pthread_detach function */
#define HAVE_PTHREAD_DETACH 1
/* Define to 1 if you have the `pthread_getconcurrency' function. */
#define HAVE_PTHREAD_GETCONCURRENCY 1
/* Define to 1 if you have the <pthread.h> header file. */
#define HAVE_PTHREAD_H 1
/* Define to 1 if you have the `pthread_kill' function. */
#define HAVE_PTHREAD_KILL 1
/* Define to 1 if you have the `pthread_kill_other_threads_np' function. */
/* #undef HAVE_PTHREAD_KILL_OTHER_THREADS_NP */
/* define if you have pthread_rwlock_destroy function */
#define HAVE_PTHREAD_RWLOCK_DESTROY 1
/* Define to 1 if you have the `pthread_setconcurrency' function. */
#define HAVE_PTHREAD_SETCONCURRENCY 1
/* Define to 1 if you have the `pthread_yield' function. */
#define HAVE_PTHREAD_YIELD 1
/* Define to 1 if you have the <pth.h> header file. */
/* #undef HAVE_PTH_H */
/* Define to 1 if the system has the type `ptrdiff_t'. */
#define HAVE_PTRDIFF_T 1
/* Define to 1 if you have the `pututline' function. */
/* #undef HAVE_PUTUTLINE */
/* Define to 1 if you have the `pututxline' function. */
#define HAVE_PUTUTXLINE 1
/* Define to 1 if you have the `RAND_bytes' function. */
#define HAVE_RAND_BYTES 1
/* Define to 1 if you have the `RAND_poll' function. */
#define HAVE_RAND_POLL 1
/* Define to 1 if you have the <readline.h> header file. */
/* #undef HAVE_READLINE_H */
/* Define if your readline library has \`add_history' */
#define HAVE_READLINE_HISTORY 1
/* Define to 1 if you have the <readline/history.h> header file. */
#define HAVE_READLINE_HISTORY_H 1
/* Define to 1 if you have the <readline/readline.h> header file. */
#define HAVE_READLINE_READLINE_H 1
/* Define to 1 if you have the `readlink' function. */
#define HAVE_READLINK 1
/* Define to 1 if you have the `recvmsg' function. */
#define HAVE_RECVMSG 1
/* Define to 1 if you have the <resolv.h> header file. */
#define HAVE_RESOLV_H 1
/* Define to 1 if you have the `res_init' function. */
#define HAVE_RES_INIT 1
/* Do we have Linux routing socket? */
/* #undef HAVE_RTNETLINK */
/* Define to 1 if you have the `rtprio' function. */
#define HAVE_RTPRIO 1
/* Define to 1 if you have the <runetype.h> header file. */
#define HAVE_RUNETYPE_H 1
/* Obvious */
#define HAVE_SA_SIGACTION_IN_STRUCT_SIGACTION 1
/* Define to 1 if you have the <sched.h> header file. */
#define HAVE_SCHED_H 1
/* Define to 1 if you have the `sched_setscheduler' function. */
#define HAVE_SCHED_SETSCHEDULER 1
/* Define to 1 if you have the `sched_yield' function. */
#define HAVE_SCHED_YIELD 1
/* Define to 1 if you have the <semaphore.h> header file. */
#define HAVE_SEMAPHORE_H 1
/* Define to 1 if you have the `sem_timedwait' function. */
#define HAVE_SEM_TIMEDWAIT 1
/* Define to 1 if you have the <setjmp.h> header file. */
#define HAVE_SETJMP_H 1
/* Define to 1 if you have the `setlinebuf' function. */
#define HAVE_SETLINEBUF 1
/* Define to 1 if you have the `setpgid' function. */
#define HAVE_SETPGID 1
/* define if setpgrp takes 0 arguments */
/* #undef HAVE_SETPGRP_0 */
/* Define to 1 if you have the `setpriority' function. */
#define HAVE_SETPRIORITY 1
/* Define to 1 if you have the `setrlimit' function. */
#define HAVE_SETRLIMIT 1
/* Define to 1 if you have the `setsid' function. */
#define HAVE_SETSID 1
/* Define to 1 if you have the `settimeofday' function. */
#define HAVE_SETTIMEOFDAY 1
/* Define to 1 if you have the `setvbuf' function. */
#define HAVE_SETVBUF 1
/* Define to 1 if you have the <sgtty.h> header file. */
/* #undef HAVE_SGTTY_H */
/* Define to 1 if you have the `sigaction' function. */
#define HAVE_SIGACTION 1
/* Can we use SIGIO for tcp and udp IO? */
/* #undef HAVE_SIGNALED_IO */
/* Define to 1 if you have the `sigset' function. */
#define HAVE_SIGSET 1
/* Define to 1 if you have the `sigvec' function. */
#define HAVE_SIGVEC 1
/* sigwait() available? */
#define HAVE_SIGWAIT 1
/* Define to 1 if the system has the type `size_t'. */
#define HAVE_SIZE_T 1
/* Define if C99-compliant `snprintf' is available. */
#define HAVE_SNPRINTF 1
/* Define to 1 if you have the `socketpair' function. */
#define HAVE_SOCKETPAIR 1
/* Are Solaris privileges available? */
/* #undef HAVE_SOLARIS_PRIVS */
/* Define to 1 if you have the <stdarg.h> header file. */
#define HAVE_STDARG_H 1
/* Define to 1 if you have the <stdatomic.h> header file. */
#define HAVE_STDATOMIC_H 1
/* Define to 1 if stdbool.h conforms to C99. */
#define HAVE_STDBOOL_H 1
/* Define to 1 if you have the <stddef.h> header file. */
/* #undef HAVE_STDDEF_H */
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `stime' function. */
/* #undef HAVE_STIME */
/* Define to 1 if you have the `strchr' function. */
#define HAVE_STRCHR 1
/* Define to 1 if you have the `strdup' function. */
#define HAVE_STRDUP 1
/* Define to 1 if you have the `strerror' function. */
#define HAVE_STRERROR 1
/* Define to 1 if you have the `strerror_r' function. */
#define HAVE_STRERROR_R 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcat' function. */
#define HAVE_STRLCAT 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the <stropts.h> header file. */
/* #undef HAVE_STROPTS_H */
/* Define to 1 if you have the `strrchr' function. */
#define HAVE_STRRCHR 1
/* Define to 1 if you have the `strsignal' function. */
#define HAVE_STRSIGNAL 1
/* Define to 1 if you have the `strtoll' function. */
#define HAVE_STRTOLL 1
/* Define to 1 if `decimal_point' is a member of `struct lconv'. */
/* #undef HAVE_STRUCT_LCONV_DECIMAL_POINT */
/* Define to 1 if `thousands_sep' is a member of `struct lconv'. */
/* #undef HAVE_STRUCT_LCONV_THOUSANDS_SEP */
/* Do we have struct ntptimeval? */
#define HAVE_STRUCT_NTPTIMEVAL 1
/* Define to 1 if `time.tv_nsec' is a member of `struct ntptimeval'. */
#define HAVE_STRUCT_NTPTIMEVAL_TIME_TV_NSEC 1
/* Does a system header define struct ppsclockev? */
/* #undef HAVE_STRUCT_PPSCLOCKEV */
/* Do we have struct snd_size? */
#define HAVE_STRUCT_SND_SIZE 1
/* Does a system header define struct sockaddr_storage? */
#define HAVE_STRUCT_SOCKADDR_STORAGE 1
/* struct timespec declared? */
#define HAVE_STRUCT_TIMESPEC 1
/* Define to 1 if you have the <sun/audioio.h> header file. */
/* #undef HAVE_SUN_AUDIOIO_H */
/* Define to 1 if you have the <synch.h> header file. */
/* #undef HAVE_SYNCH_H */
/* Define to 1 if you have the `sysconf' function. */
#define HAVE_SYSCONF 1
/* Define to 1 if you have the <sysexits.h> header file. */
#define HAVE_SYSEXITS_H 1
/* */
#define HAVE_SYSLOG_FACILITYNAMES 1
/* Define to 1 if you have the <sys/audioio.h> header file. */
/* #undef HAVE_SYS_AUDIOIO_H */
/* Define to 1 if you have the <sys/capability.h> header file. */
#define HAVE_SYS_CAPABILITY_H 1
/* Define to 1 if you have the <sys/clockctl.h> header file. */
/* #undef HAVE_SYS_CLOCKCTL_H */
/* Define to 1 if you have the <sys/dir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_DIR_H */
/* Define to 1 if you have the <sys/file.h> header file. */
#define HAVE_SYS_FILE_H 1
/* Define to 1 if you have the <sys/i8253.h> header file. */
/* #undef HAVE_SYS_I8253_H */
/* Define to 1 if you have the <sys/ioctl.h> header file. */
#define HAVE_SYS_IOCTL_H 1
/* Define to 1 if you have the <sys/ipc.h> header file. */
#define HAVE_SYS_IPC_H 1
/* Define to 1 if you have the <sys/limits.h> header file. */
/* #undef HAVE_SYS_LIMITS_H */
/* Define to 1 if you have the <sys/lock.h> header file. */
#define HAVE_SYS_LOCK_H 1
/* Define to 1 if you have the <sys/mac.h> header file. */
#define HAVE_SYS_MAC_H 1
/* Define to 1 if you have the <sys/mman.h> header file. */
#define HAVE_SYS_MMAN_H 1
/* Define to 1 if you have the <sys/modem.h> header file. */
/* #undef HAVE_SYS_MODEM_H */
/* Define to 1 if you have the <sys/ndir.h> header file, and it defines `DIR'.
*/
/* #undef HAVE_SYS_NDIR_H */
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/pcl720.h> header file. */
/* #undef HAVE_SYS_PCL720_H */
/* Define to 1 if you have the <sys/poll.h> header file. */
#define HAVE_SYS_POLL_H 1
/* Define to 1 if you have the <sys/ppsclock.h> header file. */
/* #undef HAVE_SYS_PPSCLOCK_H */
/* Define to 1 if you have the <sys/ppstime.h> header file. */
/* #undef HAVE_SYS_PPSTIME_H */
/* Define to 1 if you have the <sys/prctl.h> header file. */
/* #undef HAVE_SYS_PRCTL_H */
/* Define to 1 if you have the <sys/procset.h> header file. */
/* #undef HAVE_SYS_PROCSET_H */
/* Define to 1 if you have the <sys/proc.h> header file. */
#define HAVE_SYS_PROC_H 1
/* Define to 1 if you have the <sys/resource.h> header file. */
#define HAVE_SYS_RESOURCE_H 1
/* Define to 1 if you have the <sys/sched.h> header file. */
/* #undef HAVE_SYS_SCHED_H */
/* Define to 1 if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define to 1 if you have the <sys/shm.h> header file. */
#define HAVE_SYS_SHM_H 1
/* Define to 1 if you have the <sys/signal.h> header file. */
#define HAVE_SYS_SIGNAL_H 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/sockio.h> header file. */
#define HAVE_SYS_SOCKIO_H 1
/* Define to 1 if you have the <sys/soundcard.h> header file. */
#define HAVE_SYS_SOUNDCARD_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/stream.h> header file. */
/* #undef HAVE_SYS_STREAM_H */
/* Define to 1 if you have the <sys/stropts.h> header file. */
/* #undef HAVE_SYS_STROPTS_H */
/* Define to 1 if you have the <sys/sysctl.h> header file. */
#define HAVE_SYS_SYSCTL_H 1
/* Define to 1 if you have the <sys/syssgi.h> header file. */
/* #undef HAVE_SYS_SYSSGI_H */
/* Define to 1 if you have the <sys/systune.h> header file. */
/* #undef HAVE_SYS_SYSTUNE_H */
/* Define to 1 if you have the <sys/termios.h> header file. */
#define HAVE_SYS_TERMIOS_H 1
/* Define to 1 if you have the <sys/timepps.h> header file. */
#define HAVE_SYS_TIMEPPS_H 1
/* Define to 1 if you have the <sys/timers.h> header file. */
#define HAVE_SYS_TIMERS_H 1
/* Define to 1 if you have the <sys/timex.h> header file. */
#define HAVE_SYS_TIMEX_H 1
/* Define to 1 if you have the <sys/time.h> header file. */
#define HAVE_SYS_TIME_H 1
/* Define to 1 if you have the <sys/tpro.h> header file. */
/* #undef HAVE_SYS_TPRO_H */
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Use sys/uio.h for struct iovec help */
/* #undef HAVE_SYS_UIO_H */
/* Define to 1 if you have the <sys/un.h> header file. */
#define HAVE_SYS_UN_H 1
/* Define to 1 if you have the <sys/var.h> header file. */
/* #undef HAVE_SYS_VAR_H */
/* Define to 1 if you have the <sys/wait.h> header file. */
#define HAVE_SYS_WAIT_H 1
/* Define to 1 if the system has the type `s_char'. */
/* #undef HAVE_S_CHAR */
/* Define to 1 if you have the <termios.h> header file. */
#define HAVE_TERMIOS_H 1
/* Define to 1 if you have the <termio.h> header file. */
/* #undef HAVE_TERMIO_H */
/* if you have Solaris LWP (thr) package */
/* #undef HAVE_THR */
/* Define to 1 if you have the <thread.h> header file. */
/* #undef HAVE_THREAD_H */
/* Define to 1 if you have the `thr_getconcurrency' function. */
/* #undef HAVE_THR_GETCONCURRENCY */
/* Define to 1 if you have the `thr_setconcurrency' function. */
/* #undef HAVE_THR_SETCONCURRENCY */
/* Define to 1 if you have the `thr_yield' function. */
/* #undef HAVE_THR_YIELD */
/* Obvious */
#define HAVE_TICKADJ_IN_STRUCT_CLOCKINFO 1
/* Define to 1 if you have the `timegm' function. */
#define HAVE_TIMEGM 1
/* Define to 1 if you have the <timepps.h> header file. */
/* #undef HAVE_TIMEPPS_H */
/* Define to 1 if you have the `timer_create' function. */
/* #undef HAVE_TIMER_CREATE */
/* Define to 1 if you have the <timex.h> header file. */
/* #undef HAVE_TIMEX_H */
/* Define to 1 if you have the <time.h> header file. */
#define HAVE_TIME_H 1
/* Do we have the TIOCGPPSEV ioctl (Solaris)? */
/* #undef HAVE_TIOCGPPSEV */
/* Do we have the TIOCSPPS ioctl (Solaris)? */
/* #undef HAVE_TIOCSPPS */
/* Do we have the TIO serial stuff? */
/* #undef HAVE_TIO_SERIAL_STUFF */
/* Are TrustedBSD MAC policy privileges available? */
#define HAVE_TRUSTEDBSD_MAC 1
/* Define to 1 if the system has the type `uint16_t'. */
#define HAVE_UINT16_T 1
/* Define to 1 if the system has the type `uint32_t'. */
#define HAVE_UINT32_T 1
/* Define to 1 if the system has the type `uint8_t'. */
#define HAVE_UINT8_T 1
/* Define to 1 if the system has the type `uintmax_t'. */
/* #undef HAVE_UINTMAX_T */
/* Define to 1 if the system has the type `uintptr_t'. */
#define HAVE_UINTPTR_T 1
/* Define to 1 if the system has the type `uint_t'. */
/* #undef HAVE_UINT_T */
/* Define to 1 if you have the `umask' function. */
#define HAVE_UMASK 1
/* Define to 1 if you have the `uname' function. */
#define HAVE_UNAME 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* deviant sigwait? */
/* #undef HAVE_UNIXWARE_SIGWAIT */
/* Define to 1 if the system has the type `unsigned long long int'. */
#define HAVE_UNSIGNED_LONG_LONG_INT 1
/* Define to 1 if you have the `updwtmp' function. */
/* #undef HAVE_UPDWTMP */
/* Define to 1 if you have the `updwtmpx' function. */
/* #undef HAVE_UPDWTMPX */
/* Define to 1 if you have the <utime.h> header file. */
#define HAVE_UTIME_H 1
/* Define to 1 if you have the <utmpx.h> header file. */
#define HAVE_UTMPX_H 1
/* Define to 1 if you have the <utmp.h> header file. */
/* #undef HAVE_UTMP_H */
/* Define to 1 if the system has the type `u_int32'. */
/* #undef HAVE_U_INT32 */
/* u_int32 type in DNS headers, not others. */
/* #undef HAVE_U_INT32_ONLY_WITH_DNS */
/* Define to 1 if you have the <values.h> header file. */
/* #undef HAVE_VALUES_H */
/* Define to 1 if you have the <varargs.h> header file. */
/* #undef HAVE_VARARGS_H */
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the <vfork.h> header file. */
/* #undef HAVE_VFORK_H */
/* Define to 1 if you have the `vprintf' function. */
#define HAVE_VPRINTF 1
/* Define if C99-compliant `vsnprintf' is available. */
#define HAVE_VSNPRINTF 1
/* Define to 1 if you have the <wchar.h> header file. */
#define HAVE_WCHAR_H 1
/* Define to 1 if the system has the type `wchar_t'. */
#define HAVE_WCHAR_T 1
/* Define to 1 if the system has the type `wint_t'. */
#define HAVE_WINT_T 1
/* Define to 1 if `fork' works. */
#define HAVE_WORKING_FORK 1
/* Define to 1 if `vfork' works. */
#define HAVE_WORKING_VFORK 1
/* define if select implicitly yields */
#define HAVE_YIELDING_SELECT 1
/* Define to 1 if the system has the type `_Bool'. */
#define HAVE__BOOL 1
/* Define to 1 if you have the `_exit' function. */
#define HAVE__EXIT 1
/* Define to 1 if you have the </sys/sync/queue.h> header file. */
/* #undef HAVE__SYS_SYNC_QUEUE_H */
/* Define to 1 if you have the </sys/sync/sema.h> header file. */
/* #undef HAVE__SYS_SYNC_SEMA_H */
/* Define to 1 if you have the `__adjtimex' function. */
/* #undef HAVE___ADJTIMEX */
/* defined if C compiler supports __attribute__((...)) */
#define HAVE___ATTRIBUTE__ /**/
/* define away __attribute__() if unsupported */
#ifndef HAVE___ATTRIBUTE__
# define __attribute__(x) /* empty */
#endif
#define ISC_PLATFORM_NORETURN_PRE
#define ISC_PLATFORM_NORETURN_POST __attribute__((__noreturn__))
/* Define to 1 if you have the `__ntp_gettime' function. */
/* #undef HAVE___NTP_GETTIME */
/* Define to 1 if you have the `__res_init' function. */
/* #undef HAVE___RES_INIT */
/* Does struct sockaddr_storage have __ss_family? */
/* #undef HAVE___SS_FAMILY_IN_SS */
/* Handle sockaddr_storage.__ss_family */
#ifdef HAVE___SS_FAMILY_IN_SS
# define ss_family __ss_family
#endif /* HAVE___SS_FAMILY_IN_SS */
/* Define to provide `rpl_snprintf' function. */
/* #undef HW_WANT_RPL_SNPRINTF */
/* Define to provide `rpl_vsnprintf' function. */
/* #undef HW_WANT_RPL_VSNPRINTF */
/* Retry queries on _any_ DNS error? */
/* #undef IGNORE_DNS_ERRORS */
/* Should we use the IRIG sawtooth filter? */
/* #undef IRIG_SUCKS */
/* Enclose PTHREAD_ONCE_INIT in extra braces? */
/* #undef ISC_PLATFORM_BRACEPTHREADONCEINIT */
/* Do we need to fix in6isaddr? */
/* #undef ISC_PLATFORM_FIXIN6ISADDR */
/* ISC: do we have if_nametoindex()? */
#define ISC_PLATFORM_HAVEIFNAMETOINDEX 1
/* have struct if_laddrconf? */
/* #undef ISC_PLATFORM_HAVEIF_LADDRCONF */
/* have struct if_laddrreq? */
/* #undef ISC_PLATFORM_HAVEIF_LADDRREQ */
/* have struct in6_pktinfo? */
#define ISC_PLATFORM_HAVEIN6PKTINFO 1
/* have IPv6? */
#define ISC_PLATFORM_HAVEIPV6 1
/* struct sockaddr has sa_len? */
#define ISC_PLATFORM_HAVESALEN 1
/* sin6_scope_id? */
#define ISC_PLATFORM_HAVESCOPEID 1
/* missing in6addr_any? */
/* #undef ISC_PLATFORM_NEEDIN6ADDRANY */
/* Do we need netinet6/in6.h? */
/* #undef ISC_PLATFORM_NEEDNETINET6IN6H */
/* ISC: provide inet_ntop() */
/* #undef ISC_PLATFORM_NEEDNTOP */
/* Declare in_port_t? */
/* #undef ISC_PLATFORM_NEEDPORTT */
/* ISC: provide inet_pton() */
/* #undef ISC_PLATFORM_NEEDPTON */
/* enable libisc thread support? */
#define ISC_PLATFORM_USETHREADS 1
/* Does the kernel have an FLL bug? */
/* #undef KERNEL_FLL_BUG */
/* Does the kernel support precision time discipline? */
#define KERNEL_PLL 1
/* Define to use libseccomp system call filtering. */
/* #undef KERN_SECCOMP */
/* What is (probably) the name of DOSYNCTODR in the kernel? */
#define K_DOSYNCTODR_NAME "_dosynctodr"
/* What is (probably) the name of NOPRINTF in the kernel? */
#define K_NOPRINTF_NAME "_noprintf"
/* What is the name of TICKADJ in the kernel? */
#define K_TICKADJ_NAME "_tickadj"
/* What is the name of TICK in the kernel? */
#define K_TICK_NAME "_tick"
/* define to 1 if library is thread safe */
#define LDAP_API_FEATURE_X_OPENLDAP_THREAD_SAFE 1
/* leap smear mechanism */
#define LEAP_SMEAR 1
/* Define to any value to include libseccomp sandboxing. */
/* #undef LIBSECCOMP */
/* Should we align with the NIST lockclock scheme? */
/* #undef LOCKCLOCK */
/* Define to the sub-directory where libtool stores uninstalled libraries. */
#define LT_OBJDIR ".libs/"
/* Does the target support multicast IP? */
#define MCAST 1
/* Should we recommend a minimum value for tickadj? */
/* #undef MIN_REC_TICKADJ */
/* Define to 1 if the compiler does not support C99's structure
initialization. */
/* #undef MISSING_C99_STRUCT_INIT */
/* having to fork the DNS worker early when doing chroot? */
/* #undef NEED_EARLY_FORK */
/* Do we need HPUX adjtime() library support? */
/* #undef NEED_HPUX_ADJTIME */
/* Do we want the HPUX FindConfig()? */
/* #undef NEED_HPUX_FINDCONFIG */
/* We need to provide netsnmp_daemonize() */
/* #undef NEED_NETSNMP_DAEMONIZE */
/* pthread_init() required? */
/* #undef NEED_PTHREAD_INIT */
/* use PTHREAD_SCOPE_SYSTEM? */
/* #undef NEED_PTHREAD_SCOPE_SYSTEM */
/* Do we need the qnx adjtime call? */
/* #undef NEED_QNX_ADJTIME */
/* Do we need extra room for SO_RCVBUF? (HPUX < 8) */
/* #undef NEED_RCVBUF_SLOP */
/* Do we need an s_char typedef? */
#define NEED_S_CHAR_TYPEDEF 1
/* Might nlist() values require an extra level of indirection (AIX)? */
/* #undef NLIST_EXTRA_INDIRECTION */
/* does struct nlist use a name union? */
/* #undef NLIST_NAME_UNION */
/* nlist stuff */
#define NLIST_STRUCT 1
/* Should we NOT read /dev/kmem? */
#define NOKMEM 1
/* Should we avoid #warning on option name collisions? */
/* #undef NO_OPTION_NAME_WARNINGS */
/* Is there a problem using PARENB and IGNPAR? */
/* #undef NO_PARENB_IGNPAR */
/* define if you have (or want) no threads */
/* #undef NO_THREADS */
/* Default location of crypto key info */
#define NTP_KEYSDIR "/etc/ntp"
/* Path to sign daemon rendezvous socket */
#define NTP_SIGND_PATH "/var/run/ntp_signd"
/* Do we have ntp_{adj,get}time in libc? */
#define NTP_SYSCALLS_LIBC 1
/* Do we have ntp_{adj,get}time in the kernel? */
/* #undef NTP_SYSCALLS_STD */
/* Do we have support for SHMEM_STATUS? */
#define ONCORE_SHMEM_STATUS 1
/* Use OpenSSL? */
/* #define OPENSSL */
/* Should we open the broadcast socket? */
#define OPEN_BCAST_SOCKET 1
/* need to recreate sockets on changed routing? */
/* #undef OS_MISSES_SPECIFIC_ROUTE_UPDATES */
/* wildcard socket needs REUSEADDR to bind interface addresses */
/* #undef OS_NEEDS_REUSEADDR_FOR_IFADDRBIND */
/* Do we need to override the system's idea of HZ? */
#define OVERRIDE_HZ 1
/* Name of package */
#define PACKAGE "ntp"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "http://bugs.ntp.org./"
/* Define to the full name of this package. */
#define PACKAGE_NAME "ntp"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "ntp 4.2.8p17"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "ntp"
/* Define to the home page for this package. */
#define PACKAGE_URL "http://www.ntp.org./"
/* Define to the version of this package. */
#define PACKAGE_VERSION "4.2.8p17"
/* data dir */
#define PERLLIBDIR "/usr/share/ntp/lib"
/* define to a working POSIX compliant shell */
#define POSIX_SHELL "/bin/sh"
/* PARSE kernel PLL PPS support */
/* #undef PPS_SYNC */
/* Preset a value for 'tick'? */
#define PRESET_TICK 1000000L/hz
/* Preset a value for 'tickadj'? */
#define PRESET_TICKADJ 500/hz
/* Should we not IGNPAR (Linux)? */
/* #undef RAWDCF_NO_IGNPAR */
/* enable thread safety */
#define REENTRANT 1
/* Basic refclock support? */
#define REFCLOCK 1
/* Do we want the ReliantUNIX clock hacks? */
/* #undef RELIANTUNIX_CLOCK */
/* define if sched_yield yields the entire process */
/* #undef REPLACE_BROKEN_YIELD */
/* Define as the return type of signal handlers (`int' or `void'). */
#define RETSIGTYPE void
/* saveconfig mechanism */
#define SAVECONFIG 1
/* Do we want the SCO clock hacks? */
/* #undef SCO5_CLOCK */
/* The size of `char *', as computed by sizeof. */
#ifdef __LP64__
#define SIZEOF_CHARP 8
#else
#define SIZEOF_CHARP 4
#endif
/* The size of `int', as computed by sizeof. */
#define SIZEOF_INT 4
/* The size of `long', as computed by sizeof. */
#ifdef __LP64__
#define SIZEOF_LONG 8
#else
#define SIZEOF_LONG 4
#endif
/* The size of `long long', as computed by sizeof. */
#define SIZEOF_LONG_LONG 8
/* The size of `pthread_t', as computed by sizeof. */
#define SIZEOF_PTHREAD_T 8
/* The size of `short', as computed by sizeof. */
#define SIZEOF_SHORT 2
/* The size of `signed char', as computed by sizeof. */
#define SIZEOF_SIGNED_CHAR 1
/* The size of `time_t', as computed by sizeof. */
#if defined(__i386__)
#define SIZEOF_TIME_T 4
#else
#define SIZEOF_TIME_T 8
#endif
/* Does SIOCGIFCONF return size in the buffer? */
/* #undef SIZE_RETURNED_IN_BUFFER */
/* Slew always? */
/* #undef SLEWALWAYS */
/* If using the C implementation of alloca, define if you know the
direction of stack growth for your system; otherwise it will be
automatically deduced at runtime.
STACK_DIRECTION > 0 => grows toward higher addresses
STACK_DIRECTION < 0 => grows toward lower addresses
STACK_DIRECTION = 0 => direction of growth unknown */
/* #undef STACK_DIRECTION */
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Step, then slew the clock? */
/* #undef STEP_SLEW */
/* Define to 1 if strerror_r returns char *. */
/* #undef STRERROR_R_CHAR_P */
/* canonical system (cpu-vendor-os) of where we should run */
#if defined(__amd64__)
#define STR_SYSTEM "amd64-undermydesk-freebsd"
#elif defined(__powerpc64__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
#define STR_SYSTEM "powerpc64le-undermydesk-freebsd"
#elif defined(__powerpc64__)
#define STR_SYSTEM "powerpc64-undermydesk-freebsd"
#elif defined(__powerpc__)
#define STR_SYSTEM "powerpc-undermydesk-freebsd"
#elif defined(__mips64)
#define STR_SYSTEM "mips64-undermydesk-freebsd"
#elif defined(__mips__)
#define STR_SYSTEM "mips-undermydesk-freebsd"
#elif defined(__aarch64__)
#define STR_SYSTEM "arm64-undermydesk-freebsd"
#elif defined(__arm__)
#define STR_SYSTEM "arm-undermydesk-freebsd"
#elif defined(__riscv)
#define STR_SYSTEM "riscv64-undermydesk-freebsd"
#else
#define STR_SYSTEM "i386-undermydesk-freebsd"
#endif
/* Does Xettimeofday take 1 arg? */
/* #undef SYSV_TIMEOFDAY */
/* Do we need to #define _SVID3 when we #include <termios.h>? */
/* #undef TERMIOS_NEEDS__SVID3 */
/* enable thread safety */
#define THREADSAFE 1
/* enable thread safety */
#define THREAD_SAFE 1
/* Is K_TICKADJ_NAME in nanoseconds? */
/* #undef TICKADJ_NANO */
/* Is K_TICK_NAME in nanoseconds? */
/* #undef TICK_NANO */
/* Define to 1 if you can safely include both <sys/time.h> and <time.h>. */
#define TIME_WITH_SYS_TIME 1
/* Define to 1 if your <sys/time.h> declares `struct tm'. */
/* #undef TM_IN_SYS_TIME */
/* Provide a typedef for uintptr_t? */
#ifndef HAVE_UINTPTR_T
typedef unsigned int uintptr_t;
#define HAVE_UINTPTR_T 1
#endif
/* What type to use for setsockopt */
#define TYPEOF_IP_MULTICAST_LOOP u_char
/* Do we set process groups with -pid? */
/* #undef UDP_BACKWARDS_SETOWN */
/* Must we have a CTTY for fsetown? */
#define USE_FSETOWNCTTY 1
/* Use OpenSSL's crypto random functions */
/* #define USE_OPENSSL_CRYPTO_RAND 1 */
/* OK to use snprintb()? */
/* #undef USE_SNPRINTB */
/* Can we use SIGPOLL for tty IO? */
/* #undef USE_TTY_SIGPOLL */
/* Can we use SIGPOLL for UDP? */
/* #undef USE_UDP_SIGPOLL */
/* Version number of package */
#define VERSION "4.2.8p17"
/* vsnprintf expands "%m" to strerror(errno) */
#define VSNPRINTF_PERCENT_M 1
/* configure --enable-ipv6 */
#define WANT_IPV6 1
/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most
significant byte first (like Motorola and SPARC, unlike Intel). */
#if defined(__ARMEB__) || defined(__MIPSEB__) || \
(defined(__powerpc__) && __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)
#define WORDS_BIGENDIAN 1
#endif
/* routine worker child proc uses to exit. */
#define WORKER_CHILD_EXIT exit
/* Define to 1 if on MINIX. */
/* #undef _MINIX */
/* Define to 2 if the system does not provide POSIX.1 features except with
this defined. */
/* #undef _POSIX_1_SOURCE */
/* Define to 1 if you need to in order for `stat' and other things to work. */
/* #undef _POSIX_SOURCE */
/* enable thread safety */
#define _REENTRANT 1
/* enable thread safety */
#define _SGI_MP_SOURCE 1
/* enable thread safety */
#define _THREADSAFE 1
/* enable thread safety */
#define _THREAD_SAFE 1
/* Define to 500 only on HP-UX. */
/* #undef _XOPEN_SOURCE */
/* Are we _special_? */
/* #undef __APPLE_USE_RFC_3542 */
/* Define to 1 if type `char' is unsigned and you are not using gcc. */
#ifndef __CHAR_UNSIGNED__
/* # undef __CHAR_UNSIGNED__ */
#endif
/* Enable extensions on AIX 3, Interix. */
#ifndef _ALL_SOURCE
# define _ALL_SOURCE 1
#endif
/* Enable GNU extensions on systems that have them. */
#ifndef _GNU_SOURCE
# define _GNU_SOURCE 1
#endif
/* Enable threading extensions on Solaris. */
#ifndef _POSIX_PTHREAD_SEMANTICS
# define _POSIX_PTHREAD_SEMANTICS 1
#endif
/* Enable extensions on HP NonStop. */
#ifndef _TANDEM_SOURCE
# define _TANDEM_SOURCE 1
#endif
/* Enable general extensions on Solaris. */
#ifndef __EXTENSIONS__
# define __EXTENSIONS__ 1
#endif
/* deviant */
/* #undef adjtimex */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef gid_t */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define to the widest signed integer type if <stdint.h> and <inttypes.h> do
not define. */
/* #undef intmax_t */
/* deviant */
/* #undef ntp_adjtime */
/* deviant */
/* #undef ntp_gettime */
/* Define to `long int' if <sys/types.h> does not define. */
/* #undef off_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
#if !defined(_KERNEL) && !defined(PARSESTREAM)
/*
* stdio.h must be included after _GNU_SOURCE is defined
* but before #define snprintf rpl_snprintf
*/
# include <stdio.h>
#endif
/* Define to rpl_snprintf if the replacement function should be used. */
/* #undef snprintf */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef uid_t */
/* Define to the widest unsigned integer type if <stdint.h> and <inttypes.h>
do not define. */
/* #undef uintmax_t */
/* Define to the type of an unsigned integer type wide enough to hold a
pointer, if such a type exists, and if the system does not define it. */
/* #undef uintptr_t */
/* Define as `fork' if `vfork' does not work. */
/* #undef vfork */
/* Define to empty if the keyword `volatile' does not work. Warning: valid
code using `volatile' can become incorrect without. Disable with care. */
/* #undef volatile */
/* Define to rpl_vsnprintf if the replacement function should be used. */
/* #undef vsnprintf */
#ifndef MPINFOU_PREDECLARED
# define MPINFOU_PREDECLARED
typedef union mpinfou {
struct pdk_mpinfo *pdkptr;
struct mpinfo *pikptr;
} mpinfou_t;
#endif
#if !defined(_KERNEL) && !defined(PARSESTREAM)
# if defined(HW_WANT_RPL_VSNPRINTF)
# if defined(__cplusplus)
extern "C" {
# endif
# include <stdarg.h>
int rpl_vsnprintf(char *, size_t, const char *, va_list);
# if defined(__cplusplus)
}
# endif
# endif
# if defined(HW_WANT_RPL_SNPRINTF)
# if defined(__cplusplus)
extern "C" {
# endif
int rpl_snprintf(char *, size_t, const char *, ...);
# if defined(__cplusplus)
}
# endif
# endif
#endif /* !defined(_KERNEL) && !defined(PARSESTREAM) */
/*
* FreeBSD specific: Explicitly specify date/time for reproducible build.
*/
#define MKREPRO_DATE "Aug 19 2018"
#define MKREPRO_TIME "01:24:29"
diff --git a/usr.sbin/ntp/ntpdc/nl.c b/usr.sbin/ntp/ntpdc/nl.c
index 045d000fe252..6ad05f368742 100644
--- a/usr.sbin/ntp/ntpdc/nl.c
+++ b/usr.sbin/ntp/ntpdc/nl.c
@@ -1,895 +1,894 @@
-/* $FreeBSD$ */
printf("sizeof(union req_data_u_tag) = %d\n",
(int) sizeof(union req_data_u_tag));
printf("offsetof(u32) = %d\n",
(int) offsetof(union req_data_u_tag, u32));
printf("offsetof(data) = %d\n",
(int) offsetof(union req_data_u_tag, data));
printf("\n");
printf("sizeof(struct req_pkt) = %d\n",
(int) sizeof(struct req_pkt));
printf("offsetof(rm_vn_mode) = %d\n",
(int) offsetof(struct req_pkt, rm_vn_mode));
printf("offsetof(auth_seq) = %d\n",
(int) offsetof(struct req_pkt, auth_seq));
printf("offsetof(implementation) = %d\n",
(int) offsetof(struct req_pkt, implementation));
printf("offsetof(request) = %d\n",
(int) offsetof(struct req_pkt, request));
printf("offsetof(err_nitems) = %d\n",
(int) offsetof(struct req_pkt, err_nitems));
printf("offsetof(mbz_itemsize) = %d\n",
(int) offsetof(struct req_pkt, mbz_itemsize));
printf("offsetof(u) = %d\n",
(int) offsetof(struct req_pkt, u));
printf("offsetof(tstamp) = %d\n",
(int) offsetof(struct req_pkt, tstamp));
printf("offsetof(keyid) = %d\n",
(int) offsetof(struct req_pkt, keyid));
printf("offsetof(mac) = %d\n",
(int) offsetof(struct req_pkt, mac));
printf("\n");
printf("sizeof(struct req_pkt_tail) = %d\n",
(int) sizeof(struct req_pkt_tail));
printf("offsetof(tstamp) = %d\n",
(int) offsetof(struct req_pkt_tail, tstamp));
printf("offsetof(keyid) = %d\n",
(int) offsetof(struct req_pkt_tail, keyid));
printf("offsetof(mac) = %d\n",
(int) offsetof(struct req_pkt_tail, mac));
printf("\n");
printf("sizeof(union resp_pkt_u_tag) = %d\n",
(int) sizeof(union resp_pkt_u_tag));
printf("offsetof(data) = %d\n",
(int) offsetof(union resp_pkt_u_tag, data));
printf("offsetof(u32) = %d\n",
(int) offsetof(union resp_pkt_u_tag, u32));
printf("\n");
printf("sizeof(struct resp_pkt) = %d\n",
(int) sizeof(struct resp_pkt));
printf("offsetof(rm_vn_mode) = %d\n",
(int) offsetof(struct resp_pkt, rm_vn_mode));
printf("offsetof(auth_seq) = %d\n",
(int) offsetof(struct resp_pkt, auth_seq));
printf("offsetof(implementation) = %d\n",
(int) offsetof(struct resp_pkt, implementation));
printf("offsetof(request) = %d\n",
(int) offsetof(struct resp_pkt, request));
printf("offsetof(err_nitems) = %d\n",
(int) offsetof(struct resp_pkt, err_nitems));
printf("offsetof(mbz_itemsize) = %d\n",
(int) offsetof(struct resp_pkt, mbz_itemsize));
printf("offsetof(u) = %d\n",
(int) offsetof(struct resp_pkt, u));
printf("\n");
printf("sizeof(struct info_peer_list) = %d\n",
(int) sizeof(struct info_peer_list));
printf("offsetof(addr) = %d\n",
(int) offsetof(struct info_peer_list, addr));
printf("offsetof(port) = %d\n",
(int) offsetof(struct info_peer_list, port));
printf("offsetof(hmode) = %d\n",
(int) offsetof(struct info_peer_list, hmode));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_peer_list, flags));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_peer_list, v6_flag));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_peer_list, unused1));
printf("offsetof(addr6) = %d\n",
(int) offsetof(struct info_peer_list, addr6));
printf("\n");
printf("sizeof(struct info_peer_summary) = %d\n",
(int) sizeof(struct info_peer_summary));
printf("offsetof(dstadr) = %d\n",
(int) offsetof(struct info_peer_summary, dstadr));
printf("offsetof(srcadr) = %d\n",
(int) offsetof(struct info_peer_summary, srcadr));
printf("offsetof(srcport) = %d\n",
(int) offsetof(struct info_peer_summary, srcport));
printf("offsetof(stratum) = %d\n",
(int) offsetof(struct info_peer_summary, stratum));
printf("offsetof(hpoll) = %d\n",
(int) offsetof(struct info_peer_summary, hpoll));
printf("offsetof(ppoll) = %d\n",
(int) offsetof(struct info_peer_summary, ppoll));
printf("offsetof(reach) = %d\n",
(int) offsetof(struct info_peer_summary, reach));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_peer_summary, flags));
printf("offsetof(hmode) = %d\n",
(int) offsetof(struct info_peer_summary, hmode));
printf("offsetof(delay) = %d\n",
(int) offsetof(struct info_peer_summary, delay));
printf("offsetof(offset) = %d\n",
(int) offsetof(struct info_peer_summary, offset));
printf("offsetof(dispersion) = %d\n",
(int) offsetof(struct info_peer_summary, dispersion));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_peer_summary, v6_flag));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_peer_summary, unused1));
printf("offsetof(dstadr6) = %d\n",
(int) offsetof(struct info_peer_summary, dstadr6));
printf("offsetof(srcadr6) = %d\n",
(int) offsetof(struct info_peer_summary, srcadr6));
printf("\n");
printf("sizeof(struct info_peer) = %d\n",
(int) sizeof(struct info_peer));
printf("offsetof(dstadr) = %d\n",
(int) offsetof(struct info_peer, dstadr));
printf("offsetof(srcadr) = %d\n",
(int) offsetof(struct info_peer, srcadr));
printf("offsetof(srcport) = %d\n",
(int) offsetof(struct info_peer, srcport));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_peer, flags));
printf("offsetof(leap) = %d\n",
(int) offsetof(struct info_peer, leap));
printf("offsetof(hmode) = %d\n",
(int) offsetof(struct info_peer, hmode));
printf("offsetof(pmode) = %d\n",
(int) offsetof(struct info_peer, pmode));
printf("offsetof(stratum) = %d\n",
(int) offsetof(struct info_peer, stratum));
printf("offsetof(ppoll) = %d\n",
(int) offsetof(struct info_peer, ppoll));
printf("offsetof(hpoll) = %d\n",
(int) offsetof(struct info_peer, hpoll));
printf("offsetof(precision) = %d\n",
(int) offsetof(struct info_peer, precision));
printf("offsetof(version) = %d\n",
(int) offsetof(struct info_peer, version));
printf("offsetof(unused8) = %d\n",
(int) offsetof(struct info_peer, unused8));
printf("offsetof(reach) = %d\n",
(int) offsetof(struct info_peer, reach));
printf("offsetof(unreach) = %d\n",
(int) offsetof(struct info_peer, unreach));
printf("offsetof(flash) = %d\n",
(int) offsetof(struct info_peer, flash));
printf("offsetof(ttl) = %d\n",
(int) offsetof(struct info_peer, ttl));
printf("offsetof(flash2) = %d\n",
(int) offsetof(struct info_peer, flash2));
printf("offsetof(associd) = %d\n",
(int) offsetof(struct info_peer, associd));
printf("offsetof(keyid) = %d\n",
(int) offsetof(struct info_peer, keyid));
printf("offsetof(pkeyid) = %d\n",
(int) offsetof(struct info_peer, pkeyid));
printf("offsetof(refid) = %d\n",
(int) offsetof(struct info_peer, refid));
printf("offsetof(timer) = %d\n",
(int) offsetof(struct info_peer, timer));
printf("offsetof(rootdelay) = %d\n",
(int) offsetof(struct info_peer, rootdelay));
printf("offsetof(rootdispersion) = %d\n",
(int) offsetof(struct info_peer, rootdispersion));
printf("offsetof(reftime) = %d\n",
(int) offsetof(struct info_peer, reftime));
printf("offsetof(org) = %d\n",
(int) offsetof(struct info_peer, org));
printf("offsetof(rec) = %d\n",
(int) offsetof(struct info_peer, rec));
printf("offsetof(xmt) = %d\n",
(int) offsetof(struct info_peer, xmt));
printf("offsetof(filtdelay) = %d\n",
(int) offsetof(struct info_peer, filtdelay));
printf("offsetof(filtoffset) = %d\n",
(int) offsetof(struct info_peer, filtoffset));
printf("offsetof(order) = %d\n",
(int) offsetof(struct info_peer, order));
printf("offsetof(delay) = %d\n",
(int) offsetof(struct info_peer, delay));
printf("offsetof(dispersion) = %d\n",
(int) offsetof(struct info_peer, dispersion));
printf("offsetof(offset) = %d\n",
(int) offsetof(struct info_peer, offset));
printf("offsetof(selectdisp) = %d\n",
(int) offsetof(struct info_peer, selectdisp));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_peer, unused1));
printf("offsetof(unused2) = %d\n",
(int) offsetof(struct info_peer, unused2));
printf("offsetof(unused3) = %d\n",
(int) offsetof(struct info_peer, unused3));
printf("offsetof(unused4) = %d\n",
(int) offsetof(struct info_peer, unused4));
printf("offsetof(unused5) = %d\n",
(int) offsetof(struct info_peer, unused5));
printf("offsetof(unused6) = %d\n",
(int) offsetof(struct info_peer, unused6));
printf("offsetof(unused7) = %d\n",
(int) offsetof(struct info_peer, unused7));
printf("offsetof(estbdelay) = %d\n",
(int) offsetof(struct info_peer, estbdelay));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_peer, v6_flag));
printf("offsetof(unused9) = %d\n",
(int) offsetof(struct info_peer, unused9));
printf("offsetof(dstadr6) = %d\n",
(int) offsetof(struct info_peer, dstadr6));
printf("offsetof(srcadr6) = %d\n",
(int) offsetof(struct info_peer, srcadr6));
printf("\n");
printf("sizeof(struct info_peer_stats) = %d\n",
(int) sizeof(struct info_peer_stats));
printf("offsetof(dstadr) = %d\n",
(int) offsetof(struct info_peer_stats, dstadr));
printf("offsetof(srcadr) = %d\n",
(int) offsetof(struct info_peer_stats, srcadr));
printf("offsetof(srcport) = %d\n",
(int) offsetof(struct info_peer_stats, srcport));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_peer_stats, flags));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct info_peer_stats, timereset));
printf("offsetof(timereceived) = %d\n",
(int) offsetof(struct info_peer_stats, timereceived));
printf("offsetof(timetosend) = %d\n",
(int) offsetof(struct info_peer_stats, timetosend));
printf("offsetof(timereachable) = %d\n",
(int) offsetof(struct info_peer_stats, timereachable));
printf("offsetof(sent) = %d\n",
(int) offsetof(struct info_peer_stats, sent));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_peer_stats, unused1));
printf("offsetof(processed) = %d\n",
(int) offsetof(struct info_peer_stats, processed));
printf("offsetof(unused2) = %d\n",
(int) offsetof(struct info_peer_stats, unused2));
printf("offsetof(badauth) = %d\n",
(int) offsetof(struct info_peer_stats, badauth));
printf("offsetof(bogusorg) = %d\n",
(int) offsetof(struct info_peer_stats, bogusorg));
printf("offsetof(oldpkt) = %d\n",
(int) offsetof(struct info_peer_stats, oldpkt));
printf("offsetof(unused3) = %d\n",
(int) offsetof(struct info_peer_stats, unused3));
printf("offsetof(unused4) = %d\n",
(int) offsetof(struct info_peer_stats, unused4));
printf("offsetof(seldisp) = %d\n",
(int) offsetof(struct info_peer_stats, seldisp));
printf("offsetof(selbroken) = %d\n",
(int) offsetof(struct info_peer_stats, selbroken));
printf("offsetof(unused5) = %d\n",
(int) offsetof(struct info_peer_stats, unused5));
printf("offsetof(candidate) = %d\n",
(int) offsetof(struct info_peer_stats, candidate));
printf("offsetof(unused6) = %d\n",
(int) offsetof(struct info_peer_stats, unused6));
printf("offsetof(unused7) = %d\n",
(int) offsetof(struct info_peer_stats, unused7));
printf("offsetof(unused8) = %d\n",
(int) offsetof(struct info_peer_stats, unused8));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_peer_stats, v6_flag));
printf("offsetof(unused9) = %d\n",
(int) offsetof(struct info_peer_stats, unused9));
printf("offsetof(dstadr6) = %d\n",
(int) offsetof(struct info_peer_stats, dstadr6));
printf("offsetof(srcadr6) = %d\n",
(int) offsetof(struct info_peer_stats, srcadr6));
printf("\n");
printf("sizeof(struct info_loop) = %d\n",
(int) sizeof(struct info_loop));
printf("offsetof(last_offset) = %d\n",
(int) offsetof(struct info_loop, last_offset));
printf("offsetof(drift_comp) = %d\n",
(int) offsetof(struct info_loop, drift_comp));
printf("offsetof(compliance) = %d\n",
(int) offsetof(struct info_loop, compliance));
printf("offsetof(watchdog_timer) = %d\n",
(int) offsetof(struct info_loop, watchdog_timer));
printf("\n");
printf("sizeof(struct info_sys) = %d\n",
(int) sizeof(struct info_sys));
printf("offsetof(peer) = %d\n",
(int) offsetof(struct info_sys, peer));
printf("offsetof(peer_mode) = %d\n",
(int) offsetof(struct info_sys, peer_mode));
printf("offsetof(leap) = %d\n",
(int) offsetof(struct info_sys, leap));
printf("offsetof(stratum) = %d\n",
(int) offsetof(struct info_sys, stratum));
printf("offsetof(precision) = %d\n",
(int) offsetof(struct info_sys, precision));
printf("offsetof(rootdelay) = %d\n",
(int) offsetof(struct info_sys, rootdelay));
printf("offsetof(rootdispersion) = %d\n",
(int) offsetof(struct info_sys, rootdispersion));
printf("offsetof(refid) = %d\n",
(int) offsetof(struct info_sys, refid));
printf("offsetof(reftime) = %d\n",
(int) offsetof(struct info_sys, reftime));
printf("offsetof(poll) = %d\n",
(int) offsetof(struct info_sys, poll));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_sys, flags));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_sys, unused1));
printf("offsetof(unused2) = %d\n",
(int) offsetof(struct info_sys, unused2));
printf("offsetof(unused3) = %d\n",
(int) offsetof(struct info_sys, unused3));
printf("offsetof(bdelay) = %d\n",
(int) offsetof(struct info_sys, bdelay));
printf("offsetof(frequency) = %d\n",
(int) offsetof(struct info_sys, frequency));
printf("offsetof(authdelay) = %d\n",
(int) offsetof(struct info_sys, authdelay));
printf("offsetof(stability) = %d\n",
(int) offsetof(struct info_sys, stability));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_sys, v6_flag));
printf("offsetof(unused4) = %d\n",
(int) offsetof(struct info_sys, unused4));
printf("offsetof(peer6) = %d\n",
(int) offsetof(struct info_sys, peer6));
printf("\n");
printf("sizeof(struct info_sys_stats) = %d\n",
(int) sizeof(struct info_sys_stats));
printf("offsetof(timeup) = %d\n",
(int) offsetof(struct info_sys_stats, timeup));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct info_sys_stats, timereset));
printf("offsetof(denied) = %d\n",
(int) offsetof(struct info_sys_stats, denied));
printf("offsetof(oldversionpkt) = %d\n",
(int) offsetof(struct info_sys_stats, oldversionpkt));
printf("offsetof(newversionpkt) = %d\n",
(int) offsetof(struct info_sys_stats, newversionpkt));
printf("offsetof(unknownversion) = %d\n",
(int) offsetof(struct info_sys_stats, unknownversion));
printf("offsetof(badlength) = %d\n",
(int) offsetof(struct info_sys_stats, badlength));
printf("offsetof(processed) = %d\n",
(int) offsetof(struct info_sys_stats, processed));
printf("offsetof(badauth) = %d\n",
(int) offsetof(struct info_sys_stats, badauth));
printf("offsetof(received) = %d\n",
(int) offsetof(struct info_sys_stats, received));
printf("offsetof(limitrejected) = %d\n",
(int) offsetof(struct info_sys_stats, limitrejected));
printf("\n");
printf("sizeof(struct old_info_sys_stats) = %d\n",
(int) sizeof(struct old_info_sys_stats));
printf("offsetof(timeup) = %d\n",
(int) offsetof(struct old_info_sys_stats, timeup));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct old_info_sys_stats, timereset));
printf("offsetof(denied) = %d\n",
(int) offsetof(struct old_info_sys_stats, denied));
printf("offsetof(oldversionpkt) = %d\n",
(int) offsetof(struct old_info_sys_stats, oldversionpkt));
printf("offsetof(newversionpkt) = %d\n",
(int) offsetof(struct old_info_sys_stats, newversionpkt));
printf("offsetof(unknownversion) = %d\n",
(int) offsetof(struct old_info_sys_stats, unknownversion));
printf("offsetof(badlength) = %d\n",
(int) offsetof(struct old_info_sys_stats, badlength));
printf("offsetof(processed) = %d\n",
(int) offsetof(struct old_info_sys_stats, processed));
printf("offsetof(badauth) = %d\n",
(int) offsetof(struct old_info_sys_stats, badauth));
printf("offsetof(wanderhold) = %d\n",
(int) offsetof(struct old_info_sys_stats, wanderhold));
printf("\n");
printf("sizeof(struct info_mem_stats) = %d\n",
(int) sizeof(struct info_mem_stats));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct info_mem_stats, timereset));
printf("offsetof(totalpeermem) = %d\n",
(int) offsetof(struct info_mem_stats, totalpeermem));
printf("offsetof(freepeermem) = %d\n",
(int) offsetof(struct info_mem_stats, freepeermem));
printf("offsetof(findpeer_calls) = %d\n",
(int) offsetof(struct info_mem_stats, findpeer_calls));
printf("offsetof(allocations) = %d\n",
(int) offsetof(struct info_mem_stats, allocations));
printf("offsetof(demobilizations) = %d\n",
(int) offsetof(struct info_mem_stats, demobilizations));
printf("offsetof(hashcount) = %d\n",
(int) offsetof(struct info_mem_stats, hashcount));
printf("\n");
printf("sizeof(struct info_io_stats) = %d\n",
(int) sizeof(struct info_io_stats));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct info_io_stats, timereset));
printf("offsetof(totalrecvbufs) = %d\n",
(int) offsetof(struct info_io_stats, totalrecvbufs));
printf("offsetof(freerecvbufs) = %d\n",
(int) offsetof(struct info_io_stats, freerecvbufs));
printf("offsetof(fullrecvbufs) = %d\n",
(int) offsetof(struct info_io_stats, fullrecvbufs));
printf("offsetof(lowwater) = %d\n",
(int) offsetof(struct info_io_stats, lowwater));
printf("offsetof(dropped) = %d\n",
(int) offsetof(struct info_io_stats, dropped));
printf("offsetof(ignored) = %d\n",
(int) offsetof(struct info_io_stats, ignored));
printf("offsetof(received) = %d\n",
(int) offsetof(struct info_io_stats, received));
printf("offsetof(sent) = %d\n",
(int) offsetof(struct info_io_stats, sent));
printf("offsetof(notsent) = %d\n",
(int) offsetof(struct info_io_stats, notsent));
printf("offsetof(interrupts) = %d\n",
(int) offsetof(struct info_io_stats, interrupts));
printf("offsetof(int_received) = %d\n",
(int) offsetof(struct info_io_stats, int_received));
printf("\n");
printf("sizeof(struct info_timer_stats) = %d\n",
(int) sizeof(struct info_timer_stats));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct info_timer_stats, timereset));
printf("offsetof(alarms) = %d\n",
(int) offsetof(struct info_timer_stats, alarms));
printf("offsetof(overflows) = %d\n",
(int) offsetof(struct info_timer_stats, overflows));
printf("offsetof(xmtcalls) = %d\n",
(int) offsetof(struct info_timer_stats, xmtcalls));
printf("\n");
printf("sizeof(struct old_conf_peer) = %d\n",
(int) sizeof(struct old_conf_peer));
printf("offsetof(peeraddr) = %d\n",
(int) offsetof(struct old_conf_peer, peeraddr));
printf("offsetof(hmode) = %d\n",
(int) offsetof(struct old_conf_peer, hmode));
printf("offsetof(version) = %d\n",
(int) offsetof(struct old_conf_peer, version));
printf("offsetof(minpoll) = %d\n",
(int) offsetof(struct old_conf_peer, minpoll));
printf("offsetof(maxpoll) = %d\n",
(int) offsetof(struct old_conf_peer, maxpoll));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct old_conf_peer, flags));
printf("offsetof(ttl) = %d\n",
(int) offsetof(struct old_conf_peer, ttl));
printf("offsetof(unused) = %d\n",
(int) offsetof(struct old_conf_peer, unused));
printf("offsetof(keyid) = %d\n",
(int) offsetof(struct old_conf_peer, keyid));
printf("\n");
printf("sizeof(struct conf_peer) = %d\n",
(int) sizeof(struct conf_peer));
printf("offsetof(peeraddr) = %d\n",
(int) offsetof(struct conf_peer, peeraddr));
printf("offsetof(hmode) = %d\n",
(int) offsetof(struct conf_peer, hmode));
printf("offsetof(version) = %d\n",
(int) offsetof(struct conf_peer, version));
printf("offsetof(minpoll) = %d\n",
(int) offsetof(struct conf_peer, minpoll));
printf("offsetof(maxpoll) = %d\n",
(int) offsetof(struct conf_peer, maxpoll));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct conf_peer, flags));
printf("offsetof(ttl) = %d\n",
(int) offsetof(struct conf_peer, ttl));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct conf_peer, unused1));
printf("offsetof(keyid) = %d\n",
(int) offsetof(struct conf_peer, keyid));
printf("offsetof(keystr) = %d\n",
(int) offsetof(struct conf_peer, keystr));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct conf_peer, v6_flag));
printf("offsetof(unused2) = %d\n",
(int) offsetof(struct conf_peer, unused2));
printf("offsetof(peeraddr6) = %d\n",
(int) offsetof(struct conf_peer, peeraddr6));
printf("\n");
printf("sizeof(struct conf_unpeer) = %d\n",
(int) sizeof(struct conf_unpeer));
printf("offsetof(peeraddr) = %d\n",
(int) offsetof(struct conf_unpeer, peeraddr));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct conf_unpeer, v6_flag));
printf("offsetof(peeraddr6) = %d\n",
(int) offsetof(struct conf_unpeer, peeraddr6));
printf("\n");
printf("sizeof(struct conf_sys_flags) = %d\n",
(int) sizeof(struct conf_sys_flags));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct conf_sys_flags, flags));
printf("\n");
printf("sizeof(struct info_restrict) = %d\n",
(int) sizeof(struct info_restrict));
printf("offsetof(addr) = %d\n",
(int) offsetof(struct info_restrict, addr));
printf("offsetof(mask) = %d\n",
(int) offsetof(struct info_restrict, mask));
printf("offsetof(count) = %d\n",
(int) offsetof(struct info_restrict, count));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_restrict, flags));
printf("offsetof(mflags) = %d\n",
(int) offsetof(struct info_restrict, mflags));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_restrict, v6_flag));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_restrict, unused1));
printf("offsetof(addr6) = %d\n",
(int) offsetof(struct info_restrict, addr6));
printf("offsetof(mask6) = %d\n",
(int) offsetof(struct info_restrict, mask6));
printf("\n");
printf("sizeof(struct conf_restrict) = %d\n",
(int) sizeof(struct conf_restrict));
printf("offsetof(addr) = %d\n",
(int) offsetof(struct conf_restrict, addr));
printf("offsetof(mask) = %d\n",
(int) offsetof(struct conf_restrict, mask));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct conf_restrict, flags));
printf("offsetof(mflags) = %d\n",
(int) offsetof(struct conf_restrict, mflags));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct conf_restrict, v6_flag));
printf("offsetof(addr6) = %d\n",
(int) offsetof(struct conf_restrict, addr6));
printf("offsetof(mask6) = %d\n",
(int) offsetof(struct conf_restrict, mask6));
printf("\n");
printf("sizeof(struct info_monitor_1) = %d\n",
(int) sizeof(struct info_monitor_1));
printf("offsetof(avg_int) = %d\n",
(int) offsetof(struct info_monitor_1, avg_int));
printf("offsetof(last_int) = %d\n",
(int) offsetof(struct info_monitor_1, last_int));
printf("offsetof(restr) = %d\n",
(int) offsetof(struct info_monitor_1, restr));
printf("offsetof(count) = %d\n",
(int) offsetof(struct info_monitor_1, count));
printf("offsetof(addr) = %d\n",
(int) offsetof(struct info_monitor_1, addr));
printf("offsetof(daddr) = %d\n",
(int) offsetof(struct info_monitor_1, daddr));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_monitor_1, flags));
printf("offsetof(port) = %d\n",
(int) offsetof(struct info_monitor_1, port));
printf("offsetof(mode) = %d\n",
(int) offsetof(struct info_monitor_1, mode));
printf("offsetof(version) = %d\n",
(int) offsetof(struct info_monitor_1, version));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_monitor_1, v6_flag));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_monitor_1, unused1));
printf("offsetof(addr6) = %d\n",
(int) offsetof(struct info_monitor_1, addr6));
printf("offsetof(daddr6) = %d\n",
(int) offsetof(struct info_monitor_1, daddr6));
printf("\n");
printf("sizeof(struct info_monitor) = %d\n",
(int) sizeof(struct info_monitor));
printf("offsetof(avg_int) = %d\n",
(int) offsetof(struct info_monitor, avg_int));
printf("offsetof(last_int) = %d\n",
(int) offsetof(struct info_monitor, last_int));
printf("offsetof(restr) = %d\n",
(int) offsetof(struct info_monitor, restr));
printf("offsetof(count) = %d\n",
(int) offsetof(struct info_monitor, count));
printf("offsetof(addr) = %d\n",
(int) offsetof(struct info_monitor, addr));
printf("offsetof(port) = %d\n",
(int) offsetof(struct info_monitor, port));
printf("offsetof(mode) = %d\n",
(int) offsetof(struct info_monitor, mode));
printf("offsetof(version) = %d\n",
(int) offsetof(struct info_monitor, version));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_monitor, v6_flag));
printf("offsetof(unused1) = %d\n",
(int) offsetof(struct info_monitor, unused1));
printf("offsetof(addr6) = %d\n",
(int) offsetof(struct info_monitor, addr6));
printf("\n");
printf("sizeof(struct old_info_monitor) = %d\n",
(int) sizeof(struct old_info_monitor));
printf("offsetof(lasttime) = %d\n",
(int) offsetof(struct old_info_monitor, lasttime));
printf("offsetof(firsttime) = %d\n",
(int) offsetof(struct old_info_monitor, firsttime));
printf("offsetof(count) = %d\n",
(int) offsetof(struct old_info_monitor, count));
printf("offsetof(addr) = %d\n",
(int) offsetof(struct old_info_monitor, addr));
printf("offsetof(port) = %d\n",
(int) offsetof(struct old_info_monitor, port));
printf("offsetof(mode) = %d\n",
(int) offsetof(struct old_info_monitor, mode));
printf("offsetof(version) = %d\n",
(int) offsetof(struct old_info_monitor, version));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct old_info_monitor, v6_flag));
printf("offsetof(addr6) = %d\n",
(int) offsetof(struct old_info_monitor, addr6));
printf("\n");
printf("sizeof(struct reset_flags) = %d\n",
(int) sizeof(struct reset_flags));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct reset_flags, flags));
printf("\n");
printf("sizeof(struct info_auth) = %d\n",
(int) sizeof(struct info_auth));
printf("offsetof(timereset) = %d\n",
(int) offsetof(struct info_auth, timereset));
printf("offsetof(numkeys) = %d\n",
(int) offsetof(struct info_auth, numkeys));
printf("offsetof(numfreekeys) = %d\n",
(int) offsetof(struct info_auth, numfreekeys));
printf("offsetof(keylookups) = %d\n",
(int) offsetof(struct info_auth, keylookups));
printf("offsetof(keynotfound) = %d\n",
(int) offsetof(struct info_auth, keynotfound));
printf("offsetof(encryptions) = %d\n",
(int) offsetof(struct info_auth, encryptions));
printf("offsetof(decryptions) = %d\n",
(int) offsetof(struct info_auth, decryptions));
printf("offsetof(expired) = %d\n",
(int) offsetof(struct info_auth, expired));
printf("offsetof(keyuncached) = %d\n",
(int) offsetof(struct info_auth, keyuncached));
printf("\n");
printf("sizeof(struct info_trap) = %d\n",
(int) sizeof(struct info_trap));
printf("offsetof(local_address) = %d\n",
(int) offsetof(struct info_trap, local_address));
printf("offsetof(trap_address) = %d\n",
(int) offsetof(struct info_trap, trap_address));
printf("offsetof(trap_port) = %d\n",
(int) offsetof(struct info_trap, trap_port));
printf("offsetof(sequence) = %d\n",
(int) offsetof(struct info_trap, sequence));
printf("offsetof(settime) = %d\n",
(int) offsetof(struct info_trap, settime));
printf("offsetof(origtime) = %d\n",
(int) offsetof(struct info_trap, origtime));
printf("offsetof(resets) = %d\n",
(int) offsetof(struct info_trap, resets));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_trap, flags));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_trap, v6_flag));
printf("offsetof(local_address6) = %d\n",
(int) offsetof(struct info_trap, local_address6));
printf("offsetof(trap_address6) = %d\n",
(int) offsetof(struct info_trap, trap_address6));
printf("\n");
printf("sizeof(struct conf_trap) = %d\n",
(int) sizeof(struct conf_trap));
printf("offsetof(local_address) = %d\n",
(int) offsetof(struct conf_trap, local_address));
printf("offsetof(trap_address) = %d\n",
(int) offsetof(struct conf_trap, trap_address));
printf("offsetof(trap_port) = %d\n",
(int) offsetof(struct conf_trap, trap_port));
printf("offsetof(unused) = %d\n",
(int) offsetof(struct conf_trap, unused));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct conf_trap, v6_flag));
printf("offsetof(local_address6) = %d\n",
(int) offsetof(struct conf_trap, local_address6));
printf("offsetof(trap_address6) = %d\n",
(int) offsetof(struct conf_trap, trap_address6));
printf("\n");
printf("sizeof(struct info_control) = %d\n",
(int) sizeof(struct info_control));
printf("offsetof(ctltimereset) = %d\n",
(int) offsetof(struct info_control, ctltimereset));
printf("offsetof(numctlreq) = %d\n",
(int) offsetof(struct info_control, numctlreq));
printf("offsetof(numctlbadpkts) = %d\n",
(int) offsetof(struct info_control, numctlbadpkts));
printf("offsetof(numctlresponses) = %d\n",
(int) offsetof(struct info_control, numctlresponses));
printf("offsetof(numctlfrags) = %d\n",
(int) offsetof(struct info_control, numctlfrags));
printf("offsetof(numctlerrors) = %d\n",
(int) offsetof(struct info_control, numctlerrors));
printf("offsetof(numctltooshort) = %d\n",
(int) offsetof(struct info_control, numctltooshort));
printf("offsetof(numctlinputresp) = %d\n",
(int) offsetof(struct info_control, numctlinputresp));
printf("offsetof(numctlinputfrag) = %d\n",
(int) offsetof(struct info_control, numctlinputfrag));
printf("offsetof(numctlinputerr) = %d\n",
(int) offsetof(struct info_control, numctlinputerr));
printf("offsetof(numctlbadoffset) = %d\n",
(int) offsetof(struct info_control, numctlbadoffset));
printf("offsetof(numctlbadversion) = %d\n",
(int) offsetof(struct info_control, numctlbadversion));
printf("offsetof(numctldatatooshort) = %d\n",
(int) offsetof(struct info_control, numctldatatooshort));
printf("offsetof(numctlbadop) = %d\n",
(int) offsetof(struct info_control, numctlbadop));
printf("offsetof(numasyncmsgs) = %d\n",
(int) offsetof(struct info_control, numasyncmsgs));
printf("\n");
printf("sizeof(struct info_clock) = %d\n",
(int) sizeof(struct info_clock));
printf("offsetof(clockadr) = %d\n",
(int) offsetof(struct info_clock, clockadr));
printf("offsetof(type) = %d\n",
(int) offsetof(struct info_clock, type));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_clock, flags));
printf("offsetof(lastevent) = %d\n",
(int) offsetof(struct info_clock, lastevent));
printf("offsetof(currentstatus) = %d\n",
(int) offsetof(struct info_clock, currentstatus));
printf("offsetof(polls) = %d\n",
(int) offsetof(struct info_clock, polls));
printf("offsetof(noresponse) = %d\n",
(int) offsetof(struct info_clock, noresponse));
printf("offsetof(badformat) = %d\n",
(int) offsetof(struct info_clock, badformat));
printf("offsetof(baddata) = %d\n",
(int) offsetof(struct info_clock, baddata));
printf("offsetof(timestarted) = %d\n",
(int) offsetof(struct info_clock, timestarted));
printf("offsetof(fudgetime1) = %d\n",
(int) offsetof(struct info_clock, fudgetime1));
printf("offsetof(fudgetime2) = %d\n",
(int) offsetof(struct info_clock, fudgetime2));
printf("offsetof(fudgeval1) = %d\n",
(int) offsetof(struct info_clock, fudgeval1));
printf("offsetof(fudgeval2) = %d\n",
(int) offsetof(struct info_clock, fudgeval2));
printf("\n");
printf("sizeof(struct conf_fudge) = %d\n",
(int) sizeof(struct conf_fudge));
printf("offsetof(clockadr) = %d\n",
(int) offsetof(struct conf_fudge, clockadr));
printf("offsetof(which) = %d\n",
(int) offsetof(struct conf_fudge, which));
printf("offsetof(fudgetime) = %d\n",
(int) offsetof(struct conf_fudge, fudgetime));
printf("offsetof(fudgeval_flags) = %d\n",
(int) offsetof(struct conf_fudge, fudgeval_flags));
printf("\n");
printf("sizeof(struct info_clkbug) = %d\n",
(int) sizeof(struct info_clkbug));
printf("offsetof(clockadr) = %d\n",
(int) offsetof(struct info_clkbug, clockadr));
printf("offsetof(nvalues) = %d\n",
(int) offsetof(struct info_clkbug, nvalues));
printf("offsetof(ntimes) = %d\n",
(int) offsetof(struct info_clkbug, ntimes));
printf("offsetof(svalues) = %d\n",
(int) offsetof(struct info_clkbug, svalues));
printf("offsetof(stimes) = %d\n",
(int) offsetof(struct info_clkbug, stimes));
printf("offsetof(values) = %d\n",
(int) offsetof(struct info_clkbug, values));
printf("offsetof(times) = %d\n",
(int) offsetof(struct info_clkbug, times));
printf("\n");
printf("sizeof(struct info_kernel) = %d\n",
(int) sizeof(struct info_kernel));
printf("offsetof(offset) = %d\n",
(int) offsetof(struct info_kernel, offset));
printf("offsetof(freq) = %d\n",
(int) offsetof(struct info_kernel, freq));
printf("offsetof(maxerror) = %d\n",
(int) offsetof(struct info_kernel, maxerror));
printf("offsetof(esterror) = %d\n",
(int) offsetof(struct info_kernel, esterror));
printf("offsetof(status) = %d\n",
(int) offsetof(struct info_kernel, status));
printf("offsetof(shift) = %d\n",
(int) offsetof(struct info_kernel, shift));
printf("offsetof(constant) = %d\n",
(int) offsetof(struct info_kernel, constant));
printf("offsetof(precision) = %d\n",
(int) offsetof(struct info_kernel, precision));
printf("offsetof(tolerance) = %d\n",
(int) offsetof(struct info_kernel, tolerance));
printf("offsetof(ppsfreq) = %d\n",
(int) offsetof(struct info_kernel, ppsfreq));
printf("offsetof(jitter) = %d\n",
(int) offsetof(struct info_kernel, jitter));
printf("offsetof(stabil) = %d\n",
(int) offsetof(struct info_kernel, stabil));
printf("offsetof(jitcnt) = %d\n",
(int) offsetof(struct info_kernel, jitcnt));
printf("offsetof(calcnt) = %d\n",
(int) offsetof(struct info_kernel, calcnt));
printf("offsetof(errcnt) = %d\n",
(int) offsetof(struct info_kernel, errcnt));
printf("offsetof(stbcnt) = %d\n",
(int) offsetof(struct info_kernel, stbcnt));
printf("\n");
printf("sizeof(struct info_if_stats) = %d\n",
(int) sizeof(struct info_if_stats));
printf("offsetof(unaddr) = %d\n",
(int) offsetof(struct info_if_stats, unaddr));
printf("offsetof(unbcast) = %d\n",
(int) offsetof(struct info_if_stats, unbcast));
printf("offsetof(unmask) = %d\n",
(int) offsetof(struct info_if_stats, unmask));
printf("offsetof(v6_flag) = %d\n",
(int) offsetof(struct info_if_stats, v6_flag));
printf("offsetof(name) = %d\n",
(int) offsetof(struct info_if_stats, name));
printf("offsetof(flags) = %d\n",
(int) offsetof(struct info_if_stats, flags));
printf("offsetof(last_ttl) = %d\n",
(int) offsetof(struct info_if_stats, last_ttl));
printf("offsetof(num_mcast) = %d\n",
(int) offsetof(struct info_if_stats, num_mcast));
printf("offsetof(received) = %d\n",
(int) offsetof(struct info_if_stats, received));
printf("offsetof(sent) = %d\n",
(int) offsetof(struct info_if_stats, sent));
printf("offsetof(notsent) = %d\n",
(int) offsetof(struct info_if_stats, notsent));
printf("offsetof(uptime) = %d\n",
(int) offsetof(struct info_if_stats, uptime));
printf("offsetof(scopeid) = %d\n",
(int) offsetof(struct info_if_stats, scopeid));
printf("offsetof(ifindex) = %d\n",
(int) offsetof(struct info_if_stats, ifindex));
printf("offsetof(ifnum) = %d\n",
(int) offsetof(struct info_if_stats, ifnum));
printf("offsetof(peercnt) = %d\n",
(int) offsetof(struct info_if_stats, peercnt));
printf("offsetof(family) = %d\n",
(int) offsetof(struct info_if_stats, family));
printf("offsetof(ignore_packets) = %d\n",
(int) offsetof(struct info_if_stats, ignore_packets));
printf("offsetof(action) = %d\n",
(int) offsetof(struct info_if_stats, action));
printf("offsetof(_filler0) = %d\n",
(int) offsetof(struct info_if_stats, _filler0));
printf("\n");
printf("sizeof(struct info_dns_assoc) = %d\n",
(int) sizeof(struct info_dns_assoc));
printf("offsetof(peeraddr) = %d\n",
(int) offsetof(struct info_dns_assoc, peeraddr));
printf("offsetof(associd) = %d\n",
(int) offsetof(struct info_dns_assoc, associd));
printf("offsetof(hostname) = %d\n",
(int) offsetof(struct info_dns_assoc, hostname));
printf("\n");
diff --git a/usr.sbin/pciconf/pathnames.h b/usr.sbin/pciconf/pathnames.h
index c35c721aa838..7e8e562b94a1 100644
--- a/usr.sbin/pciconf/pathnames.h
+++ b/usr.sbin/pciconf/pathnames.h
@@ -1,6 +1,5 @@
-/* $FreeBSD$ */
#include <paths.h>
#define _PATH_DEVPCI "/dev/pci"
#define _PATH_PCIVDB "/usr/share/misc/pci_vendors"
#define _PATH_LPCIVDB _PATH_LOCALBASE "/share/pciids/pci.ids"
diff --git a/usr.sbin/route6d/route6d.c b/usr.sbin/route6d/route6d.c
index 7d873d4dfa40..6de680ec3a42 100644
--- a/usr.sbin/route6d/route6d.c
+++ b/usr.sbin/route6d/route6d.c
@@ -1,3584 +1,3583 @@
-/* $FreeBSD$ */
/* $KAME: route6d.c,v 1.104 2003/10/31 00:30:20 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef lint
static const char _rcsid[] = "$KAME: route6d.c,v 1.104 2003/10/31 00:30:20 itojun Exp $";
#endif
#include <sys/param.h>
#include <sys/file.h>
#include <sys/ioctl.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <sys/uio.h>
#include <arpa/inet.h>
#include <net/if.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/in_var.h>
#include <netinet/ip6.h>
#include <netinet/udp.h>
#include <err.h>
#include <errno.h>
#include <fnmatch.h>
#include <ifaddrs.h>
#include <netdb.h>
#ifdef HAVE_POLL_H
#include <poll.h>
#endif
#include <signal.h>
#include <stdio.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <time.h>
#include <unistd.h>
#include "route6d.h"
#define MAXFILTER 40
#define RT_DUMP_MAXRETRY 15
#ifdef DEBUG
#define INIT_INTERVAL6 6
#else
#define INIT_INTERVAL6 10 /* Wait to submit an initial riprequest */
#endif
/* alignment constraint for routing socket */
#define ROUNDUP(a) \
((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
struct ifc { /* Configuration of an interface */
TAILQ_ENTRY(ifc) ifc_next;
char ifc_name[IFNAMSIZ]; /* if name */
int ifc_index; /* if index */
int ifc_mtu; /* if mtu */
int ifc_metric; /* if metric */
u_int ifc_flags; /* flags */
short ifc_cflags; /* IFC_XXX */
struct in6_addr ifc_mylladdr; /* my link-local address */
struct sockaddr_in6 ifc_ripsin; /* rip multicast address */
TAILQ_HEAD(, ifac) ifc_ifac_head; /* list of AF_INET6 addrs */
TAILQ_HEAD(, iff) ifc_iff_head; /* list of filters */
int ifc_joined; /* joined to ff02::9 */
};
static TAILQ_HEAD(, ifc) ifc_head = TAILQ_HEAD_INITIALIZER(ifc_head);
struct ifac { /* Adddress associated to an interface */
TAILQ_ENTRY(ifac) ifac_next;
struct ifc *ifac_ifc; /* back pointer */
struct in6_addr ifac_addr; /* address */
struct in6_addr ifac_raddr; /* remote address, valid in p2p */
int ifac_scope_id; /* scope id */
int ifac_plen; /* prefix length */
};
struct iff { /* Filters for an interface */
TAILQ_ENTRY(iff) iff_next;
int iff_type;
struct in6_addr iff_addr;
int iff_plen;
};
static struct ifc **index2ifc;
static unsigned int nindex2ifc;
static struct ifc *loopifcp = NULL; /* pointing to loopback */
#ifdef HAVE_POLL_H
static struct pollfd set[2];
#else
static fd_set *sockvecp; /* vector to select() for receiving */
static fd_set *recvecp;
static int fdmasks;
static int maxfd; /* maximum fd for select() */
#endif
static int rtsock; /* the routing socket */
static int ripsock; /* socket to send/receive RIP datagram */
static struct rip6 *ripbuf; /* packet buffer for sending */
/*
* Maintain the routes in a linked list. When the number of the routes
* grows, somebody would like to introduce a hash based or a radix tree
* based structure. I believe the number of routes handled by RIP is
* limited and I don't have to manage a complex data structure, however.
*
* One of the major drawbacks of the linear linked list is the difficulty
* of representing the relationship between a couple of routes. This may
* be a significant problem when we have to support route aggregation with
* suppressing the specifics covered by the aggregate.
*/
struct riprt {
TAILQ_ENTRY(riprt) rrt_next; /* next destination */
struct riprt *rrt_same; /* same destination - future use */
struct netinfo6 rrt_info; /* network info */
struct in6_addr rrt_gw; /* gateway */
u_long rrt_flags; /* kernel routing table flags */
u_long rrt_rflags; /* route6d routing table flags */
time_t rrt_t; /* when the route validated */
int rrt_index; /* ifindex from which this route got */
};
static TAILQ_HEAD(, riprt) riprt_head = TAILQ_HEAD_INITIALIZER(riprt_head);
static int dflag = 0; /* debug flag */
static int qflag = 0; /* quiet flag */
static int nflag = 0; /* don't update kernel routing table */
static int aflag = 0; /* age out even the statically defined routes */
static int hflag = 0; /* don't split horizon */
static int lflag = 0; /* exchange site local routes */
static int Pflag = 0; /* don't age out routes with RTF_PROTO[123] */
static int Qflag = RTF_PROTO2; /* set RTF_PROTO[123] flag to routes by RIPng */
static int sflag = 0; /* announce static routes w/ split horizon */
static int Sflag = 0; /* announce static routes to every interface */
static unsigned long routetag = 0; /* route tag attached on originating case */
static char *filter[MAXFILTER];
static int filtertype[MAXFILTER];
static int nfilter = 0;
static pid_t pid;
static struct sockaddr_storage ripsin;
static int interval = 1;
static time_t nextalarm = 0;
#if 0
static time_t sup_trig_update = 0;
#endif
static FILE *rtlog = NULL;
static int logopened = 0;
static int seq = 0;
static volatile sig_atomic_t seenalrm;
static volatile sig_atomic_t seenquit;
static volatile sig_atomic_t seenusr1;
#define RRTF_AGGREGATE 0x08000000
#define RRTF_NOADVERTISE 0x10000000
#define RRTF_NH_NOT_LLADDR 0x20000000
#define RRTF_SENDANYWAY 0x40000000
#define RRTF_CHANGED 0x80000000
static void sighandler(int);
static void ripalarm(void);
static void riprecv(void);
static void ripsend(struct ifc *, struct sockaddr_in6 *, int);
static int out_filter(struct riprt *, struct ifc *);
static void init(void);
static void ifconfig(void);
static int ifconfig1(const char *, const struct sockaddr *, struct ifc *, int);
static void rtrecv(void);
static int rt_del(const struct sockaddr_in6 *, const struct sockaddr_in6 *,
const struct sockaddr_in6 *);
static int rt_deladdr(struct ifc *, const struct sockaddr_in6 *,
const struct sockaddr_in6 *);
static void filterconfig(void);
static int getifmtu(int);
static const char *rttypes(struct rt_msghdr *);
static const char *rtflags(struct rt_msghdr *);
static const char *ifflags(int);
static int ifrt(struct ifc *, int);
static void ifrt_p2p(struct ifc *, int);
static void applyplen(struct in6_addr *, int);
static void ifrtdump(int);
static void ifdump(int);
static void ifdump0(FILE *, const struct ifc *);
static void ifremove(int);
static void rtdump(int);
static void rt_entry(struct rt_msghdr *, int);
static void rtdexit(void);
static void riprequest(struct ifc *, struct netinfo6 *, int,
struct sockaddr_in6 *);
static void ripflush(struct ifc *, struct sockaddr_in6 *, int, struct netinfo6 *np);
static void sendrequest(struct ifc *);
static int sin6mask2len(const struct sockaddr_in6 *);
static int mask2len(const struct in6_addr *, int);
static int sendpacket(struct sockaddr_in6 *, int);
static int addroute(struct riprt *, const struct in6_addr *, struct ifc *);
static int delroute(struct netinfo6 *, struct in6_addr *);
#if 0
static struct in6_addr *getroute(struct netinfo6 *, struct in6_addr *);
#endif
static void krtread(int);
static int tobeadv(struct riprt *, struct ifc *);
static char *allocopy(char *);
static char *hms(void);
static const char *inet6_n2p(const struct in6_addr *);
static struct ifac *ifa_match(const struct ifc *, const struct in6_addr *, int);
static struct in6_addr *plen2mask(int);
static struct riprt *rtsearch(struct netinfo6 *);
static int ripinterval(int);
#if 0
static time_t ripsuptrig(void);
#endif
static void fatal(const char *, ...)
__attribute__((__format__(__printf__, 1, 2)));
static void trace(int, const char *, ...)
__attribute__((__format__(__printf__, 2, 3)));
static void tracet(int, const char *, ...)
__attribute__((__format__(__printf__, 2, 3)));
static struct ifc *ifc_find(char *);
static struct iff *iff_find(struct ifc *, int);
static void setindex2ifc(int, struct ifc *);
#define MALLOC(type) ((type *)malloc(sizeof(type)))
#define IFIL_TYPE_ANY 0x0
#define IFIL_TYPE_A 'A'
#define IFIL_TYPE_N 'N'
#define IFIL_TYPE_T 'T'
#define IFIL_TYPE_O 'O'
#define IFIL_TYPE_L 'L'
int
main(int argc, char *argv[])
{
int ch;
int error = 0;
unsigned long proto;
struct ifc *ifcp;
sigset_t mask, omask;
const char *pidfile = ROUTE6D_PID;
FILE *pidfh;
char *progname;
char *ep;
progname = strrchr(*argv, '/');
if (progname)
progname++;
else
progname = *argv;
pid = getpid();
while ((ch = getopt(argc, argv, "A:N:O:R:T:L:t:adDhlnp:P:Q:qsS")) != -1) {
switch (ch) {
case 'A':
case 'N':
case 'O':
case 'T':
case 'L':
if (nfilter >= MAXFILTER) {
fatal("Exceeds MAXFILTER");
/*NOTREACHED*/
}
filtertype[nfilter] = ch;
filter[nfilter++] = allocopy(optarg);
break;
case 't':
ep = NULL;
routetag = strtoul(optarg, &ep, 0);
if (!ep || *ep != '\0' || (routetag & ~0xffff) != 0) {
fatal("invalid route tag");
/*NOTREACHED*/
}
break;
case 'p':
pidfile = optarg;
break;
case 'P':
ep = NULL;
proto = strtoul(optarg, &ep, 0);
if (!ep || *ep != '\0' || 3 < proto) {
fatal("invalid P flag");
/*NOTREACHED*/
}
if (proto == 0)
Pflag = 0;
if (proto == 1)
Pflag |= RTF_PROTO1;
if (proto == 2)
Pflag |= RTF_PROTO2;
if (proto == 3)
Pflag |= RTF_PROTO3;
break;
case 'Q':
ep = NULL;
proto = strtoul(optarg, &ep, 0);
if (!ep || *ep != '\0' || 3 < proto) {
fatal("invalid Q flag");
/*NOTREACHED*/
}
if (proto == 0)
Qflag = 0;
if (proto == 1)
Qflag |= RTF_PROTO1;
if (proto == 2)
Qflag |= RTF_PROTO2;
if (proto == 3)
Qflag |= RTF_PROTO3;
break;
case 'R':
if ((rtlog = fopen(optarg, "w")) == NULL) {
fatal("Can not write to routelog");
/*NOTREACHED*/
}
break;
#define FLAG(c, flag, n) case c: do { flag = n; break; } while(0)
FLAG('a', aflag, 1); break;
FLAG('d', dflag, 1); break;
FLAG('D', dflag, 2); break;
FLAG('h', hflag, 1); break;
FLAG('l', lflag, 1); break;
FLAG('n', nflag, 1); break;
FLAG('q', qflag, 1); break;
FLAG('s', sflag, 1); break;
FLAG('S', Sflag, 1); break;
#undef FLAG
default:
fatal("Invalid option specified, terminating");
/*NOTREACHED*/
}
}
argc -= optind;
argv += optind;
if (argc > 0) {
fatal("bogus extra arguments");
/*NOTREACHED*/
}
if (geteuid()) {
nflag = 1;
fprintf(stderr, "No kernel update is allowed\n");
}
if (dflag == 0) {
if (daemon(0, 0) < 0) {
fatal("daemon");
/*NOTREACHED*/
}
}
openlog(progname, LOG_NDELAY|LOG_PID, LOG_DAEMON);
logopened++;
if ((ripbuf = (struct rip6 *)malloc(RIP6_MAXMTU)) == NULL)
fatal("malloc");
memset(ripbuf, 0, RIP6_MAXMTU);
ripbuf->rip6_cmd = RIP6_RESPONSE;
ripbuf->rip6_vers = RIP6_VERSION;
ripbuf->rip6_res1[0] = 0;
ripbuf->rip6_res1[1] = 0;
init();
ifconfig();
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (ifcp->ifc_index < 0) {
fprintf(stderr, "No ifindex found at %s "
"(no link-local address?)\n", ifcp->ifc_name);
error++;
}
}
if (error)
exit(1);
if (loopifcp == NULL) {
fatal("No loopback found");
/*NOTREACHED*/
}
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
ifrt(ifcp, 0);
}
filterconfig();
krtread(0);
if (dflag)
ifrtdump(0);
pid = getpid();
if ((pidfh = fopen(pidfile, "w")) != NULL) {
fprintf(pidfh, "%d\n", pid);
fclose(pidfh);
}
if ((ripbuf = (struct rip6 *)malloc(RIP6_MAXMTU)) == NULL) {
fatal("malloc");
/*NOTREACHED*/
}
memset(ripbuf, 0, RIP6_MAXMTU);
ripbuf->rip6_cmd = RIP6_RESPONSE;
ripbuf->rip6_vers = RIP6_VERSION;
ripbuf->rip6_res1[0] = 0;
ripbuf->rip6_res1[1] = 0;
if (signal(SIGALRM, sighandler) == SIG_ERR ||
signal(SIGQUIT, sighandler) == SIG_ERR ||
signal(SIGTERM, sighandler) == SIG_ERR ||
signal(SIGUSR1, sighandler) == SIG_ERR ||
signal(SIGHUP, sighandler) == SIG_ERR ||
signal(SIGINT, sighandler) == SIG_ERR) {
fatal("signal");
/*NOTREACHED*/
}
/*
* To avoid rip packet congestion (not on a cable but in this
* process), wait for a moment to send the first RIP6_RESPONSE
* packets.
*/
alarm(ripinterval(INIT_INTERVAL6));
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (iff_find(ifcp, IFIL_TYPE_N) != NULL)
continue;
if (ifcp->ifc_index > 0 && (ifcp->ifc_flags & IFF_UP))
sendrequest(ifcp);
}
syslog(LOG_INFO, "**** Started ****");
sigemptyset(&mask);
sigaddset(&mask, SIGALRM);
while (1) {
if (seenalrm) {
ripalarm();
seenalrm = 0;
continue;
}
if (seenquit) {
rtdexit();
seenquit = 0;
continue;
}
if (seenusr1) {
ifrtdump(SIGUSR1);
seenusr1 = 0;
continue;
}
#ifdef HAVE_POLL_H
switch (poll(set, 2, INFTIM))
#else
memcpy(recvecp, sockvecp, fdmasks);
switch (select(maxfd + 1, recvecp, 0, 0, 0))
#endif
{
case -1:
if (errno != EINTR) {
fatal("select");
/*NOTREACHED*/
}
continue;
case 0:
continue;
default:
#ifdef HAVE_POLL_H
if (set[0].revents & POLLIN)
#else
if (FD_ISSET(ripsock, recvecp))
#endif
{
sigprocmask(SIG_BLOCK, &mask, &omask);
riprecv();
sigprocmask(SIG_SETMASK, &omask, NULL);
}
#ifdef HAVE_POLL_H
if (set[1].revents & POLLIN)
#else
if (FD_ISSET(rtsock, recvecp))
#endif
{
sigprocmask(SIG_BLOCK, &mask, &omask);
rtrecv();
sigprocmask(SIG_SETMASK, &omask, NULL);
}
}
}
}
static void
sighandler(int signo)
{
switch (signo) {
case SIGALRM:
seenalrm++;
break;
case SIGQUIT:
case SIGTERM:
seenquit++;
break;
case SIGUSR1:
case SIGHUP:
case SIGINT:
seenusr1++;
break;
}
}
/*
* gracefully exits after resetting sockopts.
*/
/* ARGSUSED */
static void
rtdexit(void)
{
struct riprt *rrt;
alarm(0);
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (rrt->rrt_rflags & RRTF_AGGREGATE) {
delroute(&rrt->rrt_info, &rrt->rrt_gw);
}
}
close(ripsock);
close(rtsock);
syslog(LOG_INFO, "**** Terminated ****");
closelog();
exit(1);
}
/*
* Called periodically:
* 1. age out the learned route. remove it if necessary.
* 2. submit RIP6_RESPONSE packets.
* Invoked in every SUPPLY_INTERVAL6 (30) seconds. I believe we don't have
* to invoke this function in every 1 or 5 or 10 seconds only to age the
* routes more precisely.
*/
/* ARGSUSED */
static void
ripalarm(void)
{
struct ifc *ifcp;
struct riprt *rrt, *rrt_tmp;
time_t t_lifetime, t_holddown;
/* age the RIP routes */
t_lifetime = time(NULL) - RIP_LIFETIME;
t_holddown = t_lifetime - RIP_HOLDDOWN;
TAILQ_FOREACH_SAFE(rrt, &riprt_head, rrt_next, rrt_tmp) {
if (rrt->rrt_t == 0)
continue;
else if (rrt->rrt_t < t_holddown) {
TAILQ_REMOVE(&riprt_head, rrt, rrt_next);
delroute(&rrt->rrt_info, &rrt->rrt_gw);
free(rrt);
} else if (rrt->rrt_t < t_lifetime)
rrt->rrt_info.rip6_metric = HOPCNT_INFINITY6;
}
/* Supply updates */
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (ifcp->ifc_index > 0 && (ifcp->ifc_flags & IFF_UP))
ripsend(ifcp, &ifcp->ifc_ripsin, 0);
}
alarm(ripinterval(SUPPLY_INTERVAL6));
}
static void
init(void)
{
int error;
const int int0 = 0, int1 = 1, int255 = 255;
struct addrinfo hints, *res;
char port[NI_MAXSERV];
TAILQ_INIT(&ifc_head);
nindex2ifc = 0; /*initial guess*/
index2ifc = NULL;
snprintf(port, sizeof(port), "%u", RIP6_PORT);
memset(&hints, 0, sizeof(hints));
hints.ai_family = PF_INET6;
hints.ai_socktype = SOCK_DGRAM;
hints.ai_protocol = IPPROTO_UDP;
hints.ai_flags = AI_PASSIVE;
error = getaddrinfo(NULL, port, &hints, &res);
if (error) {
fatal("%s", gai_strerror(error));
/*NOTREACHED*/
}
if (res->ai_next) {
fatal(":: resolved to multiple address");
/*NOTREACHED*/
}
ripsock = socket(res->ai_family, res->ai_socktype, res->ai_protocol);
if (ripsock < 0) {
fatal("rip socket");
/*NOTREACHED*/
}
#ifdef IPV6_V6ONLY
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_V6ONLY,
&int1, sizeof(int1)) < 0) {
fatal("rip IPV6_V6ONLY");
/*NOTREACHED*/
}
#endif
if (bind(ripsock, res->ai_addr, res->ai_addrlen) < 0) {
fatal("rip bind");
/*NOTREACHED*/
}
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_MULTICAST_HOPS,
&int255, sizeof(int255)) < 0) {
fatal("rip IPV6_MULTICAST_HOPS");
/*NOTREACHED*/
}
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_MULTICAST_LOOP,
&int0, sizeof(int0)) < 0) {
fatal("rip IPV6_MULTICAST_LOOP");
/*NOTREACHED*/
}
#ifdef IPV6_RECVPKTINFO
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_RECVPKTINFO,
&int1, sizeof(int1)) < 0) {
fatal("rip IPV6_RECVPKTINFO");
/*NOTREACHED*/
}
#else /* old adv. API */
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_PKTINFO,
&int1, sizeof(int1)) < 0) {
fatal("rip IPV6_PKTINFO");
/*NOTREACHED*/
}
#endif
#ifdef IPV6_RECVPKTINFO
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_RECVHOPLIMIT,
&int1, sizeof(int1)) < 0) {
fatal("rip IPV6_RECVHOPLIMIT");
/*NOTREACHED*/
}
#else /* old adv. API */
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_HOPLIMIT,
&int1, sizeof(int1)) < 0) {
fatal("rip IPV6_HOPLIMIT");
/*NOTREACHED*/
}
#endif
freeaddrinfo(res);
memset(&hints, 0, sizeof(hints));
hints.ai_family = PF_INET6;
hints.ai_socktype = SOCK_DGRAM;
hints.ai_protocol = IPPROTO_UDP;
error = getaddrinfo(RIP6_DEST, port, &hints, &res);
if (error) {
fatal("%s", gai_strerror(error));
/*NOTREACHED*/
}
if (res->ai_next) {
fatal("%s resolved to multiple address", RIP6_DEST);
/*NOTREACHED*/
}
memcpy(&ripsin, res->ai_addr, res->ai_addrlen);
freeaddrinfo(res);
#ifdef HAVE_POLL_H
set[0].fd = ripsock;
set[0].events = POLLIN;
#else
maxfd = ripsock;
#endif
if (nflag == 0) {
if ((rtsock = socket(PF_ROUTE, SOCK_RAW, 0)) < 0) {
fatal("route socket");
/*NOTREACHED*/
}
#ifdef HAVE_POLL_H
set[1].fd = rtsock;
set[1].events = POLLIN;
#else
if (rtsock > maxfd)
maxfd = rtsock;
#endif
} else {
#ifdef HAVE_POLL_H
set[1].fd = -1;
#else
rtsock = -1; /*just for safety */
#endif
}
#ifndef HAVE_POLL_H
fdmasks = howmany(maxfd + 1, NFDBITS) * sizeof(fd_mask);
if ((sockvecp = malloc(fdmasks)) == NULL) {
fatal("malloc");
/*NOTREACHED*/
}
if ((recvecp = malloc(fdmasks)) == NULL) {
fatal("malloc");
/*NOTREACHED*/
}
memset(sockvecp, 0, fdmasks);
FD_SET(ripsock, sockvecp);
if (rtsock >= 0)
FD_SET(rtsock, sockvecp);
#endif
}
#define RIPSIZE(n) \
(sizeof(struct rip6) + ((n)-1) * sizeof(struct netinfo6))
/*
* ripflush flushes the rip datagram stored in the rip buffer
*/
static void
ripflush(struct ifc *ifcp, struct sockaddr_in6 *sin6, int nrt, struct netinfo6 *np)
{
int i;
int error;
if (ifcp)
tracet(1, "Send(%s): info(%d) to %s.%d\n",
ifcp->ifc_name, nrt,
inet6_n2p(&sin6->sin6_addr), ntohs(sin6->sin6_port));
else
tracet(1, "Send: info(%d) to %s.%d\n",
nrt, inet6_n2p(&sin6->sin6_addr), ntohs(sin6->sin6_port));
if (dflag >= 2) {
np = ripbuf->rip6_nets;
for (i = 0; i < nrt; i++, np++) {
if (np->rip6_metric == NEXTHOP_METRIC) {
if (IN6_IS_ADDR_UNSPECIFIED(&np->rip6_dest))
trace(2, " NextHop reset");
else {
trace(2, " NextHop %s",
inet6_n2p(&np->rip6_dest));
}
} else {
trace(2, " %s/%d[%d]",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, np->rip6_metric);
}
if (np->rip6_tag) {
trace(2, " tag=0x%04x",
ntohs(np->rip6_tag) & 0xffff);
}
trace(2, "\n");
}
}
error = sendpacket(sin6, RIPSIZE(nrt));
if (error == EAFNOSUPPORT) {
/* Protocol not supported */
if (ifcp != NULL) {
tracet(1, "Could not send info to %s (%s): "
"set IFF_UP to 0\n",
ifcp->ifc_name,
inet6_n2p(&ifcp->ifc_ripsin.sin6_addr));
/* As if down for AF_INET6 */
ifcp->ifc_flags &= ~IFF_UP;
} else {
tracet(1, "Could not send info to %s\n",
inet6_n2p(&sin6->sin6_addr));
}
}
}
/*
* Generate RIP6_RESPONSE packets and send them.
*/
static void
ripsend(struct ifc *ifcp, struct sockaddr_in6 *sin6, int flag)
{
struct riprt *rrt;
struct in6_addr *nh; /* next hop */
struct netinfo6 *np;
int maxrte;
int nrt;
if (qflag)
return;
if (ifcp == NULL) {
/*
* Request from non-link local address is not
* a regular route6d update.
*/
maxrte = (IFMINMTU - sizeof(struct ip6_hdr) -
sizeof(struct udphdr) -
sizeof(struct rip6) + sizeof(struct netinfo6)) /
sizeof(struct netinfo6);
nh = NULL;
nrt = 0;
np = ripbuf->rip6_nets;
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (rrt->rrt_rflags & RRTF_NOADVERTISE)
continue;
/* Put the route to the buffer */
*np = rrt->rrt_info;
np++; nrt++;
if (nrt == maxrte) {
ripflush(NULL, sin6, nrt, np);
nh = NULL;
nrt = 0;
np = ripbuf->rip6_nets;
}
}
if (nrt) /* Send last packet */
ripflush(NULL, sin6, nrt, np);
return;
}
if ((flag & RRTF_SENDANYWAY) == 0 &&
(qflag || (ifcp->ifc_flags & IFF_LOOPBACK)))
return;
/* -N: no use */
if (iff_find(ifcp, IFIL_TYPE_N) != NULL)
return;
/* -T: generate default route only */
if (iff_find(ifcp, IFIL_TYPE_T) != NULL) {
struct netinfo6 rrt_info;
memset(&rrt_info, 0, sizeof(struct netinfo6));
rrt_info.rip6_dest = in6addr_any;
rrt_info.rip6_plen = 0;
rrt_info.rip6_metric = 1;
rrt_info.rip6_metric += ifcp->ifc_metric;
rrt_info.rip6_tag = htons(routetag & 0xffff);
np = ripbuf->rip6_nets;
*np = rrt_info;
nrt = 1;
ripflush(ifcp, sin6, nrt, np);
return;
}
maxrte = (ifcp->ifc_mtu - sizeof(struct ip6_hdr) -
sizeof(struct udphdr) -
sizeof(struct rip6) + sizeof(struct netinfo6)) /
sizeof(struct netinfo6);
nrt = 0; np = ripbuf->rip6_nets; nh = NULL;
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (rrt->rrt_rflags & RRTF_NOADVERTISE)
continue;
/* Need to check filter here */
if (out_filter(rrt, ifcp) == 0)
continue;
/* Check split horizon and other conditions */
if (tobeadv(rrt, ifcp) == 0)
continue;
/* Only considers the routes with flag if specified */
if ((flag & RRTF_CHANGED) &&
(rrt->rrt_rflags & RRTF_CHANGED) == 0)
continue;
/* Check nexthop */
if (rrt->rrt_index == ifcp->ifc_index &&
!IN6_IS_ADDR_UNSPECIFIED(&rrt->rrt_gw) &&
(rrt->rrt_rflags & RRTF_NH_NOT_LLADDR) == 0) {
if (nh == NULL || !IN6_ARE_ADDR_EQUAL(nh, &rrt->rrt_gw)) {
if (nrt == maxrte - 2) {
ripflush(ifcp, sin6, nrt, np);
nh = NULL;
nrt = 0;
np = ripbuf->rip6_nets;
}
np->rip6_dest = rrt->rrt_gw;
np->rip6_plen = 0;
np->rip6_tag = 0;
np->rip6_metric = NEXTHOP_METRIC;
nh = &rrt->rrt_gw;
np++; nrt++;
}
} else if (nh && (rrt->rrt_index != ifcp->ifc_index ||
!IN6_ARE_ADDR_EQUAL(nh, &rrt->rrt_gw) ||
rrt->rrt_rflags & RRTF_NH_NOT_LLADDR)) {
/* Reset nexthop */
if (nrt == maxrte - 2) {
ripflush(ifcp, sin6, nrt, np);
nh = NULL;
nrt = 0;
np = ripbuf->rip6_nets;
}
memset(np, 0, sizeof(struct netinfo6));
np->rip6_metric = NEXTHOP_METRIC;
nh = NULL;
np++; nrt++;
}
/* Put the route to the buffer */
*np = rrt->rrt_info;
np++; nrt++;
if (nrt == maxrte) {
ripflush(ifcp, sin6, nrt, np);
nh = NULL;
nrt = 0;
np = ripbuf->rip6_nets;
}
}
if (nrt) /* Send last packet */
ripflush(ifcp, sin6, nrt, np);
}
/*
* outbound filter logic, per-route/interface.
*/
static int
out_filter(struct riprt *rrt, struct ifc *ifcp)
{
struct iff *iffp;
struct in6_addr ia;
int ok;
/*
* -A: filter out less specific routes, if we have aggregated
* route configured.
*/
TAILQ_FOREACH(iffp, &ifcp->ifc_iff_head, iff_next) {
if (iffp->iff_type != 'A')
continue;
if (rrt->rrt_info.rip6_plen <= iffp->iff_plen)
continue;
ia = rrt->rrt_info.rip6_dest;
applyplen(&ia, iffp->iff_plen);
if (IN6_ARE_ADDR_EQUAL(&ia, &iffp->iff_addr))
return 0;
}
/*
* if it is an aggregated route, advertise it only to the
* interfaces specified on -A.
*/
if ((rrt->rrt_rflags & RRTF_AGGREGATE) != 0) {
ok = 0;
TAILQ_FOREACH(iffp, &ifcp->ifc_iff_head, iff_next) {
if (iffp->iff_type != 'A')
continue;
if (rrt->rrt_info.rip6_plen == iffp->iff_plen &&
IN6_ARE_ADDR_EQUAL(&rrt->rrt_info.rip6_dest,
&iffp->iff_addr)) {
ok = 1;
break;
}
}
if (!ok)
return 0;
}
/*
* -O: advertise only if prefix matches the configured prefix.
*/
if (iff_find(ifcp, IFIL_TYPE_O) != NULL) {
ok = 0;
TAILQ_FOREACH(iffp, &ifcp->ifc_iff_head, iff_next) {
if (iffp->iff_type != 'O')
continue;
if (rrt->rrt_info.rip6_plen < iffp->iff_plen)
continue;
ia = rrt->rrt_info.rip6_dest;
applyplen(&ia, iffp->iff_plen);
if (IN6_ARE_ADDR_EQUAL(&ia, &iffp->iff_addr)) {
ok = 1;
break;
}
}
if (!ok)
return 0;
}
/* the prefix should be advertised */
return 1;
}
/*
* Determine if the route is to be advertised on the specified interface.
* It checks options specified in the arguments and the split horizon rule.
*/
static int
tobeadv(struct riprt *rrt, struct ifc *ifcp)
{
/* Special care for static routes */
if (rrt->rrt_flags & RTF_STATIC) {
/* XXX don't advertise reject/blackhole routes */
if (rrt->rrt_flags & (RTF_REJECT | RTF_BLACKHOLE))
return 0;
if (Sflag) /* Yes, advertise it anyway */
return 1;
if (sflag && rrt->rrt_index != ifcp->ifc_index)
return 1;
return 0;
}
/* Regular split horizon */
if (hflag == 0 && rrt->rrt_index == ifcp->ifc_index)
return 0;
return 1;
}
/*
* Send a rip packet actually.
*/
static int
sendpacket(struct sockaddr_in6 *sin6, int len)
{
struct msghdr m;
struct cmsghdr *cm;
struct iovec iov[2];
struct in6_pktinfo *pi;
u_char cmsgbuf[256];
int idx;
struct sockaddr_in6 sincopy;
/* do not overwrite the given sin */
sincopy = *sin6;
sin6 = &sincopy;
if (IN6_IS_ADDR_LINKLOCAL(&sin6->sin6_addr) ||
IN6_IS_ADDR_MULTICAST(&sin6->sin6_addr))
idx = sin6->sin6_scope_id;
else
idx = 0;
m.msg_name = (caddr_t)sin6;
m.msg_namelen = sizeof(*sin6);
iov[0].iov_base = (caddr_t)ripbuf;
iov[0].iov_len = len;
m.msg_iov = iov;
m.msg_iovlen = 1;
m.msg_flags = 0;
if (!idx) {
m.msg_control = NULL;
m.msg_controllen = 0;
} else {
memset(cmsgbuf, 0, sizeof(cmsgbuf));
cm = (struct cmsghdr *)(void *)cmsgbuf;
m.msg_control = (caddr_t)cm;
m.msg_controllen = CMSG_SPACE(sizeof(struct in6_pktinfo));
cm->cmsg_len = CMSG_LEN(sizeof(struct in6_pktinfo));
cm->cmsg_level = IPPROTO_IPV6;
cm->cmsg_type = IPV6_PKTINFO;
pi = (struct in6_pktinfo *)(void *)CMSG_DATA(cm);
memset(&pi->ipi6_addr, 0, sizeof(pi->ipi6_addr)); /*::*/
pi->ipi6_ifindex = idx;
}
if (sendmsg(ripsock, &m, 0 /*MSG_DONTROUTE*/) < 0) {
trace(1, "sendmsg: %s\n", strerror(errno));
return errno;
}
return 0;
}
/*
* Receive and process RIP packets. Update the routes/kernel forwarding
* table if necessary.
*/
static void
riprecv(void)
{
struct ifc *ifcp, *ic;
struct sockaddr_in6 fsock;
struct in6_addr nh; /* next hop */
struct rip6 *rp;
struct netinfo6 *np, *nq;
struct riprt *rrt;
ssize_t len, nn;
unsigned int need_trigger, idx;
char buf[4 * RIP6_MAXMTU];
time_t t;
struct msghdr m;
struct cmsghdr *cm;
struct iovec iov[2];
u_char cmsgbuf[256];
struct in6_pktinfo *pi = NULL;
int *hlimp = NULL;
struct iff *iffp;
struct in6_addr ia;
int ok;
time_t t_half_lifetime;
need_trigger = 0;
m.msg_name = (caddr_t)&fsock;
m.msg_namelen = sizeof(fsock);
iov[0].iov_base = (caddr_t)buf;
iov[0].iov_len = sizeof(buf);
m.msg_iov = iov;
m.msg_iovlen = 1;
cm = (struct cmsghdr *)(void *)cmsgbuf;
m.msg_control = (caddr_t)cm;
m.msg_controllen = sizeof(cmsgbuf);
m.msg_flags = 0;
if ((len = recvmsg(ripsock, &m, 0)) < 0) {
fatal("recvmsg");
/*NOTREACHED*/
}
idx = 0;
for (cm = (struct cmsghdr *)CMSG_FIRSTHDR(&m);
cm;
cm = (struct cmsghdr *)CMSG_NXTHDR(&m, cm)) {
if (cm->cmsg_level != IPPROTO_IPV6)
continue;
switch (cm->cmsg_type) {
case IPV6_PKTINFO:
if (cm->cmsg_len != CMSG_LEN(sizeof(*pi))) {
trace(1,
"invalid cmsg length for IPV6_PKTINFO\n");
return;
}
pi = (struct in6_pktinfo *)(void *)CMSG_DATA(cm);
idx = pi->ipi6_ifindex;
break;
case IPV6_HOPLIMIT:
if (cm->cmsg_len != CMSG_LEN(sizeof(int))) {
trace(1,
"invalid cmsg length for IPV6_HOPLIMIT\n");
return;
}
hlimp = (int *)(void *)CMSG_DATA(cm);
break;
}
}
if ((size_t)len < sizeof(struct rip6)) {
trace(1, "Packet too short\n");
return;
}
if (pi == NULL || hlimp == NULL) {
/*
* This can happen when the kernel failed to allocate memory
* for the ancillary data. Although we might be able to handle
* some cases without this info, those are minor and not so
* important, so it's better to discard the packet for safer
* operation.
*/
trace(1, "IPv6 packet information cannot be retrieved\n");
return;
}
nh = fsock.sin6_addr;
nn = (len - sizeof(struct rip6) + sizeof(struct netinfo6)) /
sizeof(struct netinfo6);
rp = (struct rip6 *)(void *)buf;
np = rp->rip6_nets;
if (rp->rip6_vers != RIP6_VERSION) {
trace(1, "Incorrect RIP version %d\n", rp->rip6_vers);
return;
}
if (rp->rip6_cmd == RIP6_REQUEST) {
if (idx && idx < nindex2ifc) {
ifcp = index2ifc[idx];
riprequest(ifcp, np, nn, &fsock);
} else {
riprequest(NULL, np, nn, &fsock);
}
return;
}
if (!IN6_IS_ADDR_LINKLOCAL(&fsock.sin6_addr)) {
trace(1, "Response from non-ll addr: %s\n",
inet6_n2p(&fsock.sin6_addr));
return; /* Ignore packets from non-link-local addr */
}
if (ntohs(fsock.sin6_port) != RIP6_PORT) {
trace(1, "Response from non-rip port from %s\n",
inet6_n2p(&fsock.sin6_addr));
return;
}
if (IN6_IS_ADDR_MULTICAST(&pi->ipi6_addr) && *hlimp != 255) {
trace(1,
"Response packet with a smaller hop limit (%d) from %s\n",
*hlimp, inet6_n2p(&fsock.sin6_addr));
return;
}
/*
* Further validation: since this program does not send off-link
* requests, an incoming response must always come from an on-link
* node. Although this is normally ensured by the source address
* check above, it may not 100% be safe because there are router
* implementations that (invalidly) allow a packet with a link-local
* source address to be forwarded to a different link.
* So we also check whether the destination address is a link-local
* address or the hop limit is 255. Note that RFC2080 does not require
* the specific hop limit for a unicast response, so we cannot assume
* the limitation.
*/
if (!IN6_IS_ADDR_LINKLOCAL(&pi->ipi6_addr) && *hlimp != 255) {
trace(1,
"Response packet possibly from an off-link node: "
"from %s to %s hlim=%d\n",
inet6_n2p(&fsock.sin6_addr),
inet6_n2p(&pi->ipi6_addr), *hlimp);
return;
}
idx = fsock.sin6_scope_id;
ifcp = (idx < nindex2ifc) ? index2ifc[idx] : NULL;
if (!ifcp) {
trace(1, "Packets to unknown interface index %d\n", idx);
return; /* Ignore it */
}
if (IN6_ARE_ADDR_EQUAL(&ifcp->ifc_mylladdr, &fsock.sin6_addr))
return; /* The packet is from me; ignore */
if (rp->rip6_cmd != RIP6_RESPONSE) {
trace(1, "Invalid command %d\n", rp->rip6_cmd);
return;
}
/* -N: no use */
if (iff_find(ifcp, IFIL_TYPE_N) != NULL)
return;
tracet(1, "Recv(%s): from %s.%d info(%zd)\n",
ifcp->ifc_name, inet6_n2p(&nh), ntohs(fsock.sin6_port), nn);
t = time(NULL);
t_half_lifetime = t - (RIP_LIFETIME/2);
for (; nn; nn--, np++) {
if (np->rip6_metric == NEXTHOP_METRIC) {
/* modify neighbor address */
if (IN6_IS_ADDR_LINKLOCAL(&np->rip6_dest)) {
nh = np->rip6_dest;
trace(1, "\tNexthop: %s\n", inet6_n2p(&nh));
} else if (IN6_IS_ADDR_UNSPECIFIED(&np->rip6_dest)) {
nh = fsock.sin6_addr;
trace(1, "\tNexthop: %s\n", inet6_n2p(&nh));
} else {
nh = fsock.sin6_addr;
trace(1, "\tInvalid Nexthop: %s\n",
inet6_n2p(&np->rip6_dest));
}
continue;
}
if (IN6_IS_ADDR_MULTICAST(&np->rip6_dest)) {
trace(1, "\tMulticast netinfo6: %s/%d [%d]\n",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, np->rip6_metric);
continue;
}
if (IN6_IS_ADDR_LOOPBACK(&np->rip6_dest)) {
trace(1, "\tLoopback netinfo6: %s/%d [%d]\n",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, np->rip6_metric);
continue;
}
if (IN6_IS_ADDR_LINKLOCAL(&np->rip6_dest)) {
trace(1, "\tLink Local netinfo6: %s/%d [%d]\n",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, np->rip6_metric);
continue;
}
/* may need to pass sitelocal prefix in some case, however*/
if (IN6_IS_ADDR_SITELOCAL(&np->rip6_dest) && !lflag) {
trace(1, "\tSite Local netinfo6: %s/%d [%d]\n",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, np->rip6_metric);
continue;
}
trace(2, "\tnetinfo6: %s/%d [%d]",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, np->rip6_metric);
if (np->rip6_tag)
trace(2, " tag=0x%04x", ntohs(np->rip6_tag) & 0xffff);
if (dflag >= 2) {
ia = np->rip6_dest;
applyplen(&ia, np->rip6_plen);
if (!IN6_ARE_ADDR_EQUAL(&ia, &np->rip6_dest))
trace(2, " [junk outside prefix]");
}
/*
* -L: listen only if the prefix matches the configuration
*/
ok = 1; /* if there's no L filter, it is ok */
TAILQ_FOREACH(iffp, &ifcp->ifc_iff_head, iff_next) {
if (iffp->iff_type != IFIL_TYPE_L)
continue;
ok = 0;
if (np->rip6_plen < iffp->iff_plen)
continue;
/* special rule: ::/0 means default, not "in /0" */
if (iffp->iff_plen == 0 && np->rip6_plen > 0)
continue;
ia = np->rip6_dest;
applyplen(&ia, iffp->iff_plen);
if (IN6_ARE_ADDR_EQUAL(&ia, &iffp->iff_addr)) {
ok = 1;
break;
}
}
if (!ok) {
trace(2, " (filtered)\n");
continue;
}
trace(2, "\n");
np->rip6_metric++;
np->rip6_metric += ifcp->ifc_metric;
if (np->rip6_metric > HOPCNT_INFINITY6)
np->rip6_metric = HOPCNT_INFINITY6;
applyplen(&np->rip6_dest, np->rip6_plen);
if ((rrt = rtsearch(np)) != NULL) {
if (rrt->rrt_t == 0)
continue; /* Intf route has priority */
nq = &rrt->rrt_info;
if (nq->rip6_metric > np->rip6_metric) {
if (rrt->rrt_index == ifcp->ifc_index &&
IN6_ARE_ADDR_EQUAL(&nh, &rrt->rrt_gw)) {
/* Small metric from the same gateway */
nq->rip6_metric = np->rip6_metric;
} else {
/* Better route found */
rrt->rrt_index = ifcp->ifc_index;
/* Update routing table */
delroute(nq, &rrt->rrt_gw);
rrt->rrt_gw = nh;
*nq = *np;
addroute(rrt, &nh, ifcp);
}
rrt->rrt_rflags |= RRTF_CHANGED;
rrt->rrt_t = t;
need_trigger = 1;
} else if (nq->rip6_metric < np->rip6_metric &&
rrt->rrt_index == ifcp->ifc_index &&
IN6_ARE_ADDR_EQUAL(&nh, &rrt->rrt_gw)) {
/* Got worse route from same gw */
nq->rip6_metric = np->rip6_metric;
rrt->rrt_t = t;
rrt->rrt_rflags |= RRTF_CHANGED;
need_trigger = 1;
} else if (nq->rip6_metric == np->rip6_metric &&
np->rip6_metric < HOPCNT_INFINITY6) {
if (rrt->rrt_index == ifcp->ifc_index &&
IN6_ARE_ADDR_EQUAL(&nh, &rrt->rrt_gw)) {
/* same metric, same route from same gw */
rrt->rrt_t = t;
} else if (rrt->rrt_t < t_half_lifetime) {
/* Better route found */
rrt->rrt_index = ifcp->ifc_index;
/* Update routing table */
delroute(nq, &rrt->rrt_gw);
rrt->rrt_gw = nh;
*nq = *np;
addroute(rrt, &nh, ifcp);
rrt->rrt_rflags |= RRTF_CHANGED;
rrt->rrt_t = t;
}
}
/*
* if nq->rip6_metric == HOPCNT_INFINITY6 then
* do not update age value. Do nothing.
*/
} else if (np->rip6_metric < HOPCNT_INFINITY6) {
/* Got a new valid route */
if ((rrt = MALLOC(struct riprt)) == NULL) {
fatal("malloc: struct riprt");
/*NOTREACHED*/
}
memset(rrt, 0, sizeof(*rrt));
nq = &rrt->rrt_info;
rrt->rrt_same = NULL;
rrt->rrt_index = ifcp->ifc_index;
rrt->rrt_flags = RTF_UP|RTF_GATEWAY;
rrt->rrt_gw = nh;
*nq = *np;
applyplen(&nq->rip6_dest, nq->rip6_plen);
if (nq->rip6_plen == sizeof(struct in6_addr) * 8)
rrt->rrt_flags |= RTF_HOST;
/* Update routing table */
addroute(rrt, &nh, ifcp);
rrt->rrt_rflags |= RRTF_CHANGED;
need_trigger = 1;
rrt->rrt_t = t;
/* Put the route to the list */
TAILQ_INSERT_HEAD(&riprt_head, rrt, rrt_next);
}
}
/* XXX need to care the interval between triggered updates */
if (need_trigger) {
if (nextalarm > time(NULL) + RIP_TRIG_INT6_MAX) {
TAILQ_FOREACH(ic, &ifc_head, ifc_next) {
if (ifcp->ifc_index == ic->ifc_index)
continue;
if (ic->ifc_flags & IFF_UP)
ripsend(ic, &ic->ifc_ripsin,
RRTF_CHANGED);
}
}
/* Reset the flag */
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
rrt->rrt_rflags &= ~RRTF_CHANGED;
}
}
}
/*
* Send all routes request packet to the specified interface.
*/
static void
sendrequest(struct ifc *ifcp)
{
struct netinfo6 *np;
int error;
if (ifcp->ifc_flags & IFF_LOOPBACK)
return;
ripbuf->rip6_cmd = RIP6_REQUEST;
np = ripbuf->rip6_nets;
memset(np, 0, sizeof(struct netinfo6));
np->rip6_metric = HOPCNT_INFINITY6;
tracet(1, "Send rtdump Request to %s (%s)\n",
ifcp->ifc_name, inet6_n2p(&ifcp->ifc_ripsin.sin6_addr));
error = sendpacket(&ifcp->ifc_ripsin, RIPSIZE(1));
if (error == EAFNOSUPPORT) {
/* Protocol not supported */
tracet(1, "Could not send rtdump Request to %s (%s): "
"set IFF_UP to 0\n",
ifcp->ifc_name, inet6_n2p(&ifcp->ifc_ripsin.sin6_addr));
ifcp->ifc_flags &= ~IFF_UP; /* As if down for AF_INET6 */
}
ripbuf->rip6_cmd = RIP6_RESPONSE;
}
/*
* Process a RIP6_REQUEST packet.
*/
static void
riprequest(struct ifc *ifcp,
struct netinfo6 *np,
int nn,
struct sockaddr_in6 *sin6)
{
int i;
struct riprt *rrt;
if (!(nn == 1 && IN6_IS_ADDR_UNSPECIFIED(&np->rip6_dest) &&
np->rip6_plen == 0 && np->rip6_metric == HOPCNT_INFINITY6)) {
/* Specific response, don't split-horizon */
trace(1, "\tRIP Request\n");
for (i = 0; i < nn; i++, np++) {
rrt = rtsearch(np);
if (rrt)
np->rip6_metric = rrt->rrt_info.rip6_metric;
else
np->rip6_metric = HOPCNT_INFINITY6;
}
(void)sendpacket(sin6, RIPSIZE(nn));
return;
}
/* Whole routing table dump */
trace(1, "\tRIP Request -- whole routing table\n");
ripsend(ifcp, sin6, RRTF_SENDANYWAY);
}
/*
* Get information of each interface.
*/
static void
ifconfig(void)
{
struct ifaddrs *ifap, *ifa;
struct ifc *ifcp;
struct ipv6_mreq mreq;
int s;
if ((s = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
fatal("socket");
/*NOTREACHED*/
}
if (getifaddrs(&ifap) != 0) {
fatal("getifaddrs");
/*NOTREACHED*/
}
for (ifa = ifap; ifa; ifa = ifa->ifa_next) {
if (ifa->ifa_addr->sa_family != AF_INET6)
continue;
ifcp = ifc_find(ifa->ifa_name);
/* we are interested in multicast-capable interfaces */
if ((ifa->ifa_flags & IFF_MULTICAST) == 0)
continue;
if (!ifcp) {
/* new interface */
if ((ifcp = MALLOC(struct ifc)) == NULL) {
fatal("malloc: struct ifc");
/*NOTREACHED*/
}
memset(ifcp, 0, sizeof(*ifcp));
ifcp->ifc_index = -1;
strlcpy(ifcp->ifc_name, ifa->ifa_name,
sizeof(ifcp->ifc_name));
TAILQ_INIT(&ifcp->ifc_ifac_head);
TAILQ_INIT(&ifcp->ifc_iff_head);
ifcp->ifc_flags = ifa->ifa_flags;
TAILQ_INSERT_HEAD(&ifc_head, ifcp, ifc_next);
trace(1, "newif %s <%s>\n", ifcp->ifc_name,
ifflags(ifcp->ifc_flags));
if (!strcmp(ifcp->ifc_name, LOOPBACK_IF))
loopifcp = ifcp;
} else {
/* update flag, this may be up again */
if (ifcp->ifc_flags != ifa->ifa_flags) {
trace(1, "%s: <%s> -> ", ifcp->ifc_name,
ifflags(ifcp->ifc_flags));
trace(1, "<%s>\n", ifflags(ifa->ifa_flags));
ifcp->ifc_cflags |= IFC_CHANGED;
}
ifcp->ifc_flags = ifa->ifa_flags;
}
if (ifconfig1(ifa->ifa_name, ifa->ifa_addr, ifcp, s) < 0) {
/* maybe temporary failure */
continue;
}
if ((ifcp->ifc_flags & (IFF_LOOPBACK | IFF_UP)) == IFF_UP
&& 0 < ifcp->ifc_index && !ifcp->ifc_joined) {
mreq.ipv6mr_multiaddr = ifcp->ifc_ripsin.sin6_addr;
mreq.ipv6mr_interface = ifcp->ifc_index;
if (setsockopt(ripsock, IPPROTO_IPV6, IPV6_JOIN_GROUP,
&mreq, sizeof(mreq)) < 0) {
fatal("IPV6_JOIN_GROUP");
/*NOTREACHED*/
}
trace(1, "join %s %s\n", ifcp->ifc_name, RIP6_DEST);
ifcp->ifc_joined++;
}
}
close(s);
freeifaddrs(ifap);
}
static int
ifconfig1(const char *name,
const struct sockaddr *sa,
struct ifc *ifcp,
int s)
{
struct in6_ifreq ifr;
const struct sockaddr_in6 *sin6;
struct ifac *ifac;
int plen;
char buf[BUFSIZ];
sin6 = (const struct sockaddr_in6 *)(const void *)sa;
if (IN6_IS_ADDR_SITELOCAL(&sin6->sin6_addr) && !lflag)
return (-1);
ifr.ifr_addr = *sin6;
strlcpy(ifr.ifr_name, name, sizeof(ifr.ifr_name));
if (ioctl(s, SIOCGIFNETMASK_IN6, (char *)&ifr) < 0) {
syslog(LOG_INFO, "ioctl: SIOCGIFNETMASK_IN6");
return (-1);
}
plen = sin6mask2len(&ifr.ifr_addr);
if ((ifac = ifa_match(ifcp, &sin6->sin6_addr, plen)) != NULL) {
/* same interface found */
/* need check if something changed */
/* XXX not yet implemented */
return (-1);
}
/*
* New address is found
*/
if ((ifac = MALLOC(struct ifac)) == NULL) {
fatal("malloc: struct ifac");
/*NOTREACHED*/
}
memset(ifac, 0, sizeof(*ifac));
ifac->ifac_ifc = ifcp;
ifac->ifac_addr = sin6->sin6_addr;
ifac->ifac_plen = plen;
ifac->ifac_scope_id = sin6->sin6_scope_id;
if (ifcp->ifc_flags & IFF_POINTOPOINT) {
ifr.ifr_addr = *sin6;
if (ioctl(s, SIOCGIFDSTADDR_IN6, (char *)&ifr) < 0) {
fatal("ioctl: SIOCGIFDSTADDR_IN6");
/*NOTREACHED*/
}
ifac->ifac_raddr = ifr.ifr_dstaddr.sin6_addr;
inet_ntop(AF_INET6, (void *)&ifac->ifac_raddr, buf,
sizeof(buf));
trace(1, "found address %s/%d -- %s\n",
inet6_n2p(&ifac->ifac_addr), ifac->ifac_plen, buf);
} else {
trace(1, "found address %s/%d\n",
inet6_n2p(&ifac->ifac_addr), ifac->ifac_plen);
}
if (ifcp->ifc_index < 0 && IN6_IS_ADDR_LINKLOCAL(&ifac->ifac_addr)) {
ifcp->ifc_mylladdr = ifac->ifac_addr;
ifcp->ifc_index = ifac->ifac_scope_id;
memcpy(&ifcp->ifc_ripsin, &ripsin, ripsin.ss_len);
ifcp->ifc_ripsin.sin6_scope_id = ifcp->ifc_index;
setindex2ifc(ifcp->ifc_index, ifcp);
ifcp->ifc_mtu = getifmtu(ifcp->ifc_index);
if (ifcp->ifc_mtu > RIP6_MAXMTU)
ifcp->ifc_mtu = RIP6_MAXMTU;
if (ioctl(s, SIOCGIFMETRIC, (char *)&ifr) < 0) {
fatal("ioctl: SIOCGIFMETRIC");
/*NOTREACHED*/
}
ifcp->ifc_metric = ifr.ifr_metric;
trace(1, "\tindex: %d, mtu: %d, metric: %d\n",
ifcp->ifc_index, ifcp->ifc_mtu, ifcp->ifc_metric);
} else
ifcp->ifc_cflags |= IFC_CHANGED;
TAILQ_INSERT_HEAD(&ifcp->ifc_ifac_head, ifac, ifac_next);
return 0;
}
static void
ifremove(int ifindex)
{
struct ifc *ifcp;
struct riprt *rrt;
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (ifcp->ifc_index == ifindex)
break;
}
if (ifcp == NULL)
return;
tracet(1, "ifremove: %s is departed.\n", ifcp->ifc_name);
TAILQ_REMOVE(&ifc_head, ifcp, ifc_next);
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (rrt->rrt_index == ifcp->ifc_index &&
rrt->rrt_rflags & RRTF_AGGREGATE)
delroute(&rrt->rrt_info, &rrt->rrt_gw);
}
free(ifcp);
}
/*
* Receive and process routing messages.
* Update interface information as necesssary.
*/
static void
rtrecv(void)
{
char buf[BUFSIZ];
char *p, *q = NULL;
struct rt_msghdr *rtm;
struct ifa_msghdr *ifam;
struct if_msghdr *ifm;
struct if_announcemsghdr *ifan;
int len;
struct ifc *ifcp, *ic;
int iface = 0, rtable = 0;
struct sockaddr_in6 *rta[RTAX_MAX];
struct sockaddr_in6 mask;
int i, addrs = 0;
struct riprt *rrt;
if ((len = read(rtsock, buf, sizeof(buf))) < 0) {
perror("read from rtsock");
exit(1);
}
if (len == 0)
return;
#if 0
if (len < sizeof(*rtm)) {
trace(1, "short read from rtsock: %d (should be > %lu)\n",
len, (u_long)sizeof(*rtm));
return;
}
#endif
if (dflag >= 2) {
fprintf(stderr, "rtmsg:\n");
for (i = 0; i < len; i++) {
fprintf(stderr, "%02x ", buf[i] & 0xff);
if (i % 16 == 15) fprintf(stderr, "\n");
}
fprintf(stderr, "\n");
}
for (p = buf; p - buf < len; p +=
((struct rt_msghdr *)(void *)p)->rtm_msglen) {
if (((struct rt_msghdr *)(void *)p)->rtm_version != RTM_VERSION)
continue;
/* safety against bogus message */
if (((struct rt_msghdr *)(void *)p)->rtm_msglen <= 0) {
trace(1, "bogus rtmsg: length=%d\n",
((struct rt_msghdr *)(void *)p)->rtm_msglen);
break;
}
rtm = NULL;
ifam = NULL;
ifm = NULL;
switch (((struct rt_msghdr *)(void *)p)->rtm_type) {
case RTM_NEWADDR:
case RTM_DELADDR:
ifam = (struct ifa_msghdr *)(void *)p;
addrs = ifam->ifam_addrs;
q = (char *)(ifam + 1);
break;
case RTM_IFINFO:
ifm = (struct if_msghdr *)(void *)p;
addrs = ifm->ifm_addrs;
q = (char *)(ifm + 1);
break;
case RTM_IFANNOUNCE:
ifan = (struct if_announcemsghdr *)(void *)p;
switch (ifan->ifan_what) {
case IFAN_ARRIVAL:
iface++;
break;
case IFAN_DEPARTURE:
ifremove(ifan->ifan_index);
iface++;
break;
}
break;
default:
rtm = (struct rt_msghdr *)(void *)p;
if (rtm->rtm_version != RTM_VERSION) {
trace(1, "unexpected rtmsg version %d "
"(should be %d)\n",
rtm->rtm_version, RTM_VERSION);
continue;
}
/*
* Only messages that use the struct rt_msghdr
* format are allowed beyond this point.
*/
if (rtm->rtm_type > RTM_RESOLVE) {
trace(1, "rtmsg type %d ignored\n",
rtm->rtm_type);
continue;
}
addrs = rtm->rtm_addrs;
q = (char *)(rtm + 1);
if (rtm->rtm_pid == pid) {
#if 0
trace(1, "rtmsg looped back to me, ignored\n");
#endif
continue;
}
break;
}
memset(&rta, 0, sizeof(rta));
for (i = 0; i < RTAX_MAX; i++) {
if (addrs & (1 << i)) {
rta[i] = (struct sockaddr_in6 *)(void *)q;
q += ROUNDUP(rta[i]->sin6_len);
}
}
trace(1, "rtsock: %s (addrs=%x)\n",
rttypes((struct rt_msghdr *)(void *)p), addrs);
if (dflag >= 2) {
for (i = 0;
i < ((struct rt_msghdr *)(void *)p)->rtm_msglen;
i++) {
fprintf(stderr, "%02x ", p[i] & 0xff);
if (i % 16 == 15) fprintf(stderr, "\n");
}
fprintf(stderr, "\n");
}
/*
* Easy ones first.
*
* We may be able to optimize by using ifm->ifm_index or
* ifam->ifam_index. For simplicity we don't do that here.
*/
switch (((struct rt_msghdr *)(void *)p)->rtm_type) {
case RTM_NEWADDR:
case RTM_IFINFO:
iface++;
continue;
case RTM_ADD:
rtable++;
continue;
case RTM_LOSING:
case RTM_MISS:
case RTM_GET:
case RTM_LOCK:
/* nothing to be done here */
trace(1, "\tnothing to be done, ignored\n");
continue;
}
#if 0
if (rta[RTAX_DST] == NULL) {
trace(1, "\tno destination, ignored\n");
continue;
}
if (rta[RTAX_DST]->sin6_family != AF_INET6) {
trace(1, "\taf mismatch, ignored\n");
continue;
}
if (IN6_IS_ADDR_LINKLOCAL(&rta[RTAX_DST]->sin6_addr)) {
trace(1, "\tlinklocal destination, ignored\n");
continue;
}
if (IN6_ARE_ADDR_EQUAL(&rta[RTAX_DST]->sin6_addr, &in6addr_loopback)) {
trace(1, "\tloopback destination, ignored\n");
continue; /* Loopback */
}
if (IN6_IS_ADDR_MULTICAST(&rta[RTAX_DST]->sin6_addr)) {
trace(1, "\tmulticast destination, ignored\n");
continue;
}
#endif
/* hard ones */
switch (((struct rt_msghdr *)(void *)p)->rtm_type) {
case RTM_NEWADDR:
case RTM_IFINFO:
case RTM_ADD:
case RTM_LOSING:
case RTM_MISS:
case RTM_GET:
case RTM_LOCK:
/* should already be handled */
fatal("rtrecv: never reach here");
/*NOTREACHED*/
case RTM_DELETE:
if (!rta[RTAX_DST] || !rta[RTAX_GATEWAY]) {
trace(1, "\tsome of dst/gw/netamsk are "
"unavailable, ignored\n");
break;
}
if ((rtm->rtm_flags & RTF_HOST) != 0) {
mask.sin6_len = sizeof(mask);
memset(&mask.sin6_addr, 0xff,
sizeof(mask.sin6_addr));
rta[RTAX_NETMASK] = &mask;
} else if (!rta[RTAX_NETMASK]) {
trace(1, "\tsome of dst/gw/netamsk are "
"unavailable, ignored\n");
break;
}
if (rt_del(rta[RTAX_DST], rta[RTAX_GATEWAY],
rta[RTAX_NETMASK]) == 0) {
rtable++; /*just to be sure*/
}
break;
case RTM_CHANGE:
case RTM_REDIRECT:
trace(1, "\tnot supported yet, ignored\n");
break;
case RTM_DELADDR:
if (!rta[RTAX_NETMASK] || !rta[RTAX_IFA]) {
trace(1, "\tno netmask or ifa given, ignored\n");
break;
}
if (ifam->ifam_index < nindex2ifc)
ifcp = index2ifc[ifam->ifam_index];
else
ifcp = NULL;
if (!ifcp) {
trace(1, "\tinvalid ifam_index %d, ignored\n",
ifam->ifam_index);
break;
}
if (!rt_deladdr(ifcp, rta[RTAX_IFA], rta[RTAX_NETMASK]))
iface++;
break;
}
}
if (iface) {
trace(1, "rtsock: reconfigure interfaces, refresh interface routes\n");
ifconfig();
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (ifcp->ifc_cflags & IFC_CHANGED) {
if (ifrt(ifcp, 1)) {
TAILQ_FOREACH(ic, &ifc_head, ifc_next) {
if (ifcp->ifc_index == ic->ifc_index)
continue;
if (ic->ifc_flags & IFF_UP)
ripsend(ic, &ic->ifc_ripsin,
RRTF_CHANGED);
}
/* Reset the flag */
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
rrt->rrt_rflags &= ~RRTF_CHANGED;
}
}
ifcp->ifc_cflags &= ~IFC_CHANGED;
}
}
}
if (rtable) {
trace(1, "rtsock: read routing table again\n");
krtread(1);
}
}
/*
* remove specified route from the internal routing table.
*/
static int
rt_del(const struct sockaddr_in6 *sdst,
const struct sockaddr_in6 *sgw,
const struct sockaddr_in6 *smask)
{
const struct in6_addr *dst = NULL;
const struct in6_addr *gw = NULL;
int prefix;
struct netinfo6 ni6;
struct riprt *rrt = NULL;
time_t t_lifetime;
if (sdst->sin6_family != AF_INET6) {
trace(1, "\tother AF, ignored\n");
return -1;
}
if (IN6_IS_ADDR_LINKLOCAL(&sdst->sin6_addr)
|| IN6_ARE_ADDR_EQUAL(&sdst->sin6_addr, &in6addr_loopback)
|| IN6_IS_ADDR_MULTICAST(&sdst->sin6_addr)) {
trace(1, "\taddress %s not interesting, ignored\n",
inet6_n2p(&sdst->sin6_addr));
return -1;
}
dst = &sdst->sin6_addr;
if (sgw->sin6_family == AF_INET6) {
/* easy case */
gw = &sgw->sin6_addr;
prefix = sin6mask2len(smask);
} else if (sgw->sin6_family == AF_LINK) {
/*
* Interface route... a hard case. We need to get the prefix
* length from the kernel, but we now are parsing rtmsg.
* We'll purge matching routes from my list, then get the
* fresh list.
*/
struct riprt *longest;
trace(1, "\t%s is an interface route, guessing prefixlen\n",
inet6_n2p(dst));
longest = NULL;
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (IN6_ARE_ADDR_EQUAL(&rrt->rrt_info.rip6_dest,
&sdst->sin6_addr)
&& IN6_IS_ADDR_LOOPBACK(&rrt->rrt_gw)) {
if (!longest
|| longest->rrt_info.rip6_plen <
rrt->rrt_info.rip6_plen) {
longest = rrt;
}
}
}
rrt = longest;
if (!rrt) {
trace(1, "\tno matching interface route found\n");
return -1;
}
gw = &in6addr_loopback;
prefix = rrt->rrt_info.rip6_plen;
} else {
trace(1, "\tunsupported af: (gw=%d)\n", sgw->sin6_family);
return -1;
}
trace(1, "\tdeleting %s/%d ", inet6_n2p(dst), prefix);
trace(1, "gw %s\n", inet6_n2p(gw));
t_lifetime = time(NULL) - RIP_LIFETIME;
/* age route for interface address */
memset(&ni6, 0, sizeof(ni6));
ni6.rip6_dest = *dst;
ni6.rip6_plen = prefix;
applyplen(&ni6.rip6_dest, ni6.rip6_plen); /*to be sure*/
trace(1, "\tfind route %s/%d\n", inet6_n2p(&ni6.rip6_dest),
ni6.rip6_plen);
if (!rrt && (rrt = rtsearch(&ni6)) == NULL) {
trace(1, "\tno route found\n");
return -1;
}
#if 0
if ((rrt->rrt_flags & RTF_STATIC) == 0) {
trace(1, "\tyou can delete static routes only\n");
} else
#endif
if (!IN6_ARE_ADDR_EQUAL(&rrt->rrt_gw, gw)) {
trace(1, "\tgw mismatch: %s <-> ",
inet6_n2p(&rrt->rrt_gw));
trace(1, "%s\n", inet6_n2p(gw));
} else {
trace(1, "\troute found, age it\n");
if (rrt->rrt_t == 0 || rrt->rrt_t > t_lifetime) {
rrt->rrt_t = t_lifetime;
rrt->rrt_info.rip6_metric = HOPCNT_INFINITY6;
}
}
return 0;
}
/*
* remove specified address from internal interface/routing table.
*/
static int
rt_deladdr(struct ifc *ifcp,
const struct sockaddr_in6 *sifa,
const struct sockaddr_in6 *smask)
{
const struct in6_addr *addr = NULL;
int prefix;
struct ifac *ifac = NULL;
struct netinfo6 ni6;
struct riprt *rrt = NULL;
time_t t_lifetime;
int updated = 0;
if (sifa->sin6_family != AF_INET6) {
trace(1, "\tother AF, ignored\n");
return -1;
}
addr = &sifa->sin6_addr;
prefix = sin6mask2len(smask);
trace(1, "\tdeleting %s/%d from %s\n",
inet6_n2p(addr), prefix, ifcp->ifc_name);
ifac = ifa_match(ifcp, addr, prefix);
if (!ifac) {
trace(1, "\tno matching ifa found for %s/%d on %s\n",
inet6_n2p(addr), prefix, ifcp->ifc_name);
return -1;
}
if (ifac->ifac_ifc != ifcp) {
trace(1, "\taddress table corrupt: back pointer does not match "
"(%s != %s)\n",
ifcp->ifc_name, ifac->ifac_ifc->ifc_name);
return -1;
}
TAILQ_REMOVE(&ifcp->ifc_ifac_head, ifac, ifac_next);
t_lifetime = time(NULL) - RIP_LIFETIME;
/* age route for interface address */
memset(&ni6, 0, sizeof(ni6));
ni6.rip6_dest = ifac->ifac_addr;
ni6.rip6_plen = ifac->ifac_plen;
applyplen(&ni6.rip6_dest, ni6.rip6_plen);
trace(1, "\tfind interface route %s/%d on %d\n",
inet6_n2p(&ni6.rip6_dest), ni6.rip6_plen, ifcp->ifc_index);
if ((rrt = rtsearch(&ni6)) != NULL) {
struct in6_addr none;
memset(&none, 0, sizeof(none));
if (rrt->rrt_index == ifcp->ifc_index &&
(IN6_ARE_ADDR_EQUAL(&rrt->rrt_gw, &none) ||
IN6_IS_ADDR_LOOPBACK(&rrt->rrt_gw))) {
trace(1, "\troute found, age it\n");
if (rrt->rrt_t == 0 || rrt->rrt_t > t_lifetime) {
rrt->rrt_t = t_lifetime;
rrt->rrt_info.rip6_metric = HOPCNT_INFINITY6;
}
updated++;
} else {
trace(1, "\tnon-interface route found: %s/%d on %d\n",
inet6_n2p(&rrt->rrt_info.rip6_dest),
rrt->rrt_info.rip6_plen,
rrt->rrt_index);
}
} else
trace(1, "\tno interface route found\n");
/* age route for p2p destination */
if (ifcp->ifc_flags & IFF_POINTOPOINT) {
memset(&ni6, 0, sizeof(ni6));
ni6.rip6_dest = ifac->ifac_raddr;
ni6.rip6_plen = 128;
applyplen(&ni6.rip6_dest, ni6.rip6_plen); /*to be sure*/
trace(1, "\tfind p2p route %s/%d on %d\n",
inet6_n2p(&ni6.rip6_dest), ni6.rip6_plen,
ifcp->ifc_index);
if ((rrt = rtsearch(&ni6)) != NULL) {
if (rrt->rrt_index == ifcp->ifc_index &&
IN6_ARE_ADDR_EQUAL(&rrt->rrt_gw,
&ifac->ifac_addr)) {
trace(1, "\troute found, age it\n");
if (rrt->rrt_t == 0 || rrt->rrt_t > t_lifetime) {
rrt->rrt_t = t_lifetime;
rrt->rrt_info.rip6_metric =
HOPCNT_INFINITY6;
updated++;
}
} else {
trace(1, "\tnon-p2p route found: %s/%d on %d\n",
inet6_n2p(&rrt->rrt_info.rip6_dest),
rrt->rrt_info.rip6_plen,
rrt->rrt_index);
}
} else
trace(1, "\tno p2p route found\n");
}
free(ifac);
return ((updated) ? 0 : -1);
}
/*
* Get each interface address and put those interface routes to the route
* list.
*/
static int
ifrt(struct ifc *ifcp, int again)
{
struct ifac *ifac;
struct riprt *rrt = NULL, *search_rrt, *loop_rrt;
struct netinfo6 *np;
time_t t_lifetime;
int need_trigger = 0;
#if 0
if (ifcp->ifc_flags & IFF_LOOPBACK)
return 0; /* ignore loopback */
#endif
if (ifcp->ifc_flags & IFF_POINTOPOINT) {
ifrt_p2p(ifcp, again);
return 0;
}
TAILQ_FOREACH(ifac, &ifcp->ifc_ifac_head, ifac_next) {
if (IN6_IS_ADDR_LINKLOCAL(&ifac->ifac_addr)) {
#if 0
trace(1, "route: %s on %s: "
"skip linklocal interface address\n",
inet6_n2p(&ifac->ifac_addr), ifcp->ifc_name);
#endif
continue;
}
if (IN6_IS_ADDR_UNSPECIFIED(&ifac->ifac_addr)) {
#if 0
trace(1, "route: %s: skip unspec interface address\n",
ifcp->ifc_name);
#endif
continue;
}
if (IN6_IS_ADDR_LOOPBACK(&ifac->ifac_addr)) {
#if 0
trace(1, "route: %s: skip loopback address\n",
ifcp->ifc_name);
#endif
continue;
}
if (ifcp->ifc_flags & IFF_UP) {
if ((rrt = MALLOC(struct riprt)) == NULL)
fatal("malloc: struct riprt");
memset(rrt, 0, sizeof(*rrt));
rrt->rrt_same = NULL;
rrt->rrt_index = ifcp->ifc_index;
rrt->rrt_t = 0; /* don't age */
rrt->rrt_info.rip6_dest = ifac->ifac_addr;
rrt->rrt_info.rip6_tag = htons(routetag & 0xffff);
rrt->rrt_info.rip6_metric = 1 + ifcp->ifc_metric;
rrt->rrt_info.rip6_plen = ifac->ifac_plen;
rrt->rrt_flags = RTF_HOST;
rrt->rrt_rflags |= RRTF_CHANGED;
applyplen(&rrt->rrt_info.rip6_dest, ifac->ifac_plen);
memset(&rrt->rrt_gw, 0, sizeof(struct in6_addr));
rrt->rrt_gw = ifac->ifac_addr;
np = &rrt->rrt_info;
search_rrt = rtsearch(np);
if (search_rrt != NULL) {
if (search_rrt->rrt_info.rip6_metric <=
rrt->rrt_info.rip6_metric) {
/* Already have better route */
if (!again) {
trace(1, "route: %s/%d: "
"already registered (%s)\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen,
ifcp->ifc_name);
}
goto next;
}
TAILQ_REMOVE(&riprt_head, search_rrt, rrt_next);
delroute(&search_rrt->rrt_info,
&search_rrt->rrt_gw);
free(search_rrt);
}
/* Attach the route to the list */
trace(1, "route: %s/%d: register route (%s)\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen,
ifcp->ifc_name);
TAILQ_INSERT_HEAD(&riprt_head, rrt, rrt_next);
addroute(rrt, &rrt->rrt_gw, ifcp);
rrt = NULL;
sendrequest(ifcp);
ripsend(ifcp, &ifcp->ifc_ripsin, 0);
need_trigger = 1;
} else {
TAILQ_FOREACH(loop_rrt, &riprt_head, rrt_next) {
if (loop_rrt->rrt_index == ifcp->ifc_index) {
t_lifetime = time(NULL) - RIP_LIFETIME;
if (loop_rrt->rrt_t == 0 || loop_rrt->rrt_t > t_lifetime) {
loop_rrt->rrt_t = t_lifetime;
loop_rrt->rrt_info.rip6_metric = HOPCNT_INFINITY6;
loop_rrt->rrt_rflags |= RRTF_CHANGED;
need_trigger = 1;
}
}
}
}
next:
if (rrt)
free(rrt);
}
return need_trigger;
}
/*
* there are couple of p2p interface routing models. "behavior" lets
* you pick one. it looks that gated behavior fits best with BSDs,
* since BSD kernels do not look at prefix length on p2p interfaces.
*/
static void
ifrt_p2p(struct ifc *ifcp, int again)
{
struct ifac *ifac;
struct riprt *rrt, *orrt;
struct netinfo6 *np;
struct in6_addr addr, dest;
int advert, ignore, i;
#define P2PADVERT_NETWORK 1
#define P2PADVERT_ADDR 2
#define P2PADVERT_DEST 4
#define P2PADVERT_MAX 4
const enum { CISCO, GATED, ROUTE6D } behavior = GATED;
const char *category = "";
const char *noadv;
TAILQ_FOREACH(ifac, &ifcp->ifc_ifac_head, ifac_next) {
addr = ifac->ifac_addr;
dest = ifac->ifac_raddr;
applyplen(&addr, ifac->ifac_plen);
applyplen(&dest, ifac->ifac_plen);
advert = ignore = 0;
switch (behavior) {
case CISCO:
/*
* honor addr/plen, just like normal shared medium
* interface. this may cause trouble if you reuse
* addr/plen on other interfaces.
*
* advertise addr/plen.
*/
advert |= P2PADVERT_NETWORK;
break;
case GATED:
/*
* prefixlen on p2p interface is meaningless.
* advertise addr/128 and dest/128.
*
* do not install network route to route6d routing
* table (if we do, it would prevent route installation
* for other p2p interface that shares addr/plen).
*
* XXX what should we do if dest is ::? it will not
* get announced anyways (see following filter),
* but we need to think.
*/
advert |= P2PADVERT_ADDR;
advert |= P2PADVERT_DEST;
ignore |= P2PADVERT_NETWORK;
break;
case ROUTE6D:
/*
* just for testing. actually the code is redundant
* given the current p2p interface address assignment
* rule for kame kernel.
*
* intent:
* A/n -> announce A/n
* A B/n, A and B share prefix -> A/n (= B/n)
* A B/n, do not share prefix -> A/128 and B/128
* actually, A/64 and A B/128 are the only cases
* permitted by the kernel:
* A/64 -> A/64
* A B/128 -> A/128 and B/128
*/
if (!IN6_IS_ADDR_UNSPECIFIED(&ifac->ifac_raddr)) {
if (IN6_ARE_ADDR_EQUAL(&addr, &dest))
advert |= P2PADVERT_NETWORK;
else {
advert |= P2PADVERT_ADDR;
advert |= P2PADVERT_DEST;
ignore |= P2PADVERT_NETWORK;
}
} else
advert |= P2PADVERT_NETWORK;
break;
}
for (i = 1; i <= P2PADVERT_MAX; i *= 2) {
if ((ignore & i) != 0)
continue;
if ((rrt = MALLOC(struct riprt)) == NULL) {
fatal("malloc: struct riprt");
/*NOTREACHED*/
}
memset(rrt, 0, sizeof(*rrt));
rrt->rrt_same = NULL;
rrt->rrt_index = ifcp->ifc_index;
rrt->rrt_t = 0; /* don't age */
switch (i) {
case P2PADVERT_NETWORK:
rrt->rrt_info.rip6_dest = ifac->ifac_addr;
rrt->rrt_info.rip6_plen = ifac->ifac_plen;
applyplen(&rrt->rrt_info.rip6_dest,
ifac->ifac_plen);
category = "network";
break;
case P2PADVERT_ADDR:
rrt->rrt_info.rip6_dest = ifac->ifac_addr;
rrt->rrt_info.rip6_plen = 128;
rrt->rrt_gw = in6addr_loopback;
category = "addr";
break;
case P2PADVERT_DEST:
rrt->rrt_info.rip6_dest = ifac->ifac_raddr;
rrt->rrt_info.rip6_plen = 128;
rrt->rrt_gw = ifac->ifac_addr;
category = "dest";
break;
}
if (IN6_IS_ADDR_UNSPECIFIED(&rrt->rrt_info.rip6_dest) ||
IN6_IS_ADDR_LINKLOCAL(&rrt->rrt_info.rip6_dest)) {
#if 0
trace(1, "route: %s: skip unspec/linklocal "
"(%s on %s)\n", category, ifcp->ifc_name);
#endif
free(rrt);
continue;
}
if ((advert & i) == 0) {
rrt->rrt_rflags |= RRTF_NOADVERTISE;
noadv = ", NO-ADV";
} else
noadv = "";
rrt->rrt_info.rip6_tag = htons(routetag & 0xffff);
rrt->rrt_info.rip6_metric = 1 + ifcp->ifc_metric;
np = &rrt->rrt_info;
orrt = rtsearch(np);
if (!orrt) {
/* Attach the route to the list */
trace(1, "route: %s/%d: register route "
"(%s on %s%s)\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen,
category, ifcp->ifc_name, noadv);
TAILQ_INSERT_HEAD(&riprt_head, rrt, rrt_next);
} else if (rrt->rrt_index != orrt->rrt_index ||
rrt->rrt_info.rip6_metric != orrt->rrt_info.rip6_metric) {
/* replace route */
TAILQ_INSERT_BEFORE(orrt, rrt, rrt_next);
TAILQ_REMOVE(&riprt_head, orrt, rrt_next);
free(orrt);
trace(1, "route: %s/%d: update (%s on %s%s)\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen,
category, ifcp->ifc_name, noadv);
} else {
/* Already found */
if (!again) {
trace(1, "route: %s/%d: "
"already registered (%s on %s%s)\n",
inet6_n2p(&np->rip6_dest),
np->rip6_plen, category,
ifcp->ifc_name, noadv);
}
free(rrt);
}
}
}
#undef P2PADVERT_NETWORK
#undef P2PADVERT_ADDR
#undef P2PADVERT_DEST
#undef P2PADVERT_MAX
}
static int
getifmtu(int ifindex)
{
int mib[6];
char *buf;
size_t msize;
struct if_msghdr *ifm;
int mtu;
mib[0] = CTL_NET;
mib[1] = PF_ROUTE;
mib[2] = 0;
mib[3] = AF_INET6;
mib[4] = NET_RT_IFLIST;
mib[5] = ifindex;
if (sysctl(mib, nitems(mib), NULL, &msize, NULL, 0) < 0) {
fatal("sysctl estimate NET_RT_IFLIST");
/*NOTREACHED*/
}
if ((buf = malloc(msize)) == NULL) {
fatal("malloc");
/*NOTREACHED*/
}
if (sysctl(mib, nitems(mib), buf, &msize, NULL, 0) < 0) {
fatal("sysctl NET_RT_IFLIST");
/*NOTREACHED*/
}
ifm = (struct if_msghdr *)(void *)buf;
mtu = ifm->ifm_data.ifi_mtu;
if (ifindex != ifm->ifm_index) {
fatal("ifindex does not match with ifm_index");
/*NOTREACHED*/
}
free(buf);
return mtu;
}
static const char *
rttypes(struct rt_msghdr *rtm)
{
#define RTTYPE(s, f) \
do { \
if (rtm->rtm_type == (f)) \
return (s); \
} while (0)
RTTYPE("ADD", RTM_ADD);
RTTYPE("DELETE", RTM_DELETE);
RTTYPE("CHANGE", RTM_CHANGE);
RTTYPE("GET", RTM_GET);
RTTYPE("LOSING", RTM_LOSING);
RTTYPE("REDIRECT", RTM_REDIRECT);
RTTYPE("MISS", RTM_MISS);
RTTYPE("LOCK", RTM_LOCK);
RTTYPE("NEWADDR", RTM_NEWADDR);
RTTYPE("DELADDR", RTM_DELADDR);
RTTYPE("IFINFO", RTM_IFINFO);
#ifdef RTM_OIFINFO
RTTYPE("OIFINFO", RTM_OIFINFO);
#endif
#ifdef RTM_IFANNOUNCE
RTTYPE("IFANNOUNCE", RTM_IFANNOUNCE);
#endif
#ifdef RTM_NEWMADDR
RTTYPE("NEWMADDR", RTM_NEWMADDR);
#endif
#ifdef RTM_DELMADDR
RTTYPE("DELMADDR", RTM_DELMADDR);
#endif
#undef RTTYPE
return NULL;
}
static const char *
rtflags(struct rt_msghdr *rtm)
{
static char buf[BUFSIZ];
/*
* letter conflict should be okay. painful when *BSD diverges...
*/
strlcpy(buf, "", sizeof(buf));
#define RTFLAG(s, f) \
do { \
if (rtm->rtm_flags & (f)) \
strlcat(buf, (s), sizeof(buf)); \
} while (0)
RTFLAG("U", RTF_UP);
RTFLAG("G", RTF_GATEWAY);
RTFLAG("H", RTF_HOST);
RTFLAG("R", RTF_REJECT);
RTFLAG("D", RTF_DYNAMIC);
RTFLAG("M", RTF_MODIFIED);
RTFLAG("d", RTF_DONE);
#ifdef RTF_MASK
RTFLAG("m", RTF_MASK);
#endif
#ifdef RTF_CLONED
RTFLAG("c", RTF_CLONED);
#endif
RTFLAG("X", RTF_XRESOLVE);
#ifdef RTF_LLINFO
RTFLAG("L", RTF_LLINFO);
#endif
RTFLAG("S", RTF_STATIC);
RTFLAG("B", RTF_BLACKHOLE);
#ifdef RTF_PROTO3
RTFLAG("3", RTF_PROTO3);
#endif
RTFLAG("2", RTF_PROTO2);
RTFLAG("1", RTF_PROTO1);
#ifdef RTF_BROADCAST
RTFLAG("b", RTF_BROADCAST);
#endif
#ifdef RTF_DEFAULT
RTFLAG("d", RTF_DEFAULT);
#endif
#ifdef RTF_ISAROUTER
RTFLAG("r", RTF_ISAROUTER);
#endif
#ifdef RTF_TUNNEL
RTFLAG("T", RTF_TUNNEL);
#endif
#ifdef RTF_AUTH
RTFLAG("A", RTF_AUTH);
#endif
#ifdef RTF_CRYPT
RTFLAG("E", RTF_CRYPT);
#endif
#undef RTFLAG
return buf;
}
static const char *
ifflags(int flags)
{
static char buf[BUFSIZ];
strlcpy(buf, "", sizeof(buf));
#define IFFLAG(s, f) \
do { \
if (flags & (f)) { \
if (buf[0]) \
strlcat(buf, ",", sizeof(buf)); \
strlcat(buf, (s), sizeof(buf)); \
} \
} while (0)
IFFLAG("UP", IFF_UP);
IFFLAG("BROADCAST", IFF_BROADCAST);
IFFLAG("DEBUG", IFF_DEBUG);
IFFLAG("LOOPBACK", IFF_LOOPBACK);
IFFLAG("POINTOPOINT", IFF_POINTOPOINT);
#ifdef IFF_NOTRAILERS
IFFLAG("NOTRAILERS", IFF_NOTRAILERS);
#endif
IFFLAG("RUNNING", IFF_RUNNING);
IFFLAG("NOARP", IFF_NOARP);
IFFLAG("PROMISC", IFF_PROMISC);
IFFLAG("ALLMULTI", IFF_ALLMULTI);
IFFLAG("OACTIVE", IFF_OACTIVE);
IFFLAG("SIMPLEX", IFF_SIMPLEX);
IFFLAG("LINK0", IFF_LINK0);
IFFLAG("LINK1", IFF_LINK1);
IFFLAG("LINK2", IFF_LINK2);
IFFLAG("MULTICAST", IFF_MULTICAST);
#undef IFFLAG
return buf;
}
static void
krtread(int again)
{
int mib[6];
size_t msize;
char *buf, *p, *lim;
struct rt_msghdr *rtm;
int retry;
const char *errmsg;
retry = 0;
buf = NULL;
mib[0] = CTL_NET;
mib[1] = PF_ROUTE;
mib[2] = 0;
mib[3] = AF_INET6; /* Address family */
mib[4] = NET_RT_DUMP; /* Dump the kernel routing table */
mib[5] = 0; /* No flags */
do {
if (retry)
sleep(1);
retry++;
errmsg = NULL;
if (buf) {
free(buf);
buf = NULL;
}
if (sysctl(mib, nitems(mib), NULL, &msize, NULL, 0) < 0) {
errmsg = "sysctl estimate";
continue;
}
if ((buf = malloc(msize)) == NULL) {
errmsg = "malloc";
continue;
}
if (sysctl(mib, nitems(mib), buf, &msize, NULL, 0) < 0) {
errmsg = "sysctl NET_RT_DUMP";
continue;
}
} while (retry < RT_DUMP_MAXRETRY && errmsg != NULL);
if (errmsg) {
fatal("%s (with %d retries, msize=%lu)", errmsg, retry,
(u_long)msize);
/*NOTREACHED*/
} else if (1 < retry)
syslog(LOG_INFO, "NET_RT_DUMP %d retires", retry);
lim = buf + msize;
for (p = buf; p < lim; p += rtm->rtm_msglen) {
rtm = (struct rt_msghdr *)(void *)p;
rt_entry(rtm, again);
}
free(buf);
}
static void
rt_entry(struct rt_msghdr *rtm, int again)
{
struct sockaddr_in6 *sin6_dst, *sin6_gw, *sin6_mask;
struct sockaddr_in6 *sin6_genmask, *sin6_ifp;
char *rtmp, *ifname = NULL;
struct riprt *rrt, *orrt;
struct netinfo6 *np;
int ifindex;
sin6_dst = sin6_gw = sin6_mask = sin6_genmask = sin6_ifp = 0;
if ((rtm->rtm_flags & RTF_UP) == 0 || rtm->rtm_flags &
(RTF_XRESOLVE|RTF_BLACKHOLE)) {
return; /* not interested in the link route */
}
/* do not look at cloned routes */
#ifdef RTF_WASCLONED
if (rtm->rtm_flags & RTF_WASCLONED)
return;
#endif
#ifdef RTF_CLONED
if (rtm->rtm_flags & RTF_CLONED)
return;
#endif
/* XXX: Ignore connected routes. */
if (!(rtm->rtm_flags & (RTF_GATEWAY|RTF_HOST|RTF_STATIC)))
return;
/*
* do not look at dynamic routes.
* netbsd/openbsd cloned routes have UGHD.
*/
if (rtm->rtm_flags & RTF_DYNAMIC)
return;
rtmp = (char *)(rtm + 1);
/* Destination */
if ((rtm->rtm_addrs & RTA_DST) == 0)
return; /* ignore routes without destination address */
sin6_dst = (struct sockaddr_in6 *)(void *)rtmp;
rtmp += ROUNDUP(sin6_dst->sin6_len);
if (rtm->rtm_addrs & RTA_GATEWAY) {
sin6_gw = (struct sockaddr_in6 *)(void *)rtmp;
rtmp += ROUNDUP(sin6_gw->sin6_len);
}
if (rtm->rtm_addrs & RTA_NETMASK) {
sin6_mask = (struct sockaddr_in6 *)(void *)rtmp;
rtmp += ROUNDUP(sin6_mask->sin6_len);
}
if (rtm->rtm_addrs & RTA_GENMASK) {
sin6_genmask = (struct sockaddr_in6 *)(void *)rtmp;
rtmp += ROUNDUP(sin6_genmask->sin6_len);
}
if (rtm->rtm_addrs & RTA_IFP) {
sin6_ifp = (struct sockaddr_in6 *)(void *)rtmp;
rtmp += ROUNDUP(sin6_ifp->sin6_len);
}
/* Destination */
if (sin6_dst->sin6_family != AF_INET6)
return;
if (IN6_IS_ADDR_LINKLOCAL(&sin6_dst->sin6_addr))
return; /* Link-local */
if (IN6_ARE_ADDR_EQUAL(&sin6_dst->sin6_addr, &in6addr_loopback))
return; /* Loopback */
if (IN6_IS_ADDR_MULTICAST(&sin6_dst->sin6_addr))
return;
if ((rrt = MALLOC(struct riprt)) == NULL) {
fatal("malloc: struct riprt");
/*NOTREACHED*/
}
memset(rrt, 0, sizeof(*rrt));
np = &rrt->rrt_info;
rrt->rrt_same = NULL;
rrt->rrt_t = time(NULL);
if (aflag == 0 && (rtm->rtm_flags & RTF_STATIC))
rrt->rrt_t = 0; /* Don't age static routes */
if (rtm->rtm_flags & Pflag)
rrt->rrt_t = 0; /* Don't age PROTO[123] routes */
if ((rtm->rtm_flags & (RTF_HOST|RTF_GATEWAY)) == RTF_HOST)
rrt->rrt_t = 0; /* Don't age non-gateway host routes */
np->rip6_tag = 0;
np->rip6_metric = rtm->rtm_rmx.rmx_hopcount;
if (np->rip6_metric < 1)
np->rip6_metric = 1;
rrt->rrt_flags = rtm->rtm_flags;
np->rip6_dest = sin6_dst->sin6_addr;
/* Mask or plen */
if (rtm->rtm_flags & RTF_HOST)
np->rip6_plen = 128; /* Host route */
else if (sin6_mask)
np->rip6_plen = sin6mask2len(sin6_mask);
else
np->rip6_plen = 0;
orrt = rtsearch(np);
if (orrt && orrt->rrt_info.rip6_metric != HOPCNT_INFINITY6) {
/* Already found */
if (!again) {
trace(1, "route: %s/%d flags %s: already registered\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen,
rtflags(rtm));
}
free(rrt);
return;
}
/* Gateway */
if (!sin6_gw)
memset(&rrt->rrt_gw, 0, sizeof(struct in6_addr));
else {
if (sin6_gw->sin6_family == AF_INET6)
rrt->rrt_gw = sin6_gw->sin6_addr;
else if (sin6_gw->sin6_family == AF_LINK) {
/* XXX in case ppp link? */
rrt->rrt_gw = in6addr_loopback;
} else
memset(&rrt->rrt_gw, 0, sizeof(struct in6_addr));
}
trace(1, "route: %s/%d flags %s",
inet6_n2p(&np->rip6_dest), np->rip6_plen, rtflags(rtm));
trace(1, " gw %s", inet6_n2p(&rrt->rrt_gw));
/* Interface */
ifindex = rtm->rtm_index;
if ((unsigned int)ifindex < nindex2ifc && index2ifc[ifindex])
ifname = index2ifc[ifindex]->ifc_name;
else {
trace(1, " not configured\n");
free(rrt);
return;
}
trace(1, " if %s sock %d", ifname, ifindex);
rrt->rrt_index = ifindex;
trace(1, "\n");
/* Check gateway */
if (!IN6_IS_ADDR_LINKLOCAL(&rrt->rrt_gw) &&
!IN6_IS_ADDR_LOOPBACK(&rrt->rrt_gw) &&
(rrt->rrt_flags & RTF_LOCAL) == 0) {
trace(0, "***** Gateway %s is not a link-local address.\n",
inet6_n2p(&rrt->rrt_gw));
trace(0, "***** dest(%s) if(%s) -- Not optimized.\n",
inet6_n2p(&rrt->rrt_info.rip6_dest), ifname);
rrt->rrt_rflags |= RRTF_NH_NOT_LLADDR;
}
/* Put it to the route list */
if (orrt && orrt->rrt_info.rip6_metric == HOPCNT_INFINITY6) {
/* replace route list */
TAILQ_INSERT_BEFORE(orrt, rrt, rrt_next);
TAILQ_REMOVE(&riprt_head, orrt, rrt_next);
trace(1, "route: %s/%d flags %s: replace new route\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen,
rtflags(rtm));
free(orrt);
} else
TAILQ_INSERT_HEAD(&riprt_head, rrt, rrt_next);
}
static int
addroute(struct riprt *rrt,
const struct in6_addr *gw,
struct ifc *ifcp)
{
struct netinfo6 *np;
u_char buf[BUFSIZ], buf1[BUFSIZ], buf2[BUFSIZ];
struct rt_msghdr *rtm;
struct sockaddr_in6 *sin6;
int len;
np = &rrt->rrt_info;
inet_ntop(AF_INET6, (const void *)gw, (char *)buf1, sizeof(buf1));
inet_ntop(AF_INET6, (void *)&ifcp->ifc_mylladdr, (char *)buf2, sizeof(buf2));
tracet(1, "ADD: %s/%d gw %s [%d] ifa %s\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen, buf1,
np->rip6_metric - 1, buf2);
if (rtlog)
fprintf(rtlog, "%s: ADD: %s/%d gw %s [%d] ifa %s\n", hms(),
inet6_n2p(&np->rip6_dest), np->rip6_plen, buf1,
np->rip6_metric - 1, buf2);
if (nflag)
return 0;
memset(buf, 0, sizeof(buf));
rtm = (struct rt_msghdr *)(void *)buf;
rtm->rtm_type = RTM_ADD;
rtm->rtm_version = RTM_VERSION;
rtm->rtm_seq = ++seq;
rtm->rtm_pid = pid;
rtm->rtm_flags = rrt->rrt_flags;
rtm->rtm_flags |= Qflag;
rtm->rtm_addrs = RTA_DST | RTA_GATEWAY | RTA_NETMASK;
rtm->rtm_rmx.rmx_hopcount = np->rip6_metric - 1;
rtm->rtm_inits = RTV_HOPCOUNT;
sin6 = (struct sockaddr_in6 *)(void *)&buf[sizeof(struct rt_msghdr)];
/* Destination */
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = np->rip6_dest;
sin6 = (struct sockaddr_in6 *)(void *)((char *)sin6 + ROUNDUP(sin6->sin6_len));
/* Gateway */
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = *gw;
if (IN6_IS_ADDR_LINKLOCAL(&sin6->sin6_addr))
sin6->sin6_scope_id = ifcp->ifc_index;
sin6 = (struct sockaddr_in6 *)(void *)((char *)sin6 + ROUNDUP(sin6->sin6_len));
/* Netmask */
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = *(plen2mask(np->rip6_plen));
sin6 = (struct sockaddr_in6 *)(void *)((char *)sin6 + ROUNDUP(sin6->sin6_len));
len = (char *)sin6 - (char *)buf;
rtm->rtm_msglen = len;
if (write(rtsock, buf, len) > 0)
return 0;
if (errno == EEXIST) {
trace(0, "ADD: Route already exists %s/%d gw %s\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen, buf1);
if (rtlog)
fprintf(rtlog, "ADD: Route already exists %s/%d gw %s\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen, buf1);
} else {
trace(0, "Can not write to rtsock (addroute): %s\n",
strerror(errno));
if (rtlog)
fprintf(rtlog, "\tCan not write to rtsock: %s\n",
strerror(errno));
}
return -1;
}
static int
delroute(struct netinfo6 *np, struct in6_addr *gw)
{
u_char buf[BUFSIZ], buf2[BUFSIZ];
struct rt_msghdr *rtm;
struct sockaddr_in6 *sin6;
int len;
inet_ntop(AF_INET6, (void *)gw, (char *)buf2, sizeof(buf2));
tracet(1, "DEL: %s/%d gw %s\n", inet6_n2p(&np->rip6_dest),
np->rip6_plen, buf2);
if (rtlog)
fprintf(rtlog, "%s: DEL: %s/%d gw %s\n",
hms(), inet6_n2p(&np->rip6_dest), np->rip6_plen, buf2);
if (nflag)
return 0;
memset(buf, 0, sizeof(buf));
rtm = (struct rt_msghdr *)(void *)buf;
rtm->rtm_type = RTM_DELETE;
rtm->rtm_version = RTM_VERSION;
rtm->rtm_seq = ++seq;
rtm->rtm_pid = pid;
rtm->rtm_flags = RTF_UP | RTF_GATEWAY;
rtm->rtm_flags |= Qflag;
if (np->rip6_plen == sizeof(struct in6_addr) * 8)
rtm->rtm_flags |= RTF_HOST;
rtm->rtm_addrs = RTA_DST | RTA_GATEWAY | RTA_NETMASK;
sin6 = (struct sockaddr_in6 *)(void *)&buf[sizeof(struct rt_msghdr)];
/* Destination */
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = np->rip6_dest;
sin6 = (struct sockaddr_in6 *)(void *)((char *)sin6 + ROUNDUP(sin6->sin6_len));
/* Gateway */
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = *gw;
sin6 = (struct sockaddr_in6 *)(void *)((char *)sin6 + ROUNDUP(sin6->sin6_len));
/* Netmask */
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = *(plen2mask(np->rip6_plen));
sin6 = (struct sockaddr_in6 *)(void *)((char *)sin6 + ROUNDUP(sin6->sin6_len));
len = (char *)sin6 - (char *)buf;
rtm->rtm_msglen = len;
if (write(rtsock, buf, len) >= 0)
return 0;
if (errno == ESRCH) {
trace(0, "RTDEL: Route does not exist: %s/%d gw %s\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen, buf2);
if (rtlog)
fprintf(rtlog, "RTDEL: Route does not exist: %s/%d gw %s\n",
inet6_n2p(&np->rip6_dest), np->rip6_plen, buf2);
} else {
trace(0, "Can not write to rtsock (delroute): %s\n",
strerror(errno));
if (rtlog)
fprintf(rtlog, "\tCan not write to rtsock: %s\n",
strerror(errno));
}
return -1;
}
#if 0
static struct in6_addr *
getroute(struct netinfo6 *np, struct in6_addr *gw)
{
u_char buf[BUFSIZ];
int myseq;
int len;
struct rt_msghdr *rtm;
struct sockaddr_in6 *sin6;
rtm = (struct rt_msghdr *)(void *)buf;
len = sizeof(struct rt_msghdr) + sizeof(struct sockaddr_in6);
memset(rtm, 0, len);
rtm->rtm_type = RTM_GET;
rtm->rtm_version = RTM_VERSION;
myseq = ++seq;
rtm->rtm_seq = myseq;
rtm->rtm_addrs = RTA_DST;
rtm->rtm_msglen = len;
sin6 = (struct sockaddr_in6 *)(void *)&buf[sizeof(struct rt_msghdr)];
sin6->sin6_len = sizeof(struct sockaddr_in6);
sin6->sin6_family = AF_INET6;
sin6->sin6_addr = np->rip6_dest;
if (write(rtsock, buf, len) < 0) {
if (errno == ESRCH) /* No such route found */
return NULL;
perror("write to rtsock");
exit(1);
}
do {
if ((len = read(rtsock, buf, sizeof(buf))) < 0) {
perror("read from rtsock");
exit(1);
}
rtm = (struct rt_msghdr *)(void *)buf;
} while (rtm->rtm_type != RTM_GET || rtm->rtm_seq != myseq ||
rtm->rtm_pid != pid);
sin6 = (struct sockaddr_in6 *)(void *)&buf[sizeof(struct rt_msghdr)];
if (rtm->rtm_addrs & RTA_DST) {
sin6 = (struct sockaddr_in6 *)(void *)
((char *)sin6 + ROUNDUP(sin6->sin6_len));
}
if (rtm->rtm_addrs & RTA_GATEWAY) {
*gw = sin6->sin6_addr;
return gw;
}
return NULL;
}
#endif
static const char *
inet6_n2p(const struct in6_addr *p)
{
static char buf[BUFSIZ];
return inet_ntop(AF_INET6, (const void *)p, buf, sizeof(buf));
}
static void
ifrtdump(int sig)
{
ifdump(sig);
rtdump(sig);
}
static void
ifdump(int sig)
{
struct ifc *ifcp;
FILE *dump;
int nifc = 0;
if (sig == 0)
dump = stderr;
else
if ((dump = fopen(ROUTE6D_DUMP, "a")) == NULL)
dump = stderr;
fprintf(dump, "%s: Interface Table Dump\n", hms());
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next)
nifc++;
fprintf(dump, " Number of interfaces: %d\n", nifc);
fprintf(dump, " advertising interfaces:\n");
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if ((ifcp->ifc_flags & IFF_UP) == 0)
continue;
if (iff_find(ifcp, IFIL_TYPE_N) != NULL)
continue;
ifdump0(dump, ifcp);
}
fprintf(dump, "\n");
fprintf(dump, " non-advertising interfaces:\n");
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if ((ifcp->ifc_flags & IFF_UP) &&
(iff_find(ifcp, IFIL_TYPE_N) == NULL))
continue;
ifdump0(dump, ifcp);
}
fprintf(dump, "\n");
if (dump != stderr)
fclose(dump);
}
static void
ifdump0(FILE *dump, const struct ifc *ifcp)
{
struct ifac *ifac;
struct iff *iffp;
char buf[BUFSIZ];
const char *ft;
int addr;
fprintf(dump, " %s: index(%d) flags(%s) addr(%s) mtu(%d) metric(%d)\n",
ifcp->ifc_name, ifcp->ifc_index, ifflags(ifcp->ifc_flags),
inet6_n2p(&ifcp->ifc_mylladdr),
ifcp->ifc_mtu, ifcp->ifc_metric);
TAILQ_FOREACH(ifac, &ifcp->ifc_ifac_head, ifac_next) {
if (ifcp->ifc_flags & IFF_POINTOPOINT) {
inet_ntop(AF_INET6, (void *)&ifac->ifac_raddr,
buf, sizeof(buf));
fprintf(dump, "\t%s/%d -- %s\n",
inet6_n2p(&ifac->ifac_addr),
ifac->ifac_plen, buf);
} else {
fprintf(dump, "\t%s/%d\n",
inet6_n2p(&ifac->ifac_addr),
ifac->ifac_plen);
}
}
fprintf(dump, "\tFilter:\n");
TAILQ_FOREACH(iffp, &ifcp->ifc_iff_head, iff_next) {
addr = 0;
switch (iffp->iff_type) {
case IFIL_TYPE_A:
ft = "Aggregate"; addr++; break;
case IFIL_TYPE_N:
ft = "No-use"; break;
case IFIL_TYPE_O:
ft = "Advertise-only"; addr++; break;
case IFIL_TYPE_T:
ft = "Default-only"; break;
case IFIL_TYPE_L:
ft = "Listen-only"; addr++; break;
default:
snprintf(buf, sizeof(buf), "Unknown-%c", iffp->iff_type);
ft = buf;
addr++;
break;
}
fprintf(dump, "\t\t%s", ft);
if (addr)
fprintf(dump, "(%s/%d)", inet6_n2p(&iffp->iff_addr),
iffp->iff_plen);
fprintf(dump, "\n");
}
fprintf(dump, "\n");
}
static void
rtdump(int sig)
{
struct riprt *rrt;
char buf[BUFSIZ];
FILE *dump;
time_t t, age;
if (sig == 0)
dump = stderr;
else
if ((dump = fopen(ROUTE6D_DUMP, "a")) == NULL)
dump = stderr;
t = time(NULL);
fprintf(dump, "\n%s: Routing Table Dump\n", hms());
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (rrt->rrt_t == 0)
age = 0;
else
age = t - rrt->rrt_t;
inet_ntop(AF_INET6, (void *)&rrt->rrt_info.rip6_dest,
buf, sizeof(buf));
fprintf(dump, " %s/%d if(%d:%s) gw(%s) [%d] age(%ld)",
buf, rrt->rrt_info.rip6_plen, rrt->rrt_index,
index2ifc[rrt->rrt_index]->ifc_name,
inet6_n2p(&rrt->rrt_gw),
rrt->rrt_info.rip6_metric, (long)age);
if (rrt->rrt_info.rip6_tag) {
fprintf(dump, " tag(0x%04x)",
ntohs(rrt->rrt_info.rip6_tag) & 0xffff);
}
if (rrt->rrt_rflags & RRTF_NH_NOT_LLADDR)
fprintf(dump, " NOT-LL");
if (rrt->rrt_rflags & RRTF_NOADVERTISE)
fprintf(dump, " NO-ADV");
fprintf(dump, "\n");
}
fprintf(dump, "\n");
if (dump != stderr)
fclose(dump);
}
/*
* Parse the -A (and -O) options and put corresponding filter object to the
* specified interface structures. Each of the -A/O option has the following
* syntax: -A 5f09:c400::/32,ef0,ef1 (aggregate)
* -O 5f09:c400::/32,ef0,ef1 (only when match)
*/
static void
filterconfig(void)
{
int i;
char *p, *ap, *iflp, *ifname, *ep;
struct iff iff, *iffp;
struct ifc *ifcp;
struct riprt *rrt;
#if 0
struct in6_addr gw;
#endif
u_long plen;
for (i = 0; i < nfilter; i++) {
ap = filter[i];
iflp = NULL;
iffp = &iff;
memset(iffp, 0, sizeof(*iffp));
if (filtertype[i] == 'N' || filtertype[i] == 'T') {
iflp = ap;
goto ifonly;
}
if ((p = strchr(ap, ',')) != NULL) {
*p++ = '\0';
iflp = p;
}
if ((p = strchr(ap, '/')) == NULL) {
fatal("no prefixlen specified for '%s'", ap);
/*NOTREACHED*/
}
*p++ = '\0';
if (inet_pton(AF_INET6, ap, &iffp->iff_addr) != 1) {
fatal("invalid prefix specified for '%s'", ap);
/*NOTREACHED*/
}
errno = 0;
ep = NULL;
plen = strtoul(p, &ep, 10);
if (errno || !*p || *ep || plen > sizeof(iffp->iff_addr) * 8) {
fatal("invalid prefix length specified for '%s'", ap);
/*NOTREACHED*/
}
iffp->iff_plen = plen;
applyplen(&iffp->iff_addr, iffp->iff_plen);
ifonly:
iffp->iff_type = filtertype[i];
if (iflp == NULL || *iflp == '\0') {
fatal("no interface specified for '%s'", ap);
/*NOTREACHED*/
}
/* parse the interface listing portion */
while (iflp) {
ifname = iflp;
if ((iflp = strchr(iflp, ',')) != NULL)
*iflp++ = '\0';
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (fnmatch(ifname, ifcp->ifc_name, 0) != 0)
continue;
iffp = malloc(sizeof(*iffp));
if (iffp == NULL) {
fatal("malloc of iff");
/*NOTREACHED*/
}
memcpy(iffp, &iff, sizeof(*iffp));
#if 0
syslog(LOG_INFO, "Add filter: type %d, ifname %s.", iffp->iff_type, ifname);
#endif
TAILQ_INSERT_HEAD(&ifcp->ifc_iff_head, iffp, iff_next);
}
}
/*
* -A: aggregate configuration.
*/
if (filtertype[i] != IFIL_TYPE_A)
continue;
/* put the aggregate to the kernel routing table */
rrt = (struct riprt *)malloc(sizeof(struct riprt));
if (rrt == NULL) {
fatal("malloc: rrt");
/*NOTREACHED*/
}
memset(rrt, 0, sizeof(struct riprt));
rrt->rrt_info.rip6_dest = iff.iff_addr;
rrt->rrt_info.rip6_plen = iff.iff_plen;
rrt->rrt_info.rip6_metric = 1;
rrt->rrt_info.rip6_tag = htons(routetag & 0xffff);
rrt->rrt_gw = in6addr_loopback;
rrt->rrt_flags = RTF_UP | RTF_REJECT;
rrt->rrt_rflags = RRTF_AGGREGATE;
rrt->rrt_t = 0;
rrt->rrt_index = loopifcp->ifc_index;
#if 0
if (getroute(&rrt->rrt_info, &gw)) {
#if 0
/*
* When the address has already been registered in the
* kernel routing table, it should be removed
*/
delroute(&rrt->rrt_info, &gw);
#else
/* it is safer behavior */
errno = EINVAL;
fatal("%s/%u already in routing table, "
"cannot aggregate",
inet6_n2p(&rrt->rrt_info.rip6_dest),
rrt->rrt_info.rip6_plen);
/*NOTREACHED*/
#endif
}
#endif
/* Put the route to the list */
TAILQ_INSERT_HEAD(&riprt_head, rrt, rrt_next);
trace(1, "Aggregate: %s/%d for %s\n",
inet6_n2p(&iff.iff_addr), iff.iff_plen,
loopifcp->ifc_name);
/* Add this route to the kernel */
if (nflag) /* do not modify kernel routing table */
continue;
addroute(rrt, &in6addr_loopback, loopifcp);
}
}
/***************** utility functions *****************/
/*
* Returns a pointer to ifac whose address and prefix length matches
* with the address and prefix length specified in the arguments.
*/
static struct ifac *
ifa_match(const struct ifc *ifcp,
const struct in6_addr *ia,
int plen)
{
struct ifac *ifac;
TAILQ_FOREACH(ifac, &ifcp->ifc_ifac_head, ifac_next) {
if (IN6_ARE_ADDR_EQUAL(&ifac->ifac_addr, ia) &&
ifac->ifac_plen == plen)
break;
}
return (ifac);
}
/*
* Return a pointer to riprt structure whose address and prefix length
* matches with the address and prefix length found in the argument.
* Note: This is not a rtalloc(). Therefore exact match is necessary.
*/
static struct riprt *
rtsearch(struct netinfo6 *np)
{
struct riprt *rrt;
TAILQ_FOREACH(rrt, &riprt_head, rrt_next) {
if (rrt->rrt_info.rip6_plen == np->rip6_plen &&
IN6_ARE_ADDR_EQUAL(&rrt->rrt_info.rip6_dest,
&np->rip6_dest))
break;
}
return (rrt);
}
static int
sin6mask2len(const struct sockaddr_in6 *sin6)
{
return mask2len(&sin6->sin6_addr,
sin6->sin6_len - offsetof(struct sockaddr_in6, sin6_addr));
}
static int
mask2len(const struct in6_addr *addr, int lenlim)
{
int i = 0, j;
const u_char *p = (const u_char *)addr;
for (j = 0; j < lenlim; j++, p++) {
if (*p != 0xff)
break;
i += 8;
}
if (j < lenlim) {
switch (*p) {
#define MASKLEN(m, l) case m: do { i += l; break; } while (0)
MASKLEN(0xfe, 7); break;
MASKLEN(0xfc, 6); break;
MASKLEN(0xf8, 5); break;
MASKLEN(0xf0, 4); break;
MASKLEN(0xe0, 3); break;
MASKLEN(0xc0, 2); break;
MASKLEN(0x80, 1); break;
#undef MASKLEN
}
}
return i;
}
static const u_char plent[8] = {
0x00, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe
};
static void
applyplen(struct in6_addr *ia, int plen)
{
u_char *p;
int i;
p = ia->s6_addr;
for (i = 0; i < 16; i++) {
if (plen <= 0)
*p = 0;
else if (plen < 8)
*p &= plent[plen];
p++, plen -= 8;
}
}
static const int pl2m[9] = {
0x00, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff
};
static struct in6_addr *
plen2mask(int n)
{
static struct in6_addr ia;
u_char *p;
int i;
memset(&ia, 0, sizeof(struct in6_addr));
p = (u_char *)&ia;
for (i = 0; i < 16; i++, p++, n -= 8) {
if (n >= 8) {
*p = 0xff;
continue;
}
*p = pl2m[n];
break;
}
return &ia;
}
static char *
allocopy(char *p)
{
int len = strlen(p) + 1;
char *q = (char *)malloc(len);
if (!q) {
fatal("malloc");
/*NOTREACHED*/
}
strlcpy(q, p, len);
return q;
}
static char *
hms(void)
{
static char buf[BUFSIZ];
time_t t;
struct tm *tm;
t = time(NULL);
if ((tm = localtime(&t)) == 0) {
fatal("localtime");
/*NOTREACHED*/
}
snprintf(buf, sizeof(buf), "%02d:%02d:%02d", tm->tm_hour, tm->tm_min,
tm->tm_sec);
return buf;
}
#define RIPRANDDEV 1.0 /* 30 +- 15, max - min = 30 */
static int
ripinterval(int timer)
{
double r = rand();
interval = (int)(timer + timer * RIPRANDDEV * (r / RAND_MAX - 0.5));
nextalarm = time(NULL) + interval;
return interval;
}
#if 0
static time_t
ripsuptrig(void)
{
time_t t;
double r = rand();
t = (int)(RIP_TRIG_INT6_MIN +
(RIP_TRIG_INT6_MAX - RIP_TRIG_INT6_MIN) * (r / RAND_MAX));
sup_trig_update = time(NULL) + t;
return t;
}
#endif
static void
fatal(const char *fmt, ...)
{
va_list ap;
char buf[1024];
va_start(ap, fmt);
vsnprintf(buf, sizeof(buf), fmt, ap);
va_end(ap);
perror(buf);
if (errno)
syslog(LOG_ERR, "%s: %s", buf, strerror(errno));
else
syslog(LOG_ERR, "%s", buf);
rtdexit();
}
static void
tracet(int level, const char *fmt, ...)
{
va_list ap;
if (level <= dflag) {
va_start(ap, fmt);
fprintf(stderr, "%s: ", hms());
vfprintf(stderr, fmt, ap);
va_end(ap);
}
if (dflag) {
va_start(ap, fmt);
if (level > 0)
vsyslog(LOG_DEBUG, fmt, ap);
else
vsyslog(LOG_WARNING, fmt, ap);
va_end(ap);
}
}
static void
trace(int level, const char *fmt, ...)
{
va_list ap;
if (level <= dflag) {
va_start(ap, fmt);
vfprintf(stderr, fmt, ap);
va_end(ap);
}
if (dflag) {
va_start(ap, fmt);
if (level > 0)
vsyslog(LOG_DEBUG, fmt, ap);
else
vsyslog(LOG_WARNING, fmt, ap);
va_end(ap);
}
}
static struct ifc *
ifc_find(char *name)
{
struct ifc *ifcp;
TAILQ_FOREACH(ifcp, &ifc_head, ifc_next) {
if (strcmp(name, ifcp->ifc_name) == 0)
break;
}
return (ifcp);
}
static struct iff *
iff_find(struct ifc *ifcp, int type)
{
struct iff *iffp;
TAILQ_FOREACH(iffp, &ifcp->ifc_iff_head, iff_next) {
if (type == IFIL_TYPE_ANY ||
type == iffp->iff_type)
break;
}
return (iffp);
}
static void
setindex2ifc(int idx, struct ifc *ifcp)
{
int n, nsize;
struct ifc **p;
if (!index2ifc) {
nindex2ifc = 5; /*initial guess*/
index2ifc = (struct ifc **)
malloc(sizeof(*index2ifc) * nindex2ifc);
if (index2ifc == NULL) {
fatal("malloc");
/*NOTREACHED*/
}
memset(index2ifc, 0, sizeof(*index2ifc) * nindex2ifc);
}
n = nindex2ifc;
for (nsize = nindex2ifc; nsize <= idx; nsize *= 2)
;
if (n != nsize) {
p = (struct ifc **)realloc(index2ifc,
sizeof(*index2ifc) * nsize);
if (p == NULL) {
fatal("realloc");
/*NOTREACHED*/
}
memset(p + n, 0, sizeof(*index2ifc) * (nindex2ifc - n));
index2ifc = p;
nindex2ifc = nsize;
}
index2ifc[idx] = ifcp;
}
diff --git a/usr.sbin/route6d/route6d.h b/usr.sbin/route6d/route6d.h
index d556799c7177..3193514ddeb3 100644
--- a/usr.sbin/route6d/route6d.h
+++ b/usr.sbin/route6d/route6d.h
@@ -1,83 +1,82 @@
-/* $FreeBSD$ */
/* $KAME: route6d.h,v 1.8 2003/05/28 09:11:13 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#define ROUTE6D_DUMP "/var/run/route6d_dump"
#define ROUTE6D_PID "/var/run/route6d.pid"
#define RIP6_VERSION 1
#define RIP6_REQUEST 1
#define RIP6_RESPONSE 2
#define IFC_CHANGED 1
struct netinfo6 {
struct in6_addr rip6_dest;
u_short rip6_tag;
u_char rip6_plen;
u_char rip6_metric;
};
struct rip6 {
u_char rip6_cmd;
u_char rip6_vers;
u_char rip6_res1[2];
struct netinfo6 rip6_nets[1];
};
#define HOPCNT_INFINITY6 16
#define NEXTHOP_METRIC 0xff
#define RIP6_MAXMTU 1500
#define IFMINMTU 1280
#ifndef DEBUG
#define SUPPLY_INTERVAL6 30
#define RIP_LIFETIME 180
#define RIP_HOLDDOWN 120
#define RIP_TRIG_INT6_MAX 5
#define RIP_TRIG_INT6_MIN 1
#else
/* only for debugging; can not wait for 30sec to appear a bug */
#define SUPPLY_INTERVAL6 10
#define RIP_LIFETIME 60
#define RIP_HOLDDOWN 40
#define RIP_TRIG_INT6_MAX 5
#define RIP_TRIG_INT6_MIN 1
#endif
#define RIP6_PORT 521
#define RIP6_DEST "ff02::9"
#define LOOPBACK_IF "lo0"
diff --git a/usr.sbin/rpc.lockd/lock_proc.c b/usr.sbin/rpc.lockd/lock_proc.c
index 395baf399832..b720be7dba69 100644
--- a/usr.sbin/rpc.lockd/lock_proc.c
+++ b/usr.sbin/rpc.lockd/lock_proc.c
@@ -1,1329 +1,1328 @@
/* $NetBSD: lock_proc.c,v 1.7 2000/10/11 20:23:56 is Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1995
* A.R. Gordon (andrew.gordon@net-tel.co.uk). All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the FreeBSD project
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY ANDREW GORDON AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#ifndef lint
__RCSID("$NetBSD: lock_proc.c,v 1.7 2000/10/11 20:23:56 is Exp $");
#endif
#include <sys/param.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#include <stdio.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#include <netconfig.h>
#include <rpc/rpc.h>
#include <rpcsvc/sm_inter.h>
#include "lockd.h"
#include <rpcsvc/nlm_prot.h>
#include "lockd_lock.h"
#define CLIENT_CACHE_SIZE 64 /* No. of client sockets cached */
#define CLIENT_CACHE_LIFETIME 120 /* In seconds */
#define getrpcaddr(rqstp) (struct sockaddr *)(svc_getrpccaller((rqstp)->rq_xprt)->buf)
static void log_from_addr(const char *, struct svc_req *);
static void log_netobj(netobj *obj);
static int addrcmp(struct sockaddr *, struct sockaddr *);
/* log_from_addr ----------------------------------------------------------- */
/*
* Purpose: Log name of function called and source address
* Returns: Nothing
* Notes: Extracts the source address from the transport handle
* passed in as part of the called procedure specification
*/
static void
log_from_addr(const char *fun_name, struct svc_req *req)
{
struct sockaddr *addr;
char hostname_buf[NI_MAXHOST];
addr = svc_getrpccaller(req->rq_xprt)->buf;
if (getnameinfo(addr , addr->sa_len, hostname_buf, sizeof hostname_buf,
NULL, 0, 0) != 0)
return;
syslog(LOG_DEBUG, "%s from %s", fun_name, hostname_buf);
}
/* log_netobj ----------------------------------------------------------- */
/*
* Purpose: Log a netobj
* Returns: Nothing
* Notes: This function should only really be called as part of
* a debug subsystem.
*/
static void
log_netobj(netobj *obj)
{
char objvalbuffer[(sizeof(char)*2)*MAX_NETOBJ_SZ+2];
char objascbuffer[sizeof(char)*MAX_NETOBJ_SZ+1];
unsigned int i, maxlen;
char *tmp1, *tmp2;
/* Notify of potential security attacks */
if (obj->n_len > MAX_NETOBJ_SZ) {
syslog(LOG_DEBUG, "SOMEONE IS TRYING TO DO SOMETHING NASTY!\n");
syslog(LOG_DEBUG, "netobj too large! Should be %d was %d\n",
MAX_NETOBJ_SZ, obj->n_len);
}
/* Prevent the security hazard from the buffer overflow */
maxlen = (obj->n_len < MAX_NETOBJ_SZ ? obj->n_len : MAX_NETOBJ_SZ);
for (i=0, tmp1 = objvalbuffer, tmp2 = objascbuffer; i < maxlen;
i++, tmp1 +=2, tmp2 +=1) {
sprintf(tmp1,"%02X",*(obj->n_bytes+i));
sprintf(tmp2,"%c",*(obj->n_bytes+i));
}
*tmp1 = '\0';
*tmp2 = '\0';
syslog(LOG_DEBUG,"netobjvals: %s\n",objvalbuffer);
syslog(LOG_DEBUG,"netobjascs: %s\n",objascbuffer);
}
/* get_client -------------------------------------------------------------- */
/*
* Purpose: Get a CLIENT* for making RPC calls to lockd on given host
* Returns: CLIENT* pointer, from clnt_udp_create, or NULL if error
* Notes: Creating a CLIENT* is quite expensive, involving a
* conversation with the remote portmapper to get the
* port number. Since a given client is quite likely
* to make several locking requests in succession, it is
* desirable to cache the created CLIENT*.
*
* Since we are using UDP rather than TCP, there is no cost
* to the remote system in keeping these cached indefinitely.
* Unfortunately there is a snag: if the remote system
* reboots, the cached portmapper results will be invalid,
* and we will never detect this since all of the xxx_msg()
* calls return no result - we just fire off a udp packet
* and hope for the best.
*
* We solve this by discarding cached values after two
* minutes, regardless of whether they have been used
* in the meanwhile (since a bad one might have been used
* plenty of times, as the host keeps retrying the request
* and we keep sending the reply back to the wrong port).
*
* Given that the entries will always expire in the order
* that they were created, there is no point in a LRU
* algorithm for when the cache gets full - entries are
* always re-used in sequence.
*/
static CLIENT *clnt_cache_ptr[CLIENT_CACHE_SIZE];
static long clnt_cache_time[CLIENT_CACHE_SIZE]; /* time entry created */
static struct sockaddr_storage clnt_cache_addr[CLIENT_CACHE_SIZE];
static rpcvers_t clnt_cache_vers[CLIENT_CACHE_SIZE];
static int clnt_cache_next_to_use = 0;
static int
addrcmp(struct sockaddr *sa1, struct sockaddr *sa2)
{
int len;
void *p1, *p2;
if (sa1->sa_family != sa2->sa_family)
return -1;
switch (sa1->sa_family) {
case AF_INET:
p1 = &((struct sockaddr_in *)sa1)->sin_addr;
p2 = &((struct sockaddr_in *)sa2)->sin_addr;
len = 4;
break;
case AF_INET6:
p1 = &((struct sockaddr_in6 *)sa1)->sin6_addr;
p2 = &((struct sockaddr_in6 *)sa2)->sin6_addr;
len = 16;
break;
default:
return -1;
}
return memcmp(p1, p2, len);
}
CLIENT *
get_client(struct sockaddr *host_addr, rpcvers_t vers)
{
CLIENT *client;
struct timeval retry_time, time_now;
int error, i;
const char *netid;
struct netconfig *nconf;
char host[NI_MAXHOST];
uid_t old_euid;
int clnt_fd;
gettimeofday(&time_now, NULL);
/*
* Search for the given client in the cache, zapping any expired
* entries that we happen to notice in passing.
*/
for (i = 0; i < CLIENT_CACHE_SIZE; i++) {
client = clnt_cache_ptr[i];
if (client && ((clnt_cache_time[i] + CLIENT_CACHE_LIFETIME)
< time_now.tv_sec)) {
/* Cache entry has expired. */
if (debug_level > 3)
syslog(LOG_DEBUG, "Expired CLIENT* in cache");
clnt_cache_time[i] = 0L;
clnt_destroy(client);
clnt_cache_ptr[i] = NULL;
client = NULL;
}
if (client && !addrcmp((struct sockaddr *)&clnt_cache_addr[i],
host_addr) && clnt_cache_vers[i] == vers) {
/* Found it! */
if (debug_level > 3)
syslog(LOG_DEBUG, "Found CLIENT* in cache");
return (client);
}
}
if (debug_level > 3)
syslog(LOG_DEBUG, "CLIENT* not found in cache, creating");
/* Not found in cache. Free the next entry if it is in use. */
if (clnt_cache_ptr[clnt_cache_next_to_use]) {
clnt_destroy(clnt_cache_ptr[clnt_cache_next_to_use]);
clnt_cache_ptr[clnt_cache_next_to_use] = NULL;
}
/*
* Need a host string for clnt_tp_create. Use NI_NUMERICHOST
* to avoid DNS lookups.
*/
error = getnameinfo(host_addr, host_addr->sa_len, host, sizeof host,
NULL, 0, NI_NUMERICHOST);
if (error != 0) {
syslog(LOG_ERR, "unable to get name string for caller: %s",
gai_strerror(error));
return NULL;
}
#if 1
if (host_addr->sa_family == AF_INET6)
netid = "udp6";
else
netid = "udp";
#else
if (host_addr->sa_family == AF_INET6)
netid = "tcp6";
else
netid = "tcp";
#endif
nconf = getnetconfigent(netid);
if (nconf == NULL) {
syslog(LOG_ERR, "could not get netconfig info for '%s': "
"no /etc/netconfig file?", netid);
return NULL;
}
client = clnt_tp_create(host, NLM_PROG, vers, nconf);
freenetconfigent(nconf);
if (!client) {
syslog(LOG_ERR, "%s", clnt_spcreateerror("clntudp_create"));
syslog(LOG_ERR, "Unable to return result to %s", host);
return NULL;
}
/* Get the FD of the client, for bindresvport. */
clnt_control(client, CLGET_FD, &clnt_fd);
/* Regain root privileges, for bindresvport. */
old_euid = geteuid();
if (seteuid(0) != 0) {
syslog(LOG_ERR, "seteuid(0) failed");
return NULL;
}
/*
* Bind the client FD to a reserved port.
* Some NFS servers reject any NLM request from a non-reserved port.
*/
bindresvport(clnt_fd, NULL);
/* Drop root privileges again. */
if (seteuid(old_euid) != 0) {
syslog(LOG_ERR, "seteuid(%d) failed", old_euid);
return NULL;
}
/* Success - update the cache entry */
clnt_cache_ptr[clnt_cache_next_to_use] = client;
memcpy(&clnt_cache_addr[clnt_cache_next_to_use], host_addr,
host_addr->sa_len);
clnt_cache_vers[clnt_cache_next_to_use] = vers;
clnt_cache_time[clnt_cache_next_to_use] = time_now.tv_sec;
if (++clnt_cache_next_to_use >= CLIENT_CACHE_SIZE)
clnt_cache_next_to_use = 0;
/*
* Disable the default timeout, so we can specify our own in calls
* to clnt_call(). (Note that the timeout is a different concept
* from the retry period set in clnt_udp_create() above.)
*/
retry_time.tv_sec = -1;
retry_time.tv_usec = -1;
clnt_control(client, CLSET_TIMEOUT, (char *)&retry_time);
if (debug_level > 3)
syslog(LOG_DEBUG, "Created CLIENT* for %s", host);
return client;
}
/* transmit_result --------------------------------------------------------- */
/*
* Purpose: Transmit result for nlm_xxx_msg pseudo-RPCs
* Returns: Nothing - we have no idea if the datagram got there
* Notes: clnt_call() will always fail (with timeout) as we are
* calling it with timeout 0 as a hack to just issue a datagram
* without expecting a result
*/
void
transmit_result(int opcode, nlm_res *result, struct sockaddr *addr)
{
static char dummy;
CLIENT *cli;
struct timeval timeo;
int success;
if ((cli = get_client(addr, NLM_VERS)) != NULL) {
timeo.tv_sec = 0; /* No timeout - not expecting response */
timeo.tv_usec = 0;
success = clnt_call(cli, opcode, (xdrproc_t)xdr_nlm_res, result,
(xdrproc_t)xdr_void, &dummy, timeo);
if (debug_level > 2)
syslog(LOG_DEBUG, "clnt_call returns %d(%s)",
success, clnt_sperrno(success));
}
}
/* transmit4_result --------------------------------------------------------- */
/*
* Purpose: Transmit result for nlm4_xxx_msg pseudo-RPCs
* Returns: Nothing - we have no idea if the datagram got there
* Notes: clnt_call() will always fail (with timeout) as we are
* calling it with timeout 0 as a hack to just issue a datagram
* without expecting a result
*/
void
transmit4_result(int opcode, nlm4_res *result, struct sockaddr *addr)
{
static char dummy;
CLIENT *cli;
struct timeval timeo;
int success;
if ((cli = get_client(addr, NLM_VERS4)) != NULL) {
timeo.tv_sec = 0; /* No timeout - not expecting response */
timeo.tv_usec = 0;
success = clnt_call(cli, opcode,
(xdrproc_t)xdr_nlm4_res, result,
(xdrproc_t)xdr_void, &dummy, timeo);
if (debug_level > 2)
syslog(LOG_DEBUG, "clnt_call returns %d(%s)",
success, clnt_sperrno(success));
}
}
/*
* converts a struct nlm_lock to struct nlm4_lock
*/
static void
nlmtonlm4(struct nlm_lock *arg, struct nlm4_lock *arg4)
{
arg4->caller_name = arg->caller_name;
arg4->fh = arg->fh;
arg4->oh = arg->oh;
arg4->svid = arg->svid;
arg4->l_offset = arg->l_offset;
arg4->l_len = arg->l_len;
}
/* ------------------------------------------------------------------------- */
/*
* Functions for Unix<->Unix locking (ie. monitored locking, with rpc.statd
* involved to ensure reclaim of locks after a crash of the "stateless"
* server.
*
* These all come in two flavours - nlm_xxx() and nlm_xxx_msg().
* The first are standard RPCs with argument and result.
* The nlm_xxx_msg() calls implement exactly the same functions, but
* use two pseudo-RPCs (one in each direction). These calls are NOT
* standard use of the RPC protocol in that they do not return a result
* at all (NB. this is quite different from returning a void result).
* The effect of this is to make the nlm_xxx_msg() calls simple unacknowledged
* datagrams, requiring higher-level code to perform retries.
*
* Despite the disadvantages of the nlm_xxx_msg() approach (some of which
* are documented in the comments to get_client() above), this is the
* interface used by all current commercial NFS implementations
* [Solaris, SCO, AIX etc.]. This is presumed to be because these allow
* implementations to continue using the standard RPC libraries, while
* avoiding the block-until-result nature of the library interface.
*
* No client implementations have been identified so far that make use
* of the true RPC version (early SunOS releases would be a likely candidate
* for testing).
*/
/* nlm_test ---------------------------------------------------------------- */
/*
* Purpose: Test whether a specified lock would be granted if requested
* Returns: nlm_granted (or error code)
* Notes:
*/
nlm_testres *
nlm_test_1_svc(nlm_testargs *arg, struct svc_req *rqstp)
{
static nlm_testres res;
struct nlm4_lock arg4;
struct nlm4_holder *holder;
nlmtonlm4(&arg->alock, &arg4);
if (debug_level)
log_from_addr("nlm_test", rqstp);
holder = testlock(&arg4, arg->exclusive, 0);
/*
* Copy the cookie from the argument into the result. Note that this
* is slightly hazardous, as the structure contains a pointer to a
* malloc()ed buffer that will get freed by the caller. However, the
* main function transmits the result before freeing the argument
* so it is in fact safe.
*/
res.cookie = arg->cookie;
if (holder == NULL) {
res.stat.stat = nlm_granted;
} else {
res.stat.stat = nlm_denied;
memcpy(&res.stat.nlm_testrply_u.holder, holder,
sizeof(struct nlm_holder));
res.stat.nlm_testrply_u.holder.l_offset = holder->l_offset;
res.stat.nlm_testrply_u.holder.l_len = holder->l_len;
}
return (&res);
}
void *
nlm_test_msg_1_svc(nlm_testargs *arg, struct svc_req *rqstp)
{
nlm_testres res;
static char dummy;
struct sockaddr *addr;
CLIENT *cli;
int success;
struct timeval timeo;
struct nlm4_lock arg4;
struct nlm4_holder *holder;
nlmtonlm4(&arg->alock, &arg4);
if (debug_level)
log_from_addr("nlm_test_msg", rqstp);
holder = testlock(&arg4, arg->exclusive, 0);
res.cookie = arg->cookie;
if (holder == NULL) {
res.stat.stat = nlm_granted;
} else {
res.stat.stat = nlm_denied;
memcpy(&res.stat.nlm_testrply_u.holder, holder,
sizeof(struct nlm_holder));
res.stat.nlm_testrply_u.holder.l_offset = holder->l_offset;
res.stat.nlm_testrply_u.holder.l_len = holder->l_len;
}
/*
* nlm_test has different result type to the other operations, so
* can't use transmit_result() in this case
*/
addr = svc_getrpccaller(rqstp->rq_xprt)->buf;
if ((cli = get_client(addr, NLM_VERS)) != NULL) {
timeo.tv_sec = 0; /* No timeout - not expecting response */
timeo.tv_usec = 0;
success = clnt_call(cli, NLM_TEST_RES,
(xdrproc_t)xdr_nlm_testres, &res,
(xdrproc_t)xdr_void, &dummy, timeo);
if (debug_level > 2)
syslog(LOG_DEBUG, "clnt_call returns %d", success);
}
return (NULL);
}
/* nlm_lock ---------------------------------------------------------------- */
/*
* Purposes: Establish a lock
* Returns: granted, denied or blocked
* Notes: *** grace period support missing
*/
nlm_res *
nlm_lock_1_svc(nlm_lockargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
struct nlm4_lockargs arg4;
nlmtonlm4(&arg->alock, &arg4.alock);
arg4.cookie = arg->cookie;
arg4.block = arg->block;
arg4.exclusive = arg->exclusive;
arg4.reclaim = arg->reclaim;
arg4.state = arg->state;
if (debug_level)
log_from_addr("nlm_lock", rqstp);
/* copy cookie from arg to result. See comment in nlm_test_1() */
res.cookie = arg->cookie;
res.stat.stat = getlock(&arg4, rqstp, LOCK_MON);
return (&res);
}
void *
nlm_lock_msg_1_svc(nlm_lockargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
struct nlm4_lockargs arg4;
nlmtonlm4(&arg->alock, &arg4.alock);
arg4.cookie = arg->cookie;
arg4.block = arg->block;
arg4.exclusive = arg->exclusive;
arg4.reclaim = arg->reclaim;
arg4.state = arg->state;
if (debug_level)
log_from_addr("nlm_lock_msg", rqstp);
res.cookie = arg->cookie;
res.stat.stat = getlock(&arg4, rqstp, LOCK_ASYNC | LOCK_MON);
transmit_result(NLM_LOCK_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* nlm_cancel -------------------------------------------------------------- */
/*
* Purpose: Cancel a blocked lock request
* Returns: granted or denied
* Notes:
*/
nlm_res *
nlm_cancel_1_svc(nlm_cancargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
struct nlm4_lock arg4;
nlmtonlm4(&arg->alock, &arg4);
if (debug_level)
log_from_addr("nlm_cancel", rqstp);
/* copy cookie from arg to result. See comment in nlm_test_1() */
res.cookie = arg->cookie;
/*
* Since at present we never return 'nlm_blocked', there can never be
* a lock to cancel, so this call always fails.
*/
res.stat.stat = unlock(&arg4, LOCK_CANCEL);
return (&res);
}
void *
nlm_cancel_msg_1_svc(nlm_cancargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
struct nlm4_lock arg4;
nlmtonlm4(&arg->alock, &arg4);
if (debug_level)
log_from_addr("nlm_cancel_msg", rqstp);
res.cookie = arg->cookie;
/*
* Since at present we never return 'nlm_blocked', there can never be
* a lock to cancel, so this call always fails.
*/
res.stat.stat = unlock(&arg4, LOCK_CANCEL);
transmit_result(NLM_CANCEL_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* nlm_unlock -------------------------------------------------------------- */
/*
* Purpose: Release an existing lock
* Returns: Always granted, unless during grace period
* Notes: "no such lock" error condition is ignored, as the
* protocol uses unreliable UDP datagrams, and may well
* re-try an unlock that has already succeeded.
*/
nlm_res *
nlm_unlock_1_svc(nlm_unlockargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
struct nlm4_lock arg4;
nlmtonlm4(&arg->alock, &arg4);
if (debug_level)
log_from_addr("nlm_unlock", rqstp);
res.stat.stat = unlock(&arg4, 0);
res.cookie = arg->cookie;
return (&res);
}
void *
nlm_unlock_msg_1_svc(nlm_unlockargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
struct nlm4_lock arg4;
nlmtonlm4(&arg->alock, &arg4);
if (debug_level)
log_from_addr("nlm_unlock_msg", rqstp);
res.stat.stat = unlock(&arg4, 0);
res.cookie = arg->cookie;
transmit_result(NLM_UNLOCK_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* ------------------------------------------------------------------------- */
/*
* Client-side pseudo-RPCs for results. Note that for the client there
* are only nlm_xxx_msg() versions of each call, since the 'real RPC'
* version returns the results in the RPC result, and so the client
* does not normally receive incoming RPCs.
*
* The exception to this is nlm_granted(), which is genuinely an RPC
* call from the server to the client - a 'call-back' in normal procedure
* call terms.
*/
/* nlm_granted ------------------------------------------------------------- */
/*
* Purpose: Receive notification that formerly blocked lock now granted
* Returns: always success ('granted')
* Notes:
*/
nlm_res *
nlm_granted_1_svc(nlm_testargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
if (debug_level)
log_from_addr("nlm_granted", rqstp);
res.stat.stat = lock_answer(arg->alock.svid, &arg->cookie,
nlm_granted, NULL, NLM_VERS) == 0 ?
nlm_granted : nlm_denied;
/* copy cookie from arg to result. See comment in nlm_test_1() */
res.cookie = arg->cookie;
return (&res);
}
void *
nlm_granted_msg_1_svc(nlm_testargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
if (debug_level)
log_from_addr("nlm_granted_msg", rqstp);
res.cookie = arg->cookie;
res.stat.stat = lock_answer(arg->alock.svid, &arg->cookie,
nlm_granted, NULL, NLM_VERS) == 0 ?
nlm_granted : nlm_denied;
transmit_result(NLM_GRANTED_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* nlm_test_res ------------------------------------------------------------ */
/*
* Purpose: Accept result from earlier nlm_test_msg() call
* Returns: Nothing
*/
void *
nlm_test_res_1_svc(nlm_testres *arg, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm_test_res", rqstp);
(void)lock_answer(-1, &arg->cookie, arg->stat.stat,
&arg->stat.nlm_testrply_u.holder.svid, NLM_VERS);
return (NULL);
}
/* nlm_lock_res ------------------------------------------------------------ */
/*
* Purpose: Accept result from earlier nlm_lock_msg() call
* Returns: Nothing
*/
void *
nlm_lock_res_1_svc(nlm_res *arg, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm_lock_res", rqstp);
(void)lock_answer(-1, &arg->cookie, arg->stat.stat, NULL, NLM_VERS);
return (NULL);
}
/* nlm_cancel_res ---------------------------------------------------------- */
/*
* Purpose: Accept result from earlier nlm_cancel_msg() call
* Returns: Nothing
*/
void *
nlm_cancel_res_1_svc(nlm_res *arg __unused, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm_cancel_res", rqstp);
return (NULL);
}
/* nlm_unlock_res ---------------------------------------------------------- */
/*
* Purpose: Accept result from earlier nlm_unlock_msg() call
* Returns: Nothing
*/
void *
nlm_unlock_res_1_svc(nlm_res *arg, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm_unlock_res", rqstp);
lock_answer(-1, &arg->cookie, arg->stat.stat, NULL, NLM_VERS);
return (NULL);
}
/* nlm_granted_res --------------------------------------------------------- */
/*
* Purpose: Accept result from earlier nlm_granted_msg() call
* Returns: Nothing
*/
void *
nlm_granted_res_1_svc(nlm_res *arg __unused, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm_granted_res", rqstp);
return (NULL);
}
/* ------------------------------------------------------------------------- */
/*
* Calls for PCNFS locking (aka non-monitored locking, no involvement
* of rpc.statd).
*
* These are all genuine RPCs - no nlm_xxx_msg() nonsense here.
*/
/* nlm_share --------------------------------------------------------------- */
/*
* Purpose: Establish a DOS-style lock
* Returns: success or failure
* Notes: Blocking locks are not supported - client is expected
* to retry if required.
*/
nlm_shareres *
nlm_share_3_svc(nlm_shareargs *arg, struct svc_req *rqstp)
{
static nlm_shareres res;
if (debug_level)
log_from_addr("nlm_share", rqstp);
res.cookie = arg->cookie;
res.stat = nlm_granted;
res.sequence = 1234356; /* X/Open says this field is ignored? */
return (&res);
}
/* nlm_unshare ------------------------------------------------------------ */
/*
* Purpose: Release a DOS-style lock
* Returns: nlm_granted, unless in grace period
* Notes:
*/
nlm_shareres *
nlm_unshare_3_svc(nlm_shareargs *arg, struct svc_req *rqstp)
{
static nlm_shareres res;
if (debug_level)
log_from_addr("nlm_unshare", rqstp);
res.cookie = arg->cookie;
res.stat = nlm_granted;
res.sequence = 1234356; /* X/Open says this field is ignored? */
return (&res);
}
/* nlm_nm_lock ------------------------------------------------------------ */
/*
* Purpose: non-monitored version of nlm_lock()
* Returns: as for nlm_lock()
* Notes: These locks are in the same style as the standard nlm_lock,
* but the rpc.statd should not be called to establish a
* monitor for the client machine, since that machine is
* declared not to be running a rpc.statd, and so would not
* respond to the statd protocol.
*/
nlm_res *
nlm_nm_lock_3_svc(nlm_lockargs *arg, struct svc_req *rqstp)
{
static nlm_res res;
if (debug_level)
log_from_addr("nlm_nm_lock", rqstp);
/* copy cookie from arg to result. See comment in nlm_test_1() */
res.cookie = arg->cookie;
res.stat.stat = nlm_granted;
return (&res);
}
/* nlm_free_all ------------------------------------------------------------ */
/*
* Purpose: Release all locks held by a named client
* Returns: Nothing
* Notes: Potential denial of service security problem here - the
* locks to be released are specified by a host name, independent
* of the address from which the request has arrived.
* Should probably be rejected if the named host has been
* using monitored locks.
*/
void *
nlm_free_all_3_svc(nlm_notify *arg __unused, struct svc_req *rqstp)
{
static char dummy;
if (debug_level)
log_from_addr("nlm_free_all", rqstp);
return (&dummy);
}
/* calls for nlm version 4 (NFSv3) */
/* nlm_test ---------------------------------------------------------------- */
/*
* Purpose: Test whether a specified lock would be granted if requested
* Returns: nlm_granted (or error code)
* Notes:
*/
nlm4_testres *
nlm4_test_4_svc(nlm4_testargs *arg, struct svc_req *rqstp)
{
static nlm4_testres res;
struct nlm4_holder *holder;
if (debug_level)
log_from_addr("nlm4_test", rqstp);
if (debug_level > 5) {
syslog(LOG_DEBUG, "Locking arguments:\n");
log_netobj(&(arg->cookie));
syslog(LOG_DEBUG, "Alock arguments:\n");
syslog(LOG_DEBUG, "Caller Name: %s\n",arg->alock.caller_name);
syslog(LOG_DEBUG, "File Handle:\n");
log_netobj(&(arg->alock.fh));
syslog(LOG_DEBUG, "Owner Handle:\n");
log_netobj(&(arg->alock.oh));
syslog(LOG_DEBUG, "SVID: %d\n", arg->alock.svid);
syslog(LOG_DEBUG, "Lock Offset: %llu\n",
(unsigned long long)arg->alock.l_offset);
syslog(LOG_DEBUG, "Lock Length: %llu\n",
(unsigned long long)arg->alock.l_len);
syslog(LOG_DEBUG, "Exclusive: %s\n",
(arg->exclusive ? "true" : "false"));
}
holder = testlock(&arg->alock, arg->exclusive, LOCK_V4);
/*
* Copy the cookie from the argument into the result. Note that this
* is slightly hazardous, as the structure contains a pointer to a
* malloc()ed buffer that will get freed by the caller. However, the
* main function transmits the result before freeing the argument
* so it is in fact safe.
*/
res.cookie = arg->cookie;
if (holder == NULL) {
res.stat.stat = nlm4_granted;
} else {
res.stat.stat = nlm4_denied;
memcpy(&res.stat.nlm4_testrply_u.holder, holder,
sizeof(struct nlm4_holder));
}
return (&res);
}
void *
nlm4_test_msg_4_svc(nlm4_testargs *arg, struct svc_req *rqstp)
{
nlm4_testres res;
static char dummy;
struct sockaddr *addr;
CLIENT *cli;
int success;
struct timeval timeo;
struct nlm4_holder *holder;
if (debug_level)
log_from_addr("nlm4_test_msg", rqstp);
holder = testlock(&arg->alock, arg->exclusive, LOCK_V4);
res.cookie = arg->cookie;
if (holder == NULL) {
res.stat.stat = nlm4_granted;
} else {
res.stat.stat = nlm4_denied;
memcpy(&res.stat.nlm4_testrply_u.holder, holder,
sizeof(struct nlm4_holder));
}
/*
* nlm_test has different result type to the other operations, so
* can't use transmit4_result() in this case
*/
addr = svc_getrpccaller(rqstp->rq_xprt)->buf;
if ((cli = get_client(addr, NLM_VERS4)) != NULL) {
timeo.tv_sec = 0; /* No timeout - not expecting response */
timeo.tv_usec = 0;
success = clnt_call(cli, NLM4_TEST_RES,
(xdrproc_t)xdr_nlm4_testres, &res,
(xdrproc_t)xdr_void, &dummy, timeo);
if (debug_level > 2)
syslog(LOG_DEBUG, "clnt_call returns %d", success);
}
return (NULL);
}
/* nlm_lock ---------------------------------------------------------------- */
/*
* Purposes: Establish a lock
* Returns: granted, denied or blocked
* Notes: *** grace period support missing
*/
nlm4_res *
nlm4_lock_4_svc(nlm4_lockargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_lock", rqstp);
if (debug_level > 5) {
syslog(LOG_DEBUG, "Locking arguments:\n");
log_netobj(&(arg->cookie));
syslog(LOG_DEBUG, "Alock arguments:\n");
syslog(LOG_DEBUG, "Caller Name: %s\n",arg->alock.caller_name);
syslog(LOG_DEBUG, "File Handle:\n");
log_netobj(&(arg->alock.fh));
syslog(LOG_DEBUG, "Owner Handle:\n");
log_netobj(&(arg->alock.oh));
syslog(LOG_DEBUG, "SVID: %d\n", arg->alock.svid);
syslog(LOG_DEBUG, "Lock Offset: %llu\n",
(unsigned long long)arg->alock.l_offset);
syslog(LOG_DEBUG, "Lock Length: %llu\n",
(unsigned long long)arg->alock.l_len);
syslog(LOG_DEBUG, "Block: %s\n", (arg->block ? "true" : "false"));
syslog(LOG_DEBUG, "Exclusive: %s\n", (arg->exclusive ? "true" : "false"));
syslog(LOG_DEBUG, "Reclaim: %s\n", (arg->reclaim ? "true" : "false"));
syslog(LOG_DEBUG, "State num: %d\n", arg->state);
}
/* copy cookie from arg to result. See comment in nlm_test_4() */
res.cookie = arg->cookie;
res.stat.stat = (enum nlm4_stats)getlock(arg, rqstp, LOCK_MON | LOCK_V4);
return (&res);
}
void *
nlm4_lock_msg_4_svc(nlm4_lockargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_lock_msg", rqstp);
res.cookie = arg->cookie;
res.stat.stat = (enum nlm4_stats)getlock(arg, rqstp, LOCK_MON | LOCK_ASYNC | LOCK_V4);
transmit4_result(NLM4_LOCK_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* nlm_cancel -------------------------------------------------------------- */
/*
* Purpose: Cancel a blocked lock request
* Returns: granted or denied
* Notes:
*/
nlm4_res *
nlm4_cancel_4_svc(nlm4_cancargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_cancel", rqstp);
/* copy cookie from arg to result. See comment in nlm_test_1() */
res.cookie = arg->cookie;
/*
* Since at present we never return 'nlm_blocked', there can never be
* a lock to cancel, so this call always fails.
*/
res.stat.stat = (enum nlm4_stats)unlock(&arg->alock, LOCK_CANCEL);
return (&res);
}
void *
nlm4_cancel_msg_4_svc(nlm4_cancargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_cancel_msg", rqstp);
res.cookie = arg->cookie;
/*
* Since at present we never return 'nlm_blocked', there can never be
* a lock to cancel, so this call always fails.
*/
res.stat.stat = (enum nlm4_stats)unlock(&arg->alock, LOCK_CANCEL | LOCK_V4);
transmit4_result(NLM4_CANCEL_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* nlm_unlock -------------------------------------------------------------- */
/*
* Purpose: Release an existing lock
* Returns: Always granted, unless during grace period
* Notes: "no such lock" error condition is ignored, as the
* protocol uses unreliable UDP datagrams, and may well
* re-try an unlock that has already succeeded.
*/
nlm4_res *
nlm4_unlock_4_svc(nlm4_unlockargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_unlock", rqstp);
res.stat.stat = (enum nlm4_stats)unlock(&arg->alock, LOCK_V4);
res.cookie = arg->cookie;
return (&res);
}
void *
nlm4_unlock_msg_4_svc(nlm4_unlockargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_unlock_msg", rqstp);
res.stat.stat = (enum nlm4_stats)unlock(&arg->alock, LOCK_V4);
res.cookie = arg->cookie;
transmit4_result(NLM4_UNLOCK_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* ------------------------------------------------------------------------- */
/*
* Client-side pseudo-RPCs for results. Note that for the client there
* are only nlm_xxx_msg() versions of each call, since the 'real RPC'
* version returns the results in the RPC result, and so the client
* does not normally receive incoming RPCs.
*
* The exception to this is nlm_granted(), which is genuinely an RPC
* call from the server to the client - a 'call-back' in normal procedure
* call terms.
*/
/* nlm_granted ------------------------------------------------------------- */
/*
* Purpose: Receive notification that formerly blocked lock now granted
* Returns: always success ('granted')
* Notes:
*/
nlm4_res *
nlm4_granted_4_svc(nlm4_testargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_granted", rqstp);
res.stat.stat = lock_answer(arg->alock.svid, &arg->cookie,
nlm4_granted, NULL, NLM_VERS4) == 0 ?
nlm4_granted : nlm4_denied;
/* copy cookie from arg to result. See comment in nlm_test_1() */
res.cookie = arg->cookie;
return (&res);
}
void *
nlm4_granted_msg_4_svc(nlm4_testargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_granted_msg", rqstp);
res.cookie = arg->cookie;
res.stat.stat = lock_answer(arg->alock.svid, &arg->cookie,
nlm4_granted, NULL, NLM_VERS4) == 0 ?
nlm4_granted : nlm4_denied;
transmit4_result(NLM4_GRANTED_RES, &res, getrpcaddr(rqstp));
return (NULL);
}
/* nlm_test_res ------------------------------------------------------------ */
/*
* Purpose: Accept result from earlier nlm_test_msg() call
* Returns: Nothing
*/
void *
nlm4_test_res_4_svc(nlm4_testres *arg, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm4_test_res", rqstp);
(void)lock_answer(-1, &arg->cookie, arg->stat.stat,
(int *)&arg->stat.nlm4_testrply_u.holder.svid,
NLM_VERS4);
return (NULL);
}
/* nlm_lock_res ------------------------------------------------------------ */
/*
* Purpose: Accept result from earlier nlm_lock_msg() call
* Returns: Nothing
*/
void *
nlm4_lock_res_4_svc(nlm4_res *arg, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm4_lock_res", rqstp);
(void)lock_answer(-1, &arg->cookie, arg->stat.stat, NULL, NLM_VERS4);
return (NULL);
}
/* nlm_cancel_res ---------------------------------------------------------- */
/*
* Purpose: Accept result from earlier nlm_cancel_msg() call
* Returns: Nothing
*/
void *
nlm4_cancel_res_4_svc(nlm4_res *arg __unused, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm4_cancel_res", rqstp);
return (NULL);
}
/* nlm_unlock_res ---------------------------------------------------------- */
/*
* Purpose: Accept result from earlier nlm_unlock_msg() call
* Returns: Nothing
*/
void *
nlm4_unlock_res_4_svc(nlm4_res *arg __unused, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm4_unlock_res", rqstp);
return (NULL);
}
/* nlm_granted_res --------------------------------------------------------- */
/*
* Purpose: Accept result from earlier nlm_granted_msg() call
* Returns: Nothing
*/
void *
nlm4_granted_res_4_svc(nlm4_res *arg __unused, struct svc_req *rqstp)
{
if (debug_level)
log_from_addr("nlm4_granted_res", rqstp);
return (NULL);
}
/* ------------------------------------------------------------------------- */
/*
* Calls for PCNFS locking (aka non-monitored locking, no involvement
* of rpc.statd).
*
* These are all genuine RPCs - no nlm_xxx_msg() nonsense here.
*/
/* nlm_share --------------------------------------------------------------- */
/*
* Purpose: Establish a DOS-style lock
* Returns: success or failure
* Notes: Blocking locks are not supported - client is expected
* to retry if required.
*/
nlm4_shareres *
nlm4_share_4_svc(nlm4_shareargs *arg, struct svc_req *rqstp)
{
static nlm4_shareres res;
if (debug_level)
log_from_addr("nlm4_share", rqstp);
res.cookie = arg->cookie;
res.stat = nlm4_granted;
res.sequence = 1234356; /* X/Open says this field is ignored? */
return (&res);
}
/* nlm4_unshare ------------------------------------------------------------ */
/*
* Purpose: Release a DOS-style lock
* Returns: nlm_granted, unless in grace period
* Notes:
*/
nlm4_shareres *
nlm4_unshare_4_svc(nlm4_shareargs *arg, struct svc_req *rqstp)
{
static nlm4_shareres res;
if (debug_level)
log_from_addr("nlm_unshare", rqstp);
res.cookie = arg->cookie;
res.stat = nlm4_granted;
res.sequence = 1234356; /* X/Open says this field is ignored? */
return (&res);
}
/* nlm4_nm_lock ------------------------------------------------------------ */
/*
* Purpose: non-monitored version of nlm4_lock()
* Returns: as for nlm4_lock()
* Notes: These locks are in the same style as the standard nlm4_lock,
* but the rpc.statd should not be called to establish a
* monitor for the client machine, since that machine is
* declared not to be running a rpc.statd, and so would not
* respond to the statd protocol.
*/
nlm4_res *
nlm4_nm_lock_4_svc(nlm4_lockargs *arg, struct svc_req *rqstp)
{
static nlm4_res res;
if (debug_level)
log_from_addr("nlm4_nm_lock", rqstp);
/* copy cookie from arg to result. See comment in nlm4_test_1() */
res.cookie = arg->cookie;
res.stat.stat = nlm4_granted;
return (&res);
}
/* nlm4_free_all ------------------------------------------------------------ */
/*
* Purpose: Release all locks held by a named client
* Returns: Nothing
* Notes: Potential denial of service security problem here - the
* locks to be released are specified by a host name, independent
* of the address from which the request has arrived.
* Should probably be rejected if the named host has been
* using monitored locks.
*/
void *
nlm4_free_all_4_svc(struct nlm4_notify *arg __unused, struct svc_req *rqstp)
{
static char dummy;
if (debug_level)
log_from_addr("nlm4_free_all", rqstp);
return (&dummy);
}
/* nlm_sm_notify --------------------------------------------------------- */
/*
* Purpose: called by rpc.statd when a monitored host state changes.
* Returns: Nothing
*/
void *
nlm_sm_notify_0_svc(struct nlm_sm_status *arg, struct svc_req *rqstp __unused)
{
static char dummy;
notify(arg->mon_name, arg->state);
return (&dummy);
}
diff --git a/usr.sbin/rpc.lockd/lockd.c b/usr.sbin/rpc.lockd/lockd.c
index 24dacc81a37a..35953f32692e 100644
--- a/usr.sbin/rpc.lockd/lockd.c
+++ b/usr.sbin/rpc.lockd/lockd.c
@@ -1,911 +1,910 @@
/* $NetBSD: lockd.c,v 1.7 2000/08/12 18:08:44 thorpej Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1995
* A.R. Gordon (andrew.gordon@net-tel.co.uk). All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the FreeBSD project
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY ANDREW GORDON AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
#include <sys/cdefs.h>
#ifndef lint
__RCSID("$NetBSD: lockd.c,v 1.7 2000/08/12 18:08:44 thorpej Exp $");
#endif
/*
* main() function for NFS lock daemon. Most of the code in this
* file was generated by running rpcgen /usr/include/rpcsvc/nlm_prot.x.
*
* The actual program logic is in the file lock_proc.c
*/
#include <sys/param.h>
#include <sys/linker.h>
#include <sys/module.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <syslog.h>
#include <signal.h>
#include <string.h>
#include <unistd.h>
#include <libutil.h>
#include <netconfig.h>
#include <netdb.h>
#include <rpc/rpc.h>
#include <rpc/rpc_com.h>
#include <rpcsvc/sm_inter.h>
#include "lockd.h"
#include <rpcsvc/nlm_prot.h>
#define GETPORT_MAXTRY 20 /* Max tries to get a port # */
int debug_level = 0; /* 0 = no debugging syslog() calls */
int _rpcsvcdirty = 0;
int grace_expired;
int nsm_state;
int kernel_lockd;
int kernel_lockd_client;
pid_t client_pid;
struct mon mon_host;
char **hosts, *svcport_str = NULL;
static int mallocd_svcport = 0;
static int *sock_fd;
static int sock_fdcnt;
static int sock_fdpos;
int nhosts = 0;
int xcreated = 0;
char **addrs; /* actually (netid, uaddr) pairs */
int naddrs; /* count of how many (netid, uaddr) pairs */
char localhost[] = "localhost";
static int create_service(struct netconfig *nconf);
static void complete_service(struct netconfig *nconf, char *port_str);
static void clearout_service(void);
static void out_of_mem(void) __dead2;
void init_nsm(void);
void usage(void);
void sigalarm_handler(void);
/*
* XXX move to some header file.
*/
#define _PATH_RPCLOCKDSOCK "/var/run/rpclockd.sock"
int
main(int argc, char **argv)
{
int ch, i, s;
void *nc_handle;
char *endptr, **hosts_bak;
struct sigaction sigalarm;
int grace_period = 30;
int foreground = 0;
struct netconfig *nconf;
int have_v6 = 1;
int maxrec = RPC_MAXDATASIZE;
in_port_t svcport = 0;
int attempt_cnt, port_len, port_pos, ret;
char **port_list;
while ((ch = getopt(argc, argv, "d:Fg:h:p:")) != (-1)) {
switch (ch) {
case 'd':
debug_level = atoi(optarg);
if (!debug_level) {
usage();
/* NOTREACHED */
}
break;
case 'F':
foreground = 1;
break;
case 'g':
grace_period = atoi(optarg);
if (!grace_period) {
usage();
/* NOTREACHED */
}
break;
case 'h':
++nhosts;
hosts_bak = realloc(hosts, nhosts * sizeof(char *));
if (hosts_bak == NULL) {
if (hosts != NULL) {
for (i = 0; i < nhosts; i++)
free(hosts[i]);
free(hosts);
out_of_mem();
}
}
hosts = hosts_bak;
hosts[nhosts - 1] = strdup(optarg);
if (hosts[nhosts - 1] == NULL) {
for (i = 0; i < (nhosts - 1); i++)
free(hosts[i]);
free(hosts);
out_of_mem();
}
break;
case 'p':
endptr = NULL;
svcport = (in_port_t)strtoul(optarg, &endptr, 10);
if (endptr == NULL || *endptr != '\0' ||
svcport == 0 || svcport >= IPPORT_MAX)
usage();
svcport_str = strdup(optarg);
break;
default:
usage();
/* NOTREACHED */
}
}
if (geteuid()) { /* This command allowed only to root */
fprintf(stderr, "Sorry. You are not superuser\n");
exit(1);
}
kernel_lockd = FALSE;
kernel_lockd_client = FALSE;
if (modfind("nfslockd") < 0) {
if (kldload("nfslockd") < 0) {
fprintf(stderr, "Can't find or load kernel support for rpc.lockd - using non-kernel implementation\n");
} else {
kernel_lockd = TRUE;
}
} else {
kernel_lockd = TRUE;
}
if (kernel_lockd) {
if (getosreldate() >= 800040)
kernel_lockd_client = TRUE;
}
(void)rpcb_unset(NLM_PROG, NLM_SM, NULL);
(void)rpcb_unset(NLM_PROG, NLM_VERS, NULL);
(void)rpcb_unset(NLM_PROG, NLM_VERSX, NULL);
(void)rpcb_unset(NLM_PROG, NLM_VERS4, NULL);
/*
* Check if IPv6 support is present.
*/
s = socket(AF_INET6, SOCK_DGRAM, IPPROTO_UDP);
if (s < 0)
have_v6 = 0;
else
close(s);
rpc_control(RPC_SVC_CONNMAXREC_SET, &maxrec);
/*
* If no hosts were specified, add a wildcard entry to bind to
* INADDR_ANY. Otherwise make sure 127.0.0.1 and ::1 are added to the
* list.
*/
if (nhosts == 0) {
hosts = malloc(sizeof(char *));
if (hosts == NULL)
out_of_mem();
hosts[0] = strdup("*");
nhosts = 1;
} else {
if (have_v6) {
hosts_bak = realloc(hosts, (nhosts + 2) *
sizeof(char *));
if (hosts_bak == NULL) {
for (i = 0; i < nhosts; i++)
free(hosts[i]);
free(hosts);
out_of_mem();
} else
hosts = hosts_bak;
nhosts += 2;
hosts[nhosts - 2] = strdup("::1");
} else {
hosts_bak = realloc(hosts, (nhosts + 1) * sizeof(char *));
if (hosts_bak == NULL) {
for (i = 0; i < nhosts; i++)
free(hosts[i]);
free(hosts);
out_of_mem();
} else {
nhosts += 1;
hosts = hosts_bak;
}
}
hosts[nhosts - 1] = strdup("127.0.0.1");
}
if (kernel_lockd) {
if (!kernel_lockd_client) {
/*
* For the case where we have a kernel lockd but it
* doesn't provide client locking, we run a cut-down
* RPC service on a local-domain socket. The kernel's
* RPC server will pass what it can't handle (mainly
* client replies) down to us.
*/
struct sockaddr_un sun;
int fd, oldmask;
SVCXPRT *xprt;
memset(&sun, 0, sizeof sun);
sun.sun_family = AF_LOCAL;
unlink(_PATH_RPCLOCKDSOCK);
strcpy(sun.sun_path, _PATH_RPCLOCKDSOCK);
sun.sun_len = SUN_LEN(&sun);
fd = socket(AF_LOCAL, SOCK_STREAM, 0);
if (!fd) {
err(1, "Can't create local lockd socket");
}
oldmask = umask(S_IXUSR|S_IRWXG|S_IRWXO);
if (bind(fd, (struct sockaddr *) &sun, sun.sun_len) < 0) {
err(1, "Can't bind local lockd socket");
}
umask(oldmask);
if (listen(fd, SOMAXCONN) < 0) {
err(1, "Can't listen on local lockd socket");
}
xprt = svc_vc_create(fd, RPC_MAXDATASIZE, RPC_MAXDATASIZE);
if (!xprt) {
err(1, "Can't create transport for local lockd socket");
}
if (!svc_reg(xprt, NLM_PROG, NLM_VERS4, nlm_prog_4, NULL)) {
err(1, "Can't register service for local lockd socket");
}
}
/*
* We need to look up the addresses so that we can
* hand uaddrs (ascii encoded address+port strings) to
* the kernel.
*/
nc_handle = setnetconfig();
while ((nconf = getnetconfig(nc_handle))) {
/* We want to listen only on udp6, tcp6, udp, tcp transports */
if (nconf->nc_flag & NC_VISIBLE) {
/* Skip if there's no IPv6 support */
if (have_v6 == 0 && strcmp(nconf->nc_protofmly, "inet6") == 0) {
/* DO NOTHING */
} else {
create_service(nconf);
}
}
}
endnetconfig(nc_handle);
} else {
attempt_cnt = 1;
sock_fdcnt = 0;
sock_fd = NULL;
port_list = NULL;
port_len = 0;
nc_handle = setnetconfig();
while ((nconf = getnetconfig(nc_handle))) {
/* We want to listen only on udp6, tcp6, udp, tcp transports */
if (nconf->nc_flag & NC_VISIBLE) {
/* Skip if there's no IPv6 support */
if (have_v6 == 0 && strcmp(nconf->nc_protofmly, "inet6") == 0) {
/* DO NOTHING */
} else {
ret = create_service(nconf);
if (ret == 1)
/* Ignore this call */
continue;
if (ret < 0) {
/*
* Failed to bind port, so close
* off all sockets created and
* try again if the port# was
* dynamically assigned via
* bind(2).
*/
clearout_service();
if (mallocd_svcport != 0 &&
attempt_cnt <
GETPORT_MAXTRY) {
free(svcport_str);
svcport_str = NULL;
mallocd_svcport = 0;
} else {
errno = EADDRINUSE;
syslog(LOG_ERR,
"bindresvport_sa: %m");
exit(1);
}
/*
* Start over at the first
* service.
*/
free(sock_fd);
sock_fdcnt = 0;
sock_fd = NULL;
nc_handle = setnetconfig();
attempt_cnt++;
} else if (mallocd_svcport != 0 &&
attempt_cnt == GETPORT_MAXTRY) {
/*
* For the last attempt, allow
* different port #s for each
* nconf by saving the
* svcport_str and setting it
* back to NULL.
*/
port_list = realloc(port_list,
(port_len + 1) *
sizeof(char *));
if (port_list == NULL)
out_of_mem();
port_list[port_len++] =
svcport_str;
svcport_str = NULL;
mallocd_svcport = 0;
}
}
}
}
/*
* Successfully bound the ports, so call complete_service() to
* do the rest of the setup on the service(s).
*/
sock_fdpos = 0;
port_pos = 0;
nc_handle = setnetconfig();
while ((nconf = getnetconfig(nc_handle))) {
/* We want to listen only on udp6, tcp6, udp, tcp transports */
if (nconf->nc_flag & NC_VISIBLE) {
/* Skip if there's no IPv6 support */
if (have_v6 == 0 && strcmp(nconf->nc_protofmly, "inet6") == 0) {
/* DO NOTHING */
} else if (port_list != NULL) {
if (port_pos >= port_len) {
syslog(LOG_ERR,
"too many port#s");
exit(1);
}
complete_service(nconf,
port_list[port_pos++]);
} else
complete_service(nconf, svcport_str);
}
}
endnetconfig(nc_handle);
free(sock_fd);
if (port_list != NULL) {
for (port_pos = 0; port_pos < port_len; port_pos++)
free(port_list[port_pos]);
free(port_list);
}
}
/*
* Note that it is NOT sensible to run this program from inetd - the
* protocol assumes that it will run immediately at boot time.
*/
if ((foreground == 0) && daemon(0, 0)) {
err(1, "cannot fork");
/* NOTREACHED */
}
openlog("rpc.lockd", 0, LOG_DAEMON);
if (debug_level)
syslog(LOG_INFO, "Starting, debug level %d", debug_level);
else
syslog(LOG_INFO, "Starting");
sigalarm.sa_handler = (sig_t) sigalarm_handler;
sigemptyset(&sigalarm.sa_mask);
sigalarm.sa_flags = SA_RESETHAND; /* should only happen once */
sigalarm.sa_flags |= SA_RESTART;
if (sigaction(SIGALRM, &sigalarm, NULL) != 0) {
syslog(LOG_WARNING, "sigaction(SIGALRM) failed: %s",
strerror(errno));
exit(1);
}
if (kernel_lockd) {
if (!kernel_lockd_client) {
init_nsm();
client_pid = client_request();
/*
* Create a child process to enter the kernel and then
* wait for RPCs on our local domain socket.
*/
if (!fork())
nlm_syscall(debug_level, grace_period,
naddrs, addrs);
else
svc_run();
} else {
/*
* The kernel lockd implementation provides
* both client and server so we don't need to
* do anything else.
*/
nlm_syscall(debug_level, grace_period, naddrs, addrs);
}
} else {
grace_expired = 0;
alarm(grace_period);
init_nsm();
client_pid = client_request();
svc_run(); /* Should never return */
}
exit(1);
}
/*
* This routine creates and binds sockets on the appropriate
* addresses if lockd for user NLM, or perform a lookup of
* addresses for the kernel to create transports.
*
* It gets called one time for each transport.
*
* It returns 0 upon success, 1 for ignore the call and -1 to indicate
* bind failed with EADDRINUSE.
*
* Any file descriptors that have been created are stored in sock_fd and
* the total count of them is maintained in sock_fdcnt.
*/
static int
create_service(struct netconfig *nconf)
{
struct addrinfo hints, *res = NULL;
struct sockaddr_in *sin;
struct sockaddr_in6 *sin6;
struct __rpc_sockinfo si;
int aicode;
int fd;
int nhostsbak;
int r;
u_int32_t host_addr[4]; /* IPv4 or IPv6 */
int mallocd_res;
if ((nconf->nc_semantics != NC_TPI_CLTS) &&
(nconf->nc_semantics != NC_TPI_COTS) &&
(nconf->nc_semantics != NC_TPI_COTS_ORD))
return (1); /* not my type */
/*
* XXX - using RPC library internal functions.
*/
if (!__rpc_nconf2sockinfo(nconf, &si)) {
syslog(LOG_ERR, "cannot get information for %s",
nconf->nc_netid);
return (1);
}
/* Get rpc.statd's address on this transport */
memset(&hints, 0, sizeof hints);
hints.ai_family = si.si_af;
hints.ai_socktype = si.si_socktype;
hints.ai_protocol = si.si_proto;
/*
* Bind to specific IPs if asked to
*/
nhostsbak = nhosts;
while (nhostsbak > 0) {
--nhostsbak;
mallocd_res = 0;
hints.ai_flags = AI_PASSIVE;
if (!kernel_lockd) {
sock_fd = realloc(sock_fd, (sock_fdcnt + 1) * sizeof(int));
if (sock_fd == NULL)
out_of_mem();
sock_fd[sock_fdcnt++] = -1; /* Set invalid for now. */
/*
* XXX - using RPC library internal functions.
*/
if ((fd = __rpc_nconf2fd(nconf)) < 0) {
syslog(LOG_ERR, "cannot create socket for %s",
nconf->nc_netid);
continue;
}
}
switch (hints.ai_family) {
case AF_INET:
if (inet_pton(AF_INET, hosts[nhostsbak],
host_addr) == 1) {
hints.ai_flags |= AI_NUMERICHOST;
} else {
/*
* Skip if we have an AF_INET6 address.
*/
if (inet_pton(AF_INET6, hosts[nhostsbak],
host_addr) == 1) {
if (!kernel_lockd)
close(fd);
continue;
}
}
break;
case AF_INET6:
if (inet_pton(AF_INET6, hosts[nhostsbak],
host_addr) == 1) {
hints.ai_flags |= AI_NUMERICHOST;
} else {
/*
* Skip if we have an AF_INET address.
*/
if (inet_pton(AF_INET, hosts[nhostsbak],
host_addr) == 1) {
if (!kernel_lockd)
close(fd);
continue;
}
}
break;
default:
break;
}
/*
* If no hosts were specified, just bind to INADDR_ANY
*/
if (strcmp("*", hosts[nhostsbak]) == 0) {
if (svcport_str == NULL) {
if ((res = malloc(sizeof(struct addrinfo))) == NULL)
out_of_mem();
mallocd_res = 1;
res->ai_flags = hints.ai_flags;
res->ai_family = hints.ai_family;
res->ai_protocol = hints.ai_protocol;
switch (res->ai_family) {
case AF_INET:
sin = malloc(sizeof(struct sockaddr_in));
if (sin == NULL)
out_of_mem();
sin->sin_family = AF_INET;
sin->sin_port = htons(0);
sin->sin_addr.s_addr = htonl(INADDR_ANY);
res->ai_addr = (struct sockaddr*) sin;
res->ai_addrlen = (socklen_t)
sizeof(struct sockaddr_in);
break;
case AF_INET6:
sin6 = malloc(sizeof(struct sockaddr_in6));
if (sin6 == NULL)
out_of_mem();
sin6->sin6_family = AF_INET6;
sin6->sin6_port = htons(0);
sin6->sin6_addr = in6addr_any;
res->ai_addr = (struct sockaddr*) sin6;
res->ai_addrlen = (socklen_t)
sizeof(struct sockaddr_in6);
break;
default:
syslog(LOG_ERR,
"bad address family %d",
res->ai_family);
exit(1);
}
} else {
if ((aicode = getaddrinfo(NULL, svcport_str,
&hints, &res)) != 0) {
syslog(LOG_ERR,
"cannot get local address for %s: %s",
nconf->nc_netid,
gai_strerror(aicode));
if (!kernel_lockd)
close(fd);
continue;
}
}
} else {
if ((aicode = getaddrinfo(hosts[nhostsbak], svcport_str,
&hints, &res)) != 0) {
syslog(LOG_ERR,
"cannot get local address for %s: %s",
nconf->nc_netid, gai_strerror(aicode));
if (!kernel_lockd)
close(fd);
continue;
}
}
if (kernel_lockd) {
struct netbuf servaddr;
char *uaddr;
/*
* Look up addresses for the kernel to create transports for.
*/
servaddr.len = servaddr.maxlen = res->ai_addrlen;
servaddr.buf = res->ai_addr;
uaddr = taddr2uaddr(nconf, &servaddr);
addrs = realloc(addrs, 2 * (naddrs + 1) * sizeof(char *));
if (!addrs)
out_of_mem();
addrs[2 * naddrs] = strdup(nconf->nc_netid);
addrs[2 * naddrs + 1] = uaddr;
naddrs++;
} else {
/* Store the fd. */
sock_fd[sock_fdcnt - 1] = fd;
/* Now, attempt the bind. */
r = bindresvport_sa(fd, res->ai_addr);
if (r != 0) {
if (errno == EADDRINUSE && mallocd_svcport != 0) {
if (mallocd_res != 0) {
free(res->ai_addr);
free(res);
} else
freeaddrinfo(res);
return (-1);
}
syslog(LOG_ERR, "bindresvport_sa: %m");
exit(1);
}
if (svcport_str == NULL) {
svcport_str = malloc(NI_MAXSERV * sizeof(char));
if (svcport_str == NULL)
out_of_mem();
mallocd_svcport = 1;
if (getnameinfo(res->ai_addr,
res->ai_addr->sa_len, NULL, NI_MAXHOST,
svcport_str, NI_MAXSERV * sizeof(char),
NI_NUMERICHOST | NI_NUMERICSERV))
errx(1, "Cannot get port number");
}
}
if (mallocd_res != 0) {
free(res->ai_addr);
free(res);
} else
freeaddrinfo(res);
res = NULL;
}
return (0);
}
/*
* Called after all the create_service() calls have succeeded, to complete
* the setup and registration.
*/
static void
complete_service(struct netconfig *nconf, char *port_str)
{
struct addrinfo hints, *res = NULL;
struct __rpc_sockinfo si;
struct netbuf servaddr;
SVCXPRT *transp = NULL;
int aicode, fd, nhostsbak;
int registered = 0;
if ((nconf->nc_semantics != NC_TPI_CLTS) &&
(nconf->nc_semantics != NC_TPI_COTS) &&
(nconf->nc_semantics != NC_TPI_COTS_ORD))
return; /* not my type */
/*
* XXX - using RPC library internal functions.
*/
if (!__rpc_nconf2sockinfo(nconf, &si)) {
syslog(LOG_ERR, "cannot get information for %s",
nconf->nc_netid);
return;
}
nhostsbak = nhosts;
while (nhostsbak > 0) {
--nhostsbak;
if (sock_fdpos >= sock_fdcnt) {
/* Should never happen. */
syslog(LOG_ERR, "Ran out of socket fd's");
return;
}
fd = sock_fd[sock_fdpos++];
if (fd < 0)
continue;
if (nconf->nc_semantics != NC_TPI_CLTS)
listen(fd, SOMAXCONN);
transp = svc_tli_create(fd, nconf, NULL,
RPC_MAXDATASIZE, RPC_MAXDATASIZE);
if (transp != (SVCXPRT *) NULL) {
if (!svc_reg(transp, NLM_PROG, NLM_SM, nlm_prog_0,
NULL))
syslog(LOG_ERR,
"can't register %s NLM_PROG, NLM_SM service",
nconf->nc_netid);
if (!svc_reg(transp, NLM_PROG, NLM_VERS, nlm_prog_1,
NULL))
syslog(LOG_ERR,
"can't register %s NLM_PROG, NLM_VERS service",
nconf->nc_netid);
if (!svc_reg(transp, NLM_PROG, NLM_VERSX, nlm_prog_3,
NULL))
syslog(LOG_ERR,
"can't register %s NLM_PROG, NLM_VERSX service",
nconf->nc_netid);
if (!svc_reg(transp, NLM_PROG, NLM_VERS4, nlm_prog_4,
NULL))
syslog(LOG_ERR,
"can't register %s NLM_PROG, NLM_VERS4 service",
nconf->nc_netid);
} else
syslog(LOG_WARNING, "can't create %s services",
nconf->nc_netid);
if (registered == 0) {
registered = 1;
memset(&hints, 0, sizeof hints);
hints.ai_flags = AI_PASSIVE;
hints.ai_family = si.si_af;
hints.ai_socktype = si.si_socktype;
hints.ai_protocol = si.si_proto;
if ((aicode = getaddrinfo(NULL, port_str, &hints,
&res)) != 0) {
syslog(LOG_ERR, "cannot get local address: %s",
gai_strerror(aicode));
exit(1);
}
servaddr.buf = malloc(res->ai_addrlen);
memcpy(servaddr.buf, res->ai_addr, res->ai_addrlen);
servaddr.len = res->ai_addrlen;
rpcb_set(NLM_PROG, NLM_SM, nconf, &servaddr);
rpcb_set(NLM_PROG, NLM_VERS, nconf, &servaddr);
rpcb_set(NLM_PROG, NLM_VERSX, nconf, &servaddr);
rpcb_set(NLM_PROG, NLM_VERS4, nconf, &servaddr);
xcreated++;
freeaddrinfo(res);
}
} /* end while */
}
/*
* Clear out sockets after a failure to bind one of them, so that the
* cycle of socket creation/binding can start anew.
*/
static void
clearout_service(void)
{
int i;
for (i = 0; i < sock_fdcnt; i++) {
if (sock_fd[i] >= 0) {
shutdown(sock_fd[i], SHUT_RDWR);
close(sock_fd[i]);
}
}
}
void
sigalarm_handler(void)
{
grace_expired = 1;
}
void
usage()
{
errx(1, "usage: rpc.lockd [-d <debuglevel>]"
" [-F] [-g <grace period>] [-h <bindip>] [-p <port>]");
}
/*
* init_nsm --
* Reset the NSM state-of-the-world and acquire its state.
*/
void
init_nsm(void)
{
enum clnt_stat ret;
my_id id;
sm_stat stat;
char name[] = "NFS NLM";
/*
* !!!
* The my_id structure isn't used by the SM_UNMON_ALL call, as far
* as I know. Leave it empty for now.
*/
memset(&id, 0, sizeof(id));
id.my_name = name;
/*
* !!!
* The statd program must already be registered when lockd runs.
*/
do {
ret = callrpc("localhost", SM_PROG, SM_VERS, SM_UNMON_ALL,
(xdrproc_t)xdr_my_id, &id, (xdrproc_t)xdr_sm_stat, &stat);
if (ret == RPC_PROGUNAVAIL) {
syslog(LOG_WARNING, "%lu %s", SM_PROG,
clnt_sperrno(ret));
sleep(2);
continue;
}
break;
} while (0);
if (ret != 0) {
syslog(LOG_ERR, "%lu %s", SM_PROG, clnt_sperrno(ret));
exit(1);
}
nsm_state = stat.state;
/* setup constant data for SM_MON calls */
mon_host.mon_id.my_id.my_name = localhost;
mon_host.mon_id.my_id.my_prog = NLM_PROG;
mon_host.mon_id.my_id.my_vers = NLM_SM;
mon_host.mon_id.my_id.my_proc = NLM_SM_NOTIFY; /* bsdi addition */
}
/*
* Out of memory, fatal
*/
void out_of_mem()
{
syslog(LOG_ERR, "out of memory");
exit(2);
}
diff --git a/usr.sbin/rpc.lockd/lockd.h b/usr.sbin/rpc.lockd/lockd.h
index 23cb19fd79c6..ae73c075e4bb 100644
--- a/usr.sbin/rpc.lockd/lockd.h
+++ b/usr.sbin/rpc.lockd/lockd.h
@@ -1,43 +1,42 @@
/* $NetBSD: lockd.h,v 1.2 2000/06/07 14:34:40 bouyer Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-4-Clause
*
* Copyright (c) 1995
* A.R. Gordon (andrew.gordon@net-tel.co.uk). All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed for the FreeBSD project
* 4. Neither the name of the author nor the names of any co-contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY ANDREW GORDON AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
extern int debug_level;
extern int grace_expired;
pid_t client_request(void);
extern int nsm_state;
extern pid_t client_pid;
diff --git a/usr.sbin/rpc.lockd/lockd_lock.h b/usr.sbin/rpc.lockd/lockd_lock.h
index 62f6981151ed..31f0913fd067 100644
--- a/usr.sbin/rpc.lockd/lockd_lock.h
+++ b/usr.sbin/rpc.lockd/lockd_lock.h
@@ -1,25 +1,24 @@
/* $NetBSD: lockd_lock.h,v 1.2 2000/06/09 14:00:54 fvdl Exp $ */
-/* $FreeBSD$ */
/* Headers and function declarations for file-locking utilities */
struct nlm4_holder * testlock(struct nlm4_lock *lock, bool_t exclusive,
int flags);
enum nlm_stats getlock(nlm4_lockargs *lckarg, struct svc_req *rqstp,
const int flags);
enum nlm_stats unlock(nlm4_lock *lock, const int flags);
int lock_answer(int pid, netobj *netcookie, int result, int *pid_p,
int version);
void notify(const char *hostname, const int state);
/* flags for testlock, getlock & unlock */
#define LOCK_ASYNC 0x01 /* async version (getlock only) */
#define LOCK_V4 0x02 /* v4 version */
#define LOCK_MON 0x04 /* monitored lock (getlock only) */
#define LOCK_CANCEL 0x08 /* cancel, not unlock request (unlock only) */
/* callbacks from lock_proc.c */
void transmit_result(int, nlm_res *, struct sockaddr *);
void transmit4_result(int, nlm4_res *, struct sockaddr *);
CLIENT *get_client(struct sockaddr *, rpcvers_t);
diff --git a/usr.sbin/rpcbind/check_bound.c b/usr.sbin/rpcbind/check_bound.c
index cf0a029dad72..9a68e1574c8f 100644
--- a/usr.sbin/rpcbind/check_bound.c
+++ b/usr.sbin/rpcbind/check_bound.c
@@ -1,242 +1,241 @@
/* $NetBSD: check_bound.c,v 1.2 2000/06/22 08:09:26 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/* #ident "@(#)check_bound.c 1.15 93/07/05 SMI" */
#if 0
#ifndef lint
static char sccsid[] = "@(#)check_bound.c 1.11 89/04/21 Copyr 1989 Sun Micro";
#endif
#endif
/*
* check_bound.c
* Checks to see whether the program is still bound to the
* claimed address and returns the universal merged address
*
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <rpc/rpc.h>
#include <rpc/svc_dg.h>
#include <netconfig.h>
#include <syslog.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include "rpcbind.h"
struct fdlist {
int fd;
struct netconfig *nconf;
struct fdlist *next;
int check_binding;
};
static struct fdlist *fdhead; /* Link list of the check fd's */
static struct fdlist *fdtail;
static char *nullstring = "";
static bool_t check_bound(struct fdlist *, char *uaddr);
/*
* Returns 1 if the given address is bound for the given addr & transport
* For all error cases, we assume that the address is bound
* Returns 0 for success.
*/
static bool_t
check_bound(struct fdlist *fdl, char *uaddr)
{
int fd;
struct netbuf *na;
int ans;
if (fdl->check_binding == FALSE)
return (TRUE);
na = uaddr2taddr(fdl->nconf, uaddr);
if (!na)
return (TRUE); /* punt, should never happen */
fd = __rpc_nconf2fd(fdl->nconf);
if (fd < 0) {
free(na->buf);
free(na);
return (TRUE);
}
ans = bind(fd, (struct sockaddr *)na->buf, na->len);
close(fd);
free(na->buf);
free(na);
return (ans == 0 ? FALSE : TRUE);
}
int
add_bndlist(struct netconfig *nconf, struct netbuf *baddr __unused)
{
struct fdlist *fdl;
struct netconfig *newnconf;
newnconf = getnetconfigent(nconf->nc_netid);
if (newnconf == NULL)
return (-1);
fdl = malloc(sizeof (struct fdlist));
if (fdl == NULL) {
freenetconfigent(newnconf);
syslog(LOG_ERR, "no memory!");
return (-1);
}
fdl->nconf = newnconf;
fdl->next = NULL;
if (fdhead == NULL) {
fdhead = fdl;
fdtail = fdl;
} else {
fdtail->next = fdl;
fdtail = fdl;
}
/* XXX no bound checking for now */
fdl->check_binding = FALSE;
return 0;
}
bool_t
is_bound(char *netid, char *uaddr)
{
struct fdlist *fdl;
for (fdl = fdhead; fdl; fdl = fdl->next)
if (strcmp(fdl->nconf->nc_netid, netid) == 0)
break;
if (fdl == NULL)
return (TRUE);
return (check_bound(fdl, uaddr));
}
/*
* Returns NULL if there was some system error.
* Returns "" if the address was not bound, i.e the server crashed.
* Returns the merged address otherwise.
*/
char *
mergeaddr(SVCXPRT *xprt, char *netid, char *uaddr, char *saddr)
{
struct fdlist *fdl;
struct svc_dg_data *dg_data;
char *c_uaddr, *s_uaddr, *m_uaddr, *allocated_uaddr = NULL;
for (fdl = fdhead; fdl; fdl = fdl->next)
if (strcmp(fdl->nconf->nc_netid, netid) == 0)
break;
if (fdl == NULL)
return (NULL);
if (check_bound(fdl, uaddr) == FALSE)
/* that server died */
return (nullstring);
/*
* Try to determine the local address on which the client contacted us,
* so we can send a reply from the same address. If it's unknown, then
* try to determine which address the client used, and pick a nearby
* local address.
*
* If saddr is not NULL, the remote client may have included the
* address by which it contacted us. Use that for the "client" uaddr,
* otherwise use the info from the SVCXPRT.
*/
dg_data = (struct svc_dg_data*)xprt->xp_p2;
if (dg_data != NULL && dg_data->su_srcaddr.buf != NULL) {
c_uaddr = taddr2uaddr(fdl->nconf, &dg_data->su_srcaddr);
allocated_uaddr = c_uaddr;
}
else if (saddr != NULL) {
c_uaddr = saddr;
} else {
c_uaddr = taddr2uaddr(fdl->nconf, svc_getrpccaller(xprt));
allocated_uaddr = c_uaddr;
}
if (c_uaddr == NULL) {
syslog(LOG_ERR, "taddr2uaddr failed for %s",
fdl->nconf->nc_netid);
return (NULL);
}
#ifdef ND_DEBUG
if (debugging) {
if (saddr == NULL) {
fprintf(stderr, "mergeaddr: client uaddr = %s\n",
c_uaddr);
} else {
fprintf(stderr, "mergeaddr: contact uaddr = %s\n",
c_uaddr);
}
}
#endif
s_uaddr = uaddr;
/*
* This is all we should need for IP 4 and 6
*/
m_uaddr = addrmerge(svc_getrpccaller(xprt), s_uaddr, c_uaddr, netid);
#ifdef ND_DEBUG
if (debugging)
fprintf(stderr, "mergeaddr: uaddr = %s, merged uaddr = %s\n",
uaddr, m_uaddr);
#endif
free(allocated_uaddr);
return (m_uaddr);
}
/*
* Returns a netconf structure from its internal list. This
* structure should not be freed.
*/
struct netconfig *
rpcbind_get_conf(const char *netid)
{
struct fdlist *fdl;
for (fdl = fdhead; fdl; fdl = fdl->next)
if (strcmp(fdl->nconf->nc_netid, netid) == 0)
break;
if (fdl == NULL)
return (NULL);
return (fdl->nconf);
}
diff --git a/usr.sbin/rpcbind/pmap_svc.c b/usr.sbin/rpcbind/pmap_svc.c
index 991a28d680fb..ddb38e1433f3 100644
--- a/usr.sbin/rpcbind/pmap_svc.c
+++ b/usr.sbin/rpcbind/pmap_svc.c
@@ -1,369 +1,368 @@
/* $NetBSD: pmap_svc.c,v 1.2 2000/10/20 11:49:40 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1984 - 1991 by Sun Microsystems, Inc.
*/
/* #ident "@(#)pmap_svc.c 1.14 93/07/05 SMI" */
#if 0
#ifndef lint
static char sccsid[] = "@(#)pmap_svc.c 1.23 89/04/05 Copyr 1984 Sun Micro";
#endif
#endif
/*
* pmap_svc.c
* The server procedure for the version 2 portmaper.
* All the portmapper related interface from the portmap side.
*/
#ifdef PORTMAP
#include <sys/types.h>
#include <sys/socket.h>
#include <stdio.h>
#include <rpc/rpc.h>
#include <rpc/pmap_prot.h>
#include <rpc/rpcb_prot.h>
#ifdef RPCBIND_DEBUG
#include <stdlib.h>
#endif
#include "rpcbind.h"
static struct pmaplist *find_service_pmap(rpcprog_t, rpcvers_t,
rpcprot_t);
static bool_t pmapproc_change(struct svc_req *, SVCXPRT *, u_long);
static bool_t pmapproc_getport(struct svc_req *, SVCXPRT *);
static bool_t pmapproc_dump(struct svc_req *, SVCXPRT *);
/*
* Called for all the version 2 inquiries.
*/
void
pmap_service(struct svc_req *rqstp, SVCXPRT *xprt)
{
rpcbs_procinfo(RPCBVERS_2_STAT, rqstp->rq_proc);
switch (rqstp->rq_proc) {
case PMAPPROC_NULL:
/*
* Null proc call
*/
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "PMAPPROC_NULL\n");
#endif
check_access(xprt, rqstp->rq_proc, NULL, PMAPVERS);
if ((!svc_sendreply(xprt, (xdrproc_t) xdr_void, NULL)) &&
debugging) {
if (doabort) {
rpcbind_abort();
}
}
break;
case PMAPPROC_SET:
/*
* Set a program, version to port mapping
*/
pmapproc_change(rqstp, xprt, rqstp->rq_proc);
break;
case PMAPPROC_UNSET:
/*
* Remove a program, version to port mapping.
*/
pmapproc_change(rqstp, xprt, rqstp->rq_proc);
break;
case PMAPPROC_GETPORT:
/*
* Lookup the mapping for a program, version and return its
* port number.
*/
pmapproc_getport(rqstp, xprt);
break;
case PMAPPROC_DUMP:
/*
* Return the current set of mapped program, version
*/
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "PMAPPROC_DUMP\n");
#endif
pmapproc_dump(rqstp, xprt);
break;
case PMAPPROC_CALLIT:
/*
* Calls a procedure on the local machine. If the requested
* procedure is not registered this procedure does not return
* error information!!
* This procedure is only supported on rpc/udp and calls via
* rpc/udp. It passes null authentication parameters.
*/
rpcbproc_callit_com(rqstp, xprt, PMAPPROC_CALLIT, PMAPVERS);
break;
default:
svcerr_noproc(xprt);
break;
}
}
/*
* returns the item with the given program, version number. If that version
* number is not found, it returns the item with that program number, so that
* the port number is now returned to the caller. The caller when makes a
* call to this program, version number, the call will fail and it will
* return with PROGVERS_MISMATCH. The user can then determine the highest
* and the lowest version number for this program using clnt_geterr() and
* use those program version numbers.
*/
static struct pmaplist *
find_service_pmap(rpcprog_t prog, rpcvers_t vers, rpcprot_t prot)
{
register struct pmaplist *hit = NULL;
register struct pmaplist *pml;
for (pml = list_pml; pml != NULL; pml = pml->pml_next) {
if ((pml->pml_map.pm_prog != prog) ||
(pml->pml_map.pm_prot != prot))
continue;
hit = pml;
if (pml->pml_map.pm_vers == vers)
break;
}
return (hit);
}
static bool_t
pmapproc_change(struct svc_req *rqstp __unused, SVCXPRT *xprt, unsigned long op)
{
struct pmap reg;
RPCB rpcbreg;
long ans;
struct sockaddr_in *who;
uid_t uid;
char uidbuf[32];
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "%s request for (%lu, %lu) : ",
op == PMAPPROC_SET ? "PMAP_SET" : "PMAP_UNSET",
reg.pm_prog, reg.pm_vers);
#endif
if (!svc_getargs(xprt, (xdrproc_t) xdr_pmap, (char *)&reg)) {
svcerr_decode(xprt);
return (FALSE);
}
if (!check_access(xprt, op, &reg, PMAPVERS)) {
svcerr_weakauth(xprt);
return FALSE;
}
who = svc_getcaller(xprt);
/*
* Can't use getpwnam here. We might end up calling ourselves
* and looping.
*/
if (__rpc_get_local_uid(xprt, &uid) < 0)
rpcbreg.r_owner = "unknown";
else if (uid == 0)
rpcbreg.r_owner = "superuser";
else {
/* r_owner will be strdup-ed later */
snprintf(uidbuf, sizeof uidbuf, "%d", uid);
rpcbreg.r_owner = uidbuf;
}
rpcbreg.r_prog = reg.pm_prog;
rpcbreg.r_vers = reg.pm_vers;
if (op == PMAPPROC_SET) {
char buf[32];
snprintf(buf, sizeof buf, "0.0.0.0.%d.%d",
(int)((reg.pm_port >> 8) & 0xff),
(int)(reg.pm_port & 0xff));
rpcbreg.r_addr = buf;
if (reg.pm_prot == IPPROTO_UDP) {
rpcbreg.r_netid = udptrans;
} else if (reg.pm_prot == IPPROTO_TCP) {
rpcbreg.r_netid = tcptrans;
} else {
ans = FALSE;
goto done_change;
}
ans = map_set(&rpcbreg, rpcbreg.r_owner);
} else if (op == PMAPPROC_UNSET) {
bool_t ans1, ans2;
rpcbreg.r_addr = NULL;
rpcbreg.r_netid = tcptrans;
ans1 = map_unset(&rpcbreg, rpcbreg.r_owner);
rpcbreg.r_netid = udptrans;
ans2 = map_unset(&rpcbreg, rpcbreg.r_owner);
ans = ans1 || ans2;
} else {
ans = FALSE;
}
done_change:
if ((!svc_sendreply(xprt, (xdrproc_t) xdr_long, (caddr_t) &ans)) &&
debugging) {
fprintf(stderr, "portmap: svc_sendreply\n");
if (doabort) {
rpcbind_abort();
}
}
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "%s\n", ans == TRUE ? "succeeded" : "failed");
#endif
if (op == PMAPPROC_SET)
rpcbs_set(RPCBVERS_2_STAT, ans);
else
rpcbs_unset(RPCBVERS_2_STAT, ans);
return (TRUE);
}
/* ARGSUSED */
static bool_t
pmapproc_getport(struct svc_req *rqstp __unused, SVCXPRT *xprt)
{
struct pmap reg;
long lport;
int port = 0;
struct pmaplist *fnd;
#ifdef RPCBIND_DEBUG
char *uaddr;
#endif
if (!svc_getargs(xprt, (xdrproc_t) xdr_pmap, (char *)&reg)) {
svcerr_decode(xprt);
return (FALSE);
}
if (!check_access(xprt, PMAPPROC_GETPORT, &reg, PMAPVERS)) {
svcerr_weakauth(xprt);
return FALSE;
}
#ifdef RPCBIND_DEBUG
if (debugging) {
uaddr = taddr2uaddr(rpcbind_get_conf(xprt->xp_netid),
svc_getrpccaller(xprt));
fprintf(stderr, "PMAP_GETPORT req for (%lu, %lu, %s) from %s :",
reg.pm_prog, reg.pm_vers,
reg.pm_prot == IPPROTO_UDP ? "udp" : "tcp", uaddr);
free(uaddr);
}
#endif
fnd = find_service_pmap(reg.pm_prog, reg.pm_vers, reg.pm_prot);
if (fnd) {
char serveuaddr[32], *ua;
int h1, h2, h3, h4, p1, p2;
char *netid;
if (reg.pm_prot == IPPROTO_UDP) {
ua = udp_uaddr;
netid = udptrans;
} else {
ua = tcp_uaddr; /* To get the len */
netid = tcptrans;
}
if (ua == NULL) {
goto sendreply;
}
if (sscanf(ua, "%d.%d.%d.%d.%d.%d", &h1, &h2, &h3,
&h4, &p1, &p2) == 6) {
p1 = (fnd->pml_map.pm_port >> 8) & 0xff;
p2 = (fnd->pml_map.pm_port) & 0xff;
snprintf(serveuaddr, sizeof serveuaddr,
"%d.%d.%d.%d.%d.%d", h1, h2, h3, h4, p1, p2);
if (is_bound(netid, serveuaddr)) {
port = fnd->pml_map.pm_port;
} else { /* this service is dead; delete it */
delete_prog(reg.pm_prog);
}
}
}
sendreply:
lport = port;
if ((!svc_sendreply(xprt, (xdrproc_t) xdr_long, (caddr_t)&lport)) &&
debugging) {
(void) fprintf(stderr, "portmap: svc_sendreply\n");
if (doabort) {
rpcbind_abort();
}
}
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "port = %d\n", port);
#endif
rpcbs_getaddr(RPCBVERS_2_STAT, reg.pm_prog, reg.pm_vers,
reg.pm_prot == IPPROTO_UDP ? udptrans : tcptrans,
port ? udptrans : "");
return (TRUE);
}
/* ARGSUSED */
static bool_t
pmapproc_dump(struct svc_req *rqstp __unused, SVCXPRT *xprt)
{
if (!svc_getargs(xprt, (xdrproc_t)xdr_void, NULL)) {
svcerr_decode(xprt);
return (FALSE);
}
if (!check_access(xprt, PMAPPROC_DUMP, NULL, PMAPVERS)) {
svcerr_weakauth(xprt);
return FALSE;
}
if ((!svc_sendreply(xprt, (xdrproc_t) xdr_pmaplist_ptr,
(caddr_t)&list_pml)) && debugging) {
if (debugging)
(void) fprintf(stderr, "portmap: svc_sendreply\n");
if (doabort) {
rpcbind_abort();
}
}
return (TRUE);
}
#endif /* PORTMAP */
diff --git a/usr.sbin/rpcbind/rpcb_svc.c b/usr.sbin/rpcbind/rpcb_svc.c
index 474f8ec77d17..68c026bb0b6a 100644
--- a/usr.sbin/rpcbind/rpcb_svc.c
+++ b/usr.sbin/rpcbind/rpcb_svc.c
@@ -1,235 +1,234 @@
/* $NetBSD: rpcb_svc.c,v 1.1 2000/06/02 23:15:41 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/* #ident "@(#)rpcb_svc.c 1.16 93/07/05 SMI" */
/*
* rpcb_svc.c
* The server procedure for the version 3 rpcbind (TLI).
*
* It maintains a separate list of all the registered services with the
* version 3 of rpcbind.
*/
#include <sys/types.h>
#include <rpc/rpc.h>
#include <rpc/rpcb_prot.h>
#include <netconfig.h>
#include <stdio.h>
#ifdef RPCBIND_DEBUG
#include <stdlib.h>
#endif
#include <string.h>
#include "rpcbind.h"
static void *rpcbproc_getaddr_3_local(void *, struct svc_req *, SVCXPRT *,
rpcvers_t);
static void *rpcbproc_dump_3_local(void *, struct svc_req *, SVCXPRT *,
rpcvers_t);
/*
* Called by svc_getreqset. There is a separate server handle for
* every transport that it waits on.
*/
void
rpcb_service_3(struct svc_req *rqstp, SVCXPRT *transp)
{
union {
RPCB rpcbproc_set_3_arg;
RPCB rpcbproc_unset_3_arg;
RPCB rpcbproc_getaddr_3_local_arg;
struct rpcb_rmtcallargs rpcbproc_callit_3_arg;
char *rpcbproc_uaddr2taddr_3_arg;
struct netbuf rpcbproc_taddr2uaddr_3_arg;
} argument;
char *result;
xdrproc_t xdr_argument, xdr_result;
void *(*local)(void *, struct svc_req *, SVCXPRT *, rpcvers_t);
rpcbs_procinfo(RPCBVERS_3_STAT, rqstp->rq_proc);
switch (rqstp->rq_proc) {
case NULLPROC:
/*
* Null proc call
*/
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCBPROC_NULL\n");
#endif
/* This call just logs, no actual checks */
check_access(transp, rqstp->rq_proc, NULL, RPCBVERS);
(void) svc_sendreply(transp, (xdrproc_t)xdr_void, (char *)NULL);
return;
case RPCBPROC_SET:
xdr_argument = (xdrproc_t )xdr_rpcb;
xdr_result = (xdrproc_t )xdr_bool;
local = rpcbproc_set_com;
break;
case RPCBPROC_UNSET:
xdr_argument = (xdrproc_t)xdr_rpcb;
xdr_result = (xdrproc_t)xdr_bool;
local = rpcbproc_unset_com;
break;
case RPCBPROC_GETADDR:
xdr_argument = (xdrproc_t)xdr_rpcb;
xdr_result = (xdrproc_t)xdr_wrapstring;
local = rpcbproc_getaddr_3_local;
break;
case RPCBPROC_DUMP:
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCBPROC_DUMP\n");
#endif
xdr_argument = (xdrproc_t)xdr_void;
xdr_result = (xdrproc_t)xdr_rpcblist_ptr;
local = rpcbproc_dump_3_local;
break;
case RPCBPROC_CALLIT:
rpcbproc_callit_com(rqstp, transp, rqstp->rq_proc, RPCBVERS);
return;
case RPCBPROC_GETTIME:
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCBPROC_GETTIME\n");
#endif
xdr_argument = (xdrproc_t)xdr_void;
xdr_result = (xdrproc_t)xdr_u_long;
local = rpcbproc_gettime_com;
break;
case RPCBPROC_UADDR2TADDR:
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCBPROC_UADDR2TADDR\n");
#endif
xdr_argument = (xdrproc_t)xdr_wrapstring;
xdr_result = (xdrproc_t)xdr_netbuf;
local = rpcbproc_uaddr2taddr_com;
break;
case RPCBPROC_TADDR2UADDR:
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCBPROC_TADDR2UADDR\n");
#endif
xdr_argument = (xdrproc_t)xdr_netbuf;
xdr_result = (xdrproc_t)xdr_wrapstring;
local = rpcbproc_taddr2uaddr_com;
break;
default:
svcerr_noproc(transp);
return;
}
(void) memset((char *)&argument, 0, sizeof (argument));
if (!svc_getargs(transp, (xdrproc_t) xdr_argument,
(char *) &argument)) {
svcerr_decode(transp);
if (debugging)
(void) fprintf(stderr, "rpcbind: could not decode\n");
return;
}
if (!check_access(transp, rqstp->rq_proc, &argument, RPCBVERS)) {
svcerr_weakauth(transp);
goto done;
}
result = (*local)(&argument, rqstp, transp, RPCBVERS);
if (result != NULL && !svc_sendreply(transp, (xdrproc_t)xdr_result,
result)) {
svcerr_systemerr(transp);
if (debugging) {
(void) fprintf(stderr, "rpcbind: svc_sendreply\n");
if (doabort) {
rpcbind_abort();
}
}
}
done:
if (!svc_freeargs(transp, (xdrproc_t)xdr_argument, (char *)
&argument)) {
if (debugging) {
(void) fprintf(stderr, "unable to free arguments\n");
if (doabort) {
rpcbind_abort();
}
}
}
}
/*
* Lookup the mapping for a program, version and return its
* address. Assuming that the caller wants the address of the
* server running on the transport on which the request came.
*
* We also try to resolve the universal address in terms of
* address of the caller.
*/
/* ARGSUSED */
static void *
rpcbproc_getaddr_3_local(void *arg, struct svc_req *rqstp __unused,
SVCXPRT *transp __unused, rpcvers_t versnum __unused)
{
RPCB *regp = (RPCB *)arg;
#ifdef RPCBIND_DEBUG
if (debugging) {
char *uaddr;
uaddr = taddr2uaddr(rpcbind_get_conf(transp->xp_netid),
svc_getrpccaller(transp));
fprintf(stderr, "RPCB_GETADDR req for (%lu, %lu, %s) from %s: ",
(unsigned long)regp->r_prog, (unsigned long)regp->r_vers,
regp->r_netid, uaddr);
free(uaddr);
}
#endif
return (rpcbproc_getaddr_com(regp, rqstp, transp, RPCBVERS,
RPCB_ALLVERS));
}
/* ARGSUSED */
static void *
rpcbproc_dump_3_local(void *arg __unused, struct svc_req *rqstp __unused,
SVCXPRT *transp __unused, rpcvers_t versnum __unused)
{
return ((void *)&list_rbl);
}
diff --git a/usr.sbin/rpcbind/rpcb_svc_com.c b/usr.sbin/rpcbind/rpcb_svc_com.c
index 31cdaf96f074..5faba0813890 100644
--- a/usr.sbin/rpcbind/rpcb_svc_com.c
+++ b/usr.sbin/rpcbind/rpcb_svc_com.c
@@ -1,1491 +1,1490 @@
/* $NetBSD: rpcb_svc_com.c,v 1.9 2002/11/08 00:16:39 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/* #ident "@(#)rpcb_svc_com.c 1.18 94/05/02 SMI" */
/*
* rpcb_svc_com.c
* The commom server procedure for the rpcbind.
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/param.h>
#include <sys/poll.h>
#include <sys/socket.h>
#include <rpc/rpc.h>
#include <rpc/rpcb_prot.h>
#include <rpc/svc_dg.h>
#include <assert.h>
#include <netconfig.h>
#include <errno.h>
#include <syslog.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#ifdef PORTMAP
#include <netinet/in.h>
#include <rpc/rpc_com.h>
#include <rpc/pmap_prot.h>
#endif /* PORTMAP */
#include "rpcbind.h"
#define RPC_BUF_MAX 65536 /* can be raised if required */
static char *nullstring = "";
static int rpcb_rmtcalls;
struct rmtcallfd_list {
int fd;
SVCXPRT *xprt;
char *netid;
struct rmtcallfd_list *next;
};
#define NFORWARD 64
#define MAXTIME_OFF 300 /* 5 minutes */
struct finfo {
int flag;
#define FINFO_ACTIVE 0x1
u_int32_t caller_xid;
struct netbuf *caller_addr;
u_int32_t forward_xid;
int forward_fd;
char *uaddr;
rpcproc_t reply_type;
rpcvers_t versnum;
time_t time;
};
static struct finfo FINFO[NFORWARD];
static bool_t xdr_encap_parms(XDR *, struct encap_parms *);
static bool_t xdr_rmtcall_args(XDR *, struct r_rmtcall_args *);
static bool_t xdr_rmtcall_result(XDR *, struct r_rmtcall_args *);
static bool_t xdr_opaque_parms(XDR *, struct r_rmtcall_args *);
static int find_rmtcallfd_by_netid(char *);
static SVCXPRT *find_rmtcallxprt_by_fd(int);
static int forward_register(u_int32_t, struct netbuf *, int, char *,
rpcproc_t, rpcvers_t, u_int32_t *);
static struct finfo *forward_find(u_int32_t);
static int free_slot_by_xid(u_int32_t);
static int free_slot_by_index(int);
static int netbufcmp(struct netbuf *, struct netbuf *);
static struct netbuf *netbufdup(struct netbuf *);
static void netbuffree(struct netbuf *);
static int check_rmtcalls(struct pollfd *, int);
static void xprt_set_caller(SVCXPRT *, struct finfo *);
static void send_svcsyserr(SVCXPRT *, struct finfo *);
static void handle_reply(int, SVCXPRT *);
static void find_versions(rpcprog_t, char *, rpcvers_t *, rpcvers_t *);
static rpcblist_ptr find_service(rpcprog_t, rpcvers_t, char *);
static char *getowner(SVCXPRT *, char *, size_t);
static int add_pmaplist(RPCB *);
static int del_pmaplist(RPCB *);
/*
* Set a mapping of program, version, netid
*/
/* ARGSUSED */
void *
rpcbproc_set_com(void *arg, struct svc_req *rqstp __unused, SVCXPRT *transp,
rpcvers_t rpcbversnum)
{
RPCB *regp = (RPCB *)arg;
static bool_t ans;
char owner[64];
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCB_SET request for (%lu, %lu, %s, %s) : ",
(unsigned long)regp->r_prog, (unsigned long)regp->r_vers,
regp->r_netid, regp->r_addr);
#endif
ans = map_set(regp, getowner(transp, owner, sizeof owner));
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "%s\n", ans == TRUE ? "succeeded" : "failed");
#endif
/* XXX: should have used some defined constant here */
rpcbs_set(rpcbversnum - 2, ans);
return (void *)&ans;
}
bool_t
map_set(RPCB *regp, char *owner)
{
RPCB reg, *a;
rpcblist_ptr rbl, fnd;
reg = *regp;
/*
* check to see if already used
* find_service returns a hit even if
* the versions don't match, so check for it
*/
fnd = find_service(reg.r_prog, reg.r_vers, reg.r_netid);
if (fnd && (fnd->rpcb_map.r_vers == reg.r_vers)) {
if (!strcmp(fnd->rpcb_map.r_addr, reg.r_addr))
/*
* if these match then it is already
* registered so just say "OK".
*/
return (TRUE);
else
return (FALSE);
}
/*
* add to the end of the list
*/
rbl = malloc(sizeof (RPCBLIST));
if (rbl == NULL)
return (FALSE);
a = &(rbl->rpcb_map);
a->r_prog = reg.r_prog;
a->r_vers = reg.r_vers;
a->r_netid = strdup(reg.r_netid);
a->r_addr = strdup(reg.r_addr);
a->r_owner = strdup(owner);
if (!a->r_addr || !a->r_netid || !a->r_owner) {
free(a->r_netid);
free(a->r_addr);
free(a->r_owner);
free(rbl);
return (FALSE);
}
rbl->rpcb_next = (rpcblist_ptr)NULL;
if (list_rbl == NULL) {
list_rbl = rbl;
} else {
for (fnd = list_rbl; fnd->rpcb_next;
fnd = fnd->rpcb_next)
;
fnd->rpcb_next = rbl;
}
#ifdef PORTMAP
(void) add_pmaplist(regp);
#endif
return (TRUE);
}
/*
* Unset a mapping of program, version, netid
*/
/* ARGSUSED */
void *
rpcbproc_unset_com(void *arg, struct svc_req *rqstp __unused, SVCXPRT *transp,
rpcvers_t rpcbversnum)
{
RPCB *regp = (RPCB *)arg;
static bool_t ans;
char owner[64];
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "RPCB_UNSET request for (%lu, %lu, %s) : ",
(unsigned long)regp->r_prog, (unsigned long)regp->r_vers,
regp->r_netid);
#endif
ans = map_unset(regp, getowner(transp, owner, sizeof owner));
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "%s\n", ans == TRUE ? "succeeded" : "failed");
#endif
/* XXX: should have used some defined constant here */
rpcbs_unset(rpcbversnum - 2, ans);
return (void *)&ans;
}
bool_t
map_unset(RPCB *regp, char *owner)
{
int ans = 0;
rpcblist_ptr rbl, prev, tmp;
if (owner == NULL)
return (0);
for (prev = NULL, rbl = list_rbl; rbl; /* cstyle */) {
if ((rbl->rpcb_map.r_prog != regp->r_prog) ||
(rbl->rpcb_map.r_vers != regp->r_vers) ||
(regp->r_netid[0] && strcasecmp(regp->r_netid,
rbl->rpcb_map.r_netid))) {
/* both rbl & prev move forwards */
prev = rbl;
rbl = rbl->rpcb_next;
continue;
}
/*
* Check whether appropriate uid. Unset only
* if superuser or the owner itself.
*/
if (strcmp(owner, "superuser") &&
strcmp(rbl->rpcb_map.r_owner, owner))
return (0);
/* found it; rbl moves forward, prev stays */
ans = 1;
tmp = rbl;
rbl = rbl->rpcb_next;
if (prev == NULL)
list_rbl = rbl;
else
prev->rpcb_next = rbl;
free(tmp->rpcb_map.r_addr);
free(tmp->rpcb_map.r_netid);
free(tmp->rpcb_map.r_owner);
free(tmp);
}
#ifdef PORTMAP
if (ans)
(void) del_pmaplist(regp);
#endif
/*
* We return 1 either when the entry was not there or it
* was able to unset it. It can come to this point only if
* atleast one of the conditions is true.
*/
return (1);
}
void
delete_prog(unsigned int prog)
{
RPCB reg;
register rpcblist_ptr rbl;
for (rbl = list_rbl; rbl != NULL; rbl = rbl->rpcb_next) {
if ((rbl->rpcb_map.r_prog != prog))
continue;
if (is_bound(rbl->rpcb_map.r_netid, rbl->rpcb_map.r_addr))
continue;
reg.r_prog = rbl->rpcb_map.r_prog;
reg.r_vers = rbl->rpcb_map.r_vers;
reg.r_netid = strdup(rbl->rpcb_map.r_netid);
(void) map_unset(&reg, "superuser");
free(reg.r_netid);
}
}
void *
rpcbproc_getaddr_com(RPCB *regp, struct svc_req *rqstp __unused,
SVCXPRT *transp, rpcvers_t rpcbversnum, rpcvers_t verstype)
{
static char *uaddr;
char *saddr = NULL;
rpcblist_ptr fnd;
if (uaddr != NULL && uaddr != nullstring) {
free(uaddr);
uaddr = NULL;
}
fnd = find_service(regp->r_prog, regp->r_vers, transp->xp_netid);
if (fnd && ((verstype == RPCB_ALLVERS) ||
(regp->r_vers == fnd->rpcb_map.r_vers))) {
if (*(regp->r_addr) != '\0') { /* may contain a hint about */
saddr = regp->r_addr; /* the interface that we */
} /* should use */
if (!(uaddr = mergeaddr(transp, transp->xp_netid,
fnd->rpcb_map.r_addr, saddr))) {
/* Try whatever we have */
uaddr = strdup(fnd->rpcb_map.r_addr);
} else if (!uaddr[0]) {
/*
* The server died. Unset all versions of this prog.
*/
delete_prog(regp->r_prog);
uaddr = nullstring;
}
} else {
uaddr = nullstring;
}
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "getaddr: %s\n", uaddr);
#endif
/* XXX: should have used some defined constant here */
rpcbs_getaddr(rpcbversnum - 2, regp->r_prog, regp->r_vers,
transp->xp_netid, uaddr);
return (void *)&uaddr;
}
/* ARGSUSED */
void *
rpcbproc_gettime_com(void *arg __unused, struct svc_req *rqstp __unused,
SVCXPRT *transp __unused, rpcvers_t rpcbversnum __unused)
{
static time_t curtime;
(void) time(&curtime);
return (void *)&curtime;
}
/*
* Convert uaddr to taddr. Should be used only by
* local servers/clients. (kernel level stuff only)
*/
/* ARGSUSED */
void *
rpcbproc_uaddr2taddr_com(void *arg, struct svc_req *rqstp __unused,
SVCXPRT *transp, rpcvers_t rpcbversnum __unused)
{
char **uaddrp = (char **)arg;
struct netconfig *nconf;
static struct netbuf nbuf;
static struct netbuf *taddr;
netbuffree(taddr);
taddr = NULL;
if (((nconf = rpcbind_get_conf(transp->xp_netid)) == NULL) ||
((taddr = uaddr2taddr(nconf, *uaddrp)) == NULL)) {
(void) memset((char *)&nbuf, 0, sizeof (struct netbuf));
return (void *)&nbuf;
}
return (void *)taddr;
}
/*
* Convert taddr to uaddr. Should be used only by
* local servers/clients. (kernel level stuff only)
*/
/* ARGSUSED */
void *
rpcbproc_taddr2uaddr_com(void *arg, struct svc_req *rqstp __unused,
SVCXPRT *transp, rpcvers_t rpcbversnum __unused)
{
struct netbuf *taddr = (struct netbuf *)arg;
static char *uaddr;
struct netconfig *nconf;
#ifdef CHEW_FDS
int fd;
if ((fd = open("/dev/null", O_RDONLY)) == -1) {
uaddr = (char *)strerror(errno);
return (&uaddr);
}
#endif /* CHEW_FDS */
if (uaddr != NULL && uaddr != nullstring) {
free(uaddr);
uaddr = NULL;
}
if (((nconf = rpcbind_get_conf(transp->xp_netid)) == NULL) ||
((uaddr = taddr2uaddr(nconf, taddr)) == NULL)) {
uaddr = nullstring;
}
return (void *)&uaddr;
}
static bool_t
xdr_encap_parms(XDR *xdrs, struct encap_parms *epp)
{
return (xdr_bytes(xdrs, &(epp->args), (u_int *) &(epp->arglen),
RPC_MAXDATASIZE));
}
/*
* XDR remote call arguments. It ignores the address part.
* written for XDR_DECODE direction only
*/
static bool_t
xdr_rmtcall_args(XDR *xdrs, struct r_rmtcall_args *cap)
{
/* does not get the address or the arguments */
if (xdr_rpcprog(xdrs, &(cap->rmt_prog)) &&
xdr_rpcvers(xdrs, &(cap->rmt_vers)) &&
xdr_rpcproc(xdrs, &(cap->rmt_proc))) {
return (xdr_encap_parms(xdrs, &(cap->rmt_args)));
}
return (FALSE);
}
/*
* XDR remote call results along with the address. Ignore
* program number, version number and proc number.
* Written for XDR_ENCODE direction only.
*/
static bool_t
xdr_rmtcall_result(XDR *xdrs, struct r_rmtcall_args *cap)
{
bool_t result;
#ifdef PORTMAP
if (cap->rmt_localvers == PMAPVERS) {
int h1, h2, h3, h4, p1, p2;
u_long port;
/* interpret the universal address for TCP/IP */
if (sscanf(cap->rmt_uaddr, "%d.%d.%d.%d.%d.%d",
&h1, &h2, &h3, &h4, &p1, &p2) != 6)
return (FALSE);
port = ((p1 & 0xff) << 8) + (p2 & 0xff);
result = xdr_u_long(xdrs, &port);
} else
#endif
if ((cap->rmt_localvers == RPCBVERS) ||
(cap->rmt_localvers == RPCBVERS4)) {
result = xdr_wrapstring(xdrs, &(cap->rmt_uaddr));
} else {
return (FALSE);
}
if (result == TRUE)
return (xdr_encap_parms(xdrs, &(cap->rmt_args)));
return (FALSE);
}
/*
* only worries about the struct encap_parms part of struct r_rmtcall_args.
* The arglen must already be set!!
*/
static bool_t
xdr_opaque_parms(XDR *xdrs, struct r_rmtcall_args *cap)
{
return (xdr_opaque(xdrs, cap->rmt_args.args, cap->rmt_args.arglen));
}
static struct rmtcallfd_list *rmthead;
static struct rmtcallfd_list *rmttail;
int
create_rmtcall_fd(struct netconfig *nconf)
{
int fd;
struct rmtcallfd_list *rmt;
SVCXPRT *xprt;
if ((fd = __rpc_nconf2fd(nconf)) == -1) {
if (debugging)
fprintf(stderr,
"create_rmtcall_fd: couldn't open \"%s\" (errno %d)\n",
nconf->nc_device, errno);
return (-1);
}
xprt = svc_tli_create(fd, 0, (struct t_bind *) 0, 0, 0);
if (xprt == NULL) {
if (debugging)
fprintf(stderr,
"create_rmtcall_fd: svc_tli_create failed\n");
return (-1);
}
rmt = malloc(sizeof (struct rmtcallfd_list));
if (rmt == NULL) {
syslog(LOG_ERR, "create_rmtcall_fd: no memory!");
return (-1);
}
rmt->xprt = xprt;
rmt->netid = strdup(nconf->nc_netid);
xprt->xp_netid = rmt->netid;
rmt->fd = fd;
rmt->next = NULL;
if (rmthead == NULL) {
rmthead = rmt;
rmttail = rmt;
} else {
rmttail->next = rmt;
rmttail = rmt;
}
/* XXX not threadsafe */
if (fd > svc_maxfd)
svc_maxfd = fd;
FD_SET(fd, &svc_fdset);
return (fd);
}
static int
find_rmtcallfd_by_netid(char *netid)
{
struct rmtcallfd_list *rmt;
for (rmt = rmthead; rmt != NULL; rmt = rmt->next) {
if (strcmp(netid, rmt->netid) == 0) {
return (rmt->fd);
}
}
return (-1);
}
static SVCXPRT *
find_rmtcallxprt_by_fd(int fd)
{
struct rmtcallfd_list *rmt;
for (rmt = rmthead; rmt != NULL; rmt = rmt->next) {
if (fd == rmt->fd) {
return (rmt->xprt);
}
}
return (NULL);
}
/*
* Call a remote procedure service. This procedure is very quiet when things
* go wrong. The proc is written to support broadcast rpc. In the broadcast
* case, a machine should shut-up instead of complain, lest the requestor be
* overrun with complaints at the expense of not hearing a valid reply.
* When receiving a request and verifying that the service exists, we
*
* receive the request
*
* open a new TLI endpoint on the same transport on which we received
* the original request
*
* remember the original request's XID (which requires knowing the format
* of the svc_dg_data structure)
*
* forward the request, with a new XID, to the requested service,
* remembering the XID used to send this request (for later use in
* reassociating the answer with the original request), the requestor's
* address, the file descriptor on which the forwarded request is
* made and the service's address.
*
* mark the file descriptor on which we anticipate receiving a reply from
* the service and one to select for in our private svc_run procedure
*
* At some time in the future, a reply will be received from the service to
* which we forwarded the request. At that time, we detect that the socket
* used was for forwarding (by looking through the finfo structures to see
* whether the fd corresponds to one of those) and call handle_reply() to
*
* receive the reply
*
* bundle the reply, along with the service's universal address
*
* create a SVCXPRT structure and use a version of svc_sendreply
* that allows us to specify the reply XID and destination, send the reply
* to the original requestor.
*/
void
rpcbproc_callit_com(struct svc_req *rqstp, SVCXPRT *transp,
rpcproc_t reply_type, rpcvers_t versnum)
{
register rpcblist_ptr rbl;
struct netconfig *nconf;
struct netbuf *caller;
struct r_rmtcall_args a;
char *buf_alloc = NULL, *outbufp;
char *outbuf_alloc = NULL;
char buf[RPC_BUF_MAX], outbuf[RPC_BUF_MAX];
struct netbuf *na = (struct netbuf *) NULL;
struct rpc_msg call_msg;
int outlen;
u_int sendsz;
XDR outxdr;
AUTH *auth;
int fd = -1;
char *uaddr, *m_uaddr = NULL, *local_uaddr = NULL;
u_int32_t *xidp;
struct __rpc_sockinfo si;
struct sockaddr *localsa;
struct netbuf tbuf;
if (!__rpc_fd2sockinfo(transp->xp_fd, &si)) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
return;
}
if (si.si_socktype != SOCK_DGRAM)
return; /* Only datagram type accepted */
sendsz = __rpc_get_t_size(si.si_af, si.si_proto, UDPMSGSIZE);
if (sendsz == 0) { /* data transfer not supported */
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
return;
}
/*
* Should be multiple of 4 for XDR.
*/
sendsz = roundup(sendsz, 4);
if (sendsz > RPC_BUF_MAX) {
#ifdef notyet
buf_alloc = alloca(sendsz); /* not in IDR2? */
#else
buf_alloc = malloc(sendsz);
#endif /* notyet */
if (buf_alloc == NULL) {
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: No Memory!\n");
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
return;
}
a.rmt_args.args = buf_alloc;
} else {
a.rmt_args.args = buf;
}
call_msg.rm_xid = 0; /* For error checking purposes */
if (!svc_getargs(transp, (xdrproc_t) xdr_rmtcall_args, (char *) &a)) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_decode(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: svc_getargs failed\n");
goto error;
}
if (!check_callit(transp, &a, versnum)) {
svcerr_weakauth(transp);
goto error;
}
caller = svc_getrpccaller(transp);
#ifdef RPCBIND_DEBUG
if (debugging) {
uaddr = taddr2uaddr(rpcbind_get_conf(transp->xp_netid), caller);
fprintf(stderr, "%s %s req for (%lu, %lu, %lu, %s) from %s : ",
versnum == PMAPVERS ? "pmap_rmtcall" :
versnum == RPCBVERS ? "rpcb_rmtcall" :
versnum == RPCBVERS4 ? "rpcb_indirect" : "unknown",
reply_type == RPCBPROC_INDIRECT ? "indirect" : "callit",
(unsigned long)a.rmt_prog, (unsigned long)a.rmt_vers,
(unsigned long)a.rmt_proc, transp->xp_netid,
uaddr ? uaddr : "unknown");
free(uaddr);
}
#endif
rbl = find_service(a.rmt_prog, a.rmt_vers, transp->xp_netid);
rpcbs_rmtcall(versnum - 2, reply_type, a.rmt_prog, a.rmt_vers,
a.rmt_proc, transp->xp_netid, rbl);
if (rbl == (rpcblist_ptr)NULL) {
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "not found\n");
#endif
if (reply_type == RPCBPROC_INDIRECT)
svcerr_noprog(transp);
goto error;
}
if (rbl->rpcb_map.r_vers != a.rmt_vers) {
if (reply_type == RPCBPROC_INDIRECT) {
rpcvers_t vers_low, vers_high;
find_versions(a.rmt_prog, transp->xp_netid,
&vers_low, &vers_high);
svcerr_progvers(transp, vers_low, vers_high);
}
goto error;
}
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "found at uaddr %s\n", rbl->rpcb_map.r_addr);
#endif
/*
* Check whether this entry is valid and a server is present
* Mergeaddr() returns NULL if no such entry is present, and
* returns "" if the entry was present but the server is not
* present (i.e., it crashed).
*/
if (reply_type == RPCBPROC_INDIRECT) {
uaddr = mergeaddr(transp, transp->xp_netid,
rbl->rpcb_map.r_addr, NULL);
if (uaddr == NULL || uaddr[0] == '\0') {
svcerr_noprog(transp);
free(uaddr);
goto error;
}
free(uaddr);
}
nconf = rpcbind_get_conf(transp->xp_netid);
if (nconf == (struct netconfig *)NULL) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: rpcbind_get_conf failed\n");
goto error;
}
localsa = local_sa(((struct sockaddr *)caller->buf)->sa_family);
if (localsa == NULL) {
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: no local address\n");
goto error;
}
tbuf.len = tbuf.maxlen = localsa->sa_len;
tbuf.buf = localsa;
local_uaddr =
addrmerge(&tbuf, rbl->rpcb_map.r_addr, NULL, nconf->nc_netid);
m_uaddr = addrmerge(caller, rbl->rpcb_map.r_addr, NULL,
nconf->nc_netid);
#ifdef RPCBIND_DEBUG
if (debugging)
fprintf(stderr, "merged uaddr %s\n", m_uaddr);
#endif
if ((fd = find_rmtcallfd_by_netid(nconf->nc_netid)) == -1) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
goto error;
}
xidp = __rpcb_get_dg_xidp(transp);
switch (forward_register(*xidp, caller, fd, m_uaddr, reply_type,
versnum, &call_msg.rm_xid)) {
case 1:
/* Success; forward_register() will free m_uaddr for us. */
m_uaddr = NULL;
break;
case 0:
/*
* A duplicate request for the slow server. Let's not
* beat on it any more.
*/
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: duplicate request\n");
goto error;
case -1:
/* forward_register failed. Perhaps no memory. */
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: forward_register failed\n");
goto error;
}
#ifdef DEBUG_RMTCALL
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: original XID %x, new XID %x\n",
*xidp, call_msg.rm_xid);
#endif
call_msg.rm_direction = CALL;
call_msg.rm_call.cb_rpcvers = RPC_MSG_VERSION;
call_msg.rm_call.cb_prog = a.rmt_prog;
call_msg.rm_call.cb_vers = a.rmt_vers;
if (sendsz > RPC_BUF_MAX) {
#ifdef notyet
outbuf_alloc = alloca(sendsz); /* not in IDR2? */
#else
outbuf_alloc = malloc(sendsz);
#endif /* notyet */
if (outbuf_alloc == NULL) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: No memory!\n");
goto error;
}
xdrmem_create(&outxdr, outbuf_alloc, sendsz, XDR_ENCODE);
} else {
xdrmem_create(&outxdr, outbuf, sendsz, XDR_ENCODE);
}
if (!xdr_callhdr(&outxdr, &call_msg)) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: xdr_callhdr failed\n");
goto error;
}
if (!xdr_u_int32_t(&outxdr, &(a.rmt_proc))) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: xdr_u_long failed\n");
goto error;
}
if (rqstp->rq_cred.oa_flavor == AUTH_NULL) {
auth = authnone_create();
} else if (rqstp->rq_cred.oa_flavor == AUTH_SYS) {
struct authunix_parms *au;
au = (struct authunix_parms *)rqstp->rq_clntcred;
auth = authunix_create(au->aup_machname,
au->aup_uid, au->aup_gid,
au->aup_len, au->aup_gids);
if (auth == NULL) /* fall back */
auth = authnone_create();
} else {
/* we do not support any other authentication scheme */
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: oa_flavor != AUTH_NONE and oa_flavor != AUTH_SYS\n");
if (reply_type == RPCBPROC_INDIRECT)
svcerr_weakauth(transp); /* XXX too strong.. */
goto error;
}
if (auth == NULL) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: authwhatever_create returned NULL\n");
goto error;
}
if (!AUTH_MARSHALL(auth, &outxdr)) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
AUTH_DESTROY(auth);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: AUTH_MARSHALL failed\n");
goto error;
}
AUTH_DESTROY(auth);
if (!xdr_opaque_parms(&outxdr, &a)) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: xdr_opaque_parms failed\n");
goto error;
}
outlen = (int) XDR_GETPOS(&outxdr);
if (outbuf_alloc)
outbufp = outbuf_alloc;
else
outbufp = outbuf;
na = uaddr2taddr(nconf, local_uaddr);
if (!na) {
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
goto error;
}
if (sendto(fd, outbufp, outlen, 0, (struct sockaddr *)na->buf, na->len)
!= outlen) {
if (debugging)
fprintf(stderr,
"rpcbproc_callit_com: sendto failed: errno %d\n", errno);
if (reply_type == RPCBPROC_INDIRECT)
svcerr_systemerr(transp);
goto error;
}
goto out;
error:
if (call_msg.rm_xid != 0)
(void) free_slot_by_xid(call_msg.rm_xid);
out:
free(local_uaddr);
free(buf_alloc);
free(outbuf_alloc);
netbuffree(na);
free(m_uaddr);
}
/*
* Makes an entry into the FIFO for the given request.
* Returns 1 on success, 0 if this is a duplicate request, or -1 on error.
* *callxidp is set to the xid of the call.
*/
static int
forward_register(u_int32_t caller_xid, struct netbuf *caller_addr,
int forward_fd, char *uaddr, rpcproc_t reply_type,
rpcvers_t versnum, u_int32_t *callxidp)
{
int i;
int j = 0;
time_t min_time, time_now;
static u_int32_t lastxid;
int entry = -1;
min_time = FINFO[0].time;
time_now = time((time_t *)0);
/* initialization */
if (lastxid == 0)
lastxid = time_now * NFORWARD;
/*
* Check if it is a duplicate entry. Then,
* try to find an empty slot. If not available, then
* use the slot with the earliest time.
*/
for (i = 0; i < NFORWARD; i++) {
if (FINFO[i].flag & FINFO_ACTIVE) {
if ((FINFO[i].caller_xid == caller_xid) &&
(FINFO[i].reply_type == reply_type) &&
(FINFO[i].versnum == versnum) &&
(!netbufcmp(FINFO[i].caller_addr,
caller_addr))) {
FINFO[i].time = time((time_t *)0);
return (0); /* Duplicate entry */
} else {
/* Should we wait any longer */
if ((time_now - FINFO[i].time) > MAXTIME_OFF)
(void) free_slot_by_index(i);
}
}
if (entry == -1) {
if ((FINFO[i].flag & FINFO_ACTIVE) == 0) {
entry = i;
} else if (FINFO[i].time < min_time) {
j = i;
min_time = FINFO[i].time;
}
}
}
if (entry != -1) {
/* use this empty slot */
j = entry;
} else {
(void) free_slot_by_index(j);
}
if ((FINFO[j].caller_addr = netbufdup(caller_addr)) == NULL) {
return (-1);
}
rpcb_rmtcalls++; /* no of pending calls */
FINFO[j].flag = FINFO_ACTIVE;
FINFO[j].reply_type = reply_type;
FINFO[j].versnum = versnum;
FINFO[j].time = time_now;
FINFO[j].caller_xid = caller_xid;
FINFO[j].forward_fd = forward_fd;
/*
* Though uaddr is not allocated here, it will still be freed
* from free_slot_*().
*/
FINFO[j].uaddr = uaddr;
lastxid = lastxid + NFORWARD;
/* Don't allow a zero xid below. */
if ((u_int32_t)(lastxid + NFORWARD) <= NFORWARD)
lastxid = NFORWARD;
FINFO[j].forward_xid = lastxid + j; /* encode slot */
*callxidp = FINFO[j].forward_xid; /* forward on this xid */
return (1);
}
static struct finfo *
forward_find(u_int32_t reply_xid)
{
int i;
i = reply_xid % (u_int32_t)NFORWARD;
if ((FINFO[i].flag & FINFO_ACTIVE) &&
(FINFO[i].forward_xid == reply_xid)) {
return (&FINFO[i]);
}
return (NULL);
}
static int
free_slot_by_xid(u_int32_t xid)
{
int entry;
entry = xid % (u_int32_t)NFORWARD;
return (free_slot_by_index(entry));
}
static int
free_slot_by_index(int index)
{
struct finfo *fi;
fi = &FINFO[index];
if (fi->flag & FINFO_ACTIVE) {
netbuffree(fi->caller_addr);
/* XXX may be too big, but can't access xprt array here */
if (fi->forward_fd >= svc_maxfd)
svc_maxfd--;
free(fi->uaddr);
fi->flag &= ~FINFO_ACTIVE;
rpcb_rmtcalls--;
return (1);
}
return (0);
}
static int
netbufcmp(struct netbuf *n1, struct netbuf *n2)
{
return ((n1->len != n2->len) || memcmp(n1->buf, n2->buf, n1->len));
}
static bool_t
netbuf_copybuf(struct netbuf *dst, const struct netbuf *src)
{
assert(src->len <= src->maxlen);
if (dst->maxlen < src->len || dst->buf == NULL) {
free(dst->buf);
if ((dst->buf = calloc(1, src->maxlen)) == NULL)
return (FALSE);
dst->maxlen = src->maxlen;
}
dst->len = src->len;
memcpy(dst->buf, src->buf, src->len);
return (TRUE);
}
static struct netbuf *
netbufdup(struct netbuf *ap)
{
struct netbuf *np;
if ((np = calloc(1, sizeof(struct netbuf))) == NULL)
return (NULL);
if (netbuf_copybuf(np, ap) == FALSE) {
free(np);
return (NULL);
}
return (np);
}
static void
netbuffree(struct netbuf *ap)
{
if (ap == NULL)
return;
free(ap->buf);
ap->buf = NULL;
free(ap);
}
#define MASKVAL (POLLIN | POLLPRI | POLLRDNORM | POLLRDBAND)
extern bool_t __svc_clean_idle(fd_set *, int, bool_t);
void
my_svc_run(void)
{
size_t nfds;
struct pollfd pollfds[FD_SETSIZE + 1];
int poll_ret, check_ret;
int n;
#ifdef SVC_RUN_DEBUG
int i;
#endif
register struct pollfd *p;
fd_set cleanfds;
for (;;) {
p = pollfds;
p->fd = terminate_rfd;
p->events = MASKVAL;
p++;
for (n = 0; n <= svc_maxfd; n++) {
if (FD_ISSET(n, &svc_fdset)) {
p->fd = n;
p->events = MASKVAL;
p++;
}
}
nfds = p - pollfds;
poll_ret = 0;
#ifdef SVC_RUN_DEBUG
if (debugging) {
fprintf(stderr, "polling for read on fd < ");
for (i = 0, p = pollfds; i < nfds; i++, p++)
if (p->events)
fprintf(stderr, "%d ", p->fd);
fprintf(stderr, ">\n");
}
#endif
poll_ret = poll(pollfds, nfds, 30 * 1000);
if (doterminate != 0) {
close(rpcbindlockfd);
#ifdef WARMSTART
syslog(LOG_ERR,
"rpcbind terminating on signal %d. Restart with \"rpcbind -w\"",
(int)doterminate);
write_warmstart(); /* Dump yourself */
#endif
exit(2);
}
switch (poll_ret) {
case -1:
/*
* We ignore all errors, continuing with the assumption
* that it was set by the signal handlers (or any
* other outside event) and not caused by poll().
*/
case 0:
cleanfds = svc_fdset;
__svc_clean_idle(&cleanfds, 30, FALSE);
continue;
default:
#ifdef SVC_RUN_DEBUG
if (debugging) {
fprintf(stderr, "poll returned read fds < ");
for (i = 0, p = pollfds; i < nfds; i++, p++)
if (p->revents)
fprintf(stderr, "%d ", p->fd);
fprintf(stderr, ">\n");
}
#endif
/*
* If we found as many replies on callback fds
* as the number of descriptors selectable which
* poll() returned, there can be no more so we
* don't call svc_getreq_poll. Otherwise, there
* must be another so we must call svc_getreq_poll.
*/
if ((check_ret = check_rmtcalls(pollfds, nfds)) ==
poll_ret)
continue;
svc_getreq_poll(pollfds, poll_ret-check_ret);
}
#ifdef SVC_RUN_DEBUG
if (debugging) {
fprintf(stderr, "svc_maxfd now %u\n", svc_maxfd);
}
#endif
}
}
static int
check_rmtcalls(struct pollfd *pfds, int nfds)
{
int j, ncallbacks_found = 0, rmtcalls_pending;
SVCXPRT *xprt;
if (rpcb_rmtcalls == 0)
return (0);
rmtcalls_pending = rpcb_rmtcalls;
for (j = 0; j < nfds; j++) {
if ((xprt = find_rmtcallxprt_by_fd(pfds[j].fd)) != NULL) {
if (pfds[j].revents) {
ncallbacks_found++;
#ifdef DEBUG_RMTCALL
if (debugging)
fprintf(stderr,
"my_svc_run: polled on forwarding fd %d, netid %s - calling handle_reply\n",
pfds[j].fd, xprt->xp_netid);
#endif
handle_reply(pfds[j].fd, xprt);
pfds[j].revents = 0;
if (ncallbacks_found >= rmtcalls_pending) {
break;
}
}
}
}
return (ncallbacks_found);
}
static void
xprt_set_caller(SVCXPRT *xprt, struct finfo *fi)
{
u_int32_t *xidp;
netbuf_copybuf(svc_getrpccaller(xprt), fi->caller_addr);
xidp = __rpcb_get_dg_xidp(xprt);
*xidp = fi->caller_xid;
}
/*
* Call svcerr_systemerr() only if RPCBVERS4
*/
static void
send_svcsyserr(SVCXPRT *xprt, struct finfo *fi)
{
if (fi->reply_type == RPCBPROC_INDIRECT) {
xprt_set_caller(xprt, fi);
svcerr_systemerr(xprt);
}
return;
}
static void
handle_reply(int fd, SVCXPRT *xprt)
{
XDR reply_xdrs;
struct rpc_msg reply_msg;
struct rpc_err reply_error;
char *buffer;
struct finfo *fi;
int inlen, pos, len;
struct r_rmtcall_args a;
struct sockaddr_storage ss;
socklen_t fromlen;
#ifdef SVC_RUN_DEBUG
char *uaddr;
#endif
buffer = malloc(RPC_BUF_MAX);
if (buffer == NULL)
goto done;
do {
fromlen = sizeof(ss);
inlen = recvfrom(fd, buffer, RPC_BUF_MAX, 0,
(struct sockaddr *)&ss, &fromlen);
} while (inlen < 0 && errno == EINTR);
if (inlen < 0) {
if (debugging)
fprintf(stderr,
"handle_reply: recvfrom returned %d, errno %d\n", inlen, errno);
goto done;
}
reply_msg.acpted_rply.ar_verf = _null_auth;
reply_msg.acpted_rply.ar_results.where = 0;
reply_msg.acpted_rply.ar_results.proc = (xdrproc_t) xdr_void;
xdrmem_create(&reply_xdrs, buffer, (u_int)inlen, XDR_DECODE);
if (!xdr_replymsg(&reply_xdrs, &reply_msg)) {
if (debugging)
(void) fprintf(stderr,
"handle_reply: xdr_replymsg failed\n");
goto done;
}
fi = forward_find(reply_msg.rm_xid);
#ifdef SVC_RUN_DEBUG
if (debugging) {
fprintf(stderr, "handle_reply: reply xid: %d fi addr: %p\n",
reply_msg.rm_xid, fi);
}
#endif
if (fi == NULL) {
goto done;
}
_seterr_reply(&reply_msg, &reply_error);
if (reply_error.re_status != RPC_SUCCESS) {
if (debugging)
(void) fprintf(stderr, "handle_reply: %s\n",
clnt_sperrno(reply_error.re_status));
send_svcsyserr(xprt, fi);
goto done;
}
pos = XDR_GETPOS(&reply_xdrs);
len = inlen - pos;
a.rmt_args.args = &buffer[pos];
a.rmt_args.arglen = len;
a.rmt_uaddr = fi->uaddr;
a.rmt_localvers = fi->versnum;
xprt_set_caller(xprt, fi);
#ifdef SVC_RUN_DEBUG
uaddr = taddr2uaddr(rpcbind_get_conf("udp"),
svc_getrpccaller(xprt));
if (debugging) {
fprintf(stderr, "handle_reply: forwarding address %s to %s\n",
a.rmt_uaddr, uaddr ? uaddr : "unknown");
}
free(uaddr);
#endif
svc_sendreply(xprt, (xdrproc_t) xdr_rmtcall_result, (char *) &a);
done:
free(buffer);
if (reply_msg.rm_xid == 0) {
#ifdef SVC_RUN_DEBUG
if (debugging) {
fprintf(stderr, "handle_reply: NULL xid on exit!\n");
}
#endif
} else
(void) free_slot_by_xid(reply_msg.rm_xid);
return;
}
static void
find_versions(rpcprog_t prog, char *netid, rpcvers_t *lowvp, rpcvers_t *highvp)
{
register rpcblist_ptr rbl;
unsigned int lowv = 0;
unsigned int highv = 0;
for (rbl = list_rbl; rbl != NULL; rbl = rbl->rpcb_next) {
if ((rbl->rpcb_map.r_prog != prog) ||
((rbl->rpcb_map.r_netid != NULL) &&
(strcasecmp(rbl->rpcb_map.r_netid, netid) != 0)))
continue;
if (lowv == 0) {
highv = rbl->rpcb_map.r_vers;
lowv = highv;
} else if (rbl->rpcb_map.r_vers < lowv) {
lowv = rbl->rpcb_map.r_vers;
} else if (rbl->rpcb_map.r_vers > highv) {
highv = rbl->rpcb_map.r_vers;
}
}
*lowvp = lowv;
*highvp = highv;
return;
}
/*
* returns the item with the given program, version number and netid.
* If that version number is not found, it returns the item with that
* program number, so that address is now returned to the caller. The
* caller when makes a call to this program, version number, the call
* will fail and it will return with PROGVERS_MISMATCH. The user can
* then determine the highest and the lowest version number for this
* program using clnt_geterr() and use those program version numbers.
*
* Returns the RPCBLIST for the given prog, vers and netid
*/
static rpcblist_ptr
find_service(rpcprog_t prog, rpcvers_t vers, char *netid)
{
register rpcblist_ptr hit = NULL;
register rpcblist_ptr rbl;
for (rbl = list_rbl; rbl != NULL; rbl = rbl->rpcb_next) {
if ((rbl->rpcb_map.r_prog != prog) ||
((rbl->rpcb_map.r_netid != NULL) &&
(strcasecmp(rbl->rpcb_map.r_netid, netid) != 0)))
continue;
hit = rbl;
if (rbl->rpcb_map.r_vers == vers)
break;
}
return (hit);
}
/*
* Copies the name associated with the uid of the caller and returns
* a pointer to it. Similar to getwd().
*/
static char *
getowner(SVCXPRT *transp, char *owner, size_t ownersize)
{
uid_t uid;
if (__rpc_get_local_uid(transp, &uid) < 0)
strlcpy(owner, "unknown", ownersize);
else if (uid == 0)
strlcpy(owner, "superuser", ownersize);
else
snprintf(owner, ownersize, "%d", uid);
return owner;
}
#ifdef PORTMAP
/*
* Add this to the pmap list only if it is UDP or TCP.
*/
static int
add_pmaplist(RPCB *arg)
{
struct pmap pmap;
struct pmaplist *pml;
int h1, h2, h3, h4, p1, p2;
if (strcmp(arg->r_netid, udptrans) == 0) {
/* It is UDP! */
pmap.pm_prot = IPPROTO_UDP;
} else if (strcmp(arg->r_netid, tcptrans) == 0) {
/* It is TCP */
pmap.pm_prot = IPPROTO_TCP;
} else
/* Not an IP protocol */
return (0);
/* interpret the universal address for TCP/IP */
if (sscanf(arg->r_addr, "%d.%d.%d.%d.%d.%d",
&h1, &h2, &h3, &h4, &p1, &p2) != 6)
return (0);
pmap.pm_port = ((p1 & 0xff) << 8) + (p2 & 0xff);
pmap.pm_prog = arg->r_prog;
pmap.pm_vers = arg->r_vers;
/*
* add to END of list
*/
pml = malloc(sizeof (struct pmaplist));
if (pml == NULL) {
(void) syslog(LOG_ERR, "rpcbind: no memory!\n");
return (1);
}
pml->pml_map = pmap;
pml->pml_next = NULL;
if (list_pml == NULL) {
list_pml = pml;
} else {
struct pmaplist *fnd;
/* Attach to the end of the list */
for (fnd = list_pml; fnd->pml_next; fnd = fnd->pml_next)
;
fnd->pml_next = pml;
}
return (0);
}
/*
* Delete this from the pmap list only if it is UDP or TCP.
*/
static int
del_pmaplist(RPCB *arg)
{
struct pmaplist *pml;
struct pmaplist *prevpml, *fnd;
unsigned long prot;
if (strcmp(arg->r_netid, udptrans) == 0) {
/* It is UDP! */
prot = IPPROTO_UDP;
} else if (strcmp(arg->r_netid, tcptrans) == 0) {
/* It is TCP */
prot = IPPROTO_TCP;
} else if (arg->r_netid[0] == 0) {
prot = 0; /* Remove all occurrences */
} else {
/* Not an IP protocol */
return (0);
}
for (prevpml = NULL, pml = list_pml; pml; /* cstyle */) {
if ((pml->pml_map.pm_prog != arg->r_prog) ||
(pml->pml_map.pm_vers != arg->r_vers) ||
(prot && (pml->pml_map.pm_prot != prot))) {
/* both pml & prevpml move forwards */
prevpml = pml;
pml = pml->pml_next;
continue;
}
/* found it; pml moves forward, prevpml stays */
fnd = pml;
pml = pml->pml_next;
if (prevpml == NULL)
list_pml = pml;
else
prevpml->pml_next = pml;
free(fnd);
}
return (0);
}
#endif /* PORTMAP */
diff --git a/usr.sbin/rpcbind/rpcbind.c b/usr.sbin/rpcbind/rpcbind.c
index b0d79df20b16..0f7da00198a9 100644
--- a/usr.sbin/rpcbind/rpcbind.c
+++ b/usr.sbin/rpcbind/rpcbind.c
@@ -1,885 +1,884 @@
/* $NetBSD: rpcbind.c,v 1.3 2002/11/08 00:16:40 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1984 - 1991 by Sun Microsystems, Inc.
*/
/* #ident "@(#)rpcbind.c 1.19 94/04/25 SMI" */
#if 0
#ifndef lint
static char sccsid[] = "@(#)rpcbind.c 1.35 89/04/21 Copyr 1984 Sun Micro";
#endif
#endif
/*
* rpcbind.c
* Implements the program, version to address mapping for rpc.
*
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/errno.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <sys/wait.h>
#include <sys/signal.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <rpc/rpc.h>
#include <rpc/rpc_com.h>
#ifdef PORTMAP
#include <netinet/in.h>
#endif
#include <arpa/inet.h>
#include <fcntl.h>
#include <netdb.h>
#include <stdio.h>
#include <netconfig.h>
#include <stdlib.h>
#include <unistd.h>
#include <syslog.h>
#include <err.h>
#include <pwd.h>
#include <string.h>
#include <errno.h>
#include "rpcbind.h"
/* Global variables */
int debugging = 0; /* Tell me what's going on */
int doabort = 0; /* When debugging, do an abort on errors */
int terminate_rfd; /* Pipefd to wake on signal */
volatile sig_atomic_t doterminate = 0; /* Terminal signal received */
rpcblist_ptr list_rbl; /* A list of version 3/4 rpcbind services */
int rpcbindlockfd;
/* who to suid to if -s is given */
#define RUN_AS "daemon"
#define RPCBINDDLOCK "/var/run/rpcbind.lock"
static int runasdaemon = 0;
int insecure = 0;
int oldstyle_local = 0;
#ifdef LIBWRAP
int libwrap = 0;
#endif
int verboselog = 0;
static char **hosts = NULL;
static struct sockaddr **bound_sa;
static int ipv6_only = 0;
static int nhosts = 0;
static int on = 1;
static int terminate_wfd;
#ifdef WARMSTART
/* Local Variable */
static int warmstart = 0; /* Grab an old copy of registrations. */
#endif
#ifdef PORTMAP
struct pmaplist *list_pml; /* A list of version 2 rpcbind services */
char *udptrans; /* Name of UDP transport */
char *tcptrans; /* Name of TCP transport */
char *udp_uaddr; /* Universal UDP address */
char *tcp_uaddr; /* Universal TCP address */
#endif
static char servname[] = "rpcbind";
static char superuser[] = "superuser";
int main(int, char *[]);
static int init_transport(struct netconfig *);
static void rbllist_add(rpcprog_t, rpcvers_t, struct netconfig *,
struct netbuf *);
static void terminate(int);
static void parseargs(int, char *[]);
static void update_bound_sa(void);
int
main(int argc, char *argv[])
{
struct netconfig *nconf;
void *nc_handle; /* Net config handle */
struct rlimit rl;
int maxrec = RPC_MAXDATASIZE;
int error, fds[2];
parseargs(argc, argv);
update_bound_sa();
/* Check that another rpcbind isn't already running. */
if ((rpcbindlockfd = (open(RPCBINDDLOCK,
O_RDONLY|O_CREAT, 0444))) == -1)
err(1, "%s", RPCBINDDLOCK);
if(flock(rpcbindlockfd, LOCK_EX|LOCK_NB) == -1 && errno == EWOULDBLOCK)
errx(1, "another rpcbind is already running. Aborting");
getrlimit(RLIMIT_NOFILE, &rl);
if (rl.rlim_cur < 128) {
if (rl.rlim_max <= 128)
rl.rlim_cur = rl.rlim_max;
else
rl.rlim_cur = 128;
setrlimit(RLIMIT_NOFILE, &rl);
}
openlog("rpcbind", LOG_CONS, LOG_DAEMON);
if (geteuid()) { /* This command allowed only to root */
fprintf(stderr, "Sorry. You are not superuser\n");
exit(1);
}
nc_handle = setnetconfig(); /* open netconfig file */
if (nc_handle == NULL) {
syslog(LOG_ERR, "could not read /etc/netconfig");
exit(1);
}
#ifdef PORTMAP
udptrans = "";
tcptrans = "";
#endif
nconf = getnetconfigent("local");
if (nconf == NULL)
nconf = getnetconfigent("unix");
if (nconf == NULL) {
syslog(LOG_ERR, "%s: can't find local transport\n", argv[0]);
exit(1);
}
rpc_control(RPC_SVC_CONNMAXREC_SET, &maxrec);
init_transport(nconf);
while ((nconf = getnetconfig(nc_handle))) {
if (nconf->nc_flag & NC_VISIBLE) {
if (ipv6_only == 1 && strcmp(nconf->nc_protofmly,
"inet") == 0) {
/* DO NOTHING */
} else
init_transport(nconf);
}
}
endnetconfig(nc_handle);
/*
* Allocate pipe fd to wake main thread from signal handler in non-racy
* way.
*/
error = pipe(fds);
if (error != 0)
err(1, "pipe failed");
terminate_rfd = fds[0];
terminate_wfd = fds[1];
/* catch the usual termination signals for graceful exit */
(void) signal(SIGCHLD, reap);
(void) signal(SIGINT, terminate);
(void) signal(SIGTERM, terminate);
(void) signal(SIGQUIT, terminate);
/* ignore others that could get sent */
(void) signal(SIGPIPE, SIG_IGN);
(void) signal(SIGHUP, SIG_IGN);
(void) signal(SIGUSR1, SIG_IGN);
(void) signal(SIGUSR2, SIG_IGN);
#ifdef WARMSTART
if (warmstart) {
read_warmstart();
}
#endif
if (debugging) {
printf("rpcbind debugging enabled.");
if (doabort) {
printf(" Will abort on errors!\n");
} else {
printf("\n");
}
} else {
if (daemon(0, 0))
err(1, "fork failed");
}
if (runasdaemon) {
struct passwd *p;
if((p = getpwnam(RUN_AS)) == NULL) {
syslog(LOG_ERR, "cannot get uid of daemon: %m");
exit(1);
}
if (setuid(p->pw_uid) == -1) {
syslog(LOG_ERR, "setuid to daemon failed: %m");
exit(1);
}
}
network_init();
my_svc_run();
syslog(LOG_ERR, "svc_run returned unexpectedly");
rpcbind_abort();
/* NOTREACHED */
return 0;
}
/*
* Adds the entry into the rpcbind database.
* If PORTMAP, then for UDP and TCP, it adds the entries for version 2 also
* Returns 0 if succeeds, else fails
*/
static int
init_transport(struct netconfig *nconf)
{
int fd;
struct t_bind taddr;
struct addrinfo hints, *res = NULL;
struct __rpc_sockinfo si;
SVCXPRT *my_xprt;
int status; /* bound checking ? */
int aicode;
int addrlen;
int nhostsbak;
int bound;
struct sockaddr *sa;
u_int32_t host_addr[4]; /* IPv4 or IPv6 */
struct sockaddr_un sun;
mode_t oldmask;
if ((nconf->nc_semantics != NC_TPI_CLTS) &&
(nconf->nc_semantics != NC_TPI_COTS) &&
(nconf->nc_semantics != NC_TPI_COTS_ORD))
return (1); /* not my type */
#ifdef ND_DEBUG
if (debugging) {
int i;
char **s;
(void)fprintf(stderr, "%s: %ld lookup routines :\n",
nconf->nc_netid, nconf->nc_nlookups);
for (i = 0, s = nconf->nc_lookups; i < nconf->nc_nlookups;
i++, s++)
fprintf(stderr, "[%d] - %s\n", i, *s);
}
#endif
/*
* XXX - using RPC library internal functions.
*/
if ((strcmp(nconf->nc_netid, "local") == 0) ||
(strcmp(nconf->nc_netid, "unix") == 0)) {
/*
* For other transports we call this later, for each socket we
* like to bind.
*/
if ((fd = __rpc_nconf2fd(nconf)) < 0) {
int non_fatal = 0;
if (errno == EAFNOSUPPORT)
non_fatal = 1;
syslog(non_fatal?LOG_DEBUG:LOG_ERR, "cannot create socket for %s",
nconf->nc_netid);
return (1);
}
}
if (!__rpc_nconf2sockinfo(nconf, &si)) {
syslog(LOG_ERR, "cannot get information for %s",
nconf->nc_netid);
return (1);
}
if ((strcmp(nconf->nc_netid, "local") == 0) ||
(strcmp(nconf->nc_netid, "unix") == 0)) {
memset(&sun, 0, sizeof sun);
sun.sun_family = AF_LOCAL;
unlink(_PATH_RPCBINDSOCK);
strcpy(sun.sun_path, _PATH_RPCBINDSOCK);
sun.sun_len = SUN_LEN(&sun);
addrlen = sizeof (struct sockaddr_un);
sa = (struct sockaddr *)&sun;
} else {
/* Get rpcbind's address on this transport */
memset(&hints, 0, sizeof hints);
hints.ai_flags = AI_PASSIVE;
hints.ai_family = si.si_af;
hints.ai_socktype = si.si_socktype;
hints.ai_protocol = si.si_proto;
}
if ((strcmp(nconf->nc_netid, "local") != 0) &&
(strcmp(nconf->nc_netid, "unix") != 0)) {
/*
* If no hosts were specified, just bind to INADDR_ANY.
* Otherwise make sure 127.0.0.1 is added to the list.
*/
nhostsbak = nhosts + 1;
hosts = realloc(hosts, nhostsbak * sizeof(char *));
if (nhostsbak == 1)
hosts[0] = "*";
else {
if (hints.ai_family == AF_INET) {
hosts[nhostsbak - 1] = "127.0.0.1";
} else if (hints.ai_family == AF_INET6) {
hosts[nhostsbak - 1] = "::1";
} else
return 1;
}
/*
* Bind to specific IPs if asked to
*/
bound = 0;
while (nhostsbak > 0) {
--nhostsbak;
/*
* XXX - using RPC library internal functions.
*/
if ((fd = __rpc_nconf2fd(nconf)) < 0) {
int non_fatal = 0;
if (errno == EAFNOSUPPORT &&
nconf->nc_semantics != NC_TPI_CLTS)
non_fatal = 1;
syslog(non_fatal ? LOG_DEBUG : LOG_ERR,
"cannot create socket for %s", nconf->nc_netid);
return (1);
}
switch (hints.ai_family) {
case AF_INET:
if (inet_pton(AF_INET, hosts[nhostsbak],
host_addr) == 1) {
hints.ai_flags &= AI_NUMERICHOST;
} else {
/*
* Skip if we have an AF_INET6 address.
*/
if (inet_pton(AF_INET6,
hosts[nhostsbak], host_addr) == 1) {
close(fd);
continue;
}
}
break;
case AF_INET6:
if (inet_pton(AF_INET6, hosts[nhostsbak],
host_addr) == 1) {
hints.ai_flags &= AI_NUMERICHOST;
} else {
/*
* Skip if we have an AF_INET address.
*/
if (inet_pton(AF_INET, hosts[nhostsbak],
host_addr) == 1) {
close(fd);
continue;
}
}
if (setsockopt(fd, IPPROTO_IPV6,
IPV6_V6ONLY, &on, sizeof on) < 0) {
syslog(LOG_ERR,
"can't set v6-only binding for "
"ipv6 socket: %m");
continue;
}
break;
default:
break;
}
/*
* If no hosts were specified, just bind to INADDR_ANY
*/
if (strcmp("*", hosts[nhostsbak]) == 0)
hosts[nhostsbak] = NULL;
if ((strcmp(nconf->nc_netid, "local") != 0) &&
(strcmp(nconf->nc_netid, "unix") != 0)) {
if ((aicode = getaddrinfo(hosts[nhostsbak],
servname, &hints, &res)) != 0) {
syslog(LOG_ERR,
"cannot get local address for %s: %s",
nconf->nc_netid, gai_strerror(aicode));
continue;
}
addrlen = res->ai_addrlen;
sa = (struct sockaddr *)res->ai_addr;
}
oldmask = umask(S_IXUSR|S_IXGRP|S_IXOTH);
if (bind(fd, sa, addrlen) != 0) {
syslog(LOG_ERR, "cannot bind %s on %s: %m",
(hosts[nhostsbak] == NULL) ? "*" :
hosts[nhostsbak], nconf->nc_netid);
if (res != NULL)
freeaddrinfo(res);
continue;
} else
bound = 1;
(void)umask(oldmask);
/* Copy the address */
taddr.addr.len = taddr.addr.maxlen = addrlen;
taddr.addr.buf = malloc(addrlen);
if (taddr.addr.buf == NULL) {
syslog(LOG_ERR,
"cannot allocate memory for %s address",
nconf->nc_netid);
if (res != NULL)
freeaddrinfo(res);
return 1;
}
memcpy(taddr.addr.buf, sa, addrlen);
#ifdef ND_DEBUG
if (debugging) {
/*
* for debugging print out our universal
* address
*/
char *uaddr;
struct netbuf nb;
nb.buf = sa;
nb.len = nb.maxlen = sa->sa_len;
uaddr = taddr2uaddr(nconf, &nb);
(void)fprintf(stderr,
"rpcbind : my address is %s\n", uaddr);
(void)free(uaddr);
}
#endif
if (nconf->nc_semantics != NC_TPI_CLTS)
listen(fd, SOMAXCONN);
my_xprt = (SVCXPRT *)svc_tli_create(fd, nconf, &taddr,
RPC_MAXDATASIZE, RPC_MAXDATASIZE);
if (my_xprt == (SVCXPRT *)NULL) {
syslog(LOG_ERR, "%s: could not create service",
nconf->nc_netid);
goto error;
}
}
if (!bound)
return 1;
} else {
oldmask = umask(S_IXUSR|S_IXGRP|S_IXOTH);
if (bind(fd, sa, addrlen) < 0) {
syslog(LOG_ERR, "cannot bind %s: %m", nconf->nc_netid);
if (res != NULL)
freeaddrinfo(res);
return 1;
}
(void) umask(oldmask);
/* Copy the address */
taddr.addr.len = taddr.addr.maxlen = addrlen;
taddr.addr.buf = malloc(addrlen);
if (taddr.addr.buf == NULL) {
syslog(LOG_ERR, "cannot allocate memory for %s address",
nconf->nc_netid);
if (res != NULL)
freeaddrinfo(res);
return 1;
}
memcpy(taddr.addr.buf, sa, addrlen);
#ifdef ND_DEBUG
if (debugging) {
/* for debugging print out our universal address */
char *uaddr;
struct netbuf nb;
nb.buf = sa;
nb.len = nb.maxlen = sa->sa_len;
uaddr = taddr2uaddr(nconf, &nb);
(void) fprintf(stderr, "rpcbind : my address is %s\n",
uaddr);
(void) free(uaddr);
}
#endif
if (nconf->nc_semantics != NC_TPI_CLTS)
listen(fd, SOMAXCONN);
my_xprt = (SVCXPRT *)svc_tli_create(fd, nconf, &taddr,
RPC_MAXDATASIZE, RPC_MAXDATASIZE);
if (my_xprt == (SVCXPRT *)NULL) {
syslog(LOG_ERR, "%s: could not create service",
nconf->nc_netid);
goto error;
}
}
#ifdef PORTMAP
/*
* Register both the versions for tcp/ip, udp/ip and local.
*/
if ((strcmp(nconf->nc_protofmly, NC_INET) == 0 &&
(strcmp(nconf->nc_proto, NC_TCP) == 0 ||
strcmp(nconf->nc_proto, NC_UDP) == 0)) ||
(strcmp(nconf->nc_netid, "unix") == 0) ||
(strcmp(nconf->nc_netid, "local") == 0)) {
struct pmaplist *pml;
if (!svc_register(my_xprt, PMAPPROG, PMAPVERS,
pmap_service, 0)) {
syslog(LOG_ERR, "could not register on %s",
nconf->nc_netid);
goto error;
}
pml = malloc(sizeof (struct pmaplist));
if (pml == NULL) {
syslog(LOG_ERR, "no memory!");
exit(1);
}
pml->pml_map.pm_prog = PMAPPROG;
pml->pml_map.pm_vers = PMAPVERS;
pml->pml_map.pm_port = PMAPPORT;
if (strcmp(nconf->nc_proto, NC_TCP) == 0) {
if (tcptrans[0]) {
free(pml);
pml = NULL;
syslog(LOG_ERR,
"cannot have more than one TCP transport");
goto error;
}
tcptrans = strdup(nconf->nc_netid);
pml->pml_map.pm_prot = IPPROTO_TCP;
/* Let's snarf the universal address */
/* "h1.h2.h3.h4.p1.p2" */
tcp_uaddr = taddr2uaddr(nconf, &taddr.addr);
} else if (strcmp(nconf->nc_proto, NC_UDP) == 0) {
if (udptrans[0]) {
syslog(LOG_ERR,
"cannot have more than one UDP transport");
goto error;
}
udptrans = strdup(nconf->nc_netid);
pml->pml_map.pm_prot = IPPROTO_UDP;
/* Let's snarf the universal address */
/* "h1.h2.h3.h4.p1.p2" */
udp_uaddr = taddr2uaddr(nconf, &taddr.addr);
} else if (strcmp(nconf->nc_netid, "local") == 0)
pml->pml_map.pm_prot = IPPROTO_ST;
else if (strcmp(nconf->nc_netid, "unix") == 0)
pml->pml_map.pm_prot = IPPROTO_ST;
pml->pml_next = list_pml;
list_pml = pml;
/* Add version 3 information */
pml = malloc(sizeof (struct pmaplist));
if (pml == NULL) {
syslog(LOG_ERR, "no memory!");
exit(1);
}
pml->pml_map = list_pml->pml_map;
pml->pml_map.pm_vers = RPCBVERS;
pml->pml_next = list_pml;
list_pml = pml;
/* Add version 4 information */
pml = malloc (sizeof (struct pmaplist));
if (pml == NULL) {
syslog(LOG_ERR, "no memory!");
exit(1);
}
pml->pml_map = list_pml->pml_map;
pml->pml_map.pm_vers = RPCBVERS4;
pml->pml_next = list_pml;
list_pml = pml;
/* Also add version 2 stuff to rpcbind list */
rbllist_add(PMAPPROG, PMAPVERS, nconf, &taddr.addr);
}
#endif
/* version 3 registration */
if (!svc_reg(my_xprt, RPCBPROG, RPCBVERS, rpcb_service_3, NULL)) {
syslog(LOG_ERR, "could not register %s version 3",
nconf->nc_netid);
goto error;
}
rbllist_add(RPCBPROG, RPCBVERS, nconf, &taddr.addr);
/* version 4 registration */
if (!svc_reg(my_xprt, RPCBPROG, RPCBVERS4, rpcb_service_4, NULL)) {
syslog(LOG_ERR, "could not register %s version 4",
nconf->nc_netid);
goto error;
}
rbllist_add(RPCBPROG, RPCBVERS4, nconf, &taddr.addr);
/* decide if bound checking works for this transport */
status = add_bndlist(nconf, &taddr.addr);
#ifdef BIND_DEBUG
if (debugging) {
if (status < 0) {
fprintf(stderr, "Error in finding bind status for %s\n",
nconf->nc_netid);
} else if (status == 0) {
fprintf(stderr, "check binding for %s\n",
nconf->nc_netid);
} else if (status > 0) {
fprintf(stderr, "No check binding for %s\n",
nconf->nc_netid);
}
}
#endif
/*
* rmtcall only supported on CLTS transports for now.
*/
if (nconf->nc_semantics == NC_TPI_CLTS) {
status = create_rmtcall_fd(nconf);
#ifdef BIND_DEBUG
if (debugging) {
if (status < 0) {
fprintf(stderr,
"Could not create rmtcall fd for %s\n",
nconf->nc_netid);
} else {
fprintf(stderr, "rmtcall fd for %s is %d\n",
nconf->nc_netid, status);
}
}
#endif
}
return (0);
error:
close(fd);
return (1);
}
/*
* Create the list of addresses that we're bound to. Normally, this
* list is empty because we're listening on the wildcard address
* (nhost == 0). If -h is specified on the command line, then
* bound_sa will have a list of the addresses that the program binds
* to specifically. This function takes that list and converts them to
* struct sockaddr * and stores them in bound_sa.
*/
static void
update_bound_sa(void)
{
struct addrinfo hints, *res = NULL;
int i;
if (nhosts == 0)
return;
bound_sa = malloc(sizeof(*bound_sa) * nhosts);
memset(&hints, 0, sizeof(hints));
hints.ai_family = PF_UNSPEC;
for (i = 0; i < nhosts; i++) {
if (getaddrinfo(hosts[i], NULL, &hints, &res) != 0)
continue;
bound_sa[i] = malloc(res->ai_addrlen);
memcpy(bound_sa[i], res->ai_addr, res->ai_addrlen);
}
}
/*
* Match the sa against the list of addresses we've bound to. If
* we've not specifically bound to anything, we match everything.
* Otherwise, if the IPv4 or IPv6 address matches one of the addresses
* in bound_sa, we return true. If not, we return false.
*/
int
listen_addr(const struct sockaddr *sa)
{
int i;
/*
* If nhosts == 0, then there were no -h options on the
* command line, so all addresses are addresses we're
* listening to.
*/
if (nhosts == 0)
return 1;
for (i = 0; i < nhosts; i++) {
if (bound_sa[i] == NULL ||
sa->sa_family != bound_sa[i]->sa_family)
continue;
switch (sa->sa_family) {
case AF_INET:
if (memcmp(&SA2SINADDR(sa), &SA2SINADDR(bound_sa[i]),
sizeof(struct in_addr)) == 0)
return (1);
break;
#ifdef INET6
case AF_INET6:
if (memcmp(&SA2SIN6ADDR(sa), &SA2SIN6ADDR(bound_sa[i]),
sizeof(struct in6_addr)) == 0)
return (1);
break;
#endif
default:
break;
}
}
return (0);
}
static void
rbllist_add(rpcprog_t prog, rpcvers_t vers, struct netconfig *nconf,
struct netbuf *addr)
{
rpcblist_ptr rbl;
rbl = malloc(sizeof (rpcblist));
if (rbl == NULL) {
syslog(LOG_ERR, "no memory!");
exit(1);
}
rbl->rpcb_map.r_prog = prog;
rbl->rpcb_map.r_vers = vers;
rbl->rpcb_map.r_netid = strdup(nconf->nc_netid);
rbl->rpcb_map.r_addr = taddr2uaddr(nconf, addr);
rbl->rpcb_map.r_owner = strdup(superuser);
rbl->rpcb_next = list_rbl; /* Attach to global list */
list_rbl = rbl;
}
/*
* Catch the signal and die
*/
static void
terminate(int signum)
{
char c = '\0';
ssize_t wr;
doterminate = signum;
wr = write(terminate_wfd, &c, 1);
if (wr < 1)
_exit(2);
}
void
rpcbind_abort(void)
{
#ifdef WARMSTART
write_warmstart(); /* Dump yourself */
#endif
abort();
}
/* get command line options */
static void
parseargs(int argc, char *argv[])
{
int c;
#ifdef WARMSTART
#define WSOP "w"
#else
#define WSOP ""
#endif
#ifdef LIBWRAP
#define WRAPOP "W"
#else
#define WRAPOP ""
#endif
while ((c = getopt(argc, argv, "6adh:iLls" WRAPOP WSOP)) != -1) {
switch (c) {
case '6':
ipv6_only = 1;
break;
case 'a':
doabort = 1; /* when debugging, do an abort on */
break; /* errors; for rpcbind developers */
/* only! */
case 'd':
debugging = 1;
break;
case 'h':
++nhosts;
hosts = realloc(hosts, nhosts * sizeof(char *));
if (hosts == NULL)
errx(1, "Out of memory");
hosts[nhosts - 1] = strdup(optarg);
if (hosts[nhosts - 1] == NULL)
errx(1, "Out of memory");
break;
case 'i':
insecure = 1;
break;
case 'L':
oldstyle_local = 1;
break;
case 'l':
verboselog = 1;
break;
case 's':
runasdaemon = 1;
break;
#ifdef LIBWRAP
case 'W':
libwrap = 1;
break;
#endif
#ifdef WARMSTART
case 'w':
warmstart = 1;
break;
#endif
default: /* error */
fprintf(stderr,
"usage: rpcbind [-6adiLls%s%s] [-h bindip]\n",
WRAPOP, WSOP);
exit (1);
}
}
if (doabort && !debugging) {
fprintf(stderr,
"-a (abort) specified without -d (debugging) -- ignored.\n");
doabort = 0;
}
#undef WSOP
}
void
reap(int dummy __unused)
{
int save_errno = errno;
while (wait3(NULL, WNOHANG, NULL) > 0)
;
errno = save_errno;
}
void
toggle_verboselog(int dummy __unused)
{
verboselog = !verboselog;
}
diff --git a/usr.sbin/rpcbind/rpcbind.h b/usr.sbin/rpcbind/rpcbind.h
index a4bb3d274066..1ecc518c05e3 100644
--- a/usr.sbin/rpcbind/rpcbind.h
+++ b/usr.sbin/rpcbind/rpcbind.h
@@ -1,162 +1,161 @@
/* $NetBSD: rpcbind.h,v 1.1 2000/06/03 00:47:21 fvdl Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2009, Sun Microsystems, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Sun Microsystems, Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT 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 SUCH DAMAGE.
*/
/*
* Copyright (c) 1986 - 1991 by Sun Microsystems, Inc.
*/
/* #ident "@(#)rpcbind.h 1.4 90/04/12 SMI" */
/*
* rpcbind.h
* The common header declarations
*/
#ifndef rpcbind_h
#define rpcbind_h
#include <signal.h>
#ifdef PORTMAP
#include <rpc/pmap_prot.h>
#endif
#include <rpc/rpcb_prot.h>
/*
* Stuff for the rmtcall service
*/
struct encap_parms {
u_int32_t arglen;
char *args;
};
struct r_rmtcall_args {
u_int32_t rmt_prog;
u_int32_t rmt_vers;
u_int32_t rmt_proc;
int rmt_localvers; /* whether to send port # or uaddr */
char *rmt_uaddr;
struct encap_parms rmt_args;
};
extern int debugging;
extern int doabort;
extern int terminate_rfd;
extern volatile sig_atomic_t doterminate;
#ifdef LIBWRAP
extern int libwrap;
#endif
extern int verboselog;
extern int insecure;
extern int oldstyle_local;
extern rpcblist_ptr list_rbl; /* A list of version 3 & 4 rpcbind services */
extern int rpcbindlockfd;
#ifdef PORTMAP
extern struct pmaplist *list_pml; /* A list of version 2 rpcbind services */
extern char *udptrans; /* Name of UDP transport */
extern char *tcptrans; /* Name of TCP transport */
extern char *udp_uaddr; /* Universal UDP address */
extern char *tcp_uaddr; /* Universal TCP address */
#endif
int add_bndlist(struct netconfig *, struct netbuf *);
bool_t is_bound(char *, char *);
char *mergeaddr(SVCXPRT *, char *, char *, char *);
struct netconfig *rpcbind_get_conf(const char *);
void rpcbs_init(void);
void rpcbs_procinfo(rpcvers_t, rpcproc_t);
void rpcbs_set(rpcvers_t, bool_t);
void rpcbs_unset(rpcvers_t, bool_t);
void rpcbs_getaddr(rpcvers_t, rpcprog_t, rpcvers_t, char *, char *);
void rpcbs_rmtcall(rpcvers_t, rpcproc_t, rpcprog_t, rpcvers_t, rpcproc_t,
char *, rpcblist_ptr);
void *rpcbproc_getstat(void *, struct svc_req *, SVCXPRT *, rpcvers_t);
void rpcb_service_3(struct svc_req *, SVCXPRT *);
void rpcb_service_4(struct svc_req *, SVCXPRT *);
/* Common functions shared between versions */
void *rpcbproc_set_com(void *, struct svc_req *, SVCXPRT *, rpcvers_t);
void *rpcbproc_unset_com(void *, struct svc_req *, SVCXPRT *, rpcvers_t);
bool_t map_set(RPCB *, char *);
bool_t map_unset(RPCB *, char *);
void delete_prog(unsigned int);
void *rpcbproc_getaddr_com(RPCB *, struct svc_req *, SVCXPRT *, rpcvers_t,
rpcvers_t);
void *rpcbproc_gettime_com(void *, struct svc_req *, SVCXPRT *,
rpcvers_t);
void *rpcbproc_uaddr2taddr_com(void *, struct svc_req *,
SVCXPRT *, rpcvers_t);
void *rpcbproc_taddr2uaddr_com(void *, struct svc_req *, SVCXPRT *,
rpcvers_t);
int create_rmtcall_fd(struct netconfig *);
void rpcbproc_callit_com(struct svc_req *, SVCXPRT *, rpcvers_t,
rpcvers_t);
void my_svc_run(void);
void rpcbind_abort(void);
void reap(int);
void toggle_verboselog(int);
int check_access(SVCXPRT *, rpcproc_t, void *, unsigned int);
int check_callit(SVCXPRT *, struct r_rmtcall_args *, int);
void logit(int, struct sockaddr *, rpcproc_t, rpcprog_t, const char *);
int is_loopback(struct netbuf *);
#ifdef PORTMAP
extern void pmap_service(struct svc_req *, SVCXPRT *);
#endif
void write_warmstart(void);
void read_warmstart(void);
char *addrmerge(struct netbuf *caller, const char *serv_uaddr,
const char *clnt_uaddr, char const *netid);
int listen_addr(const struct sockaddr *sa);
void network_init(void);
struct sockaddr *local_sa(int);
/* For different getaddr semantics */
#define RPCB_ALLVERS 0
#define RPCB_ONEVERS 1
/* To convert a struct sockaddr to IPv4 or IPv6 address */
#define SA2SIN(sa) ((struct sockaddr_in *)(sa))
#define SA2SINADDR(sa) (SA2SIN(sa)->sin_addr)
#ifdef INET6
#define SA2SIN6(sa) ((struct sockaddr_in6 *)(sa))
#define SA2SIN6ADDR(sa) (SA2SIN6(sa)->sin6_addr)
#endif
#endif /* rpcbind_h */
diff --git a/usr.sbin/rpcbind/security.c b/usr.sbin/rpcbind/security.c
index 22cf0b26fa9c..6d899f0a9269 100644
--- a/usr.sbin/rpcbind/security.c
+++ b/usr.sbin/rpcbind/security.c
@@ -1,287 +1,286 @@
/* $NetBSD: security.c,v 1.5 2000/06/08 09:01:05 fvdl Exp $ */
-/* $FreeBSD$ */
#include <sys/types.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <rpc/rpc.h>
#include <rpc/rpcb_prot.h>
#include <rpc/pmap_prot.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <syslog.h>
#include <netdb.h>
/*
* XXX for special case checks in check_callit.
*/
#include <rpcsvc/mount.h>
#include <rpcsvc/rquota.h>
#include <rpcsvc/nfs_prot.h>
#include <rpcsvc/yp.h>
#include <rpcsvc/ypclnt.h>
#include <rpcsvc/yppasswd.h>
#include "rpcbind.h"
#ifdef LIBWRAP
# include <tcpd.h>
#ifndef LIBWRAP_ALLOW_FACILITY
# define LIBWRAP_ALLOW_FACILITY LOG_AUTH
#endif
#ifndef LIBWRAP_ALLOW_SEVERITY
# define LIBWRAP_ALLOW_SEVERITY LOG_INFO
#endif
#ifndef LIBWRAP_DENY_FACILITY
# define LIBWRAP_DENY_FACILITY LOG_AUTH
#endif
#ifndef LIBWRAP_DENY_SEVERITY
# define LIBWRAP_DENY_SEVERITY LOG_WARNING
#endif
int allow_severity = LIBWRAP_ALLOW_FACILITY|LIBWRAP_ALLOW_SEVERITY;
int deny_severity = LIBWRAP_DENY_FACILITY|LIBWRAP_DENY_SEVERITY;
#endif
#ifndef PORTMAP_LOG_FACILITY
# define PORTMAP_LOG_FACILITY LOG_AUTH
#endif
#ifndef PORTMAP_LOG_SEVERITY
# define PORTMAP_LOG_SEVERITY LOG_INFO
#endif
int log_severity = PORTMAP_LOG_FACILITY|PORTMAP_LOG_SEVERITY;
extern int verboselog;
int
check_access(SVCXPRT *xprt, rpcproc_t proc, void *args, unsigned int rpcbvers)
{
struct netbuf *caller = svc_getrpccaller(xprt);
struct sockaddr *addr = (struct sockaddr *)caller->buf;
#ifdef LIBWRAP
struct request_info req;
#endif
rpcprog_t prog = 0;
rpcb *rpcbp;
struct pmap *pmap;
/*
* The older PMAP_* equivalents have the same numbers, so
* they are accounted for here as well.
*/
switch (proc) {
case RPCBPROC_GETADDR:
case RPCBPROC_SET:
case RPCBPROC_UNSET:
if (rpcbvers > PMAPVERS) {
rpcbp = (rpcb *)args;
prog = rpcbp->r_prog;
} else {
pmap = (struct pmap *)args;
prog = pmap->pm_prog;
}
if (proc == RPCBPROC_GETADDR)
break;
if (!insecure && !is_loopback(caller)) {
if (verboselog)
logit(log_severity, addr, proc, prog,
" declined (non-loopback sender)");
return 0;
}
break;
case RPCBPROC_CALLIT:
case RPCBPROC_INDIRECT:
case RPCBPROC_DUMP:
case RPCBPROC_GETTIME:
case RPCBPROC_UADDR2TADDR:
case RPCBPROC_TADDR2UADDR:
case RPCBPROC_GETVERSADDR:
case RPCBPROC_GETADDRLIST:
case RPCBPROC_GETSTAT:
default:
break;
}
#ifdef LIBWRAP
if (libwrap && addr->sa_family != AF_LOCAL) {
request_init(&req, RQ_DAEMON, "rpcbind", RQ_CLIENT_SIN, addr,
0);
sock_methods(&req);
if(!hosts_access(&req)) {
logit(deny_severity, addr, proc, prog,
": request from unauthorized host");
return 0;
}
}
#endif
if (verboselog)
logit(log_severity, addr, proc, prog, "");
return 1;
}
int
is_loopback(struct netbuf *nbuf)
{
struct sockaddr *addr = (struct sockaddr *)nbuf->buf;
struct sockaddr_in *sin;
#ifdef INET6
struct sockaddr_in6 *sin6;
#endif
switch (addr->sa_family) {
case AF_INET:
if (!oldstyle_local)
return 0;
sin = (struct sockaddr_in *)addr;
return ((sin->sin_addr.s_addr == htonl(INADDR_LOOPBACK)) &&
(ntohs(sin->sin_port) < IPPORT_RESERVED));
#ifdef INET6
case AF_INET6:
if (!oldstyle_local)
return 0;
sin6 = (struct sockaddr_in6 *)addr;
return (IN6_IS_ADDR_LOOPBACK(&sin6->sin6_addr) &&
(ntohs(sin6->sin6_port) < IPV6PORT_RESERVED));
#endif
case AF_LOCAL:
return 1;
default:
break;
}
return 0;
}
/* logit - report events of interest via the syslog daemon */
void
logit(int severity, struct sockaddr *addr, rpcproc_t procnum, rpcprog_t prognum,
const char *text)
{
const char *procname;
char procbuf[32];
char *progname;
char progbuf[32];
char fromname[NI_MAXHOST];
struct rpcent *rpc;
static const char *procmap[] = {
/* RPCBPROC_NULL */ "null",
/* RPCBPROC_SET */ "set",
/* RPCBPROC_UNSET */ "unset",
/* RPCBPROC_GETADDR */ "getport/addr",
/* RPCBPROC_DUMP */ "dump",
/* RPCBPROC_CALLIT */ "callit",
/* RPCBPROC_GETTIME */ "gettime",
/* RPCBPROC_UADDR2TADDR */ "uaddr2taddr",
/* RPCBPROC_TADDR2UADDR */ "taddr2uaddr",
/* RPCBPROC_GETVERSADDR */ "getversaddr",
/* RPCBPROC_INDIRECT */ "indirect",
/* RPCBPROC_GETADDRLIST */ "getaddrlist",
/* RPCBPROC_GETSTAT */ "getstat"
};
/*
* Fork off a process or the portmap daemon might hang while
* getrpcbynumber() or syslog() does its thing.
*/
if (fork() == 0) {
setproctitle("logit");
/* Try to map program number to name. */
if (prognum == 0) {
progname = "";
} else if ((rpc = getrpcbynumber((int) prognum))) {
progname = rpc->r_name;
} else {
snprintf(progname = progbuf, sizeof(progbuf), "%u",
(unsigned)prognum);
}
/* Try to map procedure number to name. */
if (procnum >= (sizeof procmap / sizeof (char *))) {
snprintf(procbuf, sizeof procbuf, "%u",
(unsigned)procnum);
procname = procbuf;
} else
procname = procmap[procnum];
/* Write syslog record. */
if (addr->sa_family == AF_LOCAL)
strcpy(fromname, "local");
else
getnameinfo(addr, addr->sa_len, fromname,
sizeof fromname, NULL, 0, NI_NUMERICHOST);
syslog(severity, "connect from %s to %s(%s)%s",
fromname, procname, progname, text);
_exit(0);
}
}
int
check_callit(SVCXPRT *xprt, struct r_rmtcall_args *args, int versnum __unused)
{
struct sockaddr *sa = (struct sockaddr *)svc_getrpccaller(xprt)->buf;
/*
* Always allow calling NULLPROC
*/
if (args->rmt_proc == 0)
return 1;
/*
* XXX - this special casing sucks.
*/
switch (args->rmt_prog) {
case RPCBPROG:
/*
* Allow indirect calls to ourselves in insecure mode.
* The is_loopback checks aren't useful then anyway.
*/
if (!insecure)
goto deny;
break;
case MOUNTPROG:
if (args->rmt_proc != MOUNTPROC_MNT &&
args->rmt_proc != MOUNTPROC_UMNT)
break;
goto deny;
case YPBINDPROG:
if (args->rmt_proc != YPBINDPROC_SETDOM)
break;
/* FALLTHROUGH */
case YPPASSWDPROG:
case NFS_PROGRAM:
case RQUOTAPROG:
goto deny;
case YPPROG:
switch (args->rmt_proc) {
case YPPROC_ALL:
case YPPROC_MATCH:
case YPPROC_FIRST:
case YPPROC_NEXT:
goto deny;
default:
break;
}
default:
break;
}
return 1;
deny:
#ifdef LIBWRAP
logit(deny_severity, sa, args->rmt_proc, args->rmt_prog,
": indirect call not allowed");
#else
logit(0, sa, args->rmt_proc, args->rmt_prog,
": indirect call not allowed");
#endif
return 0;
}
diff --git a/usr.sbin/rtadvd/advcap.c b/usr.sbin/rtadvd/advcap.c
index 5efa5ce2dd9c..7e7c1ad4fe0b 100644
--- a/usr.sbin/rtadvd/advcap.c
+++ b/usr.sbin/rtadvd/advcap.c
@@ -1,438 +1,437 @@
-/* $FreeBSD$ */
/* $KAME: advcap.c,v 1.11 2003/05/19 09:46:50 keiichi Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 1983 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/*
* remcap - routines for dealing with the remote host data base
*
* derived from termcap
*/
#include <sys/types.h>
#include <sys/uio.h>
#include <unistd.h>
#include <fcntl.h>
#include <ctype.h>
#include <stdlib.h>
#include <stdio.h>
#include <syslog.h>
#include <errno.h>
#include <string.h>
#include "pathnames.h"
#ifndef BUFSIZ
#define BUFSIZ 1024
#endif
#define MAXHOP 32 /* max number of tc= indirections */
#define tgetent agetent
#define tnchktc anchktc
#define tnamatch anamatch
#define tgetnum agetnum
#define tgetflag agetflag
#define tgetstr agetstr
#if 0
#define V_TERMCAP "REMOTE"
#define V_TERM "HOST"
#endif
/*
* termcap - routines for dealing with the terminal capability data base
*
* BUG: Should use a "last" pointer in tbuf, so that searching
* for capabilities alphabetically would not be a n**2/2
* process when large numbers of capabilities are given.
* Note: If we add a last pointer now we will screw up the
* tc capability. We really should compile termcap.
*
* Essentially all the work here is scanning and decoding escapes
* in string capabilities. We don't use stdio because the editor
* doesn't, and because living w/o it is not hard.
*/
static char *tbuf;
static int hopcount; /* detect infinite loops in termcap, init 0 */
extern const char *conffile;
int tgetent(char *, char *);
int getent(char *, char *, const char *);
int tnchktc(void);
int tnamatch(char *);
static char *tskip(char *);
int64_t tgetnum(char *);
int tgetflag(char *);
char *tgetstr(char *, char **);
static char *tdecode(char *, char **);
/*
* Get an entry for terminal name in buffer bp,
* from the termcap file. Parse is very rudimentary;
* we just notice escaped newlines.
*/
int
tgetent(char *bp, char *name)
{
return (getent(bp, name, conffile));
}
int
getent(char *bp, char *name, const char *cfile)
{
int c;
int i = 0, cnt = 0;
char ibuf[BUFSIZ];
char *cp;
int tf;
tbuf = bp;
tf = 0;
/*
* TERMCAP can have one of two things in it. It can be the
* name of a file to use instead of /etc/termcap. In this
* case it better start with a "/". Or it can be an entry to
* use so we don't have to read the file. In this case it
* has to already have the newlines crunched out.
*/
if (cfile && *cfile)
tf = open(cfile, O_RDONLY);
if (tf < 0) {
syslog(LOG_INFO,
"<%s> open: %s", __func__, strerror(errno));
return (-2);
}
for (;;) {
cp = bp;
for (;;) {
if (i == cnt) {
cnt = read(tf, ibuf, BUFSIZ);
if (cnt <= 0) {
close(tf);
return (0);
}
i = 0;
}
c = ibuf[i++];
if (c == '\n') {
if (cp > bp && cp[-1] == '\\') {
cp--;
continue;
}
break;
}
if (cp >= bp + BUFSIZ - 1) {
write(STDERR_FILENO, "Remcap entry too long\n",
22);
break;
} else
*cp++ = c;
}
*cp = 0;
/*
* The real work for the match.
*/
if (tnamatch(name)) {
close(tf);
return (tnchktc());
}
}
}
/*
* tnchktc: check the last entry, see if it's tc=xxx. If so,
* recursively find xxx and append that entry (minus the names)
* to take the place of the tc=xxx entry. This allows termcap
* entries to say "like an HP2621 but doesn't turn on the labels".
* Note that this works because of the left to right scan.
*/
int
tnchktc(void)
{
char *p, *q;
char tcname[16]; /* name of similar terminal */
char tcbuf[BUFSIZ];
char *holdtbuf = tbuf;
int l;
p = tbuf + strlen(tbuf) - 2; /* before the last colon */
while (*--p != ':')
if (p < tbuf) {
write(STDERR_FILENO, "Bad remcap entry\n", 18);
return (0);
}
p++;
/* p now points to beginning of last field */
if (p[0] != 't' || p[1] != 'c')
return (1);
strlcpy(tcname, p + 3, sizeof tcname);
q = tcname;
while (*q && *q != ':')
q++;
*q = 0;
if (++hopcount > MAXHOP) {
write(STDERR_FILENO, "Infinite tc= loop\n", 18);
return (0);
}
if (getent(tcbuf, tcname, conffile) != 1) {
return (0);
}
for (q = tcbuf; *q++ != ':'; )
;
l = p - holdtbuf + strlen(q);
if (l > BUFSIZ) {
write(STDERR_FILENO, "Remcap entry too long\n", 23);
q[BUFSIZ - (p-holdtbuf)] = 0;
}
strcpy(p, q);
tbuf = holdtbuf;
return (1);
}
/*
* Tnamatch deals with name matching. The first field of the termcap
* entry is a sequence of names separated by |'s, so we compare
* against each such name. The normal : terminator after the last
* name (before the first field) stops us.
*/
int
tnamatch(char *np)
{
char *Np, *Bp;
Bp = tbuf;
if (*Bp == '#')
return (0);
for (;;) {
for (Np = np; *Np && *Bp == *Np; Bp++, Np++)
continue;
if (*Np == 0 && (*Bp == '|' || *Bp == ':' || *Bp == 0))
return (1);
while (*Bp && *Bp != ':' && *Bp != '|')
Bp++;
if (*Bp == 0 || *Bp == ':')
return (0);
Bp++;
}
}
/*
* Skip to the next field. Notice that this is very dumb, not
* knowing about \: escapes or any such. If necessary, :'s can be put
* into the termcap file in octal.
*/
static char *
tskip(char *bp)
{
int dquote;
dquote = 0;
while (*bp) {
switch (*bp) {
case ':':
if (!dquote)
goto breakbreak;
else
bp++;
break;
case '\\':
bp++;
if (isdigit(*bp)) {
while (isdigit(*bp++))
;
} else
bp++;
case '"':
dquote = (dquote ? 1 : 0);
bp++;
break;
default:
bp++;
break;
}
}
breakbreak:
if (*bp == ':')
bp++;
return (bp);
}
/*
* Return the (numeric) option id.
* Numeric options look like
* li#80
* i.e. the option string is separated from the numeric value by
* a # character. If the option is not found we return -1.
* Note that we handle octal numbers beginning with 0.
*/
int64_t
tgetnum(char *id)
{
int64_t i;
int base;
char *bp = tbuf;
for (;;) {
bp = tskip(bp);
if (*bp == 0)
return (-1);
if (strncmp(bp, id, strlen(id)) != 0)
continue;
bp += strlen(id);
if (*bp == '@')
return (-1);
if (*bp != '#')
continue;
bp++;
base = 10;
if (*bp == '0')
base = 8;
i = 0;
while (isdigit(*bp))
i *= base, i += *bp++ - '0';
return (i);
}
}
/*
* Handle a flag option.
* Flag options are given "naked", i.e. followed by a : or the end
* of the buffer. Return 1 if we find the option, or 0 if it is
* not given.
*/
int
tgetflag(char *id)
{
char *bp = tbuf;
for (;;) {
bp = tskip(bp);
if (!*bp)
return (0);
if (strncmp(bp, id, strlen(id)) == 0) {
bp += strlen(id);
if (!*bp || *bp == ':')
return (1);
else if (*bp == '@')
return (0);
}
}
}
/*
* Get a string valued option.
* These are given as
* cl=^Z
* Much decoding is done on the strings, and the strings are
* placed in area, which is a ref parameter which is updated.
* No checking on area overflow.
*/
char *
tgetstr(char *id, char **area)
{
char *bp = tbuf;
for (;;) {
bp = tskip(bp);
if (!*bp)
return (0);
if (strncmp(bp, id, strlen(id)) != 0)
continue;
bp += strlen(id);
if (*bp == '@')
return (0);
if (*bp != '=')
continue;
bp++;
return (tdecode(bp, area));
}
}
/*
* Tdecode does the grung work to decode the
* string capability escapes.
*/
static char *
tdecode(char *str, char **area)
{
char *cp;
int c;
const char *dp;
int i;
char term;
term = ':';
cp = *area;
again:
if (*str == '"') {
term = '"';
str++;
}
while ((c = *str++) && c != term) {
switch (c) {
case '^':
c = *str++ & 037;
break;
case '\\':
dp = "E\033^^\\\\::n\nr\rt\tb\bf\f\"\"";
c = *str++;
nextc:
if (*dp++ == c) {
c = *dp++;
break;
}
dp++;
if (*dp)
goto nextc;
if (isdigit(c)) {
c -= '0', i = 2;
do
c <<= 3, c |= *str++ - '0';
while (--i && isdigit(*str));
}
break;
}
*cp++ = c;
}
if (c == term && term != ':') {
term = ':';
goto again;
}
*cp++ = 0;
str = *area;
*area = cp;
return (str);
}
diff --git a/usr.sbin/rtadvd/advcap.h b/usr.sbin/rtadvd/advcap.h
index fd74cfd0e534..75c8e5c1976a 100644
--- a/usr.sbin/rtadvd/advcap.h
+++ b/usr.sbin/rtadvd/advcap.h
@@ -1,48 +1,47 @@
-/* $FreeBSD$ */
/* $KAME: advcap.h,v 1.5 2003/06/09 05:40:54 t-momose Exp $ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (C) 1994,1995 by Andrey A. Chernov, Moscow, Russia.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
/* Based on Id: termcap.h,v 1.8 1996/09/10 12:42:10 peter Exp */
#ifndef _ADVCAP_H_
#define _ADVCAP_H_
#include <sys/cdefs.h>
__BEGIN_DECLS
extern int agetent(char *, const char *);
extern int agetflag(const char *);
extern int64_t agetnum(const char *);
extern char *agetstr(const char *, char **);
__END_DECLS
#endif /* _ADVCAP_H_ */
diff --git a/usr.sbin/rtadvd/config.c b/usr.sbin/rtadvd/config.c
index f857889332a4..a264858edaf7 100644
--- a/usr.sbin/rtadvd/config.c
+++ b/usr.sbin/rtadvd/config.c
@@ -1,1553 +1,1552 @@
-/* $FreeBSD$ */
/* $KAME: config.c,v 1.84 2003/08/05 12:34:23 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* Copyright (C) 2011 Hiroki Sato <hrs@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <net/if.h>
#include <net/route.h>
#include <net/if_dl.h>
#include <netinet/in.h>
#include <netinet/in_var.h>
#include <netinet/ip6.h>
#include <netinet6/ip6_var.h>
#include <netinet/icmp6.h>
#include <netinet6/nd6.h>
#include <arpa/inet.h>
#include <stdio.h>
#include <syslog.h>
#include <errno.h>
#include <inttypes.h>
#include <netdb.h>
#include <string.h>
#include <search.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>
#include <ifaddrs.h>
#include "rtadvd.h"
#include "advcap.h"
#include "timer.h"
#include "if.h"
#include "config.h"
/* label of tcapcode + number + domain name + zero octet */
static char entbuf[10 + 3 + NI_MAXHOST + 1];
static char oentbuf[10 + 3 + NI_MAXHOST + 1];
static char abuf[DNAME_LABELENC_MAXLEN];
static time_t prefix_timo = (60 * 120); /* 2 hours.
* XXX: should be configurable. */
static struct rtadvd_timer *prefix_timeout(void *);
static void makeentry(char *, size_t, int, const char *);
static ssize_t dname_labelenc(char *, const char *);
/* Encode domain name label encoding in RFC 1035 Section 3.1 */
static ssize_t
dname_labelenc(char *dst, const char *src)
{
char *dst_origin;
char *p;
size_t len;
dst_origin = dst;
len = strlen(src);
if (len + len / 64 + 1 + 1 > DNAME_LABELENC_MAXLEN)
return (-1);
/* Length fields per 63 octets + '\0' (<= DNAME_LABELENC_MAXLEN) */
memset(dst, 0, len + len / 64 + 1 + 1);
syslog(LOG_DEBUG, "<%s> labelenc = %s", __func__, src);
while (src && (len = strlen(src)) != 0) {
/* Put a length field with 63 octet limitation first. */
p = strchr(src, '.');
if (p == NULL)
*dst = len = MIN(63, len);
else
*dst = len = MIN(63, p - src);
if (dst + 1 + len < dst_origin + DNAME_LABELENC_MAXLEN)
dst++;
else
return (-1);
/* Copy 63 octets at most. */
memcpy(dst, src, len);
dst += len;
if (p == NULL) /* the last label */
break;
src = p + 1;
}
/* Always need a 0-length label at the tail. */
*dst++ = '\0';
syslog(LOG_DEBUG, "<%s> labellen = %td", __func__, dst - dst_origin);
return (dst - dst_origin);
}
#define MUSTHAVE(var, cap) \
do { \
int64_t t; \
if ((t = agetnum(cap)) < 0) { \
fprintf(stderr, "rtadvd: need %s for interface %s\n", \
cap, intface); \
exit(1); \
} \
var = t; \
} while (0)
#define MAYHAVE(var, cap, def) \
do { \
if ((var = agetnum(cap)) < 0) \
var = def; \
} while (0)
int
loadconfig_index(int idx)
{
char ifname[IFNAMSIZ];
syslog(LOG_DEBUG, "<%s> enter", __func__);
if (if_indextoname(idx, ifname) != NULL)
return (loadconfig_ifname(ifname));
else
return (1);
}
int
loadconfig_ifname(char *ifname)
{
struct ifinfo *ifi;
syslog(LOG_DEBUG, "<%s> enter", __func__);
update_ifinfo(&ifilist, UPDATE_IFINFO_ALL);
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
/* NULL means all IFs will be processed. */
if (ifname != NULL &&
strcmp(ifi->ifi_ifname, ifname) != 0)
continue;
if (!ifi->ifi_persist) {
syslog(LOG_INFO,
"<%s> %s is not a target interface. "
"Ignored at this moment.", __func__,
ifi->ifi_ifname);
continue;
}
if (ifi->ifi_ifindex == 0) {
syslog(LOG_ERR,
"<%s> %s not found. "
"Ignored at this moment.", __func__,
ifi->ifi_ifname);
continue;
}
if (getconfig(ifi) == NULL) {
syslog(LOG_ERR,
"<%s> invalid configuration for %s. "
"Ignored at this moment.", __func__,
ifi->ifi_ifname);
continue;
}
}
return (0);
}
int
rm_ifinfo_index(int idx)
{
struct ifinfo *ifi;
ifi = if_indextoifinfo(idx);
if (ifi == NULL) {
syslog(LOG_ERR, "<%s>: ifinfo not found (idx=%d)",
__func__, idx);
return (-1);
}
return (rm_ifinfo(ifi));
}
int
rm_ifinfo(struct ifinfo *ifi)
{
int error;
syslog(LOG_DEBUG, "<%s> enter (%s).", __func__, ifi->ifi_ifname);
switch (ifi->ifi_state) {
case IFI_STATE_UNCONFIGURED:
return (0);
break;
default:
ifi->ifi_state = IFI_STATE_UNCONFIGURED;
syslog(LOG_DEBUG,
"<%s> ifname=%s marked as UNCONFIGURED.",
__func__, ifi->ifi_ifname);
/* XXX: No MC leaving here because index is disappeared */
/* Inactivate timer */
rtadvd_remove_timer(ifi->ifi_ra_timer);
ifi->ifi_ra_timer = NULL;
break;
}
/* clean up ifi */
if (!ifi->ifi_persist) {
TAILQ_REMOVE(&ifilist, ifi, ifi_next);
syslog(LOG_DEBUG, "<%s>: ifinfo (idx=%d) removed.",
__func__, ifi->ifi_ifindex);
} else {
/* recreate an empty entry */
update_persist_ifinfo(&ifilist, ifi->ifi_ifname);
syslog(LOG_DEBUG, "<%s>: ifname=%s is persistent.",
__func__, ifi->ifi_ifname);
}
/* clean up rai if any */
switch (ifi->ifi_state) {
case IFI_STATE_CONFIGURED:
if (ifi->ifi_rainfo != NULL) {
error = rm_rainfo(ifi->ifi_rainfo);
if (error)
return (error);
ifi->ifi_rainfo = NULL;
}
break;
case IFI_STATE_TRANSITIVE:
if (ifi->ifi_rainfo == ifi->ifi_rainfo_trans) {
if (ifi->ifi_rainfo != NULL) {
error = rm_rainfo(ifi->ifi_rainfo);
if (error)
return (error);
ifi->ifi_rainfo = NULL;
ifi->ifi_rainfo_trans = NULL;
}
} else {
if (ifi->ifi_rainfo != NULL) {
error = rm_rainfo(ifi->ifi_rainfo);
if (error)
return (error);
ifi->ifi_rainfo = NULL;
}
if (ifi->ifi_rainfo_trans != NULL) {
error = rm_rainfo(ifi->ifi_rainfo_trans);
if (error)
return (error);
ifi->ifi_rainfo_trans = NULL;
}
}
}
syslog(LOG_DEBUG, "<%s> leave (%s).", __func__, ifi->ifi_ifname);
if (!ifi->ifi_persist)
free(ifi);
return (0);
}
int
rm_rainfo(struct rainfo *rai)
{
struct prefix *pfx;
struct soliciter *sol;
struct rdnss *rdn;
struct rdnss_addr *rdna;
struct dnssl *dns;
struct rtinfo *rti;
syslog(LOG_DEBUG, "<%s>: enter", __func__);
TAILQ_REMOVE(&railist, rai, rai_next);
if (rai->rai_ifinfo != NULL)
syslog(LOG_DEBUG, "<%s>: rainfo (idx=%d) removed.",
__func__, rai->rai_ifinfo->ifi_ifindex);
if (rai->rai_ra_data != NULL)
free(rai->rai_ra_data);
while ((pfx = TAILQ_FIRST(&rai->rai_prefix)) != NULL)
delete_prefix(pfx);
while ((sol = TAILQ_FIRST(&rai->rai_soliciter)) != NULL) {
TAILQ_REMOVE(&rai->rai_soliciter, sol, sol_next);
free(sol);
}
while ((rdn = TAILQ_FIRST(&rai->rai_rdnss)) != NULL) {
TAILQ_REMOVE(&rai->rai_rdnss, rdn, rd_next);
while ((rdna = TAILQ_FIRST(&rdn->rd_list)) != NULL) {
TAILQ_REMOVE(&rdn->rd_list, rdna, ra_next);
free(rdna);
}
free(rdn);
}
while ((dns = TAILQ_FIRST(&rai->rai_dnssl)) != NULL) {
TAILQ_REMOVE(&rai->rai_dnssl, dns, dn_next);
free(dns);
}
while ((rti = TAILQ_FIRST(&rai->rai_route)) != NULL) {
TAILQ_REMOVE(&rai->rai_route, rti, rti_next);
free(rti);
}
free(rai);
syslog(LOG_DEBUG, "<%s>: leave", __func__);
return (0);
}
struct ifinfo *
getconfig(struct ifinfo *ifi)
{
int stat, i;
int error;
char tbuf[BUFSIZ];
struct rainfo *rai;
struct rainfo *rai_old;
int32_t val;
int64_t val64;
char buf[BUFSIZ];
char *bp = buf;
char *addr, *flagstr;
if (ifi == NULL) /* if does not exist */
return (NULL);
if (ifi->ifi_state == IFI_STATE_TRANSITIVE &&
ifi->ifi_rainfo == NULL) {
syslog(LOG_INFO, "<%s> %s is shutting down. Skipped.",
__func__, ifi->ifi_ifname);
return (NULL);
}
if ((stat = agetent(tbuf, ifi->ifi_ifname)) <= 0) {
memset(tbuf, 0, sizeof(tbuf));
syslog(LOG_INFO,
"<%s> %s isn't defined in the configuration file"
" or the configuration file doesn't exist."
" Treat it as default",
__func__, ifi->ifi_ifname);
}
ELM_MALLOC(rai, exit(1));
TAILQ_INIT(&rai->rai_prefix);
TAILQ_INIT(&rai->rai_route);
TAILQ_INIT(&rai->rai_rdnss);
TAILQ_INIT(&rai->rai_dnssl);
TAILQ_INIT(&rai->rai_soliciter);
rai->rai_ifinfo = ifi;
/* gather on-link prefixes from the network interfaces. */
if (agetflag("noifprefix"))
rai->rai_advifprefix = 0;
else
rai->rai_advifprefix = 1;
/* get interface information */
if (agetflag("nolladdr"))
rai->rai_advlinkopt = 0;
else
rai->rai_advlinkopt = 1;
if (rai->rai_advlinkopt) {
if (ifi->ifi_sdl.sdl_type == 0) {
syslog(LOG_ERR,
"<%s> can't get information of %s",
__func__, ifi->ifi_ifname);
goto getconfig_free_rai;
}
}
/*
* set router configuration variables.
*/
MAYHAVE(val, "maxinterval", DEF_MAXRTRADVINTERVAL);
if (val < MIN_MAXINTERVAL || val > MAX_MAXINTERVAL) {
syslog(LOG_ERR,
"<%s> maxinterval (%" PRIu32 ") on %s is invalid "
"(must be between %u and %u)", __func__, val,
ifi->ifi_ifname, MIN_MAXINTERVAL, MAX_MAXINTERVAL);
goto getconfig_free_rai;
}
rai->rai_maxinterval = (uint16_t)val;
MAYHAVE(val, "mininterval", rai->rai_maxinterval/3);
if ((uint16_t)val < MIN_MININTERVAL ||
(uint16_t)val > (rai->rai_maxinterval * 3) / 4) {
syslog(LOG_ERR,
"<%s> mininterval (%" PRIu32 ") on %s is invalid "
"(must be between %d and %d)",
__func__, val, ifi->ifi_ifname, MIN_MININTERVAL,
(rai->rai_maxinterval * 3) / 4);
goto getconfig_free_rai;
}
rai->rai_mininterval = (uint16_t)val;
MAYHAVE(val, "chlim", DEF_ADVCURHOPLIMIT);
rai->rai_hoplimit = val & 0xff;
if ((flagstr = (char *)agetstr("raflags", &bp))) {
val = 0;
if (strchr(flagstr, 'm'))
val |= ND_RA_FLAG_MANAGED;
if (strchr(flagstr, 'o'))
val |= ND_RA_FLAG_OTHER;
if (strchr(flagstr, 'h'))
val |= ND_RA_FLAG_RTPREF_HIGH;
if (strchr(flagstr, 'l')) {
if ((val & ND_RA_FLAG_RTPREF_HIGH)) {
syslog(LOG_ERR, "<%s> the \'h\' and \'l\'"
" router flags are exclusive", __func__);
goto getconfig_free_rai;
}
val |= ND_RA_FLAG_RTPREF_LOW;
}
#ifdef DRAFT_IETF_6MAN_IPV6ONLY_FLAG
if (strchr(flagstr, 'S'))
val |= ND_RA_FLAG_IPV6_ONLY;
#endif
} else
MAYHAVE(val, "raflags", 0);
rai->rai_managedflg = val & ND_RA_FLAG_MANAGED;
rai->rai_otherflg = val & ND_RA_FLAG_OTHER;
#ifndef ND_RA_FLAG_RTPREF_MASK
#define ND_RA_FLAG_RTPREF_MASK 0x18 /* 00011000 */
#define ND_RA_FLAG_RTPREF_RSV 0x10 /* 00010000 */
#endif
rai->rai_rtpref = val & ND_RA_FLAG_RTPREF_MASK;
if (rai->rai_rtpref == ND_RA_FLAG_RTPREF_RSV) {
syslog(LOG_ERR, "<%s> invalid router preference (%02x) on %s",
__func__, rai->rai_rtpref, ifi->ifi_ifname);
goto getconfig_free_rai;
}
#ifdef DRAFT_IETF_6MAN_IPV6ONLY_FLAG
rai->rai_ipv6onlyflg = val & ND_RA_FLAG_IPV6_ONLY;
#endif
MAYHAVE(val, "rltime", rai->rai_maxinterval * 3);
if ((uint16_t)val && ((uint16_t)val < rai->rai_maxinterval ||
(uint16_t)val > MAXROUTERLIFETIME)) {
syslog(LOG_ERR,
"<%s> router lifetime (%" PRIu32 ") on %s is invalid "
"(must be 0 or between %d and %d)",
__func__, val, ifi->ifi_ifname, rai->rai_maxinterval,
MAXROUTERLIFETIME);
goto getconfig_free_rai;
}
rai->rai_lifetime = val & 0xffff;
MAYHAVE(val, "rtime", DEF_ADVREACHABLETIME);
if (val < 0 || val > MAXREACHABLETIME) {
syslog(LOG_ERR,
"<%s> reachable time (%" PRIu32 ") on %s is invalid "
"(must be no greater than %d)",
__func__, val, ifi->ifi_ifname, MAXREACHABLETIME);
goto getconfig_free_rai;
}
rai->rai_reachabletime = (uint32_t)val;
MAYHAVE(val64, "retrans", DEF_ADVRETRANSTIMER);
if (val64 < 0 || val64 > 0xffffffff) {
syslog(LOG_ERR, "<%s> retrans time (%" PRIu64 ") on %s out of range",
__func__, val64, ifi->ifi_ifname);
goto getconfig_free_rai;
}
rai->rai_retranstimer = (uint32_t)val64;
if (agetnum("hapref") != -1 || agetnum("hatime") != -1) {
syslog(LOG_ERR,
"<%s> mobile-ip6 configuration not supported",
__func__);
goto getconfig_free_rai;
}
/* prefix information */
/*
* This is an implementation specific parameter to consider
* link propagation delays and poorly synchronized clocks when
* checking consistency of advertised lifetimes.
*/
MAYHAVE(val, "clockskew", 0);
rai->rai_clockskew = val;
rai->rai_pfxs = 0;
for (i = -1; i < MAXPREFIX; i++) {
struct prefix *pfx;
makeentry(entbuf, sizeof(entbuf), i, "addr");
addr = (char *)agetstr(entbuf, &bp);
if (addr == NULL)
continue;
/* allocate memory to store prefix information */
ELM_MALLOC(pfx, exit(1));
pfx->pfx_rainfo = rai;
pfx->pfx_origin = PREFIX_FROM_CONFIG;
if (inet_pton(AF_INET6, addr, &pfx->pfx_prefix) != 1) {
syslog(LOG_ERR,
"<%s> inet_pton failed for %s",
__func__, addr);
goto getconfig_free_pfx;
}
if (IN6_IS_ADDR_MULTICAST(&pfx->pfx_prefix)) {
syslog(LOG_ERR,
"<%s> multicast prefix (%s) must "
"not be advertised on %s",
__func__, addr, ifi->ifi_ifname);
goto getconfig_free_pfx;
}
if (IN6_IS_ADDR_LINKLOCAL(&pfx->pfx_prefix))
syslog(LOG_NOTICE,
"<%s> link-local prefix (%s) will be"
" advertised on %s",
__func__, addr, ifi->ifi_ifname);
makeentry(entbuf, sizeof(entbuf), i, "prefixlen");
MAYHAVE(val, entbuf, 64);
if (val < 0 || val > 128) {
syslog(LOG_ERR, "<%s> prefixlen (%" PRIu32 ") for %s "
"on %s out of range",
__func__, val, addr, ifi->ifi_ifname);
goto getconfig_free_pfx;
}
pfx->pfx_prefixlen = (int)val;
makeentry(entbuf, sizeof(entbuf), i, "pinfoflags");
if ((flagstr = (char *)agetstr(entbuf, &bp))) {
val = 0;
if (strchr(flagstr, 'l'))
val |= ND_OPT_PI_FLAG_ONLINK;
if (strchr(flagstr, 'a'))
val |= ND_OPT_PI_FLAG_AUTO;
} else {
MAYHAVE(val, entbuf,
(ND_OPT_PI_FLAG_ONLINK|ND_OPT_PI_FLAG_AUTO));
}
pfx->pfx_onlinkflg = val & ND_OPT_PI_FLAG_ONLINK;
pfx->pfx_autoconfflg = val & ND_OPT_PI_FLAG_AUTO;
makeentry(entbuf, sizeof(entbuf), i, "vltime");
MAYHAVE(val64, entbuf, DEF_ADVVALIDLIFETIME);
if (val64 < 0 || val64 > 0xffffffff) {
syslog(LOG_ERR, "<%s> vltime (%" PRIu64 ") for "
"%s/%d on %s is out of range",
__func__, val64,
addr, pfx->pfx_prefixlen, ifi->ifi_ifname);
goto getconfig_free_pfx;
}
pfx->pfx_validlifetime = (uint32_t)val64;
makeentry(entbuf, sizeof(entbuf), i, "vltimedecr");
if (agetflag(entbuf)) {
struct timespec now;
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
pfx->pfx_vltimeexpire =
now.tv_sec + pfx->pfx_validlifetime;
}
makeentry(entbuf, sizeof(entbuf), i, "pltime");
MAYHAVE(val64, entbuf, DEF_ADVPREFERREDLIFETIME);
if (val64 < 0 || val64 > 0xffffffff) {
syslog(LOG_ERR,
"<%s> pltime (%" PRIu64 ") for %s/%d on %s "
"is out of range",
__func__, val64,
addr, pfx->pfx_prefixlen, ifi->ifi_ifname);
goto getconfig_free_pfx;
}
pfx->pfx_preflifetime = (uint32_t)val64;
makeentry(entbuf, sizeof(entbuf), i, "pltimedecr");
if (agetflag(entbuf)) {
struct timespec now;
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
pfx->pfx_pltimeexpire =
now.tv_sec + pfx->pfx_preflifetime;
}
/* link into chain */
TAILQ_INSERT_TAIL(&rai->rai_prefix, pfx, pfx_next);
rai->rai_pfxs++;
continue;
getconfig_free_pfx:
free(pfx);
}
if (rai->rai_advifprefix && rai->rai_pfxs == 0)
get_prefix(rai);
MAYHAVE(val64, "mtu", 0);
if (val < 0 || val64 > 0xffffffff) {
syslog(LOG_ERR,
"<%s> mtu (%" PRIu64 ") on %s out of range",
__func__, val64, ifi->ifi_ifname);
goto getconfig_free_rai;
}
rai->rai_linkmtu = (uint32_t)val64;
if (rai->rai_linkmtu == 0) {
char *mtustr;
if ((mtustr = (char *)agetstr("mtu", &bp)) &&
strcmp(mtustr, "auto") == 0)
rai->rai_linkmtu = ifi->ifi_phymtu;
}
else if (rai->rai_linkmtu < IPV6_MMTU ||
rai->rai_linkmtu > ifi->ifi_phymtu) {
syslog(LOG_ERR,
"<%s> advertised link mtu (%" PRIu32 ") on %s is invalid (must "
"be between least MTU (%d) and physical link MTU (%d)",
__func__, rai->rai_linkmtu, ifi->ifi_ifname,
IPV6_MMTU, ifi->ifi_phymtu);
goto getconfig_free_rai;
}
#ifdef SIOCSIFINFO_IN6
{
struct in6_ndireq ndi;
int s;
if ((s = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
syslog(LOG_ERR, "<%s> socket: %s", __func__,
strerror(errno));
exit(1);
}
memset(&ndi, 0, sizeof(ndi));
strlcpy(ndi.ifname, ifi->ifi_ifname, sizeof(ndi.ifname));
if (ioctl(s, SIOCGIFINFO_IN6, (caddr_t)&ndi) < 0)
syslog(LOG_INFO, "<%s> ioctl:SIOCGIFINFO_IN6 at %s: %s",
__func__, ifi->ifi_ifname, strerror(errno));
/* reflect the RA info to the host variables in kernel */
ndi.ndi.chlim = rai->rai_hoplimit;
ndi.ndi.retrans = rai->rai_retranstimer;
ndi.ndi.basereachable = rai->rai_reachabletime;
if (ioctl(s, SIOCSIFINFO_IN6, (caddr_t)&ndi) < 0)
syslog(LOG_INFO, "<%s> ioctl:SIOCSIFINFO_IN6 at %s: %s",
__func__, ifi->ifi_ifname, strerror(errno));
close(s);
}
#endif
/* route information */
rai->rai_routes = 0;
for (i = -1; i < MAXROUTE; i++) {
struct rtinfo *rti;
makeentry(entbuf, sizeof(entbuf), i, "rtprefix");
addr = (char *)agetstr(entbuf, &bp);
if (addr == NULL) {
makeentry(oentbuf, sizeof(oentbuf), i, "rtrprefix");
addr = (char *)agetstr(oentbuf, &bp);
if (addr)
fprintf(stderr, "%s was obsoleted. Use %s.\n",
oentbuf, entbuf);
}
if (addr == NULL)
continue;
/* allocate memory to store prefix information */
ELM_MALLOC(rti, exit(1));
if (inet_pton(AF_INET6, addr, &rti->rti_prefix) != 1) {
syslog(LOG_ERR, "<%s> inet_pton failed for %s",
__func__, addr);
goto getconfig_free_rti;
}
#if 0
/*
* XXX: currently there's no restriction in route information
* prefix according to
* draft-ietf-ipngwg-router-selection-00.txt.
* However, I think the similar restriction be necessary.
*/
MAYHAVE(val64, entbuf, DEF_ADVVALIDLIFETIME);
if (IN6_IS_ADDR_MULTICAST(&rti->prefix)) {
syslog(LOG_ERR,
"<%s> multicast route (%s) must "
"not be advertised on %s",
__func__, addr, ifi->ifi_ifname);
goto getconfig_free_rti;
}
if (IN6_IS_ADDR_LINKLOCAL(&rti->prefix)) {
syslog(LOG_NOTICE,
"<%s> link-local route (%s) will "
"be advertised on %s",
__func__, addr, ifi->ifi_ifname);
goto getconfig_free_rti;
}
#endif
makeentry(entbuf, sizeof(entbuf), i, "rtplen");
/* XXX: 256 is a magic number for compatibility check. */
MAYHAVE(val, entbuf, 256);
if (val == 256) {
makeentry(oentbuf, sizeof(oentbuf), i, "rtrplen");
MAYHAVE(val, oentbuf, 256);
if (val != 256)
fprintf(stderr, "%s was obsoleted. Use %s.\n",
oentbuf, entbuf);
else
val = 64;
}
if (val < 0 || val > 128) {
syslog(LOG_ERR, "<%s> prefixlen (%" PRIu32 ") for %s on %s "
"out of range",
__func__, val, addr, ifi->ifi_ifname);
goto getconfig_free_rti;
}
rti->rti_prefixlen = (int)val;
makeentry(entbuf, sizeof(entbuf), i, "rtflags");
if ((flagstr = (char *)agetstr(entbuf, &bp))) {
val = 0;
if (strchr(flagstr, 'h'))
val |= ND_RA_FLAG_RTPREF_HIGH;
if (strchr(flagstr, 'l')) {
if ((val & ND_RA_FLAG_RTPREF_HIGH)) {
syslog(LOG_ERR,
"<%s> the \'h\' and \'l\' route"
" preferences are exclusive",
__func__);
goto getconfig_free_rti;
}
val |= ND_RA_FLAG_RTPREF_LOW;
}
} else
MAYHAVE(val, entbuf, 256); /* XXX */
if (val == 256) {
makeentry(oentbuf, sizeof(oentbuf), i, "rtrflags");
MAYHAVE(val, oentbuf, 256);
if (val != 256) {
fprintf(stderr, "%s was obsoleted. Use %s.\n",
oentbuf, entbuf);
} else
val = 0;
}
rti->rti_rtpref = val & ND_RA_FLAG_RTPREF_MASK;
if (rti->rti_rtpref == ND_RA_FLAG_RTPREF_RSV) {
syslog(LOG_ERR, "<%s> invalid route preference (%02x) "
"for %s/%d on %s",
__func__, rti->rti_rtpref, addr,
rti->rti_prefixlen, ifi->ifi_ifname);
goto getconfig_free_rti;
}
/*
* Since the spec does not a default value, we should make
* this entry mandatory. However, FreeBSD 4.4 has shipped
* with this field being optional, we use the router lifetime
* as an ad-hoc default value with a warning message.
*/
makeentry(entbuf, sizeof(entbuf), i, "rtltime");
MAYHAVE(val64, entbuf, -1);
if (val64 == -1) {
makeentry(oentbuf, sizeof(oentbuf), i, "rtrltime");
MAYHAVE(val64, oentbuf, -1);
if (val64 != -1)
fprintf(stderr, "%s was obsoleted. Use %s.\n",
oentbuf, entbuf);
else {
fprintf(stderr, "%s should be specified "
"for interface %s.\n", entbuf,
ifi->ifi_ifname);
val64 = rai->rai_lifetime;
}
}
if (val64 < 0 || val64 > 0xffffffff) {
syslog(LOG_ERR, "<%s> route lifetime (%" PRIu64 ") for "
"%s/%d on %s out of range", __func__,
val64, addr, rti->rti_prefixlen,
ifi->ifi_ifname);
goto getconfig_free_rti;
}
rti->rti_ltime = (uint32_t)val64;
/* link into chain */
TAILQ_INSERT_TAIL(&rai->rai_route, rti, rti_next);
rai->rai_routes++;
continue;
getconfig_free_rti:
free(rti);
}
/* DNS server and DNS search list information */
for (i = -1; i < MAXRDNSSENT ; i++) {
struct rdnss *rdn;
struct rdnss_addr *rdna;
char *ap;
int c;
makeentry(entbuf, sizeof(entbuf), i, "rdnss");
addr = (char *)agetstr(entbuf, &bp);
if (addr == NULL)
continue;
ELM_MALLOC(rdn, exit(1));
TAILQ_INIT(&rdn->rd_list);
for (ap = addr; ap - addr < (ssize_t)strlen(addr); ap += c+1) {
c = strcspn(ap, ",");
strncpy(abuf, ap, c);
abuf[c] = '\0';
ELM_MALLOC(rdna, goto getconfig_free_rdn);
if (inet_pton(AF_INET6, abuf, &rdna->ra_dns) != 1) {
syslog(LOG_ERR, "<%s> inet_pton failed for %s",
__func__, abuf);
free(rdna);
goto getconfig_free_rdn;
}
TAILQ_INSERT_TAIL(&rdn->rd_list, rdna, ra_next);
}
makeentry(entbuf, sizeof(entbuf), i, "rdnssltime");
MAYHAVE(val, entbuf, (rai->rai_maxinterval * 3 / 2));
if ((uint16_t)val < rai->rai_maxinterval ||
(uint16_t)val > rai->rai_maxinterval * 2) {
syslog(LOG_ERR, "%s (%" PRIu16 ") on %s is invalid "
"(must be between %d and %d)",
entbuf, val, ifi->ifi_ifname, rai->rai_maxinterval,
rai->rai_maxinterval * 2);
goto getconfig_free_rdn;
}
rdn->rd_ltime = val;
/* link into chain */
TAILQ_INSERT_TAIL(&rai->rai_rdnss, rdn, rd_next);
continue;
getconfig_free_rdn:
while ((rdna = TAILQ_FIRST(&rdn->rd_list)) != NULL) {
TAILQ_REMOVE(&rdn->rd_list, rdna, ra_next);
free(rdna);
}
free(rdn);
}
for (i = -1; i < MAXDNSSLENT ; i++) {
struct dnssl *dns;
struct dnssl_addr *dnsa;
char *ap;
int c;
makeentry(entbuf, sizeof(entbuf), i, "dnssl");
addr = (char *)agetstr(entbuf, &bp);
if (addr == NULL)
continue;
ELM_MALLOC(dns, exit(1));
TAILQ_INIT(&dns->dn_list);
for (ap = addr; ap - addr < (ssize_t)strlen(addr); ap += c+1) {
c = strcspn(ap, ",");
strncpy(abuf, ap, c);
abuf[c] = '\0';
ELM_MALLOC(dnsa, goto getconfig_free_dns);
dnsa->da_len = dname_labelenc(dnsa->da_dom, abuf);
if (dnsa->da_len < 0) {
syslog(LOG_ERR, "Invalid dnssl entry: %s",
abuf);
goto getconfig_free_dns;
}
syslog(LOG_DEBUG, "<%s>: dnsa->da_len = %d", __func__,
dnsa->da_len);
TAILQ_INSERT_TAIL(&dns->dn_list, dnsa, da_next);
}
makeentry(entbuf, sizeof(entbuf), i, "dnsslltime");
MAYHAVE(val, entbuf, (rai->rai_maxinterval * 3 / 2));
if ((uint16_t)val < rai->rai_maxinterval ||
(uint16_t)val > rai->rai_maxinterval * 2) {
syslog(LOG_ERR, "%s (%" PRIu16 ") on %s is invalid "
"(must be between %d and %d)",
entbuf, val, ifi->ifi_ifname, rai->rai_maxinterval,
rai->rai_maxinterval * 2);
goto getconfig_free_dns;
}
dns->dn_ltime = val;
/* link into chain */
TAILQ_INSERT_TAIL(&rai->rai_dnssl, dns, dn_next);
continue;
getconfig_free_dns:
while ((dnsa = TAILQ_FIRST(&dns->dn_list)) != NULL) {
TAILQ_REMOVE(&dns->dn_list, dnsa, da_next);
free(dnsa);
}
free(dns);
}
/* construct the sending packet */
make_packet(rai);
/*
* If an entry with the same ifindex exists, remove it first.
* Before the removal, RDNSS and DNSSL options with
* zero-lifetime will be sent.
*/
switch (ifi->ifi_state) {
case IFI_STATE_UNCONFIGURED:
/* UNCONFIGURED -> TRANSITIVE */
error = sock_mc_join(&sock, ifi->ifi_ifindex);
if (error)
exit(1);
ifi->ifi_state = IFI_STATE_TRANSITIVE;
ifi->ifi_burstcount = MAX_INITIAL_RTR_ADVERTISEMENTS;
ifi->ifi_burstinterval = MAX_INITIAL_RTR_ADVERT_INTERVAL;
/* The same two rai mean initial burst */
ifi->ifi_rainfo = rai;
ifi->ifi_rainfo_trans = rai;
TAILQ_INSERT_TAIL(&railist, rai, rai_next);
if (ifi->ifi_ra_timer == NULL)
ifi->ifi_ra_timer = rtadvd_add_timer(ra_timeout,
ra_timer_update, ifi, ifi);
ra_timer_update(ifi, &ifi->ifi_ra_timer->rat_tm);
rtadvd_set_timer(&ifi->ifi_ra_timer->rat_tm,
ifi->ifi_ra_timer);
syslog(LOG_DEBUG,
"<%s> ifname=%s marked as TRANSITIVE (initial burst).",
__func__, ifi->ifi_ifname);
break;
case IFI_STATE_CONFIGURED:
/* CONFIGURED -> TRANSITIVE */
rai_old = ifi->ifi_rainfo;
if (rai_old == NULL) {
syslog(LOG_ERR,
"<%s> ifi_rainfo is NULL"
" in IFI_STATE_CONFIGURED.", __func__);
ifi = NULL;
break;
} else {
struct rdnss *rdn;
struct dnssl *dns;
rai_old->rai_lifetime = 0;
TAILQ_FOREACH(rdn, &rai_old->rai_rdnss, rd_next)
rdn->rd_ltime = 0;
TAILQ_FOREACH(dns, &rai_old->rai_dnssl, dn_next)
dns->dn_ltime = 0;
ifi->ifi_rainfo_trans = rai_old;
ifi->ifi_state = IFI_STATE_TRANSITIVE;
ifi->ifi_burstcount = MAX_FINAL_RTR_ADVERTISEMENTS;
ifi->ifi_burstinterval = MIN_DELAY_BETWEEN_RAS;
ra_timer_update(ifi, &ifi->ifi_ra_timer->rat_tm);
rtadvd_set_timer(&ifi->ifi_ra_timer->rat_tm,
ifi->ifi_ra_timer);
syslog(LOG_DEBUG,
"<%s> ifname=%s marked as TRANSITIVE"
" (transitional burst)",
__func__, ifi->ifi_ifname);
}
ifi->ifi_rainfo = rai;
TAILQ_INSERT_TAIL(&railist, rai, rai_next);
break;
case IFI_STATE_TRANSITIVE:
if (ifi->ifi_rainfo != NULL) {
if (ifi->ifi_rainfo == ifi->ifi_rainfo_trans) {
/* Reinitialize initial burst */
rm_rainfo(ifi->ifi_rainfo);
ifi->ifi_rainfo = rai;
ifi->ifi_rainfo_trans = rai;
ifi->ifi_burstcount =
MAX_INITIAL_RTR_ADVERTISEMENTS;
ifi->ifi_burstinterval =
MAX_INITIAL_RTR_ADVERT_INTERVAL;
} else {
/* Replace ifi_rainfo with the new one */
rm_rainfo(ifi->ifi_rainfo);
ifi->ifi_rainfo = rai;
}
TAILQ_INSERT_TAIL(&railist, rai, rai_next);
ra_timer_update(ifi, &ifi->ifi_ra_timer->rat_tm);
rtadvd_set_timer(&ifi->ifi_ra_timer->rat_tm,
ifi->ifi_ra_timer);
} else {
/* XXX: NOTREACHED. Being shut down. */
syslog(LOG_ERR,
"<%s> %s is shutting down. Skipped.",
__func__, ifi->ifi_ifname);
rm_rainfo(rai);
return (NULL);
}
break;
}
return (ifi);
getconfig_free_rai:
free(rai);
return (NULL);
}
void
get_prefix(struct rainfo *rai)
{
struct ifaddrs *ifap, *ifa;
struct prefix *pfx;
struct in6_addr *a;
struct ifinfo *ifi;
char *p, *ep, *m, *lim;
char ntopbuf[INET6_ADDRSTRLEN];
if (getifaddrs(&ifap) < 0) {
syslog(LOG_ERR,
"<%s> can't get interface addresses",
__func__);
exit(1);
}
ifi = rai->rai_ifinfo;
for (ifa = ifap; ifa; ifa = ifa->ifa_next) {
int plen;
if (strcmp(ifa->ifa_name, ifi->ifi_ifname) != 0)
continue;
if (ifa->ifa_addr->sa_family != AF_INET6)
continue;
a = &((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr;
if (IN6_IS_ADDR_LINKLOCAL(a))
continue;
/* get prefix length */
m = (char *)&((struct sockaddr_in6 *)ifa->ifa_netmask)->sin6_addr;
lim = (char *)(ifa->ifa_netmask) + ifa->ifa_netmask->sa_len;
plen = prefixlen(m, lim);
if (plen <= 0 || plen > 128) {
syslog(LOG_ERR, "<%s> failed to get prefixlen "
"or prefix is invalid",
__func__);
exit(1);
}
if (plen == 128) /* XXX */
continue;
if (find_prefix(rai, a, plen)) {
/* ignore a duplicated prefix. */
continue;
}
/* allocate memory to store prefix info. */
ELM_MALLOC(pfx, exit(1));
/* set prefix, sweep bits outside of prefixlen */
pfx->pfx_prefixlen = plen;
memcpy(&pfx->pfx_prefix, a, sizeof(*a));
p = (char *)&pfx->pfx_prefix;
ep = (char *)(&pfx->pfx_prefix + 1);
while (m < lim && p < ep)
*p++ &= *m++;
while (p < ep)
*p++ = 0x00;
if (!inet_ntop(AF_INET6, &pfx->pfx_prefix, ntopbuf,
sizeof(ntopbuf))) {
syslog(LOG_ERR, "<%s> inet_ntop failed", __func__);
exit(1);
}
syslog(LOG_DEBUG,
"<%s> add %s/%d to prefix list on %s",
__func__, ntopbuf, pfx->pfx_prefixlen, ifi->ifi_ifname);
/* set other fields with protocol defaults */
pfx->pfx_validlifetime = DEF_ADVVALIDLIFETIME;
pfx->pfx_preflifetime = DEF_ADVPREFERREDLIFETIME;
pfx->pfx_onlinkflg = 1;
pfx->pfx_autoconfflg = 1;
pfx->pfx_origin = PREFIX_FROM_KERNEL;
pfx->pfx_rainfo = rai;
/* link into chain */
TAILQ_INSERT_TAIL(&rai->rai_prefix, pfx, pfx_next);
/* counter increment */
rai->rai_pfxs++;
}
freeifaddrs(ifap);
}
static void
makeentry(char *buf, size_t len, int id, const char *string)
{
if (id < 0)
strlcpy(buf, string, len);
else
snprintf(buf, len, "%s%d", string, id);
}
/*
* Add a prefix to the list of specified interface and reconstruct
* the outgoing packet.
* The prefix must not be in the list.
* XXX: other parameters of the prefix (e.g. lifetime) should be
* able to be specified.
*/
static void
add_prefix(struct rainfo *rai, struct in6_prefixreq *ipr)
{
struct prefix *pfx;
struct ifinfo *ifi;
char ntopbuf[INET6_ADDRSTRLEN];
ifi = rai->rai_ifinfo;
ELM_MALLOC(pfx, return);
pfx->pfx_prefix = ipr->ipr_prefix.sin6_addr;
pfx->pfx_prefixlen = ipr->ipr_plen;
pfx->pfx_validlifetime = ipr->ipr_vltime;
pfx->pfx_preflifetime = ipr->ipr_pltime;
pfx->pfx_onlinkflg = ipr->ipr_raf_onlink;
pfx->pfx_autoconfflg = ipr->ipr_raf_auto;
pfx->pfx_origin = PREFIX_FROM_DYNAMIC;
pfx->pfx_rainfo = rai;
TAILQ_INSERT_TAIL(&rai->rai_prefix, pfx, pfx_next);
syslog(LOG_DEBUG, "<%s> new prefix %s/%d was added on %s",
__func__,
inet_ntop(AF_INET6, &ipr->ipr_prefix.sin6_addr, ntopbuf,
sizeof(ntopbuf)), ipr->ipr_plen, ifi->ifi_ifname);
rai->rai_pfxs++;
}
/*
* Delete a prefix to the list of specified interface and reconstruct
* the outgoing packet.
* The prefix must be in the list.
*/
void
delete_prefix(struct prefix *pfx)
{
struct rainfo *rai;
struct ifinfo *ifi;
char ntopbuf[INET6_ADDRSTRLEN];
rai = pfx->pfx_rainfo;
ifi = rai->rai_ifinfo;
TAILQ_REMOVE(&rai->rai_prefix, pfx, pfx_next);
syslog(LOG_DEBUG, "<%s> prefix %s/%d was deleted on %s",
__func__,
inet_ntop(AF_INET6, &pfx->pfx_prefix, ntopbuf,
sizeof(ntopbuf)), pfx->pfx_prefixlen, ifi->ifi_ifname);
if (pfx->pfx_timer)
rtadvd_remove_timer(pfx->pfx_timer);
free(pfx);
rai->rai_pfxs--;
}
void
invalidate_prefix(struct prefix *pfx)
{
struct timespec timo;
struct rainfo *rai;
struct ifinfo *ifi;
char ntopbuf[INET6_ADDRSTRLEN];
rai = pfx->pfx_rainfo;
ifi = rai->rai_ifinfo;
if (pfx->pfx_timer) { /* sanity check */
syslog(LOG_ERR,
"<%s> assumption failure: timer already exists",
__func__);
exit(1);
}
syslog(LOG_DEBUG, "<%s> prefix %s/%d was invalidated on %s, "
"will expire in %ld seconds", __func__,
inet_ntop(AF_INET6, &pfx->pfx_prefix, ntopbuf, sizeof(ntopbuf)),
pfx->pfx_prefixlen, ifi->ifi_ifname, (long)prefix_timo);
/* set the expiration timer */
pfx->pfx_timer = rtadvd_add_timer(prefix_timeout, NULL, pfx, NULL);
if (pfx->pfx_timer == NULL) {
syslog(LOG_ERR, "<%s> failed to add a timer for a prefix. "
"remove the prefix", __func__);
delete_prefix(pfx);
}
timo.tv_sec = prefix_timo;
timo.tv_nsec = 0;
rtadvd_set_timer(&timo, pfx->pfx_timer);
}
static struct rtadvd_timer *
prefix_timeout(void *arg)
{
delete_prefix((struct prefix *)arg);
return (NULL);
}
void
update_prefix(struct prefix *pfx)
{
struct rainfo *rai;
struct ifinfo *ifi;
char ntopbuf[INET6_ADDRSTRLEN];
rai = pfx->pfx_rainfo;
ifi = rai->rai_ifinfo;
if (pfx->pfx_timer == NULL) { /* sanity check */
syslog(LOG_ERR,
"<%s> assumption failure: timer does not exist",
__func__);
exit(1);
}
syslog(LOG_DEBUG, "<%s> prefix %s/%d was re-enabled on %s",
__func__, inet_ntop(AF_INET6, &pfx->pfx_prefix, ntopbuf,
sizeof(ntopbuf)), pfx->pfx_prefixlen, ifi->ifi_ifname);
/* stop the expiration timer */
rtadvd_remove_timer(pfx->pfx_timer);
pfx->pfx_timer = NULL;
}
/*
* Try to get an in6_prefixreq contents for a prefix which matches
* ipr->ipr_prefix and ipr->ipr_plen and belongs to
* the interface whose name is ipr->ipr_name[].
*/
static int
init_prefix(struct in6_prefixreq *ipr)
{
#if 0
int s;
if ((s = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
syslog(LOG_ERR, "<%s> socket: %s", __func__,
strerror(errno));
exit(1);
}
if (ioctl(s, SIOCGIFPREFIX_IN6, (caddr_t)ipr) < 0) {
syslog(LOG_INFO, "<%s> ioctl:SIOCGIFPREFIX %s", __func__,
strerror(errno));
ipr->ipr_vltime = DEF_ADVVALIDLIFETIME;
ipr->ipr_pltime = DEF_ADVPREFERREDLIFETIME;
ipr->ipr_raf_onlink = 1;
ipr->ipr_raf_auto = 1;
/* omit other field initialization */
}
else if (ipr->ipr_origin < PR_ORIG_RR) {
char ntopbuf[INET6_ADDRSTRLEN];
syslog(LOG_WARNING, "<%s> Added prefix(%s)'s origin %d is"
"lower than PR_ORIG_RR(router renumbering)."
"This should not happen if I am router", __func__,
inet_ntop(AF_INET6, &ipr->ipr_prefix.sin6_addr, ntopbuf,
sizeof(ntopbuf)), ipr->ipr_origin);
close(s);
return (1);
}
close(s);
return (0);
#else
ipr->ipr_vltime = DEF_ADVVALIDLIFETIME;
ipr->ipr_pltime = DEF_ADVPREFERREDLIFETIME;
ipr->ipr_raf_onlink = 1;
ipr->ipr_raf_auto = 1;
return (0);
#endif
}
void
make_prefix(struct rainfo *rai, int ifindex, struct in6_addr *addr, int plen)
{
struct in6_prefixreq ipr;
memset(&ipr, 0, sizeof(ipr));
if (if_indextoname(ifindex, ipr.ipr_name) == NULL) {
syslog(LOG_ERR, "<%s> Prefix added interface No.%d doesn't "
"exist. This should not happen! %s", __func__,
ifindex, strerror(errno));
exit(1);
}
ipr.ipr_prefix.sin6_len = sizeof(ipr.ipr_prefix);
ipr.ipr_prefix.sin6_family = AF_INET6;
ipr.ipr_prefix.sin6_addr = *addr;
ipr.ipr_plen = plen;
if (init_prefix(&ipr))
return; /* init failed by some error */
add_prefix(rai, &ipr);
}
void
make_packet(struct rainfo *rai)
{
size_t packlen, lladdroptlen = 0;
char *buf;
struct nd_router_advert *ra;
struct nd_opt_prefix_info *ndopt_pi;
struct nd_opt_mtu *ndopt_mtu;
struct nd_opt_route_info *ndopt_rti;
struct rtinfo *rti;
struct nd_opt_rdnss *ndopt_rdnss;
struct rdnss *rdn;
struct nd_opt_dnssl *ndopt_dnssl;
struct dnssl *dns;
size_t len;
struct prefix *pfx;
struct ifinfo *ifi;
ifi = rai->rai_ifinfo;
/* calculate total length */
packlen = sizeof(struct nd_router_advert);
if (rai->rai_advlinkopt) {
if ((lladdroptlen = lladdropt_length(&ifi->ifi_sdl)) == 0) {
syslog(LOG_INFO,
"<%s> link-layer address option has"
" null length on %s. Treat as not included.",
__func__, ifi->ifi_ifname);
rai->rai_advlinkopt = 0;
}
packlen += lladdroptlen;
}
if (rai->rai_pfxs)
packlen += sizeof(struct nd_opt_prefix_info) * rai->rai_pfxs;
if (rai->rai_linkmtu)
packlen += sizeof(struct nd_opt_mtu);
TAILQ_FOREACH(rti, &rai->rai_route, rti_next)
packlen += sizeof(struct nd_opt_route_info) +
((rti->rti_prefixlen + 0x3f) >> 6) * 8;
TAILQ_FOREACH(rdn, &rai->rai_rdnss, rd_next) {
struct rdnss_addr *rdna;
packlen += sizeof(struct nd_opt_rdnss);
TAILQ_FOREACH(rdna, &rdn->rd_list, ra_next)
packlen += sizeof(rdna->ra_dns);
}
TAILQ_FOREACH(dns, &rai->rai_dnssl, dn_next) {
struct dnssl_addr *dnsa;
packlen += sizeof(struct nd_opt_dnssl);
len = 0;
TAILQ_FOREACH(dnsa, &dns->dn_list, da_next)
len += dnsa->da_len;
/* A zero octet and 8 octet boundary */
len++;
len += (len % 8) ? 8 - len % 8 : 0;
packlen += len;
}
/* allocate memory for the packet */
if ((buf = malloc(packlen)) == NULL) {
syslog(LOG_ERR,
"<%s> can't get enough memory for an RA packet",
__func__);
exit(1);
}
memset(buf, 0, packlen);
if (rai->rai_ra_data) /* Free old data if any. */
free(rai->rai_ra_data);
rai->rai_ra_data = buf;
/* XXX: what if packlen > 576? */
rai->rai_ra_datalen = packlen;
/*
* construct the packet
*/
ra = (struct nd_router_advert *)buf;
ra->nd_ra_type = ND_ROUTER_ADVERT;
ra->nd_ra_code = 0;
ra->nd_ra_cksum = 0;
ra->nd_ra_curhoplimit = (uint8_t)(0xff & rai->rai_hoplimit);
/*
* XXX: the router preference field, which is a 2-bit field, should be
* initialized before other fields.
*/
ra->nd_ra_flags_reserved = 0xff & rai->rai_rtpref;
ra->nd_ra_flags_reserved |=
rai->rai_managedflg ? ND_RA_FLAG_MANAGED : 0;
ra->nd_ra_flags_reserved |=
rai->rai_otherflg ? ND_RA_FLAG_OTHER : 0;
#ifdef DRAFT_IETF_6MAN_IPV6ONLY_FLAG
ra->nd_ra_flags_reserved |=
rai->rai_ipv6onlyflg ? ND_RA_FLAG_IPV6_ONLY : 0;
#endif
ra->nd_ra_router_lifetime = htons(rai->rai_lifetime);
ra->nd_ra_reachable = htonl(rai->rai_reachabletime);
ra->nd_ra_retransmit = htonl(rai->rai_retranstimer);
buf += sizeof(*ra);
if (rai->rai_advlinkopt) {
lladdropt_fill(&ifi->ifi_sdl, (struct nd_opt_hdr *)buf);
buf += lladdroptlen;
}
if (rai->rai_linkmtu) {
ndopt_mtu = (struct nd_opt_mtu *)buf;
ndopt_mtu->nd_opt_mtu_type = ND_OPT_MTU;
ndopt_mtu->nd_opt_mtu_len = 1;
ndopt_mtu->nd_opt_mtu_reserved = 0;
ndopt_mtu->nd_opt_mtu_mtu = htonl(rai->rai_linkmtu);
buf += sizeof(struct nd_opt_mtu);
}
TAILQ_FOREACH(pfx, &rai->rai_prefix, pfx_next) {
uint32_t vltime, pltime;
struct timespec now;
ndopt_pi = (struct nd_opt_prefix_info *)buf;
ndopt_pi->nd_opt_pi_type = ND_OPT_PREFIX_INFORMATION;
ndopt_pi->nd_opt_pi_len = 4;
ndopt_pi->nd_opt_pi_prefix_len = pfx->pfx_prefixlen;
ndopt_pi->nd_opt_pi_flags_reserved = 0;
if (pfx->pfx_onlinkflg)
ndopt_pi->nd_opt_pi_flags_reserved |=
ND_OPT_PI_FLAG_ONLINK;
if (pfx->pfx_autoconfflg)
ndopt_pi->nd_opt_pi_flags_reserved |=
ND_OPT_PI_FLAG_AUTO;
if (pfx->pfx_timer)
vltime = 0;
else {
if (pfx->pfx_vltimeexpire || pfx->pfx_pltimeexpire)
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
if (pfx->pfx_vltimeexpire == 0)
vltime = pfx->pfx_validlifetime;
else
vltime = ((time_t)pfx->pfx_vltimeexpire > now.tv_sec) ?
pfx->pfx_vltimeexpire - now.tv_sec : 0;
}
if (pfx->pfx_timer)
pltime = 0;
else {
if (pfx->pfx_pltimeexpire == 0)
pltime = pfx->pfx_preflifetime;
else
pltime = ((time_t)pfx->pfx_pltimeexpire > now.tv_sec) ?
pfx->pfx_pltimeexpire - now.tv_sec : 0;
}
if (vltime < pltime) {
/*
* this can happen if vltime is decrement but pltime
* is not.
*/
pltime = vltime;
}
ndopt_pi->nd_opt_pi_valid_time = htonl(vltime);
ndopt_pi->nd_opt_pi_preferred_time = htonl(pltime);
ndopt_pi->nd_opt_pi_reserved2 = 0;
ndopt_pi->nd_opt_pi_prefix = pfx->pfx_prefix;
buf += sizeof(struct nd_opt_prefix_info);
}
TAILQ_FOREACH(rti, &rai->rai_route, rti_next) {
uint8_t psize = (rti->rti_prefixlen + 0x3f) >> 6;
ndopt_rti = (struct nd_opt_route_info *)buf;
ndopt_rti->nd_opt_rti_type = ND_OPT_ROUTE_INFO;
ndopt_rti->nd_opt_rti_len = 1 + psize;
ndopt_rti->nd_opt_rti_prefixlen = rti->rti_prefixlen;
ndopt_rti->nd_opt_rti_flags = 0xff & rti->rti_rtpref;
ndopt_rti->nd_opt_rti_lifetime = htonl(rti->rti_ltime);
memcpy(ndopt_rti + 1, &rti->rti_prefix, psize * 8);
buf += sizeof(struct nd_opt_route_info) + psize * 8;
}
TAILQ_FOREACH(rdn, &rai->rai_rdnss, rd_next) {
struct rdnss_addr *rdna;
ndopt_rdnss = (struct nd_opt_rdnss *)buf;
ndopt_rdnss->nd_opt_rdnss_type = ND_OPT_RDNSS;
ndopt_rdnss->nd_opt_rdnss_len = 0;
ndopt_rdnss->nd_opt_rdnss_reserved = 0;
ndopt_rdnss->nd_opt_rdnss_lifetime = htonl(rdn->rd_ltime);
buf += sizeof(struct nd_opt_rdnss);
TAILQ_FOREACH(rdna, &rdn->rd_list, ra_next) {
memcpy(buf, &rdna->ra_dns, sizeof(rdna->ra_dns));
buf += sizeof(rdna->ra_dns);
}
/* Length field should be in 8 octets */
ndopt_rdnss->nd_opt_rdnss_len = (buf - (char *)ndopt_rdnss) / 8;
syslog(LOG_DEBUG, "<%s>: nd_opt_dnss_len = %d", __func__,
ndopt_rdnss->nd_opt_rdnss_len);
}
TAILQ_FOREACH(dns, &rai->rai_dnssl, dn_next) {
struct dnssl_addr *dnsa;
ndopt_dnssl = (struct nd_opt_dnssl *)buf;
ndopt_dnssl->nd_opt_dnssl_type = ND_OPT_DNSSL;
ndopt_dnssl->nd_opt_dnssl_len = 0;
ndopt_dnssl->nd_opt_dnssl_reserved = 0;
ndopt_dnssl->nd_opt_dnssl_lifetime = htonl(dns->dn_ltime);
buf += sizeof(*ndopt_dnssl);
TAILQ_FOREACH(dnsa, &dns->dn_list, da_next) {
memcpy(buf, dnsa->da_dom, dnsa->da_len);
buf += dnsa->da_len;
}
/* A zero octet after encoded DNS server list. */
*buf++ = '\0';
/* Padding to next 8 octets boundary */
len = buf - (char *)ndopt_dnssl;
len += (len % 8) ? 8 - len % 8 : 0;
buf = (char *)ndopt_dnssl + len;
/* Length field must be in 8 octets */
ndopt_dnssl->nd_opt_dnssl_len = len / 8;
syslog(LOG_DEBUG, "<%s>: nd_opt_dnssl_len = %d", __func__,
ndopt_dnssl->nd_opt_dnssl_len);
}
return;
}
diff --git a/usr.sbin/rtadvd/config.h b/usr.sbin/rtadvd/config.h
index 24e6f493bdbc..cfea1821ca5e 100644
--- a/usr.sbin/rtadvd/config.h
+++ b/usr.sbin/rtadvd/config.h
@@ -1,55 +1,54 @@
-/* $FreeBSD$ */
/* $KAME: config.h,v 1.8 2003/06/17 08:26:22 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
extern struct ifinfo *getconfig(struct ifinfo *);
extern int rm_ifinfo(struct ifinfo *);
extern int rm_ifinfo_index(int);
extern int rm_rainfo(struct rainfo *);
extern int loadconfig_ifname(char *);
extern int loadconfig_index(int);
extern void delete_prefix(struct prefix *);
extern void invalidate_prefix(struct prefix *);
extern void update_prefix(struct prefix *);
extern void make_prefix(struct rainfo *, int, struct in6_addr *, int);
extern void make_packet(struct rainfo *);
extern void get_prefix(struct rainfo *);
/*
* it is highly unlikely to have 100 prefix information options,
* so it should be okay to limit it
*/
#define MAXPREFIX 100
#define MAXROUTE 100
#define MAXRDNSSENT 100
#define MAXDNSSLENT 100
diff --git a/usr.sbin/rtadvd/if.c b/usr.sbin/rtadvd/if.c
index 34fe7ad49dc2..ead273bbcdd2 100644
--- a/usr.sbin/rtadvd/if.c
+++ b/usr.sbin/rtadvd/if.c
@@ -1,772 +1,771 @@
-/* $FreeBSD$ */
/* $KAME: if.c,v 1.17 2001/01/21 15:27:30 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* Copyright (C) 2011 Hiroki Sato <hrs@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <sys/ioctl.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/if_types.h>
#include <net/ethernet.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/in_var.h>
#include <netinet/ip6.h>
#include <netinet/icmp6.h>
#include <netinet6/nd6.h>
#include <unistd.h>
#include <errno.h>
#include <netdb.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include "pathnames.h"
#include "rtadvd.h"
#include "if.h"
#define ROUNDUP(a, size) \
(((a) & ((size)-1)) ? (1 + ((a) | ((size)-1))) : (a))
#define NEXT_SA(ap) \
(ap) = (struct sockaddr *)((caddr_t)(ap) + \
((ap)->sa_len ? ROUNDUP((ap)->sa_len, sizeof(u_long)) : \
sizeof(u_long)))
struct sockaddr_in6 sin6_linklocal_allnodes = {
.sin6_len = sizeof(sin6_linklocal_allnodes),
.sin6_family = AF_INET6,
.sin6_addr = IN6ADDR_LINKLOCAL_ALLNODES_INIT,
};
struct sockaddr_in6 sin6_linklocal_allrouters = {
.sin6_len = sizeof(sin6_linklocal_allrouters),
.sin6_family = AF_INET6,
.sin6_addr = IN6ADDR_LINKLOCAL_ALLROUTERS_INIT,
};
struct sockaddr_in6 sin6_sitelocal_allrouters = {
.sin6_len = sizeof(sin6_sitelocal_allrouters),
.sin6_family = AF_INET6,
.sin6_addr = IN6ADDR_SITELOCAL_ALLROUTERS_INIT,
};
struct sockinfo sock = { .si_fd = -1, .si_name = NULL };
struct sockinfo rtsock = { .si_fd = -1, .si_name = NULL };
struct sockinfo ctrlsock = { .si_fd = -1, .si_name = _PATH_CTRL_SOCK };
char *mcastif;
static void get_rtaddrs(int, struct sockaddr *,
struct sockaddr **);
static struct if_msghdr *get_next_msghdr(struct if_msghdr *,
struct if_msghdr *);
static void
get_rtaddrs(int addrs, struct sockaddr *sa, struct sockaddr **rti_info)
{
int i;
for (i = 0; i < RTAX_MAX; i++) {
if (addrs & (1 << i)) {
rti_info[i] = sa;
NEXT_SA(sa);
}
else
rti_info[i] = NULL;
}
}
#define ROUNDUP8(a) (1 + (((a) - 1) | 7))
int
lladdropt_length(struct sockaddr_dl *sdl)
{
switch (sdl->sdl_type) {
case IFT_ETHER:
case IFT_L2VLAN:
case IFT_BRIDGE:
return (ROUNDUP8(ETHER_ADDR_LEN + 2));
default:
return (0);
}
}
void
lladdropt_fill(struct sockaddr_dl *sdl, struct nd_opt_hdr *ndopt)
{
char *addr;
ndopt->nd_opt_type = ND_OPT_SOURCE_LINKADDR; /* fixed */
switch (sdl->sdl_type) {
case IFT_ETHER:
case IFT_L2VLAN:
case IFT_BRIDGE:
ndopt->nd_opt_len = (ROUNDUP8(ETHER_ADDR_LEN + 2)) >> 3;
addr = (char *)(ndopt + 1);
memcpy(addr, LLADDR(sdl), ETHER_ADDR_LEN);
break;
default:
syslog(LOG_ERR, "<%s> unsupported link type(%d)",
__func__, sdl->sdl_type);
exit(1);
}
return;
}
int
rtbuf_len(void)
{
size_t len;
int mib[6] = {CTL_NET, AF_ROUTE, 0, AF_INET6, NET_RT_DUMP, 0};
if (sysctl(mib, 6, NULL, &len, NULL, 0) < 0)
return (-1);
return (len);
}
#define FILTER_MATCH(type, filter) ((0x1 << type) & filter)
#define SIN6(s) ((struct sockaddr_in6 *)(s))
#define SDL(s) ((struct sockaddr_dl *)(s))
char *
get_next_msg(char *buf, char *lim, int ifindex, size_t *lenp, int filter)
{
struct rt_msghdr *rtm;
struct ifa_msghdr *ifam;
struct sockaddr *sa, *dst, *gw, *ifa, *rti_info[RTAX_MAX];
*lenp = 0;
for (rtm = (struct rt_msghdr *)buf;
rtm < (struct rt_msghdr *)lim;
rtm = (struct rt_msghdr *)(((char *)rtm) + rtm->rtm_msglen)) {
/* just for safety */
if (!rtm->rtm_msglen) {
syslog(LOG_WARNING, "<%s> rtm_msglen is 0 "
"(buf=%p lim=%p rtm=%p)", __func__,
buf, lim, rtm);
break;
}
if (((struct rt_msghdr *)buf)->rtm_version != RTM_VERSION) {
syslog(LOG_WARNING,
"<%s> routing message version mismatch "
"(buf=%p lim=%p rtm=%p)", __func__,
buf, lim, rtm);
continue;
}
if (FILTER_MATCH(rtm->rtm_type, filter) == 0)
continue;
switch (rtm->rtm_type) {
case RTM_GET:
case RTM_ADD:
case RTM_DELETE:
/* address related checks */
sa = (struct sockaddr *)(rtm + 1);
get_rtaddrs(rtm->rtm_addrs, sa, rti_info);
if ((dst = rti_info[RTAX_DST]) == NULL ||
dst->sa_family != AF_INET6)
continue;
if (IN6_IS_ADDR_LINKLOCAL(&SIN6(dst)->sin6_addr) ||
IN6_IS_ADDR_MULTICAST(&SIN6(dst)->sin6_addr))
continue;
if ((gw = rti_info[RTAX_GATEWAY]) == NULL ||
gw->sa_family != AF_LINK)
continue;
if (ifindex && SDL(gw)->sdl_index != ifindex)
continue;
if (rti_info[RTAX_NETMASK] == NULL)
continue;
/* found */
*lenp = rtm->rtm_msglen;
return (char *)rtm;
/* NOTREACHED */
case RTM_NEWADDR:
case RTM_DELADDR:
ifam = (struct ifa_msghdr *)rtm;
/* address related checks */
sa = (struct sockaddr *)(ifam + 1);
get_rtaddrs(ifam->ifam_addrs, sa, rti_info);
if ((ifa = rti_info[RTAX_IFA]) == NULL ||
(ifa->sa_family != AF_INET &&
ifa->sa_family != AF_INET6))
continue;
if (ifa->sa_family == AF_INET6 &&
(IN6_IS_ADDR_LINKLOCAL(&SIN6(ifa)->sin6_addr) ||
IN6_IS_ADDR_MULTICAST(&SIN6(ifa)->sin6_addr)))
continue;
if (ifindex && ifam->ifam_index != ifindex)
continue;
/* found */
*lenp = ifam->ifam_msglen;
return (char *)rtm;
/* NOTREACHED */
case RTM_IFINFO:
case RTM_IFANNOUNCE:
/* found */
*lenp = rtm->rtm_msglen;
return (char *)rtm;
/* NOTREACHED */
}
}
return ((char *)rtm);
}
#undef FILTER_MATCH
struct in6_addr *
get_addr(char *buf)
{
struct rt_msghdr *rtm = (struct rt_msghdr *)buf;
struct sockaddr *sa, *rti_info[RTAX_MAX];
sa = (struct sockaddr *)(rtm + 1);
get_rtaddrs(rtm->rtm_addrs, sa, rti_info);
return (&SIN6(rti_info[RTAX_DST])->sin6_addr);
}
int
get_rtm_ifindex(char *buf)
{
struct rt_msghdr *rtm = (struct rt_msghdr *)buf;
struct sockaddr *sa, *rti_info[RTAX_MAX];
sa = (struct sockaddr *)(rtm + 1);
get_rtaddrs(rtm->rtm_addrs, sa, rti_info);
return (((struct sockaddr_dl *)rti_info[RTAX_GATEWAY])->sdl_index);
}
int
get_prefixlen(char *buf)
{
struct rt_msghdr *rtm = (struct rt_msghdr *)buf;
struct sockaddr *sa, *rti_info[RTAX_MAX];
char *p, *lim;
sa = (struct sockaddr *)(rtm + 1);
get_rtaddrs(rtm->rtm_addrs, sa, rti_info);
sa = rti_info[RTAX_NETMASK];
p = (char *)(&SIN6(sa)->sin6_addr);
lim = (char *)sa + sa->sa_len;
return prefixlen(p, lim);
}
int
prefixlen(unsigned char *p, unsigned char *lim)
{
int masklen;
for (masklen = 0; p < lim; p++) {
switch (*p) {
case 0xff:
masklen += 8;
break;
case 0xfe:
masklen += 7;
break;
case 0xfc:
masklen += 6;
break;
case 0xf8:
masklen += 5;
break;
case 0xf0:
masklen += 4;
break;
case 0xe0:
masklen += 3;
break;
case 0xc0:
masklen += 2;
break;
case 0x80:
masklen += 1;
break;
case 0x00:
break;
default:
return (-1);
}
}
return (masklen);
}
struct ifinfo *
update_persist_ifinfo(struct ifilist_head_t *ifi_head, const char *ifname)
{
struct ifinfo *ifi;
int ifindex;
ifi = NULL;
ifindex = if_nametoindex(ifname);
TAILQ_FOREACH(ifi, ifi_head, ifi_next) {
if (ifindex != 0) {
if (ifindex == ifi->ifi_ifindex)
break;
} else {
if (strncmp(ifname, ifi->ifi_ifname,
sizeof(ifi->ifi_ifname)) == 0)
break;
}
}
if (ifi == NULL) {
/* A new ifinfo element is needed. */
syslog(LOG_DEBUG, "<%s> new entry: %s", __func__,
ifname);
ELM_MALLOC(ifi, exit(1));
ifi->ifi_ifindex = 0;
strlcpy(ifi->ifi_ifname, ifname, sizeof(ifi->ifi_ifname));
ifi->ifi_rainfo = NULL;
ifi->ifi_state = IFI_STATE_UNCONFIGURED;
TAILQ_INSERT_TAIL(ifi_head, ifi, ifi_next);
}
ifi->ifi_persist = 1;
syslog(LOG_DEBUG, "<%s> %s is marked PERSIST", __func__,
ifi->ifi_ifname);
syslog(LOG_DEBUG, "<%s> %s is state = %d", __func__,
ifi->ifi_ifname, ifi->ifi_state);
return (ifi);
}
int
update_ifinfo_nd_flags(struct ifinfo *ifi)
{
struct in6_ndireq nd;
int s;
int error;
if ((s = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
syslog(LOG_ERR,
"<%s> socket() failed.", __func__);
return (1);
}
/* ND flags */
memset(&nd, 0, sizeof(nd));
strlcpy(nd.ifname, ifi->ifi_ifname,
sizeof(nd.ifname));
error = ioctl(s, SIOCGIFINFO_IN6, (caddr_t)&nd);
if (error) {
close(s);
if (errno != EPFNOSUPPORT)
syslog(LOG_ERR, "<%s> ioctl() failed.", __func__);
return (1);
}
ifi->ifi_nd_flags = nd.ndi.flags;
close(s);
return (0);
}
#define MAX_SYSCTL_TRY 5
struct ifinfo *
update_ifinfo(struct ifilist_head_t *ifi_head, int ifindex)
{
struct if_msghdr *ifm;
struct ifinfo *ifi = NULL;
struct sockaddr *sa;
struct sockaddr *rti_info[RTAX_MAX];
char *msg;
size_t len;
char *lim;
int mib[] = { CTL_NET, PF_ROUTE, 0, AF_INET6, NET_RT_IFLIST, 0 };
int error, ntry;
syslog(LOG_DEBUG, "<%s> enter", __func__);
ntry = 0;
do {
/*
* We'll try to get addresses several times in case that
* the number of addresses is unexpectedly increased during
* the two sysctl calls. This should rarely happen.
* Portability note: since FreeBSD does not add margin of
* memory at the first sysctl, the possibility of failure on
* the second sysctl call is a bit higher.
*/
if (sysctl(mib, nitems(mib), NULL, &len, NULL, 0) < 0) {
syslog(LOG_ERR,
"<%s> sysctl: NET_RT_IFLIST size get failed",
__func__);
exit(1);
}
if ((msg = malloc(len)) == NULL) {
syslog(LOG_ERR, "<%s> malloc failed", __func__);
exit(1);
}
if (sysctl(mib, nitems(mib), msg, &len, NULL, 0) < 0) {
if (errno != ENOMEM || ++ntry >= MAX_SYSCTL_TRY) {
free(msg);
syslog(LOG_ERR,
"<%s> sysctl: NET_RT_IFLIST get failed",
__func__);
exit(1);
}
free(msg);
msg = NULL;
}
} while (msg == NULL);
lim = msg + len;
for (ifm = (struct if_msghdr *)msg;
ifm != NULL && ifm < (struct if_msghdr *)lim;
ifm = get_next_msghdr(ifm,(struct if_msghdr *)lim)) {
int ifi_new;
syslog(LOG_DEBUG, "<%s> ifm = %p, lim = %p, diff = %zu",
__func__, ifm, lim, (char *)lim - (char *)ifm);
if (ifm->ifm_version != RTM_VERSION) {
syslog(LOG_ERR,
"<%s> ifm_vesrion mismatch", __func__);
exit(1);
}
if (ifm->ifm_msglen == 0) {
syslog(LOG_WARNING,
"<%s> ifm_msglen is 0", __func__);
free(msg);
return (NULL);
}
ifi_new = 0;
if (ifm->ifm_type == RTM_IFINFO) {
struct ifreq ifr;
int s;
char ifname[IFNAMSIZ];
syslog(LOG_DEBUG, "<%s> RTM_IFINFO found. "
"ifm_index = %d, ifindex = %d",
__func__, ifm->ifm_index, ifindex);
/* when ifindex is specified */
if (ifindex != UPDATE_IFINFO_ALL &&
ifindex != ifm->ifm_index)
continue;
/* ifname */
if (if_indextoname(ifm->ifm_index, ifname) == NULL) {
syslog(LOG_WARNING,
"<%s> ifname not found (idx=%d)",
__func__, ifm->ifm_index);
continue;
}
/* lookup an entry with the same ifindex */
TAILQ_FOREACH(ifi, ifi_head, ifi_next) {
if (ifm->ifm_index == ifi->ifi_ifindex)
break;
if (strncmp(ifname, ifi->ifi_ifname,
sizeof(ifname)) == 0)
break;
}
if (ifi == NULL) {
syslog(LOG_DEBUG,
"<%s> new entry for idx=%d",
__func__, ifm->ifm_index);
ELM_MALLOC(ifi, exit(1));
ifi->ifi_rainfo = NULL;
ifi->ifi_state = IFI_STATE_UNCONFIGURED;
ifi->ifi_persist = 0;
ifi_new = 1;
}
/* ifindex */
ifi->ifi_ifindex = ifm->ifm_index;
/* ifname */
strlcpy(ifi->ifi_ifname, ifname, IFNAMSIZ);
if ((s = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
syslog(LOG_ERR,
"<%s> socket() failed.", __func__);
if (ifi_new)
free(ifi);
continue;
}
/* MTU */
ifi->ifi_phymtu = ifm->ifm_data.ifi_mtu;
if (ifi->ifi_phymtu == 0) {
memset(&ifr, 0, sizeof(ifr));
ifr.ifr_addr.sa_family = AF_INET6;
strlcpy(ifr.ifr_name, ifi->ifi_ifname,
sizeof(ifr.ifr_name));
error = ioctl(s, SIOCGIFMTU, (caddr_t)&ifr);
if (error) {
close(s);
syslog(LOG_ERR,
"<%s> ioctl() failed.",
__func__);
if (ifi_new)
free(ifi);
continue;
}
ifi->ifi_phymtu = ifr.ifr_mtu;
if (ifi->ifi_phymtu == 0) {
syslog(LOG_WARNING,
"<%s> no interface mtu info"
" on %s. %d will be used.",
__func__, ifi->ifi_ifname,
IPV6_MMTU);
ifi->ifi_phymtu = IPV6_MMTU;
}
}
close(s);
/* ND flags */
error = update_ifinfo_nd_flags(ifi);
if (error) {
if (ifi_new)
free(ifi);
continue;
}
/* SDL */
sa = (struct sockaddr *)(ifm + 1);
get_rtaddrs(ifm->ifm_addrs, sa, rti_info);
if ((sa = rti_info[RTAX_IFP]) != NULL) {
if (sa->sa_family == AF_LINK) {
memcpy(&ifi->ifi_sdl,
(struct sockaddr_dl *)sa,
sizeof(ifi->ifi_sdl));
}
} else
memset(&ifi->ifi_sdl, 0,
sizeof(ifi->ifi_sdl));
/* flags */
ifi->ifi_flags = ifm->ifm_flags;
/* type */
ifi->ifi_type = ifm->ifm_type;
} else {
syslog(LOG_ERR,
"out of sync parsing NET_RT_IFLIST\n"
"expected %d, got %d\n msglen = %d\n",
RTM_IFINFO, ifm->ifm_type, ifm->ifm_msglen);
exit(1);
}
if (ifi_new) {
syslog(LOG_DEBUG,
"<%s> adding %s(idx=%d) to ifilist",
__func__, ifi->ifi_ifname, ifi->ifi_ifindex);
TAILQ_INSERT_TAIL(ifi_head, ifi, ifi_next);
}
}
free(msg);
if (mcastif != NULL) {
error = sock_mc_rr_update(&sock, mcastif);
if (error)
exit(1);
}
return (ifi);
}
static struct if_msghdr *
get_next_msghdr(struct if_msghdr *ifm, struct if_msghdr *lim)
{
struct ifa_msghdr *ifam;
for (ifam = (struct ifa_msghdr *)((char *)ifm + ifm->ifm_msglen);
ifam < (struct ifa_msghdr *)lim;
ifam = (struct ifa_msghdr *)((char *)ifam + ifam->ifam_msglen)) {
if (!ifam->ifam_msglen) {
syslog(LOG_WARNING,
"<%s> ifa_msglen is 0", __func__);
return (NULL);
}
if (ifam->ifam_type != RTM_NEWADDR)
break;
}
return ((struct if_msghdr *)ifam);
}
int
getinet6sysctl(int code)
{
int mib[] = { CTL_NET, PF_INET6, IPPROTO_IPV6, 0 };
int value;
size_t size;
mib[3] = code;
size = sizeof(value);
if (sysctl(mib, sizeof(mib)/sizeof(mib[0]), &value, &size, NULL, 0)
< 0) {
syslog(LOG_ERR, "<%s>: failed to get ip6 sysctl(%d): %s",
__func__, code,
strerror(errno));
return (-1);
}
else
return (value);
}
int
sock_mc_join(struct sockinfo *s, int ifindex)
{
struct ipv6_mreq mreq;
char ifname[IFNAMSIZ];
syslog(LOG_DEBUG, "<%s> enter", __func__);
if (ifindex == 0)
return (1);
/*
* join all routers multicast address on each advertising
* interface.
*/
memset(&mreq, 0, sizeof(mreq));
/* XXX */
memcpy(&mreq.ipv6mr_multiaddr.s6_addr,
&sin6_linklocal_allrouters.sin6_addr,
sizeof(mreq.ipv6mr_multiaddr.s6_addr));
mreq.ipv6mr_interface = ifindex;
if (setsockopt(s->si_fd, IPPROTO_IPV6, IPV6_JOIN_GROUP, &mreq,
sizeof(mreq)) < 0) {
syslog(LOG_ERR,
"<%s> IPV6_JOIN_GROUP(link) on %s: %s",
__func__, if_indextoname(ifindex, ifname),
strerror(errno));
return (1);
}
syslog(LOG_DEBUG,
"<%s> %s: join link-local all-routers MC group",
__func__, if_indextoname(ifindex, ifname));
return (0);
}
int
sock_mc_leave(struct sockinfo *s, int ifindex)
{
struct ipv6_mreq mreq;
char ifname[IFNAMSIZ];
syslog(LOG_DEBUG, "<%s> enter", __func__);
if (ifindex == 0)
return (1);
/*
* join all routers multicast address on each advertising
* interface.
*/
memset(&mreq, 0, sizeof(mreq));
/* XXX */
memcpy(&mreq.ipv6mr_multiaddr.s6_addr,
&sin6_linklocal_allrouters.sin6_addr,
sizeof(mreq.ipv6mr_multiaddr.s6_addr));
mreq.ipv6mr_interface = ifindex;
if (setsockopt(s->si_fd, IPPROTO_IPV6, IPV6_LEAVE_GROUP, &mreq,
sizeof(mreq)) < 0) {
syslog(LOG_ERR,
"<%s> IPV6_JOIN_LEAVE(link) on %s: %s",
__func__, if_indextoname(ifindex, ifname),
strerror(errno));
return (1);
}
syslog(LOG_DEBUG,
"<%s> %s: leave link-local all-routers MC group",
__func__, if_indextoname(ifindex, ifname));
return (0);
}
int
sock_mc_rr_update(struct sockinfo *s, char *mif)
{
struct ipv6_mreq mreq;
syslog(LOG_DEBUG, "<%s> enter", __func__);
if (mif == NULL)
return (1);
/*
* When attending router renumbering, join all-routers site-local
* multicast group.
*/
/* XXX */
memcpy(&mreq.ipv6mr_multiaddr.s6_addr,
&sin6_sitelocal_allrouters.sin6_addr,
sizeof(mreq.ipv6mr_multiaddr.s6_addr));
if ((mreq.ipv6mr_interface = if_nametoindex(mif)) == 0) {
syslog(LOG_ERR,
"<%s> invalid interface: %s",
__func__, mif);
return (1);
}
if (setsockopt(s->si_fd, IPPROTO_IPV6, IPV6_JOIN_GROUP,
&mreq, sizeof(mreq)) < 0) {
syslog(LOG_ERR,
"<%s> IPV6_JOIN_GROUP(site) on %s: %s",
__func__, mif, strerror(errno));
return (1);
}
syslog(LOG_DEBUG,
"<%s> %s: join site-local all-routers MC group",
__func__, mif);
return (0);
}
diff --git a/usr.sbin/rtadvd/if.h b/usr.sbin/rtadvd/if.h
index 42b4be795859..c477a836e251 100644
--- a/usr.sbin/rtadvd/if.h
+++ b/usr.sbin/rtadvd/if.h
@@ -1,63 +1,62 @@
-/* $FreeBSD$ */
/* $KAME: if.h,v 1.10 2003/02/24 11:29:10 ono Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#define UPDATE_IFINFO_ALL 0
struct sockinfo {
int si_fd;
const char *si_name;
};
extern struct sockinfo sock;
extern struct sockinfo rtsock;
extern struct sockinfo ctrlsock;
int lladdropt_length(struct sockaddr_dl *);
void lladdropt_fill(struct sockaddr_dl *, struct nd_opt_hdr *);
int rtbuf_len(void);
char *get_next_msg(char *, char *, int, size_t *, int);
struct in6_addr *get_addr(char *);
int get_rtm_ifindex(char *);
int get_prefixlen(char *);
int prefixlen(unsigned char *, unsigned char *);
struct ifinfo *update_ifinfo(struct ifilist_head_t *, int);
int update_ifinfo_nd_flags(struct ifinfo *);
struct ifinfo *update_persist_ifinfo(struct ifilist_head_t *,
const char *);
int sock_mc_join(struct sockinfo *, int);
int sock_mc_leave(struct sockinfo *, int);
int sock_mc_rr_update(struct sockinfo *, char *);
int getinet6sysctl(int);
diff --git a/usr.sbin/rtadvd/pathnames.h b/usr.sbin/rtadvd/pathnames.h
index 248ee19f66e0..154feab97f07 100644
--- a/usr.sbin/rtadvd/pathnames.h
+++ b/usr.sbin/rtadvd/pathnames.h
@@ -1,6 +1,5 @@
/* $KAME: pathnames.h,v 1.2 2000/05/16 13:34:13 itojun Exp $ */
-/* $FreeBSD$ */
#define _PATH_RTADVDCONF "/etc/rtadvd.conf"
#define _PATH_RTADVDPID "/var/run/rtadvd.pid"
#define _PATH_CTRL_SOCK "/var/run/rtadvd.sock"
diff --git a/usr.sbin/rtadvd/rrenum.c b/usr.sbin/rtadvd/rrenum.c
index f12fcaaed8c7..0d0d7d5bf708 100644
--- a/usr.sbin/rtadvd/rrenum.c
+++ b/usr.sbin/rtadvd/rrenum.c
@@ -1,505 +1,504 @@
-/* $FreeBSD$ */
/* $KAME: rrenum.c,v 1.12 2002/06/10 19:59:47 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/sysctl.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/in_var.h>
#include <netinet/icmp6.h>
#include <arpa/inet.h>
#include <errno.h>
#include <netdb.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <syslog.h>
#include "rtadvd.h"
#include "rrenum.h"
#include "if.h"
#define RR_ISSET_SEGNUM(segnum_bits, segnum) \
((((segnum_bits)[(segnum) >> 5]) & (1 << ((segnum) & 31))) != 0)
#define RR_SET_SEGNUM(segnum_bits, segnum) \
(((segnum_bits)[(segnum) >> 5]) |= (1 << ((segnum) & 31)))
struct rr_operation {
u_long rro_seqnum;
u_long rro_segnum_bits[8];
};
static struct rr_operation rro;
static int rr_rcvifindex;
static int rrcmd2pco[RPM_PCO_MAX] = {
0,
SIOCAIFPREFIX_IN6,
SIOCCIFPREFIX_IN6,
SIOCSGIFPREFIX_IN6
};
static int s = -1;
/*
* Check validity of a Prefix Control Operation(PCO).
* return 0 on success, 1 on failure.
*/
static int
rr_pco_check(int len, struct rr_pco_match *rpm)
{
struct rr_pco_use *rpu, *rpulim;
int checklen;
/* rpm->rpm_len must be (4N * 3) as router-renum-05.txt */
if ((rpm->rpm_len - 3) < 0 || /* must be at least 3 */
(rpm->rpm_len - 3) & 0x3) { /* must be multiple of 4 */
syslog(LOG_WARNING, "<%s> rpm_len %d is not 4N * 3",
__func__, rpm->rpm_len);
return (1);
}
/* rpm->rpm_code must be valid value */
switch (rpm->rpm_code) {
case RPM_PCO_ADD:
case RPM_PCO_CHANGE:
case RPM_PCO_SETGLOBAL:
break;
default:
syslog(LOG_WARNING, "<%s> unknown rpm_code %d", __func__,
rpm->rpm_code);
return (1);
}
/* rpm->rpm_matchlen must be 0 to 128 inclusive */
if (rpm->rpm_matchlen > 128) {
syslog(LOG_WARNING, "<%s> rpm_matchlen %d is over 128",
__func__, rpm->rpm_matchlen);
return (1);
}
/*
* rpu->rpu_uselen, rpu->rpu_keeplen, and sum of them must be
* between 0 and 128 inclusive
*/
for (rpu = (struct rr_pco_use *)(rpm + 1),
rpulim = (struct rr_pco_use *)((char *)rpm + len);
rpu < rpulim;
rpu += 1) {
checklen = rpu->rpu_uselen;
checklen += rpu->rpu_keeplen;
/*
* omit these check, because either of rpu_uselen
* and rpu_keeplen is unsigned char
* (128 > rpu_uselen > 0)
* (128 > rpu_keeplen > 0)
* (rpu_uselen + rpu_keeplen > 0)
*/
if (checklen > 128) {
syslog(LOG_WARNING, "<%s> sum of rpu_uselen %d and"
" rpu_keeplen %d is %d(over 128)",
__func__, rpu->rpu_uselen, rpu->rpu_keeplen,
rpu->rpu_uselen + rpu->rpu_keeplen);
return (1);
}
}
return (0);
}
static void
do_use_prefix(int len, struct rr_pco_match *rpm,
struct in6_rrenumreq *irr, int ifindex)
{
struct rr_pco_use *rpu, *rpulim;
struct rainfo *rai;
struct ifinfo *ifi;
struct prefix *pfx;
rpu = (struct rr_pco_use *)(rpm + 1);
rpulim = (struct rr_pco_use *)((char *)rpm + len);
if (rpu == rpulim) { /* no use prefix */
if (rpm->rpm_code == RPM_PCO_ADD)
return;
irr->irr_u_uselen = 0;
irr->irr_u_keeplen = 0;
irr->irr_raf_mask_onlink = 0;
irr->irr_raf_mask_auto = 0;
irr->irr_vltime = 0;
irr->irr_pltime = 0;
memset(&irr->irr_flags, 0, sizeof(irr->irr_flags));
irr->irr_useprefix.sin6_len = 0; /* let it mean, no addition */
irr->irr_useprefix.sin6_family = 0;
irr->irr_useprefix.sin6_addr = in6addr_any;
if (ioctl(s, rrcmd2pco[rpm->rpm_code], (caddr_t)irr) < 0 &&
errno != EADDRNOTAVAIL)
syslog(LOG_ERR, "<%s> ioctl: %s", __func__,
strerror(errno));
return;
}
for (rpu = (struct rr_pco_use *)(rpm + 1),
rpulim = (struct rr_pco_use *)((char *)rpm + len);
rpu < rpulim;
rpu += 1) {
/* init in6_rrenumreq fields */
irr->irr_u_uselen = rpu->rpu_uselen;
irr->irr_u_keeplen = rpu->rpu_keeplen;
irr->irr_raf_mask_onlink =
!!(rpu->rpu_ramask & ICMP6_RR_PCOUSE_RAFLAGS_ONLINK);
irr->irr_raf_mask_auto =
!!(rpu->rpu_ramask & ICMP6_RR_PCOUSE_RAFLAGS_AUTO);
irr->irr_vltime = ntohl(rpu->rpu_vltime);
irr->irr_pltime = ntohl(rpu->rpu_pltime);
irr->irr_raf_onlink =
(rpu->rpu_raflags & ICMP6_RR_PCOUSE_RAFLAGS_ONLINK) == 0 ?
0 : 1;
irr->irr_raf_auto =
(rpu->rpu_raflags & ICMP6_RR_PCOUSE_RAFLAGS_AUTO) == 0 ?
0 : 1;
irr->irr_rrf_decrvalid =
(rpu->rpu_flags & ICMP6_RR_PCOUSE_FLAGS_DECRVLTIME) == 0 ?
0 : 1;
irr->irr_rrf_decrprefd =
(rpu->rpu_flags & ICMP6_RR_PCOUSE_FLAGS_DECRPLTIME) == 0 ?
0 : 1;
irr->irr_useprefix.sin6_len = sizeof(irr->irr_useprefix);
irr->irr_useprefix.sin6_family = AF_INET6;
irr->irr_useprefix.sin6_addr = rpu->rpu_prefix;
if (ioctl(s, rrcmd2pco[rpm->rpm_code], (caddr_t)irr) < 0 &&
errno != EADDRNOTAVAIL)
syslog(LOG_ERR, "<%s> ioctl: %s", __func__,
strerror(errno));
/* very adhoc: should be rewritten */
if (rpm->rpm_code == RPM_PCO_CHANGE &&
IN6_ARE_ADDR_EQUAL(&rpm->rpm_prefix, &rpu->rpu_prefix) &&
rpm->rpm_matchlen == rpu->rpu_uselen &&
rpu->rpu_uselen == rpu->rpu_keeplen) {
ifi = if_indextoifinfo(ifindex);
if (ifi == NULL || ifi->ifi_rainfo == NULL)
continue; /* non-advertising IF */
rai = ifi->ifi_rainfo;
TAILQ_FOREACH(pfx, &rai->rai_prefix, pfx_next) {
struct timespec now;
if (prefix_match(&pfx->pfx_prefix,
pfx->pfx_prefixlen, &rpm->rpm_prefix,
rpm->rpm_matchlen)) {
/* change parameters */
pfx->pfx_validlifetime =
ntohl(rpu->rpu_vltime);
pfx->pfx_preflifetime =
ntohl(rpu->rpu_pltime);
if (irr->irr_rrf_decrvalid) {
clock_gettime(CLOCK_MONOTONIC_FAST,
&now);
pfx->pfx_vltimeexpire =
now.tv_sec +
pfx->pfx_validlifetime;
} else
pfx->pfx_vltimeexpire = 0;
if (irr->irr_rrf_decrprefd) {
clock_gettime(CLOCK_MONOTONIC_FAST,
&now);
pfx->pfx_pltimeexpire =
now.tv_sec +
pfx->pfx_preflifetime;
} else
pfx->pfx_pltimeexpire = 0;
}
}
}
}
}
/*
* process a Prefix Control Operation(PCO).
* return 0 on success, 1 on failure
*/
static int
do_pco(struct icmp6_router_renum *rr, int len, struct rr_pco_match *rpm)
{
int ifindex = 0;
struct in6_rrenumreq irr;
struct ifinfo *ifi;
if ((rr_pco_check(len, rpm) != 0))
return (1);
if (s == -1 && (s = socket(AF_INET6, SOCK_DGRAM, 0)) < 0) {
syslog(LOG_ERR, "<%s> socket: %s", __func__,
strerror(errno));
exit(1);
}
memset(&irr, 0, sizeof(irr));
irr.irr_origin = PR_ORIG_RR;
irr.irr_m_len = rpm->rpm_matchlen;
irr.irr_m_minlen = rpm->rpm_minlen;
irr.irr_m_maxlen = rpm->rpm_maxlen;
irr.irr_matchprefix.sin6_len = sizeof(irr.irr_matchprefix);
irr.irr_matchprefix.sin6_family = AF_INET6;
irr.irr_matchprefix.sin6_addr = rpm->rpm_prefix;
while (if_indextoname(++ifindex, irr.irr_name)) {
ifi = if_indextoifinfo(ifindex);
if (ifi == NULL) {
syslog(LOG_ERR, "<%s> ifindex not found.",
__func__);
return (1);
}
/*
* if ICMP6_RR_FLAGS_FORCEAPPLY(A flag) is 0 and
* IFF_UP is off, the interface is not applied
*/
if ((rr->rr_flags & ICMP6_RR_FLAGS_FORCEAPPLY) == 0 &&
(ifi->ifi_flags & IFF_UP) == 0)
continue;
/* TODO: interface scope check */
do_use_prefix(len, rpm, &irr, ifindex);
}
if (errno == ENXIO)
return (0);
else if (errno) {
syslog(LOG_ERR, "<%s> if_indextoname: %s", __func__,
strerror(errno));
return (1);
}
return (0);
}
/*
* call do_pco() for each Prefix Control Operations(PCOs) in a received
* Router Renumbering Command packet.
* return 0 on success, 1 on failure
*/
static int
do_rr(int len, struct icmp6_router_renum *rr)
{
struct rr_pco_match *rpm;
char *cp, *lim;
lim = (char *)rr + len;
cp = (char *)(rr + 1);
len -= sizeof(struct icmp6_router_renum);
update_ifinfo(&ifilist, UPDATE_IFINFO_ALL);
while (cp < lim) {
int rpmlen;
rpm = (struct rr_pco_match *)cp;
if ((size_t)len < sizeof(struct rr_pco_match)) {
tooshort:
syslog(LOG_ERR, "<%s> pkt too short. left len = %d. "
"garbage at end of pkt?", __func__, len);
return (1);
}
rpmlen = rpm->rpm_len << 3;
if (len < rpmlen)
goto tooshort;
if (do_pco(rr, rpmlen, rpm)) {
syslog(LOG_WARNING, "<%s> invalid PCO", __func__);
goto next;
}
next:
cp += rpmlen;
len -= rpmlen;
}
return (0);
}
/*
* check validity of a router renumbering command packet
* return 0 on success, 1 on failure
*/
static int
rr_command_check(int len, struct icmp6_router_renum *rr, struct in6_addr *from,
struct in6_addr *dst)
{
u_char ntopbuf[INET6_ADDRSTRLEN];
/* omit rr minimal length check. hope kernel have done it. */
/* rr_command length check */
if ((size_t)len < (sizeof(struct icmp6_router_renum) +
sizeof(struct rr_pco_match))) {
syslog(LOG_ERR, "<%s> rr_command len %d is too short",
__func__, len);
return (1);
}
/* destination check. only for multicast. omit unicast check. */
if (IN6_IS_ADDR_MULTICAST(dst) && !IN6_IS_ADDR_MC_LINKLOCAL(dst) &&
!IN6_IS_ADDR_MC_SITELOCAL(dst)) {
syslog(LOG_ERR, "<%s> dst mcast addr %s is illegal",
__func__,
inet_ntop(AF_INET6, dst, ntopbuf, sizeof(ntopbuf)));
return (1);
}
/* seqnum and segnum check */
if (rro.rro_seqnum > rr->rr_seqnum) {
syslog(LOG_WARNING,
"<%s> rcvd old seqnum %d from %s",
__func__, (u_int32_t)ntohl(rr->rr_seqnum),
inet_ntop(AF_INET6, from, ntopbuf, sizeof(ntopbuf)));
return (1);
}
if (rro.rro_seqnum == rr->rr_seqnum &&
(rr->rr_flags & ICMP6_RR_FLAGS_TEST) == 0 &&
RR_ISSET_SEGNUM(rro.rro_segnum_bits, rr->rr_segnum)) {
if ((rr->rr_flags & ICMP6_RR_FLAGS_REQRESULT) != 0)
syslog(LOG_WARNING,
"<%s> rcvd duped segnum %d from %s",
__func__, rr->rr_segnum, inet_ntop(AF_INET6, from,
ntopbuf, sizeof(ntopbuf)));
return (0);
}
/* update seqnum */
if (rro.rro_seqnum != rr->rr_seqnum) {
/* then must be "<" */
/* init rro_segnum_bits */
memset(rro.rro_segnum_bits, 0,
sizeof(rro.rro_segnum_bits));
}
rro.rro_seqnum = rr->rr_seqnum;
return (0);
}
static void
rr_command_input(int len, struct icmp6_router_renum *rr,
struct in6_addr *from, struct in6_addr *dst)
{
/* rr_command validity check */
if (rr_command_check(len, rr, from, dst))
goto failed;
if ((rr->rr_flags & (ICMP6_RR_FLAGS_TEST|ICMP6_RR_FLAGS_REQRESULT)) ==
ICMP6_RR_FLAGS_TEST)
return;
/* do router renumbering */
if (do_rr(len, rr))
goto failed;
/* update segnum */
RR_SET_SEGNUM(rro.rro_segnum_bits, rr->rr_segnum);
return;
failed:
syslog(LOG_ERR, "<%s> received RR was invalid", __func__);
return;
}
void
rr_input(int len, struct icmp6_router_renum *rr, struct in6_pktinfo *pi,
struct sockaddr_in6 *from, struct in6_addr *dst)
{
u_char ntopbuf[2][INET6_ADDRSTRLEN], ifnamebuf[IFNAMSIZ];
syslog(LOG_DEBUG,
"<%s> RR received from %s to %s on %s",
__func__,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf[0] ,sizeof(ntopbuf[0])),
inet_ntop(AF_INET6, &dst, ntopbuf[1], sizeof(ntopbuf[1])),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
/* packet validation based on Section 4.1 of RFC2894 */
if ((size_t)len < sizeof(struct icmp6_router_renum)) {
syslog(LOG_NOTICE,
"<%s>: RR short message (size %d) from %s to %s on %s",
__func__, len,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf[0],
sizeof(ntopbuf[0])),
inet_ntop(AF_INET6, &dst, ntopbuf[1], sizeof(ntopbuf[1])),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
/*
* If the IPv6 destination address is neither an All Routers multicast
* address [AARCH] nor one of the receiving router's unicast addresses,
* the message MUST be discarded and SHOULD be logged to network
* management.
* We rely on the kernel input routine for unicast addresses, and thus
* check multicast destinations only.
*/
if (IN6_IS_ADDR_MULTICAST(&pi->ipi6_addr) && !IN6_ARE_ADDR_EQUAL(
&sin6_sitelocal_allrouters.sin6_addr, &pi->ipi6_addr)) {
syslog(LOG_NOTICE,
"<%s>: RR message with invalid destination (%s) "
"from %s on %s",
__func__,
inet_ntop(AF_INET6, &dst, ntopbuf[0], sizeof(ntopbuf[0])),
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf[1],
sizeof(ntopbuf[1])),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
rr_rcvifindex = pi->ipi6_ifindex;
switch (rr->rr_code) {
case ICMP6_ROUTER_RENUMBERING_COMMAND:
rr_command_input(len, rr, &from->sin6_addr, dst);
/* TODO: send reply msg */
break;
case ICMP6_ROUTER_RENUMBERING_RESULT:
/* RESULT will be processed by rrenumd */
break;
case ICMP6_ROUTER_RENUMBERING_SEQNUM_RESET:
/* TODO: sequence number reset */
break;
default:
syslog(LOG_ERR, "<%s> received unknown code %d",
__func__, rr->rr_code);
break;
}
return;
}
diff --git a/usr.sbin/rtadvd/rrenum.h b/usr.sbin/rtadvd/rrenum.h
index 93cd96b6d189..c4bc3e1af376 100644
--- a/usr.sbin/rtadvd/rrenum.h
+++ b/usr.sbin/rtadvd/rrenum.h
@@ -1,36 +1,35 @@
-/* $FreeBSD$ */
/* $KAME: rrenum.h,v 1.3 2001/01/21 15:37:14 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
void rr_input(int, struct icmp6_router_renum *, struct in6_pktinfo *,
struct sockaddr_in6 *, struct in6_addr *);
diff --git a/usr.sbin/rtadvd/rtadvd.c b/usr.sbin/rtadvd/rtadvd.c
index 391c95c9bd48..181b1211d7af 100644
--- a/usr.sbin/rtadvd/rtadvd.c
+++ b/usr.sbin/rtadvd/rtadvd.c
@@ -1,1921 +1,1920 @@
-/* $FreeBSD$ */
/* $KAME: rtadvd.c,v 1.82 2003/08/05 12:34:23 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* Copyright (C) 2011 Hiroki Sato <hrs@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <sys/uio.h>
#include <sys/queue.h>
#include <sys/stat.h>
#include <sys/sysctl.h>
#include <net/if.h>
#include <net/if_types.h>
#include <net/if_media.h>
#include <net/if_dl.h>
#include <net/route.h>
#include <netinet/in.h>
#include <netinet/ip6.h>
#include <netinet6/ip6_var.h>
#include <netinet/icmp6.h>
#include <arpa/inet.h>
#include <netinet/in_var.h>
#include <netinet6/nd6.h>
#include <time.h>
#include <unistd.h>
#include <stdio.h>
#include <err.h>
#include <errno.h>
#include <inttypes.h>
#include <libutil.h>
#include <netdb.h>
#include <signal.h>
#include <string.h>
#include <stdlib.h>
#include <syslog.h>
#include <poll.h>
#include "pathnames.h"
#include "rtadvd.h"
#include "if.h"
#include "rrenum.h"
#include "advcap.h"
#include "timer_subr.h"
#include "timer.h"
#include "config.h"
#include "control.h"
#include "control_server.h"
#define RTADV_TYPE2BITMASK(type) (0x1 << type)
struct msghdr rcvmhdr;
static char *rcvcmsgbuf;
static size_t rcvcmsgbuflen;
static char *sndcmsgbuf = NULL;
static size_t sndcmsgbuflen;
struct msghdr sndmhdr;
struct iovec rcviov[2];
struct iovec sndiov[2];
struct sockaddr_in6 rcvfrom;
static const char *pidfilename = _PATH_RTADVDPID;
const char *conffile = _PATH_RTADVDCONF;
static struct pidfh *pfh;
static int dflag, sflag;
static int wait_shutdown;
#define PFD_RAWSOCK 0
#define PFD_RTSOCK 1
#define PFD_CSOCK 2
#define PFD_MAX 3
struct railist_head_t railist =
TAILQ_HEAD_INITIALIZER(railist);
struct ifilist_head_t ifilist =
TAILQ_HEAD_INITIALIZER(ifilist);
struct nd_optlist {
TAILQ_ENTRY(nd_optlist) nol_next;
struct nd_opt_hdr *nol_opt;
};
union nd_opt {
struct nd_opt_hdr *opt_array[9];
struct {
struct nd_opt_hdr *zero;
struct nd_opt_hdr *src_lladdr;
struct nd_opt_hdr *tgt_lladdr;
struct nd_opt_prefix_info *pi;
struct nd_opt_rd_hdr *rh;
struct nd_opt_mtu *mtu;
TAILQ_HEAD(, nd_optlist) opt_list;
} nd_opt_each;
};
#define opt_src_lladdr nd_opt_each.src_lladdr
#define opt_tgt_lladdr nd_opt_each.tgt_lladdr
#define opt_pi nd_opt_each.pi
#define opt_rh nd_opt_each.rh
#define opt_mtu nd_opt_each.mtu
#define opt_list nd_opt_each.opt_list
#define NDOPT_FLAG_SRCLINKADDR (1 << 0)
#define NDOPT_FLAG_TGTLINKADDR (1 << 1)
#define NDOPT_FLAG_PREFIXINFO (1 << 2)
#define NDOPT_FLAG_RDHDR (1 << 3)
#define NDOPT_FLAG_MTU (1 << 4)
#define NDOPT_FLAG_RDNSS (1 << 5)
#define NDOPT_FLAG_DNSSL (1 << 6)
static uint32_t ndopt_flags[] = {
[ND_OPT_SOURCE_LINKADDR] = NDOPT_FLAG_SRCLINKADDR,
[ND_OPT_TARGET_LINKADDR] = NDOPT_FLAG_TGTLINKADDR,
[ND_OPT_PREFIX_INFORMATION] = NDOPT_FLAG_PREFIXINFO,
[ND_OPT_REDIRECTED_HEADER] = NDOPT_FLAG_RDHDR,
[ND_OPT_MTU] = NDOPT_FLAG_MTU,
[ND_OPT_RDNSS] = NDOPT_FLAG_RDNSS,
[ND_OPT_DNSSL] = NDOPT_FLAG_DNSSL,
};
static void rtadvd_shutdown(void);
static void sock_open(struct sockinfo *);
static void rtsock_open(struct sockinfo *);
static void rtadvd_input(struct sockinfo *);
static void rs_input(int, struct nd_router_solicit *,
struct in6_pktinfo *, struct sockaddr_in6 *);
static void ra_input(int, struct nd_router_advert *,
struct in6_pktinfo *, struct sockaddr_in6 *);
static int prefix_check(struct nd_opt_prefix_info *, struct rainfo *,
struct sockaddr_in6 *);
static int nd6_options(struct nd_opt_hdr *, int,
union nd_opt *, uint32_t);
static void free_ndopts(union nd_opt *);
static void rtmsg_input(struct sockinfo *);
static void set_short_delay(struct ifinfo *);
static int check_accept_rtadv(int);
static void
usage(void)
{
fprintf(stderr, "usage: rtadvd [-dDfRs] "
"[-c configfile] [-C ctlsock] [-M ifname] [-p pidfile]\n");
exit(1);
}
int
main(int argc, char *argv[])
{
struct pollfd set[PFD_MAX];
struct timespec *timeout;
int i, ch;
int fflag = 0, logopt;
int error;
pid_t pid, otherpid;
/* get command line options and arguments */
while ((ch = getopt(argc, argv, "c:C:dDfhM:p:Rs")) != -1) {
switch (ch) {
case 'c':
conffile = optarg;
break;
case 'C':
ctrlsock.si_name = optarg;
break;
case 'd':
dflag++;
break;
case 'D':
dflag += 3;
break;
case 'f':
fflag = 1;
break;
case 'M':
mcastif = optarg;
break;
case 'R':
fprintf(stderr, "rtadvd: "
"the -R option is currently ignored.\n");
/* accept_rr = 1; */
/* run anyway... */
break;
case 's':
sflag = 1;
break;
case 'p':
pidfilename = optarg;
break;
default:
usage();
}
}
argc -= optind;
argv += optind;
logopt = LOG_NDELAY | LOG_PID;
if (fflag)
logopt |= LOG_PERROR;
openlog("rtadvd", logopt, LOG_DAEMON);
/* set log level */
if (dflag > 2)
(void)setlogmask(LOG_UPTO(LOG_DEBUG));
else if (dflag > 1)
(void)setlogmask(LOG_UPTO(LOG_INFO));
else if (dflag > 0)
(void)setlogmask(LOG_UPTO(LOG_NOTICE));
else
(void)setlogmask(LOG_UPTO(LOG_ERR));
/* timer initialization */
rtadvd_timer_init();
pfh = pidfile_open(pidfilename, 0600, &otherpid);
if (pfh == NULL) {
if (errno == EEXIST)
errx(1, "%s already running, pid: %d",
getprogname(), otherpid);
syslog(LOG_ERR,
"failed to open the pid file %s, run anyway.",
pidfilename);
}
if (!fflag)
daemon(1, 0);
sock_open(&sock);
update_ifinfo(&ifilist, UPDATE_IFINFO_ALL);
for (i = 0; i < argc; i++)
update_persist_ifinfo(&ifilist, argv[i]);
csock_open(&ctrlsock, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH);
if (ctrlsock.si_fd == -1) {
syslog(LOG_ERR, "cannot open control socket: %s",
strerror(errno));
exit(1);
}
/* record the current PID */
pid = getpid();
pidfile_write(pfh);
set[PFD_RAWSOCK].fd = sock.si_fd;
set[PFD_RAWSOCK].events = POLLIN;
if (sflag == 0) {
rtsock_open(&rtsock);
set[PFD_RTSOCK].fd = rtsock.si_fd;
set[PFD_RTSOCK].events = POLLIN;
} else
set[PFD_RTSOCK].fd = -1;
set[PFD_CSOCK].fd = ctrlsock.si_fd;
set[PFD_CSOCK].events = POLLIN;
signal(SIGTERM, set_do_shutdown);
signal(SIGINT, set_do_shutdown);
signal(SIGHUP, set_do_reload);
error = csock_listen(&ctrlsock);
if (error) {
syslog(LOG_ERR, "cannot listen control socket: %s",
strerror(errno));
exit(1);
}
/* load configuration file */
set_do_reload(0);
while (1) {
if (is_do_shutdown())
rtadvd_shutdown();
if (is_do_reload()) {
loadconfig_ifname(reload_ifname());
if (reload_ifname() == NULL)
syslog(LOG_INFO,
"configuration file reloaded.");
else
syslog(LOG_INFO,
"configuration file for %s reloaded.",
reload_ifname());
reset_do_reload();
}
/* timeout handler update for active interfaces */
rtadvd_update_timeout_handler();
/* timer expiration check and reset the timer */
timeout = rtadvd_check_timer();
if (timeout != NULL) {
syslog(LOG_DEBUG,
"<%s> set timer to %ld:%ld. waiting for "
"inputs or timeout", __func__,
(long int)timeout->tv_sec,
(long int)timeout->tv_nsec / 1000);
} else {
syslog(LOG_DEBUG,
"<%s> there's no timer. waiting for inputs",
__func__);
}
if ((i = poll(set, sizeof(set)/sizeof(set[0]),
timeout ? (timeout->tv_sec * 1000 +
timeout->tv_nsec / 1000 / 1000) : INFTIM)) < 0) {
/* EINTR would occur if a signal was delivered */
if (errno != EINTR)
syslog(LOG_ERR, "poll() failed: %s",
strerror(errno));
continue;
}
if (i == 0) /* timeout */
continue;
if (rtsock.si_fd != -1 && set[PFD_RTSOCK].revents & POLLIN)
rtmsg_input(&rtsock);
if (set[PFD_RAWSOCK].revents & POLLIN)
rtadvd_input(&sock);
if (set[PFD_CSOCK].revents & POLLIN) {
int fd;
fd = csock_accept(&ctrlsock);
if (fd == -1)
syslog(LOG_ERR,
"cannot accept() control socket: %s",
strerror(errno));
else {
cm_handler_server(fd);
close(fd);
}
}
}
exit(0); /* NOTREACHED */
}
static void
rtadvd_shutdown(void)
{
struct ifinfo *ifi;
struct rainfo *rai;
struct rdnss *rdn;
struct dnssl *dns;
if (wait_shutdown) {
syslog(LOG_INFO,
"waiting expiration of the all RA timers.");
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
/*
* Ignore !IFF_UP interfaces in waiting for shutdown.
*/
if (!(ifi->ifi_flags & IFF_UP) &&
ifi->ifi_ra_timer != NULL) {
ifi->ifi_state = IFI_STATE_UNCONFIGURED;
rtadvd_remove_timer(ifi->ifi_ra_timer);
ifi->ifi_ra_timer = NULL;
syslog(LOG_DEBUG, "<%s> %s(idx=%d) is down. "
"Timer removed and marked as UNCONFIGURED.",
__func__, ifi->ifi_ifname,
ifi->ifi_ifindex);
}
}
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
if (ifi->ifi_ra_timer != NULL)
break;
}
if (ifi == NULL) {
syslog(LOG_NOTICE, "gracefully terminated.");
exit(0);
}
sleep(1);
return;
}
syslog(LOG_DEBUG, "<%s> cease to be an advertising router",
__func__);
wait_shutdown = 1;
TAILQ_FOREACH(rai, &railist, rai_next) {
rai->rai_lifetime = 0;
TAILQ_FOREACH(rdn, &rai->rai_rdnss, rd_next)
rdn->rd_ltime = 0;
TAILQ_FOREACH(dns, &rai->rai_dnssl, dn_next)
dns->dn_ltime = 0;
}
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
if (!ifi->ifi_persist)
continue;
if (ifi->ifi_state == IFI_STATE_UNCONFIGURED)
continue;
if (ifi->ifi_ra_timer == NULL)
continue;
if (ifi->ifi_ra_lastsent.tv_sec == 0 &&
ifi->ifi_ra_lastsent.tv_nsec == 0 &&
ifi->ifi_ra_timer != NULL) {
/*
* When RA configured but never sent,
* ignore the IF immediately.
*/
rtadvd_remove_timer(ifi->ifi_ra_timer);
ifi->ifi_ra_timer = NULL;
ifi->ifi_state = IFI_STATE_UNCONFIGURED;
continue;
}
ifi->ifi_state = IFI_STATE_TRANSITIVE;
/* Mark as the shut-down state. */
ifi->ifi_rainfo_trans = ifi->ifi_rainfo;
ifi->ifi_rainfo = NULL;
ifi->ifi_burstcount = MAX_FINAL_RTR_ADVERTISEMENTS;
ifi->ifi_burstinterval = MIN_DELAY_BETWEEN_RAS;
ra_timer_update(ifi, &ifi->ifi_ra_timer->rat_tm);
rtadvd_set_timer(&ifi->ifi_ra_timer->rat_tm,
ifi->ifi_ra_timer);
}
syslog(LOG_NOTICE, "final RA transmission started.");
pidfile_remove(pfh);
csock_close(&ctrlsock);
}
static void
rtmsg_input(struct sockinfo *s)
{
int n, type, ifindex = 0, plen;
size_t len;
char msg[2048], *next, *lim;
char ifname[IFNAMSIZ];
struct if_announcemsghdr *ifan;
struct rt_msghdr *rtm;
struct prefix *pfx;
struct rainfo *rai;
struct in6_addr *addr;
struct ifinfo *ifi;
char addrbuf[INET6_ADDRSTRLEN];
int prefixchange = 0;
if (s == NULL) {
syslog(LOG_ERR, "<%s> internal error", __func__);
exit(1);
}
n = read(s->si_fd, msg, sizeof(msg));
rtm = (struct rt_msghdr *)msg;
syslog(LOG_DEBUG, "<%s> received a routing message "
"(type = %d, len = %d)", __func__, rtm->rtm_type, n);
if (n > rtm->rtm_msglen) {
/*
* This usually won't happen for messages received on
* a routing socket.
*/
syslog(LOG_DEBUG,
"<%s> received data length is larger than "
"1st routing message len. multiple messages? "
"read %d bytes, but 1st msg len = %d",
__func__, n, rtm->rtm_msglen);
#if 0
/* adjust length */
n = rtm->rtm_msglen;
#endif
}
lim = msg + n;
for (next = msg; next < lim; next += len) {
int oldifflags;
next = get_next_msg(next, lim, 0, &len,
RTADV_TYPE2BITMASK(RTM_ADD) |
RTADV_TYPE2BITMASK(RTM_DELETE) |
RTADV_TYPE2BITMASK(RTM_NEWADDR) |
RTADV_TYPE2BITMASK(RTM_DELADDR) |
RTADV_TYPE2BITMASK(RTM_IFINFO) |
RTADV_TYPE2BITMASK(RTM_IFANNOUNCE));
if (len == 0)
break;
type = ((struct rt_msghdr *)next)->rtm_type;
switch (type) {
case RTM_ADD:
case RTM_DELETE:
ifindex = get_rtm_ifindex(next);
break;
case RTM_NEWADDR:
case RTM_DELADDR:
ifindex = (int)((struct ifa_msghdr *)next)->ifam_index;
break;
case RTM_IFINFO:
ifindex = (int)((struct if_msghdr *)next)->ifm_index;
break;
case RTM_IFANNOUNCE:
ifan = (struct if_announcemsghdr *)next;
switch (ifan->ifan_what) {
case IFAN_ARRIVAL:
case IFAN_DEPARTURE:
break;
default:
syslog(LOG_DEBUG,
"<%s:%d> unknown ifan msg (ifan_what=%d)",
__func__, __LINE__, ifan->ifan_what);
continue;
}
syslog(LOG_DEBUG, "<%s>: if_announcemsg (idx=%d:%d)",
__func__, ifan->ifan_index, ifan->ifan_what);
switch (ifan->ifan_what) {
case IFAN_ARRIVAL:
syslog(LOG_NOTICE,
"interface added (idx=%d)",
ifan->ifan_index);
update_ifinfo(&ifilist, ifan->ifan_index);
loadconfig_index(ifan->ifan_index);
break;
case IFAN_DEPARTURE:
syslog(LOG_NOTICE,
"interface removed (idx=%d)",
ifan->ifan_index);
rm_ifinfo_index(ifan->ifan_index);
/* Clear ifi_ifindex */
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
if (ifi->ifi_ifindex
== ifan->ifan_index) {
ifi->ifi_ifindex = 0;
break;
}
}
update_ifinfo(&ifilist, ifan->ifan_index);
break;
}
continue;
default:
/* should not reach here */
syslog(LOG_DEBUG,
"<%s:%d> unknown rtmsg %d on %s",
__func__, __LINE__, type,
if_indextoname(ifindex, ifname));
continue;
}
ifi = if_indextoifinfo(ifindex);
if (ifi == NULL) {
syslog(LOG_DEBUG,
"<%s> ifinfo not found for idx=%d. Why?",
__func__, ifindex);
continue;
}
rai = ifi->ifi_rainfo;
if (rai == NULL) {
syslog(LOG_DEBUG,
"<%s> route changed on "
"non advertising interface(%s)",
__func__, ifi->ifi_ifname);
continue;
}
oldifflags = ifi->ifi_flags;
/* init ifflags because it may have changed */
update_ifinfo(&ifilist, ifindex);
switch (type) {
case RTM_ADD:
if (sflag)
break; /* we aren't interested in prefixes */
addr = get_addr(msg);
plen = get_prefixlen(msg);
/* sanity check for plen */
/* as RFC2373, prefixlen is at least 4 */
if (plen < 4 || plen > 127) {
syslog(LOG_INFO, "<%s> new interface route's"
"plen %d is invalid for a prefix",
__func__, plen);
break;
}
pfx = find_prefix(rai, addr, plen);
if (pfx) {
if (pfx->pfx_timer) {
/*
* If the prefix has been invalidated,
* make it available again.
*/
update_prefix(pfx);
prefixchange = 1;
} else
syslog(LOG_DEBUG,
"<%s> new prefix(%s/%d) "
"added on %s, "
"but it was already in list",
__func__,
inet_ntop(AF_INET6, addr,
(char *)addrbuf,
sizeof(addrbuf)),
plen, ifi->ifi_ifname);
break;
}
make_prefix(rai, ifindex, addr, plen);
prefixchange = 1;
break;
case RTM_DELETE:
if (sflag)
break;
addr = get_addr(msg);
plen = get_prefixlen(msg);
/* sanity check for plen */
/* as RFC2373, prefixlen is at least 4 */
if (plen < 4 || plen > 127) {
syslog(LOG_INFO,
"<%s> deleted interface route's "
"plen %d is invalid for a prefix",
__func__, plen);
break;
}
pfx = find_prefix(rai, addr, plen);
if (pfx == NULL) {
syslog(LOG_DEBUG,
"<%s> prefix(%s/%d) was deleted on %s, "
"but it was not in list",
__func__, inet_ntop(AF_INET6, addr,
(char *)addrbuf, sizeof(addrbuf)),
plen, ifi->ifi_ifname);
break;
}
invalidate_prefix(pfx);
prefixchange = 1;
break;
case RTM_NEWADDR:
case RTM_DELADDR:
case RTM_IFINFO:
break;
default:
/* should not reach here */
syslog(LOG_DEBUG,
"<%s:%d> unknown rtmsg %d on %s",
__func__, __LINE__, type,
if_indextoname(ifindex, ifname));
return;
}
/* check if an interface flag is changed */
if ((oldifflags & IFF_UP) && /* UP to DOWN */
!(ifi->ifi_flags & IFF_UP)) {
syslog(LOG_NOTICE,
"<interface %s becomes down. stop timer.",
ifi->ifi_ifname);
rtadvd_remove_timer(ifi->ifi_ra_timer);
ifi->ifi_ra_timer = NULL;
} else if (!(oldifflags & IFF_UP) && /* DOWN to UP */
(ifi->ifi_flags & IFF_UP)) {
syslog(LOG_NOTICE,
"interface %s becomes up. restart timer.",
ifi->ifi_ifname);
ifi->ifi_state = IFI_STATE_TRANSITIVE;
ifi->ifi_burstcount =
MAX_INITIAL_RTR_ADVERTISEMENTS;
ifi->ifi_burstinterval =
MAX_INITIAL_RTR_ADVERT_INTERVAL;
ifi->ifi_ra_timer = rtadvd_add_timer(ra_timeout,
ra_timer_update, ifi, ifi);
ra_timer_update(ifi, &ifi->ifi_ra_timer->rat_tm);
rtadvd_set_timer(&ifi->ifi_ra_timer->rat_tm,
ifi->ifi_ra_timer);
} else if (prefixchange &&
(ifi->ifi_flags & IFF_UP)) {
/*
* An advertised prefix has been added or invalidated.
* Will notice the change in a short delay.
*/
set_short_delay(ifi);
}
}
return;
}
void
rtadvd_input(struct sockinfo *s)
{
ssize_t i;
int *hlimp = NULL;
#ifdef OLDRAWSOCKET
struct ip6_hdr *ip;
#endif
struct icmp6_hdr *icp;
int ifindex = 0;
struct cmsghdr *cm;
struct in6_pktinfo *pi = NULL;
char ntopbuf[INET6_ADDRSTRLEN], ifnamebuf[IFNAMSIZ];
struct in6_addr dst = in6addr_any;
struct ifinfo *ifi;
syslog(LOG_DEBUG, "<%s> enter", __func__);
if (s == NULL) {
syslog(LOG_ERR, "<%s> internal error", __func__);
exit(1);
}
/*
* Get message. We reset msg_controllen since the field could
* be modified if we had received a message before setting
* receive options.
*/
rcvmhdr.msg_controllen = rcvcmsgbuflen;
if ((i = recvmsg(s->si_fd, &rcvmhdr, 0)) < 0)
return;
/* extract optional information via Advanced API */
for (cm = (struct cmsghdr *)CMSG_FIRSTHDR(&rcvmhdr);
cm;
cm = (struct cmsghdr *)CMSG_NXTHDR(&rcvmhdr, cm)) {
if (cm->cmsg_level == IPPROTO_IPV6 &&
cm->cmsg_type == IPV6_PKTINFO &&
cm->cmsg_len == CMSG_LEN(sizeof(struct in6_pktinfo))) {
pi = (struct in6_pktinfo *)(CMSG_DATA(cm));
ifindex = pi->ipi6_ifindex;
dst = pi->ipi6_addr;
}
if (cm->cmsg_level == IPPROTO_IPV6 &&
cm->cmsg_type == IPV6_HOPLIMIT &&
cm->cmsg_len == CMSG_LEN(sizeof(int)))
hlimp = (int *)CMSG_DATA(cm);
}
if (ifindex == 0) {
syslog(LOG_ERR, "failed to get receiving interface");
return;
}
if (hlimp == NULL) {
syslog(LOG_ERR, "failed to get receiving hop limit");
return;
}
/*
* If we happen to receive data on an interface which is now gone
* or down, just discard the data.
*/
ifi = if_indextoifinfo(pi->ipi6_ifindex);
if (ifi == NULL || !(ifi->ifi_flags & IFF_UP)) {
syslog(LOG_INFO,
"<%s> received data on a disabled interface (%s)",
__func__,
(ifi == NULL) ? "[gone]" : ifi->ifi_ifname);
return;
}
#ifdef OLDRAWSOCKET
if ((size_t)i < sizeof(struct ip6_hdr) + sizeof(struct icmp6_hdr)) {
syslog(LOG_ERR,
"packet size(%d) is too short", i);
return;
}
ip = (struct ip6_hdr *)rcvmhdr.msg_iov[0].iov_base;
icp = (struct icmp6_hdr *)(ip + 1); /* XXX: ext. hdr? */
#else
if ((size_t)i < sizeof(struct icmp6_hdr)) {
syslog(LOG_ERR, "packet size(%zd) is too short", i);
return;
}
icp = (struct icmp6_hdr *)rcvmhdr.msg_iov[0].iov_base;
#endif
switch (icp->icmp6_type) {
case ND_ROUTER_SOLICIT:
/*
* Message verification - RFC 4861 6.1.1
* XXX: these checks must be done in the kernel as well,
* but we can't completely rely on them.
*/
if (*hlimp != 255) {
syslog(LOG_NOTICE,
"RS with invalid hop limit(%d) "
"received from %s on %s",
*hlimp,
inet_ntop(AF_INET6, &rcvfrom.sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
if (icp->icmp6_code) {
syslog(LOG_NOTICE,
"RS with invalid ICMP6 code(%d) "
"received from %s on %s",
icp->icmp6_code,
inet_ntop(AF_INET6, &rcvfrom.sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
if ((size_t)i < sizeof(struct nd_router_solicit)) {
syslog(LOG_NOTICE,
"RS from %s on %s does not have enough "
"length (len = %zd)",
inet_ntop(AF_INET6, &rcvfrom.sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf), i);
return;
}
rs_input(i, (struct nd_router_solicit *)icp, pi, &rcvfrom);
break;
case ND_ROUTER_ADVERT:
/*
* Message verification - RFC 4861 6.1.2
* XXX: there's the same dilemma as above...
*/
if (!IN6_IS_ADDR_LINKLOCAL(&rcvfrom.sin6_addr)) {
syslog(LOG_NOTICE,
"RA with non-linklocal source address "
"received from %s on %s",
inet_ntop(AF_INET6, &rcvfrom.sin6_addr,
ntopbuf, sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
if (*hlimp != 255) {
syslog(LOG_NOTICE,
"RA with invalid hop limit(%d) "
"received from %s on %s",
*hlimp,
inet_ntop(AF_INET6, &rcvfrom.sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
if (icp->icmp6_code) {
syslog(LOG_NOTICE,
"RA with invalid ICMP6 code(%d) "
"received from %s on %s",
icp->icmp6_code,
inet_ntop(AF_INET6, &rcvfrom.sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
if ((size_t)i < sizeof(struct nd_router_advert)) {
syslog(LOG_NOTICE,
"RA from %s on %s does not have enough "
"length (len = %zd)",
inet_ntop(AF_INET6, &rcvfrom.sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf), i);
return;
}
ra_input(i, (struct nd_router_advert *)icp, pi, &rcvfrom);
break;
case ICMP6_ROUTER_RENUMBERING:
if (mcastif == NULL) {
syslog(LOG_ERR, "received a router renumbering "
"message, but not allowed to be accepted");
break;
}
rr_input(i, (struct icmp6_router_renum *)icp, pi, &rcvfrom,
&dst);
break;
default:
/*
* Note that this case is POSSIBLE, especially just
* after invocation of the daemon. This is because we
* could receive message after opening the socket and
* before setting ICMP6 type filter(see sock_open()).
*/
syslog(LOG_ERR, "invalid icmp type(%d)", icp->icmp6_type);
return;
}
return;
}
static void
rs_input(int len, struct nd_router_solicit *rs,
struct in6_pktinfo *pi, struct sockaddr_in6 *from)
{
char ntopbuf[INET6_ADDRSTRLEN];
char ifnamebuf[IFNAMSIZ];
union nd_opt ndopts;
struct rainfo *rai;
struct ifinfo *ifi;
struct soliciter *sol;
syslog(LOG_DEBUG,
"<%s> RS received from %s on %s",
__func__,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf, sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
/* ND option check */
memset(&ndopts, 0, sizeof(ndopts));
TAILQ_INIT(&ndopts.opt_list);
if (nd6_options((struct nd_opt_hdr *)(rs + 1),
len - sizeof(struct nd_router_solicit),
&ndopts, NDOPT_FLAG_SRCLINKADDR)) {
syslog(LOG_INFO,
"<%s> ND option check failed for an RS from %s on %s",
__func__,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
return;
}
/*
* If the IP source address is the unspecified address, there
* must be no source link-layer address option in the message.
* (RFC 4861 6.1.1)
*/
if (IN6_IS_ADDR_UNSPECIFIED(&from->sin6_addr) &&
ndopts.opt_src_lladdr) {
syslog(LOG_INFO,
"<%s> RS from unspecified src on %s has a link-layer"
" address option",
__func__, if_indextoname(pi->ipi6_ifindex, ifnamebuf));
goto done;
}
ifi = if_indextoifinfo(pi->ipi6_ifindex);
if (ifi == NULL) {
syslog(LOG_INFO,
"<%s> if (idx=%d) not found. Why?",
__func__, pi->ipi6_ifindex);
goto done;
}
rai = ifi->ifi_rainfo;
if (rai == NULL) {
syslog(LOG_INFO,
"<%s> RS received on non advertising interface(%s)",
__func__,
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
goto done;
}
rai->rai_ifinfo->ifi_rsinput++;
/*
* Decide whether to send RA according to the rate-limit
* consideration.
*/
/* record sockaddr waiting for RA, if possible */
sol = (struct soliciter *)malloc(sizeof(*sol));
if (sol) {
sol->sol_addr = *from;
/* XXX RFC 2553 need clarification on flowinfo */
sol->sol_addr.sin6_flowinfo = 0;
TAILQ_INSERT_TAIL(&rai->rai_soliciter, sol, sol_next);
}
/*
* If there is already a waiting RS packet, don't
* update the timer.
*/
if (ifi->ifi_rs_waitcount++)
goto done;
set_short_delay(ifi);
done:
free_ndopts(&ndopts);
return;
}
static void
set_short_delay(struct ifinfo *ifi)
{
long delay; /* must not be greater than 1000000 */
struct timespec interval, now, min_delay, tm_tmp, *rest;
if (ifi->ifi_ra_timer == NULL)
return;
/*
* Compute a random delay. If the computed value
* corresponds to a time later than the time the next
* multicast RA is scheduled to be sent, ignore the random
* delay and send the advertisement at the
* already-scheduled time. RFC 4861 6.2.6
*/
delay = arc4random_uniform(MAX_RA_DELAY_TIME);
interval.tv_sec = 0;
interval.tv_nsec = delay * 1000;
rest = rtadvd_timer_rest(ifi->ifi_ra_timer);
if (TS_CMP(rest, &interval, <)) {
syslog(LOG_DEBUG, "<%s> random delay is larger than "
"the rest of the current timer", __func__);
interval = *rest;
}
/*
* If we sent a multicast Router Advertisement within
* the last MIN_DELAY_BETWEEN_RAS seconds, schedule
* the advertisement to be sent at a time corresponding to
* MIN_DELAY_BETWEEN_RAS plus the random value after the
* previous advertisement was sent.
*/
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
TS_SUB(&now, &ifi->ifi_ra_lastsent, &tm_tmp);
min_delay.tv_sec = MIN_DELAY_BETWEEN_RAS;
min_delay.tv_nsec = 0;
if (TS_CMP(&tm_tmp, &min_delay, <)) {
TS_SUB(&min_delay, &tm_tmp, &min_delay);
TS_ADD(&min_delay, &interval, &interval);
}
rtadvd_set_timer(&interval, ifi->ifi_ra_timer);
}
static int
check_accept_rtadv(int idx)
{
struct ifinfo *ifi;
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
if (ifi->ifi_ifindex == idx)
break;
}
if (ifi == NULL) {
syslog(LOG_DEBUG,
"<%s> if (idx=%d) not found. Why?",
__func__, idx);
return (0);
}
/*
* RA_RECV: ND6_IFF_ACCEPT_RTADV
* RA_SEND: ip6.forwarding
*/
if (update_ifinfo_nd_flags(ifi) != 0) {
syslog(LOG_ERR, "cannot get nd6 flags (idx=%d)", idx);
return (0);
}
return (ifi->ifi_nd_flags & ND6_IFF_ACCEPT_RTADV);
}
static void
ra_input(int len, struct nd_router_advert *nra,
struct in6_pktinfo *pi, struct sockaddr_in6 *from)
{
struct rainfo *rai;
struct ifinfo *ifi;
char ntopbuf[INET6_ADDRSTRLEN];
char ifnamebuf[IFNAMSIZ];
union nd_opt ndopts;
const char *on_off[] = {"OFF", "ON"};
uint32_t reachabletime, retranstimer, mtu;
int inconsistent = 0;
int error;
syslog(LOG_DEBUG, "<%s> RA received from %s on %s", __func__,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf, sizeof(ntopbuf)),
if_indextoname(pi->ipi6_ifindex, ifnamebuf));
/* ND option check */
memset(&ndopts, 0, sizeof(ndopts));
TAILQ_INIT(&ndopts.opt_list);
error = nd6_options((struct nd_opt_hdr *)(nra + 1),
len - sizeof(struct nd_router_advert), &ndopts,
NDOPT_FLAG_SRCLINKADDR | NDOPT_FLAG_PREFIXINFO | NDOPT_FLAG_MTU |
NDOPT_FLAG_RDNSS | NDOPT_FLAG_DNSSL);
if (error) {
syslog(LOG_INFO,
"<%s> ND option check failed for an RA from %s on %s",
__func__,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), if_indextoname(pi->ipi6_ifindex,
ifnamebuf));
return;
}
/*
* RA consistency check according to RFC 4861 6.2.7
*/
ifi = if_indextoifinfo(pi->ipi6_ifindex);
if (ifi->ifi_rainfo == NULL) {
syslog(LOG_INFO,
"<%s> received RA from %s on non-advertising"
" interface(%s)",
__func__,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), if_indextoname(pi->ipi6_ifindex,
ifnamebuf));
goto done;
}
rai = ifi->ifi_rainfo;
ifi->ifi_rainput++;
syslog(LOG_DEBUG, "<%s> ifi->ifi_rainput = %" PRIu64, __func__,
ifi->ifi_rainput);
/* Cur Hop Limit value */
if (nra->nd_ra_curhoplimit && rai->rai_hoplimit &&
nra->nd_ra_curhoplimit != rai->rai_hoplimit) {
syslog(LOG_NOTICE,
"CurHopLimit inconsistent on %s:"
" %d from %s, %d from us",
ifi->ifi_ifname, nra->nd_ra_curhoplimit,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), rai->rai_hoplimit);
inconsistent++;
}
/* M flag */
if ((nra->nd_ra_flags_reserved & ND_RA_FLAG_MANAGED) !=
rai->rai_managedflg) {
syslog(LOG_NOTICE,
"M flag inconsistent on %s:"
" %s from %s, %s from us",
ifi->ifi_ifname, on_off[!rai->rai_managedflg],
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), on_off[rai->rai_managedflg]);
inconsistent++;
}
/* O flag */
if ((nra->nd_ra_flags_reserved & ND_RA_FLAG_OTHER) !=
rai->rai_otherflg) {
syslog(LOG_NOTICE,
"O flag inconsistent on %s:"
" %s from %s, %s from us",
ifi->ifi_ifname, on_off[!rai->rai_otherflg],
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), on_off[rai->rai_otherflg]);
inconsistent++;
}
#ifdef DRAFT_IETF_6MAN_IPV6ONLY_FLAG
/* S "IPv6-Only" (Six, Silence-IPv4) flag */
if ((nra->nd_ra_flags_reserved & ND_RA_FLAG_IPV6_ONLY) !=
rai->rai_ipv6onlyflg) {
syslog(LOG_NOTICE,
"S flag inconsistent on %s:"
" %s from %s, %s from us",
ifi->ifi_ifname, on_off[!rai->rai_ipv6onlyflg],
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), on_off[rai->rai_ipv6onlyflg]);
inconsistent++;
}
#endif
/* Reachable Time */
reachabletime = ntohl(nra->nd_ra_reachable);
if (reachabletime && rai->rai_reachabletime &&
reachabletime != rai->rai_reachabletime) {
syslog(LOG_NOTICE,
"ReachableTime inconsistent on %s:"
" %d from %s, %d from us",
ifi->ifi_ifname, reachabletime,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), rai->rai_reachabletime);
inconsistent++;
}
/* Retrans Timer */
retranstimer = ntohl(nra->nd_ra_retransmit);
if (retranstimer && rai->rai_retranstimer &&
retranstimer != rai->rai_retranstimer) {
syslog(LOG_NOTICE,
"RetranceTimer inconsistent on %s:"
" %d from %s, %d from us",
ifi->ifi_ifname, retranstimer,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), rai->rai_retranstimer);
inconsistent++;
}
/* Values in the MTU options */
if (ndopts.opt_mtu) {
mtu = ntohl(ndopts.opt_mtu->nd_opt_mtu_mtu);
if (mtu && rai->rai_linkmtu && mtu != rai->rai_linkmtu) {
syslog(LOG_NOTICE,
"MTU option value inconsistent on %s:"
" %d from %s, %d from us",
ifi->ifi_ifname, mtu,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), rai->rai_linkmtu);
inconsistent++;
}
}
/* Preferred and Valid Lifetimes for prefixes */
{
struct nd_optlist *nol;
if (ndopts.opt_pi)
if (prefix_check(ndopts.opt_pi, rai, from))
inconsistent++;
TAILQ_FOREACH(nol, &ndopts.opt_list, nol_next)
if (prefix_check((struct nd_opt_prefix_info *)nol->nol_opt,
rai, from))
inconsistent++;
}
if (inconsistent)
ifi->ifi_rainconsistent++;
done:
free_ndopts(&ndopts);
return;
}
static uint32_t
udiff(uint32_t u, uint32_t v)
{
return (u >= v ? u - v : v - u);
}
/* return a non-zero value if the received prefix is inconsistent with ours */
static int
prefix_check(struct nd_opt_prefix_info *pinfo,
struct rainfo *rai, struct sockaddr_in6 *from)
{
struct ifinfo *ifi;
uint32_t preferred_time, valid_time;
struct prefix *pfx;
int inconsistent = 0;
char ntopbuf[INET6_ADDRSTRLEN];
char prefixbuf[INET6_ADDRSTRLEN];
struct timespec now;
#if 0 /* impossible */
if (pinfo->nd_opt_pi_type != ND_OPT_PREFIX_INFORMATION)
return (0);
#endif
ifi = rai->rai_ifinfo;
/*
* log if the adveritsed prefix has link-local scope(sanity check?)
*/
if (IN6_IS_ADDR_LINKLOCAL(&pinfo->nd_opt_pi_prefix))
syslog(LOG_INFO,
"<%s> link-local prefix %s/%d is advertised "
"from %s on %s",
__func__,
inet_ntop(AF_INET6, &pinfo->nd_opt_pi_prefix, prefixbuf,
sizeof(prefixbuf)),
pinfo->nd_opt_pi_prefix_len,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), ifi->ifi_ifname);
if ((pfx = find_prefix(rai, &pinfo->nd_opt_pi_prefix,
pinfo->nd_opt_pi_prefix_len)) == NULL) {
syslog(LOG_INFO,
"<%s> prefix %s/%d from %s on %s is not in our list",
__func__,
inet_ntop(AF_INET6, &pinfo->nd_opt_pi_prefix, prefixbuf,
sizeof(prefixbuf)),
pinfo->nd_opt_pi_prefix_len,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), ifi->ifi_ifname);
return (0);
}
preferred_time = ntohl(pinfo->nd_opt_pi_preferred_time);
if (pfx->pfx_pltimeexpire) {
/*
* The lifetime is decremented in real time, so we should
* compare the expiration time.
* (RFC 2461 Section 6.2.7.)
* XXX: can we really expect that all routers on the link
* have synchronized clocks?
*/
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
preferred_time += now.tv_sec;
if (!pfx->pfx_timer && rai->rai_clockskew &&
udiff(preferred_time, pfx->pfx_pltimeexpire) > rai->rai_clockskew) {
syslog(LOG_INFO,
"<%s> preferred lifetime for %s/%d"
" (decr. in real time) inconsistent on %s:"
" %" PRIu32 " from %s, %" PRIu32 " from us",
__func__,
inet_ntop(AF_INET6, &pinfo->nd_opt_pi_prefix, prefixbuf,
sizeof(prefixbuf)),
pinfo->nd_opt_pi_prefix_len,
ifi->ifi_ifname, preferred_time,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), pfx->pfx_pltimeexpire);
inconsistent++;
}
} else if (!pfx->pfx_timer && preferred_time != pfx->pfx_preflifetime)
syslog(LOG_INFO,
"<%s> preferred lifetime for %s/%d"
" inconsistent on %s:"
" %d from %s, %d from us",
__func__,
inet_ntop(AF_INET6, &pinfo->nd_opt_pi_prefix, prefixbuf,
sizeof(prefixbuf)),
pinfo->nd_opt_pi_prefix_len,
ifi->ifi_ifname, preferred_time,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), pfx->pfx_preflifetime);
valid_time = ntohl(pinfo->nd_opt_pi_valid_time);
if (pfx->pfx_vltimeexpire) {
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
valid_time += now.tv_sec;
if (!pfx->pfx_timer && rai->rai_clockskew &&
udiff(valid_time, pfx->pfx_vltimeexpire) > rai->rai_clockskew) {
syslog(LOG_INFO,
"<%s> valid lifetime for %s/%d"
" (decr. in real time) inconsistent on %s:"
" %d from %s, %" PRIu32 " from us",
__func__,
inet_ntop(AF_INET6, &pinfo->nd_opt_pi_prefix, prefixbuf,
sizeof(prefixbuf)),
pinfo->nd_opt_pi_prefix_len,
ifi->ifi_ifname, preferred_time,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), pfx->pfx_vltimeexpire);
inconsistent++;
}
} else if (!pfx->pfx_timer && valid_time != pfx->pfx_validlifetime) {
syslog(LOG_INFO,
"<%s> valid lifetime for %s/%d"
" inconsistent on %s:"
" %d from %s, %d from us",
__func__,
inet_ntop(AF_INET6, &pinfo->nd_opt_pi_prefix, prefixbuf,
sizeof(prefixbuf)),
pinfo->nd_opt_pi_prefix_len,
ifi->ifi_ifname, valid_time,
inet_ntop(AF_INET6, &from->sin6_addr, ntopbuf,
sizeof(ntopbuf)), pfx->pfx_validlifetime);
inconsistent++;
}
return (inconsistent);
}
struct prefix *
find_prefix(struct rainfo *rai, struct in6_addr *prefix, int plen)
{
struct prefix *pfx;
int bytelen, bitlen;
char bitmask;
TAILQ_FOREACH(pfx, &rai->rai_prefix, pfx_next) {
if (plen != pfx->pfx_prefixlen)
continue;
bytelen = plen / 8;
bitlen = plen % 8;
bitmask = 0xff << (8 - bitlen);
if (memcmp((void *)prefix, (void *)&pfx->pfx_prefix, bytelen))
continue;
if (bitlen == 0 ||
((prefix->s6_addr[bytelen] & bitmask) ==
(pfx->pfx_prefix.s6_addr[bytelen] & bitmask))) {
return (pfx);
}
}
return (NULL);
}
/* check if p0/plen0 matches p1/plen1; return 1 if matches, otherwise 0. */
int
prefix_match(struct in6_addr *p0, int plen0,
struct in6_addr *p1, int plen1)
{
int bytelen, bitlen;
char bitmask;
if (plen0 < plen1)
return (0);
bytelen = plen1 / 8;
bitlen = plen1 % 8;
bitmask = 0xff << (8 - bitlen);
if (memcmp((void *)p0, (void *)p1, bytelen))
return (0);
if (bitlen == 0 ||
((p0->s6_addr[bytelen] & bitmask) ==
(p1->s6_addr[bytelen] & bitmask))) {
return (1);
}
return (0);
}
static int
nd6_options(struct nd_opt_hdr *hdr, int limit,
union nd_opt *ndopts, uint32_t optflags)
{
int optlen = 0;
for (; limit > 0; limit -= optlen) {
if ((size_t)limit < sizeof(struct nd_opt_hdr)) {
syslog(LOG_INFO, "<%s> short option header", __func__);
goto bad;
}
hdr = (struct nd_opt_hdr *)((caddr_t)hdr + optlen);
if (hdr->nd_opt_len == 0) {
syslog(LOG_INFO,
"<%s> bad ND option length(0) (type = %d)",
__func__, hdr->nd_opt_type);
goto bad;
}
optlen = hdr->nd_opt_len << 3;
if (optlen > limit) {
syslog(LOG_INFO, "<%s> short option", __func__);
goto bad;
}
if (hdr->nd_opt_type > ND_OPT_MTU &&
hdr->nd_opt_type != ND_OPT_RDNSS &&
hdr->nd_opt_type != ND_OPT_DNSSL) {
syslog(LOG_INFO, "<%s> unknown ND option(type %d)",
__func__, hdr->nd_opt_type);
continue;
}
if ((ndopt_flags[hdr->nd_opt_type] & optflags) == 0) {
syslog(LOG_INFO, "<%s> unexpected ND option(type %d)",
__func__, hdr->nd_opt_type);
continue;
}
/*
* Option length check. Do it here for all fixed-length
* options.
*/
switch (hdr->nd_opt_type) {
case ND_OPT_MTU:
if (optlen == sizeof(struct nd_opt_mtu))
break;
goto skip;
case ND_OPT_RDNSS:
if (optlen >= 24 &&
(optlen - sizeof(struct nd_opt_rdnss)) % 16 == 0)
break;
goto skip;
case ND_OPT_DNSSL:
if (optlen >= 16 &&
(optlen - sizeof(struct nd_opt_dnssl)) % 8 == 0)
break;
goto skip;
case ND_OPT_PREFIX_INFORMATION:
if (optlen == sizeof(struct nd_opt_prefix_info))
break;
skip:
syslog(LOG_INFO, "<%s> invalid option length",
__func__);
continue;
}
switch (hdr->nd_opt_type) {
case ND_OPT_TARGET_LINKADDR:
case ND_OPT_REDIRECTED_HEADER:
case ND_OPT_RDNSS:
case ND_OPT_DNSSL:
break; /* we don't care about these options */
case ND_OPT_SOURCE_LINKADDR:
case ND_OPT_MTU:
if (ndopts->opt_array[hdr->nd_opt_type]) {
syslog(LOG_INFO,
"<%s> duplicated ND option (type = %d)",
__func__, hdr->nd_opt_type);
}
ndopts->opt_array[hdr->nd_opt_type] = hdr;
break;
case ND_OPT_PREFIX_INFORMATION:
{
struct nd_optlist *nol;
if (ndopts->opt_pi == 0) {
ndopts->opt_pi =
(struct nd_opt_prefix_info *)hdr;
continue;
}
nol = malloc(sizeof(*nol));
if (nol == NULL) {
syslog(LOG_ERR, "<%s> can't allocate memory",
__func__);
goto bad;
}
nol->nol_opt = hdr;
TAILQ_INSERT_TAIL(&(ndopts->opt_list), nol, nol_next);
break;
}
default: /* impossible */
break;
}
}
return (0);
bad:
free_ndopts(ndopts);
return (-1);
}
static void
free_ndopts(union nd_opt *ndopts)
{
struct nd_optlist *nol;
while ((nol = TAILQ_FIRST(&ndopts->opt_list)) != NULL) {
TAILQ_REMOVE(&ndopts->opt_list, nol, nol_next);
free(nol);
}
}
void
sock_open(struct sockinfo *s)
{
struct icmp6_filter filt;
int on;
/* XXX: should be max MTU attached to the node */
static char answer[1500];
syslog(LOG_DEBUG, "<%s> enter", __func__);
if (s == NULL) {
syslog(LOG_ERR, "<%s> internal error", __func__);
exit(1);
}
rcvcmsgbuflen = CMSG_SPACE(sizeof(struct in6_pktinfo)) +
CMSG_SPACE(sizeof(int));
rcvcmsgbuf = (char *)malloc(rcvcmsgbuflen);
if (rcvcmsgbuf == NULL) {
syslog(LOG_ERR, "<%s> not enough core", __func__);
exit(1);
}
sndcmsgbuflen = CMSG_SPACE(sizeof(struct in6_pktinfo)) +
CMSG_SPACE(sizeof(int));
sndcmsgbuf = (char *)malloc(sndcmsgbuflen);
if (sndcmsgbuf == NULL) {
syslog(LOG_ERR, "<%s> not enough core", __func__);
exit(1);
}
if ((s->si_fd = socket(AF_INET6, SOCK_RAW, IPPROTO_ICMPV6)) < 0) {
syslog(LOG_ERR, "<%s> socket: %s", __func__, strerror(errno));
exit(1);
}
/* specify to tell receiving interface */
on = 1;
if (setsockopt(s->si_fd, IPPROTO_IPV6, IPV6_RECVPKTINFO, &on,
sizeof(on)) < 0) {
syslog(LOG_ERR, "<%s> IPV6_RECVPKTINFO: %s", __func__,
strerror(errno));
exit(1);
}
on = 1;
/* specify to tell value of hoplimit field of received IP6 hdr */
if (setsockopt(s->si_fd, IPPROTO_IPV6, IPV6_RECVHOPLIMIT, &on,
sizeof(on)) < 0) {
syslog(LOG_ERR, "<%s> IPV6_RECVHOPLIMIT: %s", __func__,
strerror(errno));
exit(1);
}
ICMP6_FILTER_SETBLOCKALL(&filt);
ICMP6_FILTER_SETPASS(ND_ROUTER_SOLICIT, &filt);
ICMP6_FILTER_SETPASS(ND_ROUTER_ADVERT, &filt);
if (mcastif != NULL)
ICMP6_FILTER_SETPASS(ICMP6_ROUTER_RENUMBERING, &filt);
if (setsockopt(s->si_fd, IPPROTO_ICMPV6, ICMP6_FILTER, &filt,
sizeof(filt)) < 0) {
syslog(LOG_ERR, "<%s> IICMP6_FILTER: %s",
__func__, strerror(errno));
exit(1);
}
/* initialize msghdr for receiving packets */
rcviov[0].iov_base = (caddr_t)answer;
rcviov[0].iov_len = sizeof(answer);
rcvmhdr.msg_name = (caddr_t)&rcvfrom;
rcvmhdr.msg_namelen = sizeof(rcvfrom);
rcvmhdr.msg_iov = rcviov;
rcvmhdr.msg_iovlen = 1;
rcvmhdr.msg_control = (caddr_t) rcvcmsgbuf;
rcvmhdr.msg_controllen = rcvcmsgbuflen;
/* initialize msghdr for sending packets */
sndmhdr.msg_namelen = sizeof(struct sockaddr_in6);
sndmhdr.msg_iov = sndiov;
sndmhdr.msg_iovlen = 1;
sndmhdr.msg_control = (caddr_t)sndcmsgbuf;
sndmhdr.msg_controllen = sndcmsgbuflen;
return;
}
/* open a routing socket to watch the routing table */
static void
rtsock_open(struct sockinfo *s)
{
if (s == NULL) {
syslog(LOG_ERR, "<%s> internal error", __func__);
exit(1);
}
if ((s->si_fd = socket(PF_ROUTE, SOCK_RAW, 0)) < 0) {
syslog(LOG_ERR,
"<%s> socket: %s", __func__, strerror(errno));
exit(1);
}
}
struct ifinfo *
if_indextoifinfo(int idx)
{
struct ifinfo *ifi;
char *name, name0[IFNAMSIZ];
/* Check if the interface has a valid name or not. */
if (if_indextoname(idx, name0) == NULL)
return (NULL);
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
if (ifi->ifi_ifindex == idx)
return (ifi);
}
if (ifi != NULL)
syslog(LOG_DEBUG, "<%s> ifi found (idx=%d)",
__func__, idx);
else
syslog(LOG_DEBUG, "<%s> ifi not found (idx=%d)",
__func__, idx);
return (NULL); /* search failed */
}
void
ra_output(struct ifinfo *ifi)
{
int i;
struct cmsghdr *cm;
struct in6_pktinfo *pi;
struct soliciter *sol;
struct rainfo *rai;
switch (ifi->ifi_state) {
case IFI_STATE_CONFIGURED:
rai = ifi->ifi_rainfo;
break;
case IFI_STATE_TRANSITIVE:
rai = ifi->ifi_rainfo_trans;
break;
case IFI_STATE_UNCONFIGURED:
syslog(LOG_DEBUG, "<%s> %s is unconfigured. "
"Skip sending RAs.",
__func__, ifi->ifi_ifname);
return;
default:
rai = NULL;
}
if (rai == NULL) {
syslog(LOG_DEBUG, "<%s> rainfo is NULL on %s."
"Skip sending RAs.",
__func__, ifi->ifi_ifname);
return;
}
if (!(ifi->ifi_flags & IFF_UP)) {
syslog(LOG_DEBUG, "<%s> %s is not up. "
"Skip sending RAs.",
__func__, ifi->ifi_ifname);
return;
}
/*
* Check lifetime, ACCEPT_RTADV flag, and ip6.forwarding.
*
* (lifetime == 0) = output
* (lifetime != 0 && (check_accept_rtadv()) = no output
*
* Basically, hosts MUST NOT send Router Advertisement
* messages at any time (RFC 4861, Section 6.2.3). However, it
* would sometimes be useful to allow hosts to advertise some
* parameters such as prefix information and link MTU. Thus,
* we allow hosts to invoke rtadvd only when router lifetime
* (on every advertising interface) is explicitly set
* zero. (see also the above section)
*/
syslog(LOG_DEBUG,
"<%s> check lifetime=%d, ACCEPT_RTADV=%d, ip6.forwarding=%d "
"on %s", __func__,
rai->rai_lifetime,
check_accept_rtadv(ifi->ifi_ifindex),
getinet6sysctl(IPV6CTL_FORWARDING),
ifi->ifi_ifname);
if (rai->rai_lifetime != 0) {
if (getinet6sysctl(IPV6CTL_FORWARDING) == 0) {
syslog(LOG_ERR,
"non-zero lifetime RA "
"but net.inet6.ip6.forwarding=0. "
"Ignored.");
return;
}
if (check_accept_rtadv(ifi->ifi_ifindex)) {
syslog(LOG_ERR,
"non-zero lifetime RA "
"on RA receiving interface %s."
" Ignored.", ifi->ifi_ifname);
return;
}
}
make_packet(rai); /* XXX: inefficient */
sndmhdr.msg_name = (caddr_t)&sin6_linklocal_allnodes;
sndmhdr.msg_iov[0].iov_base = (caddr_t)rai->rai_ra_data;
sndmhdr.msg_iov[0].iov_len = rai->rai_ra_datalen;
cm = CMSG_FIRSTHDR(&sndmhdr);
/* specify the outgoing interface */
cm->cmsg_level = IPPROTO_IPV6;
cm->cmsg_type = IPV6_PKTINFO;
cm->cmsg_len = CMSG_LEN(sizeof(struct in6_pktinfo));
pi = (struct in6_pktinfo *)CMSG_DATA(cm);
memset(&pi->ipi6_addr, 0, sizeof(pi->ipi6_addr)); /*XXX*/
pi->ipi6_ifindex = ifi->ifi_ifindex;
/* specify the hop limit of the packet */
{
int hoplimit = 255;
cm = CMSG_NXTHDR(&sndmhdr, cm);
cm->cmsg_level = IPPROTO_IPV6;
cm->cmsg_type = IPV6_HOPLIMIT;
cm->cmsg_len = CMSG_LEN(sizeof(int));
memcpy(CMSG_DATA(cm), &hoplimit, sizeof(int));
}
syslog(LOG_DEBUG,
"<%s> send RA on %s, # of RS waitings = %d",
__func__, ifi->ifi_ifname, ifi->ifi_rs_waitcount);
i = sendmsg(sock.si_fd, &sndmhdr, 0);
if (i < 0 || (size_t)i != rai->rai_ra_datalen) {
if (i < 0) {
syslog(LOG_ERR, "<%s> sendmsg on %s: %s",
__func__, ifi->ifi_ifname,
strerror(errno));
}
}
/*
* unicast advertisements
* XXX commented out. reason: though spec does not forbit it, unicast
* advert does not really help
*/
while ((sol = TAILQ_FIRST(&rai->rai_soliciter)) != NULL) {
TAILQ_REMOVE(&rai->rai_soliciter, sol, sol_next);
free(sol);
}
/* update timestamp */
clock_gettime(CLOCK_MONOTONIC_FAST, &ifi->ifi_ra_lastsent);
/* update counter */
ifi->ifi_rs_waitcount = 0;
ifi->ifi_raoutput++;
switch (ifi->ifi_state) {
case IFI_STATE_CONFIGURED:
if (ifi->ifi_burstcount > 0)
ifi->ifi_burstcount--;
break;
case IFI_STATE_TRANSITIVE:
ifi->ifi_burstcount--;
if (ifi->ifi_burstcount == 0) {
if (ifi->ifi_rainfo == ifi->ifi_rainfo_trans) {
/* Initial burst finished. */
if (ifi->ifi_rainfo_trans != NULL)
ifi->ifi_rainfo_trans = NULL;
}
/* Remove burst RA information */
if (ifi->ifi_rainfo_trans != NULL) {
rm_rainfo(ifi->ifi_rainfo_trans);
ifi->ifi_rainfo_trans = NULL;
}
if (ifi->ifi_rainfo != NULL) {
/*
* TRANSITIVE -> CONFIGURED
*
* After initial burst or transition from
* one configuration to another,
* ifi_rainfo always points to the next RA
* information.
*/
ifi->ifi_state = IFI_STATE_CONFIGURED;
syslog(LOG_DEBUG,
"<%s> ifname=%s marked as "
"CONFIGURED.", __func__,
ifi->ifi_ifname);
} else {
/*
* TRANSITIVE -> UNCONFIGURED
*
* If ifi_rainfo points to NULL, this
* interface is shutting down.
*
*/
int error;
ifi->ifi_state = IFI_STATE_UNCONFIGURED;
syslog(LOG_DEBUG,
"<%s> ifname=%s marked as "
"UNCONFIGURED.", __func__,
ifi->ifi_ifname);
error = sock_mc_leave(&sock,
ifi->ifi_ifindex);
if (error)
exit(1);
}
}
break;
}
}
/* process RA timer */
struct rtadvd_timer *
ra_timeout(void *arg)
{
struct ifinfo *ifi;
ifi = (struct ifinfo *)arg;
syslog(LOG_DEBUG, "<%s> RA timer on %s is expired",
__func__, ifi->ifi_ifname);
ra_output(ifi);
return (ifi->ifi_ra_timer);
}
/* update RA timer */
void
ra_timer_update(void *arg, struct timespec *tm)
{
uint16_t interval;
struct rainfo *rai;
struct ifinfo *ifi;
ifi = (struct ifinfo *)arg;
rai = ifi->ifi_rainfo;
interval = 0;
switch (ifi->ifi_state) {
case IFI_STATE_UNCONFIGURED:
return;
break;
case IFI_STATE_CONFIGURED:
/*
* Whenever a multicast advertisement is sent from
* an interface, the timer is reset to a
* uniformly-distributed random value between the
* interface's configured MinRtrAdvInterval and
* MaxRtrAdvInterval (RFC4861 6.2.4).
*/
interval = rai->rai_mininterval;
interval += arc4random_uniform(rai->rai_maxinterval -
rai->rai_mininterval);
break;
case IFI_STATE_TRANSITIVE:
/*
* For the first few advertisements (up to
* MAX_INITIAL_RTR_ADVERTISEMENTS), if the randomly chosen
* interval is greater than
* MAX_INITIAL_RTR_ADVERT_INTERVAL, the timer SHOULD be
* set to MAX_INITIAL_RTR_ADVERT_INTERVAL instead. (RFC
* 4861 6.2.4)
*
* In such cases, the router SHOULD transmit one or more
* (but not more than MAX_FINAL_RTR_ADVERTISEMENTS) final
* multicast Router Advertisements on the interface with a
* Router Lifetime field of zero. (RFC 4861 6.2.5)
*/
interval = ifi->ifi_burstinterval;
break;
}
tm->tv_sec = interval;
tm->tv_nsec = 0;
syslog(LOG_DEBUG,
"<%s> RA timer on %s is set to %ld:%ld",
__func__, ifi->ifi_ifname,
(long int)tm->tv_sec, (long int)tm->tv_nsec / 1000);
return;
}
diff --git a/usr.sbin/rtadvd/rtadvd.h b/usr.sbin/rtadvd/rtadvd.h
index 885d2fbb3c80..eb7746733c6e 100644
--- a/usr.sbin/rtadvd/rtadvd.h
+++ b/usr.sbin/rtadvd/rtadvd.h
@@ -1,303 +1,302 @@
-/* $FreeBSD$ */
/* $KAME: rtadvd.h,v 1.26 2003/08/05 12:34:23 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* Copyright (C) 2011 Hiroki Sato <hrs@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#define ELM_MALLOC(p,error_action) \
do { \
p = malloc(sizeof(*p)); \
if (p == NULL) { \
syslog(LOG_ERR, "<%s> malloc failed: %s", \
__func__, strerror(errno)); \
error_action; \
} \
memset(p, 0, sizeof(*p)); \
} while(0)
#define IN6ADDR_LINKLOCAL_ALLNODES_INIT \
{{{ 0xff, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, \
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01 }}}
#define IN6ADDR_LINKLOCAL_ALLROUTERS_INIT \
{{{ 0xff, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, \
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02 }}}
#define IN6ADDR_SITELOCAL_ALLROUTERS_INIT \
{{{ 0xff, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, \
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02 }}}
extern struct sockaddr_in6 sin6_linklocal_allnodes;
extern struct sockaddr_in6 sin6_linklocal_allrouters;
extern struct sockaddr_in6 sin6_sitelocal_allrouters;
/*
* RFC 3542 API deprecates IPV6_PKTINFO in favor of
* IPV6_RECVPKTINFO
*/
#ifndef IPV6_RECVPKTINFO
#ifdef IPV6_PKTINFO
#define IPV6_RECVPKTINFO IPV6_PKTINFO
#endif
#endif
/*
* RFC 3542 API deprecates IPV6_HOPLIMIT in favor of
* IPV6_RECVHOPLIMIT
*/
#ifndef IPV6_RECVHOPLIMIT
#ifdef IPV6_HOPLIMIT
#define IPV6_RECVHOPLIMIT IPV6_HOPLIMIT
#endif
#endif
/* protocol constants and default values */
#define DEF_MAXRTRADVINTERVAL 600
#define DEF_ADVLINKMTU 0
#define DEF_ADVREACHABLETIME 0
#define DEF_ADVRETRANSTIMER 0
#define DEF_ADVCURHOPLIMIT 64
#define DEF_ADVVALIDLIFETIME 2592000
#define DEF_ADVPREFERREDLIFETIME 604800
#define MAXROUTERLIFETIME 9000
#define MIN_MAXINTERVAL 4
#define MAX_MAXINTERVAL 1800
#define MIN_MININTERVAL 3
#define MAXREACHABLETIME 3600000
#define MAX_INITIAL_RTR_ADVERT_INTERVAL 16
#define MAX_INITIAL_RTR_ADVERTISEMENTS 3
#define MAX_FINAL_RTR_ADVERTISEMENTS 3
#define MIN_DELAY_BETWEEN_RAS 3
#define MAX_RA_DELAY_TIME 500000 /* usec */
#define PREFIX_FROM_KERNEL 1
#define PREFIX_FROM_CONFIG 2
#define PREFIX_FROM_DYNAMIC 3
struct prefix {
TAILQ_ENTRY(prefix) pfx_next;
struct rainfo *pfx_rainfo; /* back pointer to the interface */
/*
* Expiration timer. This is used when a prefix derived from
* the kernel is deleted.
*/
struct rtadvd_timer *pfx_timer;
uint32_t pfx_validlifetime; /* AdvValidLifetime */
uint32_t pfx_vltimeexpire; /* Expiration of vltime */
uint32_t pfx_preflifetime; /* AdvPreferredLifetime */
uint32_t pfx_pltimeexpire; /* Expiration of pltime */
int pfx_onlinkflg; /* bool: AdvOnLinkFlag */
int pfx_autoconfflg; /* bool: AdvAutonomousFlag */
int pfx_prefixlen;
int pfx_origin; /* From kernel or config */
struct in6_addr pfx_prefix;
};
struct rtinfo {
TAILQ_ENTRY(rtinfo) rti_next;
uint32_t rti_ltime; /* route lifetime */
int rti_rtpref; /* route preference */
int rti_prefixlen;
struct in6_addr rti_prefix;
};
struct rdnss_addr {
TAILQ_ENTRY(rdnss_addr) ra_next;
struct in6_addr ra_dns; /* DNS server entry */
};
struct rdnss {
TAILQ_ENTRY(rdnss) rd_next;
TAILQ_HEAD(, rdnss_addr) rd_list; /* list of DNS servers */
uint32_t rd_ltime; /* number of seconds valid */
};
/*
* The maximum length of a domain name in a DNS search list is calculated
* by a domain name + length fields per 63 octets + a zero octet at
* the tail and adding 8 octet boundary padding.
*/
#define _DNAME_LABELENC_MAXLEN \
(NI_MAXHOST + (NI_MAXHOST / 64 + 1) + 1)
#define DNAME_LABELENC_MAXLEN \
(_DNAME_LABELENC_MAXLEN + 8 - _DNAME_LABELENC_MAXLEN % 8)
struct dnssl_addr {
TAILQ_ENTRY(dnssl_addr) da_next;
int da_len; /* length of entry */
char da_dom[DNAME_LABELENC_MAXLEN]; /* search domain name entry */
};
struct dnssl {
TAILQ_ENTRY(dnssl) dn_next;
TAILQ_HEAD(, dnssl_addr) dn_list; /* list of search domains */
uint32_t dn_ltime; /* number of seconds valid */
};
struct soliciter {
TAILQ_ENTRY(soliciter) sol_next;
struct sockaddr_in6 sol_addr;
};
struct rainfo {
/* pointer for list */
TAILQ_ENTRY(rainfo) rai_next;
/* interface information */
struct ifinfo *rai_ifinfo;
int rai_advlinkopt; /* bool: whether include link-layer addr opt */
int rai_advifprefix; /* bool: gather IF prefixes? */
/* Router configuration variables */
uint16_t rai_lifetime; /* AdvDefaultLifetime */
uint16_t rai_maxinterval; /* MaxRtrAdvInterval */
uint16_t rai_mininterval; /* MinRtrAdvInterval */
int rai_managedflg; /* AdvManagedFlag */
int rai_otherflg; /* AdvOtherConfigFlag */
#ifdef DRAFT_IETF_6MAN_IPV6ONLY_FLAG
int rai_ipv6onlyflg; /* AdvIPv6OnlyFlag */
#endif
int rai_rtpref; /* router preference */
uint32_t rai_linkmtu; /* AdvLinkMTU */
uint32_t rai_reachabletime; /* AdvReachableTime */
uint32_t rai_retranstimer; /* AdvRetransTimer */
uint8_t rai_hoplimit; /* AdvCurHopLimit */
TAILQ_HEAD(, prefix) rai_prefix;/* AdvPrefixList(link head) */
int rai_pfxs; /* number of prefixes */
uint16_t rai_clockskew; /* used for consisitency check of lifetimes */
TAILQ_HEAD(, rdnss) rai_rdnss; /* DNS server list */
TAILQ_HEAD(, dnssl) rai_dnssl; /* search domain list */
TAILQ_HEAD(, rtinfo) rai_route; /* route information option (link head) */
int rai_routes; /* number of route information options */
/* actual RA packet data and its length */
size_t rai_ra_datalen;
char *rai_ra_data;
/* info about soliciter */
TAILQ_HEAD(, soliciter) rai_soliciter; /* recent solication source */
};
/* RA information list */
extern TAILQ_HEAD(railist_head_t, rainfo) railist;
/*
* ifi_state:
*
* (INIT)
* |
* | update_ifinfo()
* | update_persist_ifinfo()
* v
* UNCONFIGURED
* | ^
* loadconfig()| |rm_ifinfo(), ra_output()
* (MC join)| |(MC leave)
* | |
* | |
* v |
* TRANSITIVE
* | ^
* ra_output()| |getconfig()
* | |
* | |
* | |
* v |
* CONFIGURED
*
*
*/
#define IFI_STATE_UNCONFIGURED 0
#define IFI_STATE_CONFIGURED 1
#define IFI_STATE_TRANSITIVE 2
struct ifinfo {
TAILQ_ENTRY(ifinfo) ifi_next;
uint16_t ifi_state;
uint16_t ifi_persist;
uint16_t ifi_ifindex;
char ifi_ifname[IFNAMSIZ];
uint8_t ifi_type;
uint16_t ifi_flags;
uint32_t ifi_nd_flags;
uint32_t ifi_phymtu;
struct sockaddr_dl ifi_sdl;
struct rainfo *ifi_rainfo;
struct rainfo *ifi_rainfo_trans;
uint16_t ifi_burstcount;
uint32_t ifi_burstinterval;
struct rtadvd_timer *ifi_ra_timer;
/* timestamp when the latest RA was sent */
struct timespec ifi_ra_lastsent;
uint16_t ifi_rs_waitcount;
/* statistics */
uint64_t ifi_raoutput; /* # of RAs sent */
uint64_t ifi_rainput; /* # of RAs received */
uint64_t ifi_rainconsistent; /* # of inconsistent recv'd RAs */
uint64_t ifi_rsinput; /* # of RSs received */
};
/* Interface list */
extern TAILQ_HEAD(ifilist_head_t, ifinfo) ifilist;
extern char *mcastif;
struct rtadvd_timer *ra_timeout(void *);
void ra_timer_update(void *, struct timespec *);
void ra_output(struct ifinfo *);
int prefix_match(struct in6_addr *, int,
struct in6_addr *, int);
struct ifinfo *if_indextoifinfo(int);
struct prefix *find_prefix(struct rainfo *,
struct in6_addr *, int);
void rtadvd_set_reload(int);
void rtadvd_set_shutdown(int);
diff --git a/usr.sbin/rtadvd/timer.c b/usr.sbin/rtadvd/timer.c
index 94c5dcd91f70..0e0cdd277071 100644
--- a/usr.sbin/rtadvd/timer.c
+++ b/usr.sbin/rtadvd/timer.c
@@ -1,201 +1,200 @@
-/* $FreeBSD$ */
/* $KAME: timer.c,v 1.9 2002/06/10 19:59:47 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* Copyright (C) 2011 Hiroki Sato <hrs@FreeBSD.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/queue.h>
#include <sys/socket.h>
#include <net/if.h>
#include <net/if_dl.h>
#include <netinet/in.h>
#include <unistd.h>
#include <syslog.h>
#include <stdlib.h>
#include <string.h>
#include <search.h>
#include <time.h>
#include <netdb.h>
#include "rtadvd.h"
#include "timer_subr.h"
#include "timer.h"
struct rtadvd_timer_head_t ra_timer =
TAILQ_HEAD_INITIALIZER(ra_timer);
static struct timespec tm_limit;
static struct timespec tm_max;
void
rtadvd_timer_init(void)
{
/* Generate maximum time in timespec. */
tm_limit.tv_sec = (-1) & ~((time_t)1 << ((sizeof(tm_max.tv_sec) * 8) - 1));
tm_limit.tv_nsec = (-1) & ~((long)1 << ((sizeof(tm_max.tv_nsec) * 8) - 1));
tm_max = tm_limit;
TAILQ_INIT(&ra_timer);
}
void
rtadvd_update_timeout_handler(void)
{
struct ifinfo *ifi;
TAILQ_FOREACH(ifi, &ifilist, ifi_next) {
switch (ifi->ifi_state) {
case IFI_STATE_CONFIGURED:
case IFI_STATE_TRANSITIVE:
if (ifi->ifi_ra_timer != NULL)
continue;
syslog(LOG_DEBUG, "<%s> add timer for %s (idx=%d)",
__func__, ifi->ifi_ifname, ifi->ifi_ifindex);
ifi->ifi_ra_timer = rtadvd_add_timer(ra_timeout,
ra_timer_update, ifi, ifi);
ra_timer_update((void *)ifi,
&ifi->ifi_ra_timer->rat_tm);
rtadvd_set_timer(&ifi->ifi_ra_timer->rat_tm,
ifi->ifi_ra_timer);
break;
case IFI_STATE_UNCONFIGURED:
if (ifi->ifi_ra_timer == NULL)
continue;
syslog(LOG_DEBUG,
"<%s> remove timer for %s (idx=%d)", __func__,
ifi->ifi_ifname, ifi->ifi_ifindex);
rtadvd_remove_timer(ifi->ifi_ra_timer);
ifi->ifi_ra_timer = NULL;
break;
}
}
return;
}
struct rtadvd_timer *
rtadvd_add_timer(struct rtadvd_timer *(*timeout)(void *),
void (*update)(void *, struct timespec *),
void *timeodata, void *updatedata)
{
struct rtadvd_timer *rat;
if (timeout == NULL) {
syslog(LOG_ERR,
"<%s> timeout function unspecified", __func__);
exit(1);
}
rat = malloc(sizeof(*rat));
if (rat == NULL) {
syslog(LOG_ERR,
"<%s> can't allocate memory", __func__);
exit(1);
}
memset(rat, 0, sizeof(*rat));
rat->rat_expire = timeout;
rat->rat_update = update;
rat->rat_expire_data = timeodata;
rat->rat_update_data = updatedata;
rat->rat_tm = tm_max;
/* link into chain */
TAILQ_INSERT_TAIL(&ra_timer, rat, rat_next);
return (rat);
}
void
rtadvd_remove_timer(struct rtadvd_timer *rat)
{
if (rat == NULL)
return;
TAILQ_REMOVE(&ra_timer, rat, rat_next);
free(rat);
}
/*
* Check expiration for each timer. If a timer expires,
* call the expire function for the timer and update the timer.
* Return the next interval for select() call.
*/
struct timespec *
rtadvd_check_timer(void)
{
static struct timespec returnval;
struct timespec now;
struct rtadvd_timer *rat;
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
tm_max = tm_limit;
TAILQ_FOREACH(rat, &ra_timer, rat_next) {
if (TS_CMP(&rat->rat_tm, &now, <=)) {
if (((*rat->rat_expire)(rat->rat_expire_data) == NULL))
continue; /* the timer was removed */
if (rat->rat_update)
(*rat->rat_update)(rat->rat_update_data, &rat->rat_tm);
TS_ADD(&rat->rat_tm, &now, &rat->rat_tm);
}
if (TS_CMP(&rat->rat_tm, &tm_max, <))
tm_max = rat->rat_tm;
}
if (TS_CMP(&tm_max, &tm_limit, ==)) {
/* no need to timeout */
return (NULL);
} else if (TS_CMP(&tm_max, &now, <)) {
/* this may occur when the interval is too small */
returnval.tv_sec = returnval.tv_nsec = 0;
} else
TS_SUB(&tm_max, &now, &returnval);
return (&returnval);
}
void
rtadvd_set_timer(struct timespec *tm, struct rtadvd_timer *rat)
{
struct timespec now;
/* reset the timer */
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
TS_ADD(&now, tm, &rat->rat_tm);
/* update the next expiration time */
if (TS_CMP(&rat->rat_tm, &tm_max, <))
tm_max = rat->rat_tm;
return;
}
diff --git a/usr.sbin/rtadvd/timer.h b/usr.sbin/rtadvd/timer.h
index 74ac7d41d8fe..49364bf19c9f 100644
--- a/usr.sbin/rtadvd/timer.h
+++ b/usr.sbin/rtadvd/timer.h
@@ -1,54 +1,53 @@
-/* $FreeBSD$ */
/* $KAME: timer.h,v 1.5 2002/05/31 13:30:38 jinmei Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
extern TAILQ_HEAD(rtadvd_timer_head_t, rtadvd_timer) ra_timer;
struct rtadvd_timer {
TAILQ_ENTRY(rtadvd_timer) rat_next;
struct rainfo *rat_rai;
struct timespec rat_tm;
struct rtadvd_timer *(*rat_expire)(void *);
void *rat_expire_data;
void (*rat_update)(void *, struct timespec *);
void *rat_update_data;
};
void rtadvd_timer_init(void);
void rtadvd_update_timeout_handler(void);
struct rtadvd_timer *rtadvd_add_timer(struct rtadvd_timer *(*)(void *),
void (*)(void *, struct timespec *), void *, void *);
void rtadvd_set_timer(struct timespec *,
struct rtadvd_timer *);
void rtadvd_remove_timer(struct rtadvd_timer *);
struct timespec *rtadvd_check_timer(void);
diff --git a/usr.sbin/rtadvd/timer_subr.c b/usr.sbin/rtadvd/timer_subr.c
index 7a7a23cd98f7..9bd91753dd23 100644
--- a/usr.sbin/rtadvd/timer_subr.c
+++ b/usr.sbin/rtadvd/timer_subr.c
@@ -1,93 +1,92 @@
-/* $FreeBSD$ */
/* $KAME: timer.c,v 1.9 2002/06/10 19:59:47 itojun Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/queue.h>
#include <sys/socket.h>
#include <syslog.h>
#include <stdio.h>
#include <inttypes.h>
#include <time.h>
#include "timer.h"
#include "timer_subr.h"
struct timespec *
rtadvd_timer_rest(struct rtadvd_timer *rat)
{
static struct timespec returnval, now;
clock_gettime(CLOCK_MONOTONIC_FAST, &now);
if (TS_CMP(&rat->rat_tm, &now, <=)) {
syslog(LOG_DEBUG,
"<%s> a timer must be expired, but not yet",
__func__);
returnval.tv_sec = returnval.tv_nsec = 0;
}
else
TS_SUB(&rat->rat_tm, &now, &returnval);
return (&returnval);
}
char *
sec2str(uint32_t s, char *buf)
{
uint32_t day;
uint32_t hour;
uint32_t min;
uint32_t sec;
char *p;
min = s / 60;
sec = s % 60;
hour = min / 60;
min = min % 60;
day = hour / 24;
hour = hour % 24;
p = buf;
if (day > 0)
p += sprintf(p, "%" PRIu32 "d", day);
if (hour > 0)
p += sprintf(p, "%" PRIu32 "h", hour);
if (min > 0)
p += sprintf(p, "%" PRIu32 "m", min);
if ((p == buf) || (sec > 0 && p > buf))
sprintf(p, "%" PRIu32 "s", sec);
return (buf);
}
diff --git a/usr.sbin/rtadvd/timer_subr.h b/usr.sbin/rtadvd/timer_subr.h
index 36e8b3bdc192..ccf1b3b7f8c7 100644
--- a/usr.sbin/rtadvd/timer_subr.h
+++ b/usr.sbin/rtadvd/timer_subr.h
@@ -1,61 +1,60 @@
-/* $FreeBSD$ */
/* $KAME: timer.h,v 1.5 2002/05/31 13:30:38 jinmei Exp $ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#define SSBUFLEN 1024
#define TS_CMP(tsp, usp, cmp) \
(((tsp)->tv_sec == (usp)->tv_sec) ? \
((tsp)->tv_nsec cmp (usp)->tv_nsec) : \
((tsp)->tv_sec cmp (usp)->tv_sec))
#define TS_ADD(tsp, usp, vsp) \
do { \
(vsp)->tv_sec = (tsp)->tv_sec + (usp)->tv_sec; \
(vsp)->tv_nsec = (tsp)->tv_nsec + (usp)->tv_nsec; \
if ((vsp)->tv_nsec >= 1000000000L) { \
(vsp)->tv_sec++; \
(vsp)->tv_nsec -= 1000000000L; \
} \
} while (0)
#define TS_SUB(tsp, usp, vsp) \
do { \
(vsp)->tv_sec = (tsp)->tv_sec - (usp)->tv_sec; \
(vsp)->tv_nsec = (tsp)->tv_nsec - (usp)->tv_nsec; \
if ((vsp)->tv_nsec < 0) { \
(vsp)->tv_sec--; \
(vsp)->tv_nsec += 1000000000L; \
} \
} while (0)
struct timespec *rtadvd_timer_rest(struct rtadvd_timer *);
char *sec2str(uint32_t, char *buf);
diff --git a/usr.sbin/rtsold/rtsock.c b/usr.sbin/rtsold/rtsock.c
index 4dfbf61f47db..1dfdea0f5c3d 100644
--- a/usr.sbin/rtsold/rtsock.c
+++ b/usr.sbin/rtsold/rtsock.c
@@ -1,177 +1,176 @@
/* $KAME: rtsock.c,v 1.3 2000/10/10 08:46:45 itojun Exp $ */
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (C) 2000 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/capsicum.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/time.h>
#include <sys/uio.h>
#include <net/if.h>
#include <net/route.h>
#include <net/if_dl.h>
#include <netinet/in.h>
#include <netinet/ip6.h>
#include <netinet/icmp6.h>
#include <capsicum_helpers.h>
#include <time.h>
#include <unistd.h>
#include <stdio.h>
#include <stddef.h>
#include <err.h>
#include <errno.h>
#include <string.h>
#include <stdlib.h>
#include <syslog.h>
#include "rtsold.h"
static int rtsock_input_ifannounce(int, struct rt_msghdr *, char *);
static struct {
u_char type;
size_t minlen;
int (*func)(int, struct rt_msghdr *, char *);
} rtsock_dispatch[] = {
{ RTM_IFANNOUNCE, sizeof(struct if_announcemsghdr),
rtsock_input_ifannounce },
{ 0, 0, NULL },
};
int
rtsock_open(void)
{
cap_rights_t rights;
int error, s;
s = socket(PF_ROUTE, SOCK_RAW, 0);
if (s < 0)
return (s);
cap_rights_init(&rights, CAP_EVENT, CAP_READ);
if (caph_rights_limit(s, &rights) != 0) {
error = errno;
(void)close(s);
errno = error;
return (-1);
}
return (s);
}
int
rtsock_input(int s)
{
ssize_t n;
char msg[2048];
char *lim, *next;
struct rt_msghdr *rtm;
int idx;
ssize_t len;
int ret = 0;
const ssize_t lenlim =
offsetof(struct rt_msghdr, rtm_msglen) + sizeof(rtm->rtm_msglen);
n = read(s, msg, sizeof(msg));
lim = msg + n;
for (next = msg; next < lim; next += len) {
rtm = (struct rt_msghdr *)(void *)next;
if (lim - next < lenlim)
break;
len = rtm->rtm_msglen;
if (len < lenlim)
break;
if (dflag > 1) {
warnmsg(LOG_INFO, __func__,
"rtmsg type %d, len=%lu", rtm->rtm_type,
(u_long)len);
}
for (idx = 0; rtsock_dispatch[idx].func; idx++) {
if (rtm->rtm_type != rtsock_dispatch[idx].type)
continue;
if (rtm->rtm_msglen < rtsock_dispatch[idx].minlen) {
warnmsg(LOG_INFO, __func__,
"rtmsg type %d too short!", rtm->rtm_type);
continue;
}
ret = (*rtsock_dispatch[idx].func)(s, rtm, lim);
break;
}
}
return (ret);
}
static int
rtsock_input_ifannounce(int s __unused, struct rt_msghdr *rtm, char *lim)
{
struct if_announcemsghdr *ifan;
struct ifinfo *ifi;
ifan = (struct if_announcemsghdr *)rtm;
if ((char *)(ifan + 1) > lim)
return (-1);
switch (ifan->ifan_what) {
case IFAN_ARRIVAL:
/*
* XXX for NetBSD 1.5, interface index will monotonically be
* increased as new pcmcia card gets inserted.
* we may be able to do a name-based interface match,
* and call ifreconfig() to enable the interface again.
*/
warnmsg(LOG_INFO, __func__,
"interface %s inserted", ifan->ifan_name);
break;
case IFAN_DEPARTURE:
warnmsg(LOG_WARNING, __func__,
"interface %s removed", ifan->ifan_name);
ifi = find_ifinfo(ifan->ifan_index);
if (ifi) {
if (dflag > 1) {
warnmsg(LOG_INFO, __func__,
"bring interface %s to DOWN state",
ifan->ifan_name);
}
ifi->state = IFS_DOWN;
}
break;
}
return (0);
}
diff --git a/usr.sbin/sesutil/eltsub.c b/usr.sbin/sesutil/eltsub.c
index 740182e91211..d18fad5cb784 100644
--- a/usr.sbin/sesutil/eltsub.c
+++ b/usr.sbin/sesutil/eltsub.c
@@ -1,144 +1,143 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
#include <sys/types.h>
#include <err.h>
#include <stddef.h>
#include <stdlib.h>
#include <stdio.h>
#include <cam/scsi/scsi_enc.h>
#include <libxo/xo.h>
#include "eltsub.h"
/*
* offset by +20 degrees.
* The range of the value expresses a temperature between -19 and +235 degrees
* Celsius. A value of 00h is reserved.
*/
#define TEMPERATURE_OFFSET 20
const char *
geteltnm(int type)
{
static char rbuf[132];
switch (type) {
case ELMTYP_UNSPECIFIED:
return ("Unspecified");
case ELMTYP_DEVICE:
return ("Device Slot");
case ELMTYP_POWER:
return ("Power Supply");
case ELMTYP_FAN:
return ("Cooling");
case ELMTYP_THERM:
return ("Temperature Sensor");
case ELMTYP_DOORLOCK:
return ("Door Lock");
case ELMTYP_ALARM:
return ("Audible Alarm");
case ELMTYP_ESCC:
return ("Enclosure Services Controller Electronics");
case ELMTYP_SCC:
return ("SCC Controller Electronics");
case ELMTYP_NVRAM:
return ("Nonvolatile Cache");
case ELMTYP_INV_OP_REASON:
return ("Invalid Operation Reason");
case ELMTYP_UPS:
return ("Uninterruptible Power Supply");
case ELMTYP_DISPLAY:
return ("Display");
case ELMTYP_KEYPAD:
return ("Key Pad Entry");
case ELMTYP_ENCLOSURE:
return ("Enclosure");
case ELMTYP_SCSIXVR:
return ("SCSI Port/Transceiver");
case ELMTYP_LANGUAGE:
return ("Language");
case ELMTYP_COMPORT:
return ("Communication Port");
case ELMTYP_VOM:
return ("Voltage Sensor");
case ELMTYP_AMMETER:
return ("Current Sensor");
case ELMTYP_SCSI_TGT:
return ("SCSI Target Port");
case ELMTYP_SCSI_INI:
return ("SCSI Initiator Port");
case ELMTYP_SUBENC:
return ("Simple Subenclosure");
case ELMTYP_ARRAY_DEV:
return ("Array Device Slot");
case ELMTYP_SAS_EXP:
return ("SAS Expander");
case ELMTYP_SAS_CONN:
return ("SAS Connector");
default:
snprintf(rbuf, sizeof(rbuf), "<Type 0x%x>", type);
return (rbuf);
}
}
const char *
scode2ascii(u_char code)
{
static char rbuf[32];
switch (code & 0xf) {
case SES_OBJSTAT_UNSUPPORTED:
return ("Unsupported");
case SES_OBJSTAT_OK:
return ("OK");
case SES_OBJSTAT_CRIT:
return ("Critical");
case SES_OBJSTAT_NONCRIT:
return ("Noncritical");
case SES_OBJSTAT_UNRECOV:
return ("Unrecoverable");
case SES_OBJSTAT_NOTINSTALLED:
return ("Not Installed");
case SES_OBJSTAT_UNKNOWN:
return ("Unknown");
case SES_OBJSTAT_NOTAVAIL:
return ("Not Available");
case SES_OBJSTAT_NOACCESS:
return ("No Access Allowed");
default:
snprintf(rbuf, sizeof(rbuf), "<Status 0x%x>", code & 0xf);
return (rbuf);
}
}
diff --git a/usr.sbin/sesutil/eltsub.h b/usr.sbin/sesutil/eltsub.h
index d1818ef3ee8b..3be59d31cb7c 100644
--- a/usr.sbin/sesutil/eltsub.h
+++ b/usr.sbin/sesutil/eltsub.h
@@ -1,36 +1,35 @@
-/* $FreeBSD$ */
/*
* Copyright (c) 2000 by Matthew Jacob
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer,
* without modification, immediately at the beginning of the file.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* Alternatively, this software may be distributed under the terms of the
* the GNU Public License ("GPL").
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
* Matthew Jacob
* Feral Software
* mjacob@feral.com
*/
const char *geteltnm(int);
const char *scode2ascii(u_char);
diff --git a/usr.sbin/tcpdump/tcpdump/config.h b/usr.sbin/tcpdump/tcpdump/config.h
index 8980b31c8591..93d02a5b337a 100644
--- a/usr.sbin/tcpdump/tcpdump/config.h
+++ b/usr.sbin/tcpdump/tcpdump/config.h
@@ -1,407 +1,406 @@
-/* $FreeBSD$ */
/* This is an edited copy of the config.h generated by configure. */
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.in by autoheader. */
/* define if you want to build the possibly-buggy SMB printer */
#define ENABLE_SMB 1
/* Define to 1 if you have the `alarm' function. */
#define HAVE_ALARM 1
/* Define to 1 if you have the `bpf_dump' function. */
#define HAVE_BPF_DUMP 1
/* capsicum support available */
#define HAVE_CAPSICUM 1
/* Casper library support available */
/* See Makefile */
/* #undef HAVE_CASPER */
/* Define to 1 if you have the `cap_enter' function. */
#define HAVE_CAP_ENTER 1
/* Define to 1 if you have the `cap_ioctls_limit' function. */
#define HAVE_CAP_IOCTLS_LIMIT 1
/* Define to 1 if you have the <cap-ng.h> header file. */
/* #undef HAVE_CAP_NG_H */
/* Define to 1 if you have the `cap_rights_limit' function. */
#define HAVE_CAP_RIGHTS_LIMIT 1
/* Define to 1 if you have the declaration of `ether_ntohost', and to 0 if you
don't. */
#define HAVE_DECL_ETHER_NTOHOST 1
/* define if you have the dnet_htoa function */
/* #undef HAVE_DNET_HTOA */
/* Define to 1 if you have the `ether_ntohost' function. */
#define HAVE_ETHER_NTOHOST 1
/* Define to 1 if you have the `EVP_CIPHER_CTX_new' function. */
#define HAVE_EVP_CIPHER_CTX_NEW 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if you have the `getopt_long' function. */
#define HAVE_GETOPT_LONG 1
/* define if you have getrpcbynumber() */
#define HAVE_GETRPCBYNUMBER 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if you have the `cap-ng' library (-lcap-ng). */
/* #undef HAVE_LIBCAP_NG */
/* Define to 1 if you have the `crypto' library (-lcrypto). */
/* See Makefile */
/* #undef HAVE_LIBCRYPTO */
/* Define to 1 if you have the `rpc' library (-lrpc). */
/* #undef HAVE_LIBRPC */
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the <netdnet/dnetdb.h> header file. */
/* #undef HAVE_NETDNET_DNETDB_H */
/* define if you have a dnet_htoa declaration in <netdnet/dnetdb.h> */
/* #undef HAVE_NETDNET_DNETDB_H_DNET_HTOA */
/* Define to 1 if you have the <netinet/ether.h> header file. */
/* #undef HAVE_NETINET_ETHER_H */
/* Define to 1 if you have the <netinet/if_ether.h> header file. */
#define HAVE_NETINET_IF_ETHER_H 1
/* Define to 1 if you have the <net/if_pflog.h> header file. */
/* See Makefile */
/* #undef HAVE_NET_IF_PFLOG_H */
/* Define to 1 if you have the <net/pfvar.h> header file. */
/* See Makefile */
/* #undef HAVE_NET_PFVAR_H */
/* Define to 1 if you have the `openat' function. */
#define HAVE_OPENAT 1
/* Define to 1 if you have the <openssl/evp.h> header file. */
/* See Makefile */
/* #undef HAVE_OPENSSL_EVP_H 1 */
/* define if the OS provides AF_INET6 and struct in6_addr */
/* See Makefile */
/* #undef HAVE_OS_IPV6_SUPPORT */
/* if there's an os_proto.h for this platform, to use additional prototypes */
/* #undef HAVE_OS_PROTO_H */
/* Define to 1 if you have the <pcap/bluetooth.h> header file. */
/* #undef HAVE_PCAP_BLUETOOTH_H */
/* Define to 1 if you have the `pcap_breakloop' function. */
#define HAVE_PCAP_BREAKLOOP 1
/* Define to 1 if you have the `pcap_create' function. */
#define HAVE_PCAP_CREATE 1
/* define if libpcap has pcap_datalink_name_to_val() */
#define HAVE_PCAP_DATALINK_NAME_TO_VAL 1
/* define if libpcap has pcap_datalink_val_to_description() */
#define HAVE_PCAP_DATALINK_VAL_TO_DESCRIPTION 1
/* define if libpcap has pcap_debug */
/* #undef HAVE_PCAP_DEBUG */
/* Define to 1 if you have the `pcap_dump_flush' function. */
#define HAVE_PCAP_DUMP_FLUSH 1
/* define if libpcap has pcap_dump_ftell() */
#define HAVE_PCAP_DUMP_FTELL 1
/* Define to 1 if you have the `pcap_findalldevs' function. */
#define HAVE_PCAP_FINDALLDEVS 1
/* Define to 1 if you have the `pcap_free_datalinks' function. */
#define HAVE_PCAP_FREE_DATALINKS 1
/* Define to 1 if the system has the type `pcap_if_t'. */
#define HAVE_PCAP_IF_T 1
/* Define to 1 if you have the `pcap_lib_version' function. */
#define HAVE_PCAP_LIB_VERSION 1
/* define if libpcap has pcap_list_datalinks() */
#define HAVE_PCAP_LIST_DATALINKS 1
/* Define to 1 if you have the <pcap/nflog.h> header file. */
/* #undef HAVE_PCAP_NFLOG_H */
/* Define to 1 if you have the `pcap_setdirection' function. */
#define HAVE_PCAP_SETDIRECTION 1
/* Define to 1 if you have the `pcap_set_datalink' function. */
#define HAVE_PCAP_SET_DATALINK 1
/* Define to 1 if you have the `pcap_set_immediate_mode' function. */
#define HAVE_PCAP_SET_IMMEDIATE_MODE 1
/* Define to 1 if you have the `pcap_set_optimizer_debug' function. */
/* #undef HAVE_PCAP_SET_OPTIMIZER_DEBUG */
/* Define to 1 if you have the `pcap_set_parser_debug' function. */
/* #undef HAVE_PCAP_SET_PARSER_DEBUG */
/* Define to 1 if you have the `pcap_set_tstamp_precision' function. */
#define HAVE_PCAP_SET_TSTAMP_PRECISION 1
/* Define to 1 if you have the `pcap_set_tstamp_type' function. */
#define HAVE_PCAP_SET_TSTAMP_TYPE 1
/* Define to 1 if you have the <pcap/usb.h> header file. */
/* #undef HAVE_PCAP_USB_H */
/* define if libpcap has pcap_version */
/* #undef HAVE_PCAP_VERSION */
/* Define to 1 if you have the `pfopen' function. */
/* #undef HAVE_PFOPEN */
/* Define to 1 if you have the <rpc/rpcent.h> header file. */
#define HAVE_RPC_RPCENT_H 1
/* Define to 1 if you have the <rpc/rpc.h> header file. */
#define HAVE_RPC_RPC_H 1
/* Define to 1 if you have the `setlinebuf' function. */
#define HAVE_SETLINEBUF 1
/* Define to 1 if you have the `sigaction' function. */
#define HAVE_SIGACTION 1
/* Define to 1 if you have the `sigset' function. */
/* #undef HAVE_SIGSET */
/* Define to 1 if you have the `snprintf' function. */
#define HAVE_SNPRINTF 1
/* if struct sockaddr has the sa_len member */
#define HAVE_SOCKADDR_SA_LEN 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strdup' function. */
#define HAVE_STRDUP 1
/* Define to 1 if you have the `strftime' function. */
#define HAVE_STRFTIME 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcat' function. */
#define HAVE_STRLCAT 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the `strsep' function. */
#define HAVE_STRSEP 1
/* Define to 1 if the system has the type `struct ether_addr'. */
/* #undef HAVE_STRUCT_ETHER_ADDR */
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if the system has the type `uintptr_t'. */
#define HAVE_UINTPTR_T 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the `vfprintf' function. */
#define HAVE_VFPRINTF 1
/* Define to 1 if you have the `vsnprintf' function. */
#define HAVE_VSNPRINTF 1
/* define if libpcap has yydebug */
/* #undef HAVE_YYDEBUG */
/* define if your compiler has __attribute__ */
#define HAVE___ATTRIBUTE__ 1
/* if unaligned access fails */
/* #undef LBL_ALIGN */
/* Define to 1 if netinet/ether.h declares `ether_ntohost' */
/* #undef NETINET_ETHER_H_DECLARES_ETHER_NTOHOST */
/* Define to 1 if netinet/if_ether.h declares `ether_ntohost' */
#define NETINET_IF_ETHER_H_DECLARES_ETHER_NTOHOST /**/
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT ""
/* Define to the full name of this package. */
#define PACKAGE_NAME ""
/* Define to the full name and version of this package. */
#define PACKAGE_STRING ""
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME ""
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION ""
/* define if the platform doesn't define PRId64 */
/* #undef PRId64 */
/* define if the platform doesn't define PRIo64 */
/* #undef PRIo64 */
/* define if the platform doesn't define PRIx64 */
/* #undef PRIu64 */
/* define if the platform doesn't define PRIu64 */
/* #undef PRIx64 */
/* Define as the return type of signal handlers (`int' or `void'). */
#define RETSIGTYPE void
/* return value of signal handlers */
#define RETSIGVAL /**/
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Define to 1 if you can safely include both <sys/time.h> and <time.h>. */
#define TIME_WITH_SYS_TIME 1
/* define if you have ether_ntohost() and it works */
#define USE_ETHER_NTOHOST 1
/* Define if you enable support for libsmi */
/* #undef USE_LIBSMI */
/* define if should chroot when dropping privileges */
/* #undef WITH_CHROOT */
/* define if should drop privileges by default */
/* #undef WITH_USER */
/* get BSD semantics on Irix */
/* #undef _BSD_SIGNALS */
/* define on AIX to get certain functions */
/* #undef _SUN */
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT32_T */
/* Define for Solaris 2.5.1 so the uint64_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT64_T */
/* Define for Solaris 2.5.1 so the uint8_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT8_T */
/* define if your compiler allows __attribute__((format)) without a warning */
#define __ATTRIBUTE___FORMAT_OK 1
/* define if your compiler allows __attribute__((format)) to be applied to
function pointers */
#define __ATTRIBUTE___FORMAT_OK_FOR_FUNCTION_POINTERS 1
/* define if your compiler allows __attribute__((noreturn)) to be applied to
function pointers */
#define __ATTRIBUTE___NORETURN_OK_FOR_FUNCTION_POINTERS 1
/* to handle Ultrix compilers that don't support const in prototypes */
/* #undef const */
/* Define as token for inline if inlining supported */
#define inline inline
/* Define to the type of a signed integer type of width exactly 16 bits if
such a type exists and the standard includes do not define it. */
/* #undef int16_t */
/* Define to the type of a signed integer type of width exactly 32 bits if
such a type exists and the standard includes do not define it. */
/* #undef int32_t */
/* Define to the type of a signed integer type of width exactly 64 bits if
such a type exists and the standard includes do not define it. */
/* #undef int64_t */
/* Define to the type of a signed integer type of width exactly 8 bits if such
a type exists and the standard includes do not define it. */
/* #undef int8_t */
/* Define to `uint16_t' if u_int16_t not defined. */
/* #undef u_int16_t */
/* Define to `uint32_t' if u_int32_t not defined. */
/* #undef u_int32_t */
/* Define to `uint64_t' if u_int64_t not defined. */
/* #undef u_int64_t */
/* Define to `uint8_t' if u_int8_t not defined. */
/* #undef u_int8_t */
/* Define to the type of an unsigned integer type of width exactly 16 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint16_t */
/* Define to the type of an unsigned integer type of width exactly 32 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint32_t */
/* Define to the type of an unsigned integer type of width exactly 64 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint64_t */
/* Define to the type of an unsigned integer type of width exactly 8 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint8_t */
/* Define to the type of an unsigned integer type wide enough to hold a
pointer, if such a type exists, and if the system does not define it. */
/* #undef uintptr_t */
diff --git a/usr.sbin/unbound/config.h b/usr.sbin/unbound/config.h
index 2068cbfe7295..74a4796af1cd 100644
--- a/usr.sbin/unbound/config.h
+++ b/usr.sbin/unbound/config.h
@@ -1,1546 +1,1545 @@
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.ac by autoheader. */
-/* $FreeBSD$ */
/* apply the noreturn attribute to a function that exits the program */
#define ATTR_NORETURN __attribute__((__noreturn__))
/* apply the weak attribute to a symbol */
#define ATTR_WEAK __attribute__((weak))
/* Directory to chroot to */
#define CHROOT_DIR "/var/unbound"
/* Define this to enable client subnet option. */
/* #undef CLIENT_SUBNET */
/* Do sha512 definitions in config.h */
/* #undef COMPAT_SHA512 */
/* Command line arguments used with configure */
#define CONFCMDLINE "--with-ssl=/usr --with-libexpat=/usr --disable-dnscrypt --disable-dnstap --enable-ecdsa --disable-event-api --enable-gost --with-libevent --disable-subnet --disable-tfo-client --disable-tfo-server --with-pthreads--prefix=/usr --localstatedir=/var/unbound --mandir=/usr/share/man --build=freebsd"
/* Pathname to the Unbound configuration file */
#define CONFIGFILE "/var/unbound/unbound.conf"
/* Define this if on macOSX10.4-darwin8 and setreuid and setregid do not work
*/
/* #undef DARWIN_BROKEN_SETREUID */
/* Whether daemon is deprecated */
/* #undef DEPRECATED_DAEMON */
/* Deprecate RSA 1024 bit length, makes that an unsupported key */
/* #undef DEPRECATE_RSA_1024 */
/* Deprecate RSA 1024 bit length, makes that an unsupported key */
/* #undef DEPRECATE_RSA_1024 */
/* Define this to enable kernel based UDP source port randomization. */
/* #undef DISABLE_EXPLICIT_PORT_RANDOMISATION */
/* default dnstap socket path */
/* #undef DNSTAP_SOCKET_PATH */
/* Define if you want to use debug lock checking (slow). */
/* #undef ENABLE_LOCK_CHECKS */
/* Define this if you enabled-allsymbols from libunbound to link binaries to
it for smaller install size, but the libunbound export table is polluted by
internal symbols */
/* #undef EXPORT_ALL_SYMBOLS */
/* Define to 1 if you have the `accept4' function. */
#define HAVE_ACCEPT4 1
/* Define to 1 if you have the `arc4random' function. */
#define HAVE_ARC4RANDOM 1
/* Define to 1 if you have the `arc4random_uniform' function. */
#define HAVE_ARC4RANDOM_UNIFORM 1
/* Define to 1 if you have the <arpa/inet.h> header file. */
#define HAVE_ARPA_INET_H 1
/* Whether the C compiler accepts the "format" attribute */
#define HAVE_ATTR_FORMAT 1
/* Whether the C compiler accepts the "noreturn" attribute */
#define HAVE_ATTR_NORETURN 1
/* Whether the C compiler accepts the "unused" attribute */
#define HAVE_ATTR_UNUSED 1
/* Whether the C compiler accepts the "weak" attribute */
#define HAVE_ATTR_WEAK 1
/* If we have be64toh */
/* #undef HAVE_BE64TOH */
/* Define to 1 if you have the `BIO_set_callback_ex' function. */
/* #undef HAVE_BIO_SET_CALLBACK_EX */
/* Define to 1 if you have the `BIO_set_callback_ex' function. */
/* #undef HAVE_BIO_SET_CALLBACK_EX */
/* Define to 1 if you have the <bsd/stdlib.h> header file. */
/* #undef HAVE_BSD_STDLIB_H */
/* Define to 1 if you have the <bsd/string.h> header file. */
/* #undef HAVE_BSD_STRING_H */
/* Define to 1 if you have the `chown' function. */
#define HAVE_CHOWN 1
/* Define to 1 if you have the `chroot' function. */
#define HAVE_CHROOT 1
/* Define to 1 if you have the `CRYPTO_cleanup_all_ex_data' function. */
/* #undef HAVE_CRYPTO_CLEANUP_ALL_EX_DATA */
/* Define to 1 if you have the `CRYPTO_THREADID_set_callback' function. */
/* #undef HAVE_CRYPTO_THREADID_SET_CALLBACK */
/* Define to 1 if you have the `ctime_r' function. */
#define HAVE_CTIME_R 1
/* Define to 1 if you have the `daemon' function. */
#define HAVE_DAEMON 1
/* Define to 1 if you have the declaration of `arc4random', and to 0 if you
don't. */
/* #undef HAVE_DECL_ARC4RANDOM */
/* Define to 1 if you have the declaration of `arc4random_uniform', and to 0
if you don't. */
/* #undef HAVE_DECL_ARC4RANDOM_UNIFORM */
/* Define to 1 if you have the declaration of `evsignal_assign', and to 0 if
you don't. */
/* #undef HAVE_DECL_EVSIGNAL_ASSIGN */
/* Define to 1 if you have the declaration of `inet_ntop', and to 0 if you
don't. */
#define HAVE_DECL_INET_NTOP 1
/* Define to 1 if you have the declaration of `inet_pton', and to 0 if you
don't. */
#define HAVE_DECL_INET_PTON 1
/* Define to 1 if you have the declaration of `nghttp2_session_server_new',
and to 0 if you don't. */
/* #undef HAVE_DECL_NGHTTP2_SESSION_SERVER_NEW */
/* Define to 1 if you have the declaration of `NID_ED25519', and to 0 if you
don't. */
#define HAVE_DECL_NID_ED25519 1
/* Define to 1 if you have the declaration of `NID_ED448', and to 0 if you
don't. */
#define HAVE_DECL_NID_ED448 1
/* Define to 1 if you have the declaration of `NID_secp384r1', and to 0 if you
don't. */
#define HAVE_DECL_NID_SECP384R1 1
/* Define to 1 if you have the declaration of `NID_X9_62_prime256v1', and to 0
if you don't. */
#define HAVE_DECL_NID_X9_62_PRIME256V1 1
/* Define to 1 if you have the declaration of `reallocarray', and to 0 if you
don't. */
#define HAVE_DECL_REALLOCARRAY 1
/* Define to 1 if you have the declaration of `redisConnect', and to 0 if you
don't. */
/* #undef HAVE_DECL_REDISCONNECT */
/* Define to 1 if you have the declaration of `sk_SSL_COMP_pop_free', and to 0
if you don't. */
#define HAVE_DECL_SK_SSL_COMP_POP_FREE 1
/* Define to 1 if you have the declaration of
`SSL_COMP_get_compression_methods', and to 0 if you don't. */
#define HAVE_DECL_SSL_COMP_GET_COMPRESSION_METHODS 1
/* Define to 1 if you have the declaration of `SSL_CTX_set_ecdh_auto', and to
0 if you don't. */
#define HAVE_DECL_SSL_CTX_SET_ECDH_AUTO 1
/* Define to 1 if you have the declaration of `strlcat', and to 0 if you
don't. */
/* #undef HAVE_DECL_STRLCAT */
/* Define to 1 if you have the declaration of `strlcpy', and to 0 if you
don't. */
/* #undef HAVE_DECL_STRLCPY */
/* Define to 1 if you have the declaration of `XML_StopParser', and to 0 if
you don't. */
#define HAVE_DECL_XML_STOPPARSER 1
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the `DSA_SIG_set0' function. */
#define HAVE_DSA_SIG_SET0 1
/* Define to 1 if you have the <endian.h> header file. */
/* #undef HAVE_ENDIAN_H */
/* Define to 1 if you have the `endprotoent' function. */
#define HAVE_ENDPROTOENT 1
/* Define to 1 if you have the `endpwent' function. */
#define HAVE_ENDPWENT 1
/* Define to 1 if you have the `endservent' function. */
#define HAVE_ENDSERVENT 1
/* Define to 1 if you have the `ENGINE_cleanup' function. */
/* #undef HAVE_ENGINE_CLEANUP */
/* Define to 1 if you have the `ERR_free_strings' function. */
/* #undef HAVE_ERR_FREE_STRINGS */
/* Define to 1 if you have the `ERR_load_crypto_strings' function. */
/* #undef HAVE_ERR_LOAD_CRYPTO_STRINGS */
/* Define to 1 if you have the `event_assign' function. */
/* #undef HAVE_EVENT_ASSIGN */
/* Define to 1 if you have the `event_base_free' function. */
/* #undef HAVE_EVENT_BASE_FREE */
/* Define to 1 if you have the `event_base_get_method' function. */
/* #undef HAVE_EVENT_BASE_GET_METHOD */
/* Define to 1 if you have the `event_base_new' function. */
/* #undef HAVE_EVENT_BASE_NEW */
/* Define to 1 if you have the `event_base_once' function. */
/* #undef HAVE_EVENT_BASE_ONCE */
/* Define to 1 if you have the <event.h> header file. */
/* #undef HAVE_EVENT_H */
/* Define to 1 if you have the `EVP_aes_256_cbc' function. */
#define HAVE_EVP_AES_256_CBC 1
/* Define to 1 if you have the `EVP_cleanup' function. */
/* #undef HAVE_EVP_CLEANUP */
/* Define to 1 if you have the `EVP_default_properties_is_fips_enabled'
function. */
/* #undef HAVE_EVP_DEFAULT_PROPERTIES_IS_FIPS_ENABLED */
/* Define to 1 if you have the `EVP_default_properties_is_fips_enabled'
function. */
/* #undef HAVE_EVP_DEFAULT_PROPERTIES_IS_FIPS_ENABLED */
/* Define to 1 if you have the `EVP_DigestVerify' function. */
#define HAVE_EVP_DIGESTVERIFY 1
/* Define to 1 if you have the `EVP_dss1' function. */
/* #undef HAVE_EVP_DSS1 */
/* Define to 1 if you have the `EVP_EncryptInit_ex' function. */
#define HAVE_EVP_ENCRYPTINIT_EX 1
/* Define to 1 if you have the `EVP_MAC_CTX_set_params' function. */
/* #undef HAVE_EVP_MAC_CTX_SET_PARAMS */
/* Define to 1 if you have the `EVP_MD_CTX_new' function. */
#define HAVE_EVP_MD_CTX_NEW 1
/* Define to 1 if you have the `EVP_sha1' function. */
#define HAVE_EVP_SHA1 1
/* Define to 1 if you have the `EVP_sha256' function. */
#define HAVE_EVP_SHA256 1
/* Define to 1 if you have the `EVP_sha512' function. */
#define HAVE_EVP_SHA512 1
/* Define to 1 if you have the `ev_default_loop' function. */
/* #undef HAVE_EV_DEFAULT_LOOP */
/* Define to 1 if you have the `ev_loop' function. */
/* #undef HAVE_EV_LOOP */
/* Define to 1 if you have the <expat.h> header file. */
#define HAVE_EXPAT_H 1
/* Define to 1 if you have the `explicit_bzero' function. */
#define HAVE_EXPLICIT_BZERO 1
/* Define to 1 if you have the `fcntl' function. */
#define HAVE_FCNTL 1
/* Define to 1 if you have the `FIPS_mode' function. */
#define HAVE_FIPS_MODE 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if fseeko (and presumably ftello) exists and is declared. */
#define HAVE_FSEEKO 1
/* Define to 1 if you have the `fsync' function. */
#define HAVE_FSYNC 1
/* Whether getaddrinfo is available */
#define HAVE_GETADDRINFO 1
/* Define to 1 if you have the `getauxval' function. */
/* #undef HAVE_GETAUXVAL */
/* Define to 1 if you have the `getentropy' function. */
/* #undef HAVE_GETENTROPY */
/* Define to 1 if you have the `getifaddrs' function. */
#define HAVE_GETIFADDRS 1
/* Define to 1 if you have the <getopt.h> header file. */
#define HAVE_GETOPT_H 1
/* Define to 1 if you have the `getpwnam' function. */
#define HAVE_GETPWNAM 1
/* Define to 1 if you have the `getrlimit' function. */
#define HAVE_GETRLIMIT 1
/* Define to 1 if you have the `gettid' function. */
/* #undef HAVE_GETTID */
/* Define to 1 if you have the `gettid' function. */
/* #undef HAVE_GETTID */
/* Define to 1 if you have the `glob' function. */
#define HAVE_GLOB 1
/* Define to 1 if you have the <glob.h> header file. */
#define HAVE_GLOB_H 1
/* Define to 1 if you have the `gmtime_r' function. */
#define HAVE_GMTIME_R 1
/* Define to 1 if you have the <grp.h> header file. */
#define HAVE_GRP_H 1
/* Define to 1 if you have the <hiredis/hiredis.h> header file. */
/* #undef HAVE_HIREDIS_HIREDIS_H */
/* Define to 1 if you have the `HMAC_Init_ex' function. */
#define HAVE_HMAC_INIT_EX 1
/* If we have htobe64 */
/* #undef HAVE_HTOBE64 */
/* Define to 1 if you have the <ifaddrs.h> header file. */
#define HAVE_IFADDRS_H 1
/* Define to 1 if you have the `if_nametoindex' function. */
#define HAVE_IF_NAMETOINDEX 1
/* Define to 1 if you have the `if_nametoindex' function. */
#define HAVE_IF_NAMETOINDEX 1
/* Define to 1 if you have the `inet_aton' function. */
#define HAVE_INET_ATON 1
/* Define to 1 if you have the `inet_ntop' function. */
#define HAVE_INET_NTOP 1
/* Define to 1 if you have the `inet_pton' function. */
#define HAVE_INET_PTON 1
/* Define to 1 if you have the `initgroups' function. */
#define HAVE_INITGROUPS 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* if the function 'ioctlsocket' is available */
/* #undef HAVE_IOCTLSOCKET */
/* Define to 1 if you have the <iphlpapi.h> header file. */
/* #undef HAVE_IPHLPAPI_H */
/* Define to 1 if you have the `isblank' function. */
#define HAVE_ISBLANK 1
/* Define to 1 if you have the `kill' function. */
#define HAVE_KILL 1
/* Use portable libbsd functions */
/* #undef HAVE_LIBBSD */
/* Define to 1 if you have the <libkern/OSByteOrder.h> header file. */
/* #undef HAVE_LIBKERN_OSBYTEORDER_H */
/* Define if we have LibreSSL */
/* #undef HAVE_LIBRESSL */
/* Define to 1 if you have the `localtime_r' function. */
#define HAVE_LOCALTIME_R 1
/* Define to 1 if you have the <login_cap.h> header file. */
#define HAVE_LOGIN_CAP_H 1
/* If have GNU libc compatible malloc */
#define HAVE_MALLOC 1
/* Define to 1 if you have the `memmove' function. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <minix/config.h> header file. */
/* #undef HAVE_MINIX_CONFIG_H */
/* Define to 1 if you have the <netdb.h> header file. */
#define HAVE_NETDB_H 1
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if you have the <netinet/tcp.h> header file. */
#define HAVE_NETINET_TCP_H 1
/* Define to 1 if you have the <netioapi.h> header file. */
/* #undef HAVE_NETIOAPI_H */
/* Use libnettle for crypto */
/* #undef HAVE_NETTLE */
/* Define to 1 if you have the <nettle/dsa-compat.h> header file. */
/* #undef HAVE_NETTLE_DSA_COMPAT_H */
/* Define to 1 if you have the <nettle/eddsa.h> header file. */
/* #undef HAVE_NETTLE_EDDSA_H */
/* Define to 1 if you have the <net/if.h> header file. */
#define HAVE_NET_IF_H 1
/* Define this to use nghttp2 client. */
/* #undef HAVE_NGHTTP2 */
/* Define to 1 if you have the <nghttp2/nghttp2.h> header file. */
/* #undef HAVE_NGHTTP2_NGHTTP2_H */
/* Use libnss for crypto */
/* #undef HAVE_NSS */
/* Define to 1 if you have the `OpenSSL_add_all_digests' function. */
/* #undef HAVE_OPENSSL_ADD_ALL_DIGESTS */
/* Define to 1 if you have the <openssl/bn.h> header file. */
#define HAVE_OPENSSL_BN_H 1
/* Define to 1 if you have the `OPENSSL_config' function. */
#define HAVE_OPENSSL_CONFIG 1
/* Define to 1 if you have the <openssl/conf.h> header file. */
#define HAVE_OPENSSL_CONF_H 1
/* Define to 1 if you have the <openssl/core_names.h> header file. */
/* #undef HAVE_OPENSSL_CORE_NAMES_H */
/* Define to 1 if you have the <openssl/dh.h> header file. */
#define HAVE_OPENSSL_DH_H 1
/* Define to 1 if you have the <openssl/dsa.h> header file. */
#define HAVE_OPENSSL_DSA_H 1
/* Define to 1 if you have the <openssl/engine.h> header file. */
#define HAVE_OPENSSL_ENGINE_H 1
/* Define to 1 if you have the <openssl/err.h> header file. */
#define HAVE_OPENSSL_ERR_H 1
/* Define to 1 if you have the `OPENSSL_init_crypto' function. */
#define HAVE_OPENSSL_INIT_CRYPTO 1
/* Define to 1 if you have the `OPENSSL_init_ssl' function. */
#define HAVE_OPENSSL_INIT_SSL 1
/* Define to 1 if you have the <openssl/param_build.h> header file. */
/* #undef HAVE_OPENSSL_PARAM_BUILD_H */
/* Define to 1 if you have the <openssl/rand.h> header file. */
#define HAVE_OPENSSL_RAND_H 1
/* Define to 1 if you have the <openssl/rsa.h> header file. */
#define HAVE_OPENSSL_RSA_H 1
/* Define to 1 if you have the <openssl/ssl.h> header file. */
#define HAVE_OPENSSL_SSL_H 1
/* Define to 1 if you have the `OSSL_PARAM_BLD_new' function. */
/* #undef HAVE_OSSL_PARAM_BLD_NEW */
/* Define to 1 if you have the `poll' function. */
#define HAVE_POLL 1
/* Define to 1 if you have the <poll.h> header file. */
#define HAVE_POLL_H 1
/* Define if you have POSIX threads libraries and header files. */
#define HAVE_PTHREAD 1
/* Have PTHREAD_PRIO_INHERIT. */
#define HAVE_PTHREAD_PRIO_INHERIT 1
/* Define to 1 if the system has the type `pthread_rwlock_t'. */
#define HAVE_PTHREAD_RWLOCK_T 1
/* Define to 1 if the system has the type `pthread_spinlock_t'. */
#define HAVE_PTHREAD_SPINLOCK_T 1
/* Define to 1 if you have the <pwd.h> header file. */
#define HAVE_PWD_H 1
/* Define if you have Python libraries and header files. */
/* #undef HAVE_PYTHON */
/* Define to 1 if you have the `random' function. */
#define HAVE_RANDOM 1
/* Define to 1 if you have the `RAND_cleanup' function. */
/* #undef HAVE_RAND_CLEANUP */
/* If we have reallocarray(3) */
#define HAVE_REALLOCARRAY 1
/* Define to 1 if you have the `recvmsg' function. */
#define HAVE_RECVMSG 1
/* Define to 1 if you have the `sendmsg' function. */
#define HAVE_SENDMSG 1
/* Define to 1 if you have the `setregid' function. */
/* #undef HAVE_SETREGID */
/* Define to 1 if you have the `setresgid' function. */
#define HAVE_SETRESGID 1
/* Define to 1 if you have the `setresuid' function. */
#define HAVE_SETRESUID 1
/* Define to 1 if you have the `setreuid' function. */
/* #undef HAVE_SETREUID */
/* Define to 1 if you have the `setrlimit' function. */
#define HAVE_SETRLIMIT 1
/* Define to 1 if you have the `setsid' function. */
#define HAVE_SETSID 1
/* Define to 1 if you have the `setusercontext' function. */
#define HAVE_SETUSERCONTEXT 1
/* Define to 1 if you have the `SHA512_Update' function. */
/* #undef HAVE_SHA512_UPDATE */
/* Define to 1 if you have the `shmget' function. */
#define HAVE_SHMGET 1
/* Define to 1 if you have the `sigprocmask' function. */
#define HAVE_SIGPROCMASK 1
/* Define to 1 if you have the `sleep' function. */
#define HAVE_SLEEP 1
/* Define to 1 if you have the `snprintf' function. */
#define HAVE_SNPRINTF 1
/* Define to 1 if you have the `socketpair' function. */
#define HAVE_SOCKETPAIR 1
/* Using Solaris threads */
/* #undef HAVE_SOLARIS_THREADS */
/* Define to 1 if you have the `srandom' function. */
#define HAVE_SRANDOM 1
/* Define if you have the SSL libraries installed. */
#define HAVE_SSL /**/
/* Define to 1 if you have the `SSL_CTX_set_alpn_protos' function. */
#define HAVE_SSL_CTX_SET_ALPN_PROTOS 1
/* Define to 1 if you have the `SSL_CTX_set_alpn_select_cb' function. */
#define HAVE_SSL_CTX_SET_ALPN_SELECT_CB 1
/* Define to 1 if you have the `SSL_CTX_set_ciphersuites' function. */
#define HAVE_SSL_CTX_SET_CIPHERSUITES 1
/* Define to 1 if you have the `SSL_CTX_set_security_level' function. */
#define HAVE_SSL_CTX_SET_SECURITY_LEVEL 1
/* Define to 1 if you have the `SSL_CTX_set_tlsext_ticket_key_evp_cb'
function. */
/* #undef HAVE_SSL_CTX_SET_TLSEXT_TICKET_KEY_EVP_CB */
/* Define to 1 if you have the `SSL_get0_alpn_selected' function. */
#define HAVE_SSL_GET0_ALPN_SELECTED 1
/* Define to 1 if you have the `SSL_get0_peername' function. */
#define HAVE_SSL_GET0_PEERNAME 1
/* Define to 1 if you have the `SSL_get1_peer_certificate' function. */
/* #undef HAVE_SSL_GET1_PEER_CERTIFICATE */
/* Define to 1 if you have the `SSL_set1_host' function. */
#define HAVE_SSL_SET1_HOST 1
/* Define to 1 if you have the <stdarg.h> header file. */
#define HAVE_STDARG_H 1
/* Define to 1 if you have the <stdbool.h> header file. */
#define HAVE_STDBOOL_H 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdio.h> header file. */
#define HAVE_STDIO_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strftime' function. */
#define HAVE_STRFTIME 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strlcat' function. */
#define HAVE_STRLCAT 1
/* Define to 1 if you have the `strlcpy' function. */
#define HAVE_STRLCPY 1
/* Define to 1 if you have the `strptime' function. */
#define HAVE_STRPTIME 1
/* Define to 1 if you have the `strsep' function. */
#define HAVE_STRSEP 1
/* Define to 1 if `ipi_spec_dst' is a member of `struct in_pktinfo'. */
/* #undef HAVE_STRUCT_IN_PKTINFO_IPI_SPEC_DST */
/* Define to 1 if `sun_len' is a member of `struct sockaddr_un'. */
#define HAVE_STRUCT_SOCKADDR_UN_SUN_LEN 1
/* Define if you have Swig libraries and header files. */
/* #undef HAVE_SWIG */
/* Define to 1 if you have the <syslog.h> header file. */
#define HAVE_SYSLOG_H 1
/* Define to 1 if systemd should be used */
/* #undef HAVE_SYSTEMD */
/* Define to 1 if you have the <sys/endian.h> header file. */
#define HAVE_SYS_ENDIAN_H 1
/* Define to 1 if you have the <sys/ipc.h> header file. */
#define HAVE_SYS_IPC_H 1
/* Define to 1 if you have the <sys/param.h> header file. */
#define HAVE_SYS_PARAM_H 1
/* Define to 1 if you have the <sys/resource.h> header file. */
#define HAVE_SYS_RESOURCE_H 1
/* Define to 1 if you have the <sys/select.h> header file. */
#define HAVE_SYS_SELECT_H 1
/* Define to 1 if you have the <sys/sha2.h> header file. */
/* #undef HAVE_SYS_SHA2_H */
/* Define to 1 if you have the <sys/shm.h> header file. */
#define HAVE_SYS_SHM_H 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/sysctl.h> header file. */
/* #undef HAVE_SYS_SYSCTL_H */
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <sys/uio.h> header file. */
#define HAVE_SYS_UIO_H 1
/* Define to 1 if you have the <sys/un.h> header file. */
#define HAVE_SYS_UN_H 1
/* Define to 1 if you have the <sys/wait.h> header file. */
#define HAVE_SYS_WAIT_H 1
/* Define to 1 if you have the <TargetConditionals.h> header file. */
/* #undef HAVE_TARGETCONDITIONALS_H */
/* Define to 1 if you have the <time.h> header file. */
#define HAVE_TIME_H 1
/* Define to 1 if you have the `tzset' function. */
#define HAVE_TZSET 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `usleep' function. */
#define HAVE_USLEEP 1
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the <vfork.h> header file. */
/* #undef HAVE_VFORK_H */
/* Define to 1 if you have the <wchar.h> header file. */
#define HAVE_WCHAR_H 1
/* Define to 1 if you have the <windows.h> header file. */
/* #undef HAVE_WINDOWS_H */
/* Using Windows threads */
/* #undef HAVE_WINDOWS_THREADS */
/* Define to 1 if you have the <winsock2.h> header file. */
/* #undef HAVE_WINSOCK2_H */
/* Define to 1 if `fork' works. */
#define HAVE_WORKING_FORK 1
/* Define to 1 if `vfork' works. */
#define HAVE_WORKING_VFORK 1
/* Define to 1 if you have the `writev' function. */
#define HAVE_WRITEV 1
/* Define to 1 if you have the <ws2tcpip.h> header file. */
/* #undef HAVE_WS2TCPIP_H */
/* Define to 1 if you have the `X509_VERIFY_PARAM_set1_host' function. */
#define HAVE_X509_VERIFY_PARAM_SET1_HOST 1
/* Define to 1 if you have the `_beginthreadex' function. */
/* #undef HAVE__BEGINTHREADEX */
/* If HMAC_Init_ex() returns void */
/* #undef HMAC_INIT_EX_RETURNS_VOID */
/* if lex has yylex_destroy */
#define LEX_HAS_YYLEX_DESTROY 1
/* Define to the sub-directory where libtool stores uninstalled libraries. */
#define LT_OBJDIR ".libs/"
/* Define to the maximum message length to pass to syslog. */
#define MAXSYSLOGMSGLEN 10240
/* Define if memcmp() does not compare unsigned bytes */
/* #undef MEMCMP_IS_BROKEN */
/* Define if mkdir has one argument. */
/* #undef MKDIR_HAS_ONE_ARG */
/* Define if the network stack does not fully support nonblocking io (causes
lower performance). */
/* #undef NONBLOCKING_IS_BROKEN */
/* Put -D_ALL_SOURCE define in config.h */
/* #undef OMITTED__D_ALL_SOURCE */
/* Put -D_BSD_SOURCE define in config.h */
/* #undef OMITTED__D_BSD_SOURCE */
/* Put -D_DEFAULT_SOURCE define in config.h */
/* #undef OMITTED__D_DEFAULT_SOURCE */
/* Put -D_GNU_SOURCE define in config.h */
/* #undef OMITTED__D_GNU_SOURCE */
/* Put -D_LARGEFILE_SOURCE=1 define in config.h */
/* #undef OMITTED__D_LARGEFILE_SOURCE_1 */
/* Put -D_POSIX_C_SOURCE=200112 define in config.h */
/* #undef OMITTED__D_POSIX_C_SOURCE_200112 */
/* Put -D_XOPEN_SOURCE=600 define in config.h */
/* #undef OMITTED__D_XOPEN_SOURCE_600 */
/* Put -D_XOPEN_SOURCE_EXTENDED=1 define in config.h */
/* #undef OMITTED__D_XOPEN_SOURCE_EXTENDED_1 */
/* Put -D__EXTENSIONS__ define in config.h */
/* #undef OMITTED__D__EXTENSIONS__ */
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "unbound-bugs@nlnetlabs.nl or https://github.com/NLnetLabs/unbound/issues"
/* Define to the full name of this package. */
#define PACKAGE_NAME "unbound"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "unbound 1.17.1"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "unbound"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "1.17.1"
/* default pidfile location */
#define PIDFILE "/var/unbound/unbound.pid"
/* Define to necessary symbol if this constant uses a non-standard name on
your system. */
/* #undef PTHREAD_CREATE_JOINABLE */
/* Return type of signal handlers, but autoconf 2.70 says 'your code may
safely assume C89 semantics that RETSIGTYPE is void.' */
#define RETSIGTYPE void
/* if REUSEPORT is enabled by default */
#define REUSEPORT_DEFAULT 0
/* default rootkey location */
#define ROOT_ANCHOR_FILE "/var/unbound/root.key"
/* default rootcert location */
#define ROOT_CERT_FILE "/var/unbound/icannbundle.pem"
/* version number for resource files */
#define RSRC_PACKAGE_VERSION 1,17,1,0
/* Directory to chdir to */
#define RUN_DIR "/var/unbound"
/* Shared data */
#define SHARE_DIR "/var/unbound"
#ifdef __LP64__
/* The size of `size_t', as computed by sizeof. */
#define SIZEOF_SIZE_T 8
/* The size of `size_t'. */
/* The size of `pthread_t', as computed by sizeof. */
#define SIZEOF_PTHREAD_T 8
#else
#define SIZEOF_SIZE_T 4
/* The size of `size_t'. */
/* The size of `pthread_t', as computed by sizeof. */
#define SIZEOF_PTHREAD_T 4
#endif
/* The size of `time_t', as computed by sizeof. */
#ifdef __i386__
#define SIZEOF_TIME_T 4
#else
#define SIZEOF_TIME_T 8
#endif
/* The size of `unsigned long', as computed by sizeof. */
#ifdef __LP64__
#define SIZEOF_UNSIGNED_LONG 8
#else
#define SIZEOF_UNSIGNED_LONG 4
#endif
/* define if (v)snprintf does not return length needed, (but length used) */
/* #undef SNPRINTF_RET_BROKEN */
/* Define to 1 if libsodium supports sodium_set_misuse_handler */
/* #undef SODIUM_MISUSE_HANDLER */
/* Define to 1 if all of the C90 standard headers exist (not just the ones
required in a freestanding environment). This macro is provided for
backward compatibility; new code need not use it. */
#define STDC_HEADERS 1
/* use default strptime. */
#define STRPTIME_WORKS 1
/* Use win32 resources and API */
/* #undef UB_ON_WINDOWS */
/* the SYSLOG_FACILITY to use, default LOG_DAEMON */
#define UB_SYSLOG_FACILITY LOG_DAEMON
/* default username */
#define UB_USERNAME "unbound"
/* use to enable lightweight alloc assertions, for debug use */
/* #undef UNBOUND_ALLOC_LITE */
/* use malloc not regions, for debug use */
/* #undef UNBOUND_ALLOC_NONREGIONAL */
/* use statistics for allocs and frees, for debug use */
/* #undef UNBOUND_ALLOC_STATS */
/* define this to enable debug checks. */
/* #undef UNBOUND_DEBUG */
/* Define to 1 to use cachedb support */
/* #undef USE_CACHEDB */
/* Define to 1 to enable dnscrypt support */
/* #undef USE_DNSCRYPT */
/* Define to 1 to enable dnscrypt with xchacha20 support */
/* #undef USE_DNSCRYPT_XCHACHA20 */
/* Define to 1 to enable dnstap support */
/* #undef USE_DNSTAP */
/* Define this to enable DSA support. */
#define USE_DSA 1
/* Define this to enable ECDSA support. */
#define USE_ECDSA 1
/* Define this to enable an EVP workaround for older openssl */
/* #undef USE_ECDSA_EVP_WORKAROUND */
/* Define this to enable ED25519 support. */
#define USE_ED25519 1
/* Define this to enable ED448 support. */
#define USE_ED448 1
/* Define this to enable GOST support. */
/* #undef USE_GOST */
/* Define to 1 to use ipsecmod support. */
/* #undef USE_IPSECMOD */
/* Define to 1 to use ipset support */
/* #undef USE_IPSET */
/* Define if you enable libevent */
#define USE_LIBEVENT 1
/* Define this to enable use of /proc/sys/net/ipv4/ip_local_port_range as a
default outgoing port range. This is only for the libunbound on Linux and
does not affect unbound resolving daemon itself. This may severely limit
the number of available outgoing ports and thus decrease randomness. Define
this only when the target system restricts (e.g. some of SELinux enabled
distributions) the use of non-ephemeral ports. */
/* #undef USE_LINUX_IP_LOCAL_PORT_RANGE */
/* Define if you want to use internal select based events */
#define USE_MINI_EVENT 1
/* Define this to enable client TCP Fast Open. */
/* #undef USE_MSG_FASTOPEN */
/* Define this to enable client TCP Fast Open. */
/* #undef USE_OSX_MSG_FASTOPEN */
/* Define this to use hiredis client. */
/* #undef USE_REDIS */
/* Define this to enable SHA1 support. */
#define USE_SHA1 1
/* Define this to enable SHA256 and SHA512 support. */
#define USE_SHA2 1
/* Enable extensions on AIX 3, Interix. */
#ifndef _ALL_SOURCE
# define _ALL_SOURCE 1
#endif
/* Enable general extensions on macOS. */
#ifndef _DARWIN_C_SOURCE
# define _DARWIN_C_SOURCE 1
#endif
/* Enable general extensions on Solaris. */
#ifndef __EXTENSIONS__
# define __EXTENSIONS__ 1
#endif
/* Enable GNU extensions on systems that have them. */
#ifndef _GNU_SOURCE
# define _GNU_SOURCE 1
#endif
/* Enable X/Open compliant socket functions that do not require linking
with -lxnet on HP-UX 11.11. */
#ifndef _HPUX_ALT_XOPEN_SOCKET_API
# define _HPUX_ALT_XOPEN_SOCKET_API 1
#endif
/* Identify the host operating system as Minix.
This macro does not affect the system headers' behavior.
A future release of Autoconf may stop defining this macro. */
#ifndef _MINIX
/* # undef _MINIX */
#endif
/* Enable general extensions on NetBSD.
Enable NetBSD compatibility extensions on Minix. */
#ifndef _NETBSD_SOURCE
# define _NETBSD_SOURCE 1
#endif
/* Enable OpenBSD compatibility extensions on NetBSD.
Oddly enough, this does nothing on OpenBSD. */
#ifndef _OPENBSD_SOURCE
# define _OPENBSD_SOURCE 1
#endif
/* Define to 1 if needed for POSIX-compatible behavior. */
#ifndef _POSIX_SOURCE
/* # undef _POSIX_SOURCE */
#endif
/* Define to 2 if needed for POSIX-compatible behavior. */
#ifndef _POSIX_1_SOURCE
/* # undef _POSIX_1_SOURCE */
#endif
/* Enable POSIX-compatible threading on Solaris. */
#ifndef _POSIX_PTHREAD_SEMANTICS
# define _POSIX_PTHREAD_SEMANTICS 1
#endif
/* Enable extensions specified by ISO/IEC TS 18661-5:2014. */
#ifndef __STDC_WANT_IEC_60559_ATTRIBS_EXT__
# define __STDC_WANT_IEC_60559_ATTRIBS_EXT__ 1
#endif
/* Enable extensions specified by ISO/IEC TS 18661-1:2014. */
#ifndef __STDC_WANT_IEC_60559_BFP_EXT__
# define __STDC_WANT_IEC_60559_BFP_EXT__ 1
#endif
/* Enable extensions specified by ISO/IEC TS 18661-2:2015. */
#ifndef __STDC_WANT_IEC_60559_DFP_EXT__
# define __STDC_WANT_IEC_60559_DFP_EXT__ 1
#endif
/* Enable extensions specified by ISO/IEC TS 18661-4:2015. */
#ifndef __STDC_WANT_IEC_60559_FUNCS_EXT__
# define __STDC_WANT_IEC_60559_FUNCS_EXT__ 1
#endif
/* Enable extensions specified by ISO/IEC TS 18661-3:2015. */
#ifndef __STDC_WANT_IEC_60559_TYPES_EXT__
# define __STDC_WANT_IEC_60559_TYPES_EXT__ 1
#endif
/* Enable extensions specified by ISO/IEC TR 24731-2:2010. */
#ifndef __STDC_WANT_LIB_EXT2__
# define __STDC_WANT_LIB_EXT2__ 1
#endif
/* Enable extensions specified by ISO/IEC 24747:2009. */
#ifndef __STDC_WANT_MATH_SPEC_FUNCS__
# define __STDC_WANT_MATH_SPEC_FUNCS__ 1
#endif
/* Enable extensions on HP NonStop. */
#ifndef _TANDEM_SOURCE
# define _TANDEM_SOURCE 1
#endif
/* Enable X/Open extensions. Define to 500 only if necessary
to make mbstate_t available. */
#ifndef _XOPEN_SOURCE
/* # undef _XOPEN_SOURCE */
#endif
/* Define this to enable server TCP Fast Open. */
/* #undef USE_TCP_FASTOPEN */
/* Whether the windows socket API is used */
/* #undef USE_WINSOCK */
/* the version of the windows API enabled */
#define WINVER 0x0502
/* Define if you want dynlib module. */
/* #undef WITH_DYNLIBMODULE */
/* Define if you want Python module. */
/* #undef WITH_PYTHONMODULE */
/* Define if you want PyUnbound. */
/* #undef WITH_PYUNBOUND */
/* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a
`char[]'. */
#define YYTEXT_POINTER 1
/* Number of bits in a file offset, on hosts where this is settable. */
/* #undef _FILE_OFFSET_BITS */
/* Define to 1 to make fseeko visible on some hosts (e.g. glibc 2.2). */
/* #undef _LARGEFILE_SOURCE */
/* Define for large files, on AIX-style hosts. */
/* #undef _LARGE_FILES */
/* Enable for compile on Minix */
#define _NETBSD_SOURCE 1
/* defined to use gcc ansi snprintf and sscanf that understands %lld when
compiled for windows. */
/* #undef __USE_MINGW_ANSI_STDIO */
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef gid_t */
/* in_addr_t */
/* #undef in_addr_t */
/* in_port_t */
/* #undef in_port_t */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define to `short' if <sys/types.h> does not define. */
/* #undef int16_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef int32_t */
/* Define to `long long' if <sys/types.h> does not define. */
/* #undef int64_t */
/* Define to `signed char' if <sys/types.h> does not define. */
/* #undef int8_t */
/* Define if replacement function should be used. */
/* #undef malloc */
/* Define to `long int' if <sys/types.h> does not define. */
/* #undef off_t */
/* Define as a signed integer type capable of holding a process identifier. */
/* #undef pid_t */
/* Define to 'int' if not defined */
/* #undef rlim_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to 'int' if not defined */
/* #undef socklen_t */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef ssize_t */
/* Define to 'unsigned char if not defined */
/* #undef u_char */
/* Define to `int' if <sys/types.h> doesn't define. */
/* #undef uid_t */
/* Define to `unsigned short' if <sys/types.h> does not define. */
/* #undef uint16_t */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef uint32_t */
/* Define to `unsigned long long' if <sys/types.h> does not define. */
/* #undef uint64_t */
/* Define to `unsigned char' if <sys/types.h> does not define. */
/* #undef uint8_t */
/* Define as `fork' if `vfork' does not work. */
/* #undef vfork */
#if defined(OMITTED__D_GNU_SOURCE) && !defined(_GNU_SOURCE)
#define _GNU_SOURCE 1
#endif
#if defined(OMITTED__D_BSD_SOURCE) && !defined(_BSD_SOURCE)
#define _BSD_SOURCE 1
#endif
#if defined(OMITTED__D_DEFAULT_SOURCE) && !defined(_DEFAULT_SOURCE)
#define _DEFAULT_SOURCE 1
#endif
#if defined(OMITTED__D__EXTENSIONS__) && !defined(__EXTENSIONS__)
#define __EXTENSIONS__ 1
#endif
#if defined(OMITTED__D_POSIX_C_SOURCE_200112) && !defined(_POSIX_C_SOURCE)
#define _POSIX_C_SOURCE 200112
#endif
#if defined(OMITTED__D_XOPEN_SOURCE_600) && !defined(_XOPEN_SOURCE)
#define _XOPEN_SOURCE 600
#endif
#if defined(OMITTED__D_XOPEN_SOURCE_EXTENDED_1) && !defined(_XOPEN_SOURCE_EXTENDED)
#define _XOPEN_SOURCE_EXTENDED 1
#endif
#if defined(OMITTED__D_ALL_SOURCE) && !defined(_ALL_SOURCE)
#define _ALL_SOURCE 1
#endif
#if defined(OMITTED__D_LARGEFILE_SOURCE_1) && !defined(_LARGEFILE_SOURCE)
#define _LARGEFILE_SOURCE 1
#endif
#ifndef _OPENBSD_SOURCE
#define _OPENBSD_SOURCE 1
#endif
#ifndef UNBOUND_DEBUG
# ifndef NDEBUG
# define NDEBUG
# endif
#endif
/** Use small-ldns codebase */
#define USE_SLDNS 1
#ifdef HAVE_SSL
# define LDNS_BUILD_CONFIG_HAVE_SSL 1
#endif
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#if STDC_HEADERS
#include <stdlib.h>
#include <stddef.h>
#endif
#ifdef HAVE_STDARG_H
#include <stdarg.h>
#endif
#ifdef HAVE_STDINT_H
#include <stdint.h>
#endif
#include <errno.h>
#if HAVE_SYS_PARAM_H
#include <sys/param.h>
#endif
#ifdef HAVE_SYS_SOCKET_H
#include <sys/socket.h>
#endif
#ifdef HAVE_SYS_UIO_H
#include <sys/uio.h>
#endif
#ifdef HAVE_NETINET_IN_H
#include <netinet/in.h>
#endif
#ifdef HAVE_NETINET_TCP_H
#include <netinet/tcp.h>
#endif
#ifdef HAVE_ARPA_INET_H
#include <arpa/inet.h>
#endif
#ifdef HAVE_WINSOCK2_H
#include <winsock2.h>
#endif
#ifdef HAVE_WS2TCPIP_H
#include <ws2tcpip.h>
#endif
#if !defined(USE_WINSOCK) || !defined(HAVE_SNPRINTF) || defined(SNPRINTF_RET_BROKEN) || defined(__USE_MINGW_ANSI_STDIO)
#define ARG_LL "%ll"
#else
#define ARG_LL "%I64"
#endif
#ifndef AF_LOCAL
#define AF_LOCAL AF_UNIX
#endif
#ifdef HAVE_ATTR_FORMAT
# define ATTR_FORMAT(archetype, string_index, first_to_check) \
__attribute__ ((format (archetype, string_index, first_to_check)))
#else /* !HAVE_ATTR_FORMAT */
# define ATTR_FORMAT(archetype, string_index, first_to_check) /* empty */
#endif /* !HAVE_ATTR_FORMAT */
#if defined(DOXYGEN)
# define ATTR_UNUSED(x) x
#elif defined(__cplusplus)
# define ATTR_UNUSED(x)
#elif defined(HAVE_ATTR_UNUSED)
# define ATTR_UNUSED(x) x __attribute__((unused))
#else /* !HAVE_ATTR_UNUSED */
# define ATTR_UNUSED(x) x
#endif /* !HAVE_ATTR_UNUSED */
#ifndef HAVE_FSEEKO
#define fseeko fseek
#define ftello ftell
#endif /* HAVE_FSEEKO */
#ifndef MAXHOSTNAMELEN
#define MAXHOSTNAMELEN 256
#endif
#if !defined(HAVE_SNPRINTF) || defined(SNPRINTF_RET_BROKEN)
#define snprintf snprintf_unbound
#define vsnprintf vsnprintf_unbound
#include <stdarg.h>
int snprintf (char *str, size_t count, const char *fmt, ...);
int vsnprintf (char *str, size_t count, const char *fmt, va_list arg);
#endif /* HAVE_SNPRINTF or SNPRINTF_RET_BROKEN */
#ifndef HAVE_INET_PTON
#define inet_pton inet_pton_unbound
int inet_pton(int af, const char* src, void* dst);
#endif /* HAVE_INET_PTON */
#ifndef HAVE_INET_NTOP
#define inet_ntop inet_ntop_unbound
const char *inet_ntop(int af, const void *src, char *dst, size_t size);
#endif
#ifndef HAVE_INET_ATON
#define inet_aton inet_aton_unbound
int inet_aton(const char *cp, struct in_addr *addr);
#endif
#ifndef HAVE_MEMMOVE
#define memmove memmove_unbound
void *memmove(void *dest, const void *src, size_t n);
#endif
#ifndef HAVE_STRLCAT
#define strlcat strlcat_unbound
size_t strlcat(char *dst, const char *src, size_t siz);
#endif
#ifndef HAVE_STRLCPY
#define strlcpy strlcpy_unbound
size_t strlcpy(char *dst, const char *src, size_t siz);
#endif
#ifndef HAVE_GMTIME_R
#define gmtime_r gmtime_r_unbound
struct tm *gmtime_r(const time_t *timep, struct tm *result);
#endif
#ifndef HAVE_REALLOCARRAY
#define reallocarray reallocarrayunbound
void* reallocarray(void *ptr, size_t nmemb, size_t size);
#endif
#if !defined(HAVE_SLEEP) || defined(HAVE_WINDOWS_H)
#define sleep(x) Sleep((x)*1000) /* on win32 */
#endif /* HAVE_SLEEP */
#ifndef HAVE_USLEEP
#define usleep(x) Sleep((x)/1000 + 1) /* on win32 */
#endif /* HAVE_USLEEP */
#ifndef HAVE_RANDOM
#define random rand /* on win32, for tests only (bad random) */
#endif /* HAVE_RANDOM */
#ifndef HAVE_SRANDOM
#define srandom(x) srand(x) /* on win32, for tests only (bad random) */
#endif /* HAVE_SRANDOM */
/* detect if we need to cast to unsigned int for FD_SET to avoid warnings */
#ifdef HAVE_WINSOCK2_H
#define FD_SET_T (u_int)
#else
#define FD_SET_T
#endif
#ifndef IPV6_MIN_MTU
#define IPV6_MIN_MTU 1280
#endif /* IPV6_MIN_MTU */
#ifdef MEMCMP_IS_BROKEN
#include "compat/memcmp.h"
#define memcmp memcmp_unbound
int memcmp(const void *x, const void *y, size_t n);
#endif
#ifndef HAVE_CTIME_R
#define ctime_r unbound_ctime_r
char *ctime_r(const time_t *timep, char *buf);
#endif
#ifndef HAVE_STRSEP
#define strsep unbound_strsep
char *strsep(char **stringp, const char *delim);
#endif
#ifndef HAVE_ISBLANK
#define isblank unbound_isblank
int isblank(int c);
#endif
#ifndef HAVE_EXPLICIT_BZERO
#define explicit_bzero unbound_explicit_bzero
void explicit_bzero(void* buf, size_t len);
#endif
#if defined(HAVE_INET_NTOP) && !HAVE_DECL_INET_NTOP
const char *inet_ntop(int af, const void *src, char *dst, size_t size);
#endif
#if defined(HAVE_INET_PTON) && !HAVE_DECL_INET_PTON
int inet_pton(int af, const char* src, void* dst);
#endif
#if !defined(HAVE_STRPTIME) || !defined(STRPTIME_WORKS)
#define strptime unbound_strptime
struct tm;
char *strptime(const char *s, const char *format, struct tm *tm);
#endif
#if !HAVE_DECL_REALLOCARRAY
void *reallocarray(void *ptr, size_t nmemb, size_t size);
#endif
#ifdef HAVE_LIBBSD
#include <bsd/string.h>
#include <bsd/stdlib.h>
#endif
#ifdef HAVE_LIBRESSL
# if !HAVE_DECL_STRLCPY
size_t strlcpy(char *dst, const char *src, size_t siz);
# endif
# if !HAVE_DECL_STRLCAT
size_t strlcat(char *dst, const char *src, size_t siz);
# endif
# if !HAVE_DECL_ARC4RANDOM && defined(HAVE_ARC4RANDOM)
uint32_t arc4random(void);
# endif
# if !HAVE_DECL_ARC4RANDOM_UNIFORM && defined(HAVE_ARC4RANDOM_UNIFORM)
uint32_t arc4random_uniform(uint32_t upper_bound);
# endif
#endif /* HAVE_LIBRESSL */
#ifndef HAVE_ARC4RANDOM
int getentropy(void* buf, size_t len);
uint32_t arc4random(void);
void arc4random_buf(void* buf, size_t n);
void _ARC4_LOCK(void);
void _ARC4_UNLOCK(void);
void _ARC4_LOCK_DESTROY(void);
#endif
#ifndef HAVE_ARC4RANDOM_UNIFORM
uint32_t arc4random_uniform(uint32_t upper_bound);
#endif
#ifdef COMPAT_SHA512
#ifndef SHA512_DIGEST_LENGTH
#define SHA512_BLOCK_LENGTH 128
#define SHA512_DIGEST_LENGTH 64
#define SHA512_DIGEST_STRING_LENGTH (SHA512_DIGEST_LENGTH * 2 + 1)
typedef struct _SHA512_CTX {
uint64_t state[8];
uint64_t bitcount[2];
uint8_t buffer[SHA512_BLOCK_LENGTH];
} SHA512_CTX;
#endif /* SHA512_DIGEST_LENGTH */
void SHA512_Init(SHA512_CTX*);
void SHA512_Update(SHA512_CTX*, void*, size_t);
void SHA512_Final(uint8_t[SHA512_DIGEST_LENGTH], SHA512_CTX*);
unsigned char *SHA512(void* data, unsigned int data_len, unsigned char *digest);
#endif /* COMPAT_SHA512 */
#if defined(HAVE_EVENT_H) && !defined(HAVE_EVENT_BASE_ONCE) && !(defined(HAVE_EV_LOOP) || defined(HAVE_EV_DEFAULT_LOOP)) && (defined(HAVE_PTHREAD) || defined(HAVE_SOLARIS_THREADS))
/* using version of libevent that is not threadsafe. */
# define LIBEVENT_SIGNAL_PROBLEM 1
#endif
#ifndef CHECKED_INET6
# define CHECKED_INET6
# ifdef AF_INET6
# define INET6
# else
# define AF_INET6 28
# endif
#endif /* CHECKED_INET6 */
#ifndef HAVE_GETADDRINFO
struct sockaddr_storage;
#include "compat/fake-rfc2553.h"
#endif
#ifdef UNBOUND_ALLOC_STATS
# define malloc(s) unbound_stat_malloc_log(s, __FILE__, __LINE__, __func__)
# define calloc(n,s) unbound_stat_calloc_log(n, s, __FILE__, __LINE__, __func__)
# define free(p) unbound_stat_free_log(p, __FILE__, __LINE__, __func__)
# define realloc(p,s) unbound_stat_realloc_log(p, s, __FILE__, __LINE__, __func__)
void *unbound_stat_malloc(size_t size);
void *unbound_stat_calloc(size_t nmemb, size_t size);
void unbound_stat_free(void *ptr);
void *unbound_stat_realloc(void *ptr, size_t size);
void *unbound_stat_malloc_log(size_t size, const char* file, int line,
const char* func);
void *unbound_stat_calloc_log(size_t nmemb, size_t size, const char* file,
int line, const char* func);
void unbound_stat_free_log(void *ptr, const char* file, int line,
const char* func);
void *unbound_stat_realloc_log(void *ptr, size_t size, const char* file,
int line, const char* func);
#elif defined(UNBOUND_ALLOC_LITE)
# include "util/alloc.h"
#endif /* UNBOUND_ALLOC_LITE and UNBOUND_ALLOC_STATS */
/** default port for DNS traffic. */
#define UNBOUND_DNS_PORT 53
/** default port for DNS over TLS traffic. */
#define UNBOUND_DNS_OVER_TLS_PORT 853
/** default port for DNS over HTTPS traffic. */
#define UNBOUND_DNS_OVER_HTTPS_PORT 443
/** default port for unbound control traffic, registered port with IANA,
ub-dns-control 8953/tcp unbound dns nameserver control */
#define UNBOUND_CONTROL_PORT 8953
/** the version of unbound-control that this software implements */
#define UNBOUND_CONTROL_VERSION 1
diff --git a/usr.sbin/usbconfig/dump.c b/usr.sbin/usbconfig/dump.c
index dbd5287551fc..493c518b9ae2 100644
--- a/usr.sbin/usbconfig/dump.c
+++ b/usr.sbin/usbconfig/dump.c
@@ -1,514 +1,513 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <err.h>
#include <string.h>
#include <pwd.h>
#include <grp.h>
#include <ctype.h>
#include <libusb20.h>
#include <libusb20_desc.h>
#include "dump.h"
#define DUMP0(n,type,field,...) dump_field(pdev, " ", #field, n->field);
#define DUMP1(n,type,field,...) dump_field(pdev, " ", #field, n->field);
#define DUMP2(n,type,field,...) dump_field(pdev, " ", #field, n->field);
#define DUMP3(n,type,field,...) dump_field(pdev, " ", #field, n->field);
const char *
dump_mode(uint8_t value)
{
if (value == LIBUSB20_MODE_HOST)
return ("HOST");
return ("DEVICE");
}
const char *
dump_speed(uint8_t value)
{
; /* style fix */
switch (value) {
case LIBUSB20_SPEED_LOW:
return ("LOW (1.5Mbps)");
case LIBUSB20_SPEED_FULL:
return ("FULL (12Mbps)");
case LIBUSB20_SPEED_HIGH:
return ("HIGH (480Mbps)");
case LIBUSB20_SPEED_VARIABLE:
return ("VARIABLE (52-480Mbps)");
case LIBUSB20_SPEED_SUPER:
return ("SUPER (5.0Gbps)");
default:
break;
}
return ("UNKNOWN ()");
}
const char *
dump_power_mode(uint8_t value)
{
; /* style fix */
switch (value) {
case LIBUSB20_POWER_OFF:
return ("OFF");
case LIBUSB20_POWER_ON:
return ("ON");
case LIBUSB20_POWER_SAVE:
return ("SAVE");
case LIBUSB20_POWER_SUSPEND:
return ("SUSPEND");
case LIBUSB20_POWER_RESUME:
return ("RESUME");
default:
return ("UNKNOWN");
}
}
static void
dump_field(struct libusb20_device *pdev, const char *plevel,
const char *field, uint32_t value)
{
uint8_t temp_string[256];
printf("%s%s = 0x%04x ", plevel, field, value);
if (strlen(plevel) == 8) {
/* Endpoint Descriptor */
if (strcmp(field, "bEndpointAddress") == 0) {
if (value & 0x80)
printf(" <IN>\n");
else
printf(" <OUT>\n");
return;
}
if (strcmp(field, "bmAttributes") == 0) {
switch (value & 0x03) {
case 0:
printf(" <CONTROL>\n");
break;
case 1:
switch (value & 0x0C) {
case 0x00:
printf(" <ISOCHRONOUS>\n");
break;
case 0x04:
printf(" <ASYNC-ISOCHRONOUS>\n");
break;
case 0x08:
printf(" <ADAPT-ISOCHRONOUS>\n");
break;
default:
printf(" <SYNC-ISOCHRONOUS>\n");
break;
}
break;
case 2:
printf(" <BULK>\n");
break;
default:
printf(" <INTERRUPT>\n");
break;
}
return;
}
}
if ((field[0] == 'i') && (field[1] != 'd')) {
/* Indirect String Descriptor */
if (value == 0) {
printf(" <no string>\n");
return;
}
if (libusb20_dev_req_string_simple_sync(pdev, value,
temp_string, sizeof(temp_string))) {
printf(" <retrieving string failed>\n");
return;
}
printf(" <%s>\n", temp_string);
return;
}
if (strlen(plevel) == 2 || strlen(plevel) == 6) {
/* Device and Interface Descriptor class codes */
if (strcmp(field, "bInterfaceClass") == 0 ||
strcmp(field, "bDeviceClass") == 0) {
switch (value) {
case 0x00:
printf(" <Probed by interface class>\n");
break;
case 0x01:
printf(" <Audio device>\n");
break;
case 0x02:
printf(" <Communication device>\n");
break;
case 0x03:
printf(" <HID device>\n");
break;
case 0x05:
printf(" <Physical device>\n");
break;
case 0x06:
printf(" <Still imaging>\n");
break;
case 0x07:
printf(" <Printer device>\n");
break;
case 0x08:
printf(" <Mass storage>\n");
break;
case 0x09:
printf(" <HUB>\n");
break;
case 0x0A:
printf(" <CDC-data>\n");
break;
case 0x0B:
printf(" <Smart card>\n");
break;
case 0x0D:
printf(" <Content security>\n");
break;
case 0x0E:
printf(" <Video device>\n");
break;
case 0x0F:
printf(" <Personal healthcare>\n");
break;
case 0x10:
printf(" <Audio and video device>\n");
break;
case 0x11:
printf(" <Billboard device>\n");
break;
case 0xDC:
printf(" <Diagnostic device>\n");
break;
case 0xE0:
printf(" <Wireless controller>\n");
break;
case 0xEF:
printf(" <Miscellaneous device>\n");
break;
case 0xFE:
printf(" <Application specific>\n");
break;
case 0xFF:
printf(" <Vendor specific>\n");
break;
default:
printf(" <Unknown>\n");
break;
}
return;
}
}
/* No additional information */
printf("\n");
}
static void
dump_extra(struct libusb20_me_struct *str, const char *plevel)
{
const uint8_t *ptr;
uint8_t x;
ptr = NULL;
while ((ptr = libusb20_desc_foreach(str, ptr))) {
printf("\n" "%sAdditional Descriptor\n\n", plevel);
printf("%sbLength = 0x%02x\n", plevel, ptr[0]);
printf("%sbDescriptorType = 0x%02x\n", plevel, ptr[1]);
if (ptr[0] > 1)
printf("%sbDescriptorSubType = 0x%02x\n",
plevel, ptr[2]);
printf("%s RAW dump: ", plevel);
for (x = 0; x != ptr[0]; x++) {
if ((x % 8) == 0) {
printf("\n%s 0x%02x | ", plevel, x);
}
printf("0x%02x%s", ptr[x],
(x != (ptr[0] - 1)) ? ", " : (x % 8) ? "\n" : "");
}
printf("\n");
}
return;
}
static void
dump_endpoint(struct libusb20_device *pdev,
struct libusb20_endpoint *ep)
{
struct LIBUSB20_ENDPOINT_DESC_DECODED *edesc;
edesc = &ep->desc;
LIBUSB20_ENDPOINT_DESC(DUMP3, edesc);
dump_extra(&ep->extra, " " " " " ");
return;
}
static void
dump_iface(struct libusb20_device *pdev,
struct libusb20_interface *iface)
{
struct LIBUSB20_INTERFACE_DESC_DECODED *idesc;
uint8_t z;
idesc = &iface->desc;
LIBUSB20_INTERFACE_DESC(DUMP2, idesc);
dump_extra(&iface->extra, " " " " " ");
for (z = 0; z != iface->num_endpoints; z++) {
printf("\n Endpoint %u\n", z);
dump_endpoint(pdev, iface->endpoints + z);
}
return;
}
void
dump_device_info(struct libusb20_device *pdev, uint8_t show_ifdrv)
{
char buf[128];
uint8_t n;
unsigned int usage;
usage = libusb20_dev_get_power_usage(pdev);
printf("%s, cfg=%u md=%s spd=%s pwr=%s (%umA)\n",
libusb20_dev_get_desc(pdev),
libusb20_dev_get_config_index(pdev),
dump_mode(libusb20_dev_get_mode(pdev)),
dump_speed(libusb20_dev_get_speed(pdev)),
dump_power_mode(libusb20_dev_get_power_mode(pdev)),
usage);
if (!show_ifdrv)
return;
for (n = 0; n != 255; n++) {
if (libusb20_dev_get_iface_desc(pdev, n, buf, sizeof(buf)))
break;
if (buf[0] == 0)
continue;
printf("ugen%u.%u.%u: %s\n",
libusb20_dev_get_bus_number(pdev),
libusb20_dev_get_address(pdev), n, buf);
}
}
void
dump_be_quirk_names(struct libusb20_backend *pbe)
{
struct libusb20_quirk q;
uint16_t x;
int error;
memset(&q, 0, sizeof(q));
printf("\nDumping list of supported quirks:\n\n");
for (x = 0; x != 0xFFFF; x++) {
error = libusb20_be_get_quirk_name(pbe, x, &q);
if (error) {
if (x == 0) {
printf("No quirk names - maybe the USB quirk "
"module has not been loaded.\n");
}
break;
}
if (strcmp(q.quirkname, "UQ_NONE"))
printf("%s\n", q.quirkname);
}
printf("\n");
return;
}
void
dump_be_dev_quirks(struct libusb20_backend *pbe)
{
struct libusb20_quirk q;
uint16_t x;
int error;
memset(&q, 0, sizeof(q));
printf("\nDumping current device quirks:\n\n");
for (x = 0; x != 0xFFFF; x++) {
error = libusb20_be_get_dev_quirk(pbe, x, &q);
if (error) {
if (x == 0) {
printf("No device quirks - maybe the USB quirk "
"module has not been loaded.\n");
}
break;
}
if (strcmp(q.quirkname, "UQ_NONE")) {
printf("VID=0x%04x PID=0x%04x REVLO=0x%04x "
"REVHI=0x%04x QUIRK=%s\n",
q.vid, q.pid, q.bcdDeviceLow,
q.bcdDeviceHigh, q.quirkname);
}
}
printf("\n");
return;
}
void
dump_device_desc(struct libusb20_device *pdev)
{
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
ddesc = libusb20_dev_get_device_desc(pdev);
LIBUSB20_DEVICE_DESC(DUMP0, ddesc);
return;
}
void
dump_config(struct libusb20_device *pdev, uint8_t all_cfg)
{
struct LIBUSB20_CONFIG_DESC_DECODED *cdesc;
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
struct libusb20_config *pcfg = NULL;
uint8_t cfg_index;
uint8_t cfg_index_end;
uint8_t x;
uint8_t y;
ddesc = libusb20_dev_get_device_desc(pdev);
if (all_cfg) {
cfg_index = 0;
cfg_index_end = ddesc->bNumConfigurations;
} else {
cfg_index = libusb20_dev_get_config_index(pdev);
cfg_index_end = cfg_index + 1;
}
for (; cfg_index != cfg_index_end; cfg_index++) {
pcfg = libusb20_dev_alloc_config(pdev, cfg_index);
if (!pcfg) {
continue;
}
printf("\n Configuration index %u\n\n", cfg_index);
cdesc = &(pcfg->desc);
LIBUSB20_CONFIG_DESC(DUMP1, cdesc);
dump_extra(&(pcfg->extra), " " " ");
for (x = 0; x != pcfg->num_interface; x++) {
printf("\n Interface %u\n", x);
dump_iface(pdev, pcfg->interface + x);
printf("\n");
for (y = 0; y != (pcfg->interface + x)->num_altsetting; y++) {
printf("\n Interface %u Alt %u\n", x, y + 1);
dump_iface(pdev,
(pcfg->interface + x)->altsetting + y);
printf("\n");
}
}
printf("\n");
free(pcfg);
}
return;
}
void
dump_string_by_index(struct libusb20_device *pdev, uint8_t str_index)
{
char *pbuf;
uint8_t n;
uint8_t len;
pbuf = malloc(256);
if (pbuf == NULL)
err(1, "out of memory");
if (str_index == 0) {
/* language table */
if (libusb20_dev_req_string_sync(pdev,
str_index, 0, pbuf, 256)) {
printf("STRING_0x%02x = <read error>\n", str_index);
} else {
printf("STRING_0x%02x = ", str_index);
len = (uint8_t)pbuf[0];
for (n = 0; n != len; n++) {
printf("0x%02x%s", (uint8_t)pbuf[n],
(n != (len - 1)) ? ", " : "");
}
printf("\n");
}
} else {
/* ordinary string */
if (libusb20_dev_req_string_simple_sync(pdev,
str_index, pbuf, 256)) {
printf("STRING_0x%02x = <read error>\n", str_index);
} else {
printf("STRING_0x%02x = <%s>\n", str_index, pbuf);
}
}
free(pbuf);
}
void
dump_device_stats(struct libusb20_device *pdev)
{
struct libusb20_device_stats st;
if (libusb20_dev_get_stats(pdev, &st)) {
printf("{}\n");
} else {
printf("{\n"
" UE_CONTROL_OK : %llu\n"
" UE_ISOCHRONOUS_OK : %llu\n"
" UE_BULK_OK : %llu\n"
" UE_INTERRUPT_OK : %llu\n"
" UE_CONTROL_FAIL : %llu\n"
" UE_ISOCHRONOUS_FAIL : %llu\n"
" UE_BULK_FAIL : %llu\n"
" UE_INTERRUPT_FAIL : %llu\n"
"}\n",
(unsigned long long)st.xfer_ok[0],
(unsigned long long)st.xfer_ok[1],
(unsigned long long)st.xfer_ok[2],
(unsigned long long)st.xfer_ok[3],
(unsigned long long)st.xfer_fail[0],
(unsigned long long)st.xfer_fail[1],
(unsigned long long)st.xfer_fail[2],
(unsigned long long)st.xfer_fail[3]);
}
}
diff --git a/usr.sbin/usbconfig/dump.h b/usr.sbin/usbconfig/dump.h
index d2935fe3924d..71adb47262ea 100644
--- a/usr.sbin/usbconfig/dump.h
+++ b/usr.sbin/usbconfig/dump.h
@@ -1,43 +1,42 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#ifndef _DUMP_H_
#define _DUMP_H_
const char *dump_mode(uint8_t value);
const char *dump_speed(uint8_t value);
const char *dump_power_mode(uint8_t value);
void dump_string_by_index(struct libusb20_device *pdev, uint8_t index);
void dump_device_info(struct libusb20_device *pdev, uint8_t show_drv);
void dump_be_quirk_names(struct libusb20_backend *pbe);
void dump_be_dev_quirks(struct libusb20_backend *pbe);
void dump_device_desc(struct libusb20_device *pdev);
void dump_device_stats(struct libusb20_device *pdev);
void dump_config(struct libusb20_device *pdev, uint8_t all_cfg);
#endif /* _DUMP_H_ */
diff --git a/usr.sbin/usbconfig/usbconfig.c b/usr.sbin/usbconfig/usbconfig.c
index ff0ef711d64f..34d179f09b98 100644
--- a/usr.sbin/usbconfig/usbconfig.c
+++ b/usr.sbin/usbconfig/usbconfig.c
@@ -1,898 +1,897 @@
-/* $FreeBSD$ */
/*-
* SPDX-License-Identifier: BSD-2-Clause
*
* Copyright (c) 2008-2009 Hans Petter Selasky. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <err.h>
#include <sysexits.h>
#include <string.h>
#include <unistd.h>
#include <pwd.h>
#include <grp.h>
#include <errno.h>
#include <ctype.h>
#include <sys/types.h>
#include <libusb20_desc.h>
#include <libusb20.h>
#include "dump.h"
struct options {
const char *quirkname;
void *buffer;
int template;
gid_t gid;
uid_t uid;
mode_t mode;
uint32_t got_any;
struct LIBUSB20_CONTROL_SETUP_DECODED setup;
uint16_t bus;
uint16_t addr;
uint16_t iface;
uint16_t vid;
uint16_t pid;
uint16_t lo_rev; /* inclusive */
uint16_t hi_rev; /* inclusive */
uint8_t string_index;
uint8_t config_index;
uint8_t alt_index;
uint8_t got_list:1;
uint8_t got_bus:1;
uint8_t got_addr:1;
uint8_t got_set_config:1;
uint8_t got_set_alt:1;
uint8_t got_set_template:1;
uint8_t got_get_template:1;
uint8_t got_suspend:1;
uint8_t got_resume:1;
uint8_t got_reset:1;
uint8_t got_power_off:1;
uint8_t got_power_save:1;
uint8_t got_power_on:1;
uint8_t got_dump_device_quirks:1;
uint8_t got_dump_quirk_names:1;
uint8_t got_dump_all_desc:1;
uint8_t got_dump_device_desc:1;
uint8_t got_dump_curr_config:1;
uint8_t got_dump_all_config:1;
uint8_t got_dump_info:1;
uint8_t got_dump_stats:1;
uint8_t got_show_iface_driver:1;
uint8_t got_remove_device_quirk:1;
uint8_t got_add_device_quirk:1;
uint8_t got_remove_quirk:1;
uint8_t got_add_quirk:1;
uint8_t got_dump_string:1;
uint8_t got_do_request:1;
uint8_t got_detach_kernel_driver:1;
};
struct token {
const char *name;
uint8_t value;
uint8_t narg;
};
enum {
T_SET_CONFIG,
T_SET_ALT,
T_SET_TEMPLATE,
T_GET_TEMPLATE,
T_ADD_DEVICE_QUIRK,
T_REMOVE_DEVICE_QUIRK,
T_ADD_QUIRK,
T_REMOVE_QUIRK,
T_SHOW_IFACE_DRIVER,
T_DETACH_KERNEL_DRIVER,
T_DUMP_QUIRK_NAMES,
T_DUMP_DEVICE_QUIRKS,
T_DUMP_ALL_DESC,
T_DUMP_DEVICE_DESC,
T_DUMP_CURR_CONFIG_DESC,
T_DUMP_ALL_CONFIG_DESC,
T_DUMP_STRING,
T_DUMP_INFO,
T_DUMP_STATS,
T_SUSPEND,
T_RESUME,
T_POWER_OFF,
T_POWER_SAVE,
T_POWER_ON,
T_RESET,
T_LIST,
T_DO_REQUEST,
};
static struct options options;
static const struct token token[] = {
{"set_config", T_SET_CONFIG, 1},
{"set_alt", T_SET_ALT, 1},
{"set_template", T_SET_TEMPLATE, 1},
{"get_template", T_GET_TEMPLATE, 0},
{"add_dev_quirk_vplh", T_ADD_DEVICE_QUIRK, 5},
{"remove_dev_quirk_vplh", T_REMOVE_DEVICE_QUIRK, 5},
{"add_quirk", T_ADD_QUIRK, 1},
{"remove_quirk", T_REMOVE_QUIRK, 1},
{"detach_kernel_driver", T_DETACH_KERNEL_DRIVER, 0},
{"dump_quirk_names", T_DUMP_QUIRK_NAMES, 0},
{"dump_device_quirks", T_DUMP_DEVICE_QUIRKS, 0},
{"dump_all_desc", T_DUMP_ALL_DESC, 0},
{"dump_device_desc", T_DUMP_DEVICE_DESC, 0},
{"dump_curr_config_desc", T_DUMP_CURR_CONFIG_DESC, 0},
{"dump_all_config_desc", T_DUMP_ALL_CONFIG_DESC, 0},
{"dump_string", T_DUMP_STRING, 1},
{"dump_info", T_DUMP_INFO, 0},
{"dump_stats", T_DUMP_STATS, 0},
{"show_ifdrv", T_SHOW_IFACE_DRIVER, 0},
{"suspend", T_SUSPEND, 0},
{"resume", T_RESUME, 0},
{"power_off", T_POWER_OFF, 0},
{"power_save", T_POWER_SAVE, 0},
{"power_on", T_POWER_ON, 0},
{"reset", T_RESET, 0},
{"list", T_LIST, 0},
{"do_request", T_DO_REQUEST, 5},
};
static void
be_dev_remove_quirk(struct libusb20_backend *pbe,
uint16_t vid, uint16_t pid, uint16_t lorev, uint16_t hirev,
const char *str)
{
struct libusb20_quirk q;
int error;
memset(&q, 0, sizeof(q));
q.vid = vid;
q.pid = pid;
q.bcdDeviceLow = lorev;
q.bcdDeviceHigh = hirev;
strlcpy(q.quirkname, str, sizeof(q.quirkname));
error = libusb20_be_remove_dev_quirk(pbe, &q);
if (error) {
fprintf(stderr, "Removing quirk '%s' failed, continuing.\n", str);
}
return;
}
static void
be_dev_add_quirk(struct libusb20_backend *pbe,
uint16_t vid, uint16_t pid, uint16_t lorev, uint16_t hirev,
const char *str)
{
struct libusb20_quirk q;
int error;
memset(&q, 0, sizeof(q));
q.vid = vid;
q.pid = pid;
q.bcdDeviceLow = lorev;
q.bcdDeviceHigh = hirev;
strlcpy(q.quirkname, str, sizeof(q.quirkname));
error = libusb20_be_add_dev_quirk(pbe, &q);
if (error) {
fprintf(stderr, "Adding quirk '%s' failed, continuing.\n", str);
}
return;
}
static uint8_t
get_token(const char *str, uint8_t narg)
{
uint8_t n;
for (n = 0; n != (sizeof(token) / sizeof(token[0])); n++) {
if (strcasecmp(str, token[n].name) == 0) {
if (token[n].narg > narg) {
/* too few arguments */
break;
}
return (token[n].value);
}
}
return (0 - 1);
}
static uid_t
num_id(const char *name, const char *type)
{
uid_t val;
char *ep;
errno = 0;
val = strtoul(name, &ep, 0);
if (errno) {
err(1, "%s", name);
}
if (*ep != '\0') {
errx(1, "%s: illegal %s name", name, type);
}
return (val);
}
static int
get_int(const char *s)
{
int val;
char *ep;
errno = 0;
val = strtoul(s, &ep, 0);
if (errno) {
err(1, "%s", s);
}
if (*ep != '\0') {
errx(1, "illegal number: %s", s);
}
return val;
}
static void
duplicate_option(const char *ptr)
{
fprintf(stderr, "Syntax error: "
"Duplicate option: '%s'\n", ptr);
exit(1);
}
static void
usage(int exitcode)
{
fprintf(stderr, ""
"usbconfig - configure the USB subsystem" "\n"
"usage: usbconfig [-u <busnum>] [-a <devaddr>] [-i <ifaceindex>] [-v] [cmds...]" "\n"
"usage: usbconfig -d [ugen]<busnum>.<devaddr> [-i <ifaceindex>] [-v] [cmds...]" "\n"
"commands:" "\n"
" set_config <cfg_index>" "\n"
" set_alt <alt_index>" "\n"
" set_template <template>" "\n"
" get_template" "\n"
" add_dev_quirk_vplh <vid> <pid> <lo_rev> <hi_rev> <quirk>" "\n"
" remove_dev_quirk_vplh <vid> <pid> <lo_rev> <hi_rev> <quirk>" "\n"
" add_quirk <quirk>" "\n"
" remove_quirk <quirk>" "\n"
" detach_kernel_driver" "\n"
" dump_quirk_names" "\n"
" dump_device_quirks" "\n"
" dump_all_desc" "\n"
" dump_device_desc" "\n"
" dump_curr_config_desc" "\n"
" dump_all_config_desc" "\n"
" dump_string <index>" "\n"
" dump_info" "\n"
" dump_stats" "\n"
" show_ifdrv" "\n"
" suspend" "\n"
" resume" "\n"
" power_off" "\n"
" power_save" "\n"
" power_on" "\n"
" reset" "\n"
" list" "\n"
" do_request <bmReqTyp> <bReq> <wVal> <wIdx> <wLen> <data...>" "\n"
);
exit(exitcode);
}
static void
reset_options(struct options *opt)
{
if (opt->buffer)
free(opt->buffer);
memset(opt, 0, sizeof(*opt));
return;
}
static void
flush_command(struct libusb20_backend *pbe, struct options *opt)
{
struct libusb20_device *pdev = NULL;
uint32_t matches = 0;
uint8_t dump_any;
/* check for invalid option combinations */
if ((opt->got_suspend +
opt->got_resume +
opt->got_reset +
opt->got_set_config +
opt->got_set_alt +
opt->got_power_save +
opt->got_power_on +
opt->got_power_off) > 1) {
err(1, "can only specify one of 'set_config', "
"'set_alt', 'reset', 'suspend', 'resume', "
"'power_save', 'power_on' and 'power_off' "
"at the same time!");
}
if (opt->got_dump_quirk_names) {
opt->got_any--;
dump_be_quirk_names(pbe);
}
if (opt->got_dump_device_quirks) {
opt->got_any--;
dump_be_dev_quirks(pbe);
}
if (opt->got_remove_device_quirk) {
opt->got_any--;
be_dev_remove_quirk(pbe,
opt->vid, opt->pid, opt->lo_rev, opt->hi_rev, opt->quirkname);
}
if (opt->got_add_device_quirk) {
opt->got_any--;
be_dev_add_quirk(pbe,
opt->vid, opt->pid, opt->lo_rev, opt->hi_rev, opt->quirkname);
}
if (opt->got_set_template) {
opt->got_any--;
if (libusb20_be_set_template(pbe, opt->template)) {
fprintf(stderr, "Setting USB template %u failed, "
"continuing.\n", opt->template);
}
}
if (opt->got_get_template) {
opt->got_any--;
if (libusb20_be_get_template(pbe, &opt->template))
printf("USB template: <unknown>\n");
else
printf("USB template: %u\n", opt->template);
}
if (opt->got_any == 0) {
/*
* do not scan through all the devices if there are no valid
* options
*/
goto done;
}
while ((pdev = libusb20_be_device_foreach(pbe, pdev))) {
if (opt->got_bus &&
(libusb20_dev_get_bus_number(pdev) != opt->bus)) {
continue;
}
if (opt->got_addr &&
(libusb20_dev_get_address(pdev) != opt->addr)) {
continue;
}
matches++;
if (opt->got_remove_quirk) {
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
ddesc = libusb20_dev_get_device_desc(pdev);
be_dev_remove_quirk(pbe,
ddesc->idVendor, ddesc->idProduct,
ddesc->bcdDevice, ddesc->bcdDevice,
opt->quirkname);
}
if (opt->got_add_quirk) {
struct LIBUSB20_DEVICE_DESC_DECODED *ddesc;
ddesc = libusb20_dev_get_device_desc(pdev);
be_dev_add_quirk(pbe,
ddesc->idVendor, ddesc->idProduct,
ddesc->bcdDevice, ddesc->bcdDevice,
opt->quirkname);
}
if (libusb20_dev_open(pdev, 0)) {
err(1, "could not open device");
}
if (opt->got_dump_string) {
dump_string_by_index(pdev, opt->string_index);
}
if (opt->got_do_request) {
uint16_t actlen;
uint16_t t;
if (libusb20_dev_request_sync(pdev, &opt->setup,
opt->buffer, &actlen, 5000 /* 5 seconds */ , 0)) {
printf("REQUEST = <ERROR>\n");
} else if (!(opt->setup.bmRequestType &
LIBUSB20_ENDPOINT_IN)) {
printf("REQUEST = <OK>\n");
} else {
t = actlen;
printf("REQUEST = <");
for (t = 0; t != actlen; t++) {
printf("0x%02x%s",
((uint8_t *)opt->buffer)[t],
(t == (actlen - 1)) ? "" : " ");
}
printf("><");
for (t = 0; t != actlen; t++) {
char c;
c = ((uint8_t *)opt->buffer)[t];
if ((c != '<') &&
(c != '>') && isprint(c)) {
putchar(c);
}
}
printf(">\n");
}
}
if (opt->got_set_config) {
if (libusb20_dev_set_config_index(pdev,
opt->config_index)) {
err(1, "could not set config index");
}
}
if (opt->got_set_alt) {
if (libusb20_dev_set_alt_index(pdev, opt->iface,
opt->alt_index)) {
err(1, "could not set alternate setting");
}
}
if (opt->got_reset) {
if (libusb20_dev_reset(pdev)) {
err(1, "could not reset device");
}
}
if (opt->got_suspend) {
if (libusb20_dev_set_power_mode(pdev,
LIBUSB20_POWER_SUSPEND)) {
err(1, "could not set suspend");
}
}
if (opt->got_resume) {
if (libusb20_dev_set_power_mode(pdev,
LIBUSB20_POWER_RESUME)) {
err(1, "could not set resume");
}
}
if (opt->got_power_off) {
if (libusb20_dev_set_power_mode(pdev,
LIBUSB20_POWER_OFF)) {
err(1, "could not set power OFF");
}
}
if (opt->got_power_save) {
if (libusb20_dev_set_power_mode(pdev,
LIBUSB20_POWER_SAVE)) {
err(1, "could not set power SAVE");
}
}
if (opt->got_power_on) {
if (libusb20_dev_set_power_mode(pdev,
LIBUSB20_POWER_ON)) {
err(1, "could not set power ON");
}
}
if (opt->got_detach_kernel_driver) {
if (libusb20_dev_detach_kernel_driver(pdev, opt->iface)) {
err(1, "could not detach kernel driver");
}
}
dump_any =
(opt->got_dump_all_desc ||
opt->got_dump_device_desc ||
opt->got_dump_curr_config ||
opt->got_dump_all_config ||
opt->got_dump_info ||
opt->got_dump_stats);
if (opt->got_list || dump_any) {
dump_device_info(pdev,
opt->got_show_iface_driver);
}
if (opt->got_dump_device_desc) {
printf("\n");
dump_device_desc(pdev);
}
if (opt->got_dump_all_config) {
printf("\n");
dump_config(pdev, 1);
} else if (opt->got_dump_curr_config) {
printf("\n");
dump_config(pdev, 0);
} else if (opt->got_dump_all_desc) {
printf("\n");
dump_device_desc(pdev);
dump_config(pdev, 1);
}
if (opt->got_dump_stats) {
printf("\n");
dump_device_stats(pdev);
}
if (dump_any) {
printf("\n");
}
if (libusb20_dev_close(pdev)) {
err(1, "could not close device");
}
}
if (matches == 0) {
printf("No device match or lack of permissions.\n");
}
done:
reset_options(opt);
return;
}
int
main(int argc, char **argv)
{
struct libusb20_backend *pbe;
struct options *opt = &options;
const char *ptr;
int unit;
int addr;
int n;
int t;
int ch;
if (argc < 1) {
usage(EX_USAGE);
}
pbe = libusb20_be_alloc_default();
if (pbe == NULL)
err(1, "could not access USB backend\n");
while ((ch = getopt(argc, argv, "a:d:hi:u:v")) != -1) {
switch (ch) {
case 'a':
opt->addr = num_id(optarg, "addr");
opt->got_addr = 1;
break;
case 'd':
if (strncmp(optarg, "ugen", strlen("ugen")) == 0) {
ptr = optarg + strlen("ugen");
} else if (strncmp(optarg, "/dev/ugen",
strlen("/dev/ugen")) == 0) {
ptr = optarg + strlen("/dev/ugen");
} else {
ptr = optarg;
}
if ((sscanf(ptr, "%d.%d",
&unit, &addr) != 2) ||
(unit < 0) || (unit > 65535) ||
(addr < 0) || (addr > 65535)) {
errx(1, "cannot "
"parse '%s'", optarg);
}
opt->bus = unit;
opt->addr = addr;
opt->got_bus = 1;
opt->got_addr = 1;
break;
case 'h':
usage(EX_OK);
break;
case 'i':
opt->iface = num_id(optarg, "iface");
break;
case 'u':
opt->bus = num_id(optarg, "busnum");
opt->got_bus = 1;
break;
case 'v':
opt->got_dump_device_desc = 1;
opt->got_dump_curr_config = 1;
opt->got_show_iface_driver = 1;
opt->got_any += 2; /* only the dump options count */
break;
default:
usage(EX_USAGE);
}
}
argc -= optind;
argv += optind;
for (n = 0; n != argc; n++) {
/* get number of additional options */
t = (argc - n - 1);
if (t > 255)
t = 255;
switch (get_token(argv[n], t)) {
case T_ADD_QUIRK:
if (opt->got_add_quirk) {
flush_command(pbe, opt);
}
opt->quirkname = argv[n + 1];
n++;
opt->got_add_quirk = 1;
opt->got_any++;
break;
case T_REMOVE_QUIRK:
if (opt->got_remove_quirk) {
flush_command(pbe, opt);
}
opt->quirkname = argv[n + 1];
n++;
opt->got_remove_quirk = 1;
opt->got_any++;
break;
case T_ADD_DEVICE_QUIRK:
if (opt->got_add_device_quirk) {
flush_command(pbe, opt);
}
opt->vid = num_id(argv[n + 1], "Vendor ID");
opt->pid = num_id(argv[n + 2], "Product ID");
opt->lo_rev = num_id(argv[n + 3], "Low Revision");
opt->hi_rev = num_id(argv[n + 4], "High Revision");
opt->quirkname = argv[n + 5];
n += 5;
opt->got_add_device_quirk = 1;
opt->got_any++;
break;
case T_REMOVE_DEVICE_QUIRK:
if (opt->got_remove_device_quirk) {
flush_command(pbe, opt);
}
opt->vid = num_id(argv[n + 1], "Vendor ID");
opt->pid = num_id(argv[n + 2], "Product ID");
opt->lo_rev = num_id(argv[n + 3], "Low Revision");
opt->hi_rev = num_id(argv[n + 4], "High Revision");
opt->quirkname = argv[n + 5];
n += 5;
opt->got_remove_device_quirk = 1;
opt->got_any++;
break;
case T_DETACH_KERNEL_DRIVER:
if (opt->got_detach_kernel_driver)
duplicate_option(argv[n]);
opt->got_detach_kernel_driver = 1;
opt->got_any++;
break;
case T_DUMP_QUIRK_NAMES:
if (opt->got_dump_quirk_names)
duplicate_option(argv[n]);
opt->got_dump_quirk_names = 1;
opt->got_any++;
break;
case T_DUMP_DEVICE_QUIRKS:
if (opt->got_dump_device_quirks)
duplicate_option(argv[n]);
opt->got_dump_device_quirks = 1;
opt->got_any++;
break;
case T_SHOW_IFACE_DRIVER:
opt->got_show_iface_driver = 1;
break;
case T_SET_CONFIG:
if (opt->got_set_config)
duplicate_option(argv[n]);
opt->config_index = num_id(argv[n + 1], "cfg_index");
opt->got_set_config = 1;
opt->got_any++;
n++;
break;
case T_SET_ALT:
if (opt->got_set_alt)
duplicate_option(argv[n]);
opt->alt_index = num_id(argv[n + 1], "cfg_index");
opt->got_set_alt = 1;
opt->got_any++;
n++;
break;
case T_SET_TEMPLATE:
if (opt->got_set_template)
duplicate_option(argv[n]);
opt->template = get_int(argv[n + 1]);
opt->got_set_template = 1;
opt->got_any++;
n++;
break;
case T_GET_TEMPLATE:
if (opt->got_get_template)
duplicate_option(argv[n]);
opt->got_get_template = 1;
opt->got_any++;
break;
case T_DUMP_ALL_DESC:
if (opt->got_dump_all_desc)
duplicate_option(argv[n]);
opt->got_dump_all_desc = 1;
opt->got_any++;
break;
case T_DUMP_DEVICE_DESC:
if (opt->got_dump_device_desc)
duplicate_option(argv[n]);
opt->got_dump_device_desc = 1;
opt->got_any++;
break;
case T_DUMP_CURR_CONFIG_DESC:
if (opt->got_dump_curr_config)
duplicate_option(argv[n]);
opt->got_dump_curr_config = 1;
opt->got_any++;
break;
case T_DUMP_ALL_CONFIG_DESC:
if (opt->got_dump_all_config)
duplicate_option(argv[n]);
opt->got_dump_all_config = 1;
opt->got_any++;
break;
case T_DUMP_INFO:
if (opt->got_dump_info)
duplicate_option(argv[n]);
opt->got_dump_info = 1;
opt->got_any++;
break;
case T_DUMP_STATS:
if (opt->got_dump_stats)
duplicate_option(argv[n]);
opt->got_dump_stats = 1;
opt->got_any++;
break;
case T_DUMP_STRING:
if (opt->got_dump_string)
duplicate_option(argv[n]);
opt->string_index = num_id(argv[n + 1], "str_index");
opt->got_dump_string = 1;
opt->got_any++;
n++;
break;
case T_SUSPEND:
if (opt->got_suspend)
duplicate_option(argv[n]);
opt->got_suspend = 1;
opt->got_any++;
break;
case T_RESUME:
if (opt->got_resume)
duplicate_option(argv[n]);
opt->got_resume = 1;
opt->got_any++;
break;
case T_POWER_OFF:
if (opt->got_power_off)
duplicate_option(argv[n]);
opt->got_power_off = 1;
opt->got_any++;
break;
case T_POWER_SAVE:
if (opt->got_power_save)
duplicate_option(argv[n]);
opt->got_power_save = 1;
opt->got_any++;
break;
case T_POWER_ON:
if (opt->got_power_on)
duplicate_option(argv[n]);
opt->got_power_on = 1;
opt->got_any++;
break;
case T_RESET:
if (opt->got_reset)
duplicate_option(argv[n]);
opt->got_reset = 1;
opt->got_any++;
break;
case T_LIST:
if (opt->got_list)
duplicate_option(argv[n]);
opt->got_list = 1;
opt->got_any++;
break;
case T_DO_REQUEST:
if (opt->got_do_request)
duplicate_option(argv[n]);
LIBUSB20_INIT(LIBUSB20_CONTROL_SETUP, &opt->setup);
opt->setup.bmRequestType = num_id(argv[n + 1], "bmReqTyp");
opt->setup.bRequest = num_id(argv[n + 2], "bReq");
opt->setup.wValue = num_id(argv[n + 3], "wVal");
opt->setup.wIndex = num_id(argv[n + 4], "wIndex");
opt->setup.wLength = num_id(argv[n + 5], "wLen");
if (opt->setup.wLength != 0) {
opt->buffer = malloc(opt->setup.wLength);
} else {
opt->buffer = NULL;
}
n += 5;
if (!(opt->setup.bmRequestType &
LIBUSB20_ENDPOINT_IN)) {
/* copy in data */
t = (argc - n - 1);
if (t < opt->setup.wLength) {
err(1, "request data missing");
}
t = opt->setup.wLength;
while (t--) {
((uint8_t *)opt->buffer)[t] =
num_id(argv[n + t + 1], "req_data");
}
n += opt->setup.wLength;
}
opt->got_do_request = 1;
opt->got_any++;
break;
default:
if (n == 1) {
ptr = argv[n];
if ((ptr[0] == 'u') &&
(ptr[1] == 'g') &&
(ptr[2] == 'e') &&
(ptr[3] == 'n'))
ptr += 4;
if ((sscanf(ptr, "%d.%d",
&unit, &addr) != 2) ||
(unit < 0) || (unit > 65535) ||
(addr < 0) || (addr > 65535)) {
usage(EX_USAGE);
break;
}
opt->bus = unit;
opt->addr = addr;
opt->got_bus = 1;
opt->got_addr = 1;
break;
}
usage(EX_USAGE);
break;
}
}
if (opt->got_any) {
/* flush out last command */
flush_command(pbe, opt);
} else {
/* list all the devices */
opt->got_list = 1;
opt->got_any++;
flush_command(pbe, opt);
}
/* release data */
libusb20_be_free(pbe);
return (0);
}
diff --git a/usr.sbin/valectl/valectl.c b/usr.sbin/valectl/valectl.c
index bf1bc6229fb8..0e4dffd34290 100644
--- a/usr.sbin/valectl/valectl.c
+++ b/usr.sbin/valectl/valectl.c
@@ -1,445 +1,444 @@
/*
* Copyright (C) 2013-2014 Michio Honda. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*/
-/* $FreeBSD$ */
#define LIBNETMAP_NOTHREADSAFE
#include <libnetmap.h>
#include <errno.h>
#include <stdio.h>
#include <inttypes.h> /* PRI* macros */
#include <string.h> /* strcmp */
#include <fcntl.h> /* open */
#include <unistd.h> /* close */
#include <sys/ioctl.h> /* ioctl */
#include <sys/param.h>
#include <sys/socket.h> /* apple needs sockaddr */
#include <net/if.h> /* ifreq */
#include <libgen.h> /* basename */
#include <stdlib.h> /* atoi, free */
int verbose;
struct args {
const char *name;
const char *config;
const char *mem_id;
uint16_t nr_reqtype;
uint32_t nr_mode;
};
static void
dump_port_info(struct nmreq_port_info_get *v)
{
printf("memsize: %"PRIu64"\n", v->nr_memsize);
printf("tx_slots: %"PRIu32"\n", v->nr_tx_slots);
printf("rx_slots: %"PRIu32"\n", v->nr_rx_slots);
printf("tx_rings: %"PRIu16"\n", v->nr_tx_rings);
printf("rx_rings %"PRIu16"\n", v->nr_rx_rings);
printf("mem_id: %"PRIu16"\n", v->nr_mem_id);
}
static void
dump_newif(struct nmreq_vale_newif *v)
{
printf("tx_slots: %"PRIu32"\n", v->nr_tx_slots);
printf("rx_slots: %"PRIu32"\n", v->nr_rx_slots);
printf("tx_rings: %"PRIu16"\n", v->nr_tx_rings);
printf("rx_ring: %"PRIu16"\n", v->nr_rx_rings);
printf("mem_id: %"PRIu16"\n", v->nr_mem_id);
}
static void
dump_vale_list(struct nmreq_vale_list *v)
{
printf("bridge_idx: %"PRIu16"\n", v->nr_bridge_idx);
printf("port_idx: %"PRIu16"\n", v->nr_port_idx);
}
static void
parse_ring_config(const char* conf,
uint32_t *nr_tx_slots,
uint32_t *nr_rx_slots,
uint16_t *nr_tx_rings,
uint16_t *nr_rx_rings)
{
char *w, *tok;
int i, v;
*nr_tx_rings = *nr_rx_rings = 0;
*nr_tx_slots = *nr_rx_slots = 0;
if (conf == NULL || ! *conf)
return;
w = strdup(conf);
for (i = 0, tok = strtok(w, ","); tok; i++, tok = strtok(NULL, ",")) {
v = atoi(tok);
switch (i) {
case 0:
*nr_tx_slots = *nr_rx_slots = v;
break;
case 1:
*nr_rx_slots = v;
break;
case 2:
*nr_tx_rings = *nr_rx_rings = v;
break;
case 3:
*nr_rx_rings = v;
break;
default:
fprintf(stderr, "ignored config: %s", tok);
break;
}
}
ND("txr %d txd %d rxr %d rxd %d",
*nr_tx_rings, *nr_tx_slots,
*nr_rx_rings, *nr_rx_slots);
free(w);
}
static int
parse_poll_config(const char *conf, struct nmreq_vale_polling *v)
{
char *w, *tok;
int i, p;
if (conf == NULL || ! *conf) {
fprintf(stderr, "invalid null/empty config\n");
return -1;
}
w = strdup(conf);
for (i = 0, tok = strtok(w, ","); tok; i++, tok = strtok(NULL, ",")) {
p = atoi(tok);
switch (i) {
case 0:
v->nr_mode = p ? NETMAP_POLLING_MODE_MULTI_CPU :
NETMAP_POLLING_MODE_SINGLE_CPU;
break;
case 1:
v->nr_first_cpu_id = p;
break;
case 2:
if (v->nr_mode != NETMAP_POLLING_MODE_MULTI_CPU) {
fprintf(stderr, "too many numbers in '%s'\n", conf);
return -1;
}
v->nr_num_polling_cpus = p;
break;
case 3:
fprintf(stderr, "too many numbers in '%s'\n", conf);
return -1;
}
}
free(w);
return 0;
}
static int32_t
parse_mem_id(const char *mem_id)
{
int32_t id;
if (mem_id == NULL)
return 0;
if (isdigit(*mem_id))
return atoi(mem_id);
id = nmreq_get_mem_id(&mem_id, nmctx_get());
if (id == 0) {
fprintf(stderr, "invalid format in '-m %s' (missing 'netmap:'?)\n", mem_id);
return -1;
}
return id;
}
static int
list_all(int fd, struct nmreq_header *hdr)
{
int error;
struct nmreq_vale_list *vale_list =
(struct nmreq_vale_list *)(uintptr_t)hdr->nr_body;
for (;;) {
hdr->nr_name[0] = '\0';
error = ioctl(fd, NIOCCTRL, hdr);
if (error < 0) {
if (errno == ENOENT)
break;
fprintf(stderr, "failed to list all: %s\n", strerror(errno));
return 1;
}
printf("%s bridge_idx %"PRIu16" port_idx %"PRIu32"\n", hdr->nr_name,
vale_list->nr_bridge_idx, vale_list->nr_port_idx);
vale_list->nr_port_idx++;
}
return 1;
}
static int
bdg_ctl(struct args *a)
{
struct nmreq_header hdr;
struct nmreq_vale_attach vale_attach;
struct nmreq_vale_detach vale_detach;
struct nmreq_vale_newif vale_newif;
struct nmreq_vale_list vale_list;
struct nmreq_vale_polling vale_polling;
struct nmreq_port_info_get port_info_get;
int error = 0;
int fd;
int32_t mem_id;
const char *action = NULL;
fd = open("/dev/netmap", O_RDWR);
if (fd == -1) {
perror("/dev/netmap");
return 1;
}
bzero(&hdr, sizeof(hdr));
hdr.nr_version = NETMAP_API;
if (a->name != NULL) { /* might be NULL */
strncpy(hdr.nr_name, a->name, NETMAP_REQ_IFNAMSIZ - 1);
hdr.nr_name[NETMAP_REQ_IFNAMSIZ - 1] = '\0';
}
hdr.nr_reqtype = a->nr_reqtype;
switch (a->nr_reqtype) {
case NETMAP_REQ_VALE_DELIF:
/* no body */
action = "remove";
break;
case NETMAP_REQ_VALE_NEWIF:
memset(&vale_newif, 0, sizeof(vale_newif));
hdr.nr_body = (uintptr_t)&vale_newif;
parse_ring_config(a->config,
&vale_newif.nr_tx_slots,
&vale_newif.nr_rx_slots,
&vale_newif.nr_tx_rings,
&vale_newif.nr_rx_rings);
mem_id = parse_mem_id(a->mem_id);
if (mem_id < 0)
return 1;
vale_newif.nr_mem_id = mem_id;
action = "create";
break;
case NETMAP_REQ_VALE_ATTACH:
memset(&vale_attach, 0, sizeof(vale_attach));
hdr.nr_body = (uintptr_t)&vale_attach;
vale_attach.reg.nr_mode = a->nr_mode;
parse_ring_config(a->config,
&vale_attach.reg.nr_tx_slots,
&vale_attach.reg.nr_rx_slots,
&vale_attach.reg.nr_tx_rings,
&vale_attach.reg.nr_rx_rings);
mem_id = parse_mem_id(a->mem_id);
if (mem_id < 0)
return 1;
vale_attach.reg.nr_mem_id = mem_id;
action = "attach";
break;
case NETMAP_REQ_VALE_DETACH:
memset(&vale_detach, 0, sizeof(vale_detach));
hdr.nr_body = (uintptr_t)&vale_detach;
action = "detach";
break;
case NETMAP_REQ_VALE_LIST:
memset(&vale_list, 0, sizeof(vale_list));
hdr.nr_body = (uintptr_t)&vale_list;
if (a->name == NULL) {
return list_all(fd, &hdr);
}
action = "list";
break;
case NETMAP_REQ_VALE_POLLING_ENABLE:
action = "enable polling on";
/* fall through */
case NETMAP_REQ_VALE_POLLING_DISABLE:
memset(&vale_polling, 0, sizeof(vale_polling));
hdr.nr_body = (uintptr_t)&vale_polling;
parse_poll_config(a->config, &vale_polling);
if (action == NULL)
action ="disable polling on";
break;
case NETMAP_REQ_PORT_INFO_GET:
memset(&port_info_get, 0, sizeof(port_info_get));
hdr.nr_body = (uintptr_t)&port_info_get;
action = "obtain info for";
break;
}
error = ioctl(fd, NIOCCTRL, &hdr);
if (error < 0) {
fprintf(stderr, "failed to %s %s: %s\n",
action, a->name, strerror(errno));
return 1;
}
switch (hdr.nr_reqtype) {
case NETMAP_REQ_VALE_NEWIF:
if (verbose) {
dump_newif(&vale_newif);
}
break;
case NETMAP_REQ_VALE_ATTACH:
if (verbose) {
printf("port_index: %"PRIu32"\n", vale_attach.port_index);
}
break;
case NETMAP_REQ_VALE_DETACH:
if (verbose) {
printf("port_index: %"PRIu32"\n", vale_detach.port_index);
}
break;
case NETMAP_REQ_VALE_LIST:
dump_vale_list(&vale_list);
break;
case NETMAP_REQ_PORT_INFO_GET:
dump_port_info(&port_info_get);
break;
}
close(fd);
return error;
}
static void
usage(int errcode)
{
fprintf(stderr,
"Usage:\n"
"vale-ctl [arguments]\n"
"\t-g interface interface name to get info\n"
"\t-d interface interface name to be detached\n"
"\t-a interface interface name to be attached\n"
"\t-h interface interface name to be attached with the host stack\n"
"\t-n interface interface name to be created\n"
"\t-r interface interface name to be deleted\n"
"\t-l vale-port show bridge and port indices\n"
"\t-C string ring/slot setting of an interface creating by -n\n"
"\t-p interface start polling. Additional -C x,y,z configures\n"
"\t\t x: 0 (REG_ALL_NIC) or 1 (REG_ONE_NIC),\n"
"\t\t y: CPU core id for ALL_NIC and core/ring for ONE_NIC\n"
"\t\t z: (ONE_NIC only) num of total cores/rings\n"
"\t-P interface stop polling\n"
"\t-m memid to use when creating a new interface\n"
"\t-v increase verbosity\n"
"with no arguments: list all existing vale ports\n");
exit(errcode);
}
int
main(int argc, char *argv[])
{
int ch;
struct args a = {
.name = NULL,
.config = NULL,
.mem_id = NULL,
.nr_reqtype = 0,
.nr_mode = NR_REG_ALL_NIC,
};
while ((ch = getopt(argc, argv, "d:a:h:g:l:n:r:C:p:P:m:v")) != -1) {
switch (ch) {
default:
fprintf(stderr, "bad option %c %s", ch, optarg);
usage(1);
break;
case 'd':
a.nr_reqtype = NETMAP_REQ_VALE_DETACH;
a.name = optarg;
break;
case 'a':
a.nr_reqtype = NETMAP_REQ_VALE_ATTACH;
a.nr_mode = NR_REG_ALL_NIC;
a.name = optarg;
break;
case 'h':
a.nr_reqtype = NETMAP_REQ_VALE_ATTACH;
a.nr_mode = NR_REG_NIC_SW;
a.name = optarg;
break;
case 'n':
a.nr_reqtype = NETMAP_REQ_VALE_NEWIF;
a.name = optarg;
break;
case 'r':
a.nr_reqtype = NETMAP_REQ_VALE_DELIF;
a.name = optarg;
break;
case 'g':
a.nr_reqtype = NETMAP_REQ_PORT_INFO_GET;
a.name = optarg;
break;
case 'l':
a.nr_reqtype = NETMAP_REQ_VALE_LIST;
a.name = optarg;
if (strncmp(a.name, NM_BDG_NAME, strlen(NM_BDG_NAME))) {
fprintf(stderr, "invalid vale port name: '%s'\n", a.name);
usage(1);
}
break;
case 'C':
a.config = optarg;
break;
case 'p':
a.nr_reqtype = NETMAP_REQ_VALE_POLLING_ENABLE;
a.name = optarg;
break;
case 'P':
a.nr_reqtype = NETMAP_REQ_VALE_POLLING_DISABLE;
a.name = optarg;
break;
case 'm':
a.mem_id = optarg;
break;
case 'v':
verbose++;
break;
}
}
if (optind != argc) {
usage(1);
}
if (argc == 1) {
a.nr_reqtype = NETMAP_REQ_VALE_LIST;
a.name = NULL;
}
if (!a.nr_reqtype) {
usage(1);
}
return bdg_ctl(&a);
}
diff --git a/usr.sbin/vidcontrol/decode.h b/usr.sbin/vidcontrol/decode.h
index 1f1cba4a4720..b4dba1ba391e 100644
--- a/usr.sbin/vidcontrol/decode.h
+++ b/usr.sbin/vidcontrol/decode.h
@@ -1,3 +1,2 @@
-/* $FreeBSD$ */
int decode(FILE *fd, char *buffer, int len);
diff --git a/usr.sbin/vidcontrol/path.h b/usr.sbin/vidcontrol/path.h
index e1fa341e0c78..12ea4a5b3f66 100644
--- a/usr.sbin/vidcontrol/path.h
+++ b/usr.sbin/vidcontrol/path.h
@@ -1,8 +1,7 @@
-/* $FreeBSD$ */
#define KEYMAP_PATH "/usr/share/syscons/keymaps/"
#define FONT_PATH "/usr/share/syscons/fonts/"
#define SCRNMAP_PATH "/usr/share/syscons/scrnmaps/"
#define VT_KEYMAP_PATH "/usr/share/vt/keymaps/"
#define VT_FONT_PATH "/usr/share/vt/fonts/"
diff --git a/usr.sbin/ypldap/aldap.c b/usr.sbin/ypldap/aldap.c
index 4fb6608ec3f0..5a84068b9520 100644
--- a/usr.sbin/ypldap/aldap.c
+++ b/usr.sbin/ypldap/aldap.c
@@ -1,1257 +1,1256 @@
-/* $FreeBSD$ */
/* $Id: aldap.c,v 1.32 2016/04/27 10:53:27 schwarze Exp $ */
/* $OpenBSD: aldap.c,v 1.32 2016/04/27 10:53:27 schwarze Exp $ */
/*
* Copyright (c) 2008 Alexander Schrijver <aschrijver@openbsd.org>
* Copyright (c) 2006, 2007 Marc Balmer <mbalmer@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <ctype.h>
#include <errno.h>
#include <inttypes.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include "aldap.h"
#if 0
#define DEBUG
#endif
#define VERSION 3
static struct ber_element *ldap_parse_search_filter(struct ber_element *,
char *);
static struct ber_element *ldap_do_parse_search_filter(
struct ber_element *, char **);
char **aldap_get_stringset(struct ber_element *);
char *utoa(char *);
static int isu8cont(unsigned char);
char *parseval(char *, size_t);
int aldap_create_page_control(struct ber_element *,
int, struct aldap_page_control *);
#ifdef DEBUG
void ldap_debug_elements(struct ber_element *);
#endif
#ifdef DEBUG
#define DPRINTF(x...) printf(x)
#define LDAP_DEBUG(x, y) do { fprintf(stderr, "*** " x "\n"); ldap_debug_elements(y); } while (0)
#else
#define DPRINTF(x...) do { } while (0)
#define LDAP_DEBUG(x, y) do { } while (0)
#endif
int
aldap_close(struct aldap *al)
{
if (close(al->ber.fd) == -1)
return (-1);
ber_free(&al->ber);
free(al);
return (0);
}
struct aldap *
aldap_init(int fd)
{
struct aldap *a;
if ((a = calloc(1, sizeof(*a))) == NULL)
return NULL;
a->ber.fd = fd;
return a;
}
int
aldap_bind(struct aldap *ldap, char *binddn, char *bindcred)
{
struct ber_element *root = NULL, *elm;
int error;
if (binddn == NULL)
binddn = "";
if (bindcred == NULL)
bindcred = "";
if ((root = ber_add_sequence(NULL)) == NULL)
goto fail;
elm = ber_printf_elements(root, "d{tdsst", ++ldap->msgid, BER_CLASS_APP,
(unsigned long)LDAP_REQ_BIND, VERSION, binddn, bindcred,
BER_CLASS_CONTEXT, (unsigned long)LDAP_AUTH_SIMPLE);
if (elm == NULL)
goto fail;
LDAP_DEBUG("aldap_bind", root);
error = ber_write_elements(&ldap->ber, root);
ber_free_elements(root);
root = NULL;
if (error == -1)
goto fail;
return (ldap->msgid);
fail:
if (root != NULL)
ber_free_elements(root);
ldap->err = ALDAP_ERR_OPERATION_FAILED;
return (-1);
}
int
aldap_unbind(struct aldap *ldap)
{
struct ber_element *root = NULL, *elm;
int error;
if ((root = ber_add_sequence(NULL)) == NULL)
goto fail;
elm = ber_printf_elements(root, "d{t", ++ldap->msgid, BER_CLASS_APP,
LDAP_REQ_UNBIND_30);
if (elm == NULL)
goto fail;
LDAP_DEBUG("aldap_unbind", root);
error = ber_write_elements(&ldap->ber, root);
ber_free_elements(root);
root = NULL;
if (error == -1)
goto fail;
return (ldap->msgid);
fail:
if (root != NULL)
ber_free_elements(root);
ldap->err = ALDAP_ERR_OPERATION_FAILED;
return (-1);
}
int
aldap_search(struct aldap *ldap, char *basedn, enum scope scope, char *filter,
char **attrs, int typesonly, int sizelimit, int timelimit,
struct aldap_page_control *page)
{
struct ber_element *root = NULL, *ber, *c;
int i, error;
if ((root = ber_add_sequence(NULL)) == NULL)
goto fail;
ber = ber_printf_elements(root, "d{t", ++ldap->msgid, BER_CLASS_APP,
(unsigned long) LDAP_REQ_SEARCH);
if (ber == NULL) {
ldap->err = ALDAP_ERR_OPERATION_FAILED;
goto fail;
}
c = ber;
ber = ber_printf_elements(ber, "sEEddb", basedn, (long long)scope,
(long long)LDAP_DEREF_NEVER, sizelimit,
timelimit, typesonly);
if (ber == NULL) {
ldap->err = ALDAP_ERR_OPERATION_FAILED;
goto fail;
}
if ((ber = ldap_parse_search_filter(ber, filter)) == NULL) {
ldap->err = ALDAP_ERR_PARSER_ERROR;
goto fail;
}
if ((ber = ber_add_sequence(ber)) == NULL)
goto fail;
if (attrs != NULL)
for (i = 0; attrs[i] != NULL; i++) {
if ((ber = ber_add_string(ber, attrs[i])) == NULL)
goto fail;
}
aldap_create_page_control(c, 100, page);
LDAP_DEBUG("aldap_search", root);
error = ber_write_elements(&ldap->ber, root);
ber_free_elements(root);
root = NULL;
if (error == -1) {
ldap->err = ALDAP_ERR_OPERATION_FAILED;
goto fail;
}
return (ldap->msgid);
fail:
if (root != NULL)
ber_free_elements(root);
return (-1);
}
int
aldap_create_page_control(struct ber_element *elm, int size,
struct aldap_page_control *page)
{
int len;
struct ber c;
struct ber_element *ber = NULL;
c.br_wbuf = NULL;
c.fd = -1;
ber = ber_add_sequence(NULL);
if (page == NULL) {
if (ber_printf_elements(ber, "ds", 50, "") == NULL)
goto fail;
} else {
if (ber_printf_elements(ber, "dx", 50, page->cookie,
page->cookie_len) == NULL)
goto fail;
}
if ((len = ber_write_elements(&c, ber)) < 1)
goto fail;
if (ber_printf_elements(elm, "{t{sx", 2, 0, LDAP_PAGED_OID,
c.br_wbuf, (size_t)len) == NULL)
goto fail;
ber_free_elements(ber);
ber_free(&c);
return len;
fail:
if (ber != NULL)
ber_free_elements(ber);
ber_free(&c);
return (-1);
}
struct aldap_message *
aldap_parse(struct aldap *ldap)
{
int class;
unsigned long type;
long long msgid = 0;
struct aldap_message *m;
struct ber_element *a = NULL, *ep;
if ((m = calloc(1, sizeof(struct aldap_message))) == NULL)
return NULL;
if ((m->msg = ber_read_elements(&ldap->ber, NULL)) == NULL)
goto parsefail;
LDAP_DEBUG("message", m->msg);
if (ber_scanf_elements(m->msg, "{ite", &msgid, &class, &type, &a) != 0)
goto parsefail;
m->msgid = msgid;
m->message_type = type;
m->protocol_op = a;
switch (m->message_type) {
case LDAP_RES_BIND:
case LDAP_RES_MODIFY:
case LDAP_RES_ADD:
case LDAP_RES_DELETE:
case LDAP_RES_MODRDN:
case LDAP_RES_COMPARE:
case LDAP_RES_SEARCH_RESULT:
if (ber_scanf_elements(m->protocol_op, "{EeSeSe",
&m->body.res.rescode, &m->dn, &m->body.res.diagmsg, &a) != 0)
goto parsefail;
if (m->body.res.rescode == LDAP_REFERRAL)
if (ber_scanf_elements(a, "{e", &m->references) != 0)
goto parsefail;
if (m->msg->be_sub) {
for (ep = m->msg->be_sub; ep != NULL; ep = ep->be_next) {
ber_scanf_elements(ep, "t", &class, &type);
if (class == 2 && type == 0)
m->page = aldap_parse_page_control(ep->be_sub->be_sub,
ep->be_sub->be_sub->be_len);
}
} else
m->page = NULL;
break;
case LDAP_RES_SEARCH_ENTRY:
if (ber_scanf_elements(m->protocol_op, "{eS{e", &m->dn,
&m->body.search.attrs) != 0)
goto parsefail;
break;
case LDAP_RES_SEARCH_REFERENCE:
if (ber_scanf_elements(m->protocol_op, "{e", &m->references) != 0)
goto parsefail;
break;
}
return m;
parsefail:
ldap->err = ALDAP_ERR_PARSER_ERROR;
aldap_freemsg(m);
return NULL;
}
struct aldap_page_control *
aldap_parse_page_control(struct ber_element *control, size_t len)
{
char *oid, *s;
char *encoded;
struct ber b;
struct ber_element *elm;
struct aldap_page_control *page;
b.br_wbuf = NULL;
b.fd = -1;
ber_scanf_elements(control, "ss", &oid, &encoded);
ber_set_readbuf(&b, encoded, control->be_next->be_len);
elm = ber_read_elements(&b, NULL);
if ((page = malloc(sizeof(struct aldap_page_control))) == NULL) {
if (elm != NULL)
ber_free_elements(elm);
ber_free(&b);
return NULL;
}
ber_scanf_elements(elm->be_sub, "is", &page->size, &s);
page->cookie_len = elm->be_sub->be_next->be_len;
if ((page->cookie = malloc(page->cookie_len)) == NULL) {
if (elm != NULL)
ber_free_elements(elm);
ber_free(&b);
free(page);
return NULL;
}
memcpy(page->cookie, s, page->cookie_len);
ber_free_elements(elm);
ber_free(&b);
return page;
}
void
aldap_freepage(struct aldap_page_control *page)
{
free(page->cookie);
free(page);
}
void
aldap_freemsg(struct aldap_message *msg)
{
if (msg->msg)
ber_free_elements(msg->msg);
free(msg);
}
int
aldap_get_resultcode(struct aldap_message *msg)
{
return msg->body.res.rescode;
}
char *
aldap_get_dn(struct aldap_message *msg)
{
char *dn;
if (msg->dn == NULL)
return NULL;
if (ber_get_string(msg->dn, &dn) == -1)
return NULL;
return utoa(dn);
}
char **
aldap_get_references(struct aldap_message *msg)
{
if (msg->references == NULL)
return NULL;
return aldap_get_stringset(msg->references);
}
void
aldap_free_references(char **values)
{
int i;
if (values == NULL)
return;
for (i = 0; values[i] != NULL; i++)
free(values[i]);
free(values);
}
char *
aldap_get_diagmsg(struct aldap_message *msg)
{
char *s;
if (msg->body.res.diagmsg == NULL)
return NULL;
if (ber_get_string(msg->body.res.diagmsg, &s) == -1)
return NULL;
return utoa(s);
}
int
aldap_count_attrs(struct aldap_message *msg)
{
int i;
struct ber_element *a;
if (msg->body.search.attrs == NULL)
return (-1);
for (i = 0, a = msg->body.search.attrs;
a != NULL && ber_get_eoc(a) != 0;
i++, a = a->be_next)
;
return i;
}
int
aldap_first_attr(struct aldap_message *msg, char **outkey, char ***outvalues)
{
struct ber_element *b, *c;
char *key;
char **ret;
if (msg->body.search.attrs == NULL)
goto fail;
if (ber_scanf_elements(msg->body.search.attrs, "{s(e)}e",
&key, &b, &c) != 0)
goto fail;
msg->body.search.iter = msg->body.search.attrs->be_next;
if ((ret = aldap_get_stringset(b)) == NULL)
goto fail;
(*outvalues) = ret;
(*outkey) = utoa(key);
return (1);
fail:
(*outkey) = NULL;
(*outvalues) = NULL;
return (-1);
}
int
aldap_next_attr(struct aldap_message *msg, char **outkey, char ***outvalues)
{
struct ber_element *a, *b;
char *key;
char **ret;
if (msg->body.search.iter == NULL)
goto notfound;
LDAP_DEBUG("attr", msg->body.search.iter);
if (ber_get_eoc(msg->body.search.iter) == 0)
goto notfound;
if (ber_scanf_elements(msg->body.search.iter, "{s(e)}e", &key, &a, &b)
!= 0)
goto fail;
msg->body.search.iter = msg->body.search.iter->be_next;
if ((ret = aldap_get_stringset(a)) == NULL)
goto fail;
(*outvalues) = ret;
(*outkey) = utoa(key);
return (1);
fail:
notfound:
(*outkey) = NULL;
(*outvalues) = NULL;
return (-1);
}
int
aldap_match_attr(struct aldap_message *msg, char *inkey, char ***outvalues)
{
struct ber_element *a, *b;
char *descr = NULL;
char **ret;
if (msg->body.search.attrs == NULL)
goto fail;
LDAP_DEBUG("attr", msg->body.search.attrs);
for (a = msg->body.search.attrs;;) {
if (a == NULL)
goto notfound;
if (ber_get_eoc(a) == 0)
goto notfound;
if (ber_scanf_elements(a, "{s(e", &descr, &b) != 0)
goto fail;
if (strcasecmp(descr, inkey) == 0)
goto attrfound;
a = a->be_next;
}
attrfound:
if ((ret = aldap_get_stringset(b)) == NULL)
goto fail;
(*outvalues) = ret;
return (1);
fail:
notfound:
(*outvalues) = NULL;
return (-1);
}
int
aldap_free_attr(char **values)
{
int i;
if (values == NULL)
return -1;
for (i = 0; values[i] != NULL; i++)
free(values[i]);
free(values);
return (1);
}
#if 0
void
aldap_free_url(struct aldap_url *lu)
{
free(lu->buffer);
free(lu->filter);
}
int
aldap_parse_url(char *url, struct aldap_url *lu)
{
char *p, *forward, *forward2;
const char *errstr = NULL;
int i;
if ((lu->buffer = p = strdup(url)) == NULL)
return (-1);
/* protocol */
if (strncasecmp(LDAP_URL, p, strlen(LDAP_URL)) != 0)
goto fail;
lu->protocol = LDAP;
p += strlen(LDAP_URL);
/* host and optional port */
if ((forward = strchr(p, '/')) != NULL)
*forward = '\0';
/* find the optional port */
if ((forward2 = strchr(p, ':')) != NULL) {
*forward2 = '\0';
/* if a port is given */
if (*(forward2+1) != '\0') {
#define PORT_MAX UINT16_MAX
lu->port = strtonum(++forward2, 0, PORT_MAX, &errstr);
if (errstr)
goto fail;
}
}
/* fail if no host is given */
if (strlen(p) == 0)
goto fail;
lu->host = p;
if (forward == NULL)
goto done;
/* p is assigned either a pointer to a character or to '\0' */
p = ++forward;
if (strlen(p) == 0)
goto done;
/* dn */
if ((forward = strchr(p, '?')) != NULL)
*forward = '\0';
lu->dn = p;
if (forward == NULL)
goto done;
/* p is assigned either a pointer to a character or to '\0' */
p = ++forward;
if (strlen(p) == 0)
goto done;
/* attributes */
if ((forward = strchr(p, '?')) != NULL)
*forward = '\0';
for (i = 0; i < MAXATTR; i++) {
if ((forward2 = strchr(p, ',')) == NULL) {
if (strlen(p) == 0)
break;
lu->attributes[i] = p;
break;
}
*forward2 = '\0';
lu->attributes[i] = p;
p = ++forward2;
}
if (forward == NULL)
goto done;
/* p is assigned either a pointer to a character or to '\0' */
p = ++forward;
if (strlen(p) == 0)
goto done;
/* scope */
if ((forward = strchr(p, '?')) != NULL)
*forward = '\0';
if (strcmp(p, "base") == 0)
lu->scope = LDAP_SCOPE_BASE;
else if (strcmp(p, "one") == 0)
lu->scope = LDAP_SCOPE_ONELEVEL;
else if (strcmp(p, "sub") == 0)
lu->scope = LDAP_SCOPE_SUBTREE;
else
goto fail;
if (forward == NULL)
goto done;
p = ++forward;
if (strlen(p) == 0)
goto done;
/* filter */
if (p)
lu->filter = p;
done:
free(url);
return (1);
fail:
free(lu->buffer);
lu->buffer = NULL;
return (-1);
}
int
aldap_search_url(struct aldap *ldap, char *url, int typesonly, int sizelimit,
int timelimit)
{
struct aldap_url *lu;
if ((lu = calloc(1, sizeof(*lu))) == NULL)
return (-1);
if (aldap_parse_url(url, lu))
goto fail;
if (aldap_search(ldap, lu->dn, lu->scope, lu->filter, lu->attributes,
typesonly, sizelimit, timelimit) == -1)
goto fail;
aldap_free_url(lu);
return (ldap->msgid);
fail:
aldap_free_url(lu);
return (-1);
}
#endif /* 0 */
/*
* internal functions
*/
char **
aldap_get_stringset(struct ber_element *elm)
{
struct ber_element *a;
int i;
char **ret;
char *s;
if (elm->be_type != BER_TYPE_OCTETSTRING)
return NULL;
for (a = elm, i = 1; i > 0 && a != NULL && a->be_type ==
BER_TYPE_OCTETSTRING; a = a->be_next, i++)
;
if (i == 1)
return NULL;
if ((ret = calloc(i + 1, sizeof(char *))) == NULL)
return NULL;
for (a = elm, i = 0; a != NULL && a->be_type == BER_TYPE_OCTETSTRING;
a = a->be_next) {
ber_get_string(a, &s);
ret[i] = utoa(s);
if (ret[i] != NULL)
i++;
}
if (i == 0) {
free(ret);
return NULL;
}
ret[i] = NULL;
return ret;
}
/*
* Base case for ldap_do_parse_search_filter
*
* returns:
* struct ber_element *, ber_element tree
* NULL, parse failed
*/
static struct ber_element *
ldap_parse_search_filter(struct ber_element *ber, char *filter)
{
struct ber_element *elm;
char *cp;
cp = filter;
if (cp == NULL || *cp == '\0') {
errno = EINVAL;
return (NULL);
}
if ((elm = ldap_do_parse_search_filter(ber, &cp)) == NULL)
return (NULL);
if (*cp != '\0') {
ber_free_elements(elm);
ber_link_elements(ber, NULL);
errno = EINVAL;
return (NULL);
}
return (elm);
}
/*
* Translate RFC4515 search filter string into ber_element tree
*
* returns:
* struct ber_element *, ber_element tree
* NULL, parse failed
*
* notes:
* when cp is passed to a recursive invocation, it is updated
* to point one character beyond the filter that was passed
* i.e., cp jumps to "(filter)" upon return
* ^
* goto's used to discriminate error-handling based on error type
* doesn't handle extended filters (yet)
*
*/
static struct ber_element *
ldap_do_parse_search_filter(struct ber_element *prev, char **cpp)
{
struct ber_element *elm, *root = NULL;
char *attr_desc, *attr_val, *parsed_val, *cp;
size_t len;
unsigned long type;
root = NULL;
/* cpp should pass in pointer to opening parenthesis of "(filter)" */
cp = *cpp;
if (*cp != '(')
goto syntaxfail;
switch (*++cp) {
case '&': /* AND */
case '|': /* OR */
if (*cp == '&')
type = LDAP_FILT_AND;
else
type = LDAP_FILT_OR;
if ((elm = ber_add_set(prev)) == NULL)
goto callfail;
root = elm;
ber_set_header(elm, BER_CLASS_CONTEXT, type);
if (*++cp != '(') /* opening `(` of filter */
goto syntaxfail;
while (*cp == '(') {
if ((elm =
ldap_do_parse_search_filter(elm, &cp)) == NULL)
goto bad;
}
if (*cp != ')') /* trailing `)` of filter */
goto syntaxfail;
break;
case '!': /* NOT */
if ((root = ber_add_sequence(prev)) == NULL)
goto callfail;
ber_set_header(root, BER_CLASS_CONTEXT, LDAP_FILT_NOT);
cp++; /* now points to sub-filter */
if ((elm = ldap_do_parse_search_filter(root, &cp)) == NULL)
goto bad;
if (*cp != ')') /* trailing `)` of filter */
goto syntaxfail;
break;
default: /* SIMPLE || PRESENCE */
attr_desc = cp;
len = strcspn(cp, "()<>~=");
cp += len;
switch (*cp) {
case '~':
type = LDAP_FILT_APPR;
cp++;
break;
case '<':
type = LDAP_FILT_LE;
cp++;
break;
case '>':
type = LDAP_FILT_GE;
cp++;
break;
case '=':
type = LDAP_FILT_EQ; /* assume EQ until disproven */
break;
case '(':
case ')':
default:
goto syntaxfail;
}
attr_val = ++cp;
/* presence filter */
if (strncmp(attr_val, "*)", 2) == 0) {
cp++; /* point to trailing `)` */
if ((root =
ber_add_nstring(prev, attr_desc, len)) == NULL)
goto bad;
ber_set_header(root, BER_CLASS_CONTEXT, LDAP_FILT_PRES);
break;
}
if ((root = ber_add_sequence(prev)) == NULL)
goto callfail;
ber_set_header(root, BER_CLASS_CONTEXT, type);
if ((elm = ber_add_nstring(root, attr_desc, len)) == NULL)
goto callfail;
len = strcspn(attr_val, "*)");
if (len == 0 && *cp != '*')
goto syntaxfail;
cp += len;
if (*cp == '\0')
goto syntaxfail;
if (*cp == '*') { /* substring filter */
int initial;
cp = attr_val;
ber_set_header(root, BER_CLASS_CONTEXT, LDAP_FILT_SUBS);
if ((elm = ber_add_sequence(elm)) == NULL)
goto callfail;
for (initial = 1;; cp++, initial = 0) {
attr_val = cp;
len = strcspn(attr_val, "*)");
if (len == 0) {
if (*cp == ')')
break;
else
continue;
}
cp += len;
if (*cp == '\0')
goto syntaxfail;
if (initial)
type = LDAP_FILT_SUBS_INIT;
else if (*cp == ')')
type = LDAP_FILT_SUBS_FIN;
else
type = LDAP_FILT_SUBS_ANY;
if ((parsed_val = parseval(attr_val, len)) ==
NULL)
goto callfail;
elm = ber_add_nstring(elm, parsed_val,
strlen(parsed_val));
free(parsed_val);
if (elm == NULL)
goto callfail;
ber_set_header(elm, BER_CLASS_CONTEXT, type);
if (type == LDAP_FILT_SUBS_FIN)
break;
}
break;
}
if ((parsed_val = parseval(attr_val, len)) == NULL)
goto callfail;
elm = ber_add_nstring(elm, parsed_val, strlen(parsed_val));
free(parsed_val);
if (elm == NULL)
goto callfail;
break;
}
cp++; /* now points one char beyond the trailing `)` */
*cpp = cp;
return (root);
syntaxfail: /* XXX -- error reporting */
callfail:
bad:
if (root != NULL)
ber_free_elements(root);
ber_link_elements(prev, NULL);
return (NULL);
}
#ifdef DEBUG
/*
* Display a list of ber elements.
*
*/
void
ldap_debug_elements(struct ber_element *root)
{
static int indent = 0;
long long v;
int d;
char *buf;
size_t len;
u_int i;
int constructed;
struct ber_oid o;
/* calculate lengths */
ber_calc_len(root);
switch (root->be_encoding) {
case BER_TYPE_SEQUENCE:
case BER_TYPE_SET:
constructed = root->be_encoding;
break;
default:
constructed = 0;
break;
}
fprintf(stderr, "%*slen %lu ", indent, "", root->be_len);
switch (root->be_class) {
case BER_CLASS_UNIVERSAL:
fprintf(stderr, "class: universal(%u) type: ", root->be_class);
switch (root->be_type) {
case BER_TYPE_EOC:
fprintf(stderr, "end-of-content");
break;
case BER_TYPE_BOOLEAN:
fprintf(stderr, "boolean");
break;
case BER_TYPE_INTEGER:
fprintf(stderr, "integer");
break;
case BER_TYPE_BITSTRING:
fprintf(stderr, "bit-string");
break;
case BER_TYPE_OCTETSTRING:
fprintf(stderr, "octet-string");
break;
case BER_TYPE_NULL:
fprintf(stderr, "null");
break;
case BER_TYPE_OBJECT:
fprintf(stderr, "object");
break;
case BER_TYPE_ENUMERATED:
fprintf(stderr, "enumerated");
break;
case BER_TYPE_SEQUENCE:
fprintf(stderr, "sequence");
break;
case BER_TYPE_SET:
fprintf(stderr, "set");
break;
}
break;
case BER_CLASS_APPLICATION:
fprintf(stderr, "class: application(%u) type: ",
root->be_class);
switch (root->be_type) {
case LDAP_REQ_BIND:
fprintf(stderr, "bind");
break;
case LDAP_RES_BIND:
fprintf(stderr, "bind");
break;
case LDAP_REQ_UNBIND_30:
break;
case LDAP_REQ_SEARCH:
fprintf(stderr, "search");
break;
case LDAP_RES_SEARCH_ENTRY:
fprintf(stderr, "search_entry");
break;
case LDAP_RES_SEARCH_RESULT:
fprintf(stderr, "search_result");
break;
case LDAP_REQ_MODIFY:
fprintf(stderr, "modify");
break;
case LDAP_RES_MODIFY:
fprintf(stderr, "modify");
break;
case LDAP_REQ_ADD:
fprintf(stderr, "add");
break;
case LDAP_RES_ADD:
fprintf(stderr, "add");
break;
case LDAP_REQ_DELETE_30:
fprintf(stderr, "delete");
break;
case LDAP_RES_DELETE:
fprintf(stderr, "delete");
break;
case LDAP_REQ_MODRDN:
fprintf(stderr, "modrdn");
break;
case LDAP_RES_MODRDN:
fprintf(stderr, "modrdn");
break;
case LDAP_REQ_COMPARE:
fprintf(stderr, "compare");
break;
case LDAP_RES_COMPARE:
fprintf(stderr, "compare");
break;
case LDAP_REQ_ABANDON_30:
fprintf(stderr, "abandon");
break;
}
break;
case BER_CLASS_PRIVATE:
fprintf(stderr, "class: private(%u) type: ", root->be_class);
fprintf(stderr, "encoding (%lu) type: ", root->be_encoding);
break;
case BER_CLASS_CONTEXT:
/* XXX: this is not correct */
fprintf(stderr, "class: context(%u) type: ", root->be_class);
switch(root->be_type) {
case LDAP_AUTH_SIMPLE:
fprintf(stderr, "auth simple");
break;
}
break;
default:
fprintf(stderr, "class: <INVALID>(%u) type: ", root->be_class);
break;
}
fprintf(stderr, "(%lu) encoding %lu ",
root->be_type, root->be_encoding);
if (constructed)
root->be_encoding = constructed;
switch (root->be_encoding) {
case BER_TYPE_BOOLEAN:
if (ber_get_boolean(root, &d) == -1) {
fprintf(stderr, "<INVALID>\n");
break;
}
fprintf(stderr, "%s(%d)\n", d ? "true" : "false", d);
break;
case BER_TYPE_INTEGER:
if (ber_get_integer(root, &v) == -1) {
fprintf(stderr, "<INVALID>\n");
break;
}
fprintf(stderr, "value %lld\n", v);
break;
case BER_TYPE_ENUMERATED:
if (ber_get_enumerated(root, &v) == -1) {
fprintf(stderr, "<INVALID>\n");
break;
}
fprintf(stderr, "value %lld\n", v);
break;
case BER_TYPE_BITSTRING:
if (ber_get_bitstring(root, (void *)&buf, &len) == -1) {
fprintf(stderr, "<INVALID>\n");
break;
}
fprintf(stderr, "hexdump ");
for (i = 0; i < len; i++)
fprintf(stderr, "%02x", buf[i]);
fprintf(stderr, "\n");
break;
case BER_TYPE_OBJECT:
if (ber_get_oid(root, &o) == -1) {
fprintf(stderr, "<INVALID>\n");
break;
}
fprintf(stderr, "\n");
break;
case BER_TYPE_OCTETSTRING:
if (ber_get_nstring(root, (void *)&buf, &len) == -1) {
fprintf(stderr, "<INVALID>\n");
break;
}
fprintf(stderr, "string \"%.*s\"\n", len, buf);
break;
case BER_TYPE_NULL: /* no payload */
case BER_TYPE_EOC:
case BER_TYPE_SEQUENCE:
case BER_TYPE_SET:
default:
fprintf(stderr, "\n");
break;
}
if (constructed && root->be_sub) {
indent += 2;
ldap_debug_elements(root->be_sub);
indent -= 2;
}
if (root->be_next)
ldap_debug_elements(root->be_next);
}
#endif
/*
* Strip UTF-8 down to ASCII without validation.
* notes:
* non-ASCII characters are displayed as '?'
* the argument u should be a NULL terminated sequence of UTF-8 bytes.
*/
char *
utoa(char *u)
{
int len, i, j;
char *str;
/* calculate the length to allocate */
for (len = 0, i = 0; u[i] != '\0'; i++)
if (!isu8cont(u[i]))
len++;
if ((str = calloc(len + 1, sizeof(char))) == NULL)
return NULL;
/* copy the ASCII characters to the newly allocated string */
for (i = 0, j = 0; u[i] != '\0'; i++)
if (!isu8cont(u[i]))
str[j++] = isascii((unsigned char)u[i]) ? u[i] : '?';
return str;
}
static int
isu8cont(unsigned char c)
{
return (c & (0x80 | 0x40)) == 0x80;
}
/*
* Parse a LDAP value
* notes:
* the argument p should be a NUL-terminated sequence of ASCII bytes.
*/
char *
parseval(char *p, size_t len)
{
char hex[3];
char *buffer;
size_t i, j;
if ((buffer = calloc(1, len + 1)) == NULL)
return NULL;
for (i = j = 0; j < len; i++) {
if (p[j] == '\\') {
strlcpy(hex, p + j + 1, sizeof(hex));
buffer[i] = (char)strtoumax(hex, NULL, 16);
j += 3;
} else {
buffer[i] = p[j];
j++;
}
}
return buffer;
}
int
aldap_get_errno(struct aldap *a, const char **estr)
{
switch (a->err) {
case ALDAP_ERR_SUCCESS:
*estr = "success";
break;
case ALDAP_ERR_PARSER_ERROR:
*estr = "parser failed";
break;
case ALDAP_ERR_INVALID_FILTER:
*estr = "invalid filter";
break;
case ALDAP_ERR_OPERATION_FAILED:
*estr = "operation failed";
break;
default:
*estr = "unknown";
break;
}
return (a->err);
}
diff --git a/usr.sbin/ypldap/aldap.h b/usr.sbin/ypldap/aldap.h
index cdf5316e8328..8e3a7d8088c7 100644
--- a/usr.sbin/ypldap/aldap.h
+++ b/usr.sbin/ypldap/aldap.h
@@ -1,221 +1,220 @@
/* $Id: aldap.h,v 1.9 2012/04/30 21:40:03 jmatthew Exp $ */
/* $OpenBSD: aldap.h,v 1.9 2012/04/30 21:40:03 jmatthew Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2008 Alexander Schrijver <aschrijver@openbsd.org>
* Copyright (c) 2006, 2007 Marc Balmer <mbalmer@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdio.h>
#include "ber.h"
#define LDAP_URL "ldap://"
#define LDAP_PORT 389
#define LDAP_PAGED_OID "1.2.840.113556.1.4.319"
struct aldap {
#define ALDAP_ERR_SUCCESS 0
#define ALDAP_ERR_PARSER_ERROR 1
#define ALDAP_ERR_INVALID_FILTER 2
#define ALDAP_ERR_OPERATION_FAILED 3
u_int8_t err;
int msgid;
struct ber ber;
};
struct aldap_page_control {
int size;
char *cookie;
unsigned int cookie_len;
};
struct aldap_message {
int msgid;
int message_type;
struct ber_element *msg;
struct ber_element *header;
struct ber_element *protocol_op;
struct ber_element *dn;
union {
struct {
long long rescode;
struct ber_element *diagmsg;
} res;
struct {
struct ber_element *iter;
struct ber_element *attrs;
} search;
} body;
struct ber_element *references;
struct aldap_page_control *page;
};
enum aldap_protocol {
LDAP,
LDAPS
};
struct aldap_url {
int protocol;
char *host;
in_port_t port;
char *dn;
#define MAXATTR 1024
char *attributes[MAXATTR];
int scope;
char *filter;
char *buffer;
};
enum protocol_op {
LDAP_REQ_BIND = 0,
LDAP_RES_BIND = 1,
LDAP_REQ_UNBIND_30 = 2,
LDAP_REQ_SEARCH = 3,
LDAP_RES_SEARCH_ENTRY = 4,
LDAP_RES_SEARCH_RESULT = 5,
LDAP_REQ_MODIFY = 6,
LDAP_RES_MODIFY = 7,
LDAP_REQ_ADD = 8,
LDAP_RES_ADD = 9,
LDAP_REQ_DELETE_30 = 10,
LDAP_RES_DELETE = 11,
LDAP_REQ_MODRDN = 12,
LDAP_RES_MODRDN = 13,
LDAP_REQ_COMPARE = 14,
LDAP_RES_COMPARE = 15,
LDAP_REQ_ABANDON_30 = 16,
LDAP_RES_SEARCH_REFERENCE = 19,
};
enum deref_aliases {
LDAP_DEREF_NEVER = 0,
LDAP_DEREF_SEARCHING = 1,
LDAP_DEREF_FINDING = 2,
LDAP_DEREF_ALWAYS = 3,
};
enum authentication_choice {
LDAP_AUTH_SIMPLE = 0,
};
enum scope {
LDAP_SCOPE_BASE = 0,
LDAP_SCOPE_ONELEVEL = 1,
LDAP_SCOPE_SUBTREE = 2,
};
enum result_code {
LDAP_SUCCESS = 0,
LDAP_OPERATIONS_ERROR = 1,
LDAP_PROTOCOL_ERROR = 2,
LDAP_TIMELIMIT_EXCEEDED = 3,
LDAP_SIZELIMIT_EXCEEDED = 4,
LDAP_COMPARE_FALSE = 5,
LDAP_COMPARE_TRUE = 6,
LDAP_STRONG_AUTH_NOT_SUPPORTED = 7,
LDAP_STRONG_AUTH_REQUIRED = 8,
LDAP_REFERRAL = 10,
LDAP_ADMINLIMIT_EXCEEDED = 11,
LDAP_UNAVAILABLE_CRITICAL_EXTENSION = 12,
LDAP_CONFIDENTIALITY_REQUIRED = 13,
LDAP_SASL_BIND_IN_PROGRESS = 14,
LDAP_NO_SUCH_ATTRIBUTE = 16,
LDAP_UNDEFINED_TYPE = 17,
LDAP_INAPPROPRIATE_MATCHING = 18,
LDAP_CONSTRAINT_VIOLATION = 19,
LDAP_TYPE_OR_VALUE_EXISTS = 20,
LDAP_INVALID_SYNTAX = 21,
LDAP_NO_SUCH_OBJECT = 32,
LDAP_ALIAS_PROBLEM = 33,
LDAP_INVALID_DN_SYNTAX = 34,
LDAP_ALIAS_DEREF_PROBLEM = 36,
LDAP_INAPPROPRIATE_AUTH = 48,
LDAP_INVALID_CREDENTIALS = 49,
LDAP_INSUFFICIENT_ACCESS = 50,
LDAP_BUSY = 51,
LDAP_UNAVAILABLE = 52,
LDAP_UNWILLING_TO_PERFORM = 53,
LDAP_LOOP_DETECT = 54,
LDAP_NAMING_VIOLATION = 64,
LDAP_OBJECT_CLASS_VIOLATION = 65,
LDAP_NOT_ALLOWED_ON_NONLEAF = 66,
LDAP_NOT_ALLOWED_ON_RDN = 67,
LDAP_ALREADY_EXISTS = 68,
LDAP_NO_OBJECT_CLASS_MODS = 69,
LDAP_AFFECTS_MULTIPLE_DSAS = 71,
LDAP_OTHER = 80,
};
enum filter {
LDAP_FILT_AND = 0,
LDAP_FILT_OR = 1,
LDAP_FILT_NOT = 2,
LDAP_FILT_EQ = 3,
LDAP_FILT_SUBS = 4,
LDAP_FILT_GE = 5,
LDAP_FILT_LE = 6,
LDAP_FILT_PRES = 7,
LDAP_FILT_APPR = 8,
};
enum subfilter {
LDAP_FILT_SUBS_INIT = 0,
LDAP_FILT_SUBS_ANY = 1,
LDAP_FILT_SUBS_FIN = 2,
};
struct aldap *aldap_init(int fd);
int aldap_close(struct aldap *);
struct aldap_message *aldap_parse(struct aldap *);
void aldap_freemsg(struct aldap_message *);
int aldap_bind(struct aldap *, char *, char *);
int aldap_unbind(struct aldap *);
int aldap_search(struct aldap *, char *, enum scope, char *, char **, int, int, int, struct aldap_page_control *);
int aldap_get_errno(struct aldap *, const char **);
int aldap_get_resultcode(struct aldap_message *);
char *aldap_get_dn(struct aldap_message *);
char *aldap_get_diagmsg(struct aldap_message *);
char **aldap_get_references(struct aldap_message *);
void aldap_free_references(char **values);
#if 0
int aldap_parse_url(char *, struct aldap_url *);
void aldap_free_url(struct aldap_url *);
int aldap_search_url(struct aldap *, char *, int, int, int);
#endif
int aldap_count_attrs(struct aldap_message *);
int aldap_match_attr(struct aldap_message *, char *, char ***);
int aldap_first_attr(struct aldap_message *, char **, char ***);
int aldap_next_attr(struct aldap_message *, char **, char ***);
int aldap_free_attr(char **);
struct aldap_page_control *aldap_parse_page_control(struct ber_element *, size_t len);
void aldap_freepage(struct aldap_page_control *);
diff --git a/usr.sbin/ypldap/ber.c b/usr.sbin/ypldap/ber.c
index 62ba8f0f0d3b..b7d4d5e2939b 100644
--- a/usr.sbin/ypldap/ber.c
+++ b/usr.sbin/ypldap/ber.c
@@ -1,1277 +1,1276 @@
/* $OpenBSD: ber.c,v 1.9 2015/02/12 00:30:38 pelikan Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2007 Reyk Floeter <reyk@vantronix.net>
* Copyright (c) 2006, 2007 Claudio Jeker <claudio@openbsd.org>
* Copyright (c) 2006, 2007 Marc Balmer <mbalmer@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <errno.h>
#include <limits.h>
#include <stdlib.h>
#include <err.h> /* XXX for debug output */
#include <stdio.h> /* XXX for debug output */
#include <string.h>
#include <unistd.h>
#include <stdarg.h>
#include "ber.h"
#define MINIMUM(a, b) (((a) < (b)) ? (a) : (b))
#define BER_TYPE_CONSTRUCTED 0x20 /* otherwise primitive */
#define BER_TYPE_SINGLE_MAX 30
#define BER_TAG_MASK 0x1f
#define BER_TAG_MORE 0x80 /* more subsequent octets */
#define BER_TAG_TYPE_MASK 0x7f
#define BER_CLASS_SHIFT 6
static int ber_dump_element(struct ber *ber, struct ber_element *root);
static void ber_dump_header(struct ber *ber, struct ber_element *root);
static void ber_putc(struct ber *ber, u_char c);
static void ber_write(struct ber *ber, void *buf, size_t len);
static ssize_t get_id(struct ber *b, unsigned long *tag, int *class,
int *cstruct);
static ssize_t get_len(struct ber *b, ssize_t *len);
static ssize_t ber_read_element(struct ber *ber, struct ber_element *elm);
static ssize_t ber_readbuf(struct ber *b, void *buf, size_t nbytes);
static ssize_t ber_getc(struct ber *b, u_char *c);
static ssize_t ber_read(struct ber *ber, void *buf, size_t len);
#ifdef DEBUG
#define DPRINTF(...) printf(__VA_ARGS__)
#else
#define DPRINTF(...) do { } while (0)
#endif
struct ber_element *
ber_get_element(unsigned long encoding)
{
struct ber_element *elm;
if ((elm = calloc(1, sizeof(*elm))) == NULL)
return NULL;
elm->be_encoding = encoding;
ber_set_header(elm, BER_CLASS_UNIVERSAL, BER_TYPE_DEFAULT);
return elm;
}
void
ber_set_header(struct ber_element *elm, int class, unsigned long type)
{
elm->be_class = class & BER_CLASS_MASK;
if (type == BER_TYPE_DEFAULT)
type = elm->be_encoding;
elm->be_type = type;
}
void
ber_link_elements(struct ber_element *prev, struct ber_element *elm)
{
if (prev != NULL) {
if ((prev->be_encoding == BER_TYPE_SEQUENCE ||
prev->be_encoding == BER_TYPE_SET) &&
prev->be_sub == NULL)
prev->be_sub = elm;
else
prev->be_next = elm;
}
}
struct ber_element *
ber_unlink_elements(struct ber_element *prev)
{
struct ber_element *elm;
if ((prev->be_encoding == BER_TYPE_SEQUENCE ||
prev->be_encoding == BER_TYPE_SET) &&
prev->be_sub != NULL) {
elm = prev->be_sub;
prev->be_sub = NULL;
} else {
elm = prev->be_next;
prev->be_next = NULL;
}
return (elm);
}
void
ber_replace_elements(struct ber_element *prev, struct ber_element *new)
{
struct ber_element *ber, *next;
ber = ber_unlink_elements(prev);
next = ber_unlink_elements(ber);
ber_link_elements(new, next);
ber_link_elements(prev, new);
/* cleanup old element */
ber_free_elements(ber);
}
struct ber_element *
ber_add_sequence(struct ber_element *prev)
{
struct ber_element *elm;
if ((elm = ber_get_element(BER_TYPE_SEQUENCE)) == NULL)
return NULL;
ber_link_elements(prev, elm);
return elm;
}
struct ber_element *
ber_add_set(struct ber_element *prev)
{
struct ber_element *elm;
if ((elm = ber_get_element(BER_TYPE_SET)) == NULL)
return NULL;
ber_link_elements(prev, elm);
return elm;
}
struct ber_element *
ber_add_enumerated(struct ber_element *prev, long long val)
{
struct ber_element *elm;
u_int i, len = 0;
u_char cur, last = 0;
if ((elm = ber_get_element(BER_TYPE_ENUMERATED)) == NULL)
return NULL;
elm->be_numeric = val;
for (i = 0; i < sizeof(long long); i++) {
cur = val & 0xff;
if (cur != 0 && cur != 0xff)
len = i;
if ((cur == 0 && last & 0x80) ||
(cur == 0xff && (last & 0x80) == 0))
len = i;
val >>= 8;
last = cur;
}
elm->be_len = len + 1;
ber_link_elements(prev, elm);
return elm;
}
struct ber_element *
ber_add_integer(struct ber_element *prev, long long val)
{
struct ber_element *elm;
u_int i, len = 0;
u_char cur, last = 0;
if ((elm = ber_get_element(BER_TYPE_INTEGER)) == NULL)
return NULL;
elm->be_numeric = val;
for (i = 0; i < sizeof(long long); i++) {
cur = val & 0xff;
if (cur != 0 && cur != 0xff)
len = i;
if ((cur == 0 && last & 0x80) ||
(cur == 0xff && (last & 0x80) == 0))
len = i;
val >>= 8;
last = cur;
}
elm->be_len = len + 1;
ber_link_elements(prev, elm);
return elm;
}
int
ber_get_integer(struct ber_element *elm, long long *n)
{
if (elm->be_encoding != BER_TYPE_INTEGER)
return -1;
*n = elm->be_numeric;
return 0;
}
int
ber_get_enumerated(struct ber_element *elm, long long *n)
{
if (elm->be_encoding != BER_TYPE_ENUMERATED)
return -1;
*n = elm->be_numeric;
return 0;
}
struct ber_element *
ber_add_boolean(struct ber_element *prev, int bool)
{
struct ber_element *elm;
if ((elm = ber_get_element(BER_TYPE_BOOLEAN)) == NULL)
return NULL;
elm->be_numeric = bool ? 0xff : 0;
elm->be_len = 1;
ber_link_elements(prev, elm);
return elm;
}
int
ber_get_boolean(struct ber_element *elm, int *b)
{
if (elm->be_encoding != BER_TYPE_BOOLEAN)
return -1;
*b = !(elm->be_numeric == 0);
return 0;
}
struct ber_element *
ber_add_string(struct ber_element *prev, const char *string)
{
return ber_add_nstring(prev, string, strlen(string));
}
struct ber_element *
ber_add_nstring(struct ber_element *prev, const char *string0, size_t len)
{
struct ber_element *elm;
char *string;
if ((string = calloc(1, len)) == NULL)
return NULL;
if ((elm = ber_get_element(BER_TYPE_OCTETSTRING)) == NULL) {
free(string);
return NULL;
}
bcopy(string0, string, len);
elm->be_val = string;
elm->be_len = len;
elm->be_free = 1; /* free string on cleanup */
ber_link_elements(prev, elm);
return elm;
}
int
ber_get_string(struct ber_element *elm, char **s)
{
if (elm->be_encoding != BER_TYPE_OCTETSTRING)
return -1;
*s = elm->be_val;
return 0;
}
int
ber_get_nstring(struct ber_element *elm, void **p, size_t *len)
{
if (elm->be_encoding != BER_TYPE_OCTETSTRING)
return -1;
*p = elm->be_val;
*len = elm->be_len;
return 0;
}
struct ber_element *
ber_add_bitstring(struct ber_element *prev, const void *v0, size_t len)
{
struct ber_element *elm;
void *v;
if ((v = calloc(1, len)) == NULL)
return NULL;
if ((elm = ber_get_element(BER_TYPE_BITSTRING)) == NULL) {
free(v);
return NULL;
}
bcopy(v0, v, len);
elm->be_val = v;
elm->be_len = len;
elm->be_free = 1; /* free string on cleanup */
ber_link_elements(prev, elm);
return elm;
}
int
ber_get_bitstring(struct ber_element *elm, void **v, size_t *len)
{
if (elm->be_encoding != BER_TYPE_BITSTRING)
return -1;
*v = elm->be_val;
*len = elm->be_len;
return 0;
}
struct ber_element *
ber_add_null(struct ber_element *prev)
{
struct ber_element *elm;
if ((elm = ber_get_element(BER_TYPE_NULL)) == NULL)
return NULL;
ber_link_elements(prev, elm);
return elm;
}
int
ber_get_null(struct ber_element *elm)
{
if (elm->be_encoding != BER_TYPE_NULL)
return -1;
return 0;
}
struct ber_element *
ber_add_eoc(struct ber_element *prev)
{
struct ber_element *elm;
if ((elm = ber_get_element(BER_TYPE_EOC)) == NULL)
return NULL;
ber_link_elements(prev, elm);
return elm;
}
int
ber_get_eoc(struct ber_element *elm)
{
if (elm->be_encoding != BER_TYPE_EOC)
return -1;
return 0;
}
size_t
ber_oid2ber(struct ber_oid *o, u_int8_t *buf, size_t len)
{
u_int32_t v;
u_int i, j = 0, k;
if (o->bo_n < BER_MIN_OID_LEN || o->bo_n > BER_MAX_OID_LEN ||
o->bo_id[0] > 2 || o->bo_id[1] > 40)
return (0);
v = (o->bo_id[0] * 40) + o->bo_id[1];
for (i = 2, j = 0; i <= o->bo_n; v = o->bo_id[i], i++) {
for (k = 28; k >= 7; k -= 7) {
if (v >= (u_int)(1 << k)) {
if (len)
buf[j] = v >> k | BER_TAG_MORE;
j++;
}
}
if (len)
buf[j] = v & BER_TAG_TYPE_MASK;
j++;
}
return (j);
}
int
ber_string2oid(const char *oidstr, struct ber_oid *o)
{
char *sp, *p, str[BUFSIZ];
const char *errstr;
if (strlcpy(str, oidstr, sizeof(str)) >= sizeof(str))
return (-1);
bzero(o, sizeof(*o));
/* Parse OID strings in the common forms n.n.n, n_n_n_n, or n-n-n */
for (p = sp = str; p != NULL; sp = p) {
if ((p = strpbrk(p, "._-")) != NULL)
*p++ = '\0';
o->bo_id[o->bo_n++] = strtonum(sp, 0, UINT_MAX, &errstr);
if (errstr || o->bo_n > BER_MAX_OID_LEN)
return (-1);
}
return (0);
}
struct ber_element *
ber_add_oid(struct ber_element *prev, struct ber_oid *o)
{
struct ber_element *elm;
u_int8_t *buf;
size_t len;
if ((elm = ber_get_element(BER_TYPE_OBJECT)) == NULL)
return (NULL);
if ((len = ber_oid2ber(o, NULL, 0)) == 0)
goto fail;
if ((buf = calloc(1, len)) == NULL)
goto fail;
elm->be_val = buf;
elm->be_len = len;
elm->be_free = 1;
if (ber_oid2ber(o, buf, len) != len)
goto fail;
ber_link_elements(prev, elm);
return (elm);
fail:
ber_free_elements(elm);
return (NULL);
}
struct ber_element *
ber_add_noid(struct ber_element *prev, struct ber_oid *o, int n)
{
struct ber_oid no;
if (n > BER_MAX_OID_LEN)
return (NULL);
no.bo_n = n;
bcopy(&o->bo_id, &no.bo_id, sizeof(no.bo_id));
return (ber_add_oid(prev, &no));
}
struct ber_element *
ber_add_oidstring(struct ber_element *prev, const char *oidstr)
{
struct ber_oid o;
if (ber_string2oid(oidstr, &o) == -1)
return (NULL);
return (ber_add_oid(prev, &o));
}
int
ber_get_oid(struct ber_element *elm, struct ber_oid *o)
{
u_int8_t *buf;
size_t len, i = 0, j = 0;
if (elm->be_encoding != BER_TYPE_OBJECT)
return (-1);
buf = elm->be_val;
len = elm->be_len;
if (!buf[i])
return (-1);
bzero(o, sizeof(*o));
o->bo_id[j++] = buf[i] / 40;
o->bo_id[j++] = buf[i++] % 40;
for (; i < len && j < BER_MAX_OID_LEN; i++) {
o->bo_id[j] = (o->bo_id[j] << 7) + (buf[i] & ~0x80);
if (buf[i] & 0x80)
continue;
j++;
}
o->bo_n = j;
return (0);
}
struct ber_element *
ber_printf_elements(struct ber_element *ber, char *fmt, ...)
{
va_list ap;
int d, class;
size_t len;
unsigned long type;
long long i;
char *s;
void *p;
struct ber_oid *o;
struct ber_element *sub = ber, *e;
va_start(ap, fmt);
while (*fmt) {
switch (*fmt++) {
case 'B':
p = va_arg(ap, void *);
len = va_arg(ap, size_t);
if ((ber = ber_add_bitstring(ber, p, len)) == NULL)
goto fail;
break;
case 'b':
d = va_arg(ap, int);
if ((ber = ber_add_boolean(ber, d)) == NULL)
goto fail;
break;
case 'd':
d = va_arg(ap, int);
if ((ber = ber_add_integer(ber, d)) == NULL)
goto fail;
break;
case 'e':
e = va_arg(ap, struct ber_element *);
ber_link_elements(ber, e);
break;
case 'E':
i = va_arg(ap, long long);
if ((ber = ber_add_enumerated(ber, i)) == NULL)
goto fail;
break;
case 'i':
i = va_arg(ap, long long);
if ((ber = ber_add_integer(ber, i)) == NULL)
goto fail;
break;
case 'O':
o = va_arg(ap, struct ber_oid *);
if ((ber = ber_add_oid(ber, o)) == NULL)
goto fail;
break;
case 'o':
s = va_arg(ap, char *);
if ((ber = ber_add_oidstring(ber, s)) == NULL)
goto fail;
break;
case 's':
s = va_arg(ap, char *);
if ((ber = ber_add_string(ber, s)) == NULL)
goto fail;
break;
case 't':
class = va_arg(ap, int);
type = va_arg(ap, unsigned long);
ber_set_header(ber, class, type);
break;
case 'x':
s = va_arg(ap, char *);
len = va_arg(ap, size_t);
if ((ber = ber_add_nstring(ber, s, len)) == NULL)
goto fail;
break;
case '0':
if ((ber = ber_add_null(ber)) == NULL)
goto fail;
break;
case '{':
if ((ber = sub = ber_add_sequence(ber)) == NULL)
goto fail;
break;
case '(':
if ((ber = sub = ber_add_set(ber)) == NULL)
goto fail;
break;
case '}':
case ')':
ber = sub;
break;
case '.':
if ((e = ber_add_eoc(ber)) == NULL)
goto fail;
ber = e;
break;
default:
break;
}
}
va_end(ap);
return (ber);
fail:
va_end(ap);
return (NULL);
}
int
ber_scanf_elements(struct ber_element *ber, char *fmt, ...)
{
#define _MAX_SEQ 128
va_list ap;
int *d, level = -1;
unsigned long *t;
long long *i;
void **ptr;
size_t *len, ret = 0, n = strlen(fmt);
char **s;
struct ber_oid *o;
struct ber_element *parent[_MAX_SEQ], **e;
bzero(parent, sizeof(struct ber_element *) * _MAX_SEQ);
va_start(ap, fmt);
while (*fmt) {
switch (*fmt++) {
case 'B':
ptr = va_arg(ap, void **);
len = va_arg(ap, size_t *);
if (ber_get_bitstring(ber, ptr, len) == -1)
goto fail;
ret++;
break;
case 'b':
d = va_arg(ap, int *);
if (ber_get_boolean(ber, d) == -1)
goto fail;
ret++;
break;
case 'e':
e = va_arg(ap, struct ber_element **);
*e = ber;
ret++;
continue;
case 'E':
i = va_arg(ap, long long *);
if (ber_get_enumerated(ber, i) == -1)
goto fail;
ret++;
break;
case 'i':
i = va_arg(ap, long long *);
if (ber_get_integer(ber, i) == -1)
goto fail;
ret++;
break;
case 'o':
o = va_arg(ap, struct ber_oid *);
if (ber_get_oid(ber, o) == -1)
goto fail;
ret++;
break;
case 'S':
ret++;
break;
case 's':
s = va_arg(ap, char **);
if (ber_get_string(ber, s) == -1)
goto fail;
ret++;
break;
case 't':
d = va_arg(ap, int *);
t = va_arg(ap, unsigned long *);
*d = ber->be_class;
*t = ber->be_type;
ret++;
continue;
case 'x':
ptr = va_arg(ap, void **);
len = va_arg(ap, size_t *);
if (ber_get_nstring(ber, ptr, len) == -1)
goto fail;
ret++;
break;
case '0':
if (ber->be_encoding != BER_TYPE_NULL)
goto fail;
ret++;
break;
case '.':
if (ber->be_encoding != BER_TYPE_EOC)
goto fail;
ret++;
break;
case '{':
case '(':
if (ber->be_encoding != BER_TYPE_SEQUENCE &&
ber->be_encoding != BER_TYPE_SET)
goto fail;
if (ber->be_sub == NULL || level >= _MAX_SEQ-1)
goto fail;
parent[++level] = ber;
ber = ber->be_sub;
ret++;
continue;
case '}':
case ')':
if (level < 0 || parent[level] == NULL)
goto fail;
ber = parent[level--];
ret++;
continue;
default:
goto fail;
}
if (ber->be_next == NULL)
continue;
ber = ber->be_next;
}
va_end(ap);
return (ret == n ? 0 : -1);
fail:
va_end(ap);
return (-1);
}
/*
* write ber elements to the socket
*
* params:
* ber holds the socket
* root fully populated element tree
*
* returns:
* >=0 number of bytes written
* -1 on failure and sets errno
*/
int
ber_write_elements(struct ber *ber, struct ber_element *root)
{
size_t len;
/* calculate length because only the definite form is required */
len = ber_calc_len(root);
DPRINTF("write ber element of %zd bytes length\n", len);
if (ber->br_wbuf != NULL && ber->br_wbuf + len > ber->br_wend) {
free(ber->br_wbuf);
ber->br_wbuf = NULL;
}
if (ber->br_wbuf == NULL) {
if ((ber->br_wbuf = malloc(len)) == NULL)
return -1;
ber->br_wend = ber->br_wbuf + len;
}
/* reset write pointer */
ber->br_wptr = ber->br_wbuf;
if (ber_dump_element(ber, root) == -1)
return -1;
/* XXX this should be moved to a different function */
if (ber->fd != -1)
return write(ber->fd, ber->br_wbuf, len);
return (len);
}
/*
* read ber elements from the socket
*
* params:
* ber holds the socket and lot more
* root if NULL, build up an element tree from what we receive on
* the wire. If not null, use the specified encoding for the
* elements received.
*
* returns:
* !=NULL, elements read and store in the ber_element tree
* NULL, type mismatch or read error
*/
struct ber_element *
ber_read_elements(struct ber *ber, struct ber_element *elm)
{
struct ber_element *root = elm;
if (root == NULL) {
if ((root = ber_get_element(0)) == NULL)
return NULL;
}
DPRINTF("read ber elements, root %p\n", root);
if (ber_read_element(ber, root) == -1) {
/* Cleanup if root was allocated by us */
if (elm == NULL)
ber_free_elements(root);
return NULL;
}
return root;
}
void
ber_free_elements(struct ber_element *root)
{
if (root->be_sub && (root->be_encoding == BER_TYPE_SEQUENCE ||
root->be_encoding == BER_TYPE_SET))
ber_free_elements(root->be_sub);
if (root->be_next)
ber_free_elements(root->be_next);
if (root->be_free && (root->be_encoding == BER_TYPE_OCTETSTRING ||
root->be_encoding == BER_TYPE_BITSTRING ||
root->be_encoding == BER_TYPE_OBJECT))
free(root->be_val);
free(root);
}
size_t
ber_calc_len(struct ber_element *root)
{
unsigned long t;
size_t s;
size_t size = 2; /* minimum 1 byte head and 1 byte size */
/* calculate the real length of a sequence or set */
if (root->be_sub && (root->be_encoding == BER_TYPE_SEQUENCE ||
root->be_encoding == BER_TYPE_SET))
root->be_len = ber_calc_len(root->be_sub);
/* fix header length for extended types */
if (root->be_type > BER_TYPE_SINGLE_MAX)
for (t = root->be_type; t > 0; t >>= 7)
size++;
if (root->be_len >= BER_TAG_MORE)
for (s = root->be_len; s > 0; s >>= 8)
size++;
/* calculate the length of the following elements */
if (root->be_next)
size += ber_calc_len(root->be_next);
/* This is an empty element, do not use a minimal size */
if (root->be_type == BER_TYPE_EOC && root->be_len == 0)
return (0);
return (root->be_len + size);
}
/*
* internal functions
*/
static int
ber_dump_element(struct ber *ber, struct ber_element *root)
{
unsigned long long l;
int i;
uint8_t u;
ber_dump_header(ber, root);
switch (root->be_encoding) {
case BER_TYPE_BOOLEAN:
case BER_TYPE_INTEGER:
case BER_TYPE_ENUMERATED:
l = (unsigned long long)root->be_numeric;
for (i = root->be_len; i > 0; i--) {
u = (l >> ((i - 1) * 8)) & 0xff;
ber_putc(ber, u);
}
break;
case BER_TYPE_BITSTRING:
return -1;
case BER_TYPE_OCTETSTRING:
case BER_TYPE_OBJECT:
ber_write(ber, root->be_val, root->be_len);
break;
case BER_TYPE_NULL: /* no payload */
case BER_TYPE_EOC:
break;
case BER_TYPE_SEQUENCE:
case BER_TYPE_SET:
if (root->be_sub && ber_dump_element(ber, root->be_sub) == -1)
return -1;
break;
}
if (root->be_next == NULL)
return 0;
return ber_dump_element(ber, root->be_next);
}
static void
ber_dump_header(struct ber *ber, struct ber_element *root)
{
u_char id = 0, t, buf[8];
unsigned long type;
size_t size;
/* class universal, type encoding depending on type value */
/* length encoding */
if (root->be_type <= BER_TYPE_SINGLE_MAX) {
id = root->be_type | (root->be_class << BER_CLASS_SHIFT);
if (root->be_encoding == BER_TYPE_SEQUENCE ||
root->be_encoding == BER_TYPE_SET)
id |= BER_TYPE_CONSTRUCTED;
ber_putc(ber, id);
} else {
id = BER_TAG_MASK | (root->be_class << BER_CLASS_SHIFT);
if (root->be_encoding == BER_TYPE_SEQUENCE ||
root->be_encoding == BER_TYPE_SET)
id |= BER_TYPE_CONSTRUCTED;
ber_putc(ber, id);
for (t = 0, type = root->be_type; type > 0; type >>= 7)
buf[t++] = type & ~BER_TAG_MORE;
while (t-- > 0) {
if (t > 0)
buf[t] |= BER_TAG_MORE;
ber_putc(ber, buf[t]);
}
}
if (root->be_len < BER_TAG_MORE) {
/* short form */
ber_putc(ber, root->be_len);
} else {
for (t = 0, size = root->be_len; size > 0; size >>= 8)
buf[t++] = size & 0xff;
ber_putc(ber, t | BER_TAG_MORE);
while (t > 0)
ber_putc(ber, buf[--t]);
}
}
static void
ber_putc(struct ber *ber, u_char c)
{
if (ber->br_wptr + 1 <= ber->br_wend)
*ber->br_wptr = c;
ber->br_wptr++;
}
static void
ber_write(struct ber *ber, void *buf, size_t len)
{
if (ber->br_wptr + len <= ber->br_wend)
bcopy(buf, ber->br_wptr, len);
ber->br_wptr += len;
}
/*
* extract a BER encoded tag. There are two types, a short and long form.
*/
static ssize_t
get_id(struct ber *b, unsigned long *tag, int *class, int *cstruct)
{
u_char u;
size_t i = 0;
unsigned long t = 0;
if (ber_getc(b, &u) == -1)
return -1;
*class = (u >> BER_CLASS_SHIFT) & BER_CLASS_MASK;
*cstruct = (u & BER_TYPE_CONSTRUCTED) == BER_TYPE_CONSTRUCTED;
if ((u & BER_TAG_MASK) != BER_TAG_MASK) {
*tag = u & BER_TAG_MASK;
return 1;
}
do {
if (ber_getc(b, &u) == -1)
return -1;
t = (t << 7) | (u & ~BER_TAG_MORE);
i++;
} while (u & BER_TAG_MORE);
if (i > sizeof(unsigned long)) {
errno = ERANGE;
return -1;
}
*tag = t;
return i + 1;
}
/*
* extract length of a ber object -- if length is unknown an error is returned.
*/
static ssize_t
get_len(struct ber *b, ssize_t *len)
{
u_char u, n;
ssize_t s, r;
if (ber_getc(b, &u) == -1)
return -1;
if ((u & BER_TAG_MORE) == 0) {
/* short form */
*len = u;
return 1;
}
n = u & ~BER_TAG_MORE;
if (sizeof(ssize_t) < n) {
errno = ERANGE;
return -1;
}
r = n + 1;
for (s = 0; n > 0; n--) {
if (ber_getc(b, &u) == -1)
return -1;
s = (s << 8) | u;
}
if (s < 0) {
/* overflow */
errno = ERANGE;
return -1;
}
if (s == 0) {
/* invalid encoding */
errno = EINVAL;
return -1;
}
*len = s;
return r;
}
static ssize_t
ber_read_element(struct ber *ber, struct ber_element *elm)
{
long long val = 0;
struct ber_element *next;
unsigned long type;
int i, class, cstruct;
ssize_t len, r, totlen = 0;
u_char c;
if ((r = get_id(ber, &type, &class, &cstruct)) == -1)
return -1;
DPRINTF("ber read got class %d type %lu, %s\n",
class, type, cstruct ? "constructive" : "primitive");
totlen += r;
if ((r = get_len(ber, &len)) == -1)
return -1;
DPRINTF("ber read element size %zd\n", len);
totlen += r + len;
/*
* If using an external buffer and the total size of the element
* is larger, then the external buffer don't bother to continue.
*/
if (ber->fd == -1 && len > ber->br_rend - ber->br_rptr) {
errno = ECANCELED;
return -1;
}
elm->be_type = type;
elm->be_len = len;
elm->be_class = class;
if (elm->be_encoding == 0) {
/* try to figure out the encoding via class, type and cstruct */
if (cstruct)
elm->be_encoding = BER_TYPE_SEQUENCE;
else if (class == BER_CLASS_UNIVERSAL)
elm->be_encoding = type;
else if (ber->br_application != NULL) {
/*
* Ask the application to map the encoding to a
* universal type. For example, a SMI IpAddress
* type is defined as 4 byte OCTET STRING.
*/
elm->be_encoding = (*ber->br_application)(elm);
} else
/* last resort option */
elm->be_encoding = BER_TYPE_NULL;
}
switch (elm->be_encoding) {
case BER_TYPE_EOC: /* End-Of-Content */
break;
case BER_TYPE_BOOLEAN:
case BER_TYPE_INTEGER:
case BER_TYPE_ENUMERATED:
if (len > (ssize_t)sizeof(long long))
return -1;
for (i = 0; i < len; i++) {
if (ber_getc(ber, &c) != 1)
return -1;
val <<= 8;
val |= c;
}
/* sign extend if MSB is set */
if (val >> ((i - 1) * 8) & 0x80)
val |= ULLONG_MAX << (i * 8);
elm->be_numeric = val;
break;
case BER_TYPE_BITSTRING:
elm->be_val = malloc(len);
if (elm->be_val == NULL)
return -1;
elm->be_free = 1;
elm->be_len = len;
ber_read(ber, elm->be_val, len);
break;
case BER_TYPE_OCTETSTRING:
case BER_TYPE_OBJECT:
elm->be_val = malloc(len + 1);
if (elm->be_val == NULL)
return -1;
elm->be_free = 1;
elm->be_len = len;
ber_read(ber, elm->be_val, len);
((u_char *)elm->be_val)[len] = '\0';
break;
case BER_TYPE_NULL: /* no payload */
if (len != 0)
return -1;
break;
case BER_TYPE_SEQUENCE:
case BER_TYPE_SET:
if (elm->be_sub == NULL) {
if ((elm->be_sub = ber_get_element(0)) == NULL)
return -1;
}
next = elm->be_sub;
while (len > 0) {
r = ber_read_element(ber, next);
if (r == -1)
return -1;
len -= r;
if (len > 0 && next->be_next == NULL) {
if ((next->be_next = ber_get_element(0)) ==
NULL)
return -1;
}
next = next->be_next;
}
break;
}
return totlen;
}
static ssize_t
ber_readbuf(struct ber *b, void *buf, size_t nbytes)
{
size_t sz;
size_t len;
if (b->br_rbuf == NULL)
return -1;
sz = b->br_rend - b->br_rptr;
len = MINIMUM(nbytes, sz);
if (len == 0) {
errno = ECANCELED;
return (-1); /* end of buffer and parser wants more data */
}
bcopy(b->br_rptr, buf, len);
b->br_rptr += len;
return (len);
}
void
ber_set_readbuf(struct ber *b, void *buf, size_t len)
{
b->br_rbuf = b->br_rptr = buf;
b->br_rend = (u_int8_t *)buf + len;
}
ssize_t
ber_get_writebuf(struct ber *b, void **buf)
{
if (b->br_wbuf == NULL)
return -1;
*buf = b->br_wbuf;
return (b->br_wend - b->br_wbuf);
}
void
ber_set_application(struct ber *b, unsigned long (*cb)(struct ber_element *))
{
b->br_application = cb;
}
void
ber_free(struct ber *b)
{
free(b->br_wbuf);
}
static ssize_t
ber_getc(struct ber *b, u_char *c)
{
ssize_t r;
/*
* XXX calling read here is wrong in many ways. The most obvious one
* being that we will block till data arrives.
* But for now it is _good enough_ *gulp*
*/
if (b->fd == -1)
r = ber_readbuf(b, c, 1);
else
r = read(b->fd, c, 1);
return r;
}
static ssize_t
ber_read(struct ber *ber, void *buf, size_t len)
{
u_char *b = buf;
ssize_t r, remain = len;
/*
* XXX calling read here is wrong in many ways. The most obvious one
* being that we will block till data arrives.
* But for now it is _good enough_ *gulp*
*/
while (remain > 0) {
if (ber->fd == -1)
r = ber_readbuf(ber, b, remain);
else
r = read(ber->fd, b, remain);
if (r == -1) {
if (errno == EINTR || errno == EAGAIN)
continue;
return -1;
}
if (r == 0)
return (b - (u_char *)buf);
b += r;
remain -= r;
}
return (b - (u_char *)buf);
}
diff --git a/usr.sbin/ypldap/ber.h b/usr.sbin/ypldap/ber.h
index eec02d4ac1b4..8498fd02be38 100644
--- a/usr.sbin/ypldap/ber.h
+++ b/usr.sbin/ypldap/ber.h
@@ -1,129 +1,128 @@
/* $OpenBSD: ber.h,v 1.2 2008/12/29 15:48:13 aschrijver Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2007 Reyk Floeter <reyk@vantronix.net>
* Copyright (c) 2006, 2007 Claudio Jeker <claudio@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
struct ber_element {
struct ber_element *be_next;
unsigned long be_type;
unsigned long be_encoding;
size_t be_len;
int be_free;
u_int8_t be_class;
union {
struct ber_element *bv_sub;
void *bv_val;
long long bv_numeric;
} be_union;
#define be_sub be_union.bv_sub
#define be_val be_union.bv_val
#define be_numeric be_union.bv_numeric
};
struct ber {
int fd;
u_char *br_wbuf;
u_char *br_wptr;
u_char *br_wend;
u_char *br_rbuf;
u_char *br_rptr;
u_char *br_rend;
unsigned long (*br_application)(struct ber_element *);
};
/* well-known ber_element types */
#define BER_TYPE_DEFAULT ((unsigned long)-1)
#define BER_TYPE_EOC 0
#define BER_TYPE_BOOLEAN 1
#define BER_TYPE_INTEGER 2
#define BER_TYPE_BITSTRING 3
#define BER_TYPE_OCTETSTRING 4
#define BER_TYPE_NULL 5
#define BER_TYPE_OBJECT 6
#define BER_TYPE_ENUMERATED 10
#define BER_TYPE_SEQUENCE 16
#define BER_TYPE_SET 17
/* ber classes */
#define BER_CLASS_UNIVERSAL 0x0
#define BER_CLASS_UNIV BER_CLASS_UNIVERSAL
#define BER_CLASS_APPLICATION 0x1
#define BER_CLASS_APP BER_CLASS_APPLICATION
#define BER_CLASS_CONTEXT 0x2
#define BER_CLASS_PRIVATE 0x3
#define BER_CLASS_MASK 0x3
/* common definitions */
#define BER_MIN_OID_LEN 2 /* OBJECT */
#define BER_MAX_OID_LEN 32 /* OBJECT */
struct ber_oid {
u_int32_t bo_id[BER_MAX_OID_LEN + 1];
size_t bo_n;
};
__BEGIN_DECLS
struct ber_element *ber_get_element(unsigned long);
void ber_set_header(struct ber_element *, int,
unsigned long);
void ber_link_elements(struct ber_element *,
struct ber_element *);
struct ber_element *ber_unlink_elements(struct ber_element *);
void ber_replace_elements(struct ber_element *,
struct ber_element *);
struct ber_element *ber_add_sequence(struct ber_element *);
struct ber_element *ber_add_set(struct ber_element *);
struct ber_element *ber_add_integer(struct ber_element *, long long);
int ber_get_integer(struct ber_element *, long long *);
struct ber_element *ber_add_enumerated(struct ber_element *, long long);
int ber_get_enumerated(struct ber_element *, long long *);
struct ber_element *ber_add_boolean(struct ber_element *, int);
int ber_get_boolean(struct ber_element *, int *);
struct ber_element *ber_add_string(struct ber_element *, const char *);
struct ber_element *ber_add_nstring(struct ber_element *, const char *,
size_t);
int ber_get_string(struct ber_element *, char **);
int ber_get_nstring(struct ber_element *, void **,
size_t *);
struct ber_element *ber_add_bitstring(struct ber_element *, const void *,
size_t);
int ber_get_bitstring(struct ber_element *, void **,
size_t *);
struct ber_element *ber_add_null(struct ber_element *);
int ber_get_null(struct ber_element *);
struct ber_element *ber_add_eoc(struct ber_element *);
int ber_get_eoc(struct ber_element *);
struct ber_element *ber_add_oid(struct ber_element *, struct ber_oid *);
struct ber_element *ber_add_noid(struct ber_element *, struct ber_oid *, int);
struct ber_element *ber_add_oidstring(struct ber_element *, const char *);
int ber_get_oid(struct ber_element *, struct ber_oid *);
size_t ber_oid2ber(struct ber_oid *, u_int8_t *, size_t);
int ber_string2oid(const char *, struct ber_oid *);
struct ber_element *ber_printf_elements(struct ber_element *, char *, ...);
int ber_scanf_elements(struct ber_element *, char *, ...);
ssize_t ber_get_writebuf(struct ber *, void **);
int ber_write_elements(struct ber *, struct ber_element *);
void ber_set_readbuf(struct ber *, void *, size_t);
struct ber_element *ber_read_elements(struct ber *, struct ber_element *);
void ber_free_elements(struct ber_element *);
size_t ber_calc_len(struct ber_element *);
void ber_set_application(struct ber *,
unsigned long (*)(struct ber_element *));
void ber_free(struct ber *);
__END_DECLS
diff --git a/usr.sbin/ypldap/entries.c b/usr.sbin/ypldap/entries.c
index 1d57d5cd7b05..06720af089ef 100644
--- a/usr.sbin/ypldap/entries.c
+++ b/usr.sbin/ypldap/entries.c
@@ -1,151 +1,150 @@
/* $OpenBSD: entries.c,v 1.3 2015/01/16 06:40:22 deraadt Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2008 Pierre-Yves Ritschard <pyr@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/tree.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <event.h>
#include <fcntl.h>
#include <unistd.h>
#include <pwd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include "ypldap.h"
void
flatten_entries(struct env *env)
{
size_t wrlen;
size_t len;
char *linep;
char *endp;
char *tmp;
struct userent *ue;
struct groupent *ge;
log_debug("flattening trees");
/*
* This takes all the line pointers in RB elements and
* concatenates them in a single string, to be able to
* implement next element lookup without tree traversal.
*
* An extra octet is alloced to make space for an additional NUL.
*/
wrlen = env->sc_user_line_len;
if ((linep = calloc(1, env->sc_user_line_len + 1)) == NULL) {
/*
* XXX: try allocating a smaller chunk of memory
*/
fatal("out of memory");
}
endp = linep;
RB_FOREACH(ue, user_name_tree, env->sc_user_names) {
/*
* we convert the first nul back to a column,
* copy the string and then convert it back to a nul.
*/
ue->ue_line[strlen(ue->ue_line)] = ':';
log_debug("pushing line: %s", ue->ue_line);
len = strlen(ue->ue_line) + 1;
memcpy(endp, ue->ue_line, len);
endp[strcspn(endp, ":")] = '\0';
free(ue->ue_line);
ue->ue_line = endp;
endp += len;
wrlen -= len;
/*
* To save memory strdup(3) the netid_line which originally used
* LINE_WIDTH bytes
*/
tmp = ue->ue_netid_line;
ue->ue_netid_line = strdup(tmp);
if (ue->ue_netid_line == NULL) {
fatal("out of memory");
}
free(tmp);
}
env->sc_user_lines = linep;
log_debug("done pushing users");
wrlen = env->sc_group_line_len;
if ((linep = calloc(1, env->sc_group_line_len + 1)) == NULL) {
/*
* XXX: try allocating a smaller chunk of memory
*/
fatal("out of memory");
}
endp = linep;
RB_FOREACH(ge, group_name_tree, env->sc_group_names) {
/*
* we convert the first nul back to a column,
* copy the string and then convert it back to a nul.
*/
ge->ge_line[strlen(ge->ge_line)] = ':';
log_debug("pushing line: %s", ge->ge_line);
len = strlen(ge->ge_line) + 1;
memcpy(endp, ge->ge_line, len);
endp[strcspn(endp, ":")] = '\0';
free(ge->ge_line);
ge->ge_line = endp;
endp += len;
wrlen -= len;
}
env->sc_group_lines = linep;
log_debug("done pushing groups");
}
int
userent_name_cmp(struct userent *ue1, struct userent *ue2)
{
return (strcmp(ue1->ue_line, ue2->ue_line));
}
int
userent_uid_cmp(struct userent *ue1, struct userent *ue2)
{
return (ue1->ue_uid - ue2->ue_uid);
}
int
groupent_name_cmp(struct groupent *ge1, struct groupent *ge2)
{
return (strcmp(ge1->ge_line, ge2->ge_line));
}
int
groupent_gid_cmp(struct groupent *ge1, struct groupent *ge2)
{
return (ge1->ge_gid - ge2->ge_gid);
}
RB_GENERATE(user_name_tree, userent, ue_name_node, userent_name_cmp);
RB_GENERATE(user_uid_tree, userent, ue_uid_node, userent_uid_cmp);
RB_GENERATE(group_name_tree, groupent, ge_name_node, groupent_name_cmp);
RB_GENERATE(group_gid_tree, groupent, ge_gid_node, groupent_gid_cmp);
diff --git a/usr.sbin/ypldap/ldapclient.c b/usr.sbin/ypldap/ldapclient.c
index 5f446a6f847e..ab6dc76c4ecd 100644
--- a/usr.sbin/ypldap/ldapclient.c
+++ b/usr.sbin/ypldap/ldapclient.c
@@ -1,692 +1,691 @@
/* $OpenBSD: ldapclient.c,v 1.31 2014/11/16 23:24:44 tedu Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2008 Alexander Schrijver <aschrijver@openbsd.org>
* Copyright (c) 2008 Pierre-Yves Ritschard <pyr@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/tree.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#include <errno.h>
#include <err.h>
#include <event.h>
#include <fcntl.h>
#include <unistd.h>
#include <pwd.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aldap.h"
#include "ypldap.h"
void client_sig_handler(int, short, void *);
void client_dispatch_dns(int, short, void *);
void client_dispatch_parent(int, short, void *);
void client_shutdown(void);
void client_connect(int, short, void *);
void client_configure(struct env *);
void client_periodic_update(int, short, void *);
int client_build_req(struct idm *, struct idm_req *, struct aldap_message *,
int, int);
int client_search_idm(struct env *, struct idm *, struct aldap *,
char **, char *, int, int, enum imsg_type);
int client_try_idm(struct env *, struct idm *);
int client_addr_init(struct idm *);
int client_addr_free(struct idm *);
struct aldap *client_aldap_open(struct ypldap_addr_list *);
/*
* dummy wrapper to provide aldap_init with its fd's.
*/
struct aldap *
client_aldap_open(struct ypldap_addr_list *addr)
{
int fd = -1;
struct ypldap_addr *p;
TAILQ_FOREACH(p, addr, next) {
char hbuf[NI_MAXHOST], sbuf[NI_MAXSERV];
struct sockaddr *sa = (struct sockaddr *)&p->ss;
if (getnameinfo(sa, sa->sa_len, hbuf, sizeof(hbuf), sbuf,
sizeof(sbuf), NI_NUMERICHOST | NI_NUMERICSERV))
errx(1, "could not get numeric hostname");
if ((fd = socket(sa->sa_family, SOCK_STREAM, 0)) < 0)
return NULL;
if (connect(fd, sa, sa->sa_len) == 0)
break;
warn("connect to %s port %s (%s) failed", hbuf, sbuf, "tcp");
close(fd);
}
if (fd == -1)
return NULL;
return aldap_init(fd);
}
int
client_addr_init(struct idm *idm)
{
struct sockaddr_in *sa_in;
struct sockaddr_in6 *sa_in6;
struct ypldap_addr *h;
TAILQ_FOREACH(h, &idm->idm_addr, next) {
switch (h->ss.ss_family) {
case AF_INET:
sa_in = (struct sockaddr_in *)&h->ss;
if (ntohs(sa_in->sin_port) == 0)
sa_in->sin_port = htons(LDAP_PORT);
idm->idm_state = STATE_DNS_DONE;
break;
case AF_INET6:
sa_in6 = (struct sockaddr_in6 *)&h->ss;
if (ntohs(sa_in6->sin6_port) == 0)
sa_in6->sin6_port = htons(LDAP_PORT);
idm->idm_state = STATE_DNS_DONE;
break;
default:
fatalx("king bula sez: wrong AF in client_addr_init");
/* not reached */
}
}
return (0);
}
int
client_addr_free(struct idm *idm)
{
struct ypldap_addr *h;
while (!TAILQ_EMPTY(&idm->idm_addr)) {
h = TAILQ_FIRST(&idm->idm_addr);
TAILQ_REMOVE(&idm->idm_addr, h, next);
free(h);
}
return (0);
}
void
client_sig_handler(int sig, short event, void *p)
{
switch (sig) {
case SIGINT:
case SIGTERM:
client_shutdown();
break;
default:
fatalx("unexpected signal");
}
}
void
client_dispatch_dns(int fd, short events, void *p)
{
struct imsg imsg;
u_int16_t dlen;
u_char *data;
struct ypldap_addr *h;
int n, wait_cnt = 0;
struct idm *idm;
int shut = 0;
struct env *env = p;
struct imsgev *iev = env->sc_iev_dns;
struct imsgbuf *ibuf = &iev->ibuf;
if ((events & (EV_READ | EV_WRITE)) == 0)
fatalx("unknown event");
if (events & EV_READ) {
if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
fatal("imsg_read error");
if (n == 0)
shut = 1;
}
if (events & EV_WRITE) {
if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
fatal("msgbuf_write");
if (n == 0)
shut = 1;
goto done;
}
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("client_dispatch_dns: imsg_get error");
if (n == 0)
break;
switch (imsg.hdr.type) {
case IMSG_HOST_DNS:
TAILQ_FOREACH(idm, &env->sc_idms, idm_entry)
if (idm->idm_id == imsg.hdr.peerid)
break;
if (idm == NULL) {
log_warnx("IMSG_HOST_DNS with invalid peerID");
break;
}
if (!TAILQ_EMPTY(&idm->idm_addr)) {
log_warnx("IMSG_HOST_DNS but addrs set!");
break;
}
dlen = imsg.hdr.len - IMSG_HEADER_SIZE;
if (dlen == 0) { /* no data -> temp error */
idm->idm_state = STATE_DNS_TEMPFAIL;
break;
}
data = (u_char *)imsg.data;
while (dlen >= sizeof(struct sockaddr_storage)) {
if ((h = calloc(1, sizeof(*h))) == NULL)
fatal(NULL);
memcpy(&h->ss, data, sizeof(h->ss));
TAILQ_INSERT_HEAD(&idm->idm_addr, h, next);
data += sizeof(h->ss);
dlen -= sizeof(h->ss);
}
if (dlen != 0)
fatalx("IMSG_HOST_DNS: dlen != 0");
client_addr_init(idm);
break;
default:
break;
}
imsg_free(&imsg);
}
TAILQ_FOREACH(idm, &env->sc_idms, idm_entry) {
if (client_try_idm(env, idm) == -1)
idm->idm_state = STATE_LDAP_FAIL;
if (idm->idm_state < STATE_LDAP_DONE)
wait_cnt++;
}
if (wait_cnt == 0)
imsg_compose_event(env->sc_iev, IMSG_END_UPDATE, 0, 0, -1,
NULL, 0);
done:
if (!shut)
imsg_event_add(iev);
else {
/* this pipe is dead, so remove the event handler */
event_del(&iev->ev);
event_loopexit(NULL);
}
}
void
client_dispatch_parent(int fd, short events, void *p)
{
int n;
int shut = 0;
struct imsg imsg;
struct env *env = p;
struct imsgev *iev = env->sc_iev;
struct imsgbuf *ibuf = &iev->ibuf;
if ((events & (EV_READ | EV_WRITE)) == 0)
fatalx("unknown event");
if (events & EV_READ) {
if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
fatal("imsg_read error");
if (n == 0)
shut = 1;
}
if (events & EV_WRITE) {
if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
fatal("msgbuf_write");
if (n == 0)
shut = 1;
goto done;
}
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("client_dispatch_parent: imsg_get error");
if (n == 0)
break;
switch (imsg.hdr.type) {
case IMSG_CONF_START: {
struct env params;
if (env->sc_flags & F_CONFIGURING) {
log_warnx("configuration already in progress");
break;
}
memcpy(&params, imsg.data, sizeof(params));
log_debug("configuration starting");
env->sc_flags |= F_CONFIGURING;
purge_config(env);
memcpy(&env->sc_conf_tv, &params.sc_conf_tv,
sizeof(env->sc_conf_tv));
env->sc_flags |= params.sc_flags;
break;
}
case IMSG_CONF_IDM: {
struct idm *idm;
if (!(env->sc_flags & F_CONFIGURING))
break;
if ((idm = calloc(1, sizeof(*idm))) == NULL)
fatal(NULL);
memcpy(idm, imsg.data, sizeof(*idm));
idm->idm_env = env;
TAILQ_INSERT_TAIL(&env->sc_idms, idm, idm_entry);
break;
}
case IMSG_CONF_END:
env->sc_flags &= ~F_CONFIGURING;
log_debug("applying configuration");
client_configure(env);
break;
default:
log_debug("client_dispatch_parent: unexpect imsg %d",
imsg.hdr.type);
break;
}
imsg_free(&imsg);
}
done:
if (!shut)
imsg_event_add(iev);
else {
/* this pipe is dead, so remove the event handler */
event_del(&iev->ev);
event_loopexit(NULL);
}
}
void
client_shutdown(void)
{
log_info("ldap client exiting");
_exit(0);
}
pid_t
ldapclient(int pipe_main2client[2])
{
pid_t pid, dns_pid;
int pipe_dns[2];
struct passwd *pw;
struct event ev_sigint;
struct event ev_sigterm;
struct env env;
switch (pid = fork()) {
case -1:
fatal("cannot fork");
break;
case 0:
break;
default:
return (pid);
}
memset(&env, 0, sizeof(env));
TAILQ_INIT(&env.sc_idms);
if ((pw = getpwnam(YPLDAP_USER)) == NULL)
fatal("getpwnam");
if (socketpair(AF_UNIX, SOCK_STREAM, PF_UNSPEC, pipe_dns) == -1)
fatal("socketpair");
dns_pid = ypldap_dns(pipe_dns, pw);
close(pipe_dns[1]);
#ifndef DEBUG
if (chroot(pw->pw_dir) == -1)
fatal("chroot");
if (chdir("/") == -1)
fatal("chdir");
#else
#warning disabling chrooting in DEBUG mode
#endif
setproctitle("ldap client");
ypldap_process = PROC_CLIENT;
#ifndef DEBUG
if (setgroups(1, &pw->pw_gid) ||
setresgid(pw->pw_gid, pw->pw_gid, pw->pw_gid) ||
setresuid(pw->pw_uid, pw->pw_uid, pw->pw_uid))
fatal("cannot drop privileges");
#else
#warning disabling privilege revocation in DEBUG mode
#endif
event_init();
signal(SIGPIPE, SIG_IGN);
signal_set(&ev_sigint, SIGINT, client_sig_handler, NULL);
signal_set(&ev_sigterm, SIGTERM, client_sig_handler, NULL);
signal_add(&ev_sigint, NULL);
signal_add(&ev_sigterm, NULL);
close(pipe_main2client[0]);
if ((env.sc_iev = calloc(1, sizeof(*env.sc_iev))) == NULL)
fatal(NULL);
if ((env.sc_iev_dns = calloc(1, sizeof(*env.sc_iev_dns))) == NULL)
fatal(NULL);
env.sc_iev->events = EV_READ;
env.sc_iev->data = &env;
imsg_init(&env.sc_iev->ibuf, pipe_main2client[1]);
env.sc_iev->handler = client_dispatch_parent;
event_set(&env.sc_iev->ev, env.sc_iev->ibuf.fd, env.sc_iev->events,
env.sc_iev->handler, &env);
event_add(&env.sc_iev->ev, NULL);
env.sc_iev_dns->events = EV_READ;
env.sc_iev_dns->data = &env;
imsg_init(&env.sc_iev_dns->ibuf, pipe_dns[0]);
env.sc_iev_dns->handler = client_dispatch_dns;
event_set(&env.sc_iev_dns->ev, env.sc_iev_dns->ibuf.fd,
env.sc_iev_dns->events, env.sc_iev_dns->handler, &env);
event_add(&env.sc_iev_dns->ev, NULL);
event_dispatch();
client_shutdown();
return (0);
}
int
client_build_req(struct idm *idm, struct idm_req *ir, struct aldap_message *m,
int min_attr, int max_attr)
{
char **ldap_attrs;
int i, k;
memset(ir, 0, sizeof(*ir));
for (i = min_attr; i < max_attr; i++) {
if (idm->idm_flags & F_FIXED_ATTR(i)) {
if (strlcat(ir->ir_line, idm->idm_attrs[i],
sizeof(ir->ir_line)) >= sizeof(ir->ir_line))
/*
* entry yields a line > 1024, trash it.
*/
return (-1);
if (i == ATTR_UID) {
ir->ir_key.ik_uid = strtonum(
idm->idm_attrs[i], 0,
UID_MAX, NULL);
} else if (i == ATTR_GR_GID) {
ir->ir_key.ik_gid = strtonum(
idm->idm_attrs[i], 0,
GID_MAX, NULL);
}
} else if (idm->idm_list & F_LIST(i)) {
aldap_match_attr(m, idm->idm_attrs[i], &ldap_attrs);
for (k = 0; k >= 0 && ldap_attrs && ldap_attrs[k] != NULL; k++) {
/* XXX: Fail when attributes have illegal characters e.g. ',' */
if (strlcat(ir->ir_line, ldap_attrs[k],
sizeof(ir->ir_line)) >= sizeof(ir->ir_line))
continue;
if (ldap_attrs[k+1] != NULL)
if (strlcat(ir->ir_line, ",",
sizeof(ir->ir_line))
>= sizeof(ir->ir_line)) {
aldap_free_attr(ldap_attrs);
return (-1);
}
}
aldap_free_attr(ldap_attrs);
} else {
if (aldap_match_attr(m, idm->idm_attrs[i], &ldap_attrs) == -1)
return (-1);
if (strlcat(ir->ir_line, ldap_attrs[0],
sizeof(ir->ir_line)) >= sizeof(ir->ir_line)) {
aldap_free_attr(ldap_attrs);
return (-1);
}
if (i == ATTR_UID) {
ir->ir_key.ik_uid = strtonum(
ldap_attrs[0], 0, UID_MAX, NULL);
} else if (i == ATTR_GR_GID) {
ir->ir_key.ik_uid = strtonum(
ldap_attrs[0], 0, GID_MAX, NULL);
}
aldap_free_attr(ldap_attrs);
}
if (i + 1 != max_attr)
if (strlcat(ir->ir_line, ":",
sizeof(ir->ir_line)) >= sizeof(ir->ir_line))
return (-1);
}
return (0);
}
int
client_search_idm(struct env *env, struct idm *idm, struct aldap *al,
char **attrs, char *filter, int min_attr, int max_attr,
enum imsg_type type)
{
struct idm_req ir;
struct aldap_message *m;
struct aldap_page_control *pg = NULL;
const char *errstr;
char *dn;
dn = idm->idm_basedn;
if (type == IMSG_GRP_ENTRY && idm->idm_groupdn[0] != '\0')
dn = idm->idm_groupdn;
do {
if (aldap_search(al, dn, LDAP_SCOPE_SUBTREE,
filter, attrs, 0, 0, 0, pg) == -1) {
aldap_get_errno(al, &errstr);
log_debug("%s", errstr);
return (-1);
}
if (pg != NULL) {
aldap_freepage(pg);
pg = NULL;
}
while ((m = aldap_parse(al)) != NULL) {
if (al->msgid != m->msgid) {
goto fail;
}
if (m->message_type == LDAP_RES_SEARCH_RESULT) {
if (m->page != NULL && m->page->cookie_len != 0)
pg = m->page;
else
pg = NULL;
aldap_freemsg(m);
break;
}
if (m->message_type != LDAP_RES_SEARCH_ENTRY) {
goto fail;
}
if (client_build_req(idm, &ir, m, min_attr, max_attr) == 0)
imsg_compose_event(env->sc_iev, type, 0, 0, -1,
&ir, sizeof(ir));
aldap_freemsg(m);
}
} while (pg != NULL);
return (0);
fail:
aldap_freemsg(m);
if (pg != NULL) {
aldap_freepage(pg);
}
return (-1);
}
int
client_try_idm(struct env *env, struct idm *idm)
{
const char *where;
char *attrs[ATTR_MAX+1];
int i, j;
struct aldap_message *m;
struct aldap *al;
where = "connect";
if ((al = client_aldap_open(&idm->idm_addr)) == NULL)
return (-1);
if (idm->idm_flags & F_NEEDAUTH) {
where = "binding";
if (aldap_bind(al, idm->idm_binddn, idm->idm_bindcred) == -1)
goto bad;
where = "parsing";
if ((m = aldap_parse(al)) == NULL)
goto bad;
where = "verifying msgid";
if (al->msgid != m->msgid) {
aldap_freemsg(m);
goto bad;
}
aldap_freemsg(m);
}
memset(attrs, 0, sizeof(attrs));
for (i = 0, j = 0; i < ATTR_MAX; i++) {
if (idm->idm_flags & F_FIXED_ATTR(i))
continue;
attrs[j++] = idm->idm_attrs[i];
}
attrs[j] = NULL;
/*
* build password line.
*/
where = "search";
log_debug("searching password entries");
if (client_search_idm(env, idm, al, attrs,
idm->idm_filters[FILTER_USER], 0, ATTR_MAX, IMSG_PW_ENTRY) == -1)
goto bad;
memset(attrs, 0, sizeof(attrs));
for (i = ATTR_GR_MIN, j = 0; i < ATTR_GR_MAX; i++) {
if (idm->idm_flags & F_FIXED_ATTR(i))
continue;
attrs[j++] = idm->idm_attrs[i];
}
attrs[j] = NULL;
/*
* build group line.
*/
where = "search";
log_debug("searching group entries");
if (client_search_idm(env, idm, al, attrs,
idm->idm_filters[FILTER_GROUP], ATTR_GR_MIN, ATTR_GR_MAX,
IMSG_GRP_ENTRY) == -1)
goto bad;
aldap_close(al);
idm->idm_state = STATE_LDAP_DONE;
return (0);
bad:
aldap_close(al);
log_debug("directory %s errored out in %s", idm->idm_name, where);
return (-1);
}
void
client_periodic_update(int fd, short event, void *p)
{
struct env *env = p;
struct idm *idm;
int fail_cnt = 0;
/* If LDAP isn't finished, notify the master process to trash the
* update. */
TAILQ_FOREACH(idm, &env->sc_idms, idm_entry) {
if (idm->idm_state < STATE_LDAP_DONE)
fail_cnt++;
idm->idm_state = STATE_NONE;
client_addr_free(idm);
}
if (fail_cnt > 0) {
log_debug("trash the update");
imsg_compose_event(env->sc_iev, IMSG_TRASH_UPDATE, 0, 0, -1,
NULL, 0);
}
client_configure(env);
}
void
client_configure(struct env *env)
{
struct timeval tv;
struct idm *idm;
u_int16_t dlen;
log_debug("connecting to directories");
imsg_compose_event(env->sc_iev, IMSG_START_UPDATE, 0, 0, -1, NULL, 0);
/* Start the DNS lookups */
TAILQ_FOREACH(idm, &env->sc_idms, idm_entry) {
dlen = strlen(idm->idm_name) + 1;
imsg_compose_event(env->sc_iev_dns, IMSG_HOST_DNS, idm->idm_id,
0, -1, idm->idm_name, dlen);
}
tv.tv_sec = env->sc_conf_tv.tv_sec;
tv.tv_usec = env->sc_conf_tv.tv_usec;
evtimer_set(&env->sc_conf_ev, client_periodic_update, env);
evtimer_add(&env->sc_conf_ev, &tv);
}
diff --git a/usr.sbin/ypldap/log.c b/usr.sbin/ypldap/log.c
index 7fec6f7427b7..0df690e27f55 100644
--- a/usr.sbin/ypldap/log.c
+++ b/usr.sbin/ypldap/log.c
@@ -1,162 +1,161 @@
/* $OpenBSD: log.c,v 1.1 2008/06/26 15:10:01 pyr Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2003, 2004 Henning Brauer <henning@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER
* IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <errno.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <time.h>
void log_init(int);
void log_warn(const char *, ...);
void log_warnx(const char *, ...);
void log_info(const char *, ...);
void log_debug(const char *, ...);
__dead2 void fatal(const char *);
__dead2 void fatalx(const char *);
int debug;
void vlog(int, const char *, va_list);
void logit(int, const char *, ...);
void
log_init(int n_debug)
{
extern char *__progname;
debug = n_debug;
if (!debug)
openlog(__progname, LOG_PID | LOG_NDELAY, LOG_DAEMON);
tzset();
}
void
logit(int pri, const char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
vlog(pri, fmt, ap);
va_end(ap);
}
void
vlog(int pri, const char *fmt, va_list ap)
{
char *nfmt;
if (debug) {
/* best effort in out of mem situations */
if (asprintf(&nfmt, "%s\n", fmt) == -1) {
vfprintf(stderr, fmt, ap);
fprintf(stderr, "\n");
} else {
vfprintf(stderr, nfmt, ap);
free(nfmt);
}
fflush(stderr);
} else
vsyslog(pri, fmt, ap);
}
void
log_warn(const char *emsg, ...)
{
char *nfmt;
va_list ap;
/* best effort to even work in out of memory situations */
if (emsg == NULL)
logit(LOG_CRIT, "%s", strerror(errno));
else {
va_start(ap, emsg);
if (asprintf(&nfmt, "%s: %s", emsg, strerror(errno)) == -1) {
/* we tried it... */
vlog(LOG_CRIT, emsg, ap);
logit(LOG_CRIT, "%s", strerror(errno));
} else {
vlog(LOG_CRIT, nfmt, ap);
free(nfmt);
}
va_end(ap);
}
}
void
log_warnx(const char *emsg, ...)
{
va_list ap;
va_start(ap, emsg);
vlog(LOG_CRIT, emsg, ap);
va_end(ap);
}
void
log_info(const char *emsg, ...)
{
va_list ap;
va_start(ap, emsg);
vlog(LOG_INFO, emsg, ap);
va_end(ap);
}
void
log_debug(const char *emsg, ...)
{
va_list ap;
if (debug > 1) {
va_start(ap, emsg);
vlog(LOG_DEBUG, emsg, ap);
va_end(ap);
}
}
void
fatal(const char *emsg)
{
if (emsg == NULL)
logit(LOG_CRIT, "fatal: %s", strerror(errno));
else
if (errno)
logit(LOG_CRIT, "fatal: %s: %s",
emsg, strerror(errno));
else
logit(LOG_CRIT, "fatal: %s", emsg);
exit(1);
}
void
fatalx(const char *emsg)
{
errno = 0;
fatal(emsg);
}
diff --git a/usr.sbin/ypldap/parse.y b/usr.sbin/ypldap/parse.y
index b97af1dfa801..2a3bb8cf5c35 100644
--- a/usr.sbin/ypldap/parse.y
+++ b/usr.sbin/ypldap/parse.y
@@ -1,846 +1,845 @@
/* $OpenBSD: parse.y,v 1.18 2015/01/16 06:40:22 deraadt Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2008 Pierre-Yves Ritschard <pyr@openbsd.org>
* Copyright (c) 2007, 2008 Reyk Floeter <reyk@openbsd.org>
* Copyright (c) 2004, 2005 Esben Norby <norby@openbsd.org>
* Copyright (c) 2004 Ryan McBride <mcbride@openbsd.org>
* Copyright (c) 2002, 2003, 2004 Henning Brauer <henning@openbsd.org>
* Copyright (c) 2001 Markus Friedl. All rights reserved.
* Copyright (c) 2001 Daniel Hartmeier. All rights reserved.
* Copyright (c) 2001 Theo de Raadt. All rights reserved.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
%{
#include <sys/types.h>
#include <sys/param.h>
#include <sys/time.h>
#include <sys/queue.h>
#include <sys/tree.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <event.h>
#include <fcntl.h>
#include <limits.h>
#include <netdb.h>
#include <pwd.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#include "ypldap.h"
TAILQ_HEAD(files, file) files = TAILQ_HEAD_INITIALIZER(files);
static struct file {
TAILQ_ENTRY(file) entry;
FILE *stream;
char *name;
int lineno;
int errors;
} *file, *topfile;
struct file *pushfile(const char *, int);
int popfile(void);
int check_file_secrecy(int, const char *);
int yyparse(void);
int yylex(void);
int yyerror(const char *, ...)
__attribute__((__format__ (printf, 1, 2)))
__attribute__((__nonnull__ (1)));
int kw_cmp(const void *, const void *);
int lookup(char *);
int lgetc(int);
int lungetc(int);
int findeol(void);
TAILQ_HEAD(symhead, sym) symhead = TAILQ_HEAD_INITIALIZER(symhead);
struct sym {
TAILQ_ENTRY(sym) entry;
int used;
int persist;
char *nam;
char *val;
};
int symset(const char *, const char *, int);
char *symget(const char *);
struct env *conf = NULL;
struct idm *idm = NULL;
static int errors = 0;
typedef struct {
union {
int64_t number;
char *string;
} v;
int lineno;
} YYSTYPE;
%}
%token SERVER FILTER ATTRIBUTE BASEDN BINDDN GROUPDN BINDCRED MAPS CHANGE DOMAIN PROVIDE
%token USER GROUP TO EXPIRE HOME SHELL GECOS UID GID INTERVAL
%token PASSWD NAME FIXED LIST GROUPNAME GROUPPASSWD GROUPGID MAP
%token INCLUDE DIRECTORY CLASS PORT ERROR GROUPMEMBERS
%token <v.string> STRING
%token <v.number> NUMBER
%type <v.number> opcode attribute
%type <v.string> port
%%
grammar : /* empty */
| grammar '\n'
| grammar include '\n'
| grammar varset '\n'
| grammar directory '\n'
| grammar main '\n'
| grammar error '\n' { file->errors++; }
;
nl : '\n' optnl
;
optnl : '\n' optnl
| /* empty */
;
include : INCLUDE STRING {
struct file *nfile;
if ((nfile = pushfile($2, 0)) == NULL) {
yyerror("failed to include file %s", $2);
free($2);
YYERROR;
}
free($2);
file = nfile;
lungetc('\n');
}
;
varset : STRING '=' STRING {
char *s = $1;
while (*s++) {
if (isspace((unsigned char) *s)) {
yyerror("macro name cannot contain "
"whitespace");
YYERROR;
}
}
if (symset($1, $3, 0) == -1)
fatal("cannot store variable");
free($1);
free($3);
}
;
port : /* empty */ { $$ = NULL; }
| PORT STRING { $$ = $2; }
;
opcode : GROUP { $$ = 0; }
| PASSWD { $$ = 1; }
;
attribute : NAME { $$ = 0; }
| PASSWD { $$ = 1; }
| UID { $$ = 2; }
| GID { $$ = 3; }
| CLASS { $$ = 4; }
| CHANGE { $$ = 5; }
| EXPIRE { $$ = 6; }
| GECOS { $$ = 7; }
| HOME { $$ = 8; }
| SHELL { $$ = 9; }
| GROUPNAME { $$ = 10; }
| GROUPPASSWD { $$ = 11; }
| GROUPGID { $$ = 12; }
| GROUPMEMBERS { $$ = 13; }
;
diropt : BINDDN STRING {
idm->idm_flags |= F_NEEDAUTH;
if (strlcpy(idm->idm_binddn, $2,
sizeof(idm->idm_binddn)) >=
sizeof(idm->idm_binddn)) {
yyerror("directory binddn truncated");
free($2);
YYERROR;
}
free($2);
}
| BINDCRED STRING {
idm->idm_flags |= F_NEEDAUTH;
if (strlcpy(idm->idm_bindcred, $2,
sizeof(idm->idm_bindcred)) >=
sizeof(idm->idm_bindcred)) {
yyerror("directory bindcred truncated");
free($2);
YYERROR;
}
free($2);
}
| BASEDN STRING {
if (strlcpy(idm->idm_basedn, $2,
sizeof(idm->idm_basedn)) >=
sizeof(idm->idm_basedn)) {
yyerror("directory basedn truncated");
free($2);
YYERROR;
}
free($2);
}
| GROUPDN STRING {
if(strlcpy(idm->idm_groupdn, $2,
sizeof(idm->idm_groupdn)) >=
sizeof(idm->idm_groupdn)) {
yyerror("directory groupdn truncated");
free($2);
YYERROR;
}
free($2);
}
| opcode FILTER STRING {
if (strlcpy(idm->idm_filters[$1], $3,
sizeof(idm->idm_filters[$1])) >=
sizeof(idm->idm_filters[$1])) {
yyerror("filter truncated");
free($3);
YYERROR;
}
free($3);
}
| ATTRIBUTE attribute MAPS TO STRING {
if (strlcpy(idm->idm_attrs[$2], $5,
sizeof(idm->idm_attrs[$2])) >=
sizeof(idm->idm_attrs[$2])) {
yyerror("attribute truncated");
free($5);
YYERROR;
}
free($5);
}
| FIXED ATTRIBUTE attribute STRING {
if (strlcpy(idm->idm_attrs[$3], $4,
sizeof(idm->idm_attrs[$3])) >=
sizeof(idm->idm_attrs[$3])) {
yyerror("attribute truncated");
free($4);
YYERROR;
}
idm->idm_flags |= F_FIXED_ATTR($3);
free($4);
}
| LIST attribute MAPS TO STRING {
if (strlcpy(idm->idm_attrs[$2], $5,
sizeof(idm->idm_attrs[$2])) >=
sizeof(idm->idm_attrs[$2])) {
yyerror("attribute truncated");
free($5);
YYERROR;
}
idm->idm_list |= F_LIST($2);
free($5);
}
;
directory : DIRECTORY STRING port {
if ((idm = calloc(1, sizeof(*idm))) == NULL)
fatal(NULL);
idm->idm_id = conf->sc_maxid++;
if (strlcpy(idm->idm_name, $2,
sizeof(idm->idm_name)) >=
sizeof(idm->idm_name)) {
yyerror("attribute truncated");
free($2);
YYERROR;
}
free($2);
} '{' optnl diropts '}' {
TAILQ_INSERT_TAIL(&conf->sc_idms, idm, idm_entry);
idm = NULL;
}
;
main : INTERVAL NUMBER {
conf->sc_conf_tv.tv_sec = $2;
conf->sc_conf_tv.tv_usec = 0;
}
| DOMAIN STRING {
if (strlcpy(conf->sc_domainname, $2,
sizeof(conf->sc_domainname)) >=
sizeof(conf->sc_domainname)) {
yyerror("domainname truncated");
free($2);
YYERROR;
}
free($2);
}
| PROVIDE MAP STRING {
if (strcmp($3, "passwd.byname") == 0)
conf->sc_flags |= YPMAP_PASSWD_BYNAME;
else if (strcmp($3, "passwd.byuid") == 0)
conf->sc_flags |= YPMAP_PASSWD_BYUID;
else if (strcmp($3, "master.passwd.byname") == 0)
conf->sc_flags |= YPMAP_MASTER_PASSWD_BYNAME;
else if (strcmp($3, "master.passwd.byuid") == 0)
conf->sc_flags |= YPMAP_MASTER_PASSWD_BYUID;
else if (strcmp($3, "group.byname") == 0)
conf->sc_flags |= YPMAP_GROUP_BYNAME;
else if (strcmp($3, "group.bygid") == 0)
conf->sc_flags |= YPMAP_GROUP_BYGID;
else if (strcmp($3, "netid.byname") == 0)
conf->sc_flags |= YPMAP_NETID_BYNAME;
else {
yyerror("unsupported map type: %s", $3);
free($3);
YYERROR;
}
free($3);
}
;
diropts : diropts diropt nl
| diropt optnl
;
%%
struct keywords {
const char *k_name;
int k_val;
};
int
yyerror(const char *fmt, ...)
{
va_list ap;
char *msg;
file->errors++;
va_start(ap, fmt);
if (vasprintf(&msg, fmt, ap) == -1)
fatalx("yyerror vasprintf");
va_end(ap);
logit(LOG_CRIT, "%s:%d: %s", file->name, yylval.lineno, msg);
free(msg);
return (0);
}
int
kw_cmp(const void *k, const void *e)
{
return (strcmp(k, ((const struct keywords *)e)->k_name));
}
int
lookup(char *s)
{
/* this has to be sorted always */
static const struct keywords keywords[] = {
{ "attribute", ATTRIBUTE },
{ "basedn", BASEDN },
{ "bindcred", BINDCRED },
{ "binddn", BINDDN },
{ "change", CHANGE },
{ "class", CLASS },
{ "directory", DIRECTORY },
{ "domain", DOMAIN },
{ "expire", EXPIRE },
{ "filter", FILTER },
{ "fixed", FIXED },
{ "gecos", GECOS },
{ "gid", GID },
{ "group", GROUP },
{ "groupdn", GROUPDN },
{ "groupgid", GROUPGID },
{ "groupmembers", GROUPMEMBERS },
{ "groupname", GROUPNAME },
{ "grouppasswd", GROUPPASSWD },
{ "home", HOME },
{ "include", INCLUDE },
{ "interval", INTERVAL },
{ "list", LIST },
{ "map", MAP },
{ "maps", MAPS },
{ "name", NAME },
{ "passwd", PASSWD },
{ "port", PORT },
{ "provide", PROVIDE },
{ "server", SERVER },
{ "shell", SHELL },
{ "to", TO },
{ "uid", UID },
{ "user", USER },
};
const struct keywords *p;
p = bsearch(s, keywords, sizeof(keywords)/sizeof(keywords[0]),
sizeof(keywords[0]), kw_cmp);
if (p)
return (p->k_val);
else
return (STRING);
}
#define MAXPUSHBACK 128
u_char *parsebuf;
int parseindex;
u_char pushback_buffer[MAXPUSHBACK];
int pushback_index = 0;
int
lgetc(int quotec)
{
int c, next;
if (parsebuf) {
/* Read character from the parsebuffer instead of input. */
if (parseindex >= 0) {
c = parsebuf[parseindex++];
if (c != '\0')
return (c);
parsebuf = NULL;
} else
parseindex++;
}
if (pushback_index)
return (pushback_buffer[--pushback_index]);
if (quotec) {
if ((c = getc(file->stream)) == EOF) {
yyerror("reached end of file while parsing "
"quoted string");
if (file == topfile || popfile() == EOF)
return (EOF);
return (quotec);
}
return (c);
}
while ((c = getc(file->stream)) == '\\') {
next = getc(file->stream);
if (next != '\n') {
c = next;
break;
}
yylval.lineno = file->lineno;
file->lineno++;
}
while (c == EOF) {
if (file == topfile || popfile() == EOF)
return (EOF);
c = getc(file->stream);
}
return (c);
}
int
lungetc(int c)
{
if (c == EOF)
return (EOF);
if (parsebuf) {
parseindex--;
if (parseindex >= 0)
return (c);
}
if (pushback_index < MAXPUSHBACK-1)
return (pushback_buffer[pushback_index++] = c);
else
return (EOF);
}
int
findeol(void)
{
int c;
parsebuf = NULL;
/* skip to either EOF or the first real EOL */
while (1) {
if (pushback_index)
c = pushback_buffer[--pushback_index];
else
c = lgetc(0);
if (c == '\n') {
file->lineno++;
break;
}
if (c == EOF)
break;
}
return (ERROR);
}
int
yylex(void)
{
u_char buf[8096];
u_char *p, *val;
int quotec, next, c;
int token;
top:
p = buf;
while ((c = lgetc(0)) == ' ' || c == '\t')
; /* nothing */
yylval.lineno = file->lineno;
if (c == '#')
while ((c = lgetc(0)) != '\n' && c != EOF)
; /* nothing */
if (c == '$' && parsebuf == NULL) {
while (1) {
if ((c = lgetc(0)) == EOF)
return (0);
if (p + 1 >= buf + sizeof(buf) - 1) {
yyerror("string too long");
return (findeol());
}
if (isalnum(c) || c == '_') {
*p++ = c;
continue;
}
*p = '\0';
lungetc(c);
break;
}
val = symget(buf);
if (val == NULL) {
yyerror("macro '%s' not defined", buf);
return (findeol());
}
parsebuf = val;
parseindex = 0;
goto top;
}
switch (c) {
case '\'':
case '"':
quotec = c;
while (1) {
if ((c = lgetc(quotec)) == EOF)
return (0);
if (c == '\n') {
file->lineno++;
continue;
} else if (c == '\\') {
if ((next = lgetc(quotec)) == EOF)
return (0);
if (next == quotec || c == ' ' || c == '\t')
c = next;
else if (next == '\n') {
file->lineno++;
continue;
} else
lungetc(next);
} else if (c == quotec) {
*p = '\0';
break;
} else if (c == '\0') {
yyerror("syntax error");
return (findeol());
}
if (p + 1 >= buf + sizeof(buf) - 1) {
yyerror("string too long");
return (findeol());
}
*p++ = c;
}
yylval.v.string = strdup(buf);
if (yylval.v.string == NULL)
err(1, "yylex: strdup");
return (STRING);
}
#define allowed_to_end_number(x) \
(isspace(x) || x == ')' || x ==',' || x == '/' || x == '}' || x == '=')
if (c == '-' || isdigit(c)) {
do {
*p++ = c;
if ((unsigned)(p-buf) >= sizeof(buf)) {
yyerror("string too long");
return (findeol());
}
} while ((c = lgetc(0)) != EOF && isdigit(c));
lungetc(c);
if (p == buf + 1 && buf[0] == '-')
goto nodigits;
if (c == EOF || allowed_to_end_number(c)) {
const char *errstr = NULL;
*p = '\0';
yylval.v.number = strtonum(buf, LLONG_MIN,
LLONG_MAX, &errstr);
if (errstr) {
yyerror("\"%s\" invalid number: %s",
buf, errstr);
return (findeol());
}
return (NUMBER);
} else {
nodigits:
while (p > buf + 1)
lungetc(*--p);
c = *--p;
if (c == '-')
return (c);
}
}
#define allowed_in_string(x) \
(isalnum(x) || (ispunct(x) && x != '(' && x != ')' && \
x != '{' && x != '}' && x != '<' && x != '>' && \
x != '!' && x != '=' && x != '#' && \
x != ','))
if (isalnum(c) || c == ':' || c == '_') {
do {
*p++ = c;
if ((unsigned)(p-buf) >= sizeof(buf)) {
yyerror("string too long");
return (findeol());
}
} while ((c = lgetc(0)) != EOF && (allowed_in_string(c)));
lungetc(c);
*p = '\0';
if ((token = lookup(buf)) == STRING)
if ((yylval.v.string = strdup(buf)) == NULL)
err(1, "yylex: strdup");
return (token);
}
if (c == '\n') {
yylval.lineno = file->lineno;
file->lineno++;
}
if (c == EOF)
return (0);
return (c);
}
int
check_file_secrecy(int fd, const char *fname)
{
struct stat st;
if (fstat(fd, &st)) {
log_warn("cannot stat %s", fname);
return (-1);
}
if (st.st_uid != 0 && st.st_uid != getuid()) {
log_warnx("%s: owner not root or current user", fname);
return (-1);
}
if (st.st_mode & (S_IWGRP | S_IXGRP | S_IRWXO)) {
log_warnx("%s: group writable or world read/writable", fname);
return (-1);
}
return (0);
}
struct file *
pushfile(const char *name, int secret)
{
struct file *nfile;
if ((nfile = calloc(1, sizeof(struct file))) == NULL) {
log_warn("malloc");
return (NULL);
}
if ((nfile->name = strdup(name)) == NULL) {
log_warn("malloc");
free(nfile);
return (NULL);
}
if ((nfile->stream = fopen(nfile->name, "r")) == NULL) {
log_warn("%s", nfile->name);
free(nfile->name);
free(nfile);
return (NULL);
} else if (secret &&
check_file_secrecy(fileno(nfile->stream), nfile->name)) {
fclose(nfile->stream);
free(nfile->name);
free(nfile);
return (NULL);
}
nfile->lineno = 1;
TAILQ_INSERT_TAIL(&files, nfile, entry);
return (nfile);
}
int
popfile(void)
{
struct file *prev;
if ((prev = TAILQ_PREV(file, files, entry)) != NULL)
prev->errors += file->errors;
TAILQ_REMOVE(&files, file, entry);
fclose(file->stream);
free(file->name);
free(file);
file = prev;
return (file ? 0 : EOF);
}
int
parse_config(struct env *x_conf, const char *filename, int opts)
{
struct sym *sym, *next;
conf = x_conf;
bzero(conf, sizeof(*conf));
TAILQ_INIT(&conf->sc_idms);
conf->sc_conf_tv.tv_sec = DEFAULT_INTERVAL;
conf->sc_conf_tv.tv_usec = 0;
errors = 0;
if ((file = pushfile(filename, 1)) == NULL) {
return (-1);
}
topfile = file;
/*
* parse configuration
*/
setservent(1);
yyparse();
endservent();
errors = file->errors;
popfile();
/* Free macros and check which have not been used. */
for (sym = TAILQ_FIRST(&symhead); sym != NULL; sym = next) {
next = TAILQ_NEXT(sym, entry);
if ((opts & YPLDAP_OPT_VERBOSE) && !sym->used)
fprintf(stderr, "warning: macro '%s' not "
"used\n", sym->nam);
if (!sym->persist) {
free(sym->nam);
free(sym->val);
TAILQ_REMOVE(&symhead, sym, entry);
free(sym);
}
}
if (errors) {
return (-1);
}
return (0);
}
int
symset(const char *nam, const char *val, int persist)
{
struct sym *sym;
for (sym = TAILQ_FIRST(&symhead); sym && strcmp(nam, sym->nam);
sym = TAILQ_NEXT(sym, entry))
; /* nothing */
if (sym != NULL) {
if (sym->persist == 1)
return (0);
else {
free(sym->nam);
free(sym->val);
TAILQ_REMOVE(&symhead, sym, entry);
free(sym);
}
}
if ((sym = calloc(1, sizeof(*sym))) == NULL)
return (-1);
sym->nam = strdup(nam);
if (sym->nam == NULL) {
free(sym);
return (-1);
}
sym->val = strdup(val);
if (sym->val == NULL) {
free(sym->nam);
free(sym);
return (-1);
}
sym->used = 0;
sym->persist = persist;
TAILQ_INSERT_TAIL(&symhead, sym, entry);
return (0);
}
int
cmdline_symset(char *s)
{
char *sym, *val;
int ret;
size_t len;
if ((val = strrchr(s, '=')) == NULL)
return (-1);
len = strlen(s) - strlen(val) + 1;
if ((sym = malloc(len)) == NULL)
errx(1, "cmdline_symset: malloc");
(void)strlcpy(sym, s, len);
ret = symset(sym, val + 1, 1);
free(sym);
return (ret);
}
char *
symget(const char *nam)
{
struct sym *sym;
TAILQ_FOREACH(sym, &symhead, entry)
if (strcmp(nam, sym->nam) == 0) {
sym->used = 1;
return (sym->val);
}
return (NULL);
}
diff --git a/usr.sbin/ypldap/yp.c b/usr.sbin/ypldap/yp.c
index 0cbadc371c5e..0f12d588cf0f 100644
--- a/usr.sbin/ypldap/yp.c
+++ b/usr.sbin/ypldap/yp.c
@@ -1,680 +1,679 @@
/* $OpenBSD: yp.c,v 1.14 2015/02/11 01:26:00 pelikan Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2008 Pierre-Yves Ritschard <pyr@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/queue.h>
#include <sys/socket.h>
#include <sys/select.h>
#include <sys/tree.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <event.h>
#include <fcntl.h>
#include <unistd.h>
#include <pwd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <rpc/rpc.h>
#include <rpc/xdr.h>
#include <rpc/pmap_clnt.h>
#include <rpc/pmap_prot.h>
#include <rpc/pmap_rmt.h>
#include <rpcsvc/yp.h>
#include <rpcsvc/ypclnt.h>
#include "ypldap.h"
void yp_dispatch(struct svc_req *, SVCXPRT *);
void yp_disable_events(void);
void yp_fd_event(int, short, void *);
int yp_check(struct svc_req *);
int yp_valid_domain(char *, struct ypresp_val *);
void yp_make_val(struct ypresp_val *, char *, int);
void yp_make_keyval(struct ypresp_key_val *, char *, char *);
static struct env *env;
struct yp_event {
TAILQ_ENTRY(yp_event) ye_entry;
struct event ye_event;
};
struct yp_data {
SVCXPRT *yp_trans_udp;
SVCXPRT *yp_trans_tcp;
TAILQ_HEAD(, yp_event) yd_events;
};
void
yp_disable_events(void)
{
struct yp_event *ye;
while ((ye = TAILQ_FIRST(&env->sc_yp->yd_events)) != NULL) {
TAILQ_REMOVE(&env->sc_yp->yd_events, ye, ye_entry);
event_del(&ye->ye_event);
free(ye);
}
}
void
yp_enable_events(void)
{
int i;
struct yp_event *ye;
for (i = 0; i < getdtablesize(); i++) {
if ((ye = calloc(1, sizeof(*ye))) == NULL)
fatal(NULL);
event_set(&ye->ye_event, i, EV_READ, yp_fd_event, NULL);
event_add(&ye->ye_event, NULL);
TAILQ_INSERT_TAIL(&env->sc_yp->yd_events, ye, ye_entry);
}
}
void
yp_fd_event(int fd, short event, void *p)
{
svc_getreq_common(fd);
yp_disable_events();
yp_enable_events();
}
void
yp_init(struct env *x_env)
{
struct yp_data *yp;
if ((yp = calloc(1, sizeof(*yp))) == NULL)
fatal(NULL);
TAILQ_INIT(&yp->yd_events);
env = x_env;
env->sc_yp = yp;
(void)pmap_unset(YPPROG, YPVERS);
if ((yp->yp_trans_udp = svcudp_create(RPC_ANYSOCK)) == NULL)
fatal("cannot create udp service");
if ((yp->yp_trans_tcp = svctcp_create(RPC_ANYSOCK, 0, 0)) == NULL)
fatal("cannot create tcp service");
if (!svc_register(yp->yp_trans_udp, YPPROG, YPVERS,
yp_dispatch, IPPROTO_UDP)) {
fatal("unable to register (YPPROG, YPVERS, udp)");
}
if (!svc_register(yp->yp_trans_tcp, YPPROG, YPVERS,
yp_dispatch, IPPROTO_TCP)) {
fatal("unable to register (YPPROG, YPVERS, tcp)");
}
}
/*
* lots of inspiration from ypserv by Mats O Jansson
*/
void
yp_dispatch(struct svc_req *req, SVCXPRT *trans)
{
xdrproc_t xdr_argument;
xdrproc_t xdr_result;
char *result;
char *(*cb)(char *, struct svc_req *);
union {
domainname ypproc_domain_2_arg;
domainname ypproc_domain_nonack_2_arg;
ypreq_key ypproc_match_2_arg;
ypreq_nokey ypproc_first_2_arg;
ypreq_key ypproc_next_2_arg;
ypreq_xfr ypproc_xfr_2_arg;
ypreq_nokey ypproc_all_2_arg;
ypreq_nokey ypproc_master_2_arg;
ypreq_nokey ypproc_order_2_arg;
domainname ypproc_maplist_2_arg;
} argument;
xdr_argument = (xdrproc_t) xdr_void;
xdr_result = (xdrproc_t) xdr_void;
cb = NULL;
switch (req->rq_proc) {
case YPPROC_NULL:
xdr_argument = (xdrproc_t) xdr_void;
xdr_result = (xdrproc_t) xdr_void;
if (yp_check(req) == -1)
return;
result = NULL;
if (!svc_sendreply(trans, (xdrproc_t) xdr_void,
(void *)&result))
svcerr_systemerr(trans);
return;
case YPPROC_DOMAIN:
xdr_argument = (xdrproc_t) xdr_domainname;
xdr_result = (xdrproc_t) xdr_bool;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_domain_2_svc;
break;
case YPPROC_DOMAIN_NONACK:
xdr_argument = (xdrproc_t) xdr_domainname;
xdr_result = (xdrproc_t) xdr_bool;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_domain_nonack_2_svc;
break;
case YPPROC_MATCH:
xdr_argument = (xdrproc_t) xdr_ypreq_key;
xdr_result = (xdrproc_t) xdr_ypresp_val;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_match_2_svc;
break;
case YPPROC_FIRST:
xdr_argument = (xdrproc_t) xdr_ypreq_nokey;
xdr_result = (xdrproc_t) xdr_ypresp_key_val;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_first_2_svc;
break;
case YPPROC_NEXT:
xdr_argument = (xdrproc_t) xdr_ypreq_key;
xdr_result = (xdrproc_t) xdr_ypresp_key_val;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_next_2_svc;
break;
case YPPROC_XFR:
if (yp_check(req) == -1)
return;
svcerr_noproc(trans);
return;
case YPPROC_CLEAR:
log_debug("ypproc_clear");
if (yp_check(req) == -1)
return;
svcerr_noproc(trans);
return;
case YPPROC_ALL:
log_debug("ypproc_all");
xdr_argument = (xdrproc_t) xdr_ypreq_nokey;
xdr_result = (xdrproc_t) xdr_ypresp_all;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_all_2_svc;
break;
case YPPROC_MASTER:
log_debug("ypproc_master");
xdr_argument = (xdrproc_t) xdr_ypreq_nokey;
xdr_result = (xdrproc_t) xdr_ypresp_master;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_master_2_svc;
break;
case YPPROC_ORDER:
log_debug("ypproc_order");
if (yp_check(req) == -1)
return;
svcerr_noproc(trans);
return;
case YPPROC_MAPLIST:
log_debug("ypproc_maplist");
xdr_argument = (xdrproc_t) xdr_domainname;
xdr_result = (xdrproc_t) xdr_ypresp_maplist;
if (yp_check(req) == -1)
return;
cb = (void *)ypproc_maplist_2_svc;
break;
default:
svcerr_noproc(trans);
return;
}
(void)memset(&argument, 0, sizeof(argument));
if (!svc_getargs(trans, xdr_argument, (caddr_t)&argument)) {
svcerr_decode(trans);
return;
}
result = (*cb)((char *)&argument, req);
if (result != NULL && !svc_sendreply(trans, xdr_result, result))
svcerr_systemerr(trans);
if (!svc_freeargs(trans, xdr_argument, (caddr_t)&argument)) {
/*
* ypserv does it too.
*/
fatal("unable to free arguments");
}
}
int
yp_check(struct svc_req *req)
{
struct sockaddr_in *caller;
caller = svc_getcaller(req->rq_xprt);
/*
* We might want to know who we allow here.
*/
return (0);
}
int
yp_valid_domain(char *domain, struct ypresp_val *res)
{
if (domain == NULL) {
log_debug("NULL domain !");
return (-1);
}
if (strcmp(domain, env->sc_domainname) != 0) {
res->stat = YP_NODOM;
return (-1);
}
return (0);
}
bool_t *
ypproc_domain_2_svc(domainname *arg, struct svc_req *req)
{
static bool_t res;
res = (bool_t)1;
if (strcmp(*arg, env->sc_domainname) != 0)
res = (bool_t)0;
return (&res);
}
bool_t *
ypproc_domain_nonack_2_svc(domainname *arg, struct svc_req *req)
{
static bool_t res;
if (strcmp(*arg, env->sc_domainname) != 0)
return NULL;
res = (bool_t)1;
return (&res);
}
ypresp_val *
ypproc_match_2_svc(ypreq_key *arg, struct svc_req *req)
{
struct userent ukey;
struct userent *ue;
struct groupent gkey;
struct groupent *ge;
static struct ypresp_val res;
const char *estr;
char *bp, *cp;
char *key;
log_debug("matching '%.*s' in map %s", arg->key.keydat_len,
arg->key.keydat_val, arg->map);
if (yp_valid_domain(arg->domain, (struct ypresp_val *)&res) == -1)
return (&res);
if (env->sc_user_names == NULL) {
/*
* tree not ready.
*/
return (NULL);
}
if (arg->key.keydat_len > YPMAXRECORD) {
log_debug("argument too long");
return (NULL);
}
key = calloc(arg->key.keydat_len + 1, 1);
if (key == NULL)
return (NULL);
(void)strncpy(key, arg->key.keydat_val, arg->key.keydat_len);
if (strcmp(arg->map, "passwd.byname") == 0 ||
strcmp(arg->map, "master.passwd.byname") == 0) {
ukey.ue_line = key;
if ((ue = RB_FIND(user_name_tree, env->sc_user_names,
&ukey)) == NULL) {
res.stat = YP_NOKEY;
goto out;
}
yp_make_val(&res, ue->ue_line, 1);
goto out;
} else if (strcmp(arg->map, "passwd.byuid") == 0 ||
strcmp(arg->map, "master.passwd.byuid") == 0) {
ukey.ue_uid = strtonum(key, 0, UID_MAX, &estr);
if (estr) {
res.stat = YP_BADARGS;
goto out;
}
if ((ue = RB_FIND(user_uid_tree, &env->sc_user_uids,
&ukey)) == NULL) {
res.stat = YP_NOKEY;
goto out;
}
yp_make_val(&res, ue->ue_line, 1);
return (&res);
} else if (strcmp(arg->map, "group.bygid") == 0) {
gkey.ge_gid = strtonum(key, 0, GID_MAX, &estr);
if (estr) {
res.stat = YP_BADARGS;
goto out;
}
if ((ge = RB_FIND(group_gid_tree, &env->sc_group_gids,
&gkey)) == NULL) {
res.stat = YP_NOKEY;
goto out;
}
yp_make_val(&res, ge->ge_line, 1);
return (&res);
} else if (strcmp(arg->map, "group.byname") == 0) {
gkey.ge_line = key;
if ((ge = RB_FIND(group_name_tree, env->sc_group_names,
&gkey)) == NULL) {
res.stat = YP_NOKEY;
goto out;
}
yp_make_val(&res, ge->ge_line, 1);
return (&res);
} else if (strcmp(arg->map, "netid.byname") == 0) {
bp = cp = key;
if (strncmp(bp, "unix.", strlen("unix.")) != 0) {
res.stat = YP_BADARGS;
goto out;
}
bp += strlen("unix.");
if (*bp == '\0') {
res.stat = YP_BADARGS;
goto out;
}
if (!(cp = strsep(&bp, "@"))) {
res.stat = YP_BADARGS;
goto out;
}
if (strcmp(bp, arg->domain) != 0) {
res.stat = YP_BADARGS;
goto out;
}
ukey.ue_uid = strtonum(cp, 0, UID_MAX, &estr);
if (estr) {
res.stat = YP_BADARGS;
goto out;
}
if ((ue = RB_FIND(user_uid_tree, &env->sc_user_uids,
&ukey)) == NULL) {
res.stat = YP_NOKEY;
goto out;
}
yp_make_val(&res, ue->ue_netid_line, 0);
goto out;
} else {
log_debug("unknown map %s", arg->map);
res.stat = YP_NOMAP;
goto out;
}
out:
free(key);
return (&res);
}
ypresp_key_val *
ypproc_first_2_svc(ypreq_nokey *arg, struct svc_req *req)
{
static struct ypresp_key_val res;
if (yp_valid_domain(arg->domain, (struct ypresp_val *)&res) == -1)
return (&res);
if (strcmp(arg->map, "passwd.byname") == 0 ||
strcmp(arg->map, "master.passwd.byname") == 0) {
if (env->sc_user_lines == NULL)
return (NULL);
yp_make_keyval(&res, env->sc_user_lines, env->sc_user_lines);
} else if (strcmp(arg->map, "group.byname") == 0) {
if (env->sc_group_lines == NULL)
return (NULL);
yp_make_keyval(&res, env->sc_group_lines, env->sc_group_lines);
} else {
log_debug("unknown map %s", arg->map);
res.stat = YP_NOMAP;
}
return (&res);
}
ypresp_key_val *
ypproc_next_2_svc(ypreq_key *arg, struct svc_req *req)
{
struct userent ukey;
struct userent *ue;
struct groupent gkey;
struct groupent *ge;
char *line;
static struct ypresp_key_val res;
char *key;
if (yp_valid_domain(arg->domain, (struct ypresp_val *)&res) == -1)
return (&res);
key = NULL;
if (strcmp(arg->map, "passwd.byname") == 0 ||
strcmp(arg->map, "master.passwd.byname") == 0) {
key = calloc(arg->key.keydat_len + 1, 1);
if (key == NULL) {
res.stat = YP_YPERR;
return (&res);
}
(void)strncpy(key, arg->key.keydat_val,
arg->key.keydat_len);
ukey.ue_line = key;
if ((ue = RB_FIND(user_name_tree, env->sc_user_names,
&ukey)) == NULL) {
/*
* canacar's trick:
* the user might have been deleted in between calls
* to next since the tree may be modified by a reload.
* next should still return the next user in
* lexicographical order, hence insert the search key
* and look up the next field, then remove it again.
*/
RB_INSERT(user_name_tree, env->sc_user_names, &ukey);
if ((ue = RB_NEXT(user_name_tree, &env->sc_user_names,
&ukey)) == NULL) {
RB_REMOVE(user_name_tree, env->sc_user_names,
&ukey);
res.stat = YP_NOKEY;
free(key);
return (&res);
}
RB_REMOVE(user_name_tree, env->sc_user_names, &ukey);
}
line = ue->ue_line + (strlen(ue->ue_line) + 1);
line = line + (strlen(line) + 1);
yp_make_keyval(&res, line, line);
free(key);
return (&res);
} else if (strcmp(arg->map, "group.byname") == 0) {
key = calloc(arg->key.keydat_len + 1, 1);
if (key == NULL) {
res.stat = YP_YPERR;
return (&res);
}
(void)strncpy(key, arg->key.keydat_val,
arg->key.keydat_len);
gkey.ge_line = key;
if ((ge = RB_FIND(group_name_tree, env->sc_group_names,
&gkey)) == NULL) {
/*
* canacar's trick reloaded.
*/
RB_INSERT(group_name_tree, env->sc_group_names, &gkey);
if ((ge = RB_NEXT(group_name_tree, &env->sc_group_names,
&gkey)) == NULL) {
RB_REMOVE(group_name_tree, env->sc_group_names,
&gkey);
res.stat = YP_NOKEY;
free(key);
return (&res);
}
RB_REMOVE(group_name_tree, env->sc_group_names, &gkey);
}
line = ge->ge_line + (strlen(ge->ge_line) + 1);
line = line + (strlen(line) + 1);
yp_make_keyval(&res, line, line);
free(key);
return (&res);
} else {
log_debug("unknown map %s", arg->map);
res.stat = YP_NOMAP;
return (&res);
}
}
ypresp_all *
ypproc_all_2_svc(ypreq_nokey *arg, struct svc_req *req)
{
static struct ypresp_all res;
if (yp_valid_domain(arg->domain, (struct ypresp_val *)&res) == -1)
return (&res);
svcerr_auth(req->rq_xprt, AUTH_FAILED);
return (NULL);
}
ypresp_master *
ypproc_master_2_svc(ypreq_nokey *arg, struct svc_req *req)
{
static struct ypresp_master res;
static char master[YPMAXPEER + 1];
memset(&res, 0, sizeof(res));
if (yp_valid_domain(arg->domain, (struct ypresp_val *)&res) == -1)
return (&res);
if (gethostname(master, sizeof(master)) == 0) {
res.peer = (peername)master;
res.stat = YP_TRUE;
} else
res.stat = YP_NOKEY;
return (&res);
}
ypresp_maplist *
ypproc_maplist_2_svc(domainname *arg, struct svc_req *req)
{
size_t i;
static struct {
char *name;
int cond;
} mapnames[] = {
{ "passwd.byname", YPMAP_PASSWD_BYNAME },
{ "passwd.byuid", YPMAP_PASSWD_BYUID },
{ "master.passwd.byname", YPMAP_MASTER_PASSWD_BYNAME },
{ "master.passwd.byuid", YPMAP_MASTER_PASSWD_BYUID },
{ "group.byname", YPMAP_GROUP_BYNAME },
{ "group.bygid", YPMAP_GROUP_BYGID },
{ "netid.byname", YPMAP_NETID_BYNAME },
};
static ypresp_maplist res;
static struct ypmaplist maps[nitems(mapnames)];
if (yp_valid_domain(*arg, (struct ypresp_val *)&res) == -1)
return (&res);
res.stat = YP_TRUE;
res.maps = NULL;
for (i = 0; i < nitems(mapnames); i++) {
if (!(env->sc_flags & mapnames[i].cond))
continue;
maps[i].map = mapnames[i].name;
maps[i].next = res.maps;
res.maps = &maps[i];
}
return (&res);
}
void
yp_make_val(struct ypresp_val *res, char *line, int replacecolon)
{
static char buf[LINE_WIDTH];
memset(buf, 0, sizeof(buf));
if (replacecolon)
line[strlen(line)] = ':';
(void)strlcpy(buf, line, sizeof(buf));
if (replacecolon)
line[strcspn(line, ":")] = '\0';
log_debug("sending out %s", buf);
res->stat = YP_TRUE;
res->val.valdat_len = strlen(buf);
res->val.valdat_val = buf;
}
void
yp_make_keyval(struct ypresp_key_val *res, char *key, char *line)
{
static char keybuf[YPMAXRECORD+1];
static char buf[LINE_WIDTH];
memset(keybuf, 0, sizeof(keybuf));
memset(buf, 0, sizeof(buf));
(void)strlcpy(keybuf, key, sizeof(keybuf));
res->key.keydat_len = strlen(keybuf);
res->key.keydat_val = keybuf;
if (*line == '\0') {
res->stat = YP_NOMORE;
return;
}
res->stat = YP_TRUE;
line[strlen(line)] = ':';
(void)strlcpy(buf, line, sizeof(buf));
line[strcspn(line, ":")] = '\0';
log_debug("sending out %s => %s", keybuf, buf);
res->val.valdat_len = strlen(buf);
res->val.valdat_val = buf;
}
diff --git a/usr.sbin/ypldap/ypldap.h b/usr.sbin/ypldap/ypldap.h
index 702e3a5d06d6..e1a08d9e5cf8 100644
--- a/usr.sbin/ypldap/ypldap.h
+++ b/usr.sbin/ypldap/ypldap.h
@@ -1,224 +1,223 @@
/* $OpenBSD: ypldap.h,v 1.16 2015/01/16 06:40:22 deraadt Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2008 Pierre-Yves Ritschard <pyr@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <imsg.h>
#define YPLDAP_USER "_ypldap"
#define YPLDAP_CONF_FILE "/etc/ypldap.conf"
#define DEFAULT_INTERVAL 600
#define LINE_WIDTH 1024
#define FILTER_WIDTH 128
#define ATTR_WIDTH 32
#define MAX_SERVERS_DNS 8
enum imsg_type {
IMSG_NONE,
IMSG_CONF_START,
IMSG_CONF_IDM,
IMSG_CONF_END,
IMSG_START_UPDATE,
IMSG_END_UPDATE,
IMSG_TRASH_UPDATE,
IMSG_PW_ENTRY,
IMSG_GRP_ENTRY,
IMSG_HOST_DNS
};
struct ypldap_addr {
TAILQ_ENTRY(ypldap_addr) next;
struct sockaddr_storage ss;
};
TAILQ_HEAD(ypldap_addr_list, ypldap_addr);
enum ypldap_process_type {
PROC_MAIN,
PROC_CLIENT
};
extern enum ypldap_process_type ypldap_process;
struct userent {
RB_ENTRY(userent) ue_name_node;
RB_ENTRY(userent) ue_uid_node;
uid_t ue_uid;
char *ue_line;
char *ue_netid_line;
gid_t ue_gid;
};
struct groupent {
RB_ENTRY(groupent) ge_name_node;
RB_ENTRY(groupent) ge_gid_node;
gid_t ge_gid;
char *ge_line;
};
enum client_state {
STATE_NONE,
STATE_DNS_INPROGRESS,
STATE_DNS_TEMPFAIL,
STATE_DNS_DONE,
STATE_LDAP_FAIL,
STATE_LDAP_DONE
};
/*
* beck, djm, dlg: pay attention to the struct name
*/
struct idm {
TAILQ_ENTRY(idm) idm_entry;
u_int32_t idm_id;
char idm_name[MAXHOSTNAMELEN];
#define F_SSL 0x00100000
#define F_CONFIGURING 0x00200000
#define F_NEEDAUTH 0x00400000
#define F_FIXED_ATTR(n) (1<<n)
#define F_LIST(n) (1<<n)
enum client_state idm_state;
u_int32_t idm_flags; /* lower 20 reserved */
u_int32_t idm_list;
struct ypldap_addr_list idm_addr;
in_port_t idm_port;
char idm_binddn[LINE_WIDTH];
char idm_bindcred[LINE_WIDTH];
char idm_basedn[LINE_WIDTH];
char idm_groupdn[LINE_WIDTH];
#define FILTER_USER 1
#define FILTER_GROUP 0
char idm_filters[2][FILTER_WIDTH];
#define ATTR_NAME 0
#define ATTR_PASSWD 1
#define ATTR_UID 2
#define ATTR_GID 3
#define ATTR_CLASS 4
#define ATTR_CHANGE 5
#define ATTR_EXPIRE 6
#define ATTR_GECOS 7
#define ATTR_DIR 8
#define ATTR_SHELL 9
#define ATTR_GR_NAME 10
#define ATTR_GR_PASSWD 11
#define ATTR_GR_GID 12
#define ATTR_GR_MEMBERS 13
#define ATTR_MAX 10
#define ATTR_GR_MIN 10
#define ATTR_GR_MAX 14
char idm_attrs[14][ATTR_WIDTH];
struct env *idm_env;
struct event idm_ev;
#ifdef SSL
struct ssl *idm_ssl;
#endif
};
struct idm_req {
union {
uid_t ik_uid;
uid_t ik_gid;
} ir_key;
char ir_line[LINE_WIDTH];
};
struct imsgev {
struct imsgbuf ibuf;
void (*handler)(int, short, void *);
struct event ev;
void *data;
short events;
};
struct env {
#define YPLDAP_OPT_VERBOSE 0x01
#define YPLDAP_OPT_NOACTION 0x02
u_int8_t sc_opts;
#define YPMAP_PASSWD_BYNAME 0x00000001
#define YPMAP_PASSWD_BYUID 0x00000002
#define YPMAP_MASTER_PASSWD_BYNAME 0x00000004
#define YPMAP_MASTER_PASSWD_BYUID 0x00000008
#define YPMAP_GROUP_BYNAME 0x00000010
#define YPMAP_GROUP_BYGID 0x00000020
#define YPMAP_NETID_BYNAME 0x00000040
u_int32_t sc_flags;
u_int32_t sc_maxid;
char sc_domainname[MAXHOSTNAMELEN];
struct timeval sc_conf_tv;
struct event sc_conf_ev;
TAILQ_HEAD(idm_list, idm) sc_idms;
struct imsgev *sc_iev;
struct imsgev *sc_iev_dns;
RB_HEAD(user_name_tree,userent) *sc_user_names;
RB_HEAD(user_uid_tree,userent) sc_user_uids;
RB_HEAD(group_name_tree,groupent)*sc_group_names;
RB_HEAD(group_gid_tree,groupent) sc_group_gids;
struct user_name_tree *sc_user_names_t;
struct group_name_tree *sc_group_names_t;
size_t sc_user_line_len;
size_t sc_group_line_len;
char *sc_user_lines;
char *sc_group_lines;
struct yp_data *sc_yp;
int update_trashed;
};
/* log.c */
void log_init(int);
void log_warn(const char *, ...);
void log_warnx(const char *, ...);
void log_info(const char *, ...);
void log_debug(const char *, ...);
void logit(int, const char *, ...);
void vlog(int, const char *, va_list);
__dead2 void fatal(const char *);
__dead2 void fatalx(const char *);
/* parse.y */
int parse_config(struct env *, const char *, int);
int cmdline_symset(char *);
/* ldapclient.c */
pid_t ldapclient(int [2]);
/* ypldap.c */
void purge_config(struct env *);
void imsg_event_add(struct imsgev *);
int imsg_compose_event(struct imsgev *, u_int16_t, u_int32_t,
pid_t, int, void *, u_int16_t);
/* entries.c */
void flatten_entries(struct env *);
int userent_name_cmp(struct userent *, struct userent *);
int userent_uid_cmp(struct userent *, struct userent *);
int groupent_name_cmp(struct groupent *, struct groupent *);
int groupent_gid_cmp(struct groupent *, struct groupent *);
RB_PROTOTYPE( user_name_tree, userent, ue_name_node, userent_name_cmp);
RB_PROTOTYPE( user_uid_tree, userent, ue_uid_node, userent_uid_cmp);
RB_PROTOTYPE( group_name_tree, groupent, ge_name_node, groupent_name_cmp);
RB_PROTOTYPE( group_gid_tree, groupent, ge_gid_node, groupent_gid_cmp);
/* yp.c */
void yp_init(struct env *);
void yp_enable_events(void);
/* ypldap_dns.c */
pid_t ypldap_dns(int[2], struct passwd *);
diff --git a/usr.sbin/ypldap/ypldap_dns.c b/usr.sbin/ypldap/ypldap_dns.c
index 5cb0390c8603..09ce636ebdc8 100644
--- a/usr.sbin/ypldap/ypldap_dns.c
+++ b/usr.sbin/ypldap/ypldap_dns.c
@@ -1,251 +1,250 @@
/* $OpenBSD: ypldap_dns.c,v 1.8 2015/01/16 06:40:22 deraadt Exp $ */
-/* $FreeBSD$ */
/*
* Copyright (c) 2003-2008 Henning Brauer <henning@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER
* IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <sys/time.h>
#include <sys/tree.h>
#include <sys/queue.h>
#include <netinet/in.h>
#include <arpa/nameser.h>
#include <netdb.h>
#include <pwd.h>
#include <errno.h>
#include <event.h>
#include <resolv.h>
#include <poll.h>
#include <signal.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <limits.h>
#include "ypldap.h"
volatile sig_atomic_t quit_dns = 0;
struct imsgev *iev_dns;
void dns_dispatch_imsg(int, short, void *);
void dns_sig_handler(int, short, void *);
void dns_shutdown(void);
int host_dns(const char *, struct ypldap_addr_list *);
void
dns_sig_handler(int sig, short event, void *p)
{
switch (sig) {
case SIGINT:
case SIGTERM:
dns_shutdown();
break;
default:
fatalx("unexpected signal");
}
}
void
dns_shutdown(void)
{
log_info("dns engine exiting");
_exit(0);
}
pid_t
ypldap_dns(int pipe_ntp[2], struct passwd *pw)
{
pid_t pid;
struct event ev_sigint;
struct event ev_sigterm;
struct event ev_sighup;
struct env env;
switch (pid = fork()) {
case -1:
fatal("cannot fork");
break;
case 0:
break;
default:
return (pid);
}
setproctitle("dns engine");
close(pipe_ntp[0]);
if (setgroups(1, &pw->pw_gid) ||
setresgid(pw->pw_gid, pw->pw_gid, pw->pw_gid) ||
setresuid(pw->pw_uid, pw->pw_uid, pw->pw_uid))
fatal("can't drop privileges");
endservent();
event_init();
signal_set(&ev_sigint, SIGINT, dns_sig_handler, NULL);
signal_set(&ev_sigterm, SIGTERM, dns_sig_handler, NULL);
signal_set(&ev_sighup, SIGHUP, dns_sig_handler, NULL);
signal_add(&ev_sigint, NULL);
signal_add(&ev_sigterm, NULL);
signal_add(&ev_sighup, NULL);
if ((env.sc_iev = calloc(1, sizeof(*env.sc_iev))) == NULL)
fatal(NULL);
env.sc_iev->events = EV_READ;
env.sc_iev->data = &env;
imsg_init(&env.sc_iev->ibuf, pipe_ntp[1]);
env.sc_iev->handler = dns_dispatch_imsg;
event_set(&env.sc_iev->ev, env.sc_iev->ibuf.fd, env.sc_iev->events,
env.sc_iev->handler, &env);
event_add(&env.sc_iev->ev, NULL);
event_dispatch();
dns_shutdown();
return (0);
}
void
dns_dispatch_imsg(int fd, short events, void *p)
{
struct imsg imsg;
int n, cnt;
char *name;
struct ypldap_addr_list hn = TAILQ_HEAD_INITIALIZER(hn);
struct ypldap_addr *h;
struct ibuf *buf;
struct env *env = p;
struct imsgev *iev = env->sc_iev;
struct imsgbuf *ibuf = &iev->ibuf;
int shut = 0;
if ((events & (EV_READ | EV_WRITE)) == 0)
fatalx("unknown event");
if (events & EV_READ) {
if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
fatal("imsg_read error");
if (n == 0)
shut = 1;
}
if (events & EV_WRITE) {
if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
fatal("msgbuf_write");
if (n == 0)
shut = 1;
goto done;
}
for (;;) {
if ((n = imsg_get(ibuf, &imsg)) == -1)
fatal("client_dispatch_imsg: imsg_get error");
if (n == 0)
break;
switch (imsg.hdr.type) {
case IMSG_HOST_DNS:
name = imsg.data;
if (imsg.hdr.len < 1 + IMSG_HEADER_SIZE)
fatalx("invalid IMSG_HOST_DNS received");
imsg.hdr.len -= 1 + IMSG_HEADER_SIZE;
if (name[imsg.hdr.len] != '\0' ||
strlen(name) != imsg.hdr.len)
fatalx("invalid IMSG_HOST_DNS received");
if ((cnt = host_dns(name, &hn)) == -1)
break;
buf = imsg_create(ibuf, IMSG_HOST_DNS,
imsg.hdr.peerid, 0,
cnt * sizeof(struct sockaddr_storage));
if (buf == NULL)
break;
if (cnt > 0) {
while(!TAILQ_EMPTY(&hn)) {
h = TAILQ_FIRST(&hn);
TAILQ_REMOVE(&hn, h, next);
imsg_add(buf, &h->ss, sizeof(h->ss));
free(h);
}
}
imsg_close(ibuf, buf);
break;
default:
break;
}
imsg_free(&imsg);
}
done:
if (!shut)
imsg_event_add(iev);
else {
/* this pipe is dead, so remove the event handler */
event_del(&iev->ev);
event_loopexit(NULL);
}
}
int
host_dns(const char *s, struct ypldap_addr_list *hn)
{
struct addrinfo hints, *res0, *res;
int error, cnt = 0;
struct sockaddr_in *sa_in;
struct sockaddr_in6 *sa_in6;
struct ypldap_addr *h;
memset(&hints, 0, sizeof(hints));
hints.ai_family = PF_UNSPEC;
hints.ai_socktype = SOCK_DGRAM; /* DUMMY */
error = getaddrinfo(s, NULL, &hints, &res0);
if (error == EAI_AGAIN || error == EAI_NONAME)
return (0);
if (error) {
log_warnx("could not parse \"%s\": %s", s,
gai_strerror(error));
return (-1);
}
for (res = res0; res && cnt < MAX_SERVERS_DNS; res = res->ai_next) {
if (res->ai_family != AF_INET &&
res->ai_family != AF_INET6)
continue;
if ((h = calloc(1, sizeof(struct ypldap_addr))) == NULL)
fatal(NULL);
h->ss.ss_family = res->ai_family;
if (res->ai_family == AF_INET) {
sa_in = (struct sockaddr_in *)&h->ss;
sa_in->sin_len = sizeof(struct sockaddr_in);
sa_in->sin_addr.s_addr = ((struct sockaddr_in *)
res->ai_addr)->sin_addr.s_addr;
} else {
sa_in6 = (struct sockaddr_in6 *)&h->ss;
sa_in6->sin6_len = sizeof(struct sockaddr_in6);
memcpy(&sa_in6->sin6_addr, &((struct sockaddr_in6 *)
res->ai_addr)->sin6_addr, sizeof(struct in6_addr));
}
TAILQ_INSERT_HEAD(hn, h, next);
cnt++;
}
freeaddrinfo(res0);
return (cnt);
}

File Metadata

Mime Type
application/octet-stream
Expires
Thu, Jul 4, 4:52 PM (2 d)
Storage Engine
chunks
Storage Format
Chunks
Storage Handle
xwe45_LamTwp
Default Alt Text
(5 MB)

Event Timeline