stdlib.h revision 1.1.1.2
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 #ifdef _BSD_SIZE_T_ 42 typedef _BSD_SIZE_T_ size_t; 43 #undef _BSD_SIZE_T_ 44 #endif 45 46 #ifdef _BSD_WCHAR_T_ 47 #ifndef _ANSI_SOURCE 48 typedef _BSD_WCHAR_T_ rune_t; 49 #endif 50 typedef _BSD_WCHAR_T_ wchar_t; 51 #undef _BSD_WCHAR_T_ 52 #endif 53 54 typedef struct { 55 int quot; /* quotient */ 56 int rem; /* remainder */ 57 } div_t; 58 59 typedef struct { 60 long quot; /* quotient */ 61 long rem; /* remainder */ 62 } ldiv_t; 63 64 #ifndef NULL 65 #define NULL 0 66 #endif 67 68 #define EXIT_FAILURE 1 69 #define EXIT_SUCCESS 0 70 71 #define RAND_MAX 0x7fffffff 72 73 extern int __mb_cur_max; 74 #define MB_CUR_MAX __mb_cur_max 75 76 #include <sys/cdefs.h> 77 78 __BEGIN_DECLS 79 __dead void 80 abort __P((void)); 81 __pure int 82 abs __P((int)); 83 int atexit __P((void (*)(void))); 84 double atof __P((const char *)); 85 int atoi __P((const char *)); 86 long atol __P((const char *)); 87 void *bsearch __P((const void *, const void *, size_t, 88 size_t, int (*)(const void *, const void *))); 89 void *calloc __P((size_t, size_t)); 90 __pure div_t 91 div __P((int, int)); 92 __dead void 93 exit __P((int)); 94 void free __P((void *)); 95 char *getenv __P((const char *)); 96 __pure long 97 labs __P((long)); 98 __pure ldiv_t 99 ldiv __P((long, long)); 100 void *malloc __P((size_t)); 101 void qsort __P((void *, size_t, size_t, 102 int (*)(const void *, const void *))); 103 int rand __P((void)); 104 void *realloc __P((void *, size_t)); 105 void srand __P((unsigned)); 106 double strtod __P((const char *, char **)); 107 long strtol __P((const char *, char **, int)); 108 unsigned long 109 strtoul __P((const char *, char **, int)); 110 int system __P((const char *)); 111 112 /* These are currently just stubs. */ 113 int mblen __P((const char *, size_t)); 114 size_t mbstowcs __P((wchar_t *, const char *, size_t)); 115 int wctomb __P((char *, wchar_t)); 116 int mbtowc __P((wchar_t *, const char *, size_t)); 117 size_t wcstombs __P((char *, const wchar_t *, size_t)); 118 119 #ifndef _ANSI_SOURCE 120 int putenv __P((const char *)); 121 int setenv __P((const char *, const char *, int)); 122 #endif 123 124 #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) 125 void *alloca __P((size_t)); /* built-in for gcc */ 126 /* getcap(3) functions */ 127 char *getbsize __P((int *, long *)); 128 char *cgetcap __P((char *, char *, int)); 129 int cgetclose __P((void)); 130 int cgetent __P((char **, char **, char *)); 131 int cgetfirst __P((char **, char **)); 132 int cgetmatch __P((char *, char *)); 133 int cgetnext __P((char **, char **)); 134 int cgetnum __P((char *, char *, long *)); 135 int cgetset __P((char *)); 136 int cgetstr __P((char *, char *, char **)); 137 int cgetustr __P((char *, char *, char **)); 138 139 int daemon __P((int, int)); 140 char *devname __P((int, int)); 141 int getloadavg __P((double [], int)); 142 143 char *group_from_gid __P((unsigned long, int)); 144 int heapsort __P((void *, size_t, size_t, 145 int (*)(const void *, const void *))); 146 char *initstate __P((unsigned long, char *, long)); 147 int mergesort __P((void *, size_t, size_t, 148 int (*)(const void *, const void *))); 149 int radixsort __P((const unsigned char **, int, const unsigned char *, 150 unsigned)); 151 int sradixsort __P((const unsigned char **, int, const unsigned char *, 152 unsigned)); 153 long random __P((void)); 154 char *realpath __P((const char *, char resolved_path[])); 155 char *setstate __P((char *)); 156 void srandom __P((unsigned long)); 157 char *user_from_uid __P((unsigned long, int)); 158 #ifndef __STRICT_ANSI__ 159 long long 160 strtoq __P((const char *, char **, int)); 161 unsigned long long 162 strtouq __P((const char *, char **, int)); 163 #endif 164 void unsetenv __P((const char *)); 165 #endif 166 __END_DECLS 167 168 #endif /* _STDLIB_H_ */ 169
Indexes created Fri Oct 03 02:09:57 GMT 2025