[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" |
---|
[2371] | 51 | #include "synchronisable/Synchronisable.h" |
---|
| 52 | #include "synchronisable/NetworkCallbackManager.h" |
---|
[2485] | 53 | #include "packet/Acknowledgement.h" |
---|
[1705] | 54 | |
---|
[2171] | 55 | namespace orxonox |
---|
[1705] | 56 | { |
---|
[2556] | 57 | GamestateManager::GamestateManager() : |
---|
| 58 | reference(0), id_(0) |
---|
| 59 | { |
---|
[2382] | 60 | trafficControl_ = new TrafficControl(); |
---|
[1705] | 61 | } |
---|
| 62 | |
---|
[2556] | 63 | GamestateManager::~GamestateManager() |
---|
| 64 | { |
---|
[2382] | 65 | delete trafficControl_; |
---|
[1705] | 66 | } |
---|
| 67 | |
---|
| 68 | bool GamestateManager::update(){ |
---|
[1907] | 69 | // cleanup(); |
---|
[1730] | 70 | return getSnapshot(); |
---|
[1705] | 71 | } |
---|
[2087] | 72 | |
---|
| 73 | bool GamestateManager::add(packet::Gamestate *gs, unsigned int clientID){ |
---|
[1705] | 74 | assert(gs); |
---|
[2087] | 75 | std::map<unsigned int, packet::Gamestate*>::iterator it = gamestateQueue.find(clientID); |
---|
[1705] | 76 | if(it!=gamestateQueue.end()){ |
---|
| 77 | // delete obsolete gamestate |
---|
| 78 | delete it->second; |
---|
| 79 | } |
---|
| 80 | gamestateQueue[clientID] = gs; |
---|
| 81 | return true; |
---|
| 82 | } |
---|
[2087] | 83 | |
---|
[1705] | 84 | bool GamestateManager::processGamestates(){ |
---|
[2087] | 85 | std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
[1705] | 86 | // now push only the most recent gamestates we received (ignore obsolete ones) |
---|
| 87 | for(it = gamestateQueue.begin(); it!=gamestateQueue.end(); it++){ |
---|
[2087] | 88 | bool b = processGamestate(it->second); |
---|
| 89 | assert(b); |
---|
[1705] | 90 | delete it->second; |
---|
| 91 | } |
---|
| 92 | // now clear the queue |
---|
| 93 | gamestateQueue.clear(); |
---|
[2371] | 94 | //and call all queued callbacks |
---|
| 95 | NetworkCallbackManager::callCallbacks(); |
---|
[1705] | 96 | return true; |
---|
| 97 | } |
---|
[2087] | 98 | |
---|
| 99 | |
---|
[1705] | 100 | bool GamestateManager::getSnapshot(){ |
---|
[2556] | 101 | if ( reference != 0 ) |
---|
| 102 | delete reference; |
---|
[1705] | 103 | reference = new packet::Gamestate(); |
---|
[2087] | 104 | if(!reference->collectData(++id_)){ //we have no data to send |
---|
| 105 | delete reference; |
---|
| 106 | reference=0; |
---|
| 107 | } |
---|
[1705] | 108 | return true; |
---|
| 109 | } |
---|
[2087] | 110 | |
---|
[1705] | 111 | |
---|
[2087] | 112 | packet::Gamestate *GamestateManager::popGameState(unsigned int clientID) { |
---|
[1705] | 113 | //why are we searching the same client's gamestate id as we searched in |
---|
| 114 | //Server::sendGameState? |
---|
[2661] | 115 | packet::Gamestate *gs; |
---|
[2087] | 116 | unsigned int gID = ClientInformation::findClient(clientID)->getGamestateID(); |
---|
| 117 | if(!reference) |
---|
| 118 | return 0; |
---|
[2371] | 119 | gs = reference->doSelection(clientID, 10000); |
---|
[1907] | 120 | // gs = new packet::Gamestate(*reference); |
---|
| 121 | // save the (undiffed) gamestate in the clients gamestate map |
---|
[2561] | 122 | gamestateMap_[clientID][gs->getID()]=gs; |
---|
[1705] | 123 | //chose wheather the next gamestate is the first or not |
---|
[2561] | 124 | packet::Gamestate *client=0; |
---|
[1705] | 125 | if(gID != GAMESTATEID_INITIAL){ |
---|
[2561] | 126 | assert(gamestateMap_.find(clientID)!=gamestateMap_.end()); |
---|
| 127 | std::map<unsigned int, packet::Gamestate*>::iterator it = gamestateMap_[clientID].find(gID); |
---|
| 128 | if(it!=gamestateMap_[clientID].end()) |
---|
| 129 | { |
---|
| 130 | client = it->second; |
---|
[1907] | 131 | } |
---|
[1705] | 132 | } |
---|
[1907] | 133 | if(client){ |
---|
| 134 | // COUT(3) << "diffing" << std::endl; |
---|
[2561] | 135 | gs = gs->diff(client); |
---|
[2655] | 136 | // gs = new packet::Gamestate(*gs); |
---|
[1907] | 137 | } |
---|
| 138 | else{ |
---|
| 139 | // COUT(3) << "not diffing" << std::endl; |
---|
[2561] | 140 | gs = new packet::Gamestate(*gs); |
---|
[1907] | 141 | } |
---|
| 142 | bool b = gs->compressData(); |
---|
| 143 | assert(b); |
---|
[2660] | 144 | COUT(4) << "sending gamestate with id " << gs->getID(); |
---|
| 145 | if(gs->isDiffed()) |
---|
| 146 | COUT(4) << " and baseid " << gs->getBaseID() << endl; |
---|
| 147 | else |
---|
| 148 | COUT(4) << endl; |
---|
[1751] | 149 | return gs; |
---|
[1705] | 150 | } |
---|
[2087] | 151 | |
---|
| 152 | |
---|
| 153 | bool GamestateManager::ack(unsigned int gamestateID, unsigned int clientID) { |
---|
[1705] | 154 | ClientInformation *temp = ClientInformation::findClient(clientID); |
---|
[1907] | 155 | assert(temp); |
---|
[2087] | 156 | unsigned int curid = temp->getGamestateID(); |
---|
| 157 | |
---|
[2485] | 158 | if(gamestateID == ACKID_NACK){ |
---|
[1705] | 159 | temp->setGamestateID(GAMESTATEID_INITIAL); |
---|
[2561] | 160 | // now delete all saved gamestates for this client |
---|
| 161 | std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
| 162 | for(it = gamestateMap_[clientID].begin(); it!=gamestateMap_[clientID].end(); ){ |
---|
| 163 | delete it->second; |
---|
| 164 | gamestateMap_[clientID].erase(it++); |
---|
| 165 | } |
---|
[1769] | 166 | return true; |
---|
[1705] | 167 | } |
---|
[2087] | 168 | |
---|
| 169 | assert(curid==(unsigned int)GAMESTATEID_INITIAL || curid<gamestateID); |
---|
[1705] | 170 | COUT(4) << "acking gamestate " << gamestateID << " for clientid: " << clientID << " curid: " << curid << std::endl; |
---|
[2561] | 171 | std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
| 172 | for(it = gamestateMap_[clientID].begin(); it!=gamestateMap_[clientID].end() && it->first<gamestateID; ){ |
---|
[1907] | 173 | delete it->second; |
---|
[2561] | 174 | gamestateMap_[clientID].erase(it++); |
---|
[1705] | 175 | } |
---|
[1907] | 176 | temp->setGamestateID(gamestateID); |
---|
[2381] | 177 | TrafficControl::processAck(clientID, gamestateID); |
---|
[1705] | 178 | return true; |
---|
| 179 | } |
---|
| 180 | |
---|
| 181 | void GamestateManager::removeClient(ClientInformation* client){ |
---|
[1907] | 182 | assert(client); |
---|
[2087] | 183 | std::map<unsigned int, std::map<unsigned int, packet::Gamestate*> >::iterator clientMap = gamestateMap_.find(client->getID()); |
---|
[1907] | 184 | // first delete all remained gamestates |
---|
[2087] | 185 | std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
[1907] | 186 | for(it=clientMap->second.begin(); it!=clientMap->second.end(); it++) |
---|
| 187 | delete it->second; |
---|
| 188 | // now delete the clients gamestatemap |
---|
| 189 | gamestateMap_.erase(clientMap); |
---|
[1705] | 190 | } |
---|
[2087] | 191 | |
---|
[1712] | 192 | bool GamestateManager::processGamestate(packet::Gamestate *gs){ |
---|
[1751] | 193 | if(gs->isCompressed()) |
---|
[1907] | 194 | { |
---|
| 195 | bool b = gs->decompressData(); |
---|
| 196 | assert(b); |
---|
| 197 | } |
---|
[1712] | 198 | assert(!gs->isDiffed()); |
---|
| 199 | return gs->spreadData(); |
---|
| 200 | } |
---|
[1705] | 201 | |
---|
| 202 | } |
---|