1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* [email protected] *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "portlist.h"
namespace net
{
Port::Port() : number(0),proto(TCP),forward(false)
{
}
Port::Port(bt::Uint16 number,Protocol proto,bool forward)
: number(number),proto(proto),forward(forward)
{
}
Port::Port(const Port & p) : number(p.number),proto(p.proto),forward(p.forward)
{
}
bool Port::operator == (const Port & p) const
{
return number == p.number && proto == p.proto;
}
PortList::PortList() : lst(0)
{}
PortList::~PortList()
{}
void PortList::addNewPort(bt::Uint16 number,Protocol proto,bool forward)
{
Port p = Port(number,proto,forward);
append(p);
if (lst)
lst->portAdded(p);
}
void PortList::removePort(bt::Uint16 number,Protocol proto)
{
PortList::iterator itr = find(Port(number,proto,false));
if (itr == end())
return;
if (lst)
lst->portRemoved(*itr);
erase(itr);
}
}
|
