[12175] | 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 | * Sandro 'smerkli' Merkli |
---|
| 24 | * Co-authors: |
---|
| 25 | * ... |
---|
| 26 | * |
---|
| 27 | */ |
---|
| 28 | |
---|
| 29 | #include "PeerList.h" |
---|
| 30 | |
---|
| 31 | #include <cstdio> |
---|
| 32 | #include "util/Output.h" |
---|
| 33 | #include "network/packet/ServerInformation.h" |
---|
| 34 | |
---|
| 35 | namespace orxonox |
---|
| 36 | { |
---|
| 37 | PeerList::PeerList() { } |
---|
| 38 | PeerList::~PeerList() { } |
---|
| 39 | |
---|
| 40 | int |
---|
| 41 | PeerList::addPeer( ENetPeer *toadd ) |
---|
| 42 | { /* error correction */ |
---|
| 43 | if( toadd == nullptr ) |
---|
| 44 | { orxout(internal_error, context::master_server) << "PeerList::addPeer: empty peer given." << endl; |
---|
| 45 | return -1; |
---|
| 46 | } |
---|
| 47 | |
---|
| 48 | /* if all went well, push to back of list */ |
---|
| 49 | this->peerlist.push_back( toadd ); |
---|
| 50 | return 0; |
---|
| 51 | } |
---|
| 52 | |
---|
| 53 | bool sub_compAddr( ENetAddress addr1, ENetAddress addr2 ) |
---|
| 54 | { |
---|
| 55 | for( int i = 0; i < 16; ++i ) |
---|
| 56 | if( addr1.host.addr[i] < addr2.host.addr[i] ) |
---|
| 57 | return -i; |
---|
| 58 | else if( addr1.host.addr[i] > addr2.host.addr[i] ) |
---|
| 59 | return i; |
---|
| 60 | |
---|
| 61 | return 0; |
---|
| 62 | } |
---|
| 63 | |
---|
| 64 | |
---|
| 65 | bool |
---|
| 66 | PeerList::remPeerByAddr( ENetAddress addr ) |
---|
| 67 | { |
---|
| 68 | /* loop through list elements */ |
---|
| 69 | for( ENetPeer* peer : peerlist ) |
---|
| 70 | if( !sub_compAddr(peer->address, addr ) ) |
---|
| 71 | { /* found this name, remove and quit */ |
---|
| 72 | this->peerlist.remove( peer ); |
---|
| 73 | return true; |
---|
| 74 | } |
---|
| 75 | |
---|
| 76 | /* not found */ |
---|
| 77 | return false; |
---|
| 78 | } |
---|
| 79 | |
---|
| 80 | ENetPeer * |
---|
| 81 | PeerList::findPeerByAddr( ENetAddress addr ) |
---|
| 82 | { |
---|
| 83 | /* loop through list elements */ |
---|
| 84 | for( ENetPeer* peer : peerlist ) |
---|
| 85 | if( !sub_compAddr(peer->address, addr ) ) |
---|
| 86 | /* found this name, remove and quit */ |
---|
| 87 | return peer; |
---|
| 88 | |
---|
| 89 | /* not found */ |
---|
| 90 | return nullptr; |
---|
| 91 | } |
---|
| 92 | |
---|
| 93 | int |
---|
| 94 | PeerList::count(){ |
---|
| 95 | return this->peerlist.size(); |
---|
| 96 | } |
---|
| 97 | |
---|
| 98 | } |
---|