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 | { /* get an iterator */ |
---|
68 | std::list<ENetPeer *>::iterator i; |
---|
69 | |
---|
70 | /* loop through list elements */ |
---|
71 | for( i = peerlist.begin(); i != peerlist.end(); ++i ) |
---|
72 | if( !sub_compAddr((*i)->address, addr ) ) |
---|
73 | { /* found this name, remove and quit */ |
---|
74 | this->peerlist.remove( *i ); |
---|
75 | return true; |
---|
76 | } |
---|
77 | |
---|
78 | /* not found */ |
---|
79 | return false; |
---|
80 | } |
---|
81 | |
---|
82 | ENetPeer * |
---|
83 | PeerList::findPeerByAddr( ENetAddress addr ) |
---|
84 | { /* get an iterator */ |
---|
85 | std::list<ENetPeer *>::iterator i; |
---|
86 | |
---|
87 | /* loop through list elements */ |
---|
88 | for( i = peerlist.begin(); i != peerlist.end(); ++i ) |
---|
89 | if( !sub_compAddr((*i)->address, addr ) ) |
---|
90 | /* found this name, remove and quit */ |
---|
91 | return *i; |
---|
92 | |
---|
93 | /* not found */ |
---|
94 | return nullptr; |
---|
95 | } |
---|
96 | |
---|
97 | int |
---|
98 | PeerList::count(){ |
---|
99 | return this->peerlist.size(); |
---|
100 | } |
---|
101 | |
---|
102 | } |
---|