| 1 | /*- |
| 2 | * Copyright (c) 1990 The Regents of the University of California. |
| 3 | * 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 5.13 (Berkeley) 6/4/91 |
| 34 | */ |
| 35 | |
| 36 | #ifndef _STDLIB_H_ |
| 37 | #define _STDLIB_H_ |
| 38 | #include <sys/types.h> |
| 39 | |
| 40 | #ifdef _WCHAR_T_ |
| 41 | typedef _WCHAR_T_ wchar_t; |
| 42 | #undef _WCHAR_T_ |
| 43 | #endif |
| 44 | |
| 45 | typedef struct { |
| 46 | int quot; /* quotient */ |
| 47 | int rem; /* remainder */ |
| 48 | } div_t; |
| 49 | typedef struct { |
| 50 | long quot; /* quotient */ |
| 51 | long rem; /* remainder */ |
| 52 | } ldiv_t; |
| 53 | |
| 54 | #define EXIT_FAILURE 1 |
| 55 | #define EXIT_SUCCESS 0 |
| 56 | |
| 57 | #define RAND_MAX 0x7fffffff |
| 58 | |
| 59 | #define MB_CUR_MAX 1 /* XXX */ |
| 60 | |
| 61 | #include <sys/cdefs.h> |
| 62 | |
| 63 | __BEGIN_DECLS |
| 64 | void abort __P((void)); |
| 65 | int abs __P((int)); |
| 66 | int atexit __P((void (*)(void))); |
| 67 | double atof __P((const char *)); |
| 68 | int atoi __P((const char *)); |
| 69 | long atol __P((const char *)); |
| 70 | void *bsearch __P((const void *, const void *, size_t, |
| 71 | size_t, int (*)(const void *, const void *))); |
| 72 | void *calloc __P((size_t, size_t)); |
| 73 | div_t div __P((int, int)); |
| 74 | void exit __P((int)); |
| 75 | void free __P((void *)); |
| 76 | char *getenv __P((const char *)); |
| 77 | long labs __P((long)); |
| 78 | ldiv_t ldiv __P((long, long)); |
| 79 | void *malloc __P((size_t)); |
| 80 | void qsort __P((void *, size_t, size_t, |
| 81 | int (*)(const void *, const void *))); |
| 82 | int rand __P((void)); |
| 83 | void *realloc __P((void *, size_t)); |
| 84 | void srand __P((unsigned)); |
| 85 | double strtod __P((const char *, char **)); |
| 86 | long strtol __P((const char *, char **, int)); |
| 87 | unsigned long |
| 88 | strtoul __P((const char *, char **, int)); |
| 89 | int system __P((const char *)); |
| 90 | |
| 91 | /* these are currently just stubs */ |
| 92 | int mblen __P((const char *, size_t)); |
| 93 | size_t mbstowcs __P((wchar_t *, const char *, size_t)); |
| 94 | int wctomb __P((char *, wchar_t)); |
| 95 | int mbtowc __P((wchar_t *, const char *, size_t)); |
| 96 | size_t wcstombs __P((char *, const wchar_t *, size_t)); |
| 97 | |
| 98 | #ifndef _ANSI_SOURCE |
| 99 | void cfree __P((void *)); |
| 100 | int putenv __P((const char *)); |
| 101 | int setenv __P((const char *, const char *, int)); |
| 102 | #endif /* not ANSI */ |
| 103 | |
| 104 | #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) |
| 105 | void *alloca __P((size_t)); /* built-in for gcc */ |
| 106 | extern char *optarg; /* getopt(3) external variables */ |
| 107 | extern int optind; |
| 108 | extern int opterr; |
| 109 | int getopt __P((int, char * const *, const char *)); |
| 110 | extern char *suboptarg; /* getsubopt(3) external variable */ |
| 111 | int getsubopt __P((char **, char * const *, char **)); |
| 112 | int heapsort __P((void *, size_t, size_t, |
| 113 | int (*)(const void *, const void *))); |
| 114 | char *initstate __P((unsigned, char *, int)); |
| 115 | int radixsort __P((const u_char **, int, const u_char *, u_char)); |
| 116 | long random __P((void)); |
| 117 | char *setstate __P((char *)); |
| 118 | void srandom __P((unsigned)); |
| 119 | void unsetenv __P((const char *)); |
| 120 | #endif /* neither ANSI nor POSIX */ |
| 121 | |
| 122 | __END_DECLS |
| 123 | |
| 124 | #endif /* _STDLIB_H_ */ |