BSD 4.4 Lite Include Sources

1 files changed, 175 insertions, 0 deletions

diff --git a/include/stdlib.h b/include/stdlib.h
new file mode 100644
index 000000000000..80cd3619b19f
--- /dev/null
+++ b/include/stdlib.h
@@ -0,0 +1,175 @@
+/*-
+ * 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. 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.
+ *
+ *	@(#)stdlib.h	8.3 (Berkeley) 2/16/94
+ */
+
+#ifndef _STDLIB_H_
+#define _STDLIB_H_
+
+#include <machine/ansi.h>
+
+#ifdef	_BSD_SIZE_T_
+typedef	_BSD_SIZE_T_	size_t;
+#undef	_BSD_SIZE_T_
+#endif
+
+#ifdef	_BSD_WCHAR_T_
+#ifndef _ANSI_SOURCE
+typedef	_BSD_WCHAR_T_	rune_t;
+#endif
+typedef	_BSD_WCHAR_T_	wchar_t;
+#undef	_BSD_WCHAR_T_
+#endif
+
+typedef struct {
+	int quot;		/* quotient */
+	int rem;		/* remainder */
+} div_t;
+
+typedef struct {
+	long quot;		/* quotient */
+	long rem;		/* remainder */
+} ldiv_t;
+
+#ifndef NULL
+#define	NULL	0
+#endif
+
+#define	EXIT_FAILURE	1
+#define	EXIT_SUCCESS	0
+
+#define	RAND_MAX	0x7fffffff
+
+extern int __mb_cur_max;
+#define	MB_CUR_MAX	__mb_cur_max
+
+#include <sys/cdefs.h>
+
+__BEGIN_DECLS
+__dead void
+	 abort __P((void));
+__pure int
+	 abs __P((int));
+int	 atexit __P((void (*)(void)));
+double	 atof __P((const char *));
+int	 atoi __P((const char *));
+long	 atol __P((const char *));
+void	*bsearch __P((const void *, const void *, size_t,
+	    size_t, int (*)(const void *, const void *)));
+void	*calloc __P((size_t, size_t));
+__pure div_t
+	 div __P((int, int));
+__dead void
+	 exit __P((int));
+void	 free __P((void *));
+char	*getenv __P((const char *));
+__pure long
+	 labs __P((long));
+__pure ldiv_t
+	 ldiv __P((long, long));
+void	*malloc __P((size_t));
+void	 qsort __P((void *, size_t, size_t,
+	    int (*)(const void *, const void *)));
+int	 rand __P((void));
+void	*realloc __P((void *, size_t));
+void	 srand __P((unsigned));
+double	 strtod __P((const char *, char **));
+long	 strtol __P((const char *, char **, int));
+unsigned long
+	 strtoul __P((const char *, char **, int));
+int	 system __P((const char *));
+
+/* These are currently just stubs. */
+int	 mblen __P((const char *, size_t));
+size_t	 mbstowcs __P((wchar_t *, const char *, size_t));
+int	 wctomb __P((char *, wchar_t));
+int	 mbtowc __P((wchar_t *, const char *, size_t));
+size_t	 wcstombs __P((char *, const wchar_t *, size_t));
+
+#ifndef _ANSI_SOURCE
+int	 putenv __P((const char *));
+int	 setenv __P((const char *, const char *, int));
+#endif
+
+#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
+void	*alloca __P((size_t));		/* built-in for gcc */
+					/* getcap(3) functions */
+char	*getbsize __P((int *, long *));
+char	*cgetcap __P((char *, char *, int));
+int	 cgetclose __P((void));
+int	 cgetent __P((char **, char **, char *));
+int	 cgetfirst __P((char **, char **));
+int	 cgetmatch __P((char *, char *));
+int	 cgetnext __P((char **, char **));
+int	 cgetnum __P((char *, char *, long *));
+int	 cgetset __P((char *));
+int	 cgetstr __P((char *, char *, char **));
+int	 cgetustr __P((char *, char *, char **));
+
+int	 daemon __P((int, int));
+char	*devname __P((int, int));
+int	 getloadavg __P((double [], int));
+
+extern char *optarg;			/* getopt(3) external variables */
+extern int opterr, optind, optopt;
+int	 getopt __P((int, char * const *, const char *));
+
+extern char *suboptarg;			/* getsubopt(3) external variable */
+int	 getsubopt __P((char **, char * const *, char **));
+
+char	*group_from_gid __P((unsigned long, int));
+int	 heapsort __P((void *, size_t, size_t,
+	    int (*)(const void *, const void *)));
+char	*initstate __P((unsigned, char *, int));
+int	 mergesort __P((void *, size_t, size_t,
+	    int (*)(const void *, const void *)));
+int	 radixsort __P((const unsigned char **, int, const unsigned char *,
+	    unsigned));
+int	 sradixsort __P((const unsigned char **, int, const unsigned char *,
+	    unsigned));
+long	 random __P((void));
+char	*realpath __P((const char *, char resolved_path[]));
+char	*setstate __P((char *));
+void	 srandom __P((unsigned));
+char	*user_from_uid __P((unsigned long, int));
+#ifndef __STRICT_ANSI__
+long long
+	 strtoq __P((const char *, char **, int));
+unsigned long long
+	 strtouq __P((const char *, char **, int));
+#endif
+void	 unsetenv __P((const char *));
+#endif
+__END_DECLS
+
+#endif /* _STDLIB_H_ */