| [1705] | 1 | /* | 
|---|
 | 2 |  *   ORXONOX - the hottest 3D action shooter ever to exist | 
|---|
 | 3 |  *                    > www.orxonox.net < | 
|---|
 | 4 |  * | 
|---|
 | 5 |  * | 
|---|
 | 6 |  *   License notice: | 
|---|
 | 7 |  * | 
|---|
 | 8 |  *   This program is free software; you can redistribute it and/or | 
|---|
 | 9 |  *   modify it under the terms of the GNU General Public License | 
|---|
 | 10 |  *   as published by the Free Software Foundation; either version 2 | 
|---|
 | 11 |  *   of the License, or (at your option) any later version. | 
|---|
 | 12 |  * | 
|---|
 | 13 |  *   This program 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 this program; if not, write to the Free Software | 
|---|
 | 20 |  *   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA. | 
|---|
 | 21 |  * | 
|---|
 | 22 |  *   Author: | 
|---|
 | 23 |  *      Oliver Scheuss, (C) 2007 | 
|---|
 | 24 |  *   Co-authors: | 
|---|
 | 25 |  *      ... | 
|---|
 | 26 |  * | 
|---|
 | 27 |  */ | 
|---|
 | 28 |  | 
|---|
 | 29 | // | 
|---|
 | 30 | // C++ Implementation: GameStateManager | 
|---|
 | 31 | // | 
|---|
 | 32 | // Description: | 
|---|
 | 33 | // | 
|---|
 | 34 | // | 
|---|
 | 35 | // Author:  Oliver Scheuss, (C) 2007 | 
|---|
 | 36 | // | 
|---|
 | 37 | // Copyright: See COPYING file that comes with this distribution | 
|---|
 | 38 | // | 
|---|
 | 39 | // | 
|---|
 | 40 |  | 
|---|
 | 41 | #include "GamestateManager.h" | 
|---|
 | 42 |  | 
|---|
 | 43 | #include <utility> | 
|---|
 | 44 | #include <iostream> | 
|---|
 | 45 | #include <zlib.h> | 
|---|
| [1755] | 46 | #include <cassert> | 
|---|
| [1705] | 47 |  | 
|---|
 | 48 | #include "core/CoreIncludes.h" | 
|---|
 | 49 | #include "core/BaseObject.h" | 
|---|
 | 50 | #include "ClientInformation.h" | 
|---|
 | 51 | #include "Synchronisable.h" | 
|---|
 | 52 |  | 
|---|
 | 53 | namespace network | 
