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
|
/* Decode a message using map field */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pb_decode.h>
#include "map.pb.h"
#include "test_helpers.h"
#include "unittests.h"
/* Helper function to find an entry in the list. Not as efficient as a real
* hashmap or similar would be, but suitable for small arrays. */
MyMessage_NumbersEntry *find_entry(MyMessage *msg, const char *key)
{
int i;
for (i = 0; i < msg->numbers_count; i++)
{
if (strcmp(msg->numbers[i].key, key) == 0)
{
return &msg->numbers[i];
}
}
return NULL;
}
int main(int argc, char **argv)
{
uint8_t buffer[MyMessage_size];
size_t count;
SET_BINARY_MODE(stdin);
count = fread(buffer, 1, sizeof(buffer), stdin);
if (!feof(stdin))
{
printf("Message does not fit in buffer\n");
return 1;
}
{
int status = 0;
MyMessage msg = MyMessage_init_zero;
MyMessage_NumbersEntry *e;
pb_istream_t stream = pb_istream_from_buffer(buffer, count);
if (!pb_decode(&stream, MyMessage_fields, &msg))
{
fprintf(stderr, "Decoding failed\n");
return 2;
}
TEST((e = find_entry(&msg, "one")) && e->value == 1);
TEST((e = find_entry(&msg, "two")) && e->value == 2);
TEST((e = find_entry(&msg, "seven")) && e->value == 7);
TEST(!find_entry(&msg, "zero"));
return status;
}
}
|
