WebSVN – HelenOS – Diff – /branches/network/uspace/srv/net/structures/measured_strings.c


/*
 * Copyright (c) 2009 Lukas Mejdrech
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup net
 *  @{
 */
 
/** @file
 *  Character string with measured length implementation.
 *  @see measured_strings.h
 */
 
#include <errno.h>
#include <malloc.h>
#include <mem.h>
#include <unistd.h>
 
#include <ipc/ipc.h>
 
#include "../err.h"
#include "../modules.h"
 
#include "measured_strings.h"
 
/** Computes the lengths of the measured strings in the given array.
 *  @param strings The measured strings array to be processed. Input parameter.
 *  @param count The measured strings array size. Input parameter.
 *  @returns The computed sizes array.
 *  @returns NULL if there is not enough memory left.
 */
size_t *    prepare_lengths( const measured_string_ref strings, size_t count );
 
measured_string_ref measured_string_create_bulk( const char * string, size_t length ){
    measured_string_ref new;
 
    if( length == 0 ){
        while( string[ length ] ) ++ length;
    }
    new = ( measured_string_ref ) malloc( sizeof( measured_string_t ) + ( sizeof( char ) * ( length + 1 )));
    if( ! new ) return NULL;
    new->length = length;
    new->value = (( char * ) new ) + sizeof( measured_string_t );
    // append terminating zero explicitly - to be safe
    memcpy( new->value, string, new->length );
    new->value[ new->length ] = '\0';
    return new;
}
 
measured_string_ref measured_string_copy( measured_string_ref source ){
    measured_string_ref new;
 
    if( ! source ) return NULL;
    new = ( measured_string_ref ) malloc( sizeof( measured_string_t ));
    if( new ){
        new->value = ( char * ) malloc( source->length + 1 );
        if( new->value ){
            new->length = source->length;
            memcpy( new->value, source->value, new->length );
            new->value[ new->length ] = '\0';
            return new;
        }else{
            free( new );
        }
    }
    return NULL;
}
 
int measured_strings_receive( measured_string_ref * strings, char ** data, size_t count ){
    ERROR_DECLARE;
 
    size_t *        lengths;
    size_t          index;
    size_t          length;
    char *          next;
    ipc_callid_t    callid;
 
    if(( ! strings ) || ( ! data ) || ( count <= 0 )){
        return EINVAL;
    }
    lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));
    if( ! lengths ) return ENOMEM;
    if(( ! ipc_data_write_receive( & callid, & length ))
    || ( length != sizeof( size_t ) * ( count + 1 ))){
        free( lengths );
        return EINVAL;
    }
    if( ERROR_OCCURRED( ipc_data_write_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){
        free( lengths );
        return ERROR_CODE;
    }
    * data = malloc( lengths[ count ] );
    if( !( * data )) return ENOMEM;
    ( * data )[ lengths[ count ] - 1 ] = '\0';
    * strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count );
    if( !( * strings )){
        free( lengths );
        free( * data );
        return ENOMEM;
    }
    next = * data;
    for( index = 0; index < count; ++ index ){
        ( * strings)[ index ].length = lengths[ index ];
        if( lengths[ index ] > 0 ){
            if(( ! ipc_data_write_receive( & callid, & length ))
            || ( length != lengths[ index ] )){
                free( * data );
                free( * strings );
                free( lengths );
                return EINVAL;
            }
            ERROR_PROPAGATE( ipc_data_write_finalize( callid, next, lengths[ index ] ));
            ( * strings)[ index ].value = next;
            next += lengths[ index ];
            * next = '\0';
            ++ next;
        }else{
            ( * strings )[ index ].value = NULL;
        }
    }
    free( lengths );
    return EOK;
}
 
