[7631] | 1 | /* |
---|
| 2 | orxonox - the future of 3D-vertical-scrollers |
---|
| 3 | |
---|
| 4 | Copyright (C) 2004 orx |
---|
| 5 | |
---|
| 6 | This program is free software; you can redistribute it and/or modify |
---|
| 7 | it under the terms of the GNU General Public License as published by |
---|
| 8 | the Free Software Foundation; either version 2, or (at your option) |
---|
| 9 | any later version. |
---|
| 10 | |
---|
| 11 | ### File Specific: |
---|
| 12 | main-programmer: Christoph Renner |
---|
| 13 | co-programmer: ... |
---|
| 14 | */ |
---|
| 15 | |
---|
| 16 | //#define DEBUG_SPECIAL_MODULE DEBUG_MODULE_ |
---|
| 17 | |
---|
| 18 | #include "message_manager.h" |
---|
| 19 | |
---|
| 20 | using namespace std; |
---|
| 21 | |
---|
[7671] | 22 | MessageManager* MessageManager::singletonRef = NULL; |
---|
[7631] | 23 | |
---|
[7671] | 24 | |
---|
[7631] | 25 | /** |
---|
| 26 | * standard constructor |
---|
| 27 | */ |
---|
| 28 | MessageManager::MessageManager () |
---|
| 29 | { |
---|
| 30 | this->setClassID( CL_MESSAGE_MANAGER, "MessageManager" ); |
---|
[7681] | 31 | newNumber = 1; |
---|
| 32 | setSynchronized( true ); |
---|
[7631] | 33 | } |
---|
| 34 | |
---|
| 35 | |
---|
| 36 | /** |
---|
| 37 | * standard deconstructor |
---|
| 38 | */ |
---|
| 39 | MessageManager::~MessageManager () |
---|
| 40 | { |
---|
[7671] | 41 | for ( MessageQueue::iterator it = messageQueue.begin(); it != messageQueue.end(); it++ ) |
---|
| 42 | { |
---|
| 43 | for ( std::list<NetworkMessage>::iterator it2 = it->second.messages.begin(); it2 != it->second.messages.end(); it2++ ) |
---|
| 44 | { |
---|
| 45 | if ( it2->data ) |
---|
| 46 | { |
---|
| 47 | delete it2->data; |
---|
| 48 | it2->data = NULL; |
---|
| 49 | } |
---|
| 50 | } |
---|
| 51 | |
---|
| 52 | it->second.messages.clear(); |
---|
| 53 | it->second.toAck.clear(); |
---|
| 54 | } |
---|
| 55 | |
---|
| 56 | messageQueue.clear(); |
---|
[7631] | 57 | } |
---|
| 58 | |
---|
| 59 | /** |
---|
| 60 | * get the diff to last acked state of userId |
---|
| 61 | * |
---|
[7671] | 62 | * this class does not use the normal SynchronizeableVars for zynchronisation. instead |
---|
| 63 | * it defines its own protocol |
---|
[7631] | 64 | * |
---|
| 65 | * @param userId user to create diff for |
---|
| 66 | * @param data buffer to copy diff in |
---|
| 67 | * @param maxLength max bytes to copy into data |
---|
| 68 | * @param stateId id of current state |
---|
| 69 | * @param fromStateId the reference state for the delta state |
---|
| 70 | * @param priorityTH tells getStateDiff to not send element with priority \< priorityTH |
---|
| 71 | * @return n bytes copied into data |
---|
| 72 | */ |
---|
| 73 | int MessageManager::getStateDiff( int userId, byte * data, int maxLength, int stateId, int fromStateId, int priorityTH ) |
---|
| 74 | { |
---|
[7671] | 75 | int i = 0; |
---|
| 76 | int n; |
---|
| 77 | |
---|
| 78 | n = Converter::intToByteArray( messageQueue[userId].toAck.size(), data + i, maxLength ); |
---|
| 79 | i += n; |
---|
| 80 | assert( n == INTSIZE ); |
---|
| 81 | |
---|
| 82 | for ( std::list<int>::iterator it = messageQueue[userId].toAck.begin(); it != messageQueue[userId].toAck.end(); it++) |
---|
| 83 | { |
---|
| 84 | n = Converter::intToByteArray( *it, data + i, maxLength ); |
---|
| 85 | i += n; |
---|
| 86 | assert( n == INTSIZE ); |
---|
| 87 | } |
---|
| 88 | |
---|
| 89 | messageQueue[userId].toAck.clear(); |
---|
| 90 | |
---|
| 91 | n = Converter::intToByteArray( messageQueue[userId].messages.size(), data + i, maxLength ); |
---|
| 92 | i += n; |
---|
| 93 | assert( n == INTSIZE ); |
---|
| 94 | |
---|
| 95 | for ( std::list<NetworkMessage>::iterator it = messageQueue[userId].messages.begin(); it != messageQueue[userId].messages.end(); it++ ) |
---|
| 96 | { |
---|
| 97 | n = Converter::intToByteArray( it->length, data + i, maxLength ); |
---|
| 98 | i += n; |
---|
| 99 | assert( n == INTSIZE ); |
---|
| 100 | |
---|
| 101 | n = Converter::intToByteArray( it->number, data + i, maxLength ); |
---|
| 102 | i += n; |
---|
| 103 | assert( n == INTSIZE ); |
---|
| 104 | |
---|
| 105 | n = Converter::intToByteArray( it->messageId, data + i, maxLength ); |
---|
| 106 | i += n; |
---|
| 107 | assert( n == INTSIZE ); |
---|
| 108 | |
---|
| 109 | assert( i + it->length <= maxLength ); |
---|
| 110 | memcpy( data + i, it->data, it->length ); |
---|
| 111 | i += it->length; |
---|
| 112 | } |
---|
| 113 | |
---|
| 114 | return i; |
---|
[7631] | 115 | } |
---|
| 116 | |
---|
| 117 | /** |
---|
| 118 | * sets a new state out of a diff created on another host |
---|
| 119 | * @param userId hostId of user who send me that diff |
---|
| 120 | * @param data pointer to diff |
---|
| 121 | * @param length length of diff |
---|
| 122 | * @param stateId id of current state |
---|
| 123 | * @param fromStateId id of the base state id |
---|
| 124 | * @return number bytes read |
---|
| 125 | * @todo check for permissions |
---|
| 126 | */ |
---|
| 127 | int MessageManager::setStateDiff( int userId, byte * data, int length, int stateId, int fromStateId ) |
---|
| 128 | { |
---|
[7671] | 129 | int i = 0; |
---|
| 130 | int n; |
---|
| 131 | |
---|
| 132 | int nAcks; |
---|
| 133 | |
---|
[7678] | 134 | assert( i + INTSIZE <= length ); |
---|
[7671] | 135 | n = Converter::byteArrayToInt( data + i, &nAcks ); |
---|
| 136 | assert( n == INTSIZE ); |
---|
| 137 | i += n; |
---|
| 138 | |
---|
| 139 | std::list<int> acks; |
---|
| 140 | |
---|
| 141 | int number; |
---|
| 142 | |
---|
| 143 | for ( int j = 0; j < nAcks; j++ ) |
---|
| 144 | { |
---|
[7678] | 145 | assert( i + INTSIZE <= length ); |
---|
[7671] | 146 | n = Converter::byteArrayToInt( data + i, &number ); |
---|
| 147 | assert( n == INTSIZE ); |
---|
| 148 | i += n; |
---|
| 149 | |
---|
| 150 | acks.push_back( number ); |
---|
| 151 | } |
---|
| 152 | |
---|
| 153 | int nMessages; |
---|
| 154 | |
---|
[7678] | 155 | assert( i + INTSIZE <= length ); |
---|
[7671] | 156 | n = Converter::byteArrayToInt( data + i, &nMessages ); |
---|
| 157 | assert( n == INTSIZE ); |
---|
| 158 | i += n; |
---|
[7678] | 159 | |
---|
| 160 | int messageLength, messageId; |
---|
[7671] | 161 | |
---|
| 162 | for ( int j = 0; j < nMessages; j++ ) |
---|
| 163 | { |
---|
[7678] | 164 | assert( i + INTSIZE <= length ); |
---|
| 165 | n = Converter::byteArrayToInt( data + i, &messageLength ); |
---|
| 166 | assert( n == INTSIZE ); |
---|
| 167 | i += n; |
---|
| 168 | |
---|
| 169 | assert( i + INTSIZE <= length ); |
---|
| 170 | n = Converter::byteArrayToInt( data + i, &number ); |
---|
| 171 | assert( n == INTSIZE ); |
---|
| 172 | i += n; |
---|
| 173 | |
---|
| 174 | assert( i + INTSIZE <= length ); |
---|
| 175 | n = Converter::byteArrayToInt( data + i, &messageId ); |
---|
| 176 | assert( n == INTSIZE ); |
---|
| 177 | i += n; |
---|
| 178 | |
---|
| 179 | if ( number > 0 ) |
---|
| 180 | messageQueue[userId].toAck.push_back( number ); |
---|
| 181 | |
---|
| 182 | assert( i + messageLength <= length ); |
---|
| 183 | assert( messageHandlerMap.find( (MessageId)messageId ) != messageHandlerMap.end() ); |
---|
[7681] | 184 | if ( std::find( messageQueue[userId].recievedMessages.begin(), messageQueue[userId].recievedMessages.end(), number )== messageQueue[userId].recievedMessages.end() ) |
---|
| 185 | { |
---|
[7693] | 186 | if ( !(*(messageHandlerMap[(MessageId)messageId].cb))( (MessageId)messageId, data + i, messageLength, messageHandlerMap[(MessageId)messageId].someData, userId ) ) |
---|
| 187 | { |
---|
| 188 | NetworkMessage msg; |
---|
| 189 | |
---|
| 190 | msg.data = new byte[messageLength]; |
---|
| 191 | memcpy( msg.data, data + i, messageLength ); |
---|
| 192 | msg.length = messageLength; |
---|
| 193 | msg.messageId = (MessageId)messageId; |
---|
| 194 | msg.number = userId; |
---|
| 195 | |
---|
| 196 | incomingMessabeBuffer.push_back( msg ); |
---|
| 197 | } |
---|
[7681] | 198 | messageQueue[userId].recievedMessages.push_back( number ); |
---|
| 199 | } |
---|
[7678] | 200 | i += messageLength; |
---|
[7671] | 201 | } |
---|
[7681] | 202 | |
---|
| 203 | |
---|
[7697] | 204 | for ( std::list<NetworkMessage>::iterator it = incomingMessabeBuffer.begin(); it != incomingMessabeBuffer.end(); ) |
---|
[7693] | 205 | { |
---|
[7697] | 206 | if ( (*(messageHandlerMap[it->messageId].cb))( it->messageId, it->data, it->length, messageHandlerMap[it->messageId].someData, it->number ) ) |
---|
[7693] | 207 | { |
---|
| 208 | std::list<NetworkMessage>::iterator delIt = it; |
---|
[7697] | 209 | if ( it->data ) |
---|
| 210 | delete it->data; |
---|
[7693] | 211 | it++; |
---|
| 212 | incomingMessabeBuffer.erase( delIt ); |
---|
| 213 | continue; |
---|
| 214 | } |
---|
| 215 | it++; |
---|
| 216 | } |
---|
| 217 | |
---|
[7681] | 218 | //walk throu message queue and remove acked messages |
---|
| 219 | for ( std::list<NetworkMessage>::iterator it = messageQueue[userId].messages.begin(); it != messageQueue[userId].messages.end(); ) |
---|
| 220 | { |
---|
| 221 | if ( std::find( acks.begin(), acks.end(), it->number) != acks.end() ) |
---|
| 222 | { |
---|
| 223 | std::list<NetworkMessage>::iterator delIt = it; |
---|
| 224 | it++; |
---|
| 225 | messageQueue[userId].messages.erase( delIt ); |
---|
| 226 | continue; |
---|
| 227 | } |
---|
| 228 | it++; |
---|
| 229 | } |
---|
| 230 | |
---|
| 231 | //TODO find bether way. maybe with timestamp |
---|
| 232 | if ( messageQueue[userId].recievedMessages.size() > 1000 ) |
---|
| 233 | { |
---|
| 234 | for ( int j = 0; j < messageQueue[userId].recievedMessages.size() - 1000; j++ ) |
---|
| 235 | messageQueue[userId].recievedMessages.erase( messageQueue[userId].recievedMessages.begin() ); |
---|
| 236 | } |
---|
[7678] | 237 | |
---|
| 238 | return i; |
---|
[7631] | 239 | } |
---|
| 240 | |
---|
| 241 | /** |
---|
| 242 | * clean up memory reserved for user |
---|
| 243 | * @param userId userid |
---|
| 244 | */ |
---|
| 245 | void MessageManager::cleanUpUser( int userId ) |
---|
| 246 | { |
---|
[7678] | 247 | if ( messageQueue.find( userId ) == messageQueue.end() ) |
---|
| 248 | return; |
---|
| 249 | |
---|
| 250 | for ( std::list<NetworkMessage>::iterator it = messageQueue[userId].messages.begin(); it != messageQueue[userId].messages.end(); it++ ) |
---|
| 251 | { |
---|
| 252 | if ( it->data ) |
---|
| 253 | delete it->data; |
---|
| 254 | it->data = NULL; |
---|
| 255 | } |
---|
| 256 | |
---|
| 257 | messageQueue[userId].toAck.clear(); |
---|
| 258 | |
---|
| 259 | messageQueue.erase( userId ); |
---|
[7631] | 260 | } |
---|
[7671] | 261 | |
---|
| 262 | /** |
---|
| 263 | * registers function to handle messages with id messageId. someData is passed to callbackfuntion |
---|
| 264 | * @param messageId message id to handle |
---|
| 265 | * @param cb function pointer to callback function |
---|
| 266 | * @param someData this pointer is passed to callback function without modification |
---|
| 267 | * @return true on success |
---|
| 268 | */ |
---|
| 269 | bool MessageManager::registerMessageHandler( MessageId messageId, MessageCallback cb, void * someData ) |
---|
| 270 | { |
---|
[7678] | 271 | MessageHandler messageHandler; |
---|
| 272 | |
---|
| 273 | messageHandler.cb = cb; |
---|
| 274 | messageHandler.messageId = messageId; |
---|
| 275 | messageHandler.someData = someData; |
---|
| 276 | |
---|
| 277 | messageHandlerMap[messageId] = messageHandler; |
---|
| 278 | |
---|
| 279 | return true; |
---|
[7671] | 280 | } |
---|
| 281 | |
---|
| 282 | /** |
---|
| 283 | * initializes buffers for user |
---|
| 284 | * @param userId userId |
---|
| 285 | */ |
---|
| 286 | void MessageManager::initUser( int userId ) |
---|
| 287 | { |
---|
[7678] | 288 | // just do something so map creates a new entry |
---|
| 289 | messageQueue[userId].toAck.clear(); |
---|
[7872] | 290 | //assert( messageQueue[userId].messages.size() == 0 ); |
---|
[7671] | 291 | } |
---|
[7681] | 292 | |
---|
| 293 | /** |
---|
| 294 | * send a message to one or more clients |
---|
| 295 | * recieverType: |
---|
| 296 | * RT_ALL send to all users. reciever is ignored |
---|
| 297 | * RT_USER send only to reciever |
---|
| 298 | * RT_NOT_USER send to all but reciever |
---|
| 299 | * |
---|
| 300 | * @param messageId message id |
---|
| 301 | * @param data pointer to data |
---|
| 302 | * @param dataLength length of data |
---|
| 303 | * @param recieverType |
---|
| 304 | * @param reciever |
---|
| 305 | */ |
---|
| 306 | void MessageManager::sendMessage( MessageId messageId, byte * data, int dataLength, RecieverType recieverType, int reciever, MessagePriority messagePriority ) |
---|
| 307 | { |
---|
| 308 | for ( MessageQueue::iterator it = messageQueue.begin(); it != messageQueue.end(); it++ ) |
---|
| 309 | { |
---|
| 310 | if ( |
---|
[8068] | 311 | recieverType == RT_ALL_ME || |
---|
| 312 | recieverType == RT_ALL_NOT_ME || |
---|
[7681] | 313 | recieverType == RT_USER && it->first == reciever || |
---|
| 314 | recieverType == RT_NOT_USER && it->first != reciever |
---|
| 315 | ) |
---|
| 316 | { |
---|
| 317 | NetworkMessage msg; |
---|
| 318 | |
---|
| 319 | msg.data = new byte[dataLength]; |
---|
| 320 | memcpy( msg.data, data, dataLength ); |
---|
| 321 | msg.length = dataLength; |
---|
| 322 | msg.messageId = messageId; |
---|
| 323 | msg.number = newNumber++; |
---|
| 324 | msg.priority = messagePriority; |
---|
| 325 | |
---|
| 326 | it->second.messages.push_back( msg ); |
---|
[8068] | 327 | |
---|
| 328 | if ( recieverType == RT_ALL_ME ) |
---|
| 329 | incomingMessabeBuffer.push_back( msg ); |
---|
[7681] | 330 | } |
---|
| 331 | } |
---|
| 332 | } |
---|
| 333 | |
---|
| 334 | |
---|