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