#include "koopatlas/mapdata.h" // HELPER FUNCTIONS dKPPath_s *dKPNode_s::getOppositeExitTo(dKPPath_s *path) { for (int i = 0; i < 4; i++) { dKPPath_s *check = exits[i]; if (check != 0 && check != path) return check; } return 0; } bool dKPNode_s::isUnlocked() { for (int i = 0; i < 4; i++) if (exits[i]) if (exits[i]->isAvailable) return true; return false; } void dKPNode_s::setupNodeExtra() { int world = this->levelNumber[0]; int level = this->levelNumber[1]; SaveBlock *save = GetSaveFile()->GetBlock(-1); u32 conds = save->GetLevelCondition(world-1, level-1); bool isUnlocked = this->isUnlocked(); bool exitComplete = false; bool secretComplete = false; if (conds & 0x10) exitComplete = true; if (conds & 0x20) secretComplete = true; const char *colour; OSReport("Level %d-%d, isUnlocked: %d, exitComplete: %d", world, level, isUnlocked, exitComplete); // Is it unlocked? if (!isUnlocked) colour = "g3d/black.brres"; // Is it a one time level? else if ((level >= 30) && (level <= 37)) { // Is it complete? if (exitComplete) colour = "g3d/yellow.brres"; // It's still available else colour = "g3d/green.brres"; } // Is it a shop? else if (level == 41) colour = "g3d/shop.brres"; // Is it complete? else if ((exitComplete) || (secretComplete)) { // Does it have two exits? if ((this->hasSecret) && (!exitComplete) && (!secretComplete)) colour = "g3d/blue.brres"; // Does it have one exit? else if ((!this->hasSecret) && (exitComplete)) colour = "g3d/blue.brres"; // All exits are complete else colour = "g3d/purple.brres"; } // Not complete after all else colour = "g3d/red.brres"; // model time this->extra->mallocator.link(-1, GameHeaps[0], 0, 0x20); nw4r::g3d::ResFile rg(getResource("cobCourse", colour)); this->extra->model.setup(rg.GetResMdl("cobCourse"), &this->extra->mallocator, 0x224, 1, 0); this->extra->matrix.identity(); SetupTextures_MapObj(&this->extra->model, 0); this->extra->mallocator.unlink(); } int dKPLayer_s::findNodeID(dKPNode_s *node) { for (int i = 0; i < nodeCount; i++) if (nodes[i] == node) return i; return -1; } dKPMapData_c::dKPMapData_c() { data = 0; fixedUp = false; levelNodeExtraArray = 0; tilesetLoaders = 0; tilesetsLoaded = false; } dKPMapData_c::~dKPMapData_c() { if (levelNodeExtraArray) delete[] levelNodeExtraArray; unloadTilesets(); m_fileLoader.unload(); } bool dKPMapData_c::load(const char *filename) { data = (dKPMapFile_s*)m_fileLoader.load(filename, 0, mHeap::archiveHeap); if (data == 0) return false; if (!fixedUp) fixup(); bool didLoadTilesets = loadTilesets(); bool didLoadBG = (bgLoader.load("/Maps/Water.brres") != 0); return didLoadTilesets && didLoadBG; } bool dKPMapData_c::loadTilesets() { if (tilesetsLoaded) return true; if (tilesetLoaders == 0) tilesetLoaders = new dDvdLoader_c[data->tilesetCount]; bool result = true; for (int i = 0; i < data->tilesetCount; i++) { char *filename = ((char*)data) + (data->tilesets[i].dummy[3] - 0x10000000); result &= (tilesetLoaders[i].load(filename) != 0); } if (result) { tilesetsLoaded = true; for (int i = 0; i < data->tilesetCount; i++) { data->tilesets[i].dummy[3] = (((u32)tilesetLoaders[i].buffer & ~0xC0000000) >> 5); } } return tilesetsLoaded; } void dKPMapData_c::unloadTilesets() { if (tilesetLoaders != 0) { for (int i = 0; i < data->tilesetCount; i++) { tilesetLoaders[i].unload(); } delete[] tilesetLoaders; } bgLoader.unload(); } void dKPMapData_c::fixup() { OSReport("Setting up Nodes"); fixedUp = true; fixRef(data->layers); fixRef(data->tilesets); for (int iLayer = 0; iLayer < data->layerCount; iLayer++) { dKPLayer_s *layer = fixRef(data->layers[iLayer]); switch (layer->type) { case dKPLayer_s::OBJECTS: fixRef(layer->tileset); break; case dKPLayer_s::DOODADS: for (int iDood = 0; iDood < layer->doodadCount; iDood++) { dKPDoodad_s *doodad = fixRef(layer->doodads[iDood]); fixRef(doodad->texObj); fixTexObjSafe(doodad->texObj); } break; case dKPLayer_s::PATHS: pathLayer = layer; fixRef(layer->paths); fixRef(layer->nodes); for (int iPath = 0; iPath < layer->pathCount; iPath++) { dKPPath_s *path = fixRef(layer->paths[iPath]); fixRef(path->start); fixRef(path->end); fixRef(path->tileLayer); fixRef(path->doodadLayer); } for (int iNode = 0; iNode < layer->nodeCount; iNode++) { dKPNode_s *node = fixRef(layer->nodes[iNode]); for (int i = 0; i < 4; i++) fixRef(node->exits[i]); fixRef(node->tileLayer); fixRef(node->doodadLayer); if (node->type == dKPNode_s::CHANGE) fixRef(node->destMap); } break; } } // before we finish here, create the Node Extra classes // before the first off, do the unlocking. SaveBlock *save = GetSaveFile()->GetBlock(-1); for (int i = 0; i < pathLayer->pathCount; i++) { dKPPath_s *path = pathLayer->paths[i]; if (path->unlockType > 0) { u32 conds = save->GetLevelCondition(path->unlockLevelNumber[0] - 1, path->unlockLevelNumber[1] - 1); if (path->unlockType == 1 && (conds & COND_NORMAL)) path->isAvailable = true; else if (path->unlockType == 2 && (conds & COND_SECRET)) path->isAvailable = true; else path->isAvailable = false; } } // first off, count how many we need... int count = 0; for (int nodeIdx = 0; nodeIdx < pathLayer->nodeCount; nodeIdx++) { if (pathLayer->nodes[nodeIdx]->type == dKPNode_s::LEVEL) count++; } levelNodeExtraArray = new dKPNodeExtra_c[count]; int extraIdx = 0; for (int nodeIdx = 0; nodeIdx < pathLayer->nodeCount; nodeIdx++) { if (pathLayer->nodes[nodeIdx]->type == dKPNode_s::LEVEL) { pathLayer->nodes[nodeIdx]->extra = &levelNodeExtraArray[extraIdx]; pathLayer->nodes[nodeIdx]->setupNodeExtra(); extraIdx++; } } } /****************************************************************************** * Generic Layer ******************************************************************************/ /****************************************************************************** * Tile Layer ******************************************************************************/ /****************************************************************************** * Doodad Layer ******************************************************************************/ /****************************************************************************** * Path Layer ******************************************************************************/