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
|
/***************************************************************************
* __________ __ ___.
* Open \______ \ ____ ____ | | _\_ |__ _______ ___
* Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
* Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
* Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
* \/ \/ \/ \/ \/
* $Id$
*
* Copyright (C) 2009 Wincent Balin
*
* 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 software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
* KIND, either express or implied.
*
****************************************************************************/
#include "plugin.h"
#include "pdbox.h"
/* Datagram pool will contains 16 datagrams. */
#define MAX_DATAGRAMS 16
/* Datagram pool. */
struct datagram datagrams[MAX_DATAGRAMS];
/* UDP message queues. */
struct event_queue gui_to_core;
struct event_queue core_to_gui;
/* Initialize net infrastructure. */
void net_init(void)
{
unsigned int i;
/* Initialize message pool. */
for(i = 0; i < MAX_DATAGRAMS; i++)
datagrams[i].used = false;
/* Initialize and register message queues. */
rb->queue_init(&gui_to_core, true);
rb->queue_init(&core_to_gui, true);
}
/* Send datagram. */
bool send_datagram(struct event_queue* route,
int port,
char* data,
size_t size)
{
unsigned int i;
/* If datagram too long, abort. */
if(size > MAX_DATAGRAM_SIZE)
return false;
/* Find free datagram buffer. */
for(i = 0; i < MAX_DATAGRAMS; i++)
if(!datagrams[i].used)
break;
/* If no free buffer found, abort. */
if(i == MAX_DATAGRAMS)
return false;
/* Copy datagram to the buffer. */
memcpy(datagrams[i].data, data, size);
datagrams[i].size = size;
/* Mark datagram buffer as used. */
datagrams[i].used = true;
/* Send event via route. */
rb->queue_post(route, port, (intptr_t) &datagrams[i]);
/* Everything went ok. */
return true;
}
/* Receive datagram. */
bool receive_datagram(struct event_queue* route,
int port,
struct datagram* buffer)
{
struct queue_event event;
/* If route queue empty, abort. */
if(rb->queue_empty(route))
return false;
/* Receive event. */
rb->queue_wait(route, &event);
/* If wrong port, abort.
NOTE: Event is removed from the queue in any case! */
if(event.id != port)
return false;
/* Copy datagram. */
memcpy(buffer, (struct datagram*) event.data, sizeof(struct datagram));
/* Clear datagram event. */
memset(((struct datagram*) event.data)->data,
0,
((struct datagram*) event.data)->size);
/* Free datagram event. */
((struct datagram*) event.data)->used = false;
/* Everything went ok. */
return true;
}
/* Destroy net infrastructure. */
void net_destroy(void)
{
/* Remove message queues. */
rb->queue_delete(&gui_to_core);
rb->queue_delete(&core_to_gui);
}
|
