stdlib.h revision 1.7
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 * from: @(#)stdlib.h 5.13 (Berkeley) 6/4/91 34 * $Id: stdlib.h,v 1.7 1993/10/13 17:56:09 jtc Exp $ 35 */ 36 37 #ifndef _STDLIB_H_ 38 #define _STDLIB_H_ 39 #include <machine/ansi.h> 40 41 #ifdef _SIZE_T_ 42 typedef _SIZE_T_ size_t; 43 #undef _SIZE_T_ 44 #endif 45 46 #ifdef _WCHAR_T_ 47 typedef _WCHAR_T_ wchar_t; 48 #undef _WCHAR_T_ 49 #endif 50 51 typedef struct { 52 int quot; /* quotient */ 53 int rem; /* remainder */ 54 } div_t; 55 typedef struct { 56 long quot; /* quotient */ 57 long rem; /* remainder */ 58 } ldiv_t; 59 60 #define EXIT_FAILURE 1 61 #define EXIT_SUCCESS 0 62 63 #define RAND_MAX 0x7fffffff 64 65 #define MB_CUR_MAX 1 /* XXX */ 66 67 #include <sys/cdefs.h> 68 69 __BEGIN_DECLS 70 void abort __P((void)); 71 int abs __P((int)); 72 int atexit __P((void (*)(void))); 73 double atof __P((const char *)); 74 int atoi __P((const char *)); 75 long atol __P((const char *)); 76 void *bsearch __P((const void *, const void *, size_t, 77 size_t, int (*)(const void *, const void *))); 78 void *calloc __P((size_t, size_t)); 79 div_t div __P((int, int)); 80 void exit __P((int)); 81 void free __P((void *)); 82 char *getenv __P((const char *)); 83 long labs __P((long)); 84 ldiv_t ldiv __P((long, long)); 85 void *malloc __P((size_t)); 86 void qsort __P((void *, size_t, size_t, 87 int (*)(const void *, const void *))); 88 int rand __P((void)); 89 void *realloc __P((void *, size_t)); 90 void srand __P((unsigned)); 91 double strtod __P((const char *, char **)); 92 long strtol __P((const char *, char **, int)); 93 unsigned long 94 strtoul __P((const char *, char **, int)); 95 int system __P((const char *)); 96 97 /* these are currently just stubs */ 98 int mblen __P((const char *, size_t)); 99 size_t mbstowcs __P((wchar_t *, const char *, size_t)); 100 int wctomb __P((char *, wchar_t)); 101 int mbtowc __P((wchar_t *, const char *, size_t)); 102 size_t wcstombs __P((char *, const wchar_t *, size_t)); 103 104 #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) 105 #include <sys/types.h> 106 107 #if defined(alloca) && (alloca == __builtin_alloca) && (__GNUC__ < 2) 108 void *alloca __P((int)); /* built-in for gcc */ 109 #else 110 void *alloca __P((size_t)); 111 #endif /* __GNUC__ */ 112 void cfree __P((void *)); 113 114 int getopt __P((int, char * const *, const char *)); 115 extern char *optarg; /* getopt(3) external variables */ 116 extern int opterr; 117 extern int optind; 118 extern int optopt; 119 int getsubopt __P((char **, char * const *, char **)); 120 extern char *suboptarg; /* getsubopt(3) external variable */ 121 122 int heapsort __P((void *, size_t, size_t, 123 int (*)(const void *, const void *))); 124 int radixsort __P((const u_char **, int, const u_char *, u_char)); 125 126 char *initstate __P((unsigned, char *, int)); 127 long random __P((void)); 128 char *setstate __P((char *)); 129 void srandom __P((unsigned)); 130 131 int putenv __P((const char *)); 132 int setenv __P((const char *, const char *, int)); 133 void unsetenv __P((const char *)); 134 135 double drand48 __P((void)); 136 double erand48 __P((unsigned short[3])); 137 long jrand48 __P((unsigned short[3])); 138 void lcong48 __P((unsigned short[7])); 139 long lrand48 __P((void)); 140 long mrand48 __P((void)); 141 long nrand48 __P((unsigned short[3])); 142 unsigned short *seed48 __P((unsigned short[3])); 143 void srand48 __P((long)); 144 #endif /* !_ANSI_SOURCE && !_POSIX_SOURCE */ 145 146 __END_DECLS 147 148 #endif /* _STDLIB_H_ */ 149
Indexes created Mon Sep 22 13:09:51 GMT 2025