1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/* This file is part of GDBM, the GNU data base manager.
Copyright (C) 2011-2024 Free Software Foundation, Inc.
GDBM is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GDBM is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GDBM. If not, see <http://www.gnu.org/licenses/>. */
# include "autoconf.h"
# include "gdbm.h"
# include "gdbmapp.h"
# include "gdbmdefs.h"
void
ealloc_die (void)
{
error ("%s", strerror (ENOMEM));
exit (EXIT_FATAL);
}
void *
emalloc (size_t size)
{
void *p = malloc (size);
if (!p)
ealloc_die ();
return p;
}
void *
erealloc (void *ptr, size_t size)
{
void *newptr = realloc (ptr, size);
if (!newptr)
ealloc_die ();
return newptr;
}
void *
ecalloc (size_t nmemb, size_t size)
{
void *p = calloc (nmemb, size);
if (!p)
ealloc_die ();
return p;
}
void *
ezalloc (size_t size)
{
return ecalloc (1, size);
}
char *
estrdup (const char *str)
{
char *p;
if (!str)
return NULL;
p = emalloc (strlen (str) + 1);
strcpy (p, str);
return p;
}
void *
e2nrealloc (void *p, size_t *pn, size_t s)
{
size_t n = *pn;
char *newp;
if (!p)
{
if (!n)
{
/* The approximate size to use for initial small
allocation requests, when the invoking code
specifies an old size of zero. 64 bytes is
the largest "small" request for the
GNU C library malloc. */
enum { DEFAULT_MXFAST = 64 };
n = DEFAULT_MXFAST / s;
n += !n;
}
}
else if ((size_t) -1 / 3 * 2 / s <= n)
{
ealloc_die ();
}
else
n += (n + 1) / 2;
newp = erealloc (p, n * s);
*pn = n;
return newp;
}
|
