043ed1f581
definitions of the functions that convert strings to numbers and are defined by IEEE Std 1003-1.2001. - Use ANSI-C function definitions for all of the functions mentioned above plus strtouq and strtoq. - Update the prototypes in the manual pages.
216 lines
6.3 KiB
C
216 lines
6.3 KiB
C
/*-
|
|
* Copyright (c) 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)stdlib.h 8.5 (Berkeley) 5/19/95
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _STDLIB_H_
|
|
#define _STDLIB_H_
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
#include <machine/ansi.h>
|
|
|
|
#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
|
|
#ifdef _BSD_RUNE_T_
|
|
typedef _BSD_RUNE_T_ rune_t;
|
|
#undef _BSD_RUNE_T_
|
|
#endif
|
|
#endif
|
|
|
|
#ifdef _BSD_SIZE_T_
|
|
typedef _BSD_SIZE_T_ size_t;
|
|
#undef _BSD_SIZE_T_
|
|
#endif
|
|
|
|
#ifndef __cplusplus
|
|
#ifdef _BSD_WCHAR_T_
|
|
typedef _BSD_WCHAR_T_ wchar_t;
|
|
#undef _BSD_WCHAR_T_
|
|
#endif
|
|
#endif
|
|
|
|
typedef struct {
|
|
int quot; /* quotient */
|
|
int rem; /* remainder */
|
|
} div_t;
|
|
|
|
typedef struct {
|
|
long quot; /* quotient */
|
|
long rem; /* remainder */
|
|
} ldiv_t;
|
|
|
|
#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
|
|
#ifdef __LONG_LONG_SUPPORTED
|
|
/* LONGLONG */
|
|
typedef struct {
|
|
long long quot;
|
|
long long rem;
|
|
} lldiv_t;
|
|
#endif
|
|
#endif
|
|
|
|
#ifndef NULL
|
|
#define NULL 0
|
|
#endif
|
|
|
|
#define EXIT_FAILURE 1
|
|
#define EXIT_SUCCESS 0
|
|
|
|
#define RAND_MAX 0x7fffffff
|
|
|
|
extern int __mb_cur_max;
|
|
#define MB_CUR_MAX __mb_cur_max
|
|
|
|
__BEGIN_DECLS
|
|
void abort(void) __dead2;
|
|
int abs(int) __pure2;
|
|
int atexit(void (*)(void));
|
|
double atof(const char *);
|
|
int atoi(const char *);
|
|
long atol(const char *);
|
|
void *bsearch(const void *, const void *, size_t,
|
|
size_t, int (*)(const void *, const void *));
|
|
void *calloc(size_t, size_t);
|
|
div_t div(int, int) __pure2;
|
|
void exit(int) __dead2;
|
|
void free(void *);
|
|
char *getenv(const char *);
|
|
long labs(long) __pure2;
|
|
ldiv_t ldiv(long, long) __pure2;
|
|
void *malloc(size_t);
|
|
void qsort(void *, size_t, size_t,
|
|
int (*)(const void *, const void *));
|
|
int rand(void);
|
|
void *realloc(void *, size_t);
|
|
void srand(unsigned);
|
|
double strtod(const char *__restrict, char **__restrict);
|
|
long strtol(const char *__restrict, char **__restrict, int);
|
|
unsigned long
|
|
strtoul(const char *__restrict, char **__restrict, int);
|
|
int system(const char *);
|
|
|
|
int mblen(const char *, size_t);
|
|
size_t mbstowcs(wchar_t *, const char *, size_t);
|
|
int wctomb(char *, wchar_t);
|
|
int mbtowc(wchar_t *, const char *, size_t);
|
|
size_t wcstombs(char *, const wchar_t *, size_t);
|
|
|
|
#if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
|
|
extern const char *_malloc_options;
|
|
extern void (*_malloc_message)(const char *p1, const char *p2, const char *p3, const char *p4);
|
|
|
|
int putenv(const char *);
|
|
int setenv(const char *, const char *, int);
|
|
|
|
double drand48(void);
|
|
double erand48(unsigned short[3]);
|
|
long jrand48(unsigned short[3]);
|
|
void lcong48(unsigned short[7]);
|
|
long lrand48(void);
|
|
long mrand48(void);
|
|
long nrand48(unsigned short[3]);
|
|
unsigned short
|
|
*seed48(unsigned short[3]);
|
|
void srand48(long);
|
|
|
|
void *alloca(size_t); /* built-in for gcc */
|
|
/* getcap(3) functions */
|
|
__uint32_t
|
|
arc4random(void);
|
|
void arc4random_addrandom(unsigned char *dat, int datlen);
|
|
void arc4random_stir(void);
|
|
#ifdef __LONG_LONG_SUPPORTED
|
|
/* LONGLONG */
|
|
long long
|
|
atoll(const char *);
|
|
#endif
|
|
char *getbsize(int *, long *);
|
|
char *cgetcap(char *, const char *, int);
|
|
int cgetclose(void);
|
|
int cgetent(char **, char **, const char *);
|
|
int cgetfirst(char **, char **);
|
|
int cgetmatch(const char *, const char *);
|
|
int cgetnext(char **, char **);
|
|
int cgetnum(char *, const char *, long *);
|
|
int cgetset(const char *);
|
|
int cgetstr(char *, const char *, char **);
|
|
int cgetustr(char *, const char *, char **);
|
|
|
|
int daemon(int, int);
|
|
char *devname(int, int);
|
|
int getloadavg(double [], int);
|
|
__const char *
|
|
getprogname(void);
|
|
|
|
int heapsort(void *, size_t, size_t, int (*)(const void *, const void *));
|
|
char *initstate(unsigned long, char *, long);
|
|
#ifdef __LONG_LONG_SUPPORTED
|
|
/* LONGLONG */
|
|
long long
|
|
llabs(long long) __pure2;
|
|
lldiv_t lldiv(long long, long long) __pure2;
|
|
#endif
|
|
int mergesort(void *, size_t, size_t, int (*)(const void *, const void *));
|
|
int radixsort(const unsigned char **, int, const unsigned char *,
|
|
unsigned);
|
|
int sradixsort(const unsigned char **, int, const unsigned char *,
|
|
unsigned);
|
|
int rand_r(unsigned *);
|
|
long random(void);
|
|
void *reallocf(void *, size_t);
|
|
char *realpath(const char *, char resolved_path[]);
|
|
void setprogname(const char *);
|
|
char *setstate(char *);
|
|
void sranddev(void);
|
|
void srandom(unsigned long);
|
|
void srandomdev(void);
|
|
#ifdef __LONG_LONG_SUPPORTED
|
|
/* LONGLONG */
|
|
long long
|
|
strtoll(const char *__restrict, char **__restrict, int);
|
|
#endif
|
|
__int64_t strtoq(const char *, char **, int);
|
|
#ifdef __LONG_LONG_SUPPORTED
|
|
/* LONGLONG */
|
|
unsigned long long
|
|
strtoull(const char *__restrict, char **__restrict, int);
|
|
#endif
|
|
__uint64_t
|
|
strtouq(const char *, char **, int);
|
|
void unsetenv(const char *);
|
|
#endif /* !_ANSI_SOURCE && !_POSIX_SOURCE */
|
|
__END_DECLS
|
|
|
|
#endif /* !_STDLIB_H_ */
|