Commit | Line | Data |
---|---|---|
70407e86 | 1 | /* This file is part of the Linux Trace Toolkit viewer |
277e5b53 | 2 | * Copyright (C) 2009, 2010 Benjamin Poirier <benjamin.poirier@polymtl.ca> |
70407e86 | 3 | * |
277e5b53 BP |
4 | * This program is free software: you can redistribute it and/or modify it |
5 | * under the terms of the GNU Lesser General Public License as published by | |
6 | * the Free Software Foundation, either version 2.1 of the License, or (at | |
7 | * your option) any later version. | |
70407e86 | 8 | * |
277e5b53 BP |
9 | * This program is distributed in the hope that it will be useful, but WITHOUT |
10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public | |
12 | * License for more details. | |
70407e86 | 13 | * |
277e5b53 BP |
14 | * You should have received a copy of the GNU Lesser General Public License |
15 | * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
70407e86 BP |
16 | */ |
17 | ||
18 | #ifdef HAVE_CONFIG_H | |
19 | #include <config.h> | |
20 | #endif | |
21 | ||
22 | #include <arpa/inet.h> | |
23 | #include <glib.h> | |
24 | #include <stdint.h> | |
25 | #include <stdio.h> | |
26 | #include <stdlib.h> | |
27 | #include <string.h> | |
28 | ||
08365995 BP |
29 | #include <unistd.h> |
30 | ||
70407e86 BP |
31 | #include "lookup3.h" |
32 | ||
10341d26 | 33 | #include "data_structures.h" |
70407e86 BP |
34 | |
35 | ||
70407e86 BP |
36 | // TCP sequence numbers use clock arithmetic, these comparison functions take |
37 | // that into account | |
38 | #define SEQ_LT(a,b) ((int32_t)((a)-(b)) < 0) | |
39 | #define SEQ_LEQ(a,b) ((int32_t)((a)-(b)) <= 0) | |
40 | #define SEQ_GT(a,b) ((int32_t)((a)-(b)) > 0) | |
41 | #define SEQ_GEQ(a,b) ((int32_t)((a)-(b)) >= 0) | |
42 | ||
43 | ||
44 | /* | |
45 | * Compare two ConnectionKey structures | |
46 | * | |
47 | * Returns: | |
48 | * true if each field of the structure is equal | |
49 | * false otherwise | |
50 | */ | |
51 | bool connectionKeyEqual(const ConnectionKey* const a, const | |
52 | ConnectionKey* const b) | |
53 | { | |
54 | if (a->saddr == b->saddr && a->daddr == b->daddr && a->source == b->source | |
55 | && a->dest == b->dest) | |
56 | { | |
57 | return true; | |
58 | } | |
59 | else | |
60 | { | |
61 | return false; | |
62 | } | |
63 | } | |
64 | ||
65 | ||
66 | /* | |
67 | * Check if a packet is an acknowledge of another packet. | |
68 | * | |
69 | * Args: | |
10341d26 BP |
70 | * ackSegment packet that is the confirmation |
71 | * ackedSegment packet that contains the original data, both packets have to | |
72 | * come from the same direction of the same connection. Both | |
73 | * messages have to contain TCP events. | |
70407e86 | 74 | */ |
10341d26 BP |
75 | bool isAcking(const Message* const ackSegment, const Message* const |
76 | ackedSegment) | |
70407e86 | 77 | { |
10341d26 BP |
78 | g_assert(ackSegment->inE->type == TCP); |
79 | g_assert(ackSegment->outE->type == TCP); | |
80 | ||
81 | if (SEQ_GT(ackSegment->inE->event.tcpEvent->segmentKey->ack_seq, | |
82 | ackedSegment->inE->event.tcpEvent->segmentKey->seq)) | |
70407e86 BP |
83 | { |
84 | return true; | |
85 | } | |
86 | else | |
87 | { | |
88 | return false; | |
89 | } | |
90 | } | |
91 | ||
92 | ||
93 | /* | |
94 | * Convert an IP address from 32 bit form to dotted quad | |
95 | * | |
96 | * Args: | |
d4721e1a | 97 | * str: A preallocated string of length >= 16 |
70407e86 BP |
98 | * addr: Address |
99 | */ | |
100 | void convertIP(char* const str, const uint32_t addr) | |
101 | { | |
d4721e1a | 102 | strcpy(str, inet_ntoa((struct in_addr) {.s_addr= addr})); |
70407e86 BP |
103 | } |
104 | ||
105 | ||
106 | /* | |
10341d26 | 107 | * Print the content of a TCP Message structure |
70407e86 | 108 | */ |
10341d26 | 109 | void printTCPSegment(const Message* const segment) |
70407e86 | 110 | { |
d4721e1a | 111 | char saddr[16], daddr[16]; |
10341d26 BP |
112 | SegmentKey* segmentKey; |
113 | ||
114 | g_assert(segment->inE->type == TCP); | |
115 | g_assert(segment->inE->event.tcpEvent->segmentKey == | |
116 | segment->outE->event.tcpEvent->segmentKey); | |
70407e86 | 117 | |
10341d26 | 118 | segmentKey= segment->inE->event.tcpEvent->segmentKey; |
70407e86 | 119 | |
10341d26 BP |
120 | convertIP(saddr, segmentKey->connectionKey.saddr); |
121 | convertIP(daddr, segmentKey->connectionKey.daddr); | |
70407e86 BP |
122 | g_debug("%s:%u to %s:%u tot_len: %u ihl: %u seq: %u ack_seq: %u doff: %u " |
123 | "ack: %u rst: %u syn: %u fin: %u", saddr, | |
10341d26 BP |
124 | segmentKey->connectionKey.source, daddr, segmentKey->connectionKey.dest, |
125 | segmentKey->tot_len, segmentKey->ihl, segmentKey->seq, | |
126 | segmentKey->ack_seq, segmentKey->doff, segmentKey->ack, segmentKey->rst, | |
127 | segmentKey->syn, segmentKey->fin); | |
70407e86 BP |
128 | } |
129 | ||
130 | ||
131 | /* | |
132 | * A GHashFunc for g_hash_table_new() | |
133 | * | |
10341d26 BP |
134 | * This function is for indexing TCPEvents in unMatched lists. All fields of |
135 | * the corresponding SegmentKey must match for two keys to be equal. | |
70407e86 BP |
136 | * |
137 | * Args: | |
10341d26 BP |
138 | * key SegmentKey* |
139 | * | |
140 | * Returns: | |
141 | * A hash of all fields in the SegmentKey | |
70407e86 | 142 | */ |
10341d26 | 143 | guint ghfSegmentKeyHash(gconstpointer key) |
70407e86 | 144 | { |
10341d26 | 145 | const SegmentKey* p; |
70407e86 BP |
146 | uint32_t a, b, c; |
147 | ||
10341d26 | 148 | p= (SegmentKey*) key; |
70407e86 BP |
149 | |
150 | a= p->connectionKey.source + (p->connectionKey.dest << 16); | |
151 | b= p->connectionKey.saddr; | |
152 | c= p->connectionKey.daddr; | |
153 | mix(a, b, c); | |
154 | ||
155 | a+= p->ihl + (p->tot_len << 8) + (p->doff << 24); | |
156 | b+= p->seq; | |
157 | c+= p->ack_seq; | |
158 | mix(a, b, c); | |
159 | ||
160 | a+= p->ack + (p->rst << 8) + (p->syn << 16) + (p->fin << 24); | |
161 | final(a, b, c); | |
162 | ||
10341d26 BP |
163 | g_debug("segment key hash %p: %u", p, c); |
164 | ||
70407e86 BP |
165 | return c; |
166 | } | |
167 | ||
168 | ||
169 | /* | |
170 | * A GEqualFunc for g_hash_table_new() | |
171 | * | |
10341d26 BP |
172 | * This function is for indexing TCPEvents in unMatched lists. All fields of |
173 | * the corresponding SegmentKey must match for two keys to be equal. | |
70407e86 BP |
174 | * |
175 | * Args: | |
10341d26 | 176 | * a, b SegmentKey* |
70407e86 BP |
177 | * |
178 | * Returns: | |
179 | * TRUE if both values are equal | |
180 | */ | |
10341d26 | 181 | gboolean gefSegmentKeyEqual(gconstpointer a, gconstpointer b) |
70407e86 | 182 | { |
10341d26 BP |
183 | const SegmentKey* sA, * sB; |
184 | ||
185 | sA= (SegmentKey*) a; | |
186 | sB= (SegmentKey*) b; | |
187 | ||
188 | if (connectionKeyEqual(&sA->connectionKey, &sB->connectionKey) && | |
189 | sA->ihl == sB->ihl && | |
190 | sA->tot_len == sB->tot_len && | |
191 | sA->seq == sB->seq && | |
192 | sA->ack_seq == sB->ack_seq && | |
193 | sA->doff == sB->doff && | |
194 | sA->ack == sB->ack && | |
195 | sA->rst == sB->rst && | |
196 | sA->syn == sB->syn && | |
197 | sA->fin == sB->fin) | |
70407e86 | 198 | { |
10341d26 | 199 | g_debug("segment key equal %p %p: TRUE", sA, sB); |
70407e86 BP |
200 | return TRUE; |
201 | } | |
202 | else | |
203 | { | |
10341d26 | 204 | g_debug("segment key equal %p %p: FALSE", sA, sB); |
70407e86 BP |
205 | return FALSE; |
206 | } | |
207 | } | |
208 | ||
209 | ||
210 | /* | |
211 | * A GDestroyNotify function for g_hash_table_new_full() | |
212 | * | |
213 | * Args: | |
10341d26 | 214 | * data: Event* |
70407e86 | 215 | */ |
10341d26 | 216 | void gdnDestroyEvent(gpointer data) |
70407e86 | 217 | { |
10341d26 BP |
218 | Event* event= data; |
219 | ||
220 | event->destroy(event); | |
70407e86 BP |
221 | } |
222 | ||
223 | ||
224 | /* | |
225 | * A GDestroyNotify function for g_hash_table_new_full() | |
226 | * | |
227 | * Args: | |
228 | * data: GQueue* list[Packet] | |
229 | */ | |
10341d26 | 230 | void gdnTCPSegmentListDestroy(gpointer data) |
70407e86 BP |
231 | { |
232 | GQueue* list; | |
233 | ||
234 | list= (GQueue*) data; | |
235 | ||
10341d26 | 236 | g_queue_foreach(list, &gfTCPSegmentDestroy, NULL); |
70407e86 BP |
237 | g_queue_free(list); |
238 | } | |
239 | ||
240 | ||
241 | /* | |
242 | * A GFunc for g_queue_foreach() | |
243 | * | |
244 | * Args: | |
10341d26 | 245 | * data Message*, TCP message to destroy |
70407e86 BP |
246 | * user_data NULL |
247 | */ | |
10341d26 | 248 | void gfTCPSegmentDestroy(gpointer data, gpointer user_data) |
70407e86 | 249 | { |
10341d26 | 250 | destroyTCPSegment((Message*) data); |
70407e86 BP |
251 | } |
252 | ||
253 | ||
254 | /* | |
10341d26 | 255 | * Free the memory used by a TCP Message and the memory of all its associated |
70407e86 | 256 | * resources |
10341d26 BP |
257 | * |
258 | * Args: | |
259 | * segment TCP Message to destroy | |
70407e86 | 260 | */ |
10341d26 | 261 | void destroyTCPSegment(Message* const segment) |
70407e86 | 262 | { |
10341d26 BP |
263 | TCPEvent* inE, *outE; |
264 | ||
10341d26 | 265 | segment->print(segment); |
70407e86 | 266 | |
10341d26 BP |
267 | g_assert(segment->inE != NULL && segment->outE != NULL); |
268 | g_assert(segment->inE->type == TCP && segment->outE->type == TCP); | |
269 | inE= segment->inE->event.tcpEvent; | |
270 | outE= segment->outE->event.tcpEvent; | |
271 | g_assert(inE->segmentKey == outE->segmentKey); | |
70407e86 | 272 | |
10341d26 | 273 | outE->segmentKey= NULL; |
70407e86 | 274 | |
10341d26 BP |
275 | destroyTCPEvent(segment->inE); |
276 | destroyTCPEvent(segment->outE); | |
70407e86 | 277 | |
10341d26 BP |
278 | free(segment); |
279 | } | |
280 | ||
281 | ||
282 | /* | |
283 | * Free the memory used by a TCP Exchange and the memory of SOME of its | |
284 | * associated resources. The message is not destroyed. Use destroyTCPSegment() | |
285 | * to free it. | |
286 | * | |
287 | * Args: | |
288 | * exchange TCP Exchange to destroy. The .message must be NULL | |
289 | */ | |
290 | void destroyTCPExchange(Exchange* const exchange) | |
291 | { | |
292 | g_assert(exchange->message == NULL); | |
293 | ||
294 | if (exchange->acks != NULL) | |
70407e86 | 295 | { |
10341d26 BP |
296 | g_queue_foreach(exchange->acks, &gfTCPSegmentDestroy, NULL); |
297 | g_queue_free(exchange->acks); | |
70407e86 BP |
298 | } |
299 | ||
10341d26 | 300 | free(exchange); |
70407e86 BP |
301 | } |
302 | ||
303 | ||
304 | /* | |
10341d26 | 305 | * Free the memory used by a TCP Event and its associated resources |
70407e86 | 306 | */ |
10341d26 | 307 | void destroyTCPEvent(Event* const event) |
70407e86 | 308 | { |
10341d26 | 309 | g_assert(event->type == TCP); |
70407e86 | 310 | |
10341d26 | 311 | if (event->event.tcpEvent->segmentKey != NULL) |
70407e86 | 312 | { |
10341d26 | 313 | free(event->event.tcpEvent->segmentKey); |
70407e86 | 314 | } |
10341d26 BP |
315 | free(event->event.tcpEvent); |
316 | event->event.tcpEvent= NULL; | |
317 | destroyEvent(event); | |
318 | } | |
319 | ||
d4721e1a | 320 | |
10341d26 BP |
321 | /* |
322 | * Free the memory used by a base Event | |
323 | */ | |
324 | void destroyEvent(Event* const event) | |
325 | { | |
326 | g_assert(event->event.tcpEvent == NULL); | |
327 | ||
70407e86 BP |
328 | free(event); |
329 | } | |
330 | ||
331 | ||
10341d26 BP |
332 | /* |
333 | * Free the memory used by a UDP Event and its associated resources | |
334 | */ | |
335 | void destroyUDPEvent(Event* const event) | |
336 | { | |
337 | g_assert(event->type == UDP); | |
338 | ||
339 | if (event->event.udpEvent->datagramKey != NULL) | |
340 | { | |
341 | free(event->event.udpEvent->datagramKey); | |
342 | } | |
343 | free(event->event.udpEvent); | |
344 | event->event.udpEvent= NULL; | |
345 | destroyEvent(event); | |
346 | } | |
347 | ||
348 | ||
70407e86 BP |
349 | /* |
350 | * A GCompareFunc for g_queue_find_custom() | |
351 | * | |
352 | * Args: | |
10341d26 BP |
353 | * a Message* acked packet |
354 | * b Message* ack packet | |
70407e86 BP |
355 | * |
356 | * Returns: | |
357 | * 0 if b acks a | |
358 | */ | |
10341d26 | 359 | gint gcfTCPSegmentAckCompare(gconstpointer a, gconstpointer b) |
70407e86 | 360 | { |
10341d26 | 361 | if (isAcking((const Message*) b, (const Message*) a)) |
70407e86 BP |
362 | { |
363 | return 0; | |
364 | } | |
365 | else | |
366 | { | |
367 | return 1; | |
368 | } | |
369 | } | |
370 | ||
371 | ||
372 | /* | |
373 | * A GHashFunc for g_hash_table_new() | |
374 | * | |
375 | * Hash TCP connection keys. Here are a few possible implementations: | |
376 | * | |
377 | * 2.4 kernels used tcp_hashfn() | |
378 | * | |
379 | * I've seen something about an XOR hash: | |
380 | * http://tservice.net.ru/~s0mbre/blog/2006/05/14#2006_05_14: | |
381 | * unsigned int h = (laddr ^ lport) ^ (faddr ^ fport); | |
382 | * h ^= h >> 16; | |
383 | * h ^= h >> 8; | |
384 | * return h; | |
385 | * | |
386 | * In 2.6 kernels, inet_ehashfn() handles connection hashing with the help of | |
387 | * Jenkins hashing, jhash.h | |
388 | * | |
389 | * This function uses jenkins hashing. The hash is not the same for packets in | |
390 | * opposite directions of the same connection. (Hence the name | |
391 | * connection*key*hash) | |
392 | * | |
393 | * Args: | |
394 | * key ConnectionKey* | |
395 | */ | |
396 | guint ghfConnectionKeyHash(gconstpointer key) | |
397 | { | |
398 | ConnectionKey* connectionKey; | |
399 | uint32_t a, b, c; | |
400 | ||
401 | connectionKey= (ConnectionKey*) key; | |
402 | ||
403 | a= connectionKey->source + (connectionKey->dest << 16); | |
404 | b= connectionKey->saddr; | |
405 | c= connectionKey->daddr; | |
406 | final(a, b, c); | |
407 | ||
408 | return c; | |
409 | } | |
410 | ||
411 | ||
412 | /* | |
413 | * A GEqualFunc for g_hash_table_new() | |
414 | * | |
415 | * Args: | |
416 | * a, b ConnectionKey* | |
417 | * | |
418 | * Returns: | |
419 | * TRUE if both values are equal | |
420 | */ | |
421 | gboolean gefConnectionKeyEqual(gconstpointer a, gconstpointer b) | |
422 | { | |
423 | // Two packets in the same direction | |
424 | if (connectionKeyEqual((const ConnectionKey*) a, (const ConnectionKey*) b)) | |
425 | { | |
426 | return TRUE; | |
427 | } | |
428 | else | |
429 | { | |
430 | return FALSE; | |
431 | } | |
432 | } | |
433 | ||
434 | ||
435 | /* | |
436 | * A GDestroyNotify function for g_hash_table_new_full() | |
437 | * | |
438 | * Args: | |
439 | * data: ConnectionKey* | |
440 | */ | |
441 | void gdnConnectionKeyDestroy(gpointer data) | |
442 | { | |
443 | free((ConnectionKey*) data); | |
444 | } | |
f6691532 BP |
445 | |
446 | ||
447 | /* | |
448 | * A GHashFunc for g_hash_table_new() | |
449 | * | |
450 | * Args: | |
451 | * key DatagramKey* | |
452 | */ | |
453 | guint ghfDatagramKeyHash(gconstpointer key) | |
454 | { | |
455 | DatagramKey* datagramKey; | |
456 | uint32_t a, b, c; | |
457 | ||
458 | datagramKey= (DatagramKey*) key; | |
459 | ||
460 | a= datagramKey->saddr; | |
461 | b= datagramKey->daddr; | |
462 | c= datagramKey->source + (datagramKey->dest << 16); | |
463 | mix(a, b, c); | |
464 | ||
465 | a+= datagramKey->ulen; // 16 bits left here | |
466 | b+= *((uint32_t*) datagramKey->dataKey); | |
467 | c+= *((uint32_t*) ((void*) datagramKey->dataKey + 4)); | |
468 | final(a, b, c); | |
469 | ||
470 | return c; | |
471 | } | |
472 | ||
473 | ||
474 | /* | |
475 | * A GEqualFunc for g_hash_table_new() | |
476 | * | |
477 | * Args: | |
478 | * a, b DatagramKey* | |
479 | * | |
480 | * Returns: | |
481 | * TRUE if both values are equal | |
482 | */ | |
483 | gboolean gefDatagramKeyEqual(gconstpointer a, gconstpointer b) | |
484 | { | |
485 | const DatagramKey* dA, * dB; | |
486 | ||
487 | dA= (DatagramKey*) a; | |
488 | dB= (DatagramKey*) b; | |
489 | ||
490 | if (dA->saddr == dB->saddr && dA->daddr == dB->daddr && | |
491 | dA->source == dB->source && dA->dest == dB->dest && | |
492 | dA->ulen == dB->ulen && | |
493 | memcmp(dA->dataKey, dB->dataKey, sizeof(dA->dataKey)) == 0) | |
494 | { | |
495 | return TRUE; | |
496 | } | |
497 | else | |
498 | { | |
499 | return FALSE; | |
500 | } | |
501 | } | |
502 | ||
503 | ||
504 | /* | |
505 | * A GDestroyNotify function for g_hash_table_new_full() | |
506 | * | |
507 | * Args: | |
508 | * data: DatagramKey* | |
509 | */ | |
510 | void gdnDestroyDatagramKey(gpointer data) | |
511 | { | |
512 | free((DatagramKey*) data); | |
513 | } | |
514 | ||
515 | ||
516 | /* | |
517 | * A GDestroyNotify function for g_hash_table_new_full() | |
518 | * | |
519 | * Args: | |
520 | * data: Broadcast* | |
521 | */ | |
522 | void gdnDestroyBroadcast(gpointer data) | |
523 | { | |
524 | destroyBroadcast((Broadcast*) data); | |
525 | } | |
526 | ||
527 | ||
528 | /* | |
529 | * Free a Broadcast struct and its associated ressources | |
530 | * | |
531 | * Args: | |
532 | * broadcast: Broadcast* | |
533 | */ | |
534 | void destroyBroadcast(Broadcast* const broadcast) | |
535 | { | |
536 | g_queue_foreach(broadcast->events, &gfDestroyEvent, NULL); | |
d4721e1a | 537 | g_queue_free(broadcast->events); |
f6691532 BP |
538 | free(broadcast); |
539 | } | |
540 | ||
541 | ||
542 | /* | |
543 | * A GFunc for g_queue_foreach() | |
544 | * | |
545 | * Args: | |
546 | * data Event* | |
547 | * user_data NULL | |
548 | */ | |
549 | void gfDestroyEvent(gpointer data, gpointer user_data) | |
550 | { | |
551 | Event* event= data; | |
552 | ||
553 | event->destroy(event); | |
554 | } | |
76be6fc2 BP |
555 | |
556 | ||
557 | /* Subtract two WallTime structs | |
558 | * | |
559 | * Args: | |
560 | * tA, tB: WallTime | |
561 | * | |
562 | * Returns: | |
563 | * The result of tA - tB, as a double. This may incur a loss of | |
564 | * precision. | |
565 | */ | |
566 | double wallTimeSub(const WallTime const* tA, const WallTime const* tB) | |
567 | { | |
d4721e1a BP |
568 | return (double) tA->seconds - tB->seconds + ((double) tA->nanosec - tB->nanosec) / 1e9; |
569 | } | |
570 | ||
571 | ||
572 | /* | |
573 | * Allocate and copy a base event | |
574 | * | |
575 | * Args: | |
576 | * newEvent: new event, pointer will be updated | |
577 | * event: event to copy | |
578 | */ | |
579 | void copyEvent(const Event* const event, Event** const newEvent) | |
580 | { | |
581 | g_assert(event->event.tcpEvent == NULL); | |
582 | ||
583 | *newEvent= malloc(sizeof(Event)); | |
584 | memcpy(*newEvent, event, sizeof(Event)); | |
585 | } | |
586 | ||
587 | ||
588 | /* | |
589 | * Allocate and copy a TCP event | |
590 | * | |
591 | * Args: | |
592 | * newEvent: new event, pointer will be updated | |
593 | * event: event to copy | |
594 | */ | |
595 | void copyTCPEvent(const Event* const event, Event** const newEvent) | |
596 | { | |
597 | g_assert(event->type == TCP); | |
598 | ||
599 | *newEvent= malloc(sizeof(Event)); | |
600 | memcpy(*newEvent, event, sizeof(Event)); | |
601 | ||
602 | (*newEvent)->event.tcpEvent= malloc(sizeof(TCPEvent)); | |
603 | memcpy((*newEvent)->event.tcpEvent, event->event.tcpEvent, | |
604 | sizeof(TCPEvent)); | |
605 | ||
606 | (*newEvent)->event.tcpEvent->segmentKey= malloc(sizeof(SegmentKey)); | |
607 | memcpy((*newEvent)->event.tcpEvent->segmentKey, | |
608 | event->event.tcpEvent->segmentKey, sizeof(SegmentKey)); | |
609 | } | |
610 | ||
611 | ||
612 | /* | |
613 | * Allocate and copy a UDP event | |
614 | * | |
615 | * Args: | |
616 | * newEvent: new event, pointer will be updated | |
617 | * event: event to copy | |
618 | */ | |
619 | void copyUDPEvent(const Event* const event, Event** const newEvent) | |
620 | { | |
621 | g_assert(event->type == UDP); | |
622 | ||
623 | *newEvent= malloc(sizeof(Event)); | |
624 | memcpy(*newEvent, event, sizeof(Event)); | |
625 | ||
626 | (*newEvent)->event.udpEvent= malloc(sizeof(UDPEvent)); | |
627 | memcpy((*newEvent)->event.udpEvent, event->event.udpEvent, | |
628 | sizeof(UDPEvent)); | |
629 | ||
630 | (*newEvent)->event.udpEvent->datagramKey= malloc(sizeof(DatagramKey)); | |
631 | memcpy((*newEvent)->event.udpEvent->datagramKey, | |
632 | event->event.udpEvent->datagramKey, sizeof(DatagramKey)); | |
76be6fc2 | 633 | } |
66eaf2eb BP |
634 | |
635 | ||
636 | /* | |
637 | * A GFunc for g_queue_foreach() | |
638 | * | |
639 | * Args: | |
640 | * data Event*, event to add | |
641 | * user_data GArray*, array to add to | |
642 | */ | |
643 | void gfAddEventToArray(gpointer data, gpointer user_data) | |
644 | { | |
645 | g_array_append_val((GArray*) user_data, data); | |
646 | } |