/* * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved. * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this * file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_LICENSE_HEADER_END@ */ /*- * 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.5 (Berkeley) 5/19/95 */ #ifndef _STDLIB_H_ #define _STDLIB_H_ #include #include #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) #include #endif #ifndef _BSD_SIZE_T_DEFINED_ #define _BSD_SIZE_T_DEFINED_ typedef _BSD_SIZE_T_ size_t; #endif #if !defined(_ANSI_SOURCE) #ifndef _BSD_CT_RUNE_T_DEFINED_ #define _BSD_CT_RUNE_T_DEFINED_ typedef _BSD_CT_RUNE_T_ ct_rune_t; #endif #ifndef _BSD_RUNE_T_DEFINED_ #define _BSD_RUNE_T_DEFINED_ typedef _BSD_RUNE_T_ rune_t; #endif #endif #ifndef __cplusplus #ifndef _BSD_WCHAR_T_DEFINED_ #define _BSD_WCHAR_T_DEFINED_ #ifdef __WCHAR_TYPE__ typedef __WCHAR_TYPE__ wchar_t; #else /* ! __WCHAR_TYPE__ */ typedef _BSD_WCHAR_T_ wchar_t; #endif /* __WCHAR_TYPE__ */ #endif /* _BSD_WCHAR_T_DEFINED_ */ #endif /* __cplusplus */ #ifndef _BSD_WINT_T_DEFINED_ #define _BSD_WINT_T_DEFINED_ typedef _BSD_WINT_T_ wint_t; #endif typedef struct { int quot; /* quotient */ int rem; /* remainder */ } div_t; typedef struct { long quot; /* quotient */ long rem; /* remainder */ } ldiv_t; #ifndef NULL #ifdef __GNUG__ #define NULL __null #else /* ! __GNUG__ */ #ifndef __cplusplus #define NULL ((void *)0) #else /* __cplusplus */ #define NULL 0 #endif /* ! __cplusplus */ #endif /* __GNUG__ */ #endif /* ! NULL */ #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 __BEGIN_DECLS void abort(void) __dead2; int abs(int) __pure2; int atexit(void (*)(void)); double atof(const char *); int atoi(const char *); long atol(const char *); void *bsearch(const void *, const void *, size_t, size_t, int (*)(const void *, const void *)); void *calloc(size_t, size_t); div_t div(int, int) __pure2; void exit(int) __dead2; void free(void *); char *getenv(const char *); long labs(long) __pure2; ldiv_t ldiv(long, long) __pure2; void *malloc(size_t); int mblen(const char *, size_t); size_t mbstowcs(wchar_t * __restrict , const char * __restrict, size_t); int mbtowc(wchar_t * __restrict, const char * __restrict, size_t); void qsort(void *, size_t, size_t, int (*)(const void *, const void *)); int rand(void); void *realloc(void *, size_t); void srand(unsigned); double strtod(const char *, char **); float strtof(const char *, char **); long strtol(const char *, char **, int); long double strtold(const char *, char **); unsigned long strtoul(const char *, char **, int); int system(const char *); void *valloc(size_t); int wctomb(char *, wchar_t); size_t wcstombs(char * __restrict, const wchar_t * __restrict, size_t); #ifndef _ANSI_SOURCE int putenv(const char *); int setenv(const char *, const char *, int); #endif #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) u_int32_t arc4random(void); void arc4random_addrandom(unsigned char *dat, int datlen); void arc4random_stir(void); double drand48(void); double erand48(unsigned short[3]); long jrand48(unsigned short[3]); void lcong48(unsigned short[7]); long lrand48(void); long mrand48(void); long nrand48(unsigned short[3]); unsigned short *seed48(unsigned short[3]); void srand48(long); /* getcap(3) functions */ char *cgetcap(char *, const char *, int); int cgetclose(void); int cgetent(char **, char **, const char *); int cgetfirst(char **, char **); int cgetmatch(const char *, const char *); int cgetnext(char **, char **); int cgetnum(char *, const char *, long *); int cgetset(const char *); int cgetstr(char *, const char *, char **); int cgetustr(char *, const char *, char **); int daemon(int, int); char *devname(int, int); char *getbsize(int *, long *); int getloadavg(double [], int); const char *getprogname(void); long a64l(const char *); char *l64a(long); /* int grantpt(int); */ int heapsort(void *, size_t, size_t, int (*)(const void *, const void *)); char *initstate(unsigned long, char *, long); int mergesort(void *, size_t, size_t, int (*)(const void *, const void *)); /* int posix_openpt(int); */ /* char *ptsname(int); */ void qsort_r(void *, size_t, size_t, void *, int (*)(void *, const void *, const void *)); int radixsort(const unsigned char **, int, const unsigned char *, unsigned); void setprogname(const char *); int sradixsort(const unsigned char **, int, const unsigned char *, unsigned); void sranddev(void); void srandomdev(void); int rand_r(unsigned *); long random(void); void *reallocf(void *, size_t); char *realpath(const char *, char resolved_path[]); char *setstate(char *); void srandom(unsigned long); /* int unlockpt(int); */ #ifndef __STRICT_ANSI__ typedef struct { long long quot; long long rem; } lldiv_t; long long atoll(const char *); long long llabs(long long); lldiv_t lldiv(long long, long long); long long strtoll(const char *, char **, int); unsigned long long strtoull(const char *, char **, int); long long strtoq(const char *, char **, int); unsigned long long strtouq(const char *, char **, int); #endif void unsetenv(const char *); #endif __END_DECLS #endif /* _STDLIB_H_ */