1 /*
2 * Copyright (c) 2015 Dmitry V. Levin <ldv@altlinux.org>
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. The name of the author may not be used to endorse or promote products
14 * derived from this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 */
27
28 #include "defs.h"
29
die_out_of_memory(void)30 static void die_out_of_memory(void)
31 {
32 static bool recursed;
33
34 if (recursed)
35 exit(1);
36 recursed = 1;
37
38 error_msg_and_die("Out of memory");
39 }
40
xmalloc(size_t size)41 void *xmalloc(size_t size)
42 {
43 void *p = malloc(size);
44
45 if (!p)
46 die_out_of_memory();
47
48 return p;
49 }
50
xcalloc(size_t nmemb,size_t size)51 void *xcalloc(size_t nmemb, size_t size)
52 {
53 void *p = calloc(nmemb, size);
54
55 if (!p)
56 die_out_of_memory();
57
58 return p;
59 }
60
61 #define HALF_SIZE_T (((size_t) 1) << (sizeof(size_t) * 4))
62
xreallocarray(void * ptr,size_t nmemb,size_t size)63 void *xreallocarray(void *ptr, size_t nmemb, size_t size)
64 {
65 size_t bytes = nmemb * size;
66
67 if ((nmemb | size) >= HALF_SIZE_T &&
68 size && bytes / size != nmemb)
69 die_out_of_memory();
70
71 void *p = realloc(ptr, bytes);
72
73 if (!p)
74 die_out_of_memory();
75
76 return p;
77 }
78
xstrdup(const char * str)79 char *xstrdup(const char *str)
80 {
81 char *p = strdup(str);
82
83 if (!p)
84 die_out_of_memory();
85
86 return p;
87 }
88
xstrndup(const char * str,size_t n)89 char *xstrndup(const char *str, size_t n)
90 {
91 char *p;
92
93 #ifdef HAVE_STRNDUP
94 p = strndup(str, n);
95 #else
96 p = xmalloc(n + 1);
97 #endif
98
99 if (!p)
100 die_out_of_memory();
101
102 #ifndef HAVE_STRNDUP
103 strncpy(p, str, n);
104 p[n] = '\0';
105 #endif
106
107 return p;
108 }
109