forked from dterweij/ndjbdns
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathalloc.c
88 lines (73 loc) · 2.11 KB
/
alloc.c
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
/*
* alloc.c: This file is part of the `djbdns' project, originally written
* by Dr. D J Bernstein and later released under public-domain since late
* December 2007 (http://cr.yp.to/distributors.html).
*
* Copyright (C) 2009 - 2012 Prasad J Pandit
*
* This program is a free software; you can redistribute it and/or modify
* it under the terms of GNU General Public License as published by Free
* Software Foundation; either version 2 of the license or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* of 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 this program; if not, write to Free Software Foundation, Inc., 51
* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <string.h>
#include <stdlib.h>
#include "byte.h"
#include "alloc.h"
#include "error.h"
#define ALIGNMENT 16 /* XXX: assuming that this alignment is enough */
#define SPACE 2048 /* must be multiple of ALIGNMENT */
typedef union
{
char irrelevant[ALIGNMENT];
double d;
} aligned;
static aligned realspace[SPACE / ALIGNMENT];
#define space ((char *) realspace)
static unsigned int avail = SPACE; /* multiple of ALIGNMENT; 0<=avail<=SPACE */
/*@null@*//*@out@*/
char *
alloc (unsigned int n)
{
char *x = 0;
n = ALIGNMENT + n - (n & (ALIGNMENT - 1)); /* XXX: could overflow */
if (n <= avail)
{
avail -= n;
return space + avail;
}
if (!(x = malloc (n)))
errno = error_nomem;
else
memset (x, 0, n);
return x;
}
void
alloc_free (char *x)
{
if (x >= space)
if (x < space + SPACE)
return; /* XXX: assuming that pointers are flat */
free (x);
}
int
alloc_re (char **x, unsigned int m, unsigned int n)
{
char *y = (char *)0;
y = alloc(n);
if (!y)
return 0;
byte_copy(y, m, *x);
alloc_free(*x);
*x = y;
return 1;
}