1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
|
/*
* xdr.c
* -----
* Serialization/deserialization routines, using XDR (RFC 4506) encoding.
*
* Copyright (c) 2016, NORDUnet A/S 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.
*
* - Neither the name of the NORDUnet nor the names of its contributors may
* be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT
* HOLDER OR CONTRIBUTORS 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.
*/
#include <stdio.h>
#include <stdint.h>
#include <string.h> /* memcpy, memset */
#ifndef STM32F4XX
#include <arpa/inet.h> /* htonl/ntohl */
#else
/* htonl is not available in arm-none-eabi headers or libc */
#ifdef __ARMEL__ /* little endian */
static inline uint32_t htonl(uint32_t w)
{
return
((w & 0x000000ff) << 24) +
((w & 0x0000ff00) << 8) +
((w & 0x00ff0000) >> 8) +
((w & 0xff000000) >> 24);
}
#else
#define htonl(x) (x)
#endif
#define ntohl htonl
#endif
#include "hal.h"
#include "xdr_internal.h"
/* encode/decode_int. This covers int, unsigned int, enum, and bool types,
* which are all encoded as 32-bit big-endian fields. Signed integers are
* defined to use two's complement, but that's universal these days, yes?
*/
hal_error_t hal_xdr_encode_int(uint8_t ** const outbuf, const uint8_t * const limit, const uint32_t value)
{
/* arg checks */
if (outbuf == NULL || *outbuf == NULL || limit == NULL)
return HAL_ERROR_BAD_ARGUMENTS;
/* buffer overflow check */
if (limit - *outbuf < sizeof(value))
return HAL_ERROR_IO_BAD_COUNT;
**(uint32_t **)outbuf = htonl(value);
*outbuf += sizeof(value);
return HAL_OK;
}
hal_error_t hal_xdr_decode_int(uint8_t **inbuf, const uint8_t * const limit, uint32_t *value)
{
/* arg checks */
if (inbuf == NULL || *inbuf == NULL || limit == NULL || value == NULL)
return HAL_ERROR_BAD_ARGUMENTS;
/* buffer overflow check */
if (limit - *inbuf < sizeof(*value))
return HAL_ERROR_IO_BAD_COUNT;
*value = ntohl(**(uint32_t **)inbuf);
*inbuf += sizeof(*value);
return HAL_OK;
}
/* encode/decode_buffer. This covers variable-length string and opaque types.
* The data is preceded by a 4-byte length word (encoded as above), and padded
* to a multiple of 4 bytes as necessary.
*/
hal_error_t hal_xdr_encode_buffer(uint8_t **outbuf, const uint8_t * const limit, const uint8_t *value, const uint32_t len)
{
hal_error_t ret;
/* arg checks */
if (outbuf == NULL || *outbuf == NULL || limit == NULL ||
(value == NULL && len != 0))
return HAL_ERROR_BAD_ARGUMENTS;
/* buffer overflow check */
if ((limit - *outbuf) < (((len + 3) & ~3) + sizeof(len)))
return HAL_ERROR_IO_BAD_COUNT;
/* encode length */
if ((ret = hal_xdr_encode_int(outbuf, limit, len)) != HAL_OK)
return ret;
/* write the string or opaque data */
memcpy(*outbuf, value, len);
*outbuf += len;
/* pad if necessary */
if (len & 3) {
size_t n = 4 - (len & 3);
memset(*outbuf, 0, n);
*outbuf += n;
}
return HAL_OK;
}
/* This version returns a pointer to the data in the input buffer.
* It is used in the rpc server.
*/
hal_error_t hal_xdr_decode_buffer_in_place(uint8_t **inbuf, const uint8_t * const limit, uint8_t ** const value, uint32_t * const len)
{
hal_error_t ret;
uint32_t xdr_len;
uint8_t *orig_inbuf = *inbuf;
/* arg checks */
if (inbuf == NULL || *inbuf == NULL || limit == NULL || value == NULL || len == NULL)
return HAL_ERROR_BAD_ARGUMENTS;
/* decode the length */
if ((ret = hal_xdr_decode_int(inbuf, limit, &xdr_len)) != HAL_OK)
return ret;
/* input and output buffer overflow checks vs decoded length */
/* decoded length is past the end of the input buffer;
* we're probably out of sync, but nothing we can do now
*/
if (limit - *inbuf < xdr_len) {
/* undo read of length */
*inbuf = orig_inbuf;
return HAL_ERROR_IO_BAD_COUNT;
}
/* user buffer is too small, update *len
*/
if (*len < xdr_len) {
*len = xdr_len;
/* undo read of length */
*inbuf = orig_inbuf;
return HAL_ERROR_IO_BAD_COUNT;
}
/* return a pointer to the string or opaque data */
*value = *inbuf;
*len = xdr_len;
/* update the buffer pointer, skipping any padding bytes */
*inbuf += (xdr_len + 3) & ~3;
return HAL_OK;
}
/* This version copies the data to the user-supplied buffer.
* It is used in the rpc client.
*/
hal_error_t hal_xdr_decode_buffer(uint8_t **inbuf, const uint8_t * const limit, uint8_t * const value, uint32_t * const len)
{
hal_error_t ret;
uint8_t *vptr;
if ((ret = hal_xdr_decode_buffer_in_place(inbuf, limit, &vptr, len)) == HAL_OK)
memcpy(value, vptr, *len);
return ret;
}
/* ---------------------------------------------------------------- */
#ifdef TEST
void hexdump(uint8_t *buf, uint32_t len)
{
int i;
for (i = 0; i < len; ++i) {
uint8_t c = buf[i];
printf("%02x ", c);
if ((i & 0x07) == 0x07)
printf("\n");
}
if ((len & 0x07) != 0)
printf("\n");
}
int main(int argc, char *argv[])
{
uint32_t i;
uint8_t buf[64] = {0};
uint8_t *bufptr = buf, *readptr;
uint8_t *limit = buf + sizeof(buf);
hal_error_t ret;
uint8_t alphabet[] = "abcdefghijklmnopqrstuvwxyz";
uint8_t readbuf[64] = {0};
printf("hal_xdr_encode_int: work to failure\n");
for (i = 1; i < 100; ++i) {
if ((ret = hal_xdr_encode_int(&bufptr, limit, i)) != HAL_OK) {
printf("%d: %s\n", i, hal_error_string(ret));
break;
}
}
hexdump(buf, ((uint8_t *)bufptr - buf));
printf("\nhal_xdr_decode_int:\n");
readptr = buf;
while (readptr < bufptr) {
if ((ret = hal_xdr_decode_int(&readptr, limit, &i)) != HAL_OK) {
printf("%s\n", hal_error_string(ret));
break;
}
printf("%u ", i);
}
printf("\n");
printf("\nhal_xdr_encode_buffer: work to failure\n");
memset(buf, 0, sizeof(buf));
bufptr = buf;
for (i = 1; i < 10; ++i) {
if ((ret = hal_xdr_encode_buffer(&bufptr, limit, alphabet, i)) != HAL_OK) {
printf("%d: %s\n", i, hal_error_string(ret));
break;
}
}
hexdump(buf, ((uint8_t *)bufptr - buf));
printf("\nhal_xdr_decode_buffer:\n");
readptr = buf;
i = sizeof(readbuf);
while (readptr < bufptr) {
if ((ret = hal_xdr_decode_buffer(&readptr, limit, readbuf, &i)) != HAL_OK) {
printf("%s\n", hal_error_string(ret));
break;
}
printf("%u: ", i); for (int j = 0; j < i; ++j) putchar(readbuf[j]); putchar('\n');
i = sizeof(readbuf);
memset(readbuf, 0, sizeof(readbuf));
}
return 0;
}
#endif
|