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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
|
#ifndef __KOOPATLAS_MAPDATA_H
#define __KOOPATLAS_MAPDATA_H
#include <game.h>
#include <g3dhax.h>
// forward declarations
struct dKPLayer_s;
class dKPNodeExtra_c;
/******************************************************************************
* Doodads
******************************************************************************/
struct dKPDoodad_s {
struct animation_s {
enum LoopTypes {
CONTIGUOUS, LOOP, REVERSE_LOOP
};
enum CurveTypes {
LINEAR, SIN, COS
};
enum AnimTypes {
X_POS, Y_POS, ANGLE, X_SCALE, Y_SCALE, OPACITY
};
LoopTypes loop;
CurveTypes curve;
int frameCount;
AnimTypes type;
int start, end;
int delay, delayOffset;
u32 baseTick;
bool isReversed;
};
float x, y;
float width, height;
float angle;
GXTexObj *texObj;
int animationCount;
animation_s animations[1]; // variable size
};
/******************************************************************************
* Paths
******************************************************************************/
struct dKPPath_s;
struct dKPNode_s {
enum NodeTypes {
PASS_THROUGH, STOP, LEVEL, CHANGE
};
short x, y;
union {
dKPPath_s *exits[4];
struct {
dKPPath_s *leftExit;
dKPPath_s *rightExit;
dKPPath_s *upExit;
dKPPath_s *downExit;
};
};
dKPLayer_s *tileLayer, *doodadLayer;
NodeTypes type;
bool isNew;
dKPNodeExtra_c *extra;
// The union is placed at the very end so we can leave out padding in the
// kpbin
union {
struct { u8 levelNumber[2]; bool hasSecret; };
struct { const char *destMap; u8 thisID, foreignID, transition, _; };
};
dKPPath_s *getAnyExit() {
for (int i = 0; i < 4; i++)
if (exits[i])
return exits[i];
return 0;
}
bool isUnlocked();
void setupNodeExtra();
dKPPath_s *getOppositeExitTo(dKPPath_s *path, bool mustBeAvailable=false);
dKPPath_s *getOppositeAvailableExitTo(dKPPath_s *path) {
return getOppositeExitTo(path, true);
}
int getExitCount(bool mustBeAvailable=false);
int getAvailableExitCount() {
return getExitCount(true);
}
void setLayerAlpha(u8 alpha);
};
struct dKPPath_s {
enum Availability {
NOT_AVAILABLE = 0,
AVAILABLE = 1,
NEWLY_AVAILABLE = 2,
ALWAYS_AVAILABLE = 3
};
dKPNode_s *start, *end;
dKPLayer_s *tileLayer, *doodadLayer;
u8 isAvailable; // computed on-the-fly - default from Koopatlas is NOT or ALWAYS
u8 isSecret;
u8 _padding[2];
float speed;
int animation;
void setLayerAlpha(u8 alpha);
};
/******************************************************************************
* Tying It All Together
******************************************************************************/
struct dKPLayer_s {
enum LayerTypes {
OBJECTS, DOODADS, PATHS
};
LayerTypes type;
u8 alpha;
u8 _padding[3];
typedef u16 sector_s[16][16];
union {
struct {
GXTexObj *tileset;
union {
int sectorBounds[4];
struct {
int sectorLeft;
int sectorTop;
int sectorRight;
int sectorBottom;
};
};
union {
int bounds[4];
struct {
int left;
int top;
int right;
int bottom;
};
};
u16 indices[1]; // variable size
};
struct {
int doodadCount;
dKPDoodad_s *doodads[1]; // variable size
};
struct {
int nodeCount;
dKPNode_s **nodes;
int pathCount;
dKPPath_s **paths;
};
};
int findNodeID(dKPNode_s *node);
};
struct dKPMapFile_s {
u32 magic;
int version;
int layerCount;
dKPLayer_s **layers;
int tilesetCount;
GXTexObj *tilesets;
u8 *unlockData;
dKPLayer_s::sector_s *sectors;
const char *backgroundName;
};
class dKPMapData_c {
private:
dDvdLoader_c m_fileLoader;
template <typename T>
inline T* fixRef(T*& indexAsPtr) {
unsigned int index = (unsigned int)indexAsPtr;
if (index == 0xFFFFFFFF || index == 0)
indexAsPtr = 0;
else
indexAsPtr = (T*)(((char*)data) + index);
return indexAsPtr;
}
template <typename T>
inline T* fixRefSafe(T*& indexAsPtr) {
unsigned int index = (unsigned int)indexAsPtr;
if (index == 0xFFFFFFFF || index == 0)
indexAsPtr = 0;
else if (index < 0x80000000)
indexAsPtr = (T*)(((char*)data) + index);
return indexAsPtr;
}
inline void fixTexObjSafe(GXTexObj *obj) {
if (obj->dummy[3] >= 0x10000000) {
obj->dummy[3] = (((u32)data) & 0x7FFFFFFF) + (obj->dummy[3] - 0x10000000);
obj->dummy[3] >>= 5;
}
}
bool fixedUp;
bool tilesetsLoaded;
void fixup();
bool loadTilesets();
void unloadTilesets();
public:
dDvdLoader_c *tilesetLoaders;
dKPMapFile_s *data;
dKPLayer_s *pathLayer;
dDvdLoader_c bgLoader;
dKPNodeExtra_c *levelNodeExtraArray;
dKPMapData_c();
bool load(const char *filename);
~dKPMapData_c();
};
// Currently only available for LEVEL nodes
class dKPNodeExtra_c {
public:
mHeapAllocator_c mallocator;
mMtx matrix;
m3d::mdl_c model;
};
#endif
|