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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/*
* 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 anytun.org <satp@wirdorange.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2
* as published by the Free Software Foundation.
*
* 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 (see the file COPYING included with this
* distribution); if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _THREADUTILS_HPP_
#define _THREADUTILS_HPP_
#include <stdexcept>
#include <pthread.h>
#include <semaphore.h>
class Mutex
{
public:
Mutex()
{
if(pthread_mutex_init(&mutex,NULL))
throw std::runtime_error("can't create mutex");
}
~Mutex()
{
pthread_mutex_destroy(&mutex);
}
private:
Mutex(const Mutex& src);
void operator=(const Mutex& src);
void lock()
{
if(pthread_mutex_lock(&mutex))
throw std::runtime_error("can't lock mutex");
}
void unlock()
{
if(pthread_mutex_unlock(&mutex))
throw std::runtime_error("can't unlock mutex");
}
friend class Lock;
friend class Condition;
pthread_mutex_t mutex;
};
class Lock
{
public:
Lock(Mutex &m) : mutex(m)
{
mutex.lock();
}
~Lock()
{
mutex.unlock();
}
private:
Lock(const Lock& src);
void operator=(const Lock& src);
Mutex &mutex;
};
class Condition
{
public:
Condition()
{
if(pthread_cond_init(&cond, NULL))
throw std::runtime_error("can't create condition");
}
~Condition()
{
pthread_cond_destroy(&cond);
}
void wait()
{
mutex.lock();
if(pthread_cond_wait(&cond, &mutex.mutex))
{
mutex.unlock();
throw std::runtime_error("error on waiting for condition");
}
mutex.unlock();
}
void signal()
{
mutex.lock();
if(pthread_cond_signal(&cond))
{
mutex.unlock();
throw std::runtime_error("can't signal condition");
}
mutex.unlock();
}
void broadcast()
{
mutex.lock();
if(pthread_cond_broadcast(&cond))
{
mutex.unlock();
throw std::runtime_error("can't broadcast condition");
}
mutex.unlock();
}
private:
pthread_cond_t cond;
Mutex mutex;
};
class Semaphore
{
public:
Semaphore(unsigned int initVal=0)
{
if(sem_init(&sem, 0, initVal))
throw std::runtime_error("can't create semaphore");
}
~Semaphore()
{
sem_destroy(&sem);
}
void down()
{
if(sem_wait(&sem))
throw std::runtime_error("error on semaphore down");
}
void up()
{
if(sem_post(&sem))
throw std::runtime_error("error on semaphore up");
}
private:
sem_t sem;
};
#endif
|
