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
|
/**
*
* ***** BEGIN GPL LICENSE BLOCK *****
*
* This program 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 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 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 this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2008 by Blender Foundation.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): Joseph Eagar
*
* ***** END GPL LICENSE BLOCK *****
*/
/*
Simple, fast memory allocator that uses many BLI_mempools for allocation.
this is meant to be used by lots of relatively small objects.
this is a temporary and inperfect fix for performance issues caused
by vgroups. it needs to be replaced with something better, preferably
integrated into guardedalloc.
*/
#include "MEM_guardedalloc.h"
#include "BKE_utildefines.h"
#include "BLI_blenlib.h"
#include "BLI_linklist.h"
#include "DNA_listBase.h"
#include "BLI_mempool.h"
#include <string.h>
static BLI_mempool **pools;
static int totpool = 0;
ListBase active_mem = {NULL, NULL};
static int celltotblock = 0;
#define MEMIDCHECK ('a' | ('b' << 4) | ('c' << 8) | ('d' << 12))
typedef struct MemHeader {
struct MemHeader *next, *prev;
int size;
char *tag;
int idcheck;
} MemHeader;
void *BLI_cellalloc_malloc(long size, char *tag)
{
MemHeader *memh;
int slot = size + sizeof(MemHeader);
if (!slot)
return NULL;
/*stupid optimization trick.
round up to nearest 16 bytes boundary.
this is to reduce the number of potential
pools. hopefully it'll help.*/
slot += 16 - (slot & 15);
if (slot >= totpool) {
void *tmp;
tmp = calloc(1, sizeof(void*)*(slot+1));
if (pools) {
memcpy(tmp, pools, totpool*sizeof(void*));
}
pools = tmp;
totpool = slot+1;
}
if (!pools[slot]) {
pools[slot] = BLI_mempool_create(slot, 1, 128);
}
memh = BLI_mempool_alloc(pools[slot]);
memh->size = size;
memh->idcheck = MEMIDCHECK;
memh->tag = tag;
BLI_addtail(&active_mem, memh);
celltotblock++;
return memh + 1;
}
void *BLI_cellalloc_calloc(long size, char *tag)
{
void *mem = BLI_cellalloc_malloc(size, tag);
BMEMSET(mem, 0, size);
return mem;
}
void BLI_cellalloc_free(void *mem)
{
MemHeader *memh = mem;
int slot;
if (!memh)
return;
memh--;
if (memh->idcheck != MEMIDCHECK) {
printf("Error in BLI_cellalloc: attempt to free invalid block.\n");
return;
}
slot = memh->size + sizeof(MemHeader);
slot += 16 - (slot & 15);
if (memh->size > 0 && slot < totpool) {
BLI_remlink(&active_mem, memh);
BLI_mempool_free(pools[slot], memh);
celltotblock--;
} else {
printf("Error in BLI_cellalloc: attempt to free corrupted block.\n");
}
}
void BLI_cellalloc_printleaks(void)
{
MemHeader *memh;
if (!active_mem.first) return;
for (memh=active_mem.first; memh; memh=memh->next) {
printf("%s %d %p\n", memh->tag, memh->size, memh+1);
}
}
int BLI_cellalloc_get_totblock(void)
{
return celltotblock;
}
void BLI_cellalloc_destroy(void)
{
int i;
for (i=0; i<totpool; i++) {
if (pools[i]) {
BLI_mempool_destroy(pools[i]);
pools[i] = NULL;
}
}
}
|
