[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: |
---|
[3084] | 23 | * Oliver Scheuss |
---|
[1705] | 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 | |
---|
[1755] | 43 | #include <cassert> |
---|
[3304] | 44 | #include <queue> |
---|
| 45 | // #include <boost/thread/mutex.hpp> |
---|
[1705] | 46 | |
---|
[3214] | 47 | #include "packet/Acknowledgement.h" |
---|
| 48 | #include "packet/Gamestate.h" |
---|
[2662] | 49 | #include "synchronisable/NetworkCallbackManager.h" |
---|
[1705] | 50 | |
---|
[7801] | 51 | #include "core/ThreadPool.h" |
---|
| 52 | #include "core/command/Executor.h" |
---|
| 53 | #include "core/GameMode.h" |
---|
[8788] | 54 | #include "util/Output.h" |
---|
[7801] | 55 | #include "util/Clock.h" |
---|
[8373] | 56 | #include "util/OrxAssert.h" |
---|
[7801] | 57 | // #include "TrafficControl.h" |
---|
| 58 | |
---|
[2171] | 59 | namespace orxonox |
---|
[8327] | 60 | { |
---|
[2662] | 61 | GamestateManager::GamestateManager() : |
---|
[7801] | 62 | currentGamestate_(0), id_(0) |
---|
[2662] | 63 | { |
---|
[7801] | 64 | // trafficControl_ = new TrafficControl(); |
---|
[3304] | 65 | // threadMutex_ = new boost::mutex(); |
---|
| 66 | // threadPool_ = new ThreadPool(); |
---|
[1705] | 67 | } |
---|
| 68 | |
---|
[2662] | 69 | GamestateManager::~GamestateManager() |
---|
| 70 | { |
---|
[7801] | 71 | if( this->currentGamestate_ ) |
---|
| 72 | delete this->currentGamestate_;std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
[3304] | 73 | for( it = gamestateQueue.begin(); it != gamestateQueue.end(); ++it ) |
---|
[6417] | 74 | delete it->second; |
---|
[7801] | 75 | std::map<uint32_t, peerInfo>::iterator peerIt; |
---|
| 76 | std::map<uint32_t, packet::Gamestate*>::iterator gamestateIt; |
---|
| 77 | for( peerIt = peerMap_.begin(); peerIt != peerMap_.end(); ++peerIt ) |
---|
[3304] | 78 | { |
---|
[7801] | 79 | for( gamestateIt = peerIt->second.gamestates.begin(); gamestateIt != peerIt->second.gamestates.end(); ++gamestateIt ) |
---|
| 80 | delete gamestateIt->second; |
---|
[3304] | 81 | } |
---|
[7801] | 82 | // this->trafficControl_->destroy(); |
---|
[3304] | 83 | // delete this->threadMutex_; |
---|
| 84 | // delete this->threadPool_; |
---|
[1705] | 85 | } |
---|
| 86 | |
---|
| 87 | bool GamestateManager::update(){ |
---|
[1907] | 88 | // cleanup(); |
---|
[1730] | 89 | return getSnapshot(); |
---|
[1705] | 90 | } |
---|
[2087] | 91 | |
---|
[7801] | 92 | bool GamestateManager::addGamestate(packet::Gamestate *gs, unsigned int clientID) |
---|
| 93 | { |
---|
[1705] | 94 | assert(gs); |
---|
[2087] | 95 | std::map<unsigned int, packet::Gamestate*>::iterator it = gamestateQueue.find(clientID); |
---|
[8394] | 96 | if(it!=gamestateQueue.end()) |
---|
| 97 | { |
---|
[1705] | 98 | // delete obsolete gamestate |
---|
| 99 | delete it->second; |
---|
| 100 | } |
---|
| 101 | gamestateQueue[clientID] = gs; |
---|
| 102 | return true; |
---|
| 103 | } |
---|
[2087] | 104 | |
---|
[7801] | 105 | bool GamestateManager::processGamestates() |
---|
| 106 | { |
---|
[3304] | 107 | if( this->gamestateQueue.empty() ) |
---|
| 108 | return true; |
---|
[2087] | 109 | std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
[1705] | 110 | // now push only the most recent gamestates we received (ignore obsolete ones) |
---|
[8394] | 111 | for(it = gamestateQueue.begin(); it!=gamestateQueue.end(); it++) |
---|
| 112 | { |
---|
| 113 | OrxVerify(processGamestate(it->second), "ERROR: could not process Gamestate"); |
---|
[7801] | 114 | sendAck( it->second->getID(), it->second->getPeerID() ); |
---|
[1705] | 115 | delete it->second; |
---|
| 116 | } |
---|
| 117 | // now clear the queue |
---|
| 118 | gamestateQueue.clear(); |
---|
[2662] | 119 | //and call all queued callbacks |
---|
| 120 | NetworkCallbackManager::callCallbacks(); |
---|
[1705] | 121 | return true; |
---|
| 122 | } |
---|
[7801] | 123 | |
---|
| 124 | bool GamestateManager::sendAck(unsigned int gamestateID, uint32_t peerID) |
---|
| 125 | { |
---|
[8327] | 126 | assert( gamestateID != ACKID_NACK ); |
---|
[7801] | 127 | packet::Acknowledgement *ack = new packet::Acknowledgement(gamestateID, peerID); |
---|
| 128 | if( !this->sendPacket(ack)) |
---|
| 129 | { |
---|
| 130 | COUT(3) << "could not ack gamestate: " << gamestateID << std::endl; |
---|
| 131 | return false; |
---|
| 132 | } |
---|
| 133 | else |
---|
| 134 | { |
---|
| 135 | COUT(5) << "acked a gamestate: " << gamestateID << std::endl; |
---|
| 136 | return true; |
---|
| 137 | } |
---|
| 138 | } |
---|
[2087] | 139 | |
---|
| 140 | |
---|
[1705] | 141 | bool GamestateManager::getSnapshot(){ |
---|
[7801] | 142 | if ( currentGamestate_ != 0 ) |
---|
| 143 | delete currentGamestate_; |
---|
| 144 | uint8_t gsMode; |
---|
| 145 | if( GameMode::isMaster() ) |
---|
| 146 | gsMode = packet::GAMESTATE_MODE_SERVER; |
---|
| 147 | else |
---|
| 148 | gsMode = packet::GAMESTATE_MODE_CLIENT; |
---|
| 149 | uint32_t newID; |
---|
| 150 | if( GameMode::isMaster() ) |
---|
| 151 | newID = ++id_; |
---|
| 152 | else |
---|
[8327] | 153 | { |
---|
| 154 | assert(peerMap_.size()!=0); |
---|
| 155 | newID = peerMap_[NETWORK_PEER_ID_SERVER].lastReceivedGamestateID; |
---|
| 156 | if( newID == GAMESTATEID_INITIAL ) |
---|
| 157 | { |
---|
| 158 | return false; |
---|
| 159 | } |
---|
| 160 | } |
---|
[7801] | 161 | |
---|
[8327] | 162 | currentGamestate_ = new packet::Gamestate(); |
---|
| 163 | |
---|
| 164 | if(!currentGamestate_->collectData(newID, gsMode)) |
---|
| 165 | { //we have no data to send |
---|
[7801] | 166 | delete currentGamestate_; |
---|
| 167 | currentGamestate_=0; |
---|
[8327] | 168 | return false; |
---|
[2087] | 169 | } |
---|
[1705] | 170 | return true; |
---|
| 171 | } |
---|
[6417] | 172 | |
---|
[7801] | 173 | std::vector<packet::Gamestate*> GamestateManager::getGamestates() |
---|
[3304] | 174 | { |
---|
[7801] | 175 | if(!currentGamestate_) |
---|
| 176 | return std::vector<packet::Gamestate*>(); |
---|
| 177 | std::vector<packet::Gamestate*> peerGamestates; |
---|
| 178 | |
---|
| 179 | std::map<uint32_t, peerInfo>::iterator peerIt; |
---|
| 180 | for( peerIt=peerMap_.begin(); peerIt!=peerMap_.end(); ++peerIt ) |
---|
| 181 | { |
---|
| 182 | if( !peerIt->second.isSynched ) |
---|
| 183 | { |
---|
[3304] | 184 | COUT(5) << "Server: not sending gamestate" << std::endl; |
---|
| 185 | continue; |
---|
| 186 | } |
---|
[8327] | 187 | COUT(5) << "client id: " << peerIt->first << std::endl; |
---|
[3304] | 188 | COUT(5) << "Server: doing gamestate gamestate preparation" << std::endl; |
---|
[7801] | 189 | int peerID = peerIt->first; //get client id |
---|
[6417] | 190 | |
---|
[7801] | 191 | unsigned int lastAckedGamestateID = peerIt->second.lastAckedGamestateID; |
---|
[6417] | 192 | |
---|
[7801] | 193 | packet::Gamestate* baseGamestate=0; |
---|
| 194 | if(lastAckedGamestateID != GAMESTATEID_INITIAL) |
---|
| 195 | { |
---|
| 196 | assert(peerMap_.find(peerID)!=peerMap_.end()); |
---|
| 197 | std::map<uint32_t, packet::Gamestate*>::iterator it = peerMap_[peerID].gamestates.find(lastAckedGamestateID); |
---|
| 198 | assert(it!=peerMap_[peerID].gamestates.end()); |
---|
| 199 | baseGamestate = it->second; |
---|
[3304] | 200 | } |
---|
[6417] | 201 | |
---|
[8327] | 202 | peerGamestates.push_back(0); // insert an empty gamestate* to be changed |
---|
[7801] | 203 | finishGamestate( peerID, peerGamestates.back(), baseGamestate, currentGamestate_ ); |
---|
| 204 | if( peerGamestates.back()==0 ) |
---|
| 205 | // nothing to send to remove pointer from vector |
---|
| 206 | peerGamestates.pop_back(); |
---|
[6417] | 207 | //FunctorMember<GamestateManager>* functor = |
---|
[5929] | 208 | // ExecutorMember<GamestateManager>* executor = createExecutor( createFunctor(&GamestateManager::finishGamestate, this) ); |
---|
[7801] | 209 | // executor->setDefaultValues( cid, &clientGamestates.back(), client, currentGamestate_ ); |
---|
[3304] | 210 | // (*static_cast<Executor*>(executor))(); |
---|
| 211 | // this->threadPool_->passFunction( executor, true ); |
---|
[7801] | 212 | // (*functor)( cid, &(clientGamestates.back()), client, currentGamestate_ ); |
---|
[3304] | 213 | } |
---|
[6417] | 214 | |
---|
[3304] | 215 | // threadPool_->synchronise(); |
---|
[6417] | 216 | |
---|
[7801] | 217 | return peerGamestates; |
---|
[3304] | 218 | } |
---|
[2087] | 219 | |
---|
[1705] | 220 | |
---|
[7801] | 221 | void GamestateManager::finishGamestate( unsigned int peerID, packet::Gamestate*& destgamestate, packet::Gamestate* base, packet::Gamestate* gamestate ) { |
---|
[1705] | 222 | //why are we searching the same client's gamestate id as we searched in |
---|
| 223 | //Server::sendGameState? |
---|
[1907] | 224 | // save the (undiffed) gamestate in the clients gamestate map |
---|
[1705] | 225 | //chose wheather the next gamestate is the first or not |
---|
[6417] | 226 | |
---|
[7163] | 227 | // packet::Gamestate *gs = gamestate->doSelection(clientID, 20000); |
---|
| 228 | // packet::Gamestate* gs = new packet::Gamestate(*gamestate); |
---|
| 229 | // packet::Gamestate* gs = gamestate; |
---|
[8407] | 230 | packet::Gamestate *gs = new packet::Gamestate(*gamestate); //this is neccessary because the gamestate are being kept (to diff them later on) for each client seperately |
---|
[3304] | 231 | // packet::Gamestate *gs = new packet::Gamestate(); |
---|
| 232 | // gs->collectData( id_, 0x1 ); |
---|
| 233 | // this->threadMutex_->lock(); |
---|
[7801] | 234 | peerMap_[peerID].gamestates[gamestate->getID()]=gs; |
---|
[3304] | 235 | // this->threadMutex_->unlock(); |
---|
[7801] | 236 | Clock clock; |
---|
| 237 | clock.capture(); |
---|
[6417] | 238 | |
---|
[3304] | 239 | if(base) |
---|
| 240 | { |
---|
[7163] | 241 | packet::Gamestate *diffed1 = gs->diffVariables(base); |
---|
| 242 | if( diffed1->getDataSize() == 0 ) |
---|
| 243 | { |
---|
| 244 | delete diffed1; |
---|
| 245 | destgamestate = 0; |
---|
| 246 | return; |
---|
| 247 | } |
---|
| 248 | gs = diffed1; |
---|
[1907] | 249 | } |
---|
[7163] | 250 | else |
---|
| 251 | { |
---|
[1907] | 252 | gs = new packet::Gamestate(*gs); |
---|
| 253 | } |
---|
[6417] | 254 | |
---|
| 255 | |
---|
[8373] | 256 | // OrxVerify(gs->compressData(), ""); |
---|
[7801] | 257 | clock.capture(); |
---|
[8327] | 258 | COUT(5) << "diff and compress time: " << clock.getDeltaTime() << endl; |
---|
[7163] | 259 | // COUT(5) << "sending gamestate with id " << gs->getID(); |
---|
[3304] | 260 | // if(gamestate->isDiffed()) |
---|
[7163] | 261 | // COUT(5) << " and baseid " << gs->getBaseID() << endl; |
---|
[3304] | 262 | // else |
---|
[7163] | 263 | // COUT(5) << endl; |
---|
[7801] | 264 | gs->setPeerID(peerID); |
---|
[7163] | 265 | destgamestate = gs; |
---|
[1705] | 266 | } |
---|
[2087] | 267 | |
---|
| 268 | |
---|
[7801] | 269 | bool GamestateManager::ackGamestate(unsigned int gamestateID, unsigned int peerID) |
---|
| 270 | { |
---|
| 271 | // ClientInformation *temp = ClientInformation::findClient(peerID); |
---|
| 272 | // assert(temp); |
---|
| 273 | std::map<uint32_t, peerInfo>::iterator it = this->peerMap_.find(peerID); |
---|
| 274 | assert(it!=this->peerMap_.end()); |
---|
| 275 | unsigned int curid = it->second.lastAckedGamestateID; |
---|
[2087] | 276 | |
---|
[8327] | 277 | assert(gamestateID != ACKID_NACK); |
---|
| 278 | // if(gamestateID == ACKID_NACK){ |
---|
| 279 | // it->second.lastAckedGamestateID = GAMESTATEID_INITIAL; |
---|
| 280 | // // temp->setGamestateID(GAMESTATEID_INITIAL); |
---|
| 281 | // // now delete all saved gamestates for this client |
---|
| 282 | // std::map<uint32_t, packet::Gamestate*>::iterator it2; |
---|
| 283 | // for(it2 = it->second.gamestates.begin(); it2!=it->second.gamestates.end(); ++it2 ){ |
---|
| 284 | // delete it2->second; |
---|
| 285 | // } |
---|
| 286 | // it->second.gamestates.clear(); |
---|
| 287 | // return true; |
---|
| 288 | // } |
---|
[2087] | 289 | |
---|
[8327] | 290 | // assert(curid==GAMESTATEID_INITIAL || curid<=gamestateID); // this line is commented out because acknowledgements are unreliable and may arrive in distorted order |
---|
[8407] | 291 | if( gamestateID <= curid && curid != GAMESTATEID_INITIAL ) |
---|
[8327] | 292 | return true; |
---|
| 293 | COUT(4) << "acking gamestate " << gamestateID << " for peerID: " << peerID << " curid: " << curid << std::endl; |
---|
[7801] | 294 | std::map<uint32_t, packet::Gamestate*>::iterator it2; |
---|
| 295 | for( it2=it->second.gamestates.begin(); it2!=it->second.gamestates.end(); ) |
---|
| 296 | { |
---|
| 297 | if( it2->second->getID() < gamestateID ) |
---|
| 298 | { |
---|
| 299 | delete it2->second; |
---|
| 300 | it->second.gamestates.erase(it2++); |
---|
| 301 | } |
---|
| 302 | else |
---|
| 303 | ++it2; |
---|
[1705] | 304 | } |
---|
[7801] | 305 | |
---|
| 306 | // std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
| 307 | // for(it = gamestateMap_[peerID].begin(); it!=gamestateMap_[peerID].end() && it->first<gamestateID; ){ |
---|
| 308 | // delete it->second; |
---|
| 309 | // gamestateMap_[peerID].erase(it++); |
---|
| 310 | // } |
---|
| 311 | it->second.lastAckedGamestateID = gamestateID; |
---|
| 312 | // temp->setGamestateID(gamestateID); |
---|
| 313 | // TrafficControl::processAck(peerID, gamestateID); |
---|
[1705] | 314 | return true; |
---|
| 315 | } |
---|
[7801] | 316 | |
---|
[8327] | 317 | uint32_t GamestateManager::getLastReceivedGamestateID(unsigned int peerID) |
---|
[7801] | 318 | { |
---|
| 319 | assert( this->peerMap_.find(peerID)!=this->peerMap_.end() ); |
---|
| 320 | if( this->peerMap_.find(peerID) != this->peerMap_.end() ) |
---|
[8327] | 321 | return this->peerMap_[peerID].lastReceivedGamestateID; |
---|
[7801] | 322 | else |
---|
| 323 | return GAMESTATEID_INITIAL; |
---|
| 324 | } |
---|
| 325 | |
---|
| 326 | |
---|
| 327 | void GamestateManager::addPeer(uint32_t peerID) |
---|
| 328 | { |
---|
| 329 | assert(peerMap_.find(peerID)==peerMap_.end()); |
---|
| 330 | peerMap_[peerID].peerID = peerID; |
---|
[8327] | 331 | peerMap_[peerID].lastReceivedGamestateID = GAMESTATEID_INITIAL; |
---|
[7801] | 332 | peerMap_[peerID].lastAckedGamestateID = GAMESTATEID_INITIAL; |
---|
| 333 | if( GameMode::isMaster() ) |
---|
| 334 | peerMap_[peerID].isSynched = false; |
---|
| 335 | else |
---|
| 336 | peerMap_[peerID].isSynched = true; |
---|
| 337 | } |
---|
[1705] | 338 | |
---|
[7801] | 339 | void GamestateManager::removePeer(uint32_t peerID) |
---|
| 340 | { |
---|
| 341 | assert(peerMap_.find(peerID)!=peerMap_.end()); |
---|
| 342 | std::map<uint32_t, packet::Gamestate*>::iterator peerIt; |
---|
| 343 | for( peerIt = peerMap_[peerID].gamestates.begin(); peerIt!=peerMap_[peerID].gamestates.end(); ++peerIt ) |
---|
| 344 | { |
---|
| 345 | delete peerIt->second; |
---|
| 346 | } |
---|
| 347 | peerMap_.erase(peerMap_.find(peerID)); |
---|
[1705] | 348 | } |
---|
[2087] | 349 | |
---|
[7801] | 350 | |
---|
| 351 | // void GamestateManager::removeClient(ClientInformation* client){ |
---|
| 352 | // assert(client); |
---|
| 353 | // std::map<unsigned int, std::map<unsigned int, packet::Gamestate*> >::iterator clientMap = gamestateMap_.find(client->getID()); |
---|
| 354 | // // first delete all remained gamestates |
---|
| 355 | // std::map<unsigned int, packet::Gamestate*>::iterator it; |
---|
| 356 | // for(it=clientMap->second.begin(); it!=clientMap->second.end(); it++) |
---|
| 357 | // delete it->second; |
---|
| 358 | // // now delete the clients gamestatemap |
---|
| 359 | // gamestateMap_.erase(clientMap); |
---|
| 360 | // } |
---|
| 361 | |
---|
| 362 | bool GamestateManager::processGamestate(packet::Gamestate *gs) |
---|
| 363 | { |
---|
[1751] | 364 | if(gs->isCompressed()) |
---|
[1907] | 365 | { |
---|
[8394] | 366 | OrxVerify(gs->decompressData(), "ERROR: could not decompress Gamestate"); |
---|
[1907] | 367 | } |
---|
[1712] | 368 | assert(!gs->isDiffed()); |
---|
[7801] | 369 | uint8_t gsMode; |
---|
| 370 | if( GameMode::isMaster() ) |
---|
| 371 | gsMode = packet::GAMESTATE_MODE_SERVER; |
---|
| 372 | else |
---|
| 373 | gsMode = packet::GAMESTATE_MODE_CLIENT; |
---|
| 374 | if( gs->spreadData(gsMode) ) |
---|
| 375 | { |
---|
[8327] | 376 | this->peerMap_[gs->getPeerID()].lastReceivedGamestateID = gs->getID(); |
---|
[7801] | 377 | return true; |
---|
| 378 | } |
---|
| 379 | else |
---|
| 380 | return false; |
---|
[1712] | 381 | } |
---|
[1705] | 382 | |
---|
| 383 | } |
---|