stdlib.h revision 88399
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 * $FreeBSD: head/include/stdlib.h 88399 2001-12-22 05:18:37Z mike $
35 */
36
37#ifndef _STDLIB_H_
38#define	_STDLIB_H_
39
40#include <sys/cdefs.h>
41
42#include <machine/ansi.h>
43
44#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
45#ifdef	_BSD_RUNE_T_
46typedef	_BSD_RUNE_T_	rune_t;
47#undef	_BSD_RUNE_T_
48#endif
49#endif
50
51#ifdef	_BSD_SIZE_T_
52typedef	_BSD_SIZE_T_	size_t;
53#undef	_BSD_SIZE_T_
54#endif
55
56#ifdef	_BSD_WCHAR_T_
57typedef	_BSD_WCHAR_T_	wchar_t;
58#undef	_BSD_WCHAR_T_
59#endif
60
61typedef struct {
62	int quot;		/* quotient */
63	int rem;		/* remainder */
64} div_t;
65
66typedef struct {
67	long quot;		/* quotient */
68	long rem;		/* remainder */
69} ldiv_t;
70
71#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
72#ifdef __LONG_LONG_SUPPORTED
73typedef struct {
74	long long quot;
75	long long rem;
76} lldiv_t;
77#endif
78#endif
79
80#ifndef NULL
81#define	NULL	0
82#endif
83
84#define	EXIT_FAILURE	1
85#define	EXIT_SUCCESS	0
86
87#define	RAND_MAX	0x7fffffff
88
89extern int __mb_cur_max;
90#define	MB_CUR_MAX	__mb_cur_max
91
92__BEGIN_DECLS
93void	 abort __P((void)) __dead2;
94int	 abs __P((int)) __pure2;
95int	 atexit __P((void (*)(void)));
96double	 atof __P((const char *));
97int	 atoi __P((const char *));
98long	 atol __P((const char *));
99void	*bsearch __P((const void *, const void *, size_t,
100	    size_t, int (*)(const void *, const void *)));
101void	*calloc __P((size_t, size_t));
102div_t	 div __P((int, int)) __pure2;
103void	 exit __P((int)) __dead2;
104void	 free __P((void *));
105char	*getenv __P((const char *));
106long	 labs __P((long)) __pure2;
107ldiv_t	 ldiv __P((long, long)) __pure2;
108void	*malloc __P((size_t));
109void	 qsort __P((void *, size_t, size_t,
110	    int (*)(const void *, const void *)));
111int	 rand __P((void));
112void	*realloc __P((void *, size_t));
113void	 srand __P((unsigned));
114double	 strtod __P((const char *, char **));
115long	 strtol __P((const char *, char **, int));
116unsigned long
117	 strtoul __P((const char *, char **, int));
118int	 system __P((const char *));
119
120int	 mblen __P((const char *, size_t));
121size_t	 mbstowcs __P((wchar_t *, const char *, size_t));
122int	 wctomb __P((char *, wchar_t));
123int	 mbtowc __P((wchar_t *, const char *, size_t));
124size_t	 wcstombs __P((char *, const wchar_t *, size_t));
125
126#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
127extern char *_malloc_options;
128extern void (*_malloc_message)__P((char *p1, char *p2, char *p3, char *p4));
129
130int	 putenv __P((const char *));
131int	 setenv __P((const char *, const char *, int));
132
133double	 drand48 __P((void));
134double	 erand48 __P((unsigned short[3]));
135long	 jrand48 __P((unsigned short[3]));
136void	 lcong48 __P((unsigned short[7]));
137long	 lrand48 __P((void));
138long	 mrand48 __P((void));
139long	 nrand48 __P((unsigned short[3]));
140unsigned short
141	*seed48 __P((unsigned short[3]));
142void	 srand48 __P((long));
143
144void	*alloca __P((size_t));		/* built-in for gcc */
145					/* getcap(3) functions */
146__uint32_t
147	 arc4random __P((void));
148void	 arc4random_addrandom __P((unsigned char *dat, int datlen));
149void	 arc4random_stir __P((void));
150#ifdef __LONG_LONG_SUPPORTED
151long long
152	 atoll __P((const char *));
153#endif
154char	*getbsize __P((int *, long *));
155char	*cgetcap __P((char *, char *, int));
156int	 cgetclose __P((void));
157int	 cgetent __P((char **, char **, char *));
158int	 cgetfirst __P((char **, char **));
159int	 cgetmatch __P((char *, char *));
160int	 cgetnext __P((char **, char **));
161int	 cgetnum __P((char *, char *, long *));
162int	 cgetset __P((char *));
163int	 cgetstr __P((char *, char *, char **));
164int	 cgetustr __P((char *, char *, char **));
165
166int	 daemon __P((int, int));
167char	*devname __P((int, int));
168int	 getloadavg __P((double [], int));
169__const char *
170	 getprogname __P((void));
171
172char	*group_from_gid __P((unsigned long, int));
173int	 heapsort __P((void *, size_t, size_t,
174	    int (*)(const void *, const void *)));
175char	*initstate __P((unsigned long, char *, long));
176#ifdef __LONG_LONG_SUPPORTED
177long long
178	 llabs __P((long long)) __pure2;
179lldiv_t	 lldiv __P((long long, long long)) __pure2;
180#endif
181int	 mergesort __P((void *, size_t, size_t,
182	    int (*)(const void *, const void *)));
183int	 radixsort __P((const unsigned char **, int, const unsigned char *,
184	    unsigned));
185int	 sradixsort __P((const unsigned char **, int, const unsigned char *,
186	    unsigned));
187int	 rand_r __P((unsigned *));
188long	 random __P((void));
189void    *reallocf __P((void *, size_t));
190char	*realpath __P((const char *, char resolved_path[]));
191void	 setprogname __P((const char *));
192char	*setstate __P((char *));
193void	 sranddev __P((void));
194void	 srandom __P((unsigned long));
195void	 srandomdev __P((void));
196#ifdef __LONG_LONG_SUPPORTED
197long long
198	 strtoll __P((const char *, char **, int));
199#endif
200__int64_t	 strtoq __P((const char *, char **, int));
201#ifdef __LONG_LONG_SUPPORTED
202unsigned long long
203	 strtoull __P((const char *, char **, int));
204#endif
205__uint64_t
206	 strtouq __P((const char *, char **, int));
207void	 unsetenv __P((const char *));
208char	*user_from_uid __P((unsigned long, int));
209#endif /* !_ANSI_SOURCE && !_POSIX_SOURCE */
210__END_DECLS
211
212#endif /* !_STDLIB_H_ */
213