int measured_strings_reply( const measured_string_ref strings, size_t count ){
    ERROR_DECLARE;
 
    size_t *        lengths;
    size_t          index;
    size_t          length;
    ipc_callid_t    callid;
 
    if(( ! strings ) || ( count <= 0 )){
        return EINVAL;
    }
    lengths = prepare_lengths( strings, count );
    if( ! lengths ) return ENOMEM;
    if(( ! ipc_data_read_receive( & callid, & length ))
    || ( length != sizeof( size_t ) * ( count + 1 ))){
        free( lengths );
        return EINVAL;
    }
    if( ERROR_OCCURRED( ipc_data_read_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){
        free( lengths );
        return ERROR_CODE;
    }
    free( lengths );
    for( index = 0; index < count; ++ index ){
        if( strings[ index ].length > 0 ){
            if(( ! ipc_data_read_receive( & callid, & length ))
            || ( length != strings[ index ].length )){
                return EINVAL;
            }
            ERROR_PROPAGATE( ipc_data_read_finalize( callid, strings[ index ].value, strings[ index ].length ));
        }
    }
    return EOK;
}
 
int measured_strings_return( int phone, measured_string_ref * strings, char ** data, size_t count ){
    ERROR_DECLARE;
 
    size_t *    lengths;
    size_t      index;
    char *      next;
 
    if(( phone <= 0 ) || ( ! strings ) || ( ! data ) || ( count <= 0 )){
        return EINVAL;
    }
    lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));
    if( ! lengths ) return ENOMEM;
    if( ERROR_OCCURRED( ipc_data_read_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){
        free( lengths );
        return ERROR_CODE;
    }
    * data = malloc( lengths[ count ] );
    if( !( * data )) return ENOMEM;
    * strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count );
    if( !( * strings )){
        free( lengths );
        free( * data );
        return ENOMEM;
    }
    next = * data;
    for( index = 0; index < count; ++ index ){
        ( * strings )[ index ].length = lengths[ index ];
        if( lengths[ index ] > 0 ){
            ERROR_PROPAGATE( ipc_data_read_start( phone, next, lengths[ index ] ));
            ( * strings )[ index ].value = next;
            next += lengths[ index ];
            * next = '\0';
            ++ next;
        }else{
            ( * strings )[ index ].value = NULL;
        }
    }
    free( lengths );
    return EOK;
}
 
int measured_strings_send( int phone, const measured_string_ref strings, size_t count ){
    ERROR_DECLARE;
 
    size_t *    lengths;
    size_t      index;
 
    if(( phone <= 0 ) || ( ! strings ) || ( count <= 0 )){
        return EINVAL;
    }
    lengths = prepare_lengths( strings, count );
    if( ! lengths ) return ENOMEM;
    if( ERROR_OCCURRED( ipc_data_write_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){
        free( lengths );
        return ERROR_CODE;
    }
    free( lengths );
    for( index = 0; index < count; ++ index ){
        if( strings[ index ].length > 0 ){
            ERROR_PROPAGATE( ipc_data_write_start( phone, strings[ index ].value, strings[ index ].length ));
        }
    }
    return EOK;
}
 
size_t * prepare_lengths( const measured_string_ref strings, size_t count ){
    size_t *    lengths;
    int         index;
    size_t      length;
 
    lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));
    if( ! lengths ) return NULL;
    length = 0;
    for( index = 0; index < count; ++ index ){
        lengths[ index ] = strings[ index ].length;
        length += lengths[ index ] + 1;
    }
    lengths[ count ] = length;
    return lengths;
}
 
/** @}
 */
 
 

