src/kingdom.cc

   1 /*
   2  * See kingdom.hh for a brief description of kingdoms.
   3  *
   4  * Copyright (C) 2008 Hermann Walth
   5  *
   6  * This file is part of OpenStranded
   7  *
   8  * OpenStranded is free software; you can redistribute it and/or modify
   9  * it under the terms of the GNU General Public License as published by
  10  * the Free Software Foundation, either version 3 of the License, or
  11  * (at your option) any later version.
  12  *
  13  * OpenStranded is distributed in the hope that it will be useful,
  14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16  * GNU General Public License for more details.
  17  *
  18  * You should have received a copy of the GNU General Public License
  19  * along with OpenStranded. If not, see <http://www.gnu.org/licenses/>.
  20  */
  21
  22 #include "output.hh"
  23 #include "kingdom.hh"
  24 #include "object.hh"
  25 #include "unit.hh"
  26 #include "item.hh"
  27 #include "defparse/defparse.hh"
  28
  29 #include <iostream>
  30
  31 #ifdef unix
  32         #include <sys/types.h>
  33         #include <sys/stat.h>
  34         #include <dirent.h>
  35         #include <fcntl.h>
  36         #include <string.h>
  37 #else
  38         #include <windows.h>
  39 #endif
  40
  41
  42 std::map <ID, Kingdom*> Kingdom::kingdomList;
  43
  44
  45 Kingdom::Kingdom(const char *name):
  46         name(std::string(name))
  47 {
  48         highestEntityID = 0;
  49 }
  50
  51
  52 Kingdom::~Kingdom ()
  53 {
  54         std::map <ID, Type*>::iterator type;
  55         for (type = typeList.begin (); type != typeList.end (); type++)
  56                 destroyType (type->second);
  57
  58         std::map <ID, Entity*>::iterator entity;
  59         for (entity = entityList.begin (); entity != entityList.end (); entity++)
  60                 destroyEntity (entity->second);
  61 }
  62
  63
  64 Entity*
  65 Kingdom::getEntity (ID index)
  66 {
  67         if (entityExists (index))
  68                 return entityList[index];
  69         else
  70                 return NULL;
  71 }
  72
  73
  74 Type*
  75 Kingdom::getType (ID index)
  76 {
  77         if (typeExists (index))
  78                 return typeList[index];
  79         else
  80                 return NULL;
  81 }
  82
  83
  84 bool
  85 Kingdom::entityExists (ID entity)
  86 {
  87         if (entityList.find (entity) != entityList.end ())
  88                 return true;
  89         else
  90                 return false;
  91 }
  92
  93
  94 bool
  95 Kingdom::typeExists (ID type)
  96 {
  97         if (typeList.find (type) != typeList.end ())
  98                 return true;
  99         else
 100                 return false;
 101 }
 102
 103
 104 Entity*
 105 Kingdom::appendEntity (ID type)
 106 {
 107         return entityList[++highestEntityID] = createEntity (type);
 108 }
 109
 110
 111 Entity*
 112 Kingdom::insertEntity (ID type, ID entity)
 113 {
 114         if (!entityExists (entity))
 115                 entityList[entity] = createEntity (type);
 116
 117         if (entity > highestEntityID)
 118                 highestEntityID = entity;
 119
 120         return entityList[entity];
 121 }
 122
 123
 124 Type*
 125 Kingdom::insertType (const char* name, ID type)
 126 {
 127         if (!typeExists (type))
 128                 typeList[type] = createType (name);
 129         return typeList[type];
 130 }
 131
 132
 133 Type*
 134 Kingdom::insertType (ID type)
 135 {
 136         return this->insertType ("", type);
 137 }
 138
 139
 140 Entity*
 141 Kingdom::createEntity (ID type)
 142 {
 143         return new Entity (type);
 144 }
 145
 146
 147 void
 148 Kingdom::destroyEntity (Entity *entity)
 149 {
 150         delete entity;
 151 }
 152
 153
 154 Type*
 155 Kingdom::createType (const char* name)
 156 {
 157         return new Type (name);
 158 }
 159
 160
 161 void
 162 Kingdom::destroyType (Type *type)
 163 {
 164         delete type;
 165 }
 166
 167 /*
 168  * Functions for the kingdomList
 169  * TODO: In terms of beauty and modularity,
 170  * these functions should be outsourced into another file
 171  */
 172 void
 173 Kingdom::initKingdomList (std::string mod)
 174 {
 175         kingdomList[S2_OBJECT] = new ObjectKingdom;
 176         kingdomList[S2_UNIT] = new UnitKingdom;
 177         kingdomList[S2_ITEM] = new ItemKingdom;
 178
 179         // Load entity types
 180         parseEntityTypes(mod, "object");
 181 }
 182
 183
 184 void
 185 Kingdom::uninitKingdomList ()
 186 {
 187         std::map <ID, Kingdom*>::iterator iter;
 188         for (iter = kingdomList.begin (); iter != kingdomList.end (); iter++)
 189                 delete (iter->second);
 190 }
 191
 192 void
 193 Kingdom::parseEntityTypes(std::string mod, std::string name)
 194 {
 195         std::string sysdir = std::string("mods/") + mod + "/sys/";
 196         // Search for entity files within sys/
 197         #ifdef __unix__
 198         DIR *dir = opendir(sysdir.c_str());
 199         if (!dir)
 200         {
 201                 std::cerr << "Could not read sys/.\n";
 202                 std::cerr << sysdir << "\n";
 203                 return;
 204         }
 205
 206         while (1)
 207         {
 208                 struct dirent *dirent = readdir(dir);
 209                 if (!dirent) break;
 210                 if (strcmp(dirent->d_name, "..") && strcmp(dirent->d_name, "."))
 211                 {
 212                         std::string filename = sysdir + dirent->d_name;
 213                         int file = open(filename.c_str(), O_RDONLY);
 214                         if (!file)
 215                         {
 216                                 Out::msg.printf("Could not open file \"%s\".\n", filename.c_str());
 217                                 continue;
 218                         }
 219                         struct stat stat;
 220                         fstat(file, &stat);
 221                         close(file);
 222
 223                         if (stat.st_mode & S_IFREG)
 224                         {
 225                                 if (!strncmp(dirent->d_name, name.c_str(), strlen(name.c_str()))
 226                                         && !strcmp(dirent->d_name + strlen(dirent->d_name) - 4, ".inf"))
 227                                 {
 228                                         Out::msg.printf("Parsing %s\n", filename.c_str());
 229                                         def::object::parse(filename.c_str());
 230                                 }
 231                         }
 232                 }
 233         }
 234         closedir(dir);
 235         #else
 236         std::string pattern = sysdir + name + "s_*.inf";
 237         WIN32_FIND_DATA finddata;
 238         HANDLE findhandle = FindFirstFile(pattern.c_str(), &finddata);
 239         if (findhandle != INVALID_HANDLE_VALUE)
 240         {
 241                 def::object::parse(finddata.cFileName);
 242                 while (FindNextFile(findhandle, &finddata))
 243                 {
 244                         def::object::parse(finddata.cFileName);
 245                 }
 246                 FindClose(findhandle);
 247         }
 248         #endif
 249 }