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
|
/*
Copyright (C) 2015-2018 Red Hat, Inc.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, see <http://www.gnu.org/licenses/>.
*/
#include <config.h>
#include <glib.h>
#include <string.h>
#include <common/marshaller.h>
#include <common/demarshallers.h>
#include "generated_test_enums.h"
#include "generated_test_marshallers.h"
#ifndef g_assert_true
#define g_assert_true g_assert
#endif
#define NUM_CHANNELS 3u
static void test_overflow(SpiceMarshaller *m)
{
SpiceMsgChannels *msg;
uint8_t *data, *out;
size_t len;
int to_free = 0;
spice_parse_channel_func_t func;
unsigned int max_message_type, n;
message_destructor_t free_output;
msg = (SpiceMsgChannels *) malloc(sizeof(SpiceMsgChannels) +
NUM_CHANNELS * sizeof(uint16_t));
g_assert_nonnull(msg);
// build a message and marshal it
msg->num_of_channels = NUM_CHANNELS;
for (n = 0; n < NUM_CHANNELS; ++n) {
msg->channels[n] = n + 1;
}
spice_marshall_msg_main_channels_list(m, msg);
// get linear data
data = spice_marshaller_linearize(m, 0, &len, &to_free);
g_assert_nonnull(data);
printf("output len %lu\n", (unsigned long) len);
// hack: setting the number of channels in the marshalled message to a
// value that will cause overflow while parsing the message to make sure
// that the parser can handle this situation
*((uint32_t *) data) = 0x80000002u;
// extract the message
func = spice_get_server_channel_parser(SPICE_CHANNEL_MAIN, &max_message_type);
g_assert_nonnull(func);
out = func(data, data+len, SPICE_MSG_MAIN_CHANNELS_LIST, 0, &len, &free_output);
g_assert_null(out);
// cleanup
if (to_free) {
free(data);
}
if (out) {
free_output(out);
}
free(msg);
}
static uint8_t expected_data[] = { 123, /* dummy byte */
0x02, 0x00, 0x00, 0x00, /* data_size */
0x09, 0x00, 0x00, 0x00, /* data offset */
0xef, 0xcd, 0xab, 0x90, 0x78, 0x56, 0x34, 0x12, /* data */
0x21, 0x43, 0x65, 0x87, 0x09, 0xba, 0xdc, 0xfe, /* data */
};
typedef void (*message_destructor_t)(uint8_t *message);
uint8_t * spice_parse_msg(uint8_t *message_start, uint8_t *message_end,
uint32_t channel, uint16_t message_type, int minor,
size_t *size_out, message_destructor_t *free_message);
int main(void)
{
SpiceMarshaller *marshaller;
SpiceMsgMainShortDataSubMarshall *msg;
size_t len, msg_len;
int free_res;
uint8_t *data;
message_destructor_t free_message;
msg = g_new0(SpiceMsgMainShortDataSubMarshall, 1);
msg->data = g_new(uint64_t, 2);
msg->dummy_byte = 123;
msg->data_size = 2;
msg->data[0] = 0x1234567890abcdef;
msg->data[1] = 0xfedcba0987654321;
marshaller = spice_marshaller_new();
spice_marshall_msg_main_ShortDataSubMarshall(marshaller, msg);
spice_marshaller_flush(marshaller);
data = spice_marshaller_linearize(marshaller, 0, &len, &free_res);
g_assert_cmpint(len, ==, G_N_ELEMENTS(expected_data));
g_assert_true(memcmp(data, expected_data, len) == 0);
g_free(msg->data);
g_free(msg);
// test demarshaller
msg = (SpiceMsgMainShortDataSubMarshall *)
spice_parse_msg(data, data + len, SPICE_CHANNEL_MAIN, SPICE_MSG_MAIN_SHORTDATASUBMARSHALL,
0, &msg_len, &free_message);
g_assert_nonnull(msg);
g_assert_cmpint(msg->dummy_byte, ==, 123);
g_assert_cmpint(msg->data_size, ==, 2);
g_assert_nonnull(msg->data);
g_assert_cmpint(msg->data[0], ==, 0x1234567890abcdef);
g_assert_cmpint(msg->data[1], ==, 0xfedcba0987654321);
free_message((uint8_t *) msg);
if (free_res) {
free(data);
}
spice_marshaller_reset(marshaller);
SpiceMsgMainZeroes msg_zeroes = { 0x0102 };
spice_marshall_msg_main_Zeroes(marshaller, &msg_zeroes);
spice_marshaller_flush(marshaller);
data = spice_marshaller_linearize(marshaller, 0, &len, &free_res);
g_assert_cmpint(len, ==, 7);
g_assert_true(memcmp(data, "\x00\x02\x01\x00\x00\x00\x00", 7) == 0);
if (free_res) {
free(data);
}
test_overflow(marshaller);
len = 4;
data = g_new0(uint8_t, len);
memset(data, 0, len);
msg = (SpiceMsgMainShortDataSubMarshall *) spice_parse_msg(data, data + len, 1, 3, 0,
&msg_len, &free_message);
g_assert_null(msg);
g_free(data);
spice_marshaller_destroy(marshaller);
return 0;
}
|
