stdlib.h revision 24152
1/*- 2 * Copyright (c) 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)stdlib.h 8.5 (Berkeley) 5/19/95 34 */ 35 36#ifndef _STDLIB_H_ 37#define _STDLIB_H_ 38 39#include <machine/ansi.h> 40 41#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) 42#ifdef _BSD_RUNE_T_ 43typedef _BSD_RUNE_T_ rune_t; 44#undef _BSD_RUNE_T_ 45#endif 46#endif 47 48#ifdef _BSD_SIZE_T_ 49typedef _BSD_SIZE_T_ size_t; 50#undef _BSD_SIZE_T_ 51#endif 52 53#ifdef _BSD_WCHAR_T_ 54typedef _BSD_WCHAR_T_ wchar_t; 55#undef _BSD_WCHAR_T_ 56#endif 57 58typedef struct { 59 int quot; /* quotient */ 60 int rem; /* remainder */ 61} div_t; 62 63typedef struct { 64 long quot; /* quotient */ 65 long rem; /* remainder */ 66} ldiv_t; 67 68#ifndef NULL 69#define NULL 0 70#endif 71 72#define EXIT_FAILURE 1 73#define EXIT_SUCCESS 0 74 75#define RAND_MAX 0x7fffffff 76 77extern int __mb_cur_max; 78#define MB_CUR_MAX __mb_cur_max 79 80#include <sys/cdefs.h> 81 82__BEGIN_DECLS 83void abort __P((void)) __dead2; 84int abs __P((int)) __pure2; 85int atexit __P((void (*)(void))); 86double atof __P((const char *)); 87int atoi __P((const char *)); 88long atol __P((const char *)); 89void *bsearch __P((const void *, const void *, size_t, 90 size_t, int (*)(const void *, const void *))); 91void *calloc __P((size_t, size_t)); 92div_t div __P((int, int)) __pure2; 93void exit __P((int)) __dead2; 94void free __P((void *)); 95char *getenv __P((const char *)); 96long labs __P((long)) __pure2; 97ldiv_t ldiv __P((long, long)) __pure2; 98void *malloc __P((size_t)); 99void qsort __P((void *, size_t, size_t, 100 int (*)(const void *, const void *))); 101int rand __P((void)); 102void *realloc __P((void *, size_t)); 103void srand __P((unsigned)); 104double strtod __P((const char *, char **)); 105long strtol __P((const char *, char **, int)); 106unsigned long 107 strtoul __P((const char *, char **, int)); 108int system __P((const char *)); 109 110int mblen __P((const char *, size_t)); 111size_t mbstowcs __P((wchar_t *, const char *, size_t)); 112int wctomb __P((char *, wchar_t)); 113int mbtowc __P((wchar_t *, const char *, size_t)); 114size_t wcstombs __P((char *, const wchar_t *, size_t)); 115 116#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) 117int putenv __P((const char *)); 118int setenv __P((const char *, const char *, int)); 119 120double drand48 __P((void)); 121double erand48 __P((unsigned short[3])); 122long jrand48 __P((unsigned short[3])); 123void lcong48 __P((unsigned short[7])); 124long lrand48 __P((void)); 125long mrand48 __P((void)); 126long nrand48 __P((unsigned short[3])); 127unsigned short 128 *seed48 __P((unsigned short[3])); 129void srand48 __P((long)); 130 131void *alloca __P((size_t)); /* built-in for gcc */ 132 /* getcap(3) functions */ 133char *getbsize __P((int *, long *)); 134char *cgetcap __P((char *, char *, int)); 135int cgetclose __P((void)); 136int cgetent __P((char **, char **, char *)); 137int cgetfirst __P((char **, char **)); 138int cgetmatch __P((char *, char *)); 139int cgetnext __P((char **, char **)); 140int cgetnum __P((char *, char *, long *)); 141int cgetset __P((char *)); 142int cgetstr __P((char *, char *, char **)); 143int cgetustr __P((char *, char *, char **)); 144 145int daemon __P((int, int)); 146char *devname __P((int, int)); 147int getloadavg __P((double [], int)); 148 149char *group_from_gid __P((unsigned long, int)); 150int heapsort __P((void *, size_t, size_t, 151 int (*)(const void *, const void *))); 152char *initstate __P((unsigned long, char *, long)); 153int mergesort __P((void *, size_t, size_t, 154 int (*)(const void *, const void *))); 155int radixsort __P((const unsigned char **, int, const unsigned char *, 156 unsigned)); 157int sradixsort __P((const unsigned char **, int, const unsigned char *, 158 unsigned)); 159long random __P((void)); 160char *realpath __P((const char *, char resolved_path[])); 161char *setstate __P((char *)); 162void srandom __P((unsigned long)); 163int srandomdev __P((void)); 164char *user_from_uid __P((unsigned long, int)); 165#ifndef __STRICT_ANSI__ 166long long 167 strtoq __P((const char *, char **, int)); 168unsigned long long 169 strtouq __P((const char *, char **, int)); 170#endif 171void unsetenv __P((const char *)); 172#endif /* !_ANSI_SOURCE && !_POSIX_SOURCE */ 173__END_DECLS 174 175#endif /* !_STDLIB_H_ */ 176