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
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Copyright (c) 1986 by Sun Microsystems, Inc.
*/
/*
* file: mallint.h
* description:
*
* Definitions for malloc.c and friends (realloc.c, memalign.c)
*
* The node header structure. Header info never overlaps with user
* data space, in order to accommodate the following atrocity:
* free(p);
* realloc(p, newsize);
* ... which was historically used to obtain storage compaction as
* a side effect of the realloc() call, when the block referenced
* by p was coalesced with another free block by the call to free().
*
* To reduce storage consumption, a header block is associated with
* free blocks only, not allocated blocks.
* When a free block is allocated, its header block is put on
* a free header block list.
*
* This creates a header space and a free block space.
* The left pointer of a header blocks is used to chain free header
* blocks together. New header blocks are allocated in chunks of
* NFREE_HDRS.
*/
#include <malloc.h>
typedef enum {false,true} bool;
typedef struct freehdr *Freehdr;
typedef struct dblk *Dblk;
typedef unsigned int uint;
/*
* Description of a header for a free block
* Only free blocks have such headers.
*/
struct freehdr {
Freehdr left; /* Left tree pointer */
Freehdr right; /* Right tree pointer */
Dblk block; /* Ptr to the data block */
uint size;
};
#define NIL ((Freehdr) 0)
#define NFREE_HDRS 512 /* Get this many headers at a time */
#define SMALLEST_BLK sizeof(struct dblk) /* Size of smallest block */
#define NULL 0
/*
* Description of a data block.
* A data block consists of a length word, possibly followed by
* a filler word for alignment, followed by the user's data.
* To back up from the user's data to the length word, use
* (address of data) - ALIGNSIZ;
*/
#ifdef sparc
#define ALIGNSIZ sizeof(double)
struct dblk {
uint size; /* Size of the block */
uint filler; /* filler, for double alignment */
char data[ALIGNSIZ]; /* Addr returned to the caller */
};
#endif
#ifdef mc68000
#define ALIGNSIZ sizeof(uint)
struct dblk {
uint size; /* Size of the block */
char data[ALIGNSIZ]; /* Addr returned to the caller */
};
#endif
/*
* weight(x) is the size of a block, in bytes; or 0 if and only if x
* is a null pointer. Note that malloc() and free() should be
* prepared to deal with things like zero-length blocks, which
* can be introduced by errant programs.
*/
#define weight(x) ((x) == NIL? 0: (x->size))
#define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
#define nextblk(p, size) ((Dblk) ((char *) (p) + (size)))
#define max(a, b) ((a) < (b)? (b): (a))
#define min(a, b) ((a) < (b)? (a): (b))
#define heapsize() (_ubound - _lbound)
#define misaligned(p) ((unsigned)(p)&3)
extern Freehdr _root;
extern char *_lbound, *_ubound;
extern int malloc_debug();
extern struct mallinfo __mallinfo;
|
