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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/*
* anytun
*
* The secure anycast tunneling protocol (satp) defines a protocol used
* for communication between any combination of unicast and anycast
* tunnel endpoints. It has less protocol overhead than IPSec in Tunnel
* mode and allows tunneling of every ETHER TYPE protocol (e.g.
* ethernet, ip, arp ...). satp directly includes cryptography and
* message authentication based on the methodes used by SRTP. It is
* intended to deliver a generic, scaleable and secure solution for
* tunneling and relaying of packets of any protocol.
*
*
* Copyright (C) 2007-2008 Othmar Gsenger, Erwin Nindl,
* Christian Pointner <satp@wirdorange.org>
*
* This file is part of Anytun.
*
* Anytun 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 3 of the License, or
* any later version.
*
* Anytun 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 anytun. If not, see <http://www.gnu.org/licenses/>.
*/
#include "../threadUtils.hpp"
#include "../datatypes.h"
#include "rtpSessionTable.h"
RtpSessionTable* RtpSessionTable::inst = NULL;
Mutex RtpSessionTable::instMutex;
RtpSessionTable& gRtpSessionTable = RtpSessionTable::instance();
RtpSessionTable& RtpSessionTable::instance()
{
Lock lock(instMutex);
static instanceCleaner c;
if(!inst)
inst = new RtpSessionTable();
return *inst;
}
RtpSessionTable::RtpSessionTable()
{
}
RtpSessionTable::~RtpSessionTable()
{
}
void RtpSessionTable::delSession(const std::string & call_id)
{
Lock lock(mutex_);
RtpSessionMap::iterator it = map_.find(call_id);
if(it!=map_.end())
delete it->second;
map_.erase(it);
}
RtpSession& RtpSessionTable::getOrNewSession(const std::string & call_id, bool& is_new)
{
Lock lock(mutex_);
return getOrNewSessionUnlocked(call_id, is_new);
}
RtpSession& RtpSessionTable::getOrNewSessionUnlocked(const std::string & call_id, bool& is_new)
{
is_new = false;
RtpSessionMap::iterator it = map_.find(call_id);
if(it!=map_.end())
return *(it->second);
is_new = true;
std::pair<RtpSessionMap::iterator, bool> ret = map_.insert(RtpSessionMap::value_type(call_id, NULL));
ret.first->second = new RtpSession(ret.first->first);
return *(ret.first->second);
}
RtpSession& RtpSessionTable::getSession(const std::string & call_id)
{
RtpSessionMap::iterator it = map_.find(call_id);
if(it!=map_.end())
return *(it->second);
throw std::runtime_error("session not found");
}
RtpSessionMap::iterator RtpSessionTable::getBeginUnlocked()
{
return map_.begin();
}
RtpSessionMap::iterator RtpSessionTable::getEndUnlocked()
{
return map_.end();
}
void RtpSessionTable::clear()
{
Lock lock(mutex_);
map_.clear();
}
bool RtpSessionTable::empty()
{
Lock lock(mutex_);
return map_.empty();
}
Mutex& RtpSessionTable::getMutex()
{
return mutex_;
}
|
