Rev 3901 | Rev 3914 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
3901 | mejdrech | 1 | /* |
3912 | mejdrech | 2 | * Copyright (c) 2009 Lukas Mejdrech |
3901 | mejdrech | 3 | * All rights reserved. |
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
3912 | mejdrech | 29 | /** @addtogroup packet |
3901 | mejdrech | 30 | * @{ |
31 | */ |
||
32 | |||
33 | /** @file |
||
3912 | mejdrech | 34 | * Packet server implementation. |
3901 | mejdrech | 35 | */ |
36 | |||
37 | #include <async.h> |
||
38 | #include <align.h> |
||
39 | #include <errno.h> |
||
40 | //#include <stdio.h> |
||
41 | #include <unistd.h> |
||
42 | |||
43 | #include <ipc/ipc.h> |
||
44 | #include <ipc/services.h> |
||
45 | #include <sys/mman.h> |
||
46 | |||
47 | #include "../../err.h" |
||
48 | #include "../../messages.h" |
||
49 | |||
50 | #include "packet.h" |
||
51 | #include "packet_header.h" |
||
52 | #include "packet_server.h" |
||
53 | |||
3912 | mejdrech | 54 | /** Returns the packet identifier message parameter. |
55 | */ |
||
3901 | mejdrech | 56 | #define IPC_GET_ID( call ) ( packet_id_t ) IPC_GET_ARG1( * call ) |
3912 | mejdrech | 57 | |
58 | /** Returns the owner message parameter. |
||
59 | */ |
||
3901 | mejdrech | 60 | #define IPC_GET_OWNER( call ) ( services_t ) IPC_GET_ARG1( * call ) |
3912 | mejdrech | 61 | |
62 | /** Returns the maximal content length message parameter. |
||
63 | */ |
||
3901 | mejdrech | 64 | #define IPC_GET_CONTENT( call ) ( size_t ) IPC_GET_ARG2( * call ) |
3912 | mejdrech | 65 | |
66 | /** Returns the maximal address length message parameter. |
||
67 | */ |
||
3901 | mejdrech | 68 | #define IPC_GET_ADDR_LEN( call ) ( size_t ) IPC_GET_ARG3( * call ) |
3912 | mejdrech | 69 | |
70 | /** Returns the maximal prefix length message parameter. |
||
71 | */ |
||
3901 | mejdrech | 72 | #define IPC_GET_PREFIX( call ) ( size_t ) IPC_GET_ARG4( * call ) |
3912 | mejdrech | 73 | |
74 | /** Returns the maximal suffix length message parameter. |
||
75 | */ |
||
3901 | mejdrech | 76 | #define IPC_GET_SUFIX( call ) ( size_t ) IPC_GET_ARG5( * call ) |
77 | |||
78 | #define FREE_QUEUES_COUNT 7 |
||
79 | |||
3912 | mejdrech | 80 | /** Packet server global data. |
81 | */ |
||
3901 | mejdrech | 82 | static struct{ |
3912 | mejdrech | 83 | /** Free packet queues. |
84 | */ |
||
3901 | mejdrech | 85 | packet_t free[ FREE_QUEUES_COUNT ]; |
3912 | mejdrech | 86 | /** Packet length upper bounds of the free packet queues. |
87 | * The maximal lengths of packets in each queue in the ascending order. |
||
88 | * The last queue is not limited. |
||
89 | */ |
||
3901 | mejdrech | 90 | int sizes[ FREE_QUEUES_COUNT ]; |
3912 | mejdrech | 91 | /** Total packets allocated. |
92 | */ |
||
3901 | mejdrech | 93 | unsigned int count; |
94 | } ps_globals = { |
||
95 | { NULL, NULL, NULL, NULL, NULL, NULL, NULL }, |
||
96 | { PAGE_SIZE, PAGE_SIZE * 2, PAGE_SIZE * 4, PAGE_SIZE * 8, PAGE_SIZE * 16, PAGE_SIZE * 32, PAGE_SIZE * 64 }, |
||
97 | |||
98 | }; |
||
99 | |||
3912 | mejdrech | 100 | /** Releases the packet and returns it to the appropriate free packet queue. |
101 | * @param packet The packet to be released. Input parameter. |
||
102 | */ |
||
3901 | mejdrech | 103 | void packet_release( packet_t packet ); |
3912 | mejdrech | 104 | |
105 | /** Returns the packet of dimensions at least as given. |
||
106 | * Tries to reuse free packets first. |
||
107 | * Creates a new packet aligned to the memory page size if none available. |
||
108 | * @param owner The new owner of the packet. Input parameter. |
||
109 | * @param addr_len The source and destination addresses maximal length in bytes. Input parameter. |
||
110 | * @param max_prefix The maximal prefix length in bytes. Input parameter. |
||
111 | * @param max_content The maximal content length in bytes. Input parameter. |
||
112 | * @param max_suffix The maximal suffix length in bytes. Input parameter. |
||
113 | * @returns The packet of dimensions at least as given. |
||
114 | * @returns NULL if there is not enough memory left. |
||
115 | */ |
||
116 | packet_t packet_get( services_t owner, size_t addr_len, size_t max_prefix, size_t max_content, size_t max_suffix ); |
||
117 | |||
118 | /** Creates a new packet of dimensions at least as given. |
||
119 | * @param length The total length of the packet, including the header, the addresses and the data of the packet. Input parameter. |
||
120 | * @param owner The new owner of the packet. Input parameter. |
||
121 | * @param addr_len The source and destination addresses maximal length in bytes. Input parameter. |
||
122 | * @param max_prefix The maximal prefix length in bytes. Input parameter. |
||
123 | * @param max_content The maximal content length in bytes. Input parameter. |
||
124 | * @param max_suffix The maximal suffix length in bytes. Input parameter. |
||
125 | * @returns The packet of dimensions at least as given. |
||
126 | * @returns NULL if there is not enough memory left. |
||
127 | */ |
||
128 | packet_t packet_create( size_t length, services_t owner, size_t addr_len, size_t max_prefix, size_t max_content, size_t max_suffix ); |
||
129 | |||
130 | /** Initializes the packet according to the given dimensions. |
||
131 | * @param packet The packet to be initialized. Input parameter. |
||
132 | * @param owner The new owner of the packet. Input parameter. |
||
133 | * @param addr_len The source and destination addresses maximal length in bytes. Input parameter. |
||
134 | * @param max_prefix The maximal prefix length in bytes. Input parameter. |
||
135 | * @param max_content The maximal content length in bytes. Input parameter. |
||
136 | * @param max_suffix The maximal suffix length in bytes. Input parameter. |
||
137 | */ |
||
138 | void packet_init( packet_t packet, services_t owner, size_t addr_len, size_t max_prefix, size_t max_content, size_t max_suffix ); |
||
139 | |||
140 | /** Shares the packet memory block. |
||
141 | * @param packet The packet to be shared. |
||
142 | * @returns EOK on success. |
||
143 | * @returns EINVAL if the packet is not valid. |
||
144 | * @returns EINVAL if the calling module does not accept the memory. |
||
145 | * @returns ENOMEM if the desired and actual sizes differ. |
||
146 | * @returns Other error codes as defined for the ipc_share_in_finalize() function. |
||
147 | */ |
||
3901 | mejdrech | 148 | int packet_reply( const packet_t packet ); |
149 | |||
150 | int packet_server_message( ipc_callid_t callid, ipc_call_t * call, ipc_call_t * answer, int * answer_count ){ |
||
151 | packet_t packet; |
||
152 | |||
153 | * answer_count = 0; |
||
154 | switch( IPC_GET_METHOD( * call )){ |
||
155 | case IPC_M_PHONE_HUNGUP: |
||
156 | return EOK; |
||
157 | case NET_PACKET_CREATE_1: |
||
158 | packet = packet_get( IPC_GET_OWNER( call ), 0, 0, IPC_GET_CONTENT( call ), 0 ); |
||
159 | if( ! packet ) return ENOMEM; |
||
160 | * answer_count = 2; |
||
161 | IPC_SET_ARG1( * answer, packet->packet_id ); |
||
162 | IPC_SET_ARG2( * answer, packet->length ); |
||
163 | return EOK; |
||
164 | case NET_PACKET_CREATE_5: |
||
165 | packet = packet_get( IPC_GET_OWNER( call ), IPC_GET_ADDR_LEN( call ), IPC_GET_PREFIX( call ), IPC_GET_CONTENT( call ), IPC_GET_SUFIX( call )); |
||
166 | if( ! packet ) return ENOMEM; |
||
167 | * answer_count = 2; |
||
168 | IPC_SET_ARG1( * answer, packet->packet_id ); |
||
169 | IPC_SET_ARG2( * answer, packet->length ); |
||
170 | return EOK; |
||
171 | case NET_PACKET_GET: |
||
172 | packet = pm_find( IPC_GET_ID( call )); |
||
173 | if( ! packet_is_valid( packet )) return ENOENT; |
||
174 | return packet_reply( packet ); |
||
175 | case NET_PACKET_GET_SIZE: |
||
176 | packet = pm_find( IPC_GET_ID( call )); |
||
177 | if( ! packet_is_valid( packet )) return ENOENT; |
||
178 | * answer_count = 1; |
||
179 | IPC_SET_ARG1( * answer, packet->length ); |
||
180 | return EOK; |
||
181 | case NET_PACKET_RELEASE: |
||
182 | packet = pm_find( IPC_GET_ID( call )); |
||
183 | if( ! packet_is_valid( packet )) return ENOENT; |
||
184 | pq_destroy( packet, packet_release ); |
||
185 | return EOK; |
||
186 | } |
||
187 | return ENOTSUP; |
||
188 | } |
||
189 | |||
190 | void packet_release( packet_t packet ){ |
||
191 | int index; |
||
192 | |||
193 | for( index = 0; ( index < FREE_QUEUES_COUNT - 1 ) && ( packet->length > ps_globals.sizes[ index ] ); ++ index ); |
||
194 | ps_globals.free[ index ] = pq_add( ps_globals.free[ index ], packet, packet->length, packet->length ); |
||
195 | } |
||
196 | |||
3912 | mejdrech | 197 | packet_t packet_get( services_t owner, size_t addr_len, size_t max_prefix, size_t max_content, size_t max_suffix ){ |
3901 | mejdrech | 198 | int index; |
199 | packet_t packet; |
||
200 | size_t length; |
||
201 | |||
3912 | mejdrech | 202 | length = ALIGN_UP( sizeof( struct packet ) + 2 * addr_len + max_prefix + max_content + max_suffix, PAGE_SIZE ); |
3901 | mejdrech | 203 | for( index = 0; index < FREE_QUEUES_COUNT - 1; ++ index ){ |
204 | if( length <= ps_globals.sizes[ index ] ){ |
||
205 | packet = ps_globals.free[ index ]; |
||
206 | while( packet_is_valid( packet ) && ( packet->length < length )){ |
||
207 | packet = pm_find( packet->next ); |
||
208 | } |
||
209 | if( packet ){ |
||
3912 | mejdrech | 210 | packet_init( packet, owner, addr_len, max_prefix, max_content, max_suffix ); |
3901 | mejdrech | 211 | return packet; |
212 | } |
||
213 | } |
||
214 | } |
||
3912 | mejdrech | 215 | return packet_create( length, owner, addr_len, max_prefix, max_content, max_suffix ); |
3901 | mejdrech | 216 | } |
217 | |||
3912 | mejdrech | 218 | packet_t packet_create( size_t length, services_t owner, size_t addr_len, size_t max_prefix, size_t max_content, size_t max_suffix ){ |
3901 | mejdrech | 219 | ERROR_DECLARE; |
220 | |||
221 | packet_t packet; |
||
222 | |||
223 | packet = ( packet_t ) mmap( NULL, length, PROTO_READ | PROTO_WRITE, MAP_SHARED | MAP_ANONYMOUS, 0, 0 ); |
||
224 | if( packet == MAP_FAILED ) return NULL; |
||
225 | ++ ps_globals.count; |
||
226 | packet->packet_id = ps_globals.count; |
||
3912 | mejdrech | 227 | packet->mode = PM_ONE_WAY; |
3901 | mejdrech | 228 | packet->length = length; |
3912 | mejdrech | 229 | packet_init( packet, owner, addr_len, max_prefix, max_content, max_suffix ); |
3901 | mejdrech | 230 | packet->magic_value = PACKET_MAGIC_VALUE; |
3912 | mejdrech | 231 | if( ERROR_OCCURRED( pm_add( packet ))){ |
3901 | mejdrech | 232 | munmap( packet, packet->length ); |
233 | return NULL; |
||
234 | } |
||
235 | packet_release( packet ); |
||
236 | return packet; |
||
237 | } |
||
238 | |||
3912 | mejdrech | 239 | void packet_init( packet_t packet, services_t owner, size_t addr_len, size_t max_prefix, size_t max_content, size_t max_suffix ){ |
3901 | mejdrech | 240 | packet->owner = owner; |
241 | packet->order = 0; |
||
242 | packet->metric = 0; |
||
243 | packet->previous = 0; |
||
244 | packet->next = 0; |
||
245 | packet->addr_len = addr_len; |
||
246 | packet->src_addr = sizeof( struct packet ); |
||
247 | packet->dest_addr = packet->src_addr + packet->addr_len; |
||
248 | packet->max_prefix = max_prefix; |
||
249 | packet->max_content = max_content; |
||
250 | packet->data_start = packet->dest_addr + packet->addr_len + packet->max_prefix; |
||
251 | packet->data_end = packet->data_start; |
||
252 | } |
||
253 | |||
254 | int packet_reply( const packet_t packet ){ |
||
255 | ipc_callid_t callid; |
||
256 | size_t size; |
||
257 | |||
258 | if( ! packet_is_valid( packet )) return EINVAL; |
||
259 | if( ipc_share_in_receive( & callid, & size ) <= 0 ) return EINVAL; |
||
260 | if( size != packet->length ) return ENOMEM; |
||
261 | return ipc_share_in_finalize( callid, packet, PROTO_READ | PROTO_WRITE ); |
||
262 | } |
||
263 | |||
264 | /** @} |
||
265 | */ |