[1711] | 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) 2008 |
---|
| 24 | * Co-authors: |
---|
| 25 | * ... |
---|
| 26 | * |
---|
| 27 | */ |
---|
[1701] | 28 | |
---|
[1711] | 29 | |
---|
[1760] | 30 | #include "Packet.h" |
---|
| 31 | |
---|
| 32 | #include <cassert> |
---|
[1701] | 33 | #include <enet/enet.h> |
---|
[1711] | 34 | #include <boost/bind.hpp> |
---|
[1701] | 35 | |
---|
| 36 | #include "network/ConnectionManager.h" |
---|
| 37 | #include "network/ClientInformation.h" |
---|
| 38 | |
---|
| 39 | #include "Acknowledgement.h" |
---|
| 40 | #include "Chat.h" |
---|
| 41 | #include "ClassID.h" |
---|
[1709] | 42 | #include "Gamestate.h" |
---|
[1711] | 43 | #include "Welcome.h" |
---|
[1907] | 44 | #include "DeleteObjects.h" |
---|
[1701] | 45 | #include "network/Host.h" |
---|
[1705] | 46 | #include "core/CoreIncludes.h" |
---|
[1701] | 47 | |
---|
[2171] | 48 | namespace orxonox{ |
---|
[1701] | 49 | |
---|
| 50 | namespace packet{ |
---|
[2087] | 51 | |
---|
[1711] | 52 | #define PACKET_FLAG_DEFAULT ENET_PACKET_FLAG_NO_ALLOCATE |
---|
[1701] | 53 | #define _PACKETID 0 |
---|
[2087] | 54 | |
---|
[2171] | 55 | std::map<size_t, Packet *> Packet::packetMap_; |
---|
| 56 | boost::recursive_mutex Packet::packetMap_mutex; |
---|
[2087] | 57 | |
---|
[1701] | 58 | Packet::Packet(){ |
---|
[1711] | 59 | flags_ = PACKET_FLAG_DEFAULT; |
---|
[1701] | 60 | packetDirection_ = ENUM::Outgoing; |
---|
| 61 | clientID_=0; |
---|
[1711] | 62 | data_=0; |
---|
[1701] | 63 | enetPacket_=0; |
---|
[2087] | 64 | bDataENetAllocated_ = false; |
---|
[1701] | 65 | } |
---|
| 66 | |
---|
[1712] | 67 | void blub(ENetPacket *packet){ |
---|
[1713] | 68 | COUT(4) << "blubb" << std::endl; |
---|
[1712] | 69 | } |
---|
| 70 | |
---|
[1907] | 71 | Packet::Packet(uint8_t *data, unsigned int clientID){ |
---|
[1711] | 72 | flags_ = PACKET_FLAG_DEFAULT; |
---|
[1713] | 73 | packetDirection_ = ENUM::Incoming; |
---|
[1711] | 74 | clientID_=clientID; |
---|
| 75 | data_=data; |
---|
[1701] | 76 | enetPacket_=0; |
---|
[2087] | 77 | bDataENetAllocated_ = false; |
---|
[1701] | 78 | } |
---|
| 79 | |
---|
| 80 | |
---|
[1711] | 81 | Packet::Packet(const Packet &p){ |
---|
[1712] | 82 | enetPacket_=p.enetPacket_; |
---|
[1711] | 83 | flags_=p.flags_; |
---|
[1730] | 84 | packetDirection_ = p.packetDirection_; |
---|
| 85 | clientID_ = p.clientID_; |
---|
[1711] | 86 | if(p.data_){ |
---|
[1907] | 87 | data_ = new uint8_t[p.getSize()]; |
---|
[1711] | 88 | memcpy(data_, p.data_, p.getSize()); |
---|
| 89 | }else |
---|
| 90 | data_=0; |
---|
[2087] | 91 | bDataENetAllocated_ = p.bDataENetAllocated_; |
---|
[1701] | 92 | } |
---|
| 93 | |
---|
[2087] | 94 | /** |
---|
| 95 | @brief |
---|
| 96 | Destroys a packet completely. |
---|
| 97 | |
---|
| 98 | That also means destroying the ENetPacket if one exists. There |
---|
| 99 | */ |
---|
[1711] | 100 | Packet::~Packet(){ |
---|
[2087] | 101 | // Deallocate data_ memory if necessary. |
---|
| 102 | if (this->bDataENetAllocated_){ |
---|
| 103 | // In this case ENet allocated data_ and will destroy it. |
---|
| 104 | } |
---|
| 105 | else if (this->data_) { |
---|
| 106 | // This destructor was probably called as a consequence to ENet executing our callback. |
---|
| 107 | // It simply serves us to be able to deallocate the packet content (data_) ourselves since |
---|
| 108 | // we have created it in the first place. |
---|
| 109 | delete[] this->data_; |
---|
| 110 | } |
---|
| 111 | |
---|
| 112 | // Destroy the ENetPacket if necessary. |
---|
| 113 | // Note: For the case ENet used the callback to destroy the packet, we have already set |
---|
| 114 | // enetPacket_ to NULL to avoid destroying it again. |
---|
| 115 | if (this->enetPacket_){ |
---|
| 116 | // enetPacket_->data gets destroyed too by ENet if it was allocated by it. |
---|
[1705] | 117 | enet_packet_destroy(enetPacket_); |
---|
[1751] | 118 | } |
---|
[1705] | 119 | } |
---|
[1701] | 120 | |
---|
| 121 | bool Packet::send(){ |
---|
[1730] | 122 | if(packetDirection_ != ENUM::Outgoing && packetDirection_ != ENUM::Bidirectional ){ |
---|
[1712] | 123 | assert(0); |
---|
[1701] | 124 | return false; |
---|
[1730] | 125 | } |
---|
[1701] | 126 | if(!enetPacket_){ |
---|
[1712] | 127 | if(!data_){ |
---|
| 128 | assert(0); |
---|
[1701] | 129 | return false; |
---|
[1712] | 130 | } |
---|
[2087] | 131 | // We deliver ENet the data address so that it doesn't memcpy everything again. |
---|
| 132 | // --> We have to delete data_ ourselves! |
---|
[1711] | 133 | enetPacket_ = enet_packet_create(getData(), getSize(), getFlags()); |
---|
[1751] | 134 | enetPacket_->freeCallback = &Packet::deletePacket; |
---|
[2087] | 135 | // Add the packet to a global list so we can access it again once enet calls our |
---|
| 136 | // deletePacket method. We can of course only give a one argument function to the ENet C library. |
---|
[2662] | 137 | { |
---|
| 138 | // Assures we don't create a packet and destroy it right after in another thread |
---|
| 139 | // without having a reference in the packetMap_ |
---|
| 140 | boost::recursive_mutex::scoped_lock lock(Packet::packetMap_mutex); |
---|
| 141 | packetMap_[(size_t)(void*)enetPacket_] = this; |
---|
| 142 | } |
---|
[1701] | 143 | } |
---|
[2087] | 144 | #ifndef NDEBUG |
---|
[1751] | 145 | switch( *(ENUM::Type *)(data_ + _PACKETID) ) |
---|
[1715] | 146 | { |
---|
| 147 | case ENUM::Acknowledgement: |
---|
| 148 | case ENUM::Chat: |
---|
| 149 | case ENUM::ClassID: |
---|
| 150 | case ENUM::Gamestate: |
---|
| 151 | case ENUM::Welcome: |
---|
[1907] | 152 | case ENUM::DeleteObjects: |
---|
[1751] | 153 | break; |
---|
[1715] | 154 | default: |
---|
[1751] | 155 | assert(0); //there was some error, if this is the case |
---|
[1715] | 156 | break; |
---|
[1751] | 157 | } |
---|
| 158 | #endif |
---|
[2087] | 159 | // ENetPacket *temp = enetPacket_; |
---|
| 160 | // enetPacket_ = 0; // otherwise we have a double free because enet already handles the deallocation of the packet |
---|
[2171] | 161 | Host::addPacket( enetPacket_, clientID_); |
---|
[1701] | 162 | return true; |
---|
| 163 | } |
---|
| 164 | |
---|
[1711] | 165 | Packet *Packet::createPacket(ENetPacket *packet, ENetPeer *peer){ |
---|
[1907] | 166 | uint8_t *data = packet->data; |
---|
[2087] | 167 | assert(ClientInformation::findClient(&peer->address)->getID() != (unsigned int)-2 || !Host::isServer()); |
---|
[1711] | 168 | unsigned int clientID = ClientInformation::findClient(&peer->address)->getID(); |
---|
| 169 | Packet *p; |
---|
[1907] | 170 | COUT(5) << "packet type: " << *(ENUM::Type *)&data[_PACKETID] << std::endl; |
---|
[1715] | 171 | switch( *(ENUM::Type *)(data + _PACKETID) ) |
---|
[1701] | 172 | { |
---|
| 173 | case ENUM::Acknowledgement: |
---|
[1907] | 174 | COUT(4) << "ack" << std::endl; |
---|
[1711] | 175 | p = new Acknowledgement( data, clientID ); |
---|
[1701] | 176 | break; |
---|
| 177 | case ENUM::Chat: |
---|
[1907] | 178 | COUT(4) << "chat" << std::endl; |
---|
[1711] | 179 | p = new Chat( data, clientID ); |
---|
[1701] | 180 | break; |
---|
| 181 | case ENUM::ClassID: |
---|
[1907] | 182 | COUT(4) << "classid" << std::endl; |
---|
[1711] | 183 | p = new ClassID( data, clientID ); |
---|
[1701] | 184 | break; |
---|
| 185 | case ENUM::Gamestate: |
---|
[1907] | 186 | COUT(4) << "gamestate" << std::endl; |
---|
[1701] | 187 | // TODO: remove brackets |
---|
[1715] | 188 | p = new Gamestate( data, clientID ); |
---|
[1701] | 189 | break; |
---|
[1711] | 190 | case ENUM::Welcome: |
---|
[1907] | 191 | COUT(4) << "welcome" << std::endl; |
---|
[1711] | 192 | p = new Welcome( data, clientID ); |
---|
[1715] | 193 | break; |
---|
[1907] | 194 | case ENUM::DeleteObjects: |
---|
| 195 | COUT(4) << "deleteobjects" << std::endl; |
---|
| 196 | p = new DeleteObjects( data, clientID ); |
---|
| 197 | break; |
---|
[1701] | 198 | default: |
---|
[1710] | 199 | assert(0); //TODO: repair this |
---|
| 200 | break; |
---|
[1701] | 201 | } |
---|
[2087] | 202 | |
---|
| 203 | // Data was created by ENet |
---|
| 204 | p->bDataENetAllocated_ = true; |
---|
| 205 | |
---|
[1711] | 206 | return p; |
---|
[1701] | 207 | } |
---|
| 208 | |
---|
[2087] | 209 | /** |
---|
| 210 | @brief |
---|
| 211 | ENet calls this method whenever it wants to destroy a packet that contains |
---|
| 212 | data we allocated ourselves. |
---|
| 213 | */ |
---|
| 214 | void Packet::deletePacket(ENetPacket *enetPacket){ |
---|
[2171] | 215 | boost::recursive_mutex::scoped_lock lock(Packet::packetMap_mutex); |
---|
[2087] | 216 | // Get our Packet from a gloabal map with all Packets created in the send() method of Packet. |
---|
[2171] | 217 | std::map<size_t, Packet*>::iterator it = packetMap_.find((size_t)enetPacket); |
---|
[2087] | 218 | assert(it != packetMap_.end()); |
---|
| 219 | // Make sure we don't delete it again in the destructor |
---|
| 220 | it->second->enetPacket_ = 0; |
---|
| 221 | delete it->second; |
---|
[2171] | 222 | packetMap_.erase(it); |
---|
[2087] | 223 | COUT(4) << "PacketMap size: " << packetMap_.size() << std::endl; |
---|
[1711] | 224 | } |
---|
| 225 | |
---|
[1701] | 226 | } // namespace packet |
---|
| 227 | |
---|
[2171] | 228 | } // namespace orxonox |
---|
[1701] | 229 | |
---|