-
Notifications
You must be signed in to change notification settings - Fork 190
Expand file tree
/
Copy pathfe_memutils.c
More file actions
364 lines (315 loc) · 6.68 KB
/
Copy pathfe_memutils.c
File metadata and controls
364 lines (315 loc) · 6.68 KB
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
/*-------------------------------------------------------------------------
*
* fe_memutils.c
* memory management support for frontend code
*
* Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
*
* IDENTIFICATION
* src/common/fe_memutils.c
*
*-------------------------------------------------------------------------
*/
#ifndef FRONTEND
#error "This file is not expected to be compiled for backend code"
#endif
#include "postgres_fe.h"
#include "common/int.h"
static pg_noinline void add_size_error(Size s1, Size s2) pg_attribute_noreturn();
static pg_noinline void mul_size_error(Size s1, Size s2) pg_attribute_noreturn();
static inline void *
pg_malloc_internal(size_t size, int flags)
{
void *tmp;
/* Avoid unportable behavior of malloc(0) */
if (size == 0)
size = 1;
tmp = malloc(size);
if (tmp == NULL)
{
if ((flags & MCXT_ALLOC_NO_OOM) == 0)
{
fprintf(stderr, _("out of memory\n"));
exit(EXIT_FAILURE);
}
return NULL;
}
if ((flags & MCXT_ALLOC_ZERO) != 0)
MemSet(tmp, 0, size);
return tmp;
}
void *
pg_malloc(size_t size)
{
return pg_malloc_internal(size, 0);
}
void *
pg_malloc0(size_t size)
{
return pg_malloc_internal(size, MCXT_ALLOC_ZERO);
}
void *
pg_malloc_extended(size_t size, int flags)
{
return pg_malloc_internal(size, flags);
}
void *
pg_realloc(void *ptr, size_t size)
{
void *tmp;
/* Avoid unportable behavior of realloc(NULL, 0) */
if (ptr == NULL && size == 0)
size = 1;
tmp = realloc(ptr, size);
if (!tmp)
{
fprintf(stderr, _("out of memory\n"));
exit(EXIT_FAILURE);
}
return tmp;
}
/*
* "Safe" wrapper around strdup().
*/
char *
pg_strdup(const char *in)
{
char *tmp;
if (!in)
{
fprintf(stderr,
_("cannot duplicate null pointer (internal error)\n"));
exit(EXIT_FAILURE);
}
tmp = strdup(in);
if (!tmp)
{
fprintf(stderr, _("out of memory\n"));
exit(EXIT_FAILURE);
}
return tmp;
}
void
pg_free(void *ptr)
{
if (ptr != NULL)
free(ptr);
}
/*
* Frontend emulation of backend memory management functions. Useful for
* programs that compile backend files.
*/
void *
palloc(Size size)
{
return pg_malloc_internal(size, 0);
}
void *
palloc0(Size size)
{
return pg_malloc_internal(size, MCXT_ALLOC_ZERO);
}
void *
palloc_extended(Size size, int flags)
{
return pg_malloc_internal(size, flags);
}
void
pfree(void *pointer)
{
pg_free(pointer);
}
char *
pstrdup(const char *in)
{
return pg_strdup(in);
}
char *
pnstrdup(const char *in, Size size)
{
char *tmp;
int len;
if (!in)
{
fprintf(stderr,
_("cannot duplicate null pointer (internal error)\n"));
exit(EXIT_FAILURE);
}
len = strnlen(in, size);
tmp = malloc(len + 1);
if (tmp == NULL)
{
fprintf(stderr, _("out of memory\n"));
exit(EXIT_FAILURE);
}
memcpy(tmp, in, len);
tmp[len] = '\0';
return tmp;
}
void *
repalloc(void *pointer, Size size)
{
return pg_realloc(pointer, size);
}
/*
* Support for safe calculation of memory request sizes
*
* These functions perform the requested calculation, but throw error if the
* result overflows.
*
* An important property of these functions is that if an argument was a
* negative signed int before promotion (implying overflow in calculating it)
* we will detect that as an error. That happens because we reject results
* larger than SIZE_MAX / 2. In the backend we rely on later checks to do
* that, but in frontend we must do it here.
*/
Size
add_size(Size s1, Size s2)
{
Size result;
if (unlikely(pg_add_size_overflow(s1, s2, &result) ||
result > (SIZE_MAX / 2)))
add_size_error(s1, s2);
return result;
}
static pg_noinline void
add_size_error(Size s1, Size s2)
{
fprintf(stderr, _("invalid memory allocation request size %zu + %zu\n"),
s1, s2);
exit(EXIT_FAILURE);
}
Size
mul_size(Size s1, Size s2)
{
Size result;
if (unlikely(pg_mul_size_overflow(s1, s2, &result) ||
result > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return result;
}
static pg_noinline void
mul_size_error(Size s1, Size s2)
{
fprintf(stderr, _("invalid memory allocation request size %zu * %zu\n"),
s1, s2);
exit(EXIT_FAILURE);
}
/*
* pg_malloc_mul
* Equivalent to pg_malloc(mul_size(s1, s2)).
*/
void *
pg_malloc_mul(Size s1, Size s2)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return pg_malloc(req);
}
/*
* pg_malloc0_mul
* Equivalent to pg_malloc0(mul_size(s1, s2)).
*
* This is comparable to standard calloc's behavior.
*/
void *
pg_malloc0_mul(Size s1, Size s2)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return pg_malloc0(req);
}
/*
* pg_malloc_mul_extended
* Equivalent to pg_malloc_extended(mul_size(s1, s2), flags).
*/
void *
pg_malloc_mul_extended(Size s1, Size s2, int flags)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return pg_malloc_extended(req, flags);
}
/*
* pg_realloc_mul
* Equivalent to pg_realloc(p, mul_size(s1, s2)).
*/
void *
pg_realloc_mul(void *p, Size s1, Size s2)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return pg_realloc(p, req);
}
/*
* palloc_mul
* Equivalent to palloc(mul_size(s1, s2)).
*/
void *
palloc_mul(Size s1, Size s2)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return palloc(req);
}
/*
* palloc0_mul
* Equivalent to palloc0(mul_size(s1, s2)).
*
* This is comparable to standard calloc's behavior.
*/
void *
palloc0_mul(Size s1, Size s2)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return palloc0(req);
}
/*
* palloc_mul_extended
* Equivalent to palloc_extended(mul_size(s1, s2), flags).
*/
void *
palloc_mul_extended(Size s1, Size s2, int flags)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return palloc_extended(req, flags);
}
/*
* repalloc_mul
* Equivalent to repalloc(p, mul_size(s1, s2)).
*/
void *
repalloc_mul(void *p, Size s1, Size s2)
{
/* inline mul_size() for efficiency */
Size req;
if (unlikely(pg_mul_size_overflow(s1, s2, &req) ||
req > (SIZE_MAX / 2)))
mul_size_error(s1, s2);
return repalloc(p, req);
}