[514] | 1 | /* |
---|
| 2 | * ORXONOX - the hottest 3D action shooter ever to exist |
---|
| 3 | * |
---|
| 4 | * |
---|
| 5 | * License notice: |
---|
| 6 | * |
---|
| 7 | * This program is free software; you can redistribute it and/or |
---|
| 8 | * modify it under the terms of the GNU General Public License |
---|
| 9 | * as published by the Free Software Foundation; either version 2 |
---|
| 10 | * of the License, or (at your option) any later version. |
---|
| 11 | * |
---|
| 12 | * This program is distributed in the hope that it will be useful, |
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 15 | * GNU General Public License for more details. |
---|
| 16 | * |
---|
| 17 | * You should have received a copy of the GNU General Public License |
---|
| 18 | * along with this program; if not, write to the Free Software |
---|
| 19 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. |
---|
| 20 | * |
---|
| 21 | * Author: |
---|
| 22 | * Oliver Scheuss, (C) 2007 |
---|
| 23 | * Co-authors: |
---|
| 24 | * ... |
---|
| 25 | * |
---|
| 26 | */ |
---|
| 27 | |
---|
[247] | 28 | // |
---|
| 29 | // C++ Implementation: GameStateManager |
---|
| 30 | // |
---|
[514] | 31 | // Description: |
---|
[247] | 32 | // |
---|
| 33 | // |
---|
| 34 | // Author: Oliver Scheuss, (C) 2007 |
---|
| 35 | // |
---|
| 36 | // Copyright: See COPYING file that comes with this distribution |
---|
| 37 | // |
---|
| 38 | // |
---|
| 39 | #include "GameStateManager.h" |
---|
| 40 | |
---|
| 41 | namespace network { |
---|
| 42 | |
---|
[436] | 43 | GameStateManager::GameStateManager(ClientInformation *head) |
---|
[247] | 44 | { |
---|
[413] | 45 | id=0; |
---|
[436] | 46 | head_=head; |
---|
[247] | 47 | } |
---|
| 48 | |
---|
| 49 | GameStateManager::~GameStateManager() |
---|
| 50 | { |
---|
| 51 | } |
---|
| 52 | |
---|
[413] | 53 | void GameStateManager::update(){ |
---|
[422] | 54 | reference = getSnapshot(id); |
---|
[436] | 55 | gameStateMap.insert(std::pair<int, GameState*>(id, reference)); |
---|
| 56 | gameStateUsed[id]=0; |
---|
[422] | 57 | ++id; |
---|
[413] | 58 | return; |
---|
| 59 | } |
---|
| 60 | |
---|
| 61 | GameStateCompressed GameStateManager::popGameState(int clientID){ |
---|
[436] | 62 | int gID = head_->findClient(clientID)->getGamestateID(); |
---|
| 63 | if(gID!=GAMESTATEID_INITIAL){ |
---|
| 64 | GameState *client = gameStateMap[gID]; |
---|
| 65 | GameState *server = reference; |
---|
| 66 | return encode(client, server); |
---|
| 67 | } |
---|
[422] | 68 | GameState *server = reference; |
---|
[436] | 69 | return encode(server); |
---|
| 70 | // return an undiffed gamestate and set appropriate flags |
---|
[413] | 71 | } |
---|
| 72 | |
---|
| 73 | |
---|
| 74 | |
---|
[332] | 75 | /** |
---|
[514] | 76 | * This function goes through the whole list of synchronisables and |
---|
[332] | 77 | * saves all the synchronisables to a flat "list". |
---|
| 78 | * @return struct of type gamestate containing the size of the whole gamestate and a pointer linking to the flat list |
---|
| 79 | */ |
---|
[422] | 80 | GameState *GameStateManager::getSnapshot(int id) |
---|
[332] | 81 | { |
---|
| 82 | //the size of the gamestate |
---|
| 83 | int totalsize=0; |
---|
| 84 | //the size of one specific synchronisable |
---|
| 85 | int tempsize=0; |
---|
| 86 | // get the start of the Synchronisable list |
---|
| 87 | orxonox::Iterator<Synchronisable> it; |
---|
| 88 | // struct for return value of Synchronisable::getData() |
---|
| 89 | syncData sync; |
---|
[514] | 90 | |
---|
[422] | 91 | GameState *retval=new GameState; //return value |
---|
[568] | 92 | retval->id=id++; |
---|
[332] | 93 | // reserve a little memory and increase it later on |
---|
[573] | 94 | COUT(2) << "mallocing" << std::endl; |
---|
[422] | 95 | retval->data = (unsigned char*)malloc(1); |
---|
[573] | 96 | COUT(2) << "malloced" << std::endl; |
---|
[514] | 97 | |
---|
[332] | 98 | // offset of memory functions |
---|
| 99 | int offset=0; |
---|
| 100 | // go through all Synchronisables |
---|
| 101 | for(it = orxonox::ObjectList<Synchronisable>::start(); it != 0; ++it){ |
---|
| 102 | //get size of the synchronisable |
---|
| 103 | tempsize=it->getSize(); |
---|
[569] | 104 | //COUT(2) << "size of synchronisable: " << tempsize << std::endl; |
---|
[332] | 105 | // add place for data and 3 ints (length,classid,objectid) |
---|
| 106 | totalsize+=tempsize+3*sizeof(int); |
---|
| 107 | // allocate additional space |
---|
[422] | 108 | retval->data = (unsigned char *)realloc((void *)retval->data, totalsize); |
---|
[514] | 109 | |
---|
[332] | 110 | // run Synchronisable::getData with offset and additional place for 3 ints in between (for ids and length) |
---|
[422] | 111 | sync=it->getData(retval->data+offset+3*sizeof(int)); |
---|
| 112 | *(retval->data+offset)=sync.length; |
---|
| 113 | *(retval->data+offset+sizeof(int))=sync.objectID; |
---|
| 114 | *(retval->data+offset+2*sizeof(int))=sync.classID; |
---|
[332] | 115 | // increase data pointer |
---|
| 116 | offset+=tempsize+3*sizeof(int); |
---|
| 117 | } |
---|
[422] | 118 | retval->size=totalsize; |
---|
[413] | 119 | return retval; |
---|
[247] | 120 | } |
---|
| 121 | |
---|
| 122 | |
---|
[332] | 123 | |
---|
[413] | 124 | GameStateCompressed GameStateManager::encode(GameState *a, GameState *b){ |
---|
[436] | 125 | GameState r = diff(a,b); |
---|
| 126 | r.diffed = true; |
---|
| 127 | return compress_(&r); |
---|
[385] | 128 | } |
---|
[332] | 129 | |
---|
[436] | 130 | GameStateCompressed GameStateManager::encode(GameState *a){ |
---|
| 131 | a->diffed=false; |
---|
| 132 | return compress_(a); |
---|
| 133 | } |
---|
[332] | 134 | |
---|
[413] | 135 | GameState GameStateManager::diff(GameState *a, GameState *b){ |
---|
| 136 | unsigned char *ap = a->data, *bp = b->data; |
---|
[385] | 137 | int of=0; // pointers offset |
---|
| 138 | int dest_length=0; |
---|
[413] | 139 | if(a->size>=b->size) |
---|
| 140 | dest_length=a->size; |
---|
[385] | 141 | else |
---|
[413] | 142 | dest_length=b->size; |
---|
[385] | 143 | unsigned char *dp = (unsigned char *)malloc(dest_length*sizeof(unsigned char)); |
---|
[413] | 144 | while(of<a->size && of<b->size){ |
---|
[385] | 145 | *(dp+of)=*(ap+of)^*(bp+of); // do the xor |
---|
| 146 | ++of; |
---|
| 147 | } |
---|
[413] | 148 | if(a->size!=b->size){ // do we have to fill up ? |
---|
[385] | 149 | unsigned char n=0; |
---|
[413] | 150 | if(a->size<b->size){ |
---|
[385] | 151 | while(of<dest_length){ |
---|
| 152 | *(dp+of)=n^*(bp+of); |
---|
| 153 | of++; |
---|
| 154 | } |
---|
| 155 | } else{ |
---|
| 156 | while(of<dest_length){ |
---|
| 157 | *(dp+of)=*(ap+of)^n; |
---|
| 158 | of++; |
---|
| 159 | } |
---|
| 160 | } |
---|
| 161 | } |
---|
| 162 | // should be finished now |
---|
[413] | 163 | GameState r = {b->id, dest_length, dp}; |
---|
[385] | 164 | return r; |
---|
| 165 | } |
---|
[332] | 166 | |
---|
[436] | 167 | GameStateCompressed GameStateManager::compress_(GameState *a) { |
---|
[571] | 168 | COUT(2) << "compressing gamestate" << std::endl; |
---|
[436] | 169 | int size = a->size; |
---|
| 170 | uLongf buffer = (uLongf)((a->size + 12)*1.01)+1; |
---|
[407] | 171 | unsigned char* dest = (unsigned char*)malloc( buffer ); |
---|
| 172 | int retval; |
---|
[514] | 173 | retval = compress( dest, &buffer, a->data, (uLong)size ); |
---|
| 174 | |
---|
[407] | 175 | switch ( retval ) { |
---|
[413] | 176 | case Z_OK: std::cout << "successfully compressed" << std::endl; break; |
---|
| 177 | case Z_MEM_ERROR: std::cout << "not enough memory available" << std::endl; break; |
---|
| 178 | case Z_BUF_ERROR: std::cout << "not enough memory available in the buffer" << std::endl; break; |
---|
| 179 | case Z_DATA_ERROR: std::cout << "data corrupted" << std::endl; break; |
---|
[407] | 180 | } |
---|
[514] | 181 | |
---|
[413] | 182 | GameStateCompressed compressedGamestate; |
---|
[407] | 183 | compressedGamestate.compsize = buffer; |
---|
| 184 | compressedGamestate.normsize = size; |
---|
| 185 | compressedGamestate.id = GAMESTATE; |
---|
| 186 | compressedGamestate.data = dest; |
---|
[436] | 187 | compressedGamestate.diffed = a->diffed; |
---|
[514] | 188 | |
---|
[407] | 189 | return compressedGamestate; |
---|
[385] | 190 | } |
---|
| 191 | |
---|
[422] | 192 | void GameStateManager::ackGameState(int clientID, int gamestateID){ |
---|
[436] | 193 | ClientInformation *temp = head_->findClient(clientID); |
---|
| 194 | int curid = temp->getID(); |
---|
| 195 | // decrease usage of gamestate and save it |
---|
| 196 | deleteUnusedGameState(curid); |
---|
| 197 | //increase gamestateused |
---|
| 198 | ++gameStateUsed.find(gamestateID)->second; |
---|
| 199 | temp->setGamestateID(gamestateID); |
---|
| 200 | /* |
---|
[422] | 201 | GameState *old = clientGameState[clientID]; |
---|
| 202 | deleteUnusedGameState(old); |
---|
[436] | 203 | clientGameState[clientID]=idGameState[gamestateID];*/ |
---|
[422] | 204 | } |
---|
[385] | 205 | |
---|
[436] | 206 | bool GameStateManager::deleteUnusedGameState(int gamestateID){ |
---|
| 207 | int used = --(gameStateUsed.find(gamestateID)->second); |
---|
| 208 | if(id-gamestateID>KEEP_GAMESTATES && used==0){ |
---|
| 209 | // delete gamestate |
---|
| 210 | delete gameStateMap.find(gamestateID)->second; |
---|
| 211 | gameStateMap.erase(gamestateID); |
---|
| 212 | return true; |
---|
[422] | 213 | } |
---|
[436] | 214 | return false; |
---|
[422] | 215 | } |
---|
[413] | 216 | |
---|
[385] | 217 | } |
---|
| 218 | |
---|
| 219 | |
---|