WebSVN – HelenOS – Diff – /branches/network/uspace/srv/net/structures/packet/packet_client.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 packet
 *  @{
 */
 
/** @file
 *  Packet client implementation.
 */
 
#include <errno.h>
#include <mem.h>
#include <unistd.h>
//#include <stdio.h>
 
#include <sys/mman.h>
 
#include "../../messages.h"
 
#include "packet.h"
#include "packet_header.h"
#include "packet_client.h"
 
int packet_copy_data( packet_t packet, const void * data, size_t length ){
    if( ! packet_is_valid( packet )) return EINVAL;
    if( packet->data_start + length >= packet->length ) return ENOMEM;
    memcpy(( void * ) packet + packet->data_start, data, length );
    if( packet->data_start + length > packet->data_end ){
        packet->data_end = packet->data_start + length;
    }
    return EOK;
}
 
void * packet_prefix( packet_t packet, size_t length ){
    if(( ! packet_is_valid( packet )) || ( packet->data_start - sizeof( struct packet ) - 2 * ( packet->dest_addr - packet->src_addr ) < length )) return NULL;
    packet->data_start -= length;
    return ( void * ) packet + packet->data_start;
}
 
void * packet_suffix( packet_t packet, size_t length ){
    if(( ! packet_is_valid( packet )) || ( packet->data_end + length >= packet->length )) return NULL;
    packet->data_end += length;
    return ( void * ) packet + packet->data_end - length;
}
 
int packet_trim( packet_t packet, size_t prefix, size_t suffix ){
    if( ! packet_is_valid( packet )) return EINVAL;
    if( prefix + suffix > PACKET_DATA_LENGTH( packet )) return ENOMEM;
    packet->data_start += prefix;
    packet->data_end -= suffix;
    return EOK;
}
 
packet_id_t packet_get_id( const packet_t packet ){
    return packet_is_valid( packet ) ? packet->packet_id : 0;
}
 
int packet_get_addr( const packet_t packet, uint8_t ** src, uint8_t ** dest ){
    if( ! packet_is_valid( packet )) return EINVAL;
    if( ! packet->addr_len ) return 0;
    if( src ) * src = ( void * ) packet + packet->src_addr;
    if( dest ) * dest = ( void * ) packet + packet->dest_addr;
    return packet->addr_len;
}
 
size_t packet_get_data_length( const packet_t packet ){
    if( ! packet_is_valid( packet )) return 0;
    return PACKET_DATA_LENGTH( packet );
}
 
void * packet_get_data( const packet_t packet ){
    if( ! packet_is_valid( packet )) return NULL;
    return ( void * ) packet + packet->data_start;
}
 
int packet_set_addr( packet_t packet, const uint8_t * src, const uint8_t * dest, size_t addr_len ){
    size_t  padding;
    size_t  allocated;
 
    if( ! packet_is_valid( packet )) return EINVAL;
    allocated = PACKET_MAX_ADDRESS_LENGTH( packet );
    if( allocated < addr_len ) return ENOMEM;
    padding = allocated - addr_len;
    packet->addr_len = addr_len;
    if( src ){
        memcpy(( void * ) packet + packet->src_addr, src, addr_len );
        if( padding ) bzero(( void * ) packet + packet->src_addr + addr_len, padding );
    }else{
        bzero(( void * ) packet + packet->src_addr, allocated );
    }
    if( dest ){
        memcpy(( void * ) packet + packet->dest_addr, dest, addr_len );
        if( padding ) bzero(( void * ) packet + packet->dest_addr + addr_len, padding );
    }else{
        bzero(( void * ) packet + packet->dest_addr, allocated );
    }
    return EOK;
}
 
packet_t packet_get_copy( int phone, packet_t packet ){
    packet_t    copy;
    uint8_t *   src;
    uint8_t *   dest;
    size_t      addrlen;
 
    if( ! packet_is_valid( packet )) return NULL;
    // get a new packet
    copy = packet_get_4( phone, PACKET_DATA_LENGTH( packet ), PACKET_MAX_ADDRESS_LENGTH( packet ), packet->max_prefix, PACKET_MIN_SUFFIX( packet ));
    if( ! copy ) return NULL;
    // get addresses
    addrlen = packet_get_addr( packet, & src, & dest );
    // copy data
    if(( packet_copy_data( copy, packet_get_data( packet ), PACKET_DATA_LENGTH( packet )) == EOK )
    // copy addresses if present
    && (( addrlen <= 0 ) || ( packet_set_addr( copy, src, dest, addrlen ) == EOK ))){
        copy->order = packet->order;
        copy->metric = packet->metric;
        return copy;
    }else{
        pq_release( phone, copy->packet_id );
        return NULL;
    }
}
 
/** @}
 */
 

Rev 4505	Rev 4731
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 packet	29	/** @addtogroup packet
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/** @file	33	/** @file
34	* Packet client implementation.	34	* Packet client implementation.
35	*/	35	*/
36		36
37	#include <errno.h>	37	#include <errno.h>
38	#include <mem.h>	38	#include <mem.h>
39	#include <unistd.h>	39	#include <unistd.h>
40	//#include <stdio.h>	40	//#include <stdio.h>
41		41
42	#include <sys/mman.h>	42	#include <sys/mman.h>
43		43
44	#include "../../messages.h"	44	#include "../../messages.h"
45		45
46	#include "packet.h"	46	#include "packet.h"
47	#include "packet_header.h"	47	#include "packet_header.h"
48	#include "packet_client.h"	48	#include "packet_client.h"
49		49
50	int packet_copy_data( packet_t packet, const void * data, size_t length ){	50	int packet_copy_data( packet_t packet, const void * data, size_t length ){
51	if( ! packet_is_valid( packet )) return EINVAL;	51	if( ! packet_is_valid( packet )) return EINVAL;
52	if( packet->data_start + length >= packet->length ) return ENOMEM;	52	if( packet->data_start + length >= packet->length ) return ENOMEM;
53	memcpy(( void * ) packet + packet->data_start, data, length );	53	memcpy(( void * ) packet + packet->data_start, data, length );
54	if( packet->data_start + length > packet->data_end ){	54	if( packet->data_start + length > packet->data_end ){
55	packet->data_end = packet->data_start + length;	55	packet->data_end = packet->data_start + length;
56	}	56	}
57	return EOK;	57	return EOK;
58	}	58	}
59		59
60	void * packet_prefix( packet_t packet, size_t length ){	60	void * packet_prefix( packet_t packet, size_t length ){
61	if(( ! packet_is_valid( packet )) \|\| ( packet->data_start - sizeof( struct packet ) - 2 * ( packet->dest_addr - packet->src_addr ) < length )) return NULL;	61	if(( ! packet_is_valid( packet )) \|\| ( packet->data_start - sizeof( struct packet ) - 2 * ( packet->dest_addr - packet->src_addr ) < length )) return NULL;
62	packet->data_start -= length;	62	packet->data_start -= length;
63	return ( void * ) packet + packet->data_start;	63	return ( void * ) packet + packet->data_start;
64	}	64	}
65		65
66	void * packet_suffix( packet_t packet, size_t length ){	66	void * packet_suffix( packet_t packet, size_t length ){
67	if(( ! packet_is_valid( packet )) \|\| ( packet->data_end + length >= packet->length )) return NULL;	67	if(( ! packet_is_valid( packet )) \|\| ( packet->data_end + length >= packet->length )) return NULL;
68	packet->data_end += length;	68	packet->data_end += length;
69	return ( void * ) packet + packet->data_end - length;	69	return ( void * ) packet + packet->data_end - length;
70	}	70	}
71		71
72	int packet_trim( packet_t packet, size_t prefix, size_t suffix ){	72	int packet_trim( packet_t packet, size_t prefix, size_t suffix ){
73	if( ! packet_is_valid( packet )) return EINVAL;	73	if( ! packet_is_valid( packet )) return EINVAL;
74	if( prefix + suffix > packet->data_end - packet->data_start ) return ENOMEM;	74	if( prefix + suffix > PACKET_DATA_LENGTH( packet )) return ENOMEM;
75	packet->data_start += prefix;	75	packet->data_start += prefix;
76	packet->data_end -= suffix;	76	packet->data_end -= suffix;
77	return EOK;	77	return EOK;
78	}	78	}
79		79
80	packet_id_t packet_get_id( const packet_t packet ){	80	packet_id_t packet_get_id( const packet_t packet ){
81	return packet_is_valid( packet ) ? packet->packet_id : 0;	81	return packet_is_valid( packet ) ? packet->packet_id : 0;
82	}	82	}
83		83
84	int packet_get_addr( const packet_t packet, uint8_t src, uint8_t dest ){	84	int packet_get_addr( const packet_t packet, uint8_t src, uint8_t dest ){
85	if( ! packet_is_valid( packet )) return EINVAL;	85	if( ! packet_is_valid( packet )) return EINVAL;
86	if( ! packet->addr_len ) return 0;	86	if( ! packet->addr_len ) return 0;
87	if( src ) * src = ( void * ) packet + packet->src_addr;	87	if( src ) * src = ( void * ) packet + packet->src_addr;
88	if( dest ) * dest = ( void * ) packet + packet->dest_addr;	88	if( dest ) * dest = ( void * ) packet + packet->dest_addr;
89	return packet->addr_len;	89	return packet->addr_len;
90	}	90	}
91		91
92	size_t packet_get_data_length( const packet_t packet ){	92	size_t packet_get_data_length( const packet_t packet ){
93	if( ! packet_is_valid( packet )) return 0;	93	if( ! packet_is_valid( packet )) return 0;
94	return packet->data_end - packet->data_start;	94	return PACKET_DATA_LENGTH( packet );
95	}	95	}
96		96
97	void * packet_get_data( const packet_t packet ){	97	void * packet_get_data( const packet_t packet ){
98	if( ! packet_is_valid( packet )) return NULL;	98	if( ! packet_is_valid( packet )) return NULL;
99	return ( void * ) packet + packet->data_start;	99	return ( void * ) packet + packet->data_start;
100	}	100	}
101		101
102	int packet_set_addr( packet_t packet, const uint8_t * src, const uint8_t * dest, size_t addr_len ){	102	int packet_set_addr( packet_t packet, const uint8_t * src, const uint8_t * dest, size_t addr_len ){
103	size_t padding;	103	size_t padding;
104	size_t allocated;	104	size_t allocated;
105		105
106	if( ! packet_is_valid( packet )) return EINVAL;	106	if( ! packet_is_valid( packet )) return EINVAL;
107	allocated = packet->dest_addr - packet->src_addr;	107	allocated = PACKET_MAX_ADDRESS_LENGTH( packet );
108	if( allocated < addr_len ) return ENOMEM;	108	if( allocated < addr_len ) return ENOMEM;
109	padding = allocated - addr_len;	109	padding = allocated - addr_len;
110	packet->addr_len = addr_len;	110	packet->addr_len = addr_len;
111	if( src ){	111	if( src ){
112	memcpy(( void * ) packet + packet->src_addr, src, addr_len );	112	memcpy(( void * ) packet + packet->src_addr, src, addr_len );
113	if( padding ) bzero(( void * ) packet + packet->src_addr + addr_len, padding );	113	if( padding ) bzero(( void * ) packet + packet->src_addr + addr_len, padding );
114	}else{	114	}else{
115	bzero(( void * ) packet + packet->src_addr, allocated );	115	bzero(( void * ) packet + packet->src_addr, allocated );
116	}	116	}
117	if( dest ){	117	if( dest ){
118	memcpy(( void * ) packet + packet->dest_addr, dest, addr_len );	118	memcpy(( void * ) packet + packet->dest_addr, dest, addr_len );
119	if( padding ) bzero(( void * ) packet + packet->dest_addr + addr_len, padding );	119	if( padding ) bzero(( void * ) packet + packet->dest_addr + addr_len, padding );
120	}else{	120	}else{
121	bzero(( void * ) packet + packet->dest_addr, allocated );	121	bzero(( void * ) packet + packet->dest_addr, allocated );
122	}	122	}
123	return EOK;	123	return EOK;
124	}	124	}
-		125
-		126	packet_t packet_get_copy( int phone, packet_t packet ){
-		127	packet_t copy;
-		128	uint8_t * src;
-		129	uint8_t * dest;
-		130	size_t addrlen;
-		131
-		132	if( ! packet_is_valid( packet )) return NULL;
-		133	// get a new packet
-		134	copy = packet_get_4( phone, PACKET_DATA_LENGTH( packet ), PACKET_MAX_ADDRESS_LENGTH( packet ), packet->max_prefix, PACKET_MIN_SUFFIX( packet ));
-		135	if( ! copy ) return NULL;
-		136	// get addresses
-		137	addrlen = packet_get_addr( packet, & src, & dest );
-		138	// copy data
-		139	if(( packet_copy_data( copy, packet_get_data( packet ), PACKET_DATA_LENGTH( packet )) == EOK )
-		140	// copy addresses if present
-		141	&& (( addrlen <= 0 ) \|\| ( packet_set_addr( copy, src, dest, addrlen ) == EOK ))){
-		142	copy->order = packet->order;
-		143	copy->metric = packet->metric;
-		144	return copy;
-		145	}else{
-		146	pq_release( phone, copy->packet_id );
-		147	return NULL;
-		148	}
-		149	}
125		150
126	/** @}	151	/** @}
127	*/	152	*/
128		153

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/net/structures/packet/packet_client.c @ 4243 – Rev 4505 → 4731