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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "allfiles.h"
namespace Sludge {
void *allKnownMem[3000];
int allKnownNum = 0;
void outputKnownMem() {
FILE *debu = fopen("debuTURN.txt", "at");
fprintf(debu, "%i lumps:", allKnownNum);
for (int i = 0; i < allKnownNum; i ++) {
fprintf(debu, " %p", allKnownMem[i]);
}
fprintf(debu, "\n");
fclose(debu);
}
void adding(void *mem) {
allKnownMem[allKnownNum] = mem;
allKnownNum ++;
outputKnownMem();
if (allKnownNum == 3000) {
//db ("Error! Array too full!");
exit(1);
}
}
void deleting(void *mem) {
allKnownNum --;
for (int i = 0; i <= allKnownNum; i ++) {
if (allKnownMem[i] == mem) {
allKnownMem[i] = allKnownMem[allKnownNum];
outputKnownMem();
return;
}
}
//db ("Error! Deleted a block which hasn't been allocated!");
exit(1);
}
} // End of namespace Sludge
|
