blob: fe1e8cafb4731a90a9bfb62ce42fdf39df522d5d (
plain)
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
|
#include "3dc.h"
#include "mslhand.h"
#if PSX
#include "psx_inc.h"
#endif
#define UseLocalAssert 1
#include "ourasert.h"
extern SHAPEHEADER * mainshapelist[];
static int begins[ MSLS_MAXSECTIONS ];
static int ends[ MSLS_MAXSECTIONS ];
static int autodelete[ maxobjects ];
#define MSS_FREE (-1)
static void EnsureInitialized(void)
{
static int initialized = 0;
if (!initialized)
{
int i;
initialized = 1;
for (i=0; i<MSLS_MAXSECTIONS; ++i)
{
begins[i]=MSS_FREE;
ends[i]=MSS_FREE;
}
}
}
int GetNextMSLEntry(MSL_SECTION sect, unsigned int num_shapes, int auto_delete)
{
int i, blockstart, maxend = maxobjects;
/* I assume that the size of the global array 'mainshapelist' will be 'maxobjects' */
EnsureInitialized();
for (i=sect+1; i<MSLS_MAXSECTIONS; ++i)
{
if (MSS_FREE != begins[i])
{
maxend = begins[i];
break;
}
}
for (i=sect-1; MSS_FREE == begins[sect]; --i)
{
ends[sect] = begins[sect] = i>=0 ? ends[i] : 0;
}
blockstart = ends[sect];
/* can use a local assert here to fail on a mainshapelist overflow, otherwise return error code */
LOCALASSERT(ends[sect] + num_shapes <= maxend);
if (ends[sect] + num_shapes > maxend ) return MSL_OVERFLOW;
ends[sect] += num_shapes;
for (i=blockstart; i<ends[sect]; ++i)
{
mainshapelist[i] = 0;
autodelete[i] = auto_delete;
}
return blockstart;
}
void FlushMSLSection(MSL_SECTION sect)
{
#if StandardShapeLanguage
int i;
EnsureInitialized();
if (MSS_FREE == begins[sect] || MSS_FREE == ends[sect]) return;
for (i=begins[sect]; i<ends[sect]; ++i)
{
if (autodelete[i] && mainshapelist[i])
{
SHAPEHEADER * shp = mainshapelist[i];
int max_num_texs = 0;
int i;
if (shp->points)
{
if (*shp->points) free(*shp->points);
free(shp->points);
}
if (shp->sh_normals)
{
if (*shp->sh_normals) free(*shp->sh_normals);
free(shp->sh_normals);
}
if (shp->sh_vnormals)
{
if (*shp->sh_vnormals) free(*shp->sh_vnormals);
free(shp->sh_vnormals);
}
if (shp->sh_extraitemdata)
free(shp->sh_extraitemdata);
/* the items are allocated in one big bunch
// 9 int's per item (to make bsp simple)
// this should be changed if it is to be done
// a different way
*/
if (shp->items)
{
for (i=0; i<shp->numitems; i++)
{
if (shp->items[i][0] == 5 || shp->items[i][0] == 6)
{
int UVIndex = (shp->items[i][3] &0xffff0000) >> 16;
max_num_texs = max (max_num_texs, shp->items[i][3] &0x7fff);
if(shp->items[i][2]& iflag_txanim)
{
int j;
TXANIMHEADER** thlist=(TXANIMHEADER**)shp->sh_textures[UVIndex];
for(j=1;thlist[j]!=0;j++)
{
int k;
TXANIMHEADER* th=thlist[j];
for(k=0;k<th->txa_numframes;k++)
{
free(th->txa_framedata[k].txf_uvdata);
}
free (th->txa_framedata);
free (th);
}
free (thlist);
shp->sh_textures[UVIndex]=0;
}
else
{
free(shp->sh_textures[UVIndex]);
}
}
}
free (*shp->items);
free (shp->items);
}
if (shp->sh_textures)
{
free (shp->sh_textures);
}
if (shp->sh_localtextures)
{
for (i=0; i<(max_num_texs+1); i++)
{
free (shp->sh_localtextures[i]);
}
free (shp->sh_localtextures);
}
if (shp->sh_instruction)
free(shp->sh_instruction);
free(shp);
}
mainshapelist[i]=0;
autodelete[i]=0;
}
begins[sect]=MSS_FREE;
ends[sect]=MSS_FREE;
#else
printf("\nDo NOT call this function!\n");
//GLOBALASSERT(1==0);
#endif
}
|