|---|
 | 54 | { | 
|---|
 | 55 |   GamestateManager::GamestateManager() { | 
|---|
 | 56 |     id_=0; | 
|---|
 | 57 |   } | 
|---|
 | 58 |  | 
|---|
 | 59 |   GamestateManager::~GamestateManager() { | 
|---|
 | 60 |   } | 
|---|
 | 61 |  | 
|---|
 | 62 |   bool GamestateManager::update(){ | 
|---|
| [1907] | 63 | //     cleanup(); | 
|---|
| [1730] | 64 |     return getSnapshot(); | 
|---|
| [1705] | 65 |   } | 
|---|
 | 66 |    | 
|---|
 | 67 |   bool GamestateManager::add(packet::Gamestate *gs, int clientID){ | 
|---|
 | 68 |     assert(gs); | 
|---|
 | 69 |     std::map<int, packet::Gamestate*>::iterator it = gamestateQueue.find(clientID); | 
|---|
 | 70 |     if(it!=gamestateQueue.end()){ | 
|---|
 | 71 |       // delete obsolete gamestate | 
|---|
 | 72 |       delete it->second; | 
|---|
 | 73 |     } | 
|---|
 | 74 |     gamestateQueue[clientID] = gs; | 
|---|
 | 75 |     return true; | 
|---|
 | 76 |   } | 
|---|
 | 77 |    | 
|---|
 | 78 |   bool GamestateManager::processGamestates(){ | 
|---|
 | 79 |     std::map<int, packet::Gamestate*>::iterator it; | 
|---|
 | 80 |     // now push only the most recent gamestates we received (ignore obsolete ones) | 
|---|
 | 81 |     for(it = gamestateQueue.begin(); it!=gamestateQueue.end(); it++){ | 
|---|
| [1712] | 82 |       assert(processGamestate(it->second)); | 
|---|
| [1705] | 83 |       delete it->second; | 
|---|
 | 84 |     } | 
|---|
 | 85 |     // now clear the queue | 
|---|
 | 86 |     gamestateQueue.clear(); | 
|---|
 | 87 |     return true; | 
|---|
 | 88 |   } | 
|---|
 | 89 |    | 
|---|
 | 90 |    | 
|---|
 | 91 |   bool GamestateManager::getSnapshot(){ | 
|---|
 | 92 |     reference = new packet::Gamestate(); | 
|---|
 | 93 |     reference->collectData(++id_); | 
|---|
| [1907] | 94 |     //COUT(4) << "inserting gamestate: " << reference << std::endl; | 
|---|
 | 95 |     //gamestateMap_.insert(std::pair<int, packet::Gamestate*>(id_, reference)); | 
|---|
 | 96 | //     gamestateUsed[id_]=0; | 
|---|
| [1705] | 97 |     return true; | 
|---|
 | 98 |   } | 
|---|
 | 99 |    | 
|---|
 | 100 |   /** | 
|---|
 | 101 |    * this function is used to keep the memory usage low | 
|---|
 | 102 |    * it tries to delete all the unused gamestates | 
|---|
 | 103 |    *  | 
|---|
 | 104 |    *  | 
|---|
 | 105 |    */ | 
|---|
| [1907] | 106 | /*  void GamestateManager::cleanup(){ | 
|---|
| [1705] | 107 |     std::map<int,int>::iterator it = gamestateUsed.begin(); | 
|---|
 | 108 |     while(it!=gamestateUsed.end()){ | 
|---|
 | 109 |       if((id_-(*it).first)<KEEP_GAMESTATES) | 
|---|
 | 110 |         break; | 
|---|
 | 111 |       if( (*it).second <= 0 ){ | 
|---|
 | 112 |         COUT(5) << "GameStateManager: deleting gamestate with id: " << (*it).first << ", uses: " << (*it).second << std::endl; | 
|---|
 | 113 |         std::map<int, packet::Gamestate *>::iterator tempit = gamestateMap.find((*it).first); | 
|---|
 | 114 |         if( tempit != gamestateMap.end() ){ | 
|---|
 | 115 |           packet::Gamestate *temp = tempit->second; | 
|---|
 | 116 |           if(temp){ | 
|---|
 | 117 |             delete gamestateMap[(*it).first]; | 
|---|
 | 118 |             gamestateMap.erase((*it).first); | 
|---|
 | 119 |           } | 
|---|
 | 120 |         } | 
|---|
 | 121 |         gamestateUsed.erase(it++); | 
|---|
 | 122 |         continue; | 
|---|
 | 123 |       } | 
|---|
 | 124 |       it++; | 
|---|
 | 125 |     } | 
|---|
| [1907] | 126 |   }*/ | 
|---|
| [1705] | 127 |  | 
|---|
 | 128 |   packet::Gamestate *GamestateManager::popGameState(int clientID) { | 
|---|
 | 129 |     //why are we searching the same client's gamestate id as we searched in | 
|---|
 | 130 |     //Server::sendGameState? | 
|---|
| [1751] | 131 |     packet::Gamestate *gs; | 
|---|
| [1705] | 132 |     int gID = ClientInformation::findClient(clientID)->getGamestateID(); | 
|---|
| [1907] | 133 |     gs = reference->doSelection(clientID); | 
|---|
 | 134 | //     gs = new packet::Gamestate(*reference); | 
|---|
 | 135 | //     gs = new packet::Gamestate(*reference); | 
|---|
 | 136 |     // save the (undiffed) gamestate in the clients gamestate map | 
|---|
 | 137 |     gamestateMap_[clientID].insert(std::pair<int, packet::Gamestate*>(gs->getID(), gs)); | 
|---|
| [1705] | 138 |     //chose wheather the next gamestate is the first or not | 
|---|
| [1907] | 139 |     packet::Gamestate *client=NULL; | 
|---|
| [1705] | 140 |     if(gID != GAMESTATEID_INITIAL){ | 
|---|
| [1907] | 141 |       std::map<unsigned int, std::map<int, packet::Gamestate*> >::iterator clientMap = gamestateMap_.find(clientID); | 
|---|
 | 142 |       if(clientMap!=gamestateMap_.end()){ | 
|---|
 | 143 |         std::map<int, packet::Gamestate*>::iterator it = clientMap->second.find(gID); | 
|---|
 | 144 |         if(it!=clientMap->second.end()) | 
|---|
 | 145 |           client = it->second; | 
|---|
 | 146 |       } | 
|---|
| [1705] | 147 |     } | 
|---|
| [1907] | 148 |     if(client){ | 
|---|
 | 149 | //       COUT(3) << "diffing" << std::endl; | 
|---|
 | 150 |       gs = gs->diff(client); | 
|---|
 | 151 |     } | 
|---|
 | 152 |     else{ | 
|---|
 | 153 | //       COUT(3) << "not diffing" << std::endl; | 
|---|
 | 154 |       gs = new packet::Gamestate(*gs); | 
|---|
 | 155 |     } | 
|---|
 | 156 |     bool b = gs->compressData(); | 
|---|
 | 157 |     assert(b); | 
|---|
| [1751] | 158 |     return gs; | 
|---|
| [1705] | 159 |   } | 
|---|
 | 160 |    | 
|---|
 | 161 |    | 
|---|
 | 162 |   bool GamestateManager::ack(int gamestateID, int clientID) { | 
|---|
 | 163 |     ClientInformation *temp = ClientInformation::findClient(clientID); | 
|---|
| [1907] | 164 |     assert(temp); | 
|---|
| [1705] | 165 |     int curid = temp->getGamestateID(); | 
|---|
 | 166 |      | 
|---|
| [1769] | 167 |     if(gamestateID == 0){ | 
|---|
| [1705] | 168 |       temp->setGamestateID(GAMESTATEID_INITIAL); | 
|---|
| [1769] | 169 |       return true; | 
|---|
| [1705] | 170 |     } | 
|---|
| [1907] | 171 |      | 
|---|
| [1769] | 172 |     assert(curid<gamestateID); | 
|---|
| [1705] | 173 |     COUT(4) << "acking gamestate " << gamestateID << " for clientid: " << clientID << " curid: " << curid << std::endl; | 
|---|
| [1907] | 174 |     std::map<int, packet::Gamestate*>::iterator it, tempit; | 
|---|
 | 175 |     for(it = gamestateMap_[clientID].begin(); it!=gamestateMap_[clientID].end() && it->first<gamestateID; it++){ | 
|---|
 | 176 |       delete it->second; | 
|---|
 | 177 |       tempit=it++; | 
|---|
 | 178 |       gamestateMap_[clientID].erase(tempit); | 
|---|
| [1705] | 179 |     } | 
|---|
| [1907] | 180 |     temp->setGamestateID(gamestateID); | 
|---|
| [1705] | 181 |     return true; | 
|---|
 | 182 |   } | 
|---|
 | 183 |  | 
|---|
 | 184 |   void GamestateManager::removeClient(ClientInformation* client){ | 
|---|
| [1907] | 185 |     assert(client); | 
|---|
 | 186 |     std::map<unsigned int, std::map<int, packet::Gamestate*> >::iterator clientMap = gamestateMap_.find(client->getID()); | 
|---|
 | 187 |     // first delete all remained gamestates | 
|---|
 | 188 |     std::map<int, packet::Gamestate*>::iterator it; | 
|---|
 | 189 |     for(it=clientMap->second.begin(); it!=clientMap->second.end(); it++) | 
|---|
 | 190 |       delete it->second; | 
|---|
 | 191 |     // now delete the clients gamestatemap | 
|---|
 | 192 |     gamestateMap_.erase(clientMap); | 
|---|
| [1705] | 193 |   } | 
|---|
| [1712] | 194 |    | 
|---|
 | 195 |   bool GamestateManager::processGamestate(packet::Gamestate *gs){ | 
|---|
| [1751] | 196 |     if(gs->isCompressed()) | 
|---|
| [1907] | 197 |     { | 
|---|
 | 198 |        bool b = gs->decompressData(); | 
|---|
 | 199 |        assert(b); | 
|---|
 | 200 |     } | 
|---|
| [1712] | 201 |     assert(!gs->isDiffed()); | 
|---|
 | 202 |     return gs->spreadData(); | 
|---|
 | 203 |   } | 
|---|
| [1705] | 204 |  | 
|---|
 | 205 | } | 
|---|