Rev 3912 | Rev 4243 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3912 | Rev 4192 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2009 Lukas Mejdrech |
2 | * Copyright (c) 2009 Lukas Mejdrech |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup net |
29 | /** @addtogroup net |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** @file |
33 | /** @file |
34 | * Character string with measured length implementation. |
34 | * Character string with measured length implementation. |
35 | * @see measured_strings.h |
35 | * @see measured_strings.h |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <errno.h> |
38 | #include <errno.h> |
39 | #include <malloc.h> |
39 | #include <malloc.h> |
40 | #include <stdio.h> |
40 | #include <mem.h> |
41 | #include <string.h> |
- | |
42 | #include <unistd.h> |
41 | #include <unistd.h> |
43 | 42 | ||
44 | #include <ipc/ipc.h> |
43 | #include <ipc/ipc.h> |
45 | 44 | ||
46 | #include "../err.h" |
45 | #include "../err.h" |
47 | #include "../modules.h" |
46 | #include "../modules.h" |
48 | 47 | ||
49 | #include "measured_strings.h" |
48 | #include "measured_strings.h" |
50 | 49 | ||
51 | /** Computes the lengths of the measured strings in the given array. |
50 | /** Computes the lengths of the measured strings in the given array. |
52 | * @param strings The measured strings array to be processed. Input parameter. |
51 | * @param strings The measured strings array to be processed. Input parameter. |
53 | * @param count The measured strings array size. Input parameter. |
52 | * @param count The measured strings array size. Input parameter. |
54 | * @returns The computed sizes array. |
53 | * @returns The computed sizes array. |
55 | * @returns NULL if there is not enough memory left. |
54 | * @returns NULL if there is not enough memory left. |
56 | */ |
55 | */ |
57 | size_t * prepare_lengths( const measured_string_ref strings, size_t count ); |
56 | size_t * prepare_lengths( const measured_string_ref strings, size_t count ); |
58 | 57 | ||
59 | measured_string_ref measured_string_create_bulk( const char * string, size_t length ){ |
58 | measured_string_ref measured_string_create_bulk( const char * string, size_t length ){ |
60 | measured_string_ref new; |
59 | measured_string_ref new; |
61 | 60 | ||
62 | if( length == 0 ){ |
61 | if( length == 0 ){ |
63 | while( string[ length ] ) ++ length; |
62 | while( string[ length ] ) ++ length; |
64 | } |
63 | } |
65 | new = ( measured_string_ref ) malloc( sizeof( measured_string_t ) + ( sizeof( char ) * ( length + 1 ))); |
64 | new = ( measured_string_ref ) malloc( sizeof( measured_string_t ) + ( sizeof( char ) * ( length + 1 ))); |
66 | if( ! new ) return NULL; |
65 | if( ! new ) return NULL; |
67 | new->length = length; |
66 | new->length = length; |
68 | new->value = (( char * ) new ) + sizeof( measured_string_t ); |
67 | new->value = (( char * ) new ) + sizeof( measured_string_t ); |
69 | // append terminating zero explicitly - to be safe |
68 | // append terminating zero explicitly - to be safe |
70 | memcpy( new->value, string, new->length ); |
69 | memcpy( new->value, string, new->length ); |
71 | new->value[ new->length ] = '\0'; |
70 | new->value[ new->length ] = '\0'; |
72 | return new; |
71 | return new; |
73 | } |
72 | } |
74 | 73 | ||
75 | int measured_strings_receive( measured_string_ref * strings, char ** data, size_t count ){ |
74 | int measured_strings_receive( measured_string_ref * strings, char ** data, size_t count ){ |
76 | ERROR_DECLARE; |
75 | ERROR_DECLARE; |
77 | 76 | ||
78 | size_t * lengths; |
77 | size_t * lengths; |
79 | int index; |
78 | int index; |
80 | size_t length; |
79 | size_t length; |
81 | char * next; |
80 | char * next; |
82 | ipc_callid_t callid; |
81 | ipc_callid_t callid; |
83 | 82 | ||
84 | if(( ! strings ) || ( ! data ) || ( count <= 0 )){ |
83 | if(( ! strings ) || ( ! data ) || ( count <= 0 )){ |
85 | return EINVAL; |
84 | return EINVAL; |
86 | } |
85 | } |
87 | lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 )); |
86 | lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 )); |
88 | if( ! lengths ) return ENOMEM; |
87 | if( ! lengths ) return ENOMEM; |
89 | if(( ! ipc_data_write_receive( & callid, & length )) |
88 | if(( ! ipc_data_write_receive( & callid, & length )) |
90 | || ( length != sizeof( size_t ) * ( count + 1 ))){ |
89 | || ( length != sizeof( size_t ) * ( count + 1 ))){ |
91 | free( lengths ); |
90 | free( lengths ); |
92 | return EINVAL; |
91 | return EINVAL; |
93 | } |
92 | } |
94 | if( ERROR_OCCURRED( ipc_data_write_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){ |
93 | if( ERROR_OCCURRED( ipc_data_write_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){ |
95 | free( lengths ); |
94 | free( lengths ); |
96 | return ERROR_CODE; |
95 | return ERROR_CODE; |
97 | } |
96 | } |
98 | * data = malloc( lengths[ count ] ); |
97 | * data = malloc( lengths[ count ] ); |
99 | if( !( * data )) return ENOMEM; |
98 | if( !( * data )) return ENOMEM; |
100 | ( * data )[ lengths[ count ] - 1 ] = '\0'; |
99 | ( * data )[ lengths[ count ] - 1 ] = '\0'; |
101 | * strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count ); |
100 | * strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count ); |
102 | if( !( * strings )){ |
101 | if( !( * strings )){ |
103 | free( lengths ); |
102 | free( lengths ); |
104 | free( * data ); |
103 | free( * data ); |
105 | return ENOMEM; |
104 | return ENOMEM; |
106 | } |
105 | } |
107 | next = * data; |
106 | next = * data; |
108 | for( index = 0; index < count; ++ index ){ |
107 | for( index = 0; index < count; ++ index ){ |
109 | ( * strings)[ index ].length = lengths[ index ]; |
108 | ( * strings)[ index ].length = lengths[ index ]; |
110 | if( lengths[ index ] > 0 ){ |
109 | if( lengths[ index ] > 0 ){ |
111 | if(( ! ipc_data_write_receive( & callid, & length )) |
110 | if(( ! ipc_data_write_receive( & callid, & length )) |
112 | || ( length != lengths[ index ] )){ |
111 | || ( length != lengths[ index ] )){ |
113 | free( * data ); |
112 | free( * data ); |
114 | free( * strings ); |
113 | free( * strings ); |
115 | free( lengths ); |
114 | free( lengths ); |
116 | return EINVAL; |
115 | return EINVAL; |
117 | } |
116 | } |
118 | ERROR_PROPAGATE( ipc_data_write_finalize( callid, next, lengths[ index ] )); |
117 | ERROR_PROPAGATE( ipc_data_write_finalize( callid, next, lengths[ index ] )); |
119 | ( * strings)[ index ].value = next; |
118 | ( * strings)[ index ].value = next; |
120 | next += lengths[ index ]; |
119 | next += lengths[ index ]; |
121 | * next = '\0'; |
120 | * next = '\0'; |
122 | ++ next; |
121 | ++ next; |
123 | }else{ |
122 | }else{ |
124 | ( * strings )[ index ].value = NULL; |
123 | ( * strings )[ index ].value = NULL; |
125 | } |
124 | } |
126 | } |
125 | } |
127 | free( lengths ); |
126 | free( lengths ); |
128 | return EOK; |
127 | return EOK; |
129 | } |
128 | } |
130 | 129 | ||
131 | int measured_strings_reply( const measured_string_ref strings, size_t count ){ |
130 | int measured_strings_reply( const measured_string_ref strings, size_t count ){ |
132 | ERROR_DECLARE; |
131 | ERROR_DECLARE; |
133 | 132 | ||
134 | size_t * lengths; |
133 | size_t * lengths; |
135 | int index; |
134 | int index; |
136 | size_t length; |
135 | size_t length; |
137 | ipc_callid_t callid; |
136 | ipc_callid_t callid; |
138 | 137 | ||
139 | if(( ! strings ) || ( count <= 0 )){ |
138 | if(( ! strings ) || ( count <= 0 )){ |
140 | return EINVAL; |
139 | return EINVAL; |
141 | } |
140 | } |
142 | lengths = prepare_lengths( strings, count ); |
141 | lengths = prepare_lengths( strings, count ); |
143 | if( ! lengths ) return ENOMEM; |
142 | if( ! lengths ) return ENOMEM; |
144 | if(( ! ipc_data_read_receive( & callid, & length )) |
143 | if(( ! ipc_data_read_receive( & callid, & length )) |
145 | || ( length != sizeof( size_t ) * ( count + 1 ))){ |
144 | || ( length != sizeof( size_t ) * ( count + 1 ))){ |
146 | free( lengths ); |
145 | free( lengths ); |
147 | return EINVAL; |
146 | return EINVAL; |
148 | } |
147 | } |
149 | if( ERROR_OCCURRED( ipc_data_read_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){ |
148 | if( ERROR_OCCURRED( ipc_data_read_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){ |
150 | free( lengths ); |
149 | free( lengths ); |
151 | return ERROR_CODE; |
150 | return ERROR_CODE; |
152 | } |
151 | } |
153 | free( lengths ); |
152 | free( lengths ); |
154 | for( index = 0; index < count; ++ index ){ |
153 | for( index = 0; index < count; ++ index ){ |
155 | if( strings[ index ].length > 0 ){ |
154 | if( strings[ index ].length > 0 ){ |
156 | if(( ! ipc_data_read_receive( & callid, & length )) |
155 | if(( ! ipc_data_read_receive( & callid, & length )) |
157 | || ( length != strings[ index ].length )){ |
156 | || ( length != strings[ index ].length )){ |
158 | return EINVAL; |
157 | return EINVAL; |
159 | } |
158 | } |
160 | ERROR_PROPAGATE( ipc_data_read_finalize( callid, strings[ index ].value, strings[ index ].length )); |
159 | ERROR_PROPAGATE( ipc_data_read_finalize( callid, strings[ index ].value, strings[ index ].length )); |
161 | } |
160 | } |
162 | } |
161 | } |
163 | return EOK; |
162 | return EOK; |
164 | } |
163 | } |
165 | 164 | ||
166 | int measured_strings_return( int phone, measured_string_ref * strings, char ** data, size_t count ){ |
165 | int measured_strings_return( int phone, measured_string_ref * strings, char ** data, size_t count ){ |
167 | ERROR_DECLARE; |
166 | ERROR_DECLARE; |
168 | 167 | ||
169 | size_t * lengths; |
168 | size_t * lengths; |
170 | int index; |
169 | int index; |
171 | char * next; |
170 | char * next; |
172 | 171 | ||
173 | if(( phone <= 0 ) || ( ! strings ) || ( ! data ) || ( count <= 0 )){ |
172 | if(( phone <= 0 ) || ( ! strings ) || ( ! data ) || ( count <= 0 )){ |
174 | return EINVAL; |
173 | return EINVAL; |
175 | } |
174 | } |
176 | lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 )); |
175 | lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 )); |
177 | if( ! lengths ) return ENOMEM; |
176 | if( ! lengths ) return ENOMEM; |
178 | if( ERROR_OCCURRED( ipc_data_read_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){ |
177 | if( ERROR_OCCURRED( ipc_data_read_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){ |
179 | free( lengths ); |
178 | free( lengths ); |
180 | return ERROR_CODE; |
179 | return ERROR_CODE; |
181 | } |
180 | } |
182 | * data = malloc( lengths[ count ] ); |
181 | * data = malloc( lengths[ count ] ); |
183 | if( !( * data )) return ENOMEM; |
182 | if( !( * data )) return ENOMEM; |
184 | * strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count ); |
183 | * strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count ); |
185 | if( !( * strings )){ |
184 | if( !( * strings )){ |
186 | free( lengths ); |
185 | free( lengths ); |
187 | free( * data ); |
186 | free( * data ); |
188 | return ENOMEM; |
187 | return ENOMEM; |
189 | } |
188 | } |
190 | next = * data; |
189 | next = * data; |
191 | for( index = 0; index < count; ++ index ){ |
190 | for( index = 0; index < count; ++ index ){ |
192 | ( * strings )[ index ].length = lengths[ index ]; |
191 | ( * strings )[ index ].length = lengths[ index ]; |
193 | if( lengths[ index ] > 0 ){ |
192 | if( lengths[ index ] > 0 ){ |
194 | ERROR_PROPAGATE( ipc_data_read_start( phone, next, lengths[ index ] )); |
193 | ERROR_PROPAGATE( ipc_data_read_start( phone, next, lengths[ index ] )); |
195 | ( * strings )[ index ].value = next; |
194 | ( * strings )[ index ].value = next; |
196 | next += lengths[ index ]; |
195 | next += lengths[ index ]; |
197 | * next = '\0'; |
196 | * next = '\0'; |
198 | ++ next; |
197 | ++ next; |
199 | }else{ |
198 | }else{ |
200 | ( * strings )[ index ].value = NULL; |
199 | ( * strings )[ index ].value = NULL; |
201 | } |
200 | } |
202 | } |
201 | } |
203 | free( lengths ); |
202 | free( lengths ); |
204 | return EOK; |
203 | return EOK; |
205 | } |
204 | } |
206 | 205 | ||
207 | int measured_strings_send( int phone, const measured_string_ref strings, size_t count ){ |
206 | int measured_strings_send( int phone, const measured_string_ref strings, size_t count ){ |
208 | ERROR_DECLARE; |
207 | ERROR_DECLARE; |
209 | 208 | ||
210 | size_t * lengths; |
209 | size_t * lengths; |
211 | int index; |
210 | int index; |
212 | 211 | ||
213 | if(( phone <= 0 ) || ( ! strings ) || ( count <= 0 )){ |
212 | if(( phone <= 0 ) || ( ! strings ) || ( count <= 0 )){ |
214 | return EINVAL; |
213 | return EINVAL; |
215 | } |
214 | } |
216 | lengths = prepare_lengths( strings, count ); |
215 | lengths = prepare_lengths( strings, count ); |
217 | if( ! lengths ) return ENOMEM; |
216 | if( ! lengths ) return ENOMEM; |
218 | if( ERROR_OCCURRED( ipc_data_write_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){ |
217 | if( ERROR_OCCURRED( ipc_data_write_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){ |
219 | free( lengths ); |
218 | free( lengths ); |
220 | return ERROR_CODE; |
219 | return ERROR_CODE; |
221 | } |
220 | } |
222 | free( lengths ); |
221 | free( lengths ); |
223 | for( index = 0; index < count; ++ index ){ |
222 | for( index = 0; index < count; ++ index ){ |
224 | if( strings[ index ].length > 0 ){ |
223 | if( strings[ index ].length > 0 ){ |
225 | ERROR_PROPAGATE( ipc_data_write_start( phone, strings[ index ].value, strings[ index ].length )); |
224 | ERROR_PROPAGATE( ipc_data_write_start( phone, strings[ index ].value, strings[ index ].length )); |
226 | } |
225 | } |
227 | } |
226 | } |
228 | return EOK; |
227 | return EOK; |
229 | } |
228 | } |
230 | 229 | ||
231 | size_t * prepare_lengths( const measured_string_ref strings, size_t count ){ |
230 | size_t * prepare_lengths( const measured_string_ref strings, size_t count ){ |
232 | size_t * lengths; |
231 | size_t * lengths; |
233 | int index; |
232 | int index; |
234 | size_t length; |
233 | size_t length; |
235 | 234 | ||
236 | lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 )); |
235 | lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 )); |
237 | if( ! lengths ) return NULL; |
236 | if( ! lengths ) return NULL; |
238 | length = 0; |
237 | length = 0; |
239 | for( index = 0; index < count; ++ index ){ |
238 | for( index = 0; index < count; ++ index ){ |
240 | lengths[ index ] = strings[ index ].length; |
239 | lengths[ index ] = strings[ index ].length; |
241 | length += lengths[ index ] + 1; |
240 | length += lengths[ index ] + 1; |
242 | } |
241 | } |
243 | lengths[ count ] = length; |
242 | lengths[ count ] = length; |
244 | return lengths; |
243 | return lengths; |
245 | } |
244 | } |
246 | 245 | ||
247 | /** @} |
246 | /** @} |
248 | */ |
247 | */ |
249 | 248 | ||
250 | 249 |