Rev 4243	Rev 4271
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 <mem.h>	40	#include <mem.h>
41	#include <unistd.h>	41	#include <unistd.h>
42		42
43	#include <ipc/ipc.h>	43	#include <ipc/ipc.h>
44		44
45	#include "../err.h"	45	#include "../err.h"
46	#include "../modules.h"	46	#include "../modules.h"
47		47
48	#include "measured_strings.h"	48	#include "measured_strings.h"
49		49
50	/** Computes the lengths of the measured strings in the given array.	50	/** Computes the lengths of the measured strings in the given array.
51	* @param strings The measured strings array to be processed. Input parameter.	51	* @param strings The measured strings array to be processed. Input parameter.
52	* @param count The measured strings array size. Input parameter.	52	* @param count The measured strings array size. Input parameter.
53	* @returns The computed sizes array.	53	* @returns The computed sizes array.
54	* @returns NULL if there is not enough memory left.	54	* @returns NULL if there is not enough memory left.
55	*/	55	*/
56	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 );
57		57
58	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 ){
59	measured_string_ref new;	59	measured_string_ref new;
60		60
61	if( length == 0 ){	61	if( length == 0 ){
62	while( string[ length ] ) ++ length;	62	while( string[ length ] ) ++ length;
63	}	63	}
64	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 )));
65	if( ! new ) return NULL;	65	if( ! new ) return NULL;
66	new->length = length;	66	new->length = length;
67	new->value = (( char * ) new ) + sizeof( measured_string_t );	67	new->value = (( char * ) new ) + sizeof( measured_string_t );
68	// append terminating zero explicitly - to be safe	68	// append terminating zero explicitly - to be safe
69	memcpy( new->value, string, new->length );	69	memcpy( new->value, string, new->length );
70	new->value[ new->length ] = '\0';	70	new->value[ new->length ] = '\0';
71	return new;	71	return new;
72	}	72	}
73		73
-		74	measured_string_ref measured_string_copy( measured_string_ref source ){
-		75	measured_string_ref new;
-		76
-		77	if( ! source ) return NULL;
-		78	new = ( measured_string_ref ) malloc( sizeof( measured_string_t ));
-		79	if( new ){
-		80	new->value = ( char * ) malloc( source->length + 1 );
-		81	if( new->value ){
-		82	new->length = source->length;
-		83	memcpy( new->value, source->value, new->length );
-		84	new->value[ new->length ] = '\0';
-		85	return new;
-		86	}else{
-		87	free( new );
-		88	}
-		89	}
-		90	return NULL;
-		91	}
-		92
74	int measured_strings_receive( measured_string_ref * strings, char ** data, size_t count ){	93	int measured_strings_receive( measured_string_ref * strings, char ** data, size_t count ){
75	ERROR_DECLARE;	94	ERROR_DECLARE;
76		95
77	size_t * lengths;	96	size_t * lengths;
78	size_t index;	97	size_t index;
79	size_t length;	98	size_t length;
80	char * next;	99	char * next;
81	ipc_callid_t callid;	100	ipc_callid_t callid;
82		101
83	if(( ! strings ) \|\| ( ! data ) \|\| ( count <= 0 )){	102	if(( ! strings ) \|\| ( ! data ) \|\| ( count <= 0 )){
84	return EINVAL;	103	return EINVAL;
85	}	104	}
86	lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));	105	lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));
87	if( ! lengths ) return ENOMEM;	106	if( ! lengths ) return ENOMEM;
88	if(( ! ipc_data_write_receive( & callid, & length ))	107	if(( ! ipc_data_write_receive( & callid, & length ))
89	\|\| ( length != sizeof( size_t ) * ( count + 1 ))){	108	\|\| ( length != sizeof( size_t ) * ( count + 1 ))){
90	free( lengths );	109	free( lengths );
91	return EINVAL;	110	return EINVAL;
92	}	111	}
93	if( ERROR_OCCURRED( ipc_data_write_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){	112	if( ERROR_OCCURRED( ipc_data_write_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){
94	free( lengths );	113	free( lengths );
95	return ERROR_CODE;	114	return ERROR_CODE;
96	}	115	}
97	* data = malloc( lengths[ count ] );	116	* data = malloc( lengths[ count ] );
98	if( !( * data )) return ENOMEM;	117	if( !( * data )) return ENOMEM;
99	( * data )[ lengths[ count ] - 1 ] = '\0';	118	( * data )[ lengths[ count ] - 1 ] = '\0';
100	* strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count );	119	* strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count );
101	if( !( * strings )){	120	if( !( * strings )){
102	free( lengths );	121	free( lengths );
103	free( * data );	122	free( * data );
104	return ENOMEM;	123	return ENOMEM;
105	}	124	}
106	next = * data;	125	next = * data;
107	for( index = 0; index < count; ++ index ){	126	for( index = 0; index < count; ++ index ){
108	( * strings)[ index ].length = lengths[ index ];	127	( * strings)[ index ].length = lengths[ index ];
109	if( lengths[ index ] > 0 ){	128	if( lengths[ index ] > 0 ){
110	if(( ! ipc_data_write_receive( & callid, & length ))	129	if(( ! ipc_data_write_receive( & callid, & length ))
111	\|\| ( length != lengths[ index ] )){	130	\|\| ( length != lengths[ index ] )){
112	free( * data );	131	free( * data );
113	free( * strings );	132	free( * strings );
114	free( lengths );	133	free( lengths );
115	return EINVAL;	134	return EINVAL;
116	}	135	}
117	ERROR_PROPAGATE( ipc_data_write_finalize( callid, next, lengths[ index ] ));	136	ERROR_PROPAGATE( ipc_data_write_finalize( callid, next, lengths[ index ] ));
118	( * strings)[ index ].value = next;	137	( * strings)[ index ].value = next;
119	next += lengths[ index ];	138	next += lengths[ index ];
120	* next = '\0';	139	* next = '\0';
121	++ next;	140	++ next;
122	}else{	141	}else{
123	( * strings )[ index ].value = NULL;	142	( * strings )[ index ].value = NULL;
124	}	143	}
125	}	144	}
126	free( lengths );	145	free( lengths );
127	return EOK;	146	return EOK;
128	}	147	}
129		148
130	int measured_strings_reply( const measured_string_ref strings, size_t count ){	149	int measured_strings_reply( const measured_string_ref strings, size_t count ){
131	ERROR_DECLARE;	150	ERROR_DECLARE;
132		151
133	size_t * lengths;	152	size_t * lengths;
134	size_t index;	153	size_t index;
135	size_t length;	154	size_t length;
136	ipc_callid_t callid;	155	ipc_callid_t callid;
137		156
138	if(( ! strings ) \|\| ( count <= 0 )){	157	if(( ! strings ) \|\| ( count <= 0 )){
139	return EINVAL;	158	return EINVAL;
140	}	159	}
141	lengths = prepare_lengths( strings, count );	160	lengths = prepare_lengths( strings, count );
142	if( ! lengths ) return ENOMEM;	161	if( ! lengths ) return ENOMEM;
143	if(( ! ipc_data_read_receive( & callid, & length ))	162	if(( ! ipc_data_read_receive( & callid, & length ))
144	\|\| ( length != sizeof( size_t ) * ( count + 1 ))){	163	\|\| ( length != sizeof( size_t ) * ( count + 1 ))){
145	free( lengths );	164	free( lengths );
146	return EINVAL;	165	return EINVAL;
147	}	166	}
148	if( ERROR_OCCURRED( ipc_data_read_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){	167	if( ERROR_OCCURRED( ipc_data_read_finalize( callid, lengths, sizeof( size_t ) * ( count + 1 )))){
149	free( lengths );	168	free( lengths );
150	return ERROR_CODE;	169	return ERROR_CODE;
151	}	170	}
152	free( lengths );	171	free( lengths );
153	for( index = 0; index < count; ++ index ){	172	for( index = 0; index < count; ++ index ){
154	if( strings[ index ].length > 0 ){	173	if( strings[ index ].length > 0 ){
155	if(( ! ipc_data_read_receive( & callid, & length ))	174	if(( ! ipc_data_read_receive( & callid, & length ))
156	\|\| ( length != strings[ index ].length )){	175	\|\| ( length != strings[ index ].length )){
157	return EINVAL;	176	return EINVAL;
158	}	177	}
159	ERROR_PROPAGATE( ipc_data_read_finalize( callid, strings[ index ].value, strings[ index ].length ));	178	ERROR_PROPAGATE( ipc_data_read_finalize( callid, strings[ index ].value, strings[ index ].length ));
160	}	179	}
161	}	180	}
162	return EOK;	181	return EOK;
163	}	182	}
164		183
165	int measured_strings_return( int phone, measured_string_ref * strings, char ** data, size_t count ){	184	int measured_strings_return( int phone, measured_string_ref * strings, char ** data, size_t count ){
166	ERROR_DECLARE;	185	ERROR_DECLARE;
167		186
168	size_t * lengths;	187	size_t * lengths;
169	size_t index;	188	size_t index;
170	char * next;	189	char * next;
171		190
172	if(( phone <= 0 ) \|\| ( ! strings ) \|\| ( ! data ) \|\| ( count <= 0 )){	191	if(( phone <= 0 ) \|\| ( ! strings ) \|\| ( ! data ) \|\| ( count <= 0 )){
173	return EINVAL;	192	return EINVAL;
174	}	193	}
175	lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));	194	lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));
176	if( ! lengths ) return ENOMEM;	195	if( ! lengths ) return ENOMEM;
177	if( ERROR_OCCURRED( ipc_data_read_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){	196	if( ERROR_OCCURRED( ipc_data_read_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){
178	free( lengths );	197	free( lengths );
179	return ERROR_CODE;	198	return ERROR_CODE;
180	}	199	}
181	* data = malloc( lengths[ count ] );	200	* data = malloc( lengths[ count ] );
182	if( !( * data )) return ENOMEM;	201	if( !( * data )) return ENOMEM;
183	* strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count );	202	* strings = ( measured_string_ref ) malloc( sizeof( measured_string_t ) * count );
184	if( !( * strings )){	203	if( !( * strings )){
185	free( lengths );	204	free( lengths );
186	free( * data );	205	free( * data );
187	return ENOMEM;	206	return ENOMEM;
188	}	207	}
189	next = * data;	208	next = * data;
190	for( index = 0; index < count; ++ index ){	209	for( index = 0; index < count; ++ index ){
191	( * strings )[ index ].length = lengths[ index ];	210	( * strings )[ index ].length = lengths[ index ];
192	if( lengths[ index ] > 0 ){	211	if( lengths[ index ] > 0 ){
193	ERROR_PROPAGATE( ipc_data_read_start( phone, next, lengths[ index ] ));	212	ERROR_PROPAGATE( ipc_data_read_start( phone, next, lengths[ index ] ));
194	( * strings )[ index ].value = next;	213	( * strings )[ index ].value = next;
195	next += lengths[ index ];	214	next += lengths[ index ];
196	* next = '\0';	215	* next = '\0';
197	++ next;	216	++ next;
198	}else{	217	}else{
199	( * strings )[ index ].value = NULL;	218	( * strings )[ index ].value = NULL;
200	}	219	}
201	}	220	}
202	free( lengths );	221	free( lengths );
203	return EOK;	222	return EOK;
204	}	223	}
205		224
206	int measured_strings_send( int phone, const measured_string_ref strings, size_t count ){	225	int measured_strings_send( int phone, const measured_string_ref strings, size_t count ){
207	ERROR_DECLARE;	226	ERROR_DECLARE;
208		227
209	size_t * lengths;	228	size_t * lengths;
210	size_t index;	229	size_t index;
211		230
212	if(( phone <= 0 ) \|\| ( ! strings ) \|\| ( count <= 0 )){	231	if(( phone <= 0 ) \|\| ( ! strings ) \|\| ( count <= 0 )){
213	return EINVAL;	232	return EINVAL;
214	}	233	}
215	lengths = prepare_lengths( strings, count );	234	lengths = prepare_lengths( strings, count );
216	if( ! lengths ) return ENOMEM;	235	if( ! lengths ) return ENOMEM;
217	if( ERROR_OCCURRED( ipc_data_write_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){	236	if( ERROR_OCCURRED( ipc_data_write_start( phone, lengths, sizeof( size_t ) * ( count + 1 )))){
218	free( lengths );	237	free( lengths );
219	return ERROR_CODE;	238	return ERROR_CODE;
220	}	239	}
221	free( lengths );	240	free( lengths );
222	for( index = 0; index < count; ++ index ){	241	for( index = 0; index < count; ++ index ){
223	if( strings[ index ].length > 0 ){	242	if( strings[ index ].length > 0 ){
224	ERROR_PROPAGATE( ipc_data_write_start( phone, strings[ index ].value, strings[ index ].length ));	243	ERROR_PROPAGATE( ipc_data_write_start( phone, strings[ index ].value, strings[ index ].length ));
225	}	244	}
226	}	245	}
227	return EOK;	246	return EOK;
228	}	247	}
229		248
230	size_t * prepare_lengths( const measured_string_ref strings, size_t count ){	249	size_t * prepare_lengths( const measured_string_ref strings, size_t count ){
231	size_t * lengths;	250	size_t * lengths;
232	int index;	251	int index;
233	size_t length;	252	size_t length;
234		253
235	lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));	254	lengths = ( size_t * ) malloc( sizeof( size_t ) * ( count + 1 ));
236	if( ! lengths ) return NULL;	255	if( ! lengths ) return NULL;
237	length = 0;	256	length = 0;
238	for( index = 0; index < count; ++ index ){	257	for( index = 0; index < count; ++ index ){
239	lengths[ index ] = strings[ index ].length;	258	lengths[ index ] = strings[ index ].length;
240	length += lengths[ index ] + 1;	259	length += lengths[ index ] + 1;
241	}	260	}
242	lengths[ count ] = length;	261	lengths[ count ] = length;
243	return lengths;	262	return lengths;
244	}	263	}
245		264
246	/** @}	265	/** @}
247	*/	266	*/
248		267
249		268

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/net/structures/measured_strings.c @ 4756 – Rev 4243 → 4271