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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
/* -*- C++ -*-
* Copyright (C) 2003,2004 Thiago Macieira <thiago.macieira@kdemail.net>
*
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <config.h>
#include <sys/types.h>
#include <sys/socket.h>
#include "ksocketaddress.h"
#include "kresolver.h"
#include "ksocketdevice.h"
#include "kdatagramsocket.h"
using namespace KNetwork;
/*
* TODO:
*
* don't use signals and slots to track state changes: use stateChanging
*
*/
KDatagramSocket::KDatagramSocket(QObject* parent, const char *name)
: KClientSocketBase(parent, name), d(0L)
{
peerResolver().setFamily(KResolver::KnownFamily);
localResolver().setFamily(KResolver::KnownFamily);
peerResolver().setSocketType(SOCK_DGRAM);
localResolver().setSocketType(SOCK_DGRAM);
localResolver().setFlags(KResolver::Passive);
// QObject::connect(localResolver(), SIGNAL(finished(KResolverResults)),
// this, SLOT(lookupFinishedLocal()));
QObject::connect(&peerResolver(), SIGNAL(finished(KResolverResults)),
this, SLOT(lookupFinishedPeer()));
QObject::connect(this, SIGNAL(hostFound()), this, SLOT(lookupFinishedLocal()));
}
KDatagramSocket::~KDatagramSocket()
{
// KClientSocketBase's destructor closes the socket
//delete d;
}
bool KDatagramSocket::bind(const QString& node, const QString& service)
{
if (state() >= Bound)
return false;
if (localResolver().isRunning())
localResolver().cancel(false);
// no, we must do a host lookup
localResolver().setAddress(node, service);
if (!lookup())
return false;
// see if lookup has finished already
// this also catches blocking mode, since lookup has to finish
// its processing if we're in blocking mode
if (state() > HostLookup)
return doBind();
return true;
}
bool KDatagramSocket::connect(const QString& node, const QString& service)
{
if (state() >= Connected)
return true; // already connected
if (peerResolver().nodeName() != node ||
peerResolver().serviceName() != service)
peerResolver().setAddress(node, service); // this resets the resolver's state
// KClientSocketBase::lookup only works if the state is Idle or HostLookup
// therefore, we store the old state, call the lookup routine and then set
// it back.
SocketState s = state();
setState(s == Connecting ? HostLookup : Idle);
bool ok = lookup();
if (!ok)
{
setState(s); // go back
return false;
}
// check if lookup is finished
// if we're in blocking mode, then the lookup has to be finished
if (state() == HostLookup)
{
// it hasn't finished
setState(Connecting);
emit stateChanged(Connecting);
return true;
}
// it has to be finished here
if (state() != Connected)
{
setState(Connecting);
emit stateChanged(Connecting);
lookupFinishedPeer();
}
return state() == Connected;
}
KDatagramPacket KDatagramSocket::receive()
{
Q_LONG size = bytesAvailable();
if (size == 0)
{
// nothing available yet to read
// wait for data if we're not blocking
if (blocking())
socketDevice()->waitForMore(-1); // wait forever
else
{
// mimic error
setError(IO_ReadError, WouldBlock);
emit gotError(WouldBlock);
return KDatagramPacket();
}
// try again
size = bytesAvailable();
}
QByteArray data(size);
KSocketAddress address;
// now do the reading
size = readBlock(data.data(), size, address);
if (size < 0)
// error has been set
return KDatagramPacket();
data.resize(size); // just to be sure
return KDatagramPacket(data, address);
}
Q_LONG KDatagramSocket::send(const KDatagramPacket& packet)
{
return writeBlock(packet.data(), packet.size(), packet.address());
}
Q_LONG KDatagramSocket::writeBlock(const char *data, Q_ULONG len, const KSocketAddress& to)
{
if (to.family() != AF_UNSPEC)
{
// make sure the socket is open at this point
if (!socketDevice()->isOpen())
// error handling will happen below
socketDevice()->create(to.family(), SOCK_DGRAM, 0);
}
return KClientSocketBase::writeBlock(data, len, to);
}
void KDatagramSocket::lookupFinishedLocal()
{
// bind lookup has finished and succeeded
// state() == HostFound
if (!doBind())
return; // failed binding
if (peerResults().count() > 0)
{
setState(Connecting);
emit stateChanged(Connecting);
lookupFinishedPeer();
}
}
void KDatagramSocket::lookupFinishedPeer()
{
// this function is called by lookupFinishedLocal above
// and is also connected to a signal
// so it might be called twice.
if (state() != Connecting)
return;
if (peerResults().count() == 0)
{
setState(Unconnected);
emit stateChanged(Unconnected);
return;
}
KResolverResults::ConstIterator it = peerResults().begin();
for ( ; it != peerResults().end(); ++it)
if (connect(*it))
{
// weee, we connected
setState(Connected); // this sets up signals
//setupSignals(); // setState sets up the signals
emit stateChanged(Connected);
emit connected(*it);
return;
}
// no connection
copyError();
setState(Unconnected);
emit stateChanged(Unconnected);
emit gotError(error());
}
bool KDatagramSocket::doBind()
{
if (localResults().count() == 0)
return true;
if (state() >= Bound)
return true; // already bound
KResolverResults::ConstIterator it = localResults().begin();
for ( ; it != localResults().end(); ++it)
if (bind(*it))
{
// bound
setupSignals();
return true;
}
// not bound
// no need to set state since it can only be HostFound already
copyError();
emit gotError(error());
return false;
}
void KDatagramSocket::setupSignals()
{
QSocketNotifier *n = socketDevice()->readNotifier();
if (n)
{
n->setEnabled(emitsReadyRead());
QObject::connect(n, SIGNAL(activated(int)), this, SLOT(slotReadActivity()));
}
else
return;
n = socketDevice()->writeNotifier();
if (n)
{
n->setEnabled(emitsReadyWrite());
QObject::connect(n, SIGNAL(activated(int)), this, SLOT(slotWriteActivity()));
}
else
return;
}
#include "kdatagramsocket.moc"
|