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 <async.h>
#include <errno.h>
#include <mem.h>
#include <unistd.h>
//#include <stdio.h>
 
 
#include <ipc/ipc.h>
#include <sys/mman.h>
 
#include "../../err.h"
#include "../../messages.h"
 
#include "packet.h"
#include "packet_header.h"
#include "packet_client.h"
 
/** Obtains the packet from the packet server as the shared memory block.
 *  Creates the local packet mapping as well.
 *  @param phone The packet server module phone. Input parameter.
 *  @param packet The packet reference pointer to store the received packet reference. Output parameter.
 *  @param packet_id The packet identifier. Input parameter.
 *  @param size The packet total size in bytes. Input parameter.
 *  @returns EOK on success.
 *  \todo ipc_share_in_start() error?
 *  @returns Other error codes as defined for the pm_add() function.
 */
int packet_return( int phone, packet_ref packet, packet_id_t packet_id, size_t size );
 
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->addr_len < 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_end - packet->data_start ) 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 ) && src && dest )) return EINVAL;
    if( ! packet->addr_len ) return 0;
    * src = ( void * ) packet + packet->src_addr;
    * 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_end - packet->data_start;
}
 
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;
 
    if( ! packet_is_valid( packet )) return EINVAL;
    if( packet->addr_len >= addr_len ) return ENOMEM;
    padding = packet->addr_len - addr_len;
    if( src ){
        memcpy(( void * ) packet + packet->src_addr, src, addr_len );
        bzero(( void * ) packet + packet->src_addr + addr_len, padding );
    }else{
        bzero(( void * ) packet + packet->src_addr + addr_len, packet->addr_len );
    }
    if( dest ){
        memcpy(( void * ) packet + packet->dest_addr, dest, addr_len );
        bzero(( void * ) packet + packet->dest_addr + addr_len, padding );
    }else{
        bzero(( void * ) packet + packet->dest_addr + addr_len, packet->addr_len );
    }
    return EOK;
}
 
int packet_translate( int phone, packet_ref packet, packet_id_t packet_id ){
    ERROR_DECLARE;
 
    unsigned int        size;
 
    if( ! packet ) return EINVAL;
    * packet = pm_find( packet_id );
    if( * packet ) return EOK;
    ERROR_PROPAGATE( async_req_1_1( phone, NET_PACKET_GET_SIZE, packet_id, & size ));
    return packet_return( phone, packet, packet_id, size );
}
 
int packet_return( int phone, packet_ref packet, packet_id_t packet_id, size_t size ){
    ERROR_DECLARE;
 
    aid_t       message;
    ipc_call_t  answer;
    ipcarg_t    result;
 
    message = async_send_1( phone, NET_PACKET_GET, packet_id, & answer );
    * packet = ( packet_t ) as_get_mappable_page( size );
    if( ERROR_OCCURRED( ipc_share_in_start_0_0( phone, * packet, size ))
    || ERROR_OCCURRED( pm_add( * packet ))){
        munmap( * packet, size );
        async_wait_for( message, NULL );
        return ERROR_CODE;
    }
    async_wait_for( message, & result );
    return result;
}
 
packet_t packet_get_4( int phone, size_t max_content, size_t addr_len, size_t max_prefix, size_t max_suffix ){
    ERROR_DECLARE;
 
    packet_id_t packet_id;
    unsigned int size;
    packet_t packet;
 
    if( ERROR_OCCURRED( async_req_4_2( phone, NET_PACKET_CREATE_4, max_content, addr_len, max_prefix, max_suffix, & packet_id, & size ))
    || ERROR_OCCURRED( packet_return( phone, & packet, packet_id, size ))){
        return NULL;
    }
    return packet;
}
 
packet_t packet_get_1( int phone, size_t content ){
    ERROR_DECLARE;
 
    packet_id_t packet_id;
    unsigned int    size;
    packet_t    packet;
 
    if( ERROR_OCCURRED( async_req_1_2( phone, NET_PACKET_CREATE_1, content, & packet_id, & size ))
    || ERROR_OCCURRED( packet_return( phone, & packet, packet_id, size ))){
        return NULL;
    }
    return packet;
}
 
void pq_release( int phone, packet_id_t packet_id ){
    async_msg_1( phone, NET_PACKET_RELEASE, packet_id );
}
 
/** @}
 */
 

Rev 3990	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 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 <async.h>	37	#include <async.h>
38	#include <errno.h>	38	#include <errno.h>
-		39	#include <mem.h>
39	#include <unistd.h>	40	#include <unistd.h>
40	//#include <stdio.h>	41	//#include <stdio.h>
41	#include <string.h>	-
42		42
43	#include <ipc/ipc.h>	43	#include <ipc/ipc.h>
44	#include <sys/mman.h>	44	#include <sys/mman.h>
45		45
46	#include "../../err.h"	46	#include "../../err.h"
47	#include "../../messages.h"	47	#include "../../messages.h"
48		48
49	#include "packet.h"	49	#include "packet.h"
50	#include "packet_header.h"	50	#include "packet_header.h"
51	#include "packet_client.h"	51	#include "packet_client.h"
52		52
53	/** Obtains the packet from the packet server as the shared memory block.	53	/** Obtains the packet from the packet server as the shared memory block.
54	* Creates the local packet mapping as well.	54	* Creates the local packet mapping as well.
55	* @param phone The packet server module phone. Input parameter.	55	* @param phone The packet server module phone. Input parameter.
56	* @param packet The packet reference pointer to store the received packet reference. Output parameter.	56	* @param packet The packet reference pointer to store the received packet reference. Output parameter.
57	* @param packet_id The packet identifier. Input parameter.	57	* @param packet_id The packet identifier. Input parameter.
58	* @param size The packet total size in bytes. Input parameter.	58	* @param size The packet total size in bytes. Input parameter.
59	* @returns EOK on success.	59	* @returns EOK on success.
60	* \todo ipc_share_in_start() error?	60	* \todo ipc_share_in_start() error?
61	* @returns Other error codes as defined for the pm_add() function.	61	* @returns Other error codes as defined for the pm_add() function.
62	*/	62	*/
63	int packet_return( int phone, packet_ref packet, packet_id_t packet_id, size_t size );	63	int packet_return( int phone, packet_ref packet, packet_id_t packet_id, size_t size );
64		64
65	int packet_copy_data( packet_t packet, const void * data, size_t length ){	65	int packet_copy_data( packet_t packet, const void * data, size_t length ){
66	if( ! packet_is_valid( packet )) return EINVAL;	66	if( ! packet_is_valid( packet )) return EINVAL;
67	if( packet->data_start + length >= packet->length ) return ENOMEM;	67	if( packet->data_start + length >= packet->length ) return ENOMEM;
68	memcpy(( void * ) packet + packet->data_start, data, length );	68	memcpy(( void * ) packet + packet->data_start, data, length );
69	if( packet->data_start + length > packet->data_end ){	69	if( packet->data_start + length > packet->data_end ){
70	packet->data_end = packet->data_start + length;	70	packet->data_end = packet->data_start + length;
71	}	71	}
72	return EOK;	72	return EOK;
73	}	73	}
74		74
75	void * packet_prefix( packet_t packet, size_t length ){	75	void * packet_prefix( packet_t packet, size_t length ){
76	if(( ! packet_is_valid( packet )) \|\| ( packet->data_start - sizeof( struct packet ) - 2 * packet->addr_len < length )) return NULL;	76	if(( ! packet_is_valid( packet )) \|\| ( packet->data_start - sizeof( struct packet ) - 2 * packet->addr_len < length )) return NULL;
77	packet->data_start -= length;	77	packet->data_start -= length;
78	return ( void * ) packet + packet->data_start;	78	return ( void * ) packet + packet->data_start;
79	}	79	}
80		80
81	void * packet_suffix( packet_t packet, size_t length ){	81	void * packet_suffix( packet_t packet, size_t length ){
82	if(( ! packet_is_valid( packet )) \|\| ( packet->data_end + length >= packet->length )) return NULL;	82	if(( ! packet_is_valid( packet )) \|\| ( packet->data_end + length >= packet->length )) return NULL;
83	packet->data_end += length;	83	packet->data_end += length;
84	return ( void * ) packet + packet->data_end - length;	84	return ( void * ) packet + packet->data_end - length;
85	}	85	}
86		86
87	int packet_trim( packet_t packet, size_t prefix, size_t suffix ){	87	int packet_trim( packet_t packet, size_t prefix, size_t suffix ){
88	if( ! packet_is_valid( packet )) return EINVAL;	88	if( ! packet_is_valid( packet )) return EINVAL;
89	if( prefix + suffix > packet->data_end - packet->data_start ) return ENOMEM;	89	if( prefix + suffix > packet->data_end - packet->data_start ) return ENOMEM;
90	packet->data_start += prefix;	90	packet->data_start += prefix;
91	packet->data_end -= suffix;	91	packet->data_end -= suffix;
92	return EOK;	92	return EOK;
93	}	93	}
94		94
95	packet_id_t packet_get_id( const packet_t packet ){	95	packet_id_t packet_get_id( const packet_t packet ){
96	return packet_is_valid( packet ) ? packet->packet_id : 0;	96	return packet_is_valid( packet ) ? packet->packet_id : 0;
97	}	97	}
98		98
99	int packet_get_addr( const packet_t packet, uint8_t src, uint8_t dest ){	99	int packet_get_addr( const packet_t packet, uint8_t src, uint8_t dest ){
100	if( !( packet_is_valid( packet ) && src && dest )) return EINVAL;	100	if( !( packet_is_valid( packet ) && src && dest )) return EINVAL;
101	if( ! packet->addr_len ) return 0;	101	if( ! packet->addr_len ) return 0;
102	* src = ( void * ) packet + packet->src_addr;	102	* src = ( void * ) packet + packet->src_addr;
103	* dest = ( void * ) packet + packet->dest_addr;	103	* dest = ( void * ) packet + packet->dest_addr;
104	return packet->addr_len;	104	return packet->addr_len;
105	}	105	}
106		106
107	size_t packet_get_data_length( const packet_t packet ){	107	size_t packet_get_data_length( const packet_t packet ){
108	if( ! packet_is_valid( packet )) return 0;	108	if( ! packet_is_valid( packet )) return 0;
109	return packet->data_end - packet->data_start;	109	return packet->data_end - packet->data_start;
110	}	110	}
111		111
112	void * packet_get_data( const packet_t packet ){	112	void * packet_get_data( const packet_t packet ){
113	if( ! packet_is_valid( packet )) return NULL;	113	if( ! packet_is_valid( packet )) return NULL;
114	return ( void * ) packet + packet->data_start;	114	return ( void * ) packet + packet->data_start;
115	}	115	}
116		116
117	int packet_set_addr( packet_t packet, const uint8_t * src, const uint8_t * dest, size_t addr_len ){	117	int packet_set_addr( packet_t packet, const uint8_t * src, const uint8_t * dest, size_t addr_len ){
118	size_t padding;	118	size_t padding;
119		119
120	if( ! packet_is_valid( packet )) return EINVAL;	120	if( ! packet_is_valid( packet )) return EINVAL;
121	if( packet->addr_len >= addr_len ) return ENOMEM;	121	if( packet->addr_len >= addr_len ) return ENOMEM;
122	padding = packet->addr_len - addr_len;	122	padding = packet->addr_len - addr_len;
123	if( src ){	123	if( src ){
124	memcpy(( void * ) packet + packet->src_addr, src, addr_len );	124	memcpy(( void * ) packet + packet->src_addr, src, addr_len );
125	memset(( void * ) packet + packet->src_addr + addr_len, 0, padding );	125	bzero(( void * ) packet + packet->src_addr + addr_len, padding );
126	}else{	126	}else{
127	memset(( void * ) packet + packet->src_addr + addr_len, 0, packet->addr_len );	127	bzero(( void * ) packet + packet->src_addr + addr_len, packet->addr_len );
128	}	128	}
129	if( dest ){	129	if( dest ){
130	memcpy(( void * ) packet + packet->dest_addr, dest, addr_len );	130	memcpy(( void * ) packet + packet->dest_addr, dest, addr_len );
131	memset(( void * ) packet + packet->dest_addr + addr_len, 0, padding );	131	bzero(( void * ) packet + packet->dest_addr + addr_len, padding );
132	}else{	132	}else{
133	memset(( void * ) packet + packet->dest_addr + addr_len, 0, packet->addr_len );	133	bzero(( void * ) packet + packet->dest_addr + addr_len, packet->addr_len );
134	}	134	}
135	return EOK;	135	return EOK;
136	}	136	}
137		137
138	int packet_translate( int phone, packet_ref packet, packet_id_t packet_id ){	138	int packet_translate( int phone, packet_ref packet, packet_id_t packet_id ){
139	ERROR_DECLARE;	139	ERROR_DECLARE;
140		140
141	unsigned int size;	141	unsigned int size;
142		142
143	if( ! packet ) return EINVAL;	143	if( ! packet ) return EINVAL;
144	* packet = pm_find( packet_id );	144	* packet = pm_find( packet_id );
145	if( * packet ) return EOK;	145	if( * packet ) return EOK;
146	ERROR_PROPAGATE( async_req_1_1( phone, NET_PACKET_GET_SIZE, packet_id, & size ));	146	ERROR_PROPAGATE( async_req_1_1( phone, NET_PACKET_GET_SIZE, packet_id, & size ));
147	return packet_return( phone, packet, packet_id, size );	147	return packet_return( phone, packet, packet_id, size );
148	}	148	}
149		149
150	int packet_return( int phone, packet_ref packet, packet_id_t packet_id, size_t size ){	150	int packet_return( int phone, packet_ref packet, packet_id_t packet_id, size_t size ){
151	ERROR_DECLARE;	151	ERROR_DECLARE;
152		152
153	aid_t message;	153	aid_t message;
154	ipc_call_t answer;	154	ipc_call_t answer;
155	ipcarg_t result;	155	ipcarg_t result;
156		156
157	message = async_send_1( phone, NET_PACKET_GET, packet_id, & answer );	157	message = async_send_1( phone, NET_PACKET_GET, packet_id, & answer );
158	* packet = ( packet_t ) as_get_mappable_page( size );	158	* packet = ( packet_t ) as_get_mappable_page( size );
159	if( ERROR_OCCURRED( ipc_share_in_start_0_0( phone, * packet, size ))	159	if( ERROR_OCCURRED( ipc_share_in_start_0_0( phone, * packet, size ))
160	\|\| ERROR_OCCURRED( pm_add( * packet ))){	160	\|\| ERROR_OCCURRED( pm_add( * packet ))){
161	munmap( * packet, size );	161	munmap( * packet, size );
162	async_wait_for( message, NULL );	162	async_wait_for( message, NULL );
163	return ERROR_CODE;	163	return ERROR_CODE;
164	}	164	}
165	async_wait_for( message, & result );	165	async_wait_for( message, & result );
166	return result;	166	return result;
167	}	167	}
168		168
169	packet_t packet_get_4( int phone, size_t max_content, size_t addr_len, size_t max_prefix, size_t max_suffix ){	169	packet_t packet_get_4( int phone, size_t max_content, size_t addr_len, size_t max_prefix, size_t max_suffix ){
170	ERROR_DECLARE;	170	ERROR_DECLARE;
171		171
172	packet_id_t packet_id;	172	packet_id_t packet_id;
173	unsigned int size;	173	unsigned int size;
174	packet_t packet;	174	packet_t packet;
175		175
176	if( ERROR_OCCURRED( async_req_4_2( phone, NET_PACKET_CREATE_4, max_content, addr_len, max_prefix, max_suffix, & packet_id, & size ))	176	if( ERROR_OCCURRED( async_req_4_2( phone, NET_PACKET_CREATE_4, max_content, addr_len, max_prefix, max_suffix, & packet_id, & size ))
177	\|\| ERROR_OCCURRED( packet_return( phone, & packet, packet_id, size ))){	177	\|\| ERROR_OCCURRED( packet_return( phone, & packet, packet_id, size ))){
178	return NULL;	178	return NULL;
179	}	179	}
180	return packet;	180	return packet;
181	}	181	}
182		182
183	packet_t packet_get_1( int phone, size_t content ){	183	packet_t packet_get_1( int phone, size_t content ){
184	ERROR_DECLARE;	184	ERROR_DECLARE;
185		185
186	packet_id_t packet_id;	186	packet_id_t packet_id;
187	unsigned int size;	187	unsigned int size;
188	packet_t packet;	188	packet_t packet;
189		189
190	if( ERROR_OCCURRED( async_req_1_2( phone, NET_PACKET_CREATE_1, content, & packet_id, & size ))	190	if( ERROR_OCCURRED( async_req_1_2( phone, NET_PACKET_CREATE_1, content, & packet_id, & size ))
191	\|\| ERROR_OCCURRED( packet_return( phone, & packet, packet_id, size ))){	191	\|\| ERROR_OCCURRED( packet_return( phone, & packet, packet_id, size ))){
192	return NULL;	192	return NULL;
193	}	193	}
194	return packet;	194	return packet;
195	}	195	}
196		196
197	void packet_release( int phone, packet_id_t packet_id ){	197	void pq_release( int phone, packet_id_t packet_id ){
198	async_msg_1( phone, NET_PACKET_RELEASE, packet_id );	198	async_msg_1( phone, NET_PACKET_RELEASE, packet_id );
199	}	199	}
200		200
201	/** @}	201	/** @}
202	*/	202	*/
203		203

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/net/structures/packet/packet_client.c – Rev 3990 → 